uTox/0000700000175000001440000000000014003056553010500 5ustar rakusersuTox/tools/0000700000175000001440000000000014003056216011634 5ustar rakusersuTox/tools/update-changelog.sh0000700000175000001440000000036314003056216015404 0ustar rakusers#!/bin/sh TOKEN=$(git config --get user.token) if [ -z "$TOKEN" ]; then echo "Please add your github token to user.token" echo "Run git config --local user.token [token]" exit 1 fi github_changelog_generator -u uTox -t "$TOKEN" uTox/tools/update-bootstrap.py0000600000175000001440000001162014003056216015505 0ustar rakusers# # Update bootstrap nodes # # This script is used to generate src/tox_bootstrap.h by adding a list # of bootstrap nodes from https://nodes.tox.chat/ # # It should be executed on a regular basis (before a release) to make sure # the list is up to date and contains active bootstrap nodes. # This will make sure clients can connect to the network quickly and do not have to waste # time trying to connect to nodes that do no longer exist. # # You can run the script like this: # # python3 tools/update-bootstrap.py > src/tox_bootstrap.h # # Status information will be printed to stderr. # import http.client import json from datetime import datetime import re import sys # print for stderr def eprint(*args, **kwargs): print(*args, file=sys.stderr, **kwargs) # check whether arg is an IP or a hostname def is_ip(ip): # these are not exactly nice patterns but the are sufficient to distinguish IP from hostname ipv4 = re.compile("^\\d+\\.\\d+\\.\\d+\\.\\d+$") ipv6 = re.compile("^[0-9a-f:]+$") return ipv4.match(ip) or ipv6.match(ip) # select a tcp port from a given range, use 443 if available def select_tcp_port(ports): if ports.count(443) > 0: return 443 else: return ports[0] # http://stackoverflow.com/questions/18854620/whats-the-best-way-to-split-a-string-into-fixed-length-chunks-and-work-with-the#18854817 def chunkstring(string, length): return (string[0+i:length+i] for i in range(0, len(string), length)) # get latest node data connection = http.client.HTTPSConnection('nodes.tox.chat') connection.request('GET', '/json') response = connection.getresponse() nodeData = response.read().decode() data = json.loads(nodeData) # print some info eprint("Last scan: " + datetime.fromtimestamp(data.get('last_scan')).isoformat(' ')) eprint("Last refresh: " + datetime.fromtimestamp(data.get('last_refresh')).isoformat(' ')) eprint("Nodes: " + len(data.get('nodes')).__str__()) # filter out offline nodes # only keep nodes that are active on tcp and udp # also filter nodes that specify a hostname instead of IP # we do not want utox to make DNS queries # some of those are on a DynDNS so it does not even make sense to do the query in this script nodes = [] for n in data.get('nodes'): if not n.get('status_udp') or not n.get('status_tcp'): continue if is_ip(n.get('ipv4')): # eprint(n.get('ipv4'), " udp: " + n.get('port').__str__(), " tcp:", *n.get('tcp_ports')) # eprint(" pkey:", n.get('public_key')) nodes.append({ 'ip': n.get('ipv4'), 'ipv6': 'false', 'udp': n.get('port'), 'tcp': select_tcp_port(n.get('tcp_ports')), 'version': n.get('version'), 'pubkey': n.get('public_key'), 'maintainer': n.get('maintainer'), 'location': n.get('location'), }) if is_ip(n.get('ipv6')): # eprint(n.get('ipv6'), " udp: " + n.get('port').__str__(), " tcp:", *n.get('tcp_ports')) # eprint(" pkey:", n.get('public_key')) nodes.append({ 'ip': n.get('ipv6'), 'ipv6': 'true', 'udp': n.get('port'), 'tcp': select_tcp_port(n.get('tcp_ports')), 'version': n.get('version'), 'pubkey': n.get('public_key'), 'maintainer': n.get('maintainer'), 'location': n.get('location'), }) eprint("filtered offline and hostname-only nodes: ", len(nodes), "candidate entries") # sort by the following criteria: # - 1. sort by version, prefer nodes that are up to date # - 2. prefer low udp port, i.e. 443 gets listed higher # - 3. prefer tcp with port 443 over tcp without it eprint("sorting by criteria...") nodes = sorted(nodes, key = lambda n: (n.get('version'), -n.get('udp'), 1 if n.get('tcp') == 443 else 0), reverse=True) #f = open("tox_bootstrap.h.test", 'w') f = sys.stdout f.write("""#ifndef TOX_BOOTSTRAP_H #define TOX_BOOTSTRAP_H // // IMPORTANT: This file is generated by the /tools/update-bootstrap.py script, do not edit manually. // struct bootstrap_node { char *address; bool ipv6; uint16_t port_udp; uint16_t port_tcp; uint8_t key[32]; } bootstrap_nodes[] = { """) # use the first 32 nodes that match the criteria above k = 0 for n in nodes: if k >= 32: break eprint("adding ", n.get('ip'), " (", n.get('udp'), n.get('tcp'), ") by", n.get('maintainer') + ', ' + n.get('location'), "version: ", n.get('version')) f.write(" /* by " + n.get('maintainer') + ', ' + n.get('location') + " */\n") f.write(' { "' + n.get('ip') + '", ' + n.get('ipv6') + ', ' + n.get('udp').__str__() + ', ' + n.get('tcp').__str__() + ",\n") f.write(" {") i = 0 for p in chunkstring(n.get('pubkey'), 2): i += 1 if i > 16: f.write("\n ") i = 0 f.write(" 0x" + p + ",") f.write(" }\n },\n") k += 1 f.write(""" }; #endif """) f.close() eprint("added", k, "nodes.") uTox/tools/timediff.py0000600000175000001440000000074014003056216014000 0ustar rakusers# Tool for GitHub CI logs to prepend time diffs between lines. # # Processes lines from stdin or from the files passed via argv. # from datetime import datetime import fileinput prevdate = datetime(1970, 1, 1) for l in fileinput.input(): datestr = l.split(maxsplit=1)[0] datestr = datestr[:-2] + datestr[-1:] # hack to limit µsec precision date = datetime.strptime(datestr, "%Y-%m-%dT%H:%M:%S.%fZ") print(f"{date - prevdate} | {l}", end='') prevdate = date uTox/tools/sign-release.sh0000700000175000001440000000216714003056216014557 0ustar rakusers#!/bin/sh # set -e TAG=$(git describe --abbrev=0 --tags) USER=${USER:-$(git config --get user.name)} VERSION=${TAG#v} echo "Going to verify and sign releases." echo "" echo "" git diff --exit-code >> /dev/null || (echo "Working Dir not clean, this script won't work." && false) echo "" echo "Getting $TAG.zip" curl -LOs "https://github.com/uTox/uTox/archive/$TAG.zip" unzip -q "$TAG.zip" cp -r "uTox-$VERSION"/* . rm -r "uTox-$VERSION" echo "Checking $TAG.zip" if git diff --exit-code >> /dev/null; then echo "PASSED $TAG.zip" gpg --armor --detach-sign "$TAG.zip" mv "$TAG.zip.asc" "uTox-$TAG.$USER.zip.asc" rm "$TAG.zip" else echo "FAILED $TAG.zip" rm "$TAG.zip" fi echo "" echo "Getting $TAG.tar.gz" curl -LOs "https://github.com/uTox/uTox/archive/$TAG.tar.gz" tar xf "$TAG.tar.gz" cp -r "uTox-$VERSION"/* . rm -r "uTox-$VERSION" echo "Checking $TAG.tar.gz" if git diff --exit-code >> /dev/null; then echo "PASSED $TAG.tar.gz" gpg --armor --detach-sign "$TAG.tar.gz" mv "$TAG.tar.gz.asc" "uTox-$TAG.$USER.tar.gz.asc" rm "$TAG.tar.gz" else echo "FAILED $TAG.tar.gz" rm "$TAG.tar.gz" fi uTox/tools/relnotes_to_cstring.sed0000700000175000001440000000110214003056216016414 0ustar rakusers#!/bin/sed -f # This is a helper script to convert release notes written in Markdown # to C-strings for langs/*.h # This is not supposed to be perfect. # (@user) s/(@\([^)]*\))/(Thanks, \1!)/ # (commit) s/ ([ 0-9a-f]\+)// # escape " s/"/\\"/g # ## (Features:) → " \1\n" s/^## \(.*\)$/" \1\\n"/ # * (Fix …) → " \1\n" s/^* \(.*\)$/" \1\\n"/ # (-…) → " \1\n" s/^[[:space:]]\+\(-.*\)$/" \1\\n"/ # **(…)** → " \1\n" [important notes] s/^\*\*\(.*\)\*\*$/" \1\\n"/ # c-string the rest s/^\([^"].*\)$/"\1\\n"/ s/^$/"\\n"/ uTox/tools/hexdump_for_chatlogs.sh0000700000175000001440000000103314003056216016374 0ustar rakusers#!/usr/bin/zsh #TODO use the author length + msglength from hexdump to gener OFFSET=(14 150 15 22 110 24 17 47 98) HEADER='1/8 "Vers : %u \n" " Time : " 1/8 "%12u \n" 1/8 " Author: %12u \n" 1/8 " MsgLen: %12u \n" 1/1 " Flags : %12u \n" 1/1 " MSGTYP: %12u \n" 1/6 " \n"' I=1 START=0 NUM=40 for len in $OFFSET; do hexdump -s $START -n $NUM -v -e $HEADER log2.txt ((START=START+40)) ((START=START+len)) ((I++)) done hexdump -s $START -n $NUM -v -e $HEADER log2.txt ((START=START+40)) ((START=START+len)) ((I++)) uTox/tools/checksum.sh0000700000175000001440000000100614003056216013772 0ustar rakusers#!/bin/sh TAG=$(git describe --abbrev=0 --tags) curl -LOs "https://github.com/uTox/uTox/archive/$TAG.zip" curl -LOs "https://github.com/uTox/uTox/archive/$TAG.tar.gz" echo echo "md5" echo "-----------------------------------------" md5sum "$TAG.zip" md5sum "$TAG.tar.gz" echo "-----------------------------------------" echo echo "sha256" echo "-----------------------------------------" sha256sum "$TAG.zip" sha256sum "$TAG.tar.gz" echo "-----------------------------------------" rm "$TAG.zip" rm "$TAG.tar.gz" uTox/tools/build-android.sh0000700000175000001440000001054714003056216014717 0ustar rakusers#!/usr/bin/env bash # read settings from a custom settings file. [ -f settings.android ] && source settings.android set -ex # You may need to change these values, to what ever your system has available DEV_VERSION="25.0.0" SDK_VERSION="android-23" NDK_VERSION="android-12" # $TOXCLIORE_LIBS is the compilation of all the required dependencies you can # scrape from build.tox.chat needed to cross compile uTox to Android, you # might choose to store them elsewhere. TOXCORE_LIBS=${TOXCORE_LIBS-./libs/android/lib} LDFLAGS=${LDFLAGS--L$TOXCORE_LIBS/} TOOLCHAIN=${TOOLCHAIN-./toolchain} BUILD_DIR=${BUILD_DIR-./build_android} # Standard dev kit locations on posix ANDROID_NDK_HOME=${ANDROID_NDK_HOME-/opt/android-ndk} ANDROID_SDK_HOME=${ANDROID_SDK_HOME-/opt/android-sdk} KEYSTORE=${KEYSTORE-~/.android/utox.keystore} SYSROOT=${SYSROOT-${ANDROID_NDK_HOME}/platforms/${NDK_VERSION}/arch-arm} AAPT=${AAPT-${ANDROID_SDK_HOME}/build-tools/${DEV_VERSION}/aapt} DX=${DX-${ANDROID_SDK_HOME}/build-tools/${DEV_VERSION}/dx} ZIPALIGN=${ZIPALIGN-$ANDROID_SDK_HOME/build-tools/${DEV_VERSION}/zipalign} mkdir -p ${BUILD_DIR}/{lib/armeabi,java} mkdir -p ./.android/ if [ $1 == "--new" ]; then rm ${BUILD_DIR}/lib/armeabi/libuTox.so || true fi if [ $1 == "--auto-CI" ]; then curl -O https://utox.io/android.tar.gz tar xf android.tar.gz fi [ -d ${TOOLCHAIN} ] || "$ANDROID_NDK_HOME/build/tools/make-standalone-toolchain.sh" \ --toolchain="arm-linux-androideabi-clang" \ --install-dir=${TOOLCHAIN}/ \ --platform=${NDK_VERSION} TOX_LIBS=${TOX_LIBS-\ $TOXCORE_LIBS/libtoxcore.a \ $TOXCORE_LIBS/libtoxav.a \ $TOXCORE_LIBS/libtoxencryptsave.a } MORE_LIBS=${MORE_LIBS-\ $TOXCORE_LIBS/libsodium.a \ $TOXCORE_LIBS/libopus.a \ $TOXCORE_LIBS/libvpx.a \ $TOXCORE_LIBS/libopenal.a \ $TOXCORE_LIBS/libfreetype.a } PLATFORM_LIBS=${PLATFORM_LIBS--llog -landroid -lEGL -lGLESv2 -lOpenSLES -lm -lz -ldl} if ! [ -f ${BUILD_DIR}/lib/armeabi/libuTox.so ]; then ${TOOLCHAIN}/bin/arm-linux-androideabi-clang -std=gnu11 \ -Wformat=0 \ -Wl,--unresolved-symbols=report-all \ -I ./toolchain/include \ -I ./libs/android/include/freetype2/ \ -I ./libs/android/include/ \ -I ./sys/ \ ${CFLAGS} \ ./src/*.c \ ./src/ui/*.c \ ./src/av/*.c \ ./src/layout/*.c \ ./src/android/*.c \ ./toxcore/toxcore/*.c \ ./toxcore/toxav/*.c \ ./toxcore/toxencryptsave/*.c \ $ANDROID_NDK_HOME/sources/android/cpufeatures/cpu-features.c \ ${LDFLAGS} \ ${MORE_LIBS} \ -o ${BUILD_DIR}/lib/armeabi/libuTox.so \ --sysroot=$SYSROOT \ ${PLATFORM_LIBS} \ -DPLATFORM_ANDROID=1 \ -shared -s fi $AAPT package -f \ -M ./src/android/AndroidManifest.xml \ -S ./src/android/res \ -I $ANDROID_SDK_HOME/platforms/${SDK_VERSION}/android.jar \ -F ${BUILD_DIR}/uTox.apk \ -J ${BUILD_DIR}/java javac \ -d ${BUILD_DIR}/java \ -source 7 \ -target 7 \ ${BUILD_DIR}/java/R.java $DX --dex \ --output="${BUILD_DIR}/classes.dex" \ ${BUILD_DIR}/java # the class path is likely hacky, but I can't be arsed to find the real fix now java \ -classpath $ANDROID_SDK_HOME/tools/lib/sdklib-25.3.0.jar \ com.android.sdklib.build.ApkBuilderMain \ ${BUILD_DIR}/uTox.unsigned.apk \ -u -z ${BUILD_DIR}/uTox.apk \ -f ${BUILD_DIR}/classes.dex \ -nf ${BUILD_DIR}/lib if [ "$1" == "--auto-CI" ]; then keytool -genkeypair -v \ -dname "cn=uToxer, ou=uTox, o=Tox, c=US" \ -keystore ./tmp.keystore \ -keyalg RSA \ -keysize 2048 \ -validity 36500 \ -alias "utox-default" \ -keypass "the default password...really?" \ -storepass "the default password...really?" jarsigner \ -sigalg SHA1withRSA \ -digestalg SHA1 \ -keystore ./tmp.keystore \ ${BUILD_DIR}/uTox.unsigned.apk \ -keypass "the default password...really?" \ -storepass "the default password...really?" \ "utox-default" else jarsigner \ -sigalg SHA1withRSA \ -digestalg SHA1 \ -keystore ${KEYSTORE} \ ${BUILD_DIR}/uTox.unsigned.apk \ utox-dev fi mv ${BUILD_DIR}/uTox.unsigned.apk ${BUILD_DIR}/uTox.signed.apk $ZIPALIGN \ -f 4 \ ${BUILD_DIR}/uTox.signed.apk \ ./uTox.ready.apk uTox/third_party/0000700000175000001440000000000014003056216013025 5ustar rakusersuTox/third_party/stb/0000700000175000001440000000000014003056216013615 5ustar rakusersuTox/third_party/stb/stb.h0000600000175000001440000000045414003056216014563 0ustar rakusers#ifndef STB_H #define STB_H #include "stb/stb_image.h" #include "stb/stb_image_write.h" // uTox uses internal stb functions. extern unsigned char *stbi_write_png_to_mem(unsigned char *pixels, int stride_bytes, int x, int y, int n, int *out_len); #endif uTox/third_party/stb/stb.c0000600000175000001440000000020414003056216014547 0ustar rakusers#define STB_IMAGE_IMPLEMENTATION #include "stb/stb_image.h" #define STB_IMAGE_WRITE_IMPLEMENTATION #include "stb/stb_image_write.h" uTox/third_party/stb/stb/0000700000175000001440000000000014003056224014404 5ustar rakusersuTox/third_party/stb/stb/tools/0000700000175000001440000000000014003056224015544 5ustar rakusersuTox/third_party/stb/stb/tools/unicode/0000700000175000001440000000000014003056224017172 5ustar rakusersuTox/third_party/stb/stb/tools/unicode/unicode.dsp0000600000175000001440000000746614003056224021347 0ustar rakusers# Microsoft Developer Studio Project File - Name="unicode" - Package Owner=<4> # Microsoft Developer Studio Generated Build File, Format Version 6.00 # ** DO NOT EDIT ** # TARGTYPE "Win32 (x86) Console Application" 0x0103 CFG=unicode - 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 "unicode.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 "unicode.mak" CFG="unicode - Win32 Debug" !MESSAGE !MESSAGE Possible choices for configuration are: !MESSAGE !MESSAGE "unicode - Win32 Release" (based on "Win32 (x86) Console Application") !MESSAGE "unicode - 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)" == "unicode - Win32 Release" # PROP BASE Use_MFC 0 # PROP BASE Use_Debug_Libraries 0 # PROP BASE Output_Dir "Release" # PROP BASE Intermediate_Dir "Release" # 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 "_CONSOLE" /D "_MBCS" /YX /FD /c # ADD CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /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 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 !ELSEIF "$(CFG)" == "unicode - Win32 Debug" # PROP BASE Use_MFC 0 # PROP BASE Use_Debug_Libraries 1 # PROP BASE Output_Dir "Debug" # PROP BASE Intermediate_Dir "Debug" # 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 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ /c # ADD CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /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 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 !ENDIF # Begin Target # Name "unicode - Win32 Release" # Name "unicode - Win32 Debug" # Begin Source File SOURCE=..\unicode.c # End Source File # End Target # End Project uTox/third_party/stb/stb/tools/unicode.c0000600000175000001440000005250314003056224017345 0ustar rakusers#define STB_DEFINE #include "../stb.h" // create unicode mappings // // Two kinds of mappings: // map to a number // map to a bit // // For mapping to a number, we use the following strategy: // // User supplies: // 1. a table of numbers (for now we use uint16, so full Unicode table is 4MB) // 2. a "don't care" value // 3. define a 'fallback' value (typically 0) // 4. define a fast-path range (typically 0..255 or 0..1023) [@TODO: automate detecting this] // // Code: // 1. Determine range of *end* of unicode codepoints (U+10FFFF and down) which // all have the same value (or don't care). If large enough, emit this as a // special case in the code. // 2. Repeat above, limited to at most U+FFFF. // 3. Cluster the data into intervals of 8,16,32,64,128,256 numeric values. // 3a. If all the values in an interval are fallback/dont-care, no further processing // 3b. Find the "trimmed range" outside which all the values are the fallback or don't care // 3c. Find the "special trimmed range" outside which all the values are some constant or don't care // 4. Pack the clusters into continuous memory, and find previous instances of // the cluster. Repeat for trimmed & special-trimmed. In the first case, find // previous instances of the cluster (allow don't-care to match in either // direction), both aligned and mis-aligned; in the latter, starting where // things start or mis-aligned. Build an index table specifiying the // location of each cluster (and its length). Allow an extra indirection here; // the full-sized index can index a smaller table which has the actual offset // (and lengths). // 5. Associate with each packed continuous memory above the amount of memory // required to store the data w/ smallest datatype (of uint8, uint16, uint32). // Discard the continuous memory. Recurse on each index table, but avoid the // smaller packing. // // For mapping to a bit, we pack the results for 8 characters into a byte, and then apply // the above strategy. Note that there may be more optimal approaches with e.g. packing // 8 different bits into a single structure, though, which we should explore eventually. // currently we limit *indices* to being 2^16, and we pack them as // index + end_trim*2^16 + start_trim*2^24; specials have to go in a separate table typedef uint32 uval; #define UVAL_DONT_CARE_DEFAULT 0xffffffff typedef struct { uval *input; uint32 dont_care; uint32 fallback; int fastpath; int length; int depth; int has_sign; int splittable; int replace_fallback_with_codepoint; size_t input_size; size_t inherited_storage; } table; typedef struct { int split_log2; table result; // index into not-returned table int storage; } output; typedef struct { table t; char **output_name; } info; typedef struct { size_t path; size_t size; } result; typedef struct { uint8 trim_end; uint8 trim_start; uint8 special; uint8 aligned; uint8 indirect; uint16 overhead; // add some forced overhead for each mode to avoid getting complex encoding when it doesn't save much } mode_info; mode_info modes[] = { { 0,0,0,0,0, 32, }, { 0,0,0,0,1, 100, }, { 0,0,0,1,0, 32, }, { 0,0,0,1,1, 100, }, { 0,0,1,0,1, 100, }, { 0,0,1,1,0, 32, }, { 0,0,1,1,1, 200, }, { 1,0,0,0,0, 100, }, { 1,0,0,0,1, 120, }, { 1,1,0,0,0, 100, }, { 1,1,0,0,1, 130, }, { 1,0,1,0,0, 130, }, { 1,0,1,0,1, 180, }, { 1,1,1,0,0, 180, }, { 1,1,1,0,1, 200, }, }; #define MODECOUNT (sizeof(modes)/sizeof(modes[0])) #define CLUSTERSIZECOUNT 6 // 8,16, 32,64, 128,256 size_t size_for_max_number(uint32 number) { if (number == 0) return 0; if (number < 256) return 1; if (number < 256*256) return 2; if (number < 256*256*256) return 3; return 4; } size_t size_for_max_number_aligned(uint32 number) { size_t n = size_for_max_number(number); return n == 3 ? 4 : n; } uval get_data(uval *data, int offset, uval *end) { if (data + offset >= end) return 0; else return data[offset]; } int safe_len(uval *data, int len, uval *end) { if (len > end - data) return end - data; return len; } uval tempdata[256]; int dirty=0; size_t find_packed(uval **packed, uval *data, int len, int aligned, int fastpath, uval *end, int offset, int replace) { int packlen = stb_arr_len(*packed); int i,p; if (data+len > end || replace) { int safelen = safe_len(data, len, end); memset(tempdata, 0, dirty*sizeof(tempdata[0])); memcpy(tempdata, data, safelen * sizeof(data[0])); data = tempdata; dirty = len; } if (replace) { int i; int safelen = safe_len(data, len, end); for (i=0; i < safelen; ++i) if (data[i] == 0) data[i] = offset+i; } if (len <= 0) return 0; if (!fastpath) { if (aligned) { for (i=0; i < packlen; i += len) if ((*packed)[i] == data[0] && 0==memcmp(&(*packed)[i], data, len * sizeof(uval))) return i / len; } else { for (i=0; i < packlen-len+1; i += 1 ) if ((*packed)[i] == data[0] && 0==memcmp(&(*packed)[i], data, len * sizeof(uval))) return i; } } p = stb_arr_len(*packed); for (i=0; i < len; ++i) stb_arr_push(*packed, data[i]); return p; } void output_table(char *name1, char *name2, uval *data, int length, int sign, char **names) { char temp[20]; uval maxv = 0; int bytes, numlen, at_newline; int linelen = 79; // @TODO: make table more readable by choosing a length that's a multiple? int i,pos, do_split=0; for (i=0; i < length; ++i) if (sign) maxv = stb_max(maxv, (uval)abs((int)data[i])); else maxv = stb_max(maxv, data[i]); bytes = size_for_max_number_aligned(maxv); sprintf(temp, "%d", maxv); numlen=strlen(temp); if (sign) ++numlen; if (bytes == 0) return; printf("uint%d %s%s[%d] = {\n", bytes*8, name1, name2, length); at_newline = 1; for (i=0; i < length; ++i) { if (pos + numlen + 2 > linelen) { printf("\n"); at_newline = 1; pos = 0; } if (at_newline) { printf(" "); pos = 2; at_newline = 0; } else { printf(" "); ++pos; } printf("%*d,", numlen, data[i]); pos += numlen+1; } if (!at_newline) printf("\n"); printf("};\n"); } void output_table_with_trims(char *name1, char *name2, uval *data, int length) { uval maxt=0, maxp=0; int i,d,s,e, count; // split the table into two pieces uval *trims = NULL; if (length == 0) return; for (i=0; i < stb_arr_len(data); ++i) { stb_arr_push(trims, data[i] >> 16); data[i] &= 0xffff; maxt = stb_max(maxt, trims[i]); maxp = stb_max(maxp, data[i]); } d=s=e=1; if (maxt >= 256) { // need to output start & end values if (maxp >= 256) { // can pack into a single table printf("struct { uint16 val; uint8 start, end; } %s%s[%d] = {\n", name1, name2, length); } else { output_table(name1, name2, data, length, 0, 0); d=0; printf("struct { uint8 start, end; } %s%s_trim[%d] = {\n", name1, name2, length); } } else if (maxt > 0) { if (maxp >= 256) { output_table(name1, name2, data, length, 0, 0); output_table(name1, stb_sprintf("%s_end", name2), trims, length, 0, 0); return; } else { printf("struct { uint8 val, end; } %s%s[%d] = {\n", name1, name2, length); s=0; } } else { output_table(name1, name2, data, length, 0, 0); return; } // d or s can be zero (but not both), e is always present and last count = d + s + e; assert(count >= 2 && count <= 3); { char temp[60]; uval maxv = 0; int numlen, at_newline, len; int linelen = 79; // @TODO: make table more readable by choosing a length that's a multiple? int i,pos, do_split=0; numlen = 0; for (i=0; i < length; ++i) { if (count == 2) sprintf(temp, "{%d,%d}", d ? data[i] : (trims[i]>>8), trims[i]&255); else sprintf(temp, "{%d,%d,%d}", data[i], trims[i]>>8, trims[i]&255); len = strlen(temp); numlen = stb_max(len, numlen); } at_newline = 1; for (i=0; i < length; ++i) { if (pos + numlen + 2 > linelen) { printf("\n"); at_newline = 1; pos = 0; } if (at_newline) { printf(" "); pos = 2; at_newline = 0; } else { printf(" "); ++pos; } if (count == 2) sprintf(temp, "{%d,%d}", d ? data[i] : (trims[i]>>8), trims[i]&255); else sprintf(temp, "{%d,%d,%d}", data[i], trims[i]>>8, trims[i]&255); printf("%*s,", numlen, temp); pos += numlen+1; } if (!at_newline) printf("\n"); printf("};\n"); } } int weight=1; table pack_for_mode(table *t, int mode, char *table_name) { size_t extra_size; int i; uval maxv; mode_info mi = modes[mode % MODECOUNT]; int size = 8 << (mode / MODECOUNT); table newtab; uval *packed = NULL; uval *index = NULL; uval *indirect = NULL; uval *specials = NULL; newtab.dont_care = UVAL_DONT_CARE_DEFAULT; if (table_name) printf("// clusters of %d\n", size); for (i=0; i < t->length; i += size) { uval newval; int fastpath = (i < t->fastpath); if (mi.special) { int end_trim = size-1; int start_trim = 0; uval special; // @TODO: pick special from start or end instead of only end depending on which is longer for(;;) { special = t->input[i + end_trim]; if (special != t->dont_care || end_trim == 0) break; --end_trim; } // at this point, special==inp[end_trim], and end_trim >= 0 if (special == t->dont_care && !fastpath) { // entire block is don't care, so OUTPUT don't care stb_arr_push(index, newtab.dont_care); continue; } else { uval pos, trim; if (mi.trim_end && !fastpath) { while (end_trim >= 0) { if (t->input[i + end_trim] == special || t->input[i + end_trim] == t->dont_care) --end_trim; else break; } } if (mi.trim_start && !fastpath) { while (start_trim < end_trim) { if (t->input[i + start_trim] == special || t->input[i + start_trim] == t->dont_care) ++start_trim; else break; } } // end_trim points to the last character we have to output // find the first match, or add it pos = find_packed(&packed, &t->input[i+start_trim], end_trim-start_trim+1, mi.aligned, fastpath, &t->input[t->length], i+start_trim, t->replace_fallback_with_codepoint); // encode as a uval if (!mi.trim_end) { if (end_trim == 0) pos = special; else pos = pos | 0x80000000; } else { assert(end_trim < size && end_trim >= -1); if (!fastpath) assert(end_trim < size-1); // special always matches last one assert(end_trim < size && end_trim+1 >= 0); if (!fastpath) assert(end_trim+1 < size); if (mi.trim_start) trim = start_trim*256 + (end_trim+1); else trim = end_trim+1; assert(pos < 65536); // @TODO: if this triggers, just bail on this search path pos = pos + (trim << 16); } newval = pos; stb_arr_push(specials, special); } } else if (mi.trim_end) { int end_trim = size-1; int start_trim = 0; uval pos, trim; while (end_trim >= 0 && !fastpath) if (t->input[i + end_trim] == t->fallback || t->input[i + end_trim] == t->dont_care) --end_trim; else break; if (mi.trim_start && !fastpath) { while (start_trim < end_trim) { if (t->input[i + start_trim] == t->fallback || t->input[i + start_trim] == t->dont_care) ++start_trim; else break; } } // end_trim points to the last character we have to output, and can be -1 ++end_trim; // make exclusive at end if (end_trim == 0 && size == 256) start_trim = end_trim = 1; // we can't make encode a length from 0..256 in 8 bits, so restrict end_trim to 1..256 // find the first match, or add it pos = find_packed(&packed, &t->input[i+start_trim], end_trim - start_trim, mi.aligned, fastpath, &t->input[t->length], i+start_trim, t->replace_fallback_with_codepoint); assert(end_trim <= size && end_trim >= 0); if (size == 256) assert(end_trim-1 < 256 && end_trim-1 >= 0); else assert(end_trim < 256 && end_trim >= 0); if (size == 256) --end_trim; if (mi.trim_start) trim = start_trim*256 + end_trim; else trim = end_trim; assert(pos < 65536); // @TODO: if this triggers, just bail on this search path pos = pos + (trim << 16); newval = pos; } else { newval = find_packed(&packed, &t->input[i], size, mi.aligned, fastpath, &t->input[t->length], i, t->replace_fallback_with_codepoint); } if (mi.indirect) { int j; for (j=0; j < stb_arr_len(indirect); ++j) if (indirect[j] == newval) break; if (j == stb_arr_len(indirect)) stb_arr_push(indirect, newval); stb_arr_push(index, j); } else { stb_arr_push(index, newval); } } // total up the new size for everything but the index table extra_size = mi.overhead * weight; // not the actual overhead cost; a penalty to avoid excessive complexity extra_size += 150; // per indirection if (table_name) extra_size = 0; if (t->has_sign) { // 'packed' contains two values, which should be packed positive & negative for size uval maxv2; for (i=0; i < stb_arr_len(packed); ++i) if (packed[i] & 0x80000000) maxv2 = stb_max(maxv2, packed[i]); else maxv = stb_max(maxv, packed[i]); maxv = stb_max(maxv, maxv2) << 1; } else { maxv = 0; for (i=0; i < stb_arr_len(packed); ++i) if (packed[i] > maxv && packed[i] != t->dont_care) maxv = packed[i]; } extra_size += stb_arr_len(packed) * (t->splittable ? size_for_max_number(maxv) : size_for_max_number_aligned(maxv)); if (table_name) { if (t->splittable) output_table_with_trims(table_name, "", packed, stb_arr_len(packed)); else output_table(table_name, "", packed, stb_arr_len(packed), t->has_sign, NULL); } maxv = 0; for (i=0; i < stb_arr_len(specials); ++i) if (specials[i] > maxv) maxv = specials[i]; extra_size += stb_arr_len(specials) * size_for_max_number_aligned(maxv); if (table_name) output_table(table_name, "_default", specials, stb_arr_len(specials), 0, NULL); maxv = 0; for (i=0; i < stb_arr_len(indirect); ++i) if (indirect[i] > maxv) maxv = indirect[i]; extra_size += stb_arr_len(indirect) * size_for_max_number(maxv); if (table_name && stb_arr_len(indirect)) { if (mi.trim_end) output_table_with_trims(table_name, "_index", indirect, stb_arr_len(indirect)); else { assert(0); // this case should only trigger in very extreme circumstances output_table(table_name, "_index", indirect, stb_arr_len(indirect), 0, NULL); } mi.trim_end = mi.special = 0; } if (table_name) printf("// above tables should be %d bytes\n", extra_size); maxv = 0; for (i=0; i < stb_arr_len(index); ++i) if (index[i] > maxv && index[i] != t->dont_care) maxv = index[i]; newtab.splittable = mi.trim_end; newtab.input_size = newtab.splittable ? size_for_max_number(maxv) : size_for_max_number_aligned(maxv); newtab.input = index; newtab.length = stb_arr_len(index); newtab.inherited_storage = t->inherited_storage + extra_size; newtab.fastpath = 0; newtab.depth = t->depth+1; stb_arr_free(indirect); stb_arr_free(packed); stb_arr_free(specials); return newtab; } result pack_table(table *t, size_t path, int min_storage) { int i; result best; best.size = t->inherited_storage + t->input_size * t->length; best.path = path; if ((int) t->inherited_storage > min_storage) { best.size = stb_max(best.size, t->inherited_storage); return best; } if (t->length <= 256 || t->depth >= 4) { //printf("%08x: %7d\n", best.path, best.size); return best; } path <<= 7; for (i=0; i < MODECOUNT * CLUSTERSIZECOUNT; ++i) { table newtab; result r; newtab = pack_for_mode(t, i, 0); r = pack_table(&newtab, path+i+1, min_storage); if (r.size < best.size) best = r; stb_arr_free(newtab.input); //printf("Size: %6d + %6d\n", newtab.inherited_storage, newtab.input_size * newtab.length); } return best; } int pack_table_by_modes(table *t, int *modes) { table s = *t; while (*modes > -1) { table newtab; newtab = pack_for_mode(&s, *modes, 0); if (s.input != t->input) stb_arr_free(s.input); s = newtab; ++modes; } return s.inherited_storage + s.input_size * s.length; } int strip_table(table *t, int exceptions) { uval terminal_value; int p = t->length-1; while (t->input[p] == t->dont_care) --p; terminal_value = t->input[p]; while (p >= 0x10000) { if (t->input[p] != terminal_value && t->input[p] != t->dont_care) { if (exceptions) --exceptions; else break; } --p; } return p+1; // p is a character we must output } void optimize_table(table *t, char *table_name) { int modelist[3] = { 85, -1 }; int modes[8]; int num_modes = 0; int decent_size; result r; size_t path; table s; // strip tail end of table int orig_length = t->length; int threshhold = 0xffff; int p = strip_table(t, 2); int len_saved = t->length - p; if (len_saved >= threshhold) { t->length = p; while (p > 0x10000) { p = strip_table(t, 0); len_saved = t->length - p; if (len_saved < 0x10000) break; len_saved = orig_length - p; if (len_saved < threshhold) break; threshhold *= 2; } } t->depth = 1; // find size of table if we use path 86 decent_size = pack_table_by_modes(t, modelist); #if 1 // find best packing of remainder of table by exploring tree of packings r = pack_table(t, 0, decent_size); // use the computed 'path' to evaluate and output tree path = r.path; #else path = 86;//90;//132097; #endif while (path) { modes[num_modes++] = (path & 127) - 1; path >>= 7; } printf("// modes: %d\n", r.path); s = *t; while (num_modes > 0) { char name[256]; sprintf(name, "%s_%d", table_name, num_modes+1); --num_modes; s = pack_for_mode(&s, modes[num_modes], name); } // output the final table as-is if (s.splittable) output_table_with_trims(table_name, "_1", s.input, s.length); else output_table(table_name, "_1", s.input, s.length, 0, NULL); } uval unicode_table[0x110000]; typedef struct { uval lo,hi; } char_range; char_range get_range(char *str) { char_range cr; char *p; cr.lo = strtol(str, &p, 16); p = stb_skipwhite(p); if (*p == '.') cr.hi = strtol(p+2, NULL, 16); else cr.hi = cr.lo; return cr; } char *skip_semi(char *s, int count) { while (count) { s = strchr(s, ';'); assert(s != NULL); ++s; --count; } return s; } int main(int argc, char **argv) { table t; uval maxv=0; int i,n=0; char **s = stb_stringfile("../../data/UnicodeData.txt", &n); assert(s); for (i=0; i < n; ++i) { if (s[i][0] == '#' || s[i][0] == '\n' || s[i][0] == 0) ; else { char_range cr = get_range(s[i]); char *t = skip_semi(s[i], 13); uval j, v; if (*t == ';' || *t == '\n' || *t == 0) v = 0; else { v = strtol(t, NULL, 16); if (v < 65536) { maxv = stb_max(v, maxv); for (j=cr.lo; j <= cr.hi; ++j) { unicode_table[j] = v; //printf("%06x => %06x\n", j, v); } } } } } t.depth = 0; t.dont_care = UVAL_DONT_CARE_DEFAULT; t.fallback = 0; t.fastpath = 256; t.inherited_storage = 0; t.has_sign = 0; t.splittable = 0; t.input = unicode_table; t.input_size = size_for_max_number(maxv); t.length = 0x110000; t.replace_fallback_with_codepoint = 1; optimize_table(&t, "stbu_upppercase"); return 0; } uTox/third_party/stb/stb/tools/mr.bat0000600000175000001440000000002214003056224016646 0ustar rakusersdebug\make_readme uTox/third_party/stb/stb/tools/make_readme.dsp0000600000175000001440000000776714003056224020531 0ustar rakusers# Microsoft Developer Studio Project File - Name="make_readme" - Package Owner=<4> # Microsoft Developer Studio Generated Build File, Format Version 6.00 # ** DO NOT EDIT ** # TARGTYPE "Win32 (x86) Console Application" 0x0103 CFG=make_readme - 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 "make_readme.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 "make_readme.mak" CFG="make_readme - Win32 Debug" !MESSAGE !MESSAGE Possible choices for configuration are: !MESSAGE !MESSAGE "make_readme - Win32 Release" (based on "Win32 (x86) Console Application") !MESSAGE "make_readme - 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)" == "make_readme - Win32 Release" # PROP BASE Use_MFC 0 # PROP BASE Use_Debug_Libraries 0 # PROP BASE Output_Dir "Release" # PROP BASE Intermediate_Dir "Release" # 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 "_CONSOLE" /D "_MBCS" /YX /FD /c # ADD CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /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 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 !ELSEIF "$(CFG)" == "make_readme - Win32 Debug" # PROP BASE Use_MFC 0 # PROP BASE Use_Debug_Libraries 1 # PROP BASE Output_Dir "Debug" # PROP BASE Intermediate_Dir "Debug" # PROP BASE Target_Dir "" # PROP Use_MFC 0 # PROP Use_Debug_Libraries 1 # PROP Output_Dir "Debug" # PROP Intermediate_Dir "Debug\make_readme" # 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 /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /FD /GZ /c # SUBTRACT CPP /YX # 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 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 !ENDIF # Begin Target # Name "make_readme - Win32 Release" # Name "make_readme - Win32 Debug" # Begin Source File SOURCE=.\make_readme.c # End Source File # Begin Source File SOURCE=.\README.header.md # End Source File # Begin Source File SOURCE=.\README.list # End Source File # End Target # End Project uTox/third_party/stb/stb/tools/make_readme.c0000600000175000001440000000471714003056224020155 0ustar rakusers#define STB_DEFINE #include "../stb.h" int main(int argc, char **argv) { int i; int hlen, flen, listlen, total_lines = 0; char *header = stb_file("README.header.md", &hlen); // stb_file - read file into malloc()ed buffer char *footer = stb_file("README.footer.md", &flen); // stb_file - read file into malloc()ed buffer char **list = stb_stringfile("README.list", &listlen); // stb_stringfile - read file lines into malloced array of strings FILE *f = fopen("../README.md", "wb"); fprintf(f, "\n\n"); fwrite(header, 1, hlen, f); for (i=0; i < listlen; ++i) { int num,j; char **tokens = stb_tokens_stripwhite(list[i], "|", &num); // stb_tokens -- tokenize string into malloced array of strings int num_lines; char **lines = stb_stringfile(stb_sprintf("../%s", tokens[0]), &num_lines); char *s1, *s2,*s3; s1 = strchr(lines[0], '-'); if (!s1) stb_fatal("Couldn't find '-' before version number in %s", tokens[0]); // stb_fatal -- print error message & exit s2 = strchr(s1+2, '-'); if (!s2) stb_fatal("Couldn't find '-' after version number in %s", tokens[0]); // stb_fatal -- print error message & exit *s2 = 0; s1 += 1; s1 = stb_trimwhite(s1); // stb_trimwhite -- advance pointer to after whitespace & delete trailing whitespace if (*s1 == 'v') ++s1; s3 = tokens[0]; stb_trimwhite(s3); fprintf(f, "**["); if (strlen(s3) < 21) { fprintf(f, "%s", tokens[0]); } else { char buffer[256]; strncpy(buffer, s3, 18); buffer[18] = 0; strcat(buffer, "..."); fprintf(f, "%s", buffer); } fprintf(f, "](%s)**", tokens[0]); fprintf(f, " | %s", s1); s1 = stb_trimwhite(tokens[1]); // stb_trimwhite -- advance pointer to after whitespace & delete trailing whitespace s2 = stb_dupreplace(s1, " ", " "); // stb_dupreplace -- search & replace string and malloc result fprintf(f, " | %s", s2); free(s2); fprintf(f, " | %d", num_lines); total_lines += num_lines; for (j=2; j < num; ++j) fprintf(f, " | %s", tokens[j]); fprintf(f, "\n"); } fprintf(f, "\n"); fprintf(f, "Total libraries: %d \n", listlen); fprintf(f, "Total lines of C code: %d\n\n", total_lines); fwrite(footer, 1, flen, f); fclose(f); return 0; } uTox/third_party/stb/stb/tools/easy_font_maker.c0000600000175000001440000001205014003056224021056 0ustar rakusers// This program was used to encode the data for stb_simple_font.h #define STB_DEFINE #include "stb.h" #define STB_IMAGE_IMPLEMENTATION #include "stb_image.h" int w,h; uint8 *data; int last_x[2], last_y[2]; int num_seg[2], non_empty; #if 0 typedef struct { unsigned short first_segment; unsigned char advance; } chardata; typedef struct { unsigned char x:4; unsigned char y:4; unsigned char len:3; unsigned char dir:1; } segment; segment *segments; void add_seg(int x, int y, int len, int horizontal) { segment s; s.x = x; s.y = y; s.len = len; s.dir = horizontal; assert(s.x == x); assert(s.y == y); assert(s.len == len); stb_arr_push(segments, s); } #else typedef struct { unsigned char first_segment:8; unsigned char first_v_segment:8; unsigned char advance:5; unsigned char voff:1; } chardata; #define X_LIMIT 1 #define LEN_LIMIT 7 typedef struct { unsigned char dx:1; unsigned char y:4; unsigned char len:3; } segment; segment *segments; segment *vsegments; void add_seg(int x, int y, int len, int horizontal) { segment s; while (x - last_x[horizontal] > X_LIMIT) { add_seg(last_x[horizontal] + X_LIMIT, 0, 0, horizontal); } while (len > LEN_LIMIT) { add_seg(x, y, LEN_LIMIT, horizontal); len -= LEN_LIMIT; x += LEN_LIMIT*horizontal; y += LEN_LIMIT*!horizontal; } s.dx = x - last_x[horizontal]; s.y = y; s.len = len; non_empty += len != 0; //assert(s.x == x); assert(s.y == y); assert(s.len == len); ++num_seg[horizontal]; if (horizontal) stb_arr_push(segments, s); else stb_arr_push(vsegments, s); last_x[horizontal] = x; } void print_segments(segment *s) { int i, hpos; printf(" "); hpos = 4; for (i=0; i < stb_arr_len(s); ++i) { // repack for portability unsigned char seg = s[i].len + s[i].dx*8 + s[i].y*16; hpos += printf("%d,", seg); if (hpos > 72 && i+1 < stb_arr_len(s)) { hpos = 4; printf("\n "); } } printf("\n"); } #endif chardata charinfo[128]; int parse_char(int x, chardata *c, int offset) { int start_x = x, end_x, top_y = 0, y; c->first_segment = stb_arr_len(segments); c->first_v_segment = stb_arr_len(vsegments) - offset; assert(c->first_segment == stb_arr_len(segments)); assert(c->first_v_segment + offset == stb_arr_len(vsegments)); // find advance distance end_x = x+1; while (data[end_x*3] == 255) ++end_x; c->advance = end_x - start_x + 1; last_x[0] = last_x[1] = 0; last_y[0] = last_y[1] = 0; for (y=2; y < h; ++y) { for (x=start_x; x < end_x; ++x) { if (data[y*3*w+x*3+1] < 255) { top_y = y; break; } } if (top_y) break; } c->voff = top_y > 2; if (top_y > 2) top_y = 3; for (x=start_x; x < end_x; ++x) { int y; for (y=2; y < h; ++y) { if (data[y*3*w+x*3+1] < 255) { if (data[y*3*w+x*3+0] == 255) { // red int len=0; while (y+len < h && data[(y+len)*3*w+x*3+0] == 255 && data[(y+len)*3*w+x*3+1] == 0) { data[(y+len)*3*w+x*3+0] = 0; ++len; } add_seg(x-start_x,y-top_y,len,0); } if (data[y*3*w+x*3+2] == 255) { // blue int len=0; while (x+len < end_x && data[y*3*w+(x+len)*3+2] == 255 && data[y*3*w+(x+len)*3+1] == 0) { data[y*3*w+(x+len)*3+2] = 0; ++len; } add_seg(x-start_x,y-top_y,len,1); } } } } return end_x; } int main(int argc, char **argv) { int c, x=0; data = stbi_load("easy_font_raw.png", &w, &h, 0, 3); for (c=32; c < 127; ++c) { x = parse_char(x, &charinfo[c], 0); printf("%3d -- %3d %3d\n", c, charinfo[c].first_segment, charinfo[c].first_v_segment); } printf("===\n"); printf("%d %d %d\n", num_seg[0], num_seg[1], non_empty); printf("%d\n", sizeof(segments[0]) * stb_arr_len(segments)); printf("%d\n", sizeof(segments[0]) * stb_arr_len(segments) + sizeof(segments[0]) * stb_arr_len(vsegments) + sizeof(charinfo[32])*95); printf("struct {\n" " unsigned char advance;\n" " unsigned char h_seg;\n" " unsigned char v_seg;\n" "} stb_easy_font_charinfo[96] = {\n"); charinfo[c].first_segment = stb_arr_len(segments); charinfo[c].first_v_segment = stb_arr_len(vsegments); for (c=32; c < 128; ++c) { if ((c & 3) == 0) printf(" "); printf("{ %2d,%3d,%3d },", charinfo[c].advance + 16*charinfo[c].voff, charinfo[c].first_segment, charinfo[c].first_v_segment); if ((c & 3) == 3) printf("\n"); else printf(" "); } printf("};\n\n"); printf("unsigned char stb_easy_font_hseg[%d] = {\n", stb_arr_len(segments)); print_segments(segments); printf("};\n\n"); printf("unsigned char stb_easy_font_vseg[%d] = {\n", stb_arr_len(vsegments)); print_segments(vsegments); printf("};\n"); return 0; } uTox/third_party/stb/stb/tools/README.list0000600000175000001440000000401714003056224017402 0ustar rakusersstb_vorbis.c | audio | decode ogg vorbis files from file/memory to float/16-bit signed output stb_image.h | graphics | image loading/decoding from file/memory: JPG, PNG, TGA, BMP, PSD, GIF, HDR, PIC stb_truetype.h | graphics | parse, decode, and rasterize characters from truetype fonts stb_image_write.h | graphics | image writing to disk: PNG, TGA, BMP stb_image_resize.h | graphics | resize images larger/smaller with good quality stb_rect_pack.h | graphics | simple 2D rectangle packer with decent quality stb_sprintf.h | utility | fast sprintf, snprintf for C/C++ stretchy_buffer.h | utility | typesafe dynamic array for C (i.e. approximation to vector<>), doesn't compile as C++ stb_textedit.h | user interface | guts of a text editor for games etc implementing them from scratch stb_voxel_render.h | 3D graphics | Minecraft-esque voxel rendering "engine" with many more features stb_dxt.h | 3D graphics | Fabian "ryg" Giesen's real-time DXT compressor stb_perlin.h | 3D graphics | revised Perlin noise (3D input, 1D output) stb_easy_font.h | 3D graphics | quick-and-dirty easy-to-deploy bitmap font for printing frame rate, etc stb_tilemap_editor.h | game dev | embeddable tilemap editor stb_herringbone_wang_tile.h | game dev | herringbone Wang tile map generator stb_c_lexer.h | parsing | simplify writing parsers for C-like languages stb_divide.h | math | more useful 32-bit modulus e.g. "euclidean divide" stb_connected_components.h | misc | incrementally compute reachability on grids stb.h | misc | helper functions for C, mostly redundant in C++; basically author's personal stuff stb_leakcheck.h | misc | quick-and-dirty malloc/free leak-checking uTox/third_party/stb/stb/tools/README.header.md0000600000175000001440000000060214003056224020252 0ustar rakusersstb === single-file public domain (or MIT licensed) libraries for C/C++ Most libraries by stb, except: stb_dxt by Fabian "ryg" Giesen, stb_image_resize by Jorge L. "VinoBS" Rodriguez, and stb_sprintf by Jeff Roberts. library | lastest version | category | LoC | description --------------------- | ---- | -------- | --- | -------------------------------- uTox/third_party/stb/stb/tools/README.footer.md0000600000175000001440000001164614003056224020332 0ustar rakusers FAQ --- #### What's the license? These libraries are in the public domain. You can do anything you want with them. You have no legal obligation to do anything else, although I appreciate attribution. They are also licensed under the MIT open source license, if you have lawyers who are unhappy with public domain. Every source file includes an explicit dual-license for you to choose from. #### Are there other single-file public-domain/open source libraries with minimal dependencies out there? [Yes.](https://github.com/nothings/single_file_libs) #### If I wrap an stb library in a new library, does the new library have to be public domain/MIT? No, because it's public domain you can freely relicense it to whatever license your new library wants to be. #### What's the deal with SSE support in GCC-based compilers? stb_image will either use SSE2 (if you compile with -msse2) or will not use any SIMD at all, rather than trying to detect the processor at runtime and handle it correctly. As I understand it, the approved path in GCC for runtime-detection require you to use multiple source files, one for each CPU configuration. Because stb_image is a header-file library that compiles in only one source file, there's no approved way to build both an SSE-enabled and a non-SSE-enabled variation. While we've tried to work around it, we've had multiple issues over the years due to specific versions of gcc breaking what we're doing, so we've given up on it. See https://github.com/nothings/stb/issues/280 and https://github.com/nothings/stb/issues/410 for examples. #### Some of these libraries seem redundant to existing open source libraries. Are they better somehow? Generally they're only better in that they're easier to integrate, easier to use, and easier to release (single file; good API; no attribution requirement). They may be less featureful, slower, and/or use more memory. If you're already using an equivalent library, there's probably no good reason to switch. #### Can I link directly to the table of stb libraries? You can use [this URL](https://github.com/nothings/stb#stb_libs) to link directly to that list. #### Why do you list "lines of code"? It's a terrible metric. Just to give you some idea of the internal complexity of the library, to help you manage your expectations, or to let you know what you're getting into. While not all the libraries are written in the same style, they're certainly similar styles, and so comparisons between the libraries are probably still meaningful. Note though that the lines do include both the implementation, the part that corresponds to a header file, and the documentation. #### Why single-file headers? Windows doesn't have standard directories where libraries live. That makes deploying libraries in Windows a lot more painful than open source developers on Unix-derivates generally realize. (It also makes library dependencies a lot worse in Windows.) There's also a common problem in Windows where a library was built against a different version of the runtime library, which causes link conflicts and confusion. Shipping the libs as headers means you normally just compile them straight into your project without making libraries, thus sidestepping that problem. Making them a single file makes it very easy to just drop them into a project that needs them. (Of course you can still put them in a proper shared library tree if you want.) Why not two files, one a header and one an implementation? The difference between 10 files and 9 files is not a big deal, but the difference between 2 files and 1 file is a big deal. You don't need to zip or tar the files up, you don't have to remember to attach *two* files, etc. #### Why "stb"? Is this something to do with Set-Top Boxes? No, they are just the initials for my name, Sean T. Barrett. This was not chosen out of egomania, but as a moderately sane way of namespacing the filenames and source function names. #### Will you add more image types to stb_image.h? If people submit them, I generally add them, but the goal of stb_image is less for applications like image viewer apps (which need to support every type of image under the sun) and more for things like games which can choose what images to use, so I may decline to add them if they're too rare or if the size of implementation vs. apparent benefit is too low. #### Do you have any advice on how to create my own single-file library? Yes. https://github.com/nothings/stb/blob/master/docs/stb_howto.txt #### Why public domain? I prefer it over GPL, LGPL, BSD, zlib, etc. for many reasons. Some of them are listed here: https://github.com/nothings/stb/blob/master/docs/why_public_domain.md #### Why C? Primarily, because I use C, not C++. But it does also make it easier for other people to use them from other languages. #### Why not C99? stdint.h, declare-anywhere, etc. I still use MSVC 6 (1998) as my IDE because it has better human factors for me than later versions of MSVC. uTox/third_party/stb/stb/tests/0000700000175000001440000000000014003056224015546 5ustar rakusersuTox/third_party/stb/stb/tests/vorbseek/0000700000175000001440000000000014003056224017366 5ustar rakusersuTox/third_party/stb/stb/tests/vorbseek/vorbseek.dsp0000600000175000001440000000776714003056224021741 0ustar rakusers# Microsoft Developer Studio Project File - Name="vorbseek" - Package Owner=<4> # Microsoft Developer Studio Generated Build File, Format Version 6.00 # ** DO NOT EDIT ** # TARGTYPE "Win32 (x86) Console Application" 0x0103 CFG=vorbseek - 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 "vorbseek.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 "vorbseek.mak" CFG="vorbseek - Win32 Debug" !MESSAGE !MESSAGE Possible choices for configuration are: !MESSAGE !MESSAGE "vorbseek - Win32 Release" (based on "Win32 (x86) Console Application") !MESSAGE "vorbseek - 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)" == "vorbseek - Win32 Release" # PROP BASE Use_MFC 0 # PROP BASE Use_Debug_Libraries 0 # PROP BASE Output_Dir "Release" # PROP BASE Intermediate_Dir "Release" # PROP BASE Target_Dir "" # PROP Use_MFC 0 # PROP Use_Debug_Libraries 0 # PROP Output_Dir "Release" # PROP Intermediate_Dir "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 /W3 /GX /Zd /O2 /I "..\.." /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /FD /c # SUBTRACT CPP /YX # 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 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 !ELSEIF "$(CFG)" == "vorbseek - Win32 Debug" # PROP BASE Use_MFC 0 # PROP BASE Use_Debug_Libraries 1 # PROP BASE Output_Dir "Debug" # PROP BASE Intermediate_Dir "Debug" # PROP BASE Target_Dir "" # PROP Use_MFC 0 # PROP Use_Debug_Libraries 1 # PROP Output_Dir "Debug" # PROP Intermediate_Dir "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 /W3 /Gm /GX /ZI /Od /I "..\.." /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /FD /GZ /c # SUBTRACT CPP /YX # 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 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 !ENDIF # Begin Target # Name "vorbseek - Win32 Release" # Name "vorbseek - Win32 Debug" # Begin Source File SOURCE=..\..\stb_vorbis.c # End Source File # Begin Source File SOURCE=.\vorbseek.c # End Source File # End Target # End Project uTox/third_party/stb/stb/tests/vorbseek/vorbseek.c0000600000175000001440000000745514003056224021367 0ustar rakusers#include #include #include #include #define STB_VORBIS_HEADER_ONLY #include "stb_vorbis.c" #define SAMPLES_TO_TEST 3000 int test_count [5] = { 5000, 3000, 2000, 50000, 50000 }; int test_spacing[5] = { 1, 111, 3337, 7779, 72717 }; int try_seeking(stb_vorbis *v, unsigned int pos, short *output, unsigned int num_samples) { int count; short samples[SAMPLES_TO_TEST*2]; assert(pos <= num_samples); if (!stb_vorbis_seek(v, pos)) { fprintf(stderr, "Seek to %u returned error from stb_vorbis\n", pos); return 0; } count = stb_vorbis_get_samples_short_interleaved(v, 2, samples, SAMPLES_TO_TEST*2); if (count > (int) (num_samples - pos)) { fprintf(stderr, "Seek to %u allowed decoding %d samples when only %d should have been valid.\n", pos, count, (int) (num_samples - pos)); return 0; } if (count < SAMPLES_TO_TEST && count < (int) (num_samples - pos)) { fprintf(stderr, "Seek to %u only decoded %d samples of %d attempted when at least %d should have been valid.\n", pos, count, SAMPLES_TO_TEST, num_samples - pos); return 0; } if (0 != memcmp(samples, output + pos*2, count*2)) { int k; for (k=0; k < SAMPLES_TO_TEST*2; ++k) { if (samples[k] != output[k]) { fprintf(stderr, "Seek to %u produced incorrect samples starting at sample %u (short #%d in buffer).\n", pos, pos + (k/2), k); break; } } assert(k != SAMPLES_TO_TEST*2); return 0; } return 1; } int main(int argc, char **argv) { int num_chan, samprate; int i, j, test, phase; short *output; if (argc == 1) { fprintf(stderr, "Usage: vorbseek {vorbisfile} [{vorbisfile]*]\n"); fprintf(stderr, "Tests various seek offsets to make sure they're sample exact.\n"); return 0; } #if 0 { // check that outofmem occurs correctly stb_vorbis_alloc va; va.alloc_buffer = malloc(1024*1024); for (i=0; i < 1024*1024; i += 10) { int error=0; stb_vorbis *v; va.alloc_buffer_length_in_bytes = i; v = stb_vorbis_open_filename(argv[1], &error, &va); if (v != NULL) break; printf("Error %d at %d\n", error, i); } } #endif for (j=1; j < argc; ++j) { unsigned int successes=0, attempts = 0; unsigned int num_samples = stb_vorbis_decode_filename(argv[j], &num_chan, &samprate, &output); break; if (num_samples == 0xffffffff) { fprintf(stderr, "Error: couldn't open file or not vorbis file: %s\n", argv[j]); goto fail; } if (num_chan != 2) { fprintf(stderr, "vorbseek testing only works with files with 2 channels, %s has %d\n", argv[j], num_chan); goto fail; } for (test=0; test < 5; ++test) { int error; stb_vorbis *v = stb_vorbis_open_filename(argv[j], &error, NULL); if (v == NULL) { fprintf(stderr, "Couldn't re-open %s for test #%d\n", argv[j], test); goto fail; } for (phase=0; phase < 3; ++phase) { unsigned int base = phase == 0 ? 0 : phase == 1 ? num_samples - test_count[test]*test_spacing[test] : num_samples/3; for (i=0; i < test_count[test]; ++i) { unsigned int pos = base + i*test_spacing[test]; if (pos > num_samples) // this also catches underflows continue; successes += try_seeking(v, pos, output, num_samples); attempts += 1; } } stb_vorbis_close(v); } printf("%d of %d seeks failed in %s (%d samples)\n", attempts-successes, attempts, argv[j], num_samples); free(output); } return 0; fail: return 1; }uTox/third_party/stb/stb/tests/tilemap_editor_integration_example.c0000600000175000001440000001432014003056224025033 0ustar rakusers// This isn't compilable as-is, as it was extracted from a working // integration-in-a-game and makes reference to symbols from that game. #include #include #include "game.h" #include "SDL.h" #include "stb_tilemap_editor.h" extern void editor_draw_tile(int x, int y, unsigned short tile, int mode, float *props); extern void editor_draw_rect(int x0, int y0, int x1, int y1, unsigned char r, unsigned char g, unsigned char b); static int is_platform(short *tiles); static unsigned int prop_type(int n, short *tiles); static char *prop_name(int n, short *tiles); static float prop_range(int n, short *tiles, int is_max); static int allow_link(short *src, short *dest); #define STBTE_MAX_PROPERTIES 8 #define STBTE_PROP_TYPE(n, tiledata, p) prop_type(n,tiledata) #define STBTE_PROP_NAME(n, tiledata, p) prop_name(n,tiledata) #define STBTE_PROP_MIN(n, tiledata, p) prop_range(n,tiledata,0) #define STBTE_PROP_MAX(n, tiledata, p) prop_range(n,tiledata,1) #define STBTE_PROP_FLOAT_SCALE(n,td,p) (0.1) #define STBTE_ALLOW_LINK(srctile, srcprop, desttile, destprop) \ allow_link(srctile, desttile) #define STBTE_LINK_COLOR(srctile, srcprop, desttile, destprop) \ (is_platform(srctile) ? 0xff80ff : 0x808040) #define STBTE_DRAW_RECT(x0,y0,x1,y1,c) \ editor_draw_rect(x0,y0,x1,y1,(c)>>16,((c)>>8)&255,(c)&255) #define STBTE_DRAW_TILE(x,y,id,highlight,props) \ editor_draw_tile(x,y,id,highlight,props) #define STB_TILEMAP_EDITOR_IMPLEMENTATION #include "stb_tilemap_editor.h" stbte_tilemap *edit_map; void editor_key(enum stbte_action act) { stbte_action(edit_map, act); } void editor_process_sdl_event(SDL_Event *e) { switch (e->type) { case SDL_MOUSEMOTION: case SDL_MOUSEBUTTONDOWN: case SDL_MOUSEBUTTONUP: case SDL_MOUSEWHEEL: stbte_mouse_sdl(edit_map, e, 1.0f/editor_scale,1.0f/editor_scale,0,0); break; case SDL_KEYDOWN: if (in_editor) { switch (e->key.keysym.sym) { case SDLK_RIGHT: editor_key(STBTE_scroll_right); break; case SDLK_LEFT : editor_key(STBTE_scroll_left ); break; case SDLK_UP : editor_key(STBTE_scroll_up ); break; case SDLK_DOWN : editor_key(STBTE_scroll_down ); break; } switch (e->key.keysym.scancode) { case SDL_SCANCODE_S: editor_key(STBTE_tool_select); break; case SDL_SCANCODE_B: editor_key(STBTE_tool_brush ); break; case SDL_SCANCODE_E: editor_key(STBTE_tool_erase ); break; case SDL_SCANCODE_R: editor_key(STBTE_tool_rectangle ); break; case SDL_SCANCODE_I: editor_key(STBTE_tool_eyedropper); break; case SDL_SCANCODE_L: editor_key(STBTE_tool_link); break; case SDL_SCANCODE_G: editor_key(STBTE_act_toggle_grid); break; } if ((e->key.keysym.mod & KMOD_CTRL) && !(e->key.keysym.mod & ~KMOD_CTRL)) { switch (e->key.keysym.scancode) { case SDL_SCANCODE_X: editor_key(STBTE_act_cut ); break; case SDL_SCANCODE_C: editor_key(STBTE_act_copy ); break; case SDL_SCANCODE_V: editor_key(STBTE_act_paste); break; case SDL_SCANCODE_Z: editor_key(STBTE_act_undo ); break; case SDL_SCANCODE_Y: editor_key(STBTE_act_redo ); break; } } } break; } } void editor_init(void) { int i; edit_map = stbte_create_map(20,14, 8, 16,16, 100); stbte_set_background_tile(edit_map, T_empty); for (i=0; i < T__num_types; ++i) { if (i != T_reserved1 && i != T_entry && i != T_doorframe) stbte_define_tile(edit_map, 0+i, 1, "Background"); } stbte_define_tile(edit_map, 256+O_player , 8, "Char"); stbte_define_tile(edit_map, 256+O_robot , 8, "Char"); for (i=O_lockeddoor; i < O__num_types-2; ++i) if (i == O_platform || i == O_vplatform) stbte_define_tile(edit_map, 256+i, 4, "Object"); else stbte_define_tile(edit_map, 256+i, 2, "Object"); //stbte_set_layername(edit_map, 0, "background"); //stbte_set_layername(edit_map, 1, "objects"); //stbte_set_layername(edit_map, 2, "platforms"); //stbte_set_layername(edit_map, 3, "characters"); } static int is_platform(short *tiles) { // platforms are only on layer #2 return tiles[2] == 256 + O_platform || tiles[2] == 256 + O_vplatform; } static int is_object(short *tiles) { return (tiles[1] >= 256 || tiles[2] >= 256 || tiles[3] >= 256); } static unsigned int prop_type(int n, short *tiles) { if (is_platform(tiles)) { static unsigned int platform_types[STBTE_MAX_PROPERTIES] = { STBTE_PROP_bool, // phantom STBTE_PROP_int, // x_adjust STBTE_PROP_int, // y_adjust STBTE_PROP_float, // width STBTE_PROP_float, // lspeed STBTE_PROP_float, // rspeed STBTE_PROP_bool, // autoreturn STBTE_PROP_bool, // one-shot // remainder get 0, means 'no property in this slot' }; return platform_types[n]; } else if (is_object(tiles)) { if (n == 0) return STBTE_PROP_bool; } return 0; } static char *prop_name(int n, short *tiles) { if (is_platform(tiles)) { static char *platform_vars[STBTE_MAX_PROPERTIES] = { "phantom", "x_adjust", "y_adjust", "width", "lspeed", "rspeed", "autoreturn", "one-shot", }; return platform_vars[n]; } return "phantom"; } static float prop_range(int n, short *tiles, int is_max) { if (is_platform(tiles)) { static float ranges[8][2] = { { 0, 1 }, // phantom-flag, range is ignored { -15, 15 }, // x_adjust { -15, 15 }, // y_adjust { 0, 6 }, // width { 0, 10 }, // lspeed { 0, 10 }, // rspeed { 0, 1 }, // autoreturn, range is ignored { 0, 1 }, // one-shot, range is ignored }; return ranges[n][is_max]; } return 0; } static int allow_link(short *src, short *dest) { if (is_platform(src)) return dest[1] == 256+O_lever; if (src[1] == 256+O_endpoint) return is_platform(dest); return 0; } uTox/third_party/stb/stb/tests/textedit_sample.c0000600000175000001440000000664314003056224021120 0ustar rakusers// I haven't actually tested this yet, this is just to make sure it compiles #include #include // memmove #include // isspace #define STB_TEXTEDIT_CHARTYPE char #define STB_TEXTEDIT_STRING text_control // get the base type #include "stb_textedit.h" // define our editor structure typedef struct { char *string; int stringlen; STB_TexteditState state; } text_control; // define the functions we need void layout_func(StbTexteditRow *row, STB_TEXTEDIT_STRING *str, int start_i) { int remaining_chars = str->stringlen - start_i; row->num_chars = remaining_chars > 20 ? 20 : remaining_chars; // should do real word wrap here row->x0 = 0; row->x1 = 20; // need to account for actual size of characters row->baseline_y_delta = 1.25; row->ymin = -1; row->ymax = 0; } int delete_chars(STB_TEXTEDIT_STRING *str, int pos, int num) { memmove(&str->string[pos], &str->string[pos+num], str->stringlen - (pos+num)); str->stringlen -= num; return 1; // always succeeds } int insert_chars(STB_TEXTEDIT_STRING *str, int pos, STB_TEXTEDIT_CHARTYPE *newtext, int num) { str->string = realloc(str->string, str->stringlen + num); memmove(&str->string[pos+num], &str->string[pos], str->stringlen - pos); memcpy(&str->string[pos], newtext, num); str->stringlen += num; return 1; // always succeeds } // define all the #defines needed #define KEYDOWN_BIT 0x80000000 #define STB_TEXTEDIT_STRINGLEN(tc) ((tc)->stringlen) #define STB_TEXTEDIT_LAYOUTROW layout_func #define STB_TEXTEDIT_GETWIDTH(tc,n,i) (1) // quick hack for monospaced #define STB_TEXTEDIT_KEYTOTEXT(key) (((key) & KEYDOWN_BIT) ? 0 : (key)) #define STB_TEXTEDIT_GETCHAR(tc,i) ((tc)->string[i]) #define STB_TEXTEDIT_NEWLINE '\n' #define STB_TEXTEDIT_IS_SPACE(ch) isspace(ch) #define STB_TEXTEDIT_DELETECHARS delete_chars #define STB_TEXTEDIT_INSERTCHARS insert_chars #define STB_TEXTEDIT_K_SHIFT 0x40000000 #define STB_TEXTEDIT_K_CONTROL 0x20000000 #define STB_TEXTEDIT_K_LEFT (KEYDOWN_BIT | 1) // actually use VK_LEFT, SDLK_LEFT, etc #define STB_TEXTEDIT_K_RIGHT (KEYDOWN_BIT | 2) // VK_RIGHT #define STB_TEXTEDIT_K_UP (KEYDOWN_BIT | 3) // VK_UP #define STB_TEXTEDIT_K_DOWN (KEYDOWN_BIT | 4) // VK_DOWN #define STB_TEXTEDIT_K_LINESTART (KEYDOWN_BIT | 5) // VK_HOME #define STB_TEXTEDIT_K_LINEEND (KEYDOWN_BIT | 6) // VK_END #define STB_TEXTEDIT_K_TEXTSTART (STB_TEXTEDIT_K_LINESTART | STB_TEXTEDIT_K_CONTROL) #define STB_TEXTEDIT_K_TEXTEND (STB_TEXTEDIT_K_LINEEND | STB_TEXTEDIT_K_CONTROL) #define STB_TEXTEDIT_K_DELETE (KEYDOWN_BIT | 7) // VK_DELETE #define STB_TEXTEDIT_K_BACKSPACE (KEYDOWN_BIT | 8) // VK_BACKSPACE #define STB_TEXTEDIT_K_UNDO (KEYDOWN_BIT | STB_TEXTEDIT_K_CONTROL | 'z') #define STB_TEXTEDIT_K_REDO (KEYDOWN_BIT | STB_TEXTEDIT_K_CONTROL | 'y') #define STB_TEXTEDIT_K_INSERT (KEYDOWN_BIT | 9) // VK_INSERT #define STB_TEXTEDIT_K_WORDLEFT (STB_TEXTEDIT_K_LEFT | STB_TEXTEDIT_K_CONTROL) #define STB_TEXTEDIT_K_WORDRIGHT (STB_TEXTEDIT_K_RIGHT | STB_TEXTEDIT_K_CONTROL) #define STB_TEXTEDIT_K_PGUP (KEYDOWN_BIT | 10) // VK_PGUP -- not implemented #define STB_TEXTEDIT_K_PGDOWN (KEYDOWN_BIT | 11) // VK_PGDOWN -- not implemented #define STB_TEXTEDIT_IMPLEMENTATION #include "stb_textedit.h" uTox/third_party/stb/stb/tests/test_vorbis.c0000600000175000001440000000103414003056224020255 0ustar rakusers#define STB_IMAGE_STATIC #define STB_IMAGE_IMPLEMENTATION #include "stb_image.h" #define STB_VORBIS_HEADER_ONLY #include "stb_vorbis.c" #include "stb.h" extern void stb_vorbis_dumpmem(void); #ifdef VORBIS_TEST int main(int argc, char **argv) { size_t memlen; unsigned char *mem = stb_fileu("c:/x/sketch008.ogg", &memlen); int chan, samplerate; short *output; int samples = stb_vorbis_decode_memory(mem, memlen, &chan, &samplerate, &output); stb_filewrite("c:/x/sketch008.raw", output, samples*4); return 0; } #endif uTox/third_party/stb/stb/tests/test_truetype.c0000600000175000001440000000567214003056224020646 0ustar rakusers#include "stb_rect_pack.h" #define STB_TRUETYPE_IMPLEMENTATION #include "stb_truetype.h" #include "stb_image_write.h" #ifdef TT_TEST #include char ttf_buffer[1<<25]; unsigned char output[512*100]; void debug(void) { stbtt_fontinfo font; fread(ttf_buffer, 1, 1<<25, fopen("c:/x/lm/LiberationMono-Regular.ttf", "rb")); stbtt_InitFont(&font, ttf_buffer, 0); stbtt_MakeGlyphBitmap(&font, output, 6, 9, 512, 5.172414E-03f, 5.172414E-03f, 54); } #define BITMAP_W 256 #define BITMAP_H 512 unsigned char temp_bitmap[BITMAP_H][BITMAP_W]; stbtt_bakedchar cdata[256*2]; // ASCII 32..126 is 95 glyphs stbtt_packedchar pdata[256*2]; int main(int argc, char **argv) { stbtt_fontinfo font; unsigned char *bitmap; int w,h,i,j,c = (argc > 1 ? atoi(argv[1]) : 34807), s = (argc > 2 ? atoi(argv[2]) : 32); //debug(); // @TODO: why is minglui.ttc failing? fread(ttf_buffer, 1, 1<<25, fopen(argc > 3 ? argv[3] : "c:/windows/fonts/mingliu.ttc", "rb")); //fread(ttf_buffer, 1, 1<<25, fopen(argc > 3 ? argv[3] : "c:/x/DroidSansMono.ttf", "rb")); { static stbtt_pack_context pc; static stbtt_packedchar cd[256]; static unsigned char atlas[1024*1024]; stbtt_PackBegin(&pc, atlas, 1024,1024,1024,1,NULL); stbtt_PackFontRange(&pc, ttf_buffer, 0, 32.0, 0, 256, cd); stbtt_PackEnd(&pc); } #if 0 stbtt_BakeFontBitmap(ttf_buffer,stbtt_GetFontOffsetForIndex(ttf_buffer,0), 40.0, temp_bitmap[0],BITMAP_W,BITMAP_H, 32,96, cdata); // no guarantee this fits! stbi_write_png("fonttest1.png", BITMAP_W, BITMAP_H, 1, temp_bitmap, 0); { stbtt_pack_context pc; stbtt_PackBegin(&pc, temp_bitmap[0], BITMAP_W, BITMAP_H, 0, 1, NULL); stbtt_PackFontRange(&pc, ttf_buffer, 0, 20.0, 32, 95, pdata); stbtt_PackFontRange(&pc, ttf_buffer, 0, 20.0, 0xa0, 0x100-0xa0, pdata); stbtt_PackEnd(&pc); stbi_write_png("fonttest2.png", BITMAP_W, BITMAP_H, 1, temp_bitmap, 0); } { stbtt_pack_context pc; stbtt_pack_range pr[2]; stbtt_PackBegin(&pc, temp_bitmap[0], BITMAP_W, BITMAP_H, 0, 1, NULL); pr[0].chardata_for_range = pdata; pr[0].first_unicode_char_in_range = 32; pr[0].num_chars_in_range = 95; pr[0].font_size = 20.0f; pr[1].chardata_for_range = pdata+256; pr[1].first_unicode_char_in_range = 0xa0; pr[1].num_chars_in_range = 0x100 - 0xa0; pr[1].font_size = 20.0f; stbtt_PackSetOversampling(&pc, 2, 2); stbtt_PackFontRanges(&pc, ttf_buffer, 0, pr, 2); stbtt_PackEnd(&pc); stbi_write_png("fonttest3.png", BITMAP_W, BITMAP_H, 1, temp_bitmap, 0); } return 0; #endif stbtt_InitFont(&font, ttf_buffer, stbtt_GetFontOffsetForIndex(ttf_buffer,0)); bitmap = stbtt_GetCodepointBitmap(&font, 0,stbtt_ScaleForPixelHeight(&font, (float)s), c, &w, &h, 0,0); for (j=0; j < h; ++j) { for (i=0; i < w; ++i) putchar(" .:ioVM@"[bitmap[j*w+i]>>5]); putchar('\n'); } return 0; } #endif uTox/third_party/stb/stb/tests/test_cpp_compilation.cpp0000600000175000001440000001163614003056224022502 0ustar rakusers#include "stb_sprintf.h" #define STB_SPRINTF_IMPLEMENTATION #include "stb_sprintf.h" #define STB_TRUETYPE_IMPLEMENTATION #define STB_PERLIN_IMPLEMENTATION #define STB_IMAGE_WRITE_IMPLEMENTATION #define STB_DXT_IMPLEMENATION #define STB_C_LEXER_IMPLEMENTATIOn #define STB_DIVIDE_IMPLEMENTATION #define STB_IMAGE_IMPLEMENTATION #define STB_HERRINGBONE_WANG_TILE_IMPLEMENTATION #define STB_RECT_PACK_IMPLEMENTATION #define STB_VOXEL_RENDER_IMPLEMENTATION #define STB_CONNECTED_COMPONENTS_IMPLEMENTATION #define STBI_MALLOC my_malloc #define STBI_FREE my_free #define STBI_REALLOC my_realloc void *my_malloc(size_t) { return 0; } void *my_realloc(void *, size_t) { return 0; } void my_free(void *) { } #include "stb_image.h" #include "stb_rect_pack.h" #include "stb_truetype.h" #include "stb_image_write.h" #include "stb_perlin.h" #include "stb_dxt.h" #include "stb_c_lexer.h" #include "stb_divide.h" #include "stb_herringbone_wang_tile.h" #define STBCC_GRID_COUNT_X_LOG2 10 #define STBCC_GRID_COUNT_Y_LOG2 10 #include "stb_connected_components.h" #define STBVOX_CONFIG_MODE 1 #include "stb_voxel_render.h" #define STBTE_DRAW_RECT(x0,y0,x1,y1,color) do ; while(0) #define STBTE_DRAW_TILE(x,y,id,highlight,data) do ; while(0) #define STB_TILEMAP_EDITOR_IMPLEMENTATION #include "stb_tilemap_editor.h" #include "stb_easy_font.h" #define STB_LEAKCHECK_IMPLEMENTATION #include "stb_leakcheck.h" #define STB_IMAGE_RESIZE_IMPLEMENTATION #include "stb_image_resize.h" #include "stretchy_buffer.h" //////////////////////////////////////////////////////////// // // text edit #include #include // memmove #include // isspace #define STB_TEXTEDIT_CHARTYPE char #define STB_TEXTEDIT_STRING text_control // get the base type #include "stb_textedit.h" // define our editor structure typedef struct { char *string; int stringlen; STB_TexteditState state; } text_control; // define the functions we need void layout_func(StbTexteditRow *row, STB_TEXTEDIT_STRING *str, int start_i) { int remaining_chars = str->stringlen - start_i; row->num_chars = remaining_chars > 20 ? 20 : remaining_chars; // should do real word wrap here row->x0 = 0; row->x1 = 20; // need to account for actual size of characters row->baseline_y_delta = 1.25; row->ymin = -1; row->ymax = 0; } int delete_chars(STB_TEXTEDIT_STRING *str, int pos, int num) { memmove(&str->string[pos], &str->string[pos+num], str->stringlen - (pos+num)); str->stringlen -= num; return 1; // always succeeds } int insert_chars(STB_TEXTEDIT_STRING *str, int pos, STB_TEXTEDIT_CHARTYPE *newtext, int num) { str->string = (char *) realloc(str->string, str->stringlen + num); memmove(&str->string[pos+num], &str->string[pos], str->stringlen - pos); memcpy(&str->string[pos], newtext, num); str->stringlen += num; return 1; // always succeeds } // define all the #defines needed #define KEYDOWN_BIT 0x80000000 #define STB_TEXTEDIT_STRINGLEN(tc) ((tc)->stringlen) #define STB_TEXTEDIT_LAYOUTROW layout_func #define STB_TEXTEDIT_GETWIDTH(tc,n,i) (1) // quick hack for monospaced #define STB_TEXTEDIT_KEYTOTEXT(key) (((key) & KEYDOWN_BIT) ? 0 : (key)) #define STB_TEXTEDIT_GETCHAR(tc,i) ((tc)->string[i]) #define STB_TEXTEDIT_NEWLINE '\n' #define STB_TEXTEDIT_IS_SPACE(ch) isspace(ch) #define STB_TEXTEDIT_DELETECHARS delete_chars #define STB_TEXTEDIT_INSERTCHARS insert_chars #define STB_TEXTEDIT_K_SHIFT 0x40000000 #define STB_TEXTEDIT_K_CONTROL 0x20000000 #define STB_TEXTEDIT_K_LEFT (KEYDOWN_BIT | 1) // actually use VK_LEFT, SDLK_LEFT, etc #define STB_TEXTEDIT_K_RIGHT (KEYDOWN_BIT | 2) // VK_RIGHT #define STB_TEXTEDIT_K_UP (KEYDOWN_BIT | 3) // VK_UP #define STB_TEXTEDIT_K_DOWN (KEYDOWN_BIT | 4) // VK_DOWN #define STB_TEXTEDIT_K_LINESTART (KEYDOWN_BIT | 5) // VK_HOME #define STB_TEXTEDIT_K_LINEEND (KEYDOWN_BIT | 6) // VK_END #define STB_TEXTEDIT_K_TEXTSTART (STB_TEXTEDIT_K_LINESTART | STB_TEXTEDIT_K_CONTROL) #define STB_TEXTEDIT_K_TEXTEND (STB_TEXTEDIT_K_LINEEND | STB_TEXTEDIT_K_CONTROL) #define STB_TEXTEDIT_K_DELETE (KEYDOWN_BIT | 7) // VK_DELETE #define STB_TEXTEDIT_K_BACKSPACE (KEYDOWN_BIT | 8) // VK_BACKSPACE #define STB_TEXTEDIT_K_UNDO (KEYDOWN_BIT | STB_TEXTEDIT_K_CONTROL | 'z') #define STB_TEXTEDIT_K_REDO (KEYDOWN_BIT | STB_TEXTEDIT_K_CONTROL | 'y') #define STB_TEXTEDIT_K_INSERT (KEYDOWN_BIT | 9) // VK_INSERT #define STB_TEXTEDIT_K_WORDLEFT (STB_TEXTEDIT_K_LEFT | STB_TEXTEDIT_K_CONTROL) #define STB_TEXTEDIT_K_WORDRIGHT (STB_TEXTEDIT_K_RIGHT | STB_TEXTEDIT_K_CONTROL) #define STB_TEXTEDIT_K_PGUP (KEYDOWN_BIT | 10) // VK_PGUP -- not implemented #define STB_TEXTEDIT_K_PGDOWN (KEYDOWN_BIT | 11) // VK_PGDOWN -- not implemented #define STB_TEXTEDIT_IMPLEMENTATION #include "stb_textedit.h" uTox/third_party/stb/stb/tests/test_c_compilation.c0000600000175000001440000000211314003056224021570 0ustar rakusers#include "stb_sprintf.h" #define STB_SPRINTF_IMPLEMENTATION #include "stb_sprintf.h" #define STB_PERLIN_IMPLEMENTATION #define STB_IMAGE_WRITE_IMPLEMENTATION #define STB_DXT_IMPLEMENATION #define STB_C_LEXER_IMPLEMENTATIOn #define STB_DIVIDE_IMPLEMENTATION #define STB_IMAGE_IMPLEMENTATION #define STB_HERRINGBONE_WANG_TILE_IMEPLEMENTATIOn #define STB_IMAGE_RESIZE_IMPLEMENTATION #define STB_RECT_PACK_IMPLEMENTATION #define STB_VOXEL_RENDER_IMPLEMENTATION #define STB_EASY_FONT_IMPLEMENTATION #include "stb_easy_font.h" #include "stb_herringbone_wang_tile.h" #include "stb_image.h" #include "stb_image_write.h" #include "stb_perlin.h" #include "stb_dxt.h" #include "stb_c_lexer.h" #include "stb_divide.h" #include "stb_image_resize.h" #include "stb_rect_pack.h" #define STBVOX_CONFIG_MODE 1 #include "stb_voxel_render.h" #define STBTE_DRAW_RECT(x0,y0,x1,y1,color) 0 #define STBTE_DRAW_TILE(x,y,id,highlight,data) 0 #define STB_TILEMAP_EDITOR_IMPLEMENTATION #include "stb_tilemap_editor.h" int quicktest(void) { char buffer[999]; stbsp_sprintf(buffer, "test%%test"); return 0; }uTox/third_party/stb/stb/tests/stretchy_buffer_test.c0000600000175000001440000000003414003056224022146 0ustar rakusers#include "stretchy_buffer.h"uTox/third_party/stb/stb/tests/stretch_test.dsp0000600000175000001440000000773114003056224021003 0ustar rakusers# Microsoft Developer Studio Project File - Name="stretch_test" - Package Owner=<4> # Microsoft Developer Studio Generated Build File, Format Version 6.00 # ** DO NOT EDIT ** # TARGTYPE "Win32 (x86) Console Application" 0x0103 CFG=stretch_test - 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 "stretch_test.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 "stretch_test.mak" CFG="stretch_test - Win32 Debug" !MESSAGE !MESSAGE Possible choices for configuration are: !MESSAGE !MESSAGE "stretch_test - Win32 Release" (based on "Win32 (x86) Console Application") !MESSAGE "stretch_test - 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)" == "stretch_test - Win32 Release" # PROP BASE Use_MFC 0 # PROP BASE Use_Debug_Libraries 0 # PROP BASE Output_Dir "Release" # PROP BASE Intermediate_Dir "Release" # 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 "_CONSOLE" /D "_MBCS" /YX /FD /c # ADD CPP /nologo /W3 /GX /O2 /I "..\.." /I ".." /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "TT_TEST" /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 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 !ELSEIF "$(CFG)" == "stretch_test - Win32 Debug" # PROP BASE Use_MFC 0 # PROP BASE Use_Debug_Libraries 1 # PROP BASE Output_Dir "stretch_test___Win32_Debug" # PROP BASE Intermediate_Dir "stretch_test___Win32_Debug" # PROP BASE Target_Dir "" # PROP Use_MFC 0 # PROP Use_Debug_Libraries 1 # PROP Output_Dir "Debug" # PROP Intermediate_Dir "Debug\stretch_test" # 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 /W3 /Gm /GX /ZI /Od /I ".." /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /FD /GZ /c # SUBTRACT CPP /YX # 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 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 !ENDIF # Begin Target # Name "stretch_test - Win32 Release" # Name "stretch_test - Win32 Debug" # Begin Source File SOURCE=.\stretch_test.c # End Source File # End Target # End Project uTox/third_party/stb/stb/tests/stretch_test.c0000600000175000001440000000101614003056224020425 0ustar rakusers// check that stb_truetype compiles with no stb_rect_pack.h #define STB_TRUETYPE_IMPLEMENTATION #include "stb_truetype.h" #include "stretchy_buffer.h" #include int main(int arg, char **argv) { int i; int *arr = NULL; for (i=0; i < 1000000; ++i) sb_push(arr, i); assert(sb_count(arr) == 1000000); for (i=0; i < 1000000; ++i) assert(arr[i] == i); sb_free(arr); arr = NULL; for (i=0; i < 1000; ++i) sb_add(arr, 1000); assert(sb_count(arr) == 1000000); return 0; }uTox/third_party/stb/stb/tests/stb_cpp.dsp0000600000175000001440000000777714003056224017734 0ustar rakusers# Microsoft Developer Studio Project File - Name="stb_cpp" - Package Owner=<4> # Microsoft Developer Studio Generated Build File, Format Version 6.00 # ** DO NOT EDIT ** # TARGTYPE "Win32 (x86) Console Application" 0x0103 CFG=stb_cpp - 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 "stb_cpp.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 "stb_cpp.mak" CFG="stb_cpp - Win32 Debug" !MESSAGE !MESSAGE Possible choices for configuration are: !MESSAGE !MESSAGE "stb_cpp - Win32 Release" (based on "Win32 (x86) Console Application") !MESSAGE "stb_cpp - 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)" == "stb_cpp - Win32 Release" # PROP BASE Use_MFC 0 # PROP BASE Use_Debug_Libraries 0 # PROP BASE Output_Dir "Release" # PROP BASE Intermediate_Dir "Release" # 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 "_CONSOLE" /D "_MBCS" /YX /FD /c # ADD CPP /nologo /MT /W3 /GX /O2 /I ".." /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /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 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 !ELSEIF "$(CFG)" == "stb_cpp - Win32 Debug" # PROP BASE Use_MFC 0 # PROP BASE Use_Debug_Libraries 1 # PROP BASE Output_Dir "Debug" # PROP BASE Intermediate_Dir "Debug" # PROP BASE Target_Dir "" # PROP Use_MFC 0 # PROP Use_Debug_Libraries 1 # PROP Output_Dir "Debug" # PROP Intermediate_Dir "Debug\stb_cpp" # 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 /MTd /W3 /GX /Zd /Od /I ".." /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /FD /GZ /c # SUBTRACT CPP /YX # 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 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 !ENDIF # Begin Target # Name "stb_cpp - Win32 Release" # Name "stb_cpp - Win32 Debug" # Begin Source File SOURCE=.\stb_cpp.cpp # End Source File # Begin Source File SOURCE=..\stb_vorbis.c # End Source File # Begin Source File SOURCE=.\test_cpp_compilation.cpp # End Source File # End Target # End Project uTox/third_party/stb/stb/tests/stb_cpp.cpp0000600000175000001440000000416114003056224017710 0ustar rakusers#define WIN32_MEAN_AND_LEAN #define WIN32_LEAN_AND_MEAN //#include #include #define STB_STUA #define STB_DEFINE #define STB_NPTR #define STB_ONLY #include "stb.h" //#include "stb_file.h" int count; void c(int truth, char *error) { if (!truth) { fprintf(stderr, "Test failed: %s\n", error); ++count; } } char *expects(stb_matcher *m, char *s, int result, int len, char *str) { int res2,len2=0; res2 = stb_lex(m, s, &len2); c(result == res2 && len == len2, str); return s + len; } void test_lex(void) { stb_matcher *m = stb_lex_matcher(); // tok_en5 .3 20.1 20. .20 .1 char *s = "tok_en5.3 20.1 20. .20.1"; stb_lex_item(m, "[a-zA-Z_][a-zA-Z0-9_]*", 1 ); stb_lex_item(m, "[0-9]*\\.?[0-9]*" , 2 ); stb_lex_item(m, "[\r\n\t ]+" , 3 ); stb_lex_item(m, "." , -99 ); s=expects(m,s,1,7, "stb_lex 1"); s=expects(m,s,2,2, "stb_lex 2"); s=expects(m,s,3,1, "stb_lex 3"); s=expects(m,s,2,4, "stb_lex 4"); s=expects(m,s,3,1, "stb_lex 5"); s=expects(m,s,2,3, "stb_lex 6"); s=expects(m,s,3,1, "stb_lex 7"); s=expects(m,s,2,3, "stb_lex 8"); s=expects(m,s,2,2, "stb_lex 9"); s=expects(m,s,0,0, "stb_lex 10"); stb_matcher_free(m); } int main(int argc, char **argv) { char *p; p = "abcdefghijklmnopqrstuvwxyz"; c(stb_ischar('c', p), "stb_ischar 1"); c(stb_ischar('x', p), "stb_ischar 2"); c(!stb_ischar('#', p), "stb_ischar 3"); c(!stb_ischar('X', p), "stb_ischar 4"); p = "0123456789"; c(!stb_ischar('c', p), "stb_ischar 5"); c(!stb_ischar('x', p), "stb_ischar 6"); c(!stb_ischar('#', p), "stb_ischar 7"); c(!stb_ischar('X', p), "stb_ischar 8"); p = "#####"; c(!stb_ischar('c', p), "stb_ischar a"); c(!stb_ischar('x', p), "stb_ischar b"); c(stb_ischar('#', p), "stb_ischar c"); c(!stb_ischar('X', p), "stb_ischar d"); p = "xXyY"; c(!stb_ischar('c', p), "stb_ischar e"); c(stb_ischar('x', p), "stb_ischar f"); c(!stb_ischar('#', p), "stb_ischar g"); c(stb_ischar('X', p), "stb_ischar h"); test_lex(); if (count) { _getch(); } return 0; } uTox/third_party/stb/stb/tests/stb.dsw0000600000175000001440000000552114003056224017062 0ustar rakusersMicrosoft Developer Studio Workspace File, Format Version 6.00 # WARNING: DO NOT EDIT OR DELETE THIS WORKSPACE FILE! ############################################################################### Project: "c_lexer_test"=.\c_lexer_test.dsp - Package Owner=<4> Package=<5> {{{ }}} Package=<4> {{{ }}} ############################################################################### Project: "herringbone"=.\herringbone.dsp - Package Owner=<4> Package=<5> {{{ }}} Package=<4> {{{ }}} ############################################################################### Project: "herringbone_map"=.\herringbone_map.dsp - Package Owner=<4> Package=<5> {{{ }}} Package=<4> {{{ }}} ############################################################################### Project: "image_test"=.\image_test.dsp - Package Owner=<4> Package=<5> {{{ }}} Package=<4> {{{ }}} ############################################################################### Project: "make_readme"=..\tools\make_readme.dsp - Package Owner=<4> Package=<5> {{{ }}} Package=<4> {{{ }}} ############################################################################### Project: "pg_test"=.\pg_test\pg_test.dsp - Package Owner=<4> Package=<5> {{{ }}} Package=<4> {{{ }}} ############################################################################### Project: "resize"=.\resize.dsp - Package Owner=<4> Package=<5> {{{ }}} Package=<4> {{{ }}} ############################################################################### Project: "stb"=.\stb.dsp - Package Owner=<4> Package=<5> {{{ }}} Package=<4> {{{ Begin Project Dependency Project_Dep_Name stb_cpp End Project Dependency Begin Project Dependency Project_Dep_Name image_test End Project Dependency Begin Project Dependency Project_Dep_Name stretch_test End Project Dependency Begin Project Dependency Project_Dep_Name c_lexer_test End Project Dependency }}} ############################################################################### Project: "stb_cpp"=.\stb_cpp.dsp - Package Owner=<4> Package=<5> {{{ }}} Package=<4> {{{ }}} ############################################################################### Project: "stretch_test"=.\stretch_test.dsp - Package Owner=<4> Package=<5> {{{ }}} Package=<4> {{{ }}} ############################################################################### Project: "unicode"=..\tools\unicode\unicode.dsp - Package Owner=<4> Package=<5> {{{ }}} Package=<4> {{{ }}} ############################################################################### Project: "vorbseek"=.\vorbseek\vorbseek.dsp - Package Owner=<4> Package=<5> {{{ }}} Package=<4> {{{ }}} ############################################################################### Global: Package=<5> {{{ }}} Package=<3> {{{ }}} ############################################################################### uTox/third_party/stb/stb/tests/stb.dsp0000600000175000001440000001333114003056224017051 0ustar rakusers# Microsoft Developer Studio Project File - Name="stb" - Package Owner=<4> # Microsoft Developer Studio Generated Build File, Format Version 6.00 # ** DO NOT EDIT ** # TARGTYPE "Win32 (x86) Console Application" 0x0103 CFG=stb - 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 "stb.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 "stb.mak" CFG="stb - Win32 Debug" !MESSAGE !MESSAGE Possible choices for configuration are: !MESSAGE !MESSAGE "stb - Win32 Release" (based on "Win32 (x86) Console Application") !MESSAGE "stb - 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)" == "stb - Win32 Release" # PROP BASE Use_MFC 0 # PROP BASE Use_Debug_Libraries 0 # PROP BASE Output_Dir "Release" # PROP BASE Intermediate_Dir "Release" # PROP BASE Target_Dir "" # PROP Use_MFC 0 # PROP Use_Debug_Libraries 0 # PROP Output_Dir "Release" # PROP Intermediate_Dir "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 /G6 /MT /W3 /GX /Z7 /O2 /Ob2 /I ".." /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "GRID_TEST" /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 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 !ELSEIF "$(CFG)" == "stb - Win32 Debug" # PROP BASE Use_MFC 0 # PROP BASE Use_Debug_Libraries 1 # PROP BASE Output_Dir "Debug" # PROP BASE Intermediate_Dir "Debug" # PROP BASE Target_Dir "" # PROP Use_MFC 0 # PROP Use_Debug_Libraries 1 # PROP Output_Dir "Debug" # PROP Intermediate_Dir "Debug\stb" # 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 /MTd /W3 /GX /Zi /Od /I ".." /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "VORBIS_TEST" /FR /FD /GZ /c # SUBTRACT CPP /YX # 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 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 /incremental:no /debug /machine:I386 /pdbtype:sept # SUBTRACT LINK32 /force !ENDIF # Begin Target # Name "stb - Win32 Release" # Name "stb - Win32 Debug" # Begin Source File SOURCE=.\grid_reachability.c # End Source File # Begin Source File SOURCE=.\stb.c # End Source File # Begin Source File SOURCE=..\stb.h # End Source File # Begin Source File SOURCE=..\stb_c_lexer.h # End Source File # Begin Source File SOURCE=..\stb_connected_components.h # End Source File # Begin Source File SOURCE=..\stb_divide.h # End Source File # Begin Source File SOURCE=..\stb_dxt.h # End Source File # Begin Source File SOURCE=..\stb_easy_font.h # End Source File # Begin Source File SOURCE=..\stb_herringbone_wang_tile.h # End Source File # Begin Source File SOURCE=..\stb_image.h # End Source File # Begin Source File SOURCE=..\stb_image_resize.h # End Source File # Begin Source File SOURCE=..\stb_image_write.h # End Source File # Begin Source File SOURCE=..\stb_leakcheck.h # End Source File # Begin Source File SOURCE=..\stb_malloc.h # End Source File # Begin Source File SOURCE=..\stb_perlin.h # End Source File # Begin Source File SOURCE=..\stb_pg.h # End Source File # Begin Source File SOURCE=..\stb_rect_pack.h # End Source File # Begin Source File SOURCE=..\stb_sprintf.h # End Source File # Begin Source File SOURCE=..\stb_textedit.h # End Source File # Begin Source File SOURCE=..\stb_tilemap_editor.h # End Source File # Begin Source File SOURCE=..\stb_truetype.h # End Source File # Begin Source File SOURCE=..\stb_vorbis.c # End Source File # Begin Source File SOURCE=..\stb_voxel_render.h # End Source File # Begin Source File SOURCE=..\stretchy_buffer.h # End Source File # Begin Source File SOURCE=.\stretchy_buffer_test.c # End Source File # Begin Source File SOURCE=.\test_c_compilation.c # End Source File # Begin Source File SOURCE=.\test_truetype.c # End Source File # Begin Source File SOURCE=.\test_vorbis.c # End Source File # Begin Source File SOURCE=.\textedit_sample.c # End Source File # End Target # End Project uTox/third_party/stb/stb/tests/stb.c0000600000175000001440000036333014003056224016514 0ustar rakusers/* * Unit tests for "stb.h" */ //#include #include #include #include #include #include #ifdef _WIN32 #include #endif #define STB_STUA //#define STB_FASTMALLOC #ifdef _DEBUG #define STB_MALLOC_WRAPPER_DEBUG #endif #define STB_NPTR #define STB_DEFINE #include "stb.h" //#include "stb_file.h" //#include "stb_pixel32.h" //#define DEBUG_BLOCK #ifdef DEBUG_BLOCK #include #endif #ifdef STB_FASTMALLOC #error "can't use FASTMALLOC with threads" #endif int count; void c(int truth, char *error) { if (!truth) { fprintf(stderr, "Test failed: %s\n", error); ++count; } } #if 0 void show(void) { #ifdef _WIN32 SYSTEM_INFO x; GetSystemInfo(&x); printf("%d\n", x.dwPageSize); #endif } #endif void test_classes(void) { unsigned char size_base[32], size_shift[32]; int class_to_pages[256]; int class_to_size[256], cl; int lg, size, wasted_pages; int kAlignShift = 3; int kAlignment = 1 << kAlignShift; int kMaxSize = 8 * 4096; int kPageShift = 12; int kPageSize = (1 << kPageShift); int next_class = 1; int alignshift = kAlignShift; int last_lg = -1; for (lg = 0; lg < kAlignShift; lg++) { size_base[lg] = 1; size_shift[lg] = kAlignShift; } for (size = kAlignment; size <= kMaxSize; size += (1 << alignshift)) { int lg = stb_log2_floor(size); if (lg > last_lg) { // Increase alignment every so often. // // Since we double the alignment every time size doubles and // size >= 128, this means that space wasted due to alignment is // at most 16/128 i.e., 12.5%. Plus we cap the alignment at 256 // bytes, so the space wasted as a percentage starts falling for // sizes > 2K. if ((lg >= 7) && (alignshift < 8)) { alignshift++; } size_base[lg] = next_class - ((size-1) >> alignshift); size_shift[lg] = alignshift; } class_to_size[next_class] = size; last_lg = lg; next_class++; } // Initialize the number of pages we should allocate to split into // small objects for a given class. wasted_pages = 0; for (cl = 1; cl < next_class; cl++) { // Allocate enough pages so leftover is less than 1/8 of total. // This bounds wasted space to at most 12.5%. size_t psize = kPageSize; const size_t s = class_to_size[cl]; while ((psize % s) > (psize >> 3)) { psize += kPageSize; } class_to_pages[cl] = psize >> kPageShift; wasted_pages += psize; } printf("TCMalloc can waste as much as %d memory on one-shot allocations\n", wasted_pages); return; } void test_script(void) { stua_run_script( "var g = (2+3)*5 + 3*(2+1) + ((7)); \n" "func sprint(x) _print(x) _print(' ') x end;\n" "func foo(y) var q = func(x) sprint(x) end; q end;\n " "var z=foo(5); z(77);\n" "func counter(z) func(x) z=z+1 end end\n" "var q=counter(0), p=counter(5);\n" "sprint(q()) sprint(p()) sprint(q()) sprint(p()) sprint(q()) sprint(p())\n" "var x=2222;\n" "if 1 == 2 then 3333 else 4444 end; => x; sprint(x);\n" "var x1 = sprint(1.5e3); \n" "var x2 = sprint(.5); \n" "var x3 = sprint(1.); \n" "var x4 = sprint(1.e3); \n" "var x5 = sprint(1e3); \n" "var x6 = sprint(0.5e3); \n" "var x7 = sprint(.5e3); \n" " func sum(x,y) x+y end \n" " func sumfunc(a) sum+{x=a} end \n" " var q = sumfunc(3) \n" " var p = sumfunc(20) \n" " var d = sprint(q(5)) - sprint(q(8)) \n" " var e = sprint(p(5)) - sprint(p(8)) \n" " func test3(x) \n" " sprint(x) \n" " x = x+3 \n" " sprint(x) \n" " x+5 \n" " end \n" " var y = test3(4); \n" " func fib(x) \n" " if x < 3 then \n" " 1 \n" " else \n" " fib(x-1) + fib(x-2); \n" " end \n" " end \n" " \n" " func fib2(x) \n" " var a=1 \n" " var b=1 \n" " sprint(a) \n" " sprint(b) \n" " while x > 2 do \n" " var c=a+b \n" " a=b \n" " b=c \n" " sprint(b) \n" " x=x-1 \n" " end \n" " b \n" " end \n" " \n" " func assign(z) \n" " var y = { 'this', 'is', 'a', 'lame', 'day', 'to', 'die'} \n" " y[3] = z \n" " var i = 0 \n" " while y[i] != nil do \n" " sprint(y[i]) \n" " i = i+1 \n" " end \n" " end \n" " \n" " sprint(fib(12)); \n" " assign(\"good\"); \n" " fib2(20); \n" " sprint('ok'); \n" " sprint(-5); \n" " // final comment with no newline" ); } #ifdef STB_THREADS extern void __stdcall Sleep(unsigned long); void * thread_1(void *x) { Sleep(80); printf("thread 1\n"); fflush(stdout); return (void *) 2; } void * thread_2(void *y) { stb_work(thread_1, NULL, y); Sleep(50); printf("thread 2\n"); fflush(stdout); return (void *) 3; } stb_semaphore stest; stb_mutex mutex; volatile int tc1, tc2; void *thread_3(void *p) { stb_mutex_begin(mutex); ++tc1; stb_mutex_end(mutex); stb_sem_waitfor(stest); stb_mutex_begin(mutex); ++tc2; stb_mutex_end(mutex); return NULL; } void test_threads(void) { volatile int a=0,b=0; //stb_work_numthreads(2); stb_work(thread_2, (void *) &a, (void *) &b); while (a==0 || b==0) { Sleep(10); //printf("a=%d b=%d\n", a, b); } c(a==2 && b == 3, "stb_thread"); stb_work_numthreads(4); stest = stb_sem_new(8); mutex = stb_mutex_new(); stb_work(thread_3, NULL, NULL); stb_work(thread_3, NULL, NULL); stb_work(thread_3, NULL, NULL); stb_work(thread_3, NULL, NULL); stb_work(thread_3, NULL, NULL); stb_work(thread_3, NULL, NULL); stb_work(thread_3, NULL, NULL); stb_work(thread_3, NULL, NULL); while (tc1 < 4) Sleep(10); c(tc1 == 4, "stb_work 1"); stb_sem_release(stest); stb_sem_release(stest); stb_sem_release(stest); stb_sem_release(stest); stb_sem_release(stest); stb_sem_release(stest); stb_sem_release(stest); stb_sem_release(stest); Sleep(40); while (tc1 != 8 || tc2 != 8) Sleep(10); c(tc1 == 8 && tc2 == 8, "stb_work 2"); stb_work_numthreads(2); stb_work(thread_3, NULL, NULL); stb_work(thread_3, NULL, NULL); stb_work(thread_3, NULL, NULL); stb_work(thread_3, NULL, NULL); while (tc1 < 10) Sleep(10); c(tc1 == 10, "stb_work 1"); stb_sem_release(stest); stb_sem_release(stest); stb_sem_release(stest); stb_sem_release(stest); Sleep(100); stb_sem_delete(stest); stb_mutex_delete(mutex); } #else void test_threads(void) { } #endif void *thread4(void *p) { return NULL; } #ifdef STB_THREADS stb_threadqueue *tq; stb_sync synch; stb_mutex msum; volatile int thread_sum; void *consume1(void *p) { volatile int *q = (volatile int *) p; for(;;) { int z; stb_threadq_get_block(tq, &z); stb_mutex_begin(msum); thread_sum += z; *q += z; stb_mutex_end(msum); stb_sync_reach(synch); } } void test_threads2(void) { int array[256],i,n=0; volatile int which[4]; synch = stb_sync_new(); stb_sync_set_target(synch,2); stb_work_reach(thread4, NULL, NULL, synch); stb_sync_reach_and_wait(synch); printf("ok\n"); tq = stb_threadq_new(4, 1, TRUE,TRUE); msum = stb_mutex_new(); thread_sum = 0; stb_sync_set_target(synch, 65); for (i=0; i < 4; ++i) { which[i] = 0; stb_create_thread(consume1, (int *) &which[i]); } for (i=1; i <= 64; ++i) { array[i] = i; n += i; stb_threadq_add_block(tq, &array[i]); } stb_sync_reach_and_wait(synch); stb_barrier(); c(thread_sum == n, "stb_threadq 1"); c(which[0] + which[1] + which[2] + which[3] == n, "stb_threadq 2"); printf("(Distribution: %d %d %d %d)\n", which[0], which[1], which[2], which[3]); stb_sync_delete(synch); stb_threadq_delete(tq); stb_mutex_delete(msum); } #else void test_threads2(void) { } #endif char tc[] = "testing compression test quick test voila woohoo what the hell"; char storage1[1 << 23]; int test_compression(char *buffer, int length) { char *storage2; int c_len = stb_compress(storage1, buffer, length); int dc_len; printf("Compressed %d to %d\n", length, c_len); dc_len = stb_decompress_length(storage1); storage2 = malloc(dc_len); dc_len = stb_decompress(storage2, storage1, c_len); if (dc_len != length) { free(storage2); return -1; } if (memcmp(buffer, storage2, length) != 0) { free(storage2); return -1; } free(storage2); return c_len; } #if 0 int test_en_compression(char *buffer, int length) { int c_len = stb_en_compress(storage1, buffer, length); int dc_len; printf("Encompressed %d to %d\n", length, c_len); dc_len = stb_en_decompress(storage2, storage1, c_len); if (dc_len != length) return -1; if (memcmp(buffer, storage2, length) != 0) return -1; return c_len; } #endif #define STR_x "xxxxxxxxxxxxxxxxxxxxxxxxxxxxxx" #define STR_y "yyyyyyyyyyyyyyyyyy" #define STR_xy STR_x STR_y #define STR_xyyxy STR_xy STR_y STR_xy #define STR_1 "testing" #define STR_2 STR_xyyxy STR_xy STR_xyyxy STR_xyyxy STR_xy STR_xyyxy #define STR_3 "buh" char buffer[] = STR_1 "\r\n" STR_2 STR_2 STR_2 "\n" STR_3; char str1[] = STR_1; char str2[] = STR_2 STR_2 STR_2; char str3[] = STR_3; int sum(short *s) { int i,total=0; for (i=0; i < stb_arr_len(s); ++i) total += s[i]; return total; } stb_uint stb_adler32_old(stb_uint adler32, stb_uchar *buffer, stb_uint buflen) { const stb_uint ADLER_MOD = 65521; stb_uint s1 = adler32 & 0xffff; stb_uint s2 = adler32 >> 16; while (buflen-- > 0) { // NOTE: much faster implementations are possible! s1 += *buffer++; if (s1 > ADLER_MOD) s1 -= ADLER_MOD; s2 += s1 ; if (s2 > ADLER_MOD) s2 -= ADLER_MOD; } return (s2 << 16) + s1; } static int sample_test[3][5] = { { 1,2,3,4,5 }, { 6,7,8,9,10, }, { 11,12,13,14,15 }, }; typedef struct { unsigned short x,y,z; } struct1; typedef struct { double a; int x,y,z; } struct2; char *args_raw[] = { "foo", "-dxrf", "bar", "-ts" }; char *args[8]; void do_compressor(int,char**); void test_sha1(void); int alloc_num, alloc_size; void dumpfunc(void *ptr, int sz, char *file, int line) { printf("%p (%6d) -- %3d:%s\n", ptr, sz, line, file); alloc_size += sz; alloc_num += 1; } char *expects(stb_matcher *m, char *s, int result, int len, char *str) { int res2,len2=0; res2 = stb_lex(m, s, &len2); c(result == res2 && len == len2, str); return s + len; } void test_lex(void) { stb_matcher *m = stb_lex_matcher(); // tok_en5 .3 20.1 20. .20 .1 char *s = "tok_en5.3 20.1 20. .20.1"; stb_lex_item(m, "[a-zA-Z_][a-zA-Z0-9_]*", 1 ); stb_lex_item(m, "[0-9]*\\.?[0-9]*" , 2 ); stb_lex_item(m, "[\r\n\t ]+" , 3 ); stb_lex_item(m, "." , -99 ); s=expects(m,s,1,7, "stb_lex 1"); s=expects(m,s,2,2, "stb_lex 2"); s=expects(m,s,3,1, "stb_lex 3"); s=expects(m,s,2,4, "stb_lex 4"); s=expects(m,s,3,1, "stb_lex 5"); s=expects(m,s,2,3, "stb_lex 6"); s=expects(m,s,3,1, "stb_lex 7"); s=expects(m,s,2,3, "stb_lex 8"); s=expects(m,s,2,2, "stb_lex 9"); s=expects(m,s,0,0, "stb_lex 10"); stb_matcher_free(m); } typedef struct Btest { struct Btest stb_bst_fields(btest_); int v; } Btest; stb_bst(Btest, btest_, BT2,bt2,v, int, a - b) void bst_test(void) { Btest *root = NULL, *t; int items[500], sorted[500]; int i,j,z; for (z=0; z < 10; ++z) { for (i=0; i < 500; ++i) items[i] = stb_rand() & 0xfffffff; // check for collisions, and retrry if so memcpy(sorted, items, sizeof(sorted)); qsort(sorted, 500, sizeof(sorted[0]), stb_intcmp(0)); for (i=1; i < 500; ++i) if (sorted[i-1] == sorted[i]) break; if (i != 500) { --z; break; } for (i=0; i < 500; ++i) { t = malloc(sizeof(*t)); t->v = items[i]; root = btest_insert(root, t); #ifdef STB_DEBUG btest__validate(root,1); #endif for (j=0; j <= i; ++j) c(btest_find(root, items[j]) != NULL, "stb_bst 1"); for ( ; j < 500; ++j) c(btest_find(root, items[j]) == NULL, "stb_bst 2"); } t = btest_first(root); for (i=0; i < 500; ++i) t = btest_next(root,t); c(t == NULL, "stb_bst 5"); t = btest_last(root); for (i=0; i < 500; ++i) t = btest_prev(root,t); c(t == NULL, "stb_bst 6"); memcpy(sorted, items, sizeof(sorted)); qsort(sorted, 500, sizeof(sorted[0]), stb_intcmp(0)); t = btest_first(root); for (i=0; i < 500; ++i) { assert(t->v == sorted[i]); t = btest_next(root, t); } assert(t == NULL); if (z==1) stb_reverse(items, 500, sizeof(items[0])); else if (z) stb_shuffle(items, 500, sizeof(items[0]), stb_rand()); for (i=0; i < 500; ++i) { t = btest_find(root, items[i]); assert(t != NULL); root = btest_remove(root, t); c(btest_find(root, items[i]) == NULL, "stb_bst 5"); #ifdef STB_DEBUG btest__validate(root, 1); #endif for (j=0; j <= i; ++j) c(btest_find(root, items[j]) == NULL, "stb_bst 3"); for ( ; j < 500; ++j) c(btest_find(root, items[j]) != NULL, "stb_bst 4"); free(t); } } } extern void stu_uninit(void); stb_define_sort(sort_int, int, *a < *b) stb_rand_define(prime_rand, 1) void test_packed_floats(void); void test_parser_generator(void); void rec_print(stb_dirtree2 *d, int depth) { int i; for (i=0; i < depth; ++i) printf(" "); printf("%s (%d)\n", d->relpath, stb_arr_len(d->files)); for (i=0; i < stb_arr_len(d->subdirs); ++i) rec_print(d->subdirs[i], depth+1); d->weight = (float) stb_arr_len(d->files); } #ifdef MAIN_TEST int main(int argc, char **argv) { char *z; stb__wchar buffer7[1024],buffer9[1024]; char buffer8[4096]; FILE *f; char *p1 = "foo/bar\\baz/test.xyz"; char *p2 = "foo/.bar"; char *p3 = "foo.bar"; char *p4 = "foo/bar"; char *wildcards[] = { "*foo*", "*bar", "baz", "*1*2*3*", "*/CVS/repository", "*oof*" }; char **s; char buf[256], *p; int n,len2,*q,i; stb_matcher *mt=NULL; if (argc > 1) { do_compressor(argc,argv); return 0; } test_classes(); //show(); //stb_malloc_check_counter(2,2); //_CrtSetBreakAlloc(10398); stbprint("Checking {!if} the {$fancy} print function {#works}? - should\n"); stbprint(" - align\n"); stbprint("But {#3this}} {one}} - shouldn't\n"); #if 0 { int i; char **s = stb_readdir_recursive("/sean", NULL); stb_dirtree *d = stb_dirtree_from_files_relative("", s, stb_arr_len(s)); stb_dirtree **e; rec_print(d, 0); e = stb_summarize_tree(d,12,4); for (i=0; i < stb_arr_len(e); ++i) { printf("%s\n", e[i]->fullpath); } stb_arr_free(e); stb_fatal("foo"); } #endif stb_("Started stb.c"); test_threads2(); test_threads(); for (i=0; i < 1023 && 5+77*i < 0xd800; ++i) buffer7[i] = 5+77*i; buffer7[i++] = 0xd801; buffer7[i++] = 0xdc02; buffer7[i++] = 0xdbff; buffer7[i++] = 0xdfff; buffer7[i] = 0; p = stb_to_utf8(buffer8, buffer7, sizeof(buffer8)); c(p != NULL, "stb_to_utf8"); if (p != NULL) { stb_from_utf8(buffer9, buffer8, sizeof(buffer9)/2); c(!memcmp(buffer7, buffer9, i*2), "stb_from_utf8"); } z = "foo.*[bd]ak?r"; c( stb_regex(z, "muggle man food is barfy") == 1, "stb_regex 1"); c( stb_regex("foo.*bar", "muggle man food is farfy") == 0, "stb_regex 2"); c( stb_regex("[^a-zA-Z]foo[^a-zA-Z]", "dfoobar xfood") == 0, "stb_regex 3"); c( stb_regex(z, "muman foob is bakrfy") == 1, "stb_regex 4"); z = "foo.*[bd]bk?r"; c( stb_regex(z, "muman foob is bakrfy") == 0, "stb_regex 5"); c( stb_regex(z, "muman foob is bbkrfy") == 1, "stb_regex 6"); stb_regex(NULL,NULL); #if 0 test_parser_generator(); stb_wrapper_listall(dumpfunc); if (alloc_num) printf("Memory still in use: %d allocations of %d bytes.\n", alloc_num, alloc_size); #endif test_script(); p = stb_file("sieve.stua", NULL); if (p) { stua_run_script(p); free(p); } stua_uninit(); //stb_wrapper_listall(dumpfunc); printf("Memory still in use: %d allocations of %d bytes.\n", alloc_num, alloc_size); c(stb_alloc_count_alloc == stb_alloc_count_free, "stb_alloc 0"); bst_test(); c(stb_alloc_count_alloc == stb_alloc_count_free, "stb_alloc 0"); #if 0 // stb_block { int inuse=0, freespace=0; int *x = malloc(10000*sizeof(*x)); stb_block *b = stb_block_new(1, 10000); #define BLOCK_COUNT 1000 int *p = malloc(sizeof(*p) * BLOCK_COUNT); int *l = malloc(sizeof(*l) * BLOCK_COUNT); int i, n, k = 0; memset(x, 0, 10000 * sizeof(*x)); n = 0; while (n < BLOCK_COUNT && k < 1000) { l[n] = 16 + (rand() & 31); p[n] = stb_block_alloc(b, l[n], 0); if (p[n] == 0) break; inuse += l[n]; freespace = 0; for (i=0; i < b->len; ++i) freespace += b->freelist[i].len; assert(freespace + inuse == 9999); for (i=0; i < l[n]; ++i) x[ p[n]+i ] = p[n]; ++n; if (k > 20) { int sz; i = (stb_rand() % n); sz = l[i]; stb_block_free(b, p[i], sz); inuse -= sz; p[i] = p[n-1]; l[i] = l[n-1]; --n; freespace = 0; for (i=0; i < b->len; ++i) freespace += b->freelist[i].len; assert(freespace + inuse == 9999); } ++k; // validate if ((k % 50) == 0) { int j; for (j=0; j < n; ++j) { for (i=0; i < l[j]; ++i) assert(x[ p[j]+i ] == p[j]); } } if ((k % 200) == 0) { stb_block_compact_freelist(b); } } for (i=0; i < n; ++i) stb_block_free(b, p[i], l[i]); stb_block_destroy(b); free(p); free(l); free(x); } blockfile_test(); #endif mt = stb_lex_matcher(); for (i=0; i < 5; ++i) stb_lex_item_wild(mt, wildcards[i], i+1); c(1==stb_lex(mt, "this is a foo in the middle",NULL), "stb_matcher_match 1"); c(0==stb_lex(mt, "this is a bar in the middle",NULL), "stb_matcher_match 2"); c(0==stb_lex(mt, "this is a baz in the middle",NULL), "stb_matcher_match 3"); c(2==stb_lex(mt, "this is a bar",NULL), "stb_matcher_match 4"); c(0==stb_lex(mt, "this is a baz",NULL), "stb_matcher_match 5"); c(3==stb_lex(mt, "baz",NULL), "stb_matcher_match 6"); c(4==stb_lex(mt, "1_2_3_4",NULL), "stb_matcher_match 7"); c(0==stb_lex(mt, "1 3 3 3 3 2 ",NULL), "stb_matcher_match 8"); c(4==stb_lex(mt, "1 3 3 3 2 3 ",NULL), "stb_matcher_match 9"); c(5==stb_lex(mt, "C:/sean/prj/old/gdmag/mipmap/hqp/adol-c/CVS/Repository",NULL), "stb_matcher_match 10"); stb_matcher_free(mt); { #define SSIZE 500000 static int arr[SSIZE],arr2[SSIZE]; int i,good; for (i=0; i < SSIZE; ++i) arr2[i] = stb_rand(); memcpy(arr,arr2,sizeof(arr)); printf("stb_define_sort:\n"); sort_int(arr, SSIZE); good = 1; for (i=0; i+1 < SSIZE; ++i) if (arr[i] > arr[i+1]) good = 0; c(good, "stb_define_sort"); printf("qsort:\n"); qsort(arr2, SSIZE, sizeof(arr2[0]), stb_intcmp(0)); printf("done\n"); // check for bugs memset(arr, 0, sizeof(arr[0]) * 1000); sort_int(arr, 1000); } c(stb_alloc_count_alloc == stb_alloc_count_free, "stb_alloc -2"); c( stb_is_prime( 2), "stb_is_prime 1"); c( stb_is_prime( 3), "stb_is_prime 2"); c( stb_is_prime( 5), "stb_is_prime 3"); c( stb_is_prime( 7), "stb_is_prime 4"); c(!stb_is_prime( 9), "stb_is_prime 5"); c( stb_is_prime(11), "stb_is_prime 6"); c(!stb_is_prime(25), "stb_is_prime 7"); c(!stb_is_prime(27), "stb_is_prime 8"); c( stb_is_prime(29), "stb_is_prime 9"); c( stb_is_prime(31), "stb_is_prime a"); c(!stb_is_prime(33), "stb_is_prime b"); c(!stb_is_prime(35), "stb_is_prime c"); c(!stb_is_prime(36), "stb_is_prime d"); for (n=7; n < 64; n += 3) { int i; stb_perfect s; unsigned int *p = malloc(n * sizeof(*p)); for (i=0; i < n; ++i) p[i] = i*i; c(stb_perfect_create(&s, p, n), "stb_perfect_hash 1"); stb_perfect_destroy(&s); for (i=0; i < n; ++i) p[i] = stb_rand(); c(stb_perfect_create(&s, p, n), "stb_perfect_hash 2"); stb_perfect_destroy(&s); for (i=0; i < n; ++i) p[i] = (0x80000000 >> stb_log2_ceil(n>>1)) * i; c(stb_perfect_create(&s, p, n), "stb_perfect_hash 2"); stb_perfect_destroy(&s); for (i=0; i < n; ++i) p[i] = (int) malloc(1024); c(stb_perfect_create(&s, p, n), "stb_perfect_hash 3"); stb_perfect_destroy(&s); for (i=0; i < n; ++i) free((void *) p[i]); free(p); } printf("Maximum attempts required to find perfect hash: %d\n", stb_perfect_hash_max_failures); p = "abcdefghijklmnopqrstuvwxyz"; c(stb_ischar('c', p), "stb_ischar 1"); c(stb_ischar('x', p), "stb_ischar 2"); c(!stb_ischar('#', p), "stb_ischar 3"); c(!stb_ischar('X', p), "stb_ischar 4"); p = "0123456789"; c(!stb_ischar('c', p), "stb_ischar 5"); c(!stb_ischar('x', p), "stb_ischar 6"); c(!stb_ischar('#', p), "stb_ischar 7"); c(!stb_ischar('X', p), "stb_ischar 8"); p = "#####"; c(!stb_ischar('c', p), "stb_ischar a"); c(!stb_ischar('x', p), "stb_ischar b"); c(stb_ischar('#', p), "stb_ischar c"); c(!stb_ischar('X', p), "stb_ischar d"); p = "xXyY"; c(!stb_ischar('c', p), "stb_ischar e"); c(stb_ischar('x', p), "stb_ischar f"); c(!stb_ischar('#', p), "stb_ischar g"); c(stb_ischar('X', p), "stb_ischar h"); c(stb_alloc_count_alloc == stb_alloc_count_free, "stb_alloc 1"); q = stb_wordwrapalloc(15, "How now brown cow. Testinglishously. Okey dokey"); // How now brown // cow. Testinglis // hously. Okey // dokey c(stb_arr_len(q) == 8, "stb_wordwrap 8"); c(q[2] == 14 && q[3] == 15, "stb_wordwrap 9"); c(q[4] == 29 && q[5] == 12, "stb_wordwrap 10"); stb_arr_free(q); q = stb_wordwrapalloc(20, "How now brown cow. Testinglishously. Okey dokey"); // How now brown cow. // Testinglishously. // Okey dokey c(stb_arr_len(q) == 6, "stb_wordwrap 1"); c(q[0] == 0 && q[1] == 18, "stb_wordwrap 2"); c(q[2] == 19 && q[3] == 17, "stb_wordwrap 3"); c(q[4] == 37 && q[5] == 10, "stb_wordwrap 4"); stb_arr_free(q); q = stb_wordwrapalloc(12, "How now brown cow. Testinglishously. Okey dokey"); // How now // brown cow. // Testinglisho // usly. Okey // dokey c(stb_arr_len(q) == 10, "stb_wordwrap 5"); c(q[4] == 19 && q[5] == 12, "stb_wordwrap 6"); c(q[6] == 31 && q[3] == 10, "stb_wordwrap 7"); stb_arr_free(q); //test_script(); //test_packed_floats(); c(stb_alloc_count_alloc == stb_alloc_count_free, "stb_alloc 0"); if (stb_alloc_count_alloc != stb_alloc_count_free) { printf("%d allocs, %d frees\n", stb_alloc_count_alloc, stb_alloc_count_free); } test_lex(); mt = stb_regex_matcher(".*foo.*bar.*"); c(stb_matcher_match(mt, "foobarx") == 1, "stb_matcher_match 1"); c(stb_matcher_match(mt, "foobar") == 1, "stb_matcher_match 2"); c(stb_matcher_match(mt, "foo bar") == 1, "stb_matcher_match 3"); c(stb_matcher_match(mt, "fo foo ba ba bar ba") == 1, "stb_matcher_match 4"); c(stb_matcher_match(mt, "fo oo oo ba ba bar foo") == 0, "stb_matcher_match 5"); stb_free(mt); mt = stb_regex_matcher(".*foo.?bar.*"); c(stb_matcher_match(mt, "abfoobarx") == 1, "stb_matcher_match 6"); c(stb_matcher_match(mt, "abfoobar") == 1, "stb_matcher_match 7"); c(stb_matcher_match(mt, "abfoo bar") == 1, "stb_matcher_match 8"); c(stb_matcher_match(mt, "abfoo bar") == 0, "stb_matcher_match 9"); c(stb_matcher_match(mt, "abfo foo ba ba bar ba") == 0, "stb_matcher_match 10"); c(stb_matcher_match(mt, "abfo oo oo ba ba bar foo") == 0, "stb_matcher_match 11"); stb_free(mt); mt = stb_regex_matcher(".*m((foo|bar)*baz)m.*"); c(stb_matcher_match(mt, "abfoobarx") == 0, "stb_matcher_match 12"); c(stb_matcher_match(mt, "a mfoofoofoobazm d") == 1, "stb_matcher_match 13"); c(stb_matcher_match(mt, "a mfoobarbazfoom d") == 0, "stb_matcher_match 14"); c(stb_matcher_match(mt, "a mbarbarfoobarbazm d") == 1, "stb_matcher_match 15"); c(stb_matcher_match(mt, "a mfoobarfoo bazm d") == 0, "stb_matcher_match 16"); c(stb_matcher_match(mt, "a mm foobarfoobarfoobar ") == 0, "stb_matcher_match 17"); stb_free(mt); mt = stb_regex_matcher("f*|z"); c(stb_matcher_match(mt, "fz") == 0, "stb_matcher_match 0a"); c(stb_matcher_match(mt, "ff") == 1, "stb_matcher_match 0b"); c(stb_matcher_match(mt, "z") == 1, "stb_matcher_match 0c"); stb_free(mt); mt = stb_regex_matcher("m(f|z*)n"); c(stb_matcher_match(mt, "mfzn") == 0, "stb_matcher_match 0d"); c(stb_matcher_match(mt, "mffn") == 0, "stb_matcher_match 0e"); c(stb_matcher_match(mt, "mzn") == 1, "stb_matcher_match 0f"); c(stb_matcher_match(mt, "mn") == 1, "stb_matcher_match 0g"); c(stb_matcher_match(mt, "mzfn") == 0, "stb_matcher_match 0f"); c(stb_matcher_find(mt, "manmanmannnnnnnmmmmmmmmm ") == 0, "stb_matcher_find 1"); c(stb_matcher_find(mt, "manmanmannnnnnnmmmmmmmmm ") == 0, "stb_matcher_find 2"); c(stb_matcher_find(mt, "manmanmannnnnnnmmmmmmmmmffzzz ") == 0, "stb_matcher_find 3"); c(stb_matcher_find(mt, "manmanmannnnnnnmmmmmmmmmnfzzz ") == 1, "stb_matcher_find 4"); c(stb_matcher_find(mt, "mmmfn aanmannnnnnnmmmmmm fzzz ") == 1, "stb_matcher_find 5"); c(stb_matcher_find(mt, "mmmzzn anmannnnnnnmmmmmm fzzz ") == 1, "stb_matcher_find 6"); c(stb_matcher_find(mt, "mm anmannnnnnnmmmmmm fzmzznzz ") == 1, "stb_matcher_find 7"); c(stb_matcher_find(mt, "mm anmannnnnnnmmmmmm fzmzzfnzz ") == 0, "stb_matcher_find 8"); c(stb_matcher_find(mt, "manmfnmannnnnnnmmmmmmmmmffzzz ") == 1, "stb_matcher_find 9"); stb_free(mt); mt = stb_regex_matcher(".*m((foo|bar)*|baz)m.*"); c(stb_matcher_match(mt, "abfoobarx") == 0, "stb_matcher_match 18"); c(stb_matcher_match(mt, "a mfoofoofoobazm d") == 0, "stb_matcher_match 19"); c(stb_matcher_match(mt, "a mfoobarbazfoom d") == 0, "stb_matcher_match 20"); c(stb_matcher_match(mt, "a mbazm d") == 1, "stb_matcher_match 21"); c(stb_matcher_match(mt, "a mfoobarfoom d") == 1, "stb_matcher_match 22"); c(stb_matcher_match(mt, "a mm foobarfoobarfoobar ") == 1, "stb_matcher_match 23"); stb_free(mt); mt = stb_regex_matcher("[a-fA-F]..[^]a-zA-Z]"); c(stb_matcher_match(mt, "Axx1") == 1, "stb_matcher_match 24"); c(stb_matcher_match(mt, "Fxx1") == 1, "stb_matcher_match 25"); c(stb_matcher_match(mt, "Bxx]") == 0, "stb_matcher_match 26"); c(stb_matcher_match(mt, "Cxxz") == 0, "stb_matcher_match 27"); c(stb_matcher_match(mt, "gxx[") == 0, "stb_matcher_match 28"); c(stb_matcher_match(mt, "-xx0") == 0, "stb_matcher_match 29"); stb_free(mt); c(stb_wildmatch("foo*bar", "foobarx") == 0, "stb_wildmatch 0a"); c(stb_wildmatch("foo*bar", "foobar") == 1, "stb_wildmatch 1a"); c(stb_wildmatch("foo*bar", "foo bar") == 1, "stb_wildmatch 2a"); c(stb_wildmatch("foo*bar", "fo foo ba ba bar ba") == 0, "stb_wildmatch 3a"); c(stb_wildmatch("foo*bar", "fo oo oo ba ba ar foo") == 0, "stb_wildmatch 4a"); c(stb_wildmatch("*foo*bar*", "foobar") == 1, "stb_wildmatch 1b"); c(stb_wildmatch("*foo*bar*", "foo bar") == 1, "stb_wildmatch 2b"); c(stb_wildmatch("*foo*bar*", "fo foo ba ba bar ba") == 1, "stb_wildmatch 3b"); c(stb_wildmatch("*foo*bar*", "fo oo oo ba ba ar foo") == 0, "stb_wildmatch 4b"); c(stb_wildmatch("foo*bar*", "foobarx") == 1, "stb_wildmatch 1c"); c(stb_wildmatch("foo*bar*", "foobabar") == 1, "stb_wildmatch 2c"); c(stb_wildmatch("foo*bar*", "fo foo ba ba bar ba") == 0, "stb_wildmatch 3c"); c(stb_wildmatch("foo*bar*", "fo oo oo ba ba ar foo") == 0, "stb_wildmatch 4c"); c(stb_wildmatch("*foo*bar", "foobar") == 1, "stb_wildmatch 1d"); c(stb_wildmatch("*foo*bar", "foo bar") == 1, "stb_wildmatch 2d"); c(stb_wildmatch("*foo*bar", "fo foo ba ba bar ba") == 0, "stb_wildmatch 3d"); c(stb_wildmatch("*foo*bar", "fo oo oo ba ba ar foo") == 0, "stb_wildmatch 4d"); c(stb_wildfind("foo*bar", "xyfoobarx") == 2, "stb_wildfind 0a"); c(stb_wildfind("foo*bar", "aaafoobar") == 3, "stb_wildfind 1a"); c(stb_wildfind("foo*bar", "foo bar") == 0, "stb_wildfind 2a"); c(stb_wildfind("foo*bar", "fo foo ba ba bar ba") == 3, "stb_wildfind 3a"); c(stb_wildfind("foo*bar", "fo oo oo ba ba ar foo") == -1, "stb_wildfind 4a"); c(stb_wildmatch("*foo*;*bar*", "foobar") == 1, "stb_wildmatch 1e"); c(stb_wildmatch("*foo*;*bar*", "afooa") == 1, "stb_wildmatch 2e"); c(stb_wildmatch("*foo*;*bar*", "abara") == 1, "stb_wildmatch 3e"); c(stb_wildmatch("*foo*;*bar*", "abaza") == 0, "stb_wildmatch 4e"); c(stb_wildmatch("*foo*;*bar*", "foboar") == 0, "stb_wildmatch 5e"); test_sha1(); n = sizeof(args_raw)/sizeof(args_raw[0]); memcpy(args, args_raw, sizeof(args_raw)); s = stb_getopt(&n, args); c(n >= 1 && !strcmp(args[1], "bar" ), "stb_getopt 1"); c(stb_arr_len(s) >= 2 && !strcmp(s[2] , "r" ), "stb_getopt 2"); stb_getopt_free(s); n = sizeof(args_raw)/sizeof(args_raw[0]); memcpy(args, args_raw, sizeof(args_raw)); s = stb_getopt_param(&n, args, "f"); c(stb_arr_len(s) >= 3 && !strcmp(s[3] , "fbar"), "stb_getopt 3"); stb_getopt_free(s); n = sizeof(args_raw)/sizeof(args_raw[0]); memcpy(args, args_raw, sizeof(args_raw)); s = stb_getopt_param(&n, args, "x"); c(stb_arr_len(s) >= 2 && !strcmp(s[1] , "xrf" ), "stb_getopt 4"); stb_getopt_free(s); n = sizeof(args_raw)/sizeof(args_raw[0]); memcpy(args, args_raw, sizeof(args_raw)); s = stb_getopt_param(&n, args, "s"); c(s == NULL && n == 0 , "stb_getopt 5"); stb_getopt_free(s); #if 0 c(*stb_csample_int(sample_test[0], 1, 5, 5, 3, -1, -1) == 1, "stb_csample_int 1"); c(*stb_csample_int(sample_test[0], 1, 5, 5, 3, 1, -3) == 2, "stb_csample_int 2"); c(*stb_csample_int(sample_test[0], 1, 5, 5, 3, 12, -2) == 5, "stb_csample_int 3"); c(*stb_csample_int(sample_test[0], 1, 5, 5, 3, 15, 1) == 10, "stb_csample_int 4"); c(*stb_csample_int(sample_test[0], 1, 5, 5, 3, 5, 4) == 15, "stb_csample_int 5"); c(*stb_csample_int(sample_test[0], 1, 5, 5, 3, 3, 3) == 14, "stb_csample_int 6"); c(*stb_csample_int(sample_test[0], 1, 5, 5, 3, -2, 5) == 11, "stb_csample_int 7"); c(*stb_csample_int(sample_test[0], 1, 5, 5, 3, -7, 0) == 1, "stb_csample_int 8"); c(*stb_csample_int(sample_test[0], 1, 5, 5, 3, 2, 1) == 8, "stb_csample_int 9"); #endif c(!strcmp(stb_splitpath(buf, p1, STB_PATH ), "foo/bar\\baz/"), "stb_splitpath 1"); c(!strcmp(stb_splitpath(buf, p1, STB_FILE ), "test"), "stb_splitpath 2"); c(!strcmp(stb_splitpath(buf, p1, STB_EXT ), ".xyz"), "stb_splitpath 3"); c(!strcmp(stb_splitpath(buf, p1, STB_PATH_FILE ), "foo/bar\\baz/test"), "stb_splitpath 4"); c(!strcmp(stb_splitpath(buf, p1, STB_FILE_EXT ), "test.xyz"), "stb_splitpath 5"); c(!strcmp(stb_splitpath(buf, p2, STB_PATH ), "foo/"), "stb_splitpath 6"); c(!strcmp(stb_splitpath(buf, p2, STB_FILE ), ""), "stb_splitpath 7"); c(!strcmp(stb_splitpath(buf, p2, STB_EXT ), ".bar"), "stb_splitpath 8"); c(!strcmp(stb_splitpath(buf, p2, STB_PATH_FILE ), "foo/"), "stb_splitpath 9"); c(!strcmp(stb_splitpath(buf, p2, STB_FILE_EXT ), ".bar"), "stb_splitpath 10"); c(!strcmp(stb_splitpath(buf, p3, STB_PATH ), "./"), "stb_splitpath 11"); c(!strcmp(stb_splitpath(buf, p3, STB_FILE ), "foo"), "stb_splitpath 12"); c(!strcmp(stb_splitpath(buf, p3, STB_EXT ), ".bar"), "stb_splitpath 13"); c(!strcmp(stb_splitpath(buf, p3, STB_PATH_FILE ), "foo"), "stb_splitpath 14"); c(!strcmp(stb_splitpath(buf, p4, STB_PATH ), "foo/"), "stb_splitpath 16"); c(!strcmp(stb_splitpath(buf, p4, STB_FILE ), "bar"), "stb_splitpath 17"); c(!strcmp(stb_splitpath(buf, p4, STB_EXT ), ""), "stb_splitpath 18"); c(!strcmp(stb_splitpath(buf, p4, STB_PATH_FILE ), "foo/bar"), "stb_splitpath 19"); c(!strcmp(stb_splitpath(buf, p4, STB_FILE_EXT ), "bar"), "stb_splitpath 20"); c(!strcmp(p=stb_dupreplace("testfootffooo foo fox", "foo", "brap"), "testbraptfbrapo brap fox"), "stb_dupreplace 1"); free(p); c(!strcmp(p=stb_dupreplace("testfootffooo foo fox", "foo", "" ), "testtfo fox" ), "stb_dupreplace 2"); free(p); c(!strcmp(p=stb_dupreplace("abacab", "a", "aba"), "abababacabab" ), "stb_dupreplace 3"); free(p); #if 0 m = stb_mml_parse("xy<&f>"); c(m != NULL, "stb_mml_parse 1"); if (m) { c(!strcmp(m->child[0]->child[0]->child[1]->tag, "d"), "stb_mml_parse 2"); c(!strcmp(m->child[0]->child[1]->leaf_data, "<&f>"), "stb_mml_parse 3"); } if (m) stb_mml_free(m); c(stb_alloc_count_alloc == stb_alloc_count_free, "stb_alloc 1"); if (stb_alloc_count_alloc != stb_alloc_count_free) { printf("%d allocs, %d frees\n", stb_alloc_count_alloc, stb_alloc_count_free); } #endif c(stb_linear_remap(3.0f,0,8,1,2) == 1.375, "stb_linear_remap()"); c(stb_bitreverse(0x1248fec8) == 0x137f1248, "stb_bitreverse() 1"); c(stb_bitreverse8(0x4e) == 0x72, "stb_bitreverse8() 1"); c(stb_bitreverse8(0x31) == 0x8c, "stb_bitreverse8() 2"); for (n=1; n < 255; ++n) { unsigned int m = stb_bitreverse8((uint8) n); c(stb_bitreverse8((uint8) m) == (unsigned int) n, "stb_bitreverse8() 3"); } for (n=2; n <= 31; ++n) { c(stb_is_pow2 ((1 << n) ) == 1 , "stb_is_pow2() 1"); c(stb_is_pow2 ((1 << n)+1) == 0 , "stb_is_pow2() 2"); c(stb_is_pow2 ((1 << n)-1) == 0 , "stb_is_pow2() 3"); c(stb_log2_floor((1 << n) ) == n , "stb_log2_floor() 1"); c(stb_log2_floor((1 << n)+1) == n , "stb_log2_floor() 2"); c(stb_log2_floor((1 << n)-1) == n-1, "stb_log2_floor() 3"); c(stb_log2_ceil ((1 << n) ) == n , "stb_log2_ceil() 1"); c(stb_log2_ceil ((1 << n)+1) == n+1, "stb_log2_ceil() 2"); c(stb_log2_ceil ((1 << n)-1) == n , "stb_log2_ceil() 3"); c(stb_bitreverse(1 << n) == 1U << (31-n), "stb_bitreverse() 2"); } c(stb_log2_floor(0) == -1, "stb_log2_floor() 4"); c(stb_log2_ceil (0) == -1, "stb_log2_ceil () 4"); c(stb_log2_floor(-1) == 31, "stb_log2_floor() 5"); c(stb_log2_ceil (-1) == 32, "stb_log2_ceil () 5"); c(stb_bitcount(0xffffffff) == 32, "stb_bitcount() 1"); c(stb_bitcount(0xaaaaaaaa) == 16, "stb_bitcount() 2"); c(stb_bitcount(0x55555555) == 16, "stb_bitcount() 3"); c(stb_bitcount(0x00000000) == 0, "stb_bitcount() 4"); c(stb_lowbit8(0xf0) == 4, "stb_lowbit8 1"); c(stb_lowbit8(0x10) == 4, "stb_lowbit8 2"); c(stb_lowbit8(0xf3) == 0, "stb_lowbit8 3"); c(stb_lowbit8(0xf8) == 3, "stb_lowbit8 4"); c(stb_lowbit8(0x60) == 5, "stb_lowbit8 5"); for (n=0; n < sizeof(buf); ++n) buf[n] = 0; for (n = 0; n < 200000; ++n) { unsigned int k = stb_rand(); int i,z=0; for (i=0; i < 32; ++i) if (k & (1 << i)) ++z; c(stb_bitcount(k) == z, "stb_bitcount() 5"); buf[k >> 24] = 1; if (k != 0) { if (stb_is_pow2(k)) { c(stb_log2_floor(k) == stb_log2_ceil(k), "stb_is_pow2() 1"); c(k == 1U << stb_log2_floor(k), "stb_is_pow2() 2"); } else { c(stb_log2_floor(k) == stb_log2_ceil(k)-1, "stb_is_pow2() 3"); } } c(stb_bitreverse(stb_bitreverse(n)) == (uint32) n, "stb_bitreverse() 3"); } // make sure reasonable coverage from stb_rand() for (n=0; n < sizeof(buf); ++n) c(buf[n] != 0, "stb_rand()"); for (n=0; n < sizeof(buf); ++n) buf[n] = 0; for (n=0; n < 60000; ++n) { float z = (float) stb_frand(); int n = (int) (z * sizeof(buf)); c(z >= 0 && z < 1, "stb_frand() 1"); c(n >= 0 && n < sizeof(buf), "stb_frand() 2"); buf[n] = 1; } // make sure reasonable coverage from stb_frand(), // e.g. that the range remap isn't incorrect for (n=0; n < sizeof(buf); ++n) c(buf[n] != 0, "stb_frand()"); // stb_arr { short *s = NULL; c(sum(s) == 0, "stb_arr 1"); stb_arr_add(s); s[0] = 3; stb_arr_push(s,7); c( stb_arr_valid(s,1), "stb_arr 2"); c(!stb_arr_valid(s,2), "stb_arr 3"); // force a realloc stb_arr_push(s,0); stb_arr_push(s,0); stb_arr_push(s,0); stb_arr_push(s,0); c(sum(s) == 10, "stb_arr 4"); stb_arr_push(s,0); s[0] = 1; s[1] = 5; s[2] = 20; c(sum(s) == 26, "stb_arr 5"); stb_arr_setlen(s,2); c(sum(s) == 6, "stb_arr 6"); stb_arr_setlen(s,1); c(sum(s) == 1, "stb_arr 7"); stb_arr_setlen(s,0); c(sum(s) == 0, "stb_arr 8"); stb_arr_push(s,3); stb_arr_push(s,4); stb_arr_push(s,5); stb_arr_push(s,6); stb_arr_push(s,7); stb_arr_deleten(s,1,3); c(stb_arr_len(s)==2 && sum(s) == 10, "stb_arr_9"); stb_arr_push(s,2); // 3 7 2 stb_arr_insertn(s,2,2); // 3 7 x x 2 s[2] = 5; s[3] = 6; c(s[0]==3 && s[1] == 7 && s[2] == 5 && s[3] == 6 && s[4] == 2, "stb_arr 10"); stb_arr_free(s); } #if 1 f= stb_fopen("data/stb.test", "wb"); fwrite(buffer, 1, sizeof(buffer)-1, f); stb_fclose(f, stb_keep_yes); #ifndef WIN32 sleep(1); // andLinux has some synchronization problem here #endif #else f= fopen("data/stb.test", "wb"); fwrite(buffer, 1, sizeof(buffer)-1, f); fclose(f); #endif if (!stb_fexists("data/stb.test")) { fprintf(stderr, "Error: couldn't open file just written, or stb_fexists() is broken.\n"); } f = fopen("data/stb.test", "rb"); // f = NULL; // test stb_fatal() if (!f) { stb_fatal("Error: couldn't open file just written\n"); } else { char temp[4]; int len1 = stb_filelen(f), len2; int n1,n2; if (fread(temp,1,4,f) == 0) { int n = ferror(f); if (n) { stb_fatal("Error reading from stream: %d", n); } if (feof(f)) stb_fatal("Weird, read 0 bytes and hit eof"); stb_fatal("Read 0, but neither feof nor ferror is true"); } fclose(f); p = stb_file("data/stb.test", &len2); if (p == NULL) stb_fatal("Error: stb_file() failed"); c(len1 == sizeof(buffer)-1, "stb_filelen()"); c(len2 == sizeof(buffer)-1, "stb_file():n"); c(memcmp(p, buffer, sizeof(buffer)-1) == 0, "stb_file()"); c(strcmp(p, buffer)==0, "stb_file() terminated"); free(p); s = stb_stringfile("data/stb.test", &n1); c(n1 == 3, "stb_stringfile():n"); n2 = 0; while (s[n2]) ++n2; c(n1 == n2, "stb_stringfile():n length matches the non-NULL strings"); if (n2 == 3) { c(strcmp(s[0],str1)==0, "stb_stringfile()[0]"); c(strcmp(s[1],str2)==0, "stb_stringfile()[1]"); c(strcmp(s[2],str3)==0, "stb_stringfile()[2] (no terminating newlines)"); } free(s); f = fopen("data/stb.test", "rb"); stb_fgets(buf, sizeof(buf), f); //c(strcmp(buf, str1)==0, "stb_fgets()"); p = stb_fgets_malloc(f); n1 = strlen(p); n2 = strlen(str2); c(strcmp(p, str2)==0, "stb_fgets_malloc()"); free(p); stb_fgets(buf, sizeof(buf), f); c(strcmp(buf, str3)==0, "stb_fgets()3"); } c( stb_prefix("foobar", "foo"), "stb_prefix() 1"); c(!stb_prefix("foo", "foobar"), "stb_prefix() 2"); c( stb_prefix("foob", "foob" ), "stb_prefix() 3"); stb_strncpy(buf, "foobar", 6); c(strcmp(buf,"fooba" )==0, "stb_strncpy() 1"); stb_strncpy(buf, "foobar", 8); c(strcmp(buf,"foobar")==0, "stb_strncpy() 2"); c(!strcmp(p=stb_duplower("FooBar"), "foobar"), "stb_duplower()"); free(p); strcpy(buf, "FooBar"); stb_tolower(buf); c(!strcmp(buf, "foobar"), "stb_tolower()"); p = stb_strtok(buf, "foo=ba*r", "#=*"); c(!strcmp(buf, "foo" ), "stb_strtok() 1"); c(!strcmp(p , "ba*r"), "stb_strtok() 2"); p = stb_strtok(buf, "foobar", "#=*"); c(*p == 0, "stb_strtok() 3"); c(!strcmp(stb_skipwhite(" \t\n foo"), "foo"), "stb_skipwhite()"); s = stb_tokens("foo == ba*r", "#=*", NULL); c(!strcmp(s[0], "foo "), "stb_tokens() 1"); c(!strcmp(s[1], " ba"), "stb_tokens() 2"); c(!strcmp(s[2], "r"), "stb_tokens() 3"); c(s[3] == 0, "stb_tokens() 4"); free(s); s = stb_tokens_allowempty("foo == ba*r", "#=*", NULL); c(!strcmp(s[0], "foo "), "stb_tokens_allowempty() 1"); c(!strcmp(s[1], "" ), "stb_tokens_allowempty() 2"); c(!strcmp(s[2], " ba"), "stb_tokens_allowempty() 3"); c(!strcmp(s[3], "r"), "stb_tokens_allowempty() 4"); c(s[4] == 0, "stb_tokens_allowempty() 5"); free(s); s = stb_tokens_stripwhite("foo == ba*r", "#=*", NULL); c(!strcmp(s[0], "foo"), "stb_tokens_stripwhite() 1"); c(!strcmp(s[1], "" ), "stb_tokens_stripwhite() 2"); c(!strcmp(s[2], "ba"), "stb_tokens_stripwhite() 3"); c(!strcmp(s[3], "r"), "stb_tokens_stripwhite() 4"); c(s[4] == 0, "stb_tokens_stripwhite() 5"); free(s); s = stb_tokens_quoted("foo =\"=\" ba*\"\"r \" foo\" bah ", "#=*", NULL); c(!strcmp(s[0], "foo"), "stb_tokens_quoted() 1"); c(!strcmp(s[1], "= ba"), "stb_tokens_quoted() 2"); c(!strcmp(s[2], "\"r foo bah"), "stb_tokens_quoted() 3"); c(s[3] == 0, "stb_tokens_quoted() 4"); free(s); p = stb_file("stb.h", &len2); if (p) { uint32 z = stb_adler32_old(1, p, len2); uint32 x = stb_adler32 (1, p, len2); c(z == x, "stb_adler32() 1"); memset(p,0xff,len2); z = stb_adler32_old((65520<<16) + 65520, p, len2); x = stb_adler32 ((65520<<16) + 65520, p, len2); c(z == x, "stb_adler32() 2"); free(p); } // stb_hheap { #define HHEAP_COUNT 100000 void **p = malloc(sizeof(*p) * HHEAP_COUNT); int i, j; #if 0 stb_hheap *h2, *h = stb_newhheap(sizeof(struct1),0); for (i=0; i < HHEAP_COUNT; ++i) p[i] = stb_halloc(h); stb_shuffle(p, HHEAP_COUNT, sizeof(*p), stb_rand()); for (i=0; i < HHEAP_COUNT; ++i) stb_hfree(p[i]); c(h->num_alloc == 0, "stb_hheap 1"); stb_delhheap(h); h = stb_newhheap(sizeof(struct1),0); h2 = stb_newhheap(sizeof(struct2),8); for (i=0; i < HHEAP_COUNT; ++i) { if (i & 1) p[i] = stb_halloc(h); else { p[i] = stb_halloc(h2); c((((int) p[i]) & 4) == 0, "stb_hheap 2"); } } stb_shuffle(p, HHEAP_COUNT, sizeof(*p), stb_rand()); for (i=0; i < HHEAP_COUNT; ++i) stb_hfree(p[i]); c(h->num_alloc == 0, "stb_hheap 3"); c(h2->num_alloc == 0, "stb_hheap 4"); stb_delhheap(h); stb_delhheap(h2); #else for (i=0; i < HHEAP_COUNT; ++i) p[i] = malloc(32); stb_shuffle(p, HHEAP_COUNT, sizeof(*p), stb_rand()); for (i=0; i < HHEAP_COUNT; ++i) free(p[i]); #endif // now use the same array of pointers to do pointer set operations for (j=100; j < HHEAP_COUNT; j += 25000) { stb_ps *ps = NULL; for (i=0; i < j; ++i) ps = stb_ps_add(ps, p[i]); for (i=0; i < HHEAP_COUNT; ++i) c(stb_ps_find(ps, p[i]) == (i < j), "stb_ps 1"); c(stb_ps_count(ps) == j, "stb_ps 1b"); for (i=j; i < HHEAP_COUNT; ++i) ps = stb_ps_add(ps, p[i]); for (i=0; i < j; ++i) ps = stb_ps_remove(ps, p[i]); for (i=0; i < HHEAP_COUNT; ++i) c(stb_ps_find(ps, p[i]) == !(i < j), "stb_ps 2"); stb_ps_delete(ps); } #define HHEAP_COUNT2 100 // now use the same array of pointers to do pointer set operations for (j=1; j < 40; ++j) { stb_ps *ps = NULL; for (i=0; i < j; ++i) ps = stb_ps_add(ps, p[i]); for (i=0; i < HHEAP_COUNT2; ++i) c(stb_ps_find(ps, p[i]) == (i < j), "stb_ps 3"); c(stb_ps_count(ps) == j, "stb_ps 3b"); for (i=j; i < HHEAP_COUNT2; ++i) ps = stb_ps_add(ps, p[i]); for (i=0; i < j; ++i) ps = stb_ps_remove(ps, p[i]); for (i=0; i < HHEAP_COUNT2; ++i) c(stb_ps_find(ps, p[i]) == !(i < j), "stb_ps 4"); stb_ps_delete(ps); } free(p); } n = test_compression(tc, sizeof(tc)); c(n >= 0, "stb_compress()/stb_decompress() 1"); p = stb_file("stb.h", &len2); if (p) { FILE *f = fopen("data/stb_h.z", "wb"); if (stb_compress_stream_start(f)) { int i; void *q; int len3; for (i=0; i < len2; ) { int n = stb_rand() % 10; if (n <= 6) n = 1 + stb_rand()%16; else if (n <= 8) n = 20 + stb_rand() % 1000; else n = 15000; if (i + n > len2) n = len2 - i; stb_write(p + i, n); i += n; } stb_compress_stream_end(1); q = stb_decompress_fromfile("data/stb_h.z", &len3); c(len3 == len2, "stb_compress_stream 2"); if (len2 == len3) c(!memcmp(p,q,len2), "stb_compress_stream 3"); if (q) free(q); } else { c(0, "stb_compress_stream 1"); } free(p); stb_compress_window(65536*4); } p = stb_file("stb.h", &len2); if (p) { n = test_compression(p, len2); c(n >= 0, "stb_compress()/stb_decompress() 2"); #if 0 n = test_en_compression(p, len2); c(n >= 0, "stb_en_compress()/stb_en_decompress() 2"); #endif free(p); } else { fprintf(stderr, "No stb.h to compression test.\n"); } p = stb_file("data/test.bmp", &len2); if (p) { n = test_compression(p, len2); c(n == 106141, "stb_compress()/stb_decompress() 4"); #if 0 n = test_en_compression(p, len2); c(n >= 0, "stb_en_compress()/stb_en_decompress() 4"); #endif free(p); } // the hardcoded compressed lengths being verified _could_ // change if you changed the compresser parameters; but pure // performance optimizations shouldn't change them p = stb_file("data/cantrbry.zip", &len2); if (p) { n = test_compression(p, len2); c(n == 642787, "stb_compress()/stb_decompress() 3"); #if 0 n = test_en_compression(p, len2); c(n >= 0, "stb_en_compress()/stb_en_decompress() 3"); #endif free(p); } p = stb_file("data/bible.txt", &len2); if (p) { n = test_compression(p, len2); c(n == 2022520, "stb_compress()/stb_decompress() 4"); #if 0 n = test_en_compression(p, len2); c(n >= 0, "stb_en_compress()/stb_en_decompress() 4"); #endif free(p); } { int len = 1 << 25, o=0; // 32MB char *buffer = malloc(len); int i; for (i=0; i < 8192; ++i) buffer[o++] = (char) stb_rand(); for (i=0; i < (1 << 15); ++i) buffer[o++] = 1; for (i=0; i < 64; ++i) buffer[o++] = buffer[i]; for (i=0; i < (1 << 21); ++i) buffer[o++] = 2; for (i=0; i < 64; ++i) buffer[o++] = buffer[i]; for (i=0; i < (1 << 21); ++i) buffer[o++] = 3; for (i=0; i < 8192; ++i) buffer[o++] = buffer[i]; for (i=0; i < (1 << 21); ++i) buffer[o++] = 4; assert(o < len); stb_compress_window(1 << 24); i = test_compression(buffer, len); c(n >= 0, "stb_compress() 6"); free(buffer); } #ifdef STB_THREADS stb_thread_cleanup(); #endif stb_ischar(0,NULL); stb_wrapper_listall(dumpfunc); printf("Memory still in use: %d allocations of %d bytes.\n", alloc_num, alloc_size); // force some memory checking for (n=1; n < 20; ++n) malloc(1 << n); printf("Finished stb.c with %d errors.\n", count); #ifdef _MSC_VER if (count) __asm int 3; #endif return 0; } #endif // NIST test vectors struct { int length; char *message; char *digest; } sha1_tests[] = { 24, "616263", "a9993e364706816aba3e25717850c26c9cd0d89d", 1304, "ec29561244ede706b6eb30a1c371d74450a105c3f9735f7fa9fe38cf67f304a5736a106e" "92e17139a6813b1c81a4f3d3fb9546ab4296fa9f722826c066869edacd73b25480351858" "13e22634a9da44000d95a281ff9f264ecce0a931222162d021cca28db5f3c2aa24945ab1" "e31cb413ae29810fd794cad5dfaf29ec43cb38d198fe4ae1da2359780221405bd6712a53" "05da4b1b737fce7cd21c0eb7728d08235a9011", "970111c4e77bcc88cc20459c02b69b4aa8f58217", 2096, "5fc2c3f6a7e79dc94be526e5166a238899d54927ce470018fbfd668fd9dd97cbf64e2c91" "584d01da63be3cc9fdff8adfefc3ac728e1e335b9cdc87f069172e323d094b47fa1e652a" "fe4d6aa147a9f46fda33cacb65f3aa12234746b9007a8c85fe982afed7815221e43dba55" "3d8fe8a022cdac1b99eeeea359e5a9d2e72e382dffa6d19f359f4f27dc3434cd27daeeda" "8e38594873398678065fbb23665aba9309d946135da0e4a4afdadff14db18e85e71dd93c" "3bf9faf7f25c8194c4269b1ee3d9934097ab990025d9c3aaf63d5109f52335dd3959d38a" "e485050e4bbb6235574fc0102be8f7a306d6e8de6ba6becf80f37415b57f9898a5824e77" "414197422be3d36a6080", "0423dc76a8791107d14e13f5265b343f24cc0f19", 2888, "0f865f46a8f3aed2da18482aa09a8f390dc9da07d51d1bd10fe0bf5f3928d5927d08733d" "32075535a6d1c8ac1b2dc6ba0f2f633dc1af68e3f0fa3d85e6c60cb7b56c239dc1519a00" "7ea536a07b518ecca02a6c31b46b76f021620ef3fc6976804018380e5ab9c558ebfc5cb1" "c9ed2d974722bf8ab6398f1f2b82fa5083f85c16a5767a3a07271d67743f00850ce8ec42" "8c7f22f1cf01f99895c0c844845b06a06cecb0c6cf83eb55a1d4ebc44c2c13f6f7aa5e0e" "08abfd84e7864279057abc471ee4a45dbbb5774afa24e51791a0eada11093b88681fe30b" "aa3b2e94113dc63342c51ca5d1a6096d0897b626e42cb91761058008f746f35465465540" "ad8c6b8b60f7e1461b3ce9e6529625984cb8c7d46f07f735be067588a0117f23e34ff578" "00e2bbe9a1605fde6087fb15d22c5d3ac47566b8c448b0cee40373e5ba6eaa21abee7136" "6afbb27dbbd300477d70c371e7b8963812f5ed4fb784fb2f3bd1d3afe883cdd47ef32bea" "ea", "6692a71d73e00f27df976bc56df4970650d90e45", 3680, "4893f1c763625f2c6ce53aacf28026f14b3cd8687e1a1d3b60a81e80fcd1e2b038f9145a" "b64a0718f948f7c3c9ac92e3d86fb669a5257da1a18c776291653688338210a3242120f1" "01788e8acc9110db9258b1554bf3d26602516ea93606a25a7f566c0c758fb39ecd9d876b" "c5d8abc1c3205095382c2474cb1f8bbdb45c2c0e659cb0fc703ec607a5de6bcc7a28687d" "b1ee1c8f34797bb2441d5706d210df8c2d7d65dbded36414d063c117b52a51f7a4eb9cac" "0782e008b47459ed5acac0bc1f20121087f992ad985511b33c866d18e63f585478ee5a5e" "654b19d81231d98683ae3f0533565aba43dce408d7e3c4c6be11d8f05165f29c9dcb2030" "c4ee31d3a04e7421aa92c3231a1fc07e50e95fea7389a5e65891afaba51cf55e36a9d089" "bf293accb356d5d06547307d6e41456d4ed146a056179971c56521c83109bf922866186e" "184a99a96c7bb96df8937e35970e438412a2b8d744cf2ad87cb605d4232e976f9f151697" "76e4e5b6b786132c966b25fc56d815c56c819af5e159aa39f8a93d38115f5580cda93bc0" "73c30b39920e726fe861b72483a3f886269ab7a8eefe952f35d25c4eb7f443f4f3f26e43" "d51fb54591e6a6dad25fcdf5142033084e5624bdd51435e77dea86b8", "dc5859dd5163c4354d5d577b855fa98e37f04384", 4472, "cf494c18a4e17bf03910631471bca5ba7edea8b9a63381e3463517961749848eb03abefd" "4ce676dece3740860255f57c261a558aa9c7f11432f549a9e4ce31d8e17c79450ce2ccfc" "148ad904aedfb138219d7052088520495355dadd90f72e6f69f9c6176d3d45f113f275b7" "fbc2a295784d41384cd7d629b23d1459a22e45fd5097ec9bf65fa965d3555ec77367903c" "32141065fc24da5c56963d46a2da3c279e4035fb2fb1c0025d9dda5b9e3443d457d92401" "a0d3f58b48469ecb1862dc975cdbe75ca099526db8b0329b03928206f084c633c04eef5e" "8e377f118d30edf592504be9d2802651ec78aeb02aea167a03fc3e23e5fc907c324f283f" "89ab37e84687a9c74ccf055402db95c29ba2c8d79b2bd4fa96459f8e3b78e07e923b8119" "8267492196ecb71e01c331f8df245ec5bdf8d0e05c91e63bb299f0f6324895304dda721d" "39410458f117c87b7dd6a0ee734b79fcbe482b2c9e9aa0cef03a39d4b0c86de3bc34b4aa" "dabfa373fd2258f7c40c187744d237080762382f547a36adb117839ca72f8ebbc5a20a07" "e86f4c8bb923f5787698d278f6db0040e76e54645bb0f97083995b34b9aa445fc4244550" "58795828dd00c32471ec402a307f5aa1b37b1a86d6dae3bcbfbe9ba41cab0beeabf489af" "0073d4b3837d3f14b815120bc3602d072b5aeefcdec655fe756b660eba7dcf34675acbce" "317746270599424b9248791a0780449c1eabbb9459cc1e588bfd74df9b1b711c85c09d8a" "a171b309281947e8f4b6ac438753158f4f36fa", "4c17926feb6e87f5bca7890d8a5cde744f231dab", 5264, "8236153781bd2f1b81ffe0def1beb46f5a70191142926651503f1b3bb1016acdb9e7f7ac" "ced8dd168226f118ff664a01a8800116fd023587bfba52a2558393476f5fc69ce9c65001" "f23e70476d2cc81c97ea19caeb194e224339bcb23f77a83feac5096f9b3090c51a6ee6d2" "04b735aa71d7e996d380b80822e4dfd43683af9c7442498cacbea64842dfda238cb09992" "7c6efae07fdf7b23a4e4456e0152b24853fe0d5de4179974b2b9d4a1cdbefcbc01d8d311" "b5dda059136176ea698ab82acf20dd490be47130b1235cb48f8a6710473cfc923e222d94" "b582f9ae36d4ca2a32d141b8e8cc36638845fbc499bce17698c3fecae2572dbbd4705524" "30d7ef30c238c2124478f1f780483839b4fb73d63a9460206824a5b6b65315b21e3c2f24" "c97ee7c0e78faad3df549c7ca8ef241876d9aafe9a309f6da352bec2caaa92ee8dca3928" "99ba67dfed90aef33d41fc2494b765cb3e2422c8e595dabbfaca217757453fb322a13203" "f425f6073a9903e2dc5818ee1da737afc345f0057744e3a56e1681c949eb12273a3bfc20" "699e423b96e44bd1ff62e50a848a890809bfe1611c6787d3d741103308f849a790f9c015" "098286dbacfc34c1718b2c2b77e32194a75dda37954a320fa68764027852855a7e5b5274" "eb1e2cbcd27161d98b59ad245822015f48af82a45c0ed59be94f9af03d9736048570d6e3" "ef63b1770bc98dfb77de84b1bb1708d872b625d9ab9b06c18e5dbbf34399391f0f8aa26e" "c0dac7ff4cb8ec97b52bcb942fa6db2385dcd1b3b9d567aaeb425d567b0ebe267235651a" "1ed9bf78fd93d3c1dd077fe340bb04b00529c58f45124b717c168d07e9826e33376988bc" "5cf62845c2009980a4dfa69fbc7e5a0b1bb20a5958ca967aec68eb31dd8fccca9afcd30a" "26bab26279f1bf6724ff", "11863b483809ef88413ca9b0084ac4a5390640af", 6056, "31ec3c3636618c7141441294fde7e72366a407fa7ec6a64a41a7c8dfda150ca417fac868" "1b3c5be253e3bff3ab7a5e2c01b72790d95ee09b5362be835b4d33bd20e307c3c702aa15" "60cdc97d190a1f98b1c78e9230446e31d60d25155167f73e33ed20cea27b2010514b57ba" "b05ed16f601e6388ea41f714b0f0241d2429022e37623c11156f66dd0fa59131d8401dba" "f502cffb6f1d234dcb53e4243b5cf9951688821586a524848123a06afa76ab8058bcfa72" "27a09ce30d7e8cb100c8877bb7a81b615ee6010b8e0daced7cc922c971940b757a9107de" "60b8454dda3452e902092e7e06faa57c20aadc43c8012b9d28d12a8cd0ba0f47ab4b377f" "316902e6dff5e4f2e4a9b9de1e4359f344e66d0565bd814091e15a25d67d89cf6e30407b" "36b2654762bbe53a6f204b855a3f9108109e351825cf9080c89764c5f74fb4afef89d804" "e7f7d097fd89d98171d63eaf11bd719df44c5a606be0efea358e058af2c265b2da2623fd" "afc62b70f0711d0150625b55672060cea6a253c590b7db1427a536d8a51085756d1e6ada" "41d9d506b5d51bcae41249d16123b7df7190e056777a70feaf7d9f051fdbbe45cbd60fc6" "295dda84d4ebbd7284ad44be3ee3ba57c8883ead603519b8ad434e3bf630734a9243c00a" "a07366b8f88621ec6176111f0418c66b20ff9a93009f43432aaea899dad0f4e3ae72e9ab" "a3f678f140118eb7117230c357a5caa0fe36c4e6cf1957bbe7499f9a68b0f1536e476e53" "457ed826d9dea53a6ded52e69052faaa4d3927b9a3f9e8b435f424b941bf2d9cd6849874" "42a44d5acaa0da6d9f390d1a0dd6c19af427f8bb7c082ae405a8dd535dea76aa360b4faa" "d786093e113424bb75b8cc66c41af637a7b2acdca048a501417919cf9c5cd3b2fa668860" "d08b6717eea6f125fa1b0bae1dbb52aafce8ae2deaf92aeb5be003fb9c09fedbc286ffb5" "e16ad8e07e725faa46ebc35500cf205fc03250075ddc050c263814b8d16d141db4ca289f" "386719b28a09a8e5934722202beb3429899b016dfeb972fee487cdd8d18f8a681042624f" "51", "f43937922444421042f76756fbed0338b354516f", 6848, "21b9a9686ec200456c414f2e6963e2d59e8b57e654eced3d4b57fe565b51c9045c697566" "44c953178f0a64a6e44d1b46f58763c6a71ce4c373b0821c0b3927a64159c32125ec916b" "6edd9bf41c3d80725b9675d6a97c8a7e3b662fac9dbcf6379a319a805b5341a8d360fe00" "5a5c9ac1976094fea43566d66d220aee5901bd1f2d98036b2d27eb36843e94b2e5d1f09c" "738ec826de6e0034cf8b1dca873104c5c33704cae290177d491d65f307c50a69b5c81936" "a050e1fe2b4a6f296e73549323b6a885c3b54ee5eca67aa90660719126b590163203909e" "470608f157f033f017bcf48518bf17d63380dabe2bc9ac7d8efe34aedcae957aeb68f10c" "8ad02c4465f1f2b029d5fbb8e8538d18be294394b54b0ee6e67a79fce11731604f3ac4f8" "d6ffa9ef3d2081f3d1c99ca107a7bf3d624324a7978ec38af0bcd0d7ee568572328b212b" "9dc831efb7880e3f4d6ca7e25f8e80d73913fb8edfffd758ae4df61b4140634a92f49314" "6138ebdcdaa083ea72d52a601230aa6f77874dcad9479f5bcac3763662cc30cb99823c5f" "f469dcbd64c028286b0e579580fd3a17b56b099b97bf62d555798f7a250e08b0e4f238c3" "fcf684198bd48a68c208a6268be2bb416eda3011b523388bce8357b7f26122640420461a" "bcabcb5004519adfa2d43db718bce7d0c8f1b4645c89315c65df1f0842e5741244bba3b5" "10801d2a446818635d0e8ffcd80c8a6f97ca9f878793b91780ee18eb6c2b99ffac3c38ef" "b7c6d3af0478317c2b9c421247eba8209ea677f984e2398c7c243696a12df2164417f602" "d7a1d33809c865b73397550ff33fe116166ae0ddbccd00e2b6fc538733830ac39c328018" "bcb87ac52474ad3cce8780d6002e14c6734f814cb551632bcc31965c1cd23d048b9509a4" "e22ab88f76a6dba209d5dd2febd1413a64d32be8574a22341f2a14e4bd879abb35627ef1" "35c37be0f80843006a7cc7158d2bb2a71bf536b36de20ca09bb5b674e5c408485106e6fa" "966e4f2139779b46f6010051615b5b41cda12d206d48e436b9f75d7e1398a656abb0087a" "a0eb453368fc1ecc71a31846080f804d7b67ad6a7aa48579c3a1435eff7577f4e6004d46" "aac4130293f6f62ae6d50c0d0c3b9876f0728923a94843785966a27555dd3ce68602e7d9" "0f7c7c552f9bda4969ec2dc3e30a70620db6300e822a93e633ab9a7a", "5d4d18b24b877092188a44be4f2e80ab1d41e795", 7640, "1c87f48f4409c3682e2cf34c63286dd52701b6c14e08669851a6dc8fa15530ad3bef692c" "7d2bf02238644561069df19bdec3bccae5311fce877afc58c7628d08d32d9bd2dc1df0a6" "24360e505944219d211f33bff62e9ff2342ac86070240a420ccaf14908e6a93c1b27b6e2" "0324e522199e83692805cc4c7f3ea66f45a490a50d4dd558aa8e052c45c1a5dfad452674" "edc7149024c09024913f004ceee90577ff3eaec96a1eebbdc98b440ffeb0cad9c6224efc" "9267d2c192b53dc012fb53010926e362ef9d4238d00df9399f6cbb9acc389a7418007a6c" "a926c59359e3608b548bdeece213f4e581d02d273781dffe26905ec161956f6dfe1c008d" "6da8165d08f8062eea88e80c055b499f6ff8204ffdb303ab132d9b0cba1e5675f3525bbe" "4cf2c3f2b00506f58336b36aefd865d37827f2fad7d1e59105b52f1596ea19f848037dfe" "dc9136e824ead5505e2995d4c0769276548835430667f333fc77375125b29c1b1535602c" "10fe161864f49a98fc274ae7335a736be6bf0a98cd019d120b87881103f86c0a6efadd8c" "aa405b6855c384141b4f8751cc42dc0cb2913382210baaa84fe242ca66679472d815c08b" "f3d1a7c6b5705a3de17ad157522de1eb90c568a8a1fbcbb422cca293967bb14bfdd91bc5" "a9c4d2774dee524057e08f937f3e2bd8a04ced0fc7b16fb78a7b16ee9c6447d99e53d846" "3726c59066af25c317fc5c01f5dc9125809e63a55f1cd7bdf7f995ca3c2655f4c7ab940f" "2aa48bc3808961eb48b3a03c731ce627bb67dd0037206c5f2c442fc72704258548c6a9db" "e16da45e40da009dc8b2600347620eff8361346116b550087cb9e2ba6b1d6753622e8b22" "85589b90a8e93902aa17530104455699a1829efef153327639b2ae722d5680fec035575c" "3b48d9ec8c8e9550e15338cc76b203f3ab597c805a8c6482676deabc997a1e4ba857a889" "97ceba32431443c53d4d662dd5532aa177b373c93bf93122b72ed7a3189e0fa171dfabf0" "520edf4b9d5caef595c9a3a13830c190cf84bcf9c3596aadb2a674fbc2c951d135cb7525" "3ee6c59313444f48440a381e4b95f5086403beb19ff640603394931f15d36b1cc9f3924f" "794c965d4449bfbdd8b543194335bdf70616dc986b49582019ac2bf8e68cfd71ec67e0aa" "dff63db39e6a0ef207f74ec6108fae6b13f08a1e6ae01b813cb7ee40961f95f5be189c49" "c43fbf5c594f5968e4e820a1d38f105f2ff7a57e747e4d059ffb1d0788b7c3c772b9bc1f" "e147c723aca999015230d22c917730b935e902092f83e0a8e6db9a75d2626e0346e67e40" "8d5b815439dab8ccb8ea23f828fff6916c4047", "32e0f5d40ceec1fbe45ddd151c76c0b3fef1c938", 8432, "084f04f8d44b333dca539ad2f45f1d94065fbb1d86d2ccf32f9486fe98f7c64011160ec0" "cd66c9c7478ed74fde7945b9c2a95cbe14cedea849978cc2d0c8eb0df48d4834030dfac2" "b043e793b6094a88be76b37f836a4f833467693f1aa331b97a5bbc3dbd694d96ce19d385" "c439b26bc16fc64919d0a5eab7ad255fbdb01fac6b2872c142a24aac69b9a20c4f2f07c9" "923c9f0220256b479c11c90903193d4e8f9e70a9dbdf796a49ca5c12a113d00afa844694" "de942601a93a5c2532031308ad63c0ded048633935f50a7e000e9695c1efc1e59c426080" "a7d1e69a93982a408f1f6a4769078f82f6e2b238b548e0d4af271adfa15aa02c5d7d7052" "6e00095ffb7b74cbee4185ab54385f2707e8362e8bd1596937026f6d95e700340b6338ce" "ba1ee854a621ce1e17a016354016200b1f98846aa46254ab15b7a128b1e840f494b2cdc9" "daccf14107c1e149a7fc27d33121a5cc31a4d74ea6945816a9b7a83850dc2c11d26d767e" "ec44c74b83bfd2ef8a17c37626ed80be10262fe63cf9f804b8460c16d62ae63c8dd0d124" "1d8aaac5f220e750cb68d8631b162d80afd6b9bf929875bf2e2bc8e2b30e05babd8336be" "31e41842673a66a68f0c5acd4d7572d0a77970f42199a4da26a56df6aad2fe420e0d5e34" "448eb2ed33afbfb35dffaba1bf92039df89c038bae3e11c02ea08aba5240c10ea88a45a1" "d0a8631b269bec99a28b39a3fc5b6b5d1381f7018f15638cc5274ab8dc56a62b2e9e4fee" "f172be20170b17ec72ff67b81c15299f165810222f6a001a281b5df1153a891206aca89e" "e7baa761a5af7c0493a3af840b9219e358b1ec1dd301f35d4d241b71ad70337bda42f0ea" "dc9434a93ed28f96b6ea073608a314a7272fefd69d030cf22ee6e520b848fa705ed6160f" "e54bd3bf5e89608506e882a16aced9c3cf80657cd03749f34977ced9749caa9f52b683e6" "4d96af371b293ef4e5053a8ea9422df9dd8be45d5574730f660e79bf4cbaa5f3c93a79b4" "0f0e4e86e0fd999ef4f26c509b0940c7a3eaf1f87c560ad89aff43cd1b9d4863aa3ebc41" "a3dd7e5b77372b6953dae497fc7f517efe99e553052e645e8be6a3aeb362900c75ce712d" "fcba712c4c25583728db9a883302939655ef118d603e13fcf421d0cea0f8fb7c49224681" "d013250defa7d4fd64b69b0b52e95142e4cc1fb6332486716a82a3b02818b25025ccd283" "198b07c7d9e08519c3c52c655db94f423912b9dc1c95f2315e44be819477e7ff6d2e3ccd" "daa6da27722aaadf142c2b09ce9472f7fd586f68b64d71fc653decebb4397bf7af30219f" "25c1d496514e3c73b952b8aa57f4a2bbf7dcd4a9e0456aaeb653ca2d9fa7e2e8a532b173" "5c4609e9c4f393dd70901393e898ed704db8e9b03b253357f333a66aba24495e7c3d1ad1" "b5200b7892554b59532ac63af3bdef590b57bd5df4fbf38d2b3fa540fa5bf89455802963" "036bd173fe3967ed1b7d", "ee976e4ad3cad933b283649eff9ffdb41fcccb18", 9224, "bd8320703d0cac96a96aeefa3abf0f757456bf42b3e56f62070fc03e412d3b8f4e4e427b" "c47c4600bb423b96de6b4910c20bc5c476c45feb5b429d4b35088813836fa5060ceb26db" "bb9162e4acd683ef879a7e6a0d6549caf0f0482de8e7083d03ed2f583de1b3ef505f4b2c" "cd8a23d86c09d47ba05093c56f21a82c815223d777d0cabb7ee4550423b5deb6690f9394" "1862ae41590ea7a580dda79229d141a786215d75f77e74e1db9a03c9a7eb39eb35adf302" "5e26eb31ca2d2ca507edca77d9e7cfcfd136784f2117a2afafa87fa468f08d07d720c933" "f61820af442d260d172a0a113494ca169d33a3aeaacdcc895b356398ed85a871aba769f6" "071abd31e9f2f5834721d0fef6f6ee0fc0e38760b6835dfcc7dbefb592e1f0c3793af7ad" "f748786d3364f3cfd5686b1a18711af220e3637d8fad08c553ce9d5dc1183d48e8337b16" "1fe69b50e1920316dbffec07425b5d616a805a699576590e0939f5c965bce6c7342d314a" "c37b9c4d30166567c4f633f182de4d6b00e20a1c762789f915eaa1c89ac31b85222b1f05" "403dedd94db9ce75ff4e49923d1999d032695fa0a1c595617830c3c9a7ab758732fcec26" "85ae14350959b6a5f423ef726587e186b055a8daf6fa8fdefa02841b2fdbca1616dcee78" "c685fc6dcc09f24a36097572eba3c37a3eabe98bc23836085f63ef71a54b4488615d83b2" "6ed28c9fce78852df9b6cf8a75ca3899a7567298e91bc4ffdd04ffab0066b43b8286a4bb" "555c78808496b252c6e0e4d153631f11f68baf88630e052acc2af5d2af2e22e4f23bb630" "314c561a577455f86b6727bcad3c19d3e271404dec30af3d9dd0ed63cd9fa708aadfa12a" "500ef2d99a6b71e137b56ba90036975b88004b45f577ef800f0fb3cf97577dc9da37253b" "8675e5c8bb7e0bd26564f19eca232fb25f280f82e014424c9fbdd1411d7556e5d7906bb8" "62206316ba03385cd820c54c82ed35b36735bc486b1885d84053eba036c1ebfb5422d93d" "a71c53deda7f74db07cd4959cdfa898ba37080d76b564d344b124dd7b80cd70ed3b52a6c" "f9c9a32695d134bd39eb11ddeecdac86c808e469bd8a7995b667c452e7d9a54d5c85bcf6" "d5ffdc27d491bc06f438f02c7cf018073431587c78ba08d18a8daccb2d3b26136f612ade" "c673f3cd5eb83412b29652d55a10d0d6238d0b5365db272c917349450aff062c36191cfc" "d45660819083f89cd42ecae9e26934a020cafeb9b2b68d544edf59574c0ca159fd195dbf" "3e3e74244d942fffdbd4ed7f626219bab88b5a07e50b09a832d3e8ad82091114e54f2c35" "6b48e55e36589ebad3ac6077cb7b1827748b00670df65bbf0a2e65caad3f8a97d654d64e" "1c7dad171cafbc37110d2f7ca66524dc08fe60593e914128bd95f41137bfe819b5ca835f" "e5741344b5c907ce20a35f4f48726141c6398e753ed9d46d3692050628c78859d5014fe4" "dd3708e58d4d9807f8dac540492e32fa579491717ad4145c9efc24cf95605660b2e09b89" "9369b74d3ebff41e707917ff314d93e6ac8dfd643ef2c087cd9912005b4b2681da01a369" "42a756a3e22123cbf38c429373c6a8663130c24b24b2690b000013960b1c46a32d1d5397" "47", "2df09b10933afedfcd3f2532dfd29e7cb6213859", 10016, "7a94978bec7f5034b12c96b86498068db28cd2726b676f54d81d8d7350804cc106bead8a" "252b465a1f413b1c41e5697f8cece49ec0dea4dfb9fa7b1bfe7a4a00981875b420d094bb" "1ce86c1b8c2e1dbebf819c176b926409fdec69042e324e71d7a8d75006f5a11f512811fe" "6af88a12f450e327950b18994dfc3f740631beda6c78bca5fe23d54e6509120e05cd1842" "d3639f1466cf26585030e5b4aefe0404fe900afc31e1980f0193579085342f1803c1ba27" "0568f80eaf92440c4f2186b736f6ab9dc7b7522ccdcfc8cf12b6375a2d721aa89b5ef482" "112a42c31123aebabcb485d0e72d6b6b70c44e12d2da98d1f87fa9df4f37847e1ffec823" "1b8be3d737d282ddb9cc4b95937acfa0f028ba450def4d134a7d0fc88119bf7296e18cd4" "4f56890b661b5b72ddfa34c29228067e13caf08eb3b7fd29de800df9a9ae137aad4a81a4" "16a301c9f74b66c0e163e243b3187996b36eb569de3d9c007d78df91f9b554eef0eaa663" "88754ce20460b75d95e2d0747229a1502a5652cf39ca58e1daa0e9321d7ab3093981cd70" "23a7ee956030dd70177028a66ad619ad0629e631f91228b7c5db8e81b276d3b168c1edb1" "bc0888d1cbcbb23245c2d8e40c1ff14bfe13f9c70e93a1939a5c45eef9351e795374b9e1" "b5c3a7bd642477ba7233e1f590ab44a8232c53099a3c0a6ffe8be8b7ca7b58e6fedf700f" "6f03dd7861ee1ef857e3f1a32a2e0baa591d0c7ca04cb231cc254d29cda873f00d68f465" "00d6101cfdc2e8004c1f333d8007325d06ffe6b0ff7b80f24ba51928e65aa3cb78752028" "27511207b089328bb60264595a2cebfc0b84d9899f5eca7ea3e1d2f0f053b4e67f975500" "7ff3705ca4178ab9c15b29dd99494135f35befbcec05691d91f6361cad9c9a32e0e65577" "f14d8dc66515081b51d09e3f6c25eea868cf519a83e80c935968cae6fce949a646ad53c5" "6ee1f07dda23daef3443310bc04670afedb1a0132a04cb64fa84b4af4b3dc501044849cd" "dd4adb8d733d1eac9c73afa4f7d75864c87787f4033ffe5ba707cbc14dd17bd1014b8b61" "509c1f55a25cf6c0cbe49e4ddcc9e4de3fa38f7203134e4c7404ee52ef30d0b3f4e69bcc" "7d0b2e4d8e60d9970e02cc69d537cfbc066734eb9f690a174e0194ca87a6fadad3883d91" "6bd1700a052b26deee832701590d67e6f78938eac7c4beef3061a3474dd90dd588c1cd6e" "6a4cda85b110fd08a30dcd85a3ebde910283366a17a100db920885600db7578be46bcfa6" "4765ba9a8d6d5010cb1766d5a645e48365ed785e4b1d8c7c233c76291c92ef89d70bc77f" "bf37d7ce9996367e5b13b08242ce73971f1e0c6ff2d7920fb9c821768a888a7fe0734908" "33efb854cbf482aed5cb594fb715ec82a110130664164db488666d6198279006c1aa521f" "9cf04250476c934eba0914fd586f62d6c5825b8cf82cd7ef915d93106c506ea6760fd8b0" "bf39875cd1036b28417de54783173446026330ef701c3a6e5b6873b2025a2c1666bb9e41" "a40adb4a81c1052047dabe2ad092df2ae06d6d67b87ac90be7d826ca647940c4da264cad" "43c32a2bb8d5e27f87414e6887561444a80ed879ce91af13e0fbd6af1b5fa497ad0cbd2e" "7f0f898f52f9e4710de2174e55ad07c45f8ead3b02cac6c811becc51e72324f2439099a0" "5740090c1b165ecae7dec0b341d60a88f46d7ad8624aac231a90c93fad61fcfbbea12503" "59fcd203862a6b0f1d71ac43db6c58a6b60c2c546edc12dd658998e8", "f32e70862a16e3e8b199e9d81a9949d66f812cad", 10808, "88dd7f273acbe799219c23184782ac0b07bade2bc46b4f8adbd25ed3d59c0fd3e2931638" "837d31998641bbb7374c7f03d533ca60439ac4290054ff7659cc519bdda3dff2129a7bdb" "66b3300068931ade382b7b813c970c8e15469187d25cb04b635403dc50ea6c65ab38a97c" "431f28a41ae81c16192bd0c103f03b8fa815d6ea5bf0aa7fa534ad413b194eb12eb74f5d" "62b3d3a7411eb8c8b09a261542bf6880acbdfb617a42e577009e482992253712f8d4c8bd" "1c386bad068c7aa10a22111640041f0c35dabd0de00ebf6cd82f89cbc49325df12419278" "ec0d5ebb670577b2fe0c3e0840c5dd0dc5b3da00669eed8ead380f968b00d42f4967faec" "c131425fce1f7edb01cbec7e96d3c26fa6390a659e0ab069ef3edadc07e077bb816f1b22" "98830a0fe2b393693bb79f41feca89577c5230e0a6c34b860dc1fdb10d85aa054481082c" "494779d59ba798fcd817116c3059b7831857d0364352b354ce3b960fbb61a1b8a04d47ca" "a0ead52a9bea4bada2646cdbaec211f391dac22f2c5b8748e36bfc3d4e8ea45131ca7f52" "af09df21babe776fcecbb5c5dfa352c790ab27b9a5e74242bbd23970368dbefd7c3c74d1" "61ae01c7e13c65b415f38aa660f51b69ea1c9a504fe1ad31987cb9b26a4db2c37d7b326c" "50dbc8c91b13925306ff0e6098532dee7282a99c3ddf99f9e1024301f76e31e58271870b" "d94b9356e892a6a798d422a48c7fd5b80efe855a4925cc93b8cf27badec5498338e2b538" "70758b45d3e7a2fa059ed88df320a65e0a7cf87fa7e63b74cea1b7371e221f8004726642" "30d4d57945a85b23d58f248c8cd06ccfabfa969ab8cb78317451fab60e4fdfa796e2e2a8" "b46405839a91266d37e8d38bae545fb4060c357923b86d62f5d59d7bef5af20fbb9c7fb4" "2c6fd487748ed3b9973dbf4b1f2c9615129fa10d21cc49c622842c37c01670be71715765" "a98814634efbdee66bf3420f284dbd3efafc8a9117a8b9a72d9b81aa53ded78c409f3f90" "bad6e30d5229e26f4f0cea7ee82c09e3b60ec0e768f35a7fb9007b869f9bfc49c518f648" "3c951d3b6e22505453266ec4e7fe6a80dbe6a2458a1d6cd93044f2955607412091009c7d" "6cd81648a3b0603c92bfdff9ec3c0104b07ed2105962ca7c56ede91cb932073c337665e2" "409387549f9a46da05bc21c5126bd4b084bc2c06ab1019c51df30581aa4464ab92978c13" "f6d7c7ac8d30a78f982b9a43181bbe3c3eb9f7a1230b3e53b98a3c2a028317827fbe8cf6" "ec5e3e6b2a084d517d472b25f72fab3a34415bba488f14e7f621cfa72396ba40890e8c60" "b04815601a0819c9bebc5e18b95e04be3f9c156bd7375d8cc8a97c13ce0a3976123419fa" "592631317ca638c1182be06886f9663d0e8e6839573df8f52219eeb5381482a6a1681a64" "173660bfbb6d98bf06ee31e601ee99b4b99b5671ed0253260b3077ed5b977c6a79b4ff9a" "08efd3cba5c39bec1a1e9807d40bbf0c988e0fd071cf2155ed7b014c88683cd869783a95" "4cbfced9c0e80c3a92d45b508985cbbc533ba868c0dc4f112e99400345cf7524e42bf234" "5a129e53da4051c429af2ef09aba33ae3c820ec1529132a203bd2b81534f2e865265f55c" "9395caf0e0d3e1762c95eaaec935e765dc963b3e0d0a04b28373ab560fa9ba5ca71ced5d" "17bb8b56f314f6f0d0bc8104b3f1835eca7eaac15adf912cf9a6945cfd1de392342dd596" "d67e7ffcb7e086a6c1ea318aa2e0c2b5c2da079078232c637de0d317a1f26640bc1dac5b" "e8699b53edc86e4bfdfaf797a2ae350bf4ea29790face675c4d2e85b8f37a694c91f6a14" "1fd561274392ee6ee1a14424d5c134a69bcb4333079400f03615952fc4c99bf03f5733a8" "dc71524269fc5c648371f5f3098314d9d10258", "08632c75676571a5db5971f5d99cb8de6bf1792a", 11600, "85d43615942fcaa449329fd1fe9efb17545eb252cac752228f1e9d90955a3cf4e72cb116" "3c3d8e93ccb7e4826206ff58b3e05009ee82ab70943db3f18a32925d6d5aed1525c91673" "bd33846571af815b09bb236466807d935b5816a8be8e9becbe65d05d765bcc0bc3ae66c2" "5320ebe9fff712aa5b4931548b76b0fd58f6be6b83554435587b1725873172e130e1a3ca" "3d9d0425f4632d79cca0683780f266a0633230e4f3b25f87b0c390092f7b13c66ab5e31b" "5a58dbcac8dd26a0600bf85507057bb36e870dfae76da8847875a1a52e4596d5b4b0a211" "2435d27e1dc8dd5016d60feaf2838746d436a2983457b72e3357059b2bf1e9148bb0551a" "e2b27d5a39abd3d1a62c36331e26668e8baabc2a1ef218b5e7a51a9ca35795bcd54f403a" "188eafafb30d82896e45ddaea4f418629a1fb76a0f539c7114317bac1e2a8fba5a868bce" "40abd40f6b9ced3fa8c0329b4de5ca03cc84d75b8746ef31e6c8d0a0a79b4f747690928e" "be327f8bbe9374a0df4c39c845bf3322a49fda9455b36db5a9d6e4ea7d4326cf0e0f7cd8" "0ff74538f95cec01a38c188d1243221e9272ccc1053e30787c4cf697043cca6fc3730d2a" "431ecbf60d73ee667a3ab114c68d578c66dc1c659b346cb148c053980190353f6499bfef" "acfd1d73838d6dc1188c74dd72b690fb0481eee481a3fd9af1d4233f05d5ae33a7b10d7d" "d643406cb1f88d7dd1d77580dcbee6f757eeb2bfbcc940f2cddb820b2718264b1a64115c" "b85909352c44b13d4e70bbb374a8594d8af7f41f65b221bf54b8d1a7f8f9c7da563550cb" "2b062e7a7f21d5e07dd9da8d82e5a89074627597551c745718094c2eb316ca077526d27f" "9a589c461d891dc7cd1bc20ba3f464da53c97924219c87a0f683dfb3b3ac8793c59e78ac" "fac109439221ac599a6fd8d2754946d6bcba60784805f7958c9e34ff287ad1dbbc888848" "fa80cc4200dbb8c5e4224535906cbffdd0237a77a906c10ced740f9c0ce7821f2dbf8c8d" "7d41ecfcc7dfdc0846b98c78b765d01fb1eb15ff39149ab592e5dd1152665304bba85bbf" "4705751985aaaf31245361554d561a2337e3daeef58a826492fd886d5f18ef568c1e772e" "f6461170407695e3254eb7bf0c683811ddde5960140d959114998f08bdb24a104095987d" "3255d590e0dbd41ae32b1ae4f4ea4a4f011de1388034231e034756870c9f2d9f23788723" "27055a7de2b5e931dfb53e7780b6d4294bf094e08567025b026db9203b681565a1d52f30" "318d0ebe49471b22ba5fd62e1ed6c8966c99b853c9062246a1ace51ef7523c7bf93bef53" "d8a9cb96d6a04f0da1eca888df66e0380a72525a7ecc6115d08569a66248f6ba34e2341b" "fd01a78f7b3c1cfe0754e0d26cba2fa3f951ef14d5749ff8933b8aba06fa40fb570b467c" "54ce0d3f0bed21e998e5a36b3bc2f9e1ae29c4bab59c121af6fad67c0b45959cd6a86194" "14b90b4535fb95f86ca7e64502acc135eff4f8a3abe9dde84238fab7a7d402454a3f07ad" "ec05ec94b2891e0879037fae6acaa31dcecf3f85236ade946f5ad69ad4077beb65099285" "38ee09f2bc38e5704da67b5006b5e39cd765aafcd740c7dadb99d0c547126e1324610fcb" "7353dac2c110e803fca2b17485b1c4b78690bc4f867e6f043b2568889f67985a465a48eb" "ee915200589e915756d4968d26529c3ffe3dbe70e84c682ad08a0c68db571634fbb0210d" "c1b16b8b725886465c8c51f36a5e27d0f78e5643e051d3bddd512ce511f6bdf3dfe42759" "00c5fea9d248c2b3f36911ed0ff41a19f6445521f251724657ea8f795b3ead0928a1657f" "308dd7c7c1e7e490d9849df43becfa5cc25ed09ef614fd69ddc7e5e3147623901d647876" "fb60077ffc48c51ed7d02b35f6802e3715fc708a0c88b82fe9cba0a442d38d09ca5ae483" "21487bdef1794e7636bf7457dd2b51a391880c34d229438347e5fec8555fe263f08ba87b" "b16dcde529248a477628067d13d0cb3bf51776f4d39fb3fbc5f669e91019323e40360e4b" "78b6584f077bf9e03b66", "ab7213f6becb980d40dc89fbda0ca39f225a2d33", 12392, "7ae3ca60b3a96be914d24980fb5652eb68451fed5fa47abe8e771db8301fbd5331e64753" "93d96a4010d6551701e5c23f7ecb33bec7dd7bade21381e9865d410c383a139cb4863082" "8e9372bd197c5b5788b6599853e8487bddfd395e537772fdd706b6a1de59c695d63427da" "0dc3261bce2e1ae3cd6de90ec45ecd7e5f14580f5672b6ccd8f9336330dffcd6a3612a74" "975afc08fb136450e25dc6b071ddfc28fca89d846c107fd2e4bd7a19a4ff6f482d62896d" "a583c3277e23ab5e537a653112cdf2306043b3cc39f5280bd744fe81d66f497b95650e7d" "dfd704efcb929b13e00c3e3a7d3cd53878af8f1506d9de05dba9c39a92604b394ea25acb" "a2cda7b4ae8b08098ba3f0fdea15359df76517be84377f33631c844313ac335aa0d590fe" "c472d805521f0905d44ca40d7391b292184105acd142c083761c1a038c4f5ed869ea3696" "99592a37817f64cb4205b66be1f1de6fa47a08e1bf1a94312fe61a29e71bab242af95a7b" "38d4fb412c682b30256d91e2a46b634535d02b495240cbdb842cbe17cba6a2b94073f3d5" "f9621ac92ddda66f98bed997216466b4bb0579d58945f8d7450808d9e285d4f1709d8a1d" "416aa57d4a1a72bfcbfecdda33de2cff3e90e0cc60c897c4663224fc5bbe8316a83c1773" "802837a57bc7e9238173ed41ea32fe5fe38e546014a16d5e80700d9bac7a84bb03902f31" "79e641f86f6bc383d656daf69801499633fb367ea7593195934c72bc9bf9624c0c845ebf" "c36eb7ad4b22fdfb45ca7d4f0d6708c69a21f6eaa6db6bde0f0bd9dc7ec9c6e24626d0a7" "8fbeeed4b391f871e80e6a9d207165832d4ff689296f9bca15dc03c7c0381659ea5335eb" "aafdc3e50d18e46b00f1844870d09c25afcdb0ff1ae69dd8f94f91aca6095ba6f2b6e594" "c4acfe9903485d21b684e31a6acc2162d40e1a7bb8114a860a07e76f5265666555f2418d" "f11ef8f7499656d12215f5da8d7d041ac72648d15d7661ad93b24f3f071334b0921d5bb0" "6f2c7ab09f5034518b5ae21cec379373e87d51c77d44a70c2337606aadeb9036716fd920" "a824e7ae18ce3de9f0ec3456f3454027d8c476b3f1854b240c309f6f9786fa8a073915d9" "7a019ce99aec3260c5f6b6346cd9c41cb9267f4475958e45289965548238c6b9f91a8784" "b4e0957ba8b73956012c9a2fc3428434b1c1679f6ed2a3e8e2c90238df428622046f668e" "e2b053f55e64ffd45600e05a885e3264af573bacee93d23d72a0222b5442ac80bc0a8b79" "4c2afcf3bc881d20c111f57e3450b50a703f3db1fc5de2076a006f3b7eed694b93269874" "3b03c2ed2684bad445e69a692e744c7ac3a04f1e0e52b7a6708076d1fbffdb3f1c995828" "7d5f884e29407030f2db06811092efd80ae08da9daec39744c5ecd3ca771663b8f4968d4" "2a88c2c9821c73ae2a5a4d9e2551f82c03583b9c4dea775423b4748d24eb604e8ee3159b" "a6de9bea5b22eed6264e011734ed02b2c74ce06dda890b8604ed7ba49e7bf30e28c9871b" "e90f5cead67eaf52b5d3181c822b10701219b28ef6f6bebfa278e38acf863e2a1d4b1e40" "fd8a0ac6ce31054446301046148bf10dc3ae3385e2026e7762bdc8003ffebc4263191a59" "c72f4f90db03e7d52808506b33bfe1dfa53f1a3daa152e83974fbe56cfd4e8f4e7f7806a" "084b9d0795b858100eced0b5355a72446f37779d6c67ade60a627b8077ae1f3996b03bc3" "a5c290651c8609f0d879fbf578cbab35086e1159dd6ddbe3bf7fb5654edcc8f09e4f80d0" "258c9376d7c53fb68f78d333b18b70170d9a11070790c956f5744c78c986b1baf08b7631" "7a65c5f07ae6f57eb0e65488659324d29709e3735623d0426e90aa8c4629bb080881150c" "02be1c004da84414ac001c2eb6138c26388f5a36d594f3acef0e69e2cb43b870efa84da0" "cff9c923a9880202aed64ad76260f53c45bb1584b3e388a909d13586094b924680006a1d" "25d4dd36c579a8ec9d3fa63c082d977a5a5021440b5314b51850f2daa6e6af6ae88cb5b1" "44242bceb1d4771e641101f8abfc3a9b19f2de64e35e76458ad22072ba57925d73015de5" "66c66fcaa28fdc656f90de967ad51afd331e246d74ed469d63dd7d219935c59984bd9629" "09d1af296eb3121d782650e7d038063bab5fa854aac77de5ffebeb53d263f521e3fc02ac" "70", "b0e15d39025f5263e3efa255c1868d4a37041382", 13184, "fa922061131282d91217a9ff07463843ae34ff7f8c28b6d93b23f1ea031d5020aa92f660" "8c3d3df0ee24a8958fd41af880ee454e36e26438defb2de8f09c018607c967d2f0e8b80a" "00c91c0eabe5b4c253e319b45e6106ff8bf0516f866020e5ba3f59fd669c5aeff310ebb3" "85007069d01c64f72d2b02f4ec0b45c5ecf313056afcb52b17e08b666d01fecc42adb5b4" "9ea00c60cacac2e0a953f1324bdd44aec00964a22a3cb33916a33da10d74ec6c6577fb37" "5dc6ac8a6ad13e00cba419a8636d4daac8383a2e98fe90790cde7b59cfaa17c410a52abc" "d68b127593d2fcbafd30578d195d890e981ae09e6772cb4382404a4e09f1a33c958b57db" "ccee54ae335b6c91443206a0c100135647b844f226417a1f70317fd350d9f3789d81894a" "aff4730072401aaeb8b713ead4394e2e64b6917d6eee2549af7bd0952f12035719065320" "ca0d2dfe2847c6a2357c52bee4a676b12bafff66597bd479aa29299c1896f63a7523a85a" "b7b916c5930ab66b4d191103cefc74f2f7e0e96e354f65e355ae43959a0af1880d14ea9d" "1569e4fd47174aba7f5decb430b3f6baf80a1ef27855227b62487250d3602970e423423c" "7ca90920685bcf75adfbe2a61ce5bd9228947b32f567927cb1a5bd8727c03aef91d6367b" "ae7d86fd15c0977ac965a88b0d7236037aefb8d24eec8d2a07c633e031a7b9147c4c7714" "110bfc7e261448a5d0f73c3619664e1c533c81a0acbf95d502227a33f84f0b8249e3f9fa" "5c7905a8192b7313fc56bb20679e81333d32c797ac5162204a0eaa0e64507635921c485b" "8f17c4e2484667a733197529e2a833eed83c57229b11bd820b5a5b78f1867787dbc217ea" "28bfba785fb545cbc5a840a12eea428213e1aaa4e50a900ba13efcf4a5345574c2481c5d" "927ada610bba567a55630c89d905db3d9b67fe36c9cc3d6a947664c83e69f51c74711a33" "df66dd3ff6af9b7c1605b614d4798b4192b9a4b1508f2e2ec5aaad7eaea1ee8867353db9" "b8d7d9a6f16aa5f339492073238c979082879aee7f94ac4be8133eaacbaedfb044e2ad4e" "93ba0fa071dea615a5cd80d1d2678f4f93ae5a4bc9cdf3df345a29ec41d8febb23805ce4" "2541036f3f05c63ae736f79a29802045fad9f370cabf843458c1b636ca41f387fd7821c9" "1abbd1946afcb9186b936403233f28a5b467595131a6bc07b0873e51a08de66b5d7709a6" "02c1bd0e7f6e8f4beb0579c51bda0e0c738ef876fcd9a40ab7873c9c31c1d63a588eebc7" "8d9a0ae6fa35cd1a269e0d2bc68252cbd7c08d79e96f0aa6be22a016136a2b8abe9d3c9c" "f9d60eeafe3dbc76d489b24d68c36167df4c38cf2b21cf03dc5e659e39018c3490f1237e" "ca3f85b742ab0045d86a899c4126ad60a147cbc95b71814c274d6478668df41eb32acfb4" "bbf024fb4e3d6be0b60653a0471afc3037ab67dcb00a2b2e24b26911e1880136e56106b7" "f3c570fbe6f311d94624cb001914ff96fbbf481f71686aa17be0850568058fc1ee8900b4" "7af5cf51c5ed9e00a8b532c131f42513f6b8df14a9bbc2e9ede5a560681184d41a147552" "edfbdef98d95e6a7793229d25ba9b0b395a020aa1c0731de89e662246d59ec22e5d8f4b4" "6fbc048efcffbc234744c5c66417070f9c751c81788f04691ccb1a09d60c46f6f73375bf" "e2e646cf6290069541a8dfe216374c925e94d06ece72e851e81d3e8acd011f82526c2f9f" "55955c6752dc10e93153ab58627e30fa2c573e4042954337982eec1f741be058c85bad86" "bf3a02ed96d3201dadd48bd4de8105200dfcbcc400c3c3dd717abfc562ebe338b14b1eb5" "ecbe9227661e49c58bf8233770d813faafc78b05711135adcc4ce4c65095ca0bdc1debc0" "b6e5d195dbc582ce94b3afa14a422edf9b69abd7ae869a78c3a26fb50ef7122ec5af8d0c" "78ef082ca114f8817c3d93b31809870caea2eb9533fa767c2954efb9ba07e4f1077e9f9b" "be845661eabea2c91079321477a7c167c7234528d63d6aabbe723e0e337b2e61138a310a" "3fd04368aa4215b7af9d0334a8a74681bcb86b4af87a0329a1ed9dc7c9aef14521785eda" "0eeb97bdff8c9945fd0ee04e84d0dae091a69c0bfcdcd4150878fed839c0db6565fc1fed" "0e7d6ae2efde7a59d58a9fb3b07e6f7cea51ba93f771c18b2eafa252d7fe171085776052" "a6a17e6858f0a20b7e8be54413523989bf20a028a84d9ce98b78e6ee0b8362df49de5344" "b409cc322354672a21ea383e870d047551a3af71aaf2f44f49a859cf001e61b592dd036f" "c6625bf7b91ea0fb78c1563cceb8c4345bf4a9fbe6ee2b6bf5e81083", "8b6d59106f04300cb57c7c961945cd77f3536b0a", 13976, "162cca41155de90f6e4b76a34261be6666ef65bdb92b5831b47604ce42e0c6c8d2eda265" "ab9a3716809bf2e745e7831a41768d0f6349a268d9ac6e6adfb832a5d51b75d7951cf60e" "03d9e40de6d351f1f6ade5143531cf32839401ca6dfb9dc7473daa607aeb0c3d1e8eb3db" "cc2f1231ad1dd394d7eac9d8dab726b895b1ee774fdcabc8031063ecfa41c71a9f03ad23" "904cc056f17c76a1059c43faffe30dfd157fdfd7d792e162bf7a889109550a0fc4c41523" "2af0c0d72dcbc2595299e1a1c2aeae549f7970e994c15e0ab02f113d740d38c32a4d8ec0" "79cd099d37d954ab7ef2800902cdf7c7a19fb14b3c98aaf4c6ad93fe9a9bc7a61229828e" "55ad4d6270d1bdbca9975d450f9be91e5699bd7ee22e8c9c22e355cf1f6793f3551cb510" "c1d5cd363bdf8cab063e6e49a6383221f1188d64692c1f84c910a696de2e72fb9886193f" "61ab6b41ad0ea894d37ff1261bf1fd1f187e0d0c38ab223d99ec6d6b1e6b079fc305e24e" "2d9500c98676e2d587434495d6e107b193c06fb12d5d8eaa7b0c001d08f4d91cae5bdcae" "6624ee755e95ca8e4c5ef5b903d7f5ba438abeffd6f16d82d88138f157e7a50d1c91fb50" "c770f6d222fcbf6daf791b1f8379e3b157a3b496ddb2e71650c1c4ac4fc5f2aceb5b3228" "ffc44e15c02d4baa9434e60928a93f21bc91cfd3c2719f53a8c9bcd2f2dee65a8bbc88f9" "5d7ced211fc3b04f6e8b74eb2026d66fd57fa0cccea43f0a0381782e6fee5660afed674d" "cb2c28cb54d2bdbbaf78e534b0742ede6b5e659b46cd516d5362a194dd0822f6417935c4" "ff05815b118fe5687cd8b050240015cfe449d9dfde1f4fdb105586e429b2c1849aac2791" "ef73bc54603190eba39037ec057e784bb92d497e705dfcde2addb3514b4f1926f12d5440" "850935779019b23bd0f2977a8c9478c424a7eaaeec04f3743a77bee2bec3937412e707bc" "92a070046e2f9c35fe5cc3f755bbb91a182e683591ab7e8cff40633730546e81522f588f" "07bdf142b78e115d2a22d2eb5664fcdb7574c1ee5ba9abd307d7d29078cd5223c222fc69" "60324c40cc639be84dad96b01059efce7b08538ebef89bafab834609c7e82774a14e5be6" "62067edba6111efa8ae270f5066442b17e3f31a793581c8a3f96d92921ec26981594e28a" "08987d020b97ad2ba5c662836e35fd3fd954bcec52b579528913959d0d942fbf1c4b9910" "ba010c3700359a4eb7616541257f0f7727cc71b580cc903f718ecc408a315b6bbfa7f6e3" "beb9d258804bd2731ee2fb75e763281baf1effc4690a23d5f952ab5d4311d4f5885af2eb" "f27cad9f6d84692cb903064bbd11ca751f919b4811b7722c6ec80c360521e34d357b5c8b" "ba6d42e5c632730f53add99ab8aa9c607b6796216753086ede158bc670d04900aca66ce8" "357bd72d19fb147b5fde8ee4df6a0184573a2e65ba3fd3a0cb04dac5eb36d17d2f639a6e" "b602645f3ab4da9de4c9999d6506e8e242a5a3216f9e79a4202558ecdc74249ad3caaf90" "71b4e653338b48b3ba3e9daf1e51e49384268d63f37ce87c6335de79175cdf542d661bcd" "74b8f5107d6ab492f54b7c3c31257ecb0b426b77ed2e2ed22bbfdaf49653e1d54e5988fa" "d71397546f9955659f22b3a4117fc823a1e87d6fb6fb8ab7d302a1316975e8baf0c0adbd" "35455655f6a596b6ac3be7c9a8ea34166119d5e70dfbc1aa6e14ff98eff95e94ef576656" "5d368ec8857fb0b029bcb990d420a5ca6bc7ab08053eb4dbfc4612a345d56faefc5e03a4" "43520b224de776a5b618e1aa16edc513d5fcefcd413031b0ddc958a6fca45d108fbde065" "3cf2d11cb00a71cd35f57993875598b4e33e2384623a0986859105d511c717c21d6534bf" "69fd3d7cf1682e4fc25298d90df951e77a316996beac61bb7078988118c906548af92cfe" "72cd4b102ffad584e5e721a0cdb5621ed07dda8955d84bea57a5afa4ba06289ddfac3a9e" "765538fd9392fc7904cedb65e38cd90967f01845ff819777a22d199f608e62c13e6ba98b" "40824b38c784bdb41d62c4014fc7e8d93be52695e975e54d1ff92b412f451177143d74a6" "bde0ee53a986043ab465a1ef315ac4c538e775ef4178fde5f2ea560a364de18b8fe9578a" "ad80027c3fd32dcf0967d9d03789b1cdf19040762f626289cf3af8afe5a8e0a152d9258e" "981872c1ec95cd7f8d65812e55cb5cbd8db61b3f068a23d9652372dfbf18d43a663c5a0d" "026b0898e383ce5c95b0ba7fb5ed6b7304c7c9d3ba64f38d1dc579465148ccfa7271f2e3" "e0e97e9ddac7c0874f0f396cf07851638a734df393687b7b0343afd1652ff32a2da17b3a" "4c99d79c02256c73f32625527e5666594a8a42a12135eddb022e743371b3ab7b12ad6785" "7635eed03558ac673d17280769b2368056276d5d72f5dbc75525f8a7558bd90b544aa6cb" "dd964e6c70be79441969bfdf471f17a2dc0c92", "6144c4786145852e2a01b20604c369d1b9721019", 14768, "c9bed88d93806b89c2d028866842e6542ab88c895228c96c1f9f05125f8697c7402538b0" "6465b7ae33daef847500f73d20c598c86e4804e633e1c4466e61f3ed1e9baadc5723bbed" "9455a2ff4f99b852cfe6aa3442852ade0b18e4995ddab4250928165a9441de108d4a293d" "1d95935de022aa17f366a31d4f4c4c54557a4235a9d56473444787ddc5c06c87087aef24" "fa8280b7ac74d76ba685e4be7dc705e5a8a97c6c8fbd201ee5bf522438d23371c60c155d" "93352f8fb8cc9421fe4b66ffabad46909c2c1099944fc55ed424c90aecca4f50d0331153" "2e2844c3ff8ecb495de7ab26941cbf177b79ad7b05f918b713c417da8cf6e67db0a2dcee" "a9179d8d636191759e13955f4244f0c4f2d88842e3015641ef0417d6e54144e8246e4591" "6823e2c6e39bfa3b90b97781c44981710689f2ce20e70a26760d65f9971b291e12338461" "8b3b56710dde2afaa2d46b0e2164d5c9482729350a0e256b2aa6b3fb099b618ebd7c11ca" "62bdf176b502aedfdf9be57a8e4adbca4a4d6d8407984af2f6635f95a1e4930e375eb53f" "245ab2ade5340c281bda87afded1268e537955c9819168bd60fd440533c75c9b1865e03f" "de3a301d165f97aa6da236cf39cf3e49512f6350224f8d76ff02d0d3b9a99e5f70b23b9f" "a85f72849fc98790df246c3a0f4437940e60d42b4317f72e2eb055d343a614f7f9648005" "1e4dff186dff476462d9ced24dbb82eaa60cbbf6a0026e64001da36d30f529f48f3688b1" "0ce9378ef3f50f5106e5007cd0eb037136254fda4f20d048769bd51a9d8d09a1e469a482" "6aa0e25b6267b5a96abcb6e919a362fdd7b683d2f2dcec40ee5969311c07f6066ee22f36" "89ca08381c85bea470040e9541e7a451cd43d62c2aa292a9dc4b95e3a7c4de2ba29663f3" "8d5002eb64ceba6934bb1b0e2e55fba7fa706b514ebeeae1be4dd882d6512da066246a05" "1d8bd042593bd0513e9cc47806ccdc7097e75bc75b8603834c85cd084e0ade3cc2c2b7e8" "586eac62249f9769f5bdcd50e24e515f257548762db9adf3ee0846d67cfcd723d85d9588" "09e6dd406f4c2637557c356fc52490a2a0763429ee298a1c72c098bb810e740c15faffc6" "1e80cf6e18f86dc0e29bc150ce43ca71f5729356cd966277fd8b32366f6263c3a761b13d" "544a631a25e1c4c8dea8d794abed47ccb4069d20f1dcb54e40a673ffb5f7b2eb31fb7d44" "36fd8252f92dc35bb9a18fc55099b17e0807e79caf4f9641ee4bbbc2d6922508bcfae236" "475bf78bc796548bc8d60659e816af68e5e43352fa64b5086c97c22c60ddcbbbefb9d9ef" "7cd57c64454604793910f4f90aedb4fb824a86061a93bb79c9b0272a1ad0d24e8165f099" "ef6f14a6a4fea09845f280022e061804090d7ab79f7bddcbef264b6f7d4e9971eddb9ca7" "d0e79a8dbe7cff2fa59f514a608d66ae8c44d5e69745aa1b19995e366812064567d3ca20" "9e12994c901d1b1f489be7253615f7c339b5581afd4d262e879ab8480ecb18990d3db61f" "96895dcde9c065e645f52baafefcbe34d072dba373fd1c786fd56c3f3284be7260eaff9a" "6a8348b762ed59e20ea443313b1164db53c3989c32fcae5b366f190b9548e8cff46df961" "350369b490354ed8e530a91f5072967eff45c63540862fb2deab02b3ae05deac65414368" "ac3549f277da92b692947de47cba9c1579526931e31c3490c1d3605f9bafcf468c2e9b47" "981407ea40b0b59754621943095a2d4f4ba266ac545fe7447e54f69555a7ac9ff1e8f001" "834fa65f2d4523061726e4d3bf4680519032dc21b7389e9f3229e4c2295d354482f8b803" "b06ca3a8cb3ff786e60f6bc59dd3a5bfed63b0aa493bab78e97bbefb6633534d84de826f" "4e2ccc3069050d50a2caace6c9de15ffc2656988d94b736e5688df0351a3a6a4c875cd99" "ef304f3cc7a0585df2b0b3e6c62f86bba0d43de47b80c4eec1c4f98e60a36188219919cf" "36dc10ee11e174a67d226ad9e71f02a7fca26ad67a4862773f3defc6a747545314063e5f" "ce7a3f890ec57daa5532acfd027739832437c8a58dcbe11c2842e60e8ca64979d081fbd5" "a1a028f59317212fb5869abc689a156171d69e4f4c93b949c3459904c00192d3603cd184" "48d64b843c57f34aee7830f313e58e2abc41b44be46a96c845ffebcb7120e21d1d751046" "c072adf65dd901a39c8019742054be5e159ea88d0885ee05fcd4c189bafe5abb68603186" "5dc570b9342fa7f41fd5c1c87e68371ab19a83c82ae1d890c678102d5da8e6c29845657c" "027ba07362cba4d24950ab38e747925e22ce8df9eaec1ae2c6d23374b360c8352feb6cb9" "913e4fc49bde6caf5293030d0d234a8ecd616023cc668262591f812de208738e5336a9e6" "9f9be2479b86be1e1369761518dfc93797ed3a55308878a944581eba50bc9c7f7a0e75c7" "6a28acd95b277857726f3f684eefc215e0a696f47d65d30431d710d957c08ef96682b385" "0ee5ba1c8417aafc1af2846a127ec155b4b7fb369e90eb3a5c3793a3389bbc6b532ca32b" "f5e1f03c2280e71c6e1ae21312d4ff163eee16ebb1fdee8e887bb0d453829b4e6ed5fa70" "8f2053f29b81e277be46", "a757ead499a6ec3d8ab9814f839117354ae563c8" }; void test_sha1(void) { unsigned char buffer[4000]; int i; for (i=0; i < sizeof(sha1_tests) / sizeof(sha1_tests[0]); ++i) { stb_uint len = sha1_tests[i].length / 8; unsigned char digest[20], fdig[20]; unsigned int h; assert(len <= sizeof(buffer)); assert(strlen(sha1_tests[i].message) == len*2); assert(strlen(sha1_tests[i].digest) == 20 * 2); for (h=0; h < len; ++h) { char v[3]; v[0] = sha1_tests[i].message[h*2]; v[1] = sha1_tests[i].message[h*2+1]; v[2] = 0; buffer[h] = (unsigned char) strtol(v, NULL, 16); } stb_sha1(digest, buffer, len); for (h=0; h < 20; ++h) { char v[3]; int res; v[0] = sha1_tests[i].digest[h*2]; v[1] = sha1_tests[i].digest[h*2+1]; v[2] = 0; res = digest[h] == strtol(v, NULL, 16); c(res, sha1_tests[i].digest); if (!res) break; } { int z; FILE *f = fopen("data/test.bin", "wb"); if (!f) stb_fatal("Couldn't write to test.bin"); fwrite(buffer, len, 1, f); fclose(f); #ifdef _WIN32 z = stb_sha1_file(fdig, "data/test.bin"); if (!z) stb_fatal("Couldn't digest test.bin"); c(memcmp(digest, fdig, 20)==0, "stb_sh1_file"); #endif } } } #if 0 stb__obj zero, one; void test_packed_floats(void) { stb__obj *p; float x,y,*q; clock_t a,b,c; int i; stb_float_init(); for (i=-10; i < 10; ++i) { float f = (float) pow(10,i); float g = f * 10; float delta = (g - f) / 10000; while (f < g) { stb__obj z = stb_float(f); float k = stb_getfloat(z); float p = stb_getfloat_table(z); assert((z & 1) == 1); assert(f == k); assert(k == p); f += delta; } } zero = stb_float(0); one = stb_float(1); p = malloc(8192 * 4); for (i=0; i < 8192; ++i) p[i] = stb_rand(); for (i=0; i < 8192; ++i) if ((stb_rand() & 31) < 28) p[i] = zero; q = malloc(4 * 1024); a = clock(); x = y = 0; for (i=0; i < 200000000; ++i) q[i&1023] = stb_getfloat_table(p[i&8191]); b = clock(); for (i=0; i < 200000000; ++i) q[i&1023] = stb_getfloat_table2(p[i&8191]); c = clock(); free(p); free(q); printf("Table: %d\nIFs: %d\n", b-a, c-b); } #endif void do_compressor(int argc,char**argv) { char *p; int len; int window; if (argc == 2) { p = stb_file(argv[1], &len); if (p) { int dlen, clen = stb_compress_tofile("data/dummy.bin", p, len); char *q = stb_decompress_fromfile("data/dummy.bin", &dlen); if (len != dlen) { printf("FAILED %d -> %d\n", len, clen); } else { int z = memcmp(q,p,dlen); if (z != 0) printf("FAILED %d -> %d\n", len, clen); else printf("%d -> %d\n", len, clen); } } return; } window = atoi(argv[1]); if (window && argc == 4) { p = stb_file(argv[3], &len); if (p) { stb_compress_hashsize(window); stb_compress_tofile(argv[2], p, len); } } else if (argc == 3) { p = stb_decompress_fromfile(argv[2], &len); if (p) { FILE *f = fopen(argv[1], "wb"); fwrite(p,1,len,f); fclose(f); } else { fprintf(stderr, "FAILED.\n"); } } else { fprintf(stderr, "Usage: stb \n" " or stb \n"); } } #if 0 // naive backtracking implementation int wildmatch(char *expr, char *candidate) { while(*expr) { if (*expr == '?') { if (!*candidate) return 0; ++candidate; ++expr; } else if (*expr == '*') { ++expr; while (*expr == '*' || *expr =='?') ++expr; // '*' at end of expression matches anything if (!*expr) return 1; // now scan candidate 'til first match while (*candidate) { if (*candidate == *expr) { // check this candidate if (stb_wildmatch(expr+1, candidate+1)) return 1; // if not, then backtrack } ++candidate; } } else { if (*expr != *candidate) return 0; ++expr, ++candidate; } } return *candidate != 0; } int stb_matcher_find_slow(stb_matcher *m, char *str) { int result = 1; int i,j,y,z; uint16 *previous = NULL; uint16 *current = NULL; uint16 *temp; stb_arr_setsize(previous, 4); stb_arr_setsize(current, 4); previous = stb__add_if_inactive(m, previous, m->start_node); previous = stb__eps_closure(m,previous); if (stb__clear_goalcheck(m, previous)) goto done; while (*str) { y = stb_arr_len(previous); for (i=0; i < y; ++i) { stb_nfa_node *n = &m->nodes[previous[i]]; z = stb_arr_len(n->out); for (j=0; j < z; ++j) { if (n->out[j].match == *str) current = stb__add_if_inactive(m, current, n->out[j].node); else if (n->out[j].match == -1) { if (*str != '\n') current = stb__add_if_inactive(m, current, n->out[j].node); } else if (n->out[j].match < -1) { int z = -n->out[j].match - 2; if (m->charset[(uint8) *str] & (1 << z)) current = stb__add_if_inactive(m, current, n->out[j].node); } } } ++str; stb_arr_setlen(previous, 0); temp = previous; previous = current; current = temp; if (!m->match_start) previous = stb__add_if_inactive(m, previous, m->start_node); previous = stb__eps_closure(m,previous); if (stb__clear_goalcheck(m, previous)) goto done; } result=0; done: stb_arr_free(previous); stb_arr_free(current); return result; } #endif ////////////////////////////////////////////////////////////////////////// // // stb_parser // // Generates an LR(1) parser from a grammar, and can parse with it // Symbol representations // // Client: Internal: // - c=0 e aka epsilon // - c=1 $ aka end of string // > 0 2<=c= 0 ? encode_term(x) : encode_nonterm(x)) stb_bitset **compute_first(short ** productions) { int i, changed; stb_bitset **first = malloc(sizeof(*first) * num_symbols); assert(symset); for (i=0; i < num_symbols; ++i) first[i] = stb_bitset_new(0, symset); for (i=END; i < first_nonterm; ++i) stb_bitset_setbit(first[i], i); for (i=0; i < stb_arr_len(productions); ++i) { if (productions[i][2] == 0) { int nt = encode_nonterm(productions[i][0]); stb_bitset_setbit(first[nt], EPS); } } do { changed = 0; for (i=0; i < stb_arr_len(productions); ++i) { int j, nt = encode_nonterm(productions[i][0]); for (j=2; productions[i][j]; ++j) { int z = encode_symbol(productions[i][j]); changed |= stb_bitset_unioneq_changed(first[nt], first[z], symset); if (!stb_bitset_testbit(first[z], EPS)) break; } if (!productions[i][j] && !stb_bitset_testbit(first[nt], EPS)) { stb_bitset_setbit(first[nt], EPS); changed = 1; } } } while (changed); return first; } stb_bitset **compute_follow(short ** productions, stb_bitset **first, int start) { int i,j,changed; stb_bitset **follow = malloc(sizeof(*follow) * num_symbols); assert(symset); for (i=0; i < num_symbols; ++i) follow[i] = (i >= first_nonterm ? stb_bitset_new(0, symset) : NULL); stb_bitset_setbit(follow[start], END); do { changed = 0; for (i=0; i < stb_arr_len(productions); ++i) { int nt = encode_nonterm(productions[i][0]); for (j=2; productions[i][j]; ++j) { if (productions[i][j] < 0) { int k,z = encode_nonterm(productions[i][j]); for (k=j+1; productions[i][k]; ++k) { int q = encode_symbol(productions[i][k]); changed |= stb_bitset_unioneq_changed(follow[z], first[q], symset); if (!stb_bitset_testbit(first[q], EPS)) break; } if (!productions[i][k] == 0) changed |= stb_bitset_unioneq_changed(follow[z], follow[nt], symset); } } } } while (changed); for (i=first_nonterm; i < num_symbols; ++i) stb_bitset_clearbit(follow[i], EPS); return follow; } void first_for_prod_plus_sym(stb_bitset **first, stb_bitset *out, short *prod, int symbol) { stb_bitset_clearall(out, symset); for(;*prod;++prod) { int z = encode_symbol(*prod); stb_bitset_unioneq_changed(out, first[z], symset); if (!stb_bitset_testbit(first[z], EPS)) return; } stb_bitset_unioneq_changed(out, first[symbol], symset); } #define Item(p,c,t) ((void *) (((t) << 18) + ((c) << 12) + ((p) << 2))) #define ItemProd(i) ((((uint32) (i)) >> 2) & 1023) #define ItemCursor(i) ((((uint32) (i)) >> 12) & 63) #define ItemLookahead(i) (((uint32) (i)) >> 18) static void pc(stb_ps *p) { } typedef struct { short *prod; int prod_num; } ProdRef; typedef struct { stb_bitset **first; stb_bitset **follow; short ** prod; ProdRef ** prod_by_nt; } Grammar; stb_ps *itemset_closure(Grammar g, stb_ps *set) { stb_bitset *lookahead; int changed,i,j,k, list_len; if (set == NULL) return set; lookahead = stb_bitset_new(0, symset); do { void **list = stb_ps_getlist(set, &list_len); changed = 0; for (i=0; i < list_len; ++i) { ProdRef *prod; int nt, *looklist; int p = ItemProd(list[i]), c = ItemCursor(list[i]), t = ItemLookahead(list[i]); if (g.prod[p][c] >= 0) continue; nt = encode_nonterm(g.prod[p][c]); first_for_prod_plus_sym(g.first, lookahead, g.prod[p]+c+1, t); looklist = stb_bitset_getlist(lookahead, 1, first_nonterm); prod = g.prod_by_nt[nt]; for (j=0; j < stb_arr_len(prod); ++j) { assert(prod[j].prod[0] == g.prod[p][c]); // matched production; now iterate terminals for (k=0; k < stb_arr_len(looklist); ++k) { void *item = Item(prod[j].prod_num,2,looklist[k]); if (!stb_ps_find(set, item)) { changed = 1; set = stb_ps_add(set, item); pc(set); } } } stb_arr_free(looklist); } free(list); } while (changed); free(lookahead); return set; } stb_ps *itemset_goto(Grammar g, stb_ps *set, int sym) { int i, listlen; void **list = stb_ps_fastlist(set, &listlen); stb_ps *out = NULL; for (i=0; i < listlen; ++i) { int p,c; if (!stb_ps_fastlist_valid(list[i])) continue; p = ItemProd(list[i]), c = ItemCursor(list[i]); if (encode_symbol(g.prod[p][c]) == sym) { void *z = Item(p,c+1,ItemLookahead(list[i])); if (!stb_ps_find(out, z)) out = stb_ps_add(out, z); pc(out); } } return itemset_closure(g, out); } void itemset_all_nextsym(Grammar g, stb_bitset *out, stb_ps *set) { int i, listlen; void **list = stb_ps_fastlist(set, &listlen); stb_bitset_clearall(out, symset); pc(set); for (i=0; i < listlen; ++i) { if (stb_ps_fastlist_valid(list[i])) { int p = ItemProd(list[i]); int c = ItemCursor(list[i]); if (g.prod[p][c]) stb_bitset_setbit(out, encode_symbol(g.prod[p][c])); } } } stb_ps ** generate_items(Grammar g, int start_prod) { stb_ps ** all=NULL; int i,j,k; stb_bitset *try = stb_bitset_new(0,symset); stb_ps *set = NULL; void *item = Item(start_prod, 2, END); set = stb_ps_add(set, item); pc(set); set = itemset_closure(g, set); pc(set); stb_arr_push(all, set); for (i = 0; i < stb_arr_len(all); ++i) { // only try symbols that appear in all[i]... there's a smarter way to do this, // which is to take all[i], and divide it up by symbol pc(all[i]); itemset_all_nextsym(g, try, all[i]); for (j = 1; j < num_symbols; ++j) { if (stb_bitset_testbit(try, j)) { stb_ps *out; if (stb_arr_len(all) > 4) pc(all[4]); if (i == 1 && j == 29) { if (stb_arr_len(all) > 4) pc(all[4]); out = itemset_goto(g, all[i], j); if (stb_arr_len(all) > 4) pc(all[4]); } else out = itemset_goto(g, all[i], j); pc(out); if (stb_arr_len(all) > 4) pc(all[4]); if (out != NULL) { // add it to the array if it's not already there for (k=0; k < stb_arr_len(all); ++k) if (stb_ps_eq(all[k], out)) break; if (k == stb_arr_len(all)) { stb_arr_push(all, out); pc(out); if (stb_arr_len(all) > 4) pc(all[4]); } else stb_ps_delete(out); } } } } free(try); return all; } typedef struct { int num_stack; int function; } Reduction; typedef struct { short *encode_term; Reduction *reductions; short **action_goto; // terminals are action, nonterminals are goto int start; int end_term; } Parser; enum { A_error, A_accept, A_shift, A_reduce, A_conflict }; typedef struct { uint8 type; uint8 cursor; short prod; short value; } Action; Parser *parser_create(short **productions, int num_prod, int start_nt, int end_term) { short *mini_rule = malloc(4 * sizeof(mini_rule[0])); Action *actions; Grammar g; stb_ps ** sets; Parser *p = malloc(sizeof(*p)); int i,j,n; stb_bitset *mapped; int min_s=0, max_s=0, termset, ntset, num_states, num_reductions, init_prod; int synth_start; // remap sparse terminals and nonterminals for (i=0; i < num_prod; ++i) { for (j=2; productions[i][j]; ++j) { if (productions[i][j] < min_s) min_s = productions[i][j]; if (productions[i][j] > max_s) max_s = productions[i][j]; } } synth_start = --min_s; termset = (max_s + 32) >> 5; ntset = (~min_s + 32) >> 5; memset(encode_term, 0, sizeof(encode_term)); memset(encode_nonterm, 0, sizeof(encode_nonterm)); mapped = stb_bitset_new(0, termset); n = 2; for (i=0; i < num_prod; ++i) for (j=2; productions[i][j]; ++j) if (productions[i][j] > 0) if (!stb_bitset_testbit(mapped, productions[i][j])) { stb_bitset_setbit(mapped, productions[i][j]); encode_term[productions[i][j]] = n++; } free(mapped); first_nonterm = n; mapped = stb_bitset_new(0, ntset); for (i=0; i < num_prod; ++i) for (j=2; productions[i][j]; ++j) if (productions[i][j] < 0) if (!stb_bitset_testbit(mapped, ~productions[i][j])) { stb_bitset_setbit(mapped, ~productions[i][j]); encode_nonterm[~productions[i][j]] = n++; } free(mapped); // add a special start state for internal processing p->start = n++; encode_nonterm[synth_start] = p->start; mini_rule[0] = synth_start; mini_rule[1] = -32768; mini_rule[2] = start_nt; mini_rule[3] = 0; p->end_term = end_term; num_symbols = n; // create tables g.prod = NULL; g.prod_by_nt = malloc(num_symbols * sizeof(g.prod_by_nt[0])); for (i=0; i < num_symbols; ++i) g.prod_by_nt[i] = NULL; for (i=0; i < num_prod; ++i) { stb_arr_push(g.prod, productions[i]); } init_prod = stb_arr_len(g.prod); stb_arr_push(g.prod, mini_rule); num_reductions = stb_arr_len(g.prod); p->reductions = malloc(num_reductions * sizeof(*p->reductions)); symset = (num_symbols + 31) >> 5; g.first = compute_first(g.prod); g.follow = compute_follow(g.prod, g.first, p->start); for (i=0; i < stb_arr_len(g.prod); ++i) { ProdRef pr = { g.prod[i], i }; stb_arr_push(g.prod_by_nt[encode_nonterm(g.prod[i][0])], pr); } sets = generate_items(g, init_prod); num_states = stb_arr_len(sets); // now generate tables actions = malloc(sizeof(*actions) * first_nonterm); p->action_goto = (short **) stb_array_block_alloc(num_states, sizeof(short) * num_symbols); for (i=0; i < num_states; ++i) { int j,n; void **list = stb_ps_getlist(sets[i], &n); memset(actions, 0, sizeof(*actions) * first_nonterm); for (j=0; j < n; ++j) { int p = ItemProd(list[j]), c = ItemCursor(list[j]), t = ItemLookahead(list[j]); if (g.prod[p][c] == 0) { if (p == init_prod) { // @TODO: check for conflicts assert(actions[t].type == A_error || actions[t].type == A_accept); actions[t].type = A_accept; } else { // reduce production p if (actions[t].type == A_reduce) { // is it the same reduction we already have? if (actions[t].prod != p) { // no, it's a reduce-reduce conflict! printf("Reduce-reduce conflict for rule %d and %d, lookahead %d\n", p, actions[t].prod, t); // @TODO: use precedence actions[t].type = A_conflict; } } else if (actions[t].type == A_shift) { printf("Shift-reduce conflict for rule %d and %d, lookahead %d\n", actions[t].prod, p, t); actions[t].type = A_conflict; } else if (actions[t].type == A_accept) { assert(0); } else if (actions[t].type == A_error) { actions[t].type = A_reduce; actions[t].prod = p; } } } else if (g.prod[p][c] > 0) { int a = encode_symbol(g.prod[p][c]), k; stb_ps *out = itemset_goto(g, sets[i], a); for (k=0; k < stb_arr_len(sets); ++k) if (stb_ps_eq(sets[k], out)) break; assert(k < stb_arr_len(sets)); // shift k if (actions[a].type == A_shift) { if (actions[a].value != k) { printf("Shift-shift conflict! Rule %d and %d with lookahead %d/%d\n", actions[a].prod, p, a,t); actions[a].type = A_conflict; } } else if (actions[a].type == A_reduce) { printf("Shift-reduce conflict for rule %d and %d, lookahead %d/%d\n", p, actions[a].prod, a,t); actions[a].type = A_conflict; } else if (actions[a].type == A_accept) { assert(0); } else if (actions[a].type == A_error) { actions[a].type = A_shift; actions[a].prod = p; actions[a].cursor = c; actions[a].value = k; } } } // @TODO: recompile actions into p->action_goto } free(mini_rule); stb_pointer_array_free(g.first , num_symbols); free(g.first ); stb_pointer_array_free(g.follow, num_symbols); free(g.follow); stb_arr_free(g.prod); for (i=0; i < num_symbols; ++i) stb_arr_free(g.prod_by_nt[i]); free(g.prod_by_nt); for (i=0; i < stb_arr_len(sets); ++i) stb_ps_delete(sets[i]); stb_arr_free(sets); return p; } void parser_destroy(Parser *p) { free(p); } #if 0 enum nonterm { N_globals = -50, N_global, N_vardef, N_varinitlist, N_varinit, N_funcdef, N_optid, N_optparamlist, N_paramlist, N_param, N_optinit, N_optcomma, N_statements, N_statement, N_optexpr, N_assign, N_if, N_ifcore, N_else, N_dictdef, N_dictdef2, N_dictdefitem, N_expr, N__last }; short grammar[][10] = { { N_globals , 0, N_globals, N_global }, { N_globals , 0 }, { N_global , 0, N_vardef }, { N_global , 0, N_funcdef }, { N_vardef , 0, ST_var, N_varinitlist, }, { N_varinitlist, 0, N_varinitlist, ',', N_varinit }, { N_varinitlist, 0, N_varinit, }, { N_varinit , 0, ST_id, N_optinit, }, { N_funcdef , 0, ST_func, N_optid, '(', N_optparamlist, ')', N_statements, ST_end }, { N_optid , 0, ST_id }, { N_optid , 0, }, { N_optparamlist, 0, }, { N_optparamlist, 0, N_paramlist, N_optcomma }, { N_paramlist , 0, N_paramlist, ',', N_param }, { N_paramlist , 0, N_param }, { N_param , 0, ST_id, N_optinit }, { N_optinit , 0, '=', N_expr }, { N_optinit , 0, }, { N_optcomma , 0, ',' }, { N_optcomma , 0, }, { N_statements , 0, N_statements, N_statement }, { N_statement , 0, N_statement, ';' }, { N_statement , 0, N_varinit }, { N_statement , 0, ST_return, N_expr }, { N_statement , 0, ST_break , N_optexpr }, { N_optexpr , 0, N_expr }, { N_optexpr , 0, }, { N_statement , 0, ST_continue }, { N_statement , 0, N_assign }, { N_assign , 0, N_expr, '=', N_assign }, //{ N_assign , 0, N_expr }, { N_statement , 0, ST_while, N_expr, N_statements, ST_end }, { N_statement , 0, ST_if, N_if, }, { N_if , 0, N_ifcore, ST_end, }, { N_ifcore , 0, N_expr, ST_then, N_statements, N_else, ST_end }, { N_else , 0, ST_elseif, N_ifcore }, { N_else , 0, ST_else, N_statements }, { N_else , 0, }, { N_dictdef , 0, N_dictdef2, N_optcomma }, { N_dictdef2 , 0, N_dictdef2, ',', N_dictdefitem }, { N_dictdef2 , 0, N_dictdefitem }, { N_dictdefitem, 0, ST_id, '=', N_expr }, { N_dictdefitem, 0, N_expr }, { N_expr , 0, ST_number }, { N_expr , 0, ST_string }, { N_expr , 0, ST_id }, { N_expr , 0, N_funcdef }, { N_expr , 0, '-', N_expr }, { N_expr , 0, '{', N_dictdef, '}' }, { N_expr , 0, '(', N_expr, ')' }, { N_expr , 0, N_expr, '.', ST_id }, { N_expr , 0, N_expr, '[', N_expr, ']' }, { N_expr , 0, N_expr, '(', N_dictdef, ')' }, #if 0 #define BINOP(op) { N_expr, 0, N_expr, op, N_expr } BINOP(ST_and), BINOP(ST_or), BINOP(ST_eq), BINOP(ST_ne), BINOP(ST_le), BINOP(ST_ge), BINOP('>') , BINOP('<' ), BINOP('&'), BINOP('|'), BINOP('^'), BINOP('+'), BINOP('-'), BINOP('*'), BINOP('/'), BINOP('%'), #undef BINOP #endif }; short *grammar_list[stb_arrcount(grammar)]; void test_parser_generator(void) { Parser *p; int i; assert(N__last <= 0); for (i=0; i < stb_arrcount(grammar); ++i) grammar_list[i] = grammar[i]; p = parser_create(grammar_list, stb_arrcount(grammar), N_globals, 0); parser_destroy(p); } #endif #if 0 // stb_threadtest.c #include #define STB_DEFINE //#define STB_THREAD_TEST #include "../stb.h" #define NUM_WORK 100 void *work_consumer(void *p) { stb__thread_sleep(20); return NULL; } int pass; stb_threadqueue *tq1, *tq2, *tq3, *tq4; volatile float t1,t2; // with windows.h // Worked correctly with 100,000,000 enqueue/dequeue WAITLESS // (770 passes, 170000 per pass) // Worked correctly with 2,500,000 enqueue/dequeue !WAITLESS // (15 passes, 170000 per pass) // Worked correctly with 1,500,000 enqueue/dequeue WAITLESS && STB_THREAD_TEST // (9 passes, 170000 per pass) // without windows.h // Worked correctly with 1,000,000 enqueue/dequeue WAITLESS && STB_THREAD_TEST // (6 passes, 170000 per pass) // Worked correctly with 500,000 enqueue/dequeue !WAITLESS && STB_THREAD_TEST // (3 passes, 170000 per pass) // Worked correctly with 1,000,000 enqueue/dequeue WAITLESS // (15 passes, 170000 per pass) #define WAITLESS volatile int table[1000*1000*10]; void wait(int n) { #ifndef WAITLESS int j; float y; for (j=0; j < n; ++j) y += 1 / (t1+j); t2 = y; #endif } void *tq1_consumer(void *p) { for(;;) { int z; float y = 0; stb_threadq_get_block(tq1, &z); wait(5000); table[z] = pass; } } void *tq2_consumer(void *p) { for(;;) { int z; if (stb_threadq_get(tq2, &z)) table[z] = pass; wait(1000); } } void *tq3_consumer(void *p) { for(;;) { int z; stb_threadq_get_block(tq3, &z); table[z] = pass; wait(500); } } void *tq4_consumer(void *p) { for (;;) { int z; stb_threadq_get_block(tq4, &z); table[z] = pass; wait(500); } } typedef struct { int start, end; stb_threadqueue *tq; int delay; } write_data; void *writer(void *q) { int i; write_data *p = (write_data *) q; for (i=p->start; i < p->end; ++i) { stb_threadq_add_block(p->tq, &i); #ifndef WAITLESS if (p->delay) stb__thread_sleep(p->delay); else { int j; float z = 0; for (j=0; j <= 20; ++j) z += 1 / (t1+j); t2 = z; } #endif } return NULL; } write_data info[256]; int pos; void start_writer(int z, int count, stb_threadqueue *tq, int delay) { info[z].start = pos; info[z].end = pos+count; info[z].tq = tq; info[z].delay = delay; stb_create_thread(writer, &info[z]); pos += count; } int main(int argc, char **argv) { int i; stb_sync s = stb_sync_new(); stb_sync_set_target(s, NUM_WORK+1); stb_work_numthreads(2); for (i=0; i < NUM_WORK; ++i) { stb_work_reach(work_consumer, NULL, NULL, s); } printf("Started stb_work test.\n"); t1 = 1; // create the queues tq1 = stb_threadq_new(4, 4, TRUE , TRUE); tq2 = stb_threadq_new(4, 4, TRUE , FALSE); tq3 = stb_threadq_new(4, 4, FALSE, TRUE); tq4 = stb_threadq_new(4, 4, FALSE, FALSE); // start the consumers stb_create_thread(tq1_consumer, NULL); stb_create_thread(tq1_consumer, NULL); stb_create_thread(tq1_consumer, NULL); stb_create_thread(tq2_consumer, NULL); stb_create_thread(tq3_consumer, NULL); stb_create_thread(tq3_consumer, NULL); stb_create_thread(tq3_consumer, NULL); stb_create_thread(tq3_consumer, NULL); stb_create_thread(tq3_consumer, NULL); stb_create_thread(tq3_consumer, NULL); stb_create_thread(tq3_consumer, NULL); stb_create_thread(tq4_consumer, NULL); for (pass=1; pass <= 5000; ++pass) { int z = 0; int last_n = -1; int identical = 0; pos = 0; start_writer(z++, 50000, tq1, 0); start_writer(z++, 50000, tq1, 0); start_writer(z++, 50000, tq1, 0); start_writer(z++, 5000, tq2, 1); start_writer(z++, 3000, tq2, 3); start_writer(z++, 2000, tq2, 5); start_writer(z++, 5000, tq3, 3); start_writer(z++, 5000, tq4, 3); #ifndef WAITLESS stb__thread_sleep(8000); #endif for(;;) { int n =0; for (i=0; i < pos; ++i) { if (table[i] == pass) ++n; } if (n == pos) break; if (n == last_n) { ++identical; if (identical == 3) { printf("Problem slots:\n"); for (i=0; i < pos; ++i) { if (table[i] != pass) printf("%d ", i); } printf("\n"); } else { if (identical < 3) printf("Processed %d of %d\n", n, pos); else printf("."); } } else { identical = 0; printf("Processed %d of %d\n", n, pos); } last_n = n; #ifdef WAITLESS stb__thread_sleep(750); #else stb__thread_sleep(3000); #endif } printf("Finished pass %d\n", pass); } stb_sync_reach_and_wait(s); printf("stb_work test completed ok.\n"); return 0; } #endif #if 0 ////////////////////////////////////////////////////////////////////////////// // // collapse tree leaves up to parents until we only have N nodes // useful for cmirror summaries typedef struct stb_summary_tree { struct stb_summary_tree **children; int num_children; float weight; } stb_summary_tree; STB_EXTERN void *stb_summarize_tree(void *tree, int limit, float reweight); #ifdef STB_DEFINE typedef struct stb_summary_tree2 { STB__ARR(struct stb_summary_tree2 *) children; int num_children; float weight; float weight_with_all_children; float makes_target_weight; float weight_at_target; stb_summary_tree *original; struct stb_summary_tree2 *target; STB__ARR(struct stb_summary_tree2 *) targeters; } stb_summary_tree2; static stb_summary_tree2 *stb__summarize_clone(stb_summary_tree *t) { int i; stb_summary_tree2 *s; s = (stb_summary_tree2 *) malloc(sizeof(*s)); s->original = t; s->weight = t->weight; s->weight_with_all_children = 0; s->weight_at_target = 0; s->target = NULL; s->targeters = NULL; s->num_children = t->num_children; s->children = NULL; for (i=0; i < s->num_children; ++i) stb_arr_push(s->children, stb__summarize_clone(t->children[i])); return s; } static float stb__summarize_compute_targets(stb_summary_tree2 *parent, stb_summary_tree2 *node, float reweight, float weight) { float total = 0; if (node->weight == 0 && node->num_children == 1 && parent) { node->target = parent; return stb__summarize_compute_targets(parent, node->children[0], reweight, weight*reweight); } else { float total=0; int i; for (i=0; i < node->num_children; ++i) total += stb__summarize_compute_targets(node, node->children[i], reweight, reweight); node->weight_with_all_children = total + node->weight; if (parent && node->weight_with_all_children) { node->target = parent; node->weight_at_target = node->weight_with_all_children * weight; node->makes_target_weight = node->weight_at_target + parent->weight; stb_arr_push(parent->targeters, node); } else { node->target = NULL; node->weight_at_target = node->weight; node->makes_target_weight = 0; } return node->weight_with_all_children * weight; } } static stb_summary_tree2 ** stb__summarize_make_array(STB__ARR(stb_summary_tree2 *) all, stb_summary_tree2 *tree) { int i; stb_arr_push(all, tree); for (i=0; i < tree->num_children; ++i) all = stb__summarize_make_array(all, tree->children[i]); return all; } typedef stb_summary_tree2 * stb__stree2; stb_define_sort(stb__summarysort, stb__stree2, (*a)->makes_target_weight < (*b)->makes_target_weight) void *stb_summarize_tree(void *tree, int limit, float reweight) { int i,j,k; STB__ARR(stb_summary_tree *) ret=NULL; STB__ARR(stb_summary_tree2 *) all=NULL; // first clone the tree so we can manipulate it stb_summary_tree2 *t = stb__summarize_clone((stb_summary_tree *) tree); if (reweight < 1) reweight = 1; // now compute how far up the tree each node would get pushed // there's no value in pushing a node up to an empty node with // only one child, so we keep pushing it up stb__summarize_compute_targets(NULL, t, reweight, 1); all = stb__summarize_make_array(all, t); // now we want to iteratively find the smallest 'makes_target_weight', // update that, and then fix all the others (which will be all descendents) // to do this efficiently, we need a heap or a sorted binary tree // what we have is an array. maybe we can insertion sort the array? stb__summarysort(all, stb_arr_len(all)); for (i=0; i < stb_arr_len(all) - limit; ++i) { stb_summary_tree2 *src, *dest; src = all[i]; dest = all[i]->target; if (src->makes_target_weight == 0) continue; assert(dest != NULL); for (k=0; k < stb_arr_len(all); ++k) if (all[k] == dest) break; assert(k != stb_arr_len(all)); assert(i < k); // move weight from all[i] to target src->weight = dest->makes_target_weight; src->weight = 0; src->makes_target_weight = 0; // recompute effect of other descendents for (j=0; j < stb_arr_len(dest->targeters); ++j) { if (dest->targeters[j]->weight) { dest->targeters[j]->makes_target_weight = dest->weight + dest->targeters[j]->weight_at_target; assert(dest->targeters[j]->makes_target_weight <= dest->weight_with_all_children); } } STB_(stb__summarysort,_ins_sort)(all+i, stb_arr_len(all)-i); } // now the elements in [ i..stb_arr_len(all) ) are the relevant ones for (; i < stb_arr_len(all); ++i) stb_arr_push(ret, all[i]->original); // now free all our temp data for (i=0; i < stb_arr_len(all); ++i) { stb_arr_free(all[i]->children); free(all[i]); } stb_arr_free(all); return ret; } #endif #endif uTox/third_party/stb/stb/tests/sdf/0000700000175000001440000000000014003056224016322 5ustar rakusersuTox/third_party/stb/stb/tests/sdf/sdf_test_times_50.png0000600000175000001440000031500214003056224022353 0ustar rakusersPNG  IHDR  UIDATx^c?(      y!4!0!0!0!0!0!0#3F;)4FC`4FC`4FC`4FC`4FC`4FhvGhhhhhhvGhhhhhhH >!0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      Ѥ?!0!0!0!0!040!0!0!0!0!0!0B`tp4hhhhh h      h      I!0:C8GC`4FC`4FC`4FC`4FC`4FC`hp4鏆hhhhhhp4 hhhhhh!M!0!0!0!0!0!0BC`C8GC`4FC`4FC`4FC`4FC`4FC`C8FC`4FC`4FC`4FC`4FC`4FC`4FR     !0!M!0!0!0!0!0!0!M!0!0!0!0!0!0#)FgGhhhhhh&           3}4FC`4FC`4FC`4FC`4FC`4FhvGhhhhhhvGhhhhhhH >!0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      Ѥ?!0!0!0!0!040!0!0!0!0!0!0B`tp4hhhhh h      h      I!0:C8GC`4FC`4FC`4FC`4FC`4FC`hp4鏆hhhhhhp4 hhhhhh!M!0!0!0!0!0!0BC`C8GC`4FC`4FC`4FC`4FC`4FC`C8FC`4FC`4FC`4FC`4FC`4FC`4FR     !0!M!0!0!0!0!0!0!M!0!0!0!0!0!0#)FgGhhhhhh&           3}4FC`4FC`4FC`4FC`4FC`4FhvGhhhhhhvGhhhhhhH >!0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      Ѥ?!0!0!0!0!040!0!0!0!0!0!0B`tp4hhhhh h      h      I!0:C8GC`4FC`4FC`4FC`4FC`4FC`hp4鏆hhhhhhp4 hhhhhh!M!0!0!0!0!0!0BC`C8GC`4FC`4FC`4FC`4FC`4FC`C8FC`4FC`4FC`4FC`4FC`4FC`4FR     !0!M!0!0!0!0!0!0!M!0!0!0!0!0!0#)Fc|4FC`4}<~x޽SWWϗ,Yrʓ'O cy̙3$$$yyyz~qΜ9.]222/W\ikkcggWTT$ôsM0A[[߿hhh ]2:GC`4yl۶-4471};mڴ,뷶"+[zFMM͏?WAAɓSRRt>|7oP/%%%'NLLL$մŋ;99wuu{qo 4vagg$]]]1&!0!0!0B`C8hGC`4y4~.O[8mU]Gajj* T1Cس/yyyj&pV0..v mϟ6Ν;HBBBN:ƲΝ;Fhhh `h h !pڵk=kjjz"@`^^&߾}N%YXX O>){5C(]\\ \[QQAgd\+%%G&@Ӧ&`J@"gϞ533vn 477)P ̘ahh ш  X;!3gC`ҤIX !$20{@f m:oxH$\p!p"A  \G}ss3pjll,l!pJؙg!0!0!04C`th !p==O!".\uM|/_VUUi2pŋx߾}{ƍ@ʬٳgk4*GC`4FC`4FC`hp4鎆h =zؠ`l׮]׮]ï_BKj(p g \I7H\%pׯ_?t!.Ւ@A|x 777xU1KJJ Xxj.EXXX j}Mw-*a˖-cxn P=p!P%,VKGb---n s]2`xl)ЅhzǴEGG#x Юi`,Ç@? gccJKK۷bUUU!̐hvpyx*M=3TLB@!0!0!04Ca4FC`4FC`p w3 {؏,X.?!J'VZl'tꀆg] 71eF}NCvkkkV|QQQa3oND%PvEw]_~ 3f*g !7TNϮ+u- o4ru@xHkf W-$#0.7F+Ue񾾾2??? ]h:23 9v(   t;!0B ] HKq„ @opssCiٳ8rExr Quu5 <Y\ pq]v[ Μ9Q2?2T36!\@cwN@ vt',_r(K.Ev$<~.(<њp444@Sv >;]A`D/*D (N3UZ^~I9pui8P"X`o x*pךU }wґ! *++ vWN^y<8d=\N w1؁v'_84tƌ@(g5%?=BBC'N<~ݻw/0܀ Ӏ ;~8 g`@̀n\{Cx4 p2@_@B _Z bA M6gzk5}E` 5}YV@AȚa@AEf|k%r][x"p[<~H`p7"vQTc4FC`4FC`4t0Q8!0C%=$| x-S4.ਜ਼v ]/`u^|"+ SjpA`r;PEBA5N),` mT,(0(ބX:o<`7~p$p9+&FǁzsWc}͊Cl! vZ[[#on>vS@S $^NEu`h5;a=(F.!0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      Ѥ?!0!0!0!0!040!0!0!0!0!0!0B`tp4hhhhh h      h      I!0:C8GC`4FC`4FC`4FC`4FC`4FC`hp4鏆hhhhhhp4 hhhhhh!M!0!0!0!0!0!0BC`C8GC`4FC`4FC`4FC`4FC`4FC`C8FC`4FC`4FC`4FC`4FC`4FC`4FR     !0!M!0!0!0!0!0!0!M!0!0!0!0!0!0#)FgGhhhhhh&           3}4FC`4FC`4FC`4FC`4FC`4FhvGhhhhhhvGhhhhhhH >!0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$H߿ kaa!effz߾} $ R9z4FC`4FC`4FC`4FC`4FC`4[2z0}^xdggŋϟOjkQQ4Q}Td5%%%xl 8T3e+W@k.\z-Ztŋ=ztm۶I&zIGիW_`Ϟ=ϟ?o90B:::pFʏ?H0;wahhhhC`du DGG\H^vЮm}xk^__?&&('>ǏẀfB؟?0].!!!x냈{[lAS/f/ WYPPP\\n:{PիW-,,Η/_ =d01G0@Vdý dȀ d]aFv T/h b5$H;tdjj*ăpW!;(By&pd<}c"0xJ1222    o%쑑nkk˻}vrr2pbعN:thΜ9EKKS t!@6nMOOvˁ߽{[>Zhhhh=C`Q`W ܀}`K{TTv䌌 ;W!piPPp^q:[Nr`2 vbcc^ٹuV`حvZA-' 4y^+p'pu;wRn!% RRRحN~{E~,PoDDċ/ ; !;r7n8|p`` dlbb"j*`;v`ػz,0Ll*pطJv=:˵ ޽{)v6윛P@{VVV Ċ+V2 &`gl܎n h6C8? )j`jll3 @(, {>>>@]%@[ 333`lڴ ;͛g``Cɟ;w.B{0 ``gΜ t6 L@.(     hI'`8bA$!`/.##k8l-2D4hw狀H`OlΝ޾} ꁽG`g *`_"4' L.]oie w ` 8;Q ;u)?`&<4 p^v3@p~:lpz ^mnn.B !@n6T`8caYD`B nv ᦪ qN2Sd.pggg`s<0"pq` @.Poo _ Q``؁8{y*(     3pH jq/I6"@BgϞD@qbB`#^ev䀽D\H \;T<`#8\ f@]>P8'ր],@t@g@U. .wjL1Z/']^;;; P/^`'رc>NQk]@ `7N@g)FDPpzsڵn zYn( /ӕ.06`a( \3+o8 eQ0Z  8bvҀ!0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      Ѥ?!0!0!0!0!040!0!0!0!0!0!0B`tp4hhhhh !(Ϟ=ǏǕΝ;GrΝW.ݼylÿ}Ѳa4FC`4FC`4FC`4FC`4FC`ݻ HΜ93999;;;[MFyRXl۷oۇiگ_Zqij.\)1Nֆw||"wvv!0!0!0!0!05?bwӦM~~~O>v;v5uuucc .-BBBf̘!""\<]x1t=iMMMvww_rǏ+**n:GC`4FC`4FC`4FC`4FC`4eB`o9""іe@۷geeEFFaaaeRR\j˖-ӧOokk߰aäIӀiii@q7;Z}}};w.PޡC9 1 ;|0uϏٱc5+Vn߾ $RdII AAAG''G.X8 Tiff}+ t2PJNNԩS22294FC`4FC`4FC`4FC`4FC`Bh.]677CΜ9`GR-ΪM.tttܹsgTT3{YEEE@]EUUU@)`u2222֯_8q ԩS'O,((@Ht \ 9>|W\5A{@)&&&A!!h7!0!0!0!08XFcBY>V:RZ(;::hpqڵk' G߀f޿UUU}%Qyyy&L.Y .GOOO8Pׯĉӏ@5>!T$deevk<("b58={wIYY2!0!0!0!0!0\C`'nN͙3-w7oF p)&p xf  ݻwM  {՛hg&Āsդ'P}MM p=y$P1GUT^rPSyyy`gbp `/N@-֭ձV :@__SFG˾    !0%pe.<88$k@p'p$pZٳgU.P{w7P@O>WxW{/,vހ }KJQ`' Z<9!0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      Ѥ?!0!0!0!0!0‘?^ :u*++ѣpu3} ޙ3g233}}}w5 Qtywww޿ҥK󧼼.XXX8Zhhhhh HW^yҒ ݰa2Zo#֖vW\\ sFGG[-׮];Θ4i<<<`ggg^^}Aį\2a„ӧO     ~8% n KXX31bff(=? 1c[K3=^^P"pƲQQQh… /^=00v礤$`@8qFvvܹsB83>|0qDK޽ R[[ @cpn۶m@@L`f;wܻw4"ϟ?z0 .($$)##0 FC`4FC`4FC`4FC`4FC`4G*v}koo;T~qeQQQ ȑ#N;w kvbcc"555'O2]#dc}&//v쨨g@gWuV@WA+0!P h۷2-@NA47Q,,, 2@pӦMB]Gy@,Y.q60]GQ0!0!0!0!0!0!2 Gn@`x P8YY dv8qqqrJWBBLMME6x ػw={aBN[N{ɺ02E` ` wvV{1#( nnn%%% 8gx-˗/'&eeev,!;]MDd'-[vbMMM!a <40-2e 0]hV/s@e@Fhhhhh@hP.j-Z S\/ٳlll)'߾}/666`/;z% \Y \fp8! 4h.wנ=Uׯ_C \ \Jy~"##g͚l/<98 D7Μ9;'0\6BQ0!0!0!0!0!@ UUU..%nê8w!pCV( AsMn+ j"P3-9WXr|oaEEPǁsqi`/M#p})p*<[[~Y6%%ع. w''*T^A{`\h \_ 1     !n޼ 5g7"BC;SC~'ʀ0`Gŋp1*Dm<) ''@ 8nPe@Ţx@]o}B>>>`g؉: T$ {b@s:ܯ|,* ׯ'- ^...ȲÇ 2@`_4)2     3+$$R`W 8< L:v#|Tt?1"<8!0!0!0!0!0rB`CH~kk+ya0u+Ȱ8(x'(*8 !0!0!0!0!0#3F;)4FC`4FC`4FC`4FC`4FC`4Fh2:GC`4FC`4FC`4FC`4FC`4FC`hp4鏆hhhhhhp4 hhhhhh!M!0!0!0!0!0!0BC`C8GC`4FC`4FC`4FC`4FC`4FC`C8FC`4FC`4FC`4FC`4FC`4FC`4FR     !0!M!0!0!0!0!0!0!M!0!0!0!0!0!0#)FgGhhhhhh&           3}4FC`4FC`4FC`4FC`4FC`4FhvGhhhhhhvGhhhhhhH >!0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      Ѥ?!0!0!0!0!040!0!0!0!0!0!0B`tp4hhhhh h      hϟ?O:5<Ξ=KR8]xq`֭[.]q{ܹ48!0!0!0!0!@q3? P(d;v\RRWtttC߿4Ǐc0gzccc`*\pQFqAAA```?\ӧOڭEhhhhh`ivoi&wUWWO5XTPP-@|xÇ dϞ=...d;xҤIyyydhOMMRSS0~:{{-ܹZ`gg!sڵ˗/!0!0!0!0!0B`~Obdddcc7# WTTAFFDKK+99yԺuڮ \ILox޼yd;8 <222锇777'lccf }CA;@(     #C255 RϟG l\ pKӧ,lp& } 7@BdǨ;nXhP\8U lZ`vN'.I8G 3gw gKJJ 1D Fhhhhh!$?[݀7` xDE7G???ࡗh{GUUU.֭[&Hw 8ܘgS@$\2%fll,=BYeeeܭ<2c Oguq󾛛C vlȶF4Wo*|p*p`Hw--p!7T_\\ \%g2    !0!$3} p %p#"~*++ GO D>8)ೈm@۶m+D` x =8p x.ovM tp(|&Px di4@[k/|d^+ Wrb*v@K \@.1Eh._ 4a!0!0!0!0!0B`Dw_~ PI0HkBr lJN 9vvvL-9@[j97zK4}}i|7`Ʉ\=A<znZS,^{qg,1%SUҀ gP.޶{2>p0SUvvv(ꁽG"I`/FvEj ,w<xD'_^nb <@RE 1 ܏@nJ͙3/bx p+#@5@_p=y6@=7HxN  ` kVWRRw|kF؏n: S`8#z=@ j@4@l`دF{#GGG___,ɓ' DC.g ܂ahhhh !lQ gzA nv`@`N L16hhhhh SFE/ GjR}FHl'd'} a4FC`4FC`4FC`4FC`4FC`C`tp$BBJFmxU<'Đn੤/^uCx pyh&     !0!DQDzܦt <7ݻwѬ8!0!0!0!0!0&     !0zh      h      I!0:C8GC`4FC`4FC`4FC`4FC`4FC`hp4鏆hhhhhhp4 hhhhhh!M!0!0!0!0!0!0BC`C8GC`4FC`4FC`4FC`4FC`4FC`C8FC`4FC`4FC`4FC`4FC`4FC`4FR     !0!M!0!0!0!0!0!0!M!0!0!0!0!0!0#)FgGhhhhhh&           3}4FC`4FC`4FC`4FC`4FC`4FhvGhhhhhhvGhhhhhhH >!0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      Ѥ?!0!0!0!0!040!0!0!0!0!0!0B`tp4hhhhh !ሿp~E/_$P)߿W^}0.{     a,#0.;::FFFf .ںu+.-sMIIILL7oh"E@ _~ݿf駬F^`|RYY9<<< ӢoΞ=Y;wVUU&$$ţ!0!0!0!0!@Ia#;;;0ϟ@ׯ_1cƒ%K޿/%%`OqqqU @<~i̙@wB:,IHH033FJJJڰa0Ɓ+VniiA)  wP]s͙3gC0 FC`4FC`4FC`4FC`4( !߶m<&Nd[YYAMLL|  ^__߯_ `0ȓ'Ozzz&O q'C2쌌 `}٦MR"0Qt\#G@1kmmM8;;-}͛73pyyyd'qrrlll `4FC`4FC`4FC`4FC`4( !Ezx4iPMc> 0xxx AJNa,gϞE zC"80k֬-[ woooo\".O$%%GShhhhhP#Pά,\4?!kCCT[֬Y5Tb3Rǽ{9p.w T:!0!0!0!0ha ~Bd)Lpps7o.ijj.lllǏ? /C6@)JBF2`o"<2dݺu8`?hpe 3!@5@ǰp_'p+PӃ(}v`O0qquuudg?9 nlz`ҥ\p~2JJJw܁(PQQIOOrn߾ d888 [cSNwKgddvTsA-jnݺ :UU7n,[ 2..xӧO^.Xv!O} &0=UVABx.|M>?/:rm~Xlhht̎= O`Ex d Z[[.{ > Cٰ:!d!0!0!0!0`0|NiiixSNA]hD0.G@ v}0ΧÇ!""A;. @:Zōw(YR 쓠 ؗtGr#0 \ =*`@6<" \v b>HG@#C;&,,,""ā>W&@s D3 r10    ,F`:s $۽Lx[Bё@.W<O "w}\=pB x$.퐃(3ppx3D7o>,"PDMM ""[<EJAPde@en\ʕ+Ȏt6C'"@3srr"-PC8]l,0X,[hT U•y3|]bHx% D8q tpj߇Gv)0 6bu]AH8Kf8pCQ0!0!0!0!0 p=$ 2`W ȀBDZ&g*tx@;FM; B`G!L>h p'\!` ҕ^v+F8c)\p/66hK{^k7 |kO@Vtp"hpN=~,pf8~$X w?~Ce .AH-"Q m6.2AOVHxvHxAP8rp$1n.NWB!>@!3qu!OOvM5~S:CI݃4`.G"\[ \ Ł7yِ.B`x, R.-=d&Ky80    ``2@LB: Xp8xUOĕ  DW˗6NTtv< p#pN 84pxp)x)p yH ك(p1,zF@@-@7)p,0Ӫk! t{0$V^| lJȩk7[X 9'#*NM^Dd+,@. uOvHgOAA؟dddc x*|M`xiqq1!ÄAw`!0!0!0!0!@IcZSCE0=` " v(@D}!`@ZO]Ǐ gLp x=tS8\2Ko?rUAf!^p%ph>;D#]2 ODpR` h.L;BhN`` pq)?r`#; { gwA` (<Ah ]7_ @A^E,P`"xY`tzE @M]u|rrrxS݀a;+ ׀[ !NvfDZw #OA.m8y:Bf|Щ.vg p`x*p 8Q a/up2) _ L L y>K \G {!C 9 A-p*`GҐlT:{AAX}kȭ@YЩ|bp͔Spi ^vS,そa`<8<'2     "Ftp1%;NF%v5Oxwo~*T#!0!0!0!0!0Ce4vhN0Sl^ TA,"p 'Mۣ!0!0!0!0!0C`C8TSp"p#Iu+>|^7\\IbQ2p)p'PȚ?!0!0!0!0!'F!0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      Ѥ?!0!0!0!0!040!0!0!0!0!0!0B`tی3,,,ϟOgϚ:;;ZVFFc҃&$$hjjݻwPRRRMMMJ[dɆ ޾}K%*^nׯ+^r%0=&    GZথ^ح`ffxrssCD~ ˁ]͛7߿(;{씔VYY -^8&&*,((IIgϞ ˈklls0 ڵ ͩSfeeXC@BB˗ݻ E߸qn{EEPc/_zUlqqqOOVd0ydԅ GhhhhCe)Segg[YYqppC8Md011Aؼ޸q#pӧIII"CHdyzz.]8IHp6e͛78YzpժUzzz=G;b8 L$QVRRbfffggw޽={f%`Iw666@Żw*:@#GvFhhhh"<l2dh._ ?`N]Hv! g=77 Rŋz/M$>|nm !r<VBBBC*p#p?###ܹs    HCIdﺴTNNw0JSNݾ}ؑ.{zΝqqqT2?bpU$p}bm@p8,ߵkא]K,++spp g;;;!\4AHFahhhh FQ4ήQ 쫌&Bڅ͛7.հ:h#?߿ ӃAaaadY]\\**))Ah    nBRKFGB˗/8Y}\~HN6n:?ĺE>1<j4hhhh"XF{n__ߎ;€}4?~ \}+V#g }tׯ_ AbСCD1<$&77m ȹBNMv/o{_p. [xf)D-7[~---Ȋ= ;@A#cccJ`om*WAC`\1{-9S"H` @ -LGf g5 N> www֐mFJ` f` gc;uĉ@#+33M@!VaBPlmm!~ 0 ǟmȀ :`yO"޿'"" jHnٲހ/x80ҁ ;ȇ-05@3g/'c-:x.ŐSF? FC`4FC`4FC`4FC`4h  R;Ih@BPP 78+`XGR^weŁܟ)r*#ZY.ob:둵C5gG6mBV (M`Y(^C:Ѽ9m4z48$003dׇ'=#!؝KLLD5kD1p .,{@q'3}i%hCF ^~x gV', BKw"TI)޻%p.07px/px'.b@Q0!0!0!0!@’a~~>r݇Qy0!d>FV Qv!V hBp v;!.䉬"Ts.eGH%L@AbL)\B Ep&; !Dvb̙l0=@&  Dإ9s wC ̄w!BD5a |1 w0 ܞ\C ~]+ZY=p5Or$1(    ,F2 Hn Rx "LJi6W\W!w֫/;3h8:|t ܦ,g% `r+ٳg=[,d 8_x:P}@@aa!pjikvɀMߎcHtTí+rAal''Y@m9m> 8g& Hph p"d`;*,-@7\ \@ ?bN@`.N'!c͛q`?Ge!0!0!0!@R!h-rȬD9::{b]^~z"{5Ẍ́4GA ޵Hʼn[ zCXk9r9Qzi Ҿ^>Տ:(++T89p x`&p E ' kta(L$|3!VWWT ^ <p:BG;npx)Ӏ^ 0p+km*V0µC1nÚNR-&p T jkkcB `4FC`4FC`4FC`4FC!0!*։ 7DIp@..;x= OdIqiӉ{́H@4@nb&u p#HbvAD%Vc<ȐUL`/`/U%:IdŐ[W*h0v!mB kk8}3 8wd{S3:t\"<X2ZVFA24 .D (`;$0N!=mdSX%=%xn0 FC`4FC`4FC`4FC`4ph6NIbR Uhp.8F]%v@6 Np ب.Ng]8P/ppjx % l77k@'`g؁NVqsse''R+{<p;L`iF/ `'6k4 }gr[WinzD>?kS+}i T ܚ9Nh{޽ 4  H!wz >SyI`|U~~~p12>v! j 0Wkx9p HLp *0@.8W?R`ƄD+06"`onz89<>$V899]\ L.%9S+е]y떁= $ʀ  mFFņt6֨FW2M8V !0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      Ѥ?!0!0!0!0!040!0!0!0!0!0!0B`tp4hhhhh !"~ݺuvvvdu]:ŋkjj8p`43fhooh T|C7N:uaOޓ'O޸qc4hhh`H 7.[_} BBB.pRҏp l122"nIk׮]iiiӦMxv G1߿_ .)~!ƢCCz@3{zzF;t4FC`4FC`4FC%Ug@144ܶmׯ_? M2xx:t ~8 b___mm-% 8!''\I 222B`Mph?G\\5ruurQP^^Nj?G^btxÇ~M!0!0!0!'F ! w"! J. YFCC#44ҥR€]A70C8 TZ842.++K`OgOLM>zWv`ƶy![[[Ѩ{q~~~2`   #q@7Hd* +򎦰aׯHLL k\VO66y8q=B$JѤNvWr(I5d߾}f!WJJ xhhhhB-777Sp#ٷoځC&]v$roݺ,y%KΞ=u4͓-dSȤ*((Hgdd s8e!0!0!0!5FQ{{{555p?hz!v5',BpIw< \l \vkmmM{rss߾} ]"F/4,$OGgG    !0;")I`0k|} `-xsJFS>!z˗!7<yŊD!n!B%%    !2@*ٳg;wx6s*1Qx]EEVܾ}xw"pZxI*i<" %&&h7,7%# 8}.ttt&6de@)vwA gcrG (.ӧ?|ɘ0S7aM>*0wrO[˿ֽ|gΜٽ{7pvso.&xORe \\nJ^Jћ7o#Q0!0!0!0C Ǔw9sN4EvLXXv`x- y `/x3 r j pwmTGG0% `O p)%0΃Bqss;l~:0$!Qc^|xŲ;v`W `ZHf]]]`l.@xGh#~c LY2Mxϧ]vQ0!0!0!0xCa4|C!s8e`oPGGGx En.WBiGzx, >"v bDdMF2:0P/jdRVpYdZشNŁSIMvp^Hvqj!Vhz~\(yk֬هZ"Ofggrd`s}Ή@lFЄ`668{)uuuY,W^ uN&## YXb5p2(TVg"gr Nb \ Q ((釩jHee%D r'.jH{45&_ .q#:n .Ĵ8?"bvwcf@ %!8E Ǻ8N4<}f< S!p0p^";? FC`4FC`4FC`4FCP{hX4=ccc p5"""QJoT&Do ={ M p#L]XoBv/FW $:2xJMoo/v7^`ox,\A^b 7 y^`p~ N0{v.< nFnZ)---}[ םĴn&0A:@`26mu.p<Oe{C 5t]W`8@^uL7z !(    "FOZ2go0\) ǔ}LϤ$d5 rd\ FY,{se@A:޽{e0u;!`K(u]d!pB(UPj:`8M l@CL8@6p1?HYD`tpm- +W?!3Ԃ2 ܍5H{zgp)" 7ēB Z^B0 FC`4FC`4FC`4B'xk 2ф%R)p`T~ G=yJ#>c)` )Zod˖-7gײ`/?7 E#I ?q =ئv;{/`Wh Xp1p4 [(1Bān.nc βPD7]x0VOݾ};D FS}Μc R@?$H '2c`R__"000dzh0@>Ԋahhh!yҀwH 8ILIf3f4b< 8!@C ހQC`zgD0} Y: \n ߅`Qہ$Ah8U4뀣 E`4#LhF7b]0 FC`4FC`4FC`4FC5Fgug0"wI着@t3pQ%p%Pmo;p^"pfvg  pWaڋ&>}( C/p"ߙ{Yps–uhK|(po:V;Bf(Oa;R>|pDDf[9[wvuuaLcճ@qnF؝ux R #pQ(P8 Z \ \h c \ A^S@Ӏdt((    "F;=AN@^,cp&N »mXϿg@[idm p!ݘU.(|!%v༟n_J YBY@q N UVMnS_%p]=A̻s*AGhhhhP#Fg pGp}8tyjy8k<423'W\!:D pw`8u׈D_B#jǁ:LL1 {lΙwR[SD|j(zFhhhh!J< СC6lqf0z6U1 +]S^$ \ hx$VO\wNA@B0cKv] x 0F(I> pF eHN#c4"<S#1!N#xLT_ucç%B4;H\[ϝ;\T 1> 9#zeahhh !J"ou4?y`U* \!dL3 ::`83E S/uj8vRN'{HZA:yK1 ߐ  & ;8hI:;;'.(z'3in|'#CGt{S]h9gv5C @ñ:ޟGk#C3{Dz8 <b5@qYYYd&W̴ <> 4\[Ax?xK\΅>{m~80i/6 `4FC`4FC`4FC`4[N1Sp-^fx7hA)dlhRK,JOHA@K4B[j4rBNx36=pl `Sh +i,u+WDS+<+ԋ أFS\zyZ ػ ~ĿSoGŋ7y<4B.߯_ p>}:`S |DK]&ɱh*ØBE!fBvzCiiir7xW>0Ł׽!$6pp" 3f-UV) ld"αkNa{ti.>7B/` r8ɟP,pE@`' ~wZޗ p"+:PU ݉M' 8l}'N^Dj26߁3N)kGX`g `WNG玀z䭃X<xP ^dll,Vw6еh 8Y#|*$1 sR ''k5:4GgϐĀv P S|nD^S{hk/n)0)M *,"FD"U` #~?! LuL Sah\ ] nQ}6>D;Kbc` oΜ9,78vuy 50sb1 N0F`r 0SFhhhhHv0pP YUTt=r] n*SRv̀X^`~.M ح=vZ]P3Xjvӈt pRz];7<=؟FUh%x pZ8&`zRI ӱ8' D 1pޛ 뀺8j-2pS=~$%AU.YQ0!0!0!0H!0!M4 =iI<A Kk W (vFfn޼y4Shhhh =et4R?sz `i@bz@끋߀ ݘ,ɉ՞F3hhhhhp4 n ~U@X\׾wNɉx ?!0!0!0!0$B`tp4R?'| n-^Lt`oxpP `^t˗/wB#2bSK  X\7!0!0!0!0HB`thR~{wsM!g*oQN <x$v B!.V!#3%D>d4;hhhh X9xG9>H+IBzv `+$}#6o}G3hhhhhp4 *'ӀӀECAA8xyЊx{{{:سΏMC!0!0!0!0!0DC`C8ti{.^x=ࡣ%+ w%uB9!0!0!0!0t hb      &           3}4FC`4FC`4FC`4FC`4FC`4FhvGhhhhhhvGhhhhhhH >!0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      Ѥ?!0!0!0!0!040!0!0!0!0!0!0B`tp4hhhhh h      h      I!0:C8GC`4FC`4FC`4FC`4FC`4FC`hp4鏆hhhhhhp4 hhhhhh!M!0!0!0!0!0!0BC`C8GC`4FC`4FC`4FC`4FC`4FC`C8FC`4FC`4FC`4FC`4FC`4FC`4FR     !0!M!0!0!0!0!0!0!M!0!0!0!0!0!0#)FgGhhhhhh&           3}4FC`4FC`4FC`4FC`4FC`4FhvGhhhhhhvGhhhhhhH >!0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      B:EGhӓ'O;ÇGKA{͇Fcg4 !Ѡ    xviN:Ln޼'+++%%`ׯ_tGs``:500`ff GHCCCQQa׭[7w3ŋݻGv>ܹs?!0!0$?#cÆ ?]\\455!fg-:rD*szk֬*66K5ˣ|B""" `/ׯp gg}A<.!!S`4XzTQQ$aUV[^^^o߾~ZNN/11`ԴvG3hhh l! w"`犑v?DNNNd߿>dLӁ"7nE+V8 w-@[~43iii?}4[̊6^ҀNHv+W]dɒw0p 7n˓aގ;{^nR .###KKKUUUVVV`ѷ{K.{X;:GC`4FC`4FC``CeF/_{jjjuvu|8<<8VQQQS͛'0ehA4!0!0!䁓'OB]II Xc #GLdd$Ve׮]˂6TWW VT i`h,p.9J!333$pwQ0@!Fyшi!< 2\,↷k VRO =C\*;v "OBX͉!0!0!0!0g? ݻH#O)noll8@m }v&pIK`8 ]0 .!cMx:D p/fÔ277"~Z!4p\ ,; p;WVVY7H."Ι3M<<^E %8G lV/^eNX  x!` xr` xt@AՎ; k {to߸K{}||0ϟ%,AM#@V, ׯ_01ϸ'JH3߿/^D8C F[ b}PȦa¥`4`;81 @?;c222x01%ɧXcx f׻w7*3˗/^ r`8Sׯ_x[/C/7722OsGV?p7 `#{0V^7 }ވ eHڂv^ C0 FC`4FC`4C^5.!#=.x#_Le___دo `~)_}vv6.,^ : @ R Gc 8z㞞?=11A6 g{ &ׁ= /,, lwCXޣz*>0$f`v!{# &`Ahx=4hHuu *`.@^V8>_\M&S`W8P xZ20wCv#MXL@bU\I}<@7c5ڵkt*p6r`|)ݻw#܌3h޼yh燁c&O>|Á%X`(   ('7v'=߁{ Z}?` 8-l={ x59K1i&n-@4 DMʀG;eT{8xB # l"kΗjիEEEYf{e #oމv o ' W"'u&M.Z( \Q t' hm\`8\mLf;܁4b`8.L`gدN{/c 0QQQȾ:^vѲ Pp"m! `@󂍍 C7L4 ~`F==h[x`v7(`vhX Q)GCBBbpXvi&FH094 kC) 0?'x4˭[ ځ%恃Y4y40I!0!0!0!0!g*1iiiӦM5Bےl|MF-O؎NgB!X5y)8&;voԹsӆ =LeBemAk`c% &NU(p"n ^8% P1'ﬢuEW8+0x h rbVp`\m64Ӏ_&?) NjXx{,.Вplh…:R3IK]nh0  bwM p&n1phhJ `[Wϔ@s= S pB zDd 2P .7u!Ī85 w6p,p0CM=y Q .LvBYJ @@;T5ȩpÁsC.jmԨA{tx}d``t$Uim n8p]%2`D8Y$Y[[KGB4z pnM@Z2 "ϗ箁&Wwp (rvwwc.2F.@+) ]|.֫}Tş사`ՑH8 0uGhhh bZt ڇ Ó00<8Gy"D! kpru DGgO$;wpYL3ܴNaU 7,P/&(0NFVLp/> /E S BM\?RHȾ}% *}N8k43C\;t$p O Wb:p:qloGGr9` &;ʀK4d(7iazpp WCB(   AN0 B&!onP$.5ܜK1p C['-qYw޽{q΂#;R zFU7vb ;uD 8Un+8sԩS1wHB]#}6A@ee*,%<` >x` (Kd  !-3^Y\NJ-.K_+ a8_\ tp2p(.gs472pER.'c`.T 3q <Y1p&2`Rd c8A/)S4 ?Hw"QG2  B| J)/@)7{$[nVBi $';61\f砰"@|$+0[逻Z-@āhh́l, oB.XcO{  ^=d <ϛAU1pU0&dF MocmBX`h࿺r ~w2EV :E"X/\Yx1P{ c#]wF\OKop pT m$P p75O JkKXee!0!0!@NAl9`kՙ!I<7+2+kjj0 \Q*Ƞ!I A }KsP@S% 1OD6yC2!@)h`86lwi-E^y#"OͤVz./1 xCVa(F18kc Zb@8(x p!p-M  {5UgO;8y\~`ox/@P`AH~fex5o<O X/ 8dT!$Iț$[W@&{}**H\܅ m.p2&>.G;K"'dFVzvM5U\ <V(1'^\m0v 'O 9v"  tejj <s2 Oo-FD9.Rj<x8.\(pD"Л,A' ~ b ./x&*pk+p40{}vr$,&e!0!0!@ɉ5hz1=>rt7 k'nV.z#ߜu\EE'!Wc21;HΏ]v!#J! 0Oj>ڬpVe*1) cImfs pa'/A䁶Q֑ Cepmvz[Xס2Bm&c !$x}<<wlBmY\sVfz%7iGhhh !##h~.bc3FʀN\W Q^Q`︌E^􅼰xg|4a5 (Hp-~@1,.v-E41\5N|P?V^$;&Q&.^Zjv—A7h['vٜ t|6 M` `sn a:(ܗrsVB[n&r8# 4dPQ0!0!08B`C8{w޺Fd"oFI6x)i  BR$O.kAIJ'F*6E[! D\`*lUUpgX,@XqmZ.wcU D~ `|FPu9nڵk;h2  ԇ|QGV/FG;x]tH6x; 8m\h)v^E%Κ_Ev1UBjЦCMV"Ny 4 x \͐t!dfwE+1uWTn pi1p\ >+g`2d@瀱l/p?3`ާh\= Jtpex+.@^Ôp]]]Q0!0!0#F;0%7:L[J>wCԩSXmրE䅋@e+%N(p+ȧN <h6#Wt p]"nB7#Ir  h5GUjCkK)/6F++Q<B@idA s)t w0p5<?\ [!jXZZZ"zWQ0ǧ:3IIJl3srr;@A`x uK3#X7`Z<}pqJxN?.+ WD޺ ʊfp.#^ JFӧO /'&I$<@:%x1yh| P 8KbMQ a? ULxl@v py9A/!^FB\2  JBx;rۣdڈ> 2\*uU5533e>.%rpЅhʐ+GU br"0~"qcxD4p`  00 t/ďhIS#cU`4FC`4FC`4:Fkt BF@GnWO)eǏǥx95L)X[sq_`Qwa5l` u?ʀkvڜ4~` N$&06ˀ'Wu@YI!`x, V)A\qRTc5 ZKٹs'Q28?!;3ckk58dX TkkG&OB&-GEhWCIv'ր] _Mq!όp-Vs*++0LKHO#pT`=7=9|vvv ZngggE(&`ם{GMG p RJ^&&`4FC`4FC`4:F;Xb8Ak3Lf) q\эIU%p t!pJ e A:@Ӏ(I5: lsΜ96O `b6aQSX|P/s ܢx3o ~M"%555hg!V'#-{.  8F xv)Z: n"EA>]7f,D{hŪ-18LIy%*u*JKdOLsCE hڵ+=A; 8!O!1`Q Cf󓘮"|QJNDP4<4&9`Bz(A-耛 U##-13hppp!0!0!0!0!Dׁ`mAp 5SCeSshK"=s4J6[m9+`WN`粀]PwOY `SD;prFEеh&愁]5׬s%S/\ʃSL\HǼ8 ɭZ0\MǥQ)ȓ@] Dn`N83#01/D y`7`w9WbθpXOiX`55 "`sy`xguY>7*G`OH`S@ uVOs:p3Ɂͽ4'\LLo9; D`JC`"jq`g=q:iCEuX;8PӀ =Rb>0cX@c3e͛7Da4!0!0hp4 .x0W炀X 8 l=g]*G3$(vhhhh=)p_V=|\ Oc\ %h;!0!0!0B`C8&Ow[m]n,UfZ2 wWDDDf d@Ѡ    h"&!!0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      Ѥ?!0!0!0!0!040!0!0!0!0!0!0B`tp4hhhhh h      h      I!0:C8GC`4FC`4FC`4FC`4FC`4FC`hp4鏆hhhhhhp4 hhhhhh!M!0!0!0!0!0!0BC`C8GC`4FC`4FC`4FC`4FC`4FC`C8FC`4FC`4FC`4FC`4FC`4FC`4FR     !0!M!0!0!0!0!0!0!M!0!0!0!0!0!0#)FgGhhhhhh&           3}4FC`4FC`4FC`4FC`4FC`4FhvGhhhhhhvGhhhhhhH >!0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ /_;wÇvӏ?N8?~xY`W!5޾}{ ޼y3D!0Bt FhhhC`C8(Mxyyn޼IS7 ZZZJIIUTT l+ `bb"''7a„ќ<ߊ+"""EDD@TTӏ92P!0C`ƍZZZ ɓ'6!0!04 @?ŋo߾ wÒ%KiI&#]RR2е^reXXh2!uUV=~ݻ=!!!ii23ݻ7\]]w5_*u-[$p߿ bdddccVGx)tpss3px 8(hcc3FC`4FCv!0B;-y֌3bbb+ٳgY4!w>߿?T؟?8880]\\v=ZLxeFF0O&'' .l޼8,@)h Aastt/N9s.(s%Ve˖plXq`X(d8/''gԩpCFY`4FCv!22XgSNA:>}S^4u|)2 h Riׯ=S8 8HU^^TBR`w82!0BkU^ӧOM6!0BI*I__4BXV,$F!Ϛ5 8ܜK^^> S߿x񢳳3pEPxn۶ S140!04 # /.>cggG`wW}8.V.NÖ ~ւwZIɓX<4(!P\\ O y\a\D%h `40C #`-?eee*_dm߾H5`=FC`4FCF!0Bg[ ҥKJHHM*Yo ee$@p]`eeddd[ ̙^8+>pT33LLe/{{X Z<X1mA ACNUUUUN>"wF`5p4ώhB`v![2G{oذA\\%fSpp\000xj 2@ <% n6QZZ:Z(8q"<OcKYY8wɀZD{9|G0ӈZf! "W,_yVUUX;W/) ߋ'F Љ <!BL/Uª h:  C`v! kzć;pvCж, bBxpnRRR.L˵k׀y|y c`pĦ;vQ` j[ʁFhv+.???<ځKvjM]( @dki QЋ%5 4'(F;yx4K&g݁9PoxC p&ĉ#9̛78G <v4$._ ܨd:vAFxoP[[=wwXp ?[ hg@cM!0!@3 61%#X+Fhh'|p6cĦϯ^}z;+ygc9Ӄ@@m!%H>!1`\1nGC`4FC3E*,===%h \ʌ RCx4&L xh 4 < 4*:/ 9$50f HfV`@PEEe4hB`C8FC`4Xoq6d4/L )yIr4 #f厃3ٳ BAϱ#ibs>W& ,=TB8op̙'O ,,,K.GEE?t`C ƍ>|p X#_vNѣG7;OHH!.I6͛7;+^n#_GGb_@/o.-Oz<xy1"%#~ZDM@=\ xC]>3.x`NNNiES\f06ˬ1CmEdO>#$$$76qT 0GNRx0y`:744q!XKE777"}G`o>`M$ /_ .`=wOEDD|{Y̼ K,@CgD 2 !Fhh!p:::&N|ѓ&M+& .{.`_!7`' xI.n`K D%p=FB`hgϞzMDv`lll@ K 3gzA]]P޲e KFV&&ҸWSs A`KԩSSN'O2g }; !́CKKK~Nbξ>E 0!_/E!sbp@`R3}`8Tp@| G߿h[@WF`` xl߇F`177wrrRRR"@.^l2ځ)e@Ad]`A;S/ + ccAVgbq`'hʀ-,, 4@+,[A<`xw=~W x7 9prsspC#MGhh2F!pȉ/b0<ذa@!~6 əL΁c8"x7|i{țɳυe3f zÇx p-ocnp53ˢ!JL0(eʔ)hC">bZ AK Z, s]@*Ndg[`y¿x{.? FC`4FCz!0z!`:[ ϽC+ vp,$"B[Ă.5&1\a(mbnBxK'af6*Hm 490o89?u-kA>Ft4 2tpKIiS3E"pBj2R(  RB`C8 *nBx0 1>!n\4XĜ{ {@p pq`*\nN`<,¼-+q={7{`s*)fcZ$مl+i=@#p`2$ r ϑhNFT{q1'ꁋ7[B4(NI(aR<$ ` ^ "6dcc"79  0`|\qu >HF+]< f`dA RSBk FhhP;F;.My5#l<^"7*18}c F!K'w?9X'\G1DvUTT?! l 'sy1=px&GΠYy#P+<4JEEhVȽh\½ %f.x$ܪk׮i-F-1}r1-SBC/`vJv xj4֛4GUHD@MW@.#,כq#gjsF@wJA"=I!"c]J4dCFէg18ܲ ذ_5  bQ1 x ^TD\ Dܧ }@>`q 8\ y={9W%`<0b3X{59C9s߿jLKM+Su+O͑A8@(0kb!kh"^T@Tóm@ `4FC`4¡hw'r{Qd˗wUWWo6!GSphZ 橭H'#""u07 `Ch a`WB`oNNBij% >#JC#ƐWon6;)s/.OB7O<1a੡XO`,)R10W3أziEi'+LGBcys,"(` LM#G E;OkډE0 FC`4FC]2:|pU "UTp p)\ǫONuS=Z'`'K1\‡g3y<جA"JhV𴒁h۶m vTǃ^B.6{ zU71t  #Y`#8YJLu8`:LœnCVA 1Ar#Kb/p`ث1.v 1WQ$_ݤ'0 ڇhp4[R'[9؆!RiPQxF$1;L:H8k$#!H\lfc g#auYDl' vѧOFezQJ.1_S4" l%)F[0|H=4 !B܃v hGy;".#Oc1G^^x +@o1?%h;dWBQ0!@2!;kkk( 444a@YA<` 8Kp M& u9d5Je G- U]cEFǒ$y-#"‘+n $T*zsx&-bx#:CH\o1cLAS[ɓ!q6md"Yc6664F}®.R>@GgFhC`C8ʈ  >4< a<v8ɓ{ h5p9!@ypr?.!uS(u1PT h1LØcC`׬.Gx D;W"\/(f9C'k%[qA^o ^ >!Y̓'HGgFhB`C8Hz[9t~\1 T'$$v k\qmժUTw!333`dd7x3p p >ܶ<έqF 9hk;\|\ƴ xp%=0 ۈ6I\ϭILs- W $ <^nD8`C}e8lxZVPu t\K|ML ЩƁpyGFt#RqOIB`5iW Zv`ox^ pJ 8 ?ϟu SEEEBq})rb>p[&E-FdiSǍ< \3Ӄ@ACv? t(ڀ'N`- :;=p3!(C| <0WG/]tD# q-pI p4 Lv>ܘwؐ4j܎0 FC`4FC!0!MeqX;6:`cE>Dx p{{{zp x 8 tP+d61`ϟ$E<S!FavcRc.,/pD$ ^}2cLϘݸJ%~pq#18:`b`x\ x"1 \ރyV>-NZ'.AN+`gTRSS7{\O)SnDvP191_NrL@h{0';ҞȆ&L%x%vvvhļ ZXhz'X[g1F:CF C紁clӢ8_Ja7W #w!ʀ+:Yq=L:F`ԓuK E8|}AgyV-&O vl5.a!0!@ud `1C}6-:ZׯTk8FA-.1œQNt7ݵkאk$i.I,S[<8=Y I;w,)98\VVF3W]C  \, -c\] GhZ$}={0c%Xa^ (` x̹5`Bm̙s}q2Oo5Z^ # # 7ah !Qq2H:6~e˖iuTTJz^(Džğ6CEu/B6G߁"Nь%i u8Ņ(LBժXGKtv#1OZZD^saJl?X5p+xvpLdSjXp̩?\`EZ 7x@%I[ۀќt|"Gȴ3\M3pn>%sj1Krx rqൢ%A^^^njYA_D _j pErV:$FL ʔYZ̳@o`8?'fS X$fUdOP"gf4<,aL`Gx"yJ8S4r@* \1"tH3}EÉ(U\ ̃x :)jG]BIxv18 Gϋv'8`z@`Y\o+X7O<"`bJGA5Nw7½FNW\rJS`s'ONIIN'!u4Ghh, 5$p$q1XK?a p n5'V-@e7n-xdTͅ`XmzhOAW6S@ nkz?`g T lD;X[Kd'7oh/ <Hb5 A *nnTnC o+7 #zx&_> 8`瓁f؜Vtp+ٗnk# 3\0sW/0L8 \[l"Ez8p,<`BK?Px4gx`^?C.nN{Go4FC`4FC`4FCkvGh#{2226,kh ݏqIap!t-s4s@nwww:S!0!0!0XC`C80FC! x&S<h 0(V:9C=4C">>~46GC`4FC`4FC`4pѴ14d-H{gu^Bp VQ薳{kmkkCMg4hhh hz rohٴi(x>:>7G^4 xP!";;x pmeehlhhh h u{ɾx3h[w?uoPEx}? }tBiH'*E!!!K&Wf   !0zh  Z^4kWuqqq댉tYf9rإINNjn޼AP=pqoxxhصk޽{M8GC`4FC`4FCG%%%:uB'O \,:m$pQ(p(~-}}};DC!300   B`C8`FC~!ܷW2.n32Bؗ/ !0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      Ѥ?!0!0!0!0!040!0!0!0!0!0!0B`tp4hhhhh h      h      I!0:C8GC`4FC`4FC`4FC`4FC`4FC`hp4鏆hhhhhhp4 hhhhhh!M!0!0!0!0!0!0BC`C8GC`4FC`4FC`4FC`4FC`4FC`C8FC`4FC`4FC`4FC`4FC`4FC`4FR     !0!M!0!0!0!0!0!0!M!0!0!0!0!0!0#)FgGhhhhhh&           3}4FC`4FC`4FC`4FC`4FC`4FhvGhhhhhhvGhhhhhhH >!0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      Ѥ?!0!0!0!0!040!0!0!0!0!0!0B`tp4hhhhh ј!s۷ @HKZF0 DDD0FC`ѣG>|߿L۲VVV;!0HB>v4jFC`4FCsy͟?@8p(̙3'55 &珜xO½ YfG!0C`ݺuV6} }}}cccCCCGw4FC``C>>|;4^FC`4FC`hx X|ҥKn݊{)**GbV/\0..n$ߛ޽{ͳyyy'N_!0B8i:˗ :¢@a4GC`4$fff^Be4Ry,Ydƍ111tvov\h \!$$a666VUUTA\edd]zuڴi;vp J$A=r;bcAT QRWW' ;w,X`ŏ=3ϦM0]#:uj$THeeeX} Lfrrr `4}ܺu?6_~ŋgϞ;.TTThCkkkôŋh DUrJJJ.= pMIO$svv@...}6-kj2pte#C\58w߿\\<8]>hox)ihh򎚚( Ap~1** sxLhF4FCF!0Z \h`;cM S8؇3q.6g`Pt钻; g+ZYb \&YfY#tkװ6zC#666pIII;;;Z.fcǎ-ZWrO577*ǏgϞwGb''*1v>چRĉ.B. emhY `4kk wzXb{"V5iGc{4FCn!f#pw4"6,p x ͉%% s*1<|pE1ʀ"Gkaccۼy3<9k_z8)5 4311HCF=Qv<&:Jt] <) -~~~s$Qoz*p У|wG͑#GFZ&M7Re$Hs!!!ȓK@ 6h\{va9#jd4x,p0;!0z1=(!<m5x!d sΓFh n}'kы<Ư_!)) gbٲe_/[h1yd٣)GC>@4ޮ 8ab^3ut#F#s 8Og ¬,Rhp*=[xLCvpt0r4FC`ȅf H_L: .i˗׍&u إ !<_}޽#!bmnJdy3!'"ʀwY t UNz ȡQIȨpf̙^nDAs評 `4FCļ wH#_#`pxp`oM} `&р D\' q ۃgɠ,.==M1pQ BlZGSyy?hm NJJjǑ{(pe#px233:_ZZZ tPJB<3FC`4FCz0 IU>\%\A9cdCH(^2Pb4C7% V%u;+w@9F:mEMM #\w;桒>!0)OL<`B΀fѪk4FC!<ӊx #䦢щ,L}_%p{nѼ?86mA I2y@3Fqa<x(S)w8= ϑ!oe<Jm0!he9!@y`vhW(S<:EݨWFh  ~Y>%A<dtG}bn"xA~gvIO>4RCܹ\5:x03VF  CxrXe P=tDϽUɒr Dh a|||t#X L[rrra;p?$.ܘQ/`osgWt3pGgGPY\*?j6i `4FC`4hsGC.h .xрMW#- x>p_.fXК1cuk9Oq!z ޞv)xf.G x𮦦*"""玗zh4FC`ĆQG}^^޳gF3 C߿ Q!@h};)fU7Jޕxi'.cGgGPlAH#:ZAh4F{8D/U&4I~  z ߳l8B\/_N-9sbZUUN%=xGf  2MLKK MFv4F` 2^ip yO1ٳ S24X1111**> ]JJJ#0q2I!0!0!0!<ۀFÐ`n !@%`7!0ٽA!n/z}I1 <x=@ kh<!0!08y򤏏p[hP7v;up4]@SgDMb܃kƌaNN3bQLX 0 XF wqYa<^BGG+f`Ow޽t<8 8"""f8+5xիM`` >v؍7a}Kf%'Ulz* ƀ033ӵVoݺ b//K`q`RGv pxtG`&An \\yEO2(4b|!&&MzI`l1߿k`Xf޽{  ZxS0!0Xv!Om2>x]p9 ? Ebccif`0w.C59`+ n50H t M?zƍU) d{cՒ-.&JV@+f(to0vkjj3.IKOORO>" {S@ X~-0ށZFH0 :`3[,1!\&l ,3>wf`HPpp00Yzyyi>0 I 'rd&wǭ*''p0 =:` Gځ$n &<4i0AlVAA,pXpڵ* !, }}}`>@ pXG@jGXOS'`8,E;6>0~KӧO3۷f$ FL-@ÁXRA VSp\}$`; ɻuW:bSx2~ }`ڋU;pb‰w`j:~E`. QLL?ӀC~Z$kl̢HsZZZ0%ȀC{ 8H0 O&b3?88艫ARbő#Gp \zFG>=`- eQ0`DZE&$$`taX|&1 xgϝ;@ +-+J~y,Ed^tS`[1Xm$k׮O\kz `[ 0H#/^*e'0IG-Q0 p9.÷g*ǵҴq q\RU,0$א;`]@cmԩS6=x%) /t=4`Wh 1` 5.0U,\؅Ίo)pZƀa4 8 {>ȡT6=pRHG@=2V-x0B VH3``ڻ fΜS` `_XZgWq!`)€E8< źStD2=4/^ ~X@D;9d`րXz`0fffp@ð.QǓф< DבNji}ƺxva2'* b|l4Glj<X!2T\ː S4 \#즢-#`͚l+#d.&EOHPoI`f`\ 8mG`LC`ڴihnz}0=T0&( p8Q@U # lL[-hVh"@Ci ^HcؕC 8nf& X ̮#0#8uJmrX@X 6l:::10TOL +M;Dne $nC  q!x %%%xMCDtuu#8$E' lx+H1hAUb=\p1M7NQJBr'bVd \+ 0.c0W`CHN! p lWZׁ/܇lJ98tM08Ӄv3p.8m9RH"'qȖҡCx bz8oa+$u3Tp 30C e`n7'$B S t3^PHY(,chASp݀STXyH 9ސj,%x:,lFw(́3X;d<lc߅+ '?_ذ& #4PU%7h9Xgπ1G^rBgEpW*4g5  lkӒe ĸXD:Lc&(vq p# tԶu *䝂Jj]=Xk>N pVc3Ĭju;Y7+R'ǀtNTN㱶$@jmidz8~fҀdŰCdKom%)l'bMwJ6=@v'Ƚ9S'>U?:xN)aC\L< H]ݻF F`VEpgl`7".̠0Jƿ+ .5 ޴C/(~* w a^N|­# JaBh@( qmWؒI,#x(<܀S׆:{8 TnS #՛JTxmwKs .Up^tiBdt</~";ACxm7( (@A# `tvI,Ёm&=g r:IBXeɘUG#5Mpm`!Iam& J1Kxɞz `%g_<І!xQ @*x L$jz# 0):Bp>7[@0+ 5cW9ZWh7H鼚 k$Q_hLI GdA7cucdq986H& KXۦ Pౄ"Gve\ce8OJv?\5 7t6sfA2q}Q@\V+REM˜8y*1n `&T`ƥD ' 1G;;-Gg12!U֎/0IdPX X`6h>}lbmZt. |!5@LK Uy0J khB Nv!u =Sds 8D|p@X߸~44u]H X qpV u*I^b? pq p )z;ğ(v1 ]hwR/m#!MR>WL^(8R ?>F"tBx vF,VAB(\gC[-5p)X!(!N J#{W"F\F3܀kG񜄆kI3q'R~vA3g LC 4IXzH/e1,7og05ؐj p.Q̃yܸqpzt B 8

|TC>C8!-|]Ϝ8qp5 GtwaWJK# `Cd֬Y~N7׍阵kbVWqqqJC>{/H:Ս*c@]B+c] $Ī fͧÓh:Se:Wh5p;#FO!< X"2s8Ayu"gVG闘}*$p:~<6Gg!Q0!-XigG/Db`{a'"~C61@GF y@bnK^]k M%pd~xt06#Ak['ux% +AFƚZ;NZ*-5%!88#R/p"AT:֢{厡쁧9fG;\IKKK4CntVBQ0hCxa(( `RNezkCN\S|0EOOkc8C\uC$I ;((x9fGb߾}.o !q ?1+// 8hn:` xJxV66kwLъ&D<6& ú悞N뭃ILLOW V5d, 71 6?WQ+Gc߿4 y*p.7 li G!JA4 Qqt{=RuD5,i+/.sZX4r1 \no 9뽈Jx,; Cv]\ j Y W hj2[\)t %$ \WHZAX89 =.:\륁C'T"0)O"@V#H{\^PP@q \!Xg<( N`KԊ(\K˪eiD<) k`{.tssÌ;`gl+ك51mZ,P'3jA+WȮ3<AC(j[Ir-7bmCyрlUN, #mM`+ x5p  UUU.v%jtSyh x%.2u3=p᮷7VK17ÕQ95=pMIBL{'O{KGSj|Q\X@_S%ʀ 8$\BSmWq:dx5P80y~ vx5%V{swr <\*Vk"e#*mb]},"^{`Ԡ.d\# !Jj8ϝxTO{̀w9;\΄R1ed_ f\2w@"'/p A r :`eH0H-q$!d`xt`+UlX sHHM>z*n`L-7Ëz` ܃{ɉysT__i @0ߒj/|' Z5@Gwڅ"$]H!pT`g虣q͑߻CM'>=XOIn6[+\b8Hu̥K6   A;$q"u0T_8?Ápg)g^ Dp8Swapp BdCfKҸ6dلTp-fF'Q 0k o]v=cm2?Ě 0]k.=ݏ[xp0XY;8vKi VϨ%\?U[[K3S4'1p F;D;hpip1\NgH2 פ%p 1栭144̕f=KVfď wF'0 UbxfF(|jjIdA`=aE5KQec0!d{P($"d} iLNNxc/kY/In. zJ!u/jVvk`zƴ8L!xfudX7%$$3 ^LxxxS`/aKɘ\6w#-%65C#g; 8Ctp$Z<(x.&? xd `a '37* 2X|2.n$#VQu`!9qA`z9\' ]R}kTD``n i-pE>a-tXU@CDC\`FL)H(Dž/D1p0}nܸ c!@`%Jj/bl\i7D:yF3x^Qgcu xw |O l:u x5ppXFFd$PGC-D Mpk jT\n@&L7Ȳ89sc:.B`\s(<<Qx1-Os *`\ i"= + 탳<ιF)p\lY))֘1MvB} ?|hp~8^45?t\0 < 8\CI !x4p?Yx1@)<3Z"l:xP#\ x\y4J0G! 1 h `Ӈq Xw/ G9.0\B9%71O6COB 30HR>0ap2ph էD@a,:,` a  Z8BZe=b.1p8xE5s[J4.$&sqr!%p+<MЅjX (.0Yjc:.\B988BMd6N*ȵ@z I??)sY1M\L0RtP&`W x 9v׀ kp\桰݈-/u =;QmA45~R+:h{mSȃ#v9pop8JjZq9AGcyd3PW @+++ "fEb؂\bl)2Vف|F2 5*V{tC 9$fT!f*vEAp}_mCnInpp8yf` 磈8 T}׻޽߂'vpejl##ba= ,Q s.zzAg  XI{׼ k\]+/`ّ@6%xBx#pU&A8\DaS}GLq6pҮCge;û(y-ć-\cg v62~d` 8f |^ l$B@L8 t0!Lm(8.2h 0( ߁!84F+0#!X0{3Ôt.KҁWg8!LT03=3,'pppg ~8 ^O0:8`;%rx@.`ZX`9F4)C=|`~S&b` !6jFcx $5e0ǯ 8D^ ,<`4`+ :` i-K0`NL!>x OT W\ \,./"0C!ju b!Z,=8Ŏ9)6C p`@ p`Y a7TD| `? 2pdc\R7uX`XDuĝQ{`/$ p8;kf4 F g9%ql]ze/BXeCZpxP. 4lC JŘ` x=1 >0!d xT3'pn|zX{2A@ob=8|CDv! z`[]pPr&Ye3W5{@[oq`4D0 @)1Vfd8"LTP XOgcUتZ虢[cs@ Lj1X/Y(Lf{RP;L #0A` حy0aVm;\ Xbvý + p5^ <( 'D:89 \`,80 pSCqR`#b` `f)0w`gfCXy`f`lYC,~! nknvЀd5!-0FC`4( ?p 8T< 85Ay:MW!IlHG#lp |^A8?AG%#U&Fhh & B6@^a48Ѹ!\طGl4ȱehhhh!\f %씄p]]pbvF Qxou78Pi}GK Gy4FC`4FC`vGh!<[cWx =%|o=y'F  Wp o4bwCGhh xvGh9!< xp6D37Ma|* Xxh ܃<`38<i@ψJII  !0!M$!0Xj\4x "b.lK,$ q֫F#n4k֬xUhhh h"  9֯_^nv&Z  Vn  Etwwo ++k4GC`4FC`4 h:  9"^0ԈFc=x thB! +<--mt/hE/+++^ N>}4GC`4FC`4 hR  -֭[mY˗(y^mmhT .-4irrrFq4K;;;!}   "Ce4FC`4FC8x \UUU'''*_WY@6 /^(9wTぇnܹX^~~~XXhhh2!@ZS߿FN81//* bڵ@444ehdS1s}SNE6/<<\DD˗/cEx-xMT {rrrG  5?j!0!@|/6q(,,d6mpaݻw61ؒ(<۴@vɓG׋5 /AAAA`0zh  2B`C8lFC`4Hd}hN;!Kw9rd޽@LoܸHFҠ ~-Qlٲx 3g/700vEh؎hhє3!@r}كIP?@III 0@VG;8f>>l!ҒxW>|x4GCZ!޹s&-^^р  $F;g4FCx5. \&vh< jnnN{ w4   AN& rB@TTpҥZZZ ˗/sbllL F{hhh & C ** x K,iJD|5k֌.M!0!0!0C`th Nرx;o"px___iiB!0gΜb900 x_hhhh & *r.]^@<0v011"3RRRj`<b4nܸqcŊ2#`gzI=t4 hhh TvGhhhhhhC8GC`4FC`4FC`4FC`4FC`4FC`hp4鏆hhhhhhp4 hhhhhh!M!0!0!0!0!0!0BC`C8GC`4FC`4FC`4FC`4FC`4FC`C8FC`4FC`4FC`4FC`4FC`4FC`4FR     !0!M!0!0!0!0!0!0!M!0!0!0!0!0!0#)FgGhhhhhh&           3}4FC`4FC`4FC`4FC`4FC`4FhvGhhhhhhvGhhhhhhH >!0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      Ѥ?!0!0!0!0!040!0!0!0!0!0!0B`tp4hhhhh h      h      I!0:C8GC`4FC`4FC`4FC`4FC`4FC`hp4鏆hhhhhhp4 hhhhhh!M!0!0!0!0!0!0BC`C8GC`4FC`4FC`4FC`4FC`4FC`C8FC`4FC`4FC`4FC`4FC`4FC`4FR     !0!M!0!0!0!0!0!0!M!0!0!0!0!0!0#)FgGhhhhhh&           3}4FC`4FC`4FC`4FC`4FC`4FhvGhhhhhhvGhhhhhhH >!0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      Ѥ?!0!0!0!0!040!0!0!0!0!0!0B`tp4hhhhh h      h      I!0:C8GC`4FC`4FC`4FC`4FC`4FC`=ꆨEU2IENDB`uTox/third_party/stb/stb/tests/sdf/sdf_test_times_16.png0000600000175000001440000032352314003056224022364 0ustar rakusersPNG  IHDR  UIDATx^c?(      y!4!0!0!0!0!0!0#3F;)4FC`4FC`4FC`4FC`4FC`4FhvGhhhhhhvGhhhhhhH >!0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      Ѥ?!0!0!0!0!040!0!0!0!0!0!0B`tp4hhhhh h      h      I!0:C8GC`4FC`4FC`4FC`4FC`4FC`hp4鏆hhhhhhp4 hhhhhh!M!0!0!0!0!0!0BC`C8GC`4FC`4FC`4FC`4FC`4FC`C8FC`4FC`4FC`4FC`4FC`4FC`4FR     !0!M!0!0!0!0!0!0!M!0!0!0!0!0!0#)FgGhhhhhh&           3}4FC`4FC`4FC`4FC`4FC`4FhvGhhhhhhvGhhhhhhH >!0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      Ѥ?!0!0!0!0!040!0!0!0!0!0!0B`tp4hhhhh h      h      I!0:C8GC`4FC`4FC`4FC`4FC`4FC`hp4鏆hhhhhhp4 hhhhhh!M!0!0!0!0!0!0BC`C8GC`4FC`4FC`4FC`4FC`4FC`C8FC`4FC`4FC`4FC`4FC`4FC`4FR     !0!M!0!0!0!0!0!0!M!0!0!0!0!0!0#)FgGhhhhhh&           3}4FC`4FC`4FC`4FC`4FC`4FhvGhhhhhhvGhhhhhhH >!0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      Ѥ?!0!0!0!0!040!0!0!0!0!0!0B`tp4hhhhh h      h      I!0:C8GC`4FC`4FC`4FC`4FC`4FC`hp4鏆hhhhhhp4 hhhhhh!M!0!0!0!0!0!0BC`C8GC`4FC`4FC`4FC`4FC`4FC`C8FC`4FC`4FC`4FC`4FC`4FC`4FR     !0!M!0!0!0!0!0!0!M!0!0!0!0!0!0#)FgGh0+++رWϜ9RZZxb4eǎKOO?r:y$?鐽w^]]ײe˨⑋/}Tw}qΝ;߾}KݰaCCCC__߶mFhhh & a<voLN2ٳgNNN֟>}:q2 n:tЍ7P*;;Y'O8pwx2q`gǴՅ /ZÁ)Xo}Bd4FC`4FC`4nFhh SQQh>ݴiSuuRVVV.O byyyYYY ˗/ ؏Nd=|*Edee2|||uhGOK`J(,,cӧOSSSZN0 FC`4FC`4FC`hp4h SNRXUBL`dd$&S%.`f0еLLT[K//ϟ7\f O>|8:P\\ A`!0!0!0C`th* !z;wU߿ p"P %]իWCB +y0(X|ٳgIrP=пt'$$dܹΣhhh & aѣGDK\vݻ@͛7:fϞv!'̇J*.<s/(%^8q"p-2FC`4FC`4FC`8<!0B`߾}c?o߾ ;uyyyS=TT}# ?D \\ <4(Td 8 "?~jp@`whO x)D;c\[/`_H[[x 8xRIk2rssw͟?8#g޽{TPSB|xaq̙3Q$%%)`Ox5,`Ox pd#pQeGGQ`P87kgg*)){@ 쭹@=\ \ &Gu ]Oޭ[cZ O`?xr"** t 0?kq\1 gvtuu*6g޿20~ 50 FC`4FC`4FC`(;!0By.tŀ ])`g8 Ł}`/ʀ !Ggψ ާjjj}$ nsuA62 <{@;wHF`x*ܟ3m@_'Wb {ҥiӦ vQp$\ 0+)P1p+ Noҫ%qਫ਼pγ];X'OxI#<^!( e0 4`'8 C;.`WZ~z.d[=I2~ZZZA`?# ؙ>^`vݻid!0!0!0C`C8~GC`4R6Mb7 ~`7 vu.RO@.ӅիDG \羀> \ 1xqš(w\Kp fr p+,, 8a ~{` L!O] NjgX.`rq<'d}&p8 aN{>-.`W 3dG}B^\ 4]ZdbbT I+r@ l!7त$`ol`YQ0!0!0C6F;w4FC`(G?gƀ !Q6\$ \U;ř@K["{`#dW2+z48M 7O1p%pW`/3d )$ z^B{@q3o @@:.:቉@.0͛0 FC`4FC`4FC`Ȇ;!0Bo "tWW{DN\=1 D]~ha@z2ܯBzxL w[;fD:D%p%.< Cv٠Hoecpa'PY pN,VC !~H؂IW`#W&!0!0!0B`tp4юh nK<x|M mOǀ2;!.k \ 55a$)0աoueK\7 <,xB\ SFi@<'?!sȘ <8E9-FC`4FC`4FC3F;b4FC`B?Ӂ{ҀVwۄدˉ~.k.˄[sP/j\xg/2 <'89 썓}`x pcN 9{#;Eo!i^!2o4p.CؽF+00kYccc!W6;$u@6p- na!0!0!0C`C8lGC`4Ls{̀/ل<``'xa 0c/.vɀ*" n` }Br"KvF ^٤pہU:M)tp*ЄK@6 x'[8YQQ<x3NzFIBfސ41;Z܌hh` h 2!/ l~~& xٳg}s }OA^ \ \4A \ 4 WG+D1w*(x9;?^h„ ؁{O܁Δ.@A@@2Aŋqz;^n{^15p.(Л~# ƄH -(?D!8H B x?. T} [Xpx !`l`!0!0!0C~Q0!0C$4 %{NhWEskv 0`8= ;c磀)bn8vAO> mvځn 6`Wp{Wf(k`k5@bs2kU~#?`Gn~N@@gွ,` N;i1n07n'BCC!}8? M}[gl7Ο?m,&py*I8B;&>C7t>y,@ V@)c }@]0a ,P#'pB///ٺu+L{ ahh h  !0v?=j`_IFv!p. 7M!0!0!04 =Ik4FC`4FC``B8 <x!fo 'p2)(    /XFn4FC`4FC`pp}#~n <}X厦   jѴ4!06'ـAL9͟ M{NOUWW Op4FGC`4FC`4FC`4h3Ik4FC`4mOv3cZ:s<x4QqnXXX&   Z h  oٓ_| !0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      Ѥ?!0!0!0!0!040!0!0!0!0!0!0B`tp4hhhhh h      h      I!0:C8GC`4FC`4FC`4FC`4FC`4FC`hp4鏆hhhhhhp4 hhhhhh!M!0!0!0!0!0!0BC`C8GC`4FC`4FC`4FC`4FC`4FC`C8FC`4FC`4FC`4FC`4FC`4FC`4FR     !0!M!0!0!0!0!0!0!M!0!0!0!0!0!0#)FgGhhhhhh&           3}4FC`4FC`4FC`4FC`4FC`4FhvGhhhhhhvGhhhhhhH >!0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      Ѥ?!0!0!0!0!0‘0PTT?`֬Y۷o'5`v 4yٲehzz:C֯_qaRRDU={6V߾}yݻw/T`Xݾ}yݺu7n?>9r$;;gϦj 0"qOQ0!0!0!0!0t 7C={IBBc„ @6i{ d;Qȑ}DpmmmAAAZ>||rȯ_w߾}^߁"SLA (dɒ'{5@[ *€^:۷k׮-2DEE w>} 0aldda#w` N+ZX=4 wDpip 9[wDS\+lllz!µ?tɓ' dz999!Va@cc1d1 (     sCCÈ sggggΞ-p׽/_\b>i$7772Tʕ+_x!##gff3gse`EOO85~1>>>4ݢEo޼y:yyyϟm|pLL 8 t… S[.\ګT$ݧNzhfuu5Н}}}7nz =tU@@@߼y3}?ӧ̀~+W`9<` @A,{ab| K +` 7mIIɊ ` 8{M`d ;``X6lP@7{/^ ˬ,&&&T$06,1W&E@3=vWWW*Ю~SSS`F4е$k&`p@e 1`J__@Á g`PYYYE09~80'-GC`4FC`4FC`4FC`4FCn!0v ;KIH@:i~ؗ &=<<}P 'TW,((ضmP1 v]`'**J\\[ʚAr` UvN`?طv_>Ldd$KnmP`-00ؗ:8G<[T \t 5X~BN PG`8U{Sn*D/'T 8iCv#!s_BBBp(sMN5:n"I@CV @U!P8 |yN`;30*=:`7h&??? Z`_ޟ<1    W* ,?`?NRA*));Hf=p' JzP8YAm|@ep `/8GM7p8_N.@6T >ExBg=L`YL@ @f3]G4đ Uw''<p NRB)-gnpBhGdw@lJv4)C@} q +S`0hLc>~8· eVjI!04=.I Z 7S@.p ρ3? S,0܀}-HB 4j ^`M@vw@g{@v;@߹s s8N;9I׀!`":؀L`0X/J h8!0!0!0!0 !$dm}`?874v]GP"0`'d̙.АrU>dMM Gzsq;x>[.J.({F[;Z̍hhhhhp4hhhhh =I4FC`4FC`4FC`4FC`4FC`4FhvGhhhhhh&           3}4FC`4FC`4FC`4FC`4FC`4FhvGhhhhhhvGhhhhhhH >!0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      Ѥ?!0!0!0!0!040!0!0!0!0!0!0B`tp4hhhhh h      h      I!0:C8GC`4FC`4FC`4FC`4FC`4FC`hp4鏆hhhhhhp4 hhhhhh!M!0!0!0!0!0!0BC`C8GC`4FC`4FC`4FC`4FC`4FC`C82BѣG7;v}%K` +W8q* hׯ'wߺu^z5Z6hhhhh q3Ϟ=;k֬oݺ޽{NG5I!<<\VVvXpA+vڅ_ ĸgϞ0aDիO<ɓ3gER===4FC`4FC`4FC`4FC`4FC`c" @LL˗ϟ? _~N 9s&&&@.P1pmի\1pǏp. a;w#^~ d$]S۷o/^ !C,P߿ϟ84ϟ (t0d~ (۷0Q !kzÃ"`___D80pFhhhhh0 !DJIII ӧOU~̏uvvHpk֬lԲqFT~~>hѢF`ǬYTT{߾}?:upjj/n؟?;uC*v#]SW:ׯ__|9P#ك* .\pʕ@5O`ږ7o& (E Fhhhhhp Ce@1 @`W (z={hjj^GGfff>xROVVVػw/P 3|[vU G`oI8wҥ Q@C1#tHtt4{*(((//TDN7nv#.I|||R`?.*nTQQv&h!x?!0!0!0!0!0\C`CY`߿p>pI'pQ(pz -B۷å222iF`8?JIHH{n.t5ẀW'O a&/`MWW788ث{L`GOB:ٳgv bccnZZڗ/_Tq!0=[FGNh)0!0!0!0!0!0B`v߽{?vw;T3f R+VvQi FDCswM@0JNCp&:((&&ػn $6mpZ8\Gzd݃\\\5֭/[.v7@]\ H7oP1)S]T ᦤw0M677޽ȑ#y~4FC`4FC`4FC`4FC`4FC`#ڜia-I0p%dQ3D"MzS^;]Y[[sssC \şwNpƒ+333448<<hp6./v,--n/_Z<8N6BvN'qss d1nv>}E- @@*o@ Bȱ 2v8~466}ZFF     #CH݈8 nvE41O>|J{+TSyќ9!0!0!0!0!0dh:صwO!DT\h          !0zh      Ѥ?!0!0!0!0!040!0!0!0!0!0!0B`tp4hhhhh h      h      I!0:C8GC`4FC`4FC`4FC`4FC`4FC`hp4鏆hhhhhhp4 hhhhhh!M!0!0!0!0!0!0BC`C8GC`4FC`4FC`4FC`4FC`4FC`C8FC`4FC`4FC`4FC`4FC`4FC`4FR     !0!M!0!0!0!0!0!0!M!0!0!0!0!0!0#)FgGhhhhhh&           3}4FC`4FC`4FC`4FC`4FC`4FhvGhhhhhhvGhhhhhhH !ۿ~͕!0!0!0!0!0!@`ia?. n)((|ʕ+C/.YO(&$$($O;w?>|8gR\PPY/G߾}+.. [nƍ .ۣ!0!0!0!0!07C߿uuu߿}}}1'JKK (׮]ז(<.9t5k+VivݻGshhhhh ???33ݻw}!!!bd^Y;߿իWq*D^~,r…'OONNWٵk޽{߼yWfƊ L z`A#={aPE:v###D `4FC`4FC`4FC`4FC`4FC` B`- gUUU`8og.]\ \~}֬Y;q{M8z(3 d \rW^NB*++{w3666U`\\SO;~8\Ǘgz`oh ٳj۷o2 .F 1ռuph끖JJJ{nNNN@N1"T v;xo([@:u ؇6ɓ'[YY_|˗^^^@6p$p8#7fzIv!Ӟ@[6ɛ7o{>0pحN~SA ?!0!0!0!0!0 !2V4y@qTDVWW̙3^Z^`/kBV%ךE! [SSO+v|<9(`?8 ;@ 3~!p.ED`8 455ЀneggWCdnЖD< ӦM3@7Qk544Жb :8 mۀTi0`!0!0!0!0!03XB mԌ3skSNΏa,@N#Xbbbv`w8NN7- ="?^`uT`w طNW{k;w4655~M=p(p:A]ޝ,N/.+ik% 8k Q !      !@Np;@d?0H\ѡ\U@ŐeO[t)_(vÀ943 \ ܝdfnv899f-@6(Tu@YJD\؃9Z$ ۴iHOԤ$`r̙-Paeː7R;+/<1++ (<Q[nL-+@./^@ g!0!0!0!0!0tf* H܏\9 J\q=;'SXnp[<&=K K";xp5{5`Gu؏t \) k0܀ @K+B&N#pV I|(T쭡E pؙWpOeLMM <ϟ?.% T\ \G x8߀#t0|G-:3.,'$S{T`b@z 8/ <(cuFhhhhhC.hn;~%PRI`ig {m>!0!0!0!0!0B`P8p8N%VLट1d:Z.;GC`4FC`4FC`4FC`4FC`4F`<ҁPW^ \u ܾ}h@u;::444ضmoݺ%%%QQQp_|o>`让Κ5+;;WTUU-GC`4FC`4FC`4FC`4FC`D~1..N\\͇x"dV۷o {})&tUW)--Λ7:-H"@cKJJgY 'LףGd$`^ص?Л'-[ܹs@CCC rNNO`82 k(lݺUWW8 3    a!0z(;Ef^'HmxG؟YdIQQ) .^`W*66Uz P=p'pߴiӀ=ݻwC{Y… J.G8pQ xE <ؑ v&^ IJHH{AȽA.p-%F ǎC68# >}8)` "g57m^ɀ )SZˁWJE?F`HBg_=sn`x2    y!0;f.ׄ_?ȀL'cZ s 9.TC.~N/,//jļث- bFNϧp|' ?iN)ph%>W&O"v ^L@Nt6p !+v ߁ZS 4j9L [. >1r6)p/bpp0 ?`Q<#`8\# ܀Ln$ <['& W .p2 `4FC`4FC`4FC`4FC`D3?32أ..7.NAx&7\y&pNXXR&.>ǫ' nj 'gNLTQ` h8pQ(V  7߄% t^.;#@`&%0W֯_\w7ANدVr0i7l 8q=\N <x 0@'T]298<  E C`?D[L \h &P/pI*p+p 0 WXΣM%wU [S( 4k03%@ FF)))Ht%p!s0      ׀N皀BT 7*7\| I`{a:K)]#<y <rL`x px ԋy:P r JN`o 8 < ;?X@8=8 @!'؝lΦg/!]/ @Tt3 5?,`<܀ |#w=sp]TI^%0O(v<,mk(Gq4FC`4FC`4FC`4FC`4e᠊ND$<P.JiNh1!0!0!0!0!08C`C8(x=p>85^ΆgS|y?B\ Mnۣ!ӧX- FC`4FC`4FC`4FC`4FC`4I^;1("x=p%$L|k8WN`?h ||4FC`4FC`4FC`4FC`4FC`0 h      &     !0!M!0!0!0!0!0!0!M!0!0!0!0!0!0#)FgGhhhhhh&           3}4FC`4FC`4FC`4FC`4FC`4FhvGhhhhhhvGhhhhhhH >!0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      Ѥ?!0!0!0!0!040!0!0!0!0!0!0B`tp4hhhhh h      h      I!0:C8GC`4FC`4FC`4FC`4FC`4FC`hp4鏆hhhhhhp4 hhhhhh!M!0!0!0!0!0!0BC`C8GC`4FC`4FC`4FC`4FC`4FC`C8FC`4FC`4FC`4FC`4FC`4FC`4FR     !22o\gbbbffٳpqqJ;v~ff&y!~ϟgee sݻw?|tjxxL97ow^~~>|L->daa133cccereeeEV˗Oۣ!0!0!0!0!@aɓMm`ذ~Ǖmo߾^^^>66†֭[xm߿ǏpժU_~˗/w a `lҮCtcǎi`&003gϞ T9ׯ7o:uk     JB`u\prϟ? .MMM APPXA222޽x̙Ҋ+ c=g /p3&yɰ0`ܹs}}}ׯ_ZL6._| {@`uӦM{EKKo4FC`4FC`4FC`4FC`4( !3$ȀSx=g?}4 k0 ;¿'Ng$'3`o8+ ʕ+K,lAVxgw:Dpw0D۷o;Í)bDpBBP,p@(     B`bݲ? #S[޽{mmm u'ͼzJNNHNp!!Ρܹ8u)""wÇ]/T 8 t? 4mi@ ( .{A`̙3GGGy"u^eSS \ 7jmn 9ĀKy&MT^^ͭg' \* <%)) fNND}6f! %q/III4sn^={,r^oHOOn$0a0    ,XFn pﷶNKK:}ݻÐ;/666GW:s۶m-3x`{83 \SSSG#=5k[Ӑ E q Dح B&k,o-`9=`8 Mֆ \ Ǣ p~YVد6xm887-=mе@C=%_v؀#o \ɀ{qǏ!J<ȊM`xw qnx nv#NgVU D9z x+P0}NBQ0!0!0!0!@H`o y Y> CB= ,r,";;;,C3n]gzbp%@6p .qߐmGPp8!6v|P D%#N שBL玫 QSˁ}Z`78G&w8 }@P.\gWCx5KEh/тk4FC`4FC`4FC`4FC*!0! !v~!? xx&M}\u \N 7\u9x8 !0!0!0!0!0C`tPM$W../&nentppuwh/pn:A࡚'͌f     !3C5/^MUx Bdg!0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      Ѥ?!0!0!0!0!040!0!0!0!0!0!0B`tp4hhhhh h      h      I!0:C8GC`4FC`4FC`4FC`4FC`4FC`hp4鏆hhhhhhp4 hhhhhh!$!S5~̙3MNۿOr۷=z4Z"8p`0߿w߿Gcv4FC`4FC`4FC`4FC`Ce… 0`bbbee0'}}}s.((HOO'nN***jgΜIp;}7.];أXjՖ-[~jɒ%(-,@ZZڑ#G_LoJf͚?|boo㓑%͛3gPǏ=<<*~eIIɞ={vء?FC`4FC`4FC`4FC`4h#C`7ORRRJJ۷O}t  w`0 `&/HLL___j\RRyIaRCCĉr`pʔ)SNh$1PA`oMLL 8DtpF8%bXHHٳ"""QQQϝ;v߿G;Y`4FC`4FC`4FC`4hGv9:i`!pغ[&L >̀H0pdXFZGG0N8͛7!_$}\ի "-/]x1$c沕+Wgz<Tc 2ٵk[[[!!0!0!0!0 7C'puspl!d)tnnnw2r@!o-SSS;Qѳa`n\G3$blLL p=3#'..\jkk00y@9y\=P1%$$ ;Q0!0!0!0# Fܡ2!p 1+''lC"o2 |,_~"`߽{{'րk#!G)---zzzBJlA]WWƪiBk!0!0!0!04 !>}:IA 31hrz=zx X \ ܚHC_իW-ZtݑT;?Y5$$kkkcU '䁆eFshhhhBe4dy3c3{^x !<xP$.0Nrqq(n* 7v';<\=RA@Y-@<]5`' hZ8>OE! \ H&0܀(텇 s`xPAqq10zt0pS"k !7.`W\ :F+`7>|-I0XD0րguCUCx.0%CSqLl(#:=yb_\/Ad (     Bnz` 16]&}S*xv߾}S-ڦ8`(<8n1OHy`W0;`vKD81`evvvY>l'? v<=xOxƌ3 }v*,oNf/(j\`? MJʀ節> 0 S;ߎI޹s͛7]eUS|$=@`'55"qo(Qfvw=4,X) L` <I@&!`~&0@i#3`v;|@"T`cYkiv݁VM]`#2HWpC0 FC`4FC`4FC`4FCf!4$ppS0`o o hfpQp 8 vжoCauW\ lcȶM!7(ݴiӀw0爐p"pv;sYNv!"k֬A6 ~P$D؋H4vhZ"#/N8p).3<= zD 'fo޼. 5pM,~ pn\\p (و4WAwM2O`5;p/0<0,\`8< h>p&Nհ \q 4 xtR+wWR #0    ڄhpX wMAnU6A[+i7/2?p>$O`WOA\ܯIv2!>:XPΡA{ApC]D`?>aBv`K Л  Lb zNTvvvpp0j5wp7΀-" ʁ=^8,7 @Av @d!D1p*ħnJ0Ch :hE61 J]zn-p5p7Ci * xT8 啕 L`@ہ3!FhhhhB`CHZg!{ېA&E S^h%I (b¼3;:8UTTN]4~\/p F^ \Fz#p Yd18\Јv@7FJ B ؍2;.$&z- 0v`8 $#`Ůb D65^DJ@:D1ip'Kh!x7ܹs0Esp O <8j?95dhhCÁi hP / zť └`xN4 m<qC0 FC`4FC`4FC`4FC!0!BC:iHϛ),,nP'~,`O 6ʁ/_\EH̝D[VH@ Ipu*p_ 8Q #`U Yp A'2Ѐӭ@{/}p-71 %):a@=   \ @bNW'6jӼiͪ0Z!aAg rSxTSS m`OY%p)p6?,--z<3%nlllSůxp(dShahhhC`CHLja=4#8.;9h[HuSfffBBDXט&%%'x_8 jµ|1D,WaǯX$oBN.LN?8yHsh[( B:(p%-AVVp"y-?.s,p8 Dzx ,p&IH׋B s7}AAۉU1p+Fhhhh!0!l1;6`(^r<r-;y4I \gލN4}y#9zu@gf͛gnk!(p)p8󆼼(4Dzh-|.py!OI$ȎB\(n=M g,ہi[gצ/G rrr8)={lQ4s"P/L@9Sx(.嬐gQ0!0!0!0!@L6=`a28lw6BΆ;Ղl^cxZw~1+O<|؉Bv04: ڜGg ˁ'Bmzp6 ؕ: ~,@QȅY`7y(`t#;8 DugOvn;*!q`(eƃ,Ó0Zє NMp@-n ( \&l|C&"pe#podpP c  V> $ܧ\e \|Y9Pwk.`O xHվv{3x^1e-:$`rOXU-;;m}4/NR穀'T -C @7X@Z5Ipسvˁ )S 2`]FD 0 ?0^}?U-C_OP/,Ad Mkt]n<1\ VՋ6` hpx 0!g !I 8- L 0ʀ!v vw [ 4 _zA`.e}]  ܦ @C\t НXn~#pس**ÁLb0l!kA)(    , n!! lm;?F9W&^͛7`y" g`؟*nCॅ^^^ 4H=r@:*ݏ_1\m5G.AjNIyM`W EU 'L9@b`m&p8 8H$Y 78NC&@-(LX /.\"G L+p8-0 FC`4FC`4FC`4FC`4h'}$UuXCx8: !0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      Ѥ?!0!0!0!0!040!0!0!0!0!0!0B`tp4hhhhh h      h      I!0:C8GC`4FC`4FC`4FC`4FC`4FC`hp4鏆hhhhhhp4 hhhhhh!M!0!0!0!0!0!0BC`C8GC`4FC`4FC`4FC`4FC`4FC`C8FC`4FC`4FC`4FC`4FC`4FC`4FR     !0!M!0!0!0!0!0!0!M!0!0!0!0!0!0#)FgGhhhhhh`y C222***s~:22q``kk+$$4ĄO^|{bFFFSSpx!$ '&&Fxh    #CuV`/^ 5(((HKKN:ugΜrsssKJJI2x.P.MӬϕ+W޽{ˣfɒ%?~ |)Gzj55УL8qڴinZ-&&=baŊ$,, ,4\]]Ire˞?.""rvvƥweee@[mfcc3PGC`4FC`4FC`4FC!zvB`y۷o;.g龈`sׯ_Ça``Bޯ_aXX//۷uonh?z* Qf͚kc8;! ;wbohVa`0D +^QQQ{x?8f70Zq<~;p*<4 kvi x=&p!p0Tf`C!h\Q@o;Xrnnn9nRp7}$Q@W"^*v 0 L!@ƚ#4 v_t3=1@A2``' Y ׭@`Z!Z 4x%`#~ D/cvG   B`CHL`]i 쁔< 8]= z@ GtHoҥK.(`W3<<؄ T &W VkNoxvQf:@+]/4`@ހ: Q h2<7 s } @Pm@ظvW=ܯ"I` Zb^`+vqv^^w]^ pwwlRiC`;6N, ;@@Ő5{@ ,40@oX{j%O L^^^qt0 ;h  0{0kNSS3I{G@`anAuV`trr¼ [ ~Td@g#gL䁋'~}<`pىW0܃8Ū@q^`wL`7"+t\`p;WطIEg> 0ʀ$kll ;3i0MCxQV@`!XM BaLYJ4@E=˖-mn-0I;D&H`dpY#07Ifkk shww7p5/0k o3W21B^2R`'3 MH.&~a6(   !0!NIHؼv Őo/Z lnw[l8ғ'O[&)ꁝN: زzvސo[kDьv~At"^$p6hf{v:`+جN! @,i_\Cã8h -kKv}e;-DN@L!;_&. p-( t9BMAi ~@ÁkM.sssZ@3@6'1 k8\Ix ӡ`>0/G@Y@-dN2.` 2-   xG|Θ6 @|&zʀ0 FC`4FC`4FC`4FCPvFtŁOsD-` d:'4sAՀ!!AoQ.^ p 8{\PtR4MX`~?d]-m> Pp#|n A[ <؂UpM 0pݸq#P腴сzi ׼(HIUi^LC Ni`'N{ fpÁ`8{;N; 4,p 8Q|E` B]S`a0'ƁΠŁ%bUݹ+WBw梅 0(Aڇ֋`~&NHZ͒K^N^- s:ahhh R!2D CXF`k#3y[@hxFp (pM# \- cd`+n< =;w.p2Ia-'OΠ$'ȴ!@___nX5@OESE;<n,pQd`)aR<==CBBf̘op& ݻwV`|i@뀋~%O؃ŪY=|((    B!0!mw_w\777&#-mB9`k֬Y=|pBx؛1!Qst\!:T CH^Rp~X%f 8чv v0 Vh.b$ /أ&~'* pr:pwkW޵N\K3^<@AP!0bQ| }ztv=@`8i 7tu+0N g3Ox1 NPΛA&XI`G >ȑ? UX OHRkxp8 <O oռ@e@L{ zWy)wdeUL'I=ahhh!1 l1Q8l1F;+17!Tz^J`$@ `с'vS[I<`C %n;hWd0Bᳲ@W `.D^ L5Z(qXFFn9sະعFp\8Z 306@-zU^`"Ǫ9dʧXG[!0!0!0#$Fg{DOJKKpU0.@VQ`1,(Z"v ػ .@N9;hۻC d)!Gl;u@A^`+h#SI&hz CecSKc x<%C8B|VW+ 4y?p#p "]:gx0i&9`pcMcxi!PMLL p!.C I)8ة v 9;uI`gLBj PFhhhhH<?pMt4 <>%`lڴiM{kH:? A6ʁO0polWa( k(\CTl7g.l!x#" 9pc'q P/$a Łj{/Ȉw`hp^.x"+Hd#^oV'Q7祁Dh":udtC&3`O;ZZcx .CS5]0*}9`$K/ &0 FC`4FC`4FC`4FCG.JI8{vB -AS%E!Sp~mM^1SsCD끳X{@]xC~:KWn0C 7E4wpepǴ`W3 ~9p ϡp0:lmm=%Hox#4O4b41m$k!{# zځ#T LGRj0g%!0g3ې$00    "F;C,O7si!7$Hx pZؐ%ipC=Y `C ]$d(v^`<JR;-}h!:!x K.BMdM-|u(/T;'Nw+3CE*YA-CH :`x d'~7kx'zm(pVr^I;c̆sPIQ0!0!0!0T !" ]8~p4mei+LQ0/* T ;Fd'sz= p':K ]`FWW8@4}6Wi`8c WXjǪ,^ܔ<Y\/p Μ@Be@61ޅߘ6n`wM=@ xЏȖ .kEs5g^1'@q; 2KD^lHƥVK!K=v` YDK) cf^D >cex/\#0cwO3P 7]H?{MMM `4FC`4FC`4FC`4!4L p1x> D" l̮pClnBơMAd{Sk~9`@|" ;FDv`/8<xO4`<:: N<{,p)hv`ؙL.(4c ]#.nv-0$퀽̳[r@vQ vz<:J]@@61^vˁQܛƤ؁LM74oDV*CvN # iC`Ob:M^.pVZFhhhh `O x`6 , jJN`Y=2*@[ ~B@pf1d9`"nTv-`o6M[h<Y;O%m~K!R#R8`Ox"(=$8br'<d'm7)t^.?pO nvxz'17pgov,5^%/W gΉ!ܓk"p,dY/ R:^* pTu'N '8`BnCe+++=J t0P;A4sF`-,, (7|%0Bև(K'Ր$ \u <d`F<^/?x+0R% `;3.Ѓ߱!$$hhh`*6CB؝7#q) '899a^l9sh'Ӏ+Ӏ-`C56m\ YN<`K85Y7؟ٱc.IUv\V/ P6@6pd@g.v0.p R5^p+\NyT#Nq$)0}“`źL9[r%p 8F2P`w8 ΋bu 6`W8dDCnT*IW'S@+Ix$p4p v!Oc p +|m-@9uY/p@y n'p9s!0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      Ѥ?!0!0!0!0!040!0!0!0!0!0!0B`tp4hhhhh h      h      I!0:C8GC`4FC`4FC`4FC`4FC`4FC`hp4鏆hhhhhhp4 hhhhhh!M!0!0!0!0!0!0BC`C8GC`4FC`4FC`4FC`4FC`4FC`C8FC`4FC`4FC`4FC`4FC`4FC`4FR     !0!M!0!0!0!0!0!0!M!0!0!0!0!0!0#)FgGhhhhhh&           3}4FC`4FC`4FC`4FC`4FC`4FhvGhhhhhhvGhhhhhhH >!0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ht(]`wwwqqqr;`p|MM3g܁G Oy۷@Ǐ?@NNo4Ff\t ^zRC^~$yyygϞ۷/&&f4GC`4FC`4FC`k0)ccc0j*`hE]/^~!Ĝ׿|r`ڵk322]3>}nݺѼ=!{%K\| |8i!L"8Lǯ\2V\ 5z>|_\\K|HUWW8p`Μ99q4FC`4FC`4C!p΄CYY8['N8vؽ{1Gwuuuqqg߿???P;<:߿k׮},KvKHH$%%ݼy֭[@2++kPppӧoIiiizCr&6III`%ׯ_q4C@WWXz@ pQ`oXTczVHHS `}")ϟI`\B̌׷ltեq4FC`4FC`4<F\8+- ^tZsǛ́^gx+ <'&L xI;bf=q\͛}K\irĴ1u!f3!0!0HBe4&u};w.j`@pĝbk׮]f iKONߺu+{$+p*`V0ؾ};9$bGV\\Wx$0gI'''2l ׏={Hrl2W :@649{䣢;… [րhBh&M`777i@eXo6dxÇᲮ{nLL l@6p]p3 @\ U0F#06hkkI`?_l&d/` ^i]bz݁AP#0Q1;Ґ\v LpU9p/uIYvU(p>  /T`zr`h 06EB2`x_nii<ҵ4$`SYz`7Ї+9M__M;lۯ* M և `CMKK bmx!((Fu 7m3 h#0<<lW%0rh @3Iwrgπ{}}} Lp5`?'<#捅`M`cc$0)C@s@g (ط .Yx1fRb` p V\thځg x=1&÷Ͱahh <-N`CPMMM`  `^3lݻm\'e D`{&,>t mc67Aq`@vt-Hn&dAp0ļ5K0/,vq;l[@cӛ!49 `N  op8 Wl^c! ݻwM~!pK% H'/BBB̙o[ `/i>$^*D=0CWl@k{ɁބxD`GCS!7`I/Gp! P333`LTc`aY L>@UXgځEt!0HA 90*P`! )i@`T l\NvoSw lRqd?xZ>VX `W>M`g9+ODTe# W㚵&)īF"p!6\SO^ Yz5Vdeeה'"7qI^`*x!q kLY 40Iu@7@XS>Q `u3p+r_ 5x&9Npph,p2mXa@ `7Ta>CRBQ0!0!0B`CH8M\= `Y Lp%Cl+U w<(Bv!0} $'p t@p+67qtF5'9xI 5E^!]I!0܈L@_<8y e8݊101n#7 !+3!rwW!;q${;"8IEd &MW`,ȎG8́CQLBQ1?s4LjC| Ll6 禀 B%0<rk`!Fp !2p!q)WA<L$bv "L`Y/ T: eo!BQYYrh~H`BD^7n:E``qAp16-B \4aB!]!(  4!0!yT#Z#q%`3 Ad? Okkkú^x@[Nz?`>ə>}:V{L d&!!١@S q w;<+dONp#1&nBJJ <[`"*%_zT.=x_\g"r&p* ؅0O` 8'F{9(]v/t@+ #8]|JNzxΝ;\_m`KqMcow = %0;@wEρwO8qLN'|Ny7){_ͷ˗/nGS @:Ĝc0 FC`4FC`4FC.!0!F!?0pp".cSn;#`{>!ZE@ rۀAx8FPVV @WA:V-Z:'0OL I<0evk.v"6ppxrvahh;堘W[΁m/`ێ[ /`f`)//8UEU&C!60o.#c:!|5di2P6<' v;hG>"w`x@`F%r8 _"lkxi8oD@Z-L<"k!䠪S[lu/p,0^@cOp^ ܉"C%+h @\d Q1T=F\xw"p+e;p?(   A=`c8\6\ܫӌ<'f> EDDÚH v'Q1g'Lo{vK c-rOq'N8p3'\P 1rfd-pKȋ/fNݤ}`#G"JD,p>st'R ll&05b`8/S8|*ę]+//'u"W9MpUI"O@/NZ3 <؛:tC x.1Y8 0 FC`4FC`4FC`Єhp8'F`xZM0DZGSx=rDx.'a;EG o[+< lt{t8 x"p?KImtpo<\+lmN<;.c|pr3rVb<4 '_熩!pp rw% Wd^@<}inI%p&S)8a $q Xԕ/oSB`?س:(ᨨ(}`;C9 ^'{r(FU";Cx[Q0!0!0B`C89x!{ hJa؅v1o Տ! Dv@:A"wKN@ ؽ⹩Bu!]:yG%EA ++q p8g̻pw3CT 4 2  L!0!hBnhM[o@GSr$sl =8W0N[Tq ڍ<xZ)\/@6gf`g82>>y НH^z`g`BAs|&P8Ib ~#I\\}B^dc|Z.p^o55pvzzѣGZ <ځ |23)FJ܍i'6p9%h&0m;U״S2p9Fhhh l!pYE#v3H '`9ZMC`# qeb`*lbS=*24 M"ϟ)R#jǥ`l$3ZlBJ{Ma N%.pj x#xx;p9%|p0f. x~C>b`pg8!  \ с3rI80={ݰ,N).yi`%K3tդINBfZh\hA-D\\ ,[p'!AQ] ;68fph΁cYE +[Z2p0`#x&i(<C:1d+` 8  ف]q$ (/Q0!0!0 n{cpR "`خ55l&919 Y=pFh4=?9FmƁ <?z\03001gNW`J)l-$#>FݶB`R`Ԑ]nӴL N,1 ahhC`C8ʆOn"<>G'N،f jҥK5lA?'0! )Fk4FC`4FC`4,<):+` +S~P [1hGf Cx$pY2pWB  `9k=V!0!0!@phD!>.¥ !Ӏuf4GC`4FC`4FC`4FC`hp45"<!$60d?;:r?p$$`x2[ ܾJ̕壁?!0!0!0h!* %`o8CH= ,O&F3Cݵkhp    3ܽ{1BBB,0Yu˗/&L Ʀ<0!0!0!0!0!M!0|BW^v6)2#6Ϝ93g !0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      Ѥ?!0!0!0!0!040!0!0!0!0!0!0B`tp4hhhhh h      h      I!0:C8GC`4FC`4FC`4FC`4FC`4FC`hp4鏆hhhhhhp4 hhhhhh!M!0!0!0!0!0!0BC`C8GC`4FC`4FC`4FC`4FC`4FC`C8FC`4FC`4FC`4FC`4FC`4FC`4FR     !0!M!0!0!0!0!0!0!M!0!0!0!0!0!0#)FgGhhhhhh&           3}4FC`4FC`4FC`4FC`4FC`4FhvGhhhhhhvGhhhhhhH >!0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      Ѥ?!0!0!0!0!040!0!0!0!0!0!0B`tp4hhhhh h      h      I!0:C8B߿Ͽ}6ZXhhhhhP,7P! ,\ё.9|۷oݺ![[[Vطo@_^ZWWw4 0˗o߾}@q 6P!0C… "И;wh x abbbeeeaa"""TqiӀ& C0D4 >>=<<֯_\V r`\>:YXCy,T` XX())gZt`  :̙3>!P 8bu)!DS|MiCa4FC`4h# Pi`0'LX`N3" ҧC8FC`p'pss3#m}\mi&!qFL_!;a0Y'o޼0v!N>M..h  !NS"G\tS \BF3h @-;0giGwf!gH .V}}I`N*<`hAuo S/Lg.FsQX9w4FC!0!G.hm*p'M!0C~P%GLGh ٺu+p'Dgw۞ρ<8Dpg`h׮]vyc3K$1;Dފ1GC`4FCB׋R+aK1meC8GC6(9}4GC`4bXI.C cݺu] |#@ő'ljj6m0>@F (j|1BKKKd{% Db?XXXfvGShhhP q2h3@x CdbB!411122">RBd3Iz4FC!0:C8d۷oSe;H灍3Rח>w==yDBBBAAe2,v;&ñ ^ iU| vunܸ 4u sO0r^{E;-Z' @( <sҥKolluƋ/€sb^fRISSS #m ,= x }MMy~Usss]]x@J*v/xS~20KE#1,7c["E7I.s[ I xk σ^VAL7g8Q`) S:v` "`0Z yhah>F;%kS?{l޽XI;=Ç<&MD-}`MȀnyv&Ǐ;6x$@_?~ĉyyyDlP/Нp/{@W9r)AL0 iHH*))y{{khhP%@_ X KHիWb{ !.VHx=4z6`Dnsqq8m_~0lī`>? SR嶘R =f8 SLZ0{ h&zȠJ~~> ޿y&00Ѐ?$<k'f`(AH-;q"C BQH@H\h3E K`y9"o@ؿ",wP%@5KHLĈW4 8QOW %Ŗ ]sDG`nhx  0<ՁyX{`_j;273 hp8`s !fy+pXk` Xlذci!+Y`zӀv饥Xmq T"o ';Ё 9$/g*=a` ߾}xG/CCrHذ: 0!$щq*\%&@.- R V[#Hd 좬XhCR#F0Ձ `M|b $q‡ 5_Tb*IZ;sLR{"W sHXݨ9C0 FC`4 3%F Cv..Nl۶ XB&M &plV6 P t.s ֠z.vYiŨ@/'y k,U;I^vB<SL*`!uttn `Y3d-%i\`"Xp`$,66xZpiD]^^^-">[Y Z.%h0́IfSh]8!&)78aff) p6f^]-t!k>. !0a? :u*ڡAɖ3 c7GE 7vp.=Ku`,ʀY{I'vM4P1 -vk_| p` 2p r89 d7cuNi=RGXyxp\8[}^".f+I0΄SoC0 FC`4 M`U V,h6[p77QD< !0<%D?!dpB>?;l@/W ` 8 &? ` @7 =p&8Ft? 7 un \ z¯a <_w f`PxtLmM2/6%̙C|>)&Z !\/dr I>x'744$$$Q ~*4ҥK?5)Sl!N`$G+0;E@ !=h7\!w")\A c(A,܀Ep(|C.B#A BN dr g쁋>/Ώ=pb238t`%~0X9t ` uǡZ!Ksp!f7VPC8^ah%F;%U8pϐ3fϞCi[3l08n l'I }`GX&@#.bi!r8 l1 [A\z 4&!N[3>00:pO7P 5 \nG̡@} B <8ظ!Z [QOLغJ.nJ"24 \cZz%>p@g3-l"Mnj۬E{`~wpp3L%е\ td;-'X<ph`g! )=@`$g`6YGݲļاS9mmm@.NߵljB`(+f.JV_&Gu~F +`yO0PHHvFh]B`ЀU)l.PAƿ;,NG7@<6^`A;DSFǫh+31mN/ &{Wh'ZyHd$B`///G68 lXٞb B\.. `h<hW"G40FN-,ehGάt pfiW.J9MW(;CxiӦ98KE#v0GMveƍ!4TJ(pv8@Ϊ2 hp$4`u wpm| 6Ej؛N$!1{s4M7@:nY1<+`8`s> 2B\bR0<Ѧs녟lߞ6w \Q.*H !$)Ѐ[-6R!ˍUDj<\"iWdPwMUF& [ !Fbn\z5#v!k`,$-),Ir ӹ ,p10BwNP=C;@s0;.%1㉴VCsZu !HJfOx=!d!0t `Ih=G dtv:' ->tP;p8݈``ѮC!p,Cjwӄ@BV!w=+!I':{Ȏvw< 1x8SDR8CJ !/Ic3DBϑxB`h 9B`[e !Dә| N2cNF6OsvJ`@^h`;3B8pp-@p`p!z: !d p1pM~b: ! dH !0q!Z@Һ(2 hp8 !1 dr ~%@[o7;pc>H E%Z^3$[b,p%Kn;ĴD;O!pz9X3]/Ehz;@"N Yr%|Z H: 78 0O>xmr[ہCČC<d! ksp,Cq< `V< 8~tBu$cLBx  Tt~*Ct>CH̶^kQJ ah5B`C8Xph€=bzNb063f/rc 2mYvo=7xC <"%vkBQ0!@=et8*BPWWW=3vdLL V p S(;iI 7Vw*ս*#vrmzQ` /$# 1`;m$va6mNwHR5yY`#` Z َ;J `8 LT8'k9{omm, n5_ \r a})e\ ,OpCtN9Dh8 ml0M rR0N$pȀIr3pu#Nf8p~sssvv6F22  Kqt!D>8Z \ rf1cC8Jl^1I]DBh^yvO%CY4AĴ&|ZG |߭[43\`$~3N_g  p-RQS17%@MjAX}>&&t.A@V;b8  !X5ff[znh0{a<3Z O*++1C)aaadxvC0 FC`4¡!ĺ8@9*Mv worcvmOvJBp'磀kB2,ll_"Gv;pK$~!Bi`\BfB`"j!ub}?54+Ӽ$c4k|V0]3MyUh[ʛbn;0FEE; TOƍ 8#/"~!!Qԇ<8kzV$`P 2 ¡hBQ<sH`GI <7.I2N2!n61gE%Cl&yKF1]OnSCs&=;W} Ί5^[#0`L8!tkO-:fw8mII g0A \ Gر( !CHw G\?jjjJKK߫433(`iCj2.AahC`C8ڐ!;kā;p]jc\G 'x*bn =ܠ"."3*Pig"p }@:أ@^$ ю<@ms 䝱yE4M<5ȓiroE3 `#ncپ}.y((G0H\<f` rdj\\yO V_O%300N1o EJop- @QӃRGRa IU0`!0!@&4!< 88 m'l6X'pl'pW$ЛDNܑ/Np!p-3<^L\pd+HNB>m^!/ "Z'd+9x,}$vY'- 1̭S3w1 z\x 8M˥X=`'& `ia|8( d!0!MD~umh^5[@Yq30Lv`X[:|xpH||< EEE!dt%l/up 82 eKg744`ݹm`G*BvTf`Ñxy- `o%xe`H!p o !<~x__G x0㺨ؕv^]d{Gw0C.4kps;D;b_nD#CY^a CON,q< \-Ed'<"إxBSvFhC`C8H yAih MV).޽-jTL%c*!BKEƞ&0-:.+<pؔӦ\2 ~Tdz.KFɈq`;ABg-`$K 6'wB^* B`XofnpE>NN4Emtt4BB* \MC?ZU-8KI-|h· BK =§IRx?p=<B>Lb8 |ahC`C8 PD p\!i.d&p:> &͛7ȑnp[ r`r \ ч̞m.a^OK1;Th1xN 5@vp}d _`x8y!&pb\*ls :^$@gQA$;8 x plOEa㚘@<8YfP`uKE`pw-"[ ΁Dȫ]!5tǎ(̹鐤cSRnD0 FC`4FC[h3uhNgZD/Rޫ\ Z{&pf x!px7peS Ln8>>?0#/63A@A)pΝ@uEMU٘'0 9Tk=(  A3ɐhnnnCM*Fpz 8OÇ^v0NfC1^kDI  s!$) 4-p}!ڴ!_6DiWF!F#-z@obf hC8PevbF*X8"^i&-vQ C@seӕ\%2;`.Enή#*MɀGah/p\ 8MvaЮvqI'霃cvIdKvdfQ0!0)F; !*3pOmA7H!p- xb C<?wޅX!t\!ڻw/I !;hB9\n`S]a웡-=s  VPIч`np!0͓wM%А`0Dh=l?iW*k9gx3~zz:%AB!U]]}U xc2G RxP0Rte 0$1KKQ0!0)F;:!B6h Ҵ\U (;h=p; ;B&1\z188i`B"h r੒1"[{{8)OտB`EgН!!D^d q<x d2| ohavA0 ~:-\2 $3jjjBQ0!08F;" `+*GhM؃0ILRA;E89^)g@ש{B݃|m7'{`_D@/KP.:9U\D\Ic?`aN,>.l'nu.%LNx$w9a:-ҁ ȸXѸX= \@/v˗[Zx`[x#u&>de p*~3߿'ځr%555D"@p$0t!N$<U "MhR)^Yhy0O&)`І z>5g#>Ƹ]QS p'F-zb3p8xrChbbB3Z>(  Zh@Tq#x !f.=a!fM <h| bv.3IF3~g"bjV`|uT Q5FpsJ ="nև9v* "WZBVIobz}pg?*f9T`GV.;v;Ij0aJy6.422& h MXɮpKW;'wf{b7beox p='ppG+%<R;p4 xQA4F"g/(QK,@<X]K̂[HE ""(Bu~KE%u~*`g)55Ϣ)STgg'|'pBk'ojNj5́\{OK^80+Q0!0C`Q|I`6IךSx!x ̫,'' <h8Zx .L8|`{yS%d)j/^J@j>@/ N7)38 t?p xC~-<9 4`;:n_F{ tP6 Ɂ !kq9i~(p8YQ̛7)1T\XXܣ< 8 0b;,n806c+?6 ZhQ0!04f`-0 pX8tiLI` dM<8C\\qlT8ly)9D qlO\No8jp{ Jt"Fu}ÀΟ(>`3HA U6dz9`liWWmhjh"puÐ#잃p@gK(ߣOyB{~."fpN ؆dk`V$)nJ lgҀ RG7Wm0 llS }:{'a0`/!u4VZ$/O?78tXqy8 \I`"4C8 @{i gfW^GoR8\O[ ~v98l0pϼ"P0wgRb0 ip@8 L ^[[(/>9`ޡb$#PW`2<(  C`CHlKgj:8ۍfYŴQ[00 $|1/ 8[p$G+pD˨Sk֬Xր_arI ` قF-0gxnee% hZ!'*`Eu`2`'/ \y1!0!@=e@fA(G{Cz"CX>p_+pt ^Zl Ac#Ρߓ.k 2 9q} CN$MC8<]f4GC`4FCn!0zhb :C\R\Fޭ/k G;!x7hԒ |HiR =&  2t a@KpJ;gu4Ehhhp4ُmCx:g-OxQ |䉌h̑K%w>!0!0!0!0C`tp4 mC?~k???'- t.]'O8 dRf   !0:C8GC!pĉ`se 4@Gcv!0y9r 鮮)))~>M!0!0!0!0B`tp4=C8Mw 6lu J5JKKCHखhl3fx!^m۶]\\yhhhh&y{t/ hNz*PwCH^Tر77 nh6    KFGSh){+++O>}]V/gjFnnnkkk 9z=%v09 A= FC`4FC`4FC`4FC`dhp4叆CxF50w # FBƍRx!d  hhhh ?!0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      Ѥ?!0!0!0!0!040!0!0!0!0!0!0B`tp4hhhhh h      h      I!0:C8GC`4FC`4FC`4FC`4FC`4FC`hp4鏆hhhhhhp4 hhhhhh!M!0!0!0!0!0!0BC`C8GC`4FC`4FC`4FC`4FC`4FC`C8FC`4FC`4FC`4FC`4FC`4FC`4FR     !0!M!0!0!0!0!0!0!M!0!0!0!0!0!0#)FgGhhhhhh&           3}4FC`4FC`4FC`4FC`4FC`4FhvGhhhhhhvGhhhhhhH >!0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      Ѥ?!0!0!0!0!040!0!0!0!0!0!0B`tp4hhhhh h      h      I!0:C8GC`4FC`4FC`4FC`4FC`4FC`hp4鏆hhhhhhp4 hhhhhh!M!0!0!0!0!0!0BC`C8GC`4FC`4FC`4FC`4FC`4FC`C8FC`4FC`4FC`4FC`4FC`4FC`4FR     !0!M!0!0!0!0!0!0!M!0!0!0!0!0!0#)FgGhhhhhh`!?~\tr@DDHKW?~Xtth ߾}߿   !̡G]]g4^FC`4+W茆GCaѣG,Xp߿311]~~~e˖`l5|r$Ǐ@H;>|f4g {I 8'~xb( b7n|ЧO θ|hv4M[nX2 zϟoll# YWW7“͈S>|LL 9e jjjXv Ǐ)IIIo߾jGBٳg1}Liuh  .HgϜ93--m4GC`4{0h صkp= Gwܹc{Mh„ Ɉvii +++u֑qFܒQ`W8 ̐<<<0;fpP {!z -ѰX$0'񘙙`u[JJJ@@ WŋB!@|e/0:99]v ! 8I MFh `dd444VVV8\"n߾7oތFhCh>6Au6Rpp0t RE}0(= @il05kÀ lVSCe˖+W"{s۶m֭ ڈ>^ZZ߿!00i` 8>f"\ EZZZX+ I TL߲xpuϞ= 2`?L*` H~#$G%%%-0|lvv6( !:`dO)Z),F#y4FC`@BX[Ʒ`>:5#0ݏ&`tifffҳL!` 8 %a \r lv\j06S ۷͛>hp///0U :`H'A`/kxB\A3`P O\wajyQQQ@'ʀlƑdddK !> ,sG!0w\P.G,,,9sǀ&f[`.ACe{G#eC!Aۀ]k'yChddlw8p8=s` J4xo*v1;iF !CL6)X^5!\mE%Vl``:G!!=R``kk Rٙ9WM8vFh ֈ)))qSK$H6p3w& d 8} q4N `hԩgΜAV %ҭC#`7j޼y&?{!Cl9ؔ<ITp4 !pv8 >n.^Fr  5[@N8 Ґ ൨H\wόFhhp c+Ș#&HP&#`Cr=Aq,tu #GL81?? h͘II@~iieWQ.]1g5!7[!0!@|c L ]@>MhhhᒥQsmƌ+#wCb='\qVOC@rcOX,N.RB6 8CH%@G;XyC8 h2!@.Ebtp4ՍhBWKF|܏y5!pIʕ+iJ.\v1|t(sHW!΂oC8Z!h4W9.Mc!0!@UFBf/T;JrL`ytvuO<9hAeee΃xƍ1aCHI.yLT{GK C8\%.ٳwٙ1F;7dt8%:vyh{+{8 ܀S<8r lݾ}XFᤍ p`iСC0.={6G 6.i[bŠJH ׮] e$@Yy82k&$0 Ib0/^8 @~1JJJu pr>dccc ^zl۷߾} !nbݻw* sʧO{T ̀Cz}'"">ːZ 5mlB3l8 \5DBBaCvJ:@544#1v7pΟ6SRRk1MBBp>kPVVv$}` MF'p`@3T0"K`Mԁ0̀@&D=%N5LCF  @`C Y@g[M0A j`~ BO$[a)`| h20 $<_ 8xGs dbbby?b' po!.Vȡ ݡ{ 8p/x )Ɓ,!f:H0aBAAXo(!P;%`}1cLswBBFFFCY?)`KRRR<F6fp\g S6XYQ^ <xG+++hΉzC8K` 0u2ؠ6:\` ,UXFGGS"`̀U;A*`t0(ŽAfW- XCꁵ;|V5`YJ+~H e 0% t ,wͶ &0~^fPhP=E@``ZOS@"7(( {`IQiWR HHH &! 0 L, 6Ԁl`Bv\r?)8`s0UNK C,!0`0 L0 lP t~0tLo, <.x $5]׮]2H2 #} \% €yعᐺ >!azW\v,!% ;8p0][ !K+& O\\ @sY)\"v=pp ׁ5t' $#!Pxa|9GlvI-\Lp X%~d?^g9b^݊NmB`›vHi7v4h.q }* z!!\:6`/8: 9;tS1Z8_MRAf.8`&9aQ(k֬!lEGsM HE Mxf7g[繹lE o;{B`N:^@k?OVIZ{K|v`'E {{{]VbpJx pE4VxT/ %‡*CE#Zt F;C8ځ ` p^ !IЀ8p60;Q^BR(hfcwt)KsjPyp$[ݑ IM`"ֆ{ ,**š\B`` D| ,J)BMg`+rIBQ<\~:.^ߊA ;!$&y$pcR.C, u`!ܹssC,CHa ddJ@g7?;FL.B\ÒA|8!p!c?p ;֥;ub8hʀf7-B| !Ѕ!J&uwwyAKWP!c`.W#c(Џx)OB`*cВ4B !t̄ R~Q!nX iy)Nh?u qv9`x C&u 2C\}a&$/_>e, X\^+BẇX#iXT?B:!Y2 UzLo}}}ۆ-y ,@jfǩY2 P"83/B J n hp$`g J%\x,335!ׇw 8@C\3tO>)CWRn Qt%1j8C9R@R# !p(dw`x|!dp2088w` Hdۀ7AfFq!Lvqo=tp655a+ 'HA<p8v9CHI \\d4r/TT3p+>Bw !IKEC!^zLd _G; oPu<&.y4_ '.y@1Cu(p? g1дCY*2pPu[71;YI58Cl=g]z 36s5H 8Cy1l1 vqu31^ .ejF7!n<~h3BX7{oAgOov8dpF <9c. !}/]0 xpڴiĬn,{ Ln!/@KqB>!ցXZwIll+cxs=p>xp*!8B6<XC̀x8;e֦u28qѣG\CfSb؀!ҔaY$vGk9`I }ޡف`2y%7@]{MITVVgk|YI X4S!g'`-$!AtZ2 >箮.`G%p0\MG$ 3ȉS^Xx#CPIy5%!`/ e8Maaa,2Hڦ qd$ H8lp3h\=`Ȉ`uCȂ\ vⴘ!hBF;5///>8p$J[[g'RqpH׀9 (lqOWnCWn455%a$k*S1M_X)t *ΰau (=xFほLDJ1B+IWI<ڙex=u\hsa 9pmi+0zzC/p}Zz<;ep ib >@vv6yLWÜ/X3 e*f9G/vс7b]/ 18~DF(cr X5`, }mR)2!2xpp"pm V7r9]JƀMg)2x.5^ 6  ,kbccn gxOOO ﶹpx$p A ):|)sБCX #@wV4΀)<15c9|=SN'111`s{>p )\Ck vgVR!A]`~C lSu*xF Va5/|=P8=;L73Dp X:r`wx( =;uhZ)٧ypYp0 =t:>!p[!a5!-xR2@୾6چq_` mmm#[1 y(I !ppx p 23`<XSb)$`G p%;3`$pCTt ;2*ER;6pe01x:@󁝐!$# zâ}ێՌW\'64U̓ !pq=m!_!3zve2T0MHŰ,nU/( +gbv)wc`uH1,75f B`K7"8T9zh3Bp@=ؤj)Cx"pH-; C ݥ70˔)I9$p()\}wĸ 8x X`!YG<\ 78!$cKF!LБCb4UU)SɓdUf1q$ | !p`A%0,p +5C\t\ -p`EC)t%'bhoii/1HG7%35;} h/e h!}G>!z933s{x$` 8`  Lf &:p "\1ro!x'z-L-])yy`,\30Iz-fM-ǁ3fV`6%̈!,Np {nn ;1EĜ" \MM C;+3ㅐA`#)@|b!:+ F!0!M5C5B{-hG\݃l1BTA&fY\;,%/ҿ _3$!#1HD`̙3@vhWvwf˗3x$I#Pn]2Ҵq)h(YkhQX ,  #r3/;Co 23h{GgifG;0p$q~csK Gwa֣Ϥ<2kihWg?p '<ƒ<8H [NqfKw9p`0P5,iӧK$ޅx{{w901@=|)Vc8苩yR<T{ &Ѯ N q` ǁ+3!Xo¥ UOܥX4T`~.'#c.$g8<W0v,`NAAkZ;x3֠v.j}ii)Ռc8GjBz,hS0Wn sYAv >¼nL1݀60Rhr . Tm ASN1y ZeV@07z ճp7 }dc\ﱧg^Vx O`W>hQ$@<FO*z@ Rw0L\z'Aw—;`3P1Bsk›MS@~{,d1{RIqd8 ) vG:Y;NH8nuƿx_tt4d1c8,倫˱އ5t9[KR`^f 65[gK \vi1`7X61pX`.$ux7,.+]SgYS%PW>1 8 p%4[:::U<1e;4)v?p7z!1 {X`Hj&| 0e3 /,x7f3HKKÕf8Bہ^no`@mMlijjbu^Rxp3t%!; ؝FHu 0jHՂ6Tl3-9g{Ó(L!8{W; `O2xzz 0o!6H5x={`ZUV4v]=5XWCHWݻfd`Pׂ2p\,%/$ ,*\[RcH:Fr`vr4X_m-v^@%(`ߌTΝ<ou` OIx7s cX,c-+#dZsP N`4)) ~0D%8@s+ k8 \?F_Z\ !Lpy zoy7pZ,X Wt M<<<0Sp B8B bdz9%9 W?f%D?- \$hpL.&"8d,Ѥ$ǃS1l7pyAE2A y'( ]ggg#@CK`zsP,ِz Nϓf b@ ֆAq3u3?qRׇ/v<X Bn@1R)$DE6H]> _B8;Ձp%H\@.2O3ڔ2pu }*d4HgY^ Pe n".#o$Gs(iC_ wơwV(X (r)p/?BA]x6eʔ#.% nF(S`tp9؟.MΫI$!(iUAȾman %^\x6̀#RA`W@1`l_E>A 4~Fp='p)CU3ÈG!l2`OF <2 6XL >\l7h=I(`HӀ}!`~pXZ T \D.~!$*1yn# ܳG݂X!׮Sܱ` 0^h0A)1slEOZ['@)`%v2IAh. AV^dG10p ]a8\ t6p*cd/`Yn 0rwW#8΂XK?V#WaUUUqtp=R`ؑ"՛>*EAF%4YS֣;N(p}0`0!WlL+~ W祁C*1)`38'VXK07Ç#0d.znC^\8,i*U6P+8Fq;`_Rd$3-jw+`GJ!^=r Xo`  X 4NJ,C%BBBh7BXYў$@cA>@aZ0 0H:Zu` c 7CR3bCx4pf  3| +R <2M aUJ'`7lpB ~z: jΗw B# Ncu/SBT%9 $`ℤs8 w \O\?E'%k `u90 HgY\`  ln-E)|fDMvxSѬ4!@fGhvyk~.vW)KHr@:i x 0H6@   )F; f4FC ;hͱcǼF#ih7 ^p/_|M`g ""F?VVV148C8 ߯'k}Gcm4FC`4FC`4FC`HGj4FC`4`8\ 7I+`)0F@Q2Cԩ]xaQQQOOI<!0!0<F;It4FC! `iͻwWŁ{FdІ֭[ !&/&  !0dt4hKKKkG)>Ssss 02Fc@qqq__~G hlhhh & C`Ϟ=En S` CT0 C(6l "Y`0zh   !ф:!@ߵk׀BHHP@@pssךIѠ!0gΜӧ;w ##0T9!0!0!0C%F;iu4FC`4FC^Af͚x#8!0!0!0B`C8hGC`4FC`4FC`4FC`4FC`4FC`h̏hhhhhh     `&      3}4FC`4FC`4FC`4FC`4FC`4FhvGhhhhhhvGhhhhhhH >!0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      Ѥ?!0!0!0!0!040!0!0!0!0!0!0B`tp4hhhhh h      h      I!0:C8GC`4FC`4FC`4FC`4FC`4FC`hp4鏆hhhhhhp4 hhhhhh!M!0!0!0!0!0!0BC`C8GC`4FC`4FC`4FC`4FC`4FC`C8FC`4FC`4FC`4FC`4FC`4FC`4FR     !0!M!0!0!0!0!0!0!M!0!0!0!0!0!0#)FgGhhhhhh&           3}4FC`4FC`4FC`4FC`4FC`4FhvGhhhhhhvGhhhhhhH >!0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      Ѥ?!0!0!0!0!040!0!0!0!0!0!0B`tp4hhhhh h      h      I!0:C8GC`4FC`4FC`4FC`4FC`4FC`hp4鏆hhhhhhp4 hhhhhh!M!0!0!0!0!0!0BC`C8GC`4FC`4FC`4FC`4FC`4FC`C8FC`4FC`4FC`4FC`4FC`4FC`4FR     !0!M!0!0!0!0!0!0!M!0!0!0!0!0!0#)FgGhhhhhh&           M[`IENDB`uTox/third_party/stb/stb/tests/sdf/sdf_test_arial_16.png0000600000175000001440000035466514003056224022346 0ustar rakusersPNG  IHDR  U|IDATx^c?(      y!4!0!0!0!0!0!0#3F;)4FC`4FC`4FC`4FC`4FC`4FhvGhhhhhhvGhhhhhhH >!0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      Ѥ?!0!0!0!0!040!0!0!0!0!0!0B`tp4hhhhh h      h      I!0:C8GC`4FC`4FC`4FC`4FC`4FC`hp4鏆hhhhhhp4 hhhhhh!M!0!0!0!0!0!0BC`C8GC`4FC`4FC`4FC`4FC`4FC`C8FC`4FC`4FC`4FC`4FC`4FC`4FR     !0!M!0!0!0!0!0!0!M!0!0!0!0!0!0#)FgGhhhhhh&           3}4FC`4FC`4FC`4FC`4FC`4FhvGhhhhhhvGhhhhhhH >!0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      Ѥ?!0!0!0!0!040!0!0!0!0!0!0B`tp4hhhhh h      h      I!0:C8GC`4FC`4FC`4FC`4FC`4FC`hp4鏆hhhhhhp4 hhhhhh!M!0!0!0!0!0!0BC`C8GC`4FC`4FC`4FC`4FC`4FC`C8FC`4FC`4FC`4FC`4FC`4FC`4FR     !0!M!0!0!0!0!0!0!M!0!0!0!0!0!0#)FgGhhhhhh&           3}4FC`4FC`4FC`4FC`4FC`4FhvGhhhhhhvGhhhhhhH >!0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      Ѥ?!0!0!0!0!040!0!0!0!0!0!0B`tp4hhhhh h      h      I!0:C8GC`4FC`4FC`4FC`4FC`4FC`hp4鏆hhhhhhp4 hhhhhh!M!0!0!0!0!0!0BC`C8GC`4FC`4FC`4FC`4FC`4FC`C8FC`4FC`4FC`4FC`4FC`4FC`4FR     !0!M!0!0!0!0!0!0BCa4GC`4FC`o#%%%d_|q֭*!nvvv)))bOBBbԩS-''Guh?JXXaɓ-[pqq >|g^~jjjhhh ` Q!p_|q`~~>vuXX6m*++۸q#p[reMM dk׮}؋!رWW]vQ+Vyŋ0yƌv {{{~̙_~j]RRҫWOeeezL2a`b۷ostt5kh3!0!0!F;p4FC`d/_Ӄ@doo޼ӧ@j \CbBsvvFVׯ_=Ed8x 3"tuu興!LOO߽{7HP`Zjժ}Ν;w.0UTTYf   t8!0 :K0{l*  ˽p [Ν;wV^JuKNN.-. .|.[ ( c===k׮9s&K9FC`4FC`4FC`C`PD8!0C '|9um*rݺuՃ5?~MyBŋ ۷-6nذ!77 dcc8@veˀkˏ =<<`cc0!0!0!FgGh SNر؈6奥mllp0<}C3N@e'̽^nݚ6m<*fB""" 1!;w:8y ppd 1>P (g4TY}T:C-D {}6Z`u$tݻwT 'g +n 5yx 0$q'@nܸ4œն@gcU\ \f Inp&ܾuy` x` b4>M~  RCpNAΞv;}T`DRR822b  ؟9>+jii&M t6=݆@)/PSSSdwFcl - P )@GM+^p!HW;###{<`]%-0lNr 0 Tq0n50Ѐ6Jftr,u{_y! `h<e2:`J3? t0ccT~'г>6p!=FC[ZZv}!􅏏ga\ ta\\&r8C ؉EK `4FC`4FC`4.FgGShP g{xi7`7^ P;4pNN{2W{D.)** |BS%+}3)۶m"v ӧOٽ;0pJ 97oP*%%ؕΌw. p~H@lFT`gdxV*/h"p@@e23B8vu&X)Y`^(0:S=eM8~v`H]R^^t$pgKLLk 8TnmnnFv)Pξ7pU ! `i].p ` !`2Ł60m(п3f!0!0!0xB(  !I9`X~OGv2wfd /`̀g'%%%;^)Lb` $$8t \9*v"VVVupAPi 1p"N<'mR`g  dZ@mMMMȊk2!Ypӕp е@7΁ ' vI \ h{@up`Ohځr$p%0\7pq$T 2';~~;֥KB7u^:&##&s? FC`4FC`4FC`p2 `4FC`p p Z:d7wdg]\\<q=`QPPY%p6BL`W 8Y\5Aჶ! 8i tpFddQd@]@.pf}^W r R+pf.+:xN P p$d EdA~& Nj1Fi8 rp]& +Mm|p$-2ȕ%yBdqT|ͱ8 LA3ȲRH" d1Pg_@30AAAD .%(`!0!0!0!0!M!0C&HdPׂO8CY=+8u؇ed B\4 sGpyQ`hGvt`(ւZ΃?>c 43Siii#7+BqYMhaLRHHp1d䆌ӧOg5BNz3   7F !7`ؤH\8 IZ8w<^s๣gq){ՀZ"W.$2=.`x ٕ5>*^ (bhe!=[Uřfy* 'Gd޹4xp,0Ӏ!nhnNT<{l` \^f !p4-+1 7g{G p<)@ /p23G  & q!..v{NvJŮx4FC`4FC`4FC=Tf4ٌhh .nD;Ib`'x%p:!0!0!@LvGhhB= 2K/gϞ Yr%pI-p,pp4hhhʌ q!t~\<E}-,,cܱ \D <,%33xh"     B؏N<~x !\Yf0000++p4GC`4FC`4FC`4CeFhh ;g   JvGhhhhhh=Tf4鏆hhhhhhp4 hhhhhh!M!0!0!0!0!0!0BC`C8GC`4FC`4FC`4FC`4FC`4FC`C8FC`4FC`4FC`4FC`4FC`4FC`4FR     !0!M!0!0!0!0!0!0!M!0!0!0!0!0!0#)FgGhhhhhh&           3}4FC`4FC`4FC`4FC`4FC`4FhvGhhhhhhvGhhhhhhH >!0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      Ѥ?!0!0!0!0!040!0!0!0!0!0!0B`tp4hhhhh h      h      I!0:C8GC`4FC`4FC`4FC`4FC`4FC`hp4鏆hhhhhhp4 hhhhhh!M!0!0!0!0!0!0BC`C8GC`4FC`4FC`4FC`4FC`4FC`C8FC`4FC`4FC`4FC`4FC`4FC`4FR     !0!M!0!0!0!0!0!0!M!0!0!0!0!0!0#)FgGhhhhhh&           3}4FC`4FC`4FC`4FC`4FC`4FhvGhhhhhhvGhhhhhhH >!0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      Ѥ?!0!0!0!0!040!0!0!0!0!0!0B`tp4hhhhh h      \wwwUUU wTTfۓ0f͊ N\_ٳd333񻤿hcll,PY\\ܧO ꃂ}||;;W $!ajojj>~c((// СC ,-A`۷o}`}TPPr zxM2ѣG@?~ 4ȑ#@-@CXXX7!ہ"-- Tlٲr߿xh)Бn211pɓ!?>Pݻw> tМ{MJmذhޞ={fϞ TRRڵkל9sVZǏSNݺu+PPӧO-[}vHPC I}E##M6 R͛7m|9k7n߿]]]!VA`988ˌ3"!!t0&Nь@oۀ;s555֭X[رc-6mǏ3g@_~ ]f 0yhkkS=@7=LHK,F,PݻwfnnL<'N2:`4 GGG^` ;0LcLT@3}L `4FC`4FC`4FC`4FC`4H d">Ǐv<$$o`\MM (>o<`iiijj*KԗT'3]ӧ/]aprruss|||>Fss̙3#""/^\PP ԈvT9`h|ԝ;wt } v|@6/$""@āk3@%%%@7}?xy% t30 @+nU֮] اv瀁dq=w\aa!u)`*1v;w'pr)%%fd5&[{)%`n9=ooo-%%za@GGG睾~ XBʀ.vvV-`C[ p 8]> j` έ8 jv}}H׀n d 133;K@ ̀]Drv m@ OΉ: + CB.8pk2s}u&mۀ/Ȓ?p%$FD` s. N09p% NFBL.vIp h؝ 7@{z?| ߀3Q@t@G]{G^г.r Y= \ 485񺸸{P@6p%pR d':8ǀ 'B}W w@Nu' =4`76g{)2 sh8d&\ М4O` =$$p.1YM!qgna ,Dssq}fdPpχC2 `޵*&pӞ@ _ ziIQH`<=d_v z@IQ0!0!0!0!0C ` mNg'}!=J`S)ʃ4WH.$ T~W9."phii Uv=1v;`8qT \' S@8H;3 "8|#o g΀xhijKō_@{G~<;]\ 7Ȅ$R`(J 8aY/`h'[04h d!0!0!0!0!0#4F6o޼gϞ-[:t… ?x񢖖$>|0ydkkk2_Q%fϞzjuuu~~~Ln h+핕j .ն@SLٹsgtuu|-3FC`4FC`4FC`4FC`4FC`4zBWWP%%%`nnn~΋/ή+^]/...j3gʀ]5N6EǏvk *vw988wv]]݂ ~ 2gΜׯ_GGG-:zo߀!0!0!0!0!0 XFZ,縀^vdhhd7< IJJ:u׷ׯ_KLLTQQ˗5553k׮///oEE< .\xMNNN`jҤI)˗ m?3g{}~WUU# Ł@e:buMMMͻw.^8Wy5kք G%u]7Ν;ϟLLLO>-,,N5RSSڻ!"ǎZBڵ]Bd4FC`4FC`4FC`4FC`4FC`C`t!(9::N>v7n=<<}0x ݻwأnllG ׯ_ڀP0???""7\k 䚛geef555@h P+,,, %%%{z (&& ۷oW޽;##ˋ 74}1 t6Z__ ש;@^z?H"t4 t .,,W;uW1 ivZ p ];8o$ sssl"D-6Θ1B%'O$߽{'##j*F#+1;@) dÄahhhhh A͇' Ӄ۶m:u*,p x;;;HOOO,p˗e.p]%{` 8nYt OI`ﹸ899W8qؙܱc'+~~ӧ 8Ts2 8e jBe!0!0!0!0!0C?Fn>Q '=4`۷C.94cWԀZutt RnۦM3Ӄ@A==Jpfyy9p*XQ+Wz";xȂ]]]݌n.d=ݻ8g\G 3gŭ[I`.22bЅա}@6@]FFF'N:؉A0axIrV\xx $=#Ѽ?!0!0!0!0!0 B{ _wAvo\N;]pQ%tU s}:!0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      Ѥ?!0!0!0!0!040!0!0!0!0!0!0B`tp4hhhhh h      h      I!0:C8GC`4FC`4FC`4FC`4FC`4FC`hp4鏆hhhhhhp4 hhhhhh!M!0!0!0!0!0!0BC`C8GC`4FC`4FC`4FC`4FC`4FC`C8FC`4FC`4FC`4FC`4FC`4FC`4FR     !0!M!0!0!0!0!0!0!M!0!0!0!0!0!0#)XFZtر,,,?B}ٽ{lll h+VxFܙ3g(q֭[Lr加4Pѣ߾}suu-FC`4FC`4FC`4FC`4FC`4h#C{cǎ֭["##_xeK/_NC8w\###Zw'O& ')ܹsgݺueee'SN:tx-ӧOwrrC8eʔu?^UUfgg3cƌ/_vG˾    Q!O \..Nwɒ%@CxXx>%%YqqqMMM>|H=d`$-+++y>27oA3 2h     Q,<^z|AAAnnnv.\/`wERR98\⨯t7n???SSSdeGqrr;>}rqqNϙ38] pjyp>hFBBP7oŁk?a]bџ?qWVV͙6m333Pnyyy@c 26333?4!Z`|B`WPXXxϞ=jjj.:Ǐ_~ݻ@A`8'N SBd뀳~)D+w4hhhhh(FOE,X\\,&& On@e/B\'P 3 T0{l;;RYYիW )(( y)PAbb"p (p0 &%%qssWWW.Z((&mذbʕ+[͐@e,PADDPqmm/l`3.| t*=@-"DvE`GhBFFxb2"p71_p .v`opԩp2h/t04[vJT?!0!0!0!0!@"VNN.<< ӻ>r'_~I`8Gac%;|իWrd5;tANN- kjj@]@OvM*=@ [[[` 2c@ܹs@.EC<t- V<zh|rr2Ph>X IـSpΠMvWGGٳD8577GV)4FC`4FC`4FC`4FC`4FCF!0dNtG"8G'n޼ quhWܴi/EEE,5slI6RRRpA`  JHH6`"j*`g5q~ }N *̀:;::IU>0pا${/CCC5OE:pAS.kx/:Ovbq`x pm*QQ0!0!0!0!0!@p'\? \o ك^k ̀6,d np" j 3-vpGaXe{h-<4N']AA8̓lY>0pp̙|fn;D_رGo4FBVmܹs' Pp.p = @q`/qC0 FC`4FC`4FC`4FC`4FCf!04(pxR2H`/ 8y$cbTܧdp"nlkkT\ Tp %^y-@e)^Dl<8qEvހ+Z}#s*Pe&L>>M6ݻ7==]KKahhhhdTSSS _@1uuu`DEE<9r1""Ύxu=|8I(//O>>7V899PUڃP8 .cccs` tOl#pzHL.?Q1 !ϟŁ[O!!!E@ 8 + MNNe]ee%0E (>BDXXX1{= Fhhhhh =eKL =}6mZ||<T"~kkkl^D`_ؿ0ڽ{www74TLL Xdpnnn.`+))iƍ+**ֶmQ (33uN[|9D 8pP%d/L쀝+Wnذn5 2ro(jjyPvs-Łc`G˺|2 '>~1\=?˜:u w'NuVv{ |a ehJ꾾FqpTd5z ,ZC4vFhhhhh ?pIII -KJ cq`h͚5@.w z]G̰vlҀр"`筷v,Y%..8Ng'>'1Y`QFF%;;nٳhŇvl!EEEpf])L-ʀ}?;@E@.48yM`85>"0@oOv Ӓ~=X yC3ggg`BāfnnyBPWkk+~kAс8s7ۖM,p84? FC`4FC`4FC`4FC`4FC` !=g<^"W$w($p N&Eg3gng퀳[X39`ʼnӀj!W;o.+"XJK`8!v9I`>!vՀv@6p@ojB=@`h(\ $fIH|؅SSSI)EWTz/AS`^\ \`_8 x 7*R 3`_~sv2Yjp8aIt@LIIIK! IAPK D'Q(x-z8b5NWBd}@#D؋& `w4??>?v.W (     B,1_Ѡv]Sdv`v< x_AOv":;;*Q@+.Z+((<صg0%F#'poJtqq*z ( T <^ p x) m7t< o.݄\~ `hCf .)DUUU$O j&M~}:؅-FC`4FC`4FC`4FC`4FC`؄#Ĕ D,vB\` F.!0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      Ѥ?!0!0!0!0!040!0!0!0!0!0!0B`tp4hhhhh h      h      I!0:C8GC`4FC`4FC`4FC`4FC`4FC`hp4鏆hhhhhhp4 hhhhhh!M!0!0!0!0!0!0BC`C8GC`4FC`4FC`4FC`4FC`4FC`C8FC`4FC`4FC`4FC`4FC`4FC`4FR     !0!M!0!0!0!0!0!0!M!0!0!0!0!0!0#)XFZtx񂠗YXXDDD~NPO( > ޽{_|)++kgg7Bҿ:߳IHH 4lhhhhp !6mŋ>} Q`S֭[Θ2D ,//rD /_>uTRɛ7orssP:;uTWW۷UUU===)>zHNN~WpׯC+Y޽[LLښ<{ .RRR#G@!0Y&LXxÇ}}}EEE|L7nܸ{ngg'@!t'\Ν;IG; `4FC`4FC`4FC`4FC)F\wlaO4k֭% ^DDNv>{J׮]swwNC۷/::~e nMXYYiYB++ug_O8 vp>~\TT4ZhhhhI!0Ot䄄(I7F ۷oPݸq߁;')qǿ}߁.\A;cÀmL+Z\ mmm^܄gϞijj1Fhhhhh hh`Y m!mmmẀMsPx D81ui*P`(\ZǢk5١ף.P755%YSL%.422n۳gp$͛7lTqssi2ppkp1-pp . Y2*@._ ,W^aիWV[d ʀ!4ܦ7aժU@_wxBzG'O׈F'Ns'''dP'`ׁ]t` onn} ,]ϟ?YF0`c<;;k͚5@3E L`PV`䠩$$`R_r!433?G Lb!0!0!0!0!H]ee}3Cp!<2^O ~k7yd`wM&Q?>po!hd\:w\ hpÇ_~c>߈<|@2`  K{{;0[`bzd֬Y@qxx8DCL8= <_'>pSZ}B 0 FC`4FC`4FC`4FC`4FC)Fg $>` *N@7EL3`~? _ToM ՉUhVm );` *NĀ=S7dϥNiy4 PؗXl_E t{ .IX~ 3@A`י1@8N` ~( :U`Q g Y;v;oYP!,yU`IZvP&Bz@6 g<x)pY/{\ B S t6p ~ 0^7'`, ÓdҥK䫪@.P 7R (+0 FC`4FC`4FC`4FC`4]v D)\Us0u;6I3 Wg;*D&`3ubn^4De3?ā{E ]7dqH82p y*sMIB2w:O3e^o0vҀ+ZL`SWrdq Ks2 E;t` h!wo=T @g ! tLRF܆ lWq?p0ր=%2 pJ/p3'pBT3 u9a6hA< lOF <أ_Jvp5d|~VzVh.d> x8'2`(F9+F`gzw`v/!NP(     `:2, `SzO~ #jụb;HYYYEEEhRgm {ILpWKCҍ);0H>БiqY0p x]! n>pFh/I/G`s0%!\ t0ph`4/hhhh!0z( p$F?gҐ;~199(GLtp!#d\l `= jA g5.|U.KxG     0'X8/^dnoNWLI3Μ9\tJ!u <h{GK    !0dt/ppxp#2p p/-PD 8 111N$RHN,!0!0!0!0!0glW'뀷h'I|h&     !0!M!0!0!0!0!0!0BC`bѤ?!0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      Ѥ?!0!0!0!0!040!0!0!0!0!0!0B`tp4hhhhh h      h      I!0:C8GC`4FC`4FC`4FC`4FC`4FC`hp4鏆hhhhhhp4 hhhhhh!M!0!0!0!0!0!0BC`C8GC`4FC`4FC`4FC`4FC`4FC`C8FC`4FC`4FC`4FC`4FC`4FC`4FR     !0!M!0!0!0!0!0!0!M!0!0!0!0!0!0#)FgGhhhhhh&           3}4FC`4FC`4FC`4FC`4FC`4FhvGhhhhhhvGhhhhhhH >!0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4Fh4A߿",,,LLN2+++777%Ag^^^Z2#*>}zշo hEF|sׯىtۧO̹x|(KaFMi!0!0!0!0\C`ug̘q7n =pppۗȖwss+""԰iӦ斖www&'۷hɜ6l훌???K8Z0tLƱك$6J`6TWW>;III 0L_|q\\h    @# |||3*@Zt)D#p0jƐ鎦{ӧOGh6oNE -ZGz͛7gϞdzZ L34)''^STT+?\ygΜ122ªKD2sLb}}`4FC`4FC`4FC`4FC#F ͛opbR{k׶n i5ZYYyzz׭'S dnVII y:02s焄ocbbA ! Lt-[={8IO{ /_ Qh%3I~}( \2 744|ծ]=Iof!0!0!0!0|C`QPBdڹ88{o޼p,p:>ppt F,Ç!մK$X\=R x']{{T| +W ;UJJ 2##|CY ϪFC`4FC`4FC`4FC`Dh|ϟ6=mz`GxiŅi---1= aӉĻ:V.p<_رc.]GM3!Ï%{/^)-- \gaa1kMMM?~OnK|9P#@@@4Awމ;@ɓ@O{>3TpbQoo/Ca{ssPh޽{=э{]=@}NF=p +pi%@ R>6o<3 h`:u h#p^xp >nҽ{n߾|.;I\L[lll3wA]d/f!0!0!0!0C`CHrN6 A<&̀ zV`Wٸ5kr  Q&8 pvֲrܬY &p5@+9C`h2p^}w@]wp/% lEπ~Oh7K` xzp 8!˗/œ́8x…P=y]{ 8 @n.5H`hobb"%n@x:#ph# wА>0tbWw3B W^]QQ"pcCCperBBP#г }p93y 6Kx] 4HG@@n,$R 0؁1jf0 8ZׯgF` o.譩w5 ӱp( |5` v`\@^70 `4FC`4FC`4FC`4FC#F;$'S܀[-Z`s޹s'`ؙ!.X8ɶm6x؁trrvUv{ K݀l===n4i4 !WFz SjB̽@v,=P` @rM`GÄ;ص6ǁws7 -[ MEv&;@9@b`<18v5mz`Pd';Q@obbC3f]Mh!ummm~px,',$vH?3w\8pn* `BbZTe !0Az@x: `81`ڀ;x| CSk])b `&;e=,`*JA` `חF=s<S&ph3-0RT^1(    ɫ^ `OOhvx`xp GMLV{pA`I/8 1| }LWވnN^49+p[BL\7>'\= 2FrGݻ<8-{z0XzNNNjv `?.[8݂O2(xN{Ő*6tŁ Bd|؏ Xm E!w?I C"`gƀA@~!X 'pp Es0Ne?4{߀[@.е.p(p, ΰo333 :8e s[ tA ȍz0 0"À]R@ ~>M FV9ԙRQ0!0!0!0##F;g`Wإ΃pf@!=pk܀sYNp& ; &Mn!.;<@.p !hחU@UB`! {\"P rAd[A td,p!R+Hɋ`Ld uG[hL=`O %@)`$ ^oF.8nsZ`b zQ+CZe#`8CC` vπ-lxC3up]6vAOQ=EXM԰>t30K0 FC`4FC`4FC`4FC`2tdd$V8J2xF$[ZZ{`7 V@@e:4z @3QCSdYy;}6c=4`ZvY>! v{{ρ8`&<<xB#p h/di@0t1دhnn;Iy5J vꁞ.5 ۀmt{eeeMMMV}Np> ؛. h~ü,ǁ+`<`H; ;W>` vu!W;ϭ9s&p`x+OdCq8 ON<8? -E»` @n h]X=z]5\`,Q`dH5#Lȸpb ލvJ>&W]Ib!`&[Oat-0d9B[8K Ӹh"Q@/ tP<5H/XZ 8Ylpy6&`7YQ0!0!0!02!N:+sqʀ?=pj . &g* SOh ؒ y@ꁧWf"W.$>]-o a *'L PЎrW:Z77C &F`&g̼+'.Zrr2g@Oޠc_P RWTgV 0%`\PdC n$f& !`G8<C ^`($P G8<x,p(    FhWV8Jt<\ KPO~-da=8qlagi  )"-]F7=xn2p#1SX883U{4"2tx#"d:!0!0!0!0% %'{# ǀ7qIwo>^<xhthhhhhNn]^FOF> e냧7tdW;!zvh쎆hhhhh %'ݻx'Ty#aHo !0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      Ѥ?!0!0!0!0!040!0!0!0!0!0!0B`tp4hhhhh h      h      I!0:C8GC`4FC`4FC`4FC`4FC`4FC`hp4鏆hhhhhhp4 hhhhhh!M!0!0!0!0!0!0BC`C8GC`4FC`4FC`4FC`4FC`4FC`C8FC`4FC`4FC`4FC`4FC`4FC`4FR     !0!M!0!0!0!0!0!0!M!0!0!0!0!0!0#)FgGhhhhhh&           3}4FC`4FC`4FC`4FC`4FC`4FhvGhhhhhhvGh!߿     !,#-Ξ>}͛o~_|yBBB@MCBBxyyI @^:h$&OkFFFCCC###)) !0o޼`=ct(##CGeϟ?p`L|4FC`4FC`4FC`xΜ9ئp£GHB]]@0000mkk>sԩSK}}}ʼnSL[ڸk.`&##c43W\Zx1P/3)%%%G;99WUU:u ݀}w}رǏsss] O۷[nep߿@h1!0!0!0 B؊Q NeaaẺ< ~bggla,pTqժU+VDFFRVVz*Y|rDDĵkאy}}}i@{o޼8RM]xݦ5x߿qϦMStׯ_Iصstt$^`8w%͛7`5ҝHYZZ%hhh07CrsWK޺u >}Zt_qrrgHb3gggJH9\ [:::  `wn ؙYdΝ;G{d;p 1++ 8͋#w 0e0i9d"- nã7 u!L JD5kA<&n&2ahhh qBG0@{=z8p8eG-((cffgB.-577Ϳdp@Ǐz>pڄnqS3pYQQ량pqoPPH 6P_~   !2PI3:H-d Q..so:]ɓA8\` \88O^6A#G+#&Nx!"M`bB\SDFC`4FC`4FC`4tC8GCv-i._ a-G ;x y˰GC 77wǎdeAAAcccb\ W6|41hh !x)pܹC2*ApZ.FLK N.zß?SGIopeː;CkӧDnDMݹw^2p+ix2@ ~tpVHS1";x1phݻSg\;!Su&;Ĭ@"FhhhP%ԉ=B777g[/_|p GEDDl1Ϛ5+ `* NFg󃁭-x2\-xF?@5Ϟ=KZRH @@EE^VV[1n}D)P TO` N &L~FЄBL' 4 [쀇+Bހ-`$lܸr%p1eu@n %y <0`w ao@.===L;7n7otƕN> L@޳+m4\ fʀ lhNB), O<ʼn'5c $ 0$`vޗvQ L)MFT ϚBv? 0 s3,I0 4A$` s 0}A|| 'Oom<<< `4FC`4FC`4FC`Xh: x70.vSE(C`!>>2`󴻻>C#+Gjj*;[#O m \z^5R anBjx<CSY@G;0T$$$\%/<xfp ئvup!'lLc/4 }Tx2wgccSYY R\.@4ػĀ&HHH@T#x(@-dwLN `} A`@.Qp@5(`*LT .8~;x,ot>`ѢEz."jQ0!0!0!0,B`CHhv!=`L!'1@ .] lE!Oꏉ! ڐ#m>SSSI0{^dz` $om߾8!ĀVӼ}*`+h3=`H@Y`&`e`hpx= v]Ax/`٘B`OI61p/́lPAQQ_~ljjě@L/dM&pbp`@99So\\pZ "B,6!##T1(`J@?p(BD p3d`ry޳gC L]@f0OMzP;A%0H!(   aG,-xx[mlCfB1Ќ*#K|p%%% \$~n'pj1/;)@ep= O(N2j/)zleͱhsV@{mg]h`GJII(,( kj!`P@KIPd@뀎( ӧ6j +-MF 9s([T$2$=C:oL6^4v.p wS 0hڑ +@!"K%d/Ѕ@#?U $'kvA;=1Hcd) ) '8 E[^ 쑢/ 0<'G `xt QQQ׎7E`.L,"V?8E6 Ҁc^n!p3     ;9pD p\™3gB7Du &'ـ[j{:=Oa5vm2:555OX۝ h~olli".6m\׊~p"؎jpX춡vB KL # ^4xF+P=$]ss3p=ELRRRj8 \Q7\0/05M[".17 4`x(0[ we|k` M% 00}62rJ?Ceԩoood,&B`g;pvb:`jz8hhh =e*8y;pi-Bo/dP pQ%;-3 g$WL_Kڀk b5 a <bБ^.x Cxx8jRF0p! ؁mH}(B\  |%kאG !>6˃ќ_I t$0( ).X/R0 8 Н#@C!h }*@D2! mkq!64£m&5pE(pN hCb4m/ķP iih&~E,s`~e__N]܅T+]KmKCV D3n "9 J)ț݀G 7>/< "5_Pz:XLG7AӏH"" Q s8LH y 83'\~ V*@_#ǜvo r!8t35`wh5 )Ej@w):u 8H҅dNCk`8 a}u0  `U|"(2Y1pN}Ldֵ{NO$!dp8%ĐE˶C8ke!y䰮/p0`>f-Cc32l-$"c@!xfFVoJ bsL) `4FC`4FC`4KvXQb46` ؈8{A+I02&ED \ FlM;^26 ANˁ}6`xbv-o[ $&!0K k@> ed) 29ĕ2'7!f5p p@Y\@>{@`"dCN|j# :#P^d_ky8lsKh s-4p3d+X`2Ѧ: oCQ`j;0vFhhh R'&!: ذhw ]`q1 \܄!b.OZ l&^~N!Xx@-P 1B`Gs*;!Oѐm^.sB6C !쁛߀{)mz`_ \gC&<{TB)sD03u w9<%5ɓ';x4__߼<\&;Y` Cd]3T";e]`Vdu@'ӌ!&6Trr2dJ`\ 1؋:xQ `hpnpy0T-*2  .!0!NLbe`}WV307f$-h$gk[<^5z679"8lB"/C6بt)iL| I&ёw> 0􀳔u_/8p xgD 98 4~ዖ `N!Fa@ᠥ) .R`>Ϟ=8ƒB`;e.bt 2@8 8C&LuiOH < OKQx}`n,b03@Y0@ rr&;i10 FC`4FC`4FC`4"F;C ݩp.03@vlZpv ؈Xo>`d({ࡠĄ lCkN[a=\ b1l_[1I&{dlpݖ-[C =`g֗5X cT ɋ`s<+8 yp!01 HΉŃСCN< g`xc j^t >zA>@Y `oa"dR `4FC`4FC`4FC`h)C,ހ݌` rpoEj 9Ҭ27,oCb^ ClL2 nzd+_8 ?3j_z5d p>?!ӧ/؍vK u |%piƌ%k)⏒ĉ9 _,Z _drr| p:ػkN!w.  E!F܀BKpQIu')5pB 9d!h& `2ahh0 A`pQkǰ:8EpB/` x&p*>S 5'lgE<-X 5#'p0؁i&3 \hɓ'@?' y+pآ& u!jI8Gޒ`LZCC2K=1@.H̓>K=[d \/Ѓ틐x_rd%pm0@-?D/JLcK؁-[1M#L].p!0E WD7eG@zĘLTU@!(b.v y%.9^p[ 48 g3p0p/pn g &#--#.F1-nd!0!0!034R[%/fvr\߷n끧PR ML$8 l[ؐiZYx!V)`_>St'QOM{t^'p 8F^*5F(|p+&D/p sa-0]M2[>I2 +(!b`oع<vS#yJ ( >*pxI?.nn#r.[ !A<0e!g[vWi_aX/> Z t%!d&) ܒGR!wKO1ohooe&p%C!8AU%AHCB6SAt}T[d %C؃ׁ*B` 끖B tp^اg>}:91@'}~`o9a@3@5t OwX#ÐXf'C\n /f39! ݸ.unMO xg:d J22`Üf!0!0!0C6F;C>7ަ[R44`_ 8N^I_wxAuXψxId;*Ţ]7@6( n?L#)g< ۷ovހзnv>4E;xC7@ 4MV5kpU*Gqhۀ&@f?ZD"; `8i2A@䁐XNׯ'KJN:h .`NuwA:3~;cg_Q\/nD)iCeޔyFgggQk֬A5s2`@VJ`'!)L`8v_ 7r p P䴄 9& n"} 7y`z x)\Ԋ- ^`!i8HjHO "I x0 Q0!0!0!0hi5(2 ` @ P@?') 8`>˩UX vw!@0<== o@333#a`2s8Ѐl>  "TLf W\?C G8ϟOU_a>2i\-&C`8pQ0!0!0!0,Ba4!_\ \.HL'v ʀ)_쥠IO.?lXHD]cUz(F'^N9+;ف-{|pR < V[^!f8Łn*p*. Sd@8C06o D`_x>'ؿ<MX`$5++ Ypĵ?թY2xfďi+ /([  ,4>\@l#\H 7 8BOm5u <2.fȀ88ǎ>܃hhh `aBx1p}yng"p\b\L<x p2 W}v)!0Q|`oxpN3XON`3b/N`7=UN6^܄x%0=B[I!/HNB(IdS+\0{< p` 8r 9!<4==6رx)0ȳRX3p9 95`0   a!ppoZ l,"2uA&[ `CrxD ~ `' 1iر `!_77IcƁ n.``D$pbmzڐ#5 `4FC`4FC`4FC`4AC8d! ߹l`@-{3Bxf W^(1o@-wrhMZ΀ADAe8wHLoQ"!&/( G   !0zh*_2.cykk!<ґ\#1]A\\[IGg4FC`4FC`4FC`4FCn!0:C8΃pp IW{ P8hc0!/7!D Y,RJ6p4FC`4FC`4FC`4FC`B`C8˾`e x~ J a3 P xCMy{ǁ6zbv߈My> 5yo4FC`4FC`4FC`4FC`C`PDH xpPPAdOIx#n5C4nϪl<x kӃȽd7!0!0!0!0!FgG!B8CEx9k\ р7j 04O+Ohop4hhhh !Mn ]^DpH NPv4544%^Mg!0!0!0!0!0C`C8,2w-W6bx o4hhhh     !0zh      Ѥ?!0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      Ѥ?!0!0!0!0!040!0!0!0!0!0!0B`tp4hhhhh h      h      I!0:C8GC`4FC`4FC`4FC`4FC`4FC`hp4鏆hhhhhhp4 hhhhhh!M!0!0!0!0!0!0BC`C8GC`4FC`4FC`4FC`4FC`4FC`C8FC`4FC`4FC`4FC`4FC`4FC`4FR     !0!M!0!0!0!0!0!0!M!0!0!0!0!0!0#)FgGhhhhhh&           3}4FC`4FC`4FC`4FC`4FC`4FhvGhhhhhhvGhhhhhhH >!0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      Ѥ?!0!0!0!0!040!0!0!0!0!0!0B`tp4hhhhh ;V_~+++b666vvv\akQQQ0ٜ6^|)..>Z 8{ݻwIϟ>> "CݻwBBB5!0!0!0DC`uw ``k=`"+"""''b*m Mv޼yTLϟOOOwpp(--EoB.^Baӻ?|Lbbbh1!0cƌɓ'|BB O4رc,,,@3888D˲ [~ӧO@ǏpT Չs`X1&  @婛bccwڅNX7nH0 []x>lٲ`͛71*P`gGco4C pŦMFZݸqs(`#Pʠ F>͛ j...X j&  sCC6G[K.lk_`.LFDDPF`߲bԉ'"##̓'s0$G^gy۶mh|8b1V^z gϞ E;N>|/'I܁ `]KacZmٲAxh&pq\P ϼYh0!!;8C/$>3T uW0gݻNC"π$gN +}=k+M <X?H7<0رetahhB'[M <+S`HzxAOOpq/^Al}`ؙ( \D*RChpbLNlty*y%U !Z <u l_g ~`xR8OVn$'ʖlP;@7%J#I]]~f:z($! ?o`|&I`X͜9|0t L l8;WҥK+W g6C<`GЮ=xS\g 9kx[p_`Wm3IӰ]B`NoНՃl,i2 \*AN,LR$lZÇ(oIB03µ^Bq9wx\yJzC`\G0|85+N)SULj`K!Ki[\\HF"!!(  GFg̐C XӓHqqqa3|`4`3bM1F.p#P/2.&if ( `M4i$gAaZHKK[ <`le"/n1׀mȓ{S`m pp~d`ߣ#` 3p)bZ' 855׀% 0 Ԏξ&~HHpؾDS #O{M64pns#b @;podyy9pY5LNp#+p3rl2\DB{{Uh+NbΛ7YO/ yf3ށ~L8.]ǁ, 0ph3Pp,hbX`םpGOvܞ\L!KՐL0/0}GsK|pp泵+޴iQ0!0!0` Ex7+sssC2* v9u64r绀K ! !䥌$<6XVK)ON@F]G`gq͞=k GN@f1VȭdJQ`8}d,!X'V{8U%Vb=$(7`'W獘aF>e؞ӔG>&)x[k;Ux cv ځs5E E6Q Mp> Ƚ\rM`8O8тxNgYd`8U%Bin0`56g!3_Ho8v0He˖!' {O` s` <b@ pNu~3pXL&&^1HIJJg]A ;MLW8 q9p(   Xvw{V70]FCZwO),p* 8Ea !u7'hOlsdLl4 x*! n۶mMldug [l 4؉B۰9m4Aش3_ l );iC>8Y%h3prG8XK ph\1/06\ŐdHII!h9 zWo! @;8;p]+` ) uvDr4p=8 \\?m4`)ػ!` L1z6oLwq$Q0!0!0C`bz:.E>h a>|Wddcm?@30@68e+E]MR πD5KzK<`,spLp]p3׋5c8 +de3~4BPg \sutD &f!~Ѕ,\tgl#APc nI.kΤr8 "䭹ܔ\^ ,=|ڹ p덁Kıw`S$AL\{e{RE4K3'7Ir`@ M-cu d&88ïIѦ"wɻ ; C2g \ ܿPuṪN@-6Ggr[Ȑ[  Wp$p.sfɜU.p(R`׀\`v NC \p_ /^]\'-0`jHR`(`@Vʁ_`q`hwTOܺ ܡjkk O `4FC`4FC`4`!0:CHl!9 7^alYhB`@S+'[{Ttp n p$gOAt?E YĐfo|> !RBbf8l߭ekRn=;ȷ l.C1: n$pf+:F`"_|,#&0@A p{!IT p x 0]A3xz@5^-B`ֆ\Xt"0縠]zS>KفGXK9A`iAQU@؅&-@M@{0WWg.WF"J Q0!0!0H!0:CH?Mȣ8 #Q C0nNZuI|:.5`wB: @ IYF\~lY3WI CH|B`؊'`/]Ⱦ*.$5C #SNs061@I Mfevz؍D$~-7E<)S-:ȏp*YA@[&`<鰣xʔ)'8A^ȓ@\!k+Ā)ytX̒]R)Kw/D[<p+ aƕ} 4=X)r{>(   <9ao*`?%0lUϒhh4Da[$q`;8tp  0`S ORO*`; h,|V1FvNAﮠM d@aAj0;N1 8Ih9N3]h k 80yB_b` H?tTL[OMC"<L[3 /N %`U0 FC`4FC`4Fpvit\el4`8/H8[.9F`w>`}gϞ;sbNkm/~A M1C$TpW~&mwK[0sPǟ݁ w<0q!_AD!$lvjQ $3,un4 \^>^0v {G Ld{ 8Q\ , &9>;ZXz1jΧAƃC>B`o5w3B6x[ k.hyv0`!0!0!B'w^2`X =py!c`Ч:1Hp;t0)\`R!3C{qT!v0g)Rec` 9l!lnz>O [܌ p`6ā=bfm!'9f!Q  w2``oÜ'/D>!f0k!$X 5'8H,{9!N` ,KIL=m hh$F;4O NGC6x>a0i5tB0< @7 +w'"An=tP͛`D?ڶ%d]S%h4Y=p J~xѣG$%CV\PGS!?#!#@#*:` G0WJ&Y) E$,$"!$0yFS#~u;EπL<x-P`pH8q7OAAD0Yߑ#'̸ h Aq h k-=B^T#v t1c:x}3Q8{Ld؀t ΥbGt^d΁L0 ;;[%;׈"L=#ݺI0SuUUp np* 4$##c֬YpӀd>EGC4pK6Ubb" A >+91 crրU1Fhhppapxd91C6GS> 8@q]vF\{NqC6˳goh|d`k`\#\O|z8F8H Cؕ1_8FEp1d[ EO+h&rp(p"BahhhpXm ˗/v-F~Cn\N`:~8]Y.JL!%QE [.]JvZYoWaip*d j=}>ȳ!N4#4&&#C ;`S7/!wX\B`oCn5W k%>`Nnå8~ob5 ր4!E# tTsp*BL#ZS`'-- AGU>nkk&ICfן; , #@ wWNvf+FIt&^ x:Sr/?(  !0!VxN p dM&px4 ~!PKh}z> ;!NP2{ E^LtĉphÆ $ !P1 lׇN0(;px(:9`'8o8p3$p'% 8J\.@7602`>ԂzNh\ʩȇxs8QlW3y4&1Ţh \_s4v̙X6x&0͝;WwE`L0SR--d;W x#?p)Y9UhV`d,0W&V Oxt0:=DO&/HyY#pQ㸀8&jnLZoo/@NB,s f<(  I!0zFq/2J[bk2bp,v6>ɀK6D%pz.d$9(V"`#x>D ؒy64CyY$k)qh;MܓSgΜ` H{;\ah{b9?=6&ި 3Nc`79(N@7C+;'ϟ?c! wN,pJ3 g^.ĜD;r*!R`9 f#a B9@GOE;V8w$p),9%OVJJJrr2V oF4Ѕ8 yl-@?A㢩F+02p0k/NgՀ!?pcpyz 5-@w{t5h 7G[ \% )p h#rkd Y%K( g`&;F71n${KSOE^9 `&-`<78# 999F4gLpFrkpf0@^ ׀ >r '0 FC`4FC`4FC(~`;@B^l=U YxЄX5` v fT,֓!)O%%%p{]8?@^_W`3g2h7pA#gҊ:@y_yxx]pQ"sl3q0!*=V 1GwqO,MhHM@g4r0 8 {`y#C v!oG0t6X`J|LNȗd7#y>%. $p)~Ӏ[gopd0OOU.ND^xF:p5^T!p ك0L9On1`)F1 \1 ,؋ =L5XF.k 94r)9 kX$&@Fh /8 Y ̞@$y0⪀3EFhhh28Cx6 ?Z8D9dgA쀧31٪ `-3$GCx4FC`4FC`4FC`4 k'FSh 9ehoRhcQm4IQ1 Gϕ    Zj|i]Ixp!hў$KAw%!_m7hUCqA=!0!0!0!0!M!@fw:M~G\WM^7c +c3 ^85^ Ƶ/څT`xx,78z|hJ   Q.MZ#"A| <x=U xR N[9$]6Aie8!0!0!04 Ѥ5RBxGDDܷv6D{ O8qIyy0 8R8+x=` 7 o};G9m4FC`4FC`4FC`4FC`hp4Y(//"{yyTYz5׻olG[O;FC`4FC`4FC`4FC`4h.M#(:;;W{/R}6AomllFlo>CVz@.6!0!0!0!0#FgGS NiӦM>8 `!0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      Ѥ?!0!0!0!0!040!0!0!0!0!0!0B`tp4hhhhh h      h      I!0:C8GC`4FC`4FC`4FC`4FC`4FC`hp4鏆hhhhhhp4 hhhhhh!M!0!0!0!0!0!0BC`C8GC`4FC`4FC`4FC`4FC`4FC`C8FC`4FC`4FC`4FC`4FC`4FC`4FRFhh|w$Ʀ00FC`4FC`4FC`4FC`؇H>)6o޼wޔᑾ:xbGˬ ){ҥ\` yǏSRR !pŎT''Ѹ$v_L_0;@ZMM ~1/_6Z޾}ˈ囪*}` t*@hh !0:gϾ ׮]{l&޼yH]^^^***Z6m ,UO> lZ[[!%mܸ1((X8q~g#G~oH "C ֯_fhxp ׯGFFɃѸ&##JgϞb㥢BOOx3}*`خ@ndeewwwccc2\[[ׯ0Ͽf͚є3!0CFFF0`W 8V̿Ѐ؍C<8SP[[[LMM?~!0uT999\\hX0Px·_pa4I ɓ'ӨQ]tHǶpFoo/+cZaÆє3!0CaD}.Xv-Z8Ϙ1%֭u\L6 RJ!0k"i4p1 ** {(&pΝ;>.NxܺuAwލ*--M-$sh׮!PoXXnHLL$nnnv !# !u ]]]+4l3ׯ_i* U}G%;UiOQ0B`prr&''[9C1,C?+Wܳg=z4 !o߾yG=z `Wy pyphj!) 4NǗ;&vɓ'N2ӧOR4)g4FC`HC|w^NB.LLLJr J`ZYYP I"bbbӧOnonn \ ..<AKKkH !x`֭yaph  ;F)`9k D`xf&r(Ka` X[vPIݵkWVVI'3|Ѳ`4p`UHx a&hÇޠhpZ! yV&&&۶mvf233J`kժUğ2 liXGSፍhjdee˳1 灁a`?]Ja3Bo4FC]';XQ4vф4C% rpdtx Y5 ,M@>Kx,pܱcFCf46LHm^XW&x4^`Gnt0DѴ4!0Ci'') <~p4FC`4hW]80 "x* GݻÇф p}6jY\?Fk4y%K`^P}şjtuu0t?ps1*pqph쏆hw@՘"g4FC`p!%2-\u@rx є Ѡ AnpÀQqq1<8ZM '''-\ nZG3h ` 9!Ixܿ$>p _G. $A}n|4[hW[ZZw2t*C`H?DOC>x] AX~5C=FgGh `ٷ̐0XZ <,k8):“MF-[nmz wjb!v{!dF;d4FlvGhH ٳgu!3므3iC7 |< <OZ}͛7fl!rd` VJX `26> t'oˁW(B$`CX @|`OXp' t0 O:34 GVUUvRxx8A*Cߐd > |wH |]a5.p ?;tе@Z` 2 l`Kq֭[̙3i 3$dC~!$Y'0v;[_MsؾZn:@{Z sss\ !`O ou g؇(&d!vW)U, LhB`J&fX" upCփ6BD.0130.3D 01 z %`sssU``,ǀa X2`Pj f͚\L(tvX3>PRS80}`NC !k0V@ǐ`!0@l!$U^0gÀ}BC0 >s I&nCh0AS#0/ddd9;@OA:]@OA+]YW>`b``WXCFs ( 4.02#s!C4 8 #n"^`oU@KX߿zpFj[@Ȗ}BdK -;˄9C! 7e[k=s|2(3/ tu05RJ20Ɓj !0cԩ+]&`WTa@2S0FȽg@urv"}v]KĜ`NG[!̻Fkȅndi(pjy/0 AJ``` #pyW̟?r-'0.kLKO =ڊ njnC:x&0\H\>L @u,~Z) }fd G ;555$9y$!986i$b)TdvFh v6 ~`>/AptL[\!^}g 8 _WAVg}H :NU+61lsm1Q;6@eh` ؈ >\I.`~d=$p؂-;rȒQ`W4DL6hn:8Q s ul=7j8 ~.o5%LH`8Vfd0N5&L`xr 'NZdjZ J@S4Kʀ]PYJ\vl=c&]`B̸BFaBd pɓ'IMw 2@m"yŪC30#8p- ,+К}ꁉ8LL-9 nV24h&]bLF`vw!K.Nρ́y  Џ@)`.@Go N#01b{f`Cfx H`رg q.VXԈV 0;,ho>wD2(F+؁?Hu!p/,\#0 ثop8胦Ɔ`2:C0 FC`8hp*d8 Jl`:x`Æ pv[vv6fX"JH8!Z`;͏<18$Cy6\ 84 I1;pAA޽{it`|`'lF B6W!p @+D5>2`*vԉU&VKcZk|ժU@Kӌ,{Ѹ63p( lr0I#; 8@l #[dtWX S Ǫ1;Ov,;CsP׍bBWTaC^|\o ~X2Zef` ܱB3I`4FC`(h:wU`KK Uwupe$u<n G Q2#C\;#q՚ۢ痀c4!`8Po#Нxb]  J{&L55w0ՈxEeٜK;0 `;~]XҀ%I K lR7  0yZ`_0> <8BP;Q5bI LbXgX<+8撗\̂=q&p i=YBd\H8 (- x+pY`jU8$AÀXu`% ,R g#N5&%$$;~q(KI Q 3&-NYH |/=<c.pU*bYP\<<9rSTqpY,0t,p.X`,`fC`4FC`P(4!B 8Gs+FjY=qjFޖ,"?`OXyC'|0w?ԁN0>1%f;8 TpF /h;a+7i 0RABh?ȭHw7H`/`kFj=ddY`h)5~K}`Nh pE`\EhNJB5!61Q֓hAji nœ:NN}7 Iܼ  Giњv^hN"|<`[1[|Y < { moF;3L 9 DkR#r?\@bZ3U;<Wr|CSits ڜ b`#)h̻Mk "9%0wy{$6pH]~LX1 4FB,%?PXf n)0_Qˊyvqy8C<[Y֑FǛ ^4\@d|K`oy3!~k8~0ePסV `4FC`hpDpd7<iևPBhCHI ,`8 %x8}TEf#j`ߌ 1nMwb\. woy9S˱z'00Skߌ֖"߅@ԅ9C!D E 0Vl1v*1XN`Box\2 MX$^|HgGzOɮDv!]!( KFK;d8H1jMb5x֬YF?܏u!ۀZG<7`M|6Cc^HCl/@;5Hf xp* ~9;IԵF\v l-'p-E[I `b!sy!;4Ђahpp8 es @!/Dv\t5C_$?{;BY@ ;xr,p,(ֿ$7X{w1b`?2p@x`p*`{ XFn'Z*ȊQ~0Fhğb>fH{ѫWƪ x#| !>zԣt(#pBޓ\~I%TLbyl%^b+@A>|R))`x,vND"r xp<}x}l9*YH-c1FLa9))Dnf.N*v ϑugԽ7pbx&륂Xú]Xb !ĴX+/:'vTżxf7hZ@vbC@ B+;N**)2e3 `4KvKL` D00pzX!UKVU(APe0 & !vހkHXw By.ppy3c].K;v-v}T0 `z!;$Ւ'Dw'ڂ`x I !D (Rg)ܭ<&C,鿁gH( !0!,poF-p9py0@;kc#]k'NXϻ;@?w @˟>"X_>Cl\?L!)N)g!"F0-b>wssCNb6ŀnE'ِ;wW xk8xNf" 0{w$|.V!t !$+CR ^<8p#P{ˁB(! !$8…!pހtp8Iw#_{g6rCH( !0!,ppBB Gh'C)\H<0 ԍ'k0,uy!&֪*: CH&`m=H::~)z1HB``V'* ;0p(`p= `U| J !5vd8C< !pN8&lpg2p0jDWS!0CmC0 FC`hp!Z sjnn.p  \N>%-復f/p7?&?*[@kGꆯ_x,D6BOa&@ "R~4.4l{MΕ{(6I70O 9K h.$A`@! ɀC'5 ,+dxI0p )xADqi7=Nlll,a'530ށ#6 hI(I`̆A $]5  Jna; p F; `4~vGS1i!Ł>qJh"pC8 B|E@Q0ܽ{7u@W*W:+Y^<6lXAd ua&;h0- 1]|hgLKρ yJ؄Bw-]#7Hap1n^NH30 )`:'''Za' d` ,u \C CҮNcEڻnF<LpzyL# ڂyv7vSİ3+C4Xkg|BQ0C?F!Md2. R < K 888`va \IZVV0nu(peʽu g2àxה p`[Jiii^(pbsǼ.R=`ظD6yLE;nxC8<ŜMN'"0lNm_RA Ka`8ϛ.GzzzVbݨ |H^X"8Yd ` `BRo#U p=,+{@7`M\x>t c+iq.a`!0C<F;I !GO[^<`8a2PwC`xL`{v@Q+A:hc3!f hIב9kmf/hEJx^ !; ~j[Yh Y;-B`w!gH2pZ Auœn>Q[\\  -́3d ``W8eׇMNunC\f/pU?%Rn*ءsz.7,K&B 1;t!?ь;!0C`C8,X`m4!^<xdHPP-- !PZ>Chi!7z-R'<Ǐm>`m XgB C}k$bQ4K>_1  16]P&K`T *&!f]!XJ,\H% L,ZY \oSKF Z7 p_0_?X<7bղ`@I8< MpĉU:`0 (JFIܿ8GUk01< -x9yb婑IN%%%9*48< 4xʜ0a2tD: -datݭƼv#dشEkŵ#tqSIh1pxڵk :8M3}34%J9 ]Z kJd7Xg0wI&H`a+!NH ha!8Pr32Lcx9./o)pK;"JDk&ܪDaBkMu!,՘@)Pĸ8Vw8%ќlj/.i8I`nhg.Z `+m٘L/s &hC,Ex ' =z<\Tf£K+S0Ue`瓁*1QOTy C#. pK+?=6h%}`쪭%m^c@p]/[def QX];@1nٲx1%pP 1W^@[\䩩IE[c[n&i"qGd' [,pʝ;O!!0 FC`4zxCs ؼ<̀Znr X̲X_2/Ua;p m>,]$y!P7rBZ$4R#Nۀ} ^FER~"T~cZS8 7;<`v?Ѕ x8Yu~/y "H/N 50zwZ@wF$pL`8n)0dK w@{O[JD  x<[FE, NZ ̧Uy&=`1xn>d)<1 86E‡>TQ0dN Ԁ+̀#ȧ 0Dp٨  2Xgs/LHx؀|p,0 b S.X"_hp +X,?6#`)He-b0a . +@Rp 8O I&3xzXJ'ĀOO9$CBcHNH8X[xX6`VhI"W#b2X`}"a!0C:FC\9Hy\ſ@8?G":[bK "ƍ0nB̅5ZH=*8NǑp8 AI5ܰ@^nTb^ L~5- p'أXZZ? FC`4r!$PZhY R`sQISnOF!$F+x26J8Aj2zqq j+QQQc@#@cسx< \^mUDFn%s&p+/yeAp.~C[+V8th)M "r3}BK 1=EB d`'`0Ws n% qp9d M<#$k%T8VZH  GLJ`@d-Kdb`Sx^?%9ȦR>,nSBt1Wwcnl!X|J̡s]RL&,$ , 8* L<$ ؜+nc?'+dV8Ƀl)3cHA,ɳ8lP%N^OF 8v pDBny`Y vC0Y"p#^A&Z`A #>!pm*f>:b <XLp!0Y/ x[#8%M  %'` ةl$!"a@.v$/p 8"C|@O8$c]b`P`?p̀K< b Pэ2 1b``-1p<Iq`1 S|:h `:a \O'~J'-6&dB]PV$$l?8~d3N<GG@rpIF0]GCe[ާeE\' ܍؎7T` 8l,X! ` 744  !0zh2 ah0'ױvY PD2!0!0!F!M!0Cxp>y.nCKD@I^BNGc>!WJ)b4FC`4FC`4FC` hR U-ZDˀ-[<9Y/鲣MngB6x'p!ܳw4ahh h AȽA P{{{!0!0!0C1F!!0!0!0C7F;w4FC`4FC`4FC`4FC`4FC`4Fh!M!0!0!0!0!0!0BC`C8GC`4FC`4FC`4FC`4FC`4FC`C8FC`4FC`4FC`4FC`4FC`4FC`4FR     !0!M!0!0!0!0!0!0!M!0!0!0!0!0!0#)FgGhhhhhh&           3}4FC`4FC`4FC`4FC`4FC`4FhvGhhhhhhvGhhhhhhH >!0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      Ѥ?!0!0!0!0!040!0!0!0!0!0!0B`tp4hhhhh h      h      I!0:C8GC`4FC`4FC`4FC`4FC`4FC`hp4鏆hhhhhhp4 hhhhhh!M!0!0!0!0!0!0BC`C8GC`4FC`4FC`4FC`4FC`4FC`C8FC`4FC`4FC`4FC`4FC`4FC`4FR     !0!M!0!0!0!0!0!0!M!0!0!0!0!0!0#)FgGhhhhhh&           3}4FC`4FC`4FC`4FC`4FC`4FhvGhhhhhhvGhhhhhhH >!0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      Ѥ?!0!0!0!0!040!0!0!0!0!0!0B`tp4hhhhh h  Gŋ߾}    ,Aj#NN   L)))}}}EEP    !0B;^zǏ!O/_<ٳg@Z]BI0u]DbL522266!F=pp*6 tѼ ;wdddڎh}vwwٳ988x`TWWh !P[[`f4}̘18#bgg7#} { )..%+V ڿ?=⠩ޞa00dggO6 rrr`  !l2`o… X= 3rqqqvvIb4FC`pCzJ^^966v4qNNNI@wwwxvժUo޼|ׯ_o8 dz8@{\{8Bz ?KJ={ D[X?0%Ԡʙ·≊jd7$Q!G6G2`۶mGh ,`uuueɓ'Gh0 ^ljǎ<\C8)<+ wgف#W\9s&nѢE;ӧU9XCҥK3\z-A 455N+._j*w۷ot[yy/߽{rsR a" XqGh  pY8Z!=5 Т;''vMMM)o6^nvP1F***pRRR#Q Cm޼8YyhRA.YfWB3`0g̍20Fh غukDDā:pHK͟?  <˗/?>|`Q׿ F|p(p>_6m:vxS+fZjGMC`٣46p3poa @]Ԛ!ĺ^h>U. veee1Gd4JKZ$TR;{gq <|^@`< / M@9w0\D$h!#!AXx:0v64Z4M@9r8`ccc<J@>0ҁH`@/= #Ĭ2{auQ@t} ]{ RI`\`\Qc` U>hn8X 5p 6n5lKMo@3)2!0FEv p`GG!څA0s.O%Q,+pT LB`lR@{dOa$LJJ 8 ȂzXM'0qbmBCAa!4+ `&0&/Fl` +I)\\Rv wak( q` Q ,!hk.$ `\0aP`&`+́AXư0xNNp h`b5\KKZ FtcXU1147a8!dXn655|@X ` , p2V\X`VdOa#544R.9 5TB .6 c^ _ Amm\111`"Y`ht;Iw: AHP[E0  Tl;Hb0 bA\t)p0ƁU +l/$=@GXq6txy.V?' 'M4aJ l8t~$)m!Myx<`m Ɇ (UUUU]]M `0`=\6Ȋ4P:@Df0 .Hk!N&N B`7\K -w.SȾƊ̕v]0ϵy!v`Y lAHH#`, 5**,?A| 4 bbb(Ƀhd ,N 0Rxw @C!֒mmmu( LK2 , %*@pHxg#~`t3f>`Cό.$Ą"d6B5^ @`V#8@^pѢE@Èe@{ /HF|u_@`ށg`0Wbb"x,uשC#WlrO3`u֋3 # BBa) ȸ VCnJP$#%>} ,#F|IVuHTH*XC2 \d- @NL Qnh;i˖-7` BzL `Ȁ 0@ASB20*((d''j֯_l>Wk`7ؗN^^Xy<* u{G(&NJ^#茅` &NHi ~` T ( m6J}!|`S 8 Xr30o n#iy-'&+`l!B F``/T~.&2e pS'D 0!3uZqiCtDGG ,yH.8v1;;{ڵp{c0؁G0e>/g^XK<d0AI+؁TX[jq`w13 uMx ĉ\R(`E ' 2 7`I=+2C@3\ g`8} j,//"8! ؕ C@+f>3z !u !t!]20,Znv `3,d.%iy\[CXbܹ&8tc $'nȤ ,r`k XX \q z HKR`l5PxB`Wm6!۩aԁq `+9`X\˥F9Sp=n0&L!Jd lLHLC +V! P>"` %,ma`C7P` pU-a@a 7F` nLamcUvN+--%&HdbH[2fςv&`o m[NVS-F!PY` pƜ3e00mƍ1#P"&x9$x%=pX`pA,%8 ,0&""kz$P10:} `I XS)p\h0. d`jS;2xp' h9@5pz˅&$ 6`Kآo5m` j!) , o&p0}U@8 8\чg m OG x`=ظ0:6.68h i.1[n l0=FaEj) a5 $: 9IOOǕMfRCpw"p{(eGа'pAפm0X &o16xh pl l<`"=n*8L^(~Ӏ `BMZkipBl['#'j R`_iCIZ|~F, o`gtYT Wi&07 8uLS \hDx. yk..!5.DW~ DC!{CAbF=';s_ip HʐKaWn(a ,:dXl*f-[u ZvI!lI$̟?O17Bit[Dxwz s81 %,%BzH!Ips  M Hj._`/ 'wAV@IDv{{&~ `Tk/<&Z" l2ݔf۷cXG7Y6@\!+ĀZ8#p)(ŜC##B2;`)H2~(uf=Nkv-H28/gcKPgo]k8rVk')2 \evKpO2pHCtp=<0E݈ĵa<*b- StX@TL!pp6I]/`](2,.F-,gր Xs(!\\CE>ԩSqmlųޝuKY4, 9-ZEif2G^&r`g@q<%2u90k5ӹdX  1\`58k<ԀSZAI,.ÃF$|BOGx}`Cm@؞úS7 \u \/Mh 8Mj{n>΄`M9 gle6Y`LQζvpݺfN_k>V{am;xNw<ZB!֝!a=8 U X*ρv00`-;Q9"yXK !ðs#Q1%ɻm%)V !c.plOxWe$<'i>pa-!g ! gk" C898;C7XFP`juP'1oMf7aWb 4v$]H:SE#aX`Y'%X,h.BjGq]H"f\[7`}tg TٿZW8pَ`>m8A[1dt AbQd?Gvh=H3Yŋ pCP B|L`_׮ ,? XJ-Jb׊D .I{D-\!1 k/(E Sq x}f 1V`lӦM%{ßˀ.%o1*OXY`u<`MEEeDہ"p !u`l lE`b-ɎD{bЭC\7iqw0`v$B:,&$!s@8CFQɓ'1;wCuY3;ed" pp υhF EKrE[TVG<B:!0lg !pH 8܀C\CҚΝڍ<*((3df2 ?0 :H6р}۫ ʁC`' H/ [ŀM\g9Q@2Ȑ!>uCB)OTfIҢ !gro'xi)!bl^?Qa^\F !hV4?g*Re('֎Rŀ<|@J#7t b! k!eKtQ7 477v]2 b&:8{ В"pX"xƍbI`H&'`[ 27!dC( ~=x#{ C8O$FdnBOٷn bXCy=FX GQATbXN݆u UN sn&A`ܾkzMdP ;z! p 8Zl4W0dcf`6 R@%"dEH\G舉JE_:6`lkRXC-S0 >wpZ#j&g*0!g4k7Sh \<ׇbǺcX/לSu\ۭOIdP707R -X9@⚂va A`t! x \v7wcQjr[ >g%:OL}lK,=fPC 5.X&9J'9y@a-RYc ġdG;i x>fkx> 0uݽG9Lx2`e_lBB{8wlRAį<.BUr )"(T B1% !ܶmz\ <|NE`>kd2`/93cEᡊ+(juqmzd=3Eap8>K,=0id(.hp! @^xXI*ءM1paU By`8H!ppXcRq!K@!ӅC\drmy`h`z` C< m8=ܹ׀Ma1ãw@jM-ClFb`Oƪ%` Lr002!5`%%%πcd\ !BbK`px5p ? . MM@VB@5YbΏqH$CldKsB&\.XG 3V%nY`E\8!.8 0"`ӝ p7a`1 {h&R*+{.VvG'͘1a& SRA!p8R3B|833G X-_|DE4pTGGpOKK Bmmt?!޴L_+0|κ}-.7bb-qȎJ\n,(P23 kC8CH#x:s_h1J͛5耇׿ U#GhZp.).V Xv-[F `2P7%@K)~4%wVIMps]A&@!KF)LB!dGgGsp55iӦ LG7OU DNc.KΉ;q#!ZpkBwȘ!z|vvY3C8 TEsp3|#%0:;TC)g(rKePhI@7 l~.6Gj:47`8?O1-FHOP&`8p!""aCj`ZQ !0OUaqTYE:IWF%4MZfx=`k[8w iBHwm̘O8A\u6iL酔xps)Qz+#!!n&:֭Ux1ӹ^,U!(@ K40"HnI' ל$gzp\\=hp4 L aޒ,gJqu`!dx>p* xHc!p$=gaXz8 )pv 8LaobB2Q܁X'XBFBUG" Sm}՝hwOׁǍNd+lRe(0fqui [{1'B\3 8qxv[P7$eF<3$Mچp#CִYۘv3@E@ud!(.ǺA ep!;TBɪHB`s?W]EEIK€U[d$i\BQ`ZvlpךL"!{ZoԎ+@3RxNPPp-b;lʒQ=8~ܛs\aMQ&ApJF\7B@u9!6^Ix:UàΐbzX"σV'pu) LAAdW3n69<:Gxnni #f`cg\0py$60G܁k_`op/f }`H'3D6ĘghV /R AG "^ņZη684`H2<#M<X}8SbD`.6߉w/pol߿'x @\3 "` .%^ր'޽4,a08րp$Um`ׂOE0:𷼁td .'YYY9ޗgQ!k08 QxBcmih5B ?pk;‡P Rp7\`5y :  (N;``met5l.%kM1"Ţrff&iz@*{Y:C4+'=UO_%)p /`<(F!ߎl;̟>}rw='V5'bC5iǎ f&jh |` ؂a%/V-puzpin;Vc++Ltp` 6<#Pew"s\XXpZhŸ~j)0΄1+uWr+x+{`+~\ޘApdb w'!h0 2ep8bj8q&Uٲ ̀FH]8È Uib,Z`M@WMkRSh1O;.-_W\4ƻ6}8 cD0 sX\f\nt4a 5-% |A"` {`s=ϽeC4h^'p hXt.>]@A )Dm_G90;0r< Xn+ :"R @( +0{SA#ի`< p8.w"!. X0ҁ$p$.i8 2CH="s ub00A <x>>퀝0t6 @yu)%ph7h> qM\p%ظ'T}[^Y0 {8̏Y6 p|XGE4(9DEoXAOn!kB*pWTt*F9%.Z< ;I*`e ^s[ % )@+;B:OȔ2v<.Fl2jX`0C8xv39JE:`   ݁gpI`zKXU+֌NQa`C  ﰚlEYs+=`c`lݚp  r\+[{0`O @A >[`8Kpŋӻ{8,Bf|@OX Mp[!SBz3h`ͅN41w#07'b `g T,ޥAdILd?pz R_VQL@]Q<`#/d})_̳UOڶ/`gWFcA=<]5h.3,1ةN,hn 8<H;`Oj&"1 &9sA`a"+STV:l1QlkL&$C8!D,U0$>'h*9V!Q`^2Jۀc3ng1&MPd@n l5!x3;CKF3#t.\4'K`£d^`\ Ԛ7x\/ #IK$ixm}G`Z# `sq2,up.o&p(i c*{/SkRsp \ !<4D7s5p xpx.u8J]axx(p/ \AFP EBe\ƾg( 1.Vx Hf6e#4zL(pl7`8IUB<wT ?ْ>\grSq'p='yPq+pp @"9(qpF$pY2p 8ITyf5 Gk:dDp7p:8f\k78;p)0t#" p7b ( %>|(pe,-Bj:S pX*n.GQ lӢ+q'Ce jE"HObAH=v8(/+}2΀DvU ~/9l} \FpO& Blx -ħ 0x!$)f(p x"4C/@3ޓ;`c*2uЎfUd `lWR"0,OM&;@ϊ>`n4#<{mϑK9 +9Spi:Fn&.u.I-ꌌZfY)YQ$p`%opF3@w" Rd`syCid{PȎ/`Yn+/oINS[YDy֌1A:gi| po O-)86"}Kd\ I6' TX`Fp5]a3@"xp%pt*'~Eiq x\r t p))' @p9%<'3؁сQk! rANT9-  `q `bW }xpp!(F `cǀ P =pHWC3룀; 0=<<@Gdqp bnZ``DBP嚵0L[ w$@s:`-D? k`Gœ< MHH$%C.KV@դ1rM 2]b`A<o'c( q`~/ 4pZ&$9Arb`E6Dt/W&)(50NFa]*fC0 FC`4A@ 6F  %ũ5&5`FC`'7AT Mh6!0C1FOM!0!pLGMhop4q3b''0 *!0!M!0!92!f@S_-0GCZ!< bhp4]h  V0}Eۘ>uXh쏆B8N\S   p  zݻw߻w/;;ZN##c׮]d8!VZZZzzz;|}}82aaH!S:y3gq?p  TTTF#z4FC`4FC`4FC]2:FC`4p+0 M<<<&I11:DC.yʕݯ \`<M!0!0!@=Tf4!h5DDDTUUk+pߠhopHf॔{@׾[!0!0!@ zҨh1C\I8C7']S/s|4FC`4FC`4{GhcǦL66(hDXx1p(~_,]ݣq=!0!0!@ ۷oo߾?a%X |  nvGSh` _<>|9P! /l&;w}Vn-FC`4FC`4FC!0!MW!0!0!0!0!0!0BC`PѤ?!0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      Ѥ?!0!0!0!0!040!0!0!0!0!0!0B`tp4hhhhh h      h      I!0:C8GC`4FC`4FC`4FC`4FC`4FC`hp4鏆hhhhhhp4 hhhhhh!M!0!0!0!0!0!0BC`C8GC`4FC`4FC`4FC`4FC`4FC`C8FC`4FC`4FC`4FC`4FC`4FC`4FR     !0!M!0!0!0!0!0!0!M!0!0!0!0!0!0#)FgGhhhhhh&           3}4FC`4FC`4FC`4FC`4FC`4FhvGhhhhhhvGhhhhhhH >!0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      Ѥ?!0!0!0!0!040!0!0!0!0!0!0B`tp4hhhhh h      h      I!0:C8GC`4FC`4FC`4FC`4FC`4FC`hp4鏆hhhhhhp4 hhhhhh!M!0!0!0!0!0!0BC`C8GC`4FC`4FC`4FC`4FC`4FC`C8FC`4FC`4FC`4FC`4FC`4FC`4FR     !0!M!0!0!0!0!0!0!M!0!0!0!0!0!0#)FgGhhhhhh&           3}4FC`4FC`4FC`4FC`4FC`4FhvGhhhhhhvGhhhhhhH >!0!0!0!0!0#4F;I4FC`4FC`4FC`4FC`4FC`4F;i`4FC`4FC`4FC`4FC`4FC`4FC`$ hz      "KA'IENDB`uTox/third_party/stb/stb/tests/sdf/sdf_test.c0000600000175000001440000001102214003056224020277 0ustar rakusers#define STB_DEFINE #include "stb.h" #define STB_TRUETYPE_IMPLEMENTATION #include "stb_truetype.h" #define STB_IMAGE_WRITE_IMPLEMENTATION #include "stb_image_write.h" // used both to compute SDF and in 'shader' float sdf_size = 32.0; // the larger this is, the better large font sizes look float pixel_dist_scale = 64.0; // trades off precision w/ ability to handle *smaller* sizes int onedge_value = 128; int padding = 3; // not used in shader typedef struct { float advance; signed char xoff; signed char yoff; unsigned char w,h; unsigned char *data; } fontchar; fontchar fdata[128]; #define BITMAP_W 1200 #define BITMAP_H 800 unsigned char bitmap[BITMAP_H][BITMAP_W][3]; char *sample = "This is goofy text, size %d!"; char *small_sample = "This is goofy text, size %d! Really needs in-shader supersampling to look good."; void blend_pixel(int x, int y, int color, float alpha) { int i; for (i=0; i < 3; ++i) bitmap[y][x][i] = (unsigned char) (stb_lerp(alpha, bitmap[y][x][i], color)+0.5); // round } void draw_char(float px, float py, char c, float relative_scale) { int x,y; fontchar *fc = &fdata[c]; float fx0 = px + fc->xoff*relative_scale; float fy0 = py + fc->yoff*relative_scale; float fx1 = fx0 + fc->w*relative_scale; float fy1 = fy0 + fc->h*relative_scale; int ix0 = (int) floor(fx0); int iy0 = (int) floor(fy0); int ix1 = (int) ceil(fx1); int iy1 = (int) ceil(fy1); // clamp to viewport if (ix0 < 0) ix0 = 0; if (iy0 < 0) iy0 = 0; if (ix1 > BITMAP_W) ix1 = BITMAP_W; if (iy1 > BITMAP_H) iy1 = BITMAP_H; for (y=iy0; y < iy1; ++y) { for (x=ix0; x < ix1; ++x) { float sdf_dist, pix_dist; float bmx = stb_linear_remap(x, fx0, fx1, 0, fc->w); float bmy = stb_linear_remap(y, fy0, fy1, 0, fc->h); int v00,v01,v10,v11; float v0,v1,v; int sx0 = (int) bmx; int sx1 = sx0+1; int sy0 = (int) bmy; int sy1 = sy0+1; // compute lerp weights bmx = bmx - sx0; bmy = bmy - sy0; // clamp to edge sx0 = stb_clamp(sx0, 0, fc->w-1); sx1 = stb_clamp(sx1, 0, fc->w-1); sy0 = stb_clamp(sy0, 0, fc->h-1); sy1 = stb_clamp(sy1, 0, fc->h-1); // bilinear texture sample v00 = fc->data[sy0*fc->w+sx0]; v01 = fc->data[sy0*fc->w+sx1]; v10 = fc->data[sy1*fc->w+sx0]; v11 = fc->data[sy1*fc->w+sx1]; v0 = stb_lerp(bmx,v00,v01); v1 = stb_lerp(bmx,v10,v11); v = stb_lerp(bmy,v0 ,v1 ); #if 0 // non-anti-aliased if (v > onedge_value) blend_pixel(x,y,0,1.0); #else // Following math can be greatly simplified // convert distance in SDF value to distance in SDF bitmap sdf_dist = stb_linear_remap(v, onedge_value, onedge_value+pixel_dist_scale, 0, 1); // convert distance in SDF bitmap to distance in output bitmap pix_dist = sdf_dist * relative_scale; // anti-alias by mapping 1/2 pixel around contour from 0..1 alpha v = stb_linear_remap(pix_dist, -0.5f, 0.5f, 0, 1); if (v > 1) v = 1; if (v > 0) blend_pixel(x,y,0,v); #endif } } } void print_text(float x, float y, char *text, float scale) { int i; for (i=0; text[i]; ++i) { if (fdata[text[i]].data) draw_char(x,y,text[i],scale); x += fdata[text[i]].advance * scale; } } int main(int argc, char **argv) { int ch; float scale, ypos; stbtt_fontinfo font; void *data = stb_file("c:/windows/fonts/times.ttf", NULL); stbtt_InitFont(&font, data, 0); scale = stbtt_ScaleForPixelHeight(&font, sdf_size); for (ch=32; ch < 127; ++ch) { fontchar fc; int xoff,yoff,w,h, advance; fc.data = stbtt_GetCodepointSDF(&font, scale, ch, padding, onedge_value, pixel_dist_scale, &w, &h, &xoff, &yoff); fc.xoff = xoff; fc.yoff = yoff; fc.w = w; fc.h = h; stbtt_GetCodepointHMetrics(&font, ch, &advance, NULL); fc.advance = advance * scale; fdata[ch] = fc; } ypos = 60; memset(bitmap, 255, sizeof(bitmap)); print_text(400, ypos+30, stb_sprintf("sdf bitmap height %d", (int) sdf_size), 30/sdf_size); ypos += 80; for (scale = 8.0; scale < 120.0; scale *= 1.33f) { print_text(80, ypos+scale, stb_sprintf(scale == 8.0 ? small_sample : sample, (int) scale), scale / sdf_size); ypos += scale*1.05f + 20; } stbi_write_png("sdf_test.png", BITMAP_W, BITMAP_H, 3, bitmap, 0); return 0; } uTox/third_party/stb/stb/tests/resize.dsp0000600000175000001440000000767514003056224017600 0ustar rakusers# Microsoft Developer Studio Project File - Name="resize" - Package Owner=<4> # Microsoft Developer Studio Generated Build File, Format Version 6.00 # ** DO NOT EDIT ** # TARGTYPE "Win32 (x86) Console Application" 0x0103 CFG=resize - 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 "resize.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 "resize.mak" CFG="resize - Win32 Debug" !MESSAGE !MESSAGE Possible choices for configuration are: !MESSAGE !MESSAGE "resize - Win32 Release" (based on "Win32 (x86) Console Application") !MESSAGE "resize - 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)" == "resize - Win32 Release" # PROP BASE Use_MFC 0 # PROP BASE Use_Debug_Libraries 0 # PROP BASE Output_Dir "Release" # PROP BASE Intermediate_Dir "Release" # PROP BASE Target_Dir "" # PROP Use_MFC 0 # PROP Use_Debug_Libraries 0 # PROP Output_Dir "Release" # PROP Intermediate_Dir "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 /G6 /W3 /GX /Z7 /O2 /I ".." /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /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 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 !ELSEIF "$(CFG)" == "resize - Win32 Debug" # PROP BASE Use_MFC 0 # PROP BASE Use_Debug_Libraries 1 # PROP BASE Output_Dir "Debug" # PROP BASE Intermediate_Dir "Debug" # 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 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ /c # ADD CPP /nologo /W3 /WX /Gm /GX /ZI /Od /I ".." /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /FD /GZ /c # SUBTRACT CPP /YX # 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 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 !ENDIF # Begin Target # Name "resize - Win32 Release" # Name "resize - Win32 Debug" # Begin Source File SOURCE=.\resample_test.cpp # End Source File # Begin Source File SOURCE=..\stb_image_resize.h # End Source File # End Target # End Project uTox/third_party/stb/stb/tests/resample_test_c.c0000600000175000001440000000026514003056224021070 0ustar rakusers#define STB_IMAGE_RESIZE_IMPLEMENTATION #define STB_IMAGE_RESIZE_STATIC #include "stb_image_resize.h" // Just to make sure it will build properly with a c compiler int main() { } uTox/third_party/stb/stb/tests/resample_test.cpp0000600000175000001440000011453314003056224021132 0ustar rakusers#include #include #if defined(_WIN32) && _MSC_VER > 1200 #define STBIR_ASSERT(x) \ if (!(x)) { \ __debugbreak(); \ } else #else #include #define STBIR_ASSERT(x) assert(x) #endif #define STBIR_MALLOC stbir_malloc #define STBIR_FREE stbir_free class stbir_context { public: stbir_context() { size = 1000000; memory = malloc(size); } ~stbir_context() { free(memory); } size_t size; void* memory; } g_context; void* stbir_malloc(size_t size, void* context) { if (!context) return malloc(size); stbir_context* real_context = (stbir_context*)context; if (size > real_context->size) return 0; return real_context->memory; } void stbir_free(void* memory, void* context) { if (!context) free(memory); } //#include void stbir_progress(float p) { //printf("%f\n", p); STBIR_ASSERT(p >= 0 && p <= 1); } #define STBIR_PROGRESS_REPORT stbir_progress #define STB_IMAGE_RESIZE_IMPLEMENTATION #define STB_IMAGE_RESIZE_STATIC #include "stb_image_resize.h" #define STB_IMAGE_WRITE_IMPLEMENTATION #include "stb_image_write.h" #define STB_IMAGE_IMPLEMENTATION #include "stb_image.h" #ifdef _WIN32 #include #include #define mkdir(a, b) _mkdir(a) #else #include #endif #define MT_SIZE 624 static size_t g_aiMT[MT_SIZE]; static size_t g_iMTI = 0; // Mersenne Twister implementation from Wikipedia. // Avoiding use of the system rand() to be sure that our tests generate the same test data on any system. void mtsrand(size_t iSeed) { g_aiMT[0] = iSeed; for (size_t i = 1; i < MT_SIZE; i++) { size_t inner1 = g_aiMT[i - 1]; size_t inner2 = (g_aiMT[i - 1] >> 30); size_t inner = inner1 ^ inner2; g_aiMT[i] = (0x6c078965 * inner) + i; } g_iMTI = 0; } size_t mtrand() { if (g_iMTI == 0) { for (size_t i = 0; i < MT_SIZE; i++) { size_t y = (0x80000000 & (g_aiMT[i])) + (0x7fffffff & (g_aiMT[(i + 1) % MT_SIZE])); g_aiMT[i] = g_aiMT[(i + 397) % MT_SIZE] ^ (y >> 1); if ((y % 2) == 1) g_aiMT[i] = g_aiMT[i] ^ 0x9908b0df; } } size_t y = g_aiMT[g_iMTI]; y = y ^ (y >> 11); y = y ^ ((y << 7) & (0x9d2c5680)); y = y ^ ((y << 15) & (0xefc60000)); y = y ^ (y >> 18); g_iMTI = (g_iMTI + 1) % MT_SIZE; return y; } inline float mtfrand() { const int ninenine = 999999; return (float)(mtrand() % ninenine)/ninenine; } static void resizer(int argc, char **argv) { unsigned char* input_pixels; unsigned char* output_pixels; int w, h; int n; int out_w, out_h; input_pixels = stbi_load(argv[1], &w, &h, &n, 0); out_w = w*3; out_h = h*3; output_pixels = (unsigned char*) malloc(out_w*out_h*n); //stbir_resize_uint8_srgb(input_pixels, w, h, 0, output_pixels, out_w, out_h, 0, n, -1,0); stbir_resize_uint8(input_pixels, w, h, 0, output_pixels, out_w, out_h, 0, n); stbi_write_png("output.png", out_w, out_h, n, output_pixels, 0); exit(0); } static void performance(int argc, char **argv) { unsigned char* input_pixels; unsigned char* output_pixels; int w, h, count; int n, i; int out_w, out_h, srgb=1; input_pixels = stbi_load(argv[1], &w, &h, &n, 0); #if 0 out_w = w/4; out_h = h/4; count=100; // 1 #elif 0 out_w = w*2; out_h = h/4; count=20; // 2 // note this is structured pessimily, would be much faster to downsample vertically first #elif 0 out_w = w/4; out_h = h*2; count=50; // 3 #elif 0 out_w = w*3; out_h = h*3; count=2; srgb=0; // 4 #else out_w = w*3; out_h = h*3; count=2; // 5 // this is dominated by linear->sRGB conversion #endif output_pixels = (unsigned char*) malloc(out_w*out_h*n); for (i=0; i < count; ++i) if (srgb) stbir_resize_uint8_srgb(input_pixels, w, h, 0, output_pixels, out_w, out_h, 0, n,-1,0); else stbir_resize(input_pixels, w, h, 0, output_pixels, out_w, out_h, 0, STBIR_TYPE_UINT8, n,-1, 0, STBIR_EDGE_CLAMP, STBIR_EDGE_CLAMP, STBIR_FILTER_DEFAULT, STBIR_FILTER_DEFAULT, STBIR_COLORSPACE_LINEAR, NULL); exit(0); } void test_suite(int argc, char **argv); int main(int argc, char** argv) { //resizer(argc, argv); //performance(argc, argv); test_suite(argc, argv); return 0; } void resize_image(const char* filename, float width_percent, float height_percent, stbir_filter filter, stbir_edge edge, stbir_colorspace colorspace, const char* output_filename) { int w, h, n; unsigned char* input_data = stbi_load(filename, &w, &h, &n, 0); if (!input_data) { printf("Input image could not be loaded\n"); return; } int out_w = (int)(w * width_percent); int out_h = (int)(h * height_percent); unsigned char* output_data = (unsigned char*)malloc(out_w * out_h * n); stbir_resize(input_data, w, h, 0, output_data, out_w, out_h, 0, STBIR_TYPE_UINT8, n, STBIR_ALPHA_CHANNEL_NONE, 0, edge, edge, filter, filter, colorspace, &g_context); stbi_image_free(input_data); stbi_write_png(output_filename, out_w, out_h, n, output_data, 0); free(output_data); } template void convert_image(const F* input, T* output, int length) { double f = (pow(2.0, 8.0 * sizeof(T)) - 1) / (pow(2.0, 8.0 * sizeof(F)) - 1); for (int i = 0; i < length; i++) output[i] = (T)(((double)input[i]) * f); } template void test_format(const char* file, float width_percent, float height_percent, stbir_datatype type, stbir_colorspace colorspace) { int w, h, n; unsigned char* input_data = stbi_load(file, &w, &h, &n, 0); if (input_data == NULL) return; int new_w = (int)(w * width_percent); int new_h = (int)(h * height_percent); T* T_data = (T*)malloc(w * h * n * sizeof(T)); memset(T_data, 0, w*h*n*sizeof(T)); convert_image(input_data, T_data, w * h * n); T* output_data = (T*)malloc(new_w * new_h * n * sizeof(T)); stbir_resize(T_data, w, h, 0, output_data, new_w, new_h, 0, type, n, STBIR_ALPHA_CHANNEL_NONE, 0, STBIR_EDGE_CLAMP, STBIR_EDGE_CLAMP, STBIR_FILTER_CATMULLROM, STBIR_FILTER_CATMULLROM, colorspace, &g_context); free(T_data); stbi_image_free(input_data); unsigned char* char_data = (unsigned char*)malloc(new_w * new_h * n * sizeof(char)); convert_image(output_data, char_data, new_w * new_h * n); char output[200]; sprintf(output, "test-output/type-%d-%d-%d-%d-%s", type, colorspace, new_w, new_h, file); stbi_write_png(output, new_w, new_h, n, char_data, 0); free(char_data); free(output_data); } void convert_image_float(const unsigned char* input, float* output, int length) { for (int i = 0; i < length; i++) output[i] = ((float)input[i])/255; } void convert_image_float(const float* input, unsigned char* output, int length) { for (int i = 0; i < length; i++) output[i] = (unsigned char)(stbir__saturate(input[i]) * 255); } void test_float(const char* file, float width_percent, float height_percent, stbir_datatype type, stbir_colorspace colorspace) { int w, h, n; unsigned char* input_data = stbi_load(file, &w, &h, &n, 0); if (input_data == NULL) return; int new_w = (int)(w * width_percent); int new_h = (int)(h * height_percent); float* T_data = (float*)malloc(w * h * n * sizeof(float)); convert_image_float(input_data, T_data, w * h * n); float* output_data = (float*)malloc(new_w * new_h * n * sizeof(float)); stbir_resize_float_generic(T_data, w, h, 0, output_data, new_w, new_h, 0, n, STBIR_ALPHA_CHANNEL_NONE, 0, STBIR_EDGE_CLAMP, STBIR_FILTER_CATMULLROM, colorspace, &g_context); free(T_data); stbi_image_free(input_data); unsigned char* char_data = (unsigned char*)malloc(new_w * new_h * n * sizeof(char)); convert_image_float(output_data, char_data, new_w * new_h * n); char output[200]; sprintf(output, "test-output/type-%d-%d-%d-%d-%s", type, colorspace, new_w, new_h, file); stbi_write_png(output, new_w, new_h, n, char_data, 0); free(char_data); free(output_data); } void test_channels(const char* file, float width_percent, float height_percent, int channels) { int w, h, n; unsigned char* input_data = stbi_load(file, &w, &h, &n, 0); if (input_data == NULL) return; int new_w = (int)(w * width_percent); int new_h = (int)(h * height_percent); unsigned char* channels_data = (unsigned char*)malloc(w * h * channels * sizeof(unsigned char)); for (int i = 0; i < w * h; i++) { int input_position = i * n; int output_position = i * channels; for (int c = 0; c < channels; c++) channels_data[output_position + c] = input_data[input_position + stbir__min(c, n)]; } unsigned char* output_data = (unsigned char*)malloc(new_w * new_h * channels * sizeof(unsigned char)); stbir_resize_uint8_srgb(channels_data, w, h, 0, output_data, new_w, new_h, 0, channels, STBIR_ALPHA_CHANNEL_NONE, 0); free(channels_data); stbi_image_free(input_data); char output[200]; sprintf(output, "test-output/channels-%d-%d-%d-%s", channels, new_w, new_h, file); stbi_write_png(output, new_w, new_h, channels, output_data, 0); free(output_data); } void test_subpixel(const char* file, float width_percent, float height_percent, float s1, float t1) { int w, h, n; unsigned char* input_data = stbi_load(file, &w, &h, &n, 0); if (input_data == NULL) return; s1 = ((float)w - 1 + s1)/w; t1 = ((float)h - 1 + t1)/h; int new_w = (int)(w * width_percent); int new_h = (int)(h * height_percent); unsigned char* output_data = (unsigned char*)malloc(new_w * new_h * n * sizeof(unsigned char)); stbir_resize_region(input_data, w, h, 0, output_data, new_w, new_h, 0, STBIR_TYPE_UINT8, n, STBIR_ALPHA_CHANNEL_NONE, 0, STBIR_EDGE_CLAMP, STBIR_EDGE_CLAMP, STBIR_FILTER_BOX, STBIR_FILTER_CATMULLROM, STBIR_COLORSPACE_SRGB, &g_context, 0, 0, s1, t1); stbi_image_free(input_data); char output[200]; sprintf(output, "test-output/subpixel-%d-%d-%f-%f-%s", new_w, new_h, s1, t1, file); stbi_write_png(output, new_w, new_h, n, output_data, 0); free(output_data); } void test_subpixel_region(const char* file, float width_percent, float height_percent, float s0, float t0, float s1, float t1) { int w, h, n; unsigned char* input_data = stbi_load(file, &w, &h, &n, 0); if (input_data == NULL) return; int new_w = (int)(w * width_percent); int new_h = (int)(h * height_percent); unsigned char* output_data = (unsigned char*)malloc(new_w * new_h * n * sizeof(unsigned char)); stbir_resize_region(input_data, w, h, 0, output_data, new_w, new_h, 0, STBIR_TYPE_UINT8, n, STBIR_ALPHA_CHANNEL_NONE, 0, STBIR_EDGE_CLAMP, STBIR_EDGE_CLAMP, STBIR_FILTER_BOX, STBIR_FILTER_CATMULLROM, STBIR_COLORSPACE_SRGB, &g_context, s0, t0, s1, t1); stbi_image_free(input_data); char output[200]; sprintf(output, "test-output/subpixel-region-%d-%d-%f-%f-%f-%f-%s", new_w, new_h, s0, t0, s1, t1, file); stbi_write_png(output, new_w, new_h, n, output_data, 0); free(output_data); } void test_subpixel_command(const char* file, float width_percent, float height_percent, float x_scale, float y_scale, float x_offset, float y_offset) { int w, h, n; unsigned char* input_data = stbi_load(file, &w, &h, &n, 0); if (input_data == NULL) return; int new_w = (int)(w * width_percent); int new_h = (int)(h * height_percent); unsigned char* output_data = (unsigned char*)malloc(new_w * new_h * n * sizeof(unsigned char)); stbir_resize_subpixel(input_data, w, h, 0, output_data, new_w, new_h, 0, STBIR_TYPE_UINT8, n, STBIR_ALPHA_CHANNEL_NONE, 0, STBIR_EDGE_CLAMP, STBIR_EDGE_CLAMP, STBIR_FILTER_BOX, STBIR_FILTER_CATMULLROM, STBIR_COLORSPACE_SRGB, &g_context, x_scale, y_scale, x_offset, y_offset); stbi_image_free(input_data); char output[200]; sprintf(output, "test-output/subpixel-command-%d-%d-%f-%f-%f-%f-%s", new_w, new_h, x_scale, y_scale, x_offset, y_offset, file); stbi_write_png(output, new_w, new_h, n, output_data, 0); free(output_data); } unsigned int* pixel(unsigned int* buffer, int x, int y, int c, int w, int n) { return &buffer[y*w*n + x*n + c]; } void test_premul() { unsigned int input[2 * 2 * 4]; unsigned int output[1 * 1 * 4]; unsigned int output2[2 * 2 * 4]; memset(input, 0, sizeof(input)); // First a test to make sure premul is working properly. // Top left - solid red *pixel(input, 0, 0, 0, 2, 4) = 255; *pixel(input, 0, 0, 3, 2, 4) = 255; // Bottom left - solid red *pixel(input, 0, 1, 0, 2, 4) = 255; *pixel(input, 0, 1, 3, 2, 4) = 255; // Top right - transparent green *pixel(input, 1, 0, 1, 2, 4) = 255; *pixel(input, 1, 0, 3, 2, 4) = 25; // Bottom right - transparent green *pixel(input, 1, 1, 1, 2, 4) = 255; *pixel(input, 1, 1, 3, 2, 4) = 25; stbir_resize(input, 2, 2, 0, output, 1, 1, 0, STBIR_TYPE_UINT32, 4, 3, 0, STBIR_EDGE_CLAMP, STBIR_EDGE_CLAMP, STBIR_FILTER_BOX, STBIR_FILTER_BOX, STBIR_COLORSPACE_LINEAR, &g_context); float r = (float)255 / 4294967296; float g = (float)255 / 4294967296; float ra = (float)255 / 4294967296; float ga = (float)25 / 4294967296; float a = (ra + ga) / 2; STBIR_ASSERT(output[0] == (unsigned int)(r * ra / 2 / a * 4294967296 + 0.5f)); // 232 STBIR_ASSERT(output[1] == (unsigned int)(g * ga / 2 / a * 4294967296 + 0.5f)); // 23 STBIR_ASSERT(output[2] == 0); STBIR_ASSERT(output[3] == (unsigned int)(a * 4294967296 + 0.5f)); // 140 // Now a test to make sure it doesn't clobber existing values. // Top right - completely transparent green *pixel(input, 1, 0, 1, 2, 4) = 255; *pixel(input, 1, 0, 3, 2, 4) = 0; // Bottom right - completely transparent green *pixel(input, 1, 1, 1, 2, 4) = 255; *pixel(input, 1, 1, 3, 2, 4) = 0; stbir_resize(input, 2, 2, 0, output2, 2, 2, 0, STBIR_TYPE_UINT32, 4, 3, 0, STBIR_EDGE_CLAMP, STBIR_EDGE_CLAMP, STBIR_FILTER_BOX, STBIR_FILTER_BOX, STBIR_COLORSPACE_LINEAR, &g_context); STBIR_ASSERT(*pixel(output2, 0, 0, 0, 2, 4) == 255); STBIR_ASSERT(*pixel(output2, 0, 0, 1, 2, 4) == 0); STBIR_ASSERT(*pixel(output2, 0, 0, 2, 2, 4) == 0); STBIR_ASSERT(*pixel(output2, 0, 0, 3, 2, 4) == 255); STBIR_ASSERT(*pixel(output2, 0, 1, 0, 2, 4) == 255); STBIR_ASSERT(*pixel(output2, 0, 1, 1, 2, 4) == 0); STBIR_ASSERT(*pixel(output2, 0, 1, 2, 2, 4) == 0); STBIR_ASSERT(*pixel(output2, 0, 1, 3, 2, 4) == 255); STBIR_ASSERT(*pixel(output2, 1, 0, 0, 2, 4) == 0); STBIR_ASSERT(*pixel(output2, 1, 0, 1, 2, 4) == 255); STBIR_ASSERT(*pixel(output2, 1, 0, 2, 2, 4) == 0); STBIR_ASSERT(*pixel(output2, 1, 0, 3, 2, 4) == 0); STBIR_ASSERT(*pixel(output2, 1, 1, 0, 2, 4) == 0); STBIR_ASSERT(*pixel(output2, 1, 1, 1, 2, 4) == 255); STBIR_ASSERT(*pixel(output2, 1, 1, 2, 2, 4) == 0); STBIR_ASSERT(*pixel(output2, 1, 1, 3, 2, 4) == 0); } // test that splitting a pow-2 image into tiles produces identical results void test_subpixel_1() { unsigned char image[8 * 8]; mtsrand(0); for (int i = 0; i < sizeof(image); i++) image[i] = mtrand() & 255; unsigned char output_data[16 * 16]; stbir_resize_region(image, 8, 8, 0, output_data, 16, 16, 0, STBIR_TYPE_UINT8, 1, STBIR_ALPHA_CHANNEL_NONE, 0, STBIR_EDGE_CLAMP, STBIR_EDGE_CLAMP, STBIR_FILTER_CATMULLROM, STBIR_FILTER_CATMULLROM, STBIR_COLORSPACE_SRGB, &g_context, 0, 0, 1, 1); unsigned char output_left[8 * 16]; unsigned char output_right[8 * 16]; stbir_resize_region(image, 8, 8, 0, output_left, 8, 16, 0, STBIR_TYPE_UINT8, 1, STBIR_ALPHA_CHANNEL_NONE, 0, STBIR_EDGE_CLAMP, STBIR_EDGE_CLAMP, STBIR_FILTER_CATMULLROM, STBIR_FILTER_CATMULLROM, STBIR_COLORSPACE_SRGB, &g_context, 0, 0, 0.5f, 1); stbir_resize_region(image, 8, 8, 0, output_right, 8, 16, 0, STBIR_TYPE_UINT8, 1, STBIR_ALPHA_CHANNEL_NONE, 0, STBIR_EDGE_CLAMP, STBIR_EDGE_CLAMP, STBIR_FILTER_CATMULLROM, STBIR_FILTER_CATMULLROM, STBIR_COLORSPACE_SRGB, &g_context, 0.5f, 0, 1, 1); for (int x = 0; x < 8; x++) { for (int y = 0; y < 16; y++) { STBIR_ASSERT(output_data[y * 16 + x] == output_left[y * 8 + x]); STBIR_ASSERT(output_data[y * 16 + x + 8] == output_right[y * 8 + x]); } } stbir_resize_subpixel(image, 8, 8, 0, output_left, 8, 16, 0, STBIR_TYPE_UINT8, 1, STBIR_ALPHA_CHANNEL_NONE, 0, STBIR_EDGE_CLAMP, STBIR_EDGE_CLAMP, STBIR_FILTER_CATMULLROM, STBIR_FILTER_CATMULLROM, STBIR_COLORSPACE_SRGB, &g_context, 2, 2, 0, 0); stbir_resize_subpixel(image, 8, 8, 0, output_right, 8, 16, 0, STBIR_TYPE_UINT8, 1, STBIR_ALPHA_CHANNEL_NONE, 0, STBIR_EDGE_CLAMP, STBIR_EDGE_CLAMP, STBIR_FILTER_CATMULLROM, STBIR_FILTER_CATMULLROM, STBIR_COLORSPACE_SRGB, &g_context, 2, 2, 8, 0); {for (int x = 0; x < 8; x++) { for (int y = 0; y < 16; y++) { STBIR_ASSERT(output_data[y * 16 + x] == output_left[y * 8 + x]); STBIR_ASSERT(output_data[y * 16 + x + 8] == output_right[y * 8 + x]); } }} } // test that replicating an image and using a subtile of it produces same results as wraparound void test_subpixel_2() { unsigned char image[8 * 8]; mtsrand(0); for (int i = 0; i < sizeof(image); i++) image[i] = mtrand() & 255; unsigned char large_image[32 * 32]; for (int x = 0; x < 8; x++) { for (int y = 0; y < 8; y++) { for (int i = 0; i < 4; i++) { for (int j = 0; j < 4; j++) large_image[j*4*8*8 + i*8 + y*4*8 + x] = image[y*8 + x]; } } } unsigned char output_data_1[16 * 16]; unsigned char output_data_2[16 * 16]; stbir_resize(image, 8, 8, 0, output_data_1, 16, 16, 0, STBIR_TYPE_UINT8, 1, STBIR_ALPHA_CHANNEL_NONE, 0, STBIR_EDGE_WRAP, STBIR_EDGE_WRAP, STBIR_FILTER_CATMULLROM, STBIR_FILTER_CATMULLROM, STBIR_COLORSPACE_SRGB, &g_context); stbir_resize_region(large_image, 32, 32, 0, output_data_2, 16, 16, 0, STBIR_TYPE_UINT8, 1, STBIR_ALPHA_CHANNEL_NONE, 0, STBIR_EDGE_WRAP, STBIR_EDGE_WRAP, STBIR_FILTER_CATMULLROM, STBIR_FILTER_CATMULLROM, STBIR_COLORSPACE_SRGB, &g_context, 0.25f, 0.25f, 0.5f, 0.5f); {for (int x = 0; x < 16; x++) { for (int y = 0; y < 16; y++) STBIR_ASSERT(output_data_1[y * 16 + x] == output_data_2[y * 16 + x]); }} stbir_resize_subpixel(large_image, 32, 32, 0, output_data_2, 16, 16, 0, STBIR_TYPE_UINT8, 1, STBIR_ALPHA_CHANNEL_NONE, 0, STBIR_EDGE_WRAP, STBIR_EDGE_WRAP, STBIR_FILTER_CATMULLROM, STBIR_FILTER_CATMULLROM, STBIR_COLORSPACE_SRGB, &g_context, 2, 2, 16, 16); {for (int x = 0; x < 16; x++) { for (int y = 0; y < 16; y++) STBIR_ASSERT(output_data_1[y * 16 + x] == output_data_2[y * 16 + x]); }} } // test that 0,0,1,1 subpixel produces same result as no-rect void test_subpixel_3() { unsigned char image[8 * 8]; mtsrand(0); for (int i = 0; i < sizeof(image); i++) image[i] = mtrand() & 255; unsigned char output_data_1[32 * 32]; unsigned char output_data_2[32 * 32]; stbir_resize_region(image, 8, 8, 0, output_data_1, 32, 32, 0, STBIR_TYPE_UINT8, 1, 0, STBIR_ALPHA_CHANNEL_NONE, STBIR_EDGE_CLAMP, STBIR_EDGE_CLAMP, STBIR_FILTER_CATMULLROM, STBIR_FILTER_CATMULLROM, STBIR_COLORSPACE_LINEAR, NULL, 0, 0, 1, 1); stbir_resize_uint8(image, 8, 8, 0, output_data_2, 32, 32, 0, 1); for (int x = 0; x < 32; x++) { for (int y = 0; y < 32; y++) STBIR_ASSERT(output_data_1[y * 32 + x] == output_data_2[y * 32 + x]); } stbir_resize_subpixel(image, 8, 8, 0, output_data_1, 32, 32, 0, STBIR_TYPE_UINT8, 1, 0, STBIR_ALPHA_CHANNEL_NONE, STBIR_EDGE_CLAMP, STBIR_EDGE_CLAMP, STBIR_FILTER_CATMULLROM, STBIR_FILTER_CATMULLROM, STBIR_COLORSPACE_LINEAR, NULL, 4, 4, 0, 0); {for (int x = 0; x < 32; x++) { for (int y = 0; y < 32; y++) STBIR_ASSERT(output_data_1[y * 32 + x] == output_data_2[y * 32 + x]); }} } // test that 1:1 resample using s,t=0,0,1,1 with bilinear produces original image void test_subpixel_4() { unsigned char image[8 * 8]; mtsrand(0); for (int i = 0; i < sizeof(image); i++) image[i] = mtrand() & 255; unsigned char output[8 * 8]; stbir_resize_region(image, 8, 8, 0, output, 8, 8, 0, STBIR_TYPE_UINT8, 1, STBIR_ALPHA_CHANNEL_NONE, 0, STBIR_EDGE_CLAMP, STBIR_EDGE_CLAMP, STBIR_FILTER_TRIANGLE, STBIR_FILTER_TRIANGLE, STBIR_COLORSPACE_LINEAR, &g_context, 0, 0, 1, 1); STBIR_ASSERT(memcmp(image, output, 8 * 8) == 0); stbir_resize_subpixel(image, 8, 8, 0, output, 8, 8, 0, STBIR_TYPE_UINT8, 1, STBIR_ALPHA_CHANNEL_NONE, 0, STBIR_EDGE_CLAMP, STBIR_EDGE_CLAMP, STBIR_FILTER_TRIANGLE, STBIR_FILTER_TRIANGLE, STBIR_COLORSPACE_LINEAR, &g_context, 1, 1, 0, 0); STBIR_ASSERT(memcmp(image, output, 8 * 8) == 0); } static unsigned int image88_int[8][8]; static unsigned char image88 [8][8]; static unsigned char output88[8][8]; static unsigned char output44[4][4]; static unsigned char output22[2][2]; static unsigned char output11[1][1]; void resample_88(stbir_filter filter) { stbir_resize_uint8_generic(image88[0],8,8,0, output88[0],8,8,0, 1,-1,0, STBIR_EDGE_CLAMP, filter, STBIR_COLORSPACE_LINEAR, NULL); stbir_resize_uint8_generic(image88[0],8,8,0, output44[0],4,4,0, 1,-1,0, STBIR_EDGE_CLAMP, filter, STBIR_COLORSPACE_LINEAR, NULL); stbir_resize_uint8_generic(image88[0],8,8,0, output22[0],2,2,0, 1,-1,0, STBIR_EDGE_CLAMP, filter, STBIR_COLORSPACE_LINEAR, NULL); stbir_resize_uint8_generic(image88[0],8,8,0, output11[0],1,1,0, 1,-1,0, STBIR_EDGE_CLAMP, filter, STBIR_COLORSPACE_LINEAR, NULL); } void verify_box(void) { int i,j,t; resample_88(STBIR_FILTER_BOX); for (i=0; i < sizeof(image88); ++i) STBIR_ASSERT(image88[0][i] == output88[0][i]); t = 0; for (j=0; j < 4; ++j) for (i=0; i < 4; ++i) { int n = image88[j*2+0][i*2+0] + image88[j*2+0][i*2+1] + image88[j*2+1][i*2+0] + image88[j*2+1][i*2+1]; STBIR_ASSERT(output44[j][i] == ((n+2)>>2) || output44[j][i] == ((n+1)>>2)); // can't guarantee exact rounding due to numerical precision t += n; } STBIR_ASSERT(output11[0][0] == ((t+32)>>6) || output11[0][0] == ((t+31)>>6)); // can't guarantee exact rounding due to numerical precision } void verify_filter_normalized(stbir_filter filter, int output_size, unsigned int value) { int i, j; unsigned int output[64]; stbir_resize(image88_int[0], 8, 8, 0, output, output_size, output_size, 0, STBIR_TYPE_UINT32, 1, STBIR_ALPHA_CHANNEL_NONE, 0, STBIR_EDGE_CLAMP, STBIR_EDGE_CLAMP, filter, filter, STBIR_COLORSPACE_LINEAR, NULL); for (j = 0; j < output_size; ++j) for (i = 0; i < output_size; ++i) STBIR_ASSERT(value == output[j*output_size + i]); } float round2(float f) { return (float) floor(f+0.5f); // round() isn't C standard pre-C99 } void test_filters(void) { int i,j; mtsrand(0); for (i=0; i < sizeof(image88); ++i) image88[0][i] = mtrand() & 255; verify_box(); for (i=0; i < sizeof(image88); ++i) image88[0][i] = 0; image88[4][4] = 255; verify_box(); for (j=0; j < 8; ++j) for (i=0; i < 8; ++i) image88[j][i] = (j^i)&1 ? 255 : 0; verify_box(); for (j=0; j < 8; ++j) for (i=0; i < 8; ++i) image88[j][i] = i&2 ? 255 : 0; verify_box(); int value = 64; for (j = 0; j < 8; ++j) for (i = 0; i < 8; ++i) image88_int[j][i] = value; verify_filter_normalized(STBIR_FILTER_BOX, 8, value); verify_filter_normalized(STBIR_FILTER_TRIANGLE, 8, value); verify_filter_normalized(STBIR_FILTER_CUBICBSPLINE, 8, value); verify_filter_normalized(STBIR_FILTER_CATMULLROM, 8, value); verify_filter_normalized(STBIR_FILTER_MITCHELL, 8, value); verify_filter_normalized(STBIR_FILTER_BOX, 4, value); verify_filter_normalized(STBIR_FILTER_TRIANGLE, 4, value); verify_filter_normalized(STBIR_FILTER_CUBICBSPLINE, 4, value); verify_filter_normalized(STBIR_FILTER_CATMULLROM, 4, value); verify_filter_normalized(STBIR_FILTER_MITCHELL, 4, value); verify_filter_normalized(STBIR_FILTER_BOX, 2, value); verify_filter_normalized(STBIR_FILTER_TRIANGLE, 2, value); verify_filter_normalized(STBIR_FILTER_CUBICBSPLINE, 2, value); verify_filter_normalized(STBIR_FILTER_CATMULLROM, 2, value); verify_filter_normalized(STBIR_FILTER_MITCHELL, 2, value); verify_filter_normalized(STBIR_FILTER_BOX, 1, value); verify_filter_normalized(STBIR_FILTER_TRIANGLE, 1, value); verify_filter_normalized(STBIR_FILTER_CUBICBSPLINE, 1, value); verify_filter_normalized(STBIR_FILTER_CATMULLROM, 1, value); verify_filter_normalized(STBIR_FILTER_MITCHELL, 1, value); { // This test is designed to produce coefficients that are very badly denormalized. unsigned int v = 556; unsigned int input[100 * 100]; unsigned int output[11 * 11]; for (j = 0; j < 100 * 100; ++j) input[j] = v; stbir_resize(input, 100, 100, 0, output, 11, 11, 0, STBIR_TYPE_UINT32, 1, STBIR_ALPHA_CHANNEL_NONE, 0, STBIR_EDGE_CLAMP, STBIR_EDGE_CLAMP, STBIR_FILTER_TRIANGLE, STBIR_FILTER_TRIANGLE, STBIR_COLORSPACE_LINEAR, NULL); for (j = 0; j < 11 * 11; ++j) STBIR_ASSERT(v == output[j]); } { // Now test the trapezoid filter for downsampling. unsigned int input[3 * 1]; unsigned int output[2 * 1]; input[0] = 0; input[1] = 255; input[2] = 127; stbir_resize(input, 3, 1, 0, output, 2, 1, 0, STBIR_TYPE_UINT32, 1, STBIR_ALPHA_CHANNEL_NONE, 0, STBIR_EDGE_CLAMP, STBIR_EDGE_CLAMP, STBIR_FILTER_BOX, STBIR_FILTER_BOX, STBIR_COLORSPACE_LINEAR, NULL); STBIR_ASSERT(output[0] == (unsigned int)round2((float)(input[0] * 2 + input[1]) / 3)); STBIR_ASSERT(output[1] == (unsigned int)round2((float)(input[2] * 2 + input[1]) / 3)); stbir_resize(input, 1, 3, 0, output, 1, 2, 0, STBIR_TYPE_UINT32, 1, STBIR_ALPHA_CHANNEL_NONE, 0, STBIR_EDGE_CLAMP, STBIR_EDGE_CLAMP, STBIR_FILTER_BOX, STBIR_FILTER_BOX, STBIR_COLORSPACE_LINEAR, NULL); STBIR_ASSERT(output[0] == (unsigned int)round2((float)(input[0] * 2 + input[1]) / 3)); STBIR_ASSERT(output[1] == (unsigned int)round2((float)(input[2] * 2 + input[1]) / 3)); } { // Now test the trapezoid filter for upsampling. unsigned int input[2 * 1]; unsigned int output[3 * 1]; input[0] = 0; input[1] = 255; stbir_resize(input, 2, 1, 0, output, 3, 1, 0, STBIR_TYPE_UINT32, 1, STBIR_ALPHA_CHANNEL_NONE, 0, STBIR_EDGE_CLAMP, STBIR_EDGE_CLAMP, STBIR_FILTER_BOX, STBIR_FILTER_BOX, STBIR_COLORSPACE_LINEAR, NULL); STBIR_ASSERT(output[0] == input[0]); STBIR_ASSERT(output[1] == (input[0] + input[1]) / 2); STBIR_ASSERT(output[2] == input[1]); stbir_resize(input, 1, 2, 0, output, 1, 3, 0, STBIR_TYPE_UINT32, 1, STBIR_ALPHA_CHANNEL_NONE, 0, STBIR_EDGE_CLAMP, STBIR_EDGE_CLAMP, STBIR_FILTER_BOX, STBIR_FILTER_BOX, STBIR_COLORSPACE_LINEAR, NULL); STBIR_ASSERT(output[0] == input[0]); STBIR_ASSERT(output[1] == (input[0] + input[1]) / 2); STBIR_ASSERT(output[2] == input[1]); } // checkerboard { unsigned char input[64][64]; unsigned char output[16][16]; int i,j; for (j=0; j < 64; ++j) for (i=0; i < 64; ++i) input[j][i] = (i^j)&1 ? 255 : 0; stbir_resize_uint8_generic(input[0], 64, 64, 0, output[0],16,16,0, 1,-1,0,STBIR_EDGE_WRAP,STBIR_FILTER_DEFAULT,STBIR_COLORSPACE_LINEAR,0); for (j=0; j < 16; ++j) for (i=0; i < 16; ++i) STBIR_ASSERT(output[j][i] == 128); stbir_resize_uint8_srgb_edgemode(input[0], 64, 64, 0, output[0],16,16,0, 1,-1,0,STBIR_EDGE_WRAP); for (j=0; j < 16; ++j) for (i=0; i < 16; ++i) STBIR_ASSERT(output[j][i] == 188); } { // Test trapezoid box filter unsigned char input[2 * 1]; unsigned char output[127 * 1]; input[0] = 0; input[1] = 255; stbir_resize(input, 2, 1, 0, output, 127, 1, 0, STBIR_TYPE_UINT8, 1, STBIR_ALPHA_CHANNEL_NONE, 0, STBIR_EDGE_CLAMP, STBIR_EDGE_CLAMP, STBIR_FILTER_BOX, STBIR_FILTER_BOX, STBIR_COLORSPACE_LINEAR, NULL); STBIR_ASSERT(output[0] == 0); STBIR_ASSERT(output[127 / 2 - 1] == 0); STBIR_ASSERT(output[127 / 2] == 128); STBIR_ASSERT(output[127 / 2 + 1] == 255); STBIR_ASSERT(output[126] == 255); stbi_write_png("test-output/trapezoid-upsample-horizontal.png", 127, 1, 1, output, 0); stbir_resize(input, 1, 2, 0, output, 1, 127, 0, STBIR_TYPE_UINT8, 1, STBIR_ALPHA_CHANNEL_NONE, 0, STBIR_EDGE_CLAMP, STBIR_EDGE_CLAMP, STBIR_FILTER_BOX, STBIR_FILTER_BOX, STBIR_COLORSPACE_LINEAR, NULL); STBIR_ASSERT(output[0] == 0); STBIR_ASSERT(output[127 / 2 - 1] == 0); STBIR_ASSERT(output[127 / 2] == 128); STBIR_ASSERT(output[127 / 2 + 1] == 255); STBIR_ASSERT(output[126] == 255); stbi_write_png("test-output/trapezoid-upsample-vertical.png", 1, 127, 1, output, 0); } } #define UMAX32 4294967295U static void write32(const char *filename, stbir_uint32 *output, int w, int h) { stbir_uint8 *data = (stbir_uint8*) malloc(w*h*3); for (int i=0; i < w*h*3; ++i) data[i] = output[i]>>24; stbi_write_png(filename, w, h, 3, data, 0); free(data); } static void test_32(void) { int w=100,h=120,x,y, out_w,out_h; stbir_uint32 *input = (stbir_uint32*) malloc(4 * 3 * w * h); stbir_uint32 *output = (stbir_uint32*) malloc(4 * 3 * 3*w * 3*h); for (y=0; y < h; ++y) { for (x=0; x < w; ++x) { input[y*3*w + x*3 + 0] = x * ( UMAX32/w ); input[y*3*w + x*3 + 1] = y * ( UMAX32/h ); input[y*3*w + x*3 + 2] = UMAX32/2; } } out_w = w*33/16; out_h = h*33/16; stbir_resize(input,w,h,0,output,out_w,out_h,0,STBIR_TYPE_UINT32,3,-1,0,STBIR_EDGE_CLAMP,STBIR_EDGE_CLAMP,STBIR_FILTER_DEFAULT,STBIR_FILTER_DEFAULT,STBIR_COLORSPACE_LINEAR,NULL); write32("test-output/seantest_1.png", output,out_w,out_h); out_w = w*16/33; out_h = h*16/33; stbir_resize(input,w,h,0,output,out_w,out_h,0,STBIR_TYPE_UINT32,3,-1,0,STBIR_EDGE_CLAMP,STBIR_EDGE_CLAMP,STBIR_FILTER_DEFAULT,STBIR_FILTER_DEFAULT,STBIR_COLORSPACE_LINEAR,NULL); write32("test-output/seantest_2.png", output,out_w,out_h); } void test_suite(int argc, char **argv) { int i; const char *barbara; mkdir("test-output", 777); if (argc > 1) barbara = argv[1]; else barbara = "barbara.png"; // check what cases we need normalization for #if 1 { float x, y; for (x = -1; x < 1; x += 0.05f) { float sums[5] = { 0 }; float o; for (o = -5; o <= 5; ++o) { sums[0] += stbir__filter_mitchell(x + o, 1); sums[1] += stbir__filter_catmullrom(x + o, 1); sums[2] += stbir__filter_cubic(x + o, 1); sums[3] += stbir__filter_triangle(x + o, 1); sums[4] += stbir__filter_trapezoid(x + o, 0.5f); } for (i = 0; i < 5; ++i) STBIR_ASSERT(sums[i] >= 1.0 - 0.001 && sums[i] <= 1.0 + 0.001); } #if 1 for (y = 0.11f; y < 1; y += 0.01f) { // Step for (x = -1; x < 1; x += 0.05f) { // Phase float sums[5] = { 0 }; float o; for (o = -5; o <= 5; o += y) { sums[0] += y * stbir__filter_mitchell(x + o, 1); sums[1] += y * stbir__filter_catmullrom(x + o, 1); sums[2] += y * stbir__filter_cubic(x + o, 1); sums[4] += y * stbir__filter_trapezoid(x + o, 0.5f); sums[3] += y * stbir__filter_triangle(x + o, 1); } for (i = 0; i < 3; ++i) STBIR_ASSERT(sums[i] >= 1.0 - 0.0170 && sums[i] <= 1.0 + 0.0170); } } #endif } #endif #if 0 // linear_to_srgb_uchar table for (i=0; i < 256; ++i) { float f = stbir__srgb_to_linear((i-0.5f)/255.0f); printf("%9d, ", (int) ((f) * (1<<28))); if ((i & 7) == 7) printf("\n"); } #endif // old tests that hacky fix worked on - test that // every uint8 maps to itself for (i = 0; i < 256; i++) { float f = stbir__srgb_to_linear(float(i) / 255); int n = stbir__linear_to_srgb_uchar(f); STBIR_ASSERT(n == i); } // new tests that hacky fix failed for - test that // values adjacent to uint8 round to nearest uint8 for (i = 0; i < 256; i++) { for (float y = -0.42f; y <= 0.42f; y += 0.01f) { float f = stbir__srgb_to_linear((i+y) / 255.0f); int n = stbir__linear_to_srgb_uchar(f); STBIR_ASSERT(n == i); } } test_filters(); test_subpixel_1(); test_subpixel_2(); test_subpixel_3(); test_subpixel_4(); test_premul(); test_32(); // Some tests to make sure errors don't pop up with strange filter/dimension combinations. stbir_resize(image88, 8, 8, 0, output88, 4, 16, 0, STBIR_TYPE_UINT8, 1, STBIR_ALPHA_CHANNEL_NONE, 0, STBIR_EDGE_CLAMP, STBIR_EDGE_CLAMP, STBIR_FILTER_BOX, STBIR_FILTER_CATMULLROM, STBIR_COLORSPACE_SRGB, &g_context); stbir_resize(image88, 8, 8, 0, output88, 4, 16, 0, STBIR_TYPE_UINT8, 1, STBIR_ALPHA_CHANNEL_NONE, 0, STBIR_EDGE_CLAMP, STBIR_EDGE_CLAMP, STBIR_FILTER_CATMULLROM, STBIR_FILTER_BOX, STBIR_COLORSPACE_SRGB, &g_context); stbir_resize(image88, 8, 8, 0, output88, 16, 4, 0, STBIR_TYPE_UINT8, 1, STBIR_ALPHA_CHANNEL_NONE, 0, STBIR_EDGE_CLAMP, STBIR_EDGE_CLAMP, STBIR_FILTER_BOX, STBIR_FILTER_CATMULLROM, STBIR_COLORSPACE_SRGB, &g_context); stbir_resize(image88, 8, 8, 0, output88, 16, 4, 0, STBIR_TYPE_UINT8, 1, STBIR_ALPHA_CHANNEL_NONE, 0, STBIR_EDGE_CLAMP, STBIR_EDGE_CLAMP, STBIR_FILTER_CATMULLROM, STBIR_FILTER_BOX, STBIR_COLORSPACE_SRGB, &g_context); int barbara_width, barbara_height, barbara_channels; stbi_image_free(stbi_load(barbara, &barbara_width, &barbara_height, &barbara_channels, 0)); int res = 10; // Downscaling {for (int i = 0; i <= res; i++) { float t = (float)i/res; float scale = 0.5; float out_scale = 2.0f/3; float x_shift = (barbara_width*out_scale - barbara_width*scale) * t; float y_shift = (barbara_height*out_scale - barbara_height*scale) * t; test_subpixel_command(barbara, scale, scale, out_scale, out_scale, x_shift, y_shift); }} // Upscaling {for (int i = 0; i <= res; i++) { float t = (float)i/res; float scale = 2; float out_scale = 3; float x_shift = (barbara_width*out_scale - barbara_width*scale) * t; float y_shift = (barbara_height*out_scale - barbara_height*scale) * t; test_subpixel_command(barbara, scale, scale, out_scale, out_scale, x_shift, y_shift); }} // Downscaling {for (int i = 0; i <= res; i++) { float t = (float)i/res / 2; test_subpixel_region(barbara, 0.25f, 0.25f, t, t, t+0.5f, t+0.5f); }} // No scaling {for (int i = 0; i <= res; i++) { float t = (float)i/res / 2; test_subpixel_region(barbara, 0.5f, 0.5f, t, t, t+0.5f, t+0.5f); }} // Upscaling {for (int i = 0; i <= res; i++) { float t = (float)i/res / 2; test_subpixel_region(barbara, 1, 1, t, t, t+0.5f, t+0.5f); }} {for (i = 0; i < 10; i++) test_subpixel(barbara, 0.5f, 0.5f, (float)i / 10, 1); } {for (i = 0; i < 10; i++) test_subpixel(barbara, 0.5f, 0.5f, 1, (float)i / 10); } {for (i = 0; i < 10; i++) test_subpixel(barbara, 2, 2, (float)i / 10, 1); } {for (i = 0; i < 10; i++) test_subpixel(barbara, 2, 2, 1, (float)i / 10); } // Channels test test_channels(barbara, 0.5f, 0.5f, 1); test_channels(barbara, 0.5f, 0.5f, 2); test_channels(barbara, 0.5f, 0.5f, 3); test_channels(barbara, 0.5f, 0.5f, 4); test_channels(barbara, 2, 2, 1); test_channels(barbara, 2, 2, 2); test_channels(barbara, 2, 2, 3); test_channels(barbara, 2, 2, 4); // filter tests resize_image(barbara, 2, 2, STBIR_FILTER_BOX , STBIR_EDGE_CLAMP, STBIR_COLORSPACE_SRGB, "test-output/barbara-upsample-nearest.png"); resize_image(barbara, 2, 2, STBIR_FILTER_TRIANGLE , STBIR_EDGE_CLAMP, STBIR_COLORSPACE_SRGB, "test-output/barbara-upsample-bilinear.png"); resize_image(barbara, 2, 2, STBIR_FILTER_CUBICBSPLINE, STBIR_EDGE_CLAMP, STBIR_COLORSPACE_SRGB, "test-output/barbara-upsample-bicubic.png"); resize_image(barbara, 2, 2, STBIR_FILTER_CATMULLROM , STBIR_EDGE_CLAMP, STBIR_COLORSPACE_SRGB, "test-output/barbara-upsample-catmullrom.png"); resize_image(barbara, 2, 2, STBIR_FILTER_MITCHELL , STBIR_EDGE_CLAMP, STBIR_COLORSPACE_SRGB, "test-output/barbara-upsample-mitchell.png"); resize_image(barbara, 0.5f, 0.5f, STBIR_FILTER_BOX , STBIR_EDGE_CLAMP, STBIR_COLORSPACE_SRGB, "test-output/barbara-downsample-nearest.png"); resize_image(barbara, 0.5f, 0.5f, STBIR_FILTER_TRIANGLE , STBIR_EDGE_CLAMP, STBIR_COLORSPACE_SRGB, "test-output/barbara-downsample-bilinear.png"); resize_image(barbara, 0.5f, 0.5f, STBIR_FILTER_CUBICBSPLINE, STBIR_EDGE_CLAMP, STBIR_COLORSPACE_SRGB, "test-output/barbara-downsample-bicubic.png"); resize_image(barbara, 0.5f, 0.5f, STBIR_FILTER_CATMULLROM , STBIR_EDGE_CLAMP, STBIR_COLORSPACE_SRGB, "test-output/barbara-downsample-catmullrom.png"); resize_image(barbara, 0.5f, 0.5f, STBIR_FILTER_MITCHELL , STBIR_EDGE_CLAMP, STBIR_COLORSPACE_SRGB, "test-output/barbara-downsample-mitchell.png"); {for (i = 10; i < 100; i++) { char outname[200]; sprintf(outname, "test-output/barbara-width-%d.jpg", i); resize_image(barbara, (float)i / 100, 1, STBIR_FILTER_CATMULLROM, STBIR_EDGE_CLAMP, STBIR_COLORSPACE_SRGB, outname); }} {for (i = 110; i < 500; i += 10) { char outname[200]; sprintf(outname, "test-output/barbara-width-%d.jpg", i); resize_image(barbara, (float)i / 100, 1, STBIR_FILTER_CATMULLROM, STBIR_EDGE_CLAMP, STBIR_COLORSPACE_SRGB, outname); }} {for (i = 10; i < 100; i++) { char outname[200]; sprintf(outname, "test-output/barbara-height-%d.jpg", i); resize_image(barbara, 1, (float)i / 100, STBIR_FILTER_CATMULLROM, STBIR_EDGE_CLAMP, STBIR_COLORSPACE_SRGB, outname); }} {for (i = 110; i < 500; i += 10) { char outname[200]; sprintf(outname, "test-output/barbara-height-%d.jpg", i); resize_image(barbara, 1, (float)i / 100, STBIR_FILTER_CATMULLROM, STBIR_EDGE_CLAMP, STBIR_COLORSPACE_SRGB, outname); }} {for (i = 50; i < 200; i += 10) { char outname[200]; sprintf(outname, "test-output/barbara-width-height-%d.jpg", i); resize_image(barbara, 100 / (float)i, (float)i / 100, STBIR_FILTER_CATMULLROM, STBIR_EDGE_CLAMP, STBIR_COLORSPACE_SRGB, outname); }} test_format(barbara, 0.5, 2.0, STBIR_TYPE_UINT16, STBIR_COLORSPACE_SRGB); test_format(barbara, 0.5, 2.0, STBIR_TYPE_UINT16, STBIR_COLORSPACE_LINEAR); test_format(barbara, 2.0, 0.5, STBIR_TYPE_UINT16, STBIR_COLORSPACE_SRGB); test_format(barbara, 2.0, 0.5, STBIR_TYPE_UINT16, STBIR_COLORSPACE_LINEAR); test_format(barbara, 0.5, 2.0, STBIR_TYPE_UINT32, STBIR_COLORSPACE_SRGB); test_format(barbara, 0.5, 2.0, STBIR_TYPE_UINT32, STBIR_COLORSPACE_LINEAR); test_format(barbara, 2.0, 0.5, STBIR_TYPE_UINT32, STBIR_COLORSPACE_SRGB); test_format(barbara, 2.0, 0.5, STBIR_TYPE_UINT32, STBIR_COLORSPACE_LINEAR); test_float(barbara, 0.5, 2.0, STBIR_TYPE_FLOAT, STBIR_COLORSPACE_SRGB); test_float(barbara, 0.5, 2.0, STBIR_TYPE_FLOAT, STBIR_COLORSPACE_LINEAR); test_float(barbara, 2.0, 0.5, STBIR_TYPE_FLOAT, STBIR_COLORSPACE_SRGB); test_float(barbara, 2.0, 0.5, STBIR_TYPE_FLOAT, STBIR_COLORSPACE_LINEAR); // Edge behavior tests resize_image("hgradient.png", 2, 2, STBIR_FILTER_CATMULLROM, STBIR_EDGE_CLAMP, STBIR_COLORSPACE_LINEAR, "test-output/hgradient-clamp.png"); resize_image("hgradient.png", 2, 2, STBIR_FILTER_CATMULLROM, STBIR_EDGE_WRAP, STBIR_COLORSPACE_LINEAR, "test-output/hgradient-wrap.png"); resize_image("vgradient.png", 2, 2, STBIR_FILTER_CATMULLROM, STBIR_EDGE_CLAMP, STBIR_COLORSPACE_LINEAR, "test-output/vgradient-clamp.png"); resize_image("vgradient.png", 2, 2, STBIR_FILTER_CATMULLROM, STBIR_EDGE_WRAP, STBIR_COLORSPACE_LINEAR, "test-output/vgradient-wrap.png"); resize_image("1px-border.png", 2, 2, STBIR_FILTER_CATMULLROM, STBIR_EDGE_REFLECT, STBIR_COLORSPACE_LINEAR, "test-output/1px-border-reflect.png"); resize_image("1px-border.png", 2, 2, STBIR_FILTER_CATMULLROM, STBIR_EDGE_CLAMP, STBIR_COLORSPACE_LINEAR, "test-output/1px-border-clamp.png"); // sRGB tests resize_image("gamma_colors.jpg", .5f, .5f, STBIR_FILTER_CATMULLROM, STBIR_EDGE_REFLECT, STBIR_COLORSPACE_SRGB, "test-output/gamma_colors.jpg"); resize_image("gamma_2.2.jpg", .5f, .5f, STBIR_FILTER_CATMULLROM, STBIR_EDGE_REFLECT, STBIR_COLORSPACE_SRGB, "test-output/gamma_2.2.jpg"); resize_image("gamma_dalai_lama_gray.jpg", .5f, .5f, STBIR_FILTER_CATMULLROM, STBIR_EDGE_REFLECT, STBIR_COLORSPACE_SRGB, "test-output/gamma_dalai_lama_gray.jpg"); } uTox/third_party/stb/stb/tests/pngsuite/0000700000175000001440000000000014003056224017404 5ustar rakusersuTox/third_party/stb/stb/tests/pngsuite/unused/0000700000175000001440000000000014003056224020707 5ustar rakusersuTox/third_party/stb/stb/tests/pngsuite/unused/ps2n2c16.png0000600000175000001440000000466414003056224022707 0ustar rakusersPNG  IHDR 1gAMA1_zsPLTsix-cube3f3333f333ff3fffff3f3f3f3333f3333333333f3333333f3f33ff3f3f3f3333f3333333f3333333f333ff3ffffff3f33f3ff3f3f3ffff3fffffffffff3fffffff3fffffff3fffff3f3333f333ff3fffff3f3f3f3f3333f333ff3fffff3f3f3f3f3333f333ff3fffff3f3f3fЋIDATxՖ 0DA~&fzE=֠B>/drs~='3_Zwt(p3p]`_yt?t(C\l52L̩g I@g.`(`g Dg&((`60Y`zl(P49܀:{z*zȟmt3ΞAO3B^IENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/ps2n0g08.png0000600000175000001440000000442014003056224022700 0ustar rakusersPNG  IHDR V%(gAMA1_zsPLTsix-cube3f3333f333ff3fffff3f3f3f3333f3333333333f3333333f3f33ff3f3f3f3333f3333333f3333333f333ff3ffffff3f33f3ff3f3f3ffff3fffffffffff3fffffff3fffffff3fffff3f3333f333ff3fffff3f3f3f3f3333f333ff3fffff3f3f3f3f3333f333ff3fffff3f3f3fЋAIDATxcd`$ȳ )?`y00gdy\ q10edPq5YIENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/ps1n2c16.png0000600000175000001440000000312414003056224022674 0ustar rakusersPNG  IHDR 1gAMA1_sPLTsix-cube3f3333f333ff3fffff3f3f̙3f3333f3333333333f3333333f3f33ff3f3f3f3333f3333333f3̙333333f333ff3ffffff3f33f3ff3f3f3ffff3fffffffffff3fffffff3fff̙ffff3fffff3f3333f333ff3fffff3f3f̙3f3f3333f333ff3fffff̙̙3̙f̙̙̙3f̙3f3f3333f333ff3fffff3f3f̙3f"h.IDATxՖ 0DA~&fzE=֠B>/drs~='3_Zwt(p3p]`_yt?t(C\l52L̩g I@g.`(`g Dg&((`60Y`zl(P49܀:{z*zȟmt3ΞAO3B^IENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/ps1n0g08.png0000600000175000001440000000266014003056224022703 0ustar rakusersPNG  IHDR V%(gAMA1_sPLTsix-cube3f3333f333ff3fffff3f3f̙3f3333f3333333333f3333333f3f33ff3f3f3f3333f3333333f3̙333333f333ff3ffffff3f33f3ff3f3f3ffff3fffffffffff3fffffff3fff̙ffff3fffff3f3333f333ff3fffff3f3f̙3f3f3333f333ff3fffff̙̙3̙f̙̙̙3f̙3f3f3333f333ff3fffff3f3f̙3f"h.AIDATxcd`$ȳ )?`y00gdy\ q10edPq5YIENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/pp0n6a08.png0000600000175000001440000000146214003056224022676 0ustar rakusersPNG  IHDR szzgAMA1_PLTE3f3333f333ff3fffff3f3f̙3f3333f3333333333f3333333f3f33ff3f3f3f3333f3333333f3̙333333f333ff3ffffff3f33f3ff3f3f3ffff3fffffffffff3fffffff3fff̙ffff3fffff3f̙3333f33̙3ff3ffff̙f3f̙3f̙̙3f̙3f3333f333ff3fffff̙̙3̙f̙̙̙3f̙3f3f3333f333ff3fffff3f3f̙3fcQUIDATx1 0 CQ<$o ԥKA4 z-qKjI`~Ux\Ku7UIENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/pp0n2c16.png0000600000175000001440000000170214003056224022670 0ustar rakusersPNG  IHDR 1gAMA1_PLTE3f3333f333ff3fffff3f3f̙3f3333f3333333333f3333333f3f33ff3f3f3f3333f3333333f3̙333333f333ff3ffffff3f33f3ff3f3f3ffff3fffffffffff3fffffff3fff̙ffff3fffff3f̙3333f33̙3ff3ffff̙f3f̙3f̙̙3f̙3f3333f333ff3fffff̙̙3̙f̙̙̙3f̙3f3f3333f333ff3fffff3f3f̙3fcQIDATxՖ 0DA~&fzE=֠B>/drs~='3_Zwt(p3p]`_yt?t(C\l52L̩g I@g.`(`g Dg&((`60Y`zl(P49܀:{z*zȟmt3ΞAO3B^IENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/g25n3p04.png0000600000175000001440000000032714003056224022603 0ustar rakusersPNG  IHDR TggAMAАTOPLTE--\\\RQdIDATxα 0 DQ[J+ ^msQ$s5HІ:P 5B) oe p/)FqjS!*$BB?x(:5tf;PIENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/g25n2c08.png0000600000175000001440000000062514003056224022572 0ustar rakusersPNG  IHDR gAMAАTOLIDATxm1@Nj #؎8Pu-` @ T@|HsZOH0gi,a&^ݥݧSȀY@'%  @V T2H o2 @'J\^_^|AU ov2`4"236"yA瓲4 x pϋ< HHQ‰ b_`8,ߢ^-v@'N=yLӅw@["^] s2 pd@@?+ZD _-a2wIENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/g25n0g16.png0000600000175000001440000000057714003056224022601 0ustar rakusersPNG  IHDR kgAMAАTO6IDATx 0 @@|"gnā:]5 8DQ-YPVVo@EN\o6VEVj4ef 0O c@ `ӟ3i(ͦzZB 7me\ tf|4t~3Cl^f3{oLkeU>b0]β  o1z0}we}&%ϧS<ے$m 664p_4f@B`2|? 8IENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/g10n3p04.png0000600000175000001440000000032614003056224022574 0ustar rakusersPNG  IHDR TggAMA1_PLTETTUZcIDATxcP H% `@`@W,@G.@` p00NK`CV`Ɩ *@-H*ـ"(/YLFə:IENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/g10n2c08.png0000600000175000001440000000043514003056224022563 0ustar rakusersPNG  IHDR gAMA1_IDATx1 0D }ǰ Bp 3H*M&S-g O 7C @T PĠ("kp3p _ (d Pu )-wzCDD2O5 H3oiۺvtv|GSMd"*?l kblt RUԭMTߏIENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/g10n0g16.png0000600000175000001440000000040614003056224022562 0ustar rakusersPNG  IHDR kgAMA1_IDATx1 E? ,=\!^KXHbřDdcfy΁HkMqye--HwZ_< JMGi =ضB;݃al>hly,kdǔ41{mi!,RIϴϫ IENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/g07n3p04.png0000600000175000001440000000031714003056224022602 0ustar rakusersPNG  IHDR TggAMAp;XVPLTEvvvNTl\IDATxc4 PA `@`0 @P p0S EX (//(Wbb 00 ``gRBQQ^w*#kr=IENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/g07n2c08.png0000600000175000001440000000052414003056224022570 0ustar rakusersPNG  IHDR gAMAp;XV IDATxՖA 0E'"+/Ir&!ݖm)E+U:34`;"!WPMė"p)~~ ʒ~\( !C@@I LR4b2fI" Ā30FEow0R2~hp2@Z  6fMW^uP릪R|y?i ` DlknkYuKc,5U(s(28 3Z? IENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/g07n0g16.png0000600000175000001440000000050114003056224022564 0ustar rakusersPNG  IHDR kgAMAp;XVIDATx͕ 0 B%hXI\1-Dl IL9P8j-Z׵Z{ۦ>2x n@i$qliE: - tA LZ߷4 di`Y8 }SU1@ͣAYhgphk \";9@39BuxC]] @ Ҡ >š,s,IENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/g05n3p04.png0000600000175000001440000000031614003056224022577 0ustar rakusersPNG  IHDR TggAMAOX2PLTEs$[IDATxcP pA `@`P@W,@Gi@` p00vq`AV`CU ``gjARQ^w*x;JUIENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/g05n2c08.png0000600000175000001440000000053614003056224022571 0ustar rakusersPNG  IHDR gAMAOX2IDATx90ERBDAGChr8hnB @B"B$pT/ϱܪd?nGg 9 vi%(.tDj$" n Ejj@ͦ  2@5Eۢ`W f@ՠV *2 @StA鴸̲/klyС(BK@`n\"2z˷^dx!E" Vf@ˡE7j9M,WIENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/g05n0g16.png0000600000175000001440000000052314003056224022566 0ustar rakusersPNG  IHDR kgAMAOX2 IDATxս 0~ H7i>AA U As GA/@ Q#99͹~ͅEX@p:)q)8WSp80/)n#vW <8`2C~8\x8ah`,uA׭ nV @_`+(W]X&*&5-~> ϧR#лtpDPGXDzЂd ?_fAIENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/g04n3p04.png0000600000175000001440000000033314003056224022575 0ustar rakusersPNG  IHDR TggAMA7PLTE",hIDATx 0D!ہ[\Ӷ` `N?eq]Q- q@SMť" DCܛ6 ѐ }~ uIENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/g04n2c08.png0000600000175000001440000000057114003056224022567 0ustar rakusersPNG  IHDR gAMA70IDATxՖ=n@F̟D-}H(R"~_Oq)xw޼!Su4T矪'3p0R%F``\~ql\^6 >`k\Π1d@Wnw G/Ȼ15+:@ l`6 rD^_](iX."d@3V1yod@o3LzdR f8l6?VFpaHnnrenuݮ|4-)4(cIENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/g03n3p04.png0000600000175000001440000000032614003056224022576 0ustar rakusersPNG  IHDR TggAMAIPLTEȭ1 cIDATxc(% 0A `@`@W,@G.@p`06`FRalb\%U@ l@-H*@ SRpIENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/g03n2c08.png0000600000175000001440000000056214003056224022566 0ustar rakusersPNG  IHDR gAMAI)IDATxM@F1Dw.x!.2dFgFˆ$øVJ_.b+gƻGq98`>//߀шVa" A+P :Π P Z-@TfSA2~4@]5Ȁ_>tl̮1333$RdV8$lB'4I^7m6MV78YmtC|wcn'[|(% jПA Ϻd@ ZY#[jIENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/g03n0g16.png0000600000175000001440000000053114003056224022563 0ustar rakusersPNG  IHDR kgAMAIIDATxM 0WZEP(]S4^"\"_mu!A3Ct7Hi|k,P1 Q`8  M$ z NA)]Wqm)*N ׫_ׂ X.TyecyZBJu2y"8MN7E@WP Mw; N'`2}&8MUeem`<u+DݷIENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/f99n0g04.png0000600000175000001440000000065214003056224022602 0ustar rakusersPNG  IHDR )qIDATxuQNAdj8R4TV? 0_@=3 2F‚] ւ`0A̼yoCsOWg {'`]|7fDr2pG ,\`KaB&@y0 {s4iv[q@2(+M2 ^X@Ka@F`F96**Yի6Z)yY٣hV+%y33O|@&2Yq~({H`G: j!ᕐaLAvde+'ܡixlryں%_*v|[I [7ND)S?%]M.VoQ㎐B d/?o[tIENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/f04n2c08.png0000600000175000001440000000173114003056224022565 0ustar rakusersPNG  IHDR IDATx͎E[Uv۔("  ${Y[g*BQ,<3c/n=c ZG֭v[N+:ۭv=WoTQa8`HB[ n zeH4;؂->VJP_Ӻrό9q'JB i9 "Ok-E4Ҹ2mr n:(UB 칻ZLwW)40)t\+ T_?G٪{wGN)t йj^0~_j 4hL| sIE@ ͐mʢv;̣8R^j" RC6>|+WAp )O'-a_[>w(e5H5:϶yz8㖫$CykU樏G.% )xr|Ok5 }MR9?Hұ5`_€Q .i P7|Hrel$Л\$XT)3T%?qoٿ*V%J(Kq Oq/nB]g_`GR|%mʹbZ2w̛@{?X&^~ MTPIF$->Ү|#0M&ؑd'Q($4 0Scs:yꆼU]Mj 0WGɱ٦o l` k;4 Xͽ {vG!@,'$iKqOaHOv}8Xg DBs96)j2"4~, *ڧ30ClZ(cՂU@ \Ҍivݙ!)̓r+LV71 jIENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/f04n0g08.png0000600000175000001440000000041514003056224022565 0ustar rakusersPNG  IHDR V%(IDATxm0Lb )nK'-X B!9Dzѧي|o&C{/މsYk1#gZL B.mz#\@* // _,LPߪZQ[6@]8_fX`ⷹ=L[+/C qfS(RR| D_H/$@&L!`IENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/f03n2c08.png0000600000175000001440000000241314003056224022562 0ustar rakusersPNG  IHDR IDATx}]TeϼggZ,(BB2B*M  zxc~PwUwMW{m "^XvabE|}893a?Qr6WŊG7٧7m/ڗ^wډ7I-]!{S{=qž~S̱u/EP2E(B ƚ%Eȃ/)¨2a&$&c-ˈZFGawK$qIJ 3<{=<{xjxJ=Z5fLP9 0U~4 ߄-|fm@+u1qv7/M1 i"ޡE*plCǰby% &'0B{C* T L @cg\B 9IENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/f02n2c08.png0000600000175000001440000000330114003056224022556 0ustar rakusersPNG  IHDR IDATxmI$yoD-YKWee xƓ s@#xƃ0" (*"҈=ݵuUU&eAjҞPRd91aTI)5aXL+Fxx\7enhƸ}Lʢ62+/PDa\KAe@(8sIs qU%2Wm:!UQeD))C&5k,xs[T/&\K\{pN`Wσ1+l)LxƄQaDÝ뱭w,;{q7Mt FO|Azz:ԡ-4AԣvZlĶeǛmWfy>ohy2DR:AO+16=MlemĶ쁳EEyOlnB79D#9FW-4z6Gj6cϑpײ*3%%sp&aKpmϱ(pвݘ-gV~jv݊)&Rz!6So'ގ%4[^l;ζm:[ ,X)HlW#PTL|o-o.)8iGqь{uHGg6[m~.~?7i7iæ5d=_0?IR'iК&x[]{ r>@Btttؤf2gLX2iɔX!.y,'͑ Jqie<z<}B ,;{3:rwBnNN,' -KQXq©pzv[llĬ98;bEAQyNfV|JK'DmN~ TªcrԿC(*ۡӥWfvJ'~ TºcHV5d +Kѡۥ2Q$+^B T+*abts:9yF^VӒ1{1;-Ǧc-C>We==IENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/f02n0g08.png0000600000175000001440000000054314003056224022565 0ustar rakusersPNG  IHDR V%(*IDATx/KQ8 A M,XI0 V `M`b,AA}_æ½pp:<&1"iDD1Zw{B1FDJA)JAP R4A`w{s=4Jtm}L\$ EDj@M'TR$z.BĢ ..k>PZdOb 31z]贘G1(q tڷOr|1:S! ?C+k[;{CAE  䗿IENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/f01n2c08.png0000600000175000001440000000223414003056224022561 0ustar rakusersPNG  IHDR cIDATx?%UΜ34"XBc+АPF M(,hH((,10V5RB %,bܝ토x7}ost°ٙbW>y~Lk鯝U(3kAy=uesp+ȍ2:SAE7woyU~wz:`{('^TU*qVNzS)S[I[DY\O*_ ?+t|' E3ǧpդ$LTPMR54: @|6ۿ|a3Ƞ@ *TTA:0`pIvz (Ȓ"Dթhbvt;}@8}*(fDv8䨞ꨞi٫ُ3Zg { IdyW LδH Q=~w'%hr')<Gh9^zp70FR(;{ ^xڹ ,#)Q%1%j&2N? p(QT; d 5'ER E,%Δ̔G̨Zf; v:1#i%aL11oꂛctƬeQ !y{b$FR:cF^B)LRj56 1,ڠxOHLĵΗ%+XLJL@<4 CGb"5FȕRN l]B.Ot'R(60 P]~rpg߅8+G 䡲\ V.: pi!„& A뾝;:QDZc(? @&K炭YY󸠄X@WWs]-7sK#lfi<<p_hNKzNsL,sɧwKsi\U5󸾄n`cߪZg[#ۛxRϮvw|/eEiywn!>Ǥ-L%QI4be.WsxpC!7y|M wVpw[yi̓x?]9//[סFʤ16X-lql*BS=sV} XCS5߯Z ɛgx" :1è&v&QM,eW>O."%b/U=m&5hꝼ}w !iP㇍17QKbOd7Wym,`_!7~Sg5Zުwm k;}'D8,G"r4*bU5M3꺑4d&3҉<$א/udE r]Dߎ#qqxN7t)?7&+uŗo6p-[ca!I#’3"ccUyt4g9OWsN Xsvwf7؀d0D_ T% RRFD2cR?([stw2^qz},bpFf_MA!DRRRR>Q?z vqN|Y\P|q%A:m'Ix,)B E0U It)2Gw"9{nΚӹDzbV\D O*V M(Y"`l?KIV a?%cX:K= L*snXͿb#L w</[B!"8F?ǞԙR|-E \=k' ӹ׊6-Ng\p'<<4>Ẉ {C̆+n'<.x'7iPBkA)T'k4OMv{yv6TG6yp=7φ%B;&D-=x:&KX,Zan.nx pOhF)VXl1؁,']p1҃^LaS aQJˣXK*^#-]C¡{/! { 3L$[bNd`w#ǃ^8}O&XB/Q,XZ!72}yo]@ adE f;:Յ 72=E/a xDA~ &cJODaqkxNOHr9_ FLv$;`vb 7R=H& 6?(#a8#&p -a |4/ '.H$ fR@jȈ`p1 Qa' 9:o&Z$IENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/f00n0g08.png0000600000175000001440000000047714003056224022571 0ustar rakusersPNG  IHDR V%(IDATx/LBQsc77bXHfiT#Hl&bX 7s vsd:-ǧ׷fޗcC02CCpe. \B JPd"ܖ " sTRz"'!]8Rݖ9pg>7[m0EuʩPs"'}H '8JEXiVE?h$"ˋ?CCP75Cp`,%/}XPζIENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/ctzn0g04.png0000600000175000001440000000136114003056224022771 0ustar rakusersPNG  IHDR )gAMA1_tEXtTitlePngSuiteOUL1tEXtAuthorWillem A.J. van Schaik (willem@schaik.com)GAzTXtCopyrightxs/,L(QIU(KSNHQKO,/JU04յ4aRZzTXtDescriptionx-0 D~MLX`\C"8J UWY{wwRg+]|?BO&2 .IlL} "$ܮg<-.=KMk.QI#|Ě=&'*EQ5 o>ᤊ{,SPm{͹<}mUxoGmҥVbz@zTXtSoftwarexs.JM,IMQSHTK).I,sJ3 rK ҕBQzTXtDisclaimerxs+JM-O,JU`ԮIDATx] 0 P*@# #T10lPF`ؠF=IQ*u`%qk H񚈩mߟ э=,fOK t(F ;P{xp]9/p*$(*yՃ@C  cqNU#)11.rf0gh(tEkIENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/ctjn0g04.png0000600000175000001440000000165514003056224022757 0ustar rakusersPNG  IHDR )gAMA1_ iTXtTitlejaタイトルPngSuite\8iTXtAuthorja著者Willem van Schaik (willem@schaik.com)̡SiTXtCopyrightja本文へ著作権ウィレムヴァンシャイク、カナダ2011_mwiTXtDescriptionja概要PNG形式の様々な色の種類をテストするために作成されたイメージのセットのコンパイル。含まれているのは透明度のフォーマットで、アルファチャネルを持つ、白黒、カラー、パレットです。すべてのビット深度が存在している仕様に従ったことができました。 ciTXtSoftwarejaソフトウェア"pnmtopng"を使用してNeXTstation色上に作成されます。ƒ02iTXtDisclaimerja免責事項フリーウェア。vCeIDAT(c``..ii d *)vt#dl?;s&9 Ȱj9h\rİ{3 Ϝ{wn޽#CN H>IENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/cthn0g04.png0000600000175000001440000000236514003056224022754 0ustar rakusersPNG  IHDR )gAMA1_&iTXtTitlehiशीर्षकPngSuiteSK>iTXtAuthorhiलेखकWillem van Schaik (willem@schaik.com)M}hiTXtCopyrighthiकॉपीराइटकॉपीराइट Willem van Schaik, 2011 कनाडाՅeiTXtDescriptionhiविवरणकरने के लिए PNG प्रारूप के विभिन्न रंग प्रकार परीक्षण बनाया छवियों का एक सेट का एक संकलन. शामिल काले और सफेद, रंग, पैलेटेड हैं, अल्फा चैनल के साथ पारदर्शिता स्वरूपों के साथ. सभी बिट गहराई कल्पना के अनुसार की अनुमति दी मौजूद हैं.ԑiTXtSoftwarehiसॉफ्टवेयरएक NeXTstation "pnmtopng 'का उपयोग कर रंग पर बनाया गया.QBiTXtDisclaimerhiअस्वीकरणफ्रीवेयर.-O@`IDAT(c_Pccдrq;:wL\\;e O 4V"OI@ 2`ݻ%K@H IENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/ctgn0g04.png0000600000175000001440000000223614003056224022750 0ustar rakusersPNG  IHDR )gAMA1_ iTXtTitleelΤίτλοςPngSuite @FiTXtAuthorelΣυγγραφέαςWillem van Schaik (willem@schaik.com)*6fiTXtCopyrightelΠνευματικά δικαιώματαΠνευματικά δικαιώματα Schaik van Willem, Καναδάς 2011#viTXtDescriptionelΠεριγραφήΜια συλλογή από ένα σύνολο εικόνων που δημιουργήθηκαν για τη δοκιμή των διαφόρων χρωμάτων-τύπων του μορφή PNG. Περιλαμβάνονται οι ασπρόμαυρες, χρώμα, paletted, με άλφα κανάλι, με μορφές της διαφάνειας. Όλοι λίγο-βάθη επιτρέπεται σύμφωνα με το spec είναι παρόντες.)iTXtSoftwareelΛογισμικόΔημιουργήθηκε σε ένα χρώμα NeXTstation χρησιμοποιώντας "pnmtopng".CxCiTXtDisclaimerelΑποποίησηΔωρεάν λογισμικό.,l]IDAT(A! Ch,`P X@ ӝ= KǘDifki}{) %5 #E9AEIENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/ctfn0g04.png0000600000175000001440000000131414003056224022743 0ustar rakusersPNG  IHDR )gAMA1_iTXtTitlefiOtsikkoPngSuiteI9iTXtAuthorfiTekijäWillem van Schaik (willem@schaik.com)MHiTXtCopyrightfiTekijänoikeudetCopyright Willem van Schaik, Kanada 2011iTXtDescriptionfiKuvauskokoelma joukon kuvia luotu testata eri väri-tyyppisiä PNG-muodossa. Mukana on mustavalkoinen, väri, paletted, alpha-kanava, avoimuuden muodossa. Kaikki bit-syvyydessä mukaan sallittua spec on ​​läsnä.6qY?iTXtSoftwarefiOhjelmistotLuotu NeXTstation väriä "pnmtopng".Qm]-iTXtDisclaimerfiVastuuvapauslausekeFreeware.w/HIDAT(c..ii d ()! ΜI <w*иd w9C rAĽIENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/cten0g04.png0000600000175000001440000000134614003056224022747 0ustar rakusersPNG  IHDR )gAMA1_iTXtTitleenTitlePngSuiteլ8iTXtAuthorenAuthorWillem van Schaik (willem@schaik.com)EW AiTXtCopyrightenCopyrightCopyright Willem van Schaik, Canada 20113 iTXtDescriptionenDescriptionA compilation of a set of images created to test the various color-types of the PNG format. Included are black&white, color, paletted, with alpha channel, with transparency formats. All bit-depths allowed according to the spec are present.~5 DGiTXtSoftwareenSoftwareCreated on a NeXTstation color using "pnmtopng".$iTXtDisclaimerenDisclaimerFreeware.Ӿ2 LIDAT(c..ii d ()! ΜII@@ \<\ݻϜ!OztݳQU4IENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/ct1n0g04.png0000600000175000001440000000143014003056224022655 0ustar rakusersPNG  IHDR )gAMA1_tEXtTitlePngSuiteOUL1tEXtAuthorWillem A.J. van Schaik (willem@schaik.com)G8tEXtCopyrightCopyright Willem van Schaik, Singapore 1995-96P8tEXtDescriptionA compilation of a set of images created to test the various color-types of the PNG format. Included are black&white, color, paletted, with alpha channel, with transparency formats. All bit-depths allowed according to the spec are present.M k9tEXtSoftwareCreated on a NeXTstation color using "pnmtopng".jdytEXtDisclaimerFreeware._,JIDATx] 0 P*@# #T10lPF`ؠF=IQ*u`%qk H񚈩mߟ э=,fOK t(F ;P{xp]9/p*$(*yՃ@C  cqNU#)11.rf0gh(tEkIENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/ct0n0g04.png0000600000175000001440000000042114003056224022653 0ustar rakusersPNG  IHDR )gAMA1_IDATx] 0 P*@# #T10lPF`ؠF=IQ*u`%qk H񚈩mߟ э=,fOK t(F ;P{xp]9/p*$(*yՃ@C  cqNU#)11.rf0gh(tEkIENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/cs8n3p08.png0000600000175000001440000000040014003056224022677 0ustar rakusersPNG  IHDR DgAMA1_`PLTE ߠ?_`@`@_ ?cKIDATx0[> |Gp "lX *A/P $BP Z.Y N-x)>SIENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/cs8n2c08.png0000600000175000001440000000022514003056224022666 0ustar rakusersPNG  IHDR gAMA1_LIDATxA 0 BQcjS҉hi Dk`j}0MA_uoFIENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/cs5n3p08.png0000600000175000001440000000041714003056224022704 0ustar rakusersPNG  IHDR DgAMA1_sBIT&C`PLTEB{c!Z::cZ!B{G/KIDATx0[>@Vj%(`R A XtY VA,`d\p *-hq>IENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/cs5n2c08.png0000600000175000001440000000027214003056224022665 0ustar rakusersPNG  IHDR gAMA1_sBIT&CbIDATx핱@ Ô;/Awl@*QEDqm\a .[p=jE'-X@O0 WyH0o y<Aa=^ohIENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/cs3n3p08.png0000600000175000001440000000040314003056224022675 0ustar rakusersPNG  IHDR DgAMA1_sBITBTPLTEmmI$$II$m$Imp+KIDATxbWT#$tNzC{h t. mtn:B"@3w&IENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/cs3n2c16.png0000600000175000001440000000032614003056224022662 0ustar rakusersPNG  IHDR 1gAMA1_sBIT 7~IDATx @ H*)^ < 4\u wClPgXPR3ޛߟ:Ž~!N$#|G}LCli(?c"B@aEDG@0S&i\vgIENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/cm9n0g04.png0000600000175000001440000000044414003056224022662 0ustar rakusersPNG  IHDR )gAMA1_tIME ;;u0IDATx] 0 P*@# #T10lPF`ؠF=IQ*u`%qk H񚈩mߟ э=,fOK t(F ;P{xp]9/p*$(*yՃ@C  cqNU#)11.rf0gh(tEkIENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/cm7n0g04.png0000600000175000001440000000044414003056224022660 0ustar rakusersPNG  IHDR )gAMA1_tIME V IDATx] 0 P*@# #T10lPF`ؠF=IQ*u`%qk H񚈩mߟ э=,fOK t(F ;P{xp]9/p*$(*yՃ@C  cqNU#)11.rf0gh(tEkIENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/cm0n0g04.png0000600000175000001440000000044414003056224022651 0ustar rakusersPNG  IHDR )gAMA1_tIME "8ݜIDATx] 0 P*@# #T10lPF`ؠF=IQ*u`%qk H񚈩mߟ э=,fOK t(F ;P{xp]9/p*$(*yՃ@C  cqNU#)11.rf0gh(tEkIENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/ch2n3p08.png0000600000175000001440000000342214003056224022665 0ustar rakusersPNG  IHDR DgAMA1_PLTE"Dww :w""""Uffff"DDUU"DDUU3DDff3D"ffD33U*D˺[""f2Ucw:DDkfBkܺ33sJw{"w332fDwJf""UUDff3UwwDwffD"w"3333cU3{UUUUf܃wwUUww""DD3ԪU*U˴f3BSD̙"Sww333Ĉwff""UU"DD[wfwws33wD""U"f 3bhISTMIDATx GHd+;3 ekXegа**4h lޣY2W%syiHCL*;8"KE6sx'HK?Y9sģ>1~!'B 0IENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/ch1n3p04.png0000600000175000001440000000040214003056224022653 0ustar rakusersPNG  IHDR TggAMA1_sBITw-PLTE""fwDDҰIhIST@p0`` P@0PpHYAGIDATxc =sfժrcwfd C+(H*ŅTݻq@*)#MK#G{7}IENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/cdun2c08.png0000600000175000001440000000132414003056224022745 0ustar rakusersPNG  IHDR gAMA1_sBITw pHYs{RkgIDATx qjhWK %ܵB q @ Fx7 zO/̃/[ü ̍ӑm@`]]6y~KXa;e" ṯ[I=du5V3>&?wVӶc[lJ6YՖ` ⤉)?euSX,QOyKN]J:#< CL=v%$ǃ'JwMk=b+\u;zwP^<'pbS d(@J,=9ּnH])rt`oIAtUۛDVbmB5˙(YkTns=xBd"\`"[ fRhz0'mehCMݨ3  Ldٯ?`~+Іdl*#p]q2^ɩ8|_ rj:2Ckiʙ9ff |ADJi?c~++ 範t>rl5yM.f P6@.lIENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/cdsn2c08.png0000600000175000001440000000035014003056224022741 0ustar rakusersPNG  IHDRKm)gAMA1_sBITw pHYsO%{IDATxEQ @DSga-B+ X JV++|4L2]C0بp|̡b?Liy+[}5kIR0_66T$'GjD>Pe}P] aO_w |*/^֮IENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/cdhn2c08.png0000600000175000001440000000053014003056224022726 0ustar rakusersPNG  IHDR jgAMA1_sBITw pHYsUeIDATx}k ZB,B,B,XX#!Btvw@Ÿ7xźG93zWڣ / X ]D,lpar )fK+J^?]OFsaM̂h$kQt0N;8t-F Bf =SpԕjAdf"(>/6ީ~k\hIENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/cdfn2c08.png0000600000175000001440000000062414003056224022730 0ustar rakusersPNG  IHDR gAMA1_sBITw pHYs2R0'IDATxUaq0 ௙SPp R8 @h Tv6]iW[dogsPz`qfX)\ةo_ճ_ժLNNq u*nVS pv5%/sPdG"Gx% ^ .Utl[mv=K#~e%ȥkQ|܏y1](+AFK F898%| OҎISSq-r3˯[œ"}p4=ABYi9Q@u3us IENDB`uTox/third_party/stb/stb/tests/pngsuite/unused/ccwn3p08.png0000600000175000001440000000302214003056224022761 0ustar rakusersPNG  IHDR DgAMA1_ cHRMz&u0`:pQ<PLTEމu k51I&442tQ#l-^>bOw3X .c$s=;Y\z<HA(-I`%{KR~o|dqj`+_p5]g+=dEcC=K&037c, G6ǫfYLqLَJ{AL;[@]~T<e9O)f ˝4foX㌖Ae=6&^?)gKT!i¿kK{|SiC/5^eMu@~rs>oݛ?@3'0|{O%?|{S 9OU>/WLbz Y+к+JIDATxc8B0m\ 4RR¥ #* \kjZ]OhM$]un6n SUrn: a(`Ywhsh \7Oڿ{ѣ[BCWǣ*Uy~55T]E$Wvwk^a\",:Ad9IW 45dVUO8\YI$.lkzÂzz $\\cz)nh4Ck']pn.OM^ȱr-e8q́_jխ[ Nl)s6SE^~YPtKQQ ۇNX&Ѷ]I{7(31s+H׀ ]jSRokV֩e+O>{bk'ܙt>/_N-[&$T"+a)P^Me#ΗS>BϜ93or S}}TT6*@Hp4R1 Ng V㬞d<t:XAդ>#88z~ N{nCT8^@7f{0>c&`[M4.!E4&AKgڧ藘MtP]k):b$B`نDua֎ś1pi{nLO .Q*F搸 kº0求xIv |it(=7b65aC #a$ SANEG{G8gCa, 7^^=I]BЭ-Cʅ;8N{A$6$*0Ԍ>qل"a:&$2u>Of[9E fskTZ$ A27CRu,_9s_~G5b .07ɛmK9.r<};,%"o㞩6",5f}<ܞo@JLWW/FJ*y]^'; D(IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/0000700000175000001440000000000014003056224022224 5ustar rakusersuTox/third_party/stb/stb/tests/pngsuite/primary_check/z09n2c08.png0000600000175000001440000000064614003056224024137 0ustar rakusersPNG  IHDR szzgAMA asRGB cHRMz&u0`:pQ<bKGDIDATXҹ 0,bʱ&78dg={owvd>)2@88"TƝq q q Ƹq9n+Wp q  tpptqf8# N `FhOFh*;|G18p& Om%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:05:54-07:00IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/z06n2c08.png0000600000175000001440000000064614003056224024134 0ustar rakusersPNG  IHDR szzgAMA asRGB cHRMz&u0`:pQ<bKGDIDATXҹ 0,bʱ&78dg={owvd>)2@88"TƝq q q Ƹq9n+Wp q  tpptqf8# N `FhOFh*;|G18p& Om%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:05:52-07:00 IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/z03n2c08.png0000600000175000001440000000064614003056224024131 0ustar rakusersPNG  IHDR szzgAMA asRGB cHRMz&u0`:pQ<bKGDIDATXҹ 0,bʱ&78dg={owvd>)2@88"TƝq q q Ƹq9n+Wp q  tpptqf8# N `FhOFh*;|G18p& Om%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:05:52-07:00 IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/z00n2c08.png0000600000175000001440000000064614003056224024126 0ustar rakusersPNG  IHDR szzgAMA asRGB cHRMz&u0`:pQ<bKGDIDATXҹ 0,bʱ&78dg={owvd>)2@88"TƝq q q Ƹq9n+Wp q  tpptqf8# N `FhOFh*;|G18p& Om%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:05:52-07:00 IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/tp1n3p08.png0000600000175000001440000000356714003056224024244 0ustar rakusersPNG  IHDR szzgAMA1_bKGDIDATXŗo?37^0׬5yj#"ED%ry"E"yK>U-E jd]X0q1Գw\c.%Rv͞s~sVBszt:-fffD\~! ms8ɈoM2=}eDB,^s|ǏDMi5*$333,..P'4?Qv$a`oEoFQ岸qdwb:7e2xaP Owtu|v;ze8X !m H&$IRiB6KhzFv.y;hVVpt5߾{( hX,@@0;;+Ν;G^g}o_Ut@~?Q==DI,-A /`"V$ &'' E\. à^D[X@|24[z/w ;m6<@0x:u]'SՈFu#@ulPl,Fh嫽m#96Frl&i)4M `xxx3a5sR8G׎v1 jJ^j[OAXP(:a`@ni޻j։K%:omnXZ5ߟp(Ϗ32l_RrSͩvсB`YV,XXhG?6p12wu>< ZƊoX, otwy(aZ[]D"d BwC 0:[dqd` +H H0:rIOPEt| ϒBJ, 00Mtځe54Nw`Ѕ3>٦lo:)Лz@`Y6P&'r9^yM#ɓ',٭8`뢾7Xv ӂ\Vq: rnn|?~C=v2ڤ҇P'xݭ7}t9R,Z;%2kk6]ۋa48rdb˱l˩8HHOf``x+z$!}}Q, `H$8>q,BҩSx}u2-Qh`Y^o8)^}Dv?uB~TnssbTUysۛnEÇiL>|3gΠ3 i8{,tYe{fBpQ;,ҥKHb'X\/Ν+nĉ>P(9a Hh%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify2011-04-10T12:21:04-07:00_1RLT$i*jR/ZiJ\  P]NS*6Z"AS` 48h9݅Y.G:_y~|5:tHS:0>;v011A0vɖ-DA{{;g//D~i۶%mmmD"]ƽ{r<&EN&ZYJ/oͪwa] @GG͛7D"ܽ{P5831<2 Y|}= WoVf3ޣ BA:;;Tr`D""GX,B"vU8=i 55D<Ί5kx49uj /SUifAdY ijjɓs&#@$FlFL@bUDh8IH&/},[l `xx6m4_ۋl M$׭wV(dc#B*m<~UV؁X^|^q( T\.g|||.aC(-Fjjj(8QU0:DZZ,`P,IRLOOS(4@ @oo\Ӊ|\11GٷڼhF6%?ϩ)4iv9}tvvb_f':5܇놋nljR,&> rD5c w K _*UjRVAu!DL&^χBe$IB$ B b$ۈF45,'!p:qN;Ki W+!WzÝ;+?}?\yLf=fɿ8@ummK=n0N~/8=JV3as/ zul9$7؀xҥ\O]]]4gϞ}2BEv6E{Rw/5HoGǽ{c>?gcu5---k8vSJ0ǏxP` V+"=#֛LLe;wRSS墽}?~zzz`0PZZ墲sν 088ȵk׈D"!e lG#.?yNݸtSSDXB,pK0aZ!?ڕvL&fMӈD"KK[-+CΝ(/G q Qv3?ML֒nTUŋax ##!b\g$33x]wbɂY#AD"#iryJ8qw:QǾ}d)YhF0${ *H$\pae ۱X, 2os#L&H$,.. Vo+I" )edEzc.rH$t,Q DonFWiiideeQPPf`0 2,#IxI?Oyh&t!VaM뺎xɢ0< |N>fAcAx@DE@iws(NgEQ7X',XX!,Nd tKUUB  t `lǿy7#Gpymآoxӄ rIՀ"r `1ϗvƆ W?nmmm{\"V9.S>V\5u9@Y,CLww&?:?½{n/_LSSEEET=J/9,)ͽ,O-í[˼)x.8<۹"oQn\#H^O_f/]?\paBeJ ).;t:b޽*N?ǿիWx<r@$8p:ڎfgϞڵ+5b1$Iø5ɓܸq( F'NpΝKhlldnn/0pԩ_9C7n׻)%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify2011-04-10T12:21:04-07:00U0  +"V`/:\ ͢* 8}AQ " Lfu] Bx^~?{졵u{EQB뺳˲u*JRzw,ˢ\.IWWPX,FOO/_ `Y(: nRH&Nc@Y677I$tttl[TB\.D"Q~,rzeY`YiR]]l0z[ |>r"˲3Rhi("R MӰ,P(Dgg~H$S $UD\.;"4H$rڵk%c&~ɧwc,`7(41MP(DMM @Y43r&ܷoBdYvW4dYvn;w/X,b3cY>#Gӧ0 '%άB Ic ړ07n7pr sss QXz`(׋i DgbblcG]?K=F³gx1_ n߾GNA8v΂}}}<ﳓx1ezzAW]]iPX,ܺukG~>pyLDUUg\igr?~gnƍ8qÇ;4 ɓ'+###YrwK. ;F @$.^ȫWvw044D&ݻ̟\zo~!Aݕ%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify2011-04-10T12:21:04-07:00U-E jd]X0q1Գw\c.%Rv͞s~sVBszt:-fffD\~! ms8ɈoM2=}eDB,^s|ǏDMi5*$333,..P'4?Qv$a`oEoFQ岸qdwb:7e2xaP Owtu|v;ze8X !m H&$IRiB6KhzFv.y;hVVpt5߾{( hX,@@0;;+Ν;G^g}o_Ut@~?Q==DI,-A /`"V$ &'' E\. à^D[X@|24[z/w ;m6<@0x:u]'SՈFu#@ulPl,Fh嫽m#96Frl&i)4M `xxx3a5sR8G׎v1 jJ^j[OAXP(:a`@ni޻j։K%:omnXZ5ߟp(Ϗ32l_RrSͩvсB`YV,XXhG?6p12wu>< ZƊoX, otwy(aZ[]D"d BwC 0:[dqd` +H H0:rIOPEt| ϒBJ, 00Mtځe54Nw`Ѕ3>٦lo:)Лz@`Y6P&'r9^yM#ɓ',٭8`뢾7Xv ӂ\Vq: rnn|?~C=v2ڤ҇P'xݭ7}t9R,Z;%2kk6]ۋa48rdb˱l˩8HHOf``x+z$!}}Q, `H$8>q,BҩSx}u2-Qh`Y^o8)^}Dv?uB~TnssbTUysۛnEÇiL>|3gΠ3 i8{,tYe{fBpQ;,ҥKHb'X\/Ν+nĉ>P(9a Hh%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify2011-04-10T12:21:04-07:00U-E jd]X0q1Գw\c.%Rv͞s~sVBszt:-fffD\~! ms8ɈoM2=}eDB,^s|ǏDMi5*$333,..P'4?Qv$a`oEoFQ岸qdwb:7e2xaP Owtu|v;ze8X !m H&$IRiB6KhzFv.y;hVVpt5߾{( hX,@@0;;+Ν;G^g}o_Ut@~?Q==DI,-A /`"V$ &'' E\. à^D[X@|24[z/w ;m6<@0x:u]'SՈFu#@ulPl,Fh嫽m#96Frl&i)4M `xxx3a5sR8G׎v1 jJ^j[OAXP(:a`@ni޻j։K%:omnXZ5ߟp(Ϗ32l_RrSͩvсB`YV,XXhG?6p12wu>< ZƊoX, otwy(aZ[]D"d BwC 0:[dqd` +H H0:rIOPEt| ϒBJ, 00Mtځe54Nw`Ѕ3>٦lo:)Лz@`Y6P&'r9^yM#ɓ',٭8`뢾7Xv ӂ\Vq: rnn|?~C=v2ڤ҇P'xݭ7}t9R,Z;%2kk6]ۋa48rdb˱l˩8HHOf``x+z$!}}Q, `H$8>q,BҩSx}u2-Qh`Y^o8)^}Dv?uB~TnssbTUysۛnEÇiL>|3gΠ3 i8{,tYe{fBpQ;,ҥKHb'X\/Ν+nĉ>P(9a Hh%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify2011-04-10T12:21:04-07:00ޑ IE#>|H(4M\R ^/˅ahFL^UY>rxo/B4J_j.GpnptàponTu]ŋ  1LVgpQ.) J&L$Hd0 0cݵL/$\8ι9j0r nHA&!H:a`&^*^PWW'nj !wb?áa@4Y__'oVD>'MAPs%۳k]tr ݾ^Tv@ '͒jN\*d2}[zr=`E;--OxrjjW MzeަUv!^R !Vǿ2(ʟ9~<`7;}p>l6-åXVAwqܡ؅} ‡*W:;.<piJnUKeY!u˂ 6${_ +0\K.C-ʚfE\rU{4p,H ]@C@q aXB <ʝkycct΍#Q̀Ͳm)ϗoԩ&&{^!v-WEp}&/U{1%OTc\v FkG:ׯ_'( ,b!8{,/^D77Bܾ}I$IbaaL&(OOO،p8,nܸ,.]ѣ;+B $mmm?I_ns@}%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify2011-04-10T12:21:04-07:00U-E jd]X0q1Գw\c.%Rv͞s~sVBszt:-fffD\~! ms8ɈoM2=}eDB,^s|ǏDMi5*$333,..P'4?Qv$a`oEoFQ岸qdwb:7e2xaP Owtu|v;ze8X !m H&$IRiB6KhzFv.y;hVVpt5߾{( hX,@@0;;+Ν;G^g}o_Ut@~?Q==DI,-A /`"V$ &'' E\. à^D[X@|24[z/w ;m6<@0x:u]'SՈFu#@ulPl,Fh嫽m#96Frl&i)4M `xxx3a5sR8G׎v1 jJ^j[OAXP(:a`@ni޻j։K%:omnXZ5ߟp(Ϗ32l_RrSͩvсB`YV,XXhG?6p12wu>< ZƊoX, otwy(aZ[]D"d BwC 0:[dqd` +H H0:rIOPEt| ϒBJ, 00Mtځe54Nw`Ѕ3>٦lo:)Лz@`Y6P&'r9^yM#ɓ',٭8`뢾7Xv ӂ\Vq: rnn|?~C=v2ڤ҇P'xݭ7}t9R,Z;%2kk6]ۋa48rdb˱l˩8HHOf``x+z$!}}Q, `H$8>q,BҩSx}u2-Qh`Y^o8)^}Dv?uB~TnssbTUysۛnEÇiL>|3gΠ3 i8{,tYe{fBpQ;,ҥKHb'X\/Ν+nĉ>P(9a Hh%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify2011-04-10T12:21:04-07:00U-E jd]X0q1Գw\c.%Rv͞s~sVBszt:-fffD\~! ms8ɈoM2=}eDB,^s|ǏDMi5*$333,..P'4?Qv$a`oEoFQ岸qdwb:7e2xaP Owtu|v;ze8X !m H&$IRiB6KhzFv.y;hVVpt5߾{( hX,@@0;;+Ν;G^g}o_Ut@~?Q==DI,-A /`"V$ &'' E\. à^D[X@|24[z/w ;m6<@0x:u]'SՈFu#@ulPl,Fh嫽m#96Frl&i)4M `xxx3a5sR8G׎v1 jJ^j[OAXP(:a`@ni޻j։K%:omnXZ5ߟp(Ϗ32l_RrSͩvсB`YV,XXhG?6p12wu>< ZƊoX, otwy(aZ[]D"d BwC 0:[dqd` +H H0:rIOPEt| ϒBJ, 00Mtځe54Nw`Ѕ3>٦lo:)Лz@`Y6P&'r9^yM#ɓ',٭8`뢾7Xv ӂ\Vq: rnn|?~C=v2ڤ҇P'xݭ7}t9R,Z;%2kk6]ۋa48rdb˱l˩8HHOf``x+z$!}}Q, `H$8>q,BҩSx}u2-Qh`Y^o8)^}Dv?uB~TnssbTUysۛnEÇiL>|3gΠ3 i8{,tYe{fBpQ;,ҥKHb'X\/Ν+nĉ>P(9a Hh%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify2011-04-10T12:21:02-07:00. ]IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/tbbn0g04.png0000600000175000001440000000137214003056224024257 0ustar rakusersPNG  IHDR szzgAMA1_bKGDC=IDATXŗ[0 @QS(S(bi $LAc:۹|$V_SR;\~TU"D R =DTRJ@D`^R }U""0MU"9z !x (Hm<{gޙy7|瘉s3/P~܃s*3CvQ9hZYe{er[ѾM Qa"|Fcgwk:S~$"=>^*=}/EhW 6U@|c)k:F @,wgR\Go)lG{ j}YbbM$F<l =e30s,vV4Eo=ДvLgadP~z<f dlD)ãa0t߻%""eY·D|I:3ò,C'䡋sΰ,4zW˃:i)%9^Вu]s~lx:<@yQΨ @:HNI8CϾ 0Y4`=k4A:*F#M-Ec\{ A j/72Cjy78Ψ @:HNI8CϾ 0Y4`=k4A:*F#M-Ec\{ A j/72Cjy78/ܮNtS@ ,\UFT\mΜcn9[#tyXs:X4lzgPǺ}Dnָ+[LdRX:zikT6&'Oq7 t%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:03:32-07:00IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/s39i3p04.png0000600000175000001440000000076314003056224024140 0ustar rakusersPNG  IHDR''Q5gAMA1_bKGD6IDATX͘[ Cm=-j&Ix\)W ՚Xsa`Nr _4Ʋgs1K04 !;PMTVHxV"d<<[ `'K(ՠ#$T.ius"j40S[hkǞ#tވ Z:bFJ 7[7T2ez(훸:>/ܮNtS@ ,\UFT\mΜcn9[#tyXs:X4lzgPǺ}Dnָ+[LdRX:zikT6&'Oq7 t%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:03:42-07:00utIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/s38n3p04.png0000600000175000001440000000066714003056224024147 0ustar rakusersPNG  IHDR&&=gAMA1_bKGDIDATX EOs{A-nFא rRJKt I# O0 EZ ?C,=+JyPϥcYF9f2TqlIx:VYϿK΍+8Ҵ\;%u$4&zO8Yj-8XK\pkj ܌y>֩)Ėu ֨2Kq?XU0, <ʠ..k4Op˲ WW5q%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:03:30-07:00.IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/s38i3p04.png0000600000175000001440000000066714003056224024142 0ustar rakusersPNG  IHDR&&=gAMA1_bKGDIDATX EOs{A-nFא rRJKt I# O0 EZ ?C,=+JyPϥcYF9f2TqlIx:VYϿK΍+8Ҵ\;%u$4&zO8Yj-8XK\pkj ܌y>֩)Ėu ֨2Kq?XU0, <ʠ..k4Op˲ WW5q%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:03:40-07:00IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/s37n3p04.png0000600000175000001440000000073614003056224024143 0ustar rakusersPNG  IHDR%%Ş gAMA1_bKGD!IDATX͗]0 m)wޮSvA~BiVaXCєvV@^sMxhf1t86e d$0CU"4c! ା)Hw8^E `2&G1O¨hM@"2,:hƖ'TT"(Rݷ7tuFYC'Q \vߓ⺩$N>9U(ĔY&^Wb]:w͡-,LYWT|v l\' \%_se s.,%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:03:30-07:00.IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/s37i3p04.png0000600000175000001440000000073614003056224024136 0ustar rakusersPNG  IHDR%%Ş gAMA1_bKGD!IDATX͗]0 m)wޮSvA~BiVaXCєvV@^sMxhf1t86e d$0CU"4c! ା)Hw8^E `2&G1O¨hM@"2,:hƖ'TT"(Rݷ7tuFYC'Q \vߓ⺩$N>9U(ĔY&^Wb]:w͡-,LYWT|v l\' \%_se s.,%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:03:40-07:00IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/s36n3p04.png0000600000175000001440000000070014003056224024131 0ustar rakusersPNG  IHDR$$gAMA1_bKGDIDATX]0 ; =@BuGi0B*' $$@*HJMGdz =އ.R0h8+Č5 x@;sLd tNT@y. $rp5PȨnKÀNovZۻ` ʢ(uq핡@X t ^ߠʂO6Hiz_i5@Y\üvS*MwQ@o5p~i~Գ?bV=Sm%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:03:28-07:00k0IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/s36i3p04.png0000600000175000001440000000070014003056224024124 0ustar rakusersPNG  IHDR$$gAMA1_bKGDIDATX]0 ; =@BuGi0B*' $$@*HJMGdz =އ.R0h8+Č5 x@;sLd tNT@y. $rp5PȨnKÀNovZۻ` ʢ(uq핡@X t ^ߠʂO6Hiz_i5@Y\üvS*MwQ@o5p~i~Գ?bV=Sm%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:03:38-07:00IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/s35n3p04.png0000600000175000001440000000073514003056224024140 0ustar rakusersPNG  IHDR##ٳYgAMA1_bKGD IDATX͖Q0 CwS{? F쑇  >eعe3c`"YT 2+" )i+nR;=M*&/G7kE/e" jܴ{@hצr%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:03:28-07:00k0IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/s35i3p04.png0000600000175000001440000000073514003056224024133 0ustar rakusersPNG  IHDR##ٳYgAMA1_bKGD IDATX͖Q0 CwS{? F쑇  >eعe3c`"YT 2+" )i+nR;=M*&/G7kE/e" jܴ{@hצr%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:03:36-07:00IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/s34n3p04.png0000600000175000001440000000065714003056224024142 0ustar rakusersPNG  IHDR"":G gAMA1_bKGDIDATXQ D; zG *Y5& *zN! @2$!a/<$2a mKQB~k"=aT5tO5yGfm֙@_@ڏ'c`5ednqE8ZU}+cq 'iNE`"4u 7ȉ#2WEqG5N;n<І/wo >I ?Ћi %tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:03:26-07:00GTmIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/s34i3p04.png0000600000175000001440000000065714003056224024135 0ustar rakusersPNG  IHDR"":G gAMA1_bKGDIDATXQ D; zG *Y5& *zN! @2$!a/<$2a mKQB~k"=aT5tO5yGfm֙@_@ڏ'c`5ednqE8ZU}+cq 'iNE`"4u 7ȉ#2WEqG5N;n<І/wo >I ?Ћi %tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:03:36-07:00IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/s33n3p04.png0000600000175000001440000000072614003056224024136 0ustar rakusersPNG  IHDR!!WogAMA1_bKGDIDATXWA %̾C jk$c X*\IRS+]LKBp5Bj6"h^qm oCHx_ 1Hwcp~yt$S ta͖ICJ(6zlx"шhˎ2 ';6 6Bke eaĤ)nkC{̎!-s0 ߯Dˤl6+(yϰ#qb1?l͎DHv ÔDPvc7(!#"oYi#G/%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:03:26-07:00GTmIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/s33i3p04.png0000600000175000001440000000072614003056224024131 0ustar rakusersPNG  IHDR!!WogAMA1_bKGDIDATXWA %̾C jk$c X*\IRS+]LKBp5Bj6"h^qm oCHx_ 1Hwcp~yt$S ta͖ICJ(6zlx"шhˎ2 ';6 6Bke eaĤ)nkC{̎!-s0 ߯Dˤl6+(yϰ#qb1?l͎DHv ÔDPvc7(!#"oYi#G/%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:03:34-07:00aIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/s32n3p04.png0000600000175000001440000000067114003056224024134 0ustar rakusersPNG  IHDR szzgAMA1_bKGDIDATXW[ 3p$!7-c@p%HBITȏ، hWE J2?~Ī+#p (.L> ey(ɑ<D;' h. ϒoT.F= QW ֠[L;1ٳ7.$C4N?iN-0EToe,QF*va8fxfՂkƹ u3S7<)?>Hc ^JA%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:03:24-07:00ˏDIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/s32i3p04.png0000600000175000001440000000067114003056224024127 0ustar rakusersPNG  IHDR szzgAMA1_bKGDIDATXW[ 3p$!7-c@p%HBITȏ، hWE J2?~Ī+#p (.L> ey(ɑ<D;' h. ϒoT.F= QW ֠[L;1ٳ7.$C4N?iN-0EToe,QF*va8fxfՂkƹ u3S7<)?>Hc ^JA%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:03:34-07:00aIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/s09n3p02.png0000600000175000001440000000040714003056224024133 0ustar rakusersPNG  IHDR gAMA1_bKGDJIDATӍA ! '˲]92Iq 0hRG]锡g2n`s%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:03:18-07:00IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/s09i3p02.png0000600000175000001440000000040714003056224024126 0ustar rakusersPNG  IHDR gAMA1_bKGDJIDATӍA ! '˲]92Iq 0hRG]锡g2n`s%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:03:22-07:00~IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/s08n3p02.png0000600000175000001440000000037714003056224024140 0ustar rakusersPNG  IHDRgAMA1_bKGDBIDATӅI  z5.x($x,ycep֏%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:03:16-07:00ۙIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/s03i3p01.png0000600000175000001440000000033014003056224024112 0ustar rakusersPNG  IHDRV(gAMA1_bKGDIDATcd W@82z~x>%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:03:20-07:00$WIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/s02n3p01.png0000600000175000001440000000032214003056224024117 0ustar rakusersPNG  IHDRr $gAMA1_bKGDIDATcd?- %tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:03:16-07:00ۙIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/s02i3p01.png0000600000175000001440000000032214003056224024112 0ustar rakusersPNG  IHDRr $gAMA1_bKGDIDATcd?- %tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:03:20-07:00$WIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/s01n3p01.png0000600000175000001440000000031214003056224024115 0ustar rakusersPNG  IHDRĉgAMA1_bKGD IDATc``rd%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:03:16-07:00ۙIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/s01i3p01.png0000600000175000001440000000031214003056224024110 0ustar rakusersPNG  IHDRĉgAMA1_bKGD IDATc``rd%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:03:18-07:00IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/bgwn6a08.png0000600000175000001440000000045214003056224024271 0ustar rakusersPNG  IHDR szzgAMA1_bKGDmIDATX1 0D/LaN?U!-6"1. >x9ug ue wp O wrAJCl@w@<P6@OR +JE%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:03:58-07:00)IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/bgbn4a08.png0000600000175000001440000000040714003056224024242 0ustar rakusersPNG  IHDR szzgAMA1_bKGDCJIDATXҡ 0E70Xm ^A0pHҾ6sx4DD^}w%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:03:48-07:00IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/bgan6a08.png0000600000175000001440000000045214003056224024243 0ustar rakusersPNG  IHDR szzgAMA1_bKGDmIDATX1 0D/LaN?U!-6"1. >x9ug ue wp O wrAJCl@w@<P6@OR +JE%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:03:56-07:00MtIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/bgai4a08.png0000600000175000001440000000040714003056224024234 0ustar rakusersPNG  IHDR szzgAMA1_bKGDJIDATXҡ 0E70Xm ^A0pHҾ6sx4DD^}w%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:03:48-07:00IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/basn6a08.png0000600000175000001440000000045214003056224024257 0ustar rakusersPNG  IHDR szzgAMA1_bKGDmIDATX1 0D/LaN?U!-6"1. >x9ug ue wp O wrAJCl@w@<P6@OR +JE%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:02:42-07:00IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/basn4a08.png0000600000175000001440000000040714003056224024255 0ustar rakusersPNG  IHDR szzgAMA1_bKGDJIDATXҡ 0E70Xm ^A0pHҾ6sx4DD^}w%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:02:36-07:00d<IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/basn3p08.png0000600000175000001440000000060314003056224024271 0ustar rakusersPNG  IHDR szzgAMA1_bKGDIDATX헱0 D(9eB"尀 ߖ:#+u@ޅP~q?/d_q(UPEЎ}nP!7 @l'@|<`mW=C 0'% C(~Q"j,Nh!huQC 6Nk Biyױhkӡ%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:02:34-07:00IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/basn3p04.png0000600000175000001440000000051314003056224024265 0ustar rakusersPNG  IHDR szzgAMA1_bKGDIDATX 0 I:KW`bFU*K׆Z';Zs wO%2;st`~=0:sLw@v{љ`(3U3G0xz(3w0l8%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:02:30-07:00IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/basn3p02.png0000600000175000001440000000043614003056224024267 0ustar rakusersPNG  IHDR szzgAMA1_bKGDaIDATXA 0'jsǖlK61`@8R~܁ȱo;3ŏԏ;P}h( <'Ч%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:02:30-07:00IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/basn3p01.png0000600000175000001440000000042114003056224024260 0ustar rakusersPNG  IHDR szzgAMA1_bKGDTIDATXc|_?0Ie83SL  F% :<F8Zx-F0Z:`uh90[jb%T%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:02:30-07:00IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/basn2c08.png0000600000175000001440000000042214003056224024252 0ustar rakusersPNG  IHDR szzgAMA1_bKGDUIDATXԱ 0 A+m) <@BZdkH(g Ly|n\_νzY^%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:02:26-07:00SIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/basn0g08.png0000600000175000001440000000044514003056224024261 0ustar rakusersPNG  IHDR szzgAMA1_bKGDhIDATXֱ ! @1B?b(/\5NLEk-r 0$UUPM{˖`/sbHl`s$1|oAD`1{. d# T%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:02:20-07:00FiIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/basn0g04.png0000600000175000001440000000037414003056224024256 0ustar rakusersPNG  IHDR szzgAMA1_bKGD?IDATXұ AX  -sHsy<h@4p$j h%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:02:18-07:00v&IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/basn0g02.png0000600000175000001440000000043314003056224024250 0ustar rakusersPNG  IHDR szzgAMA1_bKGD^IDATXK 0DgJbm6!XRvW}?՚'@sFk85g87o%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:02:18-07:00v&IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/basn0g01.png0000600000175000001440000000060714003056224024252 0ustar rakusersPNG  IHDR szzgAMA1_bKGDIDATXŗA@UzqL5%(:DI8|$nۢSo|Zkz7{3b8Wsj =_kZ6PT 8|[6x9ug ue wp O wrAJCl@w@<P6@OR +JE%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:03:12-07:00=IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/basi4a08.png0000600000175000001440000000040714003056224024250 0ustar rakusersPNG  IHDR szzgAMA1_bKGDJIDATXҡ 0E70Xm ^A0pHҾ6sx4DD^}w%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:03:04-07:009IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/basi3p08.png0000600000175000001440000000060314003056224024264 0ustar rakusersPNG  IHDR szzgAMA1_bKGDIDATX헱0 D(9eB"尀 ߖ:#+u@ޅP~q?/d_q(UPEЎ}nP!7 @l'@|<`mW=C 0'% C(~Q"j,Nh!huQC 6Nk Biyױhkӡ%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:03:02-07:00>IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/basi3p04.png0000600000175000001440000000051314003056224024260 0ustar rakusersPNG  IHDR szzgAMA1_bKGDIDATX 0 I:KW`bFU*K׆Z';Zs wO%2;st`~=0:sLw@v{љ`(3U3G0xz(3w0l8%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:02:58-07:00lIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/basi3p02.png0000600000175000001440000000043614003056224024262 0ustar rakusersPNG  IHDR szzgAMA1_bKGDaIDATXA 0'jsǖlK61`@8R~܁ȱo;3ŏԏ;P}h( <'Ч%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:02:58-07:00lIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/basi3p01.png0000600000175000001440000000042114003056224024253 0ustar rakusersPNG  IHDR szzgAMA1_bKGDTIDATXc|_?0Ie83SL  F% :<F8Zx-F0Z:`uh90[jb%T%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:02:58-07:00lIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/basi2c08.png0000600000175000001440000000042214003056224024245 0ustar rakusersPNG  IHDR szzgAMA1_bKGDUIDATXԱ 0 A+m) <@BZdkH(g Ly|n\_νzY^%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:02:54-07:005cIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/basi0g08.png0000600000175000001440000000044514003056224024254 0ustar rakusersPNG  IHDR szzgAMA1_bKGDhIDATXֱ ! @1B?b(/\5NLEk-r 0$UUPM{˖`/sbHl`s$1|oAD`1{. d# T%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:02:48-07:00>ƇIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/basi0g04.png0000600000175000001440000000037414003056224024251 0ustar rakusersPNG  IHDR szzgAMA1_bKGD?IDATXұ AX  -sHsy<h@4p$j h%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:02:48-07:00>ƇIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/basi0g02.png0000600000175000001440000000043314003056224024243 0ustar rakusersPNG  IHDR szzgAMA1_bKGD^IDATXK 0DgJbm6!XRvW}?՚'@sFk85g87o%tEXtdate:create2014-12-13T23:09:12-08:00q %%tEXtdate:modify1998-04-05T22:02:46-07:00nIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary_check/basi0g01.png0000600000175000001440000000060714003056224024245 0ustar rakusersPNG  IHDR szzgAMA1_bKGDIDATXŗA@UzqL5%(:DI8|$nۢSo|Zkz7{3b8Wsj =_kZ6PT 8|[6W$n(8yKr-"ˡ %PzPE:wNh~uJLН#uOE" m(t:][ZWXtF]]Tҗ^}@'#si" |A~UUNnIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/z06n2c08.png0000600000175000001440000000034014003056224022766 0ustar rakusersPNG  IHDR IDATxK Кv1~a>W$n(8yKr-"ˡ %PzPE:wNh~uJLН#uOE" m(t:][ZWXtF]]Tҗ^}@'#si" |A~UUNn1R,IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/z03n2c08.png0000600000175000001440000000035014003056224022764 0ustar rakusersPNG  IHDR IDATx^@0 J\l" [ןED=SJSf^տ> xЀ(9CNщ֠ .Gtx_AC:$%tgcݳ"n]ZWXtyF]؁]ȥ:Й1zd\ROx DWUNnCIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/z00n2c08.png0000600000175000001440000000614414003056224022770 0ustar rakusersPNG  IHDR  +IDATx                                                                                                                 UNnIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/tp1n3p08.png0000600000175000001440000000271314003056224023077 0ustar rakusersPNG  IHDR DgAMA1_PLTEVVBB Y))V.. xuu}}}{{{yyy77VwwwuuusssHHdbVV((|SSgggeee]m]&&o--DDaaa;;DD==YYYWWWUUUSSS44QQQ$$OOO::A-w-h{ k111*@ ̓** kkx>>m VFFHAAMs]]Qvvx~~~~~|||zzzJJvvvtttrrrpppnnnjpjzffjjjDDKKadabbb88\\\ZZZ]BxBVVV..GhG11`RRRPPP!!mLLLokkHHH4f4SS`OO44odVYdNNk{A!!YWWYDDx--T `}}%tRNS@fIDAT8c`2x* =fO,|*^ʴMoU_"PejVi\)}ãu]c`1Y>_[+f@|ޓ5:9k2 *kkߒ{&ĉg`}X }Yohii3ם=[Wd~=XA|35P-O܃a5[~0tz'9C]9+i|Sd@FAQ- EGl-x֖K>j3: $&:_d.Owόw۴Āh˦Oҵtg]S5aɴƕN"ͲŽ^ e{rM~9ٻ px43 rwXS}o6Ry găw'ؼen.GLA;!wn!zccg^{ăayx' o-:&kP v[ o9p }Y|cA~)ӟq0$k% *Fqs<-If3T`,&cS BC n%:1䁠|[Ȣkyibg`5lS]'{y6pJf IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/tp0n3p08.png0000600000175000001440000000270414003056224023076 0ustar rakusersPNG  IHDR DgAMA1_PLTEmVVBB Y))V.. xuu}}}{{{yyy77VwwwuuusssHHdbVV((|SSgggeee]m]&&o--DDaaa;;DD==YYYWWWUUUSSS44QQQ$$OOO::A-w-h{ k111*@ ̓** kkx>>m VFFHAAMs]]Qvvx~~~~~|||zzzJJvvvtttrrrpppnnnjpjzffjjjDDKKadabbb88\\\ZZZ]BxBVVV..GhG11`RRRPPP!!LLLokkHHH4f4SS`OO44odVYdNNk{A!!YWWYDDx--T `}}DbIDAT8cP&HTU=dRm lz7 oɕ 7X6\ /_.d:^񑨨G<|&%%%11hXXc)} p hfKKCy&Pr8..Z 0000@O9YgNNY-ۺD$dk;l`p ~~! C{MP###J2777+++--Min~Z899o˔[o_W23;ioCCCݻG333B:[z>"""00P$ݹsg@{8YvvWUi wʉT*s#TQ~~>sU`YII ReeeYYYNNСC!!N)=vyd?ffԦ\ *3BA߿Xk`xvp;ҹe4Pԕj/^ uuutBH!k~4c7 Z6<<Ҳj=Za拯TT__H Ey'MNW ߱|eWD(?yD_G3U>pܼ<ӞK O FRRyf)|Cx]vYX=L )6 T̍N6A jZgu៲yz[X SXWwB?ƍ w- >aP[Wp+ucI2 Ñoja~w6?JT`8 *[|U*bPwЅ %Ǔ~I=V!HL)s%K :a>vr[Zm`${g̷yr}0 ha #W\ W;wԴ<^;0Y6H;.Y PPP``DM k˴>>  Zcht71 Y cy9@xDL9c|*bmbJ$e>"\ns(S \CCC4E| y$;1Hq z5eD2 Mb+k׆^t@6>>sB'VĠ6&M޸ʆaC͛? CWTZ񠁙 iĎb͍dz55Nx`r!'uZZE1({4lBJǶߋ&''IhP҈Amw^-ٳg/]/_LCƴΥ,\*`4 UfggJK/UTfIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/tp0n0g08.png0000600000175000001440000000131714003056224023061 0ustar rakusersPNG  IHDR V%(gAMA1_IDAT8c'HTG< ^lKrK\w;}ʹ4T4&^ӑE9vz:ڶ9 )~jVYqvT^q# ԗۄ8x:YA,;-.IeEA~~@fAL^W-},9$X a2+<3ꋮ̒ISOihc ]&IL9{fw}]]myR )-&O>oN_]VT/5%)_Pi'+++b`[Z|jW߄9D+H[yHxJFpu_Uiid"d]H.)ȟ5{nzqW~IE3fIUQS'!9<80dYQ22BKHͬ ,.:}Z$O;BAO|z`FYD^PaJ|BBBG ~-NNNL ,83TFHRTDaJP?1TG@@Z|ӖP_m#Y_[l+-[RQѝo^ {x#=0`_lhmK ڎ,MH=SOA`FQc]IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/tm3n3p02.png0000600000175000001440000000016414003056224023066 0ustar rakusersPNG  IHDR g PLTECtRNSU '9IDATx^cdP ,U+a3.AIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/tbyn3p08.png0000600000175000001440000000273314003056224023173 0ustar rakusersPNG  IHDR DgAMA1_PLTEVVBB Y))V.. xuu}}}{{{yyy77VwwwuuusssHHdbVV((|SSgggeee]m]&&o--DDaaa;;DD==YYYWWWUUUSSS44QQQ$$OOO::A-w-h{ k111*@ ̓** kkx>>m VFFHAAMs]]Qvvx~~~~~|||zzzJJvvvtttrrrpppnnnjpjzffjjjDDKKadabbb88\\\ZZZ]BxBVVV..GhG11`RRRPPP!!mLLLokkHHH4f4SS`OO44odVYdNNk{A!!YWWYDDx--T `}}2tRNS@fbKGDEIDAT8c`2x* =fO,|*^ʴMoU_"PejVi\)}ãu]c`1Y>_[+f@|ޓ5:9k2 *kkߒ{&ĉg`}X }Yohii3ם=[Wd~=XA|35P-O܃a5[~0tz'9C]9+i|Sd@FAQ- EGl-x֖K>j3: $&:_d.Owόw۴Āh˦Oҵtg]S5aɴƕN"ͲŽ^ e{rM~9ٻ px43 rwXS}o6Ry găw'ؼen.GLA;!wn!zccg^{ăayx' o-:&kP v[ o9p }Y|cA~)ӟq0$k% *Fqs<-If3T`,&cS BC n%:1䁠|[Ȣkyibg`5lS]'{y6pJf IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/tbwn3p08.png0000600000175000001440000000273014003056224023166 0ustar rakusersPNG  IHDR DgAMA1_PLTEVVBB Y))V.. xuu}}}{{{yyy77VwwwuuusssHHdbVV((|SSgggeee]m]&&o--DDaaa;;DD==YYYWWWUUUSSS44QQQ$$OOO::A-w-h{ k111*@ ̓** kkx>>m VFFHAAMs]]Qvvx~~~~~|||zzzJJvvvtttrrrpppnnnjpjzffjjjDDKKadabbb88\\\ZZZ]BxBVVV..GhG11`RRRPPP!!mLLLokkHHH4f4SS`OO44odVYdNNk{A!!YWWYDDx--T `}}%tRNS@fbKGDHIDAT8c`2x* =fO,|*^ʴMoU_"PejVi\)}ãu]c`1Y>_[+f@|ޓ5:9k2 *kkߒ{&ĉg`}X }Yohii3ם=[Wd~=XA|35P-O܃a5[~0tz'9C]9+i|Sd@FAQ- EGl-x֖K>j3: $&:_d.Owόw۴Āh˦Oҵtg]S5aɴƕN"ͲŽ^ e{rM~9ٻ px43 rwXS}o6Ry găw'ؼen.GLA;!wn!zccg^{ăayx' o-:&kP v[ o9p }Y|cA~)ӟq0$k% *Fqs<-If3T`,&cS BC n%:1䁠|[Ȣkyibg`5lS]'{y6pJf IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/tbrn2c08.png0000600000175000001440000000314114003056224023140 0ustar rakusersPNG  IHDR gAMA1_tRNS7X}bKGD3'|IDATH͖ LwǿRl0E h D)P)A""`ӉW)!A se"0e!fL4sNi|kɖ b6]B({?̾apΝp޽X4G=Z탑͍Ruu33* K|RSSSW^-++_Hٵ+{2ix.7Aby˖lllxaGf;:p8Y &ɷPۧg@!Hbcc uʝ>>ځs\nmbe!60G~(rMEGGS**'''33355Uan~Jw$))/P(Zv[W.w씝]jP9p}rQRBQbݻt9SlfWuĉ QwL&s- tQ^^s5` vyqq1REEEiiivvTlv {.14G51ZMTR8 73vwk:FrS2UIS!ꃯtTTWW@Eu'T͛O5#w,,rpRPSvAMprrr=xf .e.>%AD.GPFFq..w\)II&qrEw *!*MPĠ%@pNi[[40LAmIÀ7o)tTxkkB]_U@T"cdrq Vlhca͚W>*T`8J|SbJbPvLׇA)ci8==m@+~OӶ288L E=E{ZtA3$x {f<>ptnnOƏ rZ> \n p2*^ o\oL]}44  \cdt31 ^ 9`Xxt~ !HhA:(J/>m VFFHAAMs]]Qvvx~~~~~|||zzzJJvvvtttrrrpppnnnjpjzffjjjDDKKadabbb88\\\ZZZ]BxBVVV..GhG11`RRRPPP!!mLLLokkHHH4f4SS`OO44odVYdNNk{A!!YWWYDDx--T `}}xe=5tRNS@fbKGDEIDAT8c`2x* =fO,|*^ʴMoU_"PejVi\)}ãu]c`1Y>_[+f@|ޓ5:9k2 *kkߒ{&ĉg`}X }Yohii3ם=[Wd~=XA|35P-O܃a5[~0tz'9C]9+i|Sd@FAQ- EGl-x֖K>j3: $&:_d.Owόw۴Āh˦Oҵtg]S5aɴƕN"ͲŽ^ e{rM~9ٻ px43 rwXS}o6Ry găw'ؼen.GLA;!wn!zccg^{ăayx' o-:&kP v[ o9p }Y|cA~)ӟq0$k% *Fqs<-If3T`,&cS BC n%:1䁠|[Ȣkyibg`5lS]'{y6pJf IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/tbbn3p08.png0000600000175000001440000000273314003056224023144 0ustar rakusersPNG  IHDR DgAMA1_PLTEVVBB Y))V.. xuu}}}{{{yyy77VwwwuuusssHHdbVV((|SSgggeee]m]&&o--DDaaa;;DD==YYYWWWUUUSSS44QQQ$$OOO::A-w-h{ k111*@ ̓** kkx>>m VFFHAAMs]]Qvvx~~~~~|||zzzJJvvvtttrrrpppnnnjpjzffjjjDDKKadabbb88\\\ZZZ]BxBVVV..GhG11`RRRPPP!!mLLLokkHHH4f4SS`OO44odVYdNNk{A!!YWWYDDx--T `}}atRNS@fbKGDEIDAT8c`2x* =fO,|*^ʴMoU_"PejVi\)}ãu]c`1Y>_[+f@|ޓ5:9k2 *kkߒ{&ĉg`}X }Yohii3ם=[Wd~=XA|35P-O܃a5[~0tz'9C]9+i|Sd@FAQ- EGl-x֖K>j3: $&:_d.Owόw۴Āh˦Oҵtg]S5aɴƕN"ͲŽ^ e{rM~9ٻ px43 rwXS}o6Ry găw'ؼen.GLA;!wn!zccg^{ăayx' o-:&kP v[ o9p }Y|cA~)ӟq0$k% *Fqs<-If3T`,&cS BC n%:1䁠|[Ȣkyibg`5lS]'{y6pJf IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/tbbn0g04.png0000600000175000001440000000065514003056224023125 0ustar rakusersPNG  IHDR )gAMA1_tRNS,ЩbKGD#2HIDAT(u1O@q>GYL\$.&&K[,B&`r%$.28j]mHxw^:x-ArO+ ђY3Hjdcs&Amv{`ěeV,\MV[*MIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/s40n3p04.png0000600000175000001440000000040014003056224022764 0ustar rakusersPNG  IHDR((~Х^gAMA1_sBITw'PLTEwwwwww;uIDATxб 0 DC,!alE6H%2EHVNRbG@!FeQk7^ Bؚp877*,mWBMwG)Rc!wu'gWpH])IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/s40i3p04.png0000600000175000001440000000054514003056224022771 0ustar rakusersPNG  IHDR(( וgAMA1_sBITw'PLTEwwwwww;IDATx 0EZk]dRPN7upqg'B YP1BCᐼ<DZrQeA|$`O sc#WLYDOLILȾ{aWvD( cNٮaXDCapl5pQDV @"$֓I#U&!AHt xnR=͈ki^ jNp{xIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/s39n3p04.png0000600000175000001440000000054014003056224023001 0ustar rakusersPNG  IHDR''~LgAMA1_sBITw'PLTEwwwwww;IDATxm!@GHzp 8,šW1CufICgf`2(6 'Zж =E'̪ 'QuEyJڟd0`7~mdUg/C>d(U>ѱb'LWtec+`:4nh7zob/ Ǫ O/5+IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/s39i3p04.png0000600000175000001440000000064414003056224023001 0ustar rakusersPNG  IHDR'' |gAMA1_sBITw'PLTEwwwwww;IDATxm1r0EǓ N."pʵ;ZJnQS:TV1/{f3T` Di@QhjZjvJJ85=P*0 zS`9!T5k=- K#<͚_.ܥ?Nubo&8:/G„"L,B MǔvkNhy>xxppWpX9çe(wx:Ι4e5߹?N|.@ny 5 IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/s38n3p04.png0000600000175000001440000000036514003056224023005 0ustar rakusersPNG  IHDR&&ZgAMA1_sBITw'PLTEwwwwww;jIDATxc`eG`$61 !fpCCl* L1lvX*`q*b 0h-܌81 bhb)`@da1-i+άDIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/s38i3p04.png0000600000175000001440000000054514003056224023000 0ustar rakusersPNG  IHDR&&- gAMA1_sBITw'PLTEwwwwww;IDATx? @XA_EZF6i4475 :E@Hީn#9SЎOQbdTw)q!o;s+;qZIc|jb[P4i|aljƕAn6 S4zg4Xn8m uM/$yC;+|<ױ;^y}kvob땗){zB|DyEIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/s37n3p04.png0000600000175000001440000000052014003056224022775 0ustar rakusersPNG  IHDR%%7=0gAMA1_sBITw'PLTEwwwwww;IDATxe-@/M' '؄ z Vp)3x3@|Iz#S<#u*dUa02qEKϾ,27Fxlj<ɹ)Pz?KwWs:kPѤW2 -W]s' jeG KޭۯG|QV IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/s37i3p04.png0000600000175000001440000000061114003056224022771 0ustar rakusersPNG  IHDR%%@ gAMA1_sBITw'PLTEwwwwww;IDATxe;0Q NL.`h쭨hSRڥr(70̲˷`FCj} |n(`,,䜖jK)#)(8n P M$0 6!a?ؑ\Zs!*V}6nJ_Dؐ w9)/ggL x q%x \r/Rx [JsFNk-8F߮Rz'#?IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/s36n3p04.png0000600000175000001440000000040214003056224022773 0ustar rakusersPNG  IHDR$$.gAMA1_sBITw'PLTEwwwwww;wIDATxc`eG$! .dp]]h*t !,[*`:B,!,Bl7݅,NEPWB BB Є$BB62`XoIӑIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/s36i3p04.png0000600000175000001440000000054414003056224022775 0ustar rakusersPNG  IHDR$$d)=gAMA1_sBITw'PLTEwwwwww;IDATx 0F?ӷ"]IQv iwqpvrTjbMI xA(;ވVLIFqxfSB0'zWs%Ñm rtȁ \Ap9*e} u} GT_`-U$ڪz3Q?, 0h+8郱oe(8Eb_zةj ,a*muuZ9?.IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/s35n3p04.png0000600000175000001440000000052214003056224022775 0ustar rakusersPNG  IHDR##jgAMA1_sBITw'PLTEwwwwww;IDATxe!@״p иJ,{>a3Fު`Y\Ռ:T4b2(h%sn݆oEd=d2ܙBcF5μWhQd *F&Ny7zAwe\/x7rL#"ckLiq6>G΢HIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/s35i3p04.png0000600000175000001440000000061714003056224022775 0ustar rakusersPNG  IHDR##gAMA1_sBITw'PLTEwwwwww;IDATxe=PQv@Xـ  zs;&}!rBї 8ycec:1 4;0'9]L(PFڄ唪*1j1-FtH?׹HD"nƮMM;-ww+T0q=މ^fBu/ep cA%q)uMa8VFL`?Ha; L[ΉqЊiIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/s34n3p04.png0000600000175000001440000000037014003056224022775 0ustar rakusersPNG  IHDR""igAMA1_sBITw'PLTEwwwwww;mIDATxϱ _ [2г0&G+.%:r*Hv4,$ĂY49n2=xNNm'c)*+ TxVR,v5H\-Y~H:+NIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/s34i3p04.png0000600000175000001440000000053514003056224022773 0ustar rakusersPNG  IHDR""n&ggAMA1_sBITw'PLTEwwwwww;IDATx} 0Fj[tdAk[]:8;9 jD{- q>oĻ$`*1sPxKE= "aXIDo-MBC:e֖)Zir450NRk[]IldnaȕGR[_{Q_E6bp&],P]I4?t3P]jP33/2Z߈)IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/s33n3p04.png0000600000175000001440000000051114003056224022771 0ustar rakusersPNG  IHDR!!\gAMA1_sBITw'PLTEwwwwww;IDATx]- W7pp ]WFp- +ƒ|Jop .[+j1Oe ]lD78Z;W갮kLWă⑻E=qx6U3QkT.:])T:IpPM#I?xxIJAhjW :M\ɩ]3b֓1%IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/s33i3p04.png0000600000175000001440000000060114003056224022764 0ustar rakusersPNG  IHDR!!gAMA1_sBITw'PLTEwwwwww;IDATx]1r0E?0(xFHܸSKε+4>y˒Vo 4Ĺp:4a`5$9k L~FQZ #J3^K?Z]T4Z?&ikEJ 3) ]aVYEh-=& r%@=E"t6;s2 q2wzE¥0l%=!޲Z;7R҄#IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/s09n3p02.png0000600000175000001440000000021714003056224022775 0ustar rakusersPNG  IHDR gAMA1_sBITw PLTEwwVdIDATxc` V,XB q iejC#IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/s09i3p02.png0000600000175000001440000000022314003056224022765 0ustar rakusersPNG  IHDR gAMA1_sBITw PLTEwwVd#IDATxc`@ X ^3\b  duFIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/s08n3p02.png0000600000175000001440000000021314003056224022770 0ustar rakusersPNG  IHDRaVgAMA1_sBITw PLTEwwYIDATxc```ZA =V=LIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/s08i3p02.png0000600000175000001440000000022514003056224022766 0ustar rakusersPNG  IHDRffgAMA1_sBITw PLTEwwY%IDATxc` ~`Ǡ0aXAAPPpJIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/s07n3p02.png0000600000175000001440000000021214003056224022766 0ustar rakusersPNG  IHDR<@gAMA1_sBITw PLTEwwCIDATxcj í9 7H qy ]mIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/s07i3p02.png0000600000175000001440000000022514003056224022765 0ustar rakusersPNG  IHDR;gAMA1_sBITw PLTEwwC%IDATxc8p 3aH? Wcn UIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/s06n3p02.png0000600000175000001440000000020314003056224022765 0ustar rakusersPNG  IHDRgAMA1_sBITw PLTEwEhIDATxcXaj02V-9_)pIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/s06i3p02.png0000600000175000001440000000021714003056224022765 0ustar rakusersPNG  IHDR7MgAMA1_sBITw PLTEwEh"IDATxch`h` - +<"&0LH`XYLe$IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/s05n3p02.png0000600000175000001440000000020114003056224022762 0ustar rakusersPNG  IHDRvgAMA1_sBITw PLTEwAsIDATxcX0a"\*JIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/s05i3p02.png0000600000175000001440000000020614003056224022762 0ustar rakusersPNG  IHDRgAMA1_sBITw PLTEwAsIDATxch`h`X";tOm"Mp$FEIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/s04n3p01.png0000600000175000001440000000017114003056224022766 0ustar rakusersPNG  IHDR? =gAMA1_sBITwPLTEwCIDATxc0?  IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/s04i3p01.png0000600000175000001440000000017614003056224022766 0ustar rakusersPNG  IHDR8<gAMA1_sBITwPLTEwCIDATxch`  >7IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/s03n3p01.png0000600000175000001440000000017014003056224022764 0ustar rakusersPNG  IHDRl'gAMA1_sBITwPLTEw奟IDATxc``p``A91 KIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/s03i3p01.png0000600000175000001440000000016614003056224022764 0ustar rakusersPNG  IHDRjgAMA1_sBITwPLTEw奟 IDATxc`LAIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/s02n3p01.png0000600000175000001440000000016314003056224022765 0ustar rakusersPNG  IHDRHxggAMA1_sBITwPLTE\/% IDATxc```8UIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/s02i3p01.png0000600000175000001440000000016214003056224022757 0ustar rakusersPNG  IHDR?gAMA1_sBITwPLTE\/% IDATxc`gIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/s01n3p01.png0000600000175000001440000000016114003056224022762 0ustar rakusersPNG  IHDR%VgAMA1_sBITwPLTExW IDATxc`HqIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/s01i3p01.png0000600000175000001440000000016114003056224022755 0ustar rakusersPNG  IHDRRf\gAMA1_sBITwPLTExW IDATxc`HqIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/bgwn6a08.png0000600000175000001440000000031214003056224023127 0ustar rakusersPNG  IHDR szzgAMA1_bKGDoIDATx1 0 F'dhO?U!ExRP(M(ي0^{~3uG XN5"}\TB\.y 6{@<P6@R LIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/bgbn4a08.png0000600000175000001440000000021414003056224023101 0ustar rakusersPNG  IHDR sgAMA1_bKGD#25IDATxch41",(,?a0T1`4GÀ*hP* }IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/bgan6a08.png0000600000175000001440000000027014003056224023104 0ustar rakusersPNG  IHDR szzgAMA1_oIDATx1 0 F'dhO?U!ExRP(M(ي0^{~3uG XN5"}\TB\.y 6{@<P6@R LIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/bgai4a08.png0000600000175000001440000000032614003056224023077 0ustar rakusersPNG  IHDR tgAMA1_IDATx 0 ֽA((sOAVG":ݙbH$ @ɾzM2x<7U[0t<n!Y~.,>RfqXAh٪wϤ50o0N N6 O= YU]IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/basn6a08.png0000600000175000001440000000027014003056224023120 0ustar rakusersPNG  IHDR szzgAMA1_oIDATx1 0 F'dhO?U!ExRP(M(ي0^{~3uG XN5"}\TB\.y 6{@<P6@R LIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/basn4a08.png0000600000175000001440000000017614003056224023123 0ustar rakusersPNG  IHDR sgAMA1_5IDATxch41",(,?a0T1`4GÀ*hP* }IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/basn3p08.png0000600000175000001440000000240614003056224023137 0ustar rakusersPNG  IHDR DgAMA1_PLTE"Dww :w""""Uffff"DDUU"DDUU3DDff3D"ffD33U*D˺[""f2Ucw:DDkfBkܺ33sJw{"w332fDwJf""UUDff3UwwDwffD"w"3333cU3{UUUUf܃wwUUww""DD3ԪU*U˴f3BSD̙"Sww333Ĉwff""UU"DD[wfwws33wD""U"f 3bIDATx GHd+;3 ekXegа**4h lޣY2W%syiHCL*;8"KE6sx'HK?Y9sģ>1~!'B 0IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/basn3p04.png0000600000175000001440000000033014003056224023125 0ustar rakusersPNG  IHDR TggAMA1_sBITw-PLTE""fwDDҰIGIDATxc =sfժrcwfd C+(H*ŅTݻq@*)#MK#G{7}IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/basn3p02.png0000600000175000001440000000022214003056224023123 0ustar rakusersPNG  IHDR ggAMA1_sBIT|.w PLTEe?+"IDATxc0,| =IꉎIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/basn3p01.png0000600000175000001440000000016014003056224023123 0ustar rakusersPNG  IHDR IgAMA1_PLTE""fl&IDATxc4?fYIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/basn2c08.png0000600000175000001440000000022114003056224023112 0ustar rakusersPNG  IHDR gAMA1_HIDATx 0 @r;D++ ; }Lx@J„(t8#@pw^@KIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/basn0g08.png0000600000175000001440000000021214003056224023114 0ustar rakusersPNG  IHDR V%(gAMA1_AIDATxcd`$ȳ )?`y00gdy\ q10edPq5YIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/basn0g04.png0000600000175000001440000000022114003056224023110 0ustar rakusersPNG  IHDR )gAMA1_HIDATxc``TR26vq MK+/g CA*wLrPV#ݽT3r%GAIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/basn0g02.png0000600000175000001440000000015014003056224023107 0ustar rakusersPNG  IHDR =gAMA1_IDATxc`]0PS3 cI IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/basn0g01.png0000600000175000001440000000024414003056224023112 0ustar rakusersPNG  IHDR [GYgAMA1_[IDATx-̱ 0 J z4o< aEQ/ҤlΩ%SS4W!K&=Bs%%^ڲoj0i.)ano0eI//IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/basi6a08.png0000600000175000001440000000055114003056224023115 0ustar rakusersPNG  IHDR }JbgAMA1_ IDATxŕAN0EAfAME*q *e@ՔAHɊ|?'dG` 9c:1Ⓣ{=k ֵS˰gc. 3{_m /N @-~'.lM1! jѠ D h=F`u@]`^-^%x zRhb!9:XF/h.䋱 lY PtP΀W(3mYm πu(ש P:JSiNsBIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/basi4a08.png0000600000175000001440000000032614003056224023113 0ustar rakusersPNG  IHDR tgAMA1_IDATx 0 ֽA((sOAVG":ݙbH$ @ɾzM2x<7U[0t<n!Y~.,>RfqXAh٪wϤ50o0N N6 O= YU]IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/basi3p08.png0000600000175000001440000000276714003056224023144 0ustar rakusersPNG  IHDR 3PgAMA1_PLTE"Dww :w""""Uffff"DDUU"DDUU3DDff3D"ffD33U*D˺[""f2Ucw:DDkfBkܺ33sJw{"w332fDwJf""UUDff3UwwDwffD"w"3333cU3{UUUUf܃wwUUww""DD3ԪU*U˴f3BSD̙"Sww333Ĉwff""UU"DD[wfwws33wD""U"f 3bIDATxei\ 7JMc))IDXQaѡ29s%"B!W*M%:9Z<}RE4XL1M.5#\HmP!BzԞ]Be&hAViڍ5Fױ{Y.L؛# 0Mun`7%RYH5!C33;;׷522%JK *+}|ظյ()JJHY'00/OI),LW7< sr::mm)>>&&*JNBKK_22x< 0: fiAޞ]\"rqa2|ۛdkj&&zz֦v 05MMuvnh`0TTd9:ƆFDȶmn%53 ke(/^S#Av/#,0 '0N5X S vc0jXw`  p>U0 N x!<۰ .^ nZs` z\?0! oa<~Np&023 0 tx C8, `#G0srIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/basi3p04.png0000600000175000001440000000050714003056224023126 0ustar rakusersPNG  IHDR SWQgAMA1_sBITw-PLTE""fwDDҰIIDATxcc8N%(KS,1,ľ @ _B$ ,qP=L(-]]tލ0@L1 RL1pOGh3V{7s&*WPS)ʽ{Sˀ)UR@妥a rwvh t_IENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/basi3p02.png0000600000175000001440000000030114003056224023114 0ustar rakusersPNG  IHDR ygAMA1_sBIT|.w PLTEe?+QIDATxcxǰ]̌!9J޸b.??dCH dJHR?t#B,*9Z}uIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/basi3p01.png0000600000175000001440000000020414003056224023115 0ustar rakusersPNG  IHDR >!gAMA1_PLTE""fl&)IDATxc`P CѰ1Ù3IH6?@@!( B-vÞIENDB`uTox/third_party/stb/stb/tests/pngsuite/primary/basi2c08.png0000600000175000001440000000047314003056224023116 0ustar rakusersPNG  IHDR 5gAMA1_IDATxՓA! D{x=Ys3hhf gZYd1b|V%}֠Ɯ7~gv>^/-Jcm smXTmcm @x!Kܦ$]!2,$UIBH"*V$$ŏ Jl, lܲ 9:eSW}q@Şp쿣;_|?/ 92ujQQμI tk7ej-9tHQjK ῸO58mcCN,m&ld[ gVWmez՞W\\V6{# 8s͘Ąڤ9w51NYμR(ʚ5 n;--.ʢ5p XoQUI7!11AA{ xݳ/(+KN y nMIW*l&ܘ<TAeeVVx8Hgd$J,tue^)2k`"Vyzp#$d/ɬ X,侾dn A8t$9$8hѓl#={$ﾋ}7z7&R'I.d;xEKjdN p/-ľ}ٳBNMƶDxs;VL?JpX-Ē%v% ͘TxJ^/ {> _TG`!B|qqBzmT;5G8 Nr?X /k]gpELxd\yok04@WĪD!z ٿʐ<X+$ښCxO#bbBӄ7m݌5!¯)/}޾F$Vi-0LD Yw,DY q W aIENDB`uTox/third_party/stb/stb/tests/pngsuite/16bit/tbbn2c16.png0000600000175000001440000000377114003056224022372 0ustar rakusersPNG  IHDR 1gAMA1_tRNSK2bKGDGeIDATX LeG0nL$QbSbe#v<\" LTºRZ e79N4:qd:f 1fDs6YPA;X 9M6 |M:R@JJuuw[ؘ ;6.\r'("b2dqVUUxlhcgz{LMM_<'pC< TU=n^/ݍAb2k`"Vyzp#$d/ɬ X,侾dn A8t$9$8hѓl#={$ﾋ}7z7&R'I.d;xEKjdN p/-ľ}ٳBNMƶDxs;VL?JpX-Ē%v% ͘TxJ^/ {> _TG`!B|qqBzmT;5G8 Nr?X /k]gpELxd\yok04@WĪD!z ٿʐ<X+$ښCxO#bbBӄ7m݌5!¯)/}޾F$Vi-0LD Yw,DY q W aIENDB`uTox/third_party/stb/stb/tests/pngsuite/16bit/oi9n2c16.png0000600000175000001440000000573614003056224022326 0ustar rakusersPNG  IHDR 1gAMA1_IDATxvIDATсIDATށ[IDAT1TKIDAT[IDAT IDAT\rIDAT0MDIDAT5mIDATDYaIDAT`KIDAT2IDATA) IDATEIDAT$fIDAT~!IDAT}=[IDAT4IIDAT_IDAT|*IDAT1TKIDAT7@IDAT[IDAT1,RIDAT69IDAT,[IDAT&5IDATf鹅IDATA>IDAT̺sIDATzIDAT;TIDAT,[IDATE.IDAT_[IDAT=pP1IDATG IDATIDATU?YIDAT5mIDATB]TIDAT(8}IDAT>Y`CIDAT/@IDAT2IDAT8IDATIDATdbةIDATr3mIDATs4]nIDAT~!IDAT;TIDAT=pP1IDAT'2ȃIDAT3IDAT_1IDATT_IDATf<IDAT NIDATZIDATwYwIDAT}=[IDAT6IDATFIDATT_IDATtPIDAT(IDATpx= IDAT,IDAT3IDATFS{IDAT NIDAT-IDAT{IDATpx= IDAT]=PIDAT쟪IDAT_?M~IDAT`eIDAT NIDAT WHIDAT^IDAT_1IDATIDAT쁄ӻIDAT{IDAT6IDATypIDATtPIDAT{5IDATYdIDAT\XIDAT?^PIDATtPIDAT{5IDAT_[IDATLS(IDAT(IDATCmIDATV 3IDAT\J`7IDATll1IDAT(8}IDAT :kQIDATgIDATV 3IDAT VUIDATKIDATDYaIDATgIDATIDAT&5IDATЮ<IDAT0pIDATIDATO7$IDAT\XIDAT(IDATKIDAT(IDAT`eIDAT WIDATK>1IDAT;TIDATRR'@IDATT_IDATWV|IDAT1uIDAT6qIDAT0MDIDAT1,RIDATIDATIDATY:IDAT`eIDAT7@IDATzIDATzPIDAT\XIDATllIDATzIDAT2⩕IDATȽ7jIDATH=IDAT_?M~IDATm;` IDATtPIDATT_IDAT3IDAT]IDAT𕅏IDATŀIDATT_IDAT?ëIDAT&IDAT^IDATA) IDATO[!IDAT/UIDATOIDATIDAT3IDATsIDATaQ:IDATB]TIDATr=IDAT^IENDB`uTox/third_party/stb/stb/tests/pngsuite/16bit/oi9n0g16.png0000600000175000001440000000240314003056224022314 0ustar rakusersPNG  IHDR kgAMA1_IDATxvIDATсIDATށ[IDAT@IDAT1y}IDAT IDAT\XIDAT0MDIDAT !1IDATCmIDATQ4TIDAT9w=IDAT[ԁIDATIDATEIDATZ?mIDATܧ]IDATIDATA>IDAT\XIDAT(IDAT{\IDAT2,hIDATށ[IDAT*>IDAT/UIDATg珺IDAT7IDATU?YIDAT?^PIDAT8:vIDATŀIDAT`KIDATFVIDATW7IDAT<6IDAT<6IDATcM IDATIDAT:4ZIDAT+IDAT`eIDATK>1IDAT&IDATVIDAT(8}IDATZӁIDAT+IDAT|*IDAT@^/drs~='3_Zwt(p3p]`_yt?t(CnTZXIDAT\l52L̩g I@gecIDAT.`(`g Dg&((`60Y`zl(P49܀:{z*zȟmt3ΞAO3B )IDAT^z zIENDB`uTox/third_party/stb/stb/tests/pngsuite/16bit/oi4n0g16.png0000600000175000001440000000031314003056224022305 0ustar rakusersPNG  IHDR kgAMA1_IDATx1 0 CQ9[ܠ({2*ُ?8mIDATWc:`݂@B&@=ΣIDAT2mf IDAT -hL`?oO8K_z_}IENDB`uTox/third_party/stb/stb/tests/pngsuite/16bit/oi2n2c16.png0000600000175000001440000000047214003056224022307 0ustar rakusersPNG  IHDR 1gAMA1_IDATxՖ 0DA~&fzE=֠B>/drs~='3_Zwt(p3p]`_yt?t(C\l52L̩g I@gseIDAT.`(`g Dg&((`60Y`zl(P49܀:{z*zȟmt3ΞAO3B^MwbIENDB`uTox/third_party/stb/stb/tests/pngsuite/16bit/oi2n0g16.png0000600000175000001440000000026314003056224022307 0ustar rakusersPNG  IHDR kgAMA1_@IDATx1 0 CQ9[ܠ({2*ُ?8Wc:`݂@B&@=2:3IDAT -hL`?oO8K_z_}IENDB`uTox/third_party/stb/stb/tests/pngsuite/16bit/oi1n2c16.png0000600000175000001440000000045614003056224022310 0ustar rakusersPNG  IHDR 1gAMA1_IDATxՖ 0DA~&fzE=֠B>/drs~='3_Zwt(p3p]`_yt?t(C\l52L̩g I@g.`(`g Dg&((`60Y`zl(P49܀:{z*zȟmt3ΞAO3B^IENDB`uTox/third_party/stb/stb/tests/pngsuite/16bit/oi1n0g16.png0000600000175000001440000000024714003056224022310 0ustar rakusersPNG  IHDR kgAMA1_^IDATx1 0 CQ9[ܠ({2*ُ?8Wc:`݂@B&@=2 -hL`?oO8K_+IENDB`uTox/third_party/stb/stb/tests/pngsuite/16bit/bgyn6a16.png0000600000175000001440000000657514003056224022413 0ustar rakusersPNG  IHDR #ꦷgAMA1_bKGD~# "IDATxݙ_luKrM.ZKʴRM Y.R2Z[Ɋ^qb,ZɊ (0PrB&\)(D~D4KK/9wUU4AΝ;ww|猕i |ؘ}}+M!3߀ޱ&}߯ZfF5[,@f.3rZtL017qHÿto Z?TR4٢:O~-{D`kEU4")sZHfn2@6RtXO)ޯ;voR'zֽO۴=5ߣDOqD Oc3`co47e k$9SQ aȗ~U5`:OE5CJ :u'|VMt?\3%'*JS_7W&; 42@THtZ]m'Ի6tmrwK'Z׉^щ~QCbV b^NJ^Jr宁Z S _XfxNEOfͅz-/?ջu5Dp^vGVˏGW5| %˿\5ėf%XYhNf uSSn6Ys;;:p-'AW:UGpxqB?7GsZ g`/f@%6mW#r?zf7k.{zzz _NF٪ At5Huta>4u-⋋=wTK\*< e7 M@x޶"&nܛ9f5|>IEtSqEUvvhƫ ^R\TjVz=XtodɎap~~ p}c ׍{3lvB}ކ|9:^TyJz5%WkFƫ%X go|h7#aL$7u)7ݬP?*>WU4^Y+/WZO?{1+^ |{ w u'0oh5HM@3~ݸ7sf7k.7e-/NK?RxZ s'@/eAY@ [?p| HQtu yfKϼQ-ѪHM@3~ݸ7sf7k.ԇ _|IV?4ħځN,'[3kXf|>o$_NY%an }MEFj0&fqo攛n\~|[~|!~ݻj%VyN&#āHFq@ ҊU;2t`@2zKoT۵3=-nj7#aL$7Vlvkeݻμ K@pR (#8grRKX4L;V݌14׍{3\67aZi.3o~`i޻ {pi 3 =)opQqdv%)3{>5XaXiH4ь̤+[h7#aL$׀fiZV!_ Cɽ?x~;w1[o zDE3ؓI~]Rl~%yZ+1S5ISZj݈VF˜H.~xVv: N]mx⁍/43}Ȉ c'ݛ l/Ib*aS1Q&1%?3j݈VD\9߭;wR'3j=K3Y ҕx{vi 1\[SΦx>lOcJF ޒ4ŨuWGjO9hn$83*}}§Rw~;@4k7syv|aE%aL>  j0&3gƫˁȽ_BAqޓ=vA&folnon4|6jd.dndoGq?eí۵IENDB`uTox/third_party/stb/stb/tests/pngsuite/16bit/bggn4a16.png0000600000175000001440000000425414003056224022357 0ustar rakusersPNG  IHDR n<gAMA1_bKGD )UIDATxŗ_h[cHuRGT(8B-P.%4BiKaw]HɐXf%$zmiJWGc9w~t5O>>`eaX=`Ԃ±8G?]e _^X.wGO3wd3 gZú|'fef[Z!p&ކuh`c:oȇtri^g)X]UVZ l-5C`T$u!Z??p߅Cgj@dƱt-YY˅ae}';Ȁ~B@3 x'͌B ^SA#nr2r:QfGR`fAdv <@_"AÃևðqXZ3S:܀{Ճ< ';B 1/s,ZYߣ` `pg=U<@#뿃נ/`6,њ̀U]轏@`7&kc{ ? %:4o6JވaKGaɄ ? @= !e/sVVCpA5AhΠ.Ak%,?%!V[?hv@[/  !~Q`ZJHV@ס, \Z-tVKuVai *(a0ס  =i0Vކ.a{hQf\5 |ee8 l9QF haeXC9wnA D`6_Bh^SygLgv]~dA_ lwSR; I[VF&;5l :F$g 8h=ox yot| 'Q2 ,44c94O!1DӲͷ+3߲M:$m+?=*|~5{Wb zC`W݄辥< Cu㰈"j Q}8p|$;>.;/؏a 4/@ н[/E})x6훏m^=t)y#!ËGT/So SMO]]#7*gǏl!qXkdQa59G2 5e5$l (+畸2ۥ_$`Wb?@0 9E{Bk80/ƲVRZYxYf\ Nv{k By_@SaJcKjT𔥞cVE^>[v]7R>܉\i@)]SBBy$Ғh('eϭia;cҹ; МkX]HM%I%ŎUz]„Xj"22CO+h ɴ )oF\ܼ27 h+' wCQRY\-4-dA.Hax4,@ᜲ$o{ dJ;v,& C˧T$3ӔgVWsϓ<yhB# FP!v Vޔl X$p]y]\._s=,l7Gd){&TLK(}Z)h+V %@{gd"iiqૢ]Z^<y wPg+ЮB;  s%/ڟ gU<=DPw?({!l7d̀t:9-xIb z 4thFk2*<#~WQ\ 4eύpNf.J,OAdžN 6lf-ȌcGR3*%dE((\0){n$KJ3`38`ek+-w53&7yiIq4u-⋋=wTK\*< e7 M@x޶"&nܛ9f5|>IEtSqEUvvhƫ ^R\TjVz=XtodɎap~~ p}c ׍{3lvB}ކ|9:^TyJz5%WkFƫ%X go|h7#aL$7u)7ݬP?*>WU4^Y+/WZO?{1+^ |{ w u'0oh5HM@3~ݸ7sf7k.7e-/NK?RxZ s'@/eAY@ [?p| HQtu yfKϼQ-ѪHM@3~ݸ7sf7k.ԇ _|IV?4ħځN,'[3kXf|>o$_NY%an }MEFj0&fqo攛n\~|[~|!~ݻj%VyN&#āHFq@ ҊU;2t`@2zKoT۵3=-nj7#aL$7Vlvkeݻμ K@pR (#8grRKX4L;V݌14׍{3\67aZi.3o~`i޻ {pi 3 =)opQqdv%)3{>5XaXiH4ь̤+[h7#aL$׀fiZV!_ Cɽ?x~;w1[o zDE3ؓI~]Rl~%yZ+1S5ISZj݈VF˜H.~xVv: N]mx⁍/43}Ȉ c'ݛ l/Ib*aS1Q&1%?3j݈VD\9߭;wR'3j=K3Y ҕx{vi 1\[SΦx>lOcJF ޒ4ŨuWGjO9hn$83*}}§Rw~;@4k7syv|aE%aL>  j0&3gƫˁȽ_BAqޓ=vA&folnon4|6jd.dndoGq?eí۵IENDB`uTox/third_party/stb/stb/tests/pngsuite/16bit/bgai4a16.png0000600000175000001440000000544714003056224022351 0ustar rakusersPNG  IHDR ^gAMA1_ IDATxpTu?Z=IowB2O߄5f pњf4b8O5vH\ Cc7Ԯ#-+06P ЂzW+tOL2m%K,: 뻇oތ! ~>6K2m4?)u7,㍝4ueqCYcgg' i!lB4M\x2s&߆OiҮC-hDýgt<Kzz)]}?30.W\ZQKiپnp7Bn(A ;`n~"OÎ, :X@apy(b.7 9-#X1s;WhPfS!6ئrͬ’(T(o+ܟ| KWcf޶܀ fC>A y(kfPEMpx4t! ٟ%kx370%8$NA-!xzX!jl5+ .S3;-[W~u>Gtu,_WՁS7_ի:aTnZM߳0ctµvx,jq(VAyOjoBe-oA>k+?3V̮ū!xS [3O01 'wj칷d/SU槜wpx6kfi]^.#jkFS dF0,~Fef[7}^X݆@-xOC^#AQA ̋ɇ2B*Kik * \,koBZJ<w||&f(o@)Lirm^[Я.OFJ[_ye_uJȿ:)d!?eC;2zFW^'d2)d2#z3\8MoU(P̮Yӗ,Q lȞuN]s#ǯ\++rB|\H!e7n5]߷#BR r ,9gG$  ; &(\ ?k%{M+0lrow[O2Ip An;nC[0c5 {r Fچl늺fVXH] Y6_{6 Y-%B !?2uHM̋B45VL? cp>f֖ܷfEW!+7oB`30~&k74z<©̋uC_?0/MoB3 cV2|*( aHA$aAy٫.}fs]yu]uN΁Uh = =Ms>=ㅢ0%-C/ SRRaHv {a`z>C0EPs ʜGB't:p4t@IBK,# )ȏ7 _MHoFH,k*nvR3΅!nw!WIЅQ2 o? 7O0`7ȓ0eHTlͷ5 ƺ ?@w.3`>aoW phJς~ CoA&A>cQHoR): ӡ\^7_cbtƮSQr '!<PoA^r]P+a"0$L0d2&ȝ0`pttͥ4Wce_׋ȺYqa@f3dR 0\N~ UTcZ$XCϙ!C(9q>3Z_3=g@ BޛW;I`RU}]N;ծTC.(σ@3;`|ۡh thA ϙHZ7A4۞$lZHxjks# !(M@LO@ ,{022 ' }g|P\_{@MLG25 >i!'505-0e 䅜Bk)F[a"J+[4Bo+PA(x|%EqXk@G>3c٤ehu![HPSB 9!! 9uyBROH)!}B?+Bz]H6!f9z@ȱ+*!'~ $_B*T2gys >!H{I9lIENDB`uTox/third_party/stb/stb/tests/pngsuite/16bit/basn6a16.png0000600000175000001440000000655314003056224022373 0ustar rakusersPNG  IHDR #ꦷgAMA1_ "IDATxݙ_luKrM.ZKʴRM Y.R2Z[Ɋ^qb,ZɊ (0PrB&\)(D~D4KK/9wUU4AΝ;ww|猕i |ؘ}}+M!3߀ޱ&}߯ZfF5[,@f.3rZtL017qHÿto Z?TR4٢:O~-{D`kEU4")sZHfn2@6RtXO)ޯ;voR'zֽO۴=5ߣDOqD Oc3`co47e k$9SQ aȗ~U5`:OE5CJ :u'|VMt?\3%'*JS_7W&; 42@THtZ]m'Ի6tmrwK'Z׉^щ~QCbV b^NJ^Jr宁Z S _XfxNEOfͅz-/?ջu5Dp^vGVˏGW5| %˿\5ėf%XYhNf uSSn6Ys;;:p-'AW:UGpxqB?7GsZ g`/f@%6mW#r?zf7k.{zzz _NF٪ At5Huta>4u-⋋=wTK\*< e7 M@x޶"&nܛ9f5|>IEtSqEUvvhƫ ^R\TjVz=XtodɎap~~ p}c ׍{3lvB}ކ|9:^TyJz5%WkFƫ%X go|h7#aL$7u)7ݬP?*>WU4^Y+/WZO?{1+^ |{ w u'0oh5HM@3~ݸ7sf7k.7e-/NK?RxZ s'@/eAY@ [?p| HQtu yfKϼQ-ѪHM@3~ݸ7sf7k.ԇ _|IV?4ħځN,'[3kXf|>o$_NY%an }MEFj0&fqo攛n\~|[~|!~ݻj%VyN&#āHFq@ ҊU;2t`@2zKoT۵3=-nj7#aL$7Vlvkeݻμ K@pR (#8grRKX4L;V݌14׍{3\67aZi.3o~`i޻ {pi 3 =)opQqdv%)3{>5XaXiH4ь̤+[h7#aL$׀fiZV!_ Cɽ?x~;w1[o zDE3ؓI~]Rl~%yZ+1S5ISZj݈VF˜H.~xVv: N]mx⁍/43}Ȉ c'ݛ l/Ib*aS1Q&1%?3j݈VD\9߭;wR'3j=K3Y ҕx{vi 1\[SΦx>lOcJF ޒ4ŨuWGjO9hn$83*}}§Rw~;@4k7syv|aE%aL>  j0&3gƫˁȽ_BAqޓ=vA&folnon4|6jd.dndoGq?eí۵IENDB`uTox/third_party/stb/stb/tests/pngsuite/16bit/basn4a16.png0000600000175000001440000000423614003056224022365 0ustar rakusersPNG  IHDR n<gAMA1_UIDATxŗ_h[cHuRGT(8B-P.%4BiKaw]HɐXf%$zmiJWGc9w~t5O>>`eaX=`Ԃ±8G?]e _^X.wGO3wd3 gZú|'fef[Z!p&ކuh`c:oȇtri^g)X]UVZ l-5C`T$u!Z??p߅Cgj@dƱt-YY˅ae}';Ȁ~B@3 x'͌B ^SA#nr2r:QfGR`fAdv <@_"AÃևðqXZ3S:܀{Ճ< ';B 1/s,ZYߣ` `pg=U<@#뿃נ/`6,њ̀U]轏@`7&kc{ ? %:4o6JވaKGaɄ ? @= !e/sVVCpA5AhΠ.Ak%,?%!V[?hv@[/  !~Q`ZJHV@ס, \Z-tVKuVai *(a0ס  =i0Vކ.a{hQf\5 |ee8 l9QF haeXC9wnA D`6_Bh^SygLgv]~dA_ lwSR; I[VF&;5l :F$g 8h=ox yot| 'Q2 ,44c94O!1DӲͷ+3߲M:$m+?=*|~5{Wb zC`W݄辥< Cu㰈"j Q}8p|$;>.;/؏a 4/@ н[/E})x6훏m^=t)y#!ËGT/So SMO]]#7*gǏl!qXkdQa59G2 5e5$l (+畸2ۥ_$`Wb?@0 9E{Bk80/ƲVRZYxYf\ Nv{k By_@SaJcKjT𔥞cVE^>[v]7R>܉\i@)]SBBy$Ғh('eϭia;cҹ; МkX]HM%I%ŎUz]„Xj"22CO+h ɴ )oF\ܼ27 h+' wCQRY\-4-dA.Hax4,@ᜲ$o{ dJ;v,& C˧T$3ӔgVWsϓ<yhB# FP!v Vޔl X$p]y]\._s=,l7Gd){&TLK(}Z)h+V %@{gd"iiqૢ]Z^<y wPg+ЮB;  s%/ڟ gU<=DPw?({!l7d̀t:9-xIb z 4thFk2*<#~WQ\ 4eύpNf.J,OAdžN 6lf-ȌcGR3*%dE((\0){n$KJ3`38`ek+-w53&7yiIq/drs~='3_Zwt(p3p]`_yt?t(C\l52L̩g I@g.`(`g Dg&((`60Y`zl(P49܀:{z*zȟmt3ΞAO3B^IENDB`uTox/third_party/stb/stb/tests/pngsuite/16bit/basn0g16.png0000600000175000001440000000024714003056224022365 0ustar rakusersPNG  IHDR kgAMA1_^IDATx1 0 CQ9[ܠ({2*ُ?8Wc:`݂@B&@=2 -hL`?oO8K_+IENDB`uTox/third_party/stb/stb/tests/pngsuite/16bit/basi6a16.png0000600000175000001440000001012414003056224022353 0ustar rakusersPNG  IHDR T!gAMA1_ IDATxݙktU՝}&$@h⍠("І`YЎ" BZ.oY(ZAG$P t 8B[#CIIk_̇$̸Y]gc}m&ZCmI6D#?$XVIͮl̏d׽OB6nnm|¶,()^VnhO*sL-5S< ΍:wx4SEݰ# 𛷍[w8[ u,ZZY: ʊ+$n Pna WݹP^ql}cC#~NZ`^Z$;VWãȖG68F쾰=0@@ SCMpmr/$0J?B?;燈tKi ">SͭVUgTYъ2sAw厊D|Ɏ$d:|sGW#ߘ,  PU*Ԇ͒4C=3Q86sS-C?"SWkK/:[l; ~-&g]۔Bj+SwݗTQ@id'D|_0$[]d)u]3/U'NJ&:=V!``wS W uTBWAUD|UjՒ9U>z1ulh0,9h H=0HF-_0M-R_V[[TSϪ C7dg$@~s9%@Vm֋㔷ޓKN]]35 _#igT}ޙ3c\s  {$)cng*c4&'[9X`}'p 1g>"@BlOjbc%Q4Ի`RVUuH3 eMл@,Lr%е̬i(?XQ-7z(m626 ~Pt2o@ċPgCƁy.`$Jg]q0pUzOs$ɒ%}䦿^)cdmXrSd8j -7!ܘNSו qpH@8fʹn]Ʉ*yU.O.~UZ_4ö*p2Ib늦-D/.l_YY0E%; )7eBkGD!-7KJ@&ڕI:Mi㊽FaPŀ!oyF(Qp\rs@I{5w_8*-#yfvC۫"ʒ*%&%iO:6@8-'*S,dHNn-L] 8tJo26VA8:jgM hw*OogY=|=@j>@3mq2N)@U̿)*K KGk;aR<\/| bp:C=&R2}F2\r~_Wڮێ5e:DV[:850b-{l4K uAzPY/V.yA p H%L;k*h gZ1=LlС \m$M=_/ ,50!2[s!B}n(ӽϽԡ}" RP\WzHlA+50$!8oo E3@Et6BشpdGC[ PHN> K.`C +P!ҿo!_aCA-CLnQhr ->u157"v0  a{6reDCB%[>C> }"03a8:LR ,0D=4C܆">$D@n1v]f=g3b1/BPv@͐!Xڌ.&Aö g>7jYJ} ^k @jm&+ceVUhlMTB+ o5@*ot'|զޱVL]vQP_ Z40+XhV{#I+f3*#-Y;;ɗi@^rBXbVQAD{0b_l $@ p3,n<(nPPޑ(-Z4%~eE"RR`2JY]Z1 _0ߗ(([Zc2uH.t w%@fg@fCҧE @II(ZD 흧U) E@ZBR;ijaKX,2uHtbLֻ~{ p*_|Vp; 2_:>(ux h2  R[ }d}#VL;.*>m[>:c,gL7piR )qv{.@zW3@aCVS%d6UVpޠTPuu J%z#?&|tE+QOl5jvyԑN-Cϛo7uS!9Cd2Rl{ ŵ 3`/vot.PpSGUY)UV12 P^4Т55 A8Z^۹NK4S)8Y܃rrMۖc;5vCơ R{cҳt/{VS2|WμdvdWBB\>dQ.w- k`"mm#M޷J<K9ʖ\R|+sK~ 8tqm ȫGUV)E*aeWTiRJјuJv8=g韮YtmQKa znޙh;:~+P򶎷JW=)gONzg}f%;in<9_UjCV@N¬ jYehɋ*PH$$q{/ϵP^gѽgCã_n>=Ő XUн:}Lzl4%?  J |!nI/;) ۟M\٫X+NާW4-4A,2z w 9\* KR"2@Lw+tJ()g`qb %!RϞ|O}S+ckY1 V|jT {;cޙPv W"6"!ׁCC8?u2 BcM_np5X' Qvzgn "CgqEL9j[^.V^ck;`m+ jtKOX$F@$Cp#$Ap$*!r Gb; .ਖ?0̀@ r"`s{#dGR-0# #)O&_hPT4y`}~(M C/BmPt!7C]CLksk\c{"8q쉆ppiCxCCd)w!q!6Ca kп0w4 }~C,)gi(%K,: 뻇oތ! ~>6K2m4?)u7,㍝4ueqCYcgg' i!lB4M\x2s&߆OiҮC-hDýgt<Kzz)]}?30.W\ZQKiپnp7Bn(A ;`n~"OÎ, :X@apy(b.7 9-#X1s;WhPfS!6ئrͬ’(T(o+ܟ| KWcf޶܀ fC>A y(kfPEMpx4t! ٟ%kx370%8$NA-!xzX!jl5+ .S3;-[W~u>Gtu,_WՁS7_ի:aTnZM߳0ctµvx,jq(VAyOjoBe-oA>k+?3V̮ū!xS [3O01 'wj칷d/SU槜wpx6kfi]^.#jkFS dF0,~Fef[7}^X݆@-xOC^#AQA ̋ɇ2B*Kik * \,koBZJ<w||&f(o@)Lirm^[Я.OFJ[_ye_uJȿ:)d!?eC;2zFW^'d2)d2#z3\8MoU(P̮Yӗ,Q lȞuN]s#ǯ\++rB|\H!e7n5]߷#BR r ,9gG$  ; &(\ ?k%{M+0lrow[O2Ip An;nC[0c5 {r Fچl늺fVXH] Y6_{6 Y-%B !?2uHM̋B45VL? cp>f֖ܷfEW!+7oB`30~&k74z<©̋uC_?0/MoB3 cV2|*( aHA$aAy٫.}fs]yu]uN΁Uh = =Ms>=ㅢ0%-C/ SRRaHv {a`z>C0EPs ʜGB't:p4t@IBK,# )ȏ7 _MHoFH,k*nvR3΅!nw!WIЅQ2 o? 7O0`7ȓ0eHTlͷ5 ƺ ?@w.3`>aoW phJς~ CoA&A>cQHoR): ӡ\^7_cbtƮSQr '!<PoA^r]P+a"0$L0d2&ȝ0`pttͥ4Wce_׋ȺYqa@f3dR 0\N~ UTcZ$XCϙ!C(9q>3Z_3=g@ BޛW;I`RU}]N;ծTC.(σ@3;`|ۡh thA ϙHZ7A4۞$lZHxjks# !(M@LO@ ,{022 ' }g|P\_{@MLG25 >i!'505-0e 䅜Bk)F[a"J+[4Bo+PA(x|%EqXk@G>3c٤ehu![HPSB 9!! 9uyBROH)!}B?+Bz]H6!f9z@ȱ+*!'~ $_B*T2gys >!H{I9lIENDB`uTox/third_party/stb/stb/tests/pngsuite/16bit/basi2c16.png0000600000175000001440000000112314003056224022350 0ustar rakusersPNG  IHDR ۏvgAMA1_ IDATxՖ!s0?8a>Vx?0.;Xx0p0 SW+c Y}+EI$ ottЅ Awj88:A?/ĠnqsT`z& \lX5R 2'+d~G @4 @4߁@\\y9۩ܵEkQט-} Q FAQ wbk@|DVIENDB`uTox/third_party/stb/stb/tests/pg_test/0000700000175000001440000000000014003056224017213 5ustar rakusersuTox/third_party/stb/stb/tests/pg_test/pg_test.c0000600000175000001440000000617614003056224021040 0ustar rakusers#define STB_DEFINE #include "stb.h" #define STB_PG_IMPLEMENTATION #include "stb_pg.h" #define STB_IMAGE_IMPLEMENTATION #include "stb_image.h" #define STB_IMAGE_WRITE_IMPLEMENTATION #include "stb_image_write.h" static float *hf; static int hf_width = 10001; static int hf_height = 10001; static float get_height(float x, float y) { float h00,h01,h10,h11,h0,h1; int ix,iy; if (x < 0) x = 0; if (x > hf_width-1) x = (float) hf_width-1; if (y < 0) y = 0; if (y > hf_height-1) y = (float) hf_height-1; ix = (int) x; x -= ix; iy = (int) y; y -= iy; h00 = hf[(iy+0)*hf_height+(ix+0)]; h10 = hf[(iy+0)*hf_height+(ix+1)]; h01 = hf[(iy+1)*hf_height+(ix+0)]; h11 = hf[(iy+1)*hf_height+(ix+1)]; h0 = stb_lerp(y, h00, h01); h1 = stb_lerp(y, h10, h11); return stb_lerp(x, h0, h1); } void stbpg_tick(float dt) { int i=0,j=0; int step = 1; glUseProgram(0); glClearColor(0.6f,0.7f,1.0f,1.0f); glClearDepth(1.0f); glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT); glDepthFunc(GL_LESS); glEnable(GL_DEPTH_TEST); #if 1 glEnable(GL_CULL_FACE); glMatrixMode(GL_PROJECTION); glLoadIdentity(); gluPerspective(60.0, 1920/1080.0f, 0.02f, 8000.0f); //glOrtho(-8,8,-6,6, -100, 100); glMatrixMode(GL_MODELVIEW); glLoadIdentity(); glRotatef(-90, 1,0,0); // z-up { float x,y; stbpg_get_mouselook(&x,&y); glRotatef(-y, 1,0,0); glRotatef(-x, 0,0,1); } { static float cam_x = 1000; static float cam_y = 1000; static float cam_z = 700; float x=0,y=0; stbpg_get_keymove(&x,&y); cam_x += x*dt*5.0f; cam_y += y*dt*5.0f; glTranslatef(-cam_x, -cam_y, -cam_z); if (cam_x >= 0 && cam_x < hf_width && cam_y >= 0 && cam_y < hf_height) cam_z = get_height(cam_x, cam_y) + 1.65f; // average eye height in meters } for (j=501; j+1 < 1500+0*hf_height; j += step) { glBegin(GL_QUAD_STRIP); for (i=501; i < 1500+0*hf_width; i += step) { static int flip=0; if (flip) glColor3f(0.5,0.5,0.5); else glColor3f(0.4f,0.4f,0.4f); flip = !flip; glVertex3f((float) i, (float) j+step,hf[(j+step)*hf_width+i]); glVertex3f((float) i, (float) j ,hf[ j *hf_width+i]); } glEnd(); } glBegin(GL_LINES); glColor3f(1,0,0); glVertex3f(10,0,0); glVertex3f(0,0,0); glColor3f(0,1,0); glVertex3f(0,10,0); glVertex3f(0,0,0); glColor3f(0,0,1); glVertex3f(0,0,10); glVertex3f(0,0,0); glEnd(); #endif } void stbpg_main(int argc, char **argv) { int i,j; #if 0 int w,h,c; unsigned short *data = stbi_load_16("c:/x/ned_1m/test2.png", &w, &h, &c, 1); stb_filewrite("c:/x/ned_1m/x73_y428_10012_10012.bin", data, w*h*2); #else unsigned short *data = stb_file("c:/x/ned_1m/x73_y428_10012_10012.bin", NULL); int w=10012, h = 10012; #endif hf = malloc(hf_width * hf_height * 4); for (j=0; j < hf_height; ++j) for (i=0; i < hf_width; ++i) hf[j*hf_width+i] = data[j*w+i] / 32.0f; stbpg_gl_compat_version(1,1); stbpg_windowed("terrain_edit", 1920, 1080); stbpg_run(); return; } uTox/third_party/stb/stb/tests/oversample/0000700000175000001440000000000014003056224017723 5ustar rakusersuTox/third_party/stb/stb/tests/oversample/stb_wingraph.h0000600000175000001440000006045314003056224022575 0ustar rakusers// stb_wingraph.h v0.01 - public domain windows graphics programming // wraps WinMain, ChoosePixelFormat, ChangeDisplayResolution, etc. for // doing OpenGL graphics // // in ONE source file, put '#define STB_DEFINE' before including this // OR put '#define STB_WINMAIN' to define a WinMain that calls stbwingraph_main(void) // // @TODO: // 2d rendering interface (that can be done easily in software) // STB_WINGRAPH_SOFTWARE -- 2d software rendering only // STB_WINGRAPH_OPENGL -- OpenGL only #ifndef INCLUDE_STB_WINGRAPH_H #define INCLUDE_STB_WINGRAPH_H #ifdef STB_WINMAIN #ifndef STB_DEFINE #define STB_DEFINE #define STB_WINGRAPH_DISABLE_DEFINE_AT_END #endif #endif #ifdef STB_DEFINE #pragma comment(lib, "opengl32.lib") #pragma comment(lib, "glu32.lib") #pragma comment(lib, "winmm.lib") #pragma comment(lib, "gdi32.lib") #pragma comment(lib, "user32.lib") #endif #ifdef __cplusplus #define STB_EXTERN extern "C" #else #define STB_EXTERN #endif #ifdef STB_DEFINE #ifndef _WINDOWS_ #ifdef APIENTRY #undef APIENTRY #endif #ifdef WINGDIAPI #undef WINGDIAPI #endif #define _WIN32_WINNT 0x0400 // WM_MOUSEWHEEL #include #endif #include #include #include #include #include #endif typedef void * stbwingraph_hwnd; typedef void * stbwingraph_hinstance; enum { STBWINGRAPH_unprocessed = -(1 << 24), STBWINGRAPH_do_not_show, STBWINGRAPH_winproc_exit, STBWINGRAPH_winproc_update, STBWINGRAPH_update_exit, STBWINGRAPH_update_pause, }; typedef enum { STBWGE__none=0, STBWGE_create, STBWGE_create_postshow, STBWGE_draw, STBWGE_destroy, STBWGE_char, STBWGE_keydown, STBWGE_syskeydown, STBWGE_keyup, STBWGE_syskeyup, STBWGE_deactivate, STBWGE_activate, STBWGE_size, STBWGE_mousemove , STBWGE_leftdown , STBWGE_leftup , STBWGE_middledown, STBWGE_middleup, STBWGE_rightdown , STBWGE_rightup , STBWGE_mousewheel, } stbwingraph_event_type; typedef struct { stbwingraph_event_type type; // for input events (mouse, keyboard) int mx,my; // mouse x & y int dx,dy; int shift, ctrl, alt; // for keyboard events int key; // for STBWGE_size: int width, height; // for STBWGE_crate int did_share_lists; // if true, wglShareLists succeeded void *handle; } stbwingraph_event; typedef int (*stbwingraph_window_proc)(void *data, stbwingraph_event *event); extern stbwingraph_hinstance stbwingraph_app; extern stbwingraph_hwnd stbwingraph_primary_window; extern int stbwingraph_request_fullscreen; extern int stbwingraph_request_windowed; STB_EXTERN void stbwingraph_ods(char *str, ...); STB_EXTERN int stbwingraph_MessageBox(stbwingraph_hwnd win, unsigned int type, char *caption, char *text, ...); STB_EXTERN int stbwingraph_ChangeResolution(unsigned int w, unsigned int h, unsigned int bits, int use_message_box); STB_EXTERN int stbwingraph_SetPixelFormat(stbwingraph_hwnd win, int color_bits, int alpha_bits, int depth_bits, int stencil_bits, int accum_bits); STB_EXTERN int stbwingraph_DefineClass(void *hinstance, char *iconname); STB_EXTERN void stbwingraph_SwapBuffers(void *win); STB_EXTERN void stbwingraph_Priority(int n); STB_EXTERN void stbwingraph_MakeFonts(void *window, int font_base); STB_EXTERN void stbwingraph_ShowWindow(void *window); STB_EXTERN void *stbwingraph_CreateWindow(int primary, stbwingraph_window_proc func, void *data, char *text, int width, int height, int fullscreen, int resizeable, int dest_alpha, int stencil); STB_EXTERN void *stbwingraph_CreateWindowSimple(stbwingraph_window_proc func, int width, int height); STB_EXTERN void *stbwingraph_CreateWindowSimpleFull(stbwingraph_window_proc func, int fullscreen, int ww, int wh, int fw, int fh); STB_EXTERN void stbwingraph_DestroyWindow(void *window); STB_EXTERN void stbwingraph_ShowCursor(void *window, int visible); STB_EXTERN float stbwingraph_GetTimestep(float minimum_time); STB_EXTERN void stbwingraph_SetGLWindow(void *win); typedef int (*stbwingraph_update)(float timestep, int real, int in_client); STB_EXTERN int stbwingraph_MainLoop(stbwingraph_update func, float mintime); #ifdef STB_DEFINE stbwingraph_hinstance stbwingraph_app; stbwingraph_hwnd stbwingraph_primary_window; int stbwingraph_request_fullscreen; int stbwingraph_request_windowed; void stbwingraph_ods(char *str, ...) { char buffer[1024]; va_list v; va_start(v,str); vsprintf(buffer, str, v); va_end(v); OutputDebugString(buffer); } int stbwingraph_MessageBox(stbwingraph_hwnd win, unsigned int type, char *caption, char *text, ...) { va_list v; char buffer[1024]; va_start(v, text); vsprintf(buffer, text, v); va_end(v); return MessageBox(win, buffer, caption, type); } void stbwingraph_Priority(int n) { int p; switch (n) { case -1: p = THREAD_PRIORITY_BELOW_NORMAL; break; case 0: p = THREAD_PRIORITY_NORMAL; break; case 1: p = THREAD_PRIORITY_ABOVE_NORMAL; break; default: if (n < 0) p = THREAD_PRIORITY_LOWEST; else p = THREAD_PRIORITY_HIGHEST; } SetThreadPriority(GetCurrentThread(), p); } static void stbwingraph_ResetResolution(void) { ChangeDisplaySettings(NULL, 0); } static void stbwingraph_RegisterResetResolution(void) { static int done=0; if (!done) { done = 1; atexit(stbwingraph_ResetResolution); } } int stbwingraph_ChangeResolution(unsigned int w, unsigned int h, unsigned int bits, int use_message_box) { DEVMODE mode; int res; int i, tries=0; for (i=0; ; ++i) { int success = EnumDisplaySettings(NULL, i, &mode); if (!success) break; if (mode.dmBitsPerPel == bits && mode.dmPelsWidth == w && mode.dmPelsHeight == h) { ++tries; success = ChangeDisplaySettings(&mode, CDS_FULLSCREEN); if (success == DISP_CHANGE_SUCCESSFUL) { stbwingraph_RegisterResetResolution(); return TRUE; } break; } } if (!tries) { if (use_message_box) stbwingraph_MessageBox(stbwingraph_primary_window, MB_ICONERROR, NULL, "The resolution %d x %d x %d-bits is not supported.", w, h, bits); return FALSE; } // we tried but failed, so try explicitly doing it without specifying refresh rate // Win95 support logic mode.dmBitsPerPel = bits; mode.dmPelsWidth = w; mode.dmPelsHeight = h; mode.dmFields = DM_BITSPERPEL | DM_PELSWIDTH | DM_PELSHEIGHT; res = ChangeDisplaySettings(&mode, CDS_FULLSCREEN); switch (res) { case DISP_CHANGE_SUCCESSFUL: stbwingraph_RegisterResetResolution(); return TRUE; case DISP_CHANGE_RESTART: if (use_message_box) stbwingraph_MessageBox(stbwingraph_primary_window, MB_ICONERROR, NULL, "Please set your desktop to %d-bit color and then try again."); return FALSE; case DISP_CHANGE_FAILED: if (use_message_box) stbwingraph_MessageBox(stbwingraph_primary_window, MB_ICONERROR, NULL, "The hardware failed to change modes."); return FALSE; case DISP_CHANGE_BADMODE: if (use_message_box) stbwingraph_MessageBox(stbwingraph_primary_window, MB_ICONERROR, NULL, "The resolution %d x %d x %d-bits is not supported.", w, h, bits); return FALSE; default: if (use_message_box) stbwingraph_MessageBox(stbwingraph_primary_window, MB_ICONERROR, NULL, "An unknown error prevented a change to a %d x %d x %d-bit display.", w, h, bits); return FALSE; } } int stbwingraph_SetPixelFormat(stbwingraph_hwnd win, int color_bits, int alpha_bits, int depth_bits, int stencil_bits, int accum_bits) { HDC dc = GetDC(win); PIXELFORMATDESCRIPTOR pfd = { sizeof(pfd) }; int pixel_format; pfd.nVersion = 1; pfd.dwFlags = PFD_SUPPORT_OPENGL | PFD_DRAW_TO_WINDOW | PFD_DOUBLEBUFFER; pfd.dwLayerMask = PFD_MAIN_PLANE; pfd.iPixelType = PFD_TYPE_RGBA; pfd.cColorBits = color_bits; pfd.cAlphaBits = alpha_bits; pfd.cDepthBits = depth_bits; pfd.cStencilBits = stencil_bits; pfd.cAccumBits = accum_bits; pixel_format = ChoosePixelFormat(dc, &pfd); if (!pixel_format) return FALSE; if (!DescribePixelFormat(dc, pixel_format, sizeof(PIXELFORMATDESCRIPTOR), &pfd)) return FALSE; SetPixelFormat(dc, pixel_format, &pfd); return TRUE; } typedef struct { // app data stbwingraph_window_proc func; void *data; // creation parameters int color, alpha, depth, stencil, accum; HWND share_window; HWND window; // internal data HGLRC rc; HDC dc; int hide_mouse; int in_client; int active; int did_share_lists; int mx,my; // last mouse positions } stbwingraph__window; static void stbwingraph__inclient(stbwingraph__window *win, int state) { if (state != win->in_client) { win->in_client = state; if (win->hide_mouse) ShowCursor(!state); } } static void stbwingraph__key(stbwingraph_event *e, int type, int key, stbwingraph__window *z) { e->type = type; e->key = key; e->shift = (GetKeyState(VK_SHIFT) < 0); e->ctrl = (GetKeyState(VK_CONTROL) < 0); e->alt = (GetKeyState(VK_MENU) < 0); if (z) { e->mx = z->mx; e->my = z->my; } else { e->mx = e->my = 0; } e->dx = e->dy = 0; } static void stbwingraph__mouse(stbwingraph_event *e, int type, WPARAM wparam, LPARAM lparam, int capture, void *wnd, stbwingraph__window *z) { static int captured = 0; e->type = type; e->mx = (short) LOWORD(lparam); e->my = (short) HIWORD(lparam); if (!z || z->mx == -(1 << 30)) { e->dx = e->dy = 0; } else { e->dx = e->mx - z->mx; e->dy = e->my - z->my; } e->shift = (wparam & MK_SHIFT) != 0; e->ctrl = (wparam & MK_CONTROL) != 0; e->alt = (wparam & MK_ALT) != 0; if (z) { z->mx = e->mx; z->my = e->my; } if (capture) { if (!captured && capture == 1) SetCapture(wnd); captured += capture; if (!captured && capture == -1) ReleaseCapture(); if (captured < 0) captured = 0; } } static void stbwingraph__mousewheel(stbwingraph_event *e, int type, WPARAM wparam, LPARAM lparam, int capture, void *wnd, stbwingraph__window *z) { // lparam seems bogus! static int captured = 0; e->type = type; if (z) { e->mx = z->mx; e->my = z->my; } e->dx = e->dy = 0; e->shift = (wparam & MK_SHIFT) != 0; e->ctrl = (wparam & MK_CONTROL) != 0; e->alt = (GetKeyState(VK_MENU) < 0); e->key = ((int) wparam >> 16); } int stbwingraph_force_update; static int WINAPI stbwingraph_WinProc(HWND wnd, UINT msg, WPARAM wparam, LPARAM lparam) { int allow_default = TRUE; stbwingraph_event e = { STBWGE__none }; // the following line is wrong for 64-bit windows, but VC6 doesn't have GetWindowLongPtr stbwingraph__window *z = (stbwingraph__window *) GetWindowLong(wnd, GWL_USERDATA); switch (msg) { case WM_CREATE: { LPCREATESTRUCT lpcs = (LPCREATESTRUCT) lparam; assert(z == NULL); z = (stbwingraph__window *) lpcs->lpCreateParams; SetWindowLong(wnd, GWL_USERDATA, (LONG) z); z->dc = GetDC(wnd); if (stbwingraph_SetPixelFormat(wnd, z->color, z->alpha, z->depth, z->stencil, z->accum)) { z->rc = wglCreateContext(z->dc); if (z->rc) { e.type = STBWGE_create; z->did_share_lists = FALSE; if (z->share_window) { stbwingraph__window *y = (stbwingraph__window *) GetWindowLong(z->share_window, GWL_USERDATA); if (wglShareLists(z->rc, y->rc)) z->did_share_lists = TRUE; } wglMakeCurrent(z->dc, z->rc); return 0; } } return -1; } case WM_PAINT: { PAINTSTRUCT ps; HDC hdc = BeginPaint(wnd, &ps); SelectObject(hdc, GetStockObject(NULL_BRUSH)); e.type = STBWGE_draw; e.handle = wnd; z->func(z->data, &e); EndPaint(wnd, &ps); return 0; } case WM_DESTROY: e.type = STBWGE_destroy; e.handle = wnd; if (z && z->func) z->func(z->data, &e); wglMakeCurrent(NULL, NULL) ; if (z) { if (z->rc) wglDeleteContext(z->rc); z->dc = 0; z->rc = 0; } if (wnd == stbwingraph_primary_window) PostQuitMessage (0); return 0; case WM_CHAR: stbwingraph__key(&e, STBWGE_char , wparam, z); break; case WM_KEYDOWN: stbwingraph__key(&e, STBWGE_keydown, wparam, z); break; case WM_KEYUP: stbwingraph__key(&e, STBWGE_keyup , wparam, z); break; case WM_NCMOUSEMOVE: stbwingraph__inclient(z,0); break; case WM_MOUSEMOVE: stbwingraph__inclient(z,1); stbwingraph__mouse(&e, STBWGE_mousemove, wparam, lparam,0,wnd, z); break; case WM_LBUTTONDOWN: stbwingraph__mouse(&e, STBWGE_leftdown, wparam, lparam,1,wnd, z); break; case WM_MBUTTONDOWN: stbwingraph__mouse(&e, STBWGE_middledown, wparam, lparam,1,wnd, z); break; case WM_RBUTTONDOWN: stbwingraph__mouse(&e, STBWGE_rightdown, wparam, lparam,1,wnd, z); break; case WM_LBUTTONUP: stbwingraph__mouse(&e, STBWGE_leftup, wparam, lparam,-1,wnd, z); break; case WM_MBUTTONUP: stbwingraph__mouse(&e, STBWGE_middleup, wparam, lparam,-1,wnd, z); break; case WM_RBUTTONUP: stbwingraph__mouse(&e, STBWGE_rightup, wparam, lparam,-1,wnd, z); break; case WM_MOUSEWHEEL: stbwingraph__mousewheel(&e, STBWGE_mousewheel, wparam, lparam,0,wnd, z); break; case WM_ACTIVATE: allow_default = FALSE; if (LOWORD(wparam)==WA_INACTIVE ) { wglMakeCurrent(z->dc, NULL); e.type = STBWGE_deactivate; z->active = FALSE; } else { wglMakeCurrent(z->dc, z->rc); e.type = STBWGE_activate; z->active = TRUE; } e.handle = wnd; z->func(z->data, &e); return 0; case WM_SIZE: { RECT rect; allow_default = FALSE; GetClientRect(wnd, &rect); e.type = STBWGE_size; e.width = rect.right; e.height = rect.bottom; e.handle = wnd; z->func(z->data, &e); return 0; } default: return DefWindowProc (wnd, msg, wparam, lparam); } if (e.type != STBWGE__none) { int n; e.handle = wnd; n = z->func(z->data, &e); if (n == STBWINGRAPH_winproc_exit) { PostQuitMessage(0); n = 0; } if (n == STBWINGRAPH_winproc_update) { stbwingraph_force_update = TRUE; return 1; } if (n != STBWINGRAPH_unprocessed) return n; } return DefWindowProc (wnd, msg, wparam, lparam); } int stbwingraph_DefineClass(HINSTANCE hInstance, char *iconname) { WNDCLASSEX wndclass; stbwingraph_app = hInstance; wndclass.cbSize = sizeof(wndclass); wndclass.style = CS_OWNDC; wndclass.lpfnWndProc = (WNDPROC) stbwingraph_WinProc; wndclass.cbClsExtra = 0; wndclass.cbWndExtra = 0; wndclass.hInstance = hInstance; wndclass.hIcon = LoadIcon(hInstance, iconname); wndclass.hCursor = LoadCursor(NULL,IDC_ARROW); wndclass.hbrBackground = GetStockObject(NULL_BRUSH); wndclass.lpszMenuName = "zwingraph"; wndclass.lpszClassName = "zwingraph"; wndclass.hIconSm = NULL; if (!RegisterClassEx(&wndclass)) return FALSE; return TRUE; } void stbwingraph_ShowWindow(void *window) { stbwingraph_event e = { STBWGE_create_postshow }; stbwingraph__window *z = (stbwingraph__window *) GetWindowLong(window, GWL_USERDATA); ShowWindow(window, SW_SHOWNORMAL); InvalidateRect(window, NULL, TRUE); UpdateWindow(window); e.handle = window; z->func(z->data, &e); } void *stbwingraph_CreateWindow(int primary, stbwingraph_window_proc func, void *data, char *text, int width, int height, int fullscreen, int resizeable, int dest_alpha, int stencil) { HWND win; DWORD dwstyle; stbwingraph__window *z = (stbwingraph__window *) malloc(sizeof(*z)); if (z == NULL) return NULL; memset(z, 0, sizeof(*z)); z->color = 24; z->depth = 24; z->alpha = dest_alpha; z->stencil = stencil; z->func = func; z->data = data; z->mx = -(1 << 30); z->my = 0; if (primary) { if (stbwingraph_request_windowed) fullscreen = FALSE; else if (stbwingraph_request_fullscreen) fullscreen = TRUE; } if (fullscreen) { #ifdef STB_SIMPLE stbwingraph_ChangeResolution(width, height, 32, 1); #else if (!stbwingraph_ChangeResolution(width, height, 32, 0)) return NULL; #endif dwstyle = WS_POPUP | WS_CLIPSIBLINGS; } else { RECT rect; dwstyle = WS_OVERLAPPED | WS_CAPTION | WS_SYSMENU | WS_MINIMIZEBOX; if (resizeable) dwstyle |= WS_SIZEBOX | WS_MAXIMIZEBOX; rect.top = 0; rect.left = 0; rect.right = width; rect.bottom = height; AdjustWindowRect(&rect, dwstyle, FALSE); width = rect.right - rect.left; height = rect.bottom - rect.top; } win = CreateWindow("zwingraph", text ? text : "sample", dwstyle, CW_USEDEFAULT,0, width, height, NULL, NULL, stbwingraph_app, z); if (win == NULL) return win; if (primary) { if (stbwingraph_primary_window) stbwingraph_DestroyWindow(stbwingraph_primary_window); stbwingraph_primary_window = win; } { stbwingraph_event e = { STBWGE_create }; stbwingraph__window *z = (stbwingraph__window *) GetWindowLong(win, GWL_USERDATA); z->window = win; e.did_share_lists = z->did_share_lists; e.handle = win; if (z->func(z->data, &e) != STBWINGRAPH_do_not_show) stbwingraph_ShowWindow(win); } return win; } void *stbwingraph_CreateWindowSimple(stbwingraph_window_proc func, int width, int height) { int fullscreen = 0; #ifndef _DEBUG if (width == 640 && height == 480) fullscreen = 1; if (width == 800 && height == 600) fullscreen = 1; if (width == 1024 && height == 768) fullscreen = 1; if (width == 1280 && height == 1024) fullscreen = 1; if (width == 1600 && height == 1200) fullscreen = 1; //@TODO: widescreen widths #endif return stbwingraph_CreateWindow(1, func, NULL, NULL, width, height, fullscreen, 1, 0, 0); } void *stbwingraph_CreateWindowSimpleFull(stbwingraph_window_proc func, int fullscreen, int ww, int wh, int fw, int fh) { if (fullscreen == -1) { #ifdef _DEBUG fullscreen = 0; #else fullscreen = 1; #endif } if (fullscreen) { if (fw) ww = fw; if (fh) wh = fh; } return stbwingraph_CreateWindow(1, func, NULL, NULL, ww, wh, fullscreen, 1, 0, 0); } void stbwingraph_DestroyWindow(void *window) { stbwingraph__window *z = (stbwingraph__window *) GetWindowLong(window, GWL_USERDATA); DestroyWindow(window); free(z); if (stbwingraph_primary_window == window) stbwingraph_primary_window = NULL; } void stbwingraph_ShowCursor(void *window, int visible) { int hide; stbwingraph__window *win; if (!window) window = stbwingraph_primary_window; win = (stbwingraph__window *) GetWindowLong((HWND) window, GWL_USERDATA); hide = !visible; if (hide != win->hide_mouse) { win->hide_mouse = hide; if (!hide) ShowCursor(TRUE); else if (win->in_client) ShowCursor(FALSE); } } float stbwingraph_GetTimestep(float minimum_time) { float elapsedTime; double thisTime; static double lastTime = -1; if (lastTime == -1) lastTime = timeGetTime() / 1000.0 - minimum_time; for(;;) { thisTime = timeGetTime() / 1000.0; elapsedTime = (float) (thisTime - lastTime); if (elapsedTime >= minimum_time) { lastTime = thisTime; return elapsedTime; } #if 1 Sleep(2); #endif } } void stbwingraph_SetGLWindow(void *win) { stbwingraph__window *z = (stbwingraph__window *) GetWindowLong(win, GWL_USERDATA); if (z) wglMakeCurrent(z->dc, z->rc); } void stbwingraph_MakeFonts(void *window, int font_base) { wglUseFontBitmaps(GetDC(window ? window : stbwingraph_primary_window), 0, 256, font_base); } // returns 1 if WM_QUIT, 0 if 'func' returned 0 int stbwingraph_MainLoop(stbwingraph_update func, float mintime) { int needs_drawing = FALSE; MSG msg; int is_animating = TRUE; if (mintime <= 0) mintime = 0.01f; for(;;) { int n; is_animating = TRUE; // wait for a message if: (a) we're animating and there's already a message // or (b) we're not animating if (!is_animating || PeekMessage(&msg, NULL, 0, 0, PM_NOREMOVE)) { stbwingraph_force_update = FALSE; if (GetMessage(&msg, NULL, 0, 0)) { TranslateMessage(&msg); DispatchMessage(&msg); } else { return 1; // WM_QUIT } // only force a draw for certain messages... // if I don't do this, we peg at 50% for some reason... must // be a bug somewhere, because we peg at 100% when rendering... // very weird... looks like NVIDIA is pumping some messages // through our pipeline? well, ok, I guess if we can get // non-user-generated messages we have to do this if (!stbwingraph_force_update) { switch (msg.message) { case WM_MOUSEMOVE: case WM_NCMOUSEMOVE: break; case WM_CHAR: case WM_KEYDOWN: case WM_KEYUP: case WM_LBUTTONDOWN: case WM_MBUTTONDOWN: case WM_RBUTTONDOWN: case WM_LBUTTONUP: case WM_MBUTTONUP: case WM_RBUTTONUP: case WM_TIMER: case WM_SIZE: case WM_ACTIVATE: needs_drawing = TRUE; break; } } else needs_drawing = TRUE; } // if another message, process that first // @TODO: i don't think this is working, because I can't key ahead // in the SVT demo app if (PeekMessage(&msg, NULL, 0,0, PM_NOREMOVE)) continue; // and now call update if (needs_drawing || is_animating) { int real=1, in_client=1; if (stbwingraph_primary_window) { stbwingraph__window *z = (stbwingraph__window *) GetWindowLong(stbwingraph_primary_window, GWL_USERDATA); if (z && !z->active) { real = 0; } if (z) in_client = z->in_client; } if (stbwingraph_primary_window) stbwingraph_SetGLWindow(stbwingraph_primary_window); n = func(stbwingraph_GetTimestep(mintime), real, in_client); if (n == STBWINGRAPH_update_exit) return 0; // update_quit is_animating = (n != STBWINGRAPH_update_pause); needs_drawing = FALSE; } } } void stbwingraph_SwapBuffers(void *win) { stbwingraph__window *z; if (win == NULL) win = stbwingraph_primary_window; z = (stbwingraph__window *) GetWindowLong(win, GWL_USERDATA); if (z && z->dc) SwapBuffers(z->dc); } #endif #ifdef STB_WINMAIN void stbwingraph_main(void); char *stb_wingraph_commandline; int WINAPI WinMain(HINSTANCE hInstance, HINSTANCE hPrevInstance, LPSTR lpCmdLine, int nCmdShow) { { char buffer[1024]; // add spaces to either side of the string buffer[0] = ' '; strcpy(buffer+1, lpCmdLine); strcat(buffer, " "); if (strstr(buffer, " -reset ")) { ChangeDisplaySettings(NULL, 0); exit(0); } if (strstr(buffer, " -window ") || strstr(buffer, " -windowed ")) stbwingraph_request_windowed = TRUE; else if (strstr(buffer, " -full ") || strstr(buffer, " -fullscreen ")) stbwingraph_request_fullscreen = TRUE; } stb_wingraph_commandline = lpCmdLine; stbwingraph_DefineClass(hInstance, "appicon"); stbwingraph_main(); return 0; } #endif #undef STB_EXTERN #ifdef STB_WINGRAPH_DISABLE_DEFINE_AT_END #undef STB_DEFINE #endif #endif // INCLUDE_STB_WINGRAPH_H uTox/third_party/stb/stb/tests/oversample/oversample.exe0000600000175000001440000015200014003056224022603 0ustar rakusersMZ@ !L!This program cannot be run in DOS mode. $i -kֆ-kֆ-kֆBt݆,kֆw؆>kֆBt܆vkֆd kֆ-k׆YkֆyH,kֆRich-kֆPELVT @@UPX0UPX1@UPX2@3.03UPX!  <Ώ%pU;`&L$$ T$PQRKR{%$ 9*oFPhA}ÐD$t}Mt8t3x3ߋj øvb_'3!#s`vhDOSUVW3PVV*ȋ$?8Wn $$((9|$~xu9l$|u 9:t9 FQ|VjyNu̼e!ovkFU.Wh!NjP D>5^.jRp.l_^][:BQ o9hz@ փ f*$X. 7hph N;2d},gtj]||P ; =Q??hUtS_:`SrBqOhLYn||aŃ(,vTTP oÊ fr(<_{ 8f DxmB>FH6aY %,g{oj(R" uoQ (wQj(Wf{1TR-`x_/?x084QPE<0 @)YӍ|4Ӽ ܍-D`)R(,0^Nf40^W Z~ jjWܜfX|=L .j,4H-W"L0VWNVmFF R> :Wfcm4(P4PR$tRVىv2$F8fItpPH$$hTt~ rQ(Xai/3-k;@t;tRwA8SSF>@^( =auLf]VQ@Z(R +X)84q07Dn= @%)a'~DQWv iã=jbL0P4h<~lZVLQRD$TP9xP DOoȁ; P`tIVSxazjV;G*TRjZ3:KDPh 3e1djw[]U,j 4B;t̺<_@@LAl^?5_V] pWp lH.z4<'L Bn VXN[- tvO%+<4DjDQ.ʋ]l1|Fx\@ ` XztޝFߏ.tG;}M)t;uj)iUqST^;tq,u Btj0ܱw(S3(5fDz։\jlV|0do;g&nih%t;{8s9 u_7^?b 0P(ͅQg/.Az$ #<SR(vdW!'<֔h9!X Q2-=Ҙ¼Tlt TpLQ+`^&to*+g 84u3 ΃p0/ BU"$8L=(r8CNV]`M|C8_Q@( OJҡW5Ƃӂ +֊ @PW:8}fքhQfG\N"_tFhOuN|w*xP8hp8!5+`tN FA tw*jhX|*,h\J@+^ƺ.r%@apv"qH28.^ACo3퍘3;W~AWx\JuY[Hl0td1Z@n$~ F wnnVx6,F(/n")Z7,fT*,A" 7`#WX ~ M @ؤ;|hjOL\vBXSV"X#(|rFN;PQ S7bxz N8 f(^H*u4h0%`E fxZut8  H<Ou_ppl Shh0X,P|VT*Xur|ڂoQ~+{MttGzoW4Bf(;} hx۾k.9t-42HK);nPriVHuy.4L<2;} f0_T^ (.x@M/ uǍ]I6ko+U 8;jL0RWPV`;L|;R} &&; Rzt"0;¼u;9<} o~R؋3~ I ]3B>b }L0Eސ <;Ϫ0F/2Ę2|J[0+h%;` (d~.a~hPWx(Ք,b }2DT*6N|(|*ppߋ;D} f2ZljT4Ț d[Q Ĺ*jK h⮏0PөL% .Q;0(~`]E䋀RAt&u3Mߋl3+:Ht> u3QT slłݯ(@Hul("`02QE7..,9 */^CS7>~UMjO GJyBvu*ZND1\r_XGĒM|&1qĈ0t*L*x(4Vo! Hu4F^QȈ$j3]э',B_T[:f= ҪVbr?;VQD+ G Ӆ* ʥ;fyNfQLV d#,,"/Je4$4"؎ۯj~tb= FтUoʃJ8d^4'i>5,ҁ04 6 #Owt(!  }ئ$RDȏ;1lq;Vr-Si@(]ߤ: L[-ǧ I yy< .(#SgS9G#~  :ٌ04%A z>p1  Ld/Vq`v\<,w8C@e_;|Pq:@tipČhp t21`:>1R'TX/]O8%: OT=zӏPeʂCT;;4&MAt `tVzjJ4 Z"BL HZFfE=ނ8FMULrb@4׸@+ vŒ@ sHR|Nh0DBCMt`\Dnf.R(}1"=HH4~ ?X, 6ӄ:b^6(8[8\"4ڊe9n6zwg8~q/dmD ;ݍOW{t9|A⏅L6A Q*i)}$\ 9~PZ6 9.u35tH ;t#8;9~ǖ0{q poW9j*u;up4LrFKR@* WH[ 4@P#2l!\^u&5_ ;}X K  9t1} J4u HrlB rd! {t0NS3,AH+B# 8 tzz @Q;<"*Ë[ A8~,SB;[{=J"cVSnG W5X'gTu2 A k8ر2XI4XJ;QN +3ŠWV5l'O_Jh(E>Q8ͺa^ dnS6$3f0lnp P4X$(3pB‹ ;}np|j;u+H 8W|! >668==ӈ>;}|[>](} وq{@ B BYu"IHA*Z%N؄!-y13S(tx ;HxH `( nP+4 X T<"TTU(5xT8ꍸ|:1&">9k.t73w75DKDjJHHSWTh33> ,WHxj0C؋+/W iy: zªQ # 6 jiy.Y$uu*40VV5,PPVU ʹϠ,6i! SX!p?0PǼ/p?Q^woA8 y*t\GROXt.l,/=S+@t 1^Hp^s;*:@+< W3a o5~O&4Blh(~+rhBf)nZ)H|rfu<~lgF1lJuPNd<&u t#ʼo&ho5REP8+U{ lE:vzr'/=}t1 +uPv3)8p8>d}+mWPPE)tÖJt@0)[lrW[f+h|fJ6VBG:"G^¨@28nC;YV 7ppNWa#br9R  p$ؚKWlLK>V5$v )_[Ą83k ~SJ-POf V/):ONfk3!XilH tTL[ |fo5GуL!\ q 74D0Ɔ8PvAG;͈G~_0(V.7߃Q 3V%Q|Ǘ@Aw*ϡssLDж%w Sy730_ {ѐ(}9 r%C!YH}5Le&(51!_2=8 5(\hD guP鞠q < 28 φ, RPbfJC JO0ri@S48p=<_ɝ!Պ'ٳgLcVݟ ״g)-=$ipOy=o0S2TDc& vQ&*kR&PzU@Snp VqPഗjD#S. UE0F#F RQSѼ3.8PSxc PX8HE/_@@C\7@_[^%+8Q`֤=EҎ A4H{Op(h5Eiic. j 7[$ ABh-=Z(BD9LЁt-`ַ*tGNI Uҏ0Zl@ [t;*\,ΣZ ̷'x ZɸVUMVA4R vM.5M^ߝݹ9B4%Ñm3H$Dž=}m\{=%X{wwgp4hru F(Ǝ"_0+1 )H(']:E?\Hw 6UY~+o~n;v"W}u}Wr S+ːߋ&I+Ў0 o ;sU +$ $0D9;+FV Ks@ li SK;Mr.6[Jt +l`vfb6X7)pV`k"Y CS#v2OL%N 3z J|ƅ*LpP/|3.h@|?T=֢Y(~Ste9S|5tY7P;6 Fz>Sټ@/P$YvfT <8=u)yu D89Zu0$0`V &؎|뢛؛{z9jh8h@d[ d%kXpeԉS})Lȉ 7^it~cYjY9kԣI9 BEB3HVm7ۢEЊ E XpHF,SVb ĘWiT u="xJPu!h vf3 %^IYK2}MdZ^8@tf.ۄs#VN$F_0 $ f*u"IYPu SjVYd+->+Hr*IWN~W2nzE*3Uw\dH@ t j靝ZotIRtM_9_v ~[]\ .`[GMn ­|9U. |ixÊ$XDRSwn@HUion^Z;t-tH*HtJYrO#^|}d*u#P0_1uO^nDAfB};sl6 ۷iIt.ht lp!7wM?2 ?6u4uGGN 18Ћ KA5 t"zP 1^`Gf1ďB,gIFe]i"Xx/Cpl E0uUa&&tcX43CeȂ~ngA r,%$EPvNPi8@@B9?\ &@5}GZa \NP˺|uP Bd2~)Ztv+2t]\u1YTȏA0t38P,/tgcT:wY(P[R!(gD,[h }M@Ppm]MI4@lY-d-u tRG0`| M2iy!4%KsJQf6F+W"ɂ'<+(Ntd^8߃gLI{Aev]&~E0Q"EHC(>;5/6 YS>f0 @x Ӿt u>YA{t!rx @ ȱn%Aq33t|Bs|' TӋ:uHe} d+6 ur<N&F$3܍ptTu|]쮼TY:0.#L9~]{ߴԀ뵠+`J|090 H@040'Q%t']f_&ǂ-y+ t u+u0 F|Vj ^#P+Xv|b0I|tA ~xCPCw[㽃2Qv/}𰳋OC;XtKpVr~h@gA_ S Kpb&};jWFPm?xVKnF7mG#AQ9f;\X |Yjv L3a@ðSM)\C3 MI@Yf,3L?Zl6WT`Tp-CH;k`PSW_SVCi~bM!MA~EQu!O]B:uփ=LVx0` NJIZ*v!=Zg #oÎP+k- sXR KOu2W]im-ɨkup``T ` OC̖`p9pAIEC?>3'#0< `zu^`fI~5H W8V'<8اȿ ܡ|at\X4[`&&-MZLH< 7ozH@FQ, hSPPO+xXlr7ajch PhhXhsA8 tj,{,pj0@8t9;uw0;j '1Dt-+^tXtx0,v}YZ0`h->| mt 6ch dJY 8CqoѸblh@at^Mi/%8 d q~ XVI=;s?P+P @HrP$# ( A4 M+y i z?ČDI1I1U j] u~J?v?Zx{ՋKKuL sL!\D u(!(#!JA=\l[yBY 7S[MZn "R.]ߍ̂h]+u"4K^;v]',цq;";tcM&qzq@!trLu&3[1K=9o*x|?2Idj~ȴd蚁kK}\S`݉\n Na`>Ms%(N ^0 DZ )IgpiKȄq 4\D0r`o /15H ,X n{^T?e Psv@دHCH#~_yCN `#xd@{iiS6p %>=SQ+ȥߖQH̠]x _;Ev/&]B=Ms;ܟih`W*жBy>q6u;C LOr"B8X :S 50P_#W;tn35{hAa4f-Ht*je`W2 u:}NB~ ł8FG/*qA3ۄюCniZ0@ < y hZ lNlpWoNwmtr)ǀ@tik~ G@V?ں`_ d+4w;} >t賈9Vp[V \VLqҋn+~dnP,nP16A9-;; u։=m;sD98#0 G ~4(`))ʆ:vx{@4St)gO Y0Tp+ӦB)PgR)U90CN!}ňJs) aU`,xu> 4;sCu0?vX^;@CFsN;"t@Blੰ 9Uh>Lrqƭmfs~fsvud+@^X%C@V\p b +V1qH1,Ls)E/Vr4뮬링inAzňnk+!1G@VhD 4~G) |v@{ +Ȉ`se&Ⴄr'PA40 vJMuBDƷ";w+;v'Wsdx 38@<iЌCUcC+FдXFQF6B&&ƅՙYD𢿴O]El[iMm6L6xAahBN6vp+On?FYtBa,FM~0835ʐ !+AԊW TȈF F %ي;Ko"t :t@:jg" t*1 eFEH0t8uH@AҸ, r=z8t@E??2t'n*FA*EF-M Q z 8^ݽcj\VC쭀>`p5]q>27-@:~Wxr VnhH(8 88_HnȫCnJE AMqmwՀ%$:M ;xEW}2 Et,fu`߽[Lu+`g}y%PṵVV~+S@PVVF^_tBk$ʍ"w-S6>Q N~0b B8tTQ%u  U~l3337u% tƂd>u[ iVB8t68Aܞ><$Z3cBn =0N)2ݑHH[2p ] ^$h$npH! n |e]X( iDP "$eP< P|ap+Yu<˄(4w!xP3 w%Ҝ4h,/ ɂn@Og[ WSM[;t Dzx X"t Hˑfd؋H%C`dj jx.P@#˃y- $(EY2$4.-/0,#;-ЃI *82F E72#t4=f=t  :( >?밋j`b ]*wN6  z"7c 0M WPދ b;H ~?i$X8r=PP}B!V"X@#~R!uvj@&]y*OX4s\3Lº %It IuN+SJv1!j&fִJ`(H#ʱnFX@@7I]fWN|hbf[t]TOm`3Y**H0Nj{ ] s37*[L:C6#ȼ_}XXg(;.hF%w]%nn?.HXɱLpYOF؀LhXK!9X2#ͨVt3 _D"u y92T V&sm  } ʊF>(Tspa2oҊE2{^;}+`zmxst~Hu܂6CGV^^tGi]а j -t _[8x^Kt(MabƐ 웦N lh@( uDj$=HFV`2:YTm 0wS7%4 tVoʹ%"?@;3ɸHTX A=|̈́fj?7X*_* u er.*>+.6D NQz}jGU̞<#*S<rf$2(Vhp(qVX]9FP2])WV490 #! pX\^eMWet qs.\e  *Ne5BH@'+;OE6f%zKf3g.0^}6V/6##M +1m DI0Dt -x/]v#FO'l#d[1>TO Ê {]00 2Y JH#8vh,ZYl^‚u4W  GD1බa);u}, lj3~$Gt$+ᝄ$%C-oc ~W1E72RѴ^h;JxTNj~7Y\0rxפ)$@l9r3.Ɨ{<<&_ #`FG !_ǹi/IWKݛRGFBG7 |ytld\DD<<< :Nk0 8N^_Đ;ۂ5#F+0W7x*5$$ @ލnY+HYXxo3tNO"t?ۦGSO6[HWZ7St>Zi $y^|7/y yy  ?P XhT|/[' oPPJ+J:<"~ ~ $ȺmZG:ß;"T|`+tEt6tHf9 O )n] }@n7hnus(2낸2uY :bt. u@\;@=u.wcG-{O`Δ-tt3X^ڂhH(;})a ֊T5E3^B]h] "XABpRt @7F?4$j %{ _o<;ƒ;NZ3( .RW@,5445C҄Q &dcИ`$HX[)Ami=k@uZxG'0:|V)tب2h$pJM 8͍A+rH*BUư3b)PNhjz42W~Ӌ;t>UGHt/ASf8< Im]Q p7~mbAzur1zl?f?x^u +j剕qݽ` p6a~Y$ׁrVe6#ͽ2$:/ ŊŊ ӇT r  ۽bۭ i@ >;N;Y [` }5-怽9 t^NLgwѷ5 t9FgR %gTg= `vX ? 4 r4-W [ɜ{aB,b* #vu22>6s*r]h䚁&Jt},?^.G,ó+!-x{# <$ c9q5 `d {m&'.Bƴ, =/l ǭ]b}2A/G69=b .m}2B /G˛=K1[r k}2!G`/GMr̥-= K[}2#/G&rR̖= ڥ-}2/GΓ\)fKn= {}25[m/W<`$PXZ,= t3z80ϙLXvo(:V/,99 C&\+@@kgrT0 ȕ|!2|D2 :[ɕgMX(Q(S:.5 !p > p zFp$Mvy &\.%FngM3B,l6*/x?0+w^ k3 ;=x&(C36 ~&| ,LFVr(s7&4 488[eZ?vG&%؉\oy (ؿp 2u%py#V-$5?Ar4t K/sVr<*`} l5<UC@4$dR pi:6$$VY[4R03vԸ͏ N0ZúW.$ rtyg$$(}/($ =wNms@ yޘ`tC$=C  oGr\$Ru< $ +Y?yn*E X5 Nu `HE}? eA`dr:@A&8N ؅oH") V4I+d ݵ8$cJuF5=TUSvp=ʵ%]=+\J=7=\r$==T 5jYY^QX" |` "ذ90 Vt0+ p9uvmI^+;%tZ@;K=ژ\a<"u%FҖ G[GB  < vF whPn9VW5e3N:t<=tG/6~Yv$0mYph A}=8t9UYE0ڀ?"}x] {Yt[^nu] x_^7"%-O{pi$kVS(D"˜YZS'&x2"cBT_NHPVkniOH8 _ رSV!pt(8E@`%p78W6DP@|)t%VKa^z|WZF@՛k:F8C%|=@=2F t  u'0uFf 2l\gϧWOη&/yUo Ǡ D\u@5PA%,aH:,9} &M":n|SD = K.C\\FbKuA=NJ~ ?t:t.Pk!?7 *,qa?' j̈́ r-4Bldp43~(2&,CK +fp!; ;.7p;?-8 Nf9n L@@u +}L^@^@0]Fnt2#C8U$JBz:&OJUitSG0LJ ctk<8 +@U)U] tV,SWWzxY01h#uSd*0Ҽ&x8lF G:i|Y"M>)BkVD0 .9 }R>8s`߷i@"F| .xF§G6MF.Xlu L`Nj M^HGEp;|l?<4uMBhjXH/ԎQ6KW->NP"  ⴃC|qlh|0^ )UTԽ4@y]A(@}H>;jh#_p1W]X)CXUX|Xe ErH'xD_pt_jX9EpbCA%ʼn<ǍMLKm Xb1Y:=(I@tlA(b D=>:RlC &#C2 t6$AnA0$ĉ>‰rqJȃ p[ @áDVj^{#~ƣ3Y!UH$V571(z-zPX(sF #@= |3ҹp9‹Nh'N b[h ` BC ^}=^RώC {\]p\L8ԁfP@@w9jL ~ :H Dr h 1Rqm"l= *]SV, _~!O A;\2T' VimtdzyBDr;Nwr;P VvN.Uޡ 빘{P +< v+v"zЗ[l$ xH hIZ/H `WLw!?.j /(DFЀ-j w־M+.$xгҿ$zl$\0t 2|+xRQқMlaMco[uu> cb}\w М,v'E\^@^'1`V4Ԇ"D857@JH&I(Nˋ,F66:GwIIi[^_Q=3 0Z-/s:@D0(N{ͬ@lUrün  $> 08 y 'vY/o_^g `lI8+ZD#X:!C% Y\ WSYUWY!@;` hPŒJa1\0TH04 ^Sٓ3HeK AH ]QFZ[Fp,`p:Hf+֋&7 <JhaPuі4[jYdUdδE$k KyE;.H ٚ1ހ H . ݁p3A?;"!`@ n$@YR\&#Pл2#o4*5wC@HKC2 +O}]a'>pfGJ6*DSPAk2~0ۋ~M}sƾA0Z@7#[&ulHN|%E95| 9ۊ^>1BW 4WEBV$W%YXYh Uj{Yf@۞HU>"ߣ@_ DL $]T6^#p! 쵪-#2,pٿk]tEDX! $6>zCP@LJJVouPT)À٤_M@ MͯYL وE ߿Z HJuxt$pttn.2If h$9MhV?lZSfQu,+Ym<  /1Y"{: Oˋ^L0 W U0[IT_u@W\PPp<4?I$m#8@ 2Tf &, .}&N0iͷ&9]~,.i3iovlR,{|ĝ;r 2>-;x2U]4}tA8 \DQAE B2r%8]<:.?^M :r:v@l5{1aK3r}/i¡#Hj H.h;u $$?a"^ \r*FDAY4v@nYwUybHlH0C=N#VsYn Zޮ;B X8ag zZ:xp%C}s%4)_՗8uS3-D$ށt"= t Ht; Wa Y3it`/gorV i @BEƅ 7U._^A;w|UAG ߸ eXߑaBBB_['dIxKPVG;V=Vi )G6cO'\TJ֍f"s)nɈ`q4t ]J9@xviI+ra"TȀ 0aarzw: m"xsd tQYнR?S PUj=*݅Yt@9$t;b8^l;k7vuTo t9=?Ctt>e; g6Cqt߉8guj4k5+p=OTV;ɸ6оY|C?F>o24< ) DF 3[_\Xt<5j2zuz*ލ5fĈOG du a( FZ@@PY ..VY+YE@#b0Wa=Ș_-WoPGBE8(,+w5!PɅÃj02.?TuS bO!z#jP1L X -1<}_3rws lWHMZ:t+$HQHunjb-(j j(j[rQWSYk:AFt tooMF*]ЃKpV^WRH"1ɪP>DHu V<#6s$X Y u-86E8Aj#"։+8AjS1-st\Bh`E,ghT,W>Stm;S!h0`(d vVd!S#)v| o1P) WzDXRi{uuo!'6&t%)?uZ;Qt A:/b-!Hdtu>Y#tl0\+YTq/F>5ei, ur<=ҦĪ <Ir`uG,b&`As+JL6+z걠 TdG;6 9CGh5V3 }QMsM_PV|,aWsRs<1-(h*XIeoT0SjW:(n[H-L U 2< |%7H24Mn+IIPORPP 03P )A@3Q ;^-t}"RҀblWwwXmhRPڼ<&?w.PuLsJ't<@$A?V`a u$t8EHÿDV="d^9u~3D$dZȿL|G4d灰;Y)[F;|L iІY"1 !#F @tؚ>SD*( SwWf&7fρ ~&wWGO\I$Xt``(}.h@%|M8Hơm0~C+ fm5u 7qt[|J PgcaqcCkcm.R+pZ^>ԅV\f?R70*S2$NJ" $dҒM CgpJ[YVVSY:R#~W@ntc aI$ä xܴ9"iRk2)ݘ8"!!4ÀQd@6|a=FWW[SuX FG"SsF6"F99}`XFzYԘӉi,]$F. ـ1zo}ptfipp)M֡tdTۍv2E (}Xh eCȇB܉)]3t\5KM%ffjpDLeSpbq<  2;r;s^ ͂Aƞhf7?,>F0'F-Xpt3VVN@HSvQ ͖}S+ vS hPM6>em"-kA|:0m `u_9u( &CN @!= ހshӾ sy:YB^f~ \.A1X[ 8 $Z B*FM4M76\ t t t !7 uGj^x7 w;$rǷ1| 9j6e:D]uD]kv270C0XI H#6F|~v͆ 1&t,{"RCE~4c{erjNOj K JVQp7lY&(|߁R$9"dHlOK0VU0v>s\0 "32l RgkEXu \`O:捹DN -a.֪#[ WOMD.tdAed;6׏JGC j XOv/{aD t* GυMjX] OX) H#E@N[Jp/tAЁP~xQuPoO(ht0|8Fw_Zxv}8mEvH@Jh̆!Z5dPlF%a$m5S9(ؚjF.(Jo+E=~0cdU@jԚ3۸\¢p3^=J^|Hd@Mxc( Եg:fZT-_U) _qY`8A B"Z 4f];uǮƃf԰F,tCu.h3d#!h*.h9&.~BiMfE|dJ N#+kM} rf}?r@(:lF1uPk3t}j" F VL_ u F/,YuҺ[8ޖ4~ Ta9N4Li :p~P' _u"I6썱 M+n?EȀe*2u*wŽ5K|0;r~nLH.@f*,6y"dU^ x0X4>0cVSZ锻;=(*ɠ7 1ĂiWp t<6~I @KC.brP, sv\ /*r~Q:1$@ b:muL 7m"%E瀈PmS; 9+}+uzPh?>KYuLFZ6$܃0<2 ̋Z=5}deoӴTl K\`fPh"Msƶ~ ftN zH 4&,b\8`>ESP`9*tc}@R&ni -uCOA2.Tl]p'`]<4rn}("} |uϐoZ >)%ZԤ(un;zPr09~ f%Nq?tDģ__4@>?(}e,^iߎE50P] (8PX700WP `h`ppx*U&ܝ4nul)(null__GLOBAL_ HEAP_SELECTED/MSVCRT i~rGAIsProcessorFeature_ent@KERNp32e+0H0 yn1fbxpFfmod_hypot^cabsld?Bo6std5|Q5p viuCBfJcG Q4_T@ȸ/ {"xſ19opebOdNGetLTXtADvdu=&WjdM]&ageBoxri].dv 1#QNANINFD AwS.(  &\@)+n@ν@t`AxAnɏ?7prevena chang>% x -bdisplay.vnhFRrdw lwwailxf{f!es.e0as ڳxyou.kNpWv6coll~nrygn.>yus ƀ/supp|;zwrphhWNsamplex wY ?p|!8mtcfOTTO+typ1maxpkern{WhmtxheaglyoϾd/c/cpo V%s/f g.,ʘoM0I(,ofwp0V{a4^>1:1xt;V, onee=pi?s,P,sndi9F,883.3x1d#g2x27F xght: 4DL̜/2C^G949:D{o:viewTB:RgQab-B{*F7%7IC`G7srgbdd$ -v?/-- (0F)CRrwyy<5:^c}y碶 ݐuDwE?+KA9h( *Hdr%%[\rw]p ހ|. 8@05 |&'g vm#M  [v 7 nn'/''!5ACPvngR/SWYspl/mpVr_g炓ۂ?NN)ߧn??n`y!m˕@~^ړ!@'_AϢB[~Q)^ھ_j2r=e1~@C>$@ A>P$ 4@N@ p+ŝi@]%O@qוC)@D@<զIx@oGAkU'9p|Bݎ~QCv)/&D(DJzEeǑF e uuvHMXB䧓9;5SM]=];Z] T7aZ%]g']݀nLlɛ R`%u?q= ףp ?Zd;On?,eX?#GGŧ?@il7?3=BzՔ?aw̫?/L[Mľ?S;uD?g9Eϔ?$#⼺;1az?aUY~S|_?/DF?9'*?}d|FU>c{#Tw=:zc%C1$oGetStringTypeASd?HandleLoadLibrary7EnvironmentV(iabJAOEMCPbAComp>eWoocLInfoMultiByteToW[;ideChN^Va"FiClo`se% -Po̞@RWQNRtlUnwi='d [&u;, VCsW/2Fe_1fA&hdExcep0>4vRdLCMap[W dOfSlSurrThrތMPnoHyI`LaszN aiAF';TocAddjs0fVtualAll(vhoHpED`aW0ttVsBbGMod sNam&SizKm*n.a2p;<_A3X{pTm~O+z#Zi=Flu sh1Buff!Q1[n4"fSwPcFbj ik oPixJF0X$cXb)K.ey4t#eȁԷSP)EtQuic#AB ǙfʋqIc-˰Rzs>awaEDCum}.y"tufEhe/T ” ܂T ?/PELVT /'_۶}@g^޻Of ؍M![.]!Fl& .ragچ(@в.M^ >@O> .ٶ$I`EW FGurus u(rHuuR1ɃrFtu urAurusu s/vBGIuBw,^jG,<w?u_f)ٍ t<_0PGt܉WHU tPTjSWՍ `(XPTPSWXaD$j9u  0@N\jxKERNEL32.DLLGDI32.dllGLU32.dllOPENGL32.dllUSER32.dllWINMM.dllLoadLibraryAGetProcAddressVirtualProtectVirtualAllocVirtualFreeExitProcessSwapBuffersgluOrtho2DglEndGetDCtimeGetTimeuTox/third_party/stb/stb/tests/oversample/oversample.dsw0000600000175000001440000000100214003056224022612 0ustar rakusersMicrosoft Developer Studio Workspace File, Format Version 6.00 # WARNING: DO NOT EDIT OR DELETE THIS WORKSPACE FILE! ############################################################################### Project: "oversample"=.\oversample.dsp - Package Owner=<4> Package=<5> {{{ }}} Package=<4> {{{ }}} ############################################################################### Global: Package=<5> {{{ }}} Package=<3> {{{ }}} ############################################################################### uTox/third_party/stb/stb/tests/oversample/oversample.dsp0000600000175000001440000000716414003056224022622 0ustar rakusers# Microsoft Developer Studio Project File - Name="oversample" - Package Owner=<4> # Microsoft Developer Studio Generated Build File, Format Version 6.00 # ** DO NOT EDIT ** # TARGTYPE "Win32 (x86) Application" 0x0101 CFG=oversample - 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 "oversample.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 "oversample.mak" CFG="oversample - Win32 Debug" !MESSAGE !MESSAGE Possible choices for configuration are: !MESSAGE !MESSAGE "oversample - Win32 Release" (based on "Win32 (x86) Application") !MESSAGE "oversample - Win32 Debug" (based on "Win32 (x86) Application") !MESSAGE # Begin Project # PROP AllowPerConfigDependencies 0 # PROP Scc_ProjName "" # PROP Scc_LocalPath "" CPP=cl.exe MTL=midl.exe RSC=rc.exe !IF "$(CFG)" == "oversample - Win32 Release" # PROP BASE Use_MFC 0 # PROP BASE Use_Debug_Libraries 0 # PROP BASE Output_Dir "Release" # PROP BASE Intermediate_Dir "Release" # PROP BASE Target_Dir "" # PROP Use_MFC 0 # PROP Use_Debug_Libraries 0 # PROP Output_Dir "Release" # PROP Intermediate_Dir "Release" # PROP Ignore_Export_Lib 0 # PROP Target_Dir "" # ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_WINDOWS" /D "_MBCS" /YX /FD /c # ADD CPP /nologo /W3 /WX /GX /O2 /I "c:\sean\prj\stb" /D "WIN32" /D "NDEBUG" /D "_WINDOWS" /D "_MBCS" /FD /c # SUBTRACT CPP /YX # 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 /subsystem:windows /machine:I386 # ADD LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:windows /machine:I386 # SUBTRACT LINK32 /map /debug !ELSEIF "$(CFG)" == "oversample - Win32 Debug" # PROP BASE Use_MFC 0 # PROP BASE Use_Debug_Libraries 1 # PROP BASE Output_Dir "Debug" # PROP BASE Intermediate_Dir "Debug" # PROP BASE Target_Dir "" # PROP Use_MFC 0 # PROP Use_Debug_Libraries 1 # PROP Output_Dir "Debug" # PROP Intermediate_Dir "Debug" # PROP Ignore_Export_Lib 0 # PROP Target_Dir "" # ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_WINDOWS" /D "_MBCS" /YX /FD /GZ /c # ADD CPP /nologo /W3 /WX /Gm /GX /Zi /Od /I "c:\sean\prj\stb" /D "WIN32" /D "_DEBUG" /D "_WINDOWS" /D "_MBCS" /FD /GZ /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 /subsystem:windows /debug /machine:I386 /pdbtype:sept # ADD LINK32 kernel32.lib user32.lib gdi32.lib advapi32.lib winspool.lib comdlg32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:windows /incremental:no /debug /machine:I386 /pdbtype:sept !ENDIF # Begin Target # Name "oversample - Win32 Release" # Name "oversample - Win32 Debug" # Begin Source File SOURCE=.\main.c # End Source File # End Target # End Project uTox/third_party/stb/stb/tests/oversample/main.c0000600000175000001440000002056714003056224021027 0ustar rakusers#pragma warning(disable:4244; disable:4305; disable:4018) #include #include #define STB_WINMAIN #include "stb_wingraph.h" #define STB_TRUETYPE_IMPLEMENTATION #define STB_RECT_PACK_IMPLEMENTATION #include "stb_rect_pack.h" #include "stb_truetype.h" #ifndef WINGDIAPI #define CALLBACK __stdcall #define WINGDIAPI __declspec(dllimport) #define APIENTRY __stdcall #endif #include #include #define GL_FRAMEBUFFER_SRGB_EXT 0x8DB9 #define SIZE_X 1024 #define SIZE_Y 768 stbtt_packedchar chardata[6][128]; int sx=SIZE_X, sy=SIZE_Y; #define BITMAP_W 512 #define BITMAP_H 512 unsigned char temp_bitmap[BITMAP_W][BITMAP_H]; unsigned char ttf_buffer[1 << 25]; GLuint font_tex; float scale[2] = { 24.0f, 14.0f }; int sf[6] = { 0,1,2, 0,1,2 }; void load_fonts(void) { stbtt_pack_context pc; int i; FILE *f; char filename[256]; char *win = getenv("windir"); if (win == NULL) win = getenv("SystemRoot"); f = fopen(stb_wingraph_commandline, "rb"); if (!f) { if (win == NULL) sprintf(filename, "arial.ttf", win); else sprintf(filename, "%s/fonts/arial.ttf", win); f = fopen(filename, "rb"); if (!f) exit(0); } fread(ttf_buffer, 1, 1<<25, f); stbtt_PackBegin(&pc, temp_bitmap[0], BITMAP_W, BITMAP_H, 0, 1, NULL); for (i=0; i < 2; ++i) { stbtt_PackSetOversampling(&pc, 1, 1); stbtt_PackFontRange(&pc, ttf_buffer, 0, scale[i], 32, 95, chardata[i*3+0]+32); stbtt_PackSetOversampling(&pc, 2, 2); stbtt_PackFontRange(&pc, ttf_buffer, 0, scale[i], 32, 95, chardata[i*3+1]+32); stbtt_PackSetOversampling(&pc, 3, 1); stbtt_PackFontRange(&pc, ttf_buffer, 0, scale[i], 32, 95, chardata[i*3+2]+32); } stbtt_PackEnd(&pc); glGenTextures(1, &font_tex); glBindTexture(GL_TEXTURE_2D, font_tex); glTexImage2D(GL_TEXTURE_2D, 0, GL_ALPHA, BITMAP_W, BITMAP_H, 0, GL_ALPHA, GL_UNSIGNED_BYTE, temp_bitmap); glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR); glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR); } int black_on_white; void draw_init(void) { glDisable(GL_CULL_FACE); glDisable(GL_TEXTURE_2D); glDisable(GL_LIGHTING); glDisable(GL_DEPTH_TEST); glViewport(0,0,sx,sy); if (black_on_white) glClearColor(255,255,255,0); else glClearColor(0,0,0,0); glClear(GL_COLOR_BUFFER_BIT); glMatrixMode(GL_PROJECTION); glLoadIdentity(); gluOrtho2D(0,sx,sy,0); glMatrixMode(GL_MODELVIEW); glLoadIdentity(); } void drawBoxTC(float x0, float y0, float x1, float y1, float s0, float t0, float s1, float t1) { glTexCoord2f(s0,t0); glVertex2f(x0,y0); glTexCoord2f(s1,t0); glVertex2f(x1,y0); glTexCoord2f(s1,t1); glVertex2f(x1,y1); glTexCoord2f(s0,t1); glVertex2f(x0,y1); } int integer_align; void print(float x, float y, int font, char *text) { glEnable(GL_TEXTURE_2D); glBindTexture(GL_TEXTURE_2D, font_tex); glBegin(GL_QUADS); while (*text) { stbtt_aligned_quad q; stbtt_GetPackedQuad(chardata[font], BITMAP_W, BITMAP_H, *text++, &x, &y, &q, font ? 0 : integer_align); drawBoxTC(q.x0,q.y0,q.x1,q.y1, q.s0,q.t0,q.s1,q.t1); } glEnd(); } int font=3; int translating; int rotating=0; int srgb=0; float rotate_t, translate_t; int show_tex; void draw_world(void) { int sfont = sf[font]; float x = 20; glEnable(GL_BLEND); glBlendFunc(GL_SRC_ALPHA, GL_ONE_MINUS_SRC_ALPHA); if (black_on_white) glColor3f(0,0,0); else glColor3f(1,1,1); print(80, 30, sfont, "Controls:"); print(100, 60, sfont, "S: toggle font size"); print(100, 85, sfont, "O: toggle oversampling"); print(100,110, sfont, "T: toggle translation"); print(100,135, sfont, "R: toggle rotation"); print(100,160, sfont, "P: toggle pixel-snap (only non-oversampled)"); print(100,185, sfont, "G: toggle srgb gamma-correction"); if (black_on_white) print(100,210, sfont, "B: toggle to white-on-black"); else print(100,210, sfont, "B: toggle to black-on-white"); print(100,235, sfont, "V: view font texture"); print(80, 300, sfont, "Current font:"); if (!show_tex) { if (font < 3) print(100, 350, sfont, "Font height: 24 pixels"); else print(100, 350, sfont, "Font height: 14 pixels"); } if (font%3==1) print(100, 325, sfont, "2x2 oversampled text at 1:1"); else if (font%3 == 2) print(100, 325, sfont, "3x1 oversampled text at 1:1"); else if (integer_align) print(100, 325, sfont, "1:1 text, one texel = one pixel, snapped to integer coordinates"); else print(100, 325, sfont, "1:1 text, one texel = one pixel"); if (show_tex) { glBegin(GL_QUADS); drawBoxTC(200,400, 200+BITMAP_W,300+BITMAP_H, 0,0,1,1); glEnd(); } else { glMatrixMode(GL_MODELVIEW); glTranslatef(200,350,0); if (translating) x += fmod(translate_t*8,30); if (rotating) { glTranslatef(100,150,0); glRotatef(rotate_t*2,0,0,1); glTranslatef(-100,-150,0); } print(x,100, font, "This is a test"); print(x,130, font, "Now is the time for all good men to come to the aid of their country."); print(x,160, font, "The quick brown fox jumps over the lazy dog."); print(x,190, font, "0123456789"); } } void draw(void) { draw_init(); draw_world(); stbwingraph_SwapBuffers(NULL); } static int initialized=0; static float last_dt; int move[4]; int raw_mouse_x, raw_mouse_y; int loopmode(float dt, int real, int in_client) { float actual_dt = dt; if (!initialized) return 0; rotate_t += dt; translate_t += dt; // music_sim(); if (!real) return 0; if (dt > 0.25) dt = 0.25; if (dt < 0.01) dt = 0.01; draw(); return 0; } int winproc(void *data, stbwingraph_event *e) { switch (e->type) { case STBWGE_create: break; case STBWGE_char: switch(e->key) { case 27: stbwingraph_ShowCursor(NULL,1); return STBWINGRAPH_winproc_exit; break; case 'o': case 'O': font = (font+1) % 3 + (font/3)*3; break; case 's': case 'S': font = (font+3) % 6; break; case 't': case 'T': translating = !translating; translate_t = 0; break; case 'r': case 'R': rotating = !rotating; rotate_t = 0; break; case 'p': case 'P': integer_align = !integer_align; break; case 'g': case 'G': srgb = !srgb; if (srgb) glEnable(GL_FRAMEBUFFER_SRGB_EXT); else glDisable(GL_FRAMEBUFFER_SRGB_EXT); break; case 'v': case 'V': show_tex = !show_tex; break; case 'b': case 'B': black_on_white = !black_on_white; break; } break; case STBWGE_mousemove: raw_mouse_x = e->mx; raw_mouse_y = e->my; break; #if 0 case STBWGE_mousewheel: do_mouse(e,0,0); break; case STBWGE_leftdown: do_mouse(e, 1,0); break; case STBWGE_leftup: do_mouse(e,-1,0); break; case STBWGE_rightdown: do_mouse(e,0, 1); break; case STBWGE_rightup: do_mouse(e,0,-1); break; #endif case STBWGE_keydown: if (e->key == VK_RIGHT) move[0] = 1; if (e->key == VK_LEFT) move[1] = 1; if (e->key == VK_UP) move[2] = 1; if (e->key == VK_DOWN) move[3] = 1; break; case STBWGE_keyup: if (e->key == VK_RIGHT) move[0] = 0; if (e->key == VK_LEFT) move[1] = 0; if (e->key == VK_UP) move[2] = 0; if (e->key == VK_DOWN) move[3] = 0; break; case STBWGE_size: sx = e->width; sy = e->height; loopmode(0,1,0); break; case STBWGE_draw: if (initialized) loopmode(0,1,0); break; default: return STBWINGRAPH_unprocessed; } return 0; } void stbwingraph_main(void) { stbwingraph_Priority(2); stbwingraph_CreateWindow(1, winproc, NULL, "tt", SIZE_X,SIZE_Y, 0, 1, 0, 0); stbwingraph_ShowCursor(NULL, 0); load_fonts(); initialized = 1; stbwingraph_MainLoop(loopmode, 0.016f); // 30 fps = 0.33 } uTox/third_party/stb/stb/tests/oversample/README.md0000600000175000001440000001103414003056224021203 0ustar rakusers# Font character oversampling for rendering from atlas textures TL,DR: Run oversample.exe on a windows machine to see the benefits of oversampling. It will try to use arial.ttf from the Windows font directory unless you type the name of a .ttf file as a command-line argument. ## Benefits of oversampling Oversampling is a mechanism for improving subpixel rendering of characters. Improving subpixel has a few benefits: * With horizontal-oversampling, text can remain sharper while still being sub-pixel positioned for better kerning * Horizontally-oversampled text significantly reduces aliasing when text animates horizontally * Vertically-oversampled text significantly reduces aliasing when text animates vertically * Text oversampled in both directions significantly reduces aliasing when text rotates ## What text oversampling is A common strategy for rendering text is to cache character bitmaps and reuse them. For hinted characters, every instance of a given character is always identical, so this works fine. However, stb_truetype doesn't do hinting. For anti-aliased characters, you can actually position the characters with subpixel precision, and get different bitmaps based on that positioning if you re-render the vector data. However, if you simply cache a single version of the bitmap and draw it at different subpixel positions with a GPU, you will get either the exact same result (if you use point-sampling on the texture) or linear filtering. Linear filtering will cause a sub-pixel positioned bitmap to blur further, causing a visible de-sharpening of the character. (And, since the character wasn't hinted, it was already blurrier than a hinted one would be, and now it gets even more blurry.) You can avoid this by caching multiple variants of a character which were rendered independently from the vector data. For example, you might cache 3 versions of a char, at 0, 1/3, and 2/3rds of a pixel horizontal offset, and always require characters to fall on integer positions vertically. When creating a texture atlas for use on GPUs, which support bilinear filtering, there is a better approach than caching several independent positions, which is to allow lerping between the versions to allow finer subpixel positioning. You can achieve these by interleaving each of the cached bitmaps, but this turns out to be mathematically equivalent to a simpler operation: oversampling and prefiltering the characters. So, setting oversampling of 2x2 in stb_truetype is equivalent to caching each character in 4 different variations, 1 for each subpixel position in a 2x2 set. An advantage of this formulation is that no changes are required to the rendering code; the exact same quad-rendering code works, it just uses different texture coordinates. (Note this does potentially increase texture bandwidth for text rendering since we end up minifying the texture without using mipmapping, but you probably are not going to be fill-bound by your text rendering.) ## What about gamma? Gamma-correction for fonts just doesn't work. This doesn't seem to make much sense -- it's physically correct, it simulates what we'd see if you shrunk a font down really far, right? But you can play with it in the oversample.exe app. If you turn it on, white-on-black fonts become too thick (i.e. they become too bright), and black-on-white fonts become too thin (i.e. they are insufficiently dark). There is no way to adjust the font's inherent thickness (i.e. by switching to bold) to fix this for both; making the font thicker will make white text worse, and making the font thinner will make black text worse. Obviously you could use different fonts for light and dark cases, but this doesn't seem like a very good way for fonts to work. Multiple people who have experimented with this independently (me, Fabian Giesen,and Maxim Shemanarev of Anti-Grain Geometry) have all concluded that correct gamma-correction does not produce the best results for fonts. Font rendering just generally looks better without gamma correction (or possibly with some arbitrary power stuck in there, but it's not really correcting for gamma at that point). Maybe this is in part a product of how we're used to fonts being on screens which has changed how we expect them to look (e.g. perhaps hinting oversharpens them and prevents the real-world thinning you'd see in a black-on-white text). (AGG link on text rendering, including mention of gamma: http://www.antigrain.com/research/font_rasterization/ ) Nevertheless, even if you turn on gamma-correction, you will find that oversampling still helps in many cases for small fonts. uTox/third_party/stb/stb/tests/image_test.dsp0000600000175000001440000000777514003056224020421 0ustar rakusers# Microsoft Developer Studio Project File - Name="image_test" - Package Owner=<4> # Microsoft Developer Studio Generated Build File, Format Version 6.00 # ** DO NOT EDIT ** # TARGTYPE "Win32 (x86) Console Application" 0x0103 CFG=image_test - 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 "image_test.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 "image_test.mak" CFG="image_test - Win32 Debug" !MESSAGE !MESSAGE Possible choices for configuration are: !MESSAGE !MESSAGE "image_test - Win32 Release" (based on "Win32 (x86) Console Application") !MESSAGE "image_test - 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)" == "image_test - Win32 Release" # PROP BASE Use_MFC 0 # PROP BASE Use_Debug_Libraries 0 # PROP BASE Output_Dir "Release" # PROP BASE Intermediate_Dir "Release" # 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 "_CONSOLE" /D "_MBCS" /YX /FD /c # ADD CPP /nologo /W3 /GX /O2 /I ".." /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /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 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 !ELSEIF "$(CFG)" == "image_test - Win32 Debug" # PROP BASE Use_MFC 0 # PROP BASE Use_Debug_Libraries 1 # PROP BASE Output_Dir "Debug" # PROP BASE Intermediate_Dir "Debug" # PROP BASE Target_Dir "" # PROP Use_MFC 0 # PROP Use_Debug_Libraries 1 # PROP Output_Dir "Debug" # PROP Intermediate_Dir "Debug\image_test" # 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 /W3 /Gm /GX /ZI /Od /I ".." /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /FD /GZ /c # SUBTRACT CPP /YX # 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 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 !ENDIF # Begin Target # Name "image_test - Win32 Release" # Name "image_test - Win32 Debug" # Begin Source File SOURCE=.\image_test.c # End Source File # Begin Source File SOURCE=..\stb_image.h # End Source File # Begin Source File SOURCE=..\stb_image_write.h # End Source File # End Target # End Project uTox/third_party/stb/stb/tests/image_test.c0000600000175000001440000001346714003056224020050 0ustar rakusers#define STB_IMAGE_WRITE_IMPLEMENTATION #include "stb_image_write.h" #define STB_IMAGE_IMPLEMENTATION #include "stb_image.h" #define STB_DEFINE #include "stb.h" //#define PNGSUITE_PRIMARY #if 0 void test_ycbcr(void) { STBI_SIMD_ALIGN(unsigned char, y[256]); STBI_SIMD_ALIGN(unsigned char, cb[256]); STBI_SIMD_ALIGN(unsigned char, cr[256]); STBI_SIMD_ALIGN(unsigned char, out1[256][4]); STBI_SIMD_ALIGN(unsigned char, out2[256][4]); int i,j,k; int count = 0, bigcount=0, total=0; for (i=0; i < 256; ++i) { for (j=0; j < 256; ++j) { for (k=0; k < 256; ++k) { y [k] = k; cb[k] = j; cr[k] = i; } stbi__YCbCr_to_RGB_row(out1[0], y, cb, cr, 256, 4); stbi__YCbCr_to_RGB_sse2(out2[0], y, cb, cr, 256, 4); for (k=0; k < 256; ++k) { // inaccurate proxy for values outside of RGB cube if (out1[k][0] == 0 || out1[k][1] == 0 || out1[k][2] == 0 || out1[k][0] == 255 || out1[k][1] == 255 || out1[k][2] == 255) continue; ++total; if (out1[k][0] != out2[k][0] || out1[k][1] != out2[k][1] || out1[k][2] != out2[k][2]) { int dist1 = abs(out1[k][0] - out2[k][0]); int dist2 = abs(out1[k][1] - out2[k][1]); int dist3 = abs(out1[k][2] - out2[k][2]); ++count; if (out1[k][1] > out2[k][1]) ++bigcount; } } } printf("So far: %d (%d big) of %d\n", count, bigcount, total); } printf("Final: %d (%d big) of %d\n", count, bigcount, total); } #endif float hdr_data[200][200][3]; void dummy_write(void *context, void *data, int len) { static char dummy[1024]; if (len > 1024) len = 1024; memcpy(dummy, data, len); } int main(int argc, char **argv) { int w,h; //test_ycbcr(); #if 0 // test hdr asserts for (h=0; h < 100; h += 2) for (w=0; w < 200; ++w) hdr_data[h][w][0] = (float) rand(), hdr_data[h][w][1] = (float) rand(), hdr_data[h][w][2] = (float) rand(); stbi_write_hdr("output/test.hdr", 200,200,3,hdr_data[0][0]); #endif if (argc > 1) { int i, n; for (i=1; i < argc; ++i) { int res; int w2,h2,n2; unsigned char *data; printf("%s\n", argv[i]); res = stbi_info(argv[1], &w2, &h2, &n2); data = stbi_load(argv[i], &w, &h, &n, 4); if (data) free(data); else printf("Failed &n\n"); data = stbi_load(argv[i], &w, &h, 0, 1); if (data) free(data); else printf("Failed 1\n"); data = stbi_load(argv[i], &w, &h, 0, 2); if (data) free(data); else printf("Failed 2\n"); data = stbi_load(argv[i], &w, &h, 0, 3); if (data) free(data); else printf("Failed 3\n"); data = stbi_load(argv[i], &w, &h, &n, 4); assert(data); assert(w == w2 && h == h2 && n == n2); assert(res); if (data) { char fname[512]; stb_splitpath(fname, argv[i], STB_FILE); stbi_write_png(stb_sprintf("output/%s.png", fname), w, h, 4, data, w*4); stbi_write_bmp(stb_sprintf("output/%s.bmp", fname), w, h, 4, data); stbi_write_tga(stb_sprintf("output/%s.tga", fname), w, h, 4, data); stbi_write_png_to_func(dummy_write,0, w, h, 4, data, w*4); stbi_write_bmp_to_func(dummy_write,0, w, h, 4, data); stbi_write_tga_to_func(dummy_write,0, w, h, 4, data); free(data); } else printf("FAILED 4\n"); } } else { int i, nope=0; #ifdef PNGSUITE_PRIMARY char **files = stb_readdir_files("pngsuite/primary"); #else char **files = stb_readdir_files("images"); #endif for (i=0; i < stb_arr_len(files); ++i) { int n; char **failed = NULL; unsigned char *data; printf("."); //printf("%s\n", files[i]); data = stbi_load(files[i], &w, &h, &n, 0); if (data) free(data); else stb_arr_push(failed, "&n"); data = stbi_load(files[i], &w, &h, 0, 1); if (data) free(data); else stb_arr_push(failed, "1"); data = stbi_load(files[i], &w, &h, 0, 2); if (data) free(data); else stb_arr_push(failed, "2"); data = stbi_load(files[i], &w, &h, 0, 3); if (data) free(data); else stb_arr_push(failed, "3"); data = stbi_load(files[i], &w, &h, 0, 4); if (data) ; else stb_arr_push(failed, "4"); if (data) { char fname[512]; #ifdef PNGSUITE_PRIMARY int w2,h2; unsigned char *data2; stb_splitpath(fname, files[i], STB_FILE_EXT); data2 = stbi_load(stb_sprintf("pngsuite/primary_check/%s", fname), &w2, &h2, 0, 4); if (!data2) printf("FAILED: couldn't load 'pngsuite/primary_check/%s\n", fname); else { if (w != w2 || h != w2 || 0 != memcmp(data, data2, w*h*4)) { int x,y,c; if (w == w2 && h == h2) for (y=0; y < h; ++y) for (x=0; x < w; ++x) for (c=0; c < 4; ++c) assert(data[y*w*4+x*4+c] == data2[y*w*4+x*4+c]); printf("FAILED: %s loaded but didn't match PRIMARY_check 32-bit version\n", files[i]); } free(data2); } #else stb_splitpath(fname, files[i], STB_FILE); stbi_write_png(stb_sprintf("output/%s.png", fname), w, h, 4, data, w*4); #endif free(data); } if (failed) { int j; printf("FAILED: "); for (j=0; j < stb_arr_len(failed); ++j) printf("%s ", failed[j]); printf(" -- %s\n", files[i]); } } printf("Tested %d files.\n", i); } return 0; } uTox/third_party/stb/stb/tests/herringbone_map.dsp0000600000175000001440000001010614003056224021415 0ustar rakusers# Microsoft Developer Studio Project File - Name="herringbone_map" - Package Owner=<4> # Microsoft Developer Studio Generated Build File, Format Version 6.00 # ** DO NOT EDIT ** # TARGTYPE "Win32 (x86) Console Application" 0x0103 CFG=herringbone_map - 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 "herringbone_map.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 "herringbone_map.mak" CFG="herringbone_map - Win32 Debug" !MESSAGE !MESSAGE Possible choices for configuration are: !MESSAGE !MESSAGE "herringbone_map - Win32 Release" (based on "Win32 (x86) Console Application") !MESSAGE "herringbone_map - 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)" == "herringbone_map - Win32 Release" # PROP BASE Use_MFC 0 # PROP BASE Use_Debug_Libraries 0 # PROP BASE Output_Dir "Release" # PROP BASE Intermediate_Dir "Release" # PROP BASE Target_Dir "" # PROP Use_MFC 0 # PROP Use_Debug_Libraries 0 # PROP Output_Dir "Release" # PROP Intermediate_Dir "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 /W3 /GX /O2 /I ".." /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /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 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 !ELSEIF "$(CFG)" == "herringbone_map - Win32 Debug" # PROP BASE Use_MFC 0 # PROP BASE Use_Debug_Libraries 1 # PROP BASE Output_Dir "herringbone_map___Win32_Debug" # PROP BASE Intermediate_Dir "herringbone_map___Win32_Debug" # 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 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ /c # ADD CPP /nologo /W3 /Gm /GX /ZI /Od /I ".." /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /FD /GZ /c # SUBTRACT CPP /YX # 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 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 !ENDIF # Begin Target # Name "herringbone_map - Win32 Release" # Name "herringbone_map - Win32 Debug" # Begin Source File SOURCE=.\herringbone_map.c # End Source File # Begin Source File SOURCE=..\stb_herringbone_wang_tile.h # End Source File # End Target # End Project uTox/third_party/stb/stb/tests/herringbone_map.c0000600000175000001440000000470014003056224021054 0ustar rakusers#include #define STB_HBWANG_MAX_X 500 #define STB_HBWANG_MAX_Y 500 #define STB_HERRINGBONE_WANG_TILE_IMPLEMENTATION #include "stb_herringbone_wang_tile.h" #define STB_IMAGE_IMPLEMENTATION #include "stb_image.h" #define STB_IMAGE_WRITE_IMPLEMENTATION #include "stb_image_write.h" int main(int argc, char **argv) { if (argc < 5) { fprintf(stderr, "Usage: herringbone_map {inputfile} {output-width} {output-height} {outputfile}\n"); return 1; } else { char *filename = argv[1]; int out_w = atoi(argv[2]); int out_h = atoi(argv[3]); char *outfile = argv[4]; unsigned char *pixels, *out_pixels; stbhw_tileset ts; int w,h; pixels = stbi_load(filename, &w, &h, 0, 3); if (pixels == 0) { fprintf(stderr, "Couldn't open input file '%s'\n", filename); exit(1); } if (!stbhw_build_tileset_from_image(&ts, pixels, w*3, w, h)) { fprintf(stderr, "Error: %s\n", stbhw_get_last_error()); return 1; } free(pixels); #ifdef DEBUG_OUTPUT { int i,j,k; // add blue borders to top-left edges of the tiles int hstride = (ts.short_side_len*2)*3; int vstride = (ts.short_side_len )*3; for (i=0; i < ts.num_h_tiles; ++i) { unsigned char *pix = ts.h_tiles[i]->pixels; for (j=0; j < ts.short_side_len*2; ++j) for (k=0; k < 3; ++k) pix[j*3+k] = (pix[j*3+k]*0.5+100+k*75)/1.5; for (j=1; j < ts.short_side_len; ++j) for (k=0; k < 3; ++k) pix[j*hstride+k] = (pix[j*hstride+k]*0.5+100+k*75)/1.5; } for (i=0; i < ts.num_v_tiles; ++i) { unsigned char *pix = ts.v_tiles[i]->pixels; for (j=0; j < ts.short_side_len; ++j) for (k=0; k < 3; ++k) pix[j*3+k] = (pix[j*3+k]*0.5+100+k*75)/1.5; for (j=1; j < ts.short_side_len*2; ++j) for (k=0; k < 3; ++k) pix[j*vstride+k] = (pix[j*vstride+k]*0.5+100+k*75)/1.5; } } #endif out_pixels = malloc(out_w * out_h * 3); if (!stbhw_generate_image(&ts, NULL, out_pixels, out_w*3, out_w, out_h)) { fprintf(stderr, "Error: %s\n", stbhw_get_last_error()); return 1; } stbi_write_png(argv[4], out_w, out_h, 3, out_pixels, out_w*3); free(out_pixels); stbhw_free_tileset(&ts); return 0; } }uTox/third_party/stb/stb/tests/herringbone_generator.c0000600000175000001440000000571014003056224022267 0ustar rakusers#define STB_HERRINGBONE_WANG_TILE_IMPLEMENTATION #include "stb_herringbone_wang_tile.h" #define STB_IMAGE_WRITE_IMPLEMENTATION #include "stb_image_write.h" // e 12 1 1 1 1 1 1 4 4 int main(int argc, char **argv) { stbhw_config c = { 0 }; int w,h, num_colors,i; unsigned char *data; if (argc == 1) goto usage; if (argc < 3) goto error; switch (argv[2][0]) { case 'c': if (argc < 8 || argc > 10) goto error; num_colors = 4; c.is_corner = 1; break; case 'e': if (argc < 10 || argc > 12) goto error; num_colors = 6; c.is_corner = 0; break; default: goto error; } c.short_side_len = atoi(argv[3]); for (i=0; i < num_colors; ++i) c.num_color[i] = atoi(argv[4+i]); c.num_vary_x = 1; c.num_vary_y = 1; if (argc > 4+i) c.num_vary_x = atoi(argv[4+i]); if (argc > 5+i) c.num_vary_y = atoi(argv[5+i]); stbhw_get_template_size(&c, &w, &h); data = (unsigned char *) malloc(w*h*3); if (stbhw_make_template(&c, data, w, h, w*3)) stbi_write_png(argv[1], w, h, 3, data, w*3); else fprintf(stderr, "Error: %s\n", stbhw_get_last_error()); return 0; error: fputs("Invalid command-line arguments\n\n", stderr); usage: fputs("Usage (see source for corner & edge type definitions):\n\n", stderr); fputs("herringbone_generator {outfile} c {sidelen} {c0} {c1} {c2} {c3} [{vx} {vy}]\n" " {outfile} -- filename that template will be written to as PNG\n" " {sidelen} -- length of short side of rectangle in pixels\n" " {c0} -- number of colors for corner type 0\n" " {c1} -- number of colors for corner type 1\n" " {c2} -- number of colors for corner type 2\n" " {c3} -- number of colors for corner type 3\n" " {vx} -- number of color-duplicating variations horizontally in template\n" " {vy} -- number of color-duplicating variations vertically in template\n" "\n" , stderr); fputs("herringbone_generator {outfile} e {sidelen} {e0} {e1} {e2} {e3} {e4} {e5} [{vx} {vy}]\n" " {outfile} -- filename that template will be written to as PNG\n" " {sidelen} -- length of short side of rectangle in pixels\n" " {e0} -- number of colors for edge type 0\n" " {e1} -- number of colors for edge type 1\n" " {e2} -- number of colors for edge type 2\n" " {e3} -- number of colors for edge type 3\n" " {e4} -- number of colors for edge type 4\n" " {e5} -- number of colors for edge type 5\n" " {vx} -- number of color-duplicating variations horizontally in template\n" " {vy} -- number of color-duplicating variations vertically in template\n" , stderr); return 1; } uTox/third_party/stb/stb/tests/herringbone.dsp0000600000175000001440000001006314003056224020562 0ustar rakusers# Microsoft Developer Studio Project File - Name="herringbone" - Package Owner=<4> # Microsoft Developer Studio Generated Build File, Format Version 6.00 # ** DO NOT EDIT ** # TARGTYPE "Win32 (x86) Console Application" 0x0103 CFG=herringbone - 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 "herringbone.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 "herringbone.mak" CFG="herringbone - Win32 Debug" !MESSAGE !MESSAGE Possible choices for configuration are: !MESSAGE !MESSAGE "herringbone - Win32 Release" (based on "Win32 (x86) Console Application") !MESSAGE "herringbone - 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)" == "herringbone - Win32 Release" # PROP BASE Use_MFC 0 # PROP BASE Use_Debug_Libraries 0 # PROP BASE Output_Dir "Release" # PROP BASE Intermediate_Dir "Release" # PROP BASE Target_Dir "" # PROP Use_MFC 0 # PROP Use_Debug_Libraries 0 # PROP Output_Dir "Release" # PROP Intermediate_Dir "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 /W3 /GX /O2 /I ".." /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /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 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 !ELSEIF "$(CFG)" == "herringbone - Win32 Debug" # PROP BASE Use_MFC 0 # PROP BASE Use_Debug_Libraries 1 # PROP BASE Output_Dir "herringbone___Win32_Debug" # PROP BASE Intermediate_Dir "herringbone___Win32_Debug" # PROP BASE Target_Dir "" # PROP Use_MFC 0 # PROP Use_Debug_Libraries 1 # PROP Output_Dir "Debug" # PROP Intermediate_Dir "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 /W3 /Gm /GX /ZI /Od /I ".." /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /FD /GZ /c # SUBTRACT CPP /YX # 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 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 !ENDIF # Begin Target # Name "herringbone - Win32 Release" # Name "herringbone - Win32 Debug" # Begin Source File SOURCE=.\herringbone_generator.c # End Source File # Begin Source File SOURCE=..\stb_herringbone_wang_tile.h # End Source File # End Target # End Project uTox/third_party/stb/stb/tests/grid_reachability.c0000600000175000001440000002211314003056224021360 0ustar rakusers#define STB_CONNECTED_COMPONENTS_IMPLEMENTATION #define STBCC_GRID_COUNT_X_LOG2 10 #define STBCC_GRID_COUNT_Y_LOG2 10 #include "stb_connected_components.h" #ifdef GRID_TEST #include #include #include //#define STB_DEFINE #include "stb.h" //#define STB_IMAGE_IMPLEMENTATION #include "stb_image.h" //#define STB_IMAGE_WRITE_IMPLEMENTATION #include "stb_image_write.h" typedef struct { uint16 x,y; } point; point leader[1024][1024]; uint32 color[1024][1024]; point find(int x, int y) { point p,q; p = leader[y][x]; if (p.x == x && p.y == y) return p; q = find(p.x, p.y); leader[y][x] = q; return q; } void onion(int x1, int y1, int x2, int y2) { point p = find(x1,y1); point q = find(x2,y2); if (p.x == q.x && p.y == q.y) return; leader[p.y][p.x] = q; } void reference(uint8 *map, int w, int h) { int i,j; for (j=0; j < h; ++j) { for (i=0; i < w; ++i) { leader[j][i].x = i; leader[j][i].y = j; } } for (j=1; j < h-1; ++j) { for (i=1; i < w-1; ++i) { if (map[j*w+i] == 255) { if (map[(j+1)*w+i] == 255) onion(i,j, i,j+1); if (map[(j)*w+i+1] == 255) onion(i,j, i+1,j); } } } for (j=0; j < h; ++j) { for (i=0; i < w; ++i) { uint32 c = 0xff000000; if (leader[j][i].x == i && leader[j][i].y == j) { if (map[j*w+i] == 255) c = stb_randLCG() | 0xff404040; } color[j][i] = c; } } for (j=0; j < h; ++j) { for (i=0; i < w; ++i) { if (leader[j][i].x != i || leader[j][i].y != j) { point p = find(i,j); color[j][i] = color[p.y][p.x]; } } } } void write_map(stbcc_grid *g, int w, int h, char *filename) { int i,j; for (j=0; j < h; ++j) { for (i=0; i < w; ++i) { unsigned int c; c = stbcc_get_unique_id(g,i,j); c = stb_rehash_improved(c)&0xffffff; if (c == STBCC_NULL_UNIQUE_ID) c = 0xff000000; else c = (~c)^0x555555; if (i % 32 == 0 || j %32 == 0) { int r = (c >> 16) & 255; int g = (c >> 8) & 255; int b = c & 255; r = (r+130)/2; g = (g+130)/2; b = (b+130)/2; c = 0xff000000 + (r<<16) + (g<<8) + b; } color[j][i] = c; } } stbi_write_png(filename, w, h, 4, color, 4*w); } void test_connected(stbcc_grid *g) { int n = stbcc_query_grid_node_connection(g, 512, 90, 512, 871); //printf("%d ", n); } static char *message; LARGE_INTEGER start; void start_timer(char *s) { message = s; QueryPerformanceCounter(&start); } void end_timer(void) { LARGE_INTEGER end, freq; double tm; QueryPerformanceCounter(&end); QueryPerformanceFrequency(&freq); tm = (end.QuadPart - start.QuadPart) / (double) freq.QuadPart; printf("%6.4lf ms: %s\n", tm * 1000, message); } extern void quicktest(void); int loc[5000][2]; int main(int argc, char **argv) { stbcc_grid *g; int w,h, i,j,k=0, count=0, r; uint8 *map = stbi_load("data/map_03.png", &w, &h, 0, 1); assert(map); quicktest(); for (j=0; j < h; ++j) for (i=0; i < w; ++i) map[j*w+i] = ~map[j*w+i]; for (i=0; i < w; ++i) for (j=0; j < h; ++j) //map[j*w+i] = (((i+1) ^ (j+1)) >> 1) & 1 ? 255 : 0; map[j*w+i] = stb_max(abs(i-w/2),abs(j-h/2)) & 1 ? 255 : 0; //map[j*w+i] = (((i ^ j) >> 5) ^ (i ^ j)) & 1 ? 255 : 0; //map[j*w+i] = stb_rand() & 1 ? 255 : 0; #if 1 for (i=0; i < 100000; ++i) map[(stb_rand()%h)*w + stb_rand()%w] ^= 255; #endif _mkdir("tests/output/stbcc"); stbi_write_png("tests/output/stbcc/reference.png", w, h, 1, map, 0); //reference(map, w, h); g = malloc(stbcc_grid_sizeof()); printf("Size: %d\n", stbcc_grid_sizeof()); #if 0 memset(map, 0, w*h); stbcc_init_grid(g, map, w, h); { int n; char **s = stb_stringfile("c:/x/clockwork_update.txt", &n); write_map(g, w, h, "tests/output/stbcc/base.png"); for (i=1; i < n; i += 1) { int x,y,t; sscanf(s[i], "%d %d %d", &x, &y, &t); if (i == 571678) write_map(g, w, h, stb_sprintf("tests/output/stbcc/clockwork_good.png", i)); stbcc_update_grid(g, x, y, t); if (i == 571678) write_map(g, w, h, stb_sprintf("tests/output/stbcc/clockwork_bad.png", i)); //if (i > 571648 && i <= 571712) //write_map(g, w, h, stb_sprintf("tests/output/stbcc/clockwork_%06d.png", i)); } write_map(g, w, h, stb_sprintf("tests/output/stbcc/clockwork_%06d.png", i-1)); } return 0; #endif start_timer("init"); stbcc_init_grid(g, map, w, h); end_timer(); //g = stb_file("c:/x/clockwork_path.bin", 0); write_map(g, w, h, "tests/output/stbcc/base.png"); for (i=0; i < 5000;) { loc[i][0] = stb_rand() % w; loc[i][1] = stb_rand() % h; if (stbcc_query_grid_open(g, loc[i][0], loc[i][1])) ++i; } r = 0; start_timer("reachable"); for (i=0; i < 2000; ++i) { for (j=0; j < 2000; ++j) { int x1 = loc[i][0], y1 = loc[i][1]; int x2 = loc[2000+j][0], y2 = loc[2000+j][1]; r += stbcc_query_grid_node_connection(g, x1,y1, x2,y2); } } end_timer(); printf("%d reachable\n", r); printf("Cluster size: %d,%d\n", STBCC__CLUSTER_SIZE_X, STBCC__CLUSTER_SIZE_Y); #if 1 for (j=0; j < 10; ++j) { for (i=0; i < 5000; ++i) { loc[i][0] = stb_rand() % w; loc[i][1] = stb_rand() % h; } start_timer("updating 2500"); for (i=0; i < 2500; ++i) { if (stbcc_query_grid_open(g, loc[i][0], loc[i][1])) stbcc_update_grid(g, loc[i][0], loc[i][1], 1); else stbcc_update_grid(g, loc[i][0], loc[i][1], 0); } end_timer(); write_map(g, w, h, stb_sprintf("tests/output/stbcc/update_random_%d.png", j*i)); } #endif #if 0 start_timer("removing"); count = 0; for (i=0; i < 1800; ++i) { int x,y,a,b; x = stb_rand() % (w-32); y = stb_rand() % (h-32); if (i & 1) { for (a=0; a < 32; ++a) for (b=0; b < 1; ++b) if (stbcc_query_grid_open(g, x+a, y+b)) { stbcc_update_grid(g, x+a, y+b, 1); ++count; } } else { for (a=0; a < 1; ++a) for (b=0; b < 32; ++b) if (stbcc_query_grid_open(g, x+a, y+b)) { stbcc_update_grid(g, x+a, y+b, 1); ++count; } } //if (i % 100 == 0) write_map(g, w, h, stb_sprintf("tests/output/stbcc/open_random_%d.png", i+1)); } end_timer(); printf("Removed %d grid spaces\n", count); write_map(g, w, h, stb_sprintf("tests/output/stbcc/open_random_%d.png", i)); r = 0; start_timer("reachable"); for (i=0; i < 1000; ++i) { for (j=0; j < 1000; ++j) { int x1 = loc[i][0], y1 = loc[i][1]; int x2 = loc[j][0], y2 = loc[j][1]; r += stbcc_query_grid_node_connection(g, x1,y1, x2,y2); } } end_timer(); printf("%d reachable\n", r); start_timer("adding"); count = 0; for (i=0; i < 1800; ++i) { int x,y,a,b; x = stb_rand() % (w-32); y = stb_rand() % (h-32); if (i & 1) { for (a=0; a < 32; ++a) for (b=0; b < 1; ++b) if (!stbcc_query_grid_open(g, x+a, y+b)) { stbcc_update_grid(g, x+a, y+b, 0); ++count; } } else { for (a=0; a < 1; ++a) for (b=0; b < 32; ++b) if (!stbcc_query_grid_open(g, x+a, y+b)) { stbcc_update_grid(g, x+a, y+b, 0); ++count; } } //if (i % 100 == 0) write_map(g, w, h, stb_sprintf("tests/output/stbcc/close_random_%d.png", i+1)); } end_timer(); write_map(g, w, h, stb_sprintf("tests/output/stbcc/close_random_%d.png", i)); printf("Added %d grid spaces\n", count); #endif #if 0 // for map_02.png start_timer("process"); for (k=0; k < 20; ++k) { for (j=0; j < h; ++j) { int any=0; for (i=0; i < w; ++i) { if (map[j*w+i] > 10 && map[j*w+i] < 250) { //start_timer(stb_sprintf("open %d,%d", i,j)); stbcc_update_grid(g, i, j, 0); test_connected(g); //end_timer(); any = 1; } } if (any) write_map(g, w, h, stb_sprintf("tests/output/stbcc/open_row_%04d.png", j)); } for (j=0; j < h; ++j) { int any=0; for (i=0; i < w; ++i) { if (map[j*w+i] > 10 && map[j*w+i] < 250) { //start_timer(stb_sprintf("close %d,%d", i,j)); stbcc_update_grid(g, i, j, 1); test_connected(g); //end_timer(); any = 1; } } if (any) write_map(g, w, h, stb_sprintf("tests/output/stbcc/close_row_%04d.png", j)); } } end_timer(); #endif return 0; } #endif uTox/third_party/stb/stb/tests/caveview/0000700000175000001440000000000014003056224017357 5ustar rakusersuTox/third_party/stb/stb/tests/caveview/win32/0000700000175000001440000000000014003056224020321 5ustar rakusersuTox/third_party/stb/stb/tests/caveview/win32/SDL_windows_main.c0000600000175000001440000001261614003056224023675 0ustar rakusers/* SDL_windows_main.c, placed in the public domain by Sam Lantinga 4/13/98 The WinMain function -- calls your program's main() function */ #include "SDL_config.h" #ifdef __WIN32__ //#include "../../core/windows/SDL_windows.h" /* Include this so we define UNICODE properly */ #if defined(__WIN32__) #define WIN32_LEAN_AND_MEAN #define STRICT #ifndef UNICODE #define UNICODE 1 #endif #undef _WIN32_WINNT #define _WIN32_WINNT 0x501 /* Need 0x410 for AlphaBlend() and 0x500 for EnumDisplayDevices(), 0x501 for raw input */ #endif #include /* Routines to convert from UTF8 to native Windows text */ #if UNICODE #define WIN_StringToUTF8(S) SDL_iconv_string("UTF-8", "UTF-16LE", (char *)(S), (SDL_wcslen(S)+1)*sizeof(WCHAR)) #define WIN_UTF8ToString(S) (WCHAR *)SDL_iconv_string("UTF-16LE", "UTF-8", (char *)(S), SDL_strlen(S)+1) #else /* !!! FIXME: UTF8ToString() can just be a SDL_strdup() here. */ #define WIN_StringToUTF8(S) SDL_iconv_string("UTF-8", "ASCII", (char *)(S), (SDL_strlen(S)+1)) #define WIN_UTF8ToString(S) SDL_iconv_string("ASCII", "UTF-8", (char *)(S), SDL_strlen(S)+1) #endif /* Sets an error message based on a given HRESULT */ extern int WIN_SetErrorFromHRESULT(const char *prefix, HRESULT hr); /* Sets an error message based on GetLastError(). Always return -1. */ extern int WIN_SetError(const char *prefix); /* Wrap up the oddities of CoInitialize() into a common function. */ extern HRESULT WIN_CoInitialize(void); extern void WIN_CoUninitialize(void); /* Returns SDL_TRUE if we're running on Windows Vista and newer */ extern BOOL WIN_IsWindowsVistaOrGreater(); #include #include /* Include the SDL main definition header */ #include "SDL.h" #include "SDL_main.h" #ifdef main # undef main #endif /* main */ static void UnEscapeQuotes(char *arg) { char *last = NULL; while (*arg) { if (*arg == '"' && (last != NULL && *last == '\\')) { char *c_curr = arg; char *c_last = last; while (*c_curr) { *c_last = *c_curr; c_last = c_curr; c_curr++; } *c_last = '\0'; } last = arg; arg++; } } /* Parse a command line buffer into arguments */ static int ParseCommandLine(char *cmdline, char **argv) { char *bufp; char *lastp = NULL; int argc, last_argc; argc = last_argc = 0; for (bufp = cmdline; *bufp;) { /* Skip leading whitespace */ while (SDL_isspace(*bufp)) { ++bufp; } /* Skip over argument */ if (*bufp == '"') { ++bufp; if (*bufp) { if (argv) { argv[argc] = bufp; } ++argc; } /* Skip over word */ lastp = bufp; while (*bufp && (*bufp != '"' || *lastp == '\\')) { lastp = bufp; ++bufp; } } else { if (*bufp) { if (argv) { argv[argc] = bufp; } ++argc; } /* Skip over word */ while (*bufp && !SDL_isspace(*bufp)) { ++bufp; } } if (*bufp) { if (argv) { *bufp = '\0'; } ++bufp; } /* Strip out \ from \" sequences */ if (argv && last_argc != argc) { UnEscapeQuotes(argv[last_argc]); } last_argc = argc; } if (argv) { argv[argc] = NULL; } return (argc); } /* Show an error message */ static void ShowError(const char *title, const char *message) { /* If USE_MESSAGEBOX is defined, you need to link with user32.lib */ #ifdef USE_MESSAGEBOX MessageBox(NULL, message, title, MB_ICONEXCLAMATION | MB_OK); #else fprintf(stderr, "%s: %s\n", title, message); #endif } /* Pop up an out of memory message, returns to Windows */ static BOOL OutOfMemory(void) { ShowError("Fatal Error", "Out of memory - aborting"); return FALSE; } #if defined(_MSC_VER) /* The VC++ compiler needs main defined */ #define console_main main #endif /* This is where execution begins [console apps] */ int console_main(int argc, char *argv[]) { int status; SDL_SetMainReady(); /* Run the application main() code */ status = SDL_main(argc, argv); /* Exit cleanly, calling atexit() functions */ exit(status); /* Hush little compiler, don't you cry... */ return 0; } /* This is where execution begins [windowed apps] */ int WINAPI WinMain(HINSTANCE hInst, HINSTANCE hPrev, LPSTR szCmdLine, int sw) { char **argv; int argc; char *cmdline; /* Grab the command line */ TCHAR *text = GetCommandLine(); #if UNICODE cmdline = SDL_iconv_string("UTF-8", "UCS-2-INTERNAL", (char *)(text), (SDL_wcslen(text)+1)*sizeof(WCHAR)); #else cmdline = SDL_strdup(text); #endif if (cmdline == NULL) { return OutOfMemory(); } /* Parse it into argv and argc */ argc = ParseCommandLine(cmdline, NULL); argv = SDL_stack_alloc(char *, argc + 1); if (argv == NULL) { return OutOfMemory(); } ParseCommandLine(cmdline, argv); /* Run the main program */ console_main(argc, argv); SDL_stack_free(argv); SDL_free(cmdline); /* Hush little compiler, don't you cry... */ return 0; } #endif /* __WIN32__ */ /* vi: set ts=4 sw=4 expandtab: */ uTox/third_party/stb/stb/tests/caveview/stb_glprog.h0000600000175000001440000004747314003056224021713 0ustar rakusers// stb_glprog v0.02 public domain functions to reduce GLSL boilerplate // http://nothings.org/stb/stb_glprog.h especially with GL1 + ARB extensions // // Following defines *before* including have following effects: // // STB_GLPROG_IMPLEMENTATION // creates the implementation // // STB_GLPROG_STATIC // forces the implementation to be static (private to file that creates it) // // STB_GLPROG_ARB // uses ARB extension names for GLSL functions and enumerants instead of core names // // STB_GLPROG_ARB_DEFINE_EXTENSIONS // instantiates function pointers needed, static to implementing file // to avoid collisions (but will collide if implementing file also // defines any; best to isolate this to its own file in this case). // This will try to automatically #include glext.h, but if it's not // in the default include directories you'll need to include it // yourself and define the next macro. // // STB_GLPROG_SUPPRESS_GLEXT_INCLUDE // disables the automatic #include of glext.h which is normally // forced by STB_GLPROG_ARB_DEFINE_EXTENSIONS // // So, e.g., sample usage on an old Windows compiler: // // #define STB_GLPROG_IMPLEMENTATION // #define STB_GLPROG_ARB_DEFINE_EXTENSIONS // #include // #include "gl/gl.h" // #include "stb_glprog.h" // // Note though that the header-file version of this (when you don't define // STB_GLPROG_IMPLEMENTATION) still uses GLint and such, so you basically // can only include it in places where you're already including GL, especially // on Windows where including "gl.h" requires (some of) "windows.h". // // See following comment blocks for function documentation. // // Version history: // 2013-12-08 v0.02 slightly simplified API and reduced GL resource usage (@rygorous) // 2013-12-08 v0.01 initial release // header file section starts here #if !defined(INCLUDE_STB_GLPROG_H) #define INCLUDE_STB_GLPROG_H #ifndef STB_GLPROG_STATIC #ifdef __cplusplus extern "C" { #endif ////////////////////////////////////////////////////////////////////////////// ///////////// SHADER CREATION /// EASY API extern GLuint stbgl_create_program(char const **vertex_source, char const **frag_source, char const **binds, char *error, int error_buflen); // This function returns a compiled program or 0 if there's an error. // To free the created program, call stbgl_delete_program. // // stbgl_create_program( // char **vertex_source, // NULL or one or more strings with the vertex shader source, with a final NULL // char **frag_source, // NULL or one or more strings with the fragment shader source, with a final NULL // char **binds, // NULL or zero or more strings with attribute bind names, with a final NULL // char *error, // output location where compile error message is placed // int error_buflen) // length of error output buffer // // Returns a GLuint with the GL program object handle. // // If an individual bind string is "", no name is bound to that slot (this // allows you to create binds that aren't continuous integers starting at 0). // // If the vertex shader is NULL, then fixed-function vertex pipeline // is used, if that's legal in your version of GL. // // If the fragment shader is NULL, then fixed-function fragment pipeline // is used, if that's legal in your version of GL. extern void stgbl_delete_program(GLuint program); // deletes a program created by stbgl_create_program or stbgl_link_program /// FLEXIBLE API extern GLuint stbgl_compile_shader(GLenum type, char const **sources, int num_sources, char *error, int error_buflen); // compiles a shader. returns the shader on success or 0 on failure. // // type either: GL_VERTEX_SHADER or GL_FRAGMENT_SHADER // or GL_VERTEX_SHADER_ARB or GL_FRAGMENT_SHADER_ARB // or STBGL_VERTEX_SHADER or STBGL_FRAGMENT_SHADER // sources array of strings containing the shader source // num_sources number of string in sources, or -1 meaning sources is NULL-terminated // error string to output compiler error to // error_buflen length of error buffer in chars extern GLuint stbgl_link_program(GLuint vertex_shader, GLuint fragment_shader, char const **binds, int num_binds, char *error, int error_buflen); // links a shader. returns the linked program on success or 0 on failure. // // vertex_shader a compiled vertex shader from stbgl_compile_shader, or 0 for fixed-function (if legal) // fragment_shader a compiled fragment shader from stbgl_compile_shader, or 0 for fixed-function (if legal) // extern void stbgl_delete_shader(GLuint shader); // deletes a shader created by stbgl_compile_shader ///////////// RENDERING WITH SHADERS extern GLint stbgl_find_uniform(GLuint prog, char *uniform); extern void stbgl_find_uniforms(GLuint prog, GLint *locations, char const **uniforms, int num_uniforms); // Given the locations array that is num_uniforms long, fills out // the locations of each of those uniforms for the specified program. // If num_uniforms is -1, then uniforms[] must be NULL-terminated // the following functions just wrap the difference in naming between GL2+ and ARB, // so you don't need them unless you're using both ARB and GL2+ in the same codebase, // or you're relying on this lib to provide the extensions extern void stbglUseProgram(GLuint program); extern void stbglVertexAttribPointer(GLuint index, GLint size, GLenum type, GLboolean normalized, GLsizei stride, const GLvoid * pointer); extern void stbglEnableVertexAttribArray(GLuint index); extern void stbglDisableVertexAttribArray(GLuint index); extern void stbglUniform1fv(GLint loc, GLsizei count, const GLfloat *v); extern void stbglUniform2fv(GLint loc, GLsizei count, const GLfloat *v); extern void stbglUniform3fv(GLint loc, GLsizei count, const GLfloat *v); extern void stbglUniform4fv(GLint loc, GLsizei count, const GLfloat *v); extern void stbglUniform1iv(GLint loc, GLsizei count, const GLint *v); extern void stbglUniform2iv(GLint loc, GLsizei count, const GLint *v); extern void stbglUniform3iv(GLint loc, GLsizei count, const GLint *v); extern void stbglUniform4iv(GLint loc, GLsizei count, const GLint *v); extern void stbglUniform1f(GLint loc, float v0); extern void stbglUniform2f(GLint loc, float v0, float v1); extern void stbglUniform3f(GLint loc, float v0, float v1, float v2); extern void stbglUniform4f(GLint loc, float v0, float v1, float v2, float v3); extern void stbglUniform1i(GLint loc, GLint v0); extern void stbglUniform2i(GLint loc, GLint v0, GLint v1); extern void stbglUniform3i(GLint loc, GLint v0, GLint v1, GLint v2); extern void stbglUniform4i(GLint loc, GLint v0, GLint v1, GLint v2, GLint v3); ////////////// END OF FUNCTIONS ////////////////////////////////////////////////////////////////////////////// #ifdef __cplusplus } #endif #endif // STB_GLPROG_STATIC #ifdef STB_GLPROG_ARB #define STBGL_VERTEX_SHADER GL_VERTEX_SHADER_ARB #define STBGL_FRAGMENT_SHADER GL_FRAGMENT_SHADER_ARB #else #define STBGL_VERTEX_SHADER GL_VERTEX_SHADER #define STBGL_FRAGMENT_SHADER GL_FRAGMENT_SHADER #endif #endif // INCLUDE_STB_GLPROG_H ///////// header file section ends here #ifdef STB_GLPROG_IMPLEMENTATION #include // strncpy #ifdef STB_GLPROG_STATIC #define STB_GLPROG_DECLARE static #else #define STB_GLPROG_DECLARE extern #endif // check if user wants this file to define the GL extensions itself #ifdef STB_GLPROG_ARB_DEFINE_EXTENSIONS #define STB_GLPROG_ARB // make sure later code uses the extensions #ifndef STB_GLPROG_SUPPRESS_GLEXT_INCLUDE #include "glext.h" #endif #define STB_GLPROG_EXTENSIONS \ STB_GLPROG_FUNC(ATTACHOBJECT , AttachObject ) \ STB_GLPROG_FUNC(BINDATTRIBLOCATION , BindAttribLocation ) \ STB_GLPROG_FUNC(COMPILESHADER , CompileShader ) \ STB_GLPROG_FUNC(CREATEPROGRAMOBJECT , CreateProgramObject ) \ STB_GLPROG_FUNC(CREATESHADEROBJECT , CreateShaderObject ) \ STB_GLPROG_FUNC(DELETEOBJECT , DeleteObject ) \ STB_GLPROG_FUNC(DETACHOBJECT , DetachObject ) \ STB_GLPROG_FUNC(DISABLEVERTEXATTRIBARRAY, DisableVertexAttribArray) \ STB_GLPROG_FUNC(ENABLEVERTEXATTRIBARRAY, EnableVertexAttribArray ) \ STB_GLPROG_FUNC(GETATTACHEDOBJECTS , GetAttachedObjects ) \ STB_GLPROG_FUNC(GETOBJECTPARAMETERIV, GetObjectParameteriv) \ STB_GLPROG_FUNC(GETINFOLOG , GetInfoLog ) \ STB_GLPROG_FUNC(GETUNIFORMLOCATION , GetUniformLocation ) \ STB_GLPROG_FUNC(LINKPROGRAM , LinkProgram ) \ STB_GLPROG_FUNC(SHADERSOURCE , ShaderSource ) \ STB_GLPROG_FUNC(UNIFORM1F , Uniform1f ) \ STB_GLPROG_FUNC(UNIFORM2F , Uniform2f ) \ STB_GLPROG_FUNC(UNIFORM3F , Uniform3f ) \ STB_GLPROG_FUNC(UNIFORM4F , Uniform4f ) \ STB_GLPROG_FUNC(UNIFORM1I , Uniform1i ) \ STB_GLPROG_FUNC(UNIFORM2I , Uniform2i ) \ STB_GLPROG_FUNC(UNIFORM3I , Uniform3i ) \ STB_GLPROG_FUNC(UNIFORM4I , Uniform4i ) \ STB_GLPROG_FUNC(UNIFORM1FV , Uniform1fv ) \ STB_GLPROG_FUNC(UNIFORM2FV , Uniform2fv ) \ STB_GLPROG_FUNC(UNIFORM3FV , Uniform3fv ) \ STB_GLPROG_FUNC(UNIFORM4FV , Uniform4fv ) \ STB_GLPROG_FUNC(UNIFORM1IV , Uniform1iv ) \ STB_GLPROG_FUNC(UNIFORM2IV , Uniform2iv ) \ STB_GLPROG_FUNC(UNIFORM3IV , Uniform3iv ) \ STB_GLPROG_FUNC(UNIFORM4IV , Uniform4iv ) \ STB_GLPROG_FUNC(USEPROGRAMOBJECT , UseProgramObject ) \ STB_GLPROG_FUNC(VERTEXATTRIBPOINTER , VertexAttribPointer ) // define the static function pointers #define STB_GLPROG_FUNC(x,y) static PFNGL##x##ARBPROC gl##y##ARB; STB_GLPROG_EXTENSIONS #undef STB_GLPROG_FUNC // define the GetProcAddress #ifdef _WIN32 #ifndef WINGDIAPI #ifndef STB__HAS_WGLPROC typedef int (__stdcall *stbgl__voidfunc)(void); static __declspec(dllimport) stbgl__voidfunc wglGetProcAddress(char *); #endif #endif #define STBGL__GET_FUNC(x) wglGetProcAddress(x) #else #error "need to define how this platform gets extensions" #endif // create a function that fills out the function pointers static void stb_glprog_init(void) { static int initialized = 0; // not thread safe! if (initialized) return; #define STB_GLPROG_FUNC(x,y) gl##y##ARB = (PFNGL##x##ARBPROC) STBGL__GET_FUNC("gl" #y "ARB"); STB_GLPROG_EXTENSIONS #undef STB_GLPROG_FUNC } #undef STB_GLPROG_EXTENSIONS #else static void stb_glprog_init(void) { } #endif // define generic names for many of the gl functions or extensions for later use; // note that in some cases there are two functions in core and one function in ARB #ifdef STB_GLPROG_ARB #define stbglCreateShader glCreateShaderObjectARB #define stbglDeleteShader glDeleteObjectARB #define stbglAttachShader glAttachObjectARB #define stbglDetachShader glDetachObjectARB #define stbglShaderSource glShaderSourceARB #define stbglCompileShader glCompileShaderARB #define stbglGetShaderStatus(a,b) glGetObjectParameterivARB(a, GL_OBJECT_COMPILE_STATUS_ARB, b) #define stbglGetShaderInfoLog glGetInfoLogARB #define stbglCreateProgram glCreateProgramObjectARB #define stbglDeleteProgram glDeleteObjectARB #define stbglLinkProgram glLinkProgramARB #define stbglGetProgramStatus(a,b) glGetObjectParameterivARB(a, GL_OBJECT_LINK_STATUS_ARB, b) #define stbglGetProgramInfoLog glGetInfoLogARB #define stbglGetAttachedShaders glGetAttachedObjectsARB #define stbglBindAttribLocation glBindAttribLocationARB #define stbglGetUniformLocation glGetUniformLocationARB #define stbgl_UseProgram glUseProgramObjectARB #else #define stbglCreateShader glCreateShader #define stbglDeleteShader glDeleteShader #define stbglAttachShader glAttachShader #define stbglDetachShader glDetachShader #define stbglShaderSource glShaderSource #define stbglCompileShader glCompileShader #define stbglGetShaderStatus(a,b) glGetShaderiv(a, GL_COMPILE_STATUS, b) #define stbglGetShaderInfoLog glGetShaderInfoLog #define stbglCreateProgram glCreateProgram #define stbglDeleteProgram glDeleteProgram #define stbglLinkProgram glLinkProgram #define stbglGetProgramStatus(a,b) glGetProgramiv(a, GL_LINK_STATUS, b) #define stbglGetProgramInfoLog glGetProgramInfoLog #define stbglGetAttachedShaders glGetAttachedShaders #define stbglBindAttribLocation glBindAttribLocation #define stbglGetUniformLocation glGetUniformLocation #define stbgl_UseProgram glUseProgram #endif // perform a safe strcat of 3 strings, given that we can't rely on portable snprintf // if you need to break on error, this is the best place to place a breakpoint static void stb_glprog_error(char *error, int error_buflen, char *str1, char *str2, char *str3) { int n = strlen(str1); strncpy(error, str1, error_buflen); if (n < error_buflen && str2) { strncpy(error+n, str2, error_buflen - n); n += strlen(str2); if (n < error_buflen && str3) { strncpy(error+n, str3, error_buflen - n); } } error[error_buflen-1] = 0; } STB_GLPROG_DECLARE GLuint stbgl_compile_shader(GLenum type, char const **sources, int num_sources, char *error, int error_buflen) { char *typename = (type == STBGL_VERTEX_SHADER ? "vertex" : "fragment"); int len; GLint result; GLuint shader; // initialize the extensions if we haven't already stb_glprog_init(); // allocate shader = stbglCreateShader(type); if (!shader) { stb_glprog_error(error, error_buflen, "Couldn't allocate shader object in stbgl_compile_shader for ", typename, NULL); return 0; } // compile // if num_sources is negative, assume source is NULL-terminated and count the non-NULL ones if (num_sources < 0) for (num_sources = 0; sources[num_sources] != NULL; ++num_sources) ; stbglShaderSource(shader, num_sources, sources, NULL); stbglCompileShader(shader); stbglGetShaderStatus(shader, &result); if (result) return shader; // errors stb_glprog_error(error, error_buflen, "Compile error for ", typename, " shader: "); len = strlen(error); if (len < error_buflen) stbglGetShaderInfoLog(shader, error_buflen-len, NULL, error+len); stbglDeleteShader(shader); return 0; } STB_GLPROG_DECLARE GLuint stbgl_link_program(GLuint vertex_shader, GLuint fragment_shader, char const **binds, int num_binds, char *error, int error_buflen) { int len; GLint result; // allocate GLuint prog = stbglCreateProgram(); if (!prog) { stb_glprog_error(error, error_buflen, "Couldn't allocate program object in stbgl_link_program", NULL, NULL); return 0; } // attach if (vertex_shader) stbglAttachShader(prog, vertex_shader); if (fragment_shader) stbglAttachShader(prog, fragment_shader); // attribute binds if (binds) { int i; // if num_binds is negative, then it is NULL terminated if (num_binds < 0) for (num_binds=0; binds[num_binds]; ++num_binds) ; for (i=0; i < num_binds; ++i) if (binds[i] && binds[i][0]) // empty binds can be NULL or "" stbglBindAttribLocation(prog, i, binds[i]); } // link stbglLinkProgram(prog); // detach if (vertex_shader) stbglDetachShader(prog, vertex_shader); if (fragment_shader) stbglDetachShader(prog, fragment_shader); // errors stbglGetProgramStatus(prog, &result); if (result) return prog; stb_glprog_error(error, error_buflen, "Link error: ", NULL, NULL); len = strlen(error); if (len < error_buflen) stbglGetProgramInfoLog(prog, error_buflen-len, NULL, error+len); stbglDeleteProgram(prog); return 0; } STB_GLPROG_DECLARE GLuint stbgl_create_program(char const **vertex_source, char const **frag_source, char const **binds, char *error, int error_buflen) { GLuint vertex, fragment, prog=0; vertex = stbgl_compile_shader(STBGL_VERTEX_SHADER, vertex_source, -1, error, error_buflen); if (vertex) { fragment = stbgl_compile_shader(STBGL_FRAGMENT_SHADER, frag_source, -1, error, error_buflen); if (fragment) prog = stbgl_link_program(vertex, fragment, binds, -1, error, error_buflen); if (fragment) stbglDeleteShader(fragment); stbglDeleteShader(vertex); } return prog; } STB_GLPROG_DECLARE void stbgl_delete_shader(GLuint shader) { stbglDeleteShader(shader); } STB_GLPROG_DECLARE void stgbl_delete_program(GLuint program) { stbglDeleteProgram(program); } GLint stbgl_find_uniform(GLuint prog, char *uniform) { return stbglGetUniformLocation(prog, uniform); } STB_GLPROG_DECLARE void stbgl_find_uniforms(GLuint prog, GLint *locations, char const **uniforms, int num_uniforms) { int i; if (num_uniforms < 0) num_uniforms = 999999; for (i=0; i < num_uniforms && uniforms[i]; ++i) locations[i] = stbglGetUniformLocation(prog, uniforms[i]); } STB_GLPROG_DECLARE void stbglUseProgram(GLuint program) { stbgl_UseProgram(program); } #ifdef STB_GLPROG_ARB #define STBGL_ARBIFY(name) name##ARB #else #define STBGL_ARBIFY(name) name #endif STB_GLPROG_DECLARE void stbglVertexAttribPointer(GLuint index, GLint size, GLenum type, GLboolean normalized, GLsizei stride, const GLvoid * pointer) { STBGL_ARBIFY(glVertexAttribPointer)(index, size, type, normalized, stride, pointer); } STB_GLPROG_DECLARE void stbglEnableVertexAttribArray (GLuint index) { STBGL_ARBIFY(glEnableVertexAttribArray )(index); } STB_GLPROG_DECLARE void stbglDisableVertexAttribArray(GLuint index) { STBGL_ARBIFY(glDisableVertexAttribArray)(index); } STB_GLPROG_DECLARE void stbglUniform1fv(GLint loc, GLsizei count, const GLfloat *v) { STBGL_ARBIFY(glUniform1fv)(loc,count,v); } STB_GLPROG_DECLARE void stbglUniform2fv(GLint loc, GLsizei count, const GLfloat *v) { STBGL_ARBIFY(glUniform2fv)(loc,count,v); } STB_GLPROG_DECLARE void stbglUniform3fv(GLint loc, GLsizei count, const GLfloat *v) { STBGL_ARBIFY(glUniform3fv)(loc,count,v); } STB_GLPROG_DECLARE void stbglUniform4fv(GLint loc, GLsizei count, const GLfloat *v) { STBGL_ARBIFY(glUniform4fv)(loc,count,v); } STB_GLPROG_DECLARE void stbglUniform1iv(GLint loc, GLsizei count, const GLint *v) { STBGL_ARBIFY(glUniform1iv)(loc,count,v); } STB_GLPROG_DECLARE void stbglUniform2iv(GLint loc, GLsizei count, const GLint *v) { STBGL_ARBIFY(glUniform2iv)(loc,count,v); } STB_GLPROG_DECLARE void stbglUniform3iv(GLint loc, GLsizei count, const GLint *v) { STBGL_ARBIFY(glUniform3iv)(loc,count,v); } STB_GLPROG_DECLARE void stbglUniform4iv(GLint loc, GLsizei count, const GLint *v) { STBGL_ARBIFY(glUniform4iv)(loc,count,v); } STB_GLPROG_DECLARE void stbglUniform1f(GLint loc, float v0) { STBGL_ARBIFY(glUniform1f)(loc,v0); } STB_GLPROG_DECLARE void stbglUniform2f(GLint loc, float v0, float v1) { STBGL_ARBIFY(glUniform2f)(loc,v0,v1); } STB_GLPROG_DECLARE void stbglUniform3f(GLint loc, float v0, float v1, float v2) { STBGL_ARBIFY(glUniform3f)(loc,v0,v1,v2); } STB_GLPROG_DECLARE void stbglUniform4f(GLint loc, float v0, float v1, float v2, float v3) { STBGL_ARBIFY(glUniform4f)(loc,v0,v1,v2,v3); } STB_GLPROG_DECLARE void stbglUniform1i(GLint loc, GLint v0) { STBGL_ARBIFY(glUniform1i)(loc,v0); } STB_GLPROG_DECLARE void stbglUniform2i(GLint loc, GLint v0, GLint v1) { STBGL_ARBIFY(glUniform2i)(loc,v0,v1); } STB_GLPROG_DECLARE void stbglUniform3i(GLint loc, GLint v0, GLint v1, GLint v2) { STBGL_ARBIFY(glUniform3i)(loc,v0,v1,v2); } STB_GLPROG_DECLARE void stbglUniform4i(GLint loc, GLint v0, GLint v1, GLint v2, GLint v3) { STBGL_ARBIFY(glUniform4i)(loc,v0,v1,v2,v3); } #endif uTox/third_party/stb/stb/tests/caveview/stb_gl.h0000600000175000001440000011233314003056224021007 0ustar rakusers// stbgl - v0.04 - Sean Barrett 2008 - public domain // // Note that the gl extensions support requires glext.h. In fact, it works // if you just concatenate glext.h onto the end of this file. In that case, // this file is covered by the SGI FreeB license, and is not public domain. // // Extension usage: // // 1. Make a file called something like "extlist.txt" which contains stuff like: // GLE(ShaderSourceARB,SHADERSOURCEARB) // GLE(Uniform1iARB,UNIFORM1IARB) // GLARB(ActiveTexture,ACTIVETEXTURE) // same as GLE(ActiveTextureARB,ACTIVETEXTUREARB) // GLARB(ClientActiveTexture,CLIENTACTIVETEXTURE) // GLE(MultiTexCoord2f,MULTITEXCOORD2F) // // 2. To declare functions (to make a header file), do this: // #define STB_GLEXT_DECLARE "extlist.txt" // #include "stb_gl.h" // // A good way to do this is to define STB_GLEXT_DECLARE project-wide. // // 3. To define functions (implement), do this in some C file: // #define STB_GLEXT_DEFINE "extlist.txt" // #include "stb_gl.h" // // If you've already defined STB_GLEXT_DECLARE, you can just do: // #define STB_GLEXT_DEFINE_DECLARE // #include "stb_gl.h" // // 4. Now you need to initialize: // // stbgl_initExtensions(); #ifndef INCLUDE_STB_GL_H #define INCLUDE_STB_GL_H #define STB_GL #ifdef _WIN32 #ifndef WINGDIAPI #define CALLBACK __stdcall #define WINGDIAPI __declspec(dllimport) #define APIENTRY __stdcall #endif #endif //_WIN32 #include #include #include #ifndef M_PI #define M_PI 3.14159265358979323846f #endif #ifdef __cplusplus extern "C" { #endif // like gluPerspective, but: // fov is chosen to satisfy both hfov <= max_hfov & vfov <= max_vfov; // set one to 179 or 0 to ignore it // zoom is applied separately, so you can do linear zoom without // mucking with trig with fov; 1 -> use exact fov // 'aspect' is inferred from the current viewport, and ignores the // possibility of non-square pixels extern void stbgl_Perspective(float zoom, float max_hfov, float max_vfov, float znear, float zfar); extern void stbgl_PerspectiveViewport(int x, int y, int w, int h, float zoom, float max_hfov, float max_vfov, float znear, float zfar); extern void stbgl_initCamera_zup_facing_x(void); extern void stbgl_initCamera_zup_facing_y(void); extern void stbgl_positionCameraWithEulerAngles(float *loc, float *ang); extern void stbgl_drawRect(float x0, float y0, float x1, float y1); extern void stbgl_drawRectTC(float x0, float y0, float x1, float y1, float s0, float t0, float s1, float t1); extern void stbgl_drawBox(float x, float y, float z, float sx, float sy, float sz, int cw); extern int stbgl_hasExtension(char *ext); extern void stbgl_SimpleLight(int index, float bright, float x, float y, float z); extern void stbgl_GlobalAmbient(float r, float g, float b); extern int stbgl_LoadTexture(char *filename, char *props); // only if stb_image is available extern int stbgl_TestTexture(int w); extern int stbgl_TestTextureEx(int w, char *scale_table, int checks_log2, int r1,int g1,int b1, int r2, int b2, int g2); extern unsigned int stbgl_rand(void); // internal, but exposed just in case; LCG, so use middle bits extern int stbgl_TexImage2D(int texid, int w, int h, void *data, char *props); extern int stbgl_TexImage2D_Extra(int texid, int w, int h, void *data, int chan, char *props, int preserve_data); // "props" is a series of characters (and blocks of characters), a la fopen()'s mode, // e.g.: // GLuint texid = stbgl_LoadTexture("myfile.jpg", "mbc") // means: load the image "myfile.jpg", and do the following: // generate mipmaps // use bilinear filtering (not trilinear) // use clamp-to-edge on both channels // // input descriptor: AT MOST ONE // TEXT MEANING // 1 1 channel of input (intensity/alpha) // 2 2 channels of input (luminance, alpha) // 3 3 channels of input (RGB) // 4 4 channels of input (RGBA) // l 1 channel of input (luminance) // a 1 channel of input (alpha) // la 2 channels of input (lum/alpha) // rgb 3 channels of input (RGB) // ycocg 3 channels of input (YCoCg - forces YCoCg output) // ycocgj 4 channels of input (YCoCgJunk - forces YCoCg output) // rgba 4 channels of input (RGBA) // // output descriptor: AT MOST ONE // TEXT MEANING // A 1 channel of output (alpha) // I 1 channel of output (intensity) // LA 2 channels of output (lum/alpha) // RGB 3 channels of output (RGB) // RGBA 4 channels of output (RGBA) // DXT1 encode as a DXT1 texture (RGB unless input has RGBA) // DXT3 encode as a DXT3 texture // DXT5 encode as a DXT5 texture // YCoCg encode as a DXT5 texture with Y in alpha, CoCg in RG // D GL_DEPTH_COMPONENT // NONE no input/output, don't call TexImage2D at all // // when reading from a file or using another interface with an explicit // channel count, the input descriptor is ignored and instead the channel // count is used as the input descriptor. if the file read is a DXT DDS, // then it is passed directly to OpenGL in the file format. // // if an input descriptor is supplied but no output descriptor, the output // is assumed to be the same as the input. if an output descriptor is supplied // but no input descriptor, the input is assumed to be the same as the // output. if neither is supplied, the input is assumed to be 4-channel. // If DXT1 or YCoCG output is requested with no input, the input is assumed // to be 4-channel but the alpha channel is ignored. // // filtering descriptor (default is no mipmaps) // TEXT MEANING // m generate mipmaps // M mipmaps are provided, concatenated at end of data (from largest to smallest) // t use trilinear filtering (default if mipmapped) // b use bilinear filtering (default if not-mipmapped) // n use nearest-neighbor sampling // // wrapping descriptor // TEXT MEANING // w wrap (default) // c clamp-to-edge // C GL_CLAMP (uses border color) // // If only one wrapping descriptor is supplied, it is applied to both channels. // // special: // TEXT MEANING // f input data is floats (default unsigned bytes) // F input&output data is floats (default unsigned bytes) // p explicitly pre-multiply the alpha // P pad to power-of-two (default stretches) // NP2 non-power-of-two // + can overwrite the texture data with temp data // ! free the texture data with "free" // // the properties string can also include spaces #ifdef __cplusplus } #endif #ifdef STB_GL_IMPLEMENTATION #include #include #include #include int stbgl_hasExtension(char *ext) { const char *s = glGetString(GL_EXTENSIONS); for(;;) { char *e = ext; for (;;) { if (*e == 0) { if (*s == 0 || *s == ' ') return 1; break; } if (*s != *e) break; ++s, ++e; } while (*s && *s != ' ') ++s; if (!*s) return 0; ++s; // skip space } } void stbgl_drawRect(float x0, float y0, float x1, float y1) { glBegin(GL_POLYGON); glTexCoord2f(0,0); glVertex2f(x0,y0); glTexCoord2f(1,0); glVertex2f(x1,y0); glTexCoord2f(1,1); glVertex2f(x1,y1); glTexCoord2f(0,1); glVertex2f(x0,y1); glEnd(); } void stbgl_drawRectTC(float x0, float y0, float x1, float y1, float s0, float t0, float s1, float t1) { glBegin(GL_POLYGON); glTexCoord2f(s0,t0); glVertex2f(x0,y0); glTexCoord2f(s1,t0); glVertex2f(x1,y0); glTexCoord2f(s1,t1); glVertex2f(x1,y1); glTexCoord2f(s0,t1); glVertex2f(x0,y1); glEnd(); } void stbgl_drawBox(float x, float y, float z, float sx, float sy, float sz, int cw) { float x0,y0,z0,x1,y1,z1; sx /=2, sy/=2, sz/=2; x0 = x-sx; y0 = y-sy; z0 = z-sz; x1 = x+sx; y1 = y+sy; z1 = z+sz; glBegin(GL_QUADS); if (cw) { glNormal3f(0,0,-1); glTexCoord2f(0,0); glVertex3f(x0,y0,z0); glTexCoord2f(1,0); glVertex3f(x1,y0,z0); glTexCoord2f(1,1); glVertex3f(x1,y1,z0); glTexCoord2f(0,1); glVertex3f(x0,y1,z0); glNormal3f(0,0,1); glTexCoord2f(0,0); glVertex3f(x1,y0,z1); glTexCoord2f(1,0); glVertex3f(x0,y0,z1); glTexCoord2f(1,1); glVertex3f(x0,y1,z1); glTexCoord2f(0,1); glVertex3f(x1,y1,z1); glNormal3f(-1,0,0); glTexCoord2f(0,0); glVertex3f(x0,y1,z1); glTexCoord2f(1,0); glVertex3f(x0,y0,z1); glTexCoord2f(1,1); glVertex3f(x0,y0,z0); glTexCoord2f(0,1); glVertex3f(x0,y1,z0); glNormal3f(1,0,0); glTexCoord2f(0,0); glVertex3f(x1,y0,z1); glTexCoord2f(1,0); glVertex3f(x1,y1,z1); glTexCoord2f(1,1); glVertex3f(x1,y1,z0); glTexCoord2f(0,1); glVertex3f(x1,y0,z0); glNormal3f(0,-1,0); glTexCoord2f(0,0); glVertex3f(x0,y0,z1); glTexCoord2f(1,0); glVertex3f(x1,y0,z1); glTexCoord2f(1,1); glVertex3f(x1,y0,z0); glTexCoord2f(0,1); glVertex3f(x0,y0,z0); glNormal3f(0,1,0); glTexCoord2f(0,0); glVertex3f(x1,y1,z1); glTexCoord2f(1,0); glVertex3f(x0,y1,z1); glTexCoord2f(1,1); glVertex3f(x0,y1,z0); glTexCoord2f(0,1); glVertex3f(x1,y1,z0); } else { glNormal3f(0,0,-1); glTexCoord2f(0,0); glVertex3f(x0,y0,z0); glTexCoord2f(0,1); glVertex3f(x0,y1,z0); glTexCoord2f(1,1); glVertex3f(x1,y1,z0); glTexCoord2f(1,0); glVertex3f(x1,y0,z0); glNormal3f(0,0,1); glTexCoord2f(0,0); glVertex3f(x1,y0,z1); glTexCoord2f(0,1); glVertex3f(x1,y1,z1); glTexCoord2f(1,1); glVertex3f(x0,y1,z1); glTexCoord2f(1,0); glVertex3f(x0,y0,z1); glNormal3f(-1,0,0); glTexCoord2f(0,0); glVertex3f(x0,y1,z1); glTexCoord2f(0,1); glVertex3f(x0,y1,z0); glTexCoord2f(1,1); glVertex3f(x0,y0,z0); glTexCoord2f(1,0); glVertex3f(x0,y0,z1); glNormal3f(1,0,0); glTexCoord2f(0,0); glVertex3f(x1,y0,z1); glTexCoord2f(0,1); glVertex3f(x1,y0,z0); glTexCoord2f(1,1); glVertex3f(x1,y1,z0); glTexCoord2f(1,0); glVertex3f(x1,y1,z1); glNormal3f(0,-1,0); glTexCoord2f(0,0); glVertex3f(x0,y0,z1); glTexCoord2f(0,1); glVertex3f(x0,y0,z0); glTexCoord2f(1,1); glVertex3f(x1,y0,z0); glTexCoord2f(1,0); glVertex3f(x1,y0,z1); glNormal3f(0,1,0); glTexCoord2f(0,0); glVertex3f(x1,y1,z1); glTexCoord2f(0,1); glVertex3f(x1,y1,z0); glTexCoord2f(1,1); glVertex3f(x0,y1,z0); glTexCoord2f(1,0); glVertex3f(x0,y1,z1); } glEnd(); } void stbgl_SimpleLight(int index, float bright, float x, float y, float z) { float d = (float) (1.0f/sqrt(x*x+y*y+z*z)); float dir[4] = { x*d,y*d,z*d,0 }, zero[4] = { 0,0,0,0 }; float c[4] = { bright,bright,bright,0 }; GLuint light = GL_LIGHT0 + index; glLightfv(light, GL_POSITION, dir); glLightfv(light, GL_DIFFUSE, c); glLightfv(light, GL_AMBIENT, zero); glLightfv(light, GL_SPECULAR, zero); glEnable(light); glColorMaterial(GL_FRONT, GL_AMBIENT_AND_DIFFUSE); glEnable(GL_COLOR_MATERIAL); } void stbgl_GlobalAmbient(float r, float g, float b) { float v[4] = { r,g,b,0 }; glLightModelfv(GL_LIGHT_MODEL_AMBIENT, v); } #define stbgl_rad2deg(r) ((r)*180.0f / M_PI) #define stbgl_deg2rad(r) ((r)/180.0f * M_PI) void stbgl_Perspective(float zoom, float max_hfov, float max_vfov, float znear, float zfar) { float unit_width, unit_height, aspect, vfov; int data[4],w,h; glGetIntegerv(GL_VIEWPORT, data); w = data[2]; h = data[3]; aspect = (float) w / h; if (max_hfov <= 0) max_hfov = 179; if (max_vfov <= 0) max_vfov = 179; // convert max_hfov, max_vfov to worldspace width at depth=1 unit_width = (float) tan(stbgl_deg2rad(max_hfov/2)) * 2; unit_height = (float) tan(stbgl_deg2rad(max_vfov/2)) * 2; // check if hfov = max_hfov is enough to satisfy it if (unit_width <= aspect * unit_height) { float height = unit_width / aspect; vfov = (float) atan(( height/2) / zoom); } else { vfov = (float) atan((unit_height/2) / zoom); } vfov = (float) stbgl_rad2deg(vfov * 2); gluPerspective(vfov, aspect, znear, zfar); } void stbgl_PerspectiveViewport(int x, int y, int w, int h, float zoom, float min_hfov, float min_vfov, float znear, float zfar) { if (znear <= 0.0001f) znear = 0.0001f; glViewport(x,y,w,h); glScissor(x,y,w,h); glMatrixMode(GL_PROJECTION); glLoadIdentity(); stbgl_Perspective(zoom, min_hfov, min_vfov, znear, zfar); glMatrixMode(GL_MODELVIEW); } // point the camera along the positive X axis, Z-up void stbgl_initCamera_zup_facing_x(void) { glRotatef(-90, 1,0,0); glRotatef( 90, 0,0,1); } // point the camera along the positive Y axis, Z-up void stbgl_initCamera_zup_facing_y(void) { glRotatef(-90, 1,0,0); } // setup a camera using Euler angles void stbgl_positionCameraWithEulerAngles(float *loc, float *ang) { glRotatef(-ang[1], 0,1,0); glRotatef(-ang[0], 1,0,0); glRotatef(-ang[2], 0,0,1); glTranslatef(-loc[0], -loc[1], -loc[2]); } static int stbgl_m(char *a, char *b) { // skip first character do { ++a,++b; } while (*b && *a == *b); return *b == 0; } #ifdef STBI_VERSION #ifndef STBI_NO_STDIO int stbgl_LoadTexture(char *filename, char *props) { // @TODO: handle DDS files directly int res; void *data; int w,h,c; #ifndef STBI_NO_HDR if (stbi_is_hdr(filename)) { data = stbi_loadf(filename, &w, &h, &c, 0); if (!data) return 0; res = stbgl_TexImage2D_Extra(0, w,h,data, -c, props, 0); free(data); return res; } #endif data = stbi_load(filename, &w, &h, &c, 0); if (!data) return 0; res = stbgl_TexImage2D_Extra(0, w,h,data, c, props, 0); free(data); return res; } #endif #endif // STBI_VERSION int stbgl_TexImage2D(int texid, int w, int h, void *data, char *props) { return stbgl_TexImage2D_Extra(texid, w, h, data, 0, props,1); } int stbgl_TestTexture(int w) { char scale_table[] = { 10,20,30,30,35,40,5,18,25,13,7,5,3,3,2,2,2,2,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0 }; return stbgl_TestTextureEx(w, scale_table, 2, 140,130,200, 180,200,170); } unsigned int stbgl_rand(void) { static unsigned int stbgl__rand_seed = 3248980923; // random typing return stbgl__rand_seed = stbgl__rand_seed * 2147001325 + 715136305; // BCPL generator } // wish this could be smaller, since it's so frivolous int stbgl_TestTextureEx(int w, char *scale_table, int checks_log2, int r1,int g1,int b1, int r2, int b2, int g2) { int rt[2] = {r1,r2}, gt[2] = {g1,g2}, bt[2] = {b1,b2}; signed char modded[256]; int i,j, m = w-1, s,k,scale; unsigned char *data = (unsigned char *) malloc(w*w*3); assert((m & w) == 0); data[0] = 128; for (s=0; s < 16; ++s) if ((1 << s) == w) break; assert(w == (1 << s)); // plasma fractal noise for (k=s-1; k >= 0; --k) { int step = 1 << k; // interpolate from "parents" for (j=0; j < w; j += step*2) { for (i=0; i < w; i += step*2) { int i1 = i+step, j1=j+step; int i2 = (i+step*2)&m, j2 = (j+step*2)&m; int p00 = data[(j*w+i )*3], p01 = data[(j2*w+i )*3]; int p10 = data[(j*w+i2)*3], p11 = data[(j2*w+i2)*3]; data[(j*w+i1)*3] = (p00+p10)>>1; data[(j1*w+i)*3] = (p00+p01)>>1; data[(j1*w+i1)*3]= (p00+p01+p10+p11)>>2; } } scale = scale_table[s-k+1]; if (!scale) continue; // just interpolate down the remaining data for (j=0,i=0; i < 256; i += 2, j == scale ? j=0 : ++j) modded[i] = j, modded[i+1] = -j; // precompute i%scale (plus sign) for (j=0; j < w; j += step) for (i=0; i < w; i += step) { int x = data[(j*w+i)*3] + modded[(stbgl_rand() >> 12) & 255]; data[(j*w+i)*3] = x < 0 ? 0 : x > 255 ? 255 : x; } } for (j=0; j < w; ++j) for (i=0; i < w; ++i) { int check = ((i^j) & (1 << (s-checks_log2))) == 0; int v = data[(j*w+i)*3] >> 2; data[(j*w+i)*3+0] = rt[check]-v; data[(j*w+i)*3+1] = gt[check]-v; data[(j*w+i)*3+2] = bt[check]-v; } return stbgl_TexImage2D(0, w, w, data, "3m!"); // 3 channels, mipmap, free } #ifdef _WIN32 #ifndef WINGDIAPI typedef int (__stdcall *stbgl__voidfunc)(void); __declspec(dllimport) stbgl__voidfunc wglGetProcAddress(char *); #endif #define STB__HAS_WGLPROC static void (__stdcall *stbgl__CompressedTexImage2DARB)(int target, int level, int internalformat, int width, int height, int border, int imageSize, void *data); static void stbgl__initCompTex(void) { *((void **) &stbgl__CompressedTexImage2DARB) = (void *) wglGetProcAddress("glCompressedTexImage2DARB"); } #else static void (*stbgl__CompressedTexImage2DARB)(int target, int level, int internalformat, int width, int height, int border, int imageSize, void *data); static void stbgl__initCompTex(void) { } #endif // _WIN32 #define STBGL_COMPRESSED_RGB_S3TC_DXT1 0x83F0 #define STBGL_COMPRESSED_RGBA_S3TC_DXT1 0x83F1 #define STBGL_COMPRESSED_RGBA_S3TC_DXT3 0x83F2 #define STBGL_COMPRESSED_RGBA_S3TC_DXT5 0x83F3 #ifdef STB_COMPRESS_DXT_BLOCK static void stbgl__convert(uint8 *p, uint8 *q, int n, int input_desc, uint8 *end) { int i; switch (input_desc) { case GL_RED: case GL_LUMINANCE: for (i=0; i < n; ++i,p+=4) p[0] = p[1] = p[2] = q[0], p[3]=255, q+=1; break; case GL_ALPHA: for (i=0; i < n; ++i,p+=4) p[0] = p[1] = p[2] = 0, p[3] = q[0], q+=1; break; case GL_LUMINANCE_ALPHA: for (i=0; i < n; ++i,p+=4) p[0] = p[1] = p[2] = q[0], p[3]=q[1], q+=2; break; case GL_RGB: for (i=0; i < n; ++i,p+=4) p[0]=q[0],p[1]=q[1],p[2]=q[2],p[3]=255,q+=3; break; case GL_RGBA: memcpy(p, q, n*4); break; case GL_INTENSITY: for (i=0; i < n; ++i,p+=4) p[0] = p[1] = p[2] = p[3] = q[0], q+=1; break; } assert(p <= end); } static void stbgl__compress(uint8 *p, uint8 *rgba, int w, int h, int output_desc, uint8 *end) { int i,j,y,y2; int alpha = (output_desc == STBGL_COMPRESSED_RGBA_S3TC_DXT5); for (j=0; j < w; j += 4) { int x=4; for (i=0; i < h; i += 4) { uint8 block[16*4]; if (i+3 >= w) x = w-i; for (y=0; y < 4; ++y) { if (j+y >= h) break; memcpy(block+y*16, rgba + w*4*(j+y) + i*4, x*4); } if (x < 4) { switch (x) { case 0: assert(0); case 1: for (y2=0; y2 < y; ++y2) { memcpy(block+y2*16+1*4, block+y2*16+0*4, 4); memcpy(block+y2*16+2*4, block+y2*16+0*4, 8); } break; case 2: for (y2=0; y2 < y; ++y2) memcpy(block+y2*16+2*4, block+y2*16+0*4, 8); break; case 3: for (y2=0; y2 < y; ++y2) memcpy(block+y2*16+3*4, block+y2*16+1*4, 4); break; } } y2 = 0; for(; y<4; ++y,++y2) memcpy(block+y*16, block+y2*16, 4*4); stb_compress_dxt_block(p, block, alpha, 10); p += alpha ? 16 : 8; } } assert(p <= end); } #endif // STB_COMPRESS_DXT_BLOCK // use the reserved temporary-use enumerant range, since no // OpenGL enumerants should fall in that range enum { STBGL_UNDEFINED = 0x6000, STBGL_YCOCG, STBGL_YCOCGJ, STBGL_GEN_MIPMAPS, STBGL_MIPMAPS, STBGL_NO_DOWNLOAD, }; #define STBGL_CLAMP_TO_EDGE 0x812F #define STBGL_CLAMP_TO_BORDER 0x812D #define STBGL_DEPTH_COMPONENT16 0x81A5 #define STBGL_DEPTH_COMPONENT24 0x81A6 #define STBGL_DEPTH_COMPONENT32 0x81A7 int stbgl_TexImage2D_Extra(int texid, int w, int h, void *data, int chan, char *props, int preserve_data) { static int has_s3tc = -1; // haven't checked yet int free_data = 0, is_compressed = 0; int pad_to_power_of_two = 0, non_power_of_two = 0; int premultiply_alpha = 0; // @TODO int float_tex = 0; // @TODO int input_type = GL_UNSIGNED_BYTE; int input_desc = STBGL_UNDEFINED; int output_desc = STBGL_UNDEFINED; int mipmaps = STBGL_UNDEFINED; int filter = STBGL_UNDEFINED, mag_filter; int wrap_s = STBGL_UNDEFINED, wrap_t = STBGL_UNDEFINED; // parse out the properties if (props == NULL) props = ""; while (*props) { switch (*props) { case '1' : input_desc = GL_LUMINANCE; break; case '2' : input_desc = GL_LUMINANCE_ALPHA; break; case '3' : input_desc = GL_RGB; break; case '4' : input_desc = GL_RGBA; break; case 'l' : if (props[1] == 'a') { input_desc = GL_LUMINANCE_ALPHA; ++props; } else input_desc = GL_LUMINANCE; break; case 'a' : input_desc = GL_ALPHA; break; case 'r' : if (stbgl_m(props, "rgba")) { input_desc = GL_RGBA; props += 3; break; } if (stbgl_m(props, "rgb")) { input_desc = GL_RGB; props += 2; break; } input_desc = GL_RED; break; case 'y' : if (stbgl_m(props, "ycocg")) { if (props[5] == 'j') { props += 5; input_desc = STBGL_YCOCGJ; } else { props += 4; input_desc = STBGL_YCOCG; } break; } return 0; case 'L' : if (props[1] == 'A') { output_desc = GL_LUMINANCE_ALPHA; ++props; } else output_desc = GL_LUMINANCE; break; case 'I' : output_desc = GL_INTENSITY; break; case 'A' : output_desc = GL_ALPHA; break; case 'R' : if (stbgl_m(props, "RGBA")) { output_desc = GL_RGBA; props += 3; break; } if (stbgl_m(props, "RGB")) { output_desc = GL_RGB; props += 2; break; } output_desc = GL_RED; break; case 'Y' : if (stbgl_m(props, "YCoCg") || stbgl_m(props, "YCOCG")) { props += 4; output_desc = STBGL_YCOCG; break; } return 0; case 'D' : if (stbgl_m(props, "DXT")) { switch (props[3]) { case '1': output_desc = STBGL_COMPRESSED_RGB_S3TC_DXT1; break; case '3': output_desc = STBGL_COMPRESSED_RGBA_S3TC_DXT3; break; case '5': output_desc = STBGL_COMPRESSED_RGBA_S3TC_DXT5; break; default: return 0; } props += 3; } else if (stbgl_m(props, "D16")) { output_desc = STBGL_DEPTH_COMPONENT16; input_desc = GL_DEPTH_COMPONENT; props += 2; } else if (stbgl_m(props, "D24")) { output_desc = STBGL_DEPTH_COMPONENT24; input_desc = GL_DEPTH_COMPONENT; props += 2; } else if (stbgl_m(props, "D32")) { output_desc = STBGL_DEPTH_COMPONENT32; input_desc = GL_DEPTH_COMPONENT; props += 2; } else { output_desc = GL_DEPTH_COMPONENT; input_desc = GL_DEPTH_COMPONENT; } break; case 'N' : if (stbgl_m(props, "NONE")) { props += 3; input_desc = STBGL_NO_DOWNLOAD; output_desc = STBGL_NO_DOWNLOAD; break; } if (stbgl_m(props, "NP2")) { non_power_of_two = 1; props += 2; break; } return 0; case 'm' : mipmaps = STBGL_GEN_MIPMAPS; break; case 'M' : mipmaps = STBGL_MIPMAPS; break; case 't' : filter = GL_LINEAR_MIPMAP_LINEAR; break; case 'b' : filter = GL_LINEAR; break; case 'n' : filter = GL_NEAREST; break; case 'w' : if (wrap_s == STBGL_UNDEFINED) wrap_s = GL_REPEAT; else wrap_t = GL_REPEAT; break; case 'C' : if (wrap_s == STBGL_UNDEFINED) wrap_s = STBGL_CLAMP_TO_BORDER; else wrap_t = STBGL_CLAMP_TO_BORDER; break; case 'c' : if (wrap_s == STBGL_UNDEFINED) wrap_s = STBGL_CLAMP_TO_EDGE; else wrap_t = STBGL_CLAMP_TO_EDGE; break; case 'f' : input_type = GL_FLOAT; break; case 'F' : input_type = GL_FLOAT; float_tex = 1; break; case 'p' : premultiply_alpha = 1; break; case 'P' : pad_to_power_of_two = 1; break; case '+' : preserve_data = 0; break; case '!' : preserve_data = 0; free_data = 1; break; case ' ' : break; case '-' : break; default : if (free_data) free(data); return 0; } ++props; } // override input_desc based on channel count if (output_desc != STBGL_NO_DOWNLOAD) { switch (abs(chan)) { case 1: input_desc = GL_LUMINANCE; break; case 2: input_desc = GL_LUMINANCE_ALPHA; break; case 3: input_desc = GL_RGB; break; case 4: input_desc = GL_RGBA; break; case 0: break; default: return 0; } } // override input_desc based on channel info if (chan > 0) { input_type = GL_UNSIGNED_BYTE; } if (chan < 0) { input_type = GL_FLOAT; } if (output_desc == GL_ALPHA) { if (input_desc == GL_LUMINANCE) input_desc = GL_ALPHA; if (input_desc == GL_RGB) { // force a presumably-mono image to alpha // @TODO handle 'preserve_data' case? if (data && !preserve_data && input_type == GL_UNSIGNED_BYTE) { int i; unsigned char *p = (unsigned char *) data, *q = p; for (i=0; i < w*h; ++i) { *q = (p[0] + 2*p[1] + p[2]) >> 2; p += 3; q += 1; } input_desc = GL_ALPHA; } } } // set undefined input/output based on the other if (input_desc == STBGL_UNDEFINED && output_desc == STBGL_UNDEFINED) { input_desc = output_desc = GL_RGBA; } else if (output_desc == STBGL_UNDEFINED) { switch (input_desc) { case GL_LUMINANCE: case GL_ALPHA: case GL_LUMINANCE_ALPHA: case GL_RGB: case GL_RGBA: output_desc = input_desc; break; case GL_RED: output_desc = GL_INTENSITY; break; case STBGL_YCOCG: case STBGL_YCOCGJ: output_desc = STBGL_YCOCG; break; default: assert(0); return 0; } } else if (input_desc == STBGL_UNDEFINED) { switch (output_desc) { case GL_LUMINANCE: case GL_ALPHA: case GL_LUMINANCE_ALPHA: case GL_RGB: case GL_RGBA: input_desc = output_desc; break; case GL_INTENSITY: input_desc = GL_RED; break; case STBGL_YCOCG: case STBGL_COMPRESSED_RGB_S3TC_DXT1: case STBGL_COMPRESSED_RGBA_S3TC_DXT3: case STBGL_COMPRESSED_RGBA_S3TC_DXT5: input_desc = GL_RGBA; break; } } else { if (output_desc == STBGL_COMPRESSED_RGB_S3TC_DXT1) { // if input has alpha, force output alpha switch (input_desc) { case GL_ALPHA: case GL_LUMINANCE_ALPHA: case GL_RGBA: output_desc = STBGL_COMPRESSED_RGBA_S3TC_DXT5; break; } } } switch(input_desc) { case GL_LUMINANCE: case GL_RED: case GL_ALPHA: chan = 1; break; case GL_LUMINANCE_ALPHA: chan = 2; break; case GL_RGB: chan = 3; break; case GL_RGBA: chan = 4; break; } if (pad_to_power_of_two && ((w & (w-1)) || (h & (h-1)))) { if (output_desc != STBGL_NO_DOWNLOAD && input_type == GL_UNSIGNED_BYTE && chan > 0) { unsigned char *new_data; int w2 = w, h2 = h, j; while (w & (w-1)) w = (w | (w>>1))+1; while (h & (h-1)) h = (h | (h>>1))+1; new_data = malloc(w * h * chan); for (j=0; j < h2; ++j) { memcpy(new_data + j * w * chan, (char *) data+j*w2*chan, w2*chan); memset(new_data + (j * w+w2) * chan, 0, (w-w2)*chan); } for (; j < h; ++j) memset(new_data + j*w*chan, 0, w*chan); if (free_data) free(data); data = new_data; free_data = 1; } } switch (output_desc) { case STBGL_COMPRESSED_RGB_S3TC_DXT1: case STBGL_COMPRESSED_RGBA_S3TC_DXT1: case STBGL_COMPRESSED_RGBA_S3TC_DXT3: case STBGL_COMPRESSED_RGBA_S3TC_DXT5: is_compressed = 1; if (has_s3tc == -1) { has_s3tc = stbgl_hasExtension("GL_EXT_texture_compression_s3tc"); if (has_s3tc) stbgl__initCompTex(); } if (!has_s3tc) { is_compressed = 0; if (output_desc == STBGL_COMPRESSED_RGB_S3TC_DXT1) output_desc = GL_RGB; else output_desc = GL_RGBA; } } if (output_desc == STBGL_YCOCG) { assert(0); output_desc = GL_RGB; // @TODO! if (free_data) free(data); return 0; } mag_filter = 0; if (mipmaps != STBGL_UNDEFINED) { switch (filter) { case STBGL_UNDEFINED: filter = GL_LINEAR_MIPMAP_LINEAR; break; case GL_NEAREST : mag_filter = GL_NEAREST; filter = GL_LINEAR_MIPMAP_LINEAR; break; case GL_LINEAR : filter = GL_LINEAR_MIPMAP_NEAREST; break; } } else { if (filter == STBGL_UNDEFINED) filter = GL_LINEAR; } // update filtering if (!mag_filter) { if (filter == GL_NEAREST) mag_filter = GL_NEAREST; else mag_filter = GL_LINEAR; } // update wrap/clamp if (wrap_s == STBGL_UNDEFINED) wrap_s = GL_REPEAT; if (wrap_t == STBGL_UNDEFINED) wrap_t = wrap_s; // if no texture id, generate one if (texid == 0) { GLuint tex; glGenTextures(1, &tex); if (tex == 0) { if (free_data) free(data); return 0; } texid = tex; } if (data == NULL && mipmaps == STBGL_GEN_MIPMAPS) mipmaps = STBGL_MIPMAPS; if (output_desc == STBGL_NO_DOWNLOAD) mipmaps = STBGL_NO_DOWNLOAD; glBindTexture(GL_TEXTURE_2D, texid); #ifdef STB_COMPRESS_DXT_BLOCK if (!is_compressed || !stbgl__CompressedTexImage2DARB || output_desc == STBGL_COMPRESSED_RGBA_S3TC_DXT3 || data == NULL) #endif { switch (mipmaps) { case STBGL_NO_DOWNLOAD: break; case STBGL_UNDEFINED: // check if actually power-of-two if (non_power_of_two || ((w & (w-1)) == 0 && (h & (h-1)) == 0)) glTexImage2D(GL_TEXTURE_2D, 0, output_desc, w, h, 0, input_desc, input_type, data); else gluBuild2DMipmaps(GL_TEXTURE_2D, output_desc, w, h, input_desc, input_type, data); // not power of two, so use glu to resize (generates mipmaps needlessly) break; case STBGL_MIPMAPS: { int level = 0; int size = input_type == GL_FLOAT ? sizeof(float) : 1; if (data == NULL) size = 0; // reuse same block of memory for all mipmaps assert((w & (w-1)) == 0 && (h & (h-1)) == 0); // verify power-of-two while (w > 1 && h > 1) { glTexImage2D(GL_TEXTURE_2D, level, output_desc, w, h, 0, input_desc, input_type, data); data = (void *) ((char *) data + w * h * size * chan); if (w > 1) w >>= 1; if (h > 1) h >>= 1; ++level; } break; } case STBGL_GEN_MIPMAPS: gluBuild2DMipmaps(GL_TEXTURE_2D, output_desc, w, h, input_desc, input_type, data); break; default: assert(0); if (free_data) free(data); return 0; } #ifdef STB_COMPRESS_DXT_BLOCK } else { uint8 *out, *rgba=0, *end_out, *end_rgba; int level = 0, alpha = (output_desc != STBGL_COMPRESSED_RGB_S3TC_DXT1); int size = input_type == GL_FLOAT ? sizeof(float) : 1; int osize = alpha ? 16 : 8; if (!free_data && mipmaps == STBGL_GEN_MIPMAPS) { uint8 *temp = malloc(w*h*chan); if (!temp) { if (free_data) free(data); return 0; } memcpy(temp, data, w*h*chan); if (free_data) free(data); free_data = 1; data = temp; } if (chan != 4 || size != 1) { rgba = malloc(w*h*4); if (!rgba) return 0; end_rgba = rgba+w*h*4; } out = malloc((w+3)*(h+3)/16*osize); // enough storage for the s3tc data if (!out) return 0; end_out = out + ((w+3)*(h+3))/16*osize; for(;;) { if (chan != 4) stbgl__convert(rgba, data, w*h, input_desc, end_rgba); stbgl__compress(out, rgba ? rgba : data, w, h, output_desc, end_out); stbgl__CompressedTexImage2DARB(GL_TEXTURE_2D, level, output_desc, w, h, 0, ((w+3)&~3)*((h+3)&~3)/16*osize, out); //glTexImage2D(GL_TEXTURE_2D, level, alpha?GL_RGBA:GL_RGB, w, h, 0, GL_RGBA, GL_UNSIGNED_BYTE, rgba ? rgba : data); if (mipmaps == STBGL_UNDEFINED) break; if (w <= 1 && h <= 1) break; if (mipmaps == STBGL_MIPMAPS) data = (void *) ((char *) data + w * h * size * chan); if (mipmaps == STBGL_GEN_MIPMAPS) { int w2 = w>>1, h2=h>>1, i,j,k, s=w*chan; uint8 *p = data, *q=data; if (w == 1) { for (j=0; j < h2; ++j) { for (k=0; k < chan; ++k) *p++ = (q[k] + q[s+k] + 1) >> 1; q += s*2; } } else if (h == 1) { for (i=0; i < w2; ++i) { for (k=0; k < chan; ++k) *p++ = (q[k] + q[k+chan] + 1) >> 1; q += chan*2; } } else { for (j=0; j < h2; ++j) { for (i=0; i < w2; ++i) { for (k=0; k < chan; ++k) *p++ = (q[k] + q[k+chan] + q[s+k] + q[s+k+chan] + 2) >> 2; q += chan*2; } q += s; } } } if (w > 1) w >>= 1; if (h > 1) h >>= 1; ++level; } if (out) free(out); if (rgba) free(rgba); #endif // STB_COMPRESS_DXT_BLOCK } glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, wrap_s); glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, wrap_t); glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, mag_filter); glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, filter); if (free_data) free(data); return texid; } #endif // STB_DEFINE #undef STB_EXTERN #endif //INCLUDE_STB_GL_H // Extension handling... must be outside the INCLUDE_ brackets #if defined(STB_GLEXT_DEFINE) || defined(STB_GLEXT_DECLARE) #ifndef STB_GLEXT_SKIP_DURING_RECURSION #ifndef GL_GLEXT_VERSION // First check if glext.h is concatenated on the end of this file // (if it's concatenated on the beginning, we'll have GL_GLEXT_VERSION) #define STB_GLEXT_SKIP_DURING_RECURSION #include __FILE__ #undef STB_GLEXT_SKIP_DURING_RECURSION // now check if it's still undefined; if so, try going for it by name; // if this errors, that's fine, since we can't compile without it #ifndef GL_GLEXT_VERSION #include "glext.h" #endif #endif #define GLARB(a,b) GLE(a##ARB,b##ARB) #define GLEXT(a,b) GLE(a##EXT,b##EXT) #define GLNV(a,b) GLE(a##NV ,b##NV) #define GLATI(a,b) GLE(a##ATI,b##ATI) #define GLCORE(a,b) GLE(a,b) #ifdef STB_GLEXT_DEFINE_DECLARE #define STB_GLEXT_DEFINE STB_GLEXT_DECLARE #endif #if defined(STB_GLEXT_DECLARE) && defined(STB_GLEXT_DEFINE) #undef STB_GLEXT_DECLARE #endif #if defined(STB_GLEXT_DECLARE) && !defined(STB_GLEXT_DEFINE) #define GLE(a,b) extern PFNGL##b##PROC gl##a; #ifdef __cplusplus extern "C" { #endif extern void stbgl_initExtensions(void); #include STB_GLEXT_DECLARE #ifdef __cplusplus }; #endif #else #ifndef STB_GLEXT_DEFINE #error "Header file is screwed up somehow" #endif #ifdef _WIN32 #ifndef WINGDIAPI #ifndef STB__HAS_WGLPROC typedef int (__stdcall *stbgl__voidfunc)(void); __declspec(dllimport) stbgl__voidfunc wglGetProcAddress(char *); #endif #endif #define STBGL__GET_FUNC(x) wglGetProcAddress(x) #endif #ifdef GLE #undef GLE #endif #define GLE(a,b) PFNGL##b##PROC gl##a; #include STB_GLEXT_DEFINE #undef GLE #define GLE(a,b) gl##a = (PFNGL##b##PROC) STBGL__GET_FUNC("gl" #a ); void stbgl_initExtensions(void) { #include STB_GLEXT_DEFINE } #undef GLE #endif // STB_GLEXT_DECLARE #endif // STB_GLEXT_SKIP #endif // STB_GLEXT_DEFINE || STB_GLEXT_DECLARE uTox/third_party/stb/stb/tests/caveview/main.c0000600000175000001440000000000014003056224020437 0ustar rakusersuTox/third_party/stb/stb/tests/caveview/glext_list.h0000600000175000001440000000225214003056224021711 0ustar rakusersGLARB(ActiveTexture,ACTIVETEXTURE) GLARB(ClientActiveTexture,CLIENTACTIVETEXTURE) GLARB(MultiTexCoord2f,MULTITEXCOORD2F) GLEXT(TexImage3D,TEXIMAGE3D) GLEXT(TexSubImage3D,TEXSUBIMAGE3D) GLEXT(GenerateMipmap,GENERATEMIPMAP) GLARB(DebugMessageCallback,DEBUGMESSAGECALLBACK) GLCORE(VertexAttribIPointer,VERTEXATTRIBIPOINTER) GLEXT(BindFramebuffer,BINDFRAMEBUFFER) GLEXT(DeleteFramebuffers,DELETEFRAMEBUFFERS) GLEXT(GenFramebuffers,GENFRAMEBUFFERS) GLEXT(CheckFramebufferStatus,CHECKFRAMEBUFFERSTATUS) GLEXT(FramebufferTexture2D,FRAMEBUFFERTEXTURE2D) GLEXT(BindRenderBuffer,BINDRENDERBUFFER) GLEXT(RenderbufferStorage,RENDERBUFFERSTORAGE) GLEXT(GenRenderbuffers,GENRENDERBUFFERS) GLEXT(BindRenderbuffer,BINDRENDERBUFFER) GLEXT(FramebufferRenderbuffer,FRAMEBUFFERRENDERBUFFER) GLEXT(GenerateMipmap,GENERATEMIPMAP) GLARB(BindBuffer ,BINDBUFFER,) GLARB(GenBuffers ,GENBUFFERS ) GLARB(DeleteBuffers,DELETEBUFFERS) GLARB(BufferData ,BUFFERDATA ) GLARB(BufferSubData,BUFFERSUBDATA) GLARB(MapBuffer ,MAPBUFFER ) GLARB(UnmapBuffer ,UNMAPBUFFER ) GLARB(TexBuffer ,TEXBUFFER ) GLEXT(NamedBufferStorage,NAMEDBUFFERSTORAGE) GLE(BufferStorage,BUFFERSTORAGE) GLE(GetStringi,GETSTRINGI)uTox/third_party/stb/stb/tests/caveview/glext.h0000600000175000001440000262130314003056224020664 0ustar rakusers#ifndef __glext_h_ #define __glext_h_ 1 #ifdef __cplusplus extern "C" { #endif /* ** Copyright (c) 2013 The Khronos Group Inc. ** ** Permission is hereby granted, free of charge, to any person obtaining a ** copy of this software and/or associated documentation files (the ** "Materials"), to deal in the Materials without restriction, including ** without limitation the rights to use, copy, modify, merge, publish, ** distribute, sublicense, and/or sell copies of the Materials, and to ** permit persons to whom the Materials are 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 Materials. ** ** THE MATERIALS ARE 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 ** MATERIALS OR THE USE OR OTHER DEALINGS IN THE MATERIALS. */ /* ** This header is generated from the Khronos OpenGL / OpenGL ES XML ** API Registry. The current version of the Registry, generator scripts ** used to make the header, and the header can be found at ** http://www.opengl.org/registry/ ** ** Khronos $Revision: 24756 $ on $Date: 2014-01-14 03:42:29 -0800 (Tue, 14 Jan 2014) $ */ #if defined(_WIN32) && !defined(APIENTRY) && !defined(__CYGWIN__) && !defined(__SCITECH_SNAP__) #ifndef WIN32_LEAN_AND_MEAN #define WIN32_LEAN_AND_MEAN 1 #endif #include #endif #ifndef APIENTRY #define APIENTRY #endif #ifndef APIENTRYP #define APIENTRYP APIENTRY * #endif #ifndef GLAPI #define GLAPI extern #endif #define GL_GLEXT_VERSION 20140114 /* Generated C header for: * API: gl * Profile: compatibility * Versions considered: .* * Versions emitted: 1\.[2-9]|[234]\.[0-9] * Default extensions included: gl * Additional extensions included: _nomatch_^ * Extensions removed: _nomatch_^ */ #ifndef GL_VERSION_1_2 #define GL_VERSION_1_2 1 #define GL_UNSIGNED_BYTE_3_3_2 0x8032 #define GL_UNSIGNED_SHORT_4_4_4_4 0x8033 #define GL_UNSIGNED_SHORT_5_5_5_1 0x8034 #define GL_UNSIGNED_INT_8_8_8_8 0x8035 #define GL_UNSIGNED_INT_10_10_10_2 0x8036 #define GL_TEXTURE_BINDING_3D 0x806A #define GL_PACK_SKIP_IMAGES 0x806B #define GL_PACK_IMAGE_HEIGHT 0x806C #define GL_UNPACK_SKIP_IMAGES 0x806D #define GL_UNPACK_IMAGE_HEIGHT 0x806E #define GL_TEXTURE_3D 0x806F #define GL_PROXY_TEXTURE_3D 0x8070 #define GL_TEXTURE_DEPTH 0x8071 #define GL_TEXTURE_WRAP_R 0x8072 #define GL_MAX_3D_TEXTURE_SIZE 0x8073 #define GL_UNSIGNED_BYTE_2_3_3_REV 0x8362 #define GL_UNSIGNED_SHORT_5_6_5 0x8363 #define GL_UNSIGNED_SHORT_5_6_5_REV 0x8364 #define GL_UNSIGNED_SHORT_4_4_4_4_REV 0x8365 #define GL_UNSIGNED_SHORT_1_5_5_5_REV 0x8366 #define GL_UNSIGNED_INT_8_8_8_8_REV 0x8367 #define GL_UNSIGNED_INT_2_10_10_10_REV 0x8368 #define GL_BGR 0x80E0 #define GL_BGRA 0x80E1 #define GL_MAX_ELEMENTS_VERTICES 0x80E8 #define GL_MAX_ELEMENTS_INDICES 0x80E9 #define GL_CLAMP_TO_EDGE 0x812F #define GL_TEXTURE_MIN_LOD 0x813A #define GL_TEXTURE_MAX_LOD 0x813B #define GL_TEXTURE_BASE_LEVEL 0x813C #define GL_TEXTURE_MAX_LEVEL 0x813D #define GL_SMOOTH_POINT_SIZE_RANGE 0x0B12 #define GL_SMOOTH_POINT_SIZE_GRANULARITY 0x0B13 #define GL_SMOOTH_LINE_WIDTH_RANGE 0x0B22 #define GL_SMOOTH_LINE_WIDTH_GRANULARITY 0x0B23 #define GL_ALIASED_LINE_WIDTH_RANGE 0x846E #define GL_RESCALE_NORMAL 0x803A #define GL_LIGHT_MODEL_COLOR_CONTROL 0x81F8 #define GL_SINGLE_COLOR 0x81F9 #define GL_SEPARATE_SPECULAR_COLOR 0x81FA #define GL_ALIASED_POINT_SIZE_RANGE 0x846D typedef void (APIENTRYP PFNGLDRAWRANGEELEMENTSPROC) (GLenum mode, GLuint start, GLuint end, GLsizei count, GLenum type, const void *indices); typedef void (APIENTRYP PFNGLTEXIMAGE3DPROC) (GLenum target, GLint level, GLint internalformat, GLsizei width, GLsizei height, GLsizei depth, GLint border, GLenum format, GLenum type, const void *pixels); typedef void (APIENTRYP PFNGLTEXSUBIMAGE3DPROC) (GLenum target, GLint level, GLint xoffset, GLint yoffset, GLint zoffset, GLsizei width, GLsizei height, GLsizei depth, GLenum format, GLenum type, const void *pixels); typedef void (APIENTRYP PFNGLCOPYTEXSUBIMAGE3DPROC) (GLenum target, GLint level, GLint xoffset, GLint yoffset, GLint zoffset, GLint x, GLint y, GLsizei width, GLsizei height); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glDrawRangeElements (GLenum mode, GLuint start, GLuint end, GLsizei count, GLenum type, const void *indices); GLAPI void APIENTRY glTexImage3D (GLenum target, GLint level, GLint internalformat, GLsizei width, GLsizei height, GLsizei depth, GLint border, GLenum format, GLenum type, const void *pixels); GLAPI void APIENTRY glTexSubImage3D (GLenum target, GLint level, GLint xoffset, GLint yoffset, GLint zoffset, GLsizei width, GLsizei height, GLsizei depth, GLenum format, GLenum type, const void *pixels); GLAPI void APIENTRY glCopyTexSubImage3D (GLenum target, GLint level, GLint xoffset, GLint yoffset, GLint zoffset, GLint x, GLint y, GLsizei width, GLsizei height); #endif #endif /* GL_VERSION_1_2 */ #ifndef GL_VERSION_1_3 #define GL_VERSION_1_3 1 #define GL_TEXTURE0 0x84C0 #define GL_TEXTURE1 0x84C1 #define GL_TEXTURE2 0x84C2 #define GL_TEXTURE3 0x84C3 #define GL_TEXTURE4 0x84C4 #define GL_TEXTURE5 0x84C5 #define GL_TEXTURE6 0x84C6 #define GL_TEXTURE7 0x84C7 #define GL_TEXTURE8 0x84C8 #define GL_TEXTURE9 0x84C9 #define GL_TEXTURE10 0x84CA #define GL_TEXTURE11 0x84CB #define GL_TEXTURE12 0x84CC #define GL_TEXTURE13 0x84CD #define GL_TEXTURE14 0x84CE #define GL_TEXTURE15 0x84CF #define GL_TEXTURE16 0x84D0 #define GL_TEXTURE17 0x84D1 #define GL_TEXTURE18 0x84D2 #define GL_TEXTURE19 0x84D3 #define GL_TEXTURE20 0x84D4 #define GL_TEXTURE21 0x84D5 #define GL_TEXTURE22 0x84D6 #define GL_TEXTURE23 0x84D7 #define GL_TEXTURE24 0x84D8 #define GL_TEXTURE25 0x84D9 #define GL_TEXTURE26 0x84DA #define GL_TEXTURE27 0x84DB #define GL_TEXTURE28 0x84DC #define GL_TEXTURE29 0x84DD #define GL_TEXTURE30 0x84DE #define GL_TEXTURE31 0x84DF #define GL_ACTIVE_TEXTURE 0x84E0 #define GL_MULTISAMPLE 0x809D #define GL_SAMPLE_ALPHA_TO_COVERAGE 0x809E #define GL_SAMPLE_ALPHA_TO_ONE 0x809F #define GL_SAMPLE_COVERAGE 0x80A0 #define GL_SAMPLE_BUFFERS 0x80A8 #define GL_SAMPLES 0x80A9 #define GL_SAMPLE_COVERAGE_VALUE 0x80AA #define GL_SAMPLE_COVERAGE_INVERT 0x80AB #define GL_TEXTURE_CUBE_MAP 0x8513 #define GL_TEXTURE_BINDING_CUBE_MAP 0x8514 #define GL_TEXTURE_CUBE_MAP_POSITIVE_X 0x8515 #define GL_TEXTURE_CUBE_MAP_NEGATIVE_X 0x8516 #define GL_TEXTURE_CUBE_MAP_POSITIVE_Y 0x8517 #define GL_TEXTURE_CUBE_MAP_NEGATIVE_Y 0x8518 #define GL_TEXTURE_CUBE_MAP_POSITIVE_Z 0x8519 #define GL_TEXTURE_CUBE_MAP_NEGATIVE_Z 0x851A #define GL_PROXY_TEXTURE_CUBE_MAP 0x851B #define GL_MAX_CUBE_MAP_TEXTURE_SIZE 0x851C #define GL_COMPRESSED_RGB 0x84ED #define GL_COMPRESSED_RGBA 0x84EE #define GL_TEXTURE_COMPRESSION_HINT 0x84EF #define GL_TEXTURE_COMPRESSED_IMAGE_SIZE 0x86A0 #define GL_TEXTURE_COMPRESSED 0x86A1 #define GL_NUM_COMPRESSED_TEXTURE_FORMATS 0x86A2 #define GL_COMPRESSED_TEXTURE_FORMATS 0x86A3 #define GL_CLAMP_TO_BORDER 0x812D #define GL_CLIENT_ACTIVE_TEXTURE 0x84E1 #define GL_MAX_TEXTURE_UNITS 0x84E2 #define GL_TRANSPOSE_MODELVIEW_MATRIX 0x84E3 #define GL_TRANSPOSE_PROJECTION_MATRIX 0x84E4 #define GL_TRANSPOSE_TEXTURE_MATRIX 0x84E5 #define GL_TRANSPOSE_COLOR_MATRIX 0x84E6 #define GL_MULTISAMPLE_BIT 0x20000000 #define GL_NORMAL_MAP 0x8511 #define GL_REFLECTION_MAP 0x8512 #define GL_COMPRESSED_ALPHA 0x84E9 #define GL_COMPRESSED_LUMINANCE 0x84EA #define GL_COMPRESSED_LUMINANCE_ALPHA 0x84EB #define GL_COMPRESSED_INTENSITY 0x84EC #define GL_COMBINE 0x8570 #define GL_COMBINE_RGB 0x8571 #define GL_COMBINE_ALPHA 0x8572 #define GL_SOURCE0_RGB 0x8580 #define GL_SOURCE1_RGB 0x8581 #define GL_SOURCE2_RGB 0x8582 #define GL_SOURCE0_ALPHA 0x8588 #define GL_SOURCE1_ALPHA 0x8589 #define GL_SOURCE2_ALPHA 0x858A #define GL_OPERAND0_RGB 0x8590 #define GL_OPERAND1_RGB 0x8591 #define GL_OPERAND2_RGB 0x8592 #define GL_OPERAND0_ALPHA 0x8598 #define GL_OPERAND1_ALPHA 0x8599 #define GL_OPERAND2_ALPHA 0x859A #define GL_RGB_SCALE 0x8573 #define GL_ADD_SIGNED 0x8574 #define GL_INTERPOLATE 0x8575 #define GL_SUBTRACT 0x84E7 #define GL_CONSTANT 0x8576 #define GL_PRIMARY_COLOR 0x8577 #define GL_PREVIOUS 0x8578 #define GL_DOT3_RGB 0x86AE #define GL_DOT3_RGBA 0x86AF typedef void (APIENTRYP PFNGLACTIVETEXTUREPROC) (GLenum texture); typedef void (APIENTRYP PFNGLSAMPLECOVERAGEPROC) (GLfloat value, GLboolean invert); typedef void (APIENTRYP PFNGLCOMPRESSEDTEXIMAGE3DPROC) (GLenum target, GLint level, GLenum internalformat, GLsizei width, GLsizei height, GLsizei depth, GLint border, GLsizei imageSize, const void *data); typedef void (APIENTRYP PFNGLCOMPRESSEDTEXIMAGE2DPROC) (GLenum target, GLint level, GLenum internalformat, GLsizei width, GLsizei height, GLint border, GLsizei imageSize, const void *data); typedef void (APIENTRYP PFNGLCOMPRESSEDTEXIMAGE1DPROC) (GLenum target, GLint level, GLenum internalformat, GLsizei width, GLint border, GLsizei imageSize, const void *data); typedef void (APIENTRYP PFNGLCOMPRESSEDTEXSUBIMAGE3DPROC) (GLenum target, GLint level, GLint xoffset, GLint yoffset, GLint zoffset, GLsizei width, GLsizei height, GLsizei depth, GLenum format, GLsizei imageSize, const void *data); typedef void (APIENTRYP PFNGLCOMPRESSEDTEXSUBIMAGE2DPROC) (GLenum target, GLint level, GLint xoffset, GLint yoffset, GLsizei width, GLsizei height, GLenum format, GLsizei imageSize, const void *data); typedef void (APIENTRYP PFNGLCOMPRESSEDTEXSUBIMAGE1DPROC) (GLenum target, GLint level, GLint xoffset, GLsizei width, GLenum format, GLsizei imageSize, const void *data); typedef void (APIENTRYP PFNGLGETCOMPRESSEDTEXIMAGEPROC) (GLenum target, GLint level, void *img); typedef void (APIENTRYP PFNGLCLIENTACTIVETEXTUREPROC) (GLenum texture); typedef void (APIENTRYP PFNGLMULTITEXCOORD1DPROC) (GLenum target, GLdouble s); typedef void (APIENTRYP PFNGLMULTITEXCOORD1DVPROC) (GLenum target, const GLdouble *v); typedef void (APIENTRYP PFNGLMULTITEXCOORD1FPROC) (GLenum target, GLfloat s); typedef void (APIENTRYP PFNGLMULTITEXCOORD1FVPROC) (GLenum target, const GLfloat *v); typedef void (APIENTRYP PFNGLMULTITEXCOORD1IPROC) (GLenum target, GLint s); typedef void (APIENTRYP PFNGLMULTITEXCOORD1IVPROC) (GLenum target, const GLint *v); typedef void (APIENTRYP PFNGLMULTITEXCOORD1SPROC) (GLenum target, GLshort s); typedef void (APIENTRYP PFNGLMULTITEXCOORD1SVPROC) (GLenum target, const GLshort *v); typedef void (APIENTRYP PFNGLMULTITEXCOORD2DPROC) (GLenum target, GLdouble s, GLdouble t); typedef void (APIENTRYP PFNGLMULTITEXCOORD2DVPROC) (GLenum target, const GLdouble *v); typedef void (APIENTRYP PFNGLMULTITEXCOORD2FPROC) (GLenum target, GLfloat s, GLfloat t); typedef void (APIENTRYP PFNGLMULTITEXCOORD2FVPROC) (GLenum target, const GLfloat *v); typedef void (APIENTRYP PFNGLMULTITEXCOORD2IPROC) (GLenum target, GLint s, GLint t); typedef void (APIENTRYP PFNGLMULTITEXCOORD2IVPROC) (GLenum target, const GLint *v); typedef void (APIENTRYP PFNGLMULTITEXCOORD2SPROC) (GLenum target, GLshort s, GLshort t); typedef void (APIENTRYP PFNGLMULTITEXCOORD2SVPROC) (GLenum target, const GLshort *v); typedef void (APIENTRYP PFNGLMULTITEXCOORD3DPROC) (GLenum target, GLdouble s, GLdouble t, GLdouble r); typedef void (APIENTRYP PFNGLMULTITEXCOORD3DVPROC) (GLenum target, const GLdouble *v); typedef void (APIENTRYP PFNGLMULTITEXCOORD3FPROC) (GLenum target, GLfloat s, GLfloat t, GLfloat r); typedef void (APIENTRYP PFNGLMULTITEXCOORD3FVPROC) (GLenum target, const GLfloat *v); typedef void (APIENTRYP PFNGLMULTITEXCOORD3IPROC) (GLenum target, GLint s, GLint t, GLint r); typedef void (APIENTRYP PFNGLMULTITEXCOORD3IVPROC) (GLenum target, const GLint *v); typedef void (APIENTRYP PFNGLMULTITEXCOORD3SPROC) (GLenum target, GLshort s, GLshort t, GLshort r); typedef void (APIENTRYP PFNGLMULTITEXCOORD3SVPROC) (GLenum target, const GLshort *v); typedef void (APIENTRYP PFNGLMULTITEXCOORD4DPROC) (GLenum target, GLdouble s, GLdouble t, GLdouble r, GLdouble q); typedef void (APIENTRYP PFNGLMULTITEXCOORD4DVPROC) (GLenum target, const GLdouble *v); typedef void (APIENTRYP PFNGLMULTITEXCOORD4FPROC) (GLenum target, GLfloat s, GLfloat t, GLfloat r, GLfloat q); typedef void (APIENTRYP PFNGLMULTITEXCOORD4FVPROC) (GLenum target, const GLfloat *v); typedef void (APIENTRYP PFNGLMULTITEXCOORD4IPROC) (GLenum target, GLint s, GLint t, GLint r, GLint q); typedef void (APIENTRYP PFNGLMULTITEXCOORD4IVPROC) (GLenum target, const GLint *v); typedef void (APIENTRYP PFNGLMULTITEXCOORD4SPROC) (GLenum target, GLshort s, GLshort t, GLshort r, GLshort q); typedef void (APIENTRYP PFNGLMULTITEXCOORD4SVPROC) (GLenum target, const GLshort *v); typedef void (APIENTRYP PFNGLLOADTRANSPOSEMATRIXFPROC) (const GLfloat *m); typedef void (APIENTRYP PFNGLLOADTRANSPOSEMATRIXDPROC) (const GLdouble *m); typedef void (APIENTRYP PFNGLMULTTRANSPOSEMATRIXFPROC) (const GLfloat *m); typedef void (APIENTRYP PFNGLMULTTRANSPOSEMATRIXDPROC) (const GLdouble *m); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glActiveTexture (GLenum texture); GLAPI void APIENTRY glSampleCoverage (GLfloat value, GLboolean invert); GLAPI void APIENTRY glCompressedTexImage3D (GLenum target, GLint level, GLenum internalformat, GLsizei width, GLsizei height, GLsizei depth, GLint border, GLsizei imageSize, const void *data); GLAPI void APIENTRY glCompressedTexImage2D (GLenum target, GLint level, GLenum internalformat, GLsizei width, GLsizei height, GLint border, GLsizei imageSize, const void *data); GLAPI void APIENTRY glCompressedTexImage1D (GLenum target, GLint level, GLenum internalformat, GLsizei width, GLint border, GLsizei imageSize, const void *data); GLAPI void APIENTRY glCompressedTexSubImage3D (GLenum target, GLint level, GLint xoffset, GLint yoffset, GLint zoffset, GLsizei width, GLsizei height, GLsizei depth, GLenum format, GLsizei imageSize, const void *data); GLAPI void APIENTRY glCompressedTexSubImage2D (GLenum target, GLint level, GLint xoffset, GLint yoffset, GLsizei width, GLsizei height, GLenum format, GLsizei imageSize, const void *data); GLAPI void APIENTRY glCompressedTexSubImage1D (GLenum target, GLint level, GLint xoffset, GLsizei width, GLenum format, GLsizei imageSize, const void *data); GLAPI void APIENTRY glGetCompressedTexImage (GLenum target, GLint level, void *img); GLAPI void APIENTRY glClientActiveTexture (GLenum texture); GLAPI void APIENTRY glMultiTexCoord1d (GLenum target, GLdouble s); GLAPI void APIENTRY glMultiTexCoord1dv (GLenum target, const GLdouble *v); GLAPI void APIENTRY glMultiTexCoord1f (GLenum target, GLfloat s); GLAPI void APIENTRY glMultiTexCoord1fv (GLenum target, const GLfloat *v); GLAPI void APIENTRY glMultiTexCoord1i (GLenum target, GLint s); GLAPI void APIENTRY glMultiTexCoord1iv (GLenum target, const GLint *v); GLAPI void APIENTRY glMultiTexCoord1s (GLenum target, GLshort s); GLAPI void APIENTRY glMultiTexCoord1sv (GLenum target, const GLshort *v); GLAPI void APIENTRY glMultiTexCoord2d (GLenum target, GLdouble s, GLdouble t); GLAPI void APIENTRY glMultiTexCoord2dv (GLenum target, const GLdouble *v); GLAPI void APIENTRY glMultiTexCoord2f (GLenum target, GLfloat s, GLfloat t); GLAPI void APIENTRY glMultiTexCoord2fv (GLenum target, const GLfloat *v); GLAPI void APIENTRY glMultiTexCoord2i (GLenum target, GLint s, GLint t); GLAPI void APIENTRY glMultiTexCoord2iv (GLenum target, const GLint *v); GLAPI void APIENTRY glMultiTexCoord2s (GLenum target, GLshort s, GLshort t); GLAPI void APIENTRY glMultiTexCoord2sv (GLenum target, const GLshort *v); GLAPI void APIENTRY glMultiTexCoord3d (GLenum target, GLdouble s, GLdouble t, GLdouble r); GLAPI void APIENTRY glMultiTexCoord3dv (GLenum target, const GLdouble *v); GLAPI void APIENTRY glMultiTexCoord3f (GLenum target, GLfloat s, GLfloat t, GLfloat r); GLAPI void APIENTRY glMultiTexCoord3fv (GLenum target, const GLfloat *v); GLAPI void APIENTRY glMultiTexCoord3i (GLenum target, GLint s, GLint t, GLint r); GLAPI void APIENTRY glMultiTexCoord3iv (GLenum target, const GLint *v); GLAPI void APIENTRY glMultiTexCoord3s (GLenum target, GLshort s, GLshort t, GLshort r); GLAPI void APIENTRY glMultiTexCoord3sv (GLenum target, const GLshort *v); GLAPI void APIENTRY glMultiTexCoord4d (GLenum target, GLdouble s, GLdouble t, GLdouble r, GLdouble q); GLAPI void APIENTRY glMultiTexCoord4dv (GLenum target, const GLdouble *v); GLAPI void APIENTRY glMultiTexCoord4f (GLenum target, GLfloat s, GLfloat t, GLfloat r, GLfloat q); GLAPI void APIENTRY glMultiTexCoord4fv (GLenum target, const GLfloat *v); GLAPI void APIENTRY glMultiTexCoord4i (GLenum target, GLint s, GLint t, GLint r, GLint q); GLAPI void APIENTRY glMultiTexCoord4iv (GLenum target, const GLint *v); GLAPI void APIENTRY glMultiTexCoord4s (GLenum target, GLshort s, GLshort t, GLshort r, GLshort q); GLAPI void APIENTRY glMultiTexCoord4sv (GLenum target, const GLshort *v); GLAPI void APIENTRY glLoadTransposeMatrixf (const GLfloat *m); GLAPI void APIENTRY glLoadTransposeMatrixd (const GLdouble *m); GLAPI void APIENTRY glMultTransposeMatrixf (const GLfloat *m); GLAPI void APIENTRY glMultTransposeMatrixd (const GLdouble *m); #endif #endif /* GL_VERSION_1_3 */ #ifndef GL_VERSION_1_4 #define GL_VERSION_1_4 1 #define GL_BLEND_DST_RGB 0x80C8 #define GL_BLEND_SRC_RGB 0x80C9 #define GL_BLEND_DST_ALPHA 0x80CA #define GL_BLEND_SRC_ALPHA 0x80CB #define GL_POINT_FADE_THRESHOLD_SIZE 0x8128 #define GL_DEPTH_COMPONENT16 0x81A5 #define GL_DEPTH_COMPONENT24 0x81A6 #define GL_DEPTH_COMPONENT32 0x81A7 #define GL_MIRRORED_REPEAT 0x8370 #define GL_MAX_TEXTURE_LOD_BIAS 0x84FD #define GL_TEXTURE_LOD_BIAS 0x8501 #define GL_INCR_WRAP 0x8507 #define GL_DECR_WRAP 0x8508 #define GL_TEXTURE_DEPTH_SIZE 0x884A #define GL_TEXTURE_COMPARE_MODE 0x884C #define GL_TEXTURE_COMPARE_FUNC 0x884D #define GL_POINT_SIZE_MIN 0x8126 #define GL_POINT_SIZE_MAX 0x8127 #define GL_POINT_DISTANCE_ATTENUATION 0x8129 #define GL_GENERATE_MIPMAP 0x8191 #define GL_GENERATE_MIPMAP_HINT 0x8192 #define GL_FOG_COORDINATE_SOURCE 0x8450 #define GL_FOG_COORDINATE 0x8451 #define GL_FRAGMENT_DEPTH 0x8452 #define GL_CURRENT_FOG_COORDINATE 0x8453 #define GL_FOG_COORDINATE_ARRAY_TYPE 0x8454 #define GL_FOG_COORDINATE_ARRAY_STRIDE 0x8455 #define GL_FOG_COORDINATE_ARRAY_POINTER 0x8456 #define GL_FOG_COORDINATE_ARRAY 0x8457 #define GL_COLOR_SUM 0x8458 #define GL_CURRENT_SECONDARY_COLOR 0x8459 #define GL_SECONDARY_COLOR_ARRAY_SIZE 0x845A #define GL_SECONDARY_COLOR_ARRAY_TYPE 0x845B #define GL_SECONDARY_COLOR_ARRAY_STRIDE 0x845C #define GL_SECONDARY_COLOR_ARRAY_POINTER 0x845D #define GL_SECONDARY_COLOR_ARRAY 0x845E #define GL_TEXTURE_FILTER_CONTROL 0x8500 #define GL_DEPTH_TEXTURE_MODE 0x884B #define GL_COMPARE_R_TO_TEXTURE 0x884E #define GL_FUNC_ADD 0x8006 #define GL_FUNC_SUBTRACT 0x800A #define GL_FUNC_REVERSE_SUBTRACT 0x800B #define GL_MIN 0x8007 #define GL_MAX 0x8008 #define GL_CONSTANT_COLOR 0x8001 #define GL_ONE_MINUS_CONSTANT_COLOR 0x8002 #define GL_CONSTANT_ALPHA 0x8003 #define GL_ONE_MINUS_CONSTANT_ALPHA 0x8004 typedef void (APIENTRYP PFNGLBLENDFUNCSEPARATEPROC) (GLenum sfactorRGB, GLenum dfactorRGB, GLenum sfactorAlpha, GLenum dfactorAlpha); typedef void (APIENTRYP PFNGLMULTIDRAWARRAYSPROC) (GLenum mode, const GLint *first, const GLsizei *count, GLsizei drawcount); typedef void (APIENTRYP PFNGLMULTIDRAWELEMENTSPROC) (GLenum mode, const GLsizei *count, GLenum type, const void *const*indices, GLsizei drawcount); typedef void (APIENTRYP PFNGLPOINTPARAMETERFPROC) (GLenum pname, GLfloat param); typedef void (APIENTRYP PFNGLPOINTPARAMETERFVPROC) (GLenum pname, const GLfloat *params); typedef void (APIENTRYP PFNGLPOINTPARAMETERIPROC) (GLenum pname, GLint param); typedef void (APIENTRYP PFNGLPOINTPARAMETERIVPROC) (GLenum pname, const GLint *params); typedef void (APIENTRYP PFNGLFOGCOORDFPROC) (GLfloat coord); typedef void (APIENTRYP PFNGLFOGCOORDFVPROC) (const GLfloat *coord); typedef void (APIENTRYP PFNGLFOGCOORDDPROC) (GLdouble coord); typedef void (APIENTRYP PFNGLFOGCOORDDVPROC) (const GLdouble *coord); typedef void (APIENTRYP PFNGLFOGCOORDPOINTERPROC) (GLenum type, GLsizei stride, const void *pointer); typedef void (APIENTRYP PFNGLSECONDARYCOLOR3BPROC) (GLbyte red, GLbyte green, GLbyte blue); typedef void (APIENTRYP PFNGLSECONDARYCOLOR3BVPROC) (const GLbyte *v); typedef void (APIENTRYP PFNGLSECONDARYCOLOR3DPROC) (GLdouble red, GLdouble green, GLdouble blue); typedef void (APIENTRYP PFNGLSECONDARYCOLOR3DVPROC) (const GLdouble *v); typedef void (APIENTRYP PFNGLSECONDARYCOLOR3FPROC) (GLfloat red, GLfloat green, GLfloat blue); typedef void (APIENTRYP PFNGLSECONDARYCOLOR3FVPROC) (const GLfloat *v); typedef void (APIENTRYP PFNGLSECONDARYCOLOR3IPROC) (GLint red, GLint green, GLint blue); typedef void (APIENTRYP PFNGLSECONDARYCOLOR3IVPROC) (const GLint *v); typedef void (APIENTRYP PFNGLSECONDARYCOLOR3SPROC) (GLshort red, GLshort green, GLshort blue); typedef void (APIENTRYP PFNGLSECONDARYCOLOR3SVPROC) (const GLshort *v); typedef void (APIENTRYP PFNGLSECONDARYCOLOR3UBPROC) (GLubyte red, GLubyte green, GLubyte blue); typedef void (APIENTRYP PFNGLSECONDARYCOLOR3UBVPROC) (const GLubyte *v); typedef void (APIENTRYP PFNGLSECONDARYCOLOR3UIPROC) (GLuint red, GLuint green, GLuint blue); typedef void (APIENTRYP PFNGLSECONDARYCOLOR3UIVPROC) (const GLuint *v); typedef void (APIENTRYP PFNGLSECONDARYCOLOR3USPROC) (GLushort red, GLushort green, GLushort blue); typedef void (APIENTRYP PFNGLSECONDARYCOLOR3USVPROC) (const GLushort *v); typedef void (APIENTRYP PFNGLSECONDARYCOLORPOINTERPROC) (GLint size, GLenum type, GLsizei stride, const void *pointer); typedef void (APIENTRYP PFNGLWINDOWPOS2DPROC) (GLdouble x, GLdouble y); typedef void (APIENTRYP PFNGLWINDOWPOS2DVPROC) (const GLdouble *v); typedef void (APIENTRYP PFNGLWINDOWPOS2FPROC) (GLfloat x, GLfloat y); typedef void (APIENTRYP PFNGLWINDOWPOS2FVPROC) (const GLfloat *v); typedef void (APIENTRYP PFNGLWINDOWPOS2IPROC) (GLint x, GLint y); typedef void (APIENTRYP PFNGLWINDOWPOS2IVPROC) (const GLint *v); typedef void (APIENTRYP PFNGLWINDOWPOS2SPROC) (GLshort x, GLshort y); typedef void (APIENTRYP PFNGLWINDOWPOS2SVPROC) (const GLshort *v); typedef void (APIENTRYP PFNGLWINDOWPOS3DPROC) (GLdouble x, GLdouble y, GLdouble z); typedef void (APIENTRYP PFNGLWINDOWPOS3DVPROC) (const GLdouble *v); typedef void (APIENTRYP PFNGLWINDOWPOS3FPROC) (GLfloat x, GLfloat y, GLfloat z); typedef void (APIENTRYP PFNGLWINDOWPOS3FVPROC) (const GLfloat *v); typedef void (APIENTRYP PFNGLWINDOWPOS3IPROC) (GLint x, GLint y, GLint z); typedef void (APIENTRYP PFNGLWINDOWPOS3IVPROC) (const GLint *v); typedef void (APIENTRYP PFNGLWINDOWPOS3SPROC) (GLshort x, GLshort y, GLshort z); typedef void (APIENTRYP PFNGLWINDOWPOS3SVPROC) (const GLshort *v); typedef void (APIENTRYP PFNGLBLENDCOLORPROC) (GLfloat red, GLfloat green, GLfloat blue, GLfloat alpha); typedef void (APIENTRYP PFNGLBLENDEQUATIONPROC) (GLenum mode); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glBlendFuncSeparate (GLenum sfactorRGB, GLenum dfactorRGB, GLenum sfactorAlpha, GLenum dfactorAlpha); GLAPI void APIENTRY glMultiDrawArrays (GLenum mode, const GLint *first, const GLsizei *count, GLsizei drawcount); GLAPI void APIENTRY glMultiDrawElements (GLenum mode, const GLsizei *count, GLenum type, const void *const*indices, GLsizei drawcount); GLAPI void APIENTRY glPointParameterf (GLenum pname, GLfloat param); GLAPI void APIENTRY glPointParameterfv (GLenum pname, const GLfloat *params); GLAPI void APIENTRY glPointParameteri (GLenum pname, GLint param); GLAPI void APIENTRY glPointParameteriv (GLenum pname, const GLint *params); GLAPI void APIENTRY glFogCoordf (GLfloat coord); GLAPI void APIENTRY glFogCoordfv (const GLfloat *coord); GLAPI void APIENTRY glFogCoordd (GLdouble coord); GLAPI void APIENTRY glFogCoorddv (const GLdouble *coord); GLAPI void APIENTRY glFogCoordPointer (GLenum type, GLsizei stride, const void *pointer); GLAPI void APIENTRY glSecondaryColor3b (GLbyte red, GLbyte green, GLbyte blue); GLAPI void APIENTRY glSecondaryColor3bv (const GLbyte *v); GLAPI void APIENTRY glSecondaryColor3d (GLdouble red, GLdouble green, GLdouble blue); GLAPI void APIENTRY glSecondaryColor3dv (const GLdouble *v); GLAPI void APIENTRY glSecondaryColor3f (GLfloat red, GLfloat green, GLfloat blue); GLAPI void APIENTRY glSecondaryColor3fv (const GLfloat *v); GLAPI void APIENTRY glSecondaryColor3i (GLint red, GLint green, GLint blue); GLAPI void APIENTRY glSecondaryColor3iv (const GLint *v); GLAPI void APIENTRY glSecondaryColor3s (GLshort red, GLshort green, GLshort blue); GLAPI void APIENTRY glSecondaryColor3sv (const GLshort *v); GLAPI void APIENTRY glSecondaryColor3ub (GLubyte red, GLubyte green, GLubyte blue); GLAPI void APIENTRY glSecondaryColor3ubv (const GLubyte *v); GLAPI void APIENTRY glSecondaryColor3ui (GLuint red, GLuint green, GLuint blue); GLAPI void APIENTRY glSecondaryColor3uiv (const GLuint *v); GLAPI void APIENTRY glSecondaryColor3us (GLushort red, GLushort green, GLushort blue); GLAPI void APIENTRY glSecondaryColor3usv (const GLushort *v); GLAPI void APIENTRY glSecondaryColorPointer (GLint size, GLenum type, GLsizei stride, const void *pointer); GLAPI void APIENTRY glWindowPos2d (GLdouble x, GLdouble y); GLAPI void APIENTRY glWindowPos2dv (const GLdouble *v); GLAPI void APIENTRY glWindowPos2f (GLfloat x, GLfloat y); GLAPI void APIENTRY glWindowPos2fv (const GLfloat *v); GLAPI void APIENTRY glWindowPos2i (GLint x, GLint y); GLAPI void APIENTRY glWindowPos2iv (const GLint *v); GLAPI void APIENTRY glWindowPos2s (GLshort x, GLshort y); GLAPI void APIENTRY glWindowPos2sv (const GLshort *v); GLAPI void APIENTRY glWindowPos3d (GLdouble x, GLdouble y, GLdouble z); GLAPI void APIENTRY glWindowPos3dv (const GLdouble *v); GLAPI void APIENTRY glWindowPos3f (GLfloat x, GLfloat y, GLfloat z); GLAPI void APIENTRY glWindowPos3fv (const GLfloat *v); GLAPI void APIENTRY glWindowPos3i (GLint x, GLint y, GLint z); GLAPI void APIENTRY glWindowPos3iv (const GLint *v); GLAPI void APIENTRY glWindowPos3s (GLshort x, GLshort y, GLshort z); GLAPI void APIENTRY glWindowPos3sv (const GLshort *v); GLAPI void APIENTRY glBlendColor (GLfloat red, GLfloat green, GLfloat blue, GLfloat alpha); GLAPI void APIENTRY glBlendEquation (GLenum mode); #endif #endif /* GL_VERSION_1_4 */ #ifndef GL_VERSION_1_5 #define GL_VERSION_1_5 1 #include typedef ptrdiff_t GLsizeiptr; typedef ptrdiff_t GLintptr; #define GL_BUFFER_SIZE 0x8764 #define GL_BUFFER_USAGE 0x8765 #define GL_QUERY_COUNTER_BITS 0x8864 #define GL_CURRENT_QUERY 0x8865 #define GL_QUERY_RESULT 0x8866 #define GL_QUERY_RESULT_AVAILABLE 0x8867 #define GL_ARRAY_BUFFER 0x8892 #define GL_ELEMENT_ARRAY_BUFFER 0x8893 #define GL_ARRAY_BUFFER_BINDING 0x8894 #define GL_ELEMENT_ARRAY_BUFFER_BINDING 0x8895 #define GL_VERTEX_ATTRIB_ARRAY_BUFFER_BINDING 0x889F #define GL_READ_ONLY 0x88B8 #define GL_WRITE_ONLY 0x88B9 #define GL_READ_WRITE 0x88BA #define GL_BUFFER_ACCESS 0x88BB #define GL_BUFFER_MAPPED 0x88BC #define GL_BUFFER_MAP_POINTER 0x88BD #define GL_STREAM_DRAW 0x88E0 #define GL_STREAM_READ 0x88E1 #define GL_STREAM_COPY 0x88E2 #define GL_STATIC_DRAW 0x88E4 #define GL_STATIC_READ 0x88E5 #define GL_STATIC_COPY 0x88E6 #define GL_DYNAMIC_DRAW 0x88E8 #define GL_DYNAMIC_READ 0x88E9 #define GL_DYNAMIC_COPY 0x88EA #define GL_SAMPLES_PASSED 0x8914 #define GL_SRC1_ALPHA 0x8589 #define GL_VERTEX_ARRAY_BUFFER_BINDING 0x8896 #define GL_NORMAL_ARRAY_BUFFER_BINDING 0x8897 #define GL_COLOR_ARRAY_BUFFER_BINDING 0x8898 #define GL_INDEX_ARRAY_BUFFER_BINDING 0x8899 #define GL_TEXTURE_COORD_ARRAY_BUFFER_BINDING 0x889A #define GL_EDGE_FLAG_ARRAY_BUFFER_BINDING 0x889B #define GL_SECONDARY_COLOR_ARRAY_BUFFER_BINDING 0x889C #define GL_FOG_COORDINATE_ARRAY_BUFFER_BINDING 0x889D #define GL_WEIGHT_ARRAY_BUFFER_BINDING 0x889E #define GL_FOG_COORD_SRC 0x8450 #define GL_FOG_COORD 0x8451 #define GL_CURRENT_FOG_COORD 0x8453 #define GL_FOG_COORD_ARRAY_TYPE 0x8454 #define GL_FOG_COORD_ARRAY_STRIDE 0x8455 #define GL_FOG_COORD_ARRAY_POINTER 0x8456 #define GL_FOG_COORD_ARRAY 0x8457 #define GL_FOG_COORD_ARRAY_BUFFER_BINDING 0x889D #define GL_SRC0_RGB 0x8580 #define GL_SRC1_RGB 0x8581 #define GL_SRC2_RGB 0x8582 #define GL_SRC0_ALPHA 0x8588 #define GL_SRC2_ALPHA 0x858A typedef void (APIENTRYP PFNGLGENQUERIESPROC) (GLsizei n, GLuint *ids); typedef void (APIENTRYP PFNGLDELETEQUERIESPROC) (GLsizei n, const GLuint *ids); typedef GLboolean (APIENTRYP PFNGLISQUERYPROC) (GLuint id); typedef void (APIENTRYP PFNGLBEGINQUERYPROC) (GLenum target, GLuint id); typedef void (APIENTRYP PFNGLENDQUERYPROC) (GLenum target); typedef void (APIENTRYP PFNGLGETQUERYIVPROC) (GLenum target, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGETQUERYOBJECTIVPROC) (GLuint id, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGETQUERYOBJECTUIVPROC) (GLuint id, GLenum pname, GLuint *params); typedef void (APIENTRYP PFNGLBINDBUFFERPROC) (GLenum target, GLuint buffer); typedef void (APIENTRYP PFNGLDELETEBUFFERSPROC) (GLsizei n, const GLuint *buffers); typedef void (APIENTRYP PFNGLGENBUFFERSPROC) (GLsizei n, GLuint *buffers); typedef GLboolean (APIENTRYP PFNGLISBUFFERPROC) (GLuint buffer); typedef void (APIENTRYP PFNGLBUFFERDATAPROC) (GLenum target, GLsizeiptr size, const void *data, GLenum usage); typedef void (APIENTRYP PFNGLBUFFERSUBDATAPROC) (GLenum target, GLintptr offset, GLsizeiptr size, const void *data); typedef void (APIENTRYP PFNGLGETBUFFERSUBDATAPROC) (GLenum target, GLintptr offset, GLsizeiptr size, void *data); typedef void *(APIENTRYP PFNGLMAPBUFFERPROC) (GLenum target, GLenum access); typedef GLboolean (APIENTRYP PFNGLUNMAPBUFFERPROC) (GLenum target); typedef void (APIENTRYP PFNGLGETBUFFERPARAMETERIVPROC) (GLenum target, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGETBUFFERPOINTERVPROC) (GLenum target, GLenum pname, void **params); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glGenQueries (GLsizei n, GLuint *ids); GLAPI void APIENTRY glDeleteQueries (GLsizei n, const GLuint *ids); GLAPI GLboolean APIENTRY glIsQuery (GLuint id); GLAPI void APIENTRY glBeginQuery (GLenum target, GLuint id); GLAPI void APIENTRY glEndQuery (GLenum target); GLAPI void APIENTRY glGetQueryiv (GLenum target, GLenum pname, GLint *params); GLAPI void APIENTRY glGetQueryObjectiv (GLuint id, GLenum pname, GLint *params); GLAPI void APIENTRY glGetQueryObjectuiv (GLuint id, GLenum pname, GLuint *params); GLAPI void APIENTRY glBindBuffer (GLenum target, GLuint buffer); GLAPI void APIENTRY glDeleteBuffers (GLsizei n, const GLuint *buffers); GLAPI void APIENTRY glGenBuffers (GLsizei n, GLuint *buffers); GLAPI GLboolean APIENTRY glIsBuffer (GLuint buffer); GLAPI void APIENTRY glBufferData (GLenum target, GLsizeiptr size, const void *data, GLenum usage); GLAPI void APIENTRY glBufferSubData (GLenum target, GLintptr offset, GLsizeiptr size, const void *data); GLAPI void APIENTRY glGetBufferSubData (GLenum target, GLintptr offset, GLsizeiptr size, void *data); GLAPI void *APIENTRY glMapBuffer (GLenum target, GLenum access); GLAPI GLboolean APIENTRY glUnmapBuffer (GLenum target); GLAPI void APIENTRY glGetBufferParameteriv (GLenum target, GLenum pname, GLint *params); GLAPI void APIENTRY glGetBufferPointerv (GLenum target, GLenum pname, void **params); #endif #endif /* GL_VERSION_1_5 */ #ifndef GL_VERSION_2_0 #define GL_VERSION_2_0 1 typedef char GLchar; #define GL_BLEND_EQUATION_RGB 0x8009 #define GL_VERTEX_ATTRIB_ARRAY_ENABLED 0x8622 #define GL_VERTEX_ATTRIB_ARRAY_SIZE 0x8623 #define GL_VERTEX_ATTRIB_ARRAY_STRIDE 0x8624 #define GL_VERTEX_ATTRIB_ARRAY_TYPE 0x8625 #define GL_CURRENT_VERTEX_ATTRIB 0x8626 #define GL_VERTEX_PROGRAM_POINT_SIZE 0x8642 #define GL_VERTEX_ATTRIB_ARRAY_POINTER 0x8645 #define GL_STENCIL_BACK_FUNC 0x8800 #define GL_STENCIL_BACK_FAIL 0x8801 #define GL_STENCIL_BACK_PASS_DEPTH_FAIL 0x8802 #define GL_STENCIL_BACK_PASS_DEPTH_PASS 0x8803 #define GL_MAX_DRAW_BUFFERS 0x8824 #define GL_DRAW_BUFFER0 0x8825 #define GL_DRAW_BUFFER1 0x8826 #define GL_DRAW_BUFFER2 0x8827 #define GL_DRAW_BUFFER3 0x8828 #define GL_DRAW_BUFFER4 0x8829 #define GL_DRAW_BUFFER5 0x882A #define GL_DRAW_BUFFER6 0x882B #define GL_DRAW_BUFFER7 0x882C #define GL_DRAW_BUFFER8 0x882D #define GL_DRAW_BUFFER9 0x882E #define GL_DRAW_BUFFER10 0x882F #define GL_DRAW_BUFFER11 0x8830 #define GL_DRAW_BUFFER12 0x8831 #define GL_DRAW_BUFFER13 0x8832 #define GL_DRAW_BUFFER14 0x8833 #define GL_DRAW_BUFFER15 0x8834 #define GL_BLEND_EQUATION_ALPHA 0x883D #define GL_MAX_VERTEX_ATTRIBS 0x8869 #define GL_VERTEX_ATTRIB_ARRAY_NORMALIZED 0x886A #define GL_MAX_TEXTURE_IMAGE_UNITS 0x8872 #define GL_FRAGMENT_SHADER 0x8B30 #define GL_VERTEX_SHADER 0x8B31 #define GL_MAX_FRAGMENT_UNIFORM_COMPONENTS 0x8B49 #define GL_MAX_VERTEX_UNIFORM_COMPONENTS 0x8B4A #define GL_MAX_VARYING_FLOATS 0x8B4B #define GL_MAX_VERTEX_TEXTURE_IMAGE_UNITS 0x8B4C #define GL_MAX_COMBINED_TEXTURE_IMAGE_UNITS 0x8B4D #define GL_SHADER_TYPE 0x8B4F #define GL_FLOAT_VEC2 0x8B50 #define GL_FLOAT_VEC3 0x8B51 #define GL_FLOAT_VEC4 0x8B52 #define GL_INT_VEC2 0x8B53 #define GL_INT_VEC3 0x8B54 #define GL_INT_VEC4 0x8B55 #define GL_BOOL 0x8B56 #define GL_BOOL_VEC2 0x8B57 #define GL_BOOL_VEC3 0x8B58 #define GL_BOOL_VEC4 0x8B59 #define GL_FLOAT_MAT2 0x8B5A #define GL_FLOAT_MAT3 0x8B5B #define GL_FLOAT_MAT4 0x8B5C #define GL_SAMPLER_1D 0x8B5D #define GL_SAMPLER_2D 0x8B5E #define GL_SAMPLER_3D 0x8B5F #define GL_SAMPLER_CUBE 0x8B60 #define GL_SAMPLER_1D_SHADOW 0x8B61 #define GL_SAMPLER_2D_SHADOW 0x8B62 #define GL_DELETE_STATUS 0x8B80 #define GL_COMPILE_STATUS 0x8B81 #define GL_LINK_STATUS 0x8B82 #define GL_VALIDATE_STATUS 0x8B83 #define GL_INFO_LOG_LENGTH 0x8B84 #define GL_ATTACHED_SHADERS 0x8B85 #define GL_ACTIVE_UNIFORMS 0x8B86 #define GL_ACTIVE_UNIFORM_MAX_LENGTH 0x8B87 #define GL_SHADER_SOURCE_LENGTH 0x8B88 #define GL_ACTIVE_ATTRIBUTES 0x8B89 #define GL_ACTIVE_ATTRIBUTE_MAX_LENGTH 0x8B8A #define GL_FRAGMENT_SHADER_DERIVATIVE_HINT 0x8B8B #define GL_SHADING_LANGUAGE_VERSION 0x8B8C #define GL_CURRENT_PROGRAM 0x8B8D #define GL_POINT_SPRITE_COORD_ORIGIN 0x8CA0 #define GL_LOWER_LEFT 0x8CA1 #define GL_UPPER_LEFT 0x8CA2 #define GL_STENCIL_BACK_REF 0x8CA3 #define GL_STENCIL_BACK_VALUE_MASK 0x8CA4 #define GL_STENCIL_BACK_WRITEMASK 0x8CA5 #define GL_VERTEX_PROGRAM_TWO_SIDE 0x8643 #define GL_POINT_SPRITE 0x8861 #define GL_COORD_REPLACE 0x8862 #define GL_MAX_TEXTURE_COORDS 0x8871 typedef void (APIENTRYP PFNGLBLENDEQUATIONSEPARATEPROC) (GLenum modeRGB, GLenum modeAlpha); typedef void (APIENTRYP PFNGLDRAWBUFFERSPROC) (GLsizei n, const GLenum *bufs); typedef void (APIENTRYP PFNGLSTENCILOPSEPARATEPROC) (GLenum face, GLenum sfail, GLenum dpfail, GLenum dppass); typedef void (APIENTRYP PFNGLSTENCILFUNCSEPARATEPROC) (GLenum face, GLenum func, GLint ref, GLuint mask); typedef void (APIENTRYP PFNGLSTENCILMASKSEPARATEPROC) (GLenum face, GLuint mask); typedef void (APIENTRYP PFNGLATTACHSHADERPROC) (GLuint program, GLuint shader); typedef void (APIENTRYP PFNGLBINDATTRIBLOCATIONPROC) (GLuint program, GLuint index, const GLchar *name); typedef void (APIENTRYP PFNGLCOMPILESHADERPROC) (GLuint shader); typedef GLuint (APIENTRYP PFNGLCREATEPROGRAMPROC) (void); typedef GLuint (APIENTRYP PFNGLCREATESHADERPROC) (GLenum type); typedef void (APIENTRYP PFNGLDELETEPROGRAMPROC) (GLuint program); typedef void (APIENTRYP PFNGLDELETESHADERPROC) (GLuint shader); typedef void (APIENTRYP PFNGLDETACHSHADERPROC) (GLuint program, GLuint shader); typedef void (APIENTRYP PFNGLDISABLEVERTEXATTRIBARRAYPROC) (GLuint index); typedef void (APIENTRYP PFNGLENABLEVERTEXATTRIBARRAYPROC) (GLuint index); typedef void (APIENTRYP PFNGLGETACTIVEATTRIBPROC) (GLuint program, GLuint index, GLsizei bufSize, GLsizei *length, GLint *size, GLenum *type, GLchar *name); typedef void (APIENTRYP PFNGLGETACTIVEUNIFORMPROC) (GLuint program, GLuint index, GLsizei bufSize, GLsizei *length, GLint *size, GLenum *type, GLchar *name); typedef void (APIENTRYP PFNGLGETATTACHEDSHADERSPROC) (GLuint program, GLsizei maxCount, GLsizei *count, GLuint *shaders); typedef GLint (APIENTRYP PFNGLGETATTRIBLOCATIONPROC) (GLuint program, const GLchar *name); typedef void (APIENTRYP PFNGLGETPROGRAMIVPROC) (GLuint program, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGETPROGRAMINFOLOGPROC) (GLuint program, GLsizei bufSize, GLsizei *length, GLchar *infoLog); typedef void (APIENTRYP PFNGLGETSHADERIVPROC) (GLuint shader, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGETSHADERINFOLOGPROC) (GLuint shader, GLsizei bufSize, GLsizei *length, GLchar *infoLog); typedef void (APIENTRYP PFNGLGETSHADERSOURCEPROC) (GLuint shader, GLsizei bufSize, GLsizei *length, GLchar *source); typedef GLint (APIENTRYP PFNGLGETUNIFORMLOCATIONPROC) (GLuint program, const GLchar *name); typedef void (APIENTRYP PFNGLGETUNIFORMFVPROC) (GLuint program, GLint location, GLfloat *params); typedef void (APIENTRYP PFNGLGETUNIFORMIVPROC) (GLuint program, GLint location, GLint *params); typedef void (APIENTRYP PFNGLGETVERTEXATTRIBDVPROC) (GLuint index, GLenum pname, GLdouble *params); typedef void (APIENTRYP PFNGLGETVERTEXATTRIBFVPROC) (GLuint index, GLenum pname, GLfloat *params); typedef void (APIENTRYP PFNGLGETVERTEXATTRIBIVPROC) (GLuint index, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGETVERTEXATTRIBPOINTERVPROC) (GLuint index, GLenum pname, void **pointer); typedef GLboolean (APIENTRYP PFNGLISPROGRAMPROC) (GLuint program); typedef GLboolean (APIENTRYP PFNGLISSHADERPROC) (GLuint shader); typedef void (APIENTRYP PFNGLLINKPROGRAMPROC) (GLuint program); typedef void (APIENTRYP PFNGLSHADERSOURCEPROC) (GLuint shader, GLsizei count, const GLchar *const*string, const GLint *length); typedef void (APIENTRYP PFNGLUSEPROGRAMPROC) (GLuint program); typedef void (APIENTRYP PFNGLUNIFORM1FPROC) (GLint location, GLfloat v0); typedef void (APIENTRYP PFNGLUNIFORM2FPROC) (GLint location, GLfloat v0, GLfloat v1); typedef void (APIENTRYP PFNGLUNIFORM3FPROC) (GLint location, GLfloat v0, GLfloat v1, GLfloat v2); typedef void (APIENTRYP PFNGLUNIFORM4FPROC) (GLint location, GLfloat v0, GLfloat v1, GLfloat v2, GLfloat v3); typedef void (APIENTRYP PFNGLUNIFORM1IPROC) (GLint location, GLint v0); typedef void (APIENTRYP PFNGLUNIFORM2IPROC) (GLint location, GLint v0, GLint v1); typedef void (APIENTRYP PFNGLUNIFORM3IPROC) (GLint location, GLint v0, GLint v1, GLint v2); typedef void (APIENTRYP PFNGLUNIFORM4IPROC) (GLint location, GLint v0, GLint v1, GLint v2, GLint v3); typedef void (APIENTRYP PFNGLUNIFORM1FVPROC) (GLint location, GLsizei count, const GLfloat *value); typedef void (APIENTRYP PFNGLUNIFORM2FVPROC) (GLint location, GLsizei count, const GLfloat *value); typedef void (APIENTRYP PFNGLUNIFORM3FVPROC) (GLint location, GLsizei count, const GLfloat *value); typedef void (APIENTRYP PFNGLUNIFORM4FVPROC) (GLint location, GLsizei count, const GLfloat *value); typedef void (APIENTRYP PFNGLUNIFORM1IVPROC) (GLint location, GLsizei count, const GLint *value); typedef void (APIENTRYP PFNGLUNIFORM2IVPROC) (GLint location, GLsizei count, const GLint *value); typedef void (APIENTRYP PFNGLUNIFORM3IVPROC) (GLint location, GLsizei count, const GLint *value); typedef void (APIENTRYP PFNGLUNIFORM4IVPROC) (GLint location, GLsizei count, const GLint *value); typedef void (APIENTRYP PFNGLUNIFORMMATRIX2FVPROC) (GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); typedef void (APIENTRYP PFNGLUNIFORMMATRIX3FVPROC) (GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); typedef void (APIENTRYP PFNGLUNIFORMMATRIX4FVPROC) (GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); typedef void (APIENTRYP PFNGLVALIDATEPROGRAMPROC) (GLuint program); typedef void (APIENTRYP PFNGLVERTEXATTRIB1DPROC) (GLuint index, GLdouble x); typedef void (APIENTRYP PFNGLVERTEXATTRIB1DVPROC) (GLuint index, const GLdouble *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB1FPROC) (GLuint index, GLfloat x); typedef void (APIENTRYP PFNGLVERTEXATTRIB1FVPROC) (GLuint index, const GLfloat *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB1SPROC) (GLuint index, GLshort x); typedef void (APIENTRYP PFNGLVERTEXATTRIB1SVPROC) (GLuint index, const GLshort *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB2DPROC) (GLuint index, GLdouble x, GLdouble y); typedef void (APIENTRYP PFNGLVERTEXATTRIB2DVPROC) (GLuint index, const GLdouble *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB2FPROC) (GLuint index, GLfloat x, GLfloat y); typedef void (APIENTRYP PFNGLVERTEXATTRIB2FVPROC) (GLuint index, const GLfloat *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB2SPROC) (GLuint index, GLshort x, GLshort y); typedef void (APIENTRYP PFNGLVERTEXATTRIB2SVPROC) (GLuint index, const GLshort *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB3DPROC) (GLuint index, GLdouble x, GLdouble y, GLdouble z); typedef void (APIENTRYP PFNGLVERTEXATTRIB3DVPROC) (GLuint index, const GLdouble *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB3FPROC) (GLuint index, GLfloat x, GLfloat y, GLfloat z); typedef void (APIENTRYP PFNGLVERTEXATTRIB3FVPROC) (GLuint index, const GLfloat *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB3SPROC) (GLuint index, GLshort x, GLshort y, GLshort z); typedef void (APIENTRYP PFNGLVERTEXATTRIB3SVPROC) (GLuint index, const GLshort *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB4NBVPROC) (GLuint index, const GLbyte *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB4NIVPROC) (GLuint index, const GLint *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB4NSVPROC) (GLuint index, const GLshort *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB4NUBPROC) (GLuint index, GLubyte x, GLubyte y, GLubyte z, GLubyte w); typedef void (APIENTRYP PFNGLVERTEXATTRIB4NUBVPROC) (GLuint index, const GLubyte *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB4NUIVPROC) (GLuint index, const GLuint *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB4NUSVPROC) (GLuint index, const GLushort *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB4BVPROC) (GLuint index, const GLbyte *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB4DPROC) (GLuint index, GLdouble x, GLdouble y, GLdouble z, GLdouble w); typedef void (APIENTRYP PFNGLVERTEXATTRIB4DVPROC) (GLuint index, const GLdouble *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB4FPROC) (GLuint index, GLfloat x, GLfloat y, GLfloat z, GLfloat w); typedef void (APIENTRYP PFNGLVERTEXATTRIB4FVPROC) (GLuint index, const GLfloat *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB4IVPROC) (GLuint index, const GLint *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB4SPROC) (GLuint index, GLshort x, GLshort y, GLshort z, GLshort w); typedef void (APIENTRYP PFNGLVERTEXATTRIB4SVPROC) (GLuint index, const GLshort *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB4UBVPROC) (GLuint index, const GLubyte *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB4UIVPROC) (GLuint index, const GLuint *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB4USVPROC) (GLuint index, const GLushort *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBPOINTERPROC) (GLuint index, GLint size, GLenum type, GLboolean normalized, GLsizei stride, const void *pointer); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glBlendEquationSeparate (GLenum modeRGB, GLenum modeAlpha); GLAPI void APIENTRY glDrawBuffers (GLsizei n, const GLenum *bufs); GLAPI void APIENTRY glStencilOpSeparate (GLenum face, GLenum sfail, GLenum dpfail, GLenum dppass); GLAPI void APIENTRY glStencilFuncSeparate (GLenum face, GLenum func, GLint ref, GLuint mask); GLAPI void APIENTRY glStencilMaskSeparate (GLenum face, GLuint mask); GLAPI void APIENTRY glAttachShader (GLuint program, GLuint shader); GLAPI void APIENTRY glBindAttribLocation (GLuint program, GLuint index, const GLchar *name); GLAPI void APIENTRY glCompileShader (GLuint shader); GLAPI GLuint APIENTRY glCreateProgram (void); GLAPI GLuint APIENTRY glCreateShader (GLenum type); GLAPI void APIENTRY glDeleteProgram (GLuint program); GLAPI void APIENTRY glDeleteShader (GLuint shader); GLAPI void APIENTRY glDetachShader (GLuint program, GLuint shader); GLAPI void APIENTRY glDisableVertexAttribArray (GLuint index); GLAPI void APIENTRY glEnableVertexAttribArray (GLuint index); GLAPI void APIENTRY glGetActiveAttrib (GLuint program, GLuint index, GLsizei bufSize, GLsizei *length, GLint *size, GLenum *type, GLchar *name); GLAPI void APIENTRY glGetActiveUniform (GLuint program, GLuint index, GLsizei bufSize, GLsizei *length, GLint *size, GLenum *type, GLchar *name); GLAPI void APIENTRY glGetAttachedShaders (GLuint program, GLsizei maxCount, GLsizei *count, GLuint *shaders); GLAPI GLint APIENTRY glGetAttribLocation (GLuint program, const GLchar *name); GLAPI void APIENTRY glGetProgramiv (GLuint program, GLenum pname, GLint *params); GLAPI void APIENTRY glGetProgramInfoLog (GLuint program, GLsizei bufSize, GLsizei *length, GLchar *infoLog); GLAPI void APIENTRY glGetShaderiv (GLuint shader, GLenum pname, GLint *params); GLAPI void APIENTRY glGetShaderInfoLog (GLuint shader, GLsizei bufSize, GLsizei *length, GLchar *infoLog); GLAPI void APIENTRY glGetShaderSource (GLuint shader, GLsizei bufSize, GLsizei *length, GLchar *source); GLAPI GLint APIENTRY glGetUniformLocation (GLuint program, const GLchar *name); GLAPI void APIENTRY glGetUniformfv (GLuint program, GLint location, GLfloat *params); GLAPI void APIENTRY glGetUniformiv (GLuint program, GLint location, GLint *params); GLAPI void APIENTRY glGetVertexAttribdv (GLuint index, GLenum pname, GLdouble *params); GLAPI void APIENTRY glGetVertexAttribfv (GLuint index, GLenum pname, GLfloat *params); GLAPI void APIENTRY glGetVertexAttribiv (GLuint index, GLenum pname, GLint *params); GLAPI void APIENTRY glGetVertexAttribPointerv (GLuint index, GLenum pname, void **pointer); GLAPI GLboolean APIENTRY glIsProgram (GLuint program); GLAPI GLboolean APIENTRY glIsShader (GLuint shader); GLAPI void APIENTRY glLinkProgram (GLuint program); GLAPI void APIENTRY glShaderSource (GLuint shader, GLsizei count, const GLchar *const*string, const GLint *length); GLAPI void APIENTRY glUseProgram (GLuint program); GLAPI void APIENTRY glUniform1f (GLint location, GLfloat v0); GLAPI void APIENTRY glUniform2f (GLint location, GLfloat v0, GLfloat v1); GLAPI void APIENTRY glUniform3f (GLint location, GLfloat v0, GLfloat v1, GLfloat v2); GLAPI void APIENTRY glUniform4f (GLint location, GLfloat v0, GLfloat v1, GLfloat v2, GLfloat v3); GLAPI void APIENTRY glUniform1i (GLint location, GLint v0); GLAPI void APIENTRY glUniform2i (GLint location, GLint v0, GLint v1); GLAPI void APIENTRY glUniform3i (GLint location, GLint v0, GLint v1, GLint v2); GLAPI void APIENTRY glUniform4i (GLint location, GLint v0, GLint v1, GLint v2, GLint v3); GLAPI void APIENTRY glUniform1fv (GLint location, GLsizei count, const GLfloat *value); GLAPI void APIENTRY glUniform2fv (GLint location, GLsizei count, const GLfloat *value); GLAPI void APIENTRY glUniform3fv (GLint location, GLsizei count, const GLfloat *value); GLAPI void APIENTRY glUniform4fv (GLint location, GLsizei count, const GLfloat *value); GLAPI void APIENTRY glUniform1iv (GLint location, GLsizei count, const GLint *value); GLAPI void APIENTRY glUniform2iv (GLint location, GLsizei count, const GLint *value); GLAPI void APIENTRY glUniform3iv (GLint location, GLsizei count, const GLint *value); GLAPI void APIENTRY glUniform4iv (GLint location, GLsizei count, const GLint *value); GLAPI void APIENTRY glUniformMatrix2fv (GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); GLAPI void APIENTRY glUniformMatrix3fv (GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); GLAPI void APIENTRY glUniformMatrix4fv (GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); GLAPI void APIENTRY glValidateProgram (GLuint program); GLAPI void APIENTRY glVertexAttrib1d (GLuint index, GLdouble x); GLAPI void APIENTRY glVertexAttrib1dv (GLuint index, const GLdouble *v); GLAPI void APIENTRY glVertexAttrib1f (GLuint index, GLfloat x); GLAPI void APIENTRY glVertexAttrib1fv (GLuint index, const GLfloat *v); GLAPI void APIENTRY glVertexAttrib1s (GLuint index, GLshort x); GLAPI void APIENTRY glVertexAttrib1sv (GLuint index, const GLshort *v); GLAPI void APIENTRY glVertexAttrib2d (GLuint index, GLdouble x, GLdouble y); GLAPI void APIENTRY glVertexAttrib2dv (GLuint index, const GLdouble *v); GLAPI void APIENTRY glVertexAttrib2f (GLuint index, GLfloat x, GLfloat y); GLAPI void APIENTRY glVertexAttrib2fv (GLuint index, const GLfloat *v); GLAPI void APIENTRY glVertexAttrib2s (GLuint index, GLshort x, GLshort y); GLAPI void APIENTRY glVertexAttrib2sv (GLuint index, const GLshort *v); GLAPI void APIENTRY glVertexAttrib3d (GLuint index, GLdouble x, GLdouble y, GLdouble z); GLAPI void APIENTRY glVertexAttrib3dv (GLuint index, const GLdouble *v); GLAPI void APIENTRY glVertexAttrib3f (GLuint index, GLfloat x, GLfloat y, GLfloat z); GLAPI void APIENTRY glVertexAttrib3fv (GLuint index, const GLfloat *v); GLAPI void APIENTRY glVertexAttrib3s (GLuint index, GLshort x, GLshort y, GLshort z); GLAPI void APIENTRY glVertexAttrib3sv (GLuint index, const GLshort *v); GLAPI void APIENTRY glVertexAttrib4Nbv (GLuint index, const GLbyte *v); GLAPI void APIENTRY glVertexAttrib4Niv (GLuint index, const GLint *v); GLAPI void APIENTRY glVertexAttrib4Nsv (GLuint index, const GLshort *v); GLAPI void APIENTRY glVertexAttrib4Nub (GLuint index, GLubyte x, GLubyte y, GLubyte z, GLubyte w); GLAPI void APIENTRY glVertexAttrib4Nubv (GLuint index, const GLubyte *v); GLAPI void APIENTRY glVertexAttrib4Nuiv (GLuint index, const GLuint *v); GLAPI void APIENTRY glVertexAttrib4Nusv (GLuint index, const GLushort *v); GLAPI void APIENTRY glVertexAttrib4bv (GLuint index, const GLbyte *v); GLAPI void APIENTRY glVertexAttrib4d (GLuint index, GLdouble x, GLdouble y, GLdouble z, GLdouble w); GLAPI void APIENTRY glVertexAttrib4dv (GLuint index, const GLdouble *v); GLAPI void APIENTRY glVertexAttrib4f (GLuint index, GLfloat x, GLfloat y, GLfloat z, GLfloat w); GLAPI void APIENTRY glVertexAttrib4fv (GLuint index, const GLfloat *v); GLAPI void APIENTRY glVertexAttrib4iv (GLuint index, const GLint *v); GLAPI void APIENTRY glVertexAttrib4s (GLuint index, GLshort x, GLshort y, GLshort z, GLshort w); GLAPI void APIENTRY glVertexAttrib4sv (GLuint index, const GLshort *v); GLAPI void APIENTRY glVertexAttrib4ubv (GLuint index, const GLubyte *v); GLAPI void APIENTRY glVertexAttrib4uiv (GLuint index, const GLuint *v); GLAPI void APIENTRY glVertexAttrib4usv (GLuint index, const GLushort *v); GLAPI void APIENTRY glVertexAttribPointer (GLuint index, GLint size, GLenum type, GLboolean normalized, GLsizei stride, const void *pointer); #endif #endif /* GL_VERSION_2_0 */ #ifndef GL_VERSION_2_1 #define GL_VERSION_2_1 1 #define GL_PIXEL_PACK_BUFFER 0x88EB #define GL_PIXEL_UNPACK_BUFFER 0x88EC #define GL_PIXEL_PACK_BUFFER_BINDING 0x88ED #define GL_PIXEL_UNPACK_BUFFER_BINDING 0x88EF #define GL_FLOAT_MAT2x3 0x8B65 #define GL_FLOAT_MAT2x4 0x8B66 #define GL_FLOAT_MAT3x2 0x8B67 #define GL_FLOAT_MAT3x4 0x8B68 #define GL_FLOAT_MAT4x2 0x8B69 #define GL_FLOAT_MAT4x3 0x8B6A #define GL_SRGB 0x8C40 #define GL_SRGB8 0x8C41 #define GL_SRGB_ALPHA 0x8C42 #define GL_SRGB8_ALPHA8 0x8C43 #define GL_COMPRESSED_SRGB 0x8C48 #define GL_COMPRESSED_SRGB_ALPHA 0x8C49 #define GL_CURRENT_RASTER_SECONDARY_COLOR 0x845F #define GL_SLUMINANCE_ALPHA 0x8C44 #define GL_SLUMINANCE8_ALPHA8 0x8C45 #define GL_SLUMINANCE 0x8C46 #define GL_SLUMINANCE8 0x8C47 #define GL_COMPRESSED_SLUMINANCE 0x8C4A #define GL_COMPRESSED_SLUMINANCE_ALPHA 0x8C4B typedef void (APIENTRYP PFNGLUNIFORMMATRIX2X3FVPROC) (GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); typedef void (APIENTRYP PFNGLUNIFORMMATRIX3X2FVPROC) (GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); typedef void (APIENTRYP PFNGLUNIFORMMATRIX2X4FVPROC) (GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); typedef void (APIENTRYP PFNGLUNIFORMMATRIX4X2FVPROC) (GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); typedef void (APIENTRYP PFNGLUNIFORMMATRIX3X4FVPROC) (GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); typedef void (APIENTRYP PFNGLUNIFORMMATRIX4X3FVPROC) (GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glUniformMatrix2x3fv (GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); GLAPI void APIENTRY glUniformMatrix3x2fv (GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); GLAPI void APIENTRY glUniformMatrix2x4fv (GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); GLAPI void APIENTRY glUniformMatrix4x2fv (GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); GLAPI void APIENTRY glUniformMatrix3x4fv (GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); GLAPI void APIENTRY glUniformMatrix4x3fv (GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); #endif #endif /* GL_VERSION_2_1 */ #ifndef GL_VERSION_3_0 #define GL_VERSION_3_0 1 typedef unsigned short GLhalf; #define GL_COMPARE_REF_TO_TEXTURE 0x884E #define GL_CLIP_DISTANCE0 0x3000 #define GL_CLIP_DISTANCE1 0x3001 #define GL_CLIP_DISTANCE2 0x3002 #define GL_CLIP_DISTANCE3 0x3003 #define GL_CLIP_DISTANCE4 0x3004 #define GL_CLIP_DISTANCE5 0x3005 #define GL_CLIP_DISTANCE6 0x3006 #define GL_CLIP_DISTANCE7 0x3007 #define GL_MAX_CLIP_DISTANCES 0x0D32 #define GL_MAJOR_VERSION 0x821B #define GL_MINOR_VERSION 0x821C #define GL_NUM_EXTENSIONS 0x821D #define GL_CONTEXT_FLAGS 0x821E #define GL_COMPRESSED_RED 0x8225 #define GL_COMPRESSED_RG 0x8226 #define GL_CONTEXT_FLAG_FORWARD_COMPATIBLE_BIT 0x00000001 #define GL_RGBA32F 0x8814 #define GL_RGB32F 0x8815 #define GL_RGBA16F 0x881A #define GL_RGB16F 0x881B #define GL_VERTEX_ATTRIB_ARRAY_INTEGER 0x88FD #define GL_MAX_ARRAY_TEXTURE_LAYERS 0x88FF #define GL_MIN_PROGRAM_TEXEL_OFFSET 0x8904 #define GL_MAX_PROGRAM_TEXEL_OFFSET 0x8905 #define GL_CLAMP_READ_COLOR 0x891C #define GL_FIXED_ONLY 0x891D #define GL_MAX_VARYING_COMPONENTS 0x8B4B #define GL_TEXTURE_1D_ARRAY 0x8C18 #define GL_PROXY_TEXTURE_1D_ARRAY 0x8C19 #define GL_TEXTURE_2D_ARRAY 0x8C1A #define GL_PROXY_TEXTURE_2D_ARRAY 0x8C1B #define GL_TEXTURE_BINDING_1D_ARRAY 0x8C1C #define GL_TEXTURE_BINDING_2D_ARRAY 0x8C1D #define GL_R11F_G11F_B10F 0x8C3A #define GL_UNSIGNED_INT_10F_11F_11F_REV 0x8C3B #define GL_RGB9_E5 0x8C3D #define GL_UNSIGNED_INT_5_9_9_9_REV 0x8C3E #define GL_TEXTURE_SHARED_SIZE 0x8C3F #define GL_TRANSFORM_FEEDBACK_VARYING_MAX_LENGTH 0x8C76 #define GL_TRANSFORM_FEEDBACK_BUFFER_MODE 0x8C7F #define GL_MAX_TRANSFORM_FEEDBACK_SEPARATE_COMPONENTS 0x8C80 #define GL_TRANSFORM_FEEDBACK_VARYINGS 0x8C83 #define GL_TRANSFORM_FEEDBACK_BUFFER_START 0x8C84 #define GL_TRANSFORM_FEEDBACK_BUFFER_SIZE 0x8C85 #define GL_PRIMITIVES_GENERATED 0x8C87 #define GL_TRANSFORM_FEEDBACK_PRIMITIVES_WRITTEN 0x8C88 #define GL_RASTERIZER_DISCARD 0x8C89 #define GL_MAX_TRANSFORM_FEEDBACK_INTERLEAVED_COMPONENTS 0x8C8A #define GL_MAX_TRANSFORM_FEEDBACK_SEPARATE_ATTRIBS 0x8C8B #define GL_INTERLEAVED_ATTRIBS 0x8C8C #define GL_SEPARATE_ATTRIBS 0x8C8D #define GL_TRANSFORM_FEEDBACK_BUFFER 0x8C8E #define GL_TRANSFORM_FEEDBACK_BUFFER_BINDING 0x8C8F #define GL_RGBA32UI 0x8D70 #define GL_RGB32UI 0x8D71 #define GL_RGBA16UI 0x8D76 #define GL_RGB16UI 0x8D77 #define GL_RGBA8UI 0x8D7C #define GL_RGB8UI 0x8D7D #define GL_RGBA32I 0x8D82 #define GL_RGB32I 0x8D83 #define GL_RGBA16I 0x8D88 #define GL_RGB16I 0x8D89 #define GL_RGBA8I 0x8D8E #define GL_RGB8I 0x8D8F #define GL_RED_INTEGER 0x8D94 #define GL_GREEN_INTEGER 0x8D95 #define GL_BLUE_INTEGER 0x8D96 #define GL_RGB_INTEGER 0x8D98 #define GL_RGBA_INTEGER 0x8D99 #define GL_BGR_INTEGER 0x8D9A #define GL_BGRA_INTEGER 0x8D9B #define GL_SAMPLER_1D_ARRAY 0x8DC0 #define GL_SAMPLER_2D_ARRAY 0x8DC1 #define GL_SAMPLER_1D_ARRAY_SHADOW 0x8DC3 #define GL_SAMPLER_2D_ARRAY_SHADOW 0x8DC4 #define GL_SAMPLER_CUBE_SHADOW 0x8DC5 #define GL_UNSIGNED_INT_VEC2 0x8DC6 #define GL_UNSIGNED_INT_VEC3 0x8DC7 #define GL_UNSIGNED_INT_VEC4 0x8DC8 #define GL_INT_SAMPLER_1D 0x8DC9 #define GL_INT_SAMPLER_2D 0x8DCA #define GL_INT_SAMPLER_3D 0x8DCB #define GL_INT_SAMPLER_CUBE 0x8DCC #define GL_INT_SAMPLER_1D_ARRAY 0x8DCE #define GL_INT_SAMPLER_2D_ARRAY 0x8DCF #define GL_UNSIGNED_INT_SAMPLER_1D 0x8DD1 #define GL_UNSIGNED_INT_SAMPLER_2D 0x8DD2 #define GL_UNSIGNED_INT_SAMPLER_3D 0x8DD3 #define GL_UNSIGNED_INT_SAMPLER_CUBE 0x8DD4 #define GL_UNSIGNED_INT_SAMPLER_1D_ARRAY 0x8DD6 #define GL_UNSIGNED_INT_SAMPLER_2D_ARRAY 0x8DD7 #define GL_QUERY_WAIT 0x8E13 #define GL_QUERY_NO_WAIT 0x8E14 #define GL_QUERY_BY_REGION_WAIT 0x8E15 #define GL_QUERY_BY_REGION_NO_WAIT 0x8E16 #define GL_BUFFER_ACCESS_FLAGS 0x911F #define GL_BUFFER_MAP_LENGTH 0x9120 #define GL_BUFFER_MAP_OFFSET 0x9121 #define GL_DEPTH_COMPONENT32F 0x8CAC #define GL_DEPTH32F_STENCIL8 0x8CAD #define GL_FLOAT_32_UNSIGNED_INT_24_8_REV 0x8DAD #define GL_INVALID_FRAMEBUFFER_OPERATION 0x0506 #define GL_FRAMEBUFFER_ATTACHMENT_COLOR_ENCODING 0x8210 #define GL_FRAMEBUFFER_ATTACHMENT_COMPONENT_TYPE 0x8211 #define GL_FRAMEBUFFER_ATTACHMENT_RED_SIZE 0x8212 #define GL_FRAMEBUFFER_ATTACHMENT_GREEN_SIZE 0x8213 #define GL_FRAMEBUFFER_ATTACHMENT_BLUE_SIZE 0x8214 #define GL_FRAMEBUFFER_ATTACHMENT_ALPHA_SIZE 0x8215 #define GL_FRAMEBUFFER_ATTACHMENT_DEPTH_SIZE 0x8216 #define GL_FRAMEBUFFER_ATTACHMENT_STENCIL_SIZE 0x8217 #define GL_FRAMEBUFFER_DEFAULT 0x8218 #define GL_FRAMEBUFFER_UNDEFINED 0x8219 #define GL_DEPTH_STENCIL_ATTACHMENT 0x821A #define GL_MAX_RENDERBUFFER_SIZE 0x84E8 #define GL_DEPTH_STENCIL 0x84F9 #define GL_UNSIGNED_INT_24_8 0x84FA #define GL_DEPTH24_STENCIL8 0x88F0 #define GL_TEXTURE_STENCIL_SIZE 0x88F1 #define GL_TEXTURE_RED_TYPE 0x8C10 #define GL_TEXTURE_GREEN_TYPE 0x8C11 #define GL_TEXTURE_BLUE_TYPE 0x8C12 #define GL_TEXTURE_ALPHA_TYPE 0x8C13 #define GL_TEXTURE_DEPTH_TYPE 0x8C16 #define GL_UNSIGNED_NORMALIZED 0x8C17 #define GL_FRAMEBUFFER_BINDING 0x8CA6 #define GL_DRAW_FRAMEBUFFER_BINDING 0x8CA6 #define GL_RENDERBUFFER_BINDING 0x8CA7 #define GL_READ_FRAMEBUFFER 0x8CA8 #define GL_DRAW_FRAMEBUFFER 0x8CA9 #define GL_READ_FRAMEBUFFER_BINDING 0x8CAA #define GL_RENDERBUFFER_SAMPLES 0x8CAB #define GL_FRAMEBUFFER_ATTACHMENT_OBJECT_TYPE 0x8CD0 #define GL_FRAMEBUFFER_ATTACHMENT_OBJECT_NAME 0x8CD1 #define GL_FRAMEBUFFER_ATTACHMENT_TEXTURE_LEVEL 0x8CD2 #define GL_FRAMEBUFFER_ATTACHMENT_TEXTURE_CUBE_MAP_FACE 0x8CD3 #define GL_FRAMEBUFFER_ATTACHMENT_TEXTURE_LAYER 0x8CD4 #define GL_FRAMEBUFFER_COMPLETE 0x8CD5 #define GL_FRAMEBUFFER_INCOMPLETE_ATTACHMENT 0x8CD6 #define GL_FRAMEBUFFER_INCOMPLETE_MISSING_ATTACHMENT 0x8CD7 #define GL_FRAMEBUFFER_INCOMPLETE_DRAW_BUFFER 0x8CDB #define GL_FRAMEBUFFER_INCOMPLETE_READ_BUFFER 0x8CDC #define GL_FRAMEBUFFER_UNSUPPORTED 0x8CDD #define GL_MAX_COLOR_ATTACHMENTS 0x8CDF #define GL_COLOR_ATTACHMENT0 0x8CE0 #define GL_COLOR_ATTACHMENT1 0x8CE1 #define GL_COLOR_ATTACHMENT2 0x8CE2 #define GL_COLOR_ATTACHMENT3 0x8CE3 #define GL_COLOR_ATTACHMENT4 0x8CE4 #define GL_COLOR_ATTACHMENT5 0x8CE5 #define GL_COLOR_ATTACHMENT6 0x8CE6 #define GL_COLOR_ATTACHMENT7 0x8CE7 #define GL_COLOR_ATTACHMENT8 0x8CE8 #define GL_COLOR_ATTACHMENT9 0x8CE9 #define GL_COLOR_ATTACHMENT10 0x8CEA #define GL_COLOR_ATTACHMENT11 0x8CEB #define GL_COLOR_ATTACHMENT12 0x8CEC #define GL_COLOR_ATTACHMENT13 0x8CED #define GL_COLOR_ATTACHMENT14 0x8CEE #define GL_COLOR_ATTACHMENT15 0x8CEF #define GL_DEPTH_ATTACHMENT 0x8D00 #define GL_STENCIL_ATTACHMENT 0x8D20 #define GL_FRAMEBUFFER 0x8D40 #define GL_RENDERBUFFER 0x8D41 #define GL_RENDERBUFFER_WIDTH 0x8D42 #define GL_RENDERBUFFER_HEIGHT 0x8D43 #define GL_RENDERBUFFER_INTERNAL_FORMAT 0x8D44 #define GL_STENCIL_INDEX1 0x8D46 #define GL_STENCIL_INDEX4 0x8D47 #define GL_STENCIL_INDEX8 0x8D48 #define GL_STENCIL_INDEX16 0x8D49 #define GL_RENDERBUFFER_RED_SIZE 0x8D50 #define GL_RENDERBUFFER_GREEN_SIZE 0x8D51 #define GL_RENDERBUFFER_BLUE_SIZE 0x8D52 #define GL_RENDERBUFFER_ALPHA_SIZE 0x8D53 #define GL_RENDERBUFFER_DEPTH_SIZE 0x8D54 #define GL_RENDERBUFFER_STENCIL_SIZE 0x8D55 #define GL_FRAMEBUFFER_INCOMPLETE_MULTISAMPLE 0x8D56 #define GL_MAX_SAMPLES 0x8D57 #define GL_INDEX 0x8222 #define GL_TEXTURE_LUMINANCE_TYPE 0x8C14 #define GL_TEXTURE_INTENSITY_TYPE 0x8C15 #define GL_FRAMEBUFFER_SRGB 0x8DB9 #define GL_HALF_FLOAT 0x140B #define GL_MAP_READ_BIT 0x0001 #define GL_MAP_WRITE_BIT 0x0002 #define GL_MAP_INVALIDATE_RANGE_BIT 0x0004 #define GL_MAP_INVALIDATE_BUFFER_BIT 0x0008 #define GL_MAP_FLUSH_EXPLICIT_BIT 0x0010 #define GL_MAP_UNSYNCHRONIZED_BIT 0x0020 #define GL_COMPRESSED_RED_RGTC1 0x8DBB #define GL_COMPRESSED_SIGNED_RED_RGTC1 0x8DBC #define GL_COMPRESSED_RG_RGTC2 0x8DBD #define GL_COMPRESSED_SIGNED_RG_RGTC2 0x8DBE #define GL_RG 0x8227 #define GL_RG_INTEGER 0x8228 #define GL_R8 0x8229 #define GL_R16 0x822A #define GL_RG8 0x822B #define GL_RG16 0x822C #define GL_R16F 0x822D #define GL_R32F 0x822E #define GL_RG16F 0x822F #define GL_RG32F 0x8230 #define GL_R8I 0x8231 #define GL_R8UI 0x8232 #define GL_R16I 0x8233 #define GL_R16UI 0x8234 #define GL_R32I 0x8235 #define GL_R32UI 0x8236 #define GL_RG8I 0x8237 #define GL_RG8UI 0x8238 #define GL_RG16I 0x8239 #define GL_RG16UI 0x823A #define GL_RG32I 0x823B #define GL_RG32UI 0x823C #define GL_VERTEX_ARRAY_BINDING 0x85B5 #define GL_CLAMP_VERTEX_COLOR 0x891A #define GL_CLAMP_FRAGMENT_COLOR 0x891B #define GL_ALPHA_INTEGER 0x8D97 typedef void (APIENTRYP PFNGLCOLORMASKIPROC) (GLuint index, GLboolean r, GLboolean g, GLboolean b, GLboolean a); typedef void (APIENTRYP PFNGLGETBOOLEANI_VPROC) (GLenum target, GLuint index, GLboolean *data); typedef void (APIENTRYP PFNGLGETINTEGERI_VPROC) (GLenum target, GLuint index, GLint *data); typedef void (APIENTRYP PFNGLENABLEIPROC) (GLenum target, GLuint index); typedef void (APIENTRYP PFNGLDISABLEIPROC) (GLenum target, GLuint index); typedef GLboolean (APIENTRYP PFNGLISENABLEDIPROC) (GLenum target, GLuint index); typedef void (APIENTRYP PFNGLBEGINTRANSFORMFEEDBACKPROC) (GLenum primitiveMode); typedef void (APIENTRYP PFNGLENDTRANSFORMFEEDBACKPROC) (void); typedef void (APIENTRYP PFNGLBINDBUFFERRANGEPROC) (GLenum target, GLuint index, GLuint buffer, GLintptr offset, GLsizeiptr size); typedef void (APIENTRYP PFNGLBINDBUFFERBASEPROC) (GLenum target, GLuint index, GLuint buffer); typedef void (APIENTRYP PFNGLTRANSFORMFEEDBACKVARYINGSPROC) (GLuint program, GLsizei count, const GLchar *const*varyings, GLenum bufferMode); typedef void (APIENTRYP PFNGLGETTRANSFORMFEEDBACKVARYINGPROC) (GLuint program, GLuint index, GLsizei bufSize, GLsizei *length, GLsizei *size, GLenum *type, GLchar *name); typedef void (APIENTRYP PFNGLCLAMPCOLORPROC) (GLenum target, GLenum clamp); typedef void (APIENTRYP PFNGLBEGINCONDITIONALRENDERPROC) (GLuint id, GLenum mode); typedef void (APIENTRYP PFNGLENDCONDITIONALRENDERPROC) (void); typedef void (APIENTRYP PFNGLVERTEXATTRIBIPOINTERPROC) (GLuint index, GLint size, GLenum type, GLsizei stride, const void *pointer); typedef void (APIENTRYP PFNGLGETVERTEXATTRIBIIVPROC) (GLuint index, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGETVERTEXATTRIBIUIVPROC) (GLuint index, GLenum pname, GLuint *params); typedef void (APIENTRYP PFNGLVERTEXATTRIBI1IPROC) (GLuint index, GLint x); typedef void (APIENTRYP PFNGLVERTEXATTRIBI2IPROC) (GLuint index, GLint x, GLint y); typedef void (APIENTRYP PFNGLVERTEXATTRIBI3IPROC) (GLuint index, GLint x, GLint y, GLint z); typedef void (APIENTRYP PFNGLVERTEXATTRIBI4IPROC) (GLuint index, GLint x, GLint y, GLint z, GLint w); typedef void (APIENTRYP PFNGLVERTEXATTRIBI1UIPROC) (GLuint index, GLuint x); typedef void (APIENTRYP PFNGLVERTEXATTRIBI2UIPROC) (GLuint index, GLuint x, GLuint y); typedef void (APIENTRYP PFNGLVERTEXATTRIBI3UIPROC) (GLuint index, GLuint x, GLuint y, GLuint z); typedef void (APIENTRYP PFNGLVERTEXATTRIBI4UIPROC) (GLuint index, GLuint x, GLuint y, GLuint z, GLuint w); typedef void (APIENTRYP PFNGLVERTEXATTRIBI1IVPROC) (GLuint index, const GLint *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBI2IVPROC) (GLuint index, const GLint *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBI3IVPROC) (GLuint index, const GLint *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBI4IVPROC) (GLuint index, const GLint *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBI1UIVPROC) (GLuint index, const GLuint *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBI2UIVPROC) (GLuint index, const GLuint *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBI3UIVPROC) (GLuint index, const GLuint *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBI4UIVPROC) (GLuint index, const GLuint *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBI4BVPROC) (GLuint index, const GLbyte *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBI4SVPROC) (GLuint index, const GLshort *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBI4UBVPROC) (GLuint index, const GLubyte *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBI4USVPROC) (GLuint index, const GLushort *v); typedef void (APIENTRYP PFNGLGETUNIFORMUIVPROC) (GLuint program, GLint location, GLuint *params); typedef void (APIENTRYP PFNGLBINDFRAGDATALOCATIONPROC) (GLuint program, GLuint color, const GLchar *name); typedef GLint (APIENTRYP PFNGLGETFRAGDATALOCATIONPROC) (GLuint program, const GLchar *name); typedef void (APIENTRYP PFNGLUNIFORM1UIPROC) (GLint location, GLuint v0); typedef void (APIENTRYP PFNGLUNIFORM2UIPROC) (GLint location, GLuint v0, GLuint v1); typedef void (APIENTRYP PFNGLUNIFORM3UIPROC) (GLint location, GLuint v0, GLuint v1, GLuint v2); typedef void (APIENTRYP PFNGLUNIFORM4UIPROC) (GLint location, GLuint v0, GLuint v1, GLuint v2, GLuint v3); typedef void (APIENTRYP PFNGLUNIFORM1UIVPROC) (GLint location, GLsizei count, const GLuint *value); typedef void (APIENTRYP PFNGLUNIFORM2UIVPROC) (GLint location, GLsizei count, const GLuint *value); typedef void (APIENTRYP PFNGLUNIFORM3UIVPROC) (GLint location, GLsizei count, const GLuint *value); typedef void (APIENTRYP PFNGLUNIFORM4UIVPROC) (GLint location, GLsizei count, const GLuint *value); typedef void (APIENTRYP PFNGLTEXPARAMETERIIVPROC) (GLenum target, GLenum pname, const GLint *params); typedef void (APIENTRYP PFNGLTEXPARAMETERIUIVPROC) (GLenum target, GLenum pname, const GLuint *params); typedef void (APIENTRYP PFNGLGETTEXPARAMETERIIVPROC) (GLenum target, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGETTEXPARAMETERIUIVPROC) (GLenum target, GLenum pname, GLuint *params); typedef void (APIENTRYP PFNGLCLEARBUFFERIVPROC) (GLenum buffer, GLint drawbuffer, const GLint *value); typedef void (APIENTRYP PFNGLCLEARBUFFERUIVPROC) (GLenum buffer, GLint drawbuffer, const GLuint *value); typedef void (APIENTRYP PFNGLCLEARBUFFERFVPROC) (GLenum buffer, GLint drawbuffer, const GLfloat *value); typedef void (APIENTRYP PFNGLCLEARBUFFERFIPROC) (GLenum buffer, GLint drawbuffer, GLfloat depth, GLint stencil); typedef const GLubyte *(APIENTRYP PFNGLGETSTRINGIPROC) (GLenum name, GLuint index); typedef GLboolean (APIENTRYP PFNGLISRENDERBUFFERPROC) (GLuint renderbuffer); typedef void (APIENTRYP PFNGLBINDRENDERBUFFERPROC) (GLenum target, GLuint renderbuffer); typedef void (APIENTRYP PFNGLDELETERENDERBUFFERSPROC) (GLsizei n, const GLuint *renderbuffers); typedef void (APIENTRYP PFNGLGENRENDERBUFFERSPROC) (GLsizei n, GLuint *renderbuffers); typedef void (APIENTRYP PFNGLRENDERBUFFERSTORAGEPROC) (GLenum target, GLenum internalformat, GLsizei width, GLsizei height); typedef void (APIENTRYP PFNGLGETRENDERBUFFERPARAMETERIVPROC) (GLenum target, GLenum pname, GLint *params); typedef GLboolean (APIENTRYP PFNGLISFRAMEBUFFERPROC) (GLuint framebuffer); typedef void (APIENTRYP PFNGLBINDFRAMEBUFFERPROC) (GLenum target, GLuint framebuffer); typedef void (APIENTRYP PFNGLDELETEFRAMEBUFFERSPROC) (GLsizei n, const GLuint *framebuffers); typedef void (APIENTRYP PFNGLGENFRAMEBUFFERSPROC) (GLsizei n, GLuint *framebuffers); typedef GLenum (APIENTRYP PFNGLCHECKFRAMEBUFFERSTATUSPROC) (GLenum target); typedef void (APIENTRYP PFNGLFRAMEBUFFERTEXTURE1DPROC) (GLenum target, GLenum attachment, GLenum textarget, GLuint texture, GLint level); typedef void (APIENTRYP PFNGLFRAMEBUFFERTEXTURE2DPROC) (GLenum target, GLenum attachment, GLenum textarget, GLuint texture, GLint level); typedef void (APIENTRYP PFNGLFRAMEBUFFERTEXTURE3DPROC) (GLenum target, GLenum attachment, GLenum textarget, GLuint texture, GLint level, GLint zoffset); typedef void (APIENTRYP PFNGLFRAMEBUFFERRENDERBUFFERPROC) (GLenum target, GLenum attachment, GLenum renderbuffertarget, GLuint renderbuffer); typedef void (APIENTRYP PFNGLGETFRAMEBUFFERATTACHMENTPARAMETERIVPROC) (GLenum target, GLenum attachment, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGENERATEMIPMAPPROC) (GLenum target); typedef void (APIENTRYP PFNGLBLITFRAMEBUFFERPROC) (GLint srcX0, GLint srcY0, GLint srcX1, GLint srcY1, GLint dstX0, GLint dstY0, GLint dstX1, GLint dstY1, GLbitfield mask, GLenum filter); typedef void (APIENTRYP PFNGLRENDERBUFFERSTORAGEMULTISAMPLEPROC) (GLenum target, GLsizei samples, GLenum internalformat, GLsizei width, GLsizei height); typedef void (APIENTRYP PFNGLFRAMEBUFFERTEXTURELAYERPROC) (GLenum target, GLenum attachment, GLuint texture, GLint level, GLint layer); typedef void *(APIENTRYP PFNGLMAPBUFFERRANGEPROC) (GLenum target, GLintptr offset, GLsizeiptr length, GLbitfield access); typedef void (APIENTRYP PFNGLFLUSHMAPPEDBUFFERRANGEPROC) (GLenum target, GLintptr offset, GLsizeiptr length); typedef void (APIENTRYP PFNGLBINDVERTEXARRAYPROC) (GLuint array); typedef void (APIENTRYP PFNGLDELETEVERTEXARRAYSPROC) (GLsizei n, const GLuint *arrays); typedef void (APIENTRYP PFNGLGENVERTEXARRAYSPROC) (GLsizei n, GLuint *arrays); typedef GLboolean (APIENTRYP PFNGLISVERTEXARRAYPROC) (GLuint array); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glColorMaski (GLuint index, GLboolean r, GLboolean g, GLboolean b, GLboolean a); GLAPI void APIENTRY glGetBooleani_v (GLenum target, GLuint index, GLboolean *data); GLAPI void APIENTRY glGetIntegeri_v (GLenum target, GLuint index, GLint *data); GLAPI void APIENTRY glEnablei (GLenum target, GLuint index); GLAPI void APIENTRY glDisablei (GLenum target, GLuint index); GLAPI GLboolean APIENTRY glIsEnabledi (GLenum target, GLuint index); GLAPI void APIENTRY glBeginTransformFeedback (GLenum primitiveMode); GLAPI void APIENTRY glEndTransformFeedback (void); GLAPI void APIENTRY glBindBufferRange (GLenum target, GLuint index, GLuint buffer, GLintptr offset, GLsizeiptr size); GLAPI void APIENTRY glBindBufferBase (GLenum target, GLuint index, GLuint buffer); GLAPI void APIENTRY glTransformFeedbackVaryings (GLuint program, GLsizei count, const GLchar *const*varyings, GLenum bufferMode); GLAPI void APIENTRY glGetTransformFeedbackVarying (GLuint program, GLuint index, GLsizei bufSize, GLsizei *length, GLsizei *size, GLenum *type, GLchar *name); GLAPI void APIENTRY glClampColor (GLenum target, GLenum clamp); GLAPI void APIENTRY glBeginConditionalRender (GLuint id, GLenum mode); GLAPI void APIENTRY glEndConditionalRender (void); GLAPI void APIENTRY glVertexAttribIPointer (GLuint index, GLint size, GLenum type, GLsizei stride, const void *pointer); GLAPI void APIENTRY glGetVertexAttribIiv (GLuint index, GLenum pname, GLint *params); GLAPI void APIENTRY glGetVertexAttribIuiv (GLuint index, GLenum pname, GLuint *params); GLAPI void APIENTRY glVertexAttribI1i (GLuint index, GLint x); GLAPI void APIENTRY glVertexAttribI2i (GLuint index, GLint x, GLint y); GLAPI void APIENTRY glVertexAttribI3i (GLuint index, GLint x, GLint y, GLint z); GLAPI void APIENTRY glVertexAttribI4i (GLuint index, GLint x, GLint y, GLint z, GLint w); GLAPI void APIENTRY glVertexAttribI1ui (GLuint index, GLuint x); GLAPI void APIENTRY glVertexAttribI2ui (GLuint index, GLuint x, GLuint y); GLAPI void APIENTRY glVertexAttribI3ui (GLuint index, GLuint x, GLuint y, GLuint z); GLAPI void APIENTRY glVertexAttribI4ui (GLuint index, GLuint x, GLuint y, GLuint z, GLuint w); GLAPI void APIENTRY glVertexAttribI1iv (GLuint index, const GLint *v); GLAPI void APIENTRY glVertexAttribI2iv (GLuint index, const GLint *v); GLAPI void APIENTRY glVertexAttribI3iv (GLuint index, const GLint *v); GLAPI void APIENTRY glVertexAttribI4iv (GLuint index, const GLint *v); GLAPI void APIENTRY glVertexAttribI1uiv (GLuint index, const GLuint *v); GLAPI void APIENTRY glVertexAttribI2uiv (GLuint index, const GLuint *v); GLAPI void APIENTRY glVertexAttribI3uiv (GLuint index, const GLuint *v); GLAPI void APIENTRY glVertexAttribI4uiv (GLuint index, const GLuint *v); GLAPI void APIENTRY glVertexAttribI4bv (GLuint index, const GLbyte *v); GLAPI void APIENTRY glVertexAttribI4sv (GLuint index, const GLshort *v); GLAPI void APIENTRY glVertexAttribI4ubv (GLuint index, const GLubyte *v); GLAPI void APIENTRY glVertexAttribI4usv (GLuint index, const GLushort *v); GLAPI void APIENTRY glGetUniformuiv (GLuint program, GLint location, GLuint *params); GLAPI void APIENTRY glBindFragDataLocation (GLuint program, GLuint color, const GLchar *name); GLAPI GLint APIENTRY glGetFragDataLocation (GLuint program, const GLchar *name); GLAPI void APIENTRY glUniform1ui (GLint location, GLuint v0); GLAPI void APIENTRY glUniform2ui (GLint location, GLuint v0, GLuint v1); GLAPI void APIENTRY glUniform3ui (GLint location, GLuint v0, GLuint v1, GLuint v2); GLAPI void APIENTRY glUniform4ui (GLint location, GLuint v0, GLuint v1, GLuint v2, GLuint v3); GLAPI void APIENTRY glUniform1uiv (GLint location, GLsizei count, const GLuint *value); GLAPI void APIENTRY glUniform2uiv (GLint location, GLsizei count, const GLuint *value); GLAPI void APIENTRY glUniform3uiv (GLint location, GLsizei count, const GLuint *value); GLAPI void APIENTRY glUniform4uiv (GLint location, GLsizei count, const GLuint *value); GLAPI void APIENTRY glTexParameterIiv (GLenum target, GLenum pname, const GLint *params); GLAPI void APIENTRY glTexParameterIuiv (GLenum target, GLenum pname, const GLuint *params); GLAPI void APIENTRY glGetTexParameterIiv (GLenum target, GLenum pname, GLint *params); GLAPI void APIENTRY glGetTexParameterIuiv (GLenum target, GLenum pname, GLuint *params); GLAPI void APIENTRY glClearBufferiv (GLenum buffer, GLint drawbuffer, const GLint *value); GLAPI void APIENTRY glClearBufferuiv (GLenum buffer, GLint drawbuffer, const GLuint *value); GLAPI void APIENTRY glClearBufferfv (GLenum buffer, GLint drawbuffer, const GLfloat *value); GLAPI void APIENTRY glClearBufferfi (GLenum buffer, GLint drawbuffer, GLfloat depth, GLint stencil); GLAPI const GLubyte *APIENTRY glGetStringi (GLenum name, GLuint index); GLAPI GLboolean APIENTRY glIsRenderbuffer (GLuint renderbuffer); GLAPI void APIENTRY glBindRenderbuffer (GLenum target, GLuint renderbuffer); GLAPI void APIENTRY glDeleteRenderbuffers (GLsizei n, const GLuint *renderbuffers); GLAPI void APIENTRY glGenRenderbuffers (GLsizei n, GLuint *renderbuffers); GLAPI void APIENTRY glRenderbufferStorage (GLenum target, GLenum internalformat, GLsizei width, GLsizei height); GLAPI void APIENTRY glGetRenderbufferParameteriv (GLenum target, GLenum pname, GLint *params); GLAPI GLboolean APIENTRY glIsFramebuffer (GLuint framebuffer); GLAPI void APIENTRY glBindFramebuffer (GLenum target, GLuint framebuffer); GLAPI void APIENTRY glDeleteFramebuffers (GLsizei n, const GLuint *framebuffers); GLAPI void APIENTRY glGenFramebuffers (GLsizei n, GLuint *framebuffers); GLAPI GLenum APIENTRY glCheckFramebufferStatus (GLenum target); GLAPI void APIENTRY glFramebufferTexture1D (GLenum target, GLenum attachment, GLenum textarget, GLuint texture, GLint level); GLAPI void APIENTRY glFramebufferTexture2D (GLenum target, GLenum attachment, GLenum textarget, GLuint texture, GLint level); GLAPI void APIENTRY glFramebufferTexture3D (GLenum target, GLenum attachment, GLenum textarget, GLuint texture, GLint level, GLint zoffset); GLAPI void APIENTRY glFramebufferRenderbuffer (GLenum target, GLenum attachment, GLenum renderbuffertarget, GLuint renderbuffer); GLAPI void APIENTRY glGetFramebufferAttachmentParameteriv (GLenum target, GLenum attachment, GLenum pname, GLint *params); GLAPI void APIENTRY glGenerateMipmap (GLenum target); GLAPI void APIENTRY glBlitFramebuffer (GLint srcX0, GLint srcY0, GLint srcX1, GLint srcY1, GLint dstX0, GLint dstY0, GLint dstX1, GLint dstY1, GLbitfield mask, GLenum filter); GLAPI void APIENTRY glRenderbufferStorageMultisample (GLenum target, GLsizei samples, GLenum internalformat, GLsizei width, GLsizei height); GLAPI void APIENTRY glFramebufferTextureLayer (GLenum target, GLenum attachment, GLuint texture, GLint level, GLint layer); GLAPI void *APIENTRY glMapBufferRange (GLenum target, GLintptr offset, GLsizeiptr length, GLbitfield access); GLAPI void APIENTRY glFlushMappedBufferRange (GLenum target, GLintptr offset, GLsizeiptr length); GLAPI void APIENTRY glBindVertexArray (GLuint array); GLAPI void APIENTRY glDeleteVertexArrays (GLsizei n, const GLuint *arrays); GLAPI void APIENTRY glGenVertexArrays (GLsizei n, GLuint *arrays); GLAPI GLboolean APIENTRY glIsVertexArray (GLuint array); #endif #endif /* GL_VERSION_3_0 */ #ifndef GL_VERSION_3_1 #define GL_VERSION_3_1 1 #define GL_SAMPLER_2D_RECT 0x8B63 #define GL_SAMPLER_2D_RECT_SHADOW 0x8B64 #define GL_SAMPLER_BUFFER 0x8DC2 #define GL_INT_SAMPLER_2D_RECT 0x8DCD #define GL_INT_SAMPLER_BUFFER 0x8DD0 #define GL_UNSIGNED_INT_SAMPLER_2D_RECT 0x8DD5 #define GL_UNSIGNED_INT_SAMPLER_BUFFER 0x8DD8 #define GL_TEXTURE_BUFFER 0x8C2A #define GL_MAX_TEXTURE_BUFFER_SIZE 0x8C2B #define GL_TEXTURE_BINDING_BUFFER 0x8C2C #define GL_TEXTURE_BUFFER_DATA_STORE_BINDING 0x8C2D #define GL_TEXTURE_RECTANGLE 0x84F5 #define GL_TEXTURE_BINDING_RECTANGLE 0x84F6 #define GL_PROXY_TEXTURE_RECTANGLE 0x84F7 #define GL_MAX_RECTANGLE_TEXTURE_SIZE 0x84F8 #define GL_R8_SNORM 0x8F94 #define GL_RG8_SNORM 0x8F95 #define GL_RGB8_SNORM 0x8F96 #define GL_RGBA8_SNORM 0x8F97 #define GL_R16_SNORM 0x8F98 #define GL_RG16_SNORM 0x8F99 #define GL_RGB16_SNORM 0x8F9A #define GL_RGBA16_SNORM 0x8F9B #define GL_SIGNED_NORMALIZED 0x8F9C #define GL_PRIMITIVE_RESTART 0x8F9D #define GL_PRIMITIVE_RESTART_INDEX 0x8F9E #define GL_COPY_READ_BUFFER 0x8F36 #define GL_COPY_WRITE_BUFFER 0x8F37 #define GL_UNIFORM_BUFFER 0x8A11 #define GL_UNIFORM_BUFFER_BINDING 0x8A28 #define GL_UNIFORM_BUFFER_START 0x8A29 #define GL_UNIFORM_BUFFER_SIZE 0x8A2A #define GL_MAX_VERTEX_UNIFORM_BLOCKS 0x8A2B #define GL_MAX_FRAGMENT_UNIFORM_BLOCKS 0x8A2D #define GL_MAX_COMBINED_UNIFORM_BLOCKS 0x8A2E #define GL_MAX_UNIFORM_BUFFER_BINDINGS 0x8A2F #define GL_MAX_UNIFORM_BLOCK_SIZE 0x8A30 #define GL_MAX_COMBINED_VERTEX_UNIFORM_COMPONENTS 0x8A31 #define GL_MAX_COMBINED_FRAGMENT_UNIFORM_COMPONENTS 0x8A33 #define GL_UNIFORM_BUFFER_OFFSET_ALIGNMENT 0x8A34 #define GL_ACTIVE_UNIFORM_BLOCK_MAX_NAME_LENGTH 0x8A35 #define GL_ACTIVE_UNIFORM_BLOCKS 0x8A36 #define GL_UNIFORM_TYPE 0x8A37 #define GL_UNIFORM_SIZE 0x8A38 #define GL_UNIFORM_NAME_LENGTH 0x8A39 #define GL_UNIFORM_BLOCK_INDEX 0x8A3A #define GL_UNIFORM_OFFSET 0x8A3B #define GL_UNIFORM_ARRAY_STRIDE 0x8A3C #define GL_UNIFORM_MATRIX_STRIDE 0x8A3D #define GL_UNIFORM_IS_ROW_MAJOR 0x8A3E #define GL_UNIFORM_BLOCK_BINDING 0x8A3F #define GL_UNIFORM_BLOCK_DATA_SIZE 0x8A40 #define GL_UNIFORM_BLOCK_NAME_LENGTH 0x8A41 #define GL_UNIFORM_BLOCK_ACTIVE_UNIFORMS 0x8A42 #define GL_UNIFORM_BLOCK_ACTIVE_UNIFORM_INDICES 0x8A43 #define GL_UNIFORM_BLOCK_REFERENCED_BY_VERTEX_SHADER 0x8A44 #define GL_UNIFORM_BLOCK_REFERENCED_BY_FRAGMENT_SHADER 0x8A46 #define GL_INVALID_INDEX 0xFFFFFFFFu typedef void (APIENTRYP PFNGLDRAWARRAYSINSTANCEDPROC) (GLenum mode, GLint first, GLsizei count, GLsizei instancecount); typedef void (APIENTRYP PFNGLDRAWELEMENTSINSTANCEDPROC) (GLenum mode, GLsizei count, GLenum type, const void *indices, GLsizei instancecount); typedef void (APIENTRYP PFNGLTEXBUFFERPROC) (GLenum target, GLenum internalformat, GLuint buffer); typedef void (APIENTRYP PFNGLPRIMITIVERESTARTINDEXPROC) (GLuint index); typedef void (APIENTRYP PFNGLCOPYBUFFERSUBDATAPROC) (GLenum readTarget, GLenum writeTarget, GLintptr readOffset, GLintptr writeOffset, GLsizeiptr size); typedef void (APIENTRYP PFNGLGETUNIFORMINDICESPROC) (GLuint program, GLsizei uniformCount, const GLchar *const*uniformNames, GLuint *uniformIndices); typedef void (APIENTRYP PFNGLGETACTIVEUNIFORMSIVPROC) (GLuint program, GLsizei uniformCount, const GLuint *uniformIndices, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGETACTIVEUNIFORMNAMEPROC) (GLuint program, GLuint uniformIndex, GLsizei bufSize, GLsizei *length, GLchar *uniformName); typedef GLuint (APIENTRYP PFNGLGETUNIFORMBLOCKINDEXPROC) (GLuint program, const GLchar *uniformBlockName); typedef void (APIENTRYP PFNGLGETACTIVEUNIFORMBLOCKIVPROC) (GLuint program, GLuint uniformBlockIndex, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGETACTIVEUNIFORMBLOCKNAMEPROC) (GLuint program, GLuint uniformBlockIndex, GLsizei bufSize, GLsizei *length, GLchar *uniformBlockName); typedef void (APIENTRYP PFNGLUNIFORMBLOCKBINDINGPROC) (GLuint program, GLuint uniformBlockIndex, GLuint uniformBlockBinding); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glDrawArraysInstanced (GLenum mode, GLint first, GLsizei count, GLsizei instancecount); GLAPI void APIENTRY glDrawElementsInstanced (GLenum mode, GLsizei count, GLenum type, const void *indices, GLsizei instancecount); GLAPI void APIENTRY glTexBuffer (GLenum target, GLenum internalformat, GLuint buffer); GLAPI void APIENTRY glPrimitiveRestartIndex (GLuint index); GLAPI void APIENTRY glCopyBufferSubData (GLenum readTarget, GLenum writeTarget, GLintptr readOffset, GLintptr writeOffset, GLsizeiptr size); GLAPI void APIENTRY glGetUniformIndices (GLuint program, GLsizei uniformCount, const GLchar *const*uniformNames, GLuint *uniformIndices); GLAPI void APIENTRY glGetActiveUniformsiv (GLuint program, GLsizei uniformCount, const GLuint *uniformIndices, GLenum pname, GLint *params); GLAPI void APIENTRY glGetActiveUniformName (GLuint program, GLuint uniformIndex, GLsizei bufSize, GLsizei *length, GLchar *uniformName); GLAPI GLuint APIENTRY glGetUniformBlockIndex (GLuint program, const GLchar *uniformBlockName); GLAPI void APIENTRY glGetActiveUniformBlockiv (GLuint program, GLuint uniformBlockIndex, GLenum pname, GLint *params); GLAPI void APIENTRY glGetActiveUniformBlockName (GLuint program, GLuint uniformBlockIndex, GLsizei bufSize, GLsizei *length, GLchar *uniformBlockName); GLAPI void APIENTRY glUniformBlockBinding (GLuint program, GLuint uniformBlockIndex, GLuint uniformBlockBinding); #endif #endif /* GL_VERSION_3_1 */ #ifndef GL_VERSION_3_2 #define GL_VERSION_3_2 1 typedef struct __GLsync *GLsync; #ifndef GLEXT_64_TYPES_DEFINED /* This code block is duplicated in glxext.h, so must be protected */ #define GLEXT_64_TYPES_DEFINED /* Define int32_t, int64_t, and uint64_t types for UST/MSC */ /* (as used in the GL_EXT_timer_query extension). */ #if defined(__STDC_VERSION__) && __STDC_VERSION__ >= 199901L #include #elif defined(__sun__) || defined(__digital__) #include #if defined(__STDC__) #if defined(__arch64__) || defined(_LP64) typedef long int int64_t; typedef unsigned long int uint64_t; #else typedef long long int int64_t; typedef unsigned long long int uint64_t; #endif /* __arch64__ */ #endif /* __STDC__ */ #elif defined( __VMS ) || defined(__sgi) #include #elif defined(__SCO__) || defined(__USLC__) #include #elif defined(__UNIXOS2__) || defined(__SOL64__) typedef long int int32_t; typedef long long int int64_t; typedef unsigned long long int uint64_t; #elif defined(_WIN32) && defined(__GNUC__) #include #elif defined(_WIN32) typedef __int32 int32_t; typedef __int64 int64_t; typedef unsigned __int64 uint64_t; #else /* Fallback if nothing above works */ #include #endif #endif typedef uint64_t GLuint64; typedef int64_t GLint64; #define GL_CONTEXT_CORE_PROFILE_BIT 0x00000001 #define GL_CONTEXT_COMPATIBILITY_PROFILE_BIT 0x00000002 #define GL_LINES_ADJACENCY 0x000A #define GL_LINE_STRIP_ADJACENCY 0x000B #define GL_TRIANGLES_ADJACENCY 0x000C #define GL_TRIANGLE_STRIP_ADJACENCY 0x000D #define GL_PROGRAM_POINT_SIZE 0x8642 #define GL_MAX_GEOMETRY_TEXTURE_IMAGE_UNITS 0x8C29 #define GL_FRAMEBUFFER_ATTACHMENT_LAYERED 0x8DA7 #define GL_FRAMEBUFFER_INCOMPLETE_LAYER_TARGETS 0x8DA8 #define GL_GEOMETRY_SHADER 0x8DD9 #define GL_GEOMETRY_VERTICES_OUT 0x8916 #define GL_GEOMETRY_INPUT_TYPE 0x8917 #define GL_GEOMETRY_OUTPUT_TYPE 0x8918 #define GL_MAX_GEOMETRY_UNIFORM_COMPONENTS 0x8DDF #define GL_MAX_GEOMETRY_OUTPUT_VERTICES 0x8DE0 #define GL_MAX_GEOMETRY_TOTAL_OUTPUT_COMPONENTS 0x8DE1 #define GL_MAX_VERTEX_OUTPUT_COMPONENTS 0x9122 #define GL_MAX_GEOMETRY_INPUT_COMPONENTS 0x9123 #define GL_MAX_GEOMETRY_OUTPUT_COMPONENTS 0x9124 #define GL_MAX_FRAGMENT_INPUT_COMPONENTS 0x9125 #define GL_CONTEXT_PROFILE_MASK 0x9126 #define GL_DEPTH_CLAMP 0x864F #define GL_QUADS_FOLLOW_PROVOKING_VERTEX_CONVENTION 0x8E4C #define GL_FIRST_VERTEX_CONVENTION 0x8E4D #define GL_LAST_VERTEX_CONVENTION 0x8E4E #define GL_PROVOKING_VERTEX 0x8E4F #define GL_TEXTURE_CUBE_MAP_SEAMLESS 0x884F #define GL_MAX_SERVER_WAIT_TIMEOUT 0x9111 #define GL_OBJECT_TYPE 0x9112 #define GL_SYNC_CONDITION 0x9113 #define GL_SYNC_STATUS 0x9114 #define GL_SYNC_FLAGS 0x9115 #define GL_SYNC_FENCE 0x9116 #define GL_SYNC_GPU_COMMANDS_COMPLETE 0x9117 #define GL_UNSIGNALED 0x9118 #define GL_SIGNALED 0x9119 #define GL_ALREADY_SIGNALED 0x911A #define GL_TIMEOUT_EXPIRED 0x911B #define GL_CONDITION_SATISFIED 0x911C #define GL_WAIT_FAILED 0x911D #define GL_TIMEOUT_IGNORED 0xFFFFFFFFFFFFFFFFull #define GL_SYNC_FLUSH_COMMANDS_BIT 0x00000001 #define GL_SAMPLE_POSITION 0x8E50 #define GL_SAMPLE_MASK 0x8E51 #define GL_SAMPLE_MASK_VALUE 0x8E52 #define GL_MAX_SAMPLE_MASK_WORDS 0x8E59 #define GL_TEXTURE_2D_MULTISAMPLE 0x9100 #define GL_PROXY_TEXTURE_2D_MULTISAMPLE 0x9101 #define GL_TEXTURE_2D_MULTISAMPLE_ARRAY 0x9102 #define GL_PROXY_TEXTURE_2D_MULTISAMPLE_ARRAY 0x9103 #define GL_TEXTURE_BINDING_2D_MULTISAMPLE 0x9104 #define GL_TEXTURE_BINDING_2D_MULTISAMPLE_ARRAY 0x9105 #define GL_TEXTURE_SAMPLES 0x9106 #define GL_TEXTURE_FIXED_SAMPLE_LOCATIONS 0x9107 #define GL_SAMPLER_2D_MULTISAMPLE 0x9108 #define GL_INT_SAMPLER_2D_MULTISAMPLE 0x9109 #define GL_UNSIGNED_INT_SAMPLER_2D_MULTISAMPLE 0x910A #define GL_SAMPLER_2D_MULTISAMPLE_ARRAY 0x910B #define GL_INT_SAMPLER_2D_MULTISAMPLE_ARRAY 0x910C #define GL_UNSIGNED_INT_SAMPLER_2D_MULTISAMPLE_ARRAY 0x910D #define GL_MAX_COLOR_TEXTURE_SAMPLES 0x910E #define GL_MAX_DEPTH_TEXTURE_SAMPLES 0x910F #define GL_MAX_INTEGER_SAMPLES 0x9110 typedef void (APIENTRYP PFNGLDRAWELEMENTSBASEVERTEXPROC) (GLenum mode, GLsizei count, GLenum type, const void *indices, GLint basevertex); typedef void (APIENTRYP PFNGLDRAWRANGEELEMENTSBASEVERTEXPROC) (GLenum mode, GLuint start, GLuint end, GLsizei count, GLenum type, const void *indices, GLint basevertex); typedef void (APIENTRYP PFNGLDRAWELEMENTSINSTANCEDBASEVERTEXPROC) (GLenum mode, GLsizei count, GLenum type, const void *indices, GLsizei instancecount, GLint basevertex); typedef void (APIENTRYP PFNGLMULTIDRAWELEMENTSBASEVERTEXPROC) (GLenum mode, const GLsizei *count, GLenum type, const void *const*indices, GLsizei drawcount, const GLint *basevertex); typedef void (APIENTRYP PFNGLPROVOKINGVERTEXPROC) (GLenum mode); typedef GLsync (APIENTRYP PFNGLFENCESYNCPROC) (GLenum condition, GLbitfield flags); typedef GLboolean (APIENTRYP PFNGLISSYNCPROC) (GLsync sync); typedef void (APIENTRYP PFNGLDELETESYNCPROC) (GLsync sync); typedef GLenum (APIENTRYP PFNGLCLIENTWAITSYNCPROC) (GLsync sync, GLbitfield flags, GLuint64 timeout); typedef void (APIENTRYP PFNGLWAITSYNCPROC) (GLsync sync, GLbitfield flags, GLuint64 timeout); typedef void (APIENTRYP PFNGLGETINTEGER64VPROC) (GLenum pname, GLint64 *data); typedef void (APIENTRYP PFNGLGETSYNCIVPROC) (GLsync sync, GLenum pname, GLsizei bufSize, GLsizei *length, GLint *values); typedef void (APIENTRYP PFNGLGETINTEGER64I_VPROC) (GLenum target, GLuint index, GLint64 *data); typedef void (APIENTRYP PFNGLGETBUFFERPARAMETERI64VPROC) (GLenum target, GLenum pname, GLint64 *params); typedef void (APIENTRYP PFNGLFRAMEBUFFERTEXTUREPROC) (GLenum target, GLenum attachment, GLuint texture, GLint level); typedef void (APIENTRYP PFNGLTEXIMAGE2DMULTISAMPLEPROC) (GLenum target, GLsizei samples, GLenum internalformat, GLsizei width, GLsizei height, GLboolean fixedsamplelocations); typedef void (APIENTRYP PFNGLTEXIMAGE3DMULTISAMPLEPROC) (GLenum target, GLsizei samples, GLenum internalformat, GLsizei width, GLsizei height, GLsizei depth, GLboolean fixedsamplelocations); typedef void (APIENTRYP PFNGLGETMULTISAMPLEFVPROC) (GLenum pname, GLuint index, GLfloat *val); typedef void (APIENTRYP PFNGLSAMPLEMASKIPROC) (GLuint maskNumber, GLbitfield mask); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glDrawElementsBaseVertex (GLenum mode, GLsizei count, GLenum type, const void *indices, GLint basevertex); GLAPI void APIENTRY glDrawRangeElementsBaseVertex (GLenum mode, GLuint start, GLuint end, GLsizei count, GLenum type, const void *indices, GLint basevertex); GLAPI void APIENTRY glDrawElementsInstancedBaseVertex (GLenum mode, GLsizei count, GLenum type, const void *indices, GLsizei instancecount, GLint basevertex); GLAPI void APIENTRY glMultiDrawElementsBaseVertex (GLenum mode, const GLsizei *count, GLenum type, const void *const*indices, GLsizei drawcount, const GLint *basevertex); GLAPI void APIENTRY glProvokingVertex (GLenum mode); GLAPI GLsync APIENTRY glFenceSync (GLenum condition, GLbitfield flags); GLAPI GLboolean APIENTRY glIsSync (GLsync sync); GLAPI void APIENTRY glDeleteSync (GLsync sync); GLAPI GLenum APIENTRY glClientWaitSync (GLsync sync, GLbitfield flags, GLuint64 timeout); GLAPI void APIENTRY glWaitSync (GLsync sync, GLbitfield flags, GLuint64 timeout); GLAPI void APIENTRY glGetInteger64v (GLenum pname, GLint64 *data); GLAPI void APIENTRY glGetSynciv (GLsync sync, GLenum pname, GLsizei bufSize, GLsizei *length, GLint *values); GLAPI void APIENTRY glGetInteger64i_v (GLenum target, GLuint index, GLint64 *data); GLAPI void APIENTRY glGetBufferParameteri64v (GLenum target, GLenum pname, GLint64 *params); GLAPI void APIENTRY glFramebufferTexture (GLenum target, GLenum attachment, GLuint texture, GLint level); GLAPI void APIENTRY glTexImage2DMultisample (GLenum target, GLsizei samples, GLenum internalformat, GLsizei width, GLsizei height, GLboolean fixedsamplelocations); GLAPI void APIENTRY glTexImage3DMultisample (GLenum target, GLsizei samples, GLenum internalformat, GLsizei width, GLsizei height, GLsizei depth, GLboolean fixedsamplelocations); GLAPI void APIENTRY glGetMultisamplefv (GLenum pname, GLuint index, GLfloat *val); GLAPI void APIENTRY glSampleMaski (GLuint maskNumber, GLbitfield mask); #endif #endif /* GL_VERSION_3_2 */ #ifndef GL_VERSION_3_3 #define GL_VERSION_3_3 1 #define GL_VERTEX_ATTRIB_ARRAY_DIVISOR 0x88FE #define GL_SRC1_COLOR 0x88F9 #define GL_ONE_MINUS_SRC1_COLOR 0x88FA #define GL_ONE_MINUS_SRC1_ALPHA 0x88FB #define GL_MAX_DUAL_SOURCE_DRAW_BUFFERS 0x88FC #define GL_ANY_SAMPLES_PASSED 0x8C2F #define GL_SAMPLER_BINDING 0x8919 #define GL_RGB10_A2UI 0x906F #define GL_TEXTURE_SWIZZLE_R 0x8E42 #define GL_TEXTURE_SWIZZLE_G 0x8E43 #define GL_TEXTURE_SWIZZLE_B 0x8E44 #define GL_TEXTURE_SWIZZLE_A 0x8E45 #define GL_TEXTURE_SWIZZLE_RGBA 0x8E46 #define GL_TIME_ELAPSED 0x88BF #define GL_TIMESTAMP 0x8E28 #define GL_INT_2_10_10_10_REV 0x8D9F typedef void (APIENTRYP PFNGLBINDFRAGDATALOCATIONINDEXEDPROC) (GLuint program, GLuint colorNumber, GLuint index, const GLchar *name); typedef GLint (APIENTRYP PFNGLGETFRAGDATAINDEXPROC) (GLuint program, const GLchar *name); typedef void (APIENTRYP PFNGLGENSAMPLERSPROC) (GLsizei count, GLuint *samplers); typedef void (APIENTRYP PFNGLDELETESAMPLERSPROC) (GLsizei count, const GLuint *samplers); typedef GLboolean (APIENTRYP PFNGLISSAMPLERPROC) (GLuint sampler); typedef void (APIENTRYP PFNGLBINDSAMPLERPROC) (GLuint unit, GLuint sampler); typedef void (APIENTRYP PFNGLSAMPLERPARAMETERIPROC) (GLuint sampler, GLenum pname, GLint param); typedef void (APIENTRYP PFNGLSAMPLERPARAMETERIVPROC) (GLuint sampler, GLenum pname, const GLint *param); typedef void (APIENTRYP PFNGLSAMPLERPARAMETERFPROC) (GLuint sampler, GLenum pname, GLfloat param); typedef void (APIENTRYP PFNGLSAMPLERPARAMETERFVPROC) (GLuint sampler, GLenum pname, const GLfloat *param); typedef void (APIENTRYP PFNGLSAMPLERPARAMETERIIVPROC) (GLuint sampler, GLenum pname, const GLint *param); typedef void (APIENTRYP PFNGLSAMPLERPARAMETERIUIVPROC) (GLuint sampler, GLenum pname, const GLuint *param); typedef void (APIENTRYP PFNGLGETSAMPLERPARAMETERIVPROC) (GLuint sampler, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGETSAMPLERPARAMETERIIVPROC) (GLuint sampler, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGETSAMPLERPARAMETERFVPROC) (GLuint sampler, GLenum pname, GLfloat *params); typedef void (APIENTRYP PFNGLGETSAMPLERPARAMETERIUIVPROC) (GLuint sampler, GLenum pname, GLuint *params); typedef void (APIENTRYP PFNGLQUERYCOUNTERPROC) (GLuint id, GLenum target); typedef void (APIENTRYP PFNGLGETQUERYOBJECTI64VPROC) (GLuint id, GLenum pname, GLint64 *params); typedef void (APIENTRYP PFNGLGETQUERYOBJECTUI64VPROC) (GLuint id, GLenum pname, GLuint64 *params); typedef void (APIENTRYP PFNGLVERTEXATTRIBDIVISORPROC) (GLuint index, GLuint divisor); typedef void (APIENTRYP PFNGLVERTEXATTRIBP1UIPROC) (GLuint index, GLenum type, GLboolean normalized, GLuint value); typedef void (APIENTRYP PFNGLVERTEXATTRIBP1UIVPROC) (GLuint index, GLenum type, GLboolean normalized, const GLuint *value); typedef void (APIENTRYP PFNGLVERTEXATTRIBP2UIPROC) (GLuint index, GLenum type, GLboolean normalized, GLuint value); typedef void (APIENTRYP PFNGLVERTEXATTRIBP2UIVPROC) (GLuint index, GLenum type, GLboolean normalized, const GLuint *value); typedef void (APIENTRYP PFNGLVERTEXATTRIBP3UIPROC) (GLuint index, GLenum type, GLboolean normalized, GLuint value); typedef void (APIENTRYP PFNGLVERTEXATTRIBP3UIVPROC) (GLuint index, GLenum type, GLboolean normalized, const GLuint *value); typedef void (APIENTRYP PFNGLVERTEXATTRIBP4UIPROC) (GLuint index, GLenum type, GLboolean normalized, GLuint value); typedef void (APIENTRYP PFNGLVERTEXATTRIBP4UIVPROC) (GLuint index, GLenum type, GLboolean normalized, const GLuint *value); typedef void (APIENTRYP PFNGLVERTEXP2UIPROC) (GLenum type, GLuint value); typedef void (APIENTRYP PFNGLVERTEXP2UIVPROC) (GLenum type, const GLuint *value); typedef void (APIENTRYP PFNGLVERTEXP3UIPROC) (GLenum type, GLuint value); typedef void (APIENTRYP PFNGLVERTEXP3UIVPROC) (GLenum type, const GLuint *value); typedef void (APIENTRYP PFNGLVERTEXP4UIPROC) (GLenum type, GLuint value); typedef void (APIENTRYP PFNGLVERTEXP4UIVPROC) (GLenum type, const GLuint *value); typedef void (APIENTRYP PFNGLTEXCOORDP1UIPROC) (GLenum type, GLuint coords); typedef void (APIENTRYP PFNGLTEXCOORDP1UIVPROC) (GLenum type, const GLuint *coords); typedef void (APIENTRYP PFNGLTEXCOORDP2UIPROC) (GLenum type, GLuint coords); typedef void (APIENTRYP PFNGLTEXCOORDP2UIVPROC) (GLenum type, const GLuint *coords); typedef void (APIENTRYP PFNGLTEXCOORDP3UIPROC) (GLenum type, GLuint coords); typedef void (APIENTRYP PFNGLTEXCOORDP3UIVPROC) (GLenum type, const GLuint *coords); typedef void (APIENTRYP PFNGLTEXCOORDP4UIPROC) (GLenum type, GLuint coords); typedef void (APIENTRYP PFNGLTEXCOORDP4UIVPROC) (GLenum type, const GLuint *coords); typedef void (APIENTRYP PFNGLMULTITEXCOORDP1UIPROC) (GLenum texture, GLenum type, GLuint coords); typedef void (APIENTRYP PFNGLMULTITEXCOORDP1UIVPROC) (GLenum texture, GLenum type, const GLuint *coords); typedef void (APIENTRYP PFNGLMULTITEXCOORDP2UIPROC) (GLenum texture, GLenum type, GLuint coords); typedef void (APIENTRYP PFNGLMULTITEXCOORDP2UIVPROC) (GLenum texture, GLenum type, const GLuint *coords); typedef void (APIENTRYP PFNGLMULTITEXCOORDP3UIPROC) (GLenum texture, GLenum type, GLuint coords); typedef void (APIENTRYP PFNGLMULTITEXCOORDP3UIVPROC) (GLenum texture, GLenum type, const GLuint *coords); typedef void (APIENTRYP PFNGLMULTITEXCOORDP4UIPROC) (GLenum texture, GLenum type, GLuint coords); typedef void (APIENTRYP PFNGLMULTITEXCOORDP4UIVPROC) (GLenum texture, GLenum type, const GLuint *coords); typedef void (APIENTRYP PFNGLNORMALP3UIPROC) (GLenum type, GLuint coords); typedef void (APIENTRYP PFNGLNORMALP3UIVPROC) (GLenum type, const GLuint *coords); typedef void (APIENTRYP PFNGLCOLORP3UIPROC) (GLenum type, GLuint color); typedef void (APIENTRYP PFNGLCOLORP3UIVPROC) (GLenum type, const GLuint *color); typedef void (APIENTRYP PFNGLCOLORP4UIPROC) (GLenum type, GLuint color); typedef void (APIENTRYP PFNGLCOLORP4UIVPROC) (GLenum type, const GLuint *color); typedef void (APIENTRYP PFNGLSECONDARYCOLORP3UIPROC) (GLenum type, GLuint color); typedef void (APIENTRYP PFNGLSECONDARYCOLORP3UIVPROC) (GLenum type, const GLuint *color); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glBindFragDataLocationIndexed (GLuint program, GLuint colorNumber, GLuint index, const GLchar *name); GLAPI GLint APIENTRY glGetFragDataIndex (GLuint program, const GLchar *name); GLAPI void APIENTRY glGenSamplers (GLsizei count, GLuint *samplers); GLAPI void APIENTRY glDeleteSamplers (GLsizei count, const GLuint *samplers); GLAPI GLboolean APIENTRY glIsSampler (GLuint sampler); GLAPI void APIENTRY glBindSampler (GLuint unit, GLuint sampler); GLAPI void APIENTRY glSamplerParameteri (GLuint sampler, GLenum pname, GLint param); GLAPI void APIENTRY glSamplerParameteriv (GLuint sampler, GLenum pname, const GLint *param); GLAPI void APIENTRY glSamplerParameterf (GLuint sampler, GLenum pname, GLfloat param); GLAPI void APIENTRY glSamplerParameterfv (GLuint sampler, GLenum pname, const GLfloat *param); GLAPI void APIENTRY glSamplerParameterIiv (GLuint sampler, GLenum pname, const GLint *param); GLAPI void APIENTRY glSamplerParameterIuiv (GLuint sampler, GLenum pname, const GLuint *param); GLAPI void APIENTRY glGetSamplerParameteriv (GLuint sampler, GLenum pname, GLint *params); GLAPI void APIENTRY glGetSamplerParameterIiv (GLuint sampler, GLenum pname, GLint *params); GLAPI void APIENTRY glGetSamplerParameterfv (GLuint sampler, GLenum pname, GLfloat *params); GLAPI void APIENTRY glGetSamplerParameterIuiv (GLuint sampler, GLenum pname, GLuint *params); GLAPI void APIENTRY glQueryCounter (GLuint id, GLenum target); GLAPI void APIENTRY glGetQueryObjecti64v (GLuint id, GLenum pname, GLint64 *params); GLAPI void APIENTRY glGetQueryObjectui64v (GLuint id, GLenum pname, GLuint64 *params); GLAPI void APIENTRY glVertexAttribDivisor (GLuint index, GLuint divisor); GLAPI void APIENTRY glVertexAttribP1ui (GLuint index, GLenum type, GLboolean normalized, GLuint value); GLAPI void APIENTRY glVertexAttribP1uiv (GLuint index, GLenum type, GLboolean normalized, const GLuint *value); GLAPI void APIENTRY glVertexAttribP2ui (GLuint index, GLenum type, GLboolean normalized, GLuint value); GLAPI void APIENTRY glVertexAttribP2uiv (GLuint index, GLenum type, GLboolean normalized, const GLuint *value); GLAPI void APIENTRY glVertexAttribP3ui (GLuint index, GLenum type, GLboolean normalized, GLuint value); GLAPI void APIENTRY glVertexAttribP3uiv (GLuint index, GLenum type, GLboolean normalized, const GLuint *value); GLAPI void APIENTRY glVertexAttribP4ui (GLuint index, GLenum type, GLboolean normalized, GLuint value); GLAPI void APIENTRY glVertexAttribP4uiv (GLuint index, GLenum type, GLboolean normalized, const GLuint *value); GLAPI void APIENTRY glVertexP2ui (GLenum type, GLuint value); GLAPI void APIENTRY glVertexP2uiv (GLenum type, const GLuint *value); GLAPI void APIENTRY glVertexP3ui (GLenum type, GLuint value); GLAPI void APIENTRY glVertexP3uiv (GLenum type, const GLuint *value); GLAPI void APIENTRY glVertexP4ui (GLenum type, GLuint value); GLAPI void APIENTRY glVertexP4uiv (GLenum type, const GLuint *value); GLAPI void APIENTRY glTexCoordP1ui (GLenum type, GLuint coords); GLAPI void APIENTRY glTexCoordP1uiv (GLenum type, const GLuint *coords); GLAPI void APIENTRY glTexCoordP2ui (GLenum type, GLuint coords); GLAPI void APIENTRY glTexCoordP2uiv (GLenum type, const GLuint *coords); GLAPI void APIENTRY glTexCoordP3ui (GLenum type, GLuint coords); GLAPI void APIENTRY glTexCoordP3uiv (GLenum type, const GLuint *coords); GLAPI void APIENTRY glTexCoordP4ui (GLenum type, GLuint coords); GLAPI void APIENTRY glTexCoordP4uiv (GLenum type, const GLuint *coords); GLAPI void APIENTRY glMultiTexCoordP1ui (GLenum texture, GLenum type, GLuint coords); GLAPI void APIENTRY glMultiTexCoordP1uiv (GLenum texture, GLenum type, const GLuint *coords); GLAPI void APIENTRY glMultiTexCoordP2ui (GLenum texture, GLenum type, GLuint coords); GLAPI void APIENTRY glMultiTexCoordP2uiv (GLenum texture, GLenum type, const GLuint *coords); GLAPI void APIENTRY glMultiTexCoordP3ui (GLenum texture, GLenum type, GLuint coords); GLAPI void APIENTRY glMultiTexCoordP3uiv (GLenum texture, GLenum type, const GLuint *coords); GLAPI void APIENTRY glMultiTexCoordP4ui (GLenum texture, GLenum type, GLuint coords); GLAPI void APIENTRY glMultiTexCoordP4uiv (GLenum texture, GLenum type, const GLuint *coords); GLAPI void APIENTRY glNormalP3ui (GLenum type, GLuint coords); GLAPI void APIENTRY glNormalP3uiv (GLenum type, const GLuint *coords); GLAPI void APIENTRY glColorP3ui (GLenum type, GLuint color); GLAPI void APIENTRY glColorP3uiv (GLenum type, const GLuint *color); GLAPI void APIENTRY glColorP4ui (GLenum type, GLuint color); GLAPI void APIENTRY glColorP4uiv (GLenum type, const GLuint *color); GLAPI void APIENTRY glSecondaryColorP3ui (GLenum type, GLuint color); GLAPI void APIENTRY glSecondaryColorP3uiv (GLenum type, const GLuint *color); #endif #endif /* GL_VERSION_3_3 */ #ifndef GL_VERSION_4_0 #define GL_VERSION_4_0 1 #define GL_SAMPLE_SHADING 0x8C36 #define GL_MIN_SAMPLE_SHADING_VALUE 0x8C37 #define GL_MIN_PROGRAM_TEXTURE_GATHER_OFFSET 0x8E5E #define GL_MAX_PROGRAM_TEXTURE_GATHER_OFFSET 0x8E5F #define GL_TEXTURE_CUBE_MAP_ARRAY 0x9009 #define GL_TEXTURE_BINDING_CUBE_MAP_ARRAY 0x900A #define GL_PROXY_TEXTURE_CUBE_MAP_ARRAY 0x900B #define GL_SAMPLER_CUBE_MAP_ARRAY 0x900C #define GL_SAMPLER_CUBE_MAP_ARRAY_SHADOW 0x900D #define GL_INT_SAMPLER_CUBE_MAP_ARRAY 0x900E #define GL_UNSIGNED_INT_SAMPLER_CUBE_MAP_ARRAY 0x900F #define GL_DRAW_INDIRECT_BUFFER 0x8F3F #define GL_DRAW_INDIRECT_BUFFER_BINDING 0x8F43 #define GL_GEOMETRY_SHADER_INVOCATIONS 0x887F #define GL_MAX_GEOMETRY_SHADER_INVOCATIONS 0x8E5A #define GL_MIN_FRAGMENT_INTERPOLATION_OFFSET 0x8E5B #define GL_MAX_FRAGMENT_INTERPOLATION_OFFSET 0x8E5C #define GL_FRAGMENT_INTERPOLATION_OFFSET_BITS 0x8E5D #define GL_MAX_VERTEX_STREAMS 0x8E71 #define GL_DOUBLE_VEC2 0x8FFC #define GL_DOUBLE_VEC3 0x8FFD #define GL_DOUBLE_VEC4 0x8FFE #define GL_DOUBLE_MAT2 0x8F46 #define GL_DOUBLE_MAT3 0x8F47 #define GL_DOUBLE_MAT4 0x8F48 #define GL_DOUBLE_MAT2x3 0x8F49 #define GL_DOUBLE_MAT2x4 0x8F4A #define GL_DOUBLE_MAT3x2 0x8F4B #define GL_DOUBLE_MAT3x4 0x8F4C #define GL_DOUBLE_MAT4x2 0x8F4D #define GL_DOUBLE_MAT4x3 0x8F4E #define GL_ACTIVE_SUBROUTINES 0x8DE5 #define GL_ACTIVE_SUBROUTINE_UNIFORMS 0x8DE6 #define GL_ACTIVE_SUBROUTINE_UNIFORM_LOCATIONS 0x8E47 #define GL_ACTIVE_SUBROUTINE_MAX_LENGTH 0x8E48 #define GL_ACTIVE_SUBROUTINE_UNIFORM_MAX_LENGTH 0x8E49 #define GL_MAX_SUBROUTINES 0x8DE7 #define GL_MAX_SUBROUTINE_UNIFORM_LOCATIONS 0x8DE8 #define GL_NUM_COMPATIBLE_SUBROUTINES 0x8E4A #define GL_COMPATIBLE_SUBROUTINES 0x8E4B #define GL_PATCHES 0x000E #define GL_PATCH_VERTICES 0x8E72 #define GL_PATCH_DEFAULT_INNER_LEVEL 0x8E73 #define GL_PATCH_DEFAULT_OUTER_LEVEL 0x8E74 #define GL_TESS_CONTROL_OUTPUT_VERTICES 0x8E75 #define GL_TESS_GEN_MODE 0x8E76 #define GL_TESS_GEN_SPACING 0x8E77 #define GL_TESS_GEN_VERTEX_ORDER 0x8E78 #define GL_TESS_GEN_POINT_MODE 0x8E79 #define GL_ISOLINES 0x8E7A #define GL_FRACTIONAL_ODD 0x8E7B #define GL_FRACTIONAL_EVEN 0x8E7C #define GL_MAX_PATCH_VERTICES 0x8E7D #define GL_MAX_TESS_GEN_LEVEL 0x8E7E #define GL_MAX_TESS_CONTROL_UNIFORM_COMPONENTS 0x8E7F #define GL_MAX_TESS_EVALUATION_UNIFORM_COMPONENTS 0x8E80 #define GL_MAX_TESS_CONTROL_TEXTURE_IMAGE_UNITS 0x8E81 #define GL_MAX_TESS_EVALUATION_TEXTURE_IMAGE_UNITS 0x8E82 #define GL_MAX_TESS_CONTROL_OUTPUT_COMPONENTS 0x8E83 #define GL_MAX_TESS_PATCH_COMPONENTS 0x8E84 #define GL_MAX_TESS_CONTROL_TOTAL_OUTPUT_COMPONENTS 0x8E85 #define GL_MAX_TESS_EVALUATION_OUTPUT_COMPONENTS 0x8E86 #define GL_MAX_TESS_CONTROL_UNIFORM_BLOCKS 0x8E89 #define GL_MAX_TESS_EVALUATION_UNIFORM_BLOCKS 0x8E8A #define GL_MAX_TESS_CONTROL_INPUT_COMPONENTS 0x886C #define GL_MAX_TESS_EVALUATION_INPUT_COMPONENTS 0x886D #define GL_MAX_COMBINED_TESS_CONTROL_UNIFORM_COMPONENTS 0x8E1E #define GL_MAX_COMBINED_TESS_EVALUATION_UNIFORM_COMPONENTS 0x8E1F #define GL_UNIFORM_BLOCK_REFERENCED_BY_TESS_CONTROL_SHADER 0x84F0 #define GL_UNIFORM_BLOCK_REFERENCED_BY_TESS_EVALUATION_SHADER 0x84F1 #define GL_TESS_EVALUATION_SHADER 0x8E87 #define GL_TESS_CONTROL_SHADER 0x8E88 #define GL_TRANSFORM_FEEDBACK 0x8E22 #define GL_TRANSFORM_FEEDBACK_BUFFER_PAUSED 0x8E23 #define GL_TRANSFORM_FEEDBACK_BUFFER_ACTIVE 0x8E24 #define GL_TRANSFORM_FEEDBACK_BINDING 0x8E25 #define GL_MAX_TRANSFORM_FEEDBACK_BUFFERS 0x8E70 typedef void (APIENTRYP PFNGLMINSAMPLESHADINGPROC) (GLfloat value); typedef void (APIENTRYP PFNGLBLENDEQUATIONIPROC) (GLuint buf, GLenum mode); typedef void (APIENTRYP PFNGLBLENDEQUATIONSEPARATEIPROC) (GLuint buf, GLenum modeRGB, GLenum modeAlpha); typedef void (APIENTRYP PFNGLBLENDFUNCIPROC) (GLuint buf, GLenum src, GLenum dst); typedef void (APIENTRYP PFNGLBLENDFUNCSEPARATEIPROC) (GLuint buf, GLenum srcRGB, GLenum dstRGB, GLenum srcAlpha, GLenum dstAlpha); typedef void (APIENTRYP PFNGLDRAWARRAYSINDIRECTPROC) (GLenum mode, const void *indirect); typedef void (APIENTRYP PFNGLDRAWELEMENTSINDIRECTPROC) (GLenum mode, GLenum type, const void *indirect); typedef void (APIENTRYP PFNGLUNIFORM1DPROC) (GLint location, GLdouble x); typedef void (APIENTRYP PFNGLUNIFORM2DPROC) (GLint location, GLdouble x, GLdouble y); typedef void (APIENTRYP PFNGLUNIFORM3DPROC) (GLint location, GLdouble x, GLdouble y, GLdouble z); typedef void (APIENTRYP PFNGLUNIFORM4DPROC) (GLint location, GLdouble x, GLdouble y, GLdouble z, GLdouble w); typedef void (APIENTRYP PFNGLUNIFORM1DVPROC) (GLint location, GLsizei count, const GLdouble *value); typedef void (APIENTRYP PFNGLUNIFORM2DVPROC) (GLint location, GLsizei count, const GLdouble *value); typedef void (APIENTRYP PFNGLUNIFORM3DVPROC) (GLint location, GLsizei count, const GLdouble *value); typedef void (APIENTRYP PFNGLUNIFORM4DVPROC) (GLint location, GLsizei count, const GLdouble *value); typedef void (APIENTRYP PFNGLUNIFORMMATRIX2DVPROC) (GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); typedef void (APIENTRYP PFNGLUNIFORMMATRIX3DVPROC) (GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); typedef void (APIENTRYP PFNGLUNIFORMMATRIX4DVPROC) (GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); typedef void (APIENTRYP PFNGLUNIFORMMATRIX2X3DVPROC) (GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); typedef void (APIENTRYP PFNGLUNIFORMMATRIX2X4DVPROC) (GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); typedef void (APIENTRYP PFNGLUNIFORMMATRIX3X2DVPROC) (GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); typedef void (APIENTRYP PFNGLUNIFORMMATRIX3X4DVPROC) (GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); typedef void (APIENTRYP PFNGLUNIFORMMATRIX4X2DVPROC) (GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); typedef void (APIENTRYP PFNGLUNIFORMMATRIX4X3DVPROC) (GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); typedef void (APIENTRYP PFNGLGETUNIFORMDVPROC) (GLuint program, GLint location, GLdouble *params); typedef GLint (APIENTRYP PFNGLGETSUBROUTINEUNIFORMLOCATIONPROC) (GLuint program, GLenum shadertype, const GLchar *name); typedef GLuint (APIENTRYP PFNGLGETSUBROUTINEINDEXPROC) (GLuint program, GLenum shadertype, const GLchar *name); typedef void (APIENTRYP PFNGLGETACTIVESUBROUTINEUNIFORMIVPROC) (GLuint program, GLenum shadertype, GLuint index, GLenum pname, GLint *values); typedef void (APIENTRYP PFNGLGETACTIVESUBROUTINEUNIFORMNAMEPROC) (GLuint program, GLenum shadertype, GLuint index, GLsizei bufsize, GLsizei *length, GLchar *name); typedef void (APIENTRYP PFNGLGETACTIVESUBROUTINENAMEPROC) (GLuint program, GLenum shadertype, GLuint index, GLsizei bufsize, GLsizei *length, GLchar *name); typedef void (APIENTRYP PFNGLUNIFORMSUBROUTINESUIVPROC) (GLenum shadertype, GLsizei count, const GLuint *indices); typedef void (APIENTRYP PFNGLGETUNIFORMSUBROUTINEUIVPROC) (GLenum shadertype, GLint location, GLuint *params); typedef void (APIENTRYP PFNGLGETPROGRAMSTAGEIVPROC) (GLuint program, GLenum shadertype, GLenum pname, GLint *values); typedef void (APIENTRYP PFNGLPATCHPARAMETERIPROC) (GLenum pname, GLint value); typedef void (APIENTRYP PFNGLPATCHPARAMETERFVPROC) (GLenum pname, const GLfloat *values); typedef void (APIENTRYP PFNGLBINDTRANSFORMFEEDBACKPROC) (GLenum target, GLuint id); typedef void (APIENTRYP PFNGLDELETETRANSFORMFEEDBACKSPROC) (GLsizei n, const GLuint *ids); typedef void (APIENTRYP PFNGLGENTRANSFORMFEEDBACKSPROC) (GLsizei n, GLuint *ids); typedef GLboolean (APIENTRYP PFNGLISTRANSFORMFEEDBACKPROC) (GLuint id); typedef void (APIENTRYP PFNGLPAUSETRANSFORMFEEDBACKPROC) (void); typedef void (APIENTRYP PFNGLRESUMETRANSFORMFEEDBACKPROC) (void); typedef void (APIENTRYP PFNGLDRAWTRANSFORMFEEDBACKPROC) (GLenum mode, GLuint id); typedef void (APIENTRYP PFNGLDRAWTRANSFORMFEEDBACKSTREAMPROC) (GLenum mode, GLuint id, GLuint stream); typedef void (APIENTRYP PFNGLBEGINQUERYINDEXEDPROC) (GLenum target, GLuint index, GLuint id); typedef void (APIENTRYP PFNGLENDQUERYINDEXEDPROC) (GLenum target, GLuint index); typedef void (APIENTRYP PFNGLGETQUERYINDEXEDIVPROC) (GLenum target, GLuint index, GLenum pname, GLint *params); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glMinSampleShading (GLfloat value); GLAPI void APIENTRY glBlendEquationi (GLuint buf, GLenum mode); GLAPI void APIENTRY glBlendEquationSeparatei (GLuint buf, GLenum modeRGB, GLenum modeAlpha); GLAPI void APIENTRY glBlendFunci (GLuint buf, GLenum src, GLenum dst); GLAPI void APIENTRY glBlendFuncSeparatei (GLuint buf, GLenum srcRGB, GLenum dstRGB, GLenum srcAlpha, GLenum dstAlpha); GLAPI void APIENTRY glDrawArraysIndirect (GLenum mode, const void *indirect); GLAPI void APIENTRY glDrawElementsIndirect (GLenum mode, GLenum type, const void *indirect); GLAPI void APIENTRY glUniform1d (GLint location, GLdouble x); GLAPI void APIENTRY glUniform2d (GLint location, GLdouble x, GLdouble y); GLAPI void APIENTRY glUniform3d (GLint location, GLdouble x, GLdouble y, GLdouble z); GLAPI void APIENTRY glUniform4d (GLint location, GLdouble x, GLdouble y, GLdouble z, GLdouble w); GLAPI void APIENTRY glUniform1dv (GLint location, GLsizei count, const GLdouble *value); GLAPI void APIENTRY glUniform2dv (GLint location, GLsizei count, const GLdouble *value); GLAPI void APIENTRY glUniform3dv (GLint location, GLsizei count, const GLdouble *value); GLAPI void APIENTRY glUniform4dv (GLint location, GLsizei count, const GLdouble *value); GLAPI void APIENTRY glUniformMatrix2dv (GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); GLAPI void APIENTRY glUniformMatrix3dv (GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); GLAPI void APIENTRY glUniformMatrix4dv (GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); GLAPI void APIENTRY glUniformMatrix2x3dv (GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); GLAPI void APIENTRY glUniformMatrix2x4dv (GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); GLAPI void APIENTRY glUniformMatrix3x2dv (GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); GLAPI void APIENTRY glUniformMatrix3x4dv (GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); GLAPI void APIENTRY glUniformMatrix4x2dv (GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); GLAPI void APIENTRY glUniformMatrix4x3dv (GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); GLAPI void APIENTRY glGetUniformdv (GLuint program, GLint location, GLdouble *params); GLAPI GLint APIENTRY glGetSubroutineUniformLocation (GLuint program, GLenum shadertype, const GLchar *name); GLAPI GLuint APIENTRY glGetSubroutineIndex (GLuint program, GLenum shadertype, const GLchar *name); GLAPI void APIENTRY glGetActiveSubroutineUniformiv (GLuint program, GLenum shadertype, GLuint index, GLenum pname, GLint *values); GLAPI void APIENTRY glGetActiveSubroutineUniformName (GLuint program, GLenum shadertype, GLuint index, GLsizei bufsize, GLsizei *length, GLchar *name); GLAPI void APIENTRY glGetActiveSubroutineName (GLuint program, GLenum shadertype, GLuint index, GLsizei bufsize, GLsizei *length, GLchar *name); GLAPI void APIENTRY glUniformSubroutinesuiv (GLenum shadertype, GLsizei count, const GLuint *indices); GLAPI void APIENTRY glGetUniformSubroutineuiv (GLenum shadertype, GLint location, GLuint *params); GLAPI void APIENTRY glGetProgramStageiv (GLuint program, GLenum shadertype, GLenum pname, GLint *values); GLAPI void APIENTRY glPatchParameteri (GLenum pname, GLint value); GLAPI void APIENTRY glPatchParameterfv (GLenum pname, const GLfloat *values); GLAPI void APIENTRY glBindTransformFeedback (GLenum target, GLuint id); GLAPI void APIENTRY glDeleteTransformFeedbacks (GLsizei n, const GLuint *ids); GLAPI void APIENTRY glGenTransformFeedbacks (GLsizei n, GLuint *ids); GLAPI GLboolean APIENTRY glIsTransformFeedback (GLuint id); GLAPI void APIENTRY glPauseTransformFeedback (void); GLAPI void APIENTRY glResumeTransformFeedback (void); GLAPI void APIENTRY glDrawTransformFeedback (GLenum mode, GLuint id); GLAPI void APIENTRY glDrawTransformFeedbackStream (GLenum mode, GLuint id, GLuint stream); GLAPI void APIENTRY glBeginQueryIndexed (GLenum target, GLuint index, GLuint id); GLAPI void APIENTRY glEndQueryIndexed (GLenum target, GLuint index); GLAPI void APIENTRY glGetQueryIndexediv (GLenum target, GLuint index, GLenum pname, GLint *params); #endif #endif /* GL_VERSION_4_0 */ #ifndef GL_VERSION_4_1 #define GL_VERSION_4_1 1 #define GL_FIXED 0x140C #define GL_IMPLEMENTATION_COLOR_READ_TYPE 0x8B9A #define GL_IMPLEMENTATION_COLOR_READ_FORMAT 0x8B9B #define GL_LOW_FLOAT 0x8DF0 #define GL_MEDIUM_FLOAT 0x8DF1 #define GL_HIGH_FLOAT 0x8DF2 #define GL_LOW_INT 0x8DF3 #define GL_MEDIUM_INT 0x8DF4 #define GL_HIGH_INT 0x8DF5 #define GL_SHADER_COMPILER 0x8DFA #define GL_SHADER_BINARY_FORMATS 0x8DF8 #define GL_NUM_SHADER_BINARY_FORMATS 0x8DF9 #define GL_MAX_VERTEX_UNIFORM_VECTORS 0x8DFB #define GL_MAX_VARYING_VECTORS 0x8DFC #define GL_MAX_FRAGMENT_UNIFORM_VECTORS 0x8DFD #define GL_RGB565 0x8D62 #define GL_PROGRAM_BINARY_RETRIEVABLE_HINT 0x8257 #define GL_PROGRAM_BINARY_LENGTH 0x8741 #define GL_NUM_PROGRAM_BINARY_FORMATS 0x87FE #define GL_PROGRAM_BINARY_FORMATS 0x87FF #define GL_VERTEX_SHADER_BIT 0x00000001 #define GL_FRAGMENT_SHADER_BIT 0x00000002 #define GL_GEOMETRY_SHADER_BIT 0x00000004 #define GL_TESS_CONTROL_SHADER_BIT 0x00000008 #define GL_TESS_EVALUATION_SHADER_BIT 0x00000010 #define GL_ALL_SHADER_BITS 0xFFFFFFFF #define GL_PROGRAM_SEPARABLE 0x8258 #define GL_ACTIVE_PROGRAM 0x8259 #define GL_PROGRAM_PIPELINE_BINDING 0x825A #define GL_MAX_VIEWPORTS 0x825B #define GL_VIEWPORT_SUBPIXEL_BITS 0x825C #define GL_VIEWPORT_BOUNDS_RANGE 0x825D #define GL_LAYER_PROVOKING_VERTEX 0x825E #define GL_VIEWPORT_INDEX_PROVOKING_VERTEX 0x825F #define GL_UNDEFINED_VERTEX 0x8260 typedef void (APIENTRYP PFNGLRELEASESHADERCOMPILERPROC) (void); typedef void (APIENTRYP PFNGLSHADERBINARYPROC) (GLsizei count, const GLuint *shaders, GLenum binaryformat, const void *binary, GLsizei length); typedef void (APIENTRYP PFNGLGETSHADERPRECISIONFORMATPROC) (GLenum shadertype, GLenum precisiontype, GLint *range, GLint *precision); typedef void (APIENTRYP PFNGLDEPTHRANGEFPROC) (GLfloat n, GLfloat f); typedef void (APIENTRYP PFNGLCLEARDEPTHFPROC) (GLfloat d); typedef void (APIENTRYP PFNGLGETPROGRAMBINARYPROC) (GLuint program, GLsizei bufSize, GLsizei *length, GLenum *binaryFormat, void *binary); typedef void (APIENTRYP PFNGLPROGRAMBINARYPROC) (GLuint program, GLenum binaryFormat, const void *binary, GLsizei length); typedef void (APIENTRYP PFNGLPROGRAMPARAMETERIPROC) (GLuint program, GLenum pname, GLint value); typedef void (APIENTRYP PFNGLUSEPROGRAMSTAGESPROC) (GLuint pipeline, GLbitfield stages, GLuint program); typedef void (APIENTRYP PFNGLACTIVESHADERPROGRAMPROC) (GLuint pipeline, GLuint program); typedef GLuint (APIENTRYP PFNGLCREATESHADERPROGRAMVPROC) (GLenum type, GLsizei count, const GLchar *const*strings); typedef void (APIENTRYP PFNGLBINDPROGRAMPIPELINEPROC) (GLuint pipeline); typedef void (APIENTRYP PFNGLDELETEPROGRAMPIPELINESPROC) (GLsizei n, const GLuint *pipelines); typedef void (APIENTRYP PFNGLGENPROGRAMPIPELINESPROC) (GLsizei n, GLuint *pipelines); typedef GLboolean (APIENTRYP PFNGLISPROGRAMPIPELINEPROC) (GLuint pipeline); typedef void (APIENTRYP PFNGLGETPROGRAMPIPELINEIVPROC) (GLuint pipeline, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM1IPROC) (GLuint program, GLint location, GLint v0); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM1IVPROC) (GLuint program, GLint location, GLsizei count, const GLint *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM1FPROC) (GLuint program, GLint location, GLfloat v0); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM1FVPROC) (GLuint program, GLint location, GLsizei count, const GLfloat *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM1DPROC) (GLuint program, GLint location, GLdouble v0); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM1DVPROC) (GLuint program, GLint location, GLsizei count, const GLdouble *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM1UIPROC) (GLuint program, GLint location, GLuint v0); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM1UIVPROC) (GLuint program, GLint location, GLsizei count, const GLuint *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM2IPROC) (GLuint program, GLint location, GLint v0, GLint v1); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM2IVPROC) (GLuint program, GLint location, GLsizei count, const GLint *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM2FPROC) (GLuint program, GLint location, GLfloat v0, GLfloat v1); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM2FVPROC) (GLuint program, GLint location, GLsizei count, const GLfloat *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM2DPROC) (GLuint program, GLint location, GLdouble v0, GLdouble v1); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM2DVPROC) (GLuint program, GLint location, GLsizei count, const GLdouble *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM2UIPROC) (GLuint program, GLint location, GLuint v0, GLuint v1); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM2UIVPROC) (GLuint program, GLint location, GLsizei count, const GLuint *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM3IPROC) (GLuint program, GLint location, GLint v0, GLint v1, GLint v2); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM3IVPROC) (GLuint program, GLint location, GLsizei count, const GLint *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM3FPROC) (GLuint program, GLint location, GLfloat v0, GLfloat v1, GLfloat v2); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM3FVPROC) (GLuint program, GLint location, GLsizei count, const GLfloat *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM3DPROC) (GLuint program, GLint location, GLdouble v0, GLdouble v1, GLdouble v2); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM3DVPROC) (GLuint program, GLint location, GLsizei count, const GLdouble *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM3UIPROC) (GLuint program, GLint location, GLuint v0, GLuint v1, GLuint v2); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM3UIVPROC) (GLuint program, GLint location, GLsizei count, const GLuint *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM4IPROC) (GLuint program, GLint location, GLint v0, GLint v1, GLint v2, GLint v3); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM4IVPROC) (GLuint program, GLint location, GLsizei count, const GLint *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM4FPROC) (GLuint program, GLint location, GLfloat v0, GLfloat v1, GLfloat v2, GLfloat v3); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM4FVPROC) (GLuint program, GLint location, GLsizei count, const GLfloat *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM4DPROC) (GLuint program, GLint location, GLdouble v0, GLdouble v1, GLdouble v2, GLdouble v3); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM4DVPROC) (GLuint program, GLint location, GLsizei count, const GLdouble *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM4UIPROC) (GLuint program, GLint location, GLuint v0, GLuint v1, GLuint v2, GLuint v3); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM4UIVPROC) (GLuint program, GLint location, GLsizei count, const GLuint *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORMMATRIX2FVPROC) (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORMMATRIX3FVPROC) (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORMMATRIX4FVPROC) (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORMMATRIX2DVPROC) (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORMMATRIX3DVPROC) (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORMMATRIX4DVPROC) (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORMMATRIX2X3FVPROC) (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORMMATRIX3X2FVPROC) (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORMMATRIX2X4FVPROC) (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORMMATRIX4X2FVPROC) (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORMMATRIX3X4FVPROC) (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORMMATRIX4X3FVPROC) (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORMMATRIX2X3DVPROC) (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORMMATRIX3X2DVPROC) (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORMMATRIX2X4DVPROC) (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORMMATRIX4X2DVPROC) (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORMMATRIX3X4DVPROC) (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORMMATRIX4X3DVPROC) (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); typedef void (APIENTRYP PFNGLVALIDATEPROGRAMPIPELINEPROC) (GLuint pipeline); typedef void (APIENTRYP PFNGLGETPROGRAMPIPELINEINFOLOGPROC) (GLuint pipeline, GLsizei bufSize, GLsizei *length, GLchar *infoLog); typedef void (APIENTRYP PFNGLVERTEXATTRIBL1DPROC) (GLuint index, GLdouble x); typedef void (APIENTRYP PFNGLVERTEXATTRIBL2DPROC) (GLuint index, GLdouble x, GLdouble y); typedef void (APIENTRYP PFNGLVERTEXATTRIBL3DPROC) (GLuint index, GLdouble x, GLdouble y, GLdouble z); typedef void (APIENTRYP PFNGLVERTEXATTRIBL4DPROC) (GLuint index, GLdouble x, GLdouble y, GLdouble z, GLdouble w); typedef void (APIENTRYP PFNGLVERTEXATTRIBL1DVPROC) (GLuint index, const GLdouble *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBL2DVPROC) (GLuint index, const GLdouble *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBL3DVPROC) (GLuint index, const GLdouble *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBL4DVPROC) (GLuint index, const GLdouble *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBLPOINTERPROC) (GLuint index, GLint size, GLenum type, GLsizei stride, const void *pointer); typedef void (APIENTRYP PFNGLGETVERTEXATTRIBLDVPROC) (GLuint index, GLenum pname, GLdouble *params); typedef void (APIENTRYP PFNGLVIEWPORTARRAYVPROC) (GLuint first, GLsizei count, const GLfloat *v); typedef void (APIENTRYP PFNGLVIEWPORTINDEXEDFPROC) (GLuint index, GLfloat x, GLfloat y, GLfloat w, GLfloat h); typedef void (APIENTRYP PFNGLVIEWPORTINDEXEDFVPROC) (GLuint index, const GLfloat *v); typedef void (APIENTRYP PFNGLSCISSORARRAYVPROC) (GLuint first, GLsizei count, const GLint *v); typedef void (APIENTRYP PFNGLSCISSORINDEXEDPROC) (GLuint index, GLint left, GLint bottom, GLsizei width, GLsizei height); typedef void (APIENTRYP PFNGLSCISSORINDEXEDVPROC) (GLuint index, const GLint *v); typedef void (APIENTRYP PFNGLDEPTHRANGEARRAYVPROC) (GLuint first, GLsizei count, const GLdouble *v); typedef void (APIENTRYP PFNGLDEPTHRANGEINDEXEDPROC) (GLuint index, GLdouble n, GLdouble f); typedef void (APIENTRYP PFNGLGETFLOATI_VPROC) (GLenum target, GLuint index, GLfloat *data); typedef void (APIENTRYP PFNGLGETDOUBLEI_VPROC) (GLenum target, GLuint index, GLdouble *data); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glReleaseShaderCompiler (void); GLAPI void APIENTRY glShaderBinary (GLsizei count, const GLuint *shaders, GLenum binaryformat, const void *binary, GLsizei length); GLAPI void APIENTRY glGetShaderPrecisionFormat (GLenum shadertype, GLenum precisiontype, GLint *range, GLint *precision); GLAPI void APIENTRY glDepthRangef (GLfloat n, GLfloat f); GLAPI void APIENTRY glClearDepthf (GLfloat d); GLAPI void APIENTRY glGetProgramBinary (GLuint program, GLsizei bufSize, GLsizei *length, GLenum *binaryFormat, void *binary); GLAPI void APIENTRY glProgramBinary (GLuint program, GLenum binaryFormat, const void *binary, GLsizei length); GLAPI void APIENTRY glProgramParameteri (GLuint program, GLenum pname, GLint value); GLAPI void APIENTRY glUseProgramStages (GLuint pipeline, GLbitfield stages, GLuint program); GLAPI void APIENTRY glActiveShaderProgram (GLuint pipeline, GLuint program); GLAPI GLuint APIENTRY glCreateShaderProgramv (GLenum type, GLsizei count, const GLchar *const*strings); GLAPI void APIENTRY glBindProgramPipeline (GLuint pipeline); GLAPI void APIENTRY glDeleteProgramPipelines (GLsizei n, const GLuint *pipelines); GLAPI void APIENTRY glGenProgramPipelines (GLsizei n, GLuint *pipelines); GLAPI GLboolean APIENTRY glIsProgramPipeline (GLuint pipeline); GLAPI void APIENTRY glGetProgramPipelineiv (GLuint pipeline, GLenum pname, GLint *params); GLAPI void APIENTRY glProgramUniform1i (GLuint program, GLint location, GLint v0); GLAPI void APIENTRY glProgramUniform1iv (GLuint program, GLint location, GLsizei count, const GLint *value); GLAPI void APIENTRY glProgramUniform1f (GLuint program, GLint location, GLfloat v0); GLAPI void APIENTRY glProgramUniform1fv (GLuint program, GLint location, GLsizei count, const GLfloat *value); GLAPI void APIENTRY glProgramUniform1d (GLuint program, GLint location, GLdouble v0); GLAPI void APIENTRY glProgramUniform1dv (GLuint program, GLint location, GLsizei count, const GLdouble *value); GLAPI void APIENTRY glProgramUniform1ui (GLuint program, GLint location, GLuint v0); GLAPI void APIENTRY glProgramUniform1uiv (GLuint program, GLint location, GLsizei count, const GLuint *value); GLAPI void APIENTRY glProgramUniform2i (GLuint program, GLint location, GLint v0, GLint v1); GLAPI void APIENTRY glProgramUniform2iv (GLuint program, GLint location, GLsizei count, const GLint *value); GLAPI void APIENTRY glProgramUniform2f (GLuint program, GLint location, GLfloat v0, GLfloat v1); GLAPI void APIENTRY glProgramUniform2fv (GLuint program, GLint location, GLsizei count, const GLfloat *value); GLAPI void APIENTRY glProgramUniform2d (GLuint program, GLint location, GLdouble v0, GLdouble v1); GLAPI void APIENTRY glProgramUniform2dv (GLuint program, GLint location, GLsizei count, const GLdouble *value); GLAPI void APIENTRY glProgramUniform2ui (GLuint program, GLint location, GLuint v0, GLuint v1); GLAPI void APIENTRY glProgramUniform2uiv (GLuint program, GLint location, GLsizei count, const GLuint *value); GLAPI void APIENTRY glProgramUniform3i (GLuint program, GLint location, GLint v0, GLint v1, GLint v2); GLAPI void APIENTRY glProgramUniform3iv (GLuint program, GLint location, GLsizei count, const GLint *value); GLAPI void APIENTRY glProgramUniform3f (GLuint program, GLint location, GLfloat v0, GLfloat v1, GLfloat v2); GLAPI void APIENTRY glProgramUniform3fv (GLuint program, GLint location, GLsizei count, const GLfloat *value); GLAPI void APIENTRY glProgramUniform3d (GLuint program, GLint location, GLdouble v0, GLdouble v1, GLdouble v2); GLAPI void APIENTRY glProgramUniform3dv (GLuint program, GLint location, GLsizei count, const GLdouble *value); GLAPI void APIENTRY glProgramUniform3ui (GLuint program, GLint location, GLuint v0, GLuint v1, GLuint v2); GLAPI void APIENTRY glProgramUniform3uiv (GLuint program, GLint location, GLsizei count, const GLuint *value); GLAPI void APIENTRY glProgramUniform4i (GLuint program, GLint location, GLint v0, GLint v1, GLint v2, GLint v3); GLAPI void APIENTRY glProgramUniform4iv (GLuint program, GLint location, GLsizei count, const GLint *value); GLAPI void APIENTRY glProgramUniform4f (GLuint program, GLint location, GLfloat v0, GLfloat v1, GLfloat v2, GLfloat v3); GLAPI void APIENTRY glProgramUniform4fv (GLuint program, GLint location, GLsizei count, const GLfloat *value); GLAPI void APIENTRY glProgramUniform4d (GLuint program, GLint location, GLdouble v0, GLdouble v1, GLdouble v2, GLdouble v3); GLAPI void APIENTRY glProgramUniform4dv (GLuint program, GLint location, GLsizei count, const GLdouble *value); GLAPI void APIENTRY glProgramUniform4ui (GLuint program, GLint location, GLuint v0, GLuint v1, GLuint v2, GLuint v3); GLAPI void APIENTRY glProgramUniform4uiv (GLuint program, GLint location, GLsizei count, const GLuint *value); GLAPI void APIENTRY glProgramUniformMatrix2fv (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); GLAPI void APIENTRY glProgramUniformMatrix3fv (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); GLAPI void APIENTRY glProgramUniformMatrix4fv (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); GLAPI void APIENTRY glProgramUniformMatrix2dv (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); GLAPI void APIENTRY glProgramUniformMatrix3dv (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); GLAPI void APIENTRY glProgramUniformMatrix4dv (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); GLAPI void APIENTRY glProgramUniformMatrix2x3fv (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); GLAPI void APIENTRY glProgramUniformMatrix3x2fv (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); GLAPI void APIENTRY glProgramUniformMatrix2x4fv (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); GLAPI void APIENTRY glProgramUniformMatrix4x2fv (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); GLAPI void APIENTRY glProgramUniformMatrix3x4fv (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); GLAPI void APIENTRY glProgramUniformMatrix4x3fv (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); GLAPI void APIENTRY glProgramUniformMatrix2x3dv (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); GLAPI void APIENTRY glProgramUniformMatrix3x2dv (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); GLAPI void APIENTRY glProgramUniformMatrix2x4dv (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); GLAPI void APIENTRY glProgramUniformMatrix4x2dv (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); GLAPI void APIENTRY glProgramUniformMatrix3x4dv (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); GLAPI void APIENTRY glProgramUniformMatrix4x3dv (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); GLAPI void APIENTRY glValidateProgramPipeline (GLuint pipeline); GLAPI void APIENTRY glGetProgramPipelineInfoLog (GLuint pipeline, GLsizei bufSize, GLsizei *length, GLchar *infoLog); GLAPI void APIENTRY glVertexAttribL1d (GLuint index, GLdouble x); GLAPI void APIENTRY glVertexAttribL2d (GLuint index, GLdouble x, GLdouble y); GLAPI void APIENTRY glVertexAttribL3d (GLuint index, GLdouble x, GLdouble y, GLdouble z); GLAPI void APIENTRY glVertexAttribL4d (GLuint index, GLdouble x, GLdouble y, GLdouble z, GLdouble w); GLAPI void APIENTRY glVertexAttribL1dv (GLuint index, const GLdouble *v); GLAPI void APIENTRY glVertexAttribL2dv (GLuint index, const GLdouble *v); GLAPI void APIENTRY glVertexAttribL3dv (GLuint index, const GLdouble *v); GLAPI void APIENTRY glVertexAttribL4dv (GLuint index, const GLdouble *v); GLAPI void APIENTRY glVertexAttribLPointer (GLuint index, GLint size, GLenum type, GLsizei stride, const void *pointer); GLAPI void APIENTRY glGetVertexAttribLdv (GLuint index, GLenum pname, GLdouble *params); GLAPI void APIENTRY glViewportArrayv (GLuint first, GLsizei count, const GLfloat *v); GLAPI void APIENTRY glViewportIndexedf (GLuint index, GLfloat x, GLfloat y, GLfloat w, GLfloat h); GLAPI void APIENTRY glViewportIndexedfv (GLuint index, const GLfloat *v); GLAPI void APIENTRY glScissorArrayv (GLuint first, GLsizei count, const GLint *v); GLAPI void APIENTRY glScissorIndexed (GLuint index, GLint left, GLint bottom, GLsizei width, GLsizei height); GLAPI void APIENTRY glScissorIndexedv (GLuint index, const GLint *v); GLAPI void APIENTRY glDepthRangeArrayv (GLuint first, GLsizei count, const GLdouble *v); GLAPI void APIENTRY glDepthRangeIndexed (GLuint index, GLdouble n, GLdouble f); GLAPI void APIENTRY glGetFloati_v (GLenum target, GLuint index, GLfloat *data); GLAPI void APIENTRY glGetDoublei_v (GLenum target, GLuint index, GLdouble *data); #endif #endif /* GL_VERSION_4_1 */ #ifndef GL_VERSION_4_2 #define GL_VERSION_4_2 1 #define GL_UNPACK_COMPRESSED_BLOCK_WIDTH 0x9127 #define GL_UNPACK_COMPRESSED_BLOCK_HEIGHT 0x9128 #define GL_UNPACK_COMPRESSED_BLOCK_DEPTH 0x9129 #define GL_UNPACK_COMPRESSED_BLOCK_SIZE 0x912A #define GL_PACK_COMPRESSED_BLOCK_WIDTH 0x912B #define GL_PACK_COMPRESSED_BLOCK_HEIGHT 0x912C #define GL_PACK_COMPRESSED_BLOCK_DEPTH 0x912D #define GL_PACK_COMPRESSED_BLOCK_SIZE 0x912E #define GL_NUM_SAMPLE_COUNTS 0x9380 #define GL_MIN_MAP_BUFFER_ALIGNMENT 0x90BC #define GL_ATOMIC_COUNTER_BUFFER 0x92C0 #define GL_ATOMIC_COUNTER_BUFFER_BINDING 0x92C1 #define GL_ATOMIC_COUNTER_BUFFER_START 0x92C2 #define GL_ATOMIC_COUNTER_BUFFER_SIZE 0x92C3 #define GL_ATOMIC_COUNTER_BUFFER_DATA_SIZE 0x92C4 #define GL_ATOMIC_COUNTER_BUFFER_ACTIVE_ATOMIC_COUNTERS 0x92C5 #define GL_ATOMIC_COUNTER_BUFFER_ACTIVE_ATOMIC_COUNTER_INDICES 0x92C6 #define GL_ATOMIC_COUNTER_BUFFER_REFERENCED_BY_VERTEX_SHADER 0x92C7 #define GL_ATOMIC_COUNTER_BUFFER_REFERENCED_BY_TESS_CONTROL_SHADER 0x92C8 #define GL_ATOMIC_COUNTER_BUFFER_REFERENCED_BY_TESS_EVALUATION_SHADER 0x92C9 #define GL_ATOMIC_COUNTER_BUFFER_REFERENCED_BY_GEOMETRY_SHADER 0x92CA #define GL_ATOMIC_COUNTER_BUFFER_REFERENCED_BY_FRAGMENT_SHADER 0x92CB #define GL_MAX_VERTEX_ATOMIC_COUNTER_BUFFERS 0x92CC #define GL_MAX_TESS_CONTROL_ATOMIC_COUNTER_BUFFERS 0x92CD #define GL_MAX_TESS_EVALUATION_ATOMIC_COUNTER_BUFFERS 0x92CE #define GL_MAX_GEOMETRY_ATOMIC_COUNTER_BUFFERS 0x92CF #define GL_MAX_FRAGMENT_ATOMIC_COUNTER_BUFFERS 0x92D0 #define GL_MAX_COMBINED_ATOMIC_COUNTER_BUFFERS 0x92D1 #define GL_MAX_VERTEX_ATOMIC_COUNTERS 0x92D2 #define GL_MAX_TESS_CONTROL_ATOMIC_COUNTERS 0x92D3 #define GL_MAX_TESS_EVALUATION_ATOMIC_COUNTERS 0x92D4 #define GL_MAX_GEOMETRY_ATOMIC_COUNTERS 0x92D5 #define GL_MAX_FRAGMENT_ATOMIC_COUNTERS 0x92D6 #define GL_MAX_COMBINED_ATOMIC_COUNTERS 0x92D7 #define GL_MAX_ATOMIC_COUNTER_BUFFER_SIZE 0x92D8 #define GL_MAX_ATOMIC_COUNTER_BUFFER_BINDINGS 0x92DC #define GL_ACTIVE_ATOMIC_COUNTER_BUFFERS 0x92D9 #define GL_UNIFORM_ATOMIC_COUNTER_BUFFER_INDEX 0x92DA #define GL_UNSIGNED_INT_ATOMIC_COUNTER 0x92DB #define GL_VERTEX_ATTRIB_ARRAY_BARRIER_BIT 0x00000001 #define GL_ELEMENT_ARRAY_BARRIER_BIT 0x00000002 #define GL_UNIFORM_BARRIER_BIT 0x00000004 #define GL_TEXTURE_FETCH_BARRIER_BIT 0x00000008 #define GL_SHADER_IMAGE_ACCESS_BARRIER_BIT 0x00000020 #define GL_COMMAND_BARRIER_BIT 0x00000040 #define GL_PIXEL_BUFFER_BARRIER_BIT 0x00000080 #define GL_TEXTURE_UPDATE_BARRIER_BIT 0x00000100 #define GL_BUFFER_UPDATE_BARRIER_BIT 0x00000200 #define GL_FRAMEBUFFER_BARRIER_BIT 0x00000400 #define GL_TRANSFORM_FEEDBACK_BARRIER_BIT 0x00000800 #define GL_ATOMIC_COUNTER_BARRIER_BIT 0x00001000 #define GL_ALL_BARRIER_BITS 0xFFFFFFFF #define GL_MAX_IMAGE_UNITS 0x8F38 #define GL_MAX_COMBINED_IMAGE_UNITS_AND_FRAGMENT_OUTPUTS 0x8F39 #define GL_IMAGE_BINDING_NAME 0x8F3A #define GL_IMAGE_BINDING_LEVEL 0x8F3B #define GL_IMAGE_BINDING_LAYERED 0x8F3C #define GL_IMAGE_BINDING_LAYER 0x8F3D #define GL_IMAGE_BINDING_ACCESS 0x8F3E #define GL_IMAGE_1D 0x904C #define GL_IMAGE_2D 0x904D #define GL_IMAGE_3D 0x904E #define GL_IMAGE_2D_RECT 0x904F #define GL_IMAGE_CUBE 0x9050 #define GL_IMAGE_BUFFER 0x9051 #define GL_IMAGE_1D_ARRAY 0x9052 #define GL_IMAGE_2D_ARRAY 0x9053 #define GL_IMAGE_CUBE_MAP_ARRAY 0x9054 #define GL_IMAGE_2D_MULTISAMPLE 0x9055 #define GL_IMAGE_2D_MULTISAMPLE_ARRAY 0x9056 #define GL_INT_IMAGE_1D 0x9057 #define GL_INT_IMAGE_2D 0x9058 #define GL_INT_IMAGE_3D 0x9059 #define GL_INT_IMAGE_2D_RECT 0x905A #define GL_INT_IMAGE_CUBE 0x905B #define GL_INT_IMAGE_BUFFER 0x905C #define GL_INT_IMAGE_1D_ARRAY 0x905D #define GL_INT_IMAGE_2D_ARRAY 0x905E #define GL_INT_IMAGE_CUBE_MAP_ARRAY 0x905F #define GL_INT_IMAGE_2D_MULTISAMPLE 0x9060 #define GL_INT_IMAGE_2D_MULTISAMPLE_ARRAY 0x9061 #define GL_UNSIGNED_INT_IMAGE_1D 0x9062 #define GL_UNSIGNED_INT_IMAGE_2D 0x9063 #define GL_UNSIGNED_INT_IMAGE_3D 0x9064 #define GL_UNSIGNED_INT_IMAGE_2D_RECT 0x9065 #define GL_UNSIGNED_INT_IMAGE_CUBE 0x9066 #define GL_UNSIGNED_INT_IMAGE_BUFFER 0x9067 #define GL_UNSIGNED_INT_IMAGE_1D_ARRAY 0x9068 #define GL_UNSIGNED_INT_IMAGE_2D_ARRAY 0x9069 #define GL_UNSIGNED_INT_IMAGE_CUBE_MAP_ARRAY 0x906A #define GL_UNSIGNED_INT_IMAGE_2D_MULTISAMPLE 0x906B #define GL_UNSIGNED_INT_IMAGE_2D_MULTISAMPLE_ARRAY 0x906C #define GL_MAX_IMAGE_SAMPLES 0x906D #define GL_IMAGE_BINDING_FORMAT 0x906E #define GL_IMAGE_FORMAT_COMPATIBILITY_TYPE 0x90C7 #define GL_IMAGE_FORMAT_COMPATIBILITY_BY_SIZE 0x90C8 #define GL_IMAGE_FORMAT_COMPATIBILITY_BY_CLASS 0x90C9 #define GL_MAX_VERTEX_IMAGE_UNIFORMS 0x90CA #define GL_MAX_TESS_CONTROL_IMAGE_UNIFORMS 0x90CB #define GL_MAX_TESS_EVALUATION_IMAGE_UNIFORMS 0x90CC #define GL_MAX_GEOMETRY_IMAGE_UNIFORMS 0x90CD #define GL_MAX_FRAGMENT_IMAGE_UNIFORMS 0x90CE #define GL_MAX_COMBINED_IMAGE_UNIFORMS 0x90CF #define GL_COMPRESSED_RGBA_BPTC_UNORM 0x8E8C #define GL_COMPRESSED_SRGB_ALPHA_BPTC_UNORM 0x8E8D #define GL_COMPRESSED_RGB_BPTC_SIGNED_FLOAT 0x8E8E #define GL_COMPRESSED_RGB_BPTC_UNSIGNED_FLOAT 0x8E8F #define GL_TEXTURE_IMMUTABLE_FORMAT 0x912F typedef void (APIENTRYP PFNGLDRAWARRAYSINSTANCEDBASEINSTANCEPROC) (GLenum mode, GLint first, GLsizei count, GLsizei instancecount, GLuint baseinstance); typedef void (APIENTRYP PFNGLDRAWELEMENTSINSTANCEDBASEINSTANCEPROC) (GLenum mode, GLsizei count, GLenum type, const void *indices, GLsizei instancecount, GLuint baseinstance); typedef void (APIENTRYP PFNGLDRAWELEMENTSINSTANCEDBASEVERTEXBASEINSTANCEPROC) (GLenum mode, GLsizei count, GLenum type, const void *indices, GLsizei instancecount, GLint basevertex, GLuint baseinstance); typedef void (APIENTRYP PFNGLGETINTERNALFORMATIVPROC) (GLenum target, GLenum internalformat, GLenum pname, GLsizei bufSize, GLint *params); typedef void (APIENTRYP PFNGLGETACTIVEATOMICCOUNTERBUFFERIVPROC) (GLuint program, GLuint bufferIndex, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLBINDIMAGETEXTUREPROC) (GLuint unit, GLuint texture, GLint level, GLboolean layered, GLint layer, GLenum access, GLenum format); typedef void (APIENTRYP PFNGLMEMORYBARRIERPROC) (GLbitfield barriers); typedef void (APIENTRYP PFNGLTEXSTORAGE1DPROC) (GLenum target, GLsizei levels, GLenum internalformat, GLsizei width); typedef void (APIENTRYP PFNGLTEXSTORAGE2DPROC) (GLenum target, GLsizei levels, GLenum internalformat, GLsizei width, GLsizei height); typedef void (APIENTRYP PFNGLTEXSTORAGE3DPROC) (GLenum target, GLsizei levels, GLenum internalformat, GLsizei width, GLsizei height, GLsizei depth); typedef void (APIENTRYP PFNGLDRAWTRANSFORMFEEDBACKINSTANCEDPROC) (GLenum mode, GLuint id, GLsizei instancecount); typedef void (APIENTRYP PFNGLDRAWTRANSFORMFEEDBACKSTREAMINSTANCEDPROC) (GLenum mode, GLuint id, GLuint stream, GLsizei instancecount); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glDrawArraysInstancedBaseInstance (GLenum mode, GLint first, GLsizei count, GLsizei instancecount, GLuint baseinstance); GLAPI void APIENTRY glDrawElementsInstancedBaseInstance (GLenum mode, GLsizei count, GLenum type, const void *indices, GLsizei instancecount, GLuint baseinstance); GLAPI void APIENTRY glDrawElementsInstancedBaseVertexBaseInstance (GLenum mode, GLsizei count, GLenum type, const void *indices, GLsizei instancecount, GLint basevertex, GLuint baseinstance); GLAPI void APIENTRY glGetInternalformativ (GLenum target, GLenum internalformat, GLenum pname, GLsizei bufSize, GLint *params); GLAPI void APIENTRY glGetActiveAtomicCounterBufferiv (GLuint program, GLuint bufferIndex, GLenum pname, GLint *params); GLAPI void APIENTRY glBindImageTexture (GLuint unit, GLuint texture, GLint level, GLboolean layered, GLint layer, GLenum access, GLenum format); GLAPI void APIENTRY glMemoryBarrier (GLbitfield barriers); GLAPI void APIENTRY glTexStorage1D (GLenum target, GLsizei levels, GLenum internalformat, GLsizei width); GLAPI void APIENTRY glTexStorage2D (GLenum target, GLsizei levels, GLenum internalformat, GLsizei width, GLsizei height); GLAPI void APIENTRY glTexStorage3D (GLenum target, GLsizei levels, GLenum internalformat, GLsizei width, GLsizei height, GLsizei depth); GLAPI void APIENTRY glDrawTransformFeedbackInstanced (GLenum mode, GLuint id, GLsizei instancecount); GLAPI void APIENTRY glDrawTransformFeedbackStreamInstanced (GLenum mode, GLuint id, GLuint stream, GLsizei instancecount); #endif #endif /* GL_VERSION_4_2 */ #ifndef GL_VERSION_4_3 #define GL_VERSION_4_3 1 typedef void (APIENTRY *GLDEBUGPROC)(GLenum source,GLenum type,GLuint id,GLenum severity,GLsizei length,const GLchar *message,const void *userParam); #define GL_NUM_SHADING_LANGUAGE_VERSIONS 0x82E9 #define GL_VERTEX_ATTRIB_ARRAY_LONG 0x874E #define GL_COMPRESSED_RGB8_ETC2 0x9274 #define GL_COMPRESSED_SRGB8_ETC2 0x9275 #define GL_COMPRESSED_RGB8_PUNCHTHROUGH_ALPHA1_ETC2 0x9276 #define GL_COMPRESSED_SRGB8_PUNCHTHROUGH_ALPHA1_ETC2 0x9277 #define GL_COMPRESSED_RGBA8_ETC2_EAC 0x9278 #define GL_COMPRESSED_SRGB8_ALPHA8_ETC2_EAC 0x9279 #define GL_COMPRESSED_R11_EAC 0x9270 #define GL_COMPRESSED_SIGNED_R11_EAC 0x9271 #define GL_COMPRESSED_RG11_EAC 0x9272 #define GL_COMPRESSED_SIGNED_RG11_EAC 0x9273 #define GL_PRIMITIVE_RESTART_FIXED_INDEX 0x8D69 #define GL_ANY_SAMPLES_PASSED_CONSERVATIVE 0x8D6A #define GL_MAX_ELEMENT_INDEX 0x8D6B #define GL_COMPUTE_SHADER 0x91B9 #define GL_MAX_COMPUTE_UNIFORM_BLOCKS 0x91BB #define GL_MAX_COMPUTE_TEXTURE_IMAGE_UNITS 0x91BC #define GL_MAX_COMPUTE_IMAGE_UNIFORMS 0x91BD #define GL_MAX_COMPUTE_SHARED_MEMORY_SIZE 0x8262 #define GL_MAX_COMPUTE_UNIFORM_COMPONENTS 0x8263 #define GL_MAX_COMPUTE_ATOMIC_COUNTER_BUFFERS 0x8264 #define GL_MAX_COMPUTE_ATOMIC_COUNTERS 0x8265 #define GL_MAX_COMBINED_COMPUTE_UNIFORM_COMPONENTS 0x8266 #define GL_MAX_COMPUTE_WORK_GROUP_INVOCATIONS 0x90EB #define GL_MAX_COMPUTE_WORK_GROUP_COUNT 0x91BE #define GL_MAX_COMPUTE_WORK_GROUP_SIZE 0x91BF #define GL_COMPUTE_WORK_GROUP_SIZE 0x8267 #define GL_UNIFORM_BLOCK_REFERENCED_BY_COMPUTE_SHADER 0x90EC #define GL_ATOMIC_COUNTER_BUFFER_REFERENCED_BY_COMPUTE_SHADER 0x90ED #define GL_DISPATCH_INDIRECT_BUFFER 0x90EE #define GL_DISPATCH_INDIRECT_BUFFER_BINDING 0x90EF #define GL_DEBUG_OUTPUT_SYNCHRONOUS 0x8242 #define GL_DEBUG_NEXT_LOGGED_MESSAGE_LENGTH 0x8243 #define GL_DEBUG_CALLBACK_FUNCTION 0x8244 #define GL_DEBUG_CALLBACK_USER_PARAM 0x8245 #define GL_DEBUG_SOURCE_API 0x8246 #define GL_DEBUG_SOURCE_WINDOW_SYSTEM 0x8247 #define GL_DEBUG_SOURCE_SHADER_COMPILER 0x8248 #define GL_DEBUG_SOURCE_THIRD_PARTY 0x8249 #define GL_DEBUG_SOURCE_APPLICATION 0x824A #define GL_DEBUG_SOURCE_OTHER 0x824B #define GL_DEBUG_TYPE_ERROR 0x824C #define GL_DEBUG_TYPE_DEPRECATED_BEHAVIOR 0x824D #define GL_DEBUG_TYPE_UNDEFINED_BEHAVIOR 0x824E #define GL_DEBUG_TYPE_PORTABILITY 0x824F #define GL_DEBUG_TYPE_PERFORMANCE 0x8250 #define GL_DEBUG_TYPE_OTHER 0x8251 #define GL_MAX_DEBUG_MESSAGE_LENGTH 0x9143 #define GL_MAX_DEBUG_LOGGED_MESSAGES 0x9144 #define GL_DEBUG_LOGGED_MESSAGES 0x9145 #define GL_DEBUG_SEVERITY_HIGH 0x9146 #define GL_DEBUG_SEVERITY_MEDIUM 0x9147 #define GL_DEBUG_SEVERITY_LOW 0x9148 #define GL_DEBUG_TYPE_MARKER 0x8268 #define GL_DEBUG_TYPE_PUSH_GROUP 0x8269 #define GL_DEBUG_TYPE_POP_GROUP 0x826A #define GL_DEBUG_SEVERITY_NOTIFICATION 0x826B #define GL_MAX_DEBUG_GROUP_STACK_DEPTH 0x826C #define GL_DEBUG_GROUP_STACK_DEPTH 0x826D #define GL_BUFFER 0x82E0 #define GL_SHADER 0x82E1 #define GL_PROGRAM 0x82E2 #define GL_QUERY 0x82E3 #define GL_PROGRAM_PIPELINE 0x82E4 #define GL_SAMPLER 0x82E6 #define GL_MAX_LABEL_LENGTH 0x82E8 #define GL_DEBUG_OUTPUT 0x92E0 #define GL_CONTEXT_FLAG_DEBUG_BIT 0x00000002 #define GL_MAX_UNIFORM_LOCATIONS 0x826E #define GL_FRAMEBUFFER_DEFAULT_WIDTH 0x9310 #define GL_FRAMEBUFFER_DEFAULT_HEIGHT 0x9311 #define GL_FRAMEBUFFER_DEFAULT_LAYERS 0x9312 #define GL_FRAMEBUFFER_DEFAULT_SAMPLES 0x9313 #define GL_FRAMEBUFFER_DEFAULT_FIXED_SAMPLE_LOCATIONS 0x9314 #define GL_MAX_FRAMEBUFFER_WIDTH 0x9315 #define GL_MAX_FRAMEBUFFER_HEIGHT 0x9316 #define GL_MAX_FRAMEBUFFER_LAYERS 0x9317 #define GL_MAX_FRAMEBUFFER_SAMPLES 0x9318 #define GL_INTERNALFORMAT_SUPPORTED 0x826F #define GL_INTERNALFORMAT_PREFERRED 0x8270 #define GL_INTERNALFORMAT_RED_SIZE 0x8271 #define GL_INTERNALFORMAT_GREEN_SIZE 0x8272 #define GL_INTERNALFORMAT_BLUE_SIZE 0x8273 #define GL_INTERNALFORMAT_ALPHA_SIZE 0x8274 #define GL_INTERNALFORMAT_DEPTH_SIZE 0x8275 #define GL_INTERNALFORMAT_STENCIL_SIZE 0x8276 #define GL_INTERNALFORMAT_SHARED_SIZE 0x8277 #define GL_INTERNALFORMAT_RED_TYPE 0x8278 #define GL_INTERNALFORMAT_GREEN_TYPE 0x8279 #define GL_INTERNALFORMAT_BLUE_TYPE 0x827A #define GL_INTERNALFORMAT_ALPHA_TYPE 0x827B #define GL_INTERNALFORMAT_DEPTH_TYPE 0x827C #define GL_INTERNALFORMAT_STENCIL_TYPE 0x827D #define GL_MAX_WIDTH 0x827E #define GL_MAX_HEIGHT 0x827F #define GL_MAX_DEPTH 0x8280 #define GL_MAX_LAYERS 0x8281 #define GL_MAX_COMBINED_DIMENSIONS 0x8282 #define GL_COLOR_COMPONENTS 0x8283 #define GL_DEPTH_COMPONENTS 0x8284 #define GL_STENCIL_COMPONENTS 0x8285 #define GL_COLOR_RENDERABLE 0x8286 #define GL_DEPTH_RENDERABLE 0x8287 #define GL_STENCIL_RENDERABLE 0x8288 #define GL_FRAMEBUFFER_RENDERABLE 0x8289 #define GL_FRAMEBUFFER_RENDERABLE_LAYERED 0x828A #define GL_FRAMEBUFFER_BLEND 0x828B #define GL_READ_PIXELS 0x828C #define GL_READ_PIXELS_FORMAT 0x828D #define GL_READ_PIXELS_TYPE 0x828E #define GL_TEXTURE_IMAGE_FORMAT 0x828F #define GL_TEXTURE_IMAGE_TYPE 0x8290 #define GL_GET_TEXTURE_IMAGE_FORMAT 0x8291 #define GL_GET_TEXTURE_IMAGE_TYPE 0x8292 #define GL_MIPMAP 0x8293 #define GL_MANUAL_GENERATE_MIPMAP 0x8294 #define GL_AUTO_GENERATE_MIPMAP 0x8295 #define GL_COLOR_ENCODING 0x8296 #define GL_SRGB_READ 0x8297 #define GL_SRGB_WRITE 0x8298 #define GL_FILTER 0x829A #define GL_VERTEX_TEXTURE 0x829B #define GL_TESS_CONTROL_TEXTURE 0x829C #define GL_TESS_EVALUATION_TEXTURE 0x829D #define GL_GEOMETRY_TEXTURE 0x829E #define GL_FRAGMENT_TEXTURE 0x829F #define GL_COMPUTE_TEXTURE 0x82A0 #define GL_TEXTURE_SHADOW 0x82A1 #define GL_TEXTURE_GATHER 0x82A2 #define GL_TEXTURE_GATHER_SHADOW 0x82A3 #define GL_SHADER_IMAGE_LOAD 0x82A4 #define GL_SHADER_IMAGE_STORE 0x82A5 #define GL_SHADER_IMAGE_ATOMIC 0x82A6 #define GL_IMAGE_TEXEL_SIZE 0x82A7 #define GL_IMAGE_COMPATIBILITY_CLASS 0x82A8 #define GL_IMAGE_PIXEL_FORMAT 0x82A9 #define GL_IMAGE_PIXEL_TYPE 0x82AA #define GL_SIMULTANEOUS_TEXTURE_AND_DEPTH_TEST 0x82AC #define GL_SIMULTANEOUS_TEXTURE_AND_STENCIL_TEST 0x82AD #define GL_SIMULTANEOUS_TEXTURE_AND_DEPTH_WRITE 0x82AE #define GL_SIMULTANEOUS_TEXTURE_AND_STENCIL_WRITE 0x82AF #define GL_TEXTURE_COMPRESSED_BLOCK_WIDTH 0x82B1 #define GL_TEXTURE_COMPRESSED_BLOCK_HEIGHT 0x82B2 #define GL_TEXTURE_COMPRESSED_BLOCK_SIZE 0x82B3 #define GL_CLEAR_BUFFER 0x82B4 #define GL_TEXTURE_VIEW 0x82B5 #define GL_VIEW_COMPATIBILITY_CLASS 0x82B6 #define GL_FULL_SUPPORT 0x82B7 #define GL_CAVEAT_SUPPORT 0x82B8 #define GL_IMAGE_CLASS_4_X_32 0x82B9 #define GL_IMAGE_CLASS_2_X_32 0x82BA #define GL_IMAGE_CLASS_1_X_32 0x82BB #define GL_IMAGE_CLASS_4_X_16 0x82BC #define GL_IMAGE_CLASS_2_X_16 0x82BD #define GL_IMAGE_CLASS_1_X_16 0x82BE #define GL_IMAGE_CLASS_4_X_8 0x82BF #define GL_IMAGE_CLASS_2_X_8 0x82C0 #define GL_IMAGE_CLASS_1_X_8 0x82C1 #define GL_IMAGE_CLASS_11_11_10 0x82C2 #define GL_IMAGE_CLASS_10_10_10_2 0x82C3 #define GL_VIEW_CLASS_128_BITS 0x82C4 #define GL_VIEW_CLASS_96_BITS 0x82C5 #define GL_VIEW_CLASS_64_BITS 0x82C6 #define GL_VIEW_CLASS_48_BITS 0x82C7 #define GL_VIEW_CLASS_32_BITS 0x82C8 #define GL_VIEW_CLASS_24_BITS 0x82C9 #define GL_VIEW_CLASS_16_BITS 0x82CA #define GL_VIEW_CLASS_8_BITS 0x82CB #define GL_VIEW_CLASS_S3TC_DXT1_RGB 0x82CC #define GL_VIEW_CLASS_S3TC_DXT1_RGBA 0x82CD #define GL_VIEW_CLASS_S3TC_DXT3_RGBA 0x82CE #define GL_VIEW_CLASS_S3TC_DXT5_RGBA 0x82CF #define GL_VIEW_CLASS_RGTC1_RED 0x82D0 #define GL_VIEW_CLASS_RGTC2_RG 0x82D1 #define GL_VIEW_CLASS_BPTC_UNORM 0x82D2 #define GL_VIEW_CLASS_BPTC_FLOAT 0x82D3 #define GL_UNIFORM 0x92E1 #define GL_UNIFORM_BLOCK 0x92E2 #define GL_PROGRAM_INPUT 0x92E3 #define GL_PROGRAM_OUTPUT 0x92E4 #define GL_BUFFER_VARIABLE 0x92E5 #define GL_SHADER_STORAGE_BLOCK 0x92E6 #define GL_VERTEX_SUBROUTINE 0x92E8 #define GL_TESS_CONTROL_SUBROUTINE 0x92E9 #define GL_TESS_EVALUATION_SUBROUTINE 0x92EA #define GL_GEOMETRY_SUBROUTINE 0x92EB #define GL_FRAGMENT_SUBROUTINE 0x92EC #define GL_COMPUTE_SUBROUTINE 0x92ED #define GL_VERTEX_SUBROUTINE_UNIFORM 0x92EE #define GL_TESS_CONTROL_SUBROUTINE_UNIFORM 0x92EF #define GL_TESS_EVALUATION_SUBROUTINE_UNIFORM 0x92F0 #define GL_GEOMETRY_SUBROUTINE_UNIFORM 0x92F1 #define GL_FRAGMENT_SUBROUTINE_UNIFORM 0x92F2 #define GL_COMPUTE_SUBROUTINE_UNIFORM 0x92F3 #define GL_TRANSFORM_FEEDBACK_VARYING 0x92F4 #define GL_ACTIVE_RESOURCES 0x92F5 #define GL_MAX_NAME_LENGTH 0x92F6 #define GL_MAX_NUM_ACTIVE_VARIABLES 0x92F7 #define GL_MAX_NUM_COMPATIBLE_SUBROUTINES 0x92F8 #define GL_NAME_LENGTH 0x92F9 #define GL_TYPE 0x92FA #define GL_ARRAY_SIZE 0x92FB #define GL_OFFSET 0x92FC #define GL_BLOCK_INDEX 0x92FD #define GL_ARRAY_STRIDE 0x92FE #define GL_MATRIX_STRIDE 0x92FF #define GL_IS_ROW_MAJOR 0x9300 #define GL_ATOMIC_COUNTER_BUFFER_INDEX 0x9301 #define GL_BUFFER_BINDING 0x9302 #define GL_BUFFER_DATA_SIZE 0x9303 #define GL_NUM_ACTIVE_VARIABLES 0x9304 #define GL_ACTIVE_VARIABLES 0x9305 #define GL_REFERENCED_BY_VERTEX_SHADER 0x9306 #define GL_REFERENCED_BY_TESS_CONTROL_SHADER 0x9307 #define GL_REFERENCED_BY_TESS_EVALUATION_SHADER 0x9308 #define GL_REFERENCED_BY_GEOMETRY_SHADER 0x9309 #define GL_REFERENCED_BY_FRAGMENT_SHADER 0x930A #define GL_REFERENCED_BY_COMPUTE_SHADER 0x930B #define GL_TOP_LEVEL_ARRAY_SIZE 0x930C #define GL_TOP_LEVEL_ARRAY_STRIDE 0x930D #define GL_LOCATION 0x930E #define GL_LOCATION_INDEX 0x930F #define GL_IS_PER_PATCH 0x92E7 #define GL_SHADER_STORAGE_BUFFER 0x90D2 #define GL_SHADER_STORAGE_BUFFER_BINDING 0x90D3 #define GL_SHADER_STORAGE_BUFFER_START 0x90D4 #define GL_SHADER_STORAGE_BUFFER_SIZE 0x90D5 #define GL_MAX_VERTEX_SHADER_STORAGE_BLOCKS 0x90D6 #define GL_MAX_GEOMETRY_SHADER_STORAGE_BLOCKS 0x90D7 #define GL_MAX_TESS_CONTROL_SHADER_STORAGE_BLOCKS 0x90D8 #define GL_MAX_TESS_EVALUATION_SHADER_STORAGE_BLOCKS 0x90D9 #define GL_MAX_FRAGMENT_SHADER_STORAGE_BLOCKS 0x90DA #define GL_MAX_COMPUTE_SHADER_STORAGE_BLOCKS 0x90DB #define GL_MAX_COMBINED_SHADER_STORAGE_BLOCKS 0x90DC #define GL_MAX_SHADER_STORAGE_BUFFER_BINDINGS 0x90DD #define GL_MAX_SHADER_STORAGE_BLOCK_SIZE 0x90DE #define GL_SHADER_STORAGE_BUFFER_OFFSET_ALIGNMENT 0x90DF #define GL_SHADER_STORAGE_BARRIER_BIT 0x00002000 #define GL_MAX_COMBINED_SHADER_OUTPUT_RESOURCES 0x8F39 #define GL_DEPTH_STENCIL_TEXTURE_MODE 0x90EA #define GL_TEXTURE_BUFFER_OFFSET 0x919D #define GL_TEXTURE_BUFFER_SIZE 0x919E #define GL_TEXTURE_BUFFER_OFFSET_ALIGNMENT 0x919F #define GL_TEXTURE_VIEW_MIN_LEVEL 0x82DB #define GL_TEXTURE_VIEW_NUM_LEVELS 0x82DC #define GL_TEXTURE_VIEW_MIN_LAYER 0x82DD #define GL_TEXTURE_VIEW_NUM_LAYERS 0x82DE #define GL_TEXTURE_IMMUTABLE_LEVELS 0x82DF #define GL_VERTEX_ATTRIB_BINDING 0x82D4 #define GL_VERTEX_ATTRIB_RELATIVE_OFFSET 0x82D5 #define GL_VERTEX_BINDING_DIVISOR 0x82D6 #define GL_VERTEX_BINDING_OFFSET 0x82D7 #define GL_VERTEX_BINDING_STRIDE 0x82D8 #define GL_MAX_VERTEX_ATTRIB_RELATIVE_OFFSET 0x82D9 #define GL_MAX_VERTEX_ATTRIB_BINDINGS 0x82DA #define GL_DISPLAY_LIST 0x82E7 typedef void (APIENTRYP PFNGLCLEARBUFFERDATAPROC) (GLenum target, GLenum internalformat, GLenum format, GLenum type, const void *data); typedef void (APIENTRYP PFNGLCLEARBUFFERSUBDATAPROC) (GLenum target, GLenum internalformat, GLintptr offset, GLsizeiptr size, GLenum format, GLenum type, const void *data); typedef void (APIENTRYP PFNGLDISPATCHCOMPUTEPROC) (GLuint num_groups_x, GLuint num_groups_y, GLuint num_groups_z); typedef void (APIENTRYP PFNGLDISPATCHCOMPUTEINDIRECTPROC) (GLintptr indirect); typedef void (APIENTRYP PFNGLCOPYIMAGESUBDATAPROC) (GLuint srcName, GLenum srcTarget, GLint srcLevel, GLint srcX, GLint srcY, GLint srcZ, GLuint dstName, GLenum dstTarget, GLint dstLevel, GLint dstX, GLint dstY, GLint dstZ, GLsizei srcWidth, GLsizei srcHeight, GLsizei srcDepth); typedef void (APIENTRYP PFNGLFRAMEBUFFERPARAMETERIPROC) (GLenum target, GLenum pname, GLint param); typedef void (APIENTRYP PFNGLGETFRAMEBUFFERPARAMETERIVPROC) (GLenum target, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGETINTERNALFORMATI64VPROC) (GLenum target, GLenum internalformat, GLenum pname, GLsizei bufSize, GLint64 *params); typedef void (APIENTRYP PFNGLINVALIDATETEXSUBIMAGEPROC) (GLuint texture, GLint level, GLint xoffset, GLint yoffset, GLint zoffset, GLsizei width, GLsizei height, GLsizei depth); typedef void (APIENTRYP PFNGLINVALIDATETEXIMAGEPROC) (GLuint texture, GLint level); typedef void (APIENTRYP PFNGLINVALIDATEBUFFERSUBDATAPROC) (GLuint buffer, GLintptr offset, GLsizeiptr length); typedef void (APIENTRYP PFNGLINVALIDATEBUFFERDATAPROC) (GLuint buffer); typedef void (APIENTRYP PFNGLINVALIDATEFRAMEBUFFERPROC) (GLenum target, GLsizei numAttachments, const GLenum *attachments); typedef void (APIENTRYP PFNGLINVALIDATESUBFRAMEBUFFERPROC) (GLenum target, GLsizei numAttachments, const GLenum *attachments, GLint x, GLint y, GLsizei width, GLsizei height); typedef void (APIENTRYP PFNGLMULTIDRAWARRAYSINDIRECTPROC) (GLenum mode, const void *indirect, GLsizei drawcount, GLsizei stride); typedef void (APIENTRYP PFNGLMULTIDRAWELEMENTSINDIRECTPROC) (GLenum mode, GLenum type, const void *indirect, GLsizei drawcount, GLsizei stride); typedef void (APIENTRYP PFNGLGETPROGRAMINTERFACEIVPROC) (GLuint program, GLenum programInterface, GLenum pname, GLint *params); typedef GLuint (APIENTRYP PFNGLGETPROGRAMRESOURCEINDEXPROC) (GLuint program, GLenum programInterface, const GLchar *name); typedef void (APIENTRYP PFNGLGETPROGRAMRESOURCENAMEPROC) (GLuint program, GLenum programInterface, GLuint index, GLsizei bufSize, GLsizei *length, GLchar *name); typedef void (APIENTRYP PFNGLGETPROGRAMRESOURCEIVPROC) (GLuint program, GLenum programInterface, GLuint index, GLsizei propCount, const GLenum *props, GLsizei bufSize, GLsizei *length, GLint *params); typedef GLint (APIENTRYP PFNGLGETPROGRAMRESOURCELOCATIONPROC) (GLuint program, GLenum programInterface, const GLchar *name); typedef GLint (APIENTRYP PFNGLGETPROGRAMRESOURCELOCATIONINDEXPROC) (GLuint program, GLenum programInterface, const GLchar *name); typedef void (APIENTRYP PFNGLSHADERSTORAGEBLOCKBINDINGPROC) (GLuint program, GLuint storageBlockIndex, GLuint storageBlockBinding); typedef void (APIENTRYP PFNGLTEXBUFFERRANGEPROC) (GLenum target, GLenum internalformat, GLuint buffer, GLintptr offset, GLsizeiptr size); typedef void (APIENTRYP PFNGLTEXSTORAGE2DMULTISAMPLEPROC) (GLenum target, GLsizei samples, GLenum internalformat, GLsizei width, GLsizei height, GLboolean fixedsamplelocations); typedef void (APIENTRYP PFNGLTEXSTORAGE3DMULTISAMPLEPROC) (GLenum target, GLsizei samples, GLenum internalformat, GLsizei width, GLsizei height, GLsizei depth, GLboolean fixedsamplelocations); typedef void (APIENTRYP PFNGLTEXTUREVIEWPROC) (GLuint texture, GLenum target, GLuint origtexture, GLenum internalformat, GLuint minlevel, GLuint numlevels, GLuint minlayer, GLuint numlayers); typedef void (APIENTRYP PFNGLBINDVERTEXBUFFERPROC) (GLuint bindingindex, GLuint buffer, GLintptr offset, GLsizei stride); typedef void (APIENTRYP PFNGLVERTEXATTRIBFORMATPROC) (GLuint attribindex, GLint size, GLenum type, GLboolean normalized, GLuint relativeoffset); typedef void (APIENTRYP PFNGLVERTEXATTRIBIFORMATPROC) (GLuint attribindex, GLint size, GLenum type, GLuint relativeoffset); typedef void (APIENTRYP PFNGLVERTEXATTRIBLFORMATPROC) (GLuint attribindex, GLint size, GLenum type, GLuint relativeoffset); typedef void (APIENTRYP PFNGLVERTEXATTRIBBINDINGPROC) (GLuint attribindex, GLuint bindingindex); typedef void (APIENTRYP PFNGLVERTEXBINDINGDIVISORPROC) (GLuint bindingindex, GLuint divisor); typedef void (APIENTRYP PFNGLDEBUGMESSAGECONTROLPROC) (GLenum source, GLenum type, GLenum severity, GLsizei count, const GLuint *ids, GLboolean enabled); typedef void (APIENTRYP PFNGLDEBUGMESSAGEINSERTPROC) (GLenum source, GLenum type, GLuint id, GLenum severity, GLsizei length, const GLchar *buf); typedef void (APIENTRYP PFNGLDEBUGMESSAGECALLBACKPROC) (GLDEBUGPROC callback, const void *userParam); typedef GLuint (APIENTRYP PFNGLGETDEBUGMESSAGELOGPROC) (GLuint count, GLsizei bufSize, GLenum *sources, GLenum *types, GLuint *ids, GLenum *severities, GLsizei *lengths, GLchar *messageLog); typedef void (APIENTRYP PFNGLPUSHDEBUGGROUPPROC) (GLenum source, GLuint id, GLsizei length, const GLchar *message); typedef void (APIENTRYP PFNGLPOPDEBUGGROUPPROC) (void); typedef void (APIENTRYP PFNGLOBJECTLABELPROC) (GLenum identifier, GLuint name, GLsizei length, const GLchar *label); typedef void (APIENTRYP PFNGLGETOBJECTLABELPROC) (GLenum identifier, GLuint name, GLsizei bufSize, GLsizei *length, GLchar *label); typedef void (APIENTRYP PFNGLOBJECTPTRLABELPROC) (const void *ptr, GLsizei length, const GLchar *label); typedef void (APIENTRYP PFNGLGETOBJECTPTRLABELPROC) (const void *ptr, GLsizei bufSize, GLsizei *length, GLchar *label); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glClearBufferData (GLenum target, GLenum internalformat, GLenum format, GLenum type, const void *data); GLAPI void APIENTRY glClearBufferSubData (GLenum target, GLenum internalformat, GLintptr offset, GLsizeiptr size, GLenum format, GLenum type, const void *data); GLAPI void APIENTRY glDispatchCompute (GLuint num_groups_x, GLuint num_groups_y, GLuint num_groups_z); GLAPI void APIENTRY glDispatchComputeIndirect (GLintptr indirect); GLAPI void APIENTRY glCopyImageSubData (GLuint srcName, GLenum srcTarget, GLint srcLevel, GLint srcX, GLint srcY, GLint srcZ, GLuint dstName, GLenum dstTarget, GLint dstLevel, GLint dstX, GLint dstY, GLint dstZ, GLsizei srcWidth, GLsizei srcHeight, GLsizei srcDepth); GLAPI void APIENTRY glFramebufferParameteri (GLenum target, GLenum pname, GLint param); GLAPI void APIENTRY glGetFramebufferParameteriv (GLenum target, GLenum pname, GLint *params); GLAPI void APIENTRY glGetInternalformati64v (GLenum target, GLenum internalformat, GLenum pname, GLsizei bufSize, GLint64 *params); GLAPI void APIENTRY glInvalidateTexSubImage (GLuint texture, GLint level, GLint xoffset, GLint yoffset, GLint zoffset, GLsizei width, GLsizei height, GLsizei depth); GLAPI void APIENTRY glInvalidateTexImage (GLuint texture, GLint level); GLAPI void APIENTRY glInvalidateBufferSubData (GLuint buffer, GLintptr offset, GLsizeiptr length); GLAPI void APIENTRY glInvalidateBufferData (GLuint buffer); GLAPI void APIENTRY glInvalidateFramebuffer (GLenum target, GLsizei numAttachments, const GLenum *attachments); GLAPI void APIENTRY glInvalidateSubFramebuffer (GLenum target, GLsizei numAttachments, const GLenum *attachments, GLint x, GLint y, GLsizei width, GLsizei height); GLAPI void APIENTRY glMultiDrawArraysIndirect (GLenum mode, const void *indirect, GLsizei drawcount, GLsizei stride); GLAPI void APIENTRY glMultiDrawElementsIndirect (GLenum mode, GLenum type, const void *indirect, GLsizei drawcount, GLsizei stride); GLAPI void APIENTRY glGetProgramInterfaceiv (GLuint program, GLenum programInterface, GLenum pname, GLint *params); GLAPI GLuint APIENTRY glGetProgramResourceIndex (GLuint program, GLenum programInterface, const GLchar *name); GLAPI void APIENTRY glGetProgramResourceName (GLuint program, GLenum programInterface, GLuint index, GLsizei bufSize, GLsizei *length, GLchar *name); GLAPI void APIENTRY glGetProgramResourceiv (GLuint program, GLenum programInterface, GLuint index, GLsizei propCount, const GLenum *props, GLsizei bufSize, GLsizei *length, GLint *params); GLAPI GLint APIENTRY glGetProgramResourceLocation (GLuint program, GLenum programInterface, const GLchar *name); GLAPI GLint APIENTRY glGetProgramResourceLocationIndex (GLuint program, GLenum programInterface, const GLchar *name); GLAPI void APIENTRY glShaderStorageBlockBinding (GLuint program, GLuint storageBlockIndex, GLuint storageBlockBinding); GLAPI void APIENTRY glTexBufferRange (GLenum target, GLenum internalformat, GLuint buffer, GLintptr offset, GLsizeiptr size); GLAPI void APIENTRY glTexStorage2DMultisample (GLenum target, GLsizei samples, GLenum internalformat, GLsizei width, GLsizei height, GLboolean fixedsamplelocations); GLAPI void APIENTRY glTexStorage3DMultisample (GLenum target, GLsizei samples, GLenum internalformat, GLsizei width, GLsizei height, GLsizei depth, GLboolean fixedsamplelocations); GLAPI void APIENTRY glTextureView (GLuint texture, GLenum target, GLuint origtexture, GLenum internalformat, GLuint minlevel, GLuint numlevels, GLuint minlayer, GLuint numlayers); GLAPI void APIENTRY glBindVertexBuffer (GLuint bindingindex, GLuint buffer, GLintptr offset, GLsizei stride); GLAPI void APIENTRY glVertexAttribFormat (GLuint attribindex, GLint size, GLenum type, GLboolean normalized, GLuint relativeoffset); GLAPI void APIENTRY glVertexAttribIFormat (GLuint attribindex, GLint size, GLenum type, GLuint relativeoffset); GLAPI void APIENTRY glVertexAttribLFormat (GLuint attribindex, GLint size, GLenum type, GLuint relativeoffset); GLAPI void APIENTRY glVertexAttribBinding (GLuint attribindex, GLuint bindingindex); GLAPI void APIENTRY glVertexBindingDivisor (GLuint bindingindex, GLuint divisor); GLAPI void APIENTRY glDebugMessageControl (GLenum source, GLenum type, GLenum severity, GLsizei count, const GLuint *ids, GLboolean enabled); GLAPI void APIENTRY glDebugMessageInsert (GLenum source, GLenum type, GLuint id, GLenum severity, GLsizei length, const GLchar *buf); GLAPI void APIENTRY glDebugMessageCallback (GLDEBUGPROC callback, const void *userParam); GLAPI GLuint APIENTRY glGetDebugMessageLog (GLuint count, GLsizei bufSize, GLenum *sources, GLenum *types, GLuint *ids, GLenum *severities, GLsizei *lengths, GLchar *messageLog); GLAPI void APIENTRY glPushDebugGroup (GLenum source, GLuint id, GLsizei length, const GLchar *message); GLAPI void APIENTRY glPopDebugGroup (void); GLAPI void APIENTRY glObjectLabel (GLenum identifier, GLuint name, GLsizei length, const GLchar *label); GLAPI void APIENTRY glGetObjectLabel (GLenum identifier, GLuint name, GLsizei bufSize, GLsizei *length, GLchar *label); GLAPI void APIENTRY glObjectPtrLabel (const void *ptr, GLsizei length, const GLchar *label); GLAPI void APIENTRY glGetObjectPtrLabel (const void *ptr, GLsizei bufSize, GLsizei *length, GLchar *label); #endif #endif /* GL_VERSION_4_3 */ #ifndef GL_VERSION_4_4 #define GL_VERSION_4_4 1 #define GL_MAX_VERTEX_ATTRIB_STRIDE 0x82E5 #define GL_PRIMITIVE_RESTART_FOR_PATCHES_SUPPORTED 0x8221 #define GL_TEXTURE_BUFFER_BINDING 0x8C2A #define GL_MAP_PERSISTENT_BIT 0x0040 #define GL_MAP_COHERENT_BIT 0x0080 #define GL_DYNAMIC_STORAGE_BIT 0x0100 #define GL_CLIENT_STORAGE_BIT 0x0200 #define GL_CLIENT_MAPPED_BUFFER_BARRIER_BIT 0x00004000 #define GL_BUFFER_IMMUTABLE_STORAGE 0x821F #define GL_BUFFER_STORAGE_FLAGS 0x8220 #define GL_CLEAR_TEXTURE 0x9365 #define GL_LOCATION_COMPONENT 0x934A #define GL_TRANSFORM_FEEDBACK_BUFFER_INDEX 0x934B #define GL_TRANSFORM_FEEDBACK_BUFFER_STRIDE 0x934C #define GL_QUERY_BUFFER 0x9192 #define GL_QUERY_BUFFER_BARRIER_BIT 0x00008000 #define GL_QUERY_BUFFER_BINDING 0x9193 #define GL_QUERY_RESULT_NO_WAIT 0x9194 #define GL_MIRROR_CLAMP_TO_EDGE 0x8743 typedef void (APIENTRYP PFNGLBUFFERSTORAGEPROC) (GLenum target, GLsizeiptr size, const void *data, GLbitfield flags); typedef void (APIENTRYP PFNGLCLEARTEXIMAGEPROC) (GLuint texture, GLint level, GLenum format, GLenum type, const void *data); typedef void (APIENTRYP PFNGLCLEARTEXSUBIMAGEPROC) (GLuint texture, GLint level, GLint xoffset, GLint yoffset, GLint zoffset, GLsizei width, GLsizei height, GLsizei depth, GLenum format, GLenum type, const void *data); typedef void (APIENTRYP PFNGLBINDBUFFERSBASEPROC) (GLenum target, GLuint first, GLsizei count, const GLuint *buffers); typedef void (APIENTRYP PFNGLBINDBUFFERSRANGEPROC) (GLenum target, GLuint first, GLsizei count, const GLuint *buffers, const GLintptr *offsets, const GLsizeiptr *sizes); typedef void (APIENTRYP PFNGLBINDTEXTURESPROC) (GLuint first, GLsizei count, const GLuint *textures); typedef void (APIENTRYP PFNGLBINDSAMPLERSPROC) (GLuint first, GLsizei count, const GLuint *samplers); typedef void (APIENTRYP PFNGLBINDIMAGETEXTURESPROC) (GLuint first, GLsizei count, const GLuint *textures); typedef void (APIENTRYP PFNGLBINDVERTEXBUFFERSPROC) (GLuint first, GLsizei count, const GLuint *buffers, const GLintptr *offsets, const GLsizei *strides); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glBufferStorage (GLenum target, GLsizeiptr size, const void *data, GLbitfield flags); GLAPI void APIENTRY glClearTexImage (GLuint texture, GLint level, GLenum format, GLenum type, const void *data); GLAPI void APIENTRY glClearTexSubImage (GLuint texture, GLint level, GLint xoffset, GLint yoffset, GLint zoffset, GLsizei width, GLsizei height, GLsizei depth, GLenum format, GLenum type, const void *data); GLAPI void APIENTRY glBindBuffersBase (GLenum target, GLuint first, GLsizei count, const GLuint *buffers); GLAPI void APIENTRY glBindBuffersRange (GLenum target, GLuint first, GLsizei count, const GLuint *buffers, const GLintptr *offsets, const GLsizeiptr *sizes); GLAPI void APIENTRY glBindTextures (GLuint first, GLsizei count, const GLuint *textures); GLAPI void APIENTRY glBindSamplers (GLuint first, GLsizei count, const GLuint *samplers); GLAPI void APIENTRY glBindImageTextures (GLuint first, GLsizei count, const GLuint *textures); GLAPI void APIENTRY glBindVertexBuffers (GLuint first, GLsizei count, const GLuint *buffers, const GLintptr *offsets, const GLsizei *strides); #endif #endif /* GL_VERSION_4_4 */ #ifndef GL_ARB_ES2_compatibility #define GL_ARB_ES2_compatibility 1 #endif /* GL_ARB_ES2_compatibility */ #ifndef GL_ARB_ES3_compatibility #define GL_ARB_ES3_compatibility 1 #endif /* GL_ARB_ES3_compatibility */ #ifndef GL_ARB_arrays_of_arrays #define GL_ARB_arrays_of_arrays 1 #endif /* GL_ARB_arrays_of_arrays */ #ifndef GL_ARB_base_instance #define GL_ARB_base_instance 1 #endif /* GL_ARB_base_instance */ #ifndef GL_ARB_bindless_texture #define GL_ARB_bindless_texture 1 typedef uint64_t GLuint64EXT; #define GL_UNSIGNED_INT64_ARB 0x140F typedef GLuint64 (APIENTRYP PFNGLGETTEXTUREHANDLEARBPROC) (GLuint texture); typedef GLuint64 (APIENTRYP PFNGLGETTEXTURESAMPLERHANDLEARBPROC) (GLuint texture, GLuint sampler); typedef void (APIENTRYP PFNGLMAKETEXTUREHANDLERESIDENTARBPROC) (GLuint64 handle); typedef void (APIENTRYP PFNGLMAKETEXTUREHANDLENONRESIDENTARBPROC) (GLuint64 handle); typedef GLuint64 (APIENTRYP PFNGLGETIMAGEHANDLEARBPROC) (GLuint texture, GLint level, GLboolean layered, GLint layer, GLenum format); typedef void (APIENTRYP PFNGLMAKEIMAGEHANDLERESIDENTARBPROC) (GLuint64 handle, GLenum access); typedef void (APIENTRYP PFNGLMAKEIMAGEHANDLENONRESIDENTARBPROC) (GLuint64 handle); typedef void (APIENTRYP PFNGLUNIFORMHANDLEUI64ARBPROC) (GLint location, GLuint64 value); typedef void (APIENTRYP PFNGLUNIFORMHANDLEUI64VARBPROC) (GLint location, GLsizei count, const GLuint64 *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORMHANDLEUI64ARBPROC) (GLuint program, GLint location, GLuint64 value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORMHANDLEUI64VARBPROC) (GLuint program, GLint location, GLsizei count, const GLuint64 *values); typedef GLboolean (APIENTRYP PFNGLISTEXTUREHANDLERESIDENTARBPROC) (GLuint64 handle); typedef GLboolean (APIENTRYP PFNGLISIMAGEHANDLERESIDENTARBPROC) (GLuint64 handle); typedef void (APIENTRYP PFNGLVERTEXATTRIBL1UI64ARBPROC) (GLuint index, GLuint64EXT x); typedef void (APIENTRYP PFNGLVERTEXATTRIBL1UI64VARBPROC) (GLuint index, const GLuint64EXT *v); typedef void (APIENTRYP PFNGLGETVERTEXATTRIBLUI64VARBPROC) (GLuint index, GLenum pname, GLuint64EXT *params); #ifdef GL_GLEXT_PROTOTYPES GLAPI GLuint64 APIENTRY glGetTextureHandleARB (GLuint texture); GLAPI GLuint64 APIENTRY glGetTextureSamplerHandleARB (GLuint texture, GLuint sampler); GLAPI void APIENTRY glMakeTextureHandleResidentARB (GLuint64 handle); GLAPI void APIENTRY glMakeTextureHandleNonResidentARB (GLuint64 handle); GLAPI GLuint64 APIENTRY glGetImageHandleARB (GLuint texture, GLint level, GLboolean layered, GLint layer, GLenum format); GLAPI void APIENTRY glMakeImageHandleResidentARB (GLuint64 handle, GLenum access); GLAPI void APIENTRY glMakeImageHandleNonResidentARB (GLuint64 handle); GLAPI void APIENTRY glUniformHandleui64ARB (GLint location, GLuint64 value); GLAPI void APIENTRY glUniformHandleui64vARB (GLint location, GLsizei count, const GLuint64 *value); GLAPI void APIENTRY glProgramUniformHandleui64ARB (GLuint program, GLint location, GLuint64 value); GLAPI void APIENTRY glProgramUniformHandleui64vARB (GLuint program, GLint location, GLsizei count, const GLuint64 *values); GLAPI GLboolean APIENTRY glIsTextureHandleResidentARB (GLuint64 handle); GLAPI GLboolean APIENTRY glIsImageHandleResidentARB (GLuint64 handle); GLAPI void APIENTRY glVertexAttribL1ui64ARB (GLuint index, GLuint64EXT x); GLAPI void APIENTRY glVertexAttribL1ui64vARB (GLuint index, const GLuint64EXT *v); GLAPI void APIENTRY glGetVertexAttribLui64vARB (GLuint index, GLenum pname, GLuint64EXT *params); #endif #endif /* GL_ARB_bindless_texture */ #ifndef GL_ARB_blend_func_extended #define GL_ARB_blend_func_extended 1 #endif /* GL_ARB_blend_func_extended */ #ifndef GL_ARB_buffer_storage #define GL_ARB_buffer_storage 1 #endif /* GL_ARB_buffer_storage */ #ifndef GL_ARB_cl_event #define GL_ARB_cl_event 1 struct _cl_context; struct _cl_event; #define GL_SYNC_CL_EVENT_ARB 0x8240 #define GL_SYNC_CL_EVENT_COMPLETE_ARB 0x8241 typedef GLsync (APIENTRYP PFNGLCREATESYNCFROMCLEVENTARBPROC) (struct _cl_context *context, struct _cl_event *event, GLbitfield flags); #ifdef GL_GLEXT_PROTOTYPES GLAPI GLsync APIENTRY glCreateSyncFromCLeventARB (struct _cl_context *context, struct _cl_event *event, GLbitfield flags); #endif #endif /* GL_ARB_cl_event */ #ifndef GL_ARB_clear_buffer_object #define GL_ARB_clear_buffer_object 1 #endif /* GL_ARB_clear_buffer_object */ #ifndef GL_ARB_clear_texture #define GL_ARB_clear_texture 1 #endif /* GL_ARB_clear_texture */ #ifndef GL_ARB_color_buffer_float #define GL_ARB_color_buffer_float 1 #define GL_RGBA_FLOAT_MODE_ARB 0x8820 #define GL_CLAMP_VERTEX_COLOR_ARB 0x891A #define GL_CLAMP_FRAGMENT_COLOR_ARB 0x891B #define GL_CLAMP_READ_COLOR_ARB 0x891C #define GL_FIXED_ONLY_ARB 0x891D typedef void (APIENTRYP PFNGLCLAMPCOLORARBPROC) (GLenum target, GLenum clamp); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glClampColorARB (GLenum target, GLenum clamp); #endif #endif /* GL_ARB_color_buffer_float */ #ifndef GL_ARB_compatibility #define GL_ARB_compatibility 1 #endif /* GL_ARB_compatibility */ #ifndef GL_ARB_compressed_texture_pixel_storage #define GL_ARB_compressed_texture_pixel_storage 1 #endif /* GL_ARB_compressed_texture_pixel_storage */ #ifndef GL_ARB_compute_shader #define GL_ARB_compute_shader 1 #define GL_COMPUTE_SHADER_BIT 0x00000020 #endif /* GL_ARB_compute_shader */ #ifndef GL_ARB_compute_variable_group_size #define GL_ARB_compute_variable_group_size 1 #define GL_MAX_COMPUTE_VARIABLE_GROUP_INVOCATIONS_ARB 0x9344 #define GL_MAX_COMPUTE_FIXED_GROUP_INVOCATIONS_ARB 0x90EB #define GL_MAX_COMPUTE_VARIABLE_GROUP_SIZE_ARB 0x9345 #define GL_MAX_COMPUTE_FIXED_GROUP_SIZE_ARB 0x91BF typedef void (APIENTRYP PFNGLDISPATCHCOMPUTEGROUPSIZEARBPROC) (GLuint num_groups_x, GLuint num_groups_y, GLuint num_groups_z, GLuint group_size_x, GLuint group_size_y, GLuint group_size_z); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glDispatchComputeGroupSizeARB (GLuint num_groups_x, GLuint num_groups_y, GLuint num_groups_z, GLuint group_size_x, GLuint group_size_y, GLuint group_size_z); #endif #endif /* GL_ARB_compute_variable_group_size */ #ifndef GL_ARB_conservative_depth #define GL_ARB_conservative_depth 1 #endif /* GL_ARB_conservative_depth */ #ifndef GL_ARB_copy_buffer #define GL_ARB_copy_buffer 1 #define GL_COPY_READ_BUFFER_BINDING 0x8F36 #define GL_COPY_WRITE_BUFFER_BINDING 0x8F37 #endif /* GL_ARB_copy_buffer */ #ifndef GL_ARB_copy_image #define GL_ARB_copy_image 1 #endif /* GL_ARB_copy_image */ #ifndef GL_ARB_debug_output #define GL_ARB_debug_output 1 typedef void (APIENTRY *GLDEBUGPROCARB)(GLenum source,GLenum type,GLuint id,GLenum severity,GLsizei length,const GLchar *message,const void *userParam); #define GL_DEBUG_OUTPUT_SYNCHRONOUS_ARB 0x8242 #define GL_DEBUG_NEXT_LOGGED_MESSAGE_LENGTH_ARB 0x8243 #define GL_DEBUG_CALLBACK_FUNCTION_ARB 0x8244 #define GL_DEBUG_CALLBACK_USER_PARAM_ARB 0x8245 #define GL_DEBUG_SOURCE_API_ARB 0x8246 #define GL_DEBUG_SOURCE_WINDOW_SYSTEM_ARB 0x8247 #define GL_DEBUG_SOURCE_SHADER_COMPILER_ARB 0x8248 #define GL_DEBUG_SOURCE_THIRD_PARTY_ARB 0x8249 #define GL_DEBUG_SOURCE_APPLICATION_ARB 0x824A #define GL_DEBUG_SOURCE_OTHER_ARB 0x824B #define GL_DEBUG_TYPE_ERROR_ARB 0x824C #define GL_DEBUG_TYPE_DEPRECATED_BEHAVIOR_ARB 0x824D #define GL_DEBUG_TYPE_UNDEFINED_BEHAVIOR_ARB 0x824E #define GL_DEBUG_TYPE_PORTABILITY_ARB 0x824F #define GL_DEBUG_TYPE_PERFORMANCE_ARB 0x8250 #define GL_DEBUG_TYPE_OTHER_ARB 0x8251 #define GL_MAX_DEBUG_MESSAGE_LENGTH_ARB 0x9143 #define GL_MAX_DEBUG_LOGGED_MESSAGES_ARB 0x9144 #define GL_DEBUG_LOGGED_MESSAGES_ARB 0x9145 #define GL_DEBUG_SEVERITY_HIGH_ARB 0x9146 #define GL_DEBUG_SEVERITY_MEDIUM_ARB 0x9147 #define GL_DEBUG_SEVERITY_LOW_ARB 0x9148 typedef void (APIENTRYP PFNGLDEBUGMESSAGECONTROLARBPROC) (GLenum source, GLenum type, GLenum severity, GLsizei count, const GLuint *ids, GLboolean enabled); typedef void (APIENTRYP PFNGLDEBUGMESSAGEINSERTARBPROC) (GLenum source, GLenum type, GLuint id, GLenum severity, GLsizei length, const GLchar *buf); typedef void (APIENTRYP PFNGLDEBUGMESSAGECALLBACKARBPROC) (GLDEBUGPROCARB callback, const void *userParam); typedef GLuint (APIENTRYP PFNGLGETDEBUGMESSAGELOGARBPROC) (GLuint count, GLsizei bufSize, GLenum *sources, GLenum *types, GLuint *ids, GLenum *severities, GLsizei *lengths, GLchar *messageLog); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glDebugMessageControlARB (GLenum source, GLenum type, GLenum severity, GLsizei count, const GLuint *ids, GLboolean enabled); GLAPI void APIENTRY glDebugMessageInsertARB (GLenum source, GLenum type, GLuint id, GLenum severity, GLsizei length, const GLchar *buf); GLAPI void APIENTRY glDebugMessageCallbackARB (GLDEBUGPROCARB callback, const void *userParam); GLAPI GLuint APIENTRY glGetDebugMessageLogARB (GLuint count, GLsizei bufSize, GLenum *sources, GLenum *types, GLuint *ids, GLenum *severities, GLsizei *lengths, GLchar *messageLog); #endif #endif /* GL_ARB_debug_output */ #ifndef GL_ARB_depth_buffer_float #define GL_ARB_depth_buffer_float 1 #endif /* GL_ARB_depth_buffer_float */ #ifndef GL_ARB_depth_clamp #define GL_ARB_depth_clamp 1 #endif /* GL_ARB_depth_clamp */ #ifndef GL_ARB_depth_texture #define GL_ARB_depth_texture 1 #define GL_DEPTH_COMPONENT16_ARB 0x81A5 #define GL_DEPTH_COMPONENT24_ARB 0x81A6 #define GL_DEPTH_COMPONENT32_ARB 0x81A7 #define GL_TEXTURE_DEPTH_SIZE_ARB 0x884A #define GL_DEPTH_TEXTURE_MODE_ARB 0x884B #endif /* GL_ARB_depth_texture */ #ifndef GL_ARB_draw_buffers #define GL_ARB_draw_buffers 1 #define GL_MAX_DRAW_BUFFERS_ARB 0x8824 #define GL_DRAW_BUFFER0_ARB 0x8825 #define GL_DRAW_BUFFER1_ARB 0x8826 #define GL_DRAW_BUFFER2_ARB 0x8827 #define GL_DRAW_BUFFER3_ARB 0x8828 #define GL_DRAW_BUFFER4_ARB 0x8829 #define GL_DRAW_BUFFER5_ARB 0x882A #define GL_DRAW_BUFFER6_ARB 0x882B #define GL_DRAW_BUFFER7_ARB 0x882C #define GL_DRAW_BUFFER8_ARB 0x882D #define GL_DRAW_BUFFER9_ARB 0x882E #define GL_DRAW_BUFFER10_ARB 0x882F #define GL_DRAW_BUFFER11_ARB 0x8830 #define GL_DRAW_BUFFER12_ARB 0x8831 #define GL_DRAW_BUFFER13_ARB 0x8832 #define GL_DRAW_BUFFER14_ARB 0x8833 #define GL_DRAW_BUFFER15_ARB 0x8834 typedef void (APIENTRYP PFNGLDRAWBUFFERSARBPROC) (GLsizei n, const GLenum *bufs); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glDrawBuffersARB (GLsizei n, const GLenum *bufs); #endif #endif /* GL_ARB_draw_buffers */ #ifndef GL_ARB_draw_buffers_blend #define GL_ARB_draw_buffers_blend 1 typedef void (APIENTRYP PFNGLBLENDEQUATIONIARBPROC) (GLuint buf, GLenum mode); typedef void (APIENTRYP PFNGLBLENDEQUATIONSEPARATEIARBPROC) (GLuint buf, GLenum modeRGB, GLenum modeAlpha); typedef void (APIENTRYP PFNGLBLENDFUNCIARBPROC) (GLuint buf, GLenum src, GLenum dst); typedef void (APIENTRYP PFNGLBLENDFUNCSEPARATEIARBPROC) (GLuint buf, GLenum srcRGB, GLenum dstRGB, GLenum srcAlpha, GLenum dstAlpha); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glBlendEquationiARB (GLuint buf, GLenum mode); GLAPI void APIENTRY glBlendEquationSeparateiARB (GLuint buf, GLenum modeRGB, GLenum modeAlpha); GLAPI void APIENTRY glBlendFunciARB (GLuint buf, GLenum src, GLenum dst); GLAPI void APIENTRY glBlendFuncSeparateiARB (GLuint buf, GLenum srcRGB, GLenum dstRGB, GLenum srcAlpha, GLenum dstAlpha); #endif #endif /* GL_ARB_draw_buffers_blend */ #ifndef GL_ARB_draw_elements_base_vertex #define GL_ARB_draw_elements_base_vertex 1 #endif /* GL_ARB_draw_elements_base_vertex */ #ifndef GL_ARB_draw_indirect #define GL_ARB_draw_indirect 1 #endif /* GL_ARB_draw_indirect */ #ifndef GL_ARB_draw_instanced #define GL_ARB_draw_instanced 1 typedef void (APIENTRYP PFNGLDRAWARRAYSINSTANCEDARBPROC) (GLenum mode, GLint first, GLsizei count, GLsizei primcount); typedef void (APIENTRYP PFNGLDRAWELEMENTSINSTANCEDARBPROC) (GLenum mode, GLsizei count, GLenum type, const void *indices, GLsizei primcount); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glDrawArraysInstancedARB (GLenum mode, GLint first, GLsizei count, GLsizei primcount); GLAPI void APIENTRY glDrawElementsInstancedARB (GLenum mode, GLsizei count, GLenum type, const void *indices, GLsizei primcount); #endif #endif /* GL_ARB_draw_instanced */ #ifndef GL_ARB_enhanced_layouts #define GL_ARB_enhanced_layouts 1 #endif /* GL_ARB_enhanced_layouts */ #ifndef GL_ARB_explicit_attrib_location #define GL_ARB_explicit_attrib_location 1 #endif /* GL_ARB_explicit_attrib_location */ #ifndef GL_ARB_explicit_uniform_location #define GL_ARB_explicit_uniform_location 1 #endif /* GL_ARB_explicit_uniform_location */ #ifndef GL_ARB_fragment_coord_conventions #define GL_ARB_fragment_coord_conventions 1 #endif /* GL_ARB_fragment_coord_conventions */ #ifndef GL_ARB_fragment_layer_viewport #define GL_ARB_fragment_layer_viewport 1 #endif /* GL_ARB_fragment_layer_viewport */ #ifndef GL_ARB_fragment_program #define GL_ARB_fragment_program 1 #define GL_FRAGMENT_PROGRAM_ARB 0x8804 #define GL_PROGRAM_FORMAT_ASCII_ARB 0x8875 #define GL_PROGRAM_LENGTH_ARB 0x8627 #define GL_PROGRAM_FORMAT_ARB 0x8876 #define GL_PROGRAM_BINDING_ARB 0x8677 #define GL_PROGRAM_INSTRUCTIONS_ARB 0x88A0 #define GL_MAX_PROGRAM_INSTRUCTIONS_ARB 0x88A1 #define GL_PROGRAM_NATIVE_INSTRUCTIONS_ARB 0x88A2 #define GL_MAX_PROGRAM_NATIVE_INSTRUCTIONS_ARB 0x88A3 #define GL_PROGRAM_TEMPORARIES_ARB 0x88A4 #define GL_MAX_PROGRAM_TEMPORARIES_ARB 0x88A5 #define GL_PROGRAM_NATIVE_TEMPORARIES_ARB 0x88A6 #define GL_MAX_PROGRAM_NATIVE_TEMPORARIES_ARB 0x88A7 #define GL_PROGRAM_PARAMETERS_ARB 0x88A8 #define GL_MAX_PROGRAM_PARAMETERS_ARB 0x88A9 #define GL_PROGRAM_NATIVE_PARAMETERS_ARB 0x88AA #define GL_MAX_PROGRAM_NATIVE_PARAMETERS_ARB 0x88AB #define GL_PROGRAM_ATTRIBS_ARB 0x88AC #define GL_MAX_PROGRAM_ATTRIBS_ARB 0x88AD #define GL_PROGRAM_NATIVE_ATTRIBS_ARB 0x88AE #define GL_MAX_PROGRAM_NATIVE_ATTRIBS_ARB 0x88AF #define GL_MAX_PROGRAM_LOCAL_PARAMETERS_ARB 0x88B4 #define GL_MAX_PROGRAM_ENV_PARAMETERS_ARB 0x88B5 #define GL_PROGRAM_UNDER_NATIVE_LIMITS_ARB 0x88B6 #define GL_PROGRAM_ALU_INSTRUCTIONS_ARB 0x8805 #define GL_PROGRAM_TEX_INSTRUCTIONS_ARB 0x8806 #define GL_PROGRAM_TEX_INDIRECTIONS_ARB 0x8807 #define GL_PROGRAM_NATIVE_ALU_INSTRUCTIONS_ARB 0x8808 #define GL_PROGRAM_NATIVE_TEX_INSTRUCTIONS_ARB 0x8809 #define GL_PROGRAM_NATIVE_TEX_INDIRECTIONS_ARB 0x880A #define GL_MAX_PROGRAM_ALU_INSTRUCTIONS_ARB 0x880B #define GL_MAX_PROGRAM_TEX_INSTRUCTIONS_ARB 0x880C #define GL_MAX_PROGRAM_TEX_INDIRECTIONS_ARB 0x880D #define GL_MAX_PROGRAM_NATIVE_ALU_INSTRUCTIONS_ARB 0x880E #define GL_MAX_PROGRAM_NATIVE_TEX_INSTRUCTIONS_ARB 0x880F #define GL_MAX_PROGRAM_NATIVE_TEX_INDIRECTIONS_ARB 0x8810 #define GL_PROGRAM_STRING_ARB 0x8628 #define GL_PROGRAM_ERROR_POSITION_ARB 0x864B #define GL_CURRENT_MATRIX_ARB 0x8641 #define GL_TRANSPOSE_CURRENT_MATRIX_ARB 0x88B7 #define GL_CURRENT_MATRIX_STACK_DEPTH_ARB 0x8640 #define GL_MAX_PROGRAM_MATRICES_ARB 0x862F #define GL_MAX_PROGRAM_MATRIX_STACK_DEPTH_ARB 0x862E #define GL_MAX_TEXTURE_COORDS_ARB 0x8871 #define GL_MAX_TEXTURE_IMAGE_UNITS_ARB 0x8872 #define GL_PROGRAM_ERROR_STRING_ARB 0x8874 #define GL_MATRIX0_ARB 0x88C0 #define GL_MATRIX1_ARB 0x88C1 #define GL_MATRIX2_ARB 0x88C2 #define GL_MATRIX3_ARB 0x88C3 #define GL_MATRIX4_ARB 0x88C4 #define GL_MATRIX5_ARB 0x88C5 #define GL_MATRIX6_ARB 0x88C6 #define GL_MATRIX7_ARB 0x88C7 #define GL_MATRIX8_ARB 0x88C8 #define GL_MATRIX9_ARB 0x88C9 #define GL_MATRIX10_ARB 0x88CA #define GL_MATRIX11_ARB 0x88CB #define GL_MATRIX12_ARB 0x88CC #define GL_MATRIX13_ARB 0x88CD #define GL_MATRIX14_ARB 0x88CE #define GL_MATRIX15_ARB 0x88CF #define GL_MATRIX16_ARB 0x88D0 #define GL_MATRIX17_ARB 0x88D1 #define GL_MATRIX18_ARB 0x88D2 #define GL_MATRIX19_ARB 0x88D3 #define GL_MATRIX20_ARB 0x88D4 #define GL_MATRIX21_ARB 0x88D5 #define GL_MATRIX22_ARB 0x88D6 #define GL_MATRIX23_ARB 0x88D7 #define GL_MATRIX24_ARB 0x88D8 #define GL_MATRIX25_ARB 0x88D9 #define GL_MATRIX26_ARB 0x88DA #define GL_MATRIX27_ARB 0x88DB #define GL_MATRIX28_ARB 0x88DC #define GL_MATRIX29_ARB 0x88DD #define GL_MATRIX30_ARB 0x88DE #define GL_MATRIX31_ARB 0x88DF typedef void (APIENTRYP PFNGLPROGRAMSTRINGARBPROC) (GLenum target, GLenum format, GLsizei len, const void *string); typedef void (APIENTRYP PFNGLBINDPROGRAMARBPROC) (GLenum target, GLuint program); typedef void (APIENTRYP PFNGLDELETEPROGRAMSARBPROC) (GLsizei n, const GLuint *programs); typedef void (APIENTRYP PFNGLGENPROGRAMSARBPROC) (GLsizei n, GLuint *programs); typedef void (APIENTRYP PFNGLPROGRAMENVPARAMETER4DARBPROC) (GLenum target, GLuint index, GLdouble x, GLdouble y, GLdouble z, GLdouble w); typedef void (APIENTRYP PFNGLPROGRAMENVPARAMETER4DVARBPROC) (GLenum target, GLuint index, const GLdouble *params); typedef void (APIENTRYP PFNGLPROGRAMENVPARAMETER4FARBPROC) (GLenum target, GLuint index, GLfloat x, GLfloat y, GLfloat z, GLfloat w); typedef void (APIENTRYP PFNGLPROGRAMENVPARAMETER4FVARBPROC) (GLenum target, GLuint index, const GLfloat *params); typedef void (APIENTRYP PFNGLPROGRAMLOCALPARAMETER4DARBPROC) (GLenum target, GLuint index, GLdouble x, GLdouble y, GLdouble z, GLdouble w); typedef void (APIENTRYP PFNGLPROGRAMLOCALPARAMETER4DVARBPROC) (GLenum target, GLuint index, const GLdouble *params); typedef void (APIENTRYP PFNGLPROGRAMLOCALPARAMETER4FARBPROC) (GLenum target, GLuint index, GLfloat x, GLfloat y, GLfloat z, GLfloat w); typedef void (APIENTRYP PFNGLPROGRAMLOCALPARAMETER4FVARBPROC) (GLenum target, GLuint index, const GLfloat *params); typedef void (APIENTRYP PFNGLGETPROGRAMENVPARAMETERDVARBPROC) (GLenum target, GLuint index, GLdouble *params); typedef void (APIENTRYP PFNGLGETPROGRAMENVPARAMETERFVARBPROC) (GLenum target, GLuint index, GLfloat *params); typedef void (APIENTRYP PFNGLGETPROGRAMLOCALPARAMETERDVARBPROC) (GLenum target, GLuint index, GLdouble *params); typedef void (APIENTRYP PFNGLGETPROGRAMLOCALPARAMETERFVARBPROC) (GLenum target, GLuint index, GLfloat *params); typedef void (APIENTRYP PFNGLGETPROGRAMIVARBPROC) (GLenum target, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGETPROGRAMSTRINGARBPROC) (GLenum target, GLenum pname, void *string); typedef GLboolean (APIENTRYP PFNGLISPROGRAMARBPROC) (GLuint program); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glProgramStringARB (GLenum target, GLenum format, GLsizei len, const void *string); GLAPI void APIENTRY glBindProgramARB (GLenum target, GLuint program); GLAPI void APIENTRY glDeleteProgramsARB (GLsizei n, const GLuint *programs); GLAPI void APIENTRY glGenProgramsARB (GLsizei n, GLuint *programs); GLAPI void APIENTRY glProgramEnvParameter4dARB (GLenum target, GLuint index, GLdouble x, GLdouble y, GLdouble z, GLdouble w); GLAPI void APIENTRY glProgramEnvParameter4dvARB (GLenum target, GLuint index, const GLdouble *params); GLAPI void APIENTRY glProgramEnvParameter4fARB (GLenum target, GLuint index, GLfloat x, GLfloat y, GLfloat z, GLfloat w); GLAPI void APIENTRY glProgramEnvParameter4fvARB (GLenum target, GLuint index, const GLfloat *params); GLAPI void APIENTRY glProgramLocalParameter4dARB (GLenum target, GLuint index, GLdouble x, GLdouble y, GLdouble z, GLdouble w); GLAPI void APIENTRY glProgramLocalParameter4dvARB (GLenum target, GLuint index, const GLdouble *params); GLAPI void APIENTRY glProgramLocalParameter4fARB (GLenum target, GLuint index, GLfloat x, GLfloat y, GLfloat z, GLfloat w); GLAPI void APIENTRY glProgramLocalParameter4fvARB (GLenum target, GLuint index, const GLfloat *params); GLAPI void APIENTRY glGetProgramEnvParameterdvARB (GLenum target, GLuint index, GLdouble *params); GLAPI void APIENTRY glGetProgramEnvParameterfvARB (GLenum target, GLuint index, GLfloat *params); GLAPI void APIENTRY glGetProgramLocalParameterdvARB (GLenum target, GLuint index, GLdouble *params); GLAPI void APIENTRY glGetProgramLocalParameterfvARB (GLenum target, GLuint index, GLfloat *params); GLAPI void APIENTRY glGetProgramivARB (GLenum target, GLenum pname, GLint *params); GLAPI void APIENTRY glGetProgramStringARB (GLenum target, GLenum pname, void *string); GLAPI GLboolean APIENTRY glIsProgramARB (GLuint program); #endif #endif /* GL_ARB_fragment_program */ #ifndef GL_ARB_fragment_program_shadow #define GL_ARB_fragment_program_shadow 1 #endif /* GL_ARB_fragment_program_shadow */ #ifndef GL_ARB_fragment_shader #define GL_ARB_fragment_shader 1 #define GL_FRAGMENT_SHADER_ARB 0x8B30 #define GL_MAX_FRAGMENT_UNIFORM_COMPONENTS_ARB 0x8B49 #define GL_FRAGMENT_SHADER_DERIVATIVE_HINT_ARB 0x8B8B #endif /* GL_ARB_fragment_shader */ #ifndef GL_ARB_framebuffer_no_attachments #define GL_ARB_framebuffer_no_attachments 1 #endif /* GL_ARB_framebuffer_no_attachments */ #ifndef GL_ARB_framebuffer_object #define GL_ARB_framebuffer_object 1 #endif /* GL_ARB_framebuffer_object */ #ifndef GL_ARB_framebuffer_sRGB #define GL_ARB_framebuffer_sRGB 1 #endif /* GL_ARB_framebuffer_sRGB */ #ifndef GL_ARB_geometry_shader4 #define GL_ARB_geometry_shader4 1 #define GL_LINES_ADJACENCY_ARB 0x000A #define GL_LINE_STRIP_ADJACENCY_ARB 0x000B #define GL_TRIANGLES_ADJACENCY_ARB 0x000C #define GL_TRIANGLE_STRIP_ADJACENCY_ARB 0x000D #define GL_PROGRAM_POINT_SIZE_ARB 0x8642 #define GL_MAX_GEOMETRY_TEXTURE_IMAGE_UNITS_ARB 0x8C29 #define GL_FRAMEBUFFER_ATTACHMENT_LAYERED_ARB 0x8DA7 #define GL_FRAMEBUFFER_INCOMPLETE_LAYER_TARGETS_ARB 0x8DA8 #define GL_FRAMEBUFFER_INCOMPLETE_LAYER_COUNT_ARB 0x8DA9 #define GL_GEOMETRY_SHADER_ARB 0x8DD9 #define GL_GEOMETRY_VERTICES_OUT_ARB 0x8DDA #define GL_GEOMETRY_INPUT_TYPE_ARB 0x8DDB #define GL_GEOMETRY_OUTPUT_TYPE_ARB 0x8DDC #define GL_MAX_GEOMETRY_VARYING_COMPONENTS_ARB 0x8DDD #define GL_MAX_VERTEX_VARYING_COMPONENTS_ARB 0x8DDE #define GL_MAX_GEOMETRY_UNIFORM_COMPONENTS_ARB 0x8DDF #define GL_MAX_GEOMETRY_OUTPUT_VERTICES_ARB 0x8DE0 #define GL_MAX_GEOMETRY_TOTAL_OUTPUT_COMPONENTS_ARB 0x8DE1 typedef void (APIENTRYP PFNGLPROGRAMPARAMETERIARBPROC) (GLuint program, GLenum pname, GLint value); typedef void (APIENTRYP PFNGLFRAMEBUFFERTEXTUREARBPROC) (GLenum target, GLenum attachment, GLuint texture, GLint level); typedef void (APIENTRYP PFNGLFRAMEBUFFERTEXTURELAYERARBPROC) (GLenum target, GLenum attachment, GLuint texture, GLint level, GLint layer); typedef void (APIENTRYP PFNGLFRAMEBUFFERTEXTUREFACEARBPROC) (GLenum target, GLenum attachment, GLuint texture, GLint level, GLenum face); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glProgramParameteriARB (GLuint program, GLenum pname, GLint value); GLAPI void APIENTRY glFramebufferTextureARB (GLenum target, GLenum attachment, GLuint texture, GLint level); GLAPI void APIENTRY glFramebufferTextureLayerARB (GLenum target, GLenum attachment, GLuint texture, GLint level, GLint layer); GLAPI void APIENTRY glFramebufferTextureFaceARB (GLenum target, GLenum attachment, GLuint texture, GLint level, GLenum face); #endif #endif /* GL_ARB_geometry_shader4 */ #ifndef GL_ARB_get_program_binary #define GL_ARB_get_program_binary 1 #endif /* GL_ARB_get_program_binary */ #ifndef GL_ARB_gpu_shader5 #define GL_ARB_gpu_shader5 1 #endif /* GL_ARB_gpu_shader5 */ #ifndef GL_ARB_gpu_shader_fp64 #define GL_ARB_gpu_shader_fp64 1 #endif /* GL_ARB_gpu_shader_fp64 */ #ifndef GL_ARB_half_float_pixel #define GL_ARB_half_float_pixel 1 typedef unsigned short GLhalfARB; #define GL_HALF_FLOAT_ARB 0x140B #endif /* GL_ARB_half_float_pixel */ #ifndef GL_ARB_half_float_vertex #define GL_ARB_half_float_vertex 1 #endif /* GL_ARB_half_float_vertex */ #ifndef GL_ARB_imaging #define GL_ARB_imaging 1 #define GL_BLEND_COLOR 0x8005 #define GL_BLEND_EQUATION 0x8009 #define GL_CONVOLUTION_1D 0x8010 #define GL_CONVOLUTION_2D 0x8011 #define GL_SEPARABLE_2D 0x8012 #define GL_CONVOLUTION_BORDER_MODE 0x8013 #define GL_CONVOLUTION_FILTER_SCALE 0x8014 #define GL_CONVOLUTION_FILTER_BIAS 0x8015 #define GL_REDUCE 0x8016 #define GL_CONVOLUTION_FORMAT 0x8017 #define GL_CONVOLUTION_WIDTH 0x8018 #define GL_CONVOLUTION_HEIGHT 0x8019 #define GL_MAX_CONVOLUTION_WIDTH 0x801A #define GL_MAX_CONVOLUTION_HEIGHT 0x801B #define GL_POST_CONVOLUTION_RED_SCALE 0x801C #define GL_POST_CONVOLUTION_GREEN_SCALE 0x801D #define GL_POST_CONVOLUTION_BLUE_SCALE 0x801E #define GL_POST_CONVOLUTION_ALPHA_SCALE 0x801F #define GL_POST_CONVOLUTION_RED_BIAS 0x8020 #define GL_POST_CONVOLUTION_GREEN_BIAS 0x8021 #define GL_POST_CONVOLUTION_BLUE_BIAS 0x8022 #define GL_POST_CONVOLUTION_ALPHA_BIAS 0x8023 #define GL_HISTOGRAM 0x8024 #define GL_PROXY_HISTOGRAM 0x8025 #define GL_HISTOGRAM_WIDTH 0x8026 #define GL_HISTOGRAM_FORMAT 0x8027 #define GL_HISTOGRAM_RED_SIZE 0x8028 #define GL_HISTOGRAM_GREEN_SIZE 0x8029 #define GL_HISTOGRAM_BLUE_SIZE 0x802A #define GL_HISTOGRAM_ALPHA_SIZE 0x802B #define GL_HISTOGRAM_LUMINANCE_SIZE 0x802C #define GL_HISTOGRAM_SINK 0x802D #define GL_MINMAX 0x802E #define GL_MINMAX_FORMAT 0x802F #define GL_MINMAX_SINK 0x8030 #define GL_TABLE_TOO_LARGE 0x8031 #define GL_COLOR_MATRIX 0x80B1 #define GL_COLOR_MATRIX_STACK_DEPTH 0x80B2 #define GL_MAX_COLOR_MATRIX_STACK_DEPTH 0x80B3 #define GL_POST_COLOR_MATRIX_RED_SCALE 0x80B4 #define GL_POST_COLOR_MATRIX_GREEN_SCALE 0x80B5 #define GL_POST_COLOR_MATRIX_BLUE_SCALE 0x80B6 #define GL_POST_COLOR_MATRIX_ALPHA_SCALE 0x80B7 #define GL_POST_COLOR_MATRIX_RED_BIAS 0x80B8 #define GL_POST_COLOR_MATRIX_GREEN_BIAS 0x80B9 #define GL_POST_COLOR_MATRIX_BLUE_BIAS 0x80BA #define GL_POST_COLOR_MATRIX_ALPHA_BIAS 0x80BB #define GL_COLOR_TABLE 0x80D0 #define GL_POST_CONVOLUTION_COLOR_TABLE 0x80D1 #define GL_POST_COLOR_MATRIX_COLOR_TABLE 0x80D2 #define GL_PROXY_COLOR_TABLE 0x80D3 #define GL_PROXY_POST_CONVOLUTION_COLOR_TABLE 0x80D4 #define GL_PROXY_POST_COLOR_MATRIX_COLOR_TABLE 0x80D5 #define GL_COLOR_TABLE_SCALE 0x80D6 #define GL_COLOR_TABLE_BIAS 0x80D7 #define GL_COLOR_TABLE_FORMAT 0x80D8 #define GL_COLOR_TABLE_WIDTH 0x80D9 #define GL_COLOR_TABLE_RED_SIZE 0x80DA #define GL_COLOR_TABLE_GREEN_SIZE 0x80DB #define GL_COLOR_TABLE_BLUE_SIZE 0x80DC #define GL_COLOR_TABLE_ALPHA_SIZE 0x80DD #define GL_COLOR_TABLE_LUMINANCE_SIZE 0x80DE #define GL_COLOR_TABLE_INTENSITY_SIZE 0x80DF #define GL_CONSTANT_BORDER 0x8151 #define GL_REPLICATE_BORDER 0x8153 #define GL_CONVOLUTION_BORDER_COLOR 0x8154 typedef void (APIENTRYP PFNGLCOLORTABLEPROC) (GLenum target, GLenum internalformat, GLsizei width, GLenum format, GLenum type, const void *table); typedef void (APIENTRYP PFNGLCOLORTABLEPARAMETERFVPROC) (GLenum target, GLenum pname, const GLfloat *params); typedef void (APIENTRYP PFNGLCOLORTABLEPARAMETERIVPROC) (GLenum target, GLenum pname, const GLint *params); typedef void (APIENTRYP PFNGLCOPYCOLORTABLEPROC) (GLenum target, GLenum internalformat, GLint x, GLint y, GLsizei width); typedef void (APIENTRYP PFNGLGETCOLORTABLEPROC) (GLenum target, GLenum format, GLenum type, void *table); typedef void (APIENTRYP PFNGLGETCOLORTABLEPARAMETERFVPROC) (GLenum target, GLenum pname, GLfloat *params); typedef void (APIENTRYP PFNGLGETCOLORTABLEPARAMETERIVPROC) (GLenum target, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLCOLORSUBTABLEPROC) (GLenum target, GLsizei start, GLsizei count, GLenum format, GLenum type, const void *data); typedef void (APIENTRYP PFNGLCOPYCOLORSUBTABLEPROC) (GLenum target, GLsizei start, GLint x, GLint y, GLsizei width); typedef void (APIENTRYP PFNGLCONVOLUTIONFILTER1DPROC) (GLenum target, GLenum internalformat, GLsizei width, GLenum format, GLenum type, const void *image); typedef void (APIENTRYP PFNGLCONVOLUTIONFILTER2DPROC) (GLenum target, GLenum internalformat, GLsizei width, GLsizei height, GLenum format, GLenum type, const void *image); typedef void (APIENTRYP PFNGLCONVOLUTIONPARAMETERFPROC) (GLenum target, GLenum pname, GLfloat params); typedef void (APIENTRYP PFNGLCONVOLUTIONPARAMETERFVPROC) (GLenum target, GLenum pname, const GLfloat *params); typedef void (APIENTRYP PFNGLCONVOLUTIONPARAMETERIPROC) (GLenum target, GLenum pname, GLint params); typedef void (APIENTRYP PFNGLCONVOLUTIONPARAMETERIVPROC) (GLenum target, GLenum pname, const GLint *params); typedef void (APIENTRYP PFNGLCOPYCONVOLUTIONFILTER1DPROC) (GLenum target, GLenum internalformat, GLint x, GLint y, GLsizei width); typedef void (APIENTRYP PFNGLCOPYCONVOLUTIONFILTER2DPROC) (GLenum target, GLenum internalformat, GLint x, GLint y, GLsizei width, GLsizei height); typedef void (APIENTRYP PFNGLGETCONVOLUTIONFILTERPROC) (GLenum target, GLenum format, GLenum type, void *image); typedef void (APIENTRYP PFNGLGETCONVOLUTIONPARAMETERFVPROC) (GLenum target, GLenum pname, GLfloat *params); typedef void (APIENTRYP PFNGLGETCONVOLUTIONPARAMETERIVPROC) (GLenum target, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGETSEPARABLEFILTERPROC) (GLenum target, GLenum format, GLenum type, void *row, void *column, void *span); typedef void (APIENTRYP PFNGLSEPARABLEFILTER2DPROC) (GLenum target, GLenum internalformat, GLsizei width, GLsizei height, GLenum format, GLenum type, const void *row, const void *column); typedef void (APIENTRYP PFNGLGETHISTOGRAMPROC) (GLenum target, GLboolean reset, GLenum format, GLenum type, void *values); typedef void (APIENTRYP PFNGLGETHISTOGRAMPARAMETERFVPROC) (GLenum target, GLenum pname, GLfloat *params); typedef void (APIENTRYP PFNGLGETHISTOGRAMPARAMETERIVPROC) (GLenum target, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGETMINMAXPROC) (GLenum target, GLboolean reset, GLenum format, GLenum type, void *values); typedef void (APIENTRYP PFNGLGETMINMAXPARAMETERFVPROC) (GLenum target, GLenum pname, GLfloat *params); typedef void (APIENTRYP PFNGLGETMINMAXPARAMETERIVPROC) (GLenum target, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLHISTOGRAMPROC) (GLenum target, GLsizei width, GLenum internalformat, GLboolean sink); typedef void (APIENTRYP PFNGLMINMAXPROC) (GLenum target, GLenum internalformat, GLboolean sink); typedef void (APIENTRYP PFNGLRESETHISTOGRAMPROC) (GLenum target); typedef void (APIENTRYP PFNGLRESETMINMAXPROC) (GLenum target); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glColorTable (GLenum target, GLenum internalformat, GLsizei width, GLenum format, GLenum type, const void *table); GLAPI void APIENTRY glColorTableParameterfv (GLenum target, GLenum pname, const GLfloat *params); GLAPI void APIENTRY glColorTableParameteriv (GLenum target, GLenum pname, const GLint *params); GLAPI void APIENTRY glCopyColorTable (GLenum target, GLenum internalformat, GLint x, GLint y, GLsizei width); GLAPI void APIENTRY glGetColorTable (GLenum target, GLenum format, GLenum type, void *table); GLAPI void APIENTRY glGetColorTableParameterfv (GLenum target, GLenum pname, GLfloat *params); GLAPI void APIENTRY glGetColorTableParameteriv (GLenum target, GLenum pname, GLint *params); GLAPI void APIENTRY glColorSubTable (GLenum target, GLsizei start, GLsizei count, GLenum format, GLenum type, const void *data); GLAPI void APIENTRY glCopyColorSubTable (GLenum target, GLsizei start, GLint x, GLint y, GLsizei width); GLAPI void APIENTRY glConvolutionFilter1D (GLenum target, GLenum internalformat, GLsizei width, GLenum format, GLenum type, const void *image); GLAPI void APIENTRY glConvolutionFilter2D (GLenum target, GLenum internalformat, GLsizei width, GLsizei height, GLenum format, GLenum type, const void *image); GLAPI void APIENTRY glConvolutionParameterf (GLenum target, GLenum pname, GLfloat params); GLAPI void APIENTRY glConvolutionParameterfv (GLenum target, GLenum pname, const GLfloat *params); GLAPI void APIENTRY glConvolutionParameteri (GLenum target, GLenum pname, GLint params); GLAPI void APIENTRY glConvolutionParameteriv (GLenum target, GLenum pname, const GLint *params); GLAPI void APIENTRY glCopyConvolutionFilter1D (GLenum target, GLenum internalformat, GLint x, GLint y, GLsizei width); GLAPI void APIENTRY glCopyConvolutionFilter2D (GLenum target, GLenum internalformat, GLint x, GLint y, GLsizei width, GLsizei height); GLAPI void APIENTRY glGetConvolutionFilter (GLenum target, GLenum format, GLenum type, void *image); GLAPI void APIENTRY glGetConvolutionParameterfv (GLenum target, GLenum pname, GLfloat *params); GLAPI void APIENTRY glGetConvolutionParameteriv (GLenum target, GLenum pname, GLint *params); GLAPI void APIENTRY glGetSeparableFilter (GLenum target, GLenum format, GLenum type, void *row, void *column, void *span); GLAPI void APIENTRY glSeparableFilter2D (GLenum target, GLenum internalformat, GLsizei width, GLsizei height, GLenum format, GLenum type, const void *row, const void *column); GLAPI void APIENTRY glGetHistogram (GLenum target, GLboolean reset, GLenum format, GLenum type, void *values); GLAPI void APIENTRY glGetHistogramParameterfv (GLenum target, GLenum pname, GLfloat *params); GLAPI void APIENTRY glGetHistogramParameteriv (GLenum target, GLenum pname, GLint *params); GLAPI void APIENTRY glGetMinmax (GLenum target, GLboolean reset, GLenum format, GLenum type, void *values); GLAPI void APIENTRY glGetMinmaxParameterfv (GLenum target, GLenum pname, GLfloat *params); GLAPI void APIENTRY glGetMinmaxParameteriv (GLenum target, GLenum pname, GLint *params); GLAPI void APIENTRY glHistogram (GLenum target, GLsizei width, GLenum internalformat, GLboolean sink); GLAPI void APIENTRY glMinmax (GLenum target, GLenum internalformat, GLboolean sink); GLAPI void APIENTRY glResetHistogram (GLenum target); GLAPI void APIENTRY glResetMinmax (GLenum target); #endif #endif /* GL_ARB_imaging */ #ifndef GL_ARB_indirect_parameters #define GL_ARB_indirect_parameters 1 #define GL_PARAMETER_BUFFER_ARB 0x80EE #define GL_PARAMETER_BUFFER_BINDING_ARB 0x80EF typedef void (APIENTRYP PFNGLMULTIDRAWARRAYSINDIRECTCOUNTARBPROC) (GLenum mode, GLintptr indirect, GLintptr drawcount, GLsizei maxdrawcount, GLsizei stride); typedef void (APIENTRYP PFNGLMULTIDRAWELEMENTSINDIRECTCOUNTARBPROC) (GLenum mode, GLenum type, GLintptr indirect, GLintptr drawcount, GLsizei maxdrawcount, GLsizei stride); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glMultiDrawArraysIndirectCountARB (GLenum mode, GLintptr indirect, GLintptr drawcount, GLsizei maxdrawcount, GLsizei stride); GLAPI void APIENTRY glMultiDrawElementsIndirectCountARB (GLenum mode, GLenum type, GLintptr indirect, GLintptr drawcount, GLsizei maxdrawcount, GLsizei stride); #endif #endif /* GL_ARB_indirect_parameters */ #ifndef GL_ARB_instanced_arrays #define GL_ARB_instanced_arrays 1 #define GL_VERTEX_ATTRIB_ARRAY_DIVISOR_ARB 0x88FE typedef void (APIENTRYP PFNGLVERTEXATTRIBDIVISORARBPROC) (GLuint index, GLuint divisor); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glVertexAttribDivisorARB (GLuint index, GLuint divisor); #endif #endif /* GL_ARB_instanced_arrays */ #ifndef GL_ARB_internalformat_query #define GL_ARB_internalformat_query 1 #endif /* GL_ARB_internalformat_query */ #ifndef GL_ARB_internalformat_query2 #define GL_ARB_internalformat_query2 1 #define GL_SRGB_DECODE_ARB 0x8299 #endif /* GL_ARB_internalformat_query2 */ #ifndef GL_ARB_invalidate_subdata #define GL_ARB_invalidate_subdata 1 #endif /* GL_ARB_invalidate_subdata */ #ifndef GL_ARB_map_buffer_alignment #define GL_ARB_map_buffer_alignment 1 #endif /* GL_ARB_map_buffer_alignment */ #ifndef GL_ARB_map_buffer_range #define GL_ARB_map_buffer_range 1 #endif /* GL_ARB_map_buffer_range */ #ifndef GL_ARB_matrix_palette #define GL_ARB_matrix_palette 1 #define GL_MATRIX_PALETTE_ARB 0x8840 #define GL_MAX_MATRIX_PALETTE_STACK_DEPTH_ARB 0x8841 #define GL_MAX_PALETTE_MATRICES_ARB 0x8842 #define GL_CURRENT_PALETTE_MATRIX_ARB 0x8843 #define GL_MATRIX_INDEX_ARRAY_ARB 0x8844 #define GL_CURRENT_MATRIX_INDEX_ARB 0x8845 #define GL_MATRIX_INDEX_ARRAY_SIZE_ARB 0x8846 #define GL_MATRIX_INDEX_ARRAY_TYPE_ARB 0x8847 #define GL_MATRIX_INDEX_ARRAY_STRIDE_ARB 0x8848 #define GL_MATRIX_INDEX_ARRAY_POINTER_ARB 0x8849 typedef void (APIENTRYP PFNGLCURRENTPALETTEMATRIXARBPROC) (GLint index); typedef void (APIENTRYP PFNGLMATRIXINDEXUBVARBPROC) (GLint size, const GLubyte *indices); typedef void (APIENTRYP PFNGLMATRIXINDEXUSVARBPROC) (GLint size, const GLushort *indices); typedef void (APIENTRYP PFNGLMATRIXINDEXUIVARBPROC) (GLint size, const GLuint *indices); typedef void (APIENTRYP PFNGLMATRIXINDEXPOINTERARBPROC) (GLint size, GLenum type, GLsizei stride, const void *pointer); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glCurrentPaletteMatrixARB (GLint index); GLAPI void APIENTRY glMatrixIndexubvARB (GLint size, const GLubyte *indices); GLAPI void APIENTRY glMatrixIndexusvARB (GLint size, const GLushort *indices); GLAPI void APIENTRY glMatrixIndexuivARB (GLint size, const GLuint *indices); GLAPI void APIENTRY glMatrixIndexPointerARB (GLint size, GLenum type, GLsizei stride, const void *pointer); #endif #endif /* GL_ARB_matrix_palette */ #ifndef GL_ARB_multi_bind #define GL_ARB_multi_bind 1 #endif /* GL_ARB_multi_bind */ #ifndef GL_ARB_multi_draw_indirect #define GL_ARB_multi_draw_indirect 1 #endif /* GL_ARB_multi_draw_indirect */ #ifndef GL_ARB_multisample #define GL_ARB_multisample 1 #define GL_MULTISAMPLE_ARB 0x809D #define GL_SAMPLE_ALPHA_TO_COVERAGE_ARB 0x809E #define GL_SAMPLE_ALPHA_TO_ONE_ARB 0x809F #define GL_SAMPLE_COVERAGE_ARB 0x80A0 #define GL_SAMPLE_BUFFERS_ARB 0x80A8 #define GL_SAMPLES_ARB 0x80A9 #define GL_SAMPLE_COVERAGE_VALUE_ARB 0x80AA #define GL_SAMPLE_COVERAGE_INVERT_ARB 0x80AB #define GL_MULTISAMPLE_BIT_ARB 0x20000000 typedef void (APIENTRYP PFNGLSAMPLECOVERAGEARBPROC) (GLfloat value, GLboolean invert); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glSampleCoverageARB (GLfloat value, GLboolean invert); #endif #endif /* GL_ARB_multisample */ #ifndef GL_ARB_multitexture #define GL_ARB_multitexture 1 #define GL_TEXTURE0_ARB 0x84C0 #define GL_TEXTURE1_ARB 0x84C1 #define GL_TEXTURE2_ARB 0x84C2 #define GL_TEXTURE3_ARB 0x84C3 #define GL_TEXTURE4_ARB 0x84C4 #define GL_TEXTURE5_ARB 0x84C5 #define GL_TEXTURE6_ARB 0x84C6 #define GL_TEXTURE7_ARB 0x84C7 #define GL_TEXTURE8_ARB 0x84C8 #define GL_TEXTURE9_ARB 0x84C9 #define GL_TEXTURE10_ARB 0x84CA #define GL_TEXTURE11_ARB 0x84CB #define GL_TEXTURE12_ARB 0x84CC #define GL_TEXTURE13_ARB 0x84CD #define GL_TEXTURE14_ARB 0x84CE #define GL_TEXTURE15_ARB 0x84CF #define GL_TEXTURE16_ARB 0x84D0 #define GL_TEXTURE17_ARB 0x84D1 #define GL_TEXTURE18_ARB 0x84D2 #define GL_TEXTURE19_ARB 0x84D3 #define GL_TEXTURE20_ARB 0x84D4 #define GL_TEXTURE21_ARB 0x84D5 #define GL_TEXTURE22_ARB 0x84D6 #define GL_TEXTURE23_ARB 0x84D7 #define GL_TEXTURE24_ARB 0x84D8 #define GL_TEXTURE25_ARB 0x84D9 #define GL_TEXTURE26_ARB 0x84DA #define GL_TEXTURE27_ARB 0x84DB #define GL_TEXTURE28_ARB 0x84DC #define GL_TEXTURE29_ARB 0x84DD #define GL_TEXTURE30_ARB 0x84DE #define GL_TEXTURE31_ARB 0x84DF #define GL_ACTIVE_TEXTURE_ARB 0x84E0 #define GL_CLIENT_ACTIVE_TEXTURE_ARB 0x84E1 #define GL_MAX_TEXTURE_UNITS_ARB 0x84E2 typedef void (APIENTRYP PFNGLACTIVETEXTUREARBPROC) (GLenum texture); typedef void (APIENTRYP PFNGLCLIENTACTIVETEXTUREARBPROC) (GLenum texture); typedef void (APIENTRYP PFNGLMULTITEXCOORD1DARBPROC) (GLenum target, GLdouble s); typedef void (APIENTRYP PFNGLMULTITEXCOORD1DVARBPROC) (GLenum target, const GLdouble *v); typedef void (APIENTRYP PFNGLMULTITEXCOORD1FARBPROC) (GLenum target, GLfloat s); typedef void (APIENTRYP PFNGLMULTITEXCOORD1FVARBPROC) (GLenum target, const GLfloat *v); typedef void (APIENTRYP PFNGLMULTITEXCOORD1IARBPROC) (GLenum target, GLint s); typedef void (APIENTRYP PFNGLMULTITEXCOORD1IVARBPROC) (GLenum target, const GLint *v); typedef void (APIENTRYP PFNGLMULTITEXCOORD1SARBPROC) (GLenum target, GLshort s); typedef void (APIENTRYP PFNGLMULTITEXCOORD1SVARBPROC) (GLenum target, const GLshort *v); typedef void (APIENTRYP PFNGLMULTITEXCOORD2DARBPROC) (GLenum target, GLdouble s, GLdouble t); typedef void (APIENTRYP PFNGLMULTITEXCOORD2DVARBPROC) (GLenum target, const GLdouble *v); typedef void (APIENTRYP PFNGLMULTITEXCOORD2FARBPROC) (GLenum target, GLfloat s, GLfloat t); typedef void (APIENTRYP PFNGLMULTITEXCOORD2FVARBPROC) (GLenum target, const GLfloat *v); typedef void (APIENTRYP PFNGLMULTITEXCOORD2IARBPROC) (GLenum target, GLint s, GLint t); typedef void (APIENTRYP PFNGLMULTITEXCOORD2IVARBPROC) (GLenum target, const GLint *v); typedef void (APIENTRYP PFNGLMULTITEXCOORD2SARBPROC) (GLenum target, GLshort s, GLshort t); typedef void (APIENTRYP PFNGLMULTITEXCOORD2SVARBPROC) (GLenum target, const GLshort *v); typedef void (APIENTRYP PFNGLMULTITEXCOORD3DARBPROC) (GLenum target, GLdouble s, GLdouble t, GLdouble r); typedef void (APIENTRYP PFNGLMULTITEXCOORD3DVARBPROC) (GLenum target, const GLdouble *v); typedef void (APIENTRYP PFNGLMULTITEXCOORD3FARBPROC) (GLenum target, GLfloat s, GLfloat t, GLfloat r); typedef void (APIENTRYP PFNGLMULTITEXCOORD3FVARBPROC) (GLenum target, const GLfloat *v); typedef void (APIENTRYP PFNGLMULTITEXCOORD3IARBPROC) (GLenum target, GLint s, GLint t, GLint r); typedef void (APIENTRYP PFNGLMULTITEXCOORD3IVARBPROC) (GLenum target, const GLint *v); typedef void (APIENTRYP PFNGLMULTITEXCOORD3SARBPROC) (GLenum target, GLshort s, GLshort t, GLshort r); typedef void (APIENTRYP PFNGLMULTITEXCOORD3SVARBPROC) (GLenum target, const GLshort *v); typedef void (APIENTRYP PFNGLMULTITEXCOORD4DARBPROC) (GLenum target, GLdouble s, GLdouble t, GLdouble r, GLdouble q); typedef void (APIENTRYP PFNGLMULTITEXCOORD4DVARBPROC) (GLenum target, const GLdouble *v); typedef void (APIENTRYP PFNGLMULTITEXCOORD4FARBPROC) (GLenum target, GLfloat s, GLfloat t, GLfloat r, GLfloat q); typedef void (APIENTRYP PFNGLMULTITEXCOORD4FVARBPROC) (GLenum target, const GLfloat *v); typedef void (APIENTRYP PFNGLMULTITEXCOORD4IARBPROC) (GLenum target, GLint s, GLint t, GLint r, GLint q); typedef void (APIENTRYP PFNGLMULTITEXCOORD4IVARBPROC) (GLenum target, const GLint *v); typedef void (APIENTRYP PFNGLMULTITEXCOORD4SARBPROC) (GLenum target, GLshort s, GLshort t, GLshort r, GLshort q); typedef void (APIENTRYP PFNGLMULTITEXCOORD4SVARBPROC) (GLenum target, const GLshort *v); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glActiveTextureARB (GLenum texture); GLAPI void APIENTRY glClientActiveTextureARB (GLenum texture); GLAPI void APIENTRY glMultiTexCoord1dARB (GLenum target, GLdouble s); GLAPI void APIENTRY glMultiTexCoord1dvARB (GLenum target, const GLdouble *v); GLAPI void APIENTRY glMultiTexCoord1fARB (GLenum target, GLfloat s); GLAPI void APIENTRY glMultiTexCoord1fvARB (GLenum target, const GLfloat *v); GLAPI void APIENTRY glMultiTexCoord1iARB (GLenum target, GLint s); GLAPI void APIENTRY glMultiTexCoord1ivARB (GLenum target, const GLint *v); GLAPI void APIENTRY glMultiTexCoord1sARB (GLenum target, GLshort s); GLAPI void APIENTRY glMultiTexCoord1svARB (GLenum target, const GLshort *v); GLAPI void APIENTRY glMultiTexCoord2dARB (GLenum target, GLdouble s, GLdouble t); GLAPI void APIENTRY glMultiTexCoord2dvARB (GLenum target, const GLdouble *v); GLAPI void APIENTRY glMultiTexCoord2fARB (GLenum target, GLfloat s, GLfloat t); GLAPI void APIENTRY glMultiTexCoord2fvARB (GLenum target, const GLfloat *v); GLAPI void APIENTRY glMultiTexCoord2iARB (GLenum target, GLint s, GLint t); GLAPI void APIENTRY glMultiTexCoord2ivARB (GLenum target, const GLint *v); GLAPI void APIENTRY glMultiTexCoord2sARB (GLenum target, GLshort s, GLshort t); GLAPI void APIENTRY glMultiTexCoord2svARB (GLenum target, const GLshort *v); GLAPI void APIENTRY glMultiTexCoord3dARB (GLenum target, GLdouble s, GLdouble t, GLdouble r); GLAPI void APIENTRY glMultiTexCoord3dvARB (GLenum target, const GLdouble *v); GLAPI void APIENTRY glMultiTexCoord3fARB (GLenum target, GLfloat s, GLfloat t, GLfloat r); GLAPI void APIENTRY glMultiTexCoord3fvARB (GLenum target, const GLfloat *v); GLAPI void APIENTRY glMultiTexCoord3iARB (GLenum target, GLint s, GLint t, GLint r); GLAPI void APIENTRY glMultiTexCoord3ivARB (GLenum target, const GLint *v); GLAPI void APIENTRY glMultiTexCoord3sARB (GLenum target, GLshort s, GLshort t, GLshort r); GLAPI void APIENTRY glMultiTexCoord3svARB (GLenum target, const GLshort *v); GLAPI void APIENTRY glMultiTexCoord4dARB (GLenum target, GLdouble s, GLdouble t, GLdouble r, GLdouble q); GLAPI void APIENTRY glMultiTexCoord4dvARB (GLenum target, const GLdouble *v); GLAPI void APIENTRY glMultiTexCoord4fARB (GLenum target, GLfloat s, GLfloat t, GLfloat r, GLfloat q); GLAPI void APIENTRY glMultiTexCoord4fvARB (GLenum target, const GLfloat *v); GLAPI void APIENTRY glMultiTexCoord4iARB (GLenum target, GLint s, GLint t, GLint r, GLint q); GLAPI void APIENTRY glMultiTexCoord4ivARB (GLenum target, const GLint *v); GLAPI void APIENTRY glMultiTexCoord4sARB (GLenum target, GLshort s, GLshort t, GLshort r, GLshort q); GLAPI void APIENTRY glMultiTexCoord4svARB (GLenum target, const GLshort *v); #endif #endif /* GL_ARB_multitexture */ #ifndef GL_ARB_occlusion_query #define GL_ARB_occlusion_query 1 #define GL_QUERY_COUNTER_BITS_ARB 0x8864 #define GL_CURRENT_QUERY_ARB 0x8865 #define GL_QUERY_RESULT_ARB 0x8866 #define GL_QUERY_RESULT_AVAILABLE_ARB 0x8867 #define GL_SAMPLES_PASSED_ARB 0x8914 typedef void (APIENTRYP PFNGLGENQUERIESARBPROC) (GLsizei n, GLuint *ids); typedef void (APIENTRYP PFNGLDELETEQUERIESARBPROC) (GLsizei n, const GLuint *ids); typedef GLboolean (APIENTRYP PFNGLISQUERYARBPROC) (GLuint id); typedef void (APIENTRYP PFNGLBEGINQUERYARBPROC) (GLenum target, GLuint id); typedef void (APIENTRYP PFNGLENDQUERYARBPROC) (GLenum target); typedef void (APIENTRYP PFNGLGETQUERYIVARBPROC) (GLenum target, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGETQUERYOBJECTIVARBPROC) (GLuint id, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGETQUERYOBJECTUIVARBPROC) (GLuint id, GLenum pname, GLuint *params); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glGenQueriesARB (GLsizei n, GLuint *ids); GLAPI void APIENTRY glDeleteQueriesARB (GLsizei n, const GLuint *ids); GLAPI GLboolean APIENTRY glIsQueryARB (GLuint id); GLAPI void APIENTRY glBeginQueryARB (GLenum target, GLuint id); GLAPI void APIENTRY glEndQueryARB (GLenum target); GLAPI void APIENTRY glGetQueryivARB (GLenum target, GLenum pname, GLint *params); GLAPI void APIENTRY glGetQueryObjectivARB (GLuint id, GLenum pname, GLint *params); GLAPI void APIENTRY glGetQueryObjectuivARB (GLuint id, GLenum pname, GLuint *params); #endif #endif /* GL_ARB_occlusion_query */ #ifndef GL_ARB_occlusion_query2 #define GL_ARB_occlusion_query2 1 #endif /* GL_ARB_occlusion_query2 */ #ifndef GL_ARB_pixel_buffer_object #define GL_ARB_pixel_buffer_object 1 #define GL_PIXEL_PACK_BUFFER_ARB 0x88EB #define GL_PIXEL_UNPACK_BUFFER_ARB 0x88EC #define GL_PIXEL_PACK_BUFFER_BINDING_ARB 0x88ED #define GL_PIXEL_UNPACK_BUFFER_BINDING_ARB 0x88EF #endif /* GL_ARB_pixel_buffer_object */ #ifndef GL_ARB_point_parameters #define GL_ARB_point_parameters 1 #define GL_POINT_SIZE_MIN_ARB 0x8126 #define GL_POINT_SIZE_MAX_ARB 0x8127 #define GL_POINT_FADE_THRESHOLD_SIZE_ARB 0x8128 #define GL_POINT_DISTANCE_ATTENUATION_ARB 0x8129 typedef void (APIENTRYP PFNGLPOINTPARAMETERFARBPROC) (GLenum pname, GLfloat param); typedef void (APIENTRYP PFNGLPOINTPARAMETERFVARBPROC) (GLenum pname, const GLfloat *params); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glPointParameterfARB (GLenum pname, GLfloat param); GLAPI void APIENTRY glPointParameterfvARB (GLenum pname, const GLfloat *params); #endif #endif /* GL_ARB_point_parameters */ #ifndef GL_ARB_point_sprite #define GL_ARB_point_sprite 1 #define GL_POINT_SPRITE_ARB 0x8861 #define GL_COORD_REPLACE_ARB 0x8862 #endif /* GL_ARB_point_sprite */ #ifndef GL_ARB_program_interface_query #define GL_ARB_program_interface_query 1 #endif /* GL_ARB_program_interface_query */ #ifndef GL_ARB_provoking_vertex #define GL_ARB_provoking_vertex 1 #endif /* GL_ARB_provoking_vertex */ #ifndef GL_ARB_query_buffer_object #define GL_ARB_query_buffer_object 1 #endif /* GL_ARB_query_buffer_object */ #ifndef GL_ARB_robust_buffer_access_behavior #define GL_ARB_robust_buffer_access_behavior 1 #endif /* GL_ARB_robust_buffer_access_behavior */ #ifndef GL_ARB_robustness #define GL_ARB_robustness 1 #define GL_CONTEXT_FLAG_ROBUST_ACCESS_BIT_ARB 0x00000004 #define GL_LOSE_CONTEXT_ON_RESET_ARB 0x8252 #define GL_GUILTY_CONTEXT_RESET_ARB 0x8253 #define GL_INNOCENT_CONTEXT_RESET_ARB 0x8254 #define GL_UNKNOWN_CONTEXT_RESET_ARB 0x8255 #define GL_RESET_NOTIFICATION_STRATEGY_ARB 0x8256 #define GL_NO_RESET_NOTIFICATION_ARB 0x8261 typedef GLenum (APIENTRYP PFNGLGETGRAPHICSRESETSTATUSARBPROC) (void); typedef void (APIENTRYP PFNGLGETNTEXIMAGEARBPROC) (GLenum target, GLint level, GLenum format, GLenum type, GLsizei bufSize, void *img); typedef void (APIENTRYP PFNGLREADNPIXELSARBPROC) (GLint x, GLint y, GLsizei width, GLsizei height, GLenum format, GLenum type, GLsizei bufSize, void *data); typedef void (APIENTRYP PFNGLGETNCOMPRESSEDTEXIMAGEARBPROC) (GLenum target, GLint lod, GLsizei bufSize, void *img); typedef void (APIENTRYP PFNGLGETNUNIFORMFVARBPROC) (GLuint program, GLint location, GLsizei bufSize, GLfloat *params); typedef void (APIENTRYP PFNGLGETNUNIFORMIVARBPROC) (GLuint program, GLint location, GLsizei bufSize, GLint *params); typedef void (APIENTRYP PFNGLGETNUNIFORMUIVARBPROC) (GLuint program, GLint location, GLsizei bufSize, GLuint *params); typedef void (APIENTRYP PFNGLGETNUNIFORMDVARBPROC) (GLuint program, GLint location, GLsizei bufSize, GLdouble *params); typedef void (APIENTRYP PFNGLGETNMAPDVARBPROC) (GLenum target, GLenum query, GLsizei bufSize, GLdouble *v); typedef void (APIENTRYP PFNGLGETNMAPFVARBPROC) (GLenum target, GLenum query, GLsizei bufSize, GLfloat *v); typedef void (APIENTRYP PFNGLGETNMAPIVARBPROC) (GLenum target, GLenum query, GLsizei bufSize, GLint *v); typedef void (APIENTRYP PFNGLGETNPIXELMAPFVARBPROC) (GLenum map, GLsizei bufSize, GLfloat *values); typedef void (APIENTRYP PFNGLGETNPIXELMAPUIVARBPROC) (GLenum map, GLsizei bufSize, GLuint *values); typedef void (APIENTRYP PFNGLGETNPIXELMAPUSVARBPROC) (GLenum map, GLsizei bufSize, GLushort *values); typedef void (APIENTRYP PFNGLGETNPOLYGONSTIPPLEARBPROC) (GLsizei bufSize, GLubyte *pattern); typedef void (APIENTRYP PFNGLGETNCOLORTABLEARBPROC) (GLenum target, GLenum format, GLenum type, GLsizei bufSize, void *table); typedef void (APIENTRYP PFNGLGETNCONVOLUTIONFILTERARBPROC) (GLenum target, GLenum format, GLenum type, GLsizei bufSize, void *image); typedef void (APIENTRYP PFNGLGETNSEPARABLEFILTERARBPROC) (GLenum target, GLenum format, GLenum type, GLsizei rowBufSize, void *row, GLsizei columnBufSize, void *column, void *span); typedef void (APIENTRYP PFNGLGETNHISTOGRAMARBPROC) (GLenum target, GLboolean reset, GLenum format, GLenum type, GLsizei bufSize, void *values); typedef void (APIENTRYP PFNGLGETNMINMAXARBPROC) (GLenum target, GLboolean reset, GLenum format, GLenum type, GLsizei bufSize, void *values); #ifdef GL_GLEXT_PROTOTYPES GLAPI GLenum APIENTRY glGetGraphicsResetStatusARB (void); GLAPI void APIENTRY glGetnTexImageARB (GLenum target, GLint level, GLenum format, GLenum type, GLsizei bufSize, void *img); GLAPI void APIENTRY glReadnPixelsARB (GLint x, GLint y, GLsizei width, GLsizei height, GLenum format, GLenum type, GLsizei bufSize, void *data); GLAPI void APIENTRY glGetnCompressedTexImageARB (GLenum target, GLint lod, GLsizei bufSize, void *img); GLAPI void APIENTRY glGetnUniformfvARB (GLuint program, GLint location, GLsizei bufSize, GLfloat *params); GLAPI void APIENTRY glGetnUniformivARB (GLuint program, GLint location, GLsizei bufSize, GLint *params); GLAPI void APIENTRY glGetnUniformuivARB (GLuint program, GLint location, GLsizei bufSize, GLuint *params); GLAPI void APIENTRY glGetnUniformdvARB (GLuint program, GLint location, GLsizei bufSize, GLdouble *params); GLAPI void APIENTRY glGetnMapdvARB (GLenum target, GLenum query, GLsizei bufSize, GLdouble *v); GLAPI void APIENTRY glGetnMapfvARB (GLenum target, GLenum query, GLsizei bufSize, GLfloat *v); GLAPI void APIENTRY glGetnMapivARB (GLenum target, GLenum query, GLsizei bufSize, GLint *v); GLAPI void APIENTRY glGetnPixelMapfvARB (GLenum map, GLsizei bufSize, GLfloat *values); GLAPI void APIENTRY glGetnPixelMapuivARB (GLenum map, GLsizei bufSize, GLuint *values); GLAPI void APIENTRY glGetnPixelMapusvARB (GLenum map, GLsizei bufSize, GLushort *values); GLAPI void APIENTRY glGetnPolygonStippleARB (GLsizei bufSize, GLubyte *pattern); GLAPI void APIENTRY glGetnColorTableARB (GLenum target, GLenum format, GLenum type, GLsizei bufSize, void *table); GLAPI void APIENTRY glGetnConvolutionFilterARB (GLenum target, GLenum format, GLenum type, GLsizei bufSize, void *image); GLAPI void APIENTRY glGetnSeparableFilterARB (GLenum target, GLenum format, GLenum type, GLsizei rowBufSize, void *row, GLsizei columnBufSize, void *column, void *span); GLAPI void APIENTRY glGetnHistogramARB (GLenum target, GLboolean reset, GLenum format, GLenum type, GLsizei bufSize, void *values); GLAPI void APIENTRY glGetnMinmaxARB (GLenum target, GLboolean reset, GLenum format, GLenum type, GLsizei bufSize, void *values); #endif #endif /* GL_ARB_robustness */ #ifndef GL_ARB_robustness_isolation #define GL_ARB_robustness_isolation 1 #endif /* GL_ARB_robustness_isolation */ #ifndef GL_ARB_sample_shading #define GL_ARB_sample_shading 1 #define GL_SAMPLE_SHADING_ARB 0x8C36 #define GL_MIN_SAMPLE_SHADING_VALUE_ARB 0x8C37 typedef void (APIENTRYP PFNGLMINSAMPLESHADINGARBPROC) (GLfloat value); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glMinSampleShadingARB (GLfloat value); #endif #endif /* GL_ARB_sample_shading */ #ifndef GL_ARB_sampler_objects #define GL_ARB_sampler_objects 1 #endif /* GL_ARB_sampler_objects */ #ifndef GL_ARB_seamless_cube_map #define GL_ARB_seamless_cube_map 1 #endif /* GL_ARB_seamless_cube_map */ #ifndef GL_ARB_seamless_cubemap_per_texture #define GL_ARB_seamless_cubemap_per_texture 1 #endif /* GL_ARB_seamless_cubemap_per_texture */ #ifndef GL_ARB_separate_shader_objects #define GL_ARB_separate_shader_objects 1 #endif /* GL_ARB_separate_shader_objects */ #ifndef GL_ARB_shader_atomic_counters #define GL_ARB_shader_atomic_counters 1 #endif /* GL_ARB_shader_atomic_counters */ #ifndef GL_ARB_shader_bit_encoding #define GL_ARB_shader_bit_encoding 1 #endif /* GL_ARB_shader_bit_encoding */ #ifndef GL_ARB_shader_draw_parameters #define GL_ARB_shader_draw_parameters 1 #endif /* GL_ARB_shader_draw_parameters */ #ifndef GL_ARB_shader_group_vote #define GL_ARB_shader_group_vote 1 #endif /* GL_ARB_shader_group_vote */ #ifndef GL_ARB_shader_image_load_store #define GL_ARB_shader_image_load_store 1 #endif /* GL_ARB_shader_image_load_store */ #ifndef GL_ARB_shader_image_size #define GL_ARB_shader_image_size 1 #endif /* GL_ARB_shader_image_size */ #ifndef GL_ARB_shader_objects #define GL_ARB_shader_objects 1 #ifdef __APPLE__ typedef void *GLhandleARB; #else typedef unsigned int GLhandleARB; #endif typedef char GLcharARB; #define GL_PROGRAM_OBJECT_ARB 0x8B40 #define GL_SHADER_OBJECT_ARB 0x8B48 #define GL_OBJECT_TYPE_ARB 0x8B4E #define GL_OBJECT_SUBTYPE_ARB 0x8B4F #define GL_FLOAT_VEC2_ARB 0x8B50 #define GL_FLOAT_VEC3_ARB 0x8B51 #define GL_FLOAT_VEC4_ARB 0x8B52 #define GL_INT_VEC2_ARB 0x8B53 #define GL_INT_VEC3_ARB 0x8B54 #define GL_INT_VEC4_ARB 0x8B55 #define GL_BOOL_ARB 0x8B56 #define GL_BOOL_VEC2_ARB 0x8B57 #define GL_BOOL_VEC3_ARB 0x8B58 #define GL_BOOL_VEC4_ARB 0x8B59 #define GL_FLOAT_MAT2_ARB 0x8B5A #define GL_FLOAT_MAT3_ARB 0x8B5B #define GL_FLOAT_MAT4_ARB 0x8B5C #define GL_SAMPLER_1D_ARB 0x8B5D #define GL_SAMPLER_2D_ARB 0x8B5E #define GL_SAMPLER_3D_ARB 0x8B5F #define GL_SAMPLER_CUBE_ARB 0x8B60 #define GL_SAMPLER_1D_SHADOW_ARB 0x8B61 #define GL_SAMPLER_2D_SHADOW_ARB 0x8B62 #define GL_SAMPLER_2D_RECT_ARB 0x8B63 #define GL_SAMPLER_2D_RECT_SHADOW_ARB 0x8B64 #define GL_OBJECT_DELETE_STATUS_ARB 0x8B80 #define GL_OBJECT_COMPILE_STATUS_ARB 0x8B81 #define GL_OBJECT_LINK_STATUS_ARB 0x8B82 #define GL_OBJECT_VALIDATE_STATUS_ARB 0x8B83 #define GL_OBJECT_INFO_LOG_LENGTH_ARB 0x8B84 #define GL_OBJECT_ATTACHED_OBJECTS_ARB 0x8B85 #define GL_OBJECT_ACTIVE_UNIFORMS_ARB 0x8B86 #define GL_OBJECT_ACTIVE_UNIFORM_MAX_LENGTH_ARB 0x8B87 #define GL_OBJECT_SHADER_SOURCE_LENGTH_ARB 0x8B88 typedef void (APIENTRYP PFNGLDELETEOBJECTARBPROC) (GLhandleARB obj); typedef GLhandleARB (APIENTRYP PFNGLGETHANDLEARBPROC) (GLenum pname); typedef void (APIENTRYP PFNGLDETACHOBJECTARBPROC) (GLhandleARB containerObj, GLhandleARB attachedObj); typedef GLhandleARB (APIENTRYP PFNGLCREATESHADEROBJECTARBPROC) (GLenum shaderType); typedef void (APIENTRYP PFNGLSHADERSOURCEARBPROC) (GLhandleARB shaderObj, GLsizei count, const GLcharARB **string, const GLint *length); typedef void (APIENTRYP PFNGLCOMPILESHADERARBPROC) (GLhandleARB shaderObj); typedef GLhandleARB (APIENTRYP PFNGLCREATEPROGRAMOBJECTARBPROC) (void); typedef void (APIENTRYP PFNGLATTACHOBJECTARBPROC) (GLhandleARB containerObj, GLhandleARB obj); typedef void (APIENTRYP PFNGLLINKPROGRAMARBPROC) (GLhandleARB programObj); typedef void (APIENTRYP PFNGLUSEPROGRAMOBJECTARBPROC) (GLhandleARB programObj); typedef void (APIENTRYP PFNGLVALIDATEPROGRAMARBPROC) (GLhandleARB programObj); typedef void (APIENTRYP PFNGLUNIFORM1FARBPROC) (GLint location, GLfloat v0); typedef void (APIENTRYP PFNGLUNIFORM2FARBPROC) (GLint location, GLfloat v0, GLfloat v1); typedef void (APIENTRYP PFNGLUNIFORM3FARBPROC) (GLint location, GLfloat v0, GLfloat v1, GLfloat v2); typedef void (APIENTRYP PFNGLUNIFORM4FARBPROC) (GLint location, GLfloat v0, GLfloat v1, GLfloat v2, GLfloat v3); typedef void (APIENTRYP PFNGLUNIFORM1IARBPROC) (GLint location, GLint v0); typedef void (APIENTRYP PFNGLUNIFORM2IARBPROC) (GLint location, GLint v0, GLint v1); typedef void (APIENTRYP PFNGLUNIFORM3IARBPROC) (GLint location, GLint v0, GLint v1, GLint v2); typedef void (APIENTRYP PFNGLUNIFORM4IARBPROC) (GLint location, GLint v0, GLint v1, GLint v2, GLint v3); typedef void (APIENTRYP PFNGLUNIFORM1FVARBPROC) (GLint location, GLsizei count, const GLfloat *value); typedef void (APIENTRYP PFNGLUNIFORM2FVARBPROC) (GLint location, GLsizei count, const GLfloat *value); typedef void (APIENTRYP PFNGLUNIFORM3FVARBPROC) (GLint location, GLsizei count, const GLfloat *value); typedef void (APIENTRYP PFNGLUNIFORM4FVARBPROC) (GLint location, GLsizei count, const GLfloat *value); typedef void (APIENTRYP PFNGLUNIFORM1IVARBPROC) (GLint location, GLsizei count, const GLint *value); typedef void (APIENTRYP PFNGLUNIFORM2IVARBPROC) (GLint location, GLsizei count, const GLint *value); typedef void (APIENTRYP PFNGLUNIFORM3IVARBPROC) (GLint location, GLsizei count, const GLint *value); typedef void (APIENTRYP PFNGLUNIFORM4IVARBPROC) (GLint location, GLsizei count, const GLint *value); typedef void (APIENTRYP PFNGLUNIFORMMATRIX2FVARBPROC) (GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); typedef void (APIENTRYP PFNGLUNIFORMMATRIX3FVARBPROC) (GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); typedef void (APIENTRYP PFNGLUNIFORMMATRIX4FVARBPROC) (GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); typedef void (APIENTRYP PFNGLGETOBJECTPARAMETERFVARBPROC) (GLhandleARB obj, GLenum pname, GLfloat *params); typedef void (APIENTRYP PFNGLGETOBJECTPARAMETERIVARBPROC) (GLhandleARB obj, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGETINFOLOGARBPROC) (GLhandleARB obj, GLsizei maxLength, GLsizei *length, GLcharARB *infoLog); typedef void (APIENTRYP PFNGLGETATTACHEDOBJECTSARBPROC) (GLhandleARB containerObj, GLsizei maxCount, GLsizei *count, GLhandleARB *obj); typedef GLint (APIENTRYP PFNGLGETUNIFORMLOCATIONARBPROC) (GLhandleARB programObj, const GLcharARB *name); typedef void (APIENTRYP PFNGLGETACTIVEUNIFORMARBPROC) (GLhandleARB programObj, GLuint index, GLsizei maxLength, GLsizei *length, GLint *size, GLenum *type, GLcharARB *name); typedef void (APIENTRYP PFNGLGETUNIFORMFVARBPROC) (GLhandleARB programObj, GLint location, GLfloat *params); typedef void (APIENTRYP PFNGLGETUNIFORMIVARBPROC) (GLhandleARB programObj, GLint location, GLint *params); typedef void (APIENTRYP PFNGLGETSHADERSOURCEARBPROC) (GLhandleARB obj, GLsizei maxLength, GLsizei *length, GLcharARB *source); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glDeleteObjectARB (GLhandleARB obj); GLAPI GLhandleARB APIENTRY glGetHandleARB (GLenum pname); GLAPI void APIENTRY glDetachObjectARB (GLhandleARB containerObj, GLhandleARB attachedObj); GLAPI GLhandleARB APIENTRY glCreateShaderObjectARB (GLenum shaderType); GLAPI void APIENTRY glShaderSourceARB (GLhandleARB shaderObj, GLsizei count, const GLcharARB **string, const GLint *length); GLAPI void APIENTRY glCompileShaderARB (GLhandleARB shaderObj); GLAPI GLhandleARB APIENTRY glCreateProgramObjectARB (void); GLAPI void APIENTRY glAttachObjectARB (GLhandleARB containerObj, GLhandleARB obj); GLAPI void APIENTRY glLinkProgramARB (GLhandleARB programObj); GLAPI void APIENTRY glUseProgramObjectARB (GLhandleARB programObj); GLAPI void APIENTRY glValidateProgramARB (GLhandleARB programObj); GLAPI void APIENTRY glUniform1fARB (GLint location, GLfloat v0); GLAPI void APIENTRY glUniform2fARB (GLint location, GLfloat v0, GLfloat v1); GLAPI void APIENTRY glUniform3fARB (GLint location, GLfloat v0, GLfloat v1, GLfloat v2); GLAPI void APIENTRY glUniform4fARB (GLint location, GLfloat v0, GLfloat v1, GLfloat v2, GLfloat v3); GLAPI void APIENTRY glUniform1iARB (GLint location, GLint v0); GLAPI void APIENTRY glUniform2iARB (GLint location, GLint v0, GLint v1); GLAPI void APIENTRY glUniform3iARB (GLint location, GLint v0, GLint v1, GLint v2); GLAPI void APIENTRY glUniform4iARB (GLint location, GLint v0, GLint v1, GLint v2, GLint v3); GLAPI void APIENTRY glUniform1fvARB (GLint location, GLsizei count, const GLfloat *value); GLAPI void APIENTRY glUniform2fvARB (GLint location, GLsizei count, const GLfloat *value); GLAPI void APIENTRY glUniform3fvARB (GLint location, GLsizei count, const GLfloat *value); GLAPI void APIENTRY glUniform4fvARB (GLint location, GLsizei count, const GLfloat *value); GLAPI void APIENTRY glUniform1ivARB (GLint location, GLsizei count, const GLint *value); GLAPI void APIENTRY glUniform2ivARB (GLint location, GLsizei count, const GLint *value); GLAPI void APIENTRY glUniform3ivARB (GLint location, GLsizei count, const GLint *value); GLAPI void APIENTRY glUniform4ivARB (GLint location, GLsizei count, const GLint *value); GLAPI void APIENTRY glUniformMatrix2fvARB (GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); GLAPI void APIENTRY glUniformMatrix3fvARB (GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); GLAPI void APIENTRY glUniformMatrix4fvARB (GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); GLAPI void APIENTRY glGetObjectParameterfvARB (GLhandleARB obj, GLenum pname, GLfloat *params); GLAPI void APIENTRY glGetObjectParameterivARB (GLhandleARB obj, GLenum pname, GLint *params); GLAPI void APIENTRY glGetInfoLogARB (GLhandleARB obj, GLsizei maxLength, GLsizei *length, GLcharARB *infoLog); GLAPI void APIENTRY glGetAttachedObjectsARB (GLhandleARB containerObj, GLsizei maxCount, GLsizei *count, GLhandleARB *obj); GLAPI GLint APIENTRY glGetUniformLocationARB (GLhandleARB programObj, const GLcharARB *name); GLAPI void APIENTRY glGetActiveUniformARB (GLhandleARB programObj, GLuint index, GLsizei maxLength, GLsizei *length, GLint *size, GLenum *type, GLcharARB *name); GLAPI void APIENTRY glGetUniformfvARB (GLhandleARB programObj, GLint location, GLfloat *params); GLAPI void APIENTRY glGetUniformivARB (GLhandleARB programObj, GLint location, GLint *params); GLAPI void APIENTRY glGetShaderSourceARB (GLhandleARB obj, GLsizei maxLength, GLsizei *length, GLcharARB *source); #endif #endif /* GL_ARB_shader_objects */ #ifndef GL_ARB_shader_precision #define GL_ARB_shader_precision 1 #endif /* GL_ARB_shader_precision */ #ifndef GL_ARB_shader_stencil_export #define GL_ARB_shader_stencil_export 1 #endif /* GL_ARB_shader_stencil_export */ #ifndef GL_ARB_shader_storage_buffer_object #define GL_ARB_shader_storage_buffer_object 1 #endif /* GL_ARB_shader_storage_buffer_object */ #ifndef GL_ARB_shader_subroutine #define GL_ARB_shader_subroutine 1 #endif /* GL_ARB_shader_subroutine */ #ifndef GL_ARB_shader_texture_lod #define GL_ARB_shader_texture_lod 1 #endif /* GL_ARB_shader_texture_lod */ #ifndef GL_ARB_shading_language_100 #define GL_ARB_shading_language_100 1 #define GL_SHADING_LANGUAGE_VERSION_ARB 0x8B8C #endif /* GL_ARB_shading_language_100 */ #ifndef GL_ARB_shading_language_420pack #define GL_ARB_shading_language_420pack 1 #endif /* GL_ARB_shading_language_420pack */ #ifndef GL_ARB_shading_language_include #define GL_ARB_shading_language_include 1 #define GL_SHADER_INCLUDE_ARB 0x8DAE #define GL_NAMED_STRING_LENGTH_ARB 0x8DE9 #define GL_NAMED_STRING_TYPE_ARB 0x8DEA typedef void (APIENTRYP PFNGLNAMEDSTRINGARBPROC) (GLenum type, GLint namelen, const GLchar *name, GLint stringlen, const GLchar *string); typedef void (APIENTRYP PFNGLDELETENAMEDSTRINGARBPROC) (GLint namelen, const GLchar *name); typedef void (APIENTRYP PFNGLCOMPILESHADERINCLUDEARBPROC) (GLuint shader, GLsizei count, const GLchar *const*path, const GLint *length); typedef GLboolean (APIENTRYP PFNGLISNAMEDSTRINGARBPROC) (GLint namelen, const GLchar *name); typedef void (APIENTRYP PFNGLGETNAMEDSTRINGARBPROC) (GLint namelen, const GLchar *name, GLsizei bufSize, GLint *stringlen, GLchar *string); typedef void (APIENTRYP PFNGLGETNAMEDSTRINGIVARBPROC) (GLint namelen, const GLchar *name, GLenum pname, GLint *params); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glNamedStringARB (GLenum type, GLint namelen, const GLchar *name, GLint stringlen, const GLchar *string); GLAPI void APIENTRY glDeleteNamedStringARB (GLint namelen, const GLchar *name); GLAPI void APIENTRY glCompileShaderIncludeARB (GLuint shader, GLsizei count, const GLchar *const*path, const GLint *length); GLAPI GLboolean APIENTRY glIsNamedStringARB (GLint namelen, const GLchar *name); GLAPI void APIENTRY glGetNamedStringARB (GLint namelen, const GLchar *name, GLsizei bufSize, GLint *stringlen, GLchar *string); GLAPI void APIENTRY glGetNamedStringivARB (GLint namelen, const GLchar *name, GLenum pname, GLint *params); #endif #endif /* GL_ARB_shading_language_include */ #ifndef GL_ARB_shading_language_packing #define GL_ARB_shading_language_packing 1 #endif /* GL_ARB_shading_language_packing */ #ifndef GL_ARB_shadow #define GL_ARB_shadow 1 #define GL_TEXTURE_COMPARE_MODE_ARB 0x884C #define GL_TEXTURE_COMPARE_FUNC_ARB 0x884D #define GL_COMPARE_R_TO_TEXTURE_ARB 0x884E #endif /* GL_ARB_shadow */ #ifndef GL_ARB_shadow_ambient #define GL_ARB_shadow_ambient 1 #define GL_TEXTURE_COMPARE_FAIL_VALUE_ARB 0x80BF #endif /* GL_ARB_shadow_ambient */ #ifndef GL_ARB_sparse_texture #define GL_ARB_sparse_texture 1 #define GL_TEXTURE_SPARSE_ARB 0x91A6 #define GL_VIRTUAL_PAGE_SIZE_INDEX_ARB 0x91A7 #define GL_MIN_SPARSE_LEVEL_ARB 0x919B #define GL_NUM_VIRTUAL_PAGE_SIZES_ARB 0x91A8 #define GL_VIRTUAL_PAGE_SIZE_X_ARB 0x9195 #define GL_VIRTUAL_PAGE_SIZE_Y_ARB 0x9196 #define GL_VIRTUAL_PAGE_SIZE_Z_ARB 0x9197 #define GL_MAX_SPARSE_TEXTURE_SIZE_ARB 0x9198 #define GL_MAX_SPARSE_3D_TEXTURE_SIZE_ARB 0x9199 #define GL_MAX_SPARSE_ARRAY_TEXTURE_LAYERS_ARB 0x919A #define GL_SPARSE_TEXTURE_FULL_ARRAY_CUBE_MIPMAPS_ARB 0x91A9 typedef void (APIENTRYP PFNGLTEXPAGECOMMITMENTARBPROC) (GLenum target, GLint level, GLint xoffset, GLint yoffset, GLint zoffset, GLsizei width, GLsizei height, GLsizei depth, GLboolean resident); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glTexPageCommitmentARB (GLenum target, GLint level, GLint xoffset, GLint yoffset, GLint zoffset, GLsizei width, GLsizei height, GLsizei depth, GLboolean resident); #endif #endif /* GL_ARB_sparse_texture */ #ifndef GL_ARB_stencil_texturing #define GL_ARB_stencil_texturing 1 #endif /* GL_ARB_stencil_texturing */ #ifndef GL_ARB_sync #define GL_ARB_sync 1 #endif /* GL_ARB_sync */ #ifndef GL_ARB_tessellation_shader #define GL_ARB_tessellation_shader 1 #endif /* GL_ARB_tessellation_shader */ #ifndef GL_ARB_texture_border_clamp #define GL_ARB_texture_border_clamp 1 #define GL_CLAMP_TO_BORDER_ARB 0x812D #endif /* GL_ARB_texture_border_clamp */ #ifndef GL_ARB_texture_buffer_object #define GL_ARB_texture_buffer_object 1 #define GL_TEXTURE_BUFFER_ARB 0x8C2A #define GL_MAX_TEXTURE_BUFFER_SIZE_ARB 0x8C2B #define GL_TEXTURE_BINDING_BUFFER_ARB 0x8C2C #define GL_TEXTURE_BUFFER_DATA_STORE_BINDING_ARB 0x8C2D #define GL_TEXTURE_BUFFER_FORMAT_ARB 0x8C2E typedef void (APIENTRYP PFNGLTEXBUFFERARBPROC) (GLenum target, GLenum internalformat, GLuint buffer); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glTexBufferARB (GLenum target, GLenum internalformat, GLuint buffer); #endif #endif /* GL_ARB_texture_buffer_object */ #ifndef GL_ARB_texture_buffer_object_rgb32 #define GL_ARB_texture_buffer_object_rgb32 1 #endif /* GL_ARB_texture_buffer_object_rgb32 */ #ifndef GL_ARB_texture_buffer_range #define GL_ARB_texture_buffer_range 1 #endif /* GL_ARB_texture_buffer_range */ #ifndef GL_ARB_texture_compression #define GL_ARB_texture_compression 1 #define GL_COMPRESSED_ALPHA_ARB 0x84E9 #define GL_COMPRESSED_LUMINANCE_ARB 0x84EA #define GL_COMPRESSED_LUMINANCE_ALPHA_ARB 0x84EB #define GL_COMPRESSED_INTENSITY_ARB 0x84EC #define GL_COMPRESSED_RGB_ARB 0x84ED #define GL_COMPRESSED_RGBA_ARB 0x84EE #define GL_TEXTURE_COMPRESSION_HINT_ARB 0x84EF #define GL_TEXTURE_COMPRESSED_IMAGE_SIZE_ARB 0x86A0 #define GL_TEXTURE_COMPRESSED_ARB 0x86A1 #define GL_NUM_COMPRESSED_TEXTURE_FORMATS_ARB 0x86A2 #define GL_COMPRESSED_TEXTURE_FORMATS_ARB 0x86A3 typedef void (APIENTRYP PFNGLCOMPRESSEDTEXIMAGE3DARBPROC) (GLenum target, GLint level, GLenum internalformat, GLsizei width, GLsizei height, GLsizei depth, GLint border, GLsizei imageSize, const void *data); typedef void (APIENTRYP PFNGLCOMPRESSEDTEXIMAGE2DARBPROC) (GLenum target, GLint level, GLenum internalformat, GLsizei width, GLsizei height, GLint border, GLsizei imageSize, const void *data); typedef void (APIENTRYP PFNGLCOMPRESSEDTEXIMAGE1DARBPROC) (GLenum target, GLint level, GLenum internalformat, GLsizei width, GLint border, GLsizei imageSize, const void *data); typedef void (APIENTRYP PFNGLCOMPRESSEDTEXSUBIMAGE3DARBPROC) (GLenum target, GLint level, GLint xoffset, GLint yoffset, GLint zoffset, GLsizei width, GLsizei height, GLsizei depth, GLenum format, GLsizei imageSize, const void *data); typedef void (APIENTRYP PFNGLCOMPRESSEDTEXSUBIMAGE2DARBPROC) (GLenum target, GLint level, GLint xoffset, GLint yoffset, GLsizei width, GLsizei height, GLenum format, GLsizei imageSize, const void *data); typedef void (APIENTRYP PFNGLCOMPRESSEDTEXSUBIMAGE1DARBPROC) (GLenum target, GLint level, GLint xoffset, GLsizei width, GLenum format, GLsizei imageSize, const void *data); typedef void (APIENTRYP PFNGLGETCOMPRESSEDTEXIMAGEARBPROC) (GLenum target, GLint level, void *img); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glCompressedTexImage3DARB (GLenum target, GLint level, GLenum internalformat, GLsizei width, GLsizei height, GLsizei depth, GLint border, GLsizei imageSize, const void *data); GLAPI void APIENTRY glCompressedTexImage2DARB (GLenum target, GLint level, GLenum internalformat, GLsizei width, GLsizei height, GLint border, GLsizei imageSize, const void *data); GLAPI void APIENTRY glCompressedTexImage1DARB (GLenum target, GLint level, GLenum internalformat, GLsizei width, GLint border, GLsizei imageSize, const void *data); GLAPI void APIENTRY glCompressedTexSubImage3DARB (GLenum target, GLint level, GLint xoffset, GLint yoffset, GLint zoffset, GLsizei width, GLsizei height, GLsizei depth, GLenum format, GLsizei imageSize, const void *data); GLAPI void APIENTRY glCompressedTexSubImage2DARB (GLenum target, GLint level, GLint xoffset, GLint yoffset, GLsizei width, GLsizei height, GLenum format, GLsizei imageSize, const void *data); GLAPI void APIENTRY glCompressedTexSubImage1DARB (GLenum target, GLint level, GLint xoffset, GLsizei width, GLenum format, GLsizei imageSize, const void *data); GLAPI void APIENTRY glGetCompressedTexImageARB (GLenum target, GLint level, void *img); #endif #endif /* GL_ARB_texture_compression */ #ifndef GL_ARB_texture_compression_bptc #define GL_ARB_texture_compression_bptc 1 #define GL_COMPRESSED_RGBA_BPTC_UNORM_ARB 0x8E8C #define GL_COMPRESSED_SRGB_ALPHA_BPTC_UNORM_ARB 0x8E8D #define GL_COMPRESSED_RGB_BPTC_SIGNED_FLOAT_ARB 0x8E8E #define GL_COMPRESSED_RGB_BPTC_UNSIGNED_FLOAT_ARB 0x8E8F #endif /* GL_ARB_texture_compression_bptc */ #ifndef GL_ARB_texture_compression_rgtc #define GL_ARB_texture_compression_rgtc 1 #endif /* GL_ARB_texture_compression_rgtc */ #ifndef GL_ARB_texture_cube_map #define GL_ARB_texture_cube_map 1 #define GL_NORMAL_MAP_ARB 0x8511 #define GL_REFLECTION_MAP_ARB 0x8512 #define GL_TEXTURE_CUBE_MAP_ARB 0x8513 #define GL_TEXTURE_BINDING_CUBE_MAP_ARB 0x8514 #define GL_TEXTURE_CUBE_MAP_POSITIVE_X_ARB 0x8515 #define GL_TEXTURE_CUBE_MAP_NEGATIVE_X_ARB 0x8516 #define GL_TEXTURE_CUBE_MAP_POSITIVE_Y_ARB 0x8517 #define GL_TEXTURE_CUBE_MAP_NEGATIVE_Y_ARB 0x8518 #define GL_TEXTURE_CUBE_MAP_POSITIVE_Z_ARB 0x8519 #define GL_TEXTURE_CUBE_MAP_NEGATIVE_Z_ARB 0x851A #define GL_PROXY_TEXTURE_CUBE_MAP_ARB 0x851B #define GL_MAX_CUBE_MAP_TEXTURE_SIZE_ARB 0x851C #endif /* GL_ARB_texture_cube_map */ #ifndef GL_ARB_texture_cube_map_array #define GL_ARB_texture_cube_map_array 1 #define GL_TEXTURE_CUBE_MAP_ARRAY_ARB 0x9009 #define GL_TEXTURE_BINDING_CUBE_MAP_ARRAY_ARB 0x900A #define GL_PROXY_TEXTURE_CUBE_MAP_ARRAY_ARB 0x900B #define GL_SAMPLER_CUBE_MAP_ARRAY_ARB 0x900C #define GL_SAMPLER_CUBE_MAP_ARRAY_SHADOW_ARB 0x900D #define GL_INT_SAMPLER_CUBE_MAP_ARRAY_ARB 0x900E #define GL_UNSIGNED_INT_SAMPLER_CUBE_MAP_ARRAY_ARB 0x900F #endif /* GL_ARB_texture_cube_map_array */ #ifndef GL_ARB_texture_env_add #define GL_ARB_texture_env_add 1 #endif /* GL_ARB_texture_env_add */ #ifndef GL_ARB_texture_env_combine #define GL_ARB_texture_env_combine 1 #define GL_COMBINE_ARB 0x8570 #define GL_COMBINE_RGB_ARB 0x8571 #define GL_COMBINE_ALPHA_ARB 0x8572 #define GL_SOURCE0_RGB_ARB 0x8580 #define GL_SOURCE1_RGB_ARB 0x8581 #define GL_SOURCE2_RGB_ARB 0x8582 #define GL_SOURCE0_ALPHA_ARB 0x8588 #define GL_SOURCE1_ALPHA_ARB 0x8589 #define GL_SOURCE2_ALPHA_ARB 0x858A #define GL_OPERAND0_RGB_ARB 0x8590 #define GL_OPERAND1_RGB_ARB 0x8591 #define GL_OPERAND2_RGB_ARB 0x8592 #define GL_OPERAND0_ALPHA_ARB 0x8598 #define GL_OPERAND1_ALPHA_ARB 0x8599 #define GL_OPERAND2_ALPHA_ARB 0x859A #define GL_RGB_SCALE_ARB 0x8573 #define GL_ADD_SIGNED_ARB 0x8574 #define GL_INTERPOLATE_ARB 0x8575 #define GL_SUBTRACT_ARB 0x84E7 #define GL_CONSTANT_ARB 0x8576 #define GL_PRIMARY_COLOR_ARB 0x8577 #define GL_PREVIOUS_ARB 0x8578 #endif /* GL_ARB_texture_env_combine */ #ifndef GL_ARB_texture_env_crossbar #define GL_ARB_texture_env_crossbar 1 #endif /* GL_ARB_texture_env_crossbar */ #ifndef GL_ARB_texture_env_dot3 #define GL_ARB_texture_env_dot3 1 #define GL_DOT3_RGB_ARB 0x86AE #define GL_DOT3_RGBA_ARB 0x86AF #endif /* GL_ARB_texture_env_dot3 */ #ifndef GL_ARB_texture_float #define GL_ARB_texture_float 1 #define GL_TEXTURE_RED_TYPE_ARB 0x8C10 #define GL_TEXTURE_GREEN_TYPE_ARB 0x8C11 #define GL_TEXTURE_BLUE_TYPE_ARB 0x8C12 #define GL_TEXTURE_ALPHA_TYPE_ARB 0x8C13 #define GL_TEXTURE_LUMINANCE_TYPE_ARB 0x8C14 #define GL_TEXTURE_INTENSITY_TYPE_ARB 0x8C15 #define GL_TEXTURE_DEPTH_TYPE_ARB 0x8C16 #define GL_UNSIGNED_NORMALIZED_ARB 0x8C17 #define GL_RGBA32F_ARB 0x8814 #define GL_RGB32F_ARB 0x8815 #define GL_ALPHA32F_ARB 0x8816 #define GL_INTENSITY32F_ARB 0x8817 #define GL_LUMINANCE32F_ARB 0x8818 #define GL_LUMINANCE_ALPHA32F_ARB 0x8819 #define GL_RGBA16F_ARB 0x881A #define GL_RGB16F_ARB 0x881B #define GL_ALPHA16F_ARB 0x881C #define GL_INTENSITY16F_ARB 0x881D #define GL_LUMINANCE16F_ARB 0x881E #define GL_LUMINANCE_ALPHA16F_ARB 0x881F #endif /* GL_ARB_texture_float */ #ifndef GL_ARB_texture_gather #define GL_ARB_texture_gather 1 #define GL_MIN_PROGRAM_TEXTURE_GATHER_OFFSET_ARB 0x8E5E #define GL_MAX_PROGRAM_TEXTURE_GATHER_OFFSET_ARB 0x8E5F #define GL_MAX_PROGRAM_TEXTURE_GATHER_COMPONENTS_ARB 0x8F9F #endif /* GL_ARB_texture_gather */ #ifndef GL_ARB_texture_mirror_clamp_to_edge #define GL_ARB_texture_mirror_clamp_to_edge 1 #endif /* GL_ARB_texture_mirror_clamp_to_edge */ #ifndef GL_ARB_texture_mirrored_repeat #define GL_ARB_texture_mirrored_repeat 1 #define GL_MIRRORED_REPEAT_ARB 0x8370 #endif /* GL_ARB_texture_mirrored_repeat */ #ifndef GL_ARB_texture_multisample #define GL_ARB_texture_multisample 1 #endif /* GL_ARB_texture_multisample */ #ifndef GL_ARB_texture_non_power_of_two #define GL_ARB_texture_non_power_of_two 1 #endif /* GL_ARB_texture_non_power_of_two */ #ifndef GL_ARB_texture_query_levels #define GL_ARB_texture_query_levels 1 #endif /* GL_ARB_texture_query_levels */ #ifndef GL_ARB_texture_query_lod #define GL_ARB_texture_query_lod 1 #endif /* GL_ARB_texture_query_lod */ #ifndef GL_ARB_texture_rectangle #define GL_ARB_texture_rectangle 1 #define GL_TEXTURE_RECTANGLE_ARB 0x84F5 #define GL_TEXTURE_BINDING_RECTANGLE_ARB 0x84F6 #define GL_PROXY_TEXTURE_RECTANGLE_ARB 0x84F7 #define GL_MAX_RECTANGLE_TEXTURE_SIZE_ARB 0x84F8 #endif /* GL_ARB_texture_rectangle */ #ifndef GL_ARB_texture_rg #define GL_ARB_texture_rg 1 #endif /* GL_ARB_texture_rg */ #ifndef GL_ARB_texture_rgb10_a2ui #define GL_ARB_texture_rgb10_a2ui 1 #endif /* GL_ARB_texture_rgb10_a2ui */ #ifndef GL_ARB_texture_stencil8 #define GL_ARB_texture_stencil8 1 #endif /* GL_ARB_texture_stencil8 */ #ifndef GL_ARB_texture_storage #define GL_ARB_texture_storage 1 #endif /* GL_ARB_texture_storage */ #ifndef GL_ARB_texture_storage_multisample #define GL_ARB_texture_storage_multisample 1 #endif /* GL_ARB_texture_storage_multisample */ #ifndef GL_ARB_texture_swizzle #define GL_ARB_texture_swizzle 1 #endif /* GL_ARB_texture_swizzle */ #ifndef GL_ARB_texture_view #define GL_ARB_texture_view 1 #endif /* GL_ARB_texture_view */ #ifndef GL_ARB_timer_query #define GL_ARB_timer_query 1 #endif /* GL_ARB_timer_query */ #ifndef GL_ARB_transform_feedback2 #define GL_ARB_transform_feedback2 1 #define GL_TRANSFORM_FEEDBACK_PAUSED 0x8E23 #define GL_TRANSFORM_FEEDBACK_ACTIVE 0x8E24 #endif /* GL_ARB_transform_feedback2 */ #ifndef GL_ARB_transform_feedback3 #define GL_ARB_transform_feedback3 1 #endif /* GL_ARB_transform_feedback3 */ #ifndef GL_ARB_transform_feedback_instanced #define GL_ARB_transform_feedback_instanced 1 #endif /* GL_ARB_transform_feedback_instanced */ #ifndef GL_ARB_transpose_matrix #define GL_ARB_transpose_matrix 1 #define GL_TRANSPOSE_MODELVIEW_MATRIX_ARB 0x84E3 #define GL_TRANSPOSE_PROJECTION_MATRIX_ARB 0x84E4 #define GL_TRANSPOSE_TEXTURE_MATRIX_ARB 0x84E5 #define GL_TRANSPOSE_COLOR_MATRIX_ARB 0x84E6 typedef void (APIENTRYP PFNGLLOADTRANSPOSEMATRIXFARBPROC) (const GLfloat *m); typedef void (APIENTRYP PFNGLLOADTRANSPOSEMATRIXDARBPROC) (const GLdouble *m); typedef void (APIENTRYP PFNGLMULTTRANSPOSEMATRIXFARBPROC) (const GLfloat *m); typedef void (APIENTRYP PFNGLMULTTRANSPOSEMATRIXDARBPROC) (const GLdouble *m); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glLoadTransposeMatrixfARB (const GLfloat *m); GLAPI void APIENTRY glLoadTransposeMatrixdARB (const GLdouble *m); GLAPI void APIENTRY glMultTransposeMatrixfARB (const GLfloat *m); GLAPI void APIENTRY glMultTransposeMatrixdARB (const GLdouble *m); #endif #endif /* GL_ARB_transpose_matrix */ #ifndef GL_ARB_uniform_buffer_object #define GL_ARB_uniform_buffer_object 1 #define GL_MAX_GEOMETRY_UNIFORM_BLOCKS 0x8A2C #define GL_MAX_COMBINED_GEOMETRY_UNIFORM_COMPONENTS 0x8A32 #define GL_UNIFORM_BLOCK_REFERENCED_BY_GEOMETRY_SHADER 0x8A45 #endif /* GL_ARB_uniform_buffer_object */ #ifndef GL_ARB_vertex_array_bgra #define GL_ARB_vertex_array_bgra 1 #endif /* GL_ARB_vertex_array_bgra */ #ifndef GL_ARB_vertex_array_object #define GL_ARB_vertex_array_object 1 #endif /* GL_ARB_vertex_array_object */ #ifndef GL_ARB_vertex_attrib_64bit #define GL_ARB_vertex_attrib_64bit 1 #endif /* GL_ARB_vertex_attrib_64bit */ #ifndef GL_ARB_vertex_attrib_binding #define GL_ARB_vertex_attrib_binding 1 #endif /* GL_ARB_vertex_attrib_binding */ #ifndef GL_ARB_vertex_blend #define GL_ARB_vertex_blend 1 #define GL_MAX_VERTEX_UNITS_ARB 0x86A4 #define GL_ACTIVE_VERTEX_UNITS_ARB 0x86A5 #define GL_WEIGHT_SUM_UNITY_ARB 0x86A6 #define GL_VERTEX_BLEND_ARB 0x86A7 #define GL_CURRENT_WEIGHT_ARB 0x86A8 #define GL_WEIGHT_ARRAY_TYPE_ARB 0x86A9 #define GL_WEIGHT_ARRAY_STRIDE_ARB 0x86AA #define GL_WEIGHT_ARRAY_SIZE_ARB 0x86AB #define GL_WEIGHT_ARRAY_POINTER_ARB 0x86AC #define GL_WEIGHT_ARRAY_ARB 0x86AD #define GL_MODELVIEW0_ARB 0x1700 #define GL_MODELVIEW1_ARB 0x850A #define GL_MODELVIEW2_ARB 0x8722 #define GL_MODELVIEW3_ARB 0x8723 #define GL_MODELVIEW4_ARB 0x8724 #define GL_MODELVIEW5_ARB 0x8725 #define GL_MODELVIEW6_ARB 0x8726 #define GL_MODELVIEW7_ARB 0x8727 #define GL_MODELVIEW8_ARB 0x8728 #define GL_MODELVIEW9_ARB 0x8729 #define GL_MODELVIEW10_ARB 0x872A #define GL_MODELVIEW11_ARB 0x872B #define GL_MODELVIEW12_ARB 0x872C #define GL_MODELVIEW13_ARB 0x872D #define GL_MODELVIEW14_ARB 0x872E #define GL_MODELVIEW15_ARB 0x872F #define GL_MODELVIEW16_ARB 0x8730 #define GL_MODELVIEW17_ARB 0x8731 #define GL_MODELVIEW18_ARB 0x8732 #define GL_MODELVIEW19_ARB 0x8733 #define GL_MODELVIEW20_ARB 0x8734 #define GL_MODELVIEW21_ARB 0x8735 #define GL_MODELVIEW22_ARB 0x8736 #define GL_MODELVIEW23_ARB 0x8737 #define GL_MODELVIEW24_ARB 0x8738 #define GL_MODELVIEW25_ARB 0x8739 #define GL_MODELVIEW26_ARB 0x873A #define GL_MODELVIEW27_ARB 0x873B #define GL_MODELVIEW28_ARB 0x873C #define GL_MODELVIEW29_ARB 0x873D #define GL_MODELVIEW30_ARB 0x873E #define GL_MODELVIEW31_ARB 0x873F typedef void (APIENTRYP PFNGLWEIGHTBVARBPROC) (GLint size, const GLbyte *weights); typedef void (APIENTRYP PFNGLWEIGHTSVARBPROC) (GLint size, const GLshort *weights); typedef void (APIENTRYP PFNGLWEIGHTIVARBPROC) (GLint size, const GLint *weights); typedef void (APIENTRYP PFNGLWEIGHTFVARBPROC) (GLint size, const GLfloat *weights); typedef void (APIENTRYP PFNGLWEIGHTDVARBPROC) (GLint size, const GLdouble *weights); typedef void (APIENTRYP PFNGLWEIGHTUBVARBPROC) (GLint size, const GLubyte *weights); typedef void (APIENTRYP PFNGLWEIGHTUSVARBPROC) (GLint size, const GLushort *weights); typedef void (APIENTRYP PFNGLWEIGHTUIVARBPROC) (GLint size, const GLuint *weights); typedef void (APIENTRYP PFNGLWEIGHTPOINTERARBPROC) (GLint size, GLenum type, GLsizei stride, const void *pointer); typedef void (APIENTRYP PFNGLVERTEXBLENDARBPROC) (GLint count); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glWeightbvARB (GLint size, const GLbyte *weights); GLAPI void APIENTRY glWeightsvARB (GLint size, const GLshort *weights); GLAPI void APIENTRY glWeightivARB (GLint size, const GLint *weights); GLAPI void APIENTRY glWeightfvARB (GLint size, const GLfloat *weights); GLAPI void APIENTRY glWeightdvARB (GLint size, const GLdouble *weights); GLAPI void APIENTRY glWeightubvARB (GLint size, const GLubyte *weights); GLAPI void APIENTRY glWeightusvARB (GLint size, const GLushort *weights); GLAPI void APIENTRY glWeightuivARB (GLint size, const GLuint *weights); GLAPI void APIENTRY glWeightPointerARB (GLint size, GLenum type, GLsizei stride, const void *pointer); GLAPI void APIENTRY glVertexBlendARB (GLint count); #endif #endif /* GL_ARB_vertex_blend */ #ifndef GL_ARB_vertex_buffer_object #define GL_ARB_vertex_buffer_object 1 typedef ptrdiff_t GLsizeiptrARB; typedef ptrdiff_t GLintptrARB; #define GL_BUFFER_SIZE_ARB 0x8764 #define GL_BUFFER_USAGE_ARB 0x8765 #define GL_ARRAY_BUFFER_ARB 0x8892 #define GL_ELEMENT_ARRAY_BUFFER_ARB 0x8893 #define GL_ARRAY_BUFFER_BINDING_ARB 0x8894 #define GL_ELEMENT_ARRAY_BUFFER_BINDING_ARB 0x8895 #define GL_VERTEX_ARRAY_BUFFER_BINDING_ARB 0x8896 #define GL_NORMAL_ARRAY_BUFFER_BINDING_ARB 0x8897 #define GL_COLOR_ARRAY_BUFFER_BINDING_ARB 0x8898 #define GL_INDEX_ARRAY_BUFFER_BINDING_ARB 0x8899 #define GL_TEXTURE_COORD_ARRAY_BUFFER_BINDING_ARB 0x889A #define GL_EDGE_FLAG_ARRAY_BUFFER_BINDING_ARB 0x889B #define GL_SECONDARY_COLOR_ARRAY_BUFFER_BINDING_ARB 0x889C #define GL_FOG_COORDINATE_ARRAY_BUFFER_BINDING_ARB 0x889D #define GL_WEIGHT_ARRAY_BUFFER_BINDING_ARB 0x889E #define GL_VERTEX_ATTRIB_ARRAY_BUFFER_BINDING_ARB 0x889F #define GL_READ_ONLY_ARB 0x88B8 #define GL_WRITE_ONLY_ARB 0x88B9 #define GL_READ_WRITE_ARB 0x88BA #define GL_BUFFER_ACCESS_ARB 0x88BB #define GL_BUFFER_MAPPED_ARB 0x88BC #define GL_BUFFER_MAP_POINTER_ARB 0x88BD #define GL_STREAM_DRAW_ARB 0x88E0 #define GL_STREAM_READ_ARB 0x88E1 #define GL_STREAM_COPY_ARB 0x88E2 #define GL_STATIC_DRAW_ARB 0x88E4 #define GL_STATIC_READ_ARB 0x88E5 #define GL_STATIC_COPY_ARB 0x88E6 #define GL_DYNAMIC_DRAW_ARB 0x88E8 #define GL_DYNAMIC_READ_ARB 0x88E9 #define GL_DYNAMIC_COPY_ARB 0x88EA typedef void (APIENTRYP PFNGLBINDBUFFERARBPROC) (GLenum target, GLuint buffer); typedef void (APIENTRYP PFNGLDELETEBUFFERSARBPROC) (GLsizei n, const GLuint *buffers); typedef void (APIENTRYP PFNGLGENBUFFERSARBPROC) (GLsizei n, GLuint *buffers); typedef GLboolean (APIENTRYP PFNGLISBUFFERARBPROC) (GLuint buffer); typedef void (APIENTRYP PFNGLBUFFERDATAARBPROC) (GLenum target, GLsizeiptrARB size, const void *data, GLenum usage); typedef void (APIENTRYP PFNGLBUFFERSUBDATAARBPROC) (GLenum target, GLintptrARB offset, GLsizeiptrARB size, const void *data); typedef void (APIENTRYP PFNGLGETBUFFERSUBDATAARBPROC) (GLenum target, GLintptrARB offset, GLsizeiptrARB size, void *data); typedef void *(APIENTRYP PFNGLMAPBUFFERARBPROC) (GLenum target, GLenum access); typedef GLboolean (APIENTRYP PFNGLUNMAPBUFFERARBPROC) (GLenum target); typedef void (APIENTRYP PFNGLGETBUFFERPARAMETERIVARBPROC) (GLenum target, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGETBUFFERPOINTERVARBPROC) (GLenum target, GLenum pname, void **params); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glBindBufferARB (GLenum target, GLuint buffer); GLAPI void APIENTRY glDeleteBuffersARB (GLsizei n, const GLuint *buffers); GLAPI void APIENTRY glGenBuffersARB (GLsizei n, GLuint *buffers); GLAPI GLboolean APIENTRY glIsBufferARB (GLuint buffer); GLAPI void APIENTRY glBufferDataARB (GLenum target, GLsizeiptrARB size, const void *data, GLenum usage); GLAPI void APIENTRY glBufferSubDataARB (GLenum target, GLintptrARB offset, GLsizeiptrARB size, const void *data); GLAPI void APIENTRY glGetBufferSubDataARB (GLenum target, GLintptrARB offset, GLsizeiptrARB size, void *data); GLAPI void *APIENTRY glMapBufferARB (GLenum target, GLenum access); GLAPI GLboolean APIENTRY glUnmapBufferARB (GLenum target); GLAPI void APIENTRY glGetBufferParameterivARB (GLenum target, GLenum pname, GLint *params); GLAPI void APIENTRY glGetBufferPointervARB (GLenum target, GLenum pname, void **params); #endif #endif /* GL_ARB_vertex_buffer_object */ #ifndef GL_ARB_vertex_program #define GL_ARB_vertex_program 1 #define GL_COLOR_SUM_ARB 0x8458 #define GL_VERTEX_PROGRAM_ARB 0x8620 #define GL_VERTEX_ATTRIB_ARRAY_ENABLED_ARB 0x8622 #define GL_VERTEX_ATTRIB_ARRAY_SIZE_ARB 0x8623 #define GL_VERTEX_ATTRIB_ARRAY_STRIDE_ARB 0x8624 #define GL_VERTEX_ATTRIB_ARRAY_TYPE_ARB 0x8625 #define GL_CURRENT_VERTEX_ATTRIB_ARB 0x8626 #define GL_VERTEX_PROGRAM_POINT_SIZE_ARB 0x8642 #define GL_VERTEX_PROGRAM_TWO_SIDE_ARB 0x8643 #define GL_VERTEX_ATTRIB_ARRAY_POINTER_ARB 0x8645 #define GL_MAX_VERTEX_ATTRIBS_ARB 0x8869 #define GL_VERTEX_ATTRIB_ARRAY_NORMALIZED_ARB 0x886A #define GL_PROGRAM_ADDRESS_REGISTERS_ARB 0x88B0 #define GL_MAX_PROGRAM_ADDRESS_REGISTERS_ARB 0x88B1 #define GL_PROGRAM_NATIVE_ADDRESS_REGISTERS_ARB 0x88B2 #define GL_MAX_PROGRAM_NATIVE_ADDRESS_REGISTERS_ARB 0x88B3 typedef void (APIENTRYP PFNGLVERTEXATTRIB1DARBPROC) (GLuint index, GLdouble x); typedef void (APIENTRYP PFNGLVERTEXATTRIB1DVARBPROC) (GLuint index, const GLdouble *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB1FARBPROC) (GLuint index, GLfloat x); typedef void (APIENTRYP PFNGLVERTEXATTRIB1FVARBPROC) (GLuint index, const GLfloat *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB1SARBPROC) (GLuint index, GLshort x); typedef void (APIENTRYP PFNGLVERTEXATTRIB1SVARBPROC) (GLuint index, const GLshort *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB2DARBPROC) (GLuint index, GLdouble x, GLdouble y); typedef void (APIENTRYP PFNGLVERTEXATTRIB2DVARBPROC) (GLuint index, const GLdouble *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB2FARBPROC) (GLuint index, GLfloat x, GLfloat y); typedef void (APIENTRYP PFNGLVERTEXATTRIB2FVARBPROC) (GLuint index, const GLfloat *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB2SARBPROC) (GLuint index, GLshort x, GLshort y); typedef void (APIENTRYP PFNGLVERTEXATTRIB2SVARBPROC) (GLuint index, const GLshort *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB3DARBPROC) (GLuint index, GLdouble x, GLdouble y, GLdouble z); typedef void (APIENTRYP PFNGLVERTEXATTRIB3DVARBPROC) (GLuint index, const GLdouble *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB3FARBPROC) (GLuint index, GLfloat x, GLfloat y, GLfloat z); typedef void (APIENTRYP PFNGLVERTEXATTRIB3FVARBPROC) (GLuint index, const GLfloat *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB3SARBPROC) (GLuint index, GLshort x, GLshort y, GLshort z); typedef void (APIENTRYP PFNGLVERTEXATTRIB3SVARBPROC) (GLuint index, const GLshort *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB4NBVARBPROC) (GLuint index, const GLbyte *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB4NIVARBPROC) (GLuint index, const GLint *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB4NSVARBPROC) (GLuint index, const GLshort *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB4NUBARBPROC) (GLuint index, GLubyte x, GLubyte y, GLubyte z, GLubyte w); typedef void (APIENTRYP PFNGLVERTEXATTRIB4NUBVARBPROC) (GLuint index, const GLubyte *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB4NUIVARBPROC) (GLuint index, const GLuint *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB4NUSVARBPROC) (GLuint index, const GLushort *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB4BVARBPROC) (GLuint index, const GLbyte *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB4DARBPROC) (GLuint index, GLdouble x, GLdouble y, GLdouble z, GLdouble w); typedef void (APIENTRYP PFNGLVERTEXATTRIB4DVARBPROC) (GLuint index, const GLdouble *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB4FARBPROC) (GLuint index, GLfloat x, GLfloat y, GLfloat z, GLfloat w); typedef void (APIENTRYP PFNGLVERTEXATTRIB4FVARBPROC) (GLuint index, const GLfloat *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB4IVARBPROC) (GLuint index, const GLint *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB4SARBPROC) (GLuint index, GLshort x, GLshort y, GLshort z, GLshort w); typedef void (APIENTRYP PFNGLVERTEXATTRIB4SVARBPROC) (GLuint index, const GLshort *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB4UBVARBPROC) (GLuint index, const GLubyte *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB4UIVARBPROC) (GLuint index, const GLuint *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB4USVARBPROC) (GLuint index, const GLushort *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBPOINTERARBPROC) (GLuint index, GLint size, GLenum type, GLboolean normalized, GLsizei stride, const void *pointer); typedef void (APIENTRYP PFNGLENABLEVERTEXATTRIBARRAYARBPROC) (GLuint index); typedef void (APIENTRYP PFNGLDISABLEVERTEXATTRIBARRAYARBPROC) (GLuint index); typedef void (APIENTRYP PFNGLGETVERTEXATTRIBDVARBPROC) (GLuint index, GLenum pname, GLdouble *params); typedef void (APIENTRYP PFNGLGETVERTEXATTRIBFVARBPROC) (GLuint index, GLenum pname, GLfloat *params); typedef void (APIENTRYP PFNGLGETVERTEXATTRIBIVARBPROC) (GLuint index, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGETVERTEXATTRIBPOINTERVARBPROC) (GLuint index, GLenum pname, void **pointer); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glVertexAttrib1dARB (GLuint index, GLdouble x); GLAPI void APIENTRY glVertexAttrib1dvARB (GLuint index, const GLdouble *v); GLAPI void APIENTRY glVertexAttrib1fARB (GLuint index, GLfloat x); GLAPI void APIENTRY glVertexAttrib1fvARB (GLuint index, const GLfloat *v); GLAPI void APIENTRY glVertexAttrib1sARB (GLuint index, GLshort x); GLAPI void APIENTRY glVertexAttrib1svARB (GLuint index, const GLshort *v); GLAPI void APIENTRY glVertexAttrib2dARB (GLuint index, GLdouble x, GLdouble y); GLAPI void APIENTRY glVertexAttrib2dvARB (GLuint index, const GLdouble *v); GLAPI void APIENTRY glVertexAttrib2fARB (GLuint index, GLfloat x, GLfloat y); GLAPI void APIENTRY glVertexAttrib2fvARB (GLuint index, const GLfloat *v); GLAPI void APIENTRY glVertexAttrib2sARB (GLuint index, GLshort x, GLshort y); GLAPI void APIENTRY glVertexAttrib2svARB (GLuint index, const GLshort *v); GLAPI void APIENTRY glVertexAttrib3dARB (GLuint index, GLdouble x, GLdouble y, GLdouble z); GLAPI void APIENTRY glVertexAttrib3dvARB (GLuint index, const GLdouble *v); GLAPI void APIENTRY glVertexAttrib3fARB (GLuint index, GLfloat x, GLfloat y, GLfloat z); GLAPI void APIENTRY glVertexAttrib3fvARB (GLuint index, const GLfloat *v); GLAPI void APIENTRY glVertexAttrib3sARB (GLuint index, GLshort x, GLshort y, GLshort z); GLAPI void APIENTRY glVertexAttrib3svARB (GLuint index, const GLshort *v); GLAPI void APIENTRY glVertexAttrib4NbvARB (GLuint index, const GLbyte *v); GLAPI void APIENTRY glVertexAttrib4NivARB (GLuint index, const GLint *v); GLAPI void APIENTRY glVertexAttrib4NsvARB (GLuint index, const GLshort *v); GLAPI void APIENTRY glVertexAttrib4NubARB (GLuint index, GLubyte x, GLubyte y, GLubyte z, GLubyte w); GLAPI void APIENTRY glVertexAttrib4NubvARB (GLuint index, const GLubyte *v); GLAPI void APIENTRY glVertexAttrib4NuivARB (GLuint index, const GLuint *v); GLAPI void APIENTRY glVertexAttrib4NusvARB (GLuint index, const GLushort *v); GLAPI void APIENTRY glVertexAttrib4bvARB (GLuint index, const GLbyte *v); GLAPI void APIENTRY glVertexAttrib4dARB (GLuint index, GLdouble x, GLdouble y, GLdouble z, GLdouble w); GLAPI void APIENTRY glVertexAttrib4dvARB (GLuint index, const GLdouble *v); GLAPI void APIENTRY glVertexAttrib4fARB (GLuint index, GLfloat x, GLfloat y, GLfloat z, GLfloat w); GLAPI void APIENTRY glVertexAttrib4fvARB (GLuint index, const GLfloat *v); GLAPI void APIENTRY glVertexAttrib4ivARB (GLuint index, const GLint *v); GLAPI void APIENTRY glVertexAttrib4sARB (GLuint index, GLshort x, GLshort y, GLshort z, GLshort w); GLAPI void APIENTRY glVertexAttrib4svARB (GLuint index, const GLshort *v); GLAPI void APIENTRY glVertexAttrib4ubvARB (GLuint index, const GLubyte *v); GLAPI void APIENTRY glVertexAttrib4uivARB (GLuint index, const GLuint *v); GLAPI void APIENTRY glVertexAttrib4usvARB (GLuint index, const GLushort *v); GLAPI void APIENTRY glVertexAttribPointerARB (GLuint index, GLint size, GLenum type, GLboolean normalized, GLsizei stride, const void *pointer); GLAPI void APIENTRY glEnableVertexAttribArrayARB (GLuint index); GLAPI void APIENTRY glDisableVertexAttribArrayARB (GLuint index); GLAPI void APIENTRY glGetVertexAttribdvARB (GLuint index, GLenum pname, GLdouble *params); GLAPI void APIENTRY glGetVertexAttribfvARB (GLuint index, GLenum pname, GLfloat *params); GLAPI void APIENTRY glGetVertexAttribivARB (GLuint index, GLenum pname, GLint *params); GLAPI void APIENTRY glGetVertexAttribPointervARB (GLuint index, GLenum pname, void **pointer); #endif #endif /* GL_ARB_vertex_program */ #ifndef GL_ARB_vertex_shader #define GL_ARB_vertex_shader 1 #define GL_VERTEX_SHADER_ARB 0x8B31 #define GL_MAX_VERTEX_UNIFORM_COMPONENTS_ARB 0x8B4A #define GL_MAX_VARYING_FLOATS_ARB 0x8B4B #define GL_MAX_VERTEX_TEXTURE_IMAGE_UNITS_ARB 0x8B4C #define GL_MAX_COMBINED_TEXTURE_IMAGE_UNITS_ARB 0x8B4D #define GL_OBJECT_ACTIVE_ATTRIBUTES_ARB 0x8B89 #define GL_OBJECT_ACTIVE_ATTRIBUTE_MAX_LENGTH_ARB 0x8B8A typedef void (APIENTRYP PFNGLBINDATTRIBLOCATIONARBPROC) (GLhandleARB programObj, GLuint index, const GLcharARB *name); typedef void (APIENTRYP PFNGLGETACTIVEATTRIBARBPROC) (GLhandleARB programObj, GLuint index, GLsizei maxLength, GLsizei *length, GLint *size, GLenum *type, GLcharARB *name); typedef GLint (APIENTRYP PFNGLGETATTRIBLOCATIONARBPROC) (GLhandleARB programObj, const GLcharARB *name); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glBindAttribLocationARB (GLhandleARB programObj, GLuint index, const GLcharARB *name); GLAPI void APIENTRY glGetActiveAttribARB (GLhandleARB programObj, GLuint index, GLsizei maxLength, GLsizei *length, GLint *size, GLenum *type, GLcharARB *name); GLAPI GLint APIENTRY glGetAttribLocationARB (GLhandleARB programObj, const GLcharARB *name); #endif #endif /* GL_ARB_vertex_shader */ #ifndef GL_ARB_vertex_type_10f_11f_11f_rev #define GL_ARB_vertex_type_10f_11f_11f_rev 1 #endif /* GL_ARB_vertex_type_10f_11f_11f_rev */ #ifndef GL_ARB_vertex_type_2_10_10_10_rev #define GL_ARB_vertex_type_2_10_10_10_rev 1 #endif /* GL_ARB_vertex_type_2_10_10_10_rev */ #ifndef GL_ARB_viewport_array #define GL_ARB_viewport_array 1 #endif /* GL_ARB_viewport_array */ #ifndef GL_ARB_window_pos #define GL_ARB_window_pos 1 typedef void (APIENTRYP PFNGLWINDOWPOS2DARBPROC) (GLdouble x, GLdouble y); typedef void (APIENTRYP PFNGLWINDOWPOS2DVARBPROC) (const GLdouble *v); typedef void (APIENTRYP PFNGLWINDOWPOS2FARBPROC) (GLfloat x, GLfloat y); typedef void (APIENTRYP PFNGLWINDOWPOS2FVARBPROC) (const GLfloat *v); typedef void (APIENTRYP PFNGLWINDOWPOS2IARBPROC) (GLint x, GLint y); typedef void (APIENTRYP PFNGLWINDOWPOS2IVARBPROC) (const GLint *v); typedef void (APIENTRYP PFNGLWINDOWPOS2SARBPROC) (GLshort x, GLshort y); typedef void (APIENTRYP PFNGLWINDOWPOS2SVARBPROC) (const GLshort *v); typedef void (APIENTRYP PFNGLWINDOWPOS3DARBPROC) (GLdouble x, GLdouble y, GLdouble z); typedef void (APIENTRYP PFNGLWINDOWPOS3DVARBPROC) (const GLdouble *v); typedef void (APIENTRYP PFNGLWINDOWPOS3FARBPROC) (GLfloat x, GLfloat y, GLfloat z); typedef void (APIENTRYP PFNGLWINDOWPOS3FVARBPROC) (const GLfloat *v); typedef void (APIENTRYP PFNGLWINDOWPOS3IARBPROC) (GLint x, GLint y, GLint z); typedef void (APIENTRYP PFNGLWINDOWPOS3IVARBPROC) (const GLint *v); typedef void (APIENTRYP PFNGLWINDOWPOS3SARBPROC) (GLshort x, GLshort y, GLshort z); typedef void (APIENTRYP PFNGLWINDOWPOS3SVARBPROC) (const GLshort *v); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glWindowPos2dARB (GLdouble x, GLdouble y); GLAPI void APIENTRY glWindowPos2dvARB (const GLdouble *v); GLAPI void APIENTRY glWindowPos2fARB (GLfloat x, GLfloat y); GLAPI void APIENTRY glWindowPos2fvARB (const GLfloat *v); GLAPI void APIENTRY glWindowPos2iARB (GLint x, GLint y); GLAPI void APIENTRY glWindowPos2ivARB (const GLint *v); GLAPI void APIENTRY glWindowPos2sARB (GLshort x, GLshort y); GLAPI void APIENTRY glWindowPos2svARB (const GLshort *v); GLAPI void APIENTRY glWindowPos3dARB (GLdouble x, GLdouble y, GLdouble z); GLAPI void APIENTRY glWindowPos3dvARB (const GLdouble *v); GLAPI void APIENTRY glWindowPos3fARB (GLfloat x, GLfloat y, GLfloat z); GLAPI void APIENTRY glWindowPos3fvARB (const GLfloat *v); GLAPI void APIENTRY glWindowPos3iARB (GLint x, GLint y, GLint z); GLAPI void APIENTRY glWindowPos3ivARB (const GLint *v); GLAPI void APIENTRY glWindowPos3sARB (GLshort x, GLshort y, GLshort z); GLAPI void APIENTRY glWindowPos3svARB (const GLshort *v); #endif #endif /* GL_ARB_window_pos */ #ifndef GL_KHR_debug #define GL_KHR_debug 1 #endif /* GL_KHR_debug */ #ifndef GL_KHR_texture_compression_astc_hdr #define GL_KHR_texture_compression_astc_hdr 1 #define GL_COMPRESSED_RGBA_ASTC_4x4_KHR 0x93B0 #define GL_COMPRESSED_RGBA_ASTC_5x4_KHR 0x93B1 #define GL_COMPRESSED_RGBA_ASTC_5x5_KHR 0x93B2 #define GL_COMPRESSED_RGBA_ASTC_6x5_KHR 0x93B3 #define GL_COMPRESSED_RGBA_ASTC_6x6_KHR 0x93B4 #define GL_COMPRESSED_RGBA_ASTC_8x5_KHR 0x93B5 #define GL_COMPRESSED_RGBA_ASTC_8x6_KHR 0x93B6 #define GL_COMPRESSED_RGBA_ASTC_8x8_KHR 0x93B7 #define GL_COMPRESSED_RGBA_ASTC_10x5_KHR 0x93B8 #define GL_COMPRESSED_RGBA_ASTC_10x6_KHR 0x93B9 #define GL_COMPRESSED_RGBA_ASTC_10x8_KHR 0x93BA #define GL_COMPRESSED_RGBA_ASTC_10x10_KHR 0x93BB #define GL_COMPRESSED_RGBA_ASTC_12x10_KHR 0x93BC #define GL_COMPRESSED_RGBA_ASTC_12x12_KHR 0x93BD #define GL_COMPRESSED_SRGB8_ALPHA8_ASTC_4x4_KHR 0x93D0 #define GL_COMPRESSED_SRGB8_ALPHA8_ASTC_5x4_KHR 0x93D1 #define GL_COMPRESSED_SRGB8_ALPHA8_ASTC_5x5_KHR 0x93D2 #define GL_COMPRESSED_SRGB8_ALPHA8_ASTC_6x5_KHR 0x93D3 #define GL_COMPRESSED_SRGB8_ALPHA8_ASTC_6x6_KHR 0x93D4 #define GL_COMPRESSED_SRGB8_ALPHA8_ASTC_8x5_KHR 0x93D5 #define GL_COMPRESSED_SRGB8_ALPHA8_ASTC_8x6_KHR 0x93D6 #define GL_COMPRESSED_SRGB8_ALPHA8_ASTC_8x8_KHR 0x93D7 #define GL_COMPRESSED_SRGB8_ALPHA8_ASTC_10x5_KHR 0x93D8 #define GL_COMPRESSED_SRGB8_ALPHA8_ASTC_10x6_KHR 0x93D9 #define GL_COMPRESSED_SRGB8_ALPHA8_ASTC_10x8_KHR 0x93DA #define GL_COMPRESSED_SRGB8_ALPHA8_ASTC_10x10_KHR 0x93DB #define GL_COMPRESSED_SRGB8_ALPHA8_ASTC_12x10_KHR 0x93DC #define GL_COMPRESSED_SRGB8_ALPHA8_ASTC_12x12_KHR 0x93DD #endif /* GL_KHR_texture_compression_astc_hdr */ #ifndef GL_KHR_texture_compression_astc_ldr #define GL_KHR_texture_compression_astc_ldr 1 #endif /* GL_KHR_texture_compression_astc_ldr */ #ifndef GL_OES_byte_coordinates #define GL_OES_byte_coordinates 1 typedef void (APIENTRYP PFNGLMULTITEXCOORD1BOESPROC) (GLenum texture, GLbyte s); typedef void (APIENTRYP PFNGLMULTITEXCOORD1BVOESPROC) (GLenum texture, const GLbyte *coords); typedef void (APIENTRYP PFNGLMULTITEXCOORD2BOESPROC) (GLenum texture, GLbyte s, GLbyte t); typedef void (APIENTRYP PFNGLMULTITEXCOORD2BVOESPROC) (GLenum texture, const GLbyte *coords); typedef void (APIENTRYP PFNGLMULTITEXCOORD3BOESPROC) (GLenum texture, GLbyte s, GLbyte t, GLbyte r); typedef void (APIENTRYP PFNGLMULTITEXCOORD3BVOESPROC) (GLenum texture, const GLbyte *coords); typedef void (APIENTRYP PFNGLMULTITEXCOORD4BOESPROC) (GLenum texture, GLbyte s, GLbyte t, GLbyte r, GLbyte q); typedef void (APIENTRYP PFNGLMULTITEXCOORD4BVOESPROC) (GLenum texture, const GLbyte *coords); typedef void (APIENTRYP PFNGLTEXCOORD1BOESPROC) (GLbyte s); typedef void (APIENTRYP PFNGLTEXCOORD1BVOESPROC) (const GLbyte *coords); typedef void (APIENTRYP PFNGLTEXCOORD2BOESPROC) (GLbyte s, GLbyte t); typedef void (APIENTRYP PFNGLTEXCOORD2BVOESPROC) (const GLbyte *coords); typedef void (APIENTRYP PFNGLTEXCOORD3BOESPROC) (GLbyte s, GLbyte t, GLbyte r); typedef void (APIENTRYP PFNGLTEXCOORD3BVOESPROC) (const GLbyte *coords); typedef void (APIENTRYP PFNGLTEXCOORD4BOESPROC) (GLbyte s, GLbyte t, GLbyte r, GLbyte q); typedef void (APIENTRYP PFNGLTEXCOORD4BVOESPROC) (const GLbyte *coords); typedef void (APIENTRYP PFNGLVERTEX2BOESPROC) (GLbyte x); typedef void (APIENTRYP PFNGLVERTEX2BVOESPROC) (const GLbyte *coords); typedef void (APIENTRYP PFNGLVERTEX3BOESPROC) (GLbyte x, GLbyte y); typedef void (APIENTRYP PFNGLVERTEX3BVOESPROC) (const GLbyte *coords); typedef void (APIENTRYP PFNGLVERTEX4BOESPROC) (GLbyte x, GLbyte y, GLbyte z); typedef void (APIENTRYP PFNGLVERTEX4BVOESPROC) (const GLbyte *coords); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glMultiTexCoord1bOES (GLenum texture, GLbyte s); GLAPI void APIENTRY glMultiTexCoord1bvOES (GLenum texture, const GLbyte *coords); GLAPI void APIENTRY glMultiTexCoord2bOES (GLenum texture, GLbyte s, GLbyte t); GLAPI void APIENTRY glMultiTexCoord2bvOES (GLenum texture, const GLbyte *coords); GLAPI void APIENTRY glMultiTexCoord3bOES (GLenum texture, GLbyte s, GLbyte t, GLbyte r); GLAPI void APIENTRY glMultiTexCoord3bvOES (GLenum texture, const GLbyte *coords); GLAPI void APIENTRY glMultiTexCoord4bOES (GLenum texture, GLbyte s, GLbyte t, GLbyte r, GLbyte q); GLAPI void APIENTRY glMultiTexCoord4bvOES (GLenum texture, const GLbyte *coords); GLAPI void APIENTRY glTexCoord1bOES (GLbyte s); GLAPI void APIENTRY glTexCoord1bvOES (const GLbyte *coords); GLAPI void APIENTRY glTexCoord2bOES (GLbyte s, GLbyte t); GLAPI void APIENTRY glTexCoord2bvOES (const GLbyte *coords); GLAPI void APIENTRY glTexCoord3bOES (GLbyte s, GLbyte t, GLbyte r); GLAPI void APIENTRY glTexCoord3bvOES (const GLbyte *coords); GLAPI void APIENTRY glTexCoord4bOES (GLbyte s, GLbyte t, GLbyte r, GLbyte q); GLAPI void APIENTRY glTexCoord4bvOES (const GLbyte *coords); GLAPI void APIENTRY glVertex2bOES (GLbyte x); GLAPI void APIENTRY glVertex2bvOES (const GLbyte *coords); GLAPI void APIENTRY glVertex3bOES (GLbyte x, GLbyte y); GLAPI void APIENTRY glVertex3bvOES (const GLbyte *coords); GLAPI void APIENTRY glVertex4bOES (GLbyte x, GLbyte y, GLbyte z); GLAPI void APIENTRY glVertex4bvOES (const GLbyte *coords); #endif #endif /* GL_OES_byte_coordinates */ #ifndef GL_OES_compressed_paletted_texture #define GL_OES_compressed_paletted_texture 1 #define GL_PALETTE4_RGB8_OES 0x8B90 #define GL_PALETTE4_RGBA8_OES 0x8B91 #define GL_PALETTE4_R5_G6_B5_OES 0x8B92 #define GL_PALETTE4_RGBA4_OES 0x8B93 #define GL_PALETTE4_RGB5_A1_OES 0x8B94 #define GL_PALETTE8_RGB8_OES 0x8B95 #define GL_PALETTE8_RGBA8_OES 0x8B96 #define GL_PALETTE8_R5_G6_B5_OES 0x8B97 #define GL_PALETTE8_RGBA4_OES 0x8B98 #define GL_PALETTE8_RGB5_A1_OES 0x8B99 #endif /* GL_OES_compressed_paletted_texture */ #ifndef GL_OES_fixed_point #define GL_OES_fixed_point 1 typedef GLint GLfixed; #define GL_FIXED_OES 0x140C typedef void (APIENTRYP PFNGLALPHAFUNCXOESPROC) (GLenum func, GLfixed ref); typedef void (APIENTRYP PFNGLCLEARCOLORXOESPROC) (GLfixed red, GLfixed green, GLfixed blue, GLfixed alpha); typedef void (APIENTRYP PFNGLCLEARDEPTHXOESPROC) (GLfixed depth); typedef void (APIENTRYP PFNGLCLIPPLANEXOESPROC) (GLenum plane, const GLfixed *equation); typedef void (APIENTRYP PFNGLCOLOR4XOESPROC) (GLfixed red, GLfixed green, GLfixed blue, GLfixed alpha); typedef void (APIENTRYP PFNGLDEPTHRANGEXOESPROC) (GLfixed n, GLfixed f); typedef void (APIENTRYP PFNGLFOGXOESPROC) (GLenum pname, GLfixed param); typedef void (APIENTRYP PFNGLFOGXVOESPROC) (GLenum pname, const GLfixed *param); typedef void (APIENTRYP PFNGLFRUSTUMXOESPROC) (GLfixed l, GLfixed r, GLfixed b, GLfixed t, GLfixed n, GLfixed f); typedef void (APIENTRYP PFNGLGETCLIPPLANEXOESPROC) (GLenum plane, GLfixed *equation); typedef void (APIENTRYP PFNGLGETFIXEDVOESPROC) (GLenum pname, GLfixed *params); typedef void (APIENTRYP PFNGLGETTEXENVXVOESPROC) (GLenum target, GLenum pname, GLfixed *params); typedef void (APIENTRYP PFNGLGETTEXPARAMETERXVOESPROC) (GLenum target, GLenum pname, GLfixed *params); typedef void (APIENTRYP PFNGLLIGHTMODELXOESPROC) (GLenum pname, GLfixed param); typedef void (APIENTRYP PFNGLLIGHTMODELXVOESPROC) (GLenum pname, const GLfixed *param); typedef void (APIENTRYP PFNGLLIGHTXOESPROC) (GLenum light, GLenum pname, GLfixed param); typedef void (APIENTRYP PFNGLLIGHTXVOESPROC) (GLenum light, GLenum pname, const GLfixed *params); typedef void (APIENTRYP PFNGLLINEWIDTHXOESPROC) (GLfixed width); typedef void (APIENTRYP PFNGLLOADMATRIXXOESPROC) (const GLfixed *m); typedef void (APIENTRYP PFNGLMATERIALXOESPROC) (GLenum face, GLenum pname, GLfixed param); typedef void (APIENTRYP PFNGLMATERIALXVOESPROC) (GLenum face, GLenum pname, const GLfixed *param); typedef void (APIENTRYP PFNGLMULTMATRIXXOESPROC) (const GLfixed *m); typedef void (APIENTRYP PFNGLMULTITEXCOORD4XOESPROC) (GLenum texture, GLfixed s, GLfixed t, GLfixed r, GLfixed q); typedef void (APIENTRYP PFNGLNORMAL3XOESPROC) (GLfixed nx, GLfixed ny, GLfixed nz); typedef void (APIENTRYP PFNGLORTHOXOESPROC) (GLfixed l, GLfixed r, GLfixed b, GLfixed t, GLfixed n, GLfixed f); typedef void (APIENTRYP PFNGLPOINTPARAMETERXVOESPROC) (GLenum pname, const GLfixed *params); typedef void (APIENTRYP PFNGLPOINTSIZEXOESPROC) (GLfixed size); typedef void (APIENTRYP PFNGLPOLYGONOFFSETXOESPROC) (GLfixed factor, GLfixed units); typedef void (APIENTRYP PFNGLROTATEXOESPROC) (GLfixed angle, GLfixed x, GLfixed y, GLfixed z); typedef void (APIENTRYP PFNGLSAMPLECOVERAGEOESPROC) (GLfixed value, GLboolean invert); typedef void (APIENTRYP PFNGLSCALEXOESPROC) (GLfixed x, GLfixed y, GLfixed z); typedef void (APIENTRYP PFNGLTEXENVXOESPROC) (GLenum target, GLenum pname, GLfixed param); typedef void (APIENTRYP PFNGLTEXENVXVOESPROC) (GLenum target, GLenum pname, const GLfixed *params); typedef void (APIENTRYP PFNGLTEXPARAMETERXOESPROC) (GLenum target, GLenum pname, GLfixed param); typedef void (APIENTRYP PFNGLTEXPARAMETERXVOESPROC) (GLenum target, GLenum pname, const GLfixed *params); typedef void (APIENTRYP PFNGLTRANSLATEXOESPROC) (GLfixed x, GLfixed y, GLfixed z); typedef void (APIENTRYP PFNGLACCUMXOESPROC) (GLenum op, GLfixed value); typedef void (APIENTRYP PFNGLBITMAPXOESPROC) (GLsizei width, GLsizei height, GLfixed xorig, GLfixed yorig, GLfixed xmove, GLfixed ymove, const GLubyte *bitmap); typedef void (APIENTRYP PFNGLBLENDCOLORXOESPROC) (GLfixed red, GLfixed green, GLfixed blue, GLfixed alpha); typedef void (APIENTRYP PFNGLCLEARACCUMXOESPROC) (GLfixed red, GLfixed green, GLfixed blue, GLfixed alpha); typedef void (APIENTRYP PFNGLCOLOR3XOESPROC) (GLfixed red, GLfixed green, GLfixed blue); typedef void (APIENTRYP PFNGLCOLOR3XVOESPROC) (const GLfixed *components); typedef void (APIENTRYP PFNGLCOLOR4XVOESPROC) (const GLfixed *components); typedef void (APIENTRYP PFNGLCONVOLUTIONPARAMETERXOESPROC) (GLenum target, GLenum pname, GLfixed param); typedef void (APIENTRYP PFNGLCONVOLUTIONPARAMETERXVOESPROC) (GLenum target, GLenum pname, const GLfixed *params); typedef void (APIENTRYP PFNGLEVALCOORD1XOESPROC) (GLfixed u); typedef void (APIENTRYP PFNGLEVALCOORD1XVOESPROC) (const GLfixed *coords); typedef void (APIENTRYP PFNGLEVALCOORD2XOESPROC) (GLfixed u, GLfixed v); typedef void (APIENTRYP PFNGLEVALCOORD2XVOESPROC) (const GLfixed *coords); typedef void (APIENTRYP PFNGLFEEDBACKBUFFERXOESPROC) (GLsizei n, GLenum type, const GLfixed *buffer); typedef void (APIENTRYP PFNGLGETCONVOLUTIONPARAMETERXVOESPROC) (GLenum target, GLenum pname, GLfixed *params); typedef void (APIENTRYP PFNGLGETHISTOGRAMPARAMETERXVOESPROC) (GLenum target, GLenum pname, GLfixed *params); typedef void (APIENTRYP PFNGLGETLIGHTXOESPROC) (GLenum light, GLenum pname, GLfixed *params); typedef void (APIENTRYP PFNGLGETMAPXVOESPROC) (GLenum target, GLenum query, GLfixed *v); typedef void (APIENTRYP PFNGLGETMATERIALXOESPROC) (GLenum face, GLenum pname, GLfixed param); typedef void (APIENTRYP PFNGLGETPIXELMAPXVPROC) (GLenum map, GLint size, GLfixed *values); typedef void (APIENTRYP PFNGLGETTEXGENXVOESPROC) (GLenum coord, GLenum pname, GLfixed *params); typedef void (APIENTRYP PFNGLGETTEXLEVELPARAMETERXVOESPROC) (GLenum target, GLint level, GLenum pname, GLfixed *params); typedef void (APIENTRYP PFNGLINDEXXOESPROC) (GLfixed component); typedef void (APIENTRYP PFNGLINDEXXVOESPROC) (const GLfixed *component); typedef void (APIENTRYP PFNGLLOADTRANSPOSEMATRIXXOESPROC) (const GLfixed *m); typedef void (APIENTRYP PFNGLMAP1XOESPROC) (GLenum target, GLfixed u1, GLfixed u2, GLint stride, GLint order, GLfixed points); typedef void (APIENTRYP PFNGLMAP2XOESPROC) (GLenum target, GLfixed u1, GLfixed u2, GLint ustride, GLint uorder, GLfixed v1, GLfixed v2, GLint vstride, GLint vorder, GLfixed points); typedef void (APIENTRYP PFNGLMAPGRID1XOESPROC) (GLint n, GLfixed u1, GLfixed u2); typedef void (APIENTRYP PFNGLMAPGRID2XOESPROC) (GLint n, GLfixed u1, GLfixed u2, GLfixed v1, GLfixed v2); typedef void (APIENTRYP PFNGLMULTTRANSPOSEMATRIXXOESPROC) (const GLfixed *m); typedef void (APIENTRYP PFNGLMULTITEXCOORD1XOESPROC) (GLenum texture, GLfixed s); typedef void (APIENTRYP PFNGLMULTITEXCOORD1XVOESPROC) (GLenum texture, const GLfixed *coords); typedef void (APIENTRYP PFNGLMULTITEXCOORD2XOESPROC) (GLenum texture, GLfixed s, GLfixed t); typedef void (APIENTRYP PFNGLMULTITEXCOORD2XVOESPROC) (GLenum texture, const GLfixed *coords); typedef void (APIENTRYP PFNGLMULTITEXCOORD3XOESPROC) (GLenum texture, GLfixed s, GLfixed t, GLfixed r); typedef void (APIENTRYP PFNGLMULTITEXCOORD3XVOESPROC) (GLenum texture, const GLfixed *coords); typedef void (APIENTRYP PFNGLMULTITEXCOORD4XVOESPROC) (GLenum texture, const GLfixed *coords); typedef void (APIENTRYP PFNGLNORMAL3XVOESPROC) (const GLfixed *coords); typedef void (APIENTRYP PFNGLPASSTHROUGHXOESPROC) (GLfixed token); typedef void (APIENTRYP PFNGLPIXELMAPXPROC) (GLenum map, GLint size, const GLfixed *values); typedef void (APIENTRYP PFNGLPIXELSTOREXPROC) (GLenum pname, GLfixed param); typedef void (APIENTRYP PFNGLPIXELTRANSFERXOESPROC) (GLenum pname, GLfixed param); typedef void (APIENTRYP PFNGLPIXELZOOMXOESPROC) (GLfixed xfactor, GLfixed yfactor); typedef void (APIENTRYP PFNGLPRIORITIZETEXTURESXOESPROC) (GLsizei n, const GLuint *textures, const GLfixed *priorities); typedef void (APIENTRYP PFNGLRASTERPOS2XOESPROC) (GLfixed x, GLfixed y); typedef void (APIENTRYP PFNGLRASTERPOS2XVOESPROC) (const GLfixed *coords); typedef void (APIENTRYP PFNGLRASTERPOS3XOESPROC) (GLfixed x, GLfixed y, GLfixed z); typedef void (APIENTRYP PFNGLRASTERPOS3XVOESPROC) (const GLfixed *coords); typedef void (APIENTRYP PFNGLRASTERPOS4XOESPROC) (GLfixed x, GLfixed y, GLfixed z, GLfixed w); typedef void (APIENTRYP PFNGLRASTERPOS4XVOESPROC) (const GLfixed *coords); typedef void (APIENTRYP PFNGLRECTXOESPROC) (GLfixed x1, GLfixed y1, GLfixed x2, GLfixed y2); typedef void (APIENTRYP PFNGLRECTXVOESPROC) (const GLfixed *v1, const GLfixed *v2); typedef void (APIENTRYP PFNGLTEXCOORD1XOESPROC) (GLfixed s); typedef void (APIENTRYP PFNGLTEXCOORD1XVOESPROC) (const GLfixed *coords); typedef void (APIENTRYP PFNGLTEXCOORD2XOESPROC) (GLfixed s, GLfixed t); typedef void (APIENTRYP PFNGLTEXCOORD2XVOESPROC) (const GLfixed *coords); typedef void (APIENTRYP PFNGLTEXCOORD3XOESPROC) (GLfixed s, GLfixed t, GLfixed r); typedef void (APIENTRYP PFNGLTEXCOORD3XVOESPROC) (const GLfixed *coords); typedef void (APIENTRYP PFNGLTEXCOORD4XOESPROC) (GLfixed s, GLfixed t, GLfixed r, GLfixed q); typedef void (APIENTRYP PFNGLTEXCOORD4XVOESPROC) (const GLfixed *coords); typedef void (APIENTRYP PFNGLTEXGENXOESPROC) (GLenum coord, GLenum pname, GLfixed param); typedef void (APIENTRYP PFNGLTEXGENXVOESPROC) (GLenum coord, GLenum pname, const GLfixed *params); typedef void (APIENTRYP PFNGLVERTEX2XOESPROC) (GLfixed x); typedef void (APIENTRYP PFNGLVERTEX2XVOESPROC) (const GLfixed *coords); typedef void (APIENTRYP PFNGLVERTEX3XOESPROC) (GLfixed x, GLfixed y); typedef void (APIENTRYP PFNGLVERTEX3XVOESPROC) (const GLfixed *coords); typedef void (APIENTRYP PFNGLVERTEX4XOESPROC) (GLfixed x, GLfixed y, GLfixed z); typedef void (APIENTRYP PFNGLVERTEX4XVOESPROC) (const GLfixed *coords); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glAlphaFuncxOES (GLenum func, GLfixed ref); GLAPI void APIENTRY glClearColorxOES (GLfixed red, GLfixed green, GLfixed blue, GLfixed alpha); GLAPI void APIENTRY glClearDepthxOES (GLfixed depth); GLAPI void APIENTRY glClipPlanexOES (GLenum plane, const GLfixed *equation); GLAPI void APIENTRY glColor4xOES (GLfixed red, GLfixed green, GLfixed blue, GLfixed alpha); GLAPI void APIENTRY glDepthRangexOES (GLfixed n, GLfixed f); GLAPI void APIENTRY glFogxOES (GLenum pname, GLfixed param); GLAPI void APIENTRY glFogxvOES (GLenum pname, const GLfixed *param); GLAPI void APIENTRY glFrustumxOES (GLfixed l, GLfixed r, GLfixed b, GLfixed t, GLfixed n, GLfixed f); GLAPI void APIENTRY glGetClipPlanexOES (GLenum plane, GLfixed *equation); GLAPI void APIENTRY glGetFixedvOES (GLenum pname, GLfixed *params); GLAPI void APIENTRY glGetTexEnvxvOES (GLenum target, GLenum pname, GLfixed *params); GLAPI void APIENTRY glGetTexParameterxvOES (GLenum target, GLenum pname, GLfixed *params); GLAPI void APIENTRY glLightModelxOES (GLenum pname, GLfixed param); GLAPI void APIENTRY glLightModelxvOES (GLenum pname, const GLfixed *param); GLAPI void APIENTRY glLightxOES (GLenum light, GLenum pname, GLfixed param); GLAPI void APIENTRY glLightxvOES (GLenum light, GLenum pname, const GLfixed *params); GLAPI void APIENTRY glLineWidthxOES (GLfixed width); GLAPI void APIENTRY glLoadMatrixxOES (const GLfixed *m); GLAPI void APIENTRY glMaterialxOES (GLenum face, GLenum pname, GLfixed param); GLAPI void APIENTRY glMaterialxvOES (GLenum face, GLenum pname, const GLfixed *param); GLAPI void APIENTRY glMultMatrixxOES (const GLfixed *m); GLAPI void APIENTRY glMultiTexCoord4xOES (GLenum texture, GLfixed s, GLfixed t, GLfixed r, GLfixed q); GLAPI void APIENTRY glNormal3xOES (GLfixed nx, GLfixed ny, GLfixed nz); GLAPI void APIENTRY glOrthoxOES (GLfixed l, GLfixed r, GLfixed b, GLfixed t, GLfixed n, GLfixed f); GLAPI void APIENTRY glPointParameterxvOES (GLenum pname, const GLfixed *params); GLAPI void APIENTRY glPointSizexOES (GLfixed size); GLAPI void APIENTRY glPolygonOffsetxOES (GLfixed factor, GLfixed units); GLAPI void APIENTRY glRotatexOES (GLfixed angle, GLfixed x, GLfixed y, GLfixed z); GLAPI void APIENTRY glSampleCoverageOES (GLfixed value, GLboolean invert); GLAPI void APIENTRY glScalexOES (GLfixed x, GLfixed y, GLfixed z); GLAPI void APIENTRY glTexEnvxOES (GLenum target, GLenum pname, GLfixed param); GLAPI void APIENTRY glTexEnvxvOES (GLenum target, GLenum pname, const GLfixed *params); GLAPI void APIENTRY glTexParameterxOES (GLenum target, GLenum pname, GLfixed param); GLAPI void APIENTRY glTexParameterxvOES (GLenum target, GLenum pname, const GLfixed *params); GLAPI void APIENTRY glTranslatexOES (GLfixed x, GLfixed y, GLfixed z); GLAPI void APIENTRY glAccumxOES (GLenum op, GLfixed value); GLAPI void APIENTRY glBitmapxOES (GLsizei width, GLsizei height, GLfixed xorig, GLfixed yorig, GLfixed xmove, GLfixed ymove, const GLubyte *bitmap); GLAPI void APIENTRY glBlendColorxOES (GLfixed red, GLfixed green, GLfixed blue, GLfixed alpha); GLAPI void APIENTRY glClearAccumxOES (GLfixed red, GLfixed green, GLfixed blue, GLfixed alpha); GLAPI void APIENTRY glColor3xOES (GLfixed red, GLfixed green, GLfixed blue); GLAPI void APIENTRY glColor3xvOES (const GLfixed *components); GLAPI void APIENTRY glColor4xvOES (const GLfixed *components); GLAPI void APIENTRY glConvolutionParameterxOES (GLenum target, GLenum pname, GLfixed param); GLAPI void APIENTRY glConvolutionParameterxvOES (GLenum target, GLenum pname, const GLfixed *params); GLAPI void APIENTRY glEvalCoord1xOES (GLfixed u); GLAPI void APIENTRY glEvalCoord1xvOES (const GLfixed *coords); GLAPI void APIENTRY glEvalCoord2xOES (GLfixed u, GLfixed v); GLAPI void APIENTRY glEvalCoord2xvOES (const GLfixed *coords); GLAPI void APIENTRY glFeedbackBufferxOES (GLsizei n, GLenum type, const GLfixed *buffer); GLAPI void APIENTRY glGetConvolutionParameterxvOES (GLenum target, GLenum pname, GLfixed *params); GLAPI void APIENTRY glGetHistogramParameterxvOES (GLenum target, GLenum pname, GLfixed *params); GLAPI void APIENTRY glGetLightxOES (GLenum light, GLenum pname, GLfixed *params); GLAPI void APIENTRY glGetMapxvOES (GLenum target, GLenum query, GLfixed *v); GLAPI void APIENTRY glGetMaterialxOES (GLenum face, GLenum pname, GLfixed param); GLAPI void APIENTRY glGetPixelMapxv (GLenum map, GLint size, GLfixed *values); GLAPI void APIENTRY glGetTexGenxvOES (GLenum coord, GLenum pname, GLfixed *params); GLAPI void APIENTRY glGetTexLevelParameterxvOES (GLenum target, GLint level, GLenum pname, GLfixed *params); GLAPI void APIENTRY glIndexxOES (GLfixed component); GLAPI void APIENTRY glIndexxvOES (const GLfixed *component); GLAPI void APIENTRY glLoadTransposeMatrixxOES (const GLfixed *m); GLAPI void APIENTRY glMap1xOES (GLenum target, GLfixed u1, GLfixed u2, GLint stride, GLint order, GLfixed points); GLAPI void APIENTRY glMap2xOES (GLenum target, GLfixed u1, GLfixed u2, GLint ustride, GLint uorder, GLfixed v1, GLfixed v2, GLint vstride, GLint vorder, GLfixed points); GLAPI void APIENTRY glMapGrid1xOES (GLint n, GLfixed u1, GLfixed u2); GLAPI void APIENTRY glMapGrid2xOES (GLint n, GLfixed u1, GLfixed u2, GLfixed v1, GLfixed v2); GLAPI void APIENTRY glMultTransposeMatrixxOES (const GLfixed *m); GLAPI void APIENTRY glMultiTexCoord1xOES (GLenum texture, GLfixed s); GLAPI void APIENTRY glMultiTexCoord1xvOES (GLenum texture, const GLfixed *coords); GLAPI void APIENTRY glMultiTexCoord2xOES (GLenum texture, GLfixed s, GLfixed t); GLAPI void APIENTRY glMultiTexCoord2xvOES (GLenum texture, const GLfixed *coords); GLAPI void APIENTRY glMultiTexCoord3xOES (GLenum texture, GLfixed s, GLfixed t, GLfixed r); GLAPI void APIENTRY glMultiTexCoord3xvOES (GLenum texture, const GLfixed *coords); GLAPI void APIENTRY glMultiTexCoord4xvOES (GLenum texture, const GLfixed *coords); GLAPI void APIENTRY glNormal3xvOES (const GLfixed *coords); GLAPI void APIENTRY glPassThroughxOES (GLfixed token); GLAPI void APIENTRY glPixelMapx (GLenum map, GLint size, const GLfixed *values); GLAPI void APIENTRY glPixelStorex (GLenum pname, GLfixed param); GLAPI void APIENTRY glPixelTransferxOES (GLenum pname, GLfixed param); GLAPI void APIENTRY glPixelZoomxOES (GLfixed xfactor, GLfixed yfactor); GLAPI void APIENTRY glPrioritizeTexturesxOES (GLsizei n, const GLuint *textures, const GLfixed *priorities); GLAPI void APIENTRY glRasterPos2xOES (GLfixed x, GLfixed y); GLAPI void APIENTRY glRasterPos2xvOES (const GLfixed *coords); GLAPI void APIENTRY glRasterPos3xOES (GLfixed x, GLfixed y, GLfixed z); GLAPI void APIENTRY glRasterPos3xvOES (const GLfixed *coords); GLAPI void APIENTRY glRasterPos4xOES (GLfixed x, GLfixed y, GLfixed z, GLfixed w); GLAPI void APIENTRY glRasterPos4xvOES (const GLfixed *coords); GLAPI void APIENTRY glRectxOES (GLfixed x1, GLfixed y1, GLfixed x2, GLfixed y2); GLAPI void APIENTRY glRectxvOES (const GLfixed *v1, const GLfixed *v2); GLAPI void APIENTRY glTexCoord1xOES (GLfixed s); GLAPI void APIENTRY glTexCoord1xvOES (const GLfixed *coords); GLAPI void APIENTRY glTexCoord2xOES (GLfixed s, GLfixed t); GLAPI void APIENTRY glTexCoord2xvOES (const GLfixed *coords); GLAPI void APIENTRY glTexCoord3xOES (GLfixed s, GLfixed t, GLfixed r); GLAPI void APIENTRY glTexCoord3xvOES (const GLfixed *coords); GLAPI void APIENTRY glTexCoord4xOES (GLfixed s, GLfixed t, GLfixed r, GLfixed q); GLAPI void APIENTRY glTexCoord4xvOES (const GLfixed *coords); GLAPI void APIENTRY glTexGenxOES (GLenum coord, GLenum pname, GLfixed param); GLAPI void APIENTRY glTexGenxvOES (GLenum coord, GLenum pname, const GLfixed *params); GLAPI void APIENTRY glVertex2xOES (GLfixed x); GLAPI void APIENTRY glVertex2xvOES (const GLfixed *coords); GLAPI void APIENTRY glVertex3xOES (GLfixed x, GLfixed y); GLAPI void APIENTRY glVertex3xvOES (const GLfixed *coords); GLAPI void APIENTRY glVertex4xOES (GLfixed x, GLfixed y, GLfixed z); GLAPI void APIENTRY glVertex4xvOES (const GLfixed *coords); #endif #endif /* GL_OES_fixed_point */ #ifndef GL_OES_query_matrix #define GL_OES_query_matrix 1 typedef GLbitfield (APIENTRYP PFNGLQUERYMATRIXXOESPROC) (GLfixed *mantissa, GLint *exponent); #ifdef GL_GLEXT_PROTOTYPES GLAPI GLbitfield APIENTRY glQueryMatrixxOES (GLfixed *mantissa, GLint *exponent); #endif #endif /* GL_OES_query_matrix */ #ifndef GL_OES_read_format #define GL_OES_read_format 1 #define GL_IMPLEMENTATION_COLOR_READ_TYPE_OES 0x8B9A #define GL_IMPLEMENTATION_COLOR_READ_FORMAT_OES 0x8B9B #endif /* GL_OES_read_format */ #ifndef GL_OES_single_precision #define GL_OES_single_precision 1 typedef void (APIENTRYP PFNGLCLEARDEPTHFOESPROC) (GLclampf depth); typedef void (APIENTRYP PFNGLCLIPPLANEFOESPROC) (GLenum plane, const GLfloat *equation); typedef void (APIENTRYP PFNGLDEPTHRANGEFOESPROC) (GLclampf n, GLclampf f); typedef void (APIENTRYP PFNGLFRUSTUMFOESPROC) (GLfloat l, GLfloat r, GLfloat b, GLfloat t, GLfloat n, GLfloat f); typedef void (APIENTRYP PFNGLGETCLIPPLANEFOESPROC) (GLenum plane, GLfloat *equation); typedef void (APIENTRYP PFNGLORTHOFOESPROC) (GLfloat l, GLfloat r, GLfloat b, GLfloat t, GLfloat n, GLfloat f); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glClearDepthfOES (GLclampf depth); GLAPI void APIENTRY glClipPlanefOES (GLenum plane, const GLfloat *equation); GLAPI void APIENTRY glDepthRangefOES (GLclampf n, GLclampf f); GLAPI void APIENTRY glFrustumfOES (GLfloat l, GLfloat r, GLfloat b, GLfloat t, GLfloat n, GLfloat f); GLAPI void APIENTRY glGetClipPlanefOES (GLenum plane, GLfloat *equation); GLAPI void APIENTRY glOrthofOES (GLfloat l, GLfloat r, GLfloat b, GLfloat t, GLfloat n, GLfloat f); #endif #endif /* GL_OES_single_precision */ #ifndef GL_3DFX_multisample #define GL_3DFX_multisample 1 #define GL_MULTISAMPLE_3DFX 0x86B2 #define GL_SAMPLE_BUFFERS_3DFX 0x86B3 #define GL_SAMPLES_3DFX 0x86B4 #define GL_MULTISAMPLE_BIT_3DFX 0x20000000 #endif /* GL_3DFX_multisample */ #ifndef GL_3DFX_tbuffer #define GL_3DFX_tbuffer 1 typedef void (APIENTRYP PFNGLTBUFFERMASK3DFXPROC) (GLuint mask); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glTbufferMask3DFX (GLuint mask); #endif #endif /* GL_3DFX_tbuffer */ #ifndef GL_3DFX_texture_compression_FXT1 #define GL_3DFX_texture_compression_FXT1 1 #define GL_COMPRESSED_RGB_FXT1_3DFX 0x86B0 #define GL_COMPRESSED_RGBA_FXT1_3DFX 0x86B1 #endif /* GL_3DFX_texture_compression_FXT1 */ #ifndef GL_AMD_blend_minmax_factor #define GL_AMD_blend_minmax_factor 1 #define GL_FACTOR_MIN_AMD 0x901C #define GL_FACTOR_MAX_AMD 0x901D #endif /* GL_AMD_blend_minmax_factor */ #ifndef GL_AMD_conservative_depth #define GL_AMD_conservative_depth 1 #endif /* GL_AMD_conservative_depth */ #ifndef GL_AMD_debug_output #define GL_AMD_debug_output 1 typedef void (APIENTRY *GLDEBUGPROCAMD)(GLuint id,GLenum category,GLenum severity,GLsizei length,const GLchar *message,void *userParam); #define GL_MAX_DEBUG_MESSAGE_LENGTH_AMD 0x9143 #define GL_MAX_DEBUG_LOGGED_MESSAGES_AMD 0x9144 #define GL_DEBUG_LOGGED_MESSAGES_AMD 0x9145 #define GL_DEBUG_SEVERITY_HIGH_AMD 0x9146 #define GL_DEBUG_SEVERITY_MEDIUM_AMD 0x9147 #define GL_DEBUG_SEVERITY_LOW_AMD 0x9148 #define GL_DEBUG_CATEGORY_API_ERROR_AMD 0x9149 #define GL_DEBUG_CATEGORY_WINDOW_SYSTEM_AMD 0x914A #define GL_DEBUG_CATEGORY_DEPRECATION_AMD 0x914B #define GL_DEBUG_CATEGORY_UNDEFINED_BEHAVIOR_AMD 0x914C #define GL_DEBUG_CATEGORY_PERFORMANCE_AMD 0x914D #define GL_DEBUG_CATEGORY_SHADER_COMPILER_AMD 0x914E #define GL_DEBUG_CATEGORY_APPLICATION_AMD 0x914F #define GL_DEBUG_CATEGORY_OTHER_AMD 0x9150 typedef void (APIENTRYP PFNGLDEBUGMESSAGEENABLEAMDPROC) (GLenum category, GLenum severity, GLsizei count, const GLuint *ids, GLboolean enabled); typedef void (APIENTRYP PFNGLDEBUGMESSAGEINSERTAMDPROC) (GLenum category, GLenum severity, GLuint id, GLsizei length, const GLchar *buf); typedef void (APIENTRYP PFNGLDEBUGMESSAGECALLBACKAMDPROC) (GLDEBUGPROCAMD callback, void *userParam); typedef GLuint (APIENTRYP PFNGLGETDEBUGMESSAGELOGAMDPROC) (GLuint count, GLsizei bufsize, GLenum *categories, GLuint *severities, GLuint *ids, GLsizei *lengths, GLchar *message); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glDebugMessageEnableAMD (GLenum category, GLenum severity, GLsizei count, const GLuint *ids, GLboolean enabled); GLAPI void APIENTRY glDebugMessageInsertAMD (GLenum category, GLenum severity, GLuint id, GLsizei length, const GLchar *buf); GLAPI void APIENTRY glDebugMessageCallbackAMD (GLDEBUGPROCAMD callback, void *userParam); GLAPI GLuint APIENTRY glGetDebugMessageLogAMD (GLuint count, GLsizei bufsize, GLenum *categories, GLuint *severities, GLuint *ids, GLsizei *lengths, GLchar *message); #endif #endif /* GL_AMD_debug_output */ #ifndef GL_AMD_depth_clamp_separate #define GL_AMD_depth_clamp_separate 1 #define GL_DEPTH_CLAMP_NEAR_AMD 0x901E #define GL_DEPTH_CLAMP_FAR_AMD 0x901F #endif /* GL_AMD_depth_clamp_separate */ #ifndef GL_AMD_draw_buffers_blend #define GL_AMD_draw_buffers_blend 1 typedef void (APIENTRYP PFNGLBLENDFUNCINDEXEDAMDPROC) (GLuint buf, GLenum src, GLenum dst); typedef void (APIENTRYP PFNGLBLENDFUNCSEPARATEINDEXEDAMDPROC) (GLuint buf, GLenum srcRGB, GLenum dstRGB, GLenum srcAlpha, GLenum dstAlpha); typedef void (APIENTRYP PFNGLBLENDEQUATIONINDEXEDAMDPROC) (GLuint buf, GLenum mode); typedef void (APIENTRYP PFNGLBLENDEQUATIONSEPARATEINDEXEDAMDPROC) (GLuint buf, GLenum modeRGB, GLenum modeAlpha); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glBlendFuncIndexedAMD (GLuint buf, GLenum src, GLenum dst); GLAPI void APIENTRY glBlendFuncSeparateIndexedAMD (GLuint buf, GLenum srcRGB, GLenum dstRGB, GLenum srcAlpha, GLenum dstAlpha); GLAPI void APIENTRY glBlendEquationIndexedAMD (GLuint buf, GLenum mode); GLAPI void APIENTRY glBlendEquationSeparateIndexedAMD (GLuint buf, GLenum modeRGB, GLenum modeAlpha); #endif #endif /* GL_AMD_draw_buffers_blend */ #ifndef GL_AMD_interleaved_elements #define GL_AMD_interleaved_elements 1 #define GL_VERTEX_ELEMENT_SWIZZLE_AMD 0x91A4 #define GL_VERTEX_ID_SWIZZLE_AMD 0x91A5 typedef void (APIENTRYP PFNGLVERTEXATTRIBPARAMETERIAMDPROC) (GLuint index, GLenum pname, GLint param); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glVertexAttribParameteriAMD (GLuint index, GLenum pname, GLint param); #endif #endif /* GL_AMD_interleaved_elements */ #ifndef GL_AMD_multi_draw_indirect #define GL_AMD_multi_draw_indirect 1 typedef void (APIENTRYP PFNGLMULTIDRAWARRAYSINDIRECTAMDPROC) (GLenum mode, const void *indirect, GLsizei primcount, GLsizei stride); typedef void (APIENTRYP PFNGLMULTIDRAWELEMENTSINDIRECTAMDPROC) (GLenum mode, GLenum type, const void *indirect, GLsizei primcount, GLsizei stride); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glMultiDrawArraysIndirectAMD (GLenum mode, const void *indirect, GLsizei primcount, GLsizei stride); GLAPI void APIENTRY glMultiDrawElementsIndirectAMD (GLenum mode, GLenum type, const void *indirect, GLsizei primcount, GLsizei stride); #endif #endif /* GL_AMD_multi_draw_indirect */ #ifndef GL_AMD_name_gen_delete #define GL_AMD_name_gen_delete 1 #define GL_DATA_BUFFER_AMD 0x9151 #define GL_PERFORMANCE_MONITOR_AMD 0x9152 #define GL_QUERY_OBJECT_AMD 0x9153 #define GL_VERTEX_ARRAY_OBJECT_AMD 0x9154 #define GL_SAMPLER_OBJECT_AMD 0x9155 typedef void (APIENTRYP PFNGLGENNAMESAMDPROC) (GLenum identifier, GLuint num, GLuint *names); typedef void (APIENTRYP PFNGLDELETENAMESAMDPROC) (GLenum identifier, GLuint num, const GLuint *names); typedef GLboolean (APIENTRYP PFNGLISNAMEAMDPROC) (GLenum identifier, GLuint name); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glGenNamesAMD (GLenum identifier, GLuint num, GLuint *names); GLAPI void APIENTRY glDeleteNamesAMD (GLenum identifier, GLuint num, const GLuint *names); GLAPI GLboolean APIENTRY glIsNameAMD (GLenum identifier, GLuint name); #endif #endif /* GL_AMD_name_gen_delete */ #ifndef GL_AMD_occlusion_query_event #define GL_AMD_occlusion_query_event 1 #define GL_OCCLUSION_QUERY_EVENT_MASK_AMD 0x874F #define GL_QUERY_DEPTH_PASS_EVENT_BIT_AMD 0x00000001 #define GL_QUERY_DEPTH_FAIL_EVENT_BIT_AMD 0x00000002 #define GL_QUERY_STENCIL_FAIL_EVENT_BIT_AMD 0x00000004 #define GL_QUERY_DEPTH_BOUNDS_FAIL_EVENT_BIT_AMD 0x00000008 #define GL_QUERY_ALL_EVENT_BITS_AMD 0xFFFFFFFF typedef void (APIENTRYP PFNGLQUERYOBJECTPARAMETERUIAMDPROC) (GLenum target, GLuint id, GLenum pname, GLuint param); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glQueryObjectParameteruiAMD (GLenum target, GLuint id, GLenum pname, GLuint param); #endif #endif /* GL_AMD_occlusion_query_event */ #ifndef GL_AMD_performance_monitor #define GL_AMD_performance_monitor 1 #define GL_COUNTER_TYPE_AMD 0x8BC0 #define GL_COUNTER_RANGE_AMD 0x8BC1 #define GL_UNSIGNED_INT64_AMD 0x8BC2 #define GL_PERCENTAGE_AMD 0x8BC3 #define GL_PERFMON_RESULT_AVAILABLE_AMD 0x8BC4 #define GL_PERFMON_RESULT_SIZE_AMD 0x8BC5 #define GL_PERFMON_RESULT_AMD 0x8BC6 typedef void (APIENTRYP PFNGLGETPERFMONITORGROUPSAMDPROC) (GLint *numGroups, GLsizei groupsSize, GLuint *groups); typedef void (APIENTRYP PFNGLGETPERFMONITORCOUNTERSAMDPROC) (GLuint group, GLint *numCounters, GLint *maxActiveCounters, GLsizei counterSize, GLuint *counters); typedef void (APIENTRYP PFNGLGETPERFMONITORGROUPSTRINGAMDPROC) (GLuint group, GLsizei bufSize, GLsizei *length, GLchar *groupString); typedef void (APIENTRYP PFNGLGETPERFMONITORCOUNTERSTRINGAMDPROC) (GLuint group, GLuint counter, GLsizei bufSize, GLsizei *length, GLchar *counterString); typedef void (APIENTRYP PFNGLGETPERFMONITORCOUNTERINFOAMDPROC) (GLuint group, GLuint counter, GLenum pname, void *data); typedef void (APIENTRYP PFNGLGENPERFMONITORSAMDPROC) (GLsizei n, GLuint *monitors); typedef void (APIENTRYP PFNGLDELETEPERFMONITORSAMDPROC) (GLsizei n, GLuint *monitors); typedef void (APIENTRYP PFNGLSELECTPERFMONITORCOUNTERSAMDPROC) (GLuint monitor, GLboolean enable, GLuint group, GLint numCounters, GLuint *counterList); typedef void (APIENTRYP PFNGLBEGINPERFMONITORAMDPROC) (GLuint monitor); typedef void (APIENTRYP PFNGLENDPERFMONITORAMDPROC) (GLuint monitor); typedef void (APIENTRYP PFNGLGETPERFMONITORCOUNTERDATAAMDPROC) (GLuint monitor, GLenum pname, GLsizei dataSize, GLuint *data, GLint *bytesWritten); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glGetPerfMonitorGroupsAMD (GLint *numGroups, GLsizei groupsSize, GLuint *groups); GLAPI void APIENTRY glGetPerfMonitorCountersAMD (GLuint group, GLint *numCounters, GLint *maxActiveCounters, GLsizei counterSize, GLuint *counters); GLAPI void APIENTRY glGetPerfMonitorGroupStringAMD (GLuint group, GLsizei bufSize, GLsizei *length, GLchar *groupString); GLAPI void APIENTRY glGetPerfMonitorCounterStringAMD (GLuint group, GLuint counter, GLsizei bufSize, GLsizei *length, GLchar *counterString); GLAPI void APIENTRY glGetPerfMonitorCounterInfoAMD (GLuint group, GLuint counter, GLenum pname, void *data); GLAPI void APIENTRY glGenPerfMonitorsAMD (GLsizei n, GLuint *monitors); GLAPI void APIENTRY glDeletePerfMonitorsAMD (GLsizei n, GLuint *monitors); GLAPI void APIENTRY glSelectPerfMonitorCountersAMD (GLuint monitor, GLboolean enable, GLuint group, GLint numCounters, GLuint *counterList); GLAPI void APIENTRY glBeginPerfMonitorAMD (GLuint monitor); GLAPI void APIENTRY glEndPerfMonitorAMD (GLuint monitor); GLAPI void APIENTRY glGetPerfMonitorCounterDataAMD (GLuint monitor, GLenum pname, GLsizei dataSize, GLuint *data, GLint *bytesWritten); #endif #endif /* GL_AMD_performance_monitor */ #ifndef GL_AMD_pinned_memory #define GL_AMD_pinned_memory 1 #define GL_EXTERNAL_VIRTUAL_MEMORY_BUFFER_AMD 0x9160 #endif /* GL_AMD_pinned_memory */ #ifndef GL_AMD_query_buffer_object #define GL_AMD_query_buffer_object 1 #define GL_QUERY_BUFFER_AMD 0x9192 #define GL_QUERY_BUFFER_BINDING_AMD 0x9193 #define GL_QUERY_RESULT_NO_WAIT_AMD 0x9194 #endif /* GL_AMD_query_buffer_object */ #ifndef GL_AMD_sample_positions #define GL_AMD_sample_positions 1 #define GL_SUBSAMPLE_DISTANCE_AMD 0x883F typedef void (APIENTRYP PFNGLSETMULTISAMPLEFVAMDPROC) (GLenum pname, GLuint index, const GLfloat *val); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glSetMultisamplefvAMD (GLenum pname, GLuint index, const GLfloat *val); #endif #endif /* GL_AMD_sample_positions */ #ifndef GL_AMD_seamless_cubemap_per_texture #define GL_AMD_seamless_cubemap_per_texture 1 #endif /* GL_AMD_seamless_cubemap_per_texture */ #ifndef GL_AMD_shader_atomic_counter_ops #define GL_AMD_shader_atomic_counter_ops 1 #endif /* GL_AMD_shader_atomic_counter_ops */ #ifndef GL_AMD_shader_stencil_export #define GL_AMD_shader_stencil_export 1 #endif /* GL_AMD_shader_stencil_export */ #ifndef GL_AMD_shader_trinary_minmax #define GL_AMD_shader_trinary_minmax 1 #endif /* GL_AMD_shader_trinary_minmax */ #ifndef GL_AMD_sparse_texture #define GL_AMD_sparse_texture 1 #define GL_VIRTUAL_PAGE_SIZE_X_AMD 0x9195 #define GL_VIRTUAL_PAGE_SIZE_Y_AMD 0x9196 #define GL_VIRTUAL_PAGE_SIZE_Z_AMD 0x9197 #define GL_MAX_SPARSE_TEXTURE_SIZE_AMD 0x9198 #define GL_MAX_SPARSE_3D_TEXTURE_SIZE_AMD 0x9199 #define GL_MAX_SPARSE_ARRAY_TEXTURE_LAYERS 0x919A #define GL_MIN_SPARSE_LEVEL_AMD 0x919B #define GL_MIN_LOD_WARNING_AMD 0x919C #define GL_TEXTURE_STORAGE_SPARSE_BIT_AMD 0x00000001 typedef void (APIENTRYP PFNGLTEXSTORAGESPARSEAMDPROC) (GLenum target, GLenum internalFormat, GLsizei width, GLsizei height, GLsizei depth, GLsizei layers, GLbitfield flags); typedef void (APIENTRYP PFNGLTEXTURESTORAGESPARSEAMDPROC) (GLuint texture, GLenum target, GLenum internalFormat, GLsizei width, GLsizei height, GLsizei depth, GLsizei layers, GLbitfield flags); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glTexStorageSparseAMD (GLenum target, GLenum internalFormat, GLsizei width, GLsizei height, GLsizei depth, GLsizei layers, GLbitfield flags); GLAPI void APIENTRY glTextureStorageSparseAMD (GLuint texture, GLenum target, GLenum internalFormat, GLsizei width, GLsizei height, GLsizei depth, GLsizei layers, GLbitfield flags); #endif #endif /* GL_AMD_sparse_texture */ #ifndef GL_AMD_stencil_operation_extended #define GL_AMD_stencil_operation_extended 1 #define GL_SET_AMD 0x874A #define GL_REPLACE_VALUE_AMD 0x874B #define GL_STENCIL_OP_VALUE_AMD 0x874C #define GL_STENCIL_BACK_OP_VALUE_AMD 0x874D typedef void (APIENTRYP PFNGLSTENCILOPVALUEAMDPROC) (GLenum face, GLuint value); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glStencilOpValueAMD (GLenum face, GLuint value); #endif #endif /* GL_AMD_stencil_operation_extended */ #ifndef GL_AMD_texture_texture4 #define GL_AMD_texture_texture4 1 #endif /* GL_AMD_texture_texture4 */ #ifndef GL_AMD_transform_feedback3_lines_triangles #define GL_AMD_transform_feedback3_lines_triangles 1 #endif /* GL_AMD_transform_feedback3_lines_triangles */ #ifndef GL_AMD_vertex_shader_layer #define GL_AMD_vertex_shader_layer 1 #endif /* GL_AMD_vertex_shader_layer */ #ifndef GL_AMD_vertex_shader_tessellator #define GL_AMD_vertex_shader_tessellator 1 #define GL_SAMPLER_BUFFER_AMD 0x9001 #define GL_INT_SAMPLER_BUFFER_AMD 0x9002 #define GL_UNSIGNED_INT_SAMPLER_BUFFER_AMD 0x9003 #define GL_TESSELLATION_MODE_AMD 0x9004 #define GL_TESSELLATION_FACTOR_AMD 0x9005 #define GL_DISCRETE_AMD 0x9006 #define GL_CONTINUOUS_AMD 0x9007 typedef void (APIENTRYP PFNGLTESSELLATIONFACTORAMDPROC) (GLfloat factor); typedef void (APIENTRYP PFNGLTESSELLATIONMODEAMDPROC) (GLenum mode); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glTessellationFactorAMD (GLfloat factor); GLAPI void APIENTRY glTessellationModeAMD (GLenum mode); #endif #endif /* GL_AMD_vertex_shader_tessellator */ #ifndef GL_AMD_vertex_shader_viewport_index #define GL_AMD_vertex_shader_viewport_index 1 #endif /* GL_AMD_vertex_shader_viewport_index */ #ifndef GL_APPLE_aux_depth_stencil #define GL_APPLE_aux_depth_stencil 1 #define GL_AUX_DEPTH_STENCIL_APPLE 0x8A14 #endif /* GL_APPLE_aux_depth_stencil */ #ifndef GL_APPLE_client_storage #define GL_APPLE_client_storage 1 #define GL_UNPACK_CLIENT_STORAGE_APPLE 0x85B2 #endif /* GL_APPLE_client_storage */ #ifndef GL_APPLE_element_array #define GL_APPLE_element_array 1 #define GL_ELEMENT_ARRAY_APPLE 0x8A0C #define GL_ELEMENT_ARRAY_TYPE_APPLE 0x8A0D #define GL_ELEMENT_ARRAY_POINTER_APPLE 0x8A0E typedef void (APIENTRYP PFNGLELEMENTPOINTERAPPLEPROC) (GLenum type, const void *pointer); typedef void (APIENTRYP PFNGLDRAWELEMENTARRAYAPPLEPROC) (GLenum mode, GLint first, GLsizei count); typedef void (APIENTRYP PFNGLDRAWRANGEELEMENTARRAYAPPLEPROC) (GLenum mode, GLuint start, GLuint end, GLint first, GLsizei count); typedef void (APIENTRYP PFNGLMULTIDRAWELEMENTARRAYAPPLEPROC) (GLenum mode, const GLint *first, const GLsizei *count, GLsizei primcount); typedef void (APIENTRYP PFNGLMULTIDRAWRANGEELEMENTARRAYAPPLEPROC) (GLenum mode, GLuint start, GLuint end, const GLint *first, const GLsizei *count, GLsizei primcount); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glElementPointerAPPLE (GLenum type, const void *pointer); GLAPI void APIENTRY glDrawElementArrayAPPLE (GLenum mode, GLint first, GLsizei count); GLAPI void APIENTRY glDrawRangeElementArrayAPPLE (GLenum mode, GLuint start, GLuint end, GLint first, GLsizei count); GLAPI void APIENTRY glMultiDrawElementArrayAPPLE (GLenum mode, const GLint *first, const GLsizei *count, GLsizei primcount); GLAPI void APIENTRY glMultiDrawRangeElementArrayAPPLE (GLenum mode, GLuint start, GLuint end, const GLint *first, const GLsizei *count, GLsizei primcount); #endif #endif /* GL_APPLE_element_array */ #ifndef GL_APPLE_fence #define GL_APPLE_fence 1 #define GL_DRAW_PIXELS_APPLE 0x8A0A #define GL_FENCE_APPLE 0x8A0B typedef void (APIENTRYP PFNGLGENFENCESAPPLEPROC) (GLsizei n, GLuint *fences); typedef void (APIENTRYP PFNGLDELETEFENCESAPPLEPROC) (GLsizei n, const GLuint *fences); typedef void (APIENTRYP PFNGLSETFENCEAPPLEPROC) (GLuint fence); typedef GLboolean (APIENTRYP PFNGLISFENCEAPPLEPROC) (GLuint fence); typedef GLboolean (APIENTRYP PFNGLTESTFENCEAPPLEPROC) (GLuint fence); typedef void (APIENTRYP PFNGLFINISHFENCEAPPLEPROC) (GLuint fence); typedef GLboolean (APIENTRYP PFNGLTESTOBJECTAPPLEPROC) (GLenum object, GLuint name); typedef void (APIENTRYP PFNGLFINISHOBJECTAPPLEPROC) (GLenum object, GLint name); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glGenFencesAPPLE (GLsizei n, GLuint *fences); GLAPI void APIENTRY glDeleteFencesAPPLE (GLsizei n, const GLuint *fences); GLAPI void APIENTRY glSetFenceAPPLE (GLuint fence); GLAPI GLboolean APIENTRY glIsFenceAPPLE (GLuint fence); GLAPI GLboolean APIENTRY glTestFenceAPPLE (GLuint fence); GLAPI void APIENTRY glFinishFenceAPPLE (GLuint fence); GLAPI GLboolean APIENTRY glTestObjectAPPLE (GLenum object, GLuint name); GLAPI void APIENTRY glFinishObjectAPPLE (GLenum object, GLint name); #endif #endif /* GL_APPLE_fence */ #ifndef GL_APPLE_float_pixels #define GL_APPLE_float_pixels 1 #define GL_HALF_APPLE 0x140B #define GL_RGBA_FLOAT32_APPLE 0x8814 #define GL_RGB_FLOAT32_APPLE 0x8815 #define GL_ALPHA_FLOAT32_APPLE 0x8816 #define GL_INTENSITY_FLOAT32_APPLE 0x8817 #define GL_LUMINANCE_FLOAT32_APPLE 0x8818 #define GL_LUMINANCE_ALPHA_FLOAT32_APPLE 0x8819 #define GL_RGBA_FLOAT16_APPLE 0x881A #define GL_RGB_FLOAT16_APPLE 0x881B #define GL_ALPHA_FLOAT16_APPLE 0x881C #define GL_INTENSITY_FLOAT16_APPLE 0x881D #define GL_LUMINANCE_FLOAT16_APPLE 0x881E #define GL_LUMINANCE_ALPHA_FLOAT16_APPLE 0x881F #define GL_COLOR_FLOAT_APPLE 0x8A0F #endif /* GL_APPLE_float_pixels */ #ifndef GL_APPLE_flush_buffer_range #define GL_APPLE_flush_buffer_range 1 #define GL_BUFFER_SERIALIZED_MODIFY_APPLE 0x8A12 #define GL_BUFFER_FLUSHING_UNMAP_APPLE 0x8A13 typedef void (APIENTRYP PFNGLBUFFERPARAMETERIAPPLEPROC) (GLenum target, GLenum pname, GLint param); typedef void (APIENTRYP PFNGLFLUSHMAPPEDBUFFERRANGEAPPLEPROC) (GLenum target, GLintptr offset, GLsizeiptr size); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glBufferParameteriAPPLE (GLenum target, GLenum pname, GLint param); GLAPI void APIENTRY glFlushMappedBufferRangeAPPLE (GLenum target, GLintptr offset, GLsizeiptr size); #endif #endif /* GL_APPLE_flush_buffer_range */ #ifndef GL_APPLE_object_purgeable #define GL_APPLE_object_purgeable 1 #define GL_BUFFER_OBJECT_APPLE 0x85B3 #define GL_RELEASED_APPLE 0x8A19 #define GL_VOLATILE_APPLE 0x8A1A #define GL_RETAINED_APPLE 0x8A1B #define GL_UNDEFINED_APPLE 0x8A1C #define GL_PURGEABLE_APPLE 0x8A1D typedef GLenum (APIENTRYP PFNGLOBJECTPURGEABLEAPPLEPROC) (GLenum objectType, GLuint name, GLenum option); typedef GLenum (APIENTRYP PFNGLOBJECTUNPURGEABLEAPPLEPROC) (GLenum objectType, GLuint name, GLenum option); typedef void (APIENTRYP PFNGLGETOBJECTPARAMETERIVAPPLEPROC) (GLenum objectType, GLuint name, GLenum pname, GLint *params); #ifdef GL_GLEXT_PROTOTYPES GLAPI GLenum APIENTRY glObjectPurgeableAPPLE (GLenum objectType, GLuint name, GLenum option); GLAPI GLenum APIENTRY glObjectUnpurgeableAPPLE (GLenum objectType, GLuint name, GLenum option); GLAPI void APIENTRY glGetObjectParameterivAPPLE (GLenum objectType, GLuint name, GLenum pname, GLint *params); #endif #endif /* GL_APPLE_object_purgeable */ #ifndef GL_APPLE_rgb_422 #define GL_APPLE_rgb_422 1 #define GL_RGB_422_APPLE 0x8A1F #define GL_UNSIGNED_SHORT_8_8_APPLE 0x85BA #define GL_UNSIGNED_SHORT_8_8_REV_APPLE 0x85BB #define GL_RGB_RAW_422_APPLE 0x8A51 #endif /* GL_APPLE_rgb_422 */ #ifndef GL_APPLE_row_bytes #define GL_APPLE_row_bytes 1 #define GL_PACK_ROW_BYTES_APPLE 0x8A15 #define GL_UNPACK_ROW_BYTES_APPLE 0x8A16 #endif /* GL_APPLE_row_bytes */ #ifndef GL_APPLE_specular_vector #define GL_APPLE_specular_vector 1 #define GL_LIGHT_MODEL_SPECULAR_VECTOR_APPLE 0x85B0 #endif /* GL_APPLE_specular_vector */ #ifndef GL_APPLE_texture_range #define GL_APPLE_texture_range 1 #define GL_TEXTURE_RANGE_LENGTH_APPLE 0x85B7 #define GL_TEXTURE_RANGE_POINTER_APPLE 0x85B8 #define GL_TEXTURE_STORAGE_HINT_APPLE 0x85BC #define GL_STORAGE_PRIVATE_APPLE 0x85BD #define GL_STORAGE_CACHED_APPLE 0x85BE #define GL_STORAGE_SHARED_APPLE 0x85BF typedef void (APIENTRYP PFNGLTEXTURERANGEAPPLEPROC) (GLenum target, GLsizei length, const void *pointer); typedef void (APIENTRYP PFNGLGETTEXPARAMETERPOINTERVAPPLEPROC) (GLenum target, GLenum pname, void **params); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glTextureRangeAPPLE (GLenum target, GLsizei length, const void *pointer); GLAPI void APIENTRY glGetTexParameterPointervAPPLE (GLenum target, GLenum pname, void **params); #endif #endif /* GL_APPLE_texture_range */ #ifndef GL_APPLE_transform_hint #define GL_APPLE_transform_hint 1 #define GL_TRANSFORM_HINT_APPLE 0x85B1 #endif /* GL_APPLE_transform_hint */ #ifndef GL_APPLE_vertex_array_object #define GL_APPLE_vertex_array_object 1 #define GL_VERTEX_ARRAY_BINDING_APPLE 0x85B5 typedef void (APIENTRYP PFNGLBINDVERTEXARRAYAPPLEPROC) (GLuint array); typedef void (APIENTRYP PFNGLDELETEVERTEXARRAYSAPPLEPROC) (GLsizei n, const GLuint *arrays); typedef void (APIENTRYP PFNGLGENVERTEXARRAYSAPPLEPROC) (GLsizei n, GLuint *arrays); typedef GLboolean (APIENTRYP PFNGLISVERTEXARRAYAPPLEPROC) (GLuint array); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glBindVertexArrayAPPLE (GLuint array); GLAPI void APIENTRY glDeleteVertexArraysAPPLE (GLsizei n, const GLuint *arrays); GLAPI void APIENTRY glGenVertexArraysAPPLE (GLsizei n, GLuint *arrays); GLAPI GLboolean APIENTRY glIsVertexArrayAPPLE (GLuint array); #endif #endif /* GL_APPLE_vertex_array_object */ #ifndef GL_APPLE_vertex_array_range #define GL_APPLE_vertex_array_range 1 #define GL_VERTEX_ARRAY_RANGE_APPLE 0x851D #define GL_VERTEX_ARRAY_RANGE_LENGTH_APPLE 0x851E #define GL_VERTEX_ARRAY_STORAGE_HINT_APPLE 0x851F #define GL_VERTEX_ARRAY_RANGE_POINTER_APPLE 0x8521 #define GL_STORAGE_CLIENT_APPLE 0x85B4 typedef void (APIENTRYP PFNGLVERTEXARRAYRANGEAPPLEPROC) (GLsizei length, void *pointer); typedef void (APIENTRYP PFNGLFLUSHVERTEXARRAYRANGEAPPLEPROC) (GLsizei length, void *pointer); typedef void (APIENTRYP PFNGLVERTEXARRAYPARAMETERIAPPLEPROC) (GLenum pname, GLint param); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glVertexArrayRangeAPPLE (GLsizei length, void *pointer); GLAPI void APIENTRY glFlushVertexArrayRangeAPPLE (GLsizei length, void *pointer); GLAPI void APIENTRY glVertexArrayParameteriAPPLE (GLenum pname, GLint param); #endif #endif /* GL_APPLE_vertex_array_range */ #ifndef GL_APPLE_vertex_program_evaluators #define GL_APPLE_vertex_program_evaluators 1 #define GL_VERTEX_ATTRIB_MAP1_APPLE 0x8A00 #define GL_VERTEX_ATTRIB_MAP2_APPLE 0x8A01 #define GL_VERTEX_ATTRIB_MAP1_SIZE_APPLE 0x8A02 #define GL_VERTEX_ATTRIB_MAP1_COEFF_APPLE 0x8A03 #define GL_VERTEX_ATTRIB_MAP1_ORDER_APPLE 0x8A04 #define GL_VERTEX_ATTRIB_MAP1_DOMAIN_APPLE 0x8A05 #define GL_VERTEX_ATTRIB_MAP2_SIZE_APPLE 0x8A06 #define GL_VERTEX_ATTRIB_MAP2_COEFF_APPLE 0x8A07 #define GL_VERTEX_ATTRIB_MAP2_ORDER_APPLE 0x8A08 #define GL_VERTEX_ATTRIB_MAP2_DOMAIN_APPLE 0x8A09 typedef void (APIENTRYP PFNGLENABLEVERTEXATTRIBAPPLEPROC) (GLuint index, GLenum pname); typedef void (APIENTRYP PFNGLDISABLEVERTEXATTRIBAPPLEPROC) (GLuint index, GLenum pname); typedef GLboolean (APIENTRYP PFNGLISVERTEXATTRIBENABLEDAPPLEPROC) (GLuint index, GLenum pname); typedef void (APIENTRYP PFNGLMAPVERTEXATTRIB1DAPPLEPROC) (GLuint index, GLuint size, GLdouble u1, GLdouble u2, GLint stride, GLint order, const GLdouble *points); typedef void (APIENTRYP PFNGLMAPVERTEXATTRIB1FAPPLEPROC) (GLuint index, GLuint size, GLfloat u1, GLfloat u2, GLint stride, GLint order, const GLfloat *points); typedef void (APIENTRYP PFNGLMAPVERTEXATTRIB2DAPPLEPROC) (GLuint index, GLuint size, GLdouble u1, GLdouble u2, GLint ustride, GLint uorder, GLdouble v1, GLdouble v2, GLint vstride, GLint vorder, const GLdouble *points); typedef void (APIENTRYP PFNGLMAPVERTEXATTRIB2FAPPLEPROC) (GLuint index, GLuint size, GLfloat u1, GLfloat u2, GLint ustride, GLint uorder, GLfloat v1, GLfloat v2, GLint vstride, GLint vorder, const GLfloat *points); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glEnableVertexAttribAPPLE (GLuint index, GLenum pname); GLAPI void APIENTRY glDisableVertexAttribAPPLE (GLuint index, GLenum pname); GLAPI GLboolean APIENTRY glIsVertexAttribEnabledAPPLE (GLuint index, GLenum pname); GLAPI void APIENTRY glMapVertexAttrib1dAPPLE (GLuint index, GLuint size, GLdouble u1, GLdouble u2, GLint stride, GLint order, const GLdouble *points); GLAPI void APIENTRY glMapVertexAttrib1fAPPLE (GLuint index, GLuint size, GLfloat u1, GLfloat u2, GLint stride, GLint order, const GLfloat *points); GLAPI void APIENTRY glMapVertexAttrib2dAPPLE (GLuint index, GLuint size, GLdouble u1, GLdouble u2, GLint ustride, GLint uorder, GLdouble v1, GLdouble v2, GLint vstride, GLint vorder, const GLdouble *points); GLAPI void APIENTRY glMapVertexAttrib2fAPPLE (GLuint index, GLuint size, GLfloat u1, GLfloat u2, GLint ustride, GLint uorder, GLfloat v1, GLfloat v2, GLint vstride, GLint vorder, const GLfloat *points); #endif #endif /* GL_APPLE_vertex_program_evaluators */ #ifndef GL_APPLE_ycbcr_422 #define GL_APPLE_ycbcr_422 1 #define GL_YCBCR_422_APPLE 0x85B9 #endif /* GL_APPLE_ycbcr_422 */ #ifndef GL_ATI_draw_buffers #define GL_ATI_draw_buffers 1 #define GL_MAX_DRAW_BUFFERS_ATI 0x8824 #define GL_DRAW_BUFFER0_ATI 0x8825 #define GL_DRAW_BUFFER1_ATI 0x8826 #define GL_DRAW_BUFFER2_ATI 0x8827 #define GL_DRAW_BUFFER3_ATI 0x8828 #define GL_DRAW_BUFFER4_ATI 0x8829 #define GL_DRAW_BUFFER5_ATI 0x882A #define GL_DRAW_BUFFER6_ATI 0x882B #define GL_DRAW_BUFFER7_ATI 0x882C #define GL_DRAW_BUFFER8_ATI 0x882D #define GL_DRAW_BUFFER9_ATI 0x882E #define GL_DRAW_BUFFER10_ATI 0x882F #define GL_DRAW_BUFFER11_ATI 0x8830 #define GL_DRAW_BUFFER12_ATI 0x8831 #define GL_DRAW_BUFFER13_ATI 0x8832 #define GL_DRAW_BUFFER14_ATI 0x8833 #define GL_DRAW_BUFFER15_ATI 0x8834 typedef void (APIENTRYP PFNGLDRAWBUFFERSATIPROC) (GLsizei n, const GLenum *bufs); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glDrawBuffersATI (GLsizei n, const GLenum *bufs); #endif #endif /* GL_ATI_draw_buffers */ #ifndef GL_ATI_element_array #define GL_ATI_element_array 1 #define GL_ELEMENT_ARRAY_ATI 0x8768 #define GL_ELEMENT_ARRAY_TYPE_ATI 0x8769 #define GL_ELEMENT_ARRAY_POINTER_ATI 0x876A typedef void (APIENTRYP PFNGLELEMENTPOINTERATIPROC) (GLenum type, const void *pointer); typedef void (APIENTRYP PFNGLDRAWELEMENTARRAYATIPROC) (GLenum mode, GLsizei count); typedef void (APIENTRYP PFNGLDRAWRANGEELEMENTARRAYATIPROC) (GLenum mode, GLuint start, GLuint end, GLsizei count); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glElementPointerATI (GLenum type, const void *pointer); GLAPI void APIENTRY glDrawElementArrayATI (GLenum mode, GLsizei count); GLAPI void APIENTRY glDrawRangeElementArrayATI (GLenum mode, GLuint start, GLuint end, GLsizei count); #endif #endif /* GL_ATI_element_array */ #ifndef GL_ATI_envmap_bumpmap #define GL_ATI_envmap_bumpmap 1 #define GL_BUMP_ROT_MATRIX_ATI 0x8775 #define GL_BUMP_ROT_MATRIX_SIZE_ATI 0x8776 #define GL_BUMP_NUM_TEX_UNITS_ATI 0x8777 #define GL_BUMP_TEX_UNITS_ATI 0x8778 #define GL_DUDV_ATI 0x8779 #define GL_DU8DV8_ATI 0x877A #define GL_BUMP_ENVMAP_ATI 0x877B #define GL_BUMP_TARGET_ATI 0x877C typedef void (APIENTRYP PFNGLTEXBUMPPARAMETERIVATIPROC) (GLenum pname, const GLint *param); typedef void (APIENTRYP PFNGLTEXBUMPPARAMETERFVATIPROC) (GLenum pname, const GLfloat *param); typedef void (APIENTRYP PFNGLGETTEXBUMPPARAMETERIVATIPROC) (GLenum pname, GLint *param); typedef void (APIENTRYP PFNGLGETTEXBUMPPARAMETERFVATIPROC) (GLenum pname, GLfloat *param); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glTexBumpParameterivATI (GLenum pname, const GLint *param); GLAPI void APIENTRY glTexBumpParameterfvATI (GLenum pname, const GLfloat *param); GLAPI void APIENTRY glGetTexBumpParameterivATI (GLenum pname, GLint *param); GLAPI void APIENTRY glGetTexBumpParameterfvATI (GLenum pname, GLfloat *param); #endif #endif /* GL_ATI_envmap_bumpmap */ #ifndef GL_ATI_fragment_shader #define GL_ATI_fragment_shader 1 #define GL_FRAGMENT_SHADER_ATI 0x8920 #define GL_REG_0_ATI 0x8921 #define GL_REG_1_ATI 0x8922 #define GL_REG_2_ATI 0x8923 #define GL_REG_3_ATI 0x8924 #define GL_REG_4_ATI 0x8925 #define GL_REG_5_ATI 0x8926 #define GL_REG_6_ATI 0x8927 #define GL_REG_7_ATI 0x8928 #define GL_REG_8_ATI 0x8929 #define GL_REG_9_ATI 0x892A #define GL_REG_10_ATI 0x892B #define GL_REG_11_ATI 0x892C #define GL_REG_12_ATI 0x892D #define GL_REG_13_ATI 0x892E #define GL_REG_14_ATI 0x892F #define GL_REG_15_ATI 0x8930 #define GL_REG_16_ATI 0x8931 #define GL_REG_17_ATI 0x8932 #define GL_REG_18_ATI 0x8933 #define GL_REG_19_ATI 0x8934 #define GL_REG_20_ATI 0x8935 #define GL_REG_21_ATI 0x8936 #define GL_REG_22_ATI 0x8937 #define GL_REG_23_ATI 0x8938 #define GL_REG_24_ATI 0x8939 #define GL_REG_25_ATI 0x893A #define GL_REG_26_ATI 0x893B #define GL_REG_27_ATI 0x893C #define GL_REG_28_ATI 0x893D #define GL_REG_29_ATI 0x893E #define GL_REG_30_ATI 0x893F #define GL_REG_31_ATI 0x8940 #define GL_CON_0_ATI 0x8941 #define GL_CON_1_ATI 0x8942 #define GL_CON_2_ATI 0x8943 #define GL_CON_3_ATI 0x8944 #define GL_CON_4_ATI 0x8945 #define GL_CON_5_ATI 0x8946 #define GL_CON_6_ATI 0x8947 #define GL_CON_7_ATI 0x8948 #define GL_CON_8_ATI 0x8949 #define GL_CON_9_ATI 0x894A #define GL_CON_10_ATI 0x894B #define GL_CON_11_ATI 0x894C #define GL_CON_12_ATI 0x894D #define GL_CON_13_ATI 0x894E #define GL_CON_14_ATI 0x894F #define GL_CON_15_ATI 0x8950 #define GL_CON_16_ATI 0x8951 #define GL_CON_17_ATI 0x8952 #define GL_CON_18_ATI 0x8953 #define GL_CON_19_ATI 0x8954 #define GL_CON_20_ATI 0x8955 #define GL_CON_21_ATI 0x8956 #define GL_CON_22_ATI 0x8957 #define GL_CON_23_ATI 0x8958 #define GL_CON_24_ATI 0x8959 #define GL_CON_25_ATI 0x895A #define GL_CON_26_ATI 0x895B #define GL_CON_27_ATI 0x895C #define GL_CON_28_ATI 0x895D #define GL_CON_29_ATI 0x895E #define GL_CON_30_ATI 0x895F #define GL_CON_31_ATI 0x8960 #define GL_MOV_ATI 0x8961 #define GL_ADD_ATI 0x8963 #define GL_MUL_ATI 0x8964 #define GL_SUB_ATI 0x8965 #define GL_DOT3_ATI 0x8966 #define GL_DOT4_ATI 0x8967 #define GL_MAD_ATI 0x8968 #define GL_LERP_ATI 0x8969 #define GL_CND_ATI 0x896A #define GL_CND0_ATI 0x896B #define GL_DOT2_ADD_ATI 0x896C #define GL_SECONDARY_INTERPOLATOR_ATI 0x896D #define GL_NUM_FRAGMENT_REGISTERS_ATI 0x896E #define GL_NUM_FRAGMENT_CONSTANTS_ATI 0x896F #define GL_NUM_PASSES_ATI 0x8970 #define GL_NUM_INSTRUCTIONS_PER_PASS_ATI 0x8971 #define GL_NUM_INSTRUCTIONS_TOTAL_ATI 0x8972 #define GL_NUM_INPUT_INTERPOLATOR_COMPONENTS_ATI 0x8973 #define GL_NUM_LOOPBACK_COMPONENTS_ATI 0x8974 #define GL_COLOR_ALPHA_PAIRING_ATI 0x8975 #define GL_SWIZZLE_STR_ATI 0x8976 #define GL_SWIZZLE_STQ_ATI 0x8977 #define GL_SWIZZLE_STR_DR_ATI 0x8978 #define GL_SWIZZLE_STQ_DQ_ATI 0x8979 #define GL_SWIZZLE_STRQ_ATI 0x897A #define GL_SWIZZLE_STRQ_DQ_ATI 0x897B #define GL_RED_BIT_ATI 0x00000001 #define GL_GREEN_BIT_ATI 0x00000002 #define GL_BLUE_BIT_ATI 0x00000004 #define GL_2X_BIT_ATI 0x00000001 #define GL_4X_BIT_ATI 0x00000002 #define GL_8X_BIT_ATI 0x00000004 #define GL_HALF_BIT_ATI 0x00000008 #define GL_QUARTER_BIT_ATI 0x00000010 #define GL_EIGHTH_BIT_ATI 0x00000020 #define GL_SATURATE_BIT_ATI 0x00000040 #define GL_COMP_BIT_ATI 0x00000002 #define GL_NEGATE_BIT_ATI 0x00000004 #define GL_BIAS_BIT_ATI 0x00000008 typedef GLuint (APIENTRYP PFNGLGENFRAGMENTSHADERSATIPROC) (GLuint range); typedef void (APIENTRYP PFNGLBINDFRAGMENTSHADERATIPROC) (GLuint id); typedef void (APIENTRYP PFNGLDELETEFRAGMENTSHADERATIPROC) (GLuint id); typedef void (APIENTRYP PFNGLBEGINFRAGMENTSHADERATIPROC) (void); typedef void (APIENTRYP PFNGLENDFRAGMENTSHADERATIPROC) (void); typedef void (APIENTRYP PFNGLPASSTEXCOORDATIPROC) (GLuint dst, GLuint coord, GLenum swizzle); typedef void (APIENTRYP PFNGLSAMPLEMAPATIPROC) (GLuint dst, GLuint interp, GLenum swizzle); typedef void (APIENTRYP PFNGLCOLORFRAGMENTOP1ATIPROC) (GLenum op, GLuint dst, GLuint dstMask, GLuint dstMod, GLuint arg1, GLuint arg1Rep, GLuint arg1Mod); typedef void (APIENTRYP PFNGLCOLORFRAGMENTOP2ATIPROC) (GLenum op, GLuint dst, GLuint dstMask, GLuint dstMod, GLuint arg1, GLuint arg1Rep, GLuint arg1Mod, GLuint arg2, GLuint arg2Rep, GLuint arg2Mod); typedef void (APIENTRYP PFNGLCOLORFRAGMENTOP3ATIPROC) (GLenum op, GLuint dst, GLuint dstMask, GLuint dstMod, GLuint arg1, GLuint arg1Rep, GLuint arg1Mod, GLuint arg2, GLuint arg2Rep, GLuint arg2Mod, GLuint arg3, GLuint arg3Rep, GLuint arg3Mod); typedef void (APIENTRYP PFNGLALPHAFRAGMENTOP1ATIPROC) (GLenum op, GLuint dst, GLuint dstMod, GLuint arg1, GLuint arg1Rep, GLuint arg1Mod); typedef void (APIENTRYP PFNGLALPHAFRAGMENTOP2ATIPROC) (GLenum op, GLuint dst, GLuint dstMod, GLuint arg1, GLuint arg1Rep, GLuint arg1Mod, GLuint arg2, GLuint arg2Rep, GLuint arg2Mod); typedef void (APIENTRYP PFNGLALPHAFRAGMENTOP3ATIPROC) (GLenum op, GLuint dst, GLuint dstMod, GLuint arg1, GLuint arg1Rep, GLuint arg1Mod, GLuint arg2, GLuint arg2Rep, GLuint arg2Mod, GLuint arg3, GLuint arg3Rep, GLuint arg3Mod); typedef void (APIENTRYP PFNGLSETFRAGMENTSHADERCONSTANTATIPROC) (GLuint dst, const GLfloat *value); #ifdef GL_GLEXT_PROTOTYPES GLAPI GLuint APIENTRY glGenFragmentShadersATI (GLuint range); GLAPI void APIENTRY glBindFragmentShaderATI (GLuint id); GLAPI void APIENTRY glDeleteFragmentShaderATI (GLuint id); GLAPI void APIENTRY glBeginFragmentShaderATI (void); GLAPI void APIENTRY glEndFragmentShaderATI (void); GLAPI void APIENTRY glPassTexCoordATI (GLuint dst, GLuint coord, GLenum swizzle); GLAPI void APIENTRY glSampleMapATI (GLuint dst, GLuint interp, GLenum swizzle); GLAPI void APIENTRY glColorFragmentOp1ATI (GLenum op, GLuint dst, GLuint dstMask, GLuint dstMod, GLuint arg1, GLuint arg1Rep, GLuint arg1Mod); GLAPI void APIENTRY glColorFragmentOp2ATI (GLenum op, GLuint dst, GLuint dstMask, GLuint dstMod, GLuint arg1, GLuint arg1Rep, GLuint arg1Mod, GLuint arg2, GLuint arg2Rep, GLuint arg2Mod); GLAPI void APIENTRY glColorFragmentOp3ATI (GLenum op, GLuint dst, GLuint dstMask, GLuint dstMod, GLuint arg1, GLuint arg1Rep, GLuint arg1Mod, GLuint arg2, GLuint arg2Rep, GLuint arg2Mod, GLuint arg3, GLuint arg3Rep, GLuint arg3Mod); GLAPI void APIENTRY glAlphaFragmentOp1ATI (GLenum op, GLuint dst, GLuint dstMod, GLuint arg1, GLuint arg1Rep, GLuint arg1Mod); GLAPI void APIENTRY glAlphaFragmentOp2ATI (GLenum op, GLuint dst, GLuint dstMod, GLuint arg1, GLuint arg1Rep, GLuint arg1Mod, GLuint arg2, GLuint arg2Rep, GLuint arg2Mod); GLAPI void APIENTRY glAlphaFragmentOp3ATI (GLenum op, GLuint dst, GLuint dstMod, GLuint arg1, GLuint arg1Rep, GLuint arg1Mod, GLuint arg2, GLuint arg2Rep, GLuint arg2Mod, GLuint arg3, GLuint arg3Rep, GLuint arg3Mod); GLAPI void APIENTRY glSetFragmentShaderConstantATI (GLuint dst, const GLfloat *value); #endif #endif /* GL_ATI_fragment_shader */ #ifndef GL_ATI_map_object_buffer #define GL_ATI_map_object_buffer 1 typedef void *(APIENTRYP PFNGLMAPOBJECTBUFFERATIPROC) (GLuint buffer); typedef void (APIENTRYP PFNGLUNMAPOBJECTBUFFERATIPROC) (GLuint buffer); #ifdef GL_GLEXT_PROTOTYPES GLAPI void *APIENTRY glMapObjectBufferATI (GLuint buffer); GLAPI void APIENTRY glUnmapObjectBufferATI (GLuint buffer); #endif #endif /* GL_ATI_map_object_buffer */ #ifndef GL_ATI_meminfo #define GL_ATI_meminfo 1 #define GL_VBO_FREE_MEMORY_ATI 0x87FB #define GL_TEXTURE_FREE_MEMORY_ATI 0x87FC #define GL_RENDERBUFFER_FREE_MEMORY_ATI 0x87FD #endif /* GL_ATI_meminfo */ #ifndef GL_ATI_pixel_format_float #define GL_ATI_pixel_format_float 1 #define GL_RGBA_FLOAT_MODE_ATI 0x8820 #define GL_COLOR_CLEAR_UNCLAMPED_VALUE_ATI 0x8835 #endif /* GL_ATI_pixel_format_float */ #ifndef GL_ATI_pn_triangles #define GL_ATI_pn_triangles 1 #define GL_PN_TRIANGLES_ATI 0x87F0 #define GL_MAX_PN_TRIANGLES_TESSELATION_LEVEL_ATI 0x87F1 #define GL_PN_TRIANGLES_POINT_MODE_ATI 0x87F2 #define GL_PN_TRIANGLES_NORMAL_MODE_ATI 0x87F3 #define GL_PN_TRIANGLES_TESSELATION_LEVEL_ATI 0x87F4 #define GL_PN_TRIANGLES_POINT_MODE_LINEAR_ATI 0x87F5 #define GL_PN_TRIANGLES_POINT_MODE_CUBIC_ATI 0x87F6 #define GL_PN_TRIANGLES_NORMAL_MODE_LINEAR_ATI 0x87F7 #define GL_PN_TRIANGLES_NORMAL_MODE_QUADRATIC_ATI 0x87F8 typedef void (APIENTRYP PFNGLPNTRIANGLESIATIPROC) (GLenum pname, GLint param); typedef void (APIENTRYP PFNGLPNTRIANGLESFATIPROC) (GLenum pname, GLfloat param); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glPNTrianglesiATI (GLenum pname, GLint param); GLAPI void APIENTRY glPNTrianglesfATI (GLenum pname, GLfloat param); #endif #endif /* GL_ATI_pn_triangles */ #ifndef GL_ATI_separate_stencil #define GL_ATI_separate_stencil 1 #define GL_STENCIL_BACK_FUNC_ATI 0x8800 #define GL_STENCIL_BACK_FAIL_ATI 0x8801 #define GL_STENCIL_BACK_PASS_DEPTH_FAIL_ATI 0x8802 #define GL_STENCIL_BACK_PASS_DEPTH_PASS_ATI 0x8803 typedef void (APIENTRYP PFNGLSTENCILOPSEPARATEATIPROC) (GLenum face, GLenum sfail, GLenum dpfail, GLenum dppass); typedef void (APIENTRYP PFNGLSTENCILFUNCSEPARATEATIPROC) (GLenum frontfunc, GLenum backfunc, GLint ref, GLuint mask); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glStencilOpSeparateATI (GLenum face, GLenum sfail, GLenum dpfail, GLenum dppass); GLAPI void APIENTRY glStencilFuncSeparateATI (GLenum frontfunc, GLenum backfunc, GLint ref, GLuint mask); #endif #endif /* GL_ATI_separate_stencil */ #ifndef GL_ATI_text_fragment_shader #define GL_ATI_text_fragment_shader 1 #define GL_TEXT_FRAGMENT_SHADER_ATI 0x8200 #endif /* GL_ATI_text_fragment_shader */ #ifndef GL_ATI_texture_env_combine3 #define GL_ATI_texture_env_combine3 1 #define GL_MODULATE_ADD_ATI 0x8744 #define GL_MODULATE_SIGNED_ADD_ATI 0x8745 #define GL_MODULATE_SUBTRACT_ATI 0x8746 #endif /* GL_ATI_texture_env_combine3 */ #ifndef GL_ATI_texture_float #define GL_ATI_texture_float 1 #define GL_RGBA_FLOAT32_ATI 0x8814 #define GL_RGB_FLOAT32_ATI 0x8815 #define GL_ALPHA_FLOAT32_ATI 0x8816 #define GL_INTENSITY_FLOAT32_ATI 0x8817 #define GL_LUMINANCE_FLOAT32_ATI 0x8818 #define GL_LUMINANCE_ALPHA_FLOAT32_ATI 0x8819 #define GL_RGBA_FLOAT16_ATI 0x881A #define GL_RGB_FLOAT16_ATI 0x881B #define GL_ALPHA_FLOAT16_ATI 0x881C #define GL_INTENSITY_FLOAT16_ATI 0x881D #define GL_LUMINANCE_FLOAT16_ATI 0x881E #define GL_LUMINANCE_ALPHA_FLOAT16_ATI 0x881F #endif /* GL_ATI_texture_float */ #ifndef GL_ATI_texture_mirror_once #define GL_ATI_texture_mirror_once 1 #define GL_MIRROR_CLAMP_ATI 0x8742 #define GL_MIRROR_CLAMP_TO_EDGE_ATI 0x8743 #endif /* GL_ATI_texture_mirror_once */ #ifndef GL_ATI_vertex_array_object #define GL_ATI_vertex_array_object 1 #define GL_STATIC_ATI 0x8760 #define GL_DYNAMIC_ATI 0x8761 #define GL_PRESERVE_ATI 0x8762 #define GL_DISCARD_ATI 0x8763 #define GL_OBJECT_BUFFER_SIZE_ATI 0x8764 #define GL_OBJECT_BUFFER_USAGE_ATI 0x8765 #define GL_ARRAY_OBJECT_BUFFER_ATI 0x8766 #define GL_ARRAY_OBJECT_OFFSET_ATI 0x8767 typedef GLuint (APIENTRYP PFNGLNEWOBJECTBUFFERATIPROC) (GLsizei size, const void *pointer, GLenum usage); typedef GLboolean (APIENTRYP PFNGLISOBJECTBUFFERATIPROC) (GLuint buffer); typedef void (APIENTRYP PFNGLUPDATEOBJECTBUFFERATIPROC) (GLuint buffer, GLuint offset, GLsizei size, const void *pointer, GLenum preserve); typedef void (APIENTRYP PFNGLGETOBJECTBUFFERFVATIPROC) (GLuint buffer, GLenum pname, GLfloat *params); typedef void (APIENTRYP PFNGLGETOBJECTBUFFERIVATIPROC) (GLuint buffer, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLFREEOBJECTBUFFERATIPROC) (GLuint buffer); typedef void (APIENTRYP PFNGLARRAYOBJECTATIPROC) (GLenum array, GLint size, GLenum type, GLsizei stride, GLuint buffer, GLuint offset); typedef void (APIENTRYP PFNGLGETARRAYOBJECTFVATIPROC) (GLenum array, GLenum pname, GLfloat *params); typedef void (APIENTRYP PFNGLGETARRAYOBJECTIVATIPROC) (GLenum array, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLVARIANTARRAYOBJECTATIPROC) (GLuint id, GLenum type, GLsizei stride, GLuint buffer, GLuint offset); typedef void (APIENTRYP PFNGLGETVARIANTARRAYOBJECTFVATIPROC) (GLuint id, GLenum pname, GLfloat *params); typedef void (APIENTRYP PFNGLGETVARIANTARRAYOBJECTIVATIPROC) (GLuint id, GLenum pname, GLint *params); #ifdef GL_GLEXT_PROTOTYPES GLAPI GLuint APIENTRY glNewObjectBufferATI (GLsizei size, const void *pointer, GLenum usage); GLAPI GLboolean APIENTRY glIsObjectBufferATI (GLuint buffer); GLAPI void APIENTRY glUpdateObjectBufferATI (GLuint buffer, GLuint offset, GLsizei size, const void *pointer, GLenum preserve); GLAPI void APIENTRY glGetObjectBufferfvATI (GLuint buffer, GLenum pname, GLfloat *params); GLAPI void APIENTRY glGetObjectBufferivATI (GLuint buffer, GLenum pname, GLint *params); GLAPI void APIENTRY glFreeObjectBufferATI (GLuint buffer); GLAPI void APIENTRY glArrayObjectATI (GLenum array, GLint size, GLenum type, GLsizei stride, GLuint buffer, GLuint offset); GLAPI void APIENTRY glGetArrayObjectfvATI (GLenum array, GLenum pname, GLfloat *params); GLAPI void APIENTRY glGetArrayObjectivATI (GLenum array, GLenum pname, GLint *params); GLAPI void APIENTRY glVariantArrayObjectATI (GLuint id, GLenum type, GLsizei stride, GLuint buffer, GLuint offset); GLAPI void APIENTRY glGetVariantArrayObjectfvATI (GLuint id, GLenum pname, GLfloat *params); GLAPI void APIENTRY glGetVariantArrayObjectivATI (GLuint id, GLenum pname, GLint *params); #endif #endif /* GL_ATI_vertex_array_object */ #ifndef GL_ATI_vertex_attrib_array_object #define GL_ATI_vertex_attrib_array_object 1 typedef void (APIENTRYP PFNGLVERTEXATTRIBARRAYOBJECTATIPROC) (GLuint index, GLint size, GLenum type, GLboolean normalized, GLsizei stride, GLuint buffer, GLuint offset); typedef void (APIENTRYP PFNGLGETVERTEXATTRIBARRAYOBJECTFVATIPROC) (GLuint index, GLenum pname, GLfloat *params); typedef void (APIENTRYP PFNGLGETVERTEXATTRIBARRAYOBJECTIVATIPROC) (GLuint index, GLenum pname, GLint *params); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glVertexAttribArrayObjectATI (GLuint index, GLint size, GLenum type, GLboolean normalized, GLsizei stride, GLuint buffer, GLuint offset); GLAPI void APIENTRY glGetVertexAttribArrayObjectfvATI (GLuint index, GLenum pname, GLfloat *params); GLAPI void APIENTRY glGetVertexAttribArrayObjectivATI (GLuint index, GLenum pname, GLint *params); #endif #endif /* GL_ATI_vertex_attrib_array_object */ #ifndef GL_ATI_vertex_streams #define GL_ATI_vertex_streams 1 #define GL_MAX_VERTEX_STREAMS_ATI 0x876B #define GL_VERTEX_STREAM0_ATI 0x876C #define GL_VERTEX_STREAM1_ATI 0x876D #define GL_VERTEX_STREAM2_ATI 0x876E #define GL_VERTEX_STREAM3_ATI 0x876F #define GL_VERTEX_STREAM4_ATI 0x8770 #define GL_VERTEX_STREAM5_ATI 0x8771 #define GL_VERTEX_STREAM6_ATI 0x8772 #define GL_VERTEX_STREAM7_ATI 0x8773 #define GL_VERTEX_SOURCE_ATI 0x8774 typedef void (APIENTRYP PFNGLVERTEXSTREAM1SATIPROC) (GLenum stream, GLshort x); typedef void (APIENTRYP PFNGLVERTEXSTREAM1SVATIPROC) (GLenum stream, const GLshort *coords); typedef void (APIENTRYP PFNGLVERTEXSTREAM1IATIPROC) (GLenum stream, GLint x); typedef void (APIENTRYP PFNGLVERTEXSTREAM1IVATIPROC) (GLenum stream, const GLint *coords); typedef void (APIENTRYP PFNGLVERTEXSTREAM1FATIPROC) (GLenum stream, GLfloat x); typedef void (APIENTRYP PFNGLVERTEXSTREAM1FVATIPROC) (GLenum stream, const GLfloat *coords); typedef void (APIENTRYP PFNGLVERTEXSTREAM1DATIPROC) (GLenum stream, GLdouble x); typedef void (APIENTRYP PFNGLVERTEXSTREAM1DVATIPROC) (GLenum stream, const GLdouble *coords); typedef void (APIENTRYP PFNGLVERTEXSTREAM2SATIPROC) (GLenum stream, GLshort x, GLshort y); typedef void (APIENTRYP PFNGLVERTEXSTREAM2SVATIPROC) (GLenum stream, const GLshort *coords); typedef void (APIENTRYP PFNGLVERTEXSTREAM2IATIPROC) (GLenum stream, GLint x, GLint y); typedef void (APIENTRYP PFNGLVERTEXSTREAM2IVATIPROC) (GLenum stream, const GLint *coords); typedef void (APIENTRYP PFNGLVERTEXSTREAM2FATIPROC) (GLenum stream, GLfloat x, GLfloat y); typedef void (APIENTRYP PFNGLVERTEXSTREAM2FVATIPROC) (GLenum stream, const GLfloat *coords); typedef void (APIENTRYP PFNGLVERTEXSTREAM2DATIPROC) (GLenum stream, GLdouble x, GLdouble y); typedef void (APIENTRYP PFNGLVERTEXSTREAM2DVATIPROC) (GLenum stream, const GLdouble *coords); typedef void (APIENTRYP PFNGLVERTEXSTREAM3SATIPROC) (GLenum stream, GLshort x, GLshort y, GLshort z); typedef void (APIENTRYP PFNGLVERTEXSTREAM3SVATIPROC) (GLenum stream, const GLshort *coords); typedef void (APIENTRYP PFNGLVERTEXSTREAM3IATIPROC) (GLenum stream, GLint x, GLint y, GLint z); typedef void (APIENTRYP PFNGLVERTEXSTREAM3IVATIPROC) (GLenum stream, const GLint *coords); typedef void (APIENTRYP PFNGLVERTEXSTREAM3FATIPROC) (GLenum stream, GLfloat x, GLfloat y, GLfloat z); typedef void (APIENTRYP PFNGLVERTEXSTREAM3FVATIPROC) (GLenum stream, const GLfloat *coords); typedef void (APIENTRYP PFNGLVERTEXSTREAM3DATIPROC) (GLenum stream, GLdouble x, GLdouble y, GLdouble z); typedef void (APIENTRYP PFNGLVERTEXSTREAM3DVATIPROC) (GLenum stream, const GLdouble *coords); typedef void (APIENTRYP PFNGLVERTEXSTREAM4SATIPROC) (GLenum stream, GLshort x, GLshort y, GLshort z, GLshort w); typedef void (APIENTRYP PFNGLVERTEXSTREAM4SVATIPROC) (GLenum stream, const GLshort *coords); typedef void (APIENTRYP PFNGLVERTEXSTREAM4IATIPROC) (GLenum stream, GLint x, GLint y, GLint z, GLint w); typedef void (APIENTRYP PFNGLVERTEXSTREAM4IVATIPROC) (GLenum stream, const GLint *coords); typedef void (APIENTRYP PFNGLVERTEXSTREAM4FATIPROC) (GLenum stream, GLfloat x, GLfloat y, GLfloat z, GLfloat w); typedef void (APIENTRYP PFNGLVERTEXSTREAM4FVATIPROC) (GLenum stream, const GLfloat *coords); typedef void (APIENTRYP PFNGLVERTEXSTREAM4DATIPROC) (GLenum stream, GLdouble x, GLdouble y, GLdouble z, GLdouble w); typedef void (APIENTRYP PFNGLVERTEXSTREAM4DVATIPROC) (GLenum stream, const GLdouble *coords); typedef void (APIENTRYP PFNGLNORMALSTREAM3BATIPROC) (GLenum stream, GLbyte nx, GLbyte ny, GLbyte nz); typedef void (APIENTRYP PFNGLNORMALSTREAM3BVATIPROC) (GLenum stream, const GLbyte *coords); typedef void (APIENTRYP PFNGLNORMALSTREAM3SATIPROC) (GLenum stream, GLshort nx, GLshort ny, GLshort nz); typedef void (APIENTRYP PFNGLNORMALSTREAM3SVATIPROC) (GLenum stream, const GLshort *coords); typedef void (APIENTRYP PFNGLNORMALSTREAM3IATIPROC) (GLenum stream, GLint nx, GLint ny, GLint nz); typedef void (APIENTRYP PFNGLNORMALSTREAM3IVATIPROC) (GLenum stream, const GLint *coords); typedef void (APIENTRYP PFNGLNORMALSTREAM3FATIPROC) (GLenum stream, GLfloat nx, GLfloat ny, GLfloat nz); typedef void (APIENTRYP PFNGLNORMALSTREAM3FVATIPROC) (GLenum stream, const GLfloat *coords); typedef void (APIENTRYP PFNGLNORMALSTREAM3DATIPROC) (GLenum stream, GLdouble nx, GLdouble ny, GLdouble nz); typedef void (APIENTRYP PFNGLNORMALSTREAM3DVATIPROC) (GLenum stream, const GLdouble *coords); typedef void (APIENTRYP PFNGLCLIENTACTIVEVERTEXSTREAMATIPROC) (GLenum stream); typedef void (APIENTRYP PFNGLVERTEXBLENDENVIATIPROC) (GLenum pname, GLint param); typedef void (APIENTRYP PFNGLVERTEXBLENDENVFATIPROC) (GLenum pname, GLfloat param); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glVertexStream1sATI (GLenum stream, GLshort x); GLAPI void APIENTRY glVertexStream1svATI (GLenum stream, const GLshort *coords); GLAPI void APIENTRY glVertexStream1iATI (GLenum stream, GLint x); GLAPI void APIENTRY glVertexStream1ivATI (GLenum stream, const GLint *coords); GLAPI void APIENTRY glVertexStream1fATI (GLenum stream, GLfloat x); GLAPI void APIENTRY glVertexStream1fvATI (GLenum stream, const GLfloat *coords); GLAPI void APIENTRY glVertexStream1dATI (GLenum stream, GLdouble x); GLAPI void APIENTRY glVertexStream1dvATI (GLenum stream, const GLdouble *coords); GLAPI void APIENTRY glVertexStream2sATI (GLenum stream, GLshort x, GLshort y); GLAPI void APIENTRY glVertexStream2svATI (GLenum stream, const GLshort *coords); GLAPI void APIENTRY glVertexStream2iATI (GLenum stream, GLint x, GLint y); GLAPI void APIENTRY glVertexStream2ivATI (GLenum stream, const GLint *coords); GLAPI void APIENTRY glVertexStream2fATI (GLenum stream, GLfloat x, GLfloat y); GLAPI void APIENTRY glVertexStream2fvATI (GLenum stream, const GLfloat *coords); GLAPI void APIENTRY glVertexStream2dATI (GLenum stream, GLdouble x, GLdouble y); GLAPI void APIENTRY glVertexStream2dvATI (GLenum stream, const GLdouble *coords); GLAPI void APIENTRY glVertexStream3sATI (GLenum stream, GLshort x, GLshort y, GLshort z); GLAPI void APIENTRY glVertexStream3svATI (GLenum stream, const GLshort *coords); GLAPI void APIENTRY glVertexStream3iATI (GLenum stream, GLint x, GLint y, GLint z); GLAPI void APIENTRY glVertexStream3ivATI (GLenum stream, const GLint *coords); GLAPI void APIENTRY glVertexStream3fATI (GLenum stream, GLfloat x, GLfloat y, GLfloat z); GLAPI void APIENTRY glVertexStream3fvATI (GLenum stream, const GLfloat *coords); GLAPI void APIENTRY glVertexStream3dATI (GLenum stream, GLdouble x, GLdouble y, GLdouble z); GLAPI void APIENTRY glVertexStream3dvATI (GLenum stream, const GLdouble *coords); GLAPI void APIENTRY glVertexStream4sATI (GLenum stream, GLshort x, GLshort y, GLshort z, GLshort w); GLAPI void APIENTRY glVertexStream4svATI (GLenum stream, const GLshort *coords); GLAPI void APIENTRY glVertexStream4iATI (GLenum stream, GLint x, GLint y, GLint z, GLint w); GLAPI void APIENTRY glVertexStream4ivATI (GLenum stream, const GLint *coords); GLAPI void APIENTRY glVertexStream4fATI (GLenum stream, GLfloat x, GLfloat y, GLfloat z, GLfloat w); GLAPI void APIENTRY glVertexStream4fvATI (GLenum stream, const GLfloat *coords); GLAPI void APIENTRY glVertexStream4dATI (GLenum stream, GLdouble x, GLdouble y, GLdouble z, GLdouble w); GLAPI void APIENTRY glVertexStream4dvATI (GLenum stream, const GLdouble *coords); GLAPI void APIENTRY glNormalStream3bATI (GLenum stream, GLbyte nx, GLbyte ny, GLbyte nz); GLAPI void APIENTRY glNormalStream3bvATI (GLenum stream, const GLbyte *coords); GLAPI void APIENTRY glNormalStream3sATI (GLenum stream, GLshort nx, GLshort ny, GLshort nz); GLAPI void APIENTRY glNormalStream3svATI (GLenum stream, const GLshort *coords); GLAPI void APIENTRY glNormalStream3iATI (GLenum stream, GLint nx, GLint ny, GLint nz); GLAPI void APIENTRY glNormalStream3ivATI (GLenum stream, const GLint *coords); GLAPI void APIENTRY glNormalStream3fATI (GLenum stream, GLfloat nx, GLfloat ny, GLfloat nz); GLAPI void APIENTRY glNormalStream3fvATI (GLenum stream, const GLfloat *coords); GLAPI void APIENTRY glNormalStream3dATI (GLenum stream, GLdouble nx, GLdouble ny, GLdouble nz); GLAPI void APIENTRY glNormalStream3dvATI (GLenum stream, const GLdouble *coords); GLAPI void APIENTRY glClientActiveVertexStreamATI (GLenum stream); GLAPI void APIENTRY glVertexBlendEnviATI (GLenum pname, GLint param); GLAPI void APIENTRY glVertexBlendEnvfATI (GLenum pname, GLfloat param); #endif #endif /* GL_ATI_vertex_streams */ #ifndef GL_EXT_422_pixels #define GL_EXT_422_pixels 1 #define GL_422_EXT 0x80CC #define GL_422_REV_EXT 0x80CD #define GL_422_AVERAGE_EXT 0x80CE #define GL_422_REV_AVERAGE_EXT 0x80CF #endif /* GL_EXT_422_pixels */ #ifndef GL_EXT_abgr #define GL_EXT_abgr 1 #define GL_ABGR_EXT 0x8000 #endif /* GL_EXT_abgr */ #ifndef GL_EXT_bgra #define GL_EXT_bgra 1 #define GL_BGR_EXT 0x80E0 #define GL_BGRA_EXT 0x80E1 #endif /* GL_EXT_bgra */ #ifndef GL_EXT_bindable_uniform #define GL_EXT_bindable_uniform 1 #define GL_MAX_VERTEX_BINDABLE_UNIFORMS_EXT 0x8DE2 #define GL_MAX_FRAGMENT_BINDABLE_UNIFORMS_EXT 0x8DE3 #define GL_MAX_GEOMETRY_BINDABLE_UNIFORMS_EXT 0x8DE4 #define GL_MAX_BINDABLE_UNIFORM_SIZE_EXT 0x8DED #define GL_UNIFORM_BUFFER_EXT 0x8DEE #define GL_UNIFORM_BUFFER_BINDING_EXT 0x8DEF typedef void (APIENTRYP PFNGLUNIFORMBUFFEREXTPROC) (GLuint program, GLint location, GLuint buffer); typedef GLint (APIENTRYP PFNGLGETUNIFORMBUFFERSIZEEXTPROC) (GLuint program, GLint location); typedef GLintptr (APIENTRYP PFNGLGETUNIFORMOFFSETEXTPROC) (GLuint program, GLint location); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glUniformBufferEXT (GLuint program, GLint location, GLuint buffer); GLAPI GLint APIENTRY glGetUniformBufferSizeEXT (GLuint program, GLint location); GLAPI GLintptr APIENTRY glGetUniformOffsetEXT (GLuint program, GLint location); #endif #endif /* GL_EXT_bindable_uniform */ #ifndef GL_EXT_blend_color #define GL_EXT_blend_color 1 #define GL_CONSTANT_COLOR_EXT 0x8001 #define GL_ONE_MINUS_CONSTANT_COLOR_EXT 0x8002 #define GL_CONSTANT_ALPHA_EXT 0x8003 #define GL_ONE_MINUS_CONSTANT_ALPHA_EXT 0x8004 #define GL_BLEND_COLOR_EXT 0x8005 typedef void (APIENTRYP PFNGLBLENDCOLOREXTPROC) (GLfloat red, GLfloat green, GLfloat blue, GLfloat alpha); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glBlendColorEXT (GLfloat red, GLfloat green, GLfloat blue, GLfloat alpha); #endif #endif /* GL_EXT_blend_color */ #ifndef GL_EXT_blend_equation_separate #define GL_EXT_blend_equation_separate 1 #define GL_BLEND_EQUATION_RGB_EXT 0x8009 #define GL_BLEND_EQUATION_ALPHA_EXT 0x883D typedef void (APIENTRYP PFNGLBLENDEQUATIONSEPARATEEXTPROC) (GLenum modeRGB, GLenum modeAlpha); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glBlendEquationSeparateEXT (GLenum modeRGB, GLenum modeAlpha); #endif #endif /* GL_EXT_blend_equation_separate */ #ifndef GL_EXT_blend_func_separate #define GL_EXT_blend_func_separate 1 #define GL_BLEND_DST_RGB_EXT 0x80C8 #define GL_BLEND_SRC_RGB_EXT 0x80C9 #define GL_BLEND_DST_ALPHA_EXT 0x80CA #define GL_BLEND_SRC_ALPHA_EXT 0x80CB typedef void (APIENTRYP PFNGLBLENDFUNCSEPARATEEXTPROC) (GLenum sfactorRGB, GLenum dfactorRGB, GLenum sfactorAlpha, GLenum dfactorAlpha); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glBlendFuncSeparateEXT (GLenum sfactorRGB, GLenum dfactorRGB, GLenum sfactorAlpha, GLenum dfactorAlpha); #endif #endif /* GL_EXT_blend_func_separate */ #ifndef GL_EXT_blend_logic_op #define GL_EXT_blend_logic_op 1 #endif /* GL_EXT_blend_logic_op */ #ifndef GL_EXT_blend_minmax #define GL_EXT_blend_minmax 1 #define GL_MIN_EXT 0x8007 #define GL_MAX_EXT 0x8008 #define GL_FUNC_ADD_EXT 0x8006 #define GL_BLEND_EQUATION_EXT 0x8009 typedef void (APIENTRYP PFNGLBLENDEQUATIONEXTPROC) (GLenum mode); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glBlendEquationEXT (GLenum mode); #endif #endif /* GL_EXT_blend_minmax */ #ifndef GL_EXT_blend_subtract #define GL_EXT_blend_subtract 1 #define GL_FUNC_SUBTRACT_EXT 0x800A #define GL_FUNC_REVERSE_SUBTRACT_EXT 0x800B #endif /* GL_EXT_blend_subtract */ #ifndef GL_EXT_clip_volume_hint #define GL_EXT_clip_volume_hint 1 #define GL_CLIP_VOLUME_CLIPPING_HINT_EXT 0x80F0 #endif /* GL_EXT_clip_volume_hint */ #ifndef GL_EXT_cmyka #define GL_EXT_cmyka 1 #define GL_CMYK_EXT 0x800C #define GL_CMYKA_EXT 0x800D #define GL_PACK_CMYK_HINT_EXT 0x800E #define GL_UNPACK_CMYK_HINT_EXT 0x800F #endif /* GL_EXT_cmyka */ #ifndef GL_EXT_color_subtable #define GL_EXT_color_subtable 1 typedef void (APIENTRYP PFNGLCOLORSUBTABLEEXTPROC) (GLenum target, GLsizei start, GLsizei count, GLenum format, GLenum type, const void *data); typedef void (APIENTRYP PFNGLCOPYCOLORSUBTABLEEXTPROC) (GLenum target, GLsizei start, GLint x, GLint y, GLsizei width); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glColorSubTableEXT (GLenum target, GLsizei start, GLsizei count, GLenum format, GLenum type, const void *data); GLAPI void APIENTRY glCopyColorSubTableEXT (GLenum target, GLsizei start, GLint x, GLint y, GLsizei width); #endif #endif /* GL_EXT_color_subtable */ #ifndef GL_EXT_compiled_vertex_array #define GL_EXT_compiled_vertex_array 1 #define GL_ARRAY_ELEMENT_LOCK_FIRST_EXT 0x81A8 #define GL_ARRAY_ELEMENT_LOCK_COUNT_EXT 0x81A9 typedef void (APIENTRYP PFNGLLOCKARRAYSEXTPROC) (GLint first, GLsizei count); typedef void (APIENTRYP PFNGLUNLOCKARRAYSEXTPROC) (void); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glLockArraysEXT (GLint first, GLsizei count); GLAPI void APIENTRY glUnlockArraysEXT (void); #endif #endif /* GL_EXT_compiled_vertex_array */ #ifndef GL_EXT_convolution #define GL_EXT_convolution 1 #define GL_CONVOLUTION_1D_EXT 0x8010 #define GL_CONVOLUTION_2D_EXT 0x8011 #define GL_SEPARABLE_2D_EXT 0x8012 #define GL_CONVOLUTION_BORDER_MODE_EXT 0x8013 #define GL_CONVOLUTION_FILTER_SCALE_EXT 0x8014 #define GL_CONVOLUTION_FILTER_BIAS_EXT 0x8015 #define GL_REDUCE_EXT 0x8016 #define GL_CONVOLUTION_FORMAT_EXT 0x8017 #define GL_CONVOLUTION_WIDTH_EXT 0x8018 #define GL_CONVOLUTION_HEIGHT_EXT 0x8019 #define GL_MAX_CONVOLUTION_WIDTH_EXT 0x801A #define GL_MAX_CONVOLUTION_HEIGHT_EXT 0x801B #define GL_POST_CONVOLUTION_RED_SCALE_EXT 0x801C #define GL_POST_CONVOLUTION_GREEN_SCALE_EXT 0x801D #define GL_POST_CONVOLUTION_BLUE_SCALE_EXT 0x801E #define GL_POST_CONVOLUTION_ALPHA_SCALE_EXT 0x801F #define GL_POST_CONVOLUTION_RED_BIAS_EXT 0x8020 #define GL_POST_CONVOLUTION_GREEN_BIAS_EXT 0x8021 #define GL_POST_CONVOLUTION_BLUE_BIAS_EXT 0x8022 #define GL_POST_CONVOLUTION_ALPHA_BIAS_EXT 0x8023 typedef void (APIENTRYP PFNGLCONVOLUTIONFILTER1DEXTPROC) (GLenum target, GLenum internalformat, GLsizei width, GLenum format, GLenum type, const void *image); typedef void (APIENTRYP PFNGLCONVOLUTIONFILTER2DEXTPROC) (GLenum target, GLenum internalformat, GLsizei width, GLsizei height, GLenum format, GLenum type, const void *image); typedef void (APIENTRYP PFNGLCONVOLUTIONPARAMETERFEXTPROC) (GLenum target, GLenum pname, GLfloat params); typedef void (APIENTRYP PFNGLCONVOLUTIONPARAMETERFVEXTPROC) (GLenum target, GLenum pname, const GLfloat *params); typedef void (APIENTRYP PFNGLCONVOLUTIONPARAMETERIEXTPROC) (GLenum target, GLenum pname, GLint params); typedef void (APIENTRYP PFNGLCONVOLUTIONPARAMETERIVEXTPROC) (GLenum target, GLenum pname, const GLint *params); typedef void (APIENTRYP PFNGLCOPYCONVOLUTIONFILTER1DEXTPROC) (GLenum target, GLenum internalformat, GLint x, GLint y, GLsizei width); typedef void (APIENTRYP PFNGLCOPYCONVOLUTIONFILTER2DEXTPROC) (GLenum target, GLenum internalformat, GLint x, GLint y, GLsizei width, GLsizei height); typedef void (APIENTRYP PFNGLGETCONVOLUTIONFILTEREXTPROC) (GLenum target, GLenum format, GLenum type, void *image); typedef void (APIENTRYP PFNGLGETCONVOLUTIONPARAMETERFVEXTPROC) (GLenum target, GLenum pname, GLfloat *params); typedef void (APIENTRYP PFNGLGETCONVOLUTIONPARAMETERIVEXTPROC) (GLenum target, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGETSEPARABLEFILTEREXTPROC) (GLenum target, GLenum format, GLenum type, void *row, void *column, void *span); typedef void (APIENTRYP PFNGLSEPARABLEFILTER2DEXTPROC) (GLenum target, GLenum internalformat, GLsizei width, GLsizei height, GLenum format, GLenum type, const void *row, const void *column); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glConvolutionFilter1DEXT (GLenum target, GLenum internalformat, GLsizei width, GLenum format, GLenum type, const void *image); GLAPI void APIENTRY glConvolutionFilter2DEXT (GLenum target, GLenum internalformat, GLsizei width, GLsizei height, GLenum format, GLenum type, const void *image); GLAPI void APIENTRY glConvolutionParameterfEXT (GLenum target, GLenum pname, GLfloat params); GLAPI void APIENTRY glConvolutionParameterfvEXT (GLenum target, GLenum pname, const GLfloat *params); GLAPI void APIENTRY glConvolutionParameteriEXT (GLenum target, GLenum pname, GLint params); GLAPI void APIENTRY glConvolutionParameterivEXT (GLenum target, GLenum pname, const GLint *params); GLAPI void APIENTRY glCopyConvolutionFilter1DEXT (GLenum target, GLenum internalformat, GLint x, GLint y, GLsizei width); GLAPI void APIENTRY glCopyConvolutionFilter2DEXT (GLenum target, GLenum internalformat, GLint x, GLint y, GLsizei width, GLsizei height); GLAPI void APIENTRY glGetConvolutionFilterEXT (GLenum target, GLenum format, GLenum type, void *image); GLAPI void APIENTRY glGetConvolutionParameterfvEXT (GLenum target, GLenum pname, GLfloat *params); GLAPI void APIENTRY glGetConvolutionParameterivEXT (GLenum target, GLenum pname, GLint *params); GLAPI void APIENTRY glGetSeparableFilterEXT (GLenum target, GLenum format, GLenum type, void *row, void *column, void *span); GLAPI void APIENTRY glSeparableFilter2DEXT (GLenum target, GLenum internalformat, GLsizei width, GLsizei height, GLenum format, GLenum type, const void *row, const void *column); #endif #endif /* GL_EXT_convolution */ #ifndef GL_EXT_coordinate_frame #define GL_EXT_coordinate_frame 1 #define GL_TANGENT_ARRAY_EXT 0x8439 #define GL_BINORMAL_ARRAY_EXT 0x843A #define GL_CURRENT_TANGENT_EXT 0x843B #define GL_CURRENT_BINORMAL_EXT 0x843C #define GL_TANGENT_ARRAY_TYPE_EXT 0x843E #define GL_TANGENT_ARRAY_STRIDE_EXT 0x843F #define GL_BINORMAL_ARRAY_TYPE_EXT 0x8440 #define GL_BINORMAL_ARRAY_STRIDE_EXT 0x8441 #define GL_TANGENT_ARRAY_POINTER_EXT 0x8442 #define GL_BINORMAL_ARRAY_POINTER_EXT 0x8443 #define GL_MAP1_TANGENT_EXT 0x8444 #define GL_MAP2_TANGENT_EXT 0x8445 #define GL_MAP1_BINORMAL_EXT 0x8446 #define GL_MAP2_BINORMAL_EXT 0x8447 typedef void (APIENTRYP PFNGLTANGENT3BEXTPROC) (GLbyte tx, GLbyte ty, GLbyte tz); typedef void (APIENTRYP PFNGLTANGENT3BVEXTPROC) (const GLbyte *v); typedef void (APIENTRYP PFNGLTANGENT3DEXTPROC) (GLdouble tx, GLdouble ty, GLdouble tz); typedef void (APIENTRYP PFNGLTANGENT3DVEXTPROC) (const GLdouble *v); typedef void (APIENTRYP PFNGLTANGENT3FEXTPROC) (GLfloat tx, GLfloat ty, GLfloat tz); typedef void (APIENTRYP PFNGLTANGENT3FVEXTPROC) (const GLfloat *v); typedef void (APIENTRYP PFNGLTANGENT3IEXTPROC) (GLint tx, GLint ty, GLint tz); typedef void (APIENTRYP PFNGLTANGENT3IVEXTPROC) (const GLint *v); typedef void (APIENTRYP PFNGLTANGENT3SEXTPROC) (GLshort tx, GLshort ty, GLshort tz); typedef void (APIENTRYP PFNGLTANGENT3SVEXTPROC) (const GLshort *v); typedef void (APIENTRYP PFNGLBINORMAL3BEXTPROC) (GLbyte bx, GLbyte by, GLbyte bz); typedef void (APIENTRYP PFNGLBINORMAL3BVEXTPROC) (const GLbyte *v); typedef void (APIENTRYP PFNGLBINORMAL3DEXTPROC) (GLdouble bx, GLdouble by, GLdouble bz); typedef void (APIENTRYP PFNGLBINORMAL3DVEXTPROC) (const GLdouble *v); typedef void (APIENTRYP PFNGLBINORMAL3FEXTPROC) (GLfloat bx, GLfloat by, GLfloat bz); typedef void (APIENTRYP PFNGLBINORMAL3FVEXTPROC) (const GLfloat *v); typedef void (APIENTRYP PFNGLBINORMAL3IEXTPROC) (GLint bx, GLint by, GLint bz); typedef void (APIENTRYP PFNGLBINORMAL3IVEXTPROC) (const GLint *v); typedef void (APIENTRYP PFNGLBINORMAL3SEXTPROC) (GLshort bx, GLshort by, GLshort bz); typedef void (APIENTRYP PFNGLBINORMAL3SVEXTPROC) (const GLshort *v); typedef void (APIENTRYP PFNGLTANGENTPOINTEREXTPROC) (GLenum type, GLsizei stride, const void *pointer); typedef void (APIENTRYP PFNGLBINORMALPOINTEREXTPROC) (GLenum type, GLsizei stride, const void *pointer); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glTangent3bEXT (GLbyte tx, GLbyte ty, GLbyte tz); GLAPI void APIENTRY glTangent3bvEXT (const GLbyte *v); GLAPI void APIENTRY glTangent3dEXT (GLdouble tx, GLdouble ty, GLdouble tz); GLAPI void APIENTRY glTangent3dvEXT (const GLdouble *v); GLAPI void APIENTRY glTangent3fEXT (GLfloat tx, GLfloat ty, GLfloat tz); GLAPI void APIENTRY glTangent3fvEXT (const GLfloat *v); GLAPI void APIENTRY glTangent3iEXT (GLint tx, GLint ty, GLint tz); GLAPI void APIENTRY glTangent3ivEXT (const GLint *v); GLAPI void APIENTRY glTangent3sEXT (GLshort tx, GLshort ty, GLshort tz); GLAPI void APIENTRY glTangent3svEXT (const GLshort *v); GLAPI void APIENTRY glBinormal3bEXT (GLbyte bx, GLbyte by, GLbyte bz); GLAPI void APIENTRY glBinormal3bvEXT (const GLbyte *v); GLAPI void APIENTRY glBinormal3dEXT (GLdouble bx, GLdouble by, GLdouble bz); GLAPI void APIENTRY glBinormal3dvEXT (const GLdouble *v); GLAPI void APIENTRY glBinormal3fEXT (GLfloat bx, GLfloat by, GLfloat bz); GLAPI void APIENTRY glBinormal3fvEXT (const GLfloat *v); GLAPI void APIENTRY glBinormal3iEXT (GLint bx, GLint by, GLint bz); GLAPI void APIENTRY glBinormal3ivEXT (const GLint *v); GLAPI void APIENTRY glBinormal3sEXT (GLshort bx, GLshort by, GLshort bz); GLAPI void APIENTRY glBinormal3svEXT (const GLshort *v); GLAPI void APIENTRY glTangentPointerEXT (GLenum type, GLsizei stride, const void *pointer); GLAPI void APIENTRY glBinormalPointerEXT (GLenum type, GLsizei stride, const void *pointer); #endif #endif /* GL_EXT_coordinate_frame */ #ifndef GL_EXT_copy_texture #define GL_EXT_copy_texture 1 typedef void (APIENTRYP PFNGLCOPYTEXIMAGE1DEXTPROC) (GLenum target, GLint level, GLenum internalformat, GLint x, GLint y, GLsizei width, GLint border); typedef void (APIENTRYP PFNGLCOPYTEXIMAGE2DEXTPROC) (GLenum target, GLint level, GLenum internalformat, GLint x, GLint y, GLsizei width, GLsizei height, GLint border); typedef void (APIENTRYP PFNGLCOPYTEXSUBIMAGE1DEXTPROC) (GLenum target, GLint level, GLint xoffset, GLint x, GLint y, GLsizei width); typedef void (APIENTRYP PFNGLCOPYTEXSUBIMAGE2DEXTPROC) (GLenum target, GLint level, GLint xoffset, GLint yoffset, GLint x, GLint y, GLsizei width, GLsizei height); typedef void (APIENTRYP PFNGLCOPYTEXSUBIMAGE3DEXTPROC) (GLenum target, GLint level, GLint xoffset, GLint yoffset, GLint zoffset, GLint x, GLint y, GLsizei width, GLsizei height); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glCopyTexImage1DEXT (GLenum target, GLint level, GLenum internalformat, GLint x, GLint y, GLsizei width, GLint border); GLAPI void APIENTRY glCopyTexImage2DEXT (GLenum target, GLint level, GLenum internalformat, GLint x, GLint y, GLsizei width, GLsizei height, GLint border); GLAPI void APIENTRY glCopyTexSubImage1DEXT (GLenum target, GLint level, GLint xoffset, GLint x, GLint y, GLsizei width); GLAPI void APIENTRY glCopyTexSubImage2DEXT (GLenum target, GLint level, GLint xoffset, GLint yoffset, GLint x, GLint y, GLsizei width, GLsizei height); GLAPI void APIENTRY glCopyTexSubImage3DEXT (GLenum target, GLint level, GLint xoffset, GLint yoffset, GLint zoffset, GLint x, GLint y, GLsizei width, GLsizei height); #endif #endif /* GL_EXT_copy_texture */ #ifndef GL_EXT_cull_vertex #define GL_EXT_cull_vertex 1 #define GL_CULL_VERTEX_EXT 0x81AA #define GL_CULL_VERTEX_EYE_POSITION_EXT 0x81AB #define GL_CULL_VERTEX_OBJECT_POSITION_EXT 0x81AC typedef void (APIENTRYP PFNGLCULLPARAMETERDVEXTPROC) (GLenum pname, GLdouble *params); typedef void (APIENTRYP PFNGLCULLPARAMETERFVEXTPROC) (GLenum pname, GLfloat *params); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glCullParameterdvEXT (GLenum pname, GLdouble *params); GLAPI void APIENTRY glCullParameterfvEXT (GLenum pname, GLfloat *params); #endif #endif /* GL_EXT_cull_vertex */ #ifndef GL_EXT_debug_label #define GL_EXT_debug_label 1 #define GL_PROGRAM_PIPELINE_OBJECT_EXT 0x8A4F #define GL_PROGRAM_OBJECT_EXT 0x8B40 #define GL_SHADER_OBJECT_EXT 0x8B48 #define GL_BUFFER_OBJECT_EXT 0x9151 #define GL_QUERY_OBJECT_EXT 0x9153 #define GL_VERTEX_ARRAY_OBJECT_EXT 0x9154 typedef void (APIENTRYP PFNGLLABELOBJECTEXTPROC) (GLenum type, GLuint object, GLsizei length, const GLchar *label); typedef void (APIENTRYP PFNGLGETOBJECTLABELEXTPROC) (GLenum type, GLuint object, GLsizei bufSize, GLsizei *length, GLchar *label); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glLabelObjectEXT (GLenum type, GLuint object, GLsizei length, const GLchar *label); GLAPI void APIENTRY glGetObjectLabelEXT (GLenum type, GLuint object, GLsizei bufSize, GLsizei *length, GLchar *label); #endif #endif /* GL_EXT_debug_label */ #ifndef GL_EXT_debug_marker #define GL_EXT_debug_marker 1 typedef void (APIENTRYP PFNGLINSERTEVENTMARKEREXTPROC) (GLsizei length, const GLchar *marker); typedef void (APIENTRYP PFNGLPUSHGROUPMARKEREXTPROC) (GLsizei length, const GLchar *marker); typedef void (APIENTRYP PFNGLPOPGROUPMARKEREXTPROC) (void); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glInsertEventMarkerEXT (GLsizei length, const GLchar *marker); GLAPI void APIENTRY glPushGroupMarkerEXT (GLsizei length, const GLchar *marker); GLAPI void APIENTRY glPopGroupMarkerEXT (void); #endif #endif /* GL_EXT_debug_marker */ #ifndef GL_EXT_depth_bounds_test #define GL_EXT_depth_bounds_test 1 #define GL_DEPTH_BOUNDS_TEST_EXT 0x8890 #define GL_DEPTH_BOUNDS_EXT 0x8891 typedef void (APIENTRYP PFNGLDEPTHBOUNDSEXTPROC) (GLclampd zmin, GLclampd zmax); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glDepthBoundsEXT (GLclampd zmin, GLclampd zmax); #endif #endif /* GL_EXT_depth_bounds_test */ #ifndef GL_EXT_direct_state_access #define GL_EXT_direct_state_access 1 #define GL_PROGRAM_MATRIX_EXT 0x8E2D #define GL_TRANSPOSE_PROGRAM_MATRIX_EXT 0x8E2E #define GL_PROGRAM_MATRIX_STACK_DEPTH_EXT 0x8E2F typedef void (APIENTRYP PFNGLMATRIXLOADFEXTPROC) (GLenum mode, const GLfloat *m); typedef void (APIENTRYP PFNGLMATRIXLOADDEXTPROC) (GLenum mode, const GLdouble *m); typedef void (APIENTRYP PFNGLMATRIXMULTFEXTPROC) (GLenum mode, const GLfloat *m); typedef void (APIENTRYP PFNGLMATRIXMULTDEXTPROC) (GLenum mode, const GLdouble *m); typedef void (APIENTRYP PFNGLMATRIXLOADIDENTITYEXTPROC) (GLenum mode); typedef void (APIENTRYP PFNGLMATRIXROTATEFEXTPROC) (GLenum mode, GLfloat angle, GLfloat x, GLfloat y, GLfloat z); typedef void (APIENTRYP PFNGLMATRIXROTATEDEXTPROC) (GLenum mode, GLdouble angle, GLdouble x, GLdouble y, GLdouble z); typedef void (APIENTRYP PFNGLMATRIXSCALEFEXTPROC) (GLenum mode, GLfloat x, GLfloat y, GLfloat z); typedef void (APIENTRYP PFNGLMATRIXSCALEDEXTPROC) (GLenum mode, GLdouble x, GLdouble y, GLdouble z); typedef void (APIENTRYP PFNGLMATRIXTRANSLATEFEXTPROC) (GLenum mode, GLfloat x, GLfloat y, GLfloat z); typedef void (APIENTRYP PFNGLMATRIXTRANSLATEDEXTPROC) (GLenum mode, GLdouble x, GLdouble y, GLdouble z); typedef void (APIENTRYP PFNGLMATRIXFRUSTUMEXTPROC) (GLenum mode, GLdouble left, GLdouble right, GLdouble bottom, GLdouble top, GLdouble zNear, GLdouble zFar); typedef void (APIENTRYP PFNGLMATRIXORTHOEXTPROC) (GLenum mode, GLdouble left, GLdouble right, GLdouble bottom, GLdouble top, GLdouble zNear, GLdouble zFar); typedef void (APIENTRYP PFNGLMATRIXPOPEXTPROC) (GLenum mode); typedef void (APIENTRYP PFNGLMATRIXPUSHEXTPROC) (GLenum mode); typedef void (APIENTRYP PFNGLCLIENTATTRIBDEFAULTEXTPROC) (GLbitfield mask); typedef void (APIENTRYP PFNGLPUSHCLIENTATTRIBDEFAULTEXTPROC) (GLbitfield mask); typedef void (APIENTRYP PFNGLTEXTUREPARAMETERFEXTPROC) (GLuint texture, GLenum target, GLenum pname, GLfloat param); typedef void (APIENTRYP PFNGLTEXTUREPARAMETERFVEXTPROC) (GLuint texture, GLenum target, GLenum pname, const GLfloat *params); typedef void (APIENTRYP PFNGLTEXTUREPARAMETERIEXTPROC) (GLuint texture, GLenum target, GLenum pname, GLint param); typedef void (APIENTRYP PFNGLTEXTUREPARAMETERIVEXTPROC) (GLuint texture, GLenum target, GLenum pname, const GLint *params); typedef void (APIENTRYP PFNGLTEXTUREIMAGE1DEXTPROC) (GLuint texture, GLenum target, GLint level, GLint internalformat, GLsizei width, GLint border, GLenum format, GLenum type, const void *pixels); typedef void (APIENTRYP PFNGLTEXTUREIMAGE2DEXTPROC) (GLuint texture, GLenum target, GLint level, GLint internalformat, GLsizei width, GLsizei height, GLint border, GLenum format, GLenum type, const void *pixels); typedef void (APIENTRYP PFNGLTEXTURESUBIMAGE1DEXTPROC) (GLuint texture, GLenum target, GLint level, GLint xoffset, GLsizei width, GLenum format, GLenum type, const void *pixels); typedef void (APIENTRYP PFNGLTEXTURESUBIMAGE2DEXTPROC) (GLuint texture, GLenum target, GLint level, GLint xoffset, GLint yoffset, GLsizei width, GLsizei height, GLenum format, GLenum type, const void *pixels); typedef void (APIENTRYP PFNGLCOPYTEXTUREIMAGE1DEXTPROC) (GLuint texture, GLenum target, GLint level, GLenum internalformat, GLint x, GLint y, GLsizei width, GLint border); typedef void (APIENTRYP PFNGLCOPYTEXTUREIMAGE2DEXTPROC) (GLuint texture, GLenum target, GLint level, GLenum internalformat, GLint x, GLint y, GLsizei width, GLsizei height, GLint border); typedef void (APIENTRYP PFNGLCOPYTEXTURESUBIMAGE1DEXTPROC) (GLuint texture, GLenum target, GLint level, GLint xoffset, GLint x, GLint y, GLsizei width); typedef void (APIENTRYP PFNGLCOPYTEXTURESUBIMAGE2DEXTPROC) (GLuint texture, GLenum target, GLint level, GLint xoffset, GLint yoffset, GLint x, GLint y, GLsizei width, GLsizei height); typedef void (APIENTRYP PFNGLGETTEXTUREIMAGEEXTPROC) (GLuint texture, GLenum target, GLint level, GLenum format, GLenum type, void *pixels); typedef void (APIENTRYP PFNGLGETTEXTUREPARAMETERFVEXTPROC) (GLuint texture, GLenum target, GLenum pname, GLfloat *params); typedef void (APIENTRYP PFNGLGETTEXTUREPARAMETERIVEXTPROC) (GLuint texture, GLenum target, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGETTEXTURELEVELPARAMETERFVEXTPROC) (GLuint texture, GLenum target, GLint level, GLenum pname, GLfloat *params); typedef void (APIENTRYP PFNGLGETTEXTURELEVELPARAMETERIVEXTPROC) (GLuint texture, GLenum target, GLint level, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLTEXTUREIMAGE3DEXTPROC) (GLuint texture, GLenum target, GLint level, GLint internalformat, GLsizei width, GLsizei height, GLsizei depth, GLint border, GLenum format, GLenum type, const void *pixels); typedef void (APIENTRYP PFNGLTEXTURESUBIMAGE3DEXTPROC) (GLuint texture, GLenum target, GLint level, GLint xoffset, GLint yoffset, GLint zoffset, GLsizei width, GLsizei height, GLsizei depth, GLenum format, GLenum type, const void *pixels); typedef void (APIENTRYP PFNGLCOPYTEXTURESUBIMAGE3DEXTPROC) (GLuint texture, GLenum target, GLint level, GLint xoffset, GLint yoffset, GLint zoffset, GLint x, GLint y, GLsizei width, GLsizei height); typedef void (APIENTRYP PFNGLBINDMULTITEXTUREEXTPROC) (GLenum texunit, GLenum target, GLuint texture); typedef void (APIENTRYP PFNGLMULTITEXCOORDPOINTEREXTPROC) (GLenum texunit, GLint size, GLenum type, GLsizei stride, const void *pointer); typedef void (APIENTRYP PFNGLMULTITEXENVFEXTPROC) (GLenum texunit, GLenum target, GLenum pname, GLfloat param); typedef void (APIENTRYP PFNGLMULTITEXENVFVEXTPROC) (GLenum texunit, GLenum target, GLenum pname, const GLfloat *params); typedef void (APIENTRYP PFNGLMULTITEXENVIEXTPROC) (GLenum texunit, GLenum target, GLenum pname, GLint param); typedef void (APIENTRYP PFNGLMULTITEXENVIVEXTPROC) (GLenum texunit, GLenum target, GLenum pname, const GLint *params); typedef void (APIENTRYP PFNGLMULTITEXGENDEXTPROC) (GLenum texunit, GLenum coord, GLenum pname, GLdouble param); typedef void (APIENTRYP PFNGLMULTITEXGENDVEXTPROC) (GLenum texunit, GLenum coord, GLenum pname, const GLdouble *params); typedef void (APIENTRYP PFNGLMULTITEXGENFEXTPROC) (GLenum texunit, GLenum coord, GLenum pname, GLfloat param); typedef void (APIENTRYP PFNGLMULTITEXGENFVEXTPROC) (GLenum texunit, GLenum coord, GLenum pname, const GLfloat *params); typedef void (APIENTRYP PFNGLMULTITEXGENIEXTPROC) (GLenum texunit, GLenum coord, GLenum pname, GLint param); typedef void (APIENTRYP PFNGLMULTITEXGENIVEXTPROC) (GLenum texunit, GLenum coord, GLenum pname, const GLint *params); typedef void (APIENTRYP PFNGLGETMULTITEXENVFVEXTPROC) (GLenum texunit, GLenum target, GLenum pname, GLfloat *params); typedef void (APIENTRYP PFNGLGETMULTITEXENVIVEXTPROC) (GLenum texunit, GLenum target, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGETMULTITEXGENDVEXTPROC) (GLenum texunit, GLenum coord, GLenum pname, GLdouble *params); typedef void (APIENTRYP PFNGLGETMULTITEXGENFVEXTPROC) (GLenum texunit, GLenum coord, GLenum pname, GLfloat *params); typedef void (APIENTRYP PFNGLGETMULTITEXGENIVEXTPROC) (GLenum texunit, GLenum coord, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLMULTITEXPARAMETERIEXTPROC) (GLenum texunit, GLenum target, GLenum pname, GLint param); typedef void (APIENTRYP PFNGLMULTITEXPARAMETERIVEXTPROC) (GLenum texunit, GLenum target, GLenum pname, const GLint *params); typedef void (APIENTRYP PFNGLMULTITEXPARAMETERFEXTPROC) (GLenum texunit, GLenum target, GLenum pname, GLfloat param); typedef void (APIENTRYP PFNGLMULTITEXPARAMETERFVEXTPROC) (GLenum texunit, GLenum target, GLenum pname, const GLfloat *params); typedef void (APIENTRYP PFNGLMULTITEXIMAGE1DEXTPROC) (GLenum texunit, GLenum target, GLint level, GLint internalformat, GLsizei width, GLint border, GLenum format, GLenum type, const void *pixels); typedef void (APIENTRYP PFNGLMULTITEXIMAGE2DEXTPROC) (GLenum texunit, GLenum target, GLint level, GLint internalformat, GLsizei width, GLsizei height, GLint border, GLenum format, GLenum type, const void *pixels); typedef void (APIENTRYP PFNGLMULTITEXSUBIMAGE1DEXTPROC) (GLenum texunit, GLenum target, GLint level, GLint xoffset, GLsizei width, GLenum format, GLenum type, const void *pixels); typedef void (APIENTRYP PFNGLMULTITEXSUBIMAGE2DEXTPROC) (GLenum texunit, GLenum target, GLint level, GLint xoffset, GLint yoffset, GLsizei width, GLsizei height, GLenum format, GLenum type, const void *pixels); typedef void (APIENTRYP PFNGLCOPYMULTITEXIMAGE1DEXTPROC) (GLenum texunit, GLenum target, GLint level, GLenum internalformat, GLint x, GLint y, GLsizei width, GLint border); typedef void (APIENTRYP PFNGLCOPYMULTITEXIMAGE2DEXTPROC) (GLenum texunit, GLenum target, GLint level, GLenum internalformat, GLint x, GLint y, GLsizei width, GLsizei height, GLint border); typedef void (APIENTRYP PFNGLCOPYMULTITEXSUBIMAGE1DEXTPROC) (GLenum texunit, GLenum target, GLint level, GLint xoffset, GLint x, GLint y, GLsizei width); typedef void (APIENTRYP PFNGLCOPYMULTITEXSUBIMAGE2DEXTPROC) (GLenum texunit, GLenum target, GLint level, GLint xoffset, GLint yoffset, GLint x, GLint y, GLsizei width, GLsizei height); typedef void (APIENTRYP PFNGLGETMULTITEXIMAGEEXTPROC) (GLenum texunit, GLenum target, GLint level, GLenum format, GLenum type, void *pixels); typedef void (APIENTRYP PFNGLGETMULTITEXPARAMETERFVEXTPROC) (GLenum texunit, GLenum target, GLenum pname, GLfloat *params); typedef void (APIENTRYP PFNGLGETMULTITEXPARAMETERIVEXTPROC) (GLenum texunit, GLenum target, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGETMULTITEXLEVELPARAMETERFVEXTPROC) (GLenum texunit, GLenum target, GLint level, GLenum pname, GLfloat *params); typedef void (APIENTRYP PFNGLGETMULTITEXLEVELPARAMETERIVEXTPROC) (GLenum texunit, GLenum target, GLint level, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLMULTITEXIMAGE3DEXTPROC) (GLenum texunit, GLenum target, GLint level, GLint internalformat, GLsizei width, GLsizei height, GLsizei depth, GLint border, GLenum format, GLenum type, const void *pixels); typedef void (APIENTRYP PFNGLMULTITEXSUBIMAGE3DEXTPROC) (GLenum texunit, GLenum target, GLint level, GLint xoffset, GLint yoffset, GLint zoffset, GLsizei width, GLsizei height, GLsizei depth, GLenum format, GLenum type, const void *pixels); typedef void (APIENTRYP PFNGLCOPYMULTITEXSUBIMAGE3DEXTPROC) (GLenum texunit, GLenum target, GLint level, GLint xoffset, GLint yoffset, GLint zoffset, GLint x, GLint y, GLsizei width, GLsizei height); typedef void (APIENTRYP PFNGLENABLECLIENTSTATEINDEXEDEXTPROC) (GLenum array, GLuint index); typedef void (APIENTRYP PFNGLDISABLECLIENTSTATEINDEXEDEXTPROC) (GLenum array, GLuint index); typedef void (APIENTRYP PFNGLGETFLOATINDEXEDVEXTPROC) (GLenum target, GLuint index, GLfloat *data); typedef void (APIENTRYP PFNGLGETDOUBLEINDEXEDVEXTPROC) (GLenum target, GLuint index, GLdouble *data); typedef void (APIENTRYP PFNGLGETPOINTERINDEXEDVEXTPROC) (GLenum target, GLuint index, void **data); typedef void (APIENTRYP PFNGLENABLEINDEXEDEXTPROC) (GLenum target, GLuint index); typedef void (APIENTRYP PFNGLDISABLEINDEXEDEXTPROC) (GLenum target, GLuint index); typedef GLboolean (APIENTRYP PFNGLISENABLEDINDEXEDEXTPROC) (GLenum target, GLuint index); typedef void (APIENTRYP PFNGLGETINTEGERINDEXEDVEXTPROC) (GLenum target, GLuint index, GLint *data); typedef void (APIENTRYP PFNGLGETBOOLEANINDEXEDVEXTPROC) (GLenum target, GLuint index, GLboolean *data); typedef void (APIENTRYP PFNGLCOMPRESSEDTEXTUREIMAGE3DEXTPROC) (GLuint texture, GLenum target, GLint level, GLenum internalformat, GLsizei width, GLsizei height, GLsizei depth, GLint border, GLsizei imageSize, const void *bits); typedef void (APIENTRYP PFNGLCOMPRESSEDTEXTUREIMAGE2DEXTPROC) (GLuint texture, GLenum target, GLint level, GLenum internalformat, GLsizei width, GLsizei height, GLint border, GLsizei imageSize, const void *bits); typedef void (APIENTRYP PFNGLCOMPRESSEDTEXTUREIMAGE1DEXTPROC) (GLuint texture, GLenum target, GLint level, GLenum internalformat, GLsizei width, GLint border, GLsizei imageSize, const void *bits); typedef void (APIENTRYP PFNGLCOMPRESSEDTEXTURESUBIMAGE3DEXTPROC) (GLuint texture, GLenum target, GLint level, GLint xoffset, GLint yoffset, GLint zoffset, GLsizei width, GLsizei height, GLsizei depth, GLenum format, GLsizei imageSize, const void *bits); typedef void (APIENTRYP PFNGLCOMPRESSEDTEXTURESUBIMAGE2DEXTPROC) (GLuint texture, GLenum target, GLint level, GLint xoffset, GLint yoffset, GLsizei width, GLsizei height, GLenum format, GLsizei imageSize, const void *bits); typedef void (APIENTRYP PFNGLCOMPRESSEDTEXTURESUBIMAGE1DEXTPROC) (GLuint texture, GLenum target, GLint level, GLint xoffset, GLsizei width, GLenum format, GLsizei imageSize, const void *bits); typedef void (APIENTRYP PFNGLGETCOMPRESSEDTEXTUREIMAGEEXTPROC) (GLuint texture, GLenum target, GLint lod, void *img); typedef void (APIENTRYP PFNGLCOMPRESSEDMULTITEXIMAGE3DEXTPROC) (GLenum texunit, GLenum target, GLint level, GLenum internalformat, GLsizei width, GLsizei height, GLsizei depth, GLint border, GLsizei imageSize, const void *bits); typedef void (APIENTRYP PFNGLCOMPRESSEDMULTITEXIMAGE2DEXTPROC) (GLenum texunit, GLenum target, GLint level, GLenum internalformat, GLsizei width, GLsizei height, GLint border, GLsizei imageSize, const void *bits); typedef void (APIENTRYP PFNGLCOMPRESSEDMULTITEXIMAGE1DEXTPROC) (GLenum texunit, GLenum target, GLint level, GLenum internalformat, GLsizei width, GLint border, GLsizei imageSize, const void *bits); typedef void (APIENTRYP PFNGLCOMPRESSEDMULTITEXSUBIMAGE3DEXTPROC) (GLenum texunit, GLenum target, GLint level, GLint xoffset, GLint yoffset, GLint zoffset, GLsizei width, GLsizei height, GLsizei depth, GLenum format, GLsizei imageSize, const void *bits); typedef void (APIENTRYP PFNGLCOMPRESSEDMULTITEXSUBIMAGE2DEXTPROC) (GLenum texunit, GLenum target, GLint level, GLint xoffset, GLint yoffset, GLsizei width, GLsizei height, GLenum format, GLsizei imageSize, const void *bits); typedef void (APIENTRYP PFNGLCOMPRESSEDMULTITEXSUBIMAGE1DEXTPROC) (GLenum texunit, GLenum target, GLint level, GLint xoffset, GLsizei width, GLenum format, GLsizei imageSize, const void *bits); typedef void (APIENTRYP PFNGLGETCOMPRESSEDMULTITEXIMAGEEXTPROC) (GLenum texunit, GLenum target, GLint lod, void *img); typedef void (APIENTRYP PFNGLMATRIXLOADTRANSPOSEFEXTPROC) (GLenum mode, const GLfloat *m); typedef void (APIENTRYP PFNGLMATRIXLOADTRANSPOSEDEXTPROC) (GLenum mode, const GLdouble *m); typedef void (APIENTRYP PFNGLMATRIXMULTTRANSPOSEFEXTPROC) (GLenum mode, const GLfloat *m); typedef void (APIENTRYP PFNGLMATRIXMULTTRANSPOSEDEXTPROC) (GLenum mode, const GLdouble *m); typedef void (APIENTRYP PFNGLNAMEDBUFFERDATAEXTPROC) (GLuint buffer, GLsizeiptr size, const void *data, GLenum usage); typedef void (APIENTRYP PFNGLNAMEDBUFFERSUBDATAEXTPROC) (GLuint buffer, GLintptr offset, GLsizeiptr size, const void *data); typedef void *(APIENTRYP PFNGLMAPNAMEDBUFFEREXTPROC) (GLuint buffer, GLenum access); typedef GLboolean (APIENTRYP PFNGLUNMAPNAMEDBUFFEREXTPROC) (GLuint buffer); typedef void (APIENTRYP PFNGLGETNAMEDBUFFERPARAMETERIVEXTPROC) (GLuint buffer, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGETNAMEDBUFFERPOINTERVEXTPROC) (GLuint buffer, GLenum pname, void **params); typedef void (APIENTRYP PFNGLGETNAMEDBUFFERSUBDATAEXTPROC) (GLuint buffer, GLintptr offset, GLsizeiptr size, void *data); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM1FEXTPROC) (GLuint program, GLint location, GLfloat v0); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM2FEXTPROC) (GLuint program, GLint location, GLfloat v0, GLfloat v1); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM3FEXTPROC) (GLuint program, GLint location, GLfloat v0, GLfloat v1, GLfloat v2); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM4FEXTPROC) (GLuint program, GLint location, GLfloat v0, GLfloat v1, GLfloat v2, GLfloat v3); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM1IEXTPROC) (GLuint program, GLint location, GLint v0); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM2IEXTPROC) (GLuint program, GLint location, GLint v0, GLint v1); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM3IEXTPROC) (GLuint program, GLint location, GLint v0, GLint v1, GLint v2); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM4IEXTPROC) (GLuint program, GLint location, GLint v0, GLint v1, GLint v2, GLint v3); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM1FVEXTPROC) (GLuint program, GLint location, GLsizei count, const GLfloat *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM2FVEXTPROC) (GLuint program, GLint location, GLsizei count, const GLfloat *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM3FVEXTPROC) (GLuint program, GLint location, GLsizei count, const GLfloat *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM4FVEXTPROC) (GLuint program, GLint location, GLsizei count, const GLfloat *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM1IVEXTPROC) (GLuint program, GLint location, GLsizei count, const GLint *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM2IVEXTPROC) (GLuint program, GLint location, GLsizei count, const GLint *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM3IVEXTPROC) (GLuint program, GLint location, GLsizei count, const GLint *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM4IVEXTPROC) (GLuint program, GLint location, GLsizei count, const GLint *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORMMATRIX2FVEXTPROC) (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORMMATRIX3FVEXTPROC) (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORMMATRIX4FVEXTPROC) (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORMMATRIX2X3FVEXTPROC) (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORMMATRIX3X2FVEXTPROC) (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORMMATRIX2X4FVEXTPROC) (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORMMATRIX4X2FVEXTPROC) (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORMMATRIX3X4FVEXTPROC) (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORMMATRIX4X3FVEXTPROC) (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); typedef void (APIENTRYP PFNGLTEXTUREBUFFEREXTPROC) (GLuint texture, GLenum target, GLenum internalformat, GLuint buffer); typedef void (APIENTRYP PFNGLMULTITEXBUFFEREXTPROC) (GLenum texunit, GLenum target, GLenum internalformat, GLuint buffer); typedef void (APIENTRYP PFNGLTEXTUREPARAMETERIIVEXTPROC) (GLuint texture, GLenum target, GLenum pname, const GLint *params); typedef void (APIENTRYP PFNGLTEXTUREPARAMETERIUIVEXTPROC) (GLuint texture, GLenum target, GLenum pname, const GLuint *params); typedef void (APIENTRYP PFNGLGETTEXTUREPARAMETERIIVEXTPROC) (GLuint texture, GLenum target, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGETTEXTUREPARAMETERIUIVEXTPROC) (GLuint texture, GLenum target, GLenum pname, GLuint *params); typedef void (APIENTRYP PFNGLMULTITEXPARAMETERIIVEXTPROC) (GLenum texunit, GLenum target, GLenum pname, const GLint *params); typedef void (APIENTRYP PFNGLMULTITEXPARAMETERIUIVEXTPROC) (GLenum texunit, GLenum target, GLenum pname, const GLuint *params); typedef void (APIENTRYP PFNGLGETMULTITEXPARAMETERIIVEXTPROC) (GLenum texunit, GLenum target, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGETMULTITEXPARAMETERIUIVEXTPROC) (GLenum texunit, GLenum target, GLenum pname, GLuint *params); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM1UIEXTPROC) (GLuint program, GLint location, GLuint v0); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM2UIEXTPROC) (GLuint program, GLint location, GLuint v0, GLuint v1); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM3UIEXTPROC) (GLuint program, GLint location, GLuint v0, GLuint v1, GLuint v2); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM4UIEXTPROC) (GLuint program, GLint location, GLuint v0, GLuint v1, GLuint v2, GLuint v3); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM1UIVEXTPROC) (GLuint program, GLint location, GLsizei count, const GLuint *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM2UIVEXTPROC) (GLuint program, GLint location, GLsizei count, const GLuint *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM3UIVEXTPROC) (GLuint program, GLint location, GLsizei count, const GLuint *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM4UIVEXTPROC) (GLuint program, GLint location, GLsizei count, const GLuint *value); typedef void (APIENTRYP PFNGLNAMEDPROGRAMLOCALPARAMETERS4FVEXTPROC) (GLuint program, GLenum target, GLuint index, GLsizei count, const GLfloat *params); typedef void (APIENTRYP PFNGLNAMEDPROGRAMLOCALPARAMETERI4IEXTPROC) (GLuint program, GLenum target, GLuint index, GLint x, GLint y, GLint z, GLint w); typedef void (APIENTRYP PFNGLNAMEDPROGRAMLOCALPARAMETERI4IVEXTPROC) (GLuint program, GLenum target, GLuint index, const GLint *params); typedef void (APIENTRYP PFNGLNAMEDPROGRAMLOCALPARAMETERSI4IVEXTPROC) (GLuint program, GLenum target, GLuint index, GLsizei count, const GLint *params); typedef void (APIENTRYP PFNGLNAMEDPROGRAMLOCALPARAMETERI4UIEXTPROC) (GLuint program, GLenum target, GLuint index, GLuint x, GLuint y, GLuint z, GLuint w); typedef void (APIENTRYP PFNGLNAMEDPROGRAMLOCALPARAMETERI4UIVEXTPROC) (GLuint program, GLenum target, GLuint index, const GLuint *params); typedef void (APIENTRYP PFNGLNAMEDPROGRAMLOCALPARAMETERSI4UIVEXTPROC) (GLuint program, GLenum target, GLuint index, GLsizei count, const GLuint *params); typedef void (APIENTRYP PFNGLGETNAMEDPROGRAMLOCALPARAMETERIIVEXTPROC) (GLuint program, GLenum target, GLuint index, GLint *params); typedef void (APIENTRYP PFNGLGETNAMEDPROGRAMLOCALPARAMETERIUIVEXTPROC) (GLuint program, GLenum target, GLuint index, GLuint *params); typedef void (APIENTRYP PFNGLENABLECLIENTSTATEIEXTPROC) (GLenum array, GLuint index); typedef void (APIENTRYP PFNGLDISABLECLIENTSTATEIEXTPROC) (GLenum array, GLuint index); typedef void (APIENTRYP PFNGLGETFLOATI_VEXTPROC) (GLenum pname, GLuint index, GLfloat *params); typedef void (APIENTRYP PFNGLGETDOUBLEI_VEXTPROC) (GLenum pname, GLuint index, GLdouble *params); typedef void (APIENTRYP PFNGLGETPOINTERI_VEXTPROC) (GLenum pname, GLuint index, void **params); typedef void (APIENTRYP PFNGLNAMEDPROGRAMSTRINGEXTPROC) (GLuint program, GLenum target, GLenum format, GLsizei len, const void *string); typedef void (APIENTRYP PFNGLNAMEDPROGRAMLOCALPARAMETER4DEXTPROC) (GLuint program, GLenum target, GLuint index, GLdouble x, GLdouble y, GLdouble z, GLdouble w); typedef void (APIENTRYP PFNGLNAMEDPROGRAMLOCALPARAMETER4DVEXTPROC) (GLuint program, GLenum target, GLuint index, const GLdouble *params); typedef void (APIENTRYP PFNGLNAMEDPROGRAMLOCALPARAMETER4FEXTPROC) (GLuint program, GLenum target, GLuint index, GLfloat x, GLfloat y, GLfloat z, GLfloat w); typedef void (APIENTRYP PFNGLNAMEDPROGRAMLOCALPARAMETER4FVEXTPROC) (GLuint program, GLenum target, GLuint index, const GLfloat *params); typedef void (APIENTRYP PFNGLGETNAMEDPROGRAMLOCALPARAMETERDVEXTPROC) (GLuint program, GLenum target, GLuint index, GLdouble *params); typedef void (APIENTRYP PFNGLGETNAMEDPROGRAMLOCALPARAMETERFVEXTPROC) (GLuint program, GLenum target, GLuint index, GLfloat *params); typedef void (APIENTRYP PFNGLGETNAMEDPROGRAMIVEXTPROC) (GLuint program, GLenum target, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGETNAMEDPROGRAMSTRINGEXTPROC) (GLuint program, GLenum target, GLenum pname, void *string); typedef void (APIENTRYP PFNGLNAMEDRENDERBUFFERSTORAGEEXTPROC) (GLuint renderbuffer, GLenum internalformat, GLsizei width, GLsizei height); typedef void (APIENTRYP PFNGLGETNAMEDRENDERBUFFERPARAMETERIVEXTPROC) (GLuint renderbuffer, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLNAMEDRENDERBUFFERSTORAGEMULTISAMPLEEXTPROC) (GLuint renderbuffer, GLsizei samples, GLenum internalformat, GLsizei width, GLsizei height); typedef void (APIENTRYP PFNGLNAMEDRENDERBUFFERSTORAGEMULTISAMPLECOVERAGEEXTPROC) (GLuint renderbuffer, GLsizei coverageSamples, GLsizei colorSamples, GLenum internalformat, GLsizei width, GLsizei height); typedef GLenum (APIENTRYP PFNGLCHECKNAMEDFRAMEBUFFERSTATUSEXTPROC) (GLuint framebuffer, GLenum target); typedef void (APIENTRYP PFNGLNAMEDFRAMEBUFFERTEXTURE1DEXTPROC) (GLuint framebuffer, GLenum attachment, GLenum textarget, GLuint texture, GLint level); typedef void (APIENTRYP PFNGLNAMEDFRAMEBUFFERTEXTURE2DEXTPROC) (GLuint framebuffer, GLenum attachment, GLenum textarget, GLuint texture, GLint level); typedef void (APIENTRYP PFNGLNAMEDFRAMEBUFFERTEXTURE3DEXTPROC) (GLuint framebuffer, GLenum attachment, GLenum textarget, GLuint texture, GLint level, GLint zoffset); typedef void (APIENTRYP PFNGLNAMEDFRAMEBUFFERRENDERBUFFEREXTPROC) (GLuint framebuffer, GLenum attachment, GLenum renderbuffertarget, GLuint renderbuffer); typedef void (APIENTRYP PFNGLGETNAMEDFRAMEBUFFERATTACHMENTPARAMETERIVEXTPROC) (GLuint framebuffer, GLenum attachment, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGENERATETEXTUREMIPMAPEXTPROC) (GLuint texture, GLenum target); typedef void (APIENTRYP PFNGLGENERATEMULTITEXMIPMAPEXTPROC) (GLenum texunit, GLenum target); typedef void (APIENTRYP PFNGLFRAMEBUFFERDRAWBUFFEREXTPROC) (GLuint framebuffer, GLenum mode); typedef void (APIENTRYP PFNGLFRAMEBUFFERDRAWBUFFERSEXTPROC) (GLuint framebuffer, GLsizei n, const GLenum *bufs); typedef void (APIENTRYP PFNGLFRAMEBUFFERREADBUFFEREXTPROC) (GLuint framebuffer, GLenum mode); typedef void (APIENTRYP PFNGLGETFRAMEBUFFERPARAMETERIVEXTPROC) (GLuint framebuffer, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLNAMEDCOPYBUFFERSUBDATAEXTPROC) (GLuint readBuffer, GLuint writeBuffer, GLintptr readOffset, GLintptr writeOffset, GLsizeiptr size); typedef void (APIENTRYP PFNGLNAMEDFRAMEBUFFERTEXTUREEXTPROC) (GLuint framebuffer, GLenum attachment, GLuint texture, GLint level); typedef void (APIENTRYP PFNGLNAMEDFRAMEBUFFERTEXTURELAYEREXTPROC) (GLuint framebuffer, GLenum attachment, GLuint texture, GLint level, GLint layer); typedef void (APIENTRYP PFNGLNAMEDFRAMEBUFFERTEXTUREFACEEXTPROC) (GLuint framebuffer, GLenum attachment, GLuint texture, GLint level, GLenum face); typedef void (APIENTRYP PFNGLTEXTURERENDERBUFFEREXTPROC) (GLuint texture, GLenum target, GLuint renderbuffer); typedef void (APIENTRYP PFNGLMULTITEXRENDERBUFFEREXTPROC) (GLenum texunit, GLenum target, GLuint renderbuffer); typedef void (APIENTRYP PFNGLVERTEXARRAYVERTEXOFFSETEXTPROC) (GLuint vaobj, GLuint buffer, GLint size, GLenum type, GLsizei stride, GLintptr offset); typedef void (APIENTRYP PFNGLVERTEXARRAYCOLOROFFSETEXTPROC) (GLuint vaobj, GLuint buffer, GLint size, GLenum type, GLsizei stride, GLintptr offset); typedef void (APIENTRYP PFNGLVERTEXARRAYEDGEFLAGOFFSETEXTPROC) (GLuint vaobj, GLuint buffer, GLsizei stride, GLintptr offset); typedef void (APIENTRYP PFNGLVERTEXARRAYINDEXOFFSETEXTPROC) (GLuint vaobj, GLuint buffer, GLenum type, GLsizei stride, GLintptr offset); typedef void (APIENTRYP PFNGLVERTEXARRAYNORMALOFFSETEXTPROC) (GLuint vaobj, GLuint buffer, GLenum type, GLsizei stride, GLintptr offset); typedef void (APIENTRYP PFNGLVERTEXARRAYTEXCOORDOFFSETEXTPROC) (GLuint vaobj, GLuint buffer, GLint size, GLenum type, GLsizei stride, GLintptr offset); typedef void (APIENTRYP PFNGLVERTEXARRAYMULTITEXCOORDOFFSETEXTPROC) (GLuint vaobj, GLuint buffer, GLenum texunit, GLint size, GLenum type, GLsizei stride, GLintptr offset); typedef void (APIENTRYP PFNGLVERTEXARRAYFOGCOORDOFFSETEXTPROC) (GLuint vaobj, GLuint buffer, GLenum type, GLsizei stride, GLintptr offset); typedef void (APIENTRYP PFNGLVERTEXARRAYSECONDARYCOLOROFFSETEXTPROC) (GLuint vaobj, GLuint buffer, GLint size, GLenum type, GLsizei stride, GLintptr offset); typedef void (APIENTRYP PFNGLVERTEXARRAYVERTEXATTRIBOFFSETEXTPROC) (GLuint vaobj, GLuint buffer, GLuint index, GLint size, GLenum type, GLboolean normalized, GLsizei stride, GLintptr offset); typedef void (APIENTRYP PFNGLVERTEXARRAYVERTEXATTRIBIOFFSETEXTPROC) (GLuint vaobj, GLuint buffer, GLuint index, GLint size, GLenum type, GLsizei stride, GLintptr offset); typedef void (APIENTRYP PFNGLENABLEVERTEXARRAYEXTPROC) (GLuint vaobj, GLenum array); typedef void (APIENTRYP PFNGLDISABLEVERTEXARRAYEXTPROC) (GLuint vaobj, GLenum array); typedef void (APIENTRYP PFNGLENABLEVERTEXARRAYATTRIBEXTPROC) (GLuint vaobj, GLuint index); typedef void (APIENTRYP PFNGLDISABLEVERTEXARRAYATTRIBEXTPROC) (GLuint vaobj, GLuint index); typedef void (APIENTRYP PFNGLGETVERTEXARRAYINTEGERVEXTPROC) (GLuint vaobj, GLenum pname, GLint *param); typedef void (APIENTRYP PFNGLGETVERTEXARRAYPOINTERVEXTPROC) (GLuint vaobj, GLenum pname, void **param); typedef void (APIENTRYP PFNGLGETVERTEXARRAYINTEGERI_VEXTPROC) (GLuint vaobj, GLuint index, GLenum pname, GLint *param); typedef void (APIENTRYP PFNGLGETVERTEXARRAYPOINTERI_VEXTPROC) (GLuint vaobj, GLuint index, GLenum pname, void **param); typedef void *(APIENTRYP PFNGLMAPNAMEDBUFFERRANGEEXTPROC) (GLuint buffer, GLintptr offset, GLsizeiptr length, GLbitfield access); typedef void (APIENTRYP PFNGLFLUSHMAPPEDNAMEDBUFFERRANGEEXTPROC) (GLuint buffer, GLintptr offset, GLsizeiptr length); typedef void (APIENTRYP PFNGLNAMEDBUFFERSTORAGEEXTPROC) (GLuint buffer, GLsizeiptr size, const void *data, GLbitfield flags); typedef void (APIENTRYP PFNGLCLEARNAMEDBUFFERDATAEXTPROC) (GLuint buffer, GLenum internalformat, GLenum format, GLenum type, const void *data); typedef void (APIENTRYP PFNGLCLEARNAMEDBUFFERSUBDATAEXTPROC) (GLuint buffer, GLenum internalformat, GLsizeiptr offset, GLsizeiptr size, GLenum format, GLenum type, const void *data); typedef void (APIENTRYP PFNGLNAMEDFRAMEBUFFERPARAMETERIEXTPROC) (GLuint framebuffer, GLenum pname, GLint param); typedef void (APIENTRYP PFNGLGETNAMEDFRAMEBUFFERPARAMETERIVEXTPROC) (GLuint framebuffer, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM1DEXTPROC) (GLuint program, GLint location, GLdouble x); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM2DEXTPROC) (GLuint program, GLint location, GLdouble x, GLdouble y); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM3DEXTPROC) (GLuint program, GLint location, GLdouble x, GLdouble y, GLdouble z); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM4DEXTPROC) (GLuint program, GLint location, GLdouble x, GLdouble y, GLdouble z, GLdouble w); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM1DVEXTPROC) (GLuint program, GLint location, GLsizei count, const GLdouble *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM2DVEXTPROC) (GLuint program, GLint location, GLsizei count, const GLdouble *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM3DVEXTPROC) (GLuint program, GLint location, GLsizei count, const GLdouble *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM4DVEXTPROC) (GLuint program, GLint location, GLsizei count, const GLdouble *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORMMATRIX2DVEXTPROC) (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORMMATRIX3DVEXTPROC) (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORMMATRIX4DVEXTPROC) (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORMMATRIX2X3DVEXTPROC) (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORMMATRIX2X4DVEXTPROC) (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORMMATRIX3X2DVEXTPROC) (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORMMATRIX3X4DVEXTPROC) (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORMMATRIX4X2DVEXTPROC) (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORMMATRIX4X3DVEXTPROC) (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); typedef void (APIENTRYP PFNGLTEXTUREBUFFERRANGEEXTPROC) (GLuint texture, GLenum target, GLenum internalformat, GLuint buffer, GLintptr offset, GLsizeiptr size); typedef void (APIENTRYP PFNGLTEXTURESTORAGE1DEXTPROC) (GLuint texture, GLenum target, GLsizei levels, GLenum internalformat, GLsizei width); typedef void (APIENTRYP PFNGLTEXTURESTORAGE2DEXTPROC) (GLuint texture, GLenum target, GLsizei levels, GLenum internalformat, GLsizei width, GLsizei height); typedef void (APIENTRYP PFNGLTEXTURESTORAGE3DEXTPROC) (GLuint texture, GLenum target, GLsizei levels, GLenum internalformat, GLsizei width, GLsizei height, GLsizei depth); typedef void (APIENTRYP PFNGLTEXTURESTORAGE2DMULTISAMPLEEXTPROC) (GLuint texture, GLenum target, GLsizei samples, GLenum internalformat, GLsizei width, GLsizei height, GLboolean fixedsamplelocations); typedef void (APIENTRYP PFNGLTEXTURESTORAGE3DMULTISAMPLEEXTPROC) (GLuint texture, GLenum target, GLsizei samples, GLenum internalformat, GLsizei width, GLsizei height, GLsizei depth, GLboolean fixedsamplelocations); typedef void (APIENTRYP PFNGLVERTEXARRAYBINDVERTEXBUFFEREXTPROC) (GLuint vaobj, GLuint bindingindex, GLuint buffer, GLintptr offset, GLsizei stride); typedef void (APIENTRYP PFNGLVERTEXARRAYVERTEXATTRIBFORMATEXTPROC) (GLuint vaobj, GLuint attribindex, GLint size, GLenum type, GLboolean normalized, GLuint relativeoffset); typedef void (APIENTRYP PFNGLVERTEXARRAYVERTEXATTRIBIFORMATEXTPROC) (GLuint vaobj, GLuint attribindex, GLint size, GLenum type, GLuint relativeoffset); typedef void (APIENTRYP PFNGLVERTEXARRAYVERTEXATTRIBLFORMATEXTPROC) (GLuint vaobj, GLuint attribindex, GLint size, GLenum type, GLuint relativeoffset); typedef void (APIENTRYP PFNGLVERTEXARRAYVERTEXATTRIBBINDINGEXTPROC) (GLuint vaobj, GLuint attribindex, GLuint bindingindex); typedef void (APIENTRYP PFNGLVERTEXARRAYVERTEXBINDINGDIVISOREXTPROC) (GLuint vaobj, GLuint bindingindex, GLuint divisor); typedef void (APIENTRYP PFNGLVERTEXARRAYVERTEXATTRIBLOFFSETEXTPROC) (GLuint vaobj, GLuint buffer, GLuint index, GLint size, GLenum type, GLsizei stride, GLintptr offset); typedef void (APIENTRYP PFNGLTEXTUREPAGECOMMITMENTEXTPROC) (GLuint texture, GLint level, GLint xoffset, GLint yoffset, GLint zoffset, GLsizei width, GLsizei height, GLsizei depth, GLboolean resident); typedef void (APIENTRYP PFNGLVERTEXARRAYVERTEXATTRIBDIVISOREXTPROC) (GLuint vaobj, GLuint index, GLuint divisor); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glMatrixLoadfEXT (GLenum mode, const GLfloat *m); GLAPI void APIENTRY glMatrixLoaddEXT (GLenum mode, const GLdouble *m); GLAPI void APIENTRY glMatrixMultfEXT (GLenum mode, const GLfloat *m); GLAPI void APIENTRY glMatrixMultdEXT (GLenum mode, const GLdouble *m); GLAPI void APIENTRY glMatrixLoadIdentityEXT (GLenum mode); GLAPI void APIENTRY glMatrixRotatefEXT (GLenum mode, GLfloat angle, GLfloat x, GLfloat y, GLfloat z); GLAPI void APIENTRY glMatrixRotatedEXT (GLenum mode, GLdouble angle, GLdouble x, GLdouble y, GLdouble z); GLAPI void APIENTRY glMatrixScalefEXT (GLenum mode, GLfloat x, GLfloat y, GLfloat z); GLAPI void APIENTRY glMatrixScaledEXT (GLenum mode, GLdouble x, GLdouble y, GLdouble z); GLAPI void APIENTRY glMatrixTranslatefEXT (GLenum mode, GLfloat x, GLfloat y, GLfloat z); GLAPI void APIENTRY glMatrixTranslatedEXT (GLenum mode, GLdouble x, GLdouble y, GLdouble z); GLAPI void APIENTRY glMatrixFrustumEXT (GLenum mode, GLdouble left, GLdouble right, GLdouble bottom, GLdouble top, GLdouble zNear, GLdouble zFar); GLAPI void APIENTRY glMatrixOrthoEXT (GLenum mode, GLdouble left, GLdouble right, GLdouble bottom, GLdouble top, GLdouble zNear, GLdouble zFar); GLAPI void APIENTRY glMatrixPopEXT (GLenum mode); GLAPI void APIENTRY glMatrixPushEXT (GLenum mode); GLAPI void APIENTRY glClientAttribDefaultEXT (GLbitfield mask); GLAPI void APIENTRY glPushClientAttribDefaultEXT (GLbitfield mask); GLAPI void APIENTRY glTextureParameterfEXT (GLuint texture, GLenum target, GLenum pname, GLfloat param); GLAPI void APIENTRY glTextureParameterfvEXT (GLuint texture, GLenum target, GLenum pname, const GLfloat *params); GLAPI void APIENTRY glTextureParameteriEXT (GLuint texture, GLenum target, GLenum pname, GLint param); GLAPI void APIENTRY glTextureParameterivEXT (GLuint texture, GLenum target, GLenum pname, const GLint *params); GLAPI void APIENTRY glTextureImage1DEXT (GLuint texture, GLenum target, GLint level, GLint internalformat, GLsizei width, GLint border, GLenum format, GLenum type, const void *pixels); GLAPI void APIENTRY glTextureImage2DEXT (GLuint texture, GLenum target, GLint level, GLint internalformat, GLsizei width, GLsizei height, GLint border, GLenum format, GLenum type, const void *pixels); GLAPI void APIENTRY glTextureSubImage1DEXT (GLuint texture, GLenum target, GLint level, GLint xoffset, GLsizei width, GLenum format, GLenum type, const void *pixels); GLAPI void APIENTRY glTextureSubImage2DEXT (GLuint texture, GLenum target, GLint level, GLint xoffset, GLint yoffset, GLsizei width, GLsizei height, GLenum format, GLenum type, const void *pixels); GLAPI void APIENTRY glCopyTextureImage1DEXT (GLuint texture, GLenum target, GLint level, GLenum internalformat, GLint x, GLint y, GLsizei width, GLint border); GLAPI void APIENTRY glCopyTextureImage2DEXT (GLuint texture, GLenum target, GLint level, GLenum internalformat, GLint x, GLint y, GLsizei width, GLsizei height, GLint border); GLAPI void APIENTRY glCopyTextureSubImage1DEXT (GLuint texture, GLenum target, GLint level, GLint xoffset, GLint x, GLint y, GLsizei width); GLAPI void APIENTRY glCopyTextureSubImage2DEXT (GLuint texture, GLenum target, GLint level, GLint xoffset, GLint yoffset, GLint x, GLint y, GLsizei width, GLsizei height); GLAPI void APIENTRY glGetTextureImageEXT (GLuint texture, GLenum target, GLint level, GLenum format, GLenum type, void *pixels); GLAPI void APIENTRY glGetTextureParameterfvEXT (GLuint texture, GLenum target, GLenum pname, GLfloat *params); GLAPI void APIENTRY glGetTextureParameterivEXT (GLuint texture, GLenum target, GLenum pname, GLint *params); GLAPI void APIENTRY glGetTextureLevelParameterfvEXT (GLuint texture, GLenum target, GLint level, GLenum pname, GLfloat *params); GLAPI void APIENTRY glGetTextureLevelParameterivEXT (GLuint texture, GLenum target, GLint level, GLenum pname, GLint *params); GLAPI void APIENTRY glTextureImage3DEXT (GLuint texture, GLenum target, GLint level, GLint internalformat, GLsizei width, GLsizei height, GLsizei depth, GLint border, GLenum format, GLenum type, const void *pixels); GLAPI void APIENTRY glTextureSubImage3DEXT (GLuint texture, GLenum target, GLint level, GLint xoffset, GLint yoffset, GLint zoffset, GLsizei width, GLsizei height, GLsizei depth, GLenum format, GLenum type, const void *pixels); GLAPI void APIENTRY glCopyTextureSubImage3DEXT (GLuint texture, GLenum target, GLint level, GLint xoffset, GLint yoffset, GLint zoffset, GLint x, GLint y, GLsizei width, GLsizei height); GLAPI void APIENTRY glBindMultiTextureEXT (GLenum texunit, GLenum target, GLuint texture); GLAPI void APIENTRY glMultiTexCoordPointerEXT (GLenum texunit, GLint size, GLenum type, GLsizei stride, const void *pointer); GLAPI void APIENTRY glMultiTexEnvfEXT (GLenum texunit, GLenum target, GLenum pname, GLfloat param); GLAPI void APIENTRY glMultiTexEnvfvEXT (GLenum texunit, GLenum target, GLenum pname, const GLfloat *params); GLAPI void APIENTRY glMultiTexEnviEXT (GLenum texunit, GLenum target, GLenum pname, GLint param); GLAPI void APIENTRY glMultiTexEnvivEXT (GLenum texunit, GLenum target, GLenum pname, const GLint *params); GLAPI void APIENTRY glMultiTexGendEXT (GLenum texunit, GLenum coord, GLenum pname, GLdouble param); GLAPI void APIENTRY glMultiTexGendvEXT (GLenum texunit, GLenum coord, GLenum pname, const GLdouble *params); GLAPI void APIENTRY glMultiTexGenfEXT (GLenum texunit, GLenum coord, GLenum pname, GLfloat param); GLAPI void APIENTRY glMultiTexGenfvEXT (GLenum texunit, GLenum coord, GLenum pname, const GLfloat *params); GLAPI void APIENTRY glMultiTexGeniEXT (GLenum texunit, GLenum coord, GLenum pname, GLint param); GLAPI void APIENTRY glMultiTexGenivEXT (GLenum texunit, GLenum coord, GLenum pname, const GLint *params); GLAPI void APIENTRY glGetMultiTexEnvfvEXT (GLenum texunit, GLenum target, GLenum pname, GLfloat *params); GLAPI void APIENTRY glGetMultiTexEnvivEXT (GLenum texunit, GLenum target, GLenum pname, GLint *params); GLAPI void APIENTRY glGetMultiTexGendvEXT (GLenum texunit, GLenum coord, GLenum pname, GLdouble *params); GLAPI void APIENTRY glGetMultiTexGenfvEXT (GLenum texunit, GLenum coord, GLenum pname, GLfloat *params); GLAPI void APIENTRY glGetMultiTexGenivEXT (GLenum texunit, GLenum coord, GLenum pname, GLint *params); GLAPI void APIENTRY glMultiTexParameteriEXT (GLenum texunit, GLenum target, GLenum pname, GLint param); GLAPI void APIENTRY glMultiTexParameterivEXT (GLenum texunit, GLenum target, GLenum pname, const GLint *params); GLAPI void APIENTRY glMultiTexParameterfEXT (GLenum texunit, GLenum target, GLenum pname, GLfloat param); GLAPI void APIENTRY glMultiTexParameterfvEXT (GLenum texunit, GLenum target, GLenum pname, const GLfloat *params); GLAPI void APIENTRY glMultiTexImage1DEXT (GLenum texunit, GLenum target, GLint level, GLint internalformat, GLsizei width, GLint border, GLenum format, GLenum type, const void *pixels); GLAPI void APIENTRY glMultiTexImage2DEXT (GLenum texunit, GLenum target, GLint level, GLint internalformat, GLsizei width, GLsizei height, GLint border, GLenum format, GLenum type, const void *pixels); GLAPI void APIENTRY glMultiTexSubImage1DEXT (GLenum texunit, GLenum target, GLint level, GLint xoffset, GLsizei width, GLenum format, GLenum type, const void *pixels); GLAPI void APIENTRY glMultiTexSubImage2DEXT (GLenum texunit, GLenum target, GLint level, GLint xoffset, GLint yoffset, GLsizei width, GLsizei height, GLenum format, GLenum type, const void *pixels); GLAPI void APIENTRY glCopyMultiTexImage1DEXT (GLenum texunit, GLenum target, GLint level, GLenum internalformat, GLint x, GLint y, GLsizei width, GLint border); GLAPI void APIENTRY glCopyMultiTexImage2DEXT (GLenum texunit, GLenum target, GLint level, GLenum internalformat, GLint x, GLint y, GLsizei width, GLsizei height, GLint border); GLAPI void APIENTRY glCopyMultiTexSubImage1DEXT (GLenum texunit, GLenum target, GLint level, GLint xoffset, GLint x, GLint y, GLsizei width); GLAPI void APIENTRY glCopyMultiTexSubImage2DEXT (GLenum texunit, GLenum target, GLint level, GLint xoffset, GLint yoffset, GLint x, GLint y, GLsizei width, GLsizei height); GLAPI void APIENTRY glGetMultiTexImageEXT (GLenum texunit, GLenum target, GLint level, GLenum format, GLenum type, void *pixels); GLAPI void APIENTRY glGetMultiTexParameterfvEXT (GLenum texunit, GLenum target, GLenum pname, GLfloat *params); GLAPI void APIENTRY glGetMultiTexParameterivEXT (GLenum texunit, GLenum target, GLenum pname, GLint *params); GLAPI void APIENTRY glGetMultiTexLevelParameterfvEXT (GLenum texunit, GLenum target, GLint level, GLenum pname, GLfloat *params); GLAPI void APIENTRY glGetMultiTexLevelParameterivEXT (GLenum texunit, GLenum target, GLint level, GLenum pname, GLint *params); GLAPI void APIENTRY glMultiTexImage3DEXT (GLenum texunit, GLenum target, GLint level, GLint internalformat, GLsizei width, GLsizei height, GLsizei depth, GLint border, GLenum format, GLenum type, const void *pixels); GLAPI void APIENTRY glMultiTexSubImage3DEXT (GLenum texunit, GLenum target, GLint level, GLint xoffset, GLint yoffset, GLint zoffset, GLsizei width, GLsizei height, GLsizei depth, GLenum format, GLenum type, const void *pixels); GLAPI void APIENTRY glCopyMultiTexSubImage3DEXT (GLenum texunit, GLenum target, GLint level, GLint xoffset, GLint yoffset, GLint zoffset, GLint x, GLint y, GLsizei width, GLsizei height); GLAPI void APIENTRY glEnableClientStateIndexedEXT (GLenum array, GLuint index); GLAPI void APIENTRY glDisableClientStateIndexedEXT (GLenum array, GLuint index); GLAPI void APIENTRY glGetFloatIndexedvEXT (GLenum target, GLuint index, GLfloat *data); GLAPI void APIENTRY glGetDoubleIndexedvEXT (GLenum target, GLuint index, GLdouble *data); GLAPI void APIENTRY glGetPointerIndexedvEXT (GLenum target, GLuint index, void **data); GLAPI void APIENTRY glEnableIndexedEXT (GLenum target, GLuint index); GLAPI void APIENTRY glDisableIndexedEXT (GLenum target, GLuint index); GLAPI GLboolean APIENTRY glIsEnabledIndexedEXT (GLenum target, GLuint index); GLAPI void APIENTRY glGetIntegerIndexedvEXT (GLenum target, GLuint index, GLint *data); GLAPI void APIENTRY glGetBooleanIndexedvEXT (GLenum target, GLuint index, GLboolean *data); GLAPI void APIENTRY glCompressedTextureImage3DEXT (GLuint texture, GLenum target, GLint level, GLenum internalformat, GLsizei width, GLsizei height, GLsizei depth, GLint border, GLsizei imageSize, const void *bits); GLAPI void APIENTRY glCompressedTextureImage2DEXT (GLuint texture, GLenum target, GLint level, GLenum internalformat, GLsizei width, GLsizei height, GLint border, GLsizei imageSize, const void *bits); GLAPI void APIENTRY glCompressedTextureImage1DEXT (GLuint texture, GLenum target, GLint level, GLenum internalformat, GLsizei width, GLint border, GLsizei imageSize, const void *bits); GLAPI void APIENTRY glCompressedTextureSubImage3DEXT (GLuint texture, GLenum target, GLint level, GLint xoffset, GLint yoffset, GLint zoffset, GLsizei width, GLsizei height, GLsizei depth, GLenum format, GLsizei imageSize, const void *bits); GLAPI void APIENTRY glCompressedTextureSubImage2DEXT (GLuint texture, GLenum target, GLint level, GLint xoffset, GLint yoffset, GLsizei width, GLsizei height, GLenum format, GLsizei imageSize, const void *bits); GLAPI void APIENTRY glCompressedTextureSubImage1DEXT (GLuint texture, GLenum target, GLint level, GLint xoffset, GLsizei width, GLenum format, GLsizei imageSize, const void *bits); GLAPI void APIENTRY glGetCompressedTextureImageEXT (GLuint texture, GLenum target, GLint lod, void *img); GLAPI void APIENTRY glCompressedMultiTexImage3DEXT (GLenum texunit, GLenum target, GLint level, GLenum internalformat, GLsizei width, GLsizei height, GLsizei depth, GLint border, GLsizei imageSize, const void *bits); GLAPI void APIENTRY glCompressedMultiTexImage2DEXT (GLenum texunit, GLenum target, GLint level, GLenum internalformat, GLsizei width, GLsizei height, GLint border, GLsizei imageSize, const void *bits); GLAPI void APIENTRY glCompressedMultiTexImage1DEXT (GLenum texunit, GLenum target, GLint level, GLenum internalformat, GLsizei width, GLint border, GLsizei imageSize, const void *bits); GLAPI void APIENTRY glCompressedMultiTexSubImage3DEXT (GLenum texunit, GLenum target, GLint level, GLint xoffset, GLint yoffset, GLint zoffset, GLsizei width, GLsizei height, GLsizei depth, GLenum format, GLsizei imageSize, const void *bits); GLAPI void APIENTRY glCompressedMultiTexSubImage2DEXT (GLenum texunit, GLenum target, GLint level, GLint xoffset, GLint yoffset, GLsizei width, GLsizei height, GLenum format, GLsizei imageSize, const void *bits); GLAPI void APIENTRY glCompressedMultiTexSubImage1DEXT (GLenum texunit, GLenum target, GLint level, GLint xoffset, GLsizei width, GLenum format, GLsizei imageSize, const void *bits); GLAPI void APIENTRY glGetCompressedMultiTexImageEXT (GLenum texunit, GLenum target, GLint lod, void *img); GLAPI void APIENTRY glMatrixLoadTransposefEXT (GLenum mode, const GLfloat *m); GLAPI void APIENTRY glMatrixLoadTransposedEXT (GLenum mode, const GLdouble *m); GLAPI void APIENTRY glMatrixMultTransposefEXT (GLenum mode, const GLfloat *m); GLAPI void APIENTRY glMatrixMultTransposedEXT (GLenum mode, const GLdouble *m); GLAPI void APIENTRY glNamedBufferDataEXT (GLuint buffer, GLsizeiptr size, const void *data, GLenum usage); GLAPI void APIENTRY glNamedBufferSubDataEXT (GLuint buffer, GLintptr offset, GLsizeiptr size, const void *data); GLAPI void *APIENTRY glMapNamedBufferEXT (GLuint buffer, GLenum access); GLAPI GLboolean APIENTRY glUnmapNamedBufferEXT (GLuint buffer); GLAPI void APIENTRY glGetNamedBufferParameterivEXT (GLuint buffer, GLenum pname, GLint *params); GLAPI void APIENTRY glGetNamedBufferPointervEXT (GLuint buffer, GLenum pname, void **params); GLAPI void APIENTRY glGetNamedBufferSubDataEXT (GLuint buffer, GLintptr offset, GLsizeiptr size, void *data); GLAPI void APIENTRY glProgramUniform1fEXT (GLuint program, GLint location, GLfloat v0); GLAPI void APIENTRY glProgramUniform2fEXT (GLuint program, GLint location, GLfloat v0, GLfloat v1); GLAPI void APIENTRY glProgramUniform3fEXT (GLuint program, GLint location, GLfloat v0, GLfloat v1, GLfloat v2); GLAPI void APIENTRY glProgramUniform4fEXT (GLuint program, GLint location, GLfloat v0, GLfloat v1, GLfloat v2, GLfloat v3); GLAPI void APIENTRY glProgramUniform1iEXT (GLuint program, GLint location, GLint v0); GLAPI void APIENTRY glProgramUniform2iEXT (GLuint program, GLint location, GLint v0, GLint v1); GLAPI void APIENTRY glProgramUniform3iEXT (GLuint program, GLint location, GLint v0, GLint v1, GLint v2); GLAPI void APIENTRY glProgramUniform4iEXT (GLuint program, GLint location, GLint v0, GLint v1, GLint v2, GLint v3); GLAPI void APIENTRY glProgramUniform1fvEXT (GLuint program, GLint location, GLsizei count, const GLfloat *value); GLAPI void APIENTRY glProgramUniform2fvEXT (GLuint program, GLint location, GLsizei count, const GLfloat *value); GLAPI void APIENTRY glProgramUniform3fvEXT (GLuint program, GLint location, GLsizei count, const GLfloat *value); GLAPI void APIENTRY glProgramUniform4fvEXT (GLuint program, GLint location, GLsizei count, const GLfloat *value); GLAPI void APIENTRY glProgramUniform1ivEXT (GLuint program, GLint location, GLsizei count, const GLint *value); GLAPI void APIENTRY glProgramUniform2ivEXT (GLuint program, GLint location, GLsizei count, const GLint *value); GLAPI void APIENTRY glProgramUniform3ivEXT (GLuint program, GLint location, GLsizei count, const GLint *value); GLAPI void APIENTRY glProgramUniform4ivEXT (GLuint program, GLint location, GLsizei count, const GLint *value); GLAPI void APIENTRY glProgramUniformMatrix2fvEXT (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); GLAPI void APIENTRY glProgramUniformMatrix3fvEXT (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); GLAPI void APIENTRY glProgramUniformMatrix4fvEXT (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); GLAPI void APIENTRY glProgramUniformMatrix2x3fvEXT (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); GLAPI void APIENTRY glProgramUniformMatrix3x2fvEXT (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); GLAPI void APIENTRY glProgramUniformMatrix2x4fvEXT (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); GLAPI void APIENTRY glProgramUniformMatrix4x2fvEXT (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); GLAPI void APIENTRY glProgramUniformMatrix3x4fvEXT (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); GLAPI void APIENTRY glProgramUniformMatrix4x3fvEXT (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLfloat *value); GLAPI void APIENTRY glTextureBufferEXT (GLuint texture, GLenum target, GLenum internalformat, GLuint buffer); GLAPI void APIENTRY glMultiTexBufferEXT (GLenum texunit, GLenum target, GLenum internalformat, GLuint buffer); GLAPI void APIENTRY glTextureParameterIivEXT (GLuint texture, GLenum target, GLenum pname, const GLint *params); GLAPI void APIENTRY glTextureParameterIuivEXT (GLuint texture, GLenum target, GLenum pname, const GLuint *params); GLAPI void APIENTRY glGetTextureParameterIivEXT (GLuint texture, GLenum target, GLenum pname, GLint *params); GLAPI void APIENTRY glGetTextureParameterIuivEXT (GLuint texture, GLenum target, GLenum pname, GLuint *params); GLAPI void APIENTRY glMultiTexParameterIivEXT (GLenum texunit, GLenum target, GLenum pname, const GLint *params); GLAPI void APIENTRY glMultiTexParameterIuivEXT (GLenum texunit, GLenum target, GLenum pname, const GLuint *params); GLAPI void APIENTRY glGetMultiTexParameterIivEXT (GLenum texunit, GLenum target, GLenum pname, GLint *params); GLAPI void APIENTRY glGetMultiTexParameterIuivEXT (GLenum texunit, GLenum target, GLenum pname, GLuint *params); GLAPI void APIENTRY glProgramUniform1uiEXT (GLuint program, GLint location, GLuint v0); GLAPI void APIENTRY glProgramUniform2uiEXT (GLuint program, GLint location, GLuint v0, GLuint v1); GLAPI void APIENTRY glProgramUniform3uiEXT (GLuint program, GLint location, GLuint v0, GLuint v1, GLuint v2); GLAPI void APIENTRY glProgramUniform4uiEXT (GLuint program, GLint location, GLuint v0, GLuint v1, GLuint v2, GLuint v3); GLAPI void APIENTRY glProgramUniform1uivEXT (GLuint program, GLint location, GLsizei count, const GLuint *value); GLAPI void APIENTRY glProgramUniform2uivEXT (GLuint program, GLint location, GLsizei count, const GLuint *value); GLAPI void APIENTRY glProgramUniform3uivEXT (GLuint program, GLint location, GLsizei count, const GLuint *value); GLAPI void APIENTRY glProgramUniform4uivEXT (GLuint program, GLint location, GLsizei count, const GLuint *value); GLAPI void APIENTRY glNamedProgramLocalParameters4fvEXT (GLuint program, GLenum target, GLuint index, GLsizei count, const GLfloat *params); GLAPI void APIENTRY glNamedProgramLocalParameterI4iEXT (GLuint program, GLenum target, GLuint index, GLint x, GLint y, GLint z, GLint w); GLAPI void APIENTRY glNamedProgramLocalParameterI4ivEXT (GLuint program, GLenum target, GLuint index, const GLint *params); GLAPI void APIENTRY glNamedProgramLocalParametersI4ivEXT (GLuint program, GLenum target, GLuint index, GLsizei count, const GLint *params); GLAPI void APIENTRY glNamedProgramLocalParameterI4uiEXT (GLuint program, GLenum target, GLuint index, GLuint x, GLuint y, GLuint z, GLuint w); GLAPI void APIENTRY glNamedProgramLocalParameterI4uivEXT (GLuint program, GLenum target, GLuint index, const GLuint *params); GLAPI void APIENTRY glNamedProgramLocalParametersI4uivEXT (GLuint program, GLenum target, GLuint index, GLsizei count, const GLuint *params); GLAPI void APIENTRY glGetNamedProgramLocalParameterIivEXT (GLuint program, GLenum target, GLuint index, GLint *params); GLAPI void APIENTRY glGetNamedProgramLocalParameterIuivEXT (GLuint program, GLenum target, GLuint index, GLuint *params); GLAPI void APIENTRY glEnableClientStateiEXT (GLenum array, GLuint index); GLAPI void APIENTRY glDisableClientStateiEXT (GLenum array, GLuint index); GLAPI void APIENTRY glGetFloati_vEXT (GLenum pname, GLuint index, GLfloat *params); GLAPI void APIENTRY glGetDoublei_vEXT (GLenum pname, GLuint index, GLdouble *params); GLAPI void APIENTRY glGetPointeri_vEXT (GLenum pname, GLuint index, void **params); GLAPI void APIENTRY glNamedProgramStringEXT (GLuint program, GLenum target, GLenum format, GLsizei len, const void *string); GLAPI void APIENTRY glNamedProgramLocalParameter4dEXT (GLuint program, GLenum target, GLuint index, GLdouble x, GLdouble y, GLdouble z, GLdouble w); GLAPI void APIENTRY glNamedProgramLocalParameter4dvEXT (GLuint program, GLenum target, GLuint index, const GLdouble *params); GLAPI void APIENTRY glNamedProgramLocalParameter4fEXT (GLuint program, GLenum target, GLuint index, GLfloat x, GLfloat y, GLfloat z, GLfloat w); GLAPI void APIENTRY glNamedProgramLocalParameter4fvEXT (GLuint program, GLenum target, GLuint index, const GLfloat *params); GLAPI void APIENTRY glGetNamedProgramLocalParameterdvEXT (GLuint program, GLenum target, GLuint index, GLdouble *params); GLAPI void APIENTRY glGetNamedProgramLocalParameterfvEXT (GLuint program, GLenum target, GLuint index, GLfloat *params); GLAPI void APIENTRY glGetNamedProgramivEXT (GLuint program, GLenum target, GLenum pname, GLint *params); GLAPI void APIENTRY glGetNamedProgramStringEXT (GLuint program, GLenum target, GLenum pname, void *string); GLAPI void APIENTRY glNamedRenderbufferStorageEXT (GLuint renderbuffer, GLenum internalformat, GLsizei width, GLsizei height); GLAPI void APIENTRY glGetNamedRenderbufferParameterivEXT (GLuint renderbuffer, GLenum pname, GLint *params); GLAPI void APIENTRY glNamedRenderbufferStorageMultisampleEXT (GLuint renderbuffer, GLsizei samples, GLenum internalformat, GLsizei width, GLsizei height); GLAPI void APIENTRY glNamedRenderbufferStorageMultisampleCoverageEXT (GLuint renderbuffer, GLsizei coverageSamples, GLsizei colorSamples, GLenum internalformat, GLsizei width, GLsizei height); GLAPI GLenum APIENTRY glCheckNamedFramebufferStatusEXT (GLuint framebuffer, GLenum target); GLAPI void APIENTRY glNamedFramebufferTexture1DEXT (GLuint framebuffer, GLenum attachment, GLenum textarget, GLuint texture, GLint level); GLAPI void APIENTRY glNamedFramebufferTexture2DEXT (GLuint framebuffer, GLenum attachment, GLenum textarget, GLuint texture, GLint level); GLAPI void APIENTRY glNamedFramebufferTexture3DEXT (GLuint framebuffer, GLenum attachment, GLenum textarget, GLuint texture, GLint level, GLint zoffset); GLAPI void APIENTRY glNamedFramebufferRenderbufferEXT (GLuint framebuffer, GLenum attachment, GLenum renderbuffertarget, GLuint renderbuffer); GLAPI void APIENTRY glGetNamedFramebufferAttachmentParameterivEXT (GLuint framebuffer, GLenum attachment, GLenum pname, GLint *params); GLAPI void APIENTRY glGenerateTextureMipmapEXT (GLuint texture, GLenum target); GLAPI void APIENTRY glGenerateMultiTexMipmapEXT (GLenum texunit, GLenum target); GLAPI void APIENTRY glFramebufferDrawBufferEXT (GLuint framebuffer, GLenum mode); GLAPI void APIENTRY glFramebufferDrawBuffersEXT (GLuint framebuffer, GLsizei n, const GLenum *bufs); GLAPI void APIENTRY glFramebufferReadBufferEXT (GLuint framebuffer, GLenum mode); GLAPI void APIENTRY glGetFramebufferParameterivEXT (GLuint framebuffer, GLenum pname, GLint *params); GLAPI void APIENTRY glNamedCopyBufferSubDataEXT (GLuint readBuffer, GLuint writeBuffer, GLintptr readOffset, GLintptr writeOffset, GLsizeiptr size); GLAPI void APIENTRY glNamedFramebufferTextureEXT (GLuint framebuffer, GLenum attachment, GLuint texture, GLint level); GLAPI void APIENTRY glNamedFramebufferTextureLayerEXT (GLuint framebuffer, GLenum attachment, GLuint texture, GLint level, GLint layer); GLAPI void APIENTRY glNamedFramebufferTextureFaceEXT (GLuint framebuffer, GLenum attachment, GLuint texture, GLint level, GLenum face); GLAPI void APIENTRY glTextureRenderbufferEXT (GLuint texture, GLenum target, GLuint renderbuffer); GLAPI void APIENTRY glMultiTexRenderbufferEXT (GLenum texunit, GLenum target, GLuint renderbuffer); GLAPI void APIENTRY glVertexArrayVertexOffsetEXT (GLuint vaobj, GLuint buffer, GLint size, GLenum type, GLsizei stride, GLintptr offset); GLAPI void APIENTRY glVertexArrayColorOffsetEXT (GLuint vaobj, GLuint buffer, GLint size, GLenum type, GLsizei stride, GLintptr offset); GLAPI void APIENTRY glVertexArrayEdgeFlagOffsetEXT (GLuint vaobj, GLuint buffer, GLsizei stride, GLintptr offset); GLAPI void APIENTRY glVertexArrayIndexOffsetEXT (GLuint vaobj, GLuint buffer, GLenum type, GLsizei stride, GLintptr offset); GLAPI void APIENTRY glVertexArrayNormalOffsetEXT (GLuint vaobj, GLuint buffer, GLenum type, GLsizei stride, GLintptr offset); GLAPI void APIENTRY glVertexArrayTexCoordOffsetEXT (GLuint vaobj, GLuint buffer, GLint size, GLenum type, GLsizei stride, GLintptr offset); GLAPI void APIENTRY glVertexArrayMultiTexCoordOffsetEXT (GLuint vaobj, GLuint buffer, GLenum texunit, GLint size, GLenum type, GLsizei stride, GLintptr offset); GLAPI void APIENTRY glVertexArrayFogCoordOffsetEXT (GLuint vaobj, GLuint buffer, GLenum type, GLsizei stride, GLintptr offset); GLAPI void APIENTRY glVertexArraySecondaryColorOffsetEXT (GLuint vaobj, GLuint buffer, GLint size, GLenum type, GLsizei stride, GLintptr offset); GLAPI void APIENTRY glVertexArrayVertexAttribOffsetEXT (GLuint vaobj, GLuint buffer, GLuint index, GLint size, GLenum type, GLboolean normalized, GLsizei stride, GLintptr offset); GLAPI void APIENTRY glVertexArrayVertexAttribIOffsetEXT (GLuint vaobj, GLuint buffer, GLuint index, GLint size, GLenum type, GLsizei stride, GLintptr offset); GLAPI void APIENTRY glEnableVertexArrayEXT (GLuint vaobj, GLenum array); GLAPI void APIENTRY glDisableVertexArrayEXT (GLuint vaobj, GLenum array); GLAPI void APIENTRY glEnableVertexArrayAttribEXT (GLuint vaobj, GLuint index); GLAPI void APIENTRY glDisableVertexArrayAttribEXT (GLuint vaobj, GLuint index); GLAPI void APIENTRY glGetVertexArrayIntegervEXT (GLuint vaobj, GLenum pname, GLint *param); GLAPI void APIENTRY glGetVertexArrayPointervEXT (GLuint vaobj, GLenum pname, void **param); GLAPI void APIENTRY glGetVertexArrayIntegeri_vEXT (GLuint vaobj, GLuint index, GLenum pname, GLint *param); GLAPI void APIENTRY glGetVertexArrayPointeri_vEXT (GLuint vaobj, GLuint index, GLenum pname, void **param); GLAPI void *APIENTRY glMapNamedBufferRangeEXT (GLuint buffer, GLintptr offset, GLsizeiptr length, GLbitfield access); GLAPI void APIENTRY glFlushMappedNamedBufferRangeEXT (GLuint buffer, GLintptr offset, GLsizeiptr length); GLAPI void APIENTRY glNamedBufferStorageEXT (GLuint buffer, GLsizeiptr size, const void *data, GLbitfield flags); GLAPI void APIENTRY glClearNamedBufferDataEXT (GLuint buffer, GLenum internalformat, GLenum format, GLenum type, const void *data); GLAPI void APIENTRY glClearNamedBufferSubDataEXT (GLuint buffer, GLenum internalformat, GLsizeiptr offset, GLsizeiptr size, GLenum format, GLenum type, const void *data); GLAPI void APIENTRY glNamedFramebufferParameteriEXT (GLuint framebuffer, GLenum pname, GLint param); GLAPI void APIENTRY glGetNamedFramebufferParameterivEXT (GLuint framebuffer, GLenum pname, GLint *params); GLAPI void APIENTRY glProgramUniform1dEXT (GLuint program, GLint location, GLdouble x); GLAPI void APIENTRY glProgramUniform2dEXT (GLuint program, GLint location, GLdouble x, GLdouble y); GLAPI void APIENTRY glProgramUniform3dEXT (GLuint program, GLint location, GLdouble x, GLdouble y, GLdouble z); GLAPI void APIENTRY glProgramUniform4dEXT (GLuint program, GLint location, GLdouble x, GLdouble y, GLdouble z, GLdouble w); GLAPI void APIENTRY glProgramUniform1dvEXT (GLuint program, GLint location, GLsizei count, const GLdouble *value); GLAPI void APIENTRY glProgramUniform2dvEXT (GLuint program, GLint location, GLsizei count, const GLdouble *value); GLAPI void APIENTRY glProgramUniform3dvEXT (GLuint program, GLint location, GLsizei count, const GLdouble *value); GLAPI void APIENTRY glProgramUniform4dvEXT (GLuint program, GLint location, GLsizei count, const GLdouble *value); GLAPI void APIENTRY glProgramUniformMatrix2dvEXT (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); GLAPI void APIENTRY glProgramUniformMatrix3dvEXT (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); GLAPI void APIENTRY glProgramUniformMatrix4dvEXT (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); GLAPI void APIENTRY glProgramUniformMatrix2x3dvEXT (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); GLAPI void APIENTRY glProgramUniformMatrix2x4dvEXT (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); GLAPI void APIENTRY glProgramUniformMatrix3x2dvEXT (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); GLAPI void APIENTRY glProgramUniformMatrix3x4dvEXT (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); GLAPI void APIENTRY glProgramUniformMatrix4x2dvEXT (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); GLAPI void APIENTRY glProgramUniformMatrix4x3dvEXT (GLuint program, GLint location, GLsizei count, GLboolean transpose, const GLdouble *value); GLAPI void APIENTRY glTextureBufferRangeEXT (GLuint texture, GLenum target, GLenum internalformat, GLuint buffer, GLintptr offset, GLsizeiptr size); GLAPI void APIENTRY glTextureStorage1DEXT (GLuint texture, GLenum target, GLsizei levels, GLenum internalformat, GLsizei width); GLAPI void APIENTRY glTextureStorage2DEXT (GLuint texture, GLenum target, GLsizei levels, GLenum internalformat, GLsizei width, GLsizei height); GLAPI void APIENTRY glTextureStorage3DEXT (GLuint texture, GLenum target, GLsizei levels, GLenum internalformat, GLsizei width, GLsizei height, GLsizei depth); GLAPI void APIENTRY glTextureStorage2DMultisampleEXT (GLuint texture, GLenum target, GLsizei samples, GLenum internalformat, GLsizei width, GLsizei height, GLboolean fixedsamplelocations); GLAPI void APIENTRY glTextureStorage3DMultisampleEXT (GLuint texture, GLenum target, GLsizei samples, GLenum internalformat, GLsizei width, GLsizei height, GLsizei depth, GLboolean fixedsamplelocations); GLAPI void APIENTRY glVertexArrayBindVertexBufferEXT (GLuint vaobj, GLuint bindingindex, GLuint buffer, GLintptr offset, GLsizei stride); GLAPI void APIENTRY glVertexArrayVertexAttribFormatEXT (GLuint vaobj, GLuint attribindex, GLint size, GLenum type, GLboolean normalized, GLuint relativeoffset); GLAPI void APIENTRY glVertexArrayVertexAttribIFormatEXT (GLuint vaobj, GLuint attribindex, GLint size, GLenum type, GLuint relativeoffset); GLAPI void APIENTRY glVertexArrayVertexAttribLFormatEXT (GLuint vaobj, GLuint attribindex, GLint size, GLenum type, GLuint relativeoffset); GLAPI void APIENTRY glVertexArrayVertexAttribBindingEXT (GLuint vaobj, GLuint attribindex, GLuint bindingindex); GLAPI void APIENTRY glVertexArrayVertexBindingDivisorEXT (GLuint vaobj, GLuint bindingindex, GLuint divisor); GLAPI void APIENTRY glVertexArrayVertexAttribLOffsetEXT (GLuint vaobj, GLuint buffer, GLuint index, GLint size, GLenum type, GLsizei stride, GLintptr offset); GLAPI void APIENTRY glTexturePageCommitmentEXT (GLuint texture, GLint level, GLint xoffset, GLint yoffset, GLint zoffset, GLsizei width, GLsizei height, GLsizei depth, GLboolean resident); GLAPI void APIENTRY glVertexArrayVertexAttribDivisorEXT (GLuint vaobj, GLuint index, GLuint divisor); #endif #endif /* GL_EXT_direct_state_access */ #ifndef GL_EXT_draw_buffers2 #define GL_EXT_draw_buffers2 1 typedef void (APIENTRYP PFNGLCOLORMASKINDEXEDEXTPROC) (GLuint index, GLboolean r, GLboolean g, GLboolean b, GLboolean a); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glColorMaskIndexedEXT (GLuint index, GLboolean r, GLboolean g, GLboolean b, GLboolean a); #endif #endif /* GL_EXT_draw_buffers2 */ #ifndef GL_EXT_draw_instanced #define GL_EXT_draw_instanced 1 typedef void (APIENTRYP PFNGLDRAWARRAYSINSTANCEDEXTPROC) (GLenum mode, GLint start, GLsizei count, GLsizei primcount); typedef void (APIENTRYP PFNGLDRAWELEMENTSINSTANCEDEXTPROC) (GLenum mode, GLsizei count, GLenum type, const void *indices, GLsizei primcount); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glDrawArraysInstancedEXT (GLenum mode, GLint start, GLsizei count, GLsizei primcount); GLAPI void APIENTRY glDrawElementsInstancedEXT (GLenum mode, GLsizei count, GLenum type, const void *indices, GLsizei primcount); #endif #endif /* GL_EXT_draw_instanced */ #ifndef GL_EXT_draw_range_elements #define GL_EXT_draw_range_elements 1 #define GL_MAX_ELEMENTS_VERTICES_EXT 0x80E8 #define GL_MAX_ELEMENTS_INDICES_EXT 0x80E9 typedef void (APIENTRYP PFNGLDRAWRANGEELEMENTSEXTPROC) (GLenum mode, GLuint start, GLuint end, GLsizei count, GLenum type, const void *indices); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glDrawRangeElementsEXT (GLenum mode, GLuint start, GLuint end, GLsizei count, GLenum type, const void *indices); #endif #endif /* GL_EXT_draw_range_elements */ #ifndef GL_EXT_fog_coord #define GL_EXT_fog_coord 1 #define GL_FOG_COORDINATE_SOURCE_EXT 0x8450 #define GL_FOG_COORDINATE_EXT 0x8451 #define GL_FRAGMENT_DEPTH_EXT 0x8452 #define GL_CURRENT_FOG_COORDINATE_EXT 0x8453 #define GL_FOG_COORDINATE_ARRAY_TYPE_EXT 0x8454 #define GL_FOG_COORDINATE_ARRAY_STRIDE_EXT 0x8455 #define GL_FOG_COORDINATE_ARRAY_POINTER_EXT 0x8456 #define GL_FOG_COORDINATE_ARRAY_EXT 0x8457 typedef void (APIENTRYP PFNGLFOGCOORDFEXTPROC) (GLfloat coord); typedef void (APIENTRYP PFNGLFOGCOORDFVEXTPROC) (const GLfloat *coord); typedef void (APIENTRYP PFNGLFOGCOORDDEXTPROC) (GLdouble coord); typedef void (APIENTRYP PFNGLFOGCOORDDVEXTPROC) (const GLdouble *coord); typedef void (APIENTRYP PFNGLFOGCOORDPOINTEREXTPROC) (GLenum type, GLsizei stride, const void *pointer); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glFogCoordfEXT (GLfloat coord); GLAPI void APIENTRY glFogCoordfvEXT (const GLfloat *coord); GLAPI void APIENTRY glFogCoorddEXT (GLdouble coord); GLAPI void APIENTRY glFogCoorddvEXT (const GLdouble *coord); GLAPI void APIENTRY glFogCoordPointerEXT (GLenum type, GLsizei stride, const void *pointer); #endif #endif /* GL_EXT_fog_coord */ #ifndef GL_EXT_framebuffer_blit #define GL_EXT_framebuffer_blit 1 #define GL_READ_FRAMEBUFFER_EXT 0x8CA8 #define GL_DRAW_FRAMEBUFFER_EXT 0x8CA9 #define GL_DRAW_FRAMEBUFFER_BINDING_EXT 0x8CA6 #define GL_READ_FRAMEBUFFER_BINDING_EXT 0x8CAA typedef void (APIENTRYP PFNGLBLITFRAMEBUFFEREXTPROC) (GLint srcX0, GLint srcY0, GLint srcX1, GLint srcY1, GLint dstX0, GLint dstY0, GLint dstX1, GLint dstY1, GLbitfield mask, GLenum filter); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glBlitFramebufferEXT (GLint srcX0, GLint srcY0, GLint srcX1, GLint srcY1, GLint dstX0, GLint dstY0, GLint dstX1, GLint dstY1, GLbitfield mask, GLenum filter); #endif #endif /* GL_EXT_framebuffer_blit */ #ifndef GL_EXT_framebuffer_multisample #define GL_EXT_framebuffer_multisample 1 #define GL_RENDERBUFFER_SAMPLES_EXT 0x8CAB #define GL_FRAMEBUFFER_INCOMPLETE_MULTISAMPLE_EXT 0x8D56 #define GL_MAX_SAMPLES_EXT 0x8D57 typedef void (APIENTRYP PFNGLRENDERBUFFERSTORAGEMULTISAMPLEEXTPROC) (GLenum target, GLsizei samples, GLenum internalformat, GLsizei width, GLsizei height); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glRenderbufferStorageMultisampleEXT (GLenum target, GLsizei samples, GLenum internalformat, GLsizei width, GLsizei height); #endif #endif /* GL_EXT_framebuffer_multisample */ #ifndef GL_EXT_framebuffer_multisample_blit_scaled #define GL_EXT_framebuffer_multisample_blit_scaled 1 #define GL_SCALED_RESOLVE_FASTEST_EXT 0x90BA #define GL_SCALED_RESOLVE_NICEST_EXT 0x90BB #endif /* GL_EXT_framebuffer_multisample_blit_scaled */ #ifndef GL_EXT_framebuffer_object #define GL_EXT_framebuffer_object 1 #define GL_INVALID_FRAMEBUFFER_OPERATION_EXT 0x0506 #define GL_MAX_RENDERBUFFER_SIZE_EXT 0x84E8 #define GL_FRAMEBUFFER_BINDING_EXT 0x8CA6 #define GL_RENDERBUFFER_BINDING_EXT 0x8CA7 #define GL_FRAMEBUFFER_ATTACHMENT_OBJECT_TYPE_EXT 0x8CD0 #define GL_FRAMEBUFFER_ATTACHMENT_OBJECT_NAME_EXT 0x8CD1 #define GL_FRAMEBUFFER_ATTACHMENT_TEXTURE_LEVEL_EXT 0x8CD2 #define GL_FRAMEBUFFER_ATTACHMENT_TEXTURE_CUBE_MAP_FACE_EXT 0x8CD3 #define GL_FRAMEBUFFER_ATTACHMENT_TEXTURE_3D_ZOFFSET_EXT 0x8CD4 #define GL_FRAMEBUFFER_COMPLETE_EXT 0x8CD5 #define GL_FRAMEBUFFER_INCOMPLETE_ATTACHMENT_EXT 0x8CD6 #define GL_FRAMEBUFFER_INCOMPLETE_MISSING_ATTACHMENT_EXT 0x8CD7 #define GL_FRAMEBUFFER_INCOMPLETE_DIMENSIONS_EXT 0x8CD9 #define GL_FRAMEBUFFER_INCOMPLETE_FORMATS_EXT 0x8CDA #define GL_FRAMEBUFFER_INCOMPLETE_DRAW_BUFFER_EXT 0x8CDB #define GL_FRAMEBUFFER_INCOMPLETE_READ_BUFFER_EXT 0x8CDC #define GL_FRAMEBUFFER_UNSUPPORTED_EXT 0x8CDD #define GL_MAX_COLOR_ATTACHMENTS_EXT 0x8CDF #define GL_COLOR_ATTACHMENT0_EXT 0x8CE0 #define GL_COLOR_ATTACHMENT1_EXT 0x8CE1 #define GL_COLOR_ATTACHMENT2_EXT 0x8CE2 #define GL_COLOR_ATTACHMENT3_EXT 0x8CE3 #define GL_COLOR_ATTACHMENT4_EXT 0x8CE4 #define GL_COLOR_ATTACHMENT5_EXT 0x8CE5 #define GL_COLOR_ATTACHMENT6_EXT 0x8CE6 #define GL_COLOR_ATTACHMENT7_EXT 0x8CE7 #define GL_COLOR_ATTACHMENT8_EXT 0x8CE8 #define GL_COLOR_ATTACHMENT9_EXT 0x8CE9 #define GL_COLOR_ATTACHMENT10_EXT 0x8CEA #define GL_COLOR_ATTACHMENT11_EXT 0x8CEB #define GL_COLOR_ATTACHMENT12_EXT 0x8CEC #define GL_COLOR_ATTACHMENT13_EXT 0x8CED #define GL_COLOR_ATTACHMENT14_EXT 0x8CEE #define GL_COLOR_ATTACHMENT15_EXT 0x8CEF #define GL_DEPTH_ATTACHMENT_EXT 0x8D00 #define GL_STENCIL_ATTACHMENT_EXT 0x8D20 #define GL_FRAMEBUFFER_EXT 0x8D40 #define GL_RENDERBUFFER_EXT 0x8D41 #define GL_RENDERBUFFER_WIDTH_EXT 0x8D42 #define GL_RENDERBUFFER_HEIGHT_EXT 0x8D43 #define GL_RENDERBUFFER_INTERNAL_FORMAT_EXT 0x8D44 #define GL_STENCIL_INDEX1_EXT 0x8D46 #define GL_STENCIL_INDEX4_EXT 0x8D47 #define GL_STENCIL_INDEX8_EXT 0x8D48 #define GL_STENCIL_INDEX16_EXT 0x8D49 #define GL_RENDERBUFFER_RED_SIZE_EXT 0x8D50 #define GL_RENDERBUFFER_GREEN_SIZE_EXT 0x8D51 #define GL_RENDERBUFFER_BLUE_SIZE_EXT 0x8D52 #define GL_RENDERBUFFER_ALPHA_SIZE_EXT 0x8D53 #define GL_RENDERBUFFER_DEPTH_SIZE_EXT 0x8D54 #define GL_RENDERBUFFER_STENCIL_SIZE_EXT 0x8D55 typedef GLboolean (APIENTRYP PFNGLISRENDERBUFFEREXTPROC) (GLuint renderbuffer); typedef void (APIENTRYP PFNGLBINDRENDERBUFFEREXTPROC) (GLenum target, GLuint renderbuffer); typedef void (APIENTRYP PFNGLDELETERENDERBUFFERSEXTPROC) (GLsizei n, const GLuint *renderbuffers); typedef void (APIENTRYP PFNGLGENRENDERBUFFERSEXTPROC) (GLsizei n, GLuint *renderbuffers); typedef void (APIENTRYP PFNGLRENDERBUFFERSTORAGEEXTPROC) (GLenum target, GLenum internalformat, GLsizei width, GLsizei height); typedef void (APIENTRYP PFNGLGETRENDERBUFFERPARAMETERIVEXTPROC) (GLenum target, GLenum pname, GLint *params); typedef GLboolean (APIENTRYP PFNGLISFRAMEBUFFEREXTPROC) (GLuint framebuffer); typedef void (APIENTRYP PFNGLBINDFRAMEBUFFEREXTPROC) (GLenum target, GLuint framebuffer); typedef void (APIENTRYP PFNGLDELETEFRAMEBUFFERSEXTPROC) (GLsizei n, const GLuint *framebuffers); typedef void (APIENTRYP PFNGLGENFRAMEBUFFERSEXTPROC) (GLsizei n, GLuint *framebuffers); typedef GLenum (APIENTRYP PFNGLCHECKFRAMEBUFFERSTATUSEXTPROC) (GLenum target); typedef void (APIENTRYP PFNGLFRAMEBUFFERTEXTURE1DEXTPROC) (GLenum target, GLenum attachment, GLenum textarget, GLuint texture, GLint level); typedef void (APIENTRYP PFNGLFRAMEBUFFERTEXTURE2DEXTPROC) (GLenum target, GLenum attachment, GLenum textarget, GLuint texture, GLint level); typedef void (APIENTRYP PFNGLFRAMEBUFFERTEXTURE3DEXTPROC) (GLenum target, GLenum attachment, GLenum textarget, GLuint texture, GLint level, GLint zoffset); typedef void (APIENTRYP PFNGLFRAMEBUFFERRENDERBUFFEREXTPROC) (GLenum target, GLenum attachment, GLenum renderbuffertarget, GLuint renderbuffer); typedef void (APIENTRYP PFNGLGETFRAMEBUFFERATTACHMENTPARAMETERIVEXTPROC) (GLenum target, GLenum attachment, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGENERATEMIPMAPEXTPROC) (GLenum target); #ifdef GL_GLEXT_PROTOTYPES GLAPI GLboolean APIENTRY glIsRenderbufferEXT (GLuint renderbuffer); GLAPI void APIENTRY glBindRenderbufferEXT (GLenum target, GLuint renderbuffer); GLAPI void APIENTRY glDeleteRenderbuffersEXT (GLsizei n, const GLuint *renderbuffers); GLAPI void APIENTRY glGenRenderbuffersEXT (GLsizei n, GLuint *renderbuffers); GLAPI void APIENTRY glRenderbufferStorageEXT (GLenum target, GLenum internalformat, GLsizei width, GLsizei height); GLAPI void APIENTRY glGetRenderbufferParameterivEXT (GLenum target, GLenum pname, GLint *params); GLAPI GLboolean APIENTRY glIsFramebufferEXT (GLuint framebuffer); GLAPI void APIENTRY glBindFramebufferEXT (GLenum target, GLuint framebuffer); GLAPI void APIENTRY glDeleteFramebuffersEXT (GLsizei n, const GLuint *framebuffers); GLAPI void APIENTRY glGenFramebuffersEXT (GLsizei n, GLuint *framebuffers); GLAPI GLenum APIENTRY glCheckFramebufferStatusEXT (GLenum target); GLAPI void APIENTRY glFramebufferTexture1DEXT (GLenum target, GLenum attachment, GLenum textarget, GLuint texture, GLint level); GLAPI void APIENTRY glFramebufferTexture2DEXT (GLenum target, GLenum attachment, GLenum textarget, GLuint texture, GLint level); GLAPI void APIENTRY glFramebufferTexture3DEXT (GLenum target, GLenum attachment, GLenum textarget, GLuint texture, GLint level, GLint zoffset); GLAPI void APIENTRY glFramebufferRenderbufferEXT (GLenum target, GLenum attachment, GLenum renderbuffertarget, GLuint renderbuffer); GLAPI void APIENTRY glGetFramebufferAttachmentParameterivEXT (GLenum target, GLenum attachment, GLenum pname, GLint *params); GLAPI void APIENTRY glGenerateMipmapEXT (GLenum target); #endif #endif /* GL_EXT_framebuffer_object */ #ifndef GL_EXT_framebuffer_sRGB #define GL_EXT_framebuffer_sRGB 1 #define GL_FRAMEBUFFER_SRGB_EXT 0x8DB9 #define GL_FRAMEBUFFER_SRGB_CAPABLE_EXT 0x8DBA #endif /* GL_EXT_framebuffer_sRGB */ #ifndef GL_EXT_geometry_shader4 #define GL_EXT_geometry_shader4 1 #define GL_GEOMETRY_SHADER_EXT 0x8DD9 #define GL_GEOMETRY_VERTICES_OUT_EXT 0x8DDA #define GL_GEOMETRY_INPUT_TYPE_EXT 0x8DDB #define GL_GEOMETRY_OUTPUT_TYPE_EXT 0x8DDC #define GL_MAX_GEOMETRY_TEXTURE_IMAGE_UNITS_EXT 0x8C29 #define GL_MAX_GEOMETRY_VARYING_COMPONENTS_EXT 0x8DDD #define GL_MAX_VERTEX_VARYING_COMPONENTS_EXT 0x8DDE #define GL_MAX_VARYING_COMPONENTS_EXT 0x8B4B #define GL_MAX_GEOMETRY_UNIFORM_COMPONENTS_EXT 0x8DDF #define GL_MAX_GEOMETRY_OUTPUT_VERTICES_EXT 0x8DE0 #define GL_MAX_GEOMETRY_TOTAL_OUTPUT_COMPONENTS_EXT 0x8DE1 #define GL_LINES_ADJACENCY_EXT 0x000A #define GL_LINE_STRIP_ADJACENCY_EXT 0x000B #define GL_TRIANGLES_ADJACENCY_EXT 0x000C #define GL_TRIANGLE_STRIP_ADJACENCY_EXT 0x000D #define GL_FRAMEBUFFER_INCOMPLETE_LAYER_TARGETS_EXT 0x8DA8 #define GL_FRAMEBUFFER_INCOMPLETE_LAYER_COUNT_EXT 0x8DA9 #define GL_FRAMEBUFFER_ATTACHMENT_LAYERED_EXT 0x8DA7 #define GL_FRAMEBUFFER_ATTACHMENT_TEXTURE_LAYER_EXT 0x8CD4 #define GL_PROGRAM_POINT_SIZE_EXT 0x8642 typedef void (APIENTRYP PFNGLPROGRAMPARAMETERIEXTPROC) (GLuint program, GLenum pname, GLint value); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glProgramParameteriEXT (GLuint program, GLenum pname, GLint value); #endif #endif /* GL_EXT_geometry_shader4 */ #ifndef GL_EXT_gpu_program_parameters #define GL_EXT_gpu_program_parameters 1 typedef void (APIENTRYP PFNGLPROGRAMENVPARAMETERS4FVEXTPROC) (GLenum target, GLuint index, GLsizei count, const GLfloat *params); typedef void (APIENTRYP PFNGLPROGRAMLOCALPARAMETERS4FVEXTPROC) (GLenum target, GLuint index, GLsizei count, const GLfloat *params); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glProgramEnvParameters4fvEXT (GLenum target, GLuint index, GLsizei count, const GLfloat *params); GLAPI void APIENTRY glProgramLocalParameters4fvEXT (GLenum target, GLuint index, GLsizei count, const GLfloat *params); #endif #endif /* GL_EXT_gpu_program_parameters */ #ifndef GL_EXT_gpu_shader4 #define GL_EXT_gpu_shader4 1 #define GL_VERTEX_ATTRIB_ARRAY_INTEGER_EXT 0x88FD #define GL_SAMPLER_1D_ARRAY_EXT 0x8DC0 #define GL_SAMPLER_2D_ARRAY_EXT 0x8DC1 #define GL_SAMPLER_BUFFER_EXT 0x8DC2 #define GL_SAMPLER_1D_ARRAY_SHADOW_EXT 0x8DC3 #define GL_SAMPLER_2D_ARRAY_SHADOW_EXT 0x8DC4 #define GL_SAMPLER_CUBE_SHADOW_EXT 0x8DC5 #define GL_UNSIGNED_INT_VEC2_EXT 0x8DC6 #define GL_UNSIGNED_INT_VEC3_EXT 0x8DC7 #define GL_UNSIGNED_INT_VEC4_EXT 0x8DC8 #define GL_INT_SAMPLER_1D_EXT 0x8DC9 #define GL_INT_SAMPLER_2D_EXT 0x8DCA #define GL_INT_SAMPLER_3D_EXT 0x8DCB #define GL_INT_SAMPLER_CUBE_EXT 0x8DCC #define GL_INT_SAMPLER_2D_RECT_EXT 0x8DCD #define GL_INT_SAMPLER_1D_ARRAY_EXT 0x8DCE #define GL_INT_SAMPLER_2D_ARRAY_EXT 0x8DCF #define GL_INT_SAMPLER_BUFFER_EXT 0x8DD0 #define GL_UNSIGNED_INT_SAMPLER_1D_EXT 0x8DD1 #define GL_UNSIGNED_INT_SAMPLER_2D_EXT 0x8DD2 #define GL_UNSIGNED_INT_SAMPLER_3D_EXT 0x8DD3 #define GL_UNSIGNED_INT_SAMPLER_CUBE_EXT 0x8DD4 #define GL_UNSIGNED_INT_SAMPLER_2D_RECT_EXT 0x8DD5 #define GL_UNSIGNED_INT_SAMPLER_1D_ARRAY_EXT 0x8DD6 #define GL_UNSIGNED_INT_SAMPLER_2D_ARRAY_EXT 0x8DD7 #define GL_UNSIGNED_INT_SAMPLER_BUFFER_EXT 0x8DD8 #define GL_MIN_PROGRAM_TEXEL_OFFSET_EXT 0x8904 #define GL_MAX_PROGRAM_TEXEL_OFFSET_EXT 0x8905 typedef void (APIENTRYP PFNGLGETUNIFORMUIVEXTPROC) (GLuint program, GLint location, GLuint *params); typedef void (APIENTRYP PFNGLBINDFRAGDATALOCATIONEXTPROC) (GLuint program, GLuint color, const GLchar *name); typedef GLint (APIENTRYP PFNGLGETFRAGDATALOCATIONEXTPROC) (GLuint program, const GLchar *name); typedef void (APIENTRYP PFNGLUNIFORM1UIEXTPROC) (GLint location, GLuint v0); typedef void (APIENTRYP PFNGLUNIFORM2UIEXTPROC) (GLint location, GLuint v0, GLuint v1); typedef void (APIENTRYP PFNGLUNIFORM3UIEXTPROC) (GLint location, GLuint v0, GLuint v1, GLuint v2); typedef void (APIENTRYP PFNGLUNIFORM4UIEXTPROC) (GLint location, GLuint v0, GLuint v1, GLuint v2, GLuint v3); typedef void (APIENTRYP PFNGLUNIFORM1UIVEXTPROC) (GLint location, GLsizei count, const GLuint *value); typedef void (APIENTRYP PFNGLUNIFORM2UIVEXTPROC) (GLint location, GLsizei count, const GLuint *value); typedef void (APIENTRYP PFNGLUNIFORM3UIVEXTPROC) (GLint location, GLsizei count, const GLuint *value); typedef void (APIENTRYP PFNGLUNIFORM4UIVEXTPROC) (GLint location, GLsizei count, const GLuint *value); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glGetUniformuivEXT (GLuint program, GLint location, GLuint *params); GLAPI void APIENTRY glBindFragDataLocationEXT (GLuint program, GLuint color, const GLchar *name); GLAPI GLint APIENTRY glGetFragDataLocationEXT (GLuint program, const GLchar *name); GLAPI void APIENTRY glUniform1uiEXT (GLint location, GLuint v0); GLAPI void APIENTRY glUniform2uiEXT (GLint location, GLuint v0, GLuint v1); GLAPI void APIENTRY glUniform3uiEXT (GLint location, GLuint v0, GLuint v1, GLuint v2); GLAPI void APIENTRY glUniform4uiEXT (GLint location, GLuint v0, GLuint v1, GLuint v2, GLuint v3); GLAPI void APIENTRY glUniform1uivEXT (GLint location, GLsizei count, const GLuint *value); GLAPI void APIENTRY glUniform2uivEXT (GLint location, GLsizei count, const GLuint *value); GLAPI void APIENTRY glUniform3uivEXT (GLint location, GLsizei count, const GLuint *value); GLAPI void APIENTRY glUniform4uivEXT (GLint location, GLsizei count, const GLuint *value); #endif #endif /* GL_EXT_gpu_shader4 */ #ifndef GL_EXT_histogram #define GL_EXT_histogram 1 #define GL_HISTOGRAM_EXT 0x8024 #define GL_PROXY_HISTOGRAM_EXT 0x8025 #define GL_HISTOGRAM_WIDTH_EXT 0x8026 #define GL_HISTOGRAM_FORMAT_EXT 0x8027 #define GL_HISTOGRAM_RED_SIZE_EXT 0x8028 #define GL_HISTOGRAM_GREEN_SIZE_EXT 0x8029 #define GL_HISTOGRAM_BLUE_SIZE_EXT 0x802A #define GL_HISTOGRAM_ALPHA_SIZE_EXT 0x802B #define GL_HISTOGRAM_LUMINANCE_SIZE_EXT 0x802C #define GL_HISTOGRAM_SINK_EXT 0x802D #define GL_MINMAX_EXT 0x802E #define GL_MINMAX_FORMAT_EXT 0x802F #define GL_MINMAX_SINK_EXT 0x8030 #define GL_TABLE_TOO_LARGE_EXT 0x8031 typedef void (APIENTRYP PFNGLGETHISTOGRAMEXTPROC) (GLenum target, GLboolean reset, GLenum format, GLenum type, void *values); typedef void (APIENTRYP PFNGLGETHISTOGRAMPARAMETERFVEXTPROC) (GLenum target, GLenum pname, GLfloat *params); typedef void (APIENTRYP PFNGLGETHISTOGRAMPARAMETERIVEXTPROC) (GLenum target, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGETMINMAXEXTPROC) (GLenum target, GLboolean reset, GLenum format, GLenum type, void *values); typedef void (APIENTRYP PFNGLGETMINMAXPARAMETERFVEXTPROC) (GLenum target, GLenum pname, GLfloat *params); typedef void (APIENTRYP PFNGLGETMINMAXPARAMETERIVEXTPROC) (GLenum target, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLHISTOGRAMEXTPROC) (GLenum target, GLsizei width, GLenum internalformat, GLboolean sink); typedef void (APIENTRYP PFNGLMINMAXEXTPROC) (GLenum target, GLenum internalformat, GLboolean sink); typedef void (APIENTRYP PFNGLRESETHISTOGRAMEXTPROC) (GLenum target); typedef void (APIENTRYP PFNGLRESETMINMAXEXTPROC) (GLenum target); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glGetHistogramEXT (GLenum target, GLboolean reset, GLenum format, GLenum type, void *values); GLAPI void APIENTRY glGetHistogramParameterfvEXT (GLenum target, GLenum pname, GLfloat *params); GLAPI void APIENTRY glGetHistogramParameterivEXT (GLenum target, GLenum pname, GLint *params); GLAPI void APIENTRY glGetMinmaxEXT (GLenum target, GLboolean reset, GLenum format, GLenum type, void *values); GLAPI void APIENTRY glGetMinmaxParameterfvEXT (GLenum target, GLenum pname, GLfloat *params); GLAPI void APIENTRY glGetMinmaxParameterivEXT (GLenum target, GLenum pname, GLint *params); GLAPI void APIENTRY glHistogramEXT (GLenum target, GLsizei width, GLenum internalformat, GLboolean sink); GLAPI void APIENTRY glMinmaxEXT (GLenum target, GLenum internalformat, GLboolean sink); GLAPI void APIENTRY glResetHistogramEXT (GLenum target); GLAPI void APIENTRY glResetMinmaxEXT (GLenum target); #endif #endif /* GL_EXT_histogram */ #ifndef GL_EXT_index_array_formats #define GL_EXT_index_array_formats 1 #define GL_IUI_V2F_EXT 0x81AD #define GL_IUI_V3F_EXT 0x81AE #define GL_IUI_N3F_V2F_EXT 0x81AF #define GL_IUI_N3F_V3F_EXT 0x81B0 #define GL_T2F_IUI_V2F_EXT 0x81B1 #define GL_T2F_IUI_V3F_EXT 0x81B2 #define GL_T2F_IUI_N3F_V2F_EXT 0x81B3 #define GL_T2F_IUI_N3F_V3F_EXT 0x81B4 #endif /* GL_EXT_index_array_formats */ #ifndef GL_EXT_index_func #define GL_EXT_index_func 1 #define GL_INDEX_TEST_EXT 0x81B5 #define GL_INDEX_TEST_FUNC_EXT 0x81B6 #define GL_INDEX_TEST_REF_EXT 0x81B7 typedef void (APIENTRYP PFNGLINDEXFUNCEXTPROC) (GLenum func, GLclampf ref); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glIndexFuncEXT (GLenum func, GLclampf ref); #endif #endif /* GL_EXT_index_func */ #ifndef GL_EXT_index_material #define GL_EXT_index_material 1 #define GL_INDEX_MATERIAL_EXT 0x81B8 #define GL_INDEX_MATERIAL_PARAMETER_EXT 0x81B9 #define GL_INDEX_MATERIAL_FACE_EXT 0x81BA typedef void (APIENTRYP PFNGLINDEXMATERIALEXTPROC) (GLenum face, GLenum mode); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glIndexMaterialEXT (GLenum face, GLenum mode); #endif #endif /* GL_EXT_index_material */ #ifndef GL_EXT_index_texture #define GL_EXT_index_texture 1 #endif /* GL_EXT_index_texture */ #ifndef GL_EXT_light_texture #define GL_EXT_light_texture 1 #define GL_FRAGMENT_MATERIAL_EXT 0x8349 #define GL_FRAGMENT_NORMAL_EXT 0x834A #define GL_FRAGMENT_COLOR_EXT 0x834C #define GL_ATTENUATION_EXT 0x834D #define GL_SHADOW_ATTENUATION_EXT 0x834E #define GL_TEXTURE_APPLICATION_MODE_EXT 0x834F #define GL_TEXTURE_LIGHT_EXT 0x8350 #define GL_TEXTURE_MATERIAL_FACE_EXT 0x8351 #define GL_TEXTURE_MATERIAL_PARAMETER_EXT 0x8352 typedef void (APIENTRYP PFNGLAPPLYTEXTUREEXTPROC) (GLenum mode); typedef void (APIENTRYP PFNGLTEXTURELIGHTEXTPROC) (GLenum pname); typedef void (APIENTRYP PFNGLTEXTUREMATERIALEXTPROC) (GLenum face, GLenum mode); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glApplyTextureEXT (GLenum mode); GLAPI void APIENTRY glTextureLightEXT (GLenum pname); GLAPI void APIENTRY glTextureMaterialEXT (GLenum face, GLenum mode); #endif #endif /* GL_EXT_light_texture */ #ifndef GL_EXT_misc_attribute #define GL_EXT_misc_attribute 1 #endif /* GL_EXT_misc_attribute */ #ifndef GL_EXT_multi_draw_arrays #define GL_EXT_multi_draw_arrays 1 typedef void (APIENTRYP PFNGLMULTIDRAWARRAYSEXTPROC) (GLenum mode, const GLint *first, const GLsizei *count, GLsizei primcount); typedef void (APIENTRYP PFNGLMULTIDRAWELEMENTSEXTPROC) (GLenum mode, const GLsizei *count, GLenum type, const void *const*indices, GLsizei primcount); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glMultiDrawArraysEXT (GLenum mode, const GLint *first, const GLsizei *count, GLsizei primcount); GLAPI void APIENTRY glMultiDrawElementsEXT (GLenum mode, const GLsizei *count, GLenum type, const void *const*indices, GLsizei primcount); #endif #endif /* GL_EXT_multi_draw_arrays */ #ifndef GL_EXT_multisample #define GL_EXT_multisample 1 #define GL_MULTISAMPLE_EXT 0x809D #define GL_SAMPLE_ALPHA_TO_MASK_EXT 0x809E #define GL_SAMPLE_ALPHA_TO_ONE_EXT 0x809F #define GL_SAMPLE_MASK_EXT 0x80A0 #define GL_1PASS_EXT 0x80A1 #define GL_2PASS_0_EXT 0x80A2 #define GL_2PASS_1_EXT 0x80A3 #define GL_4PASS_0_EXT 0x80A4 #define GL_4PASS_1_EXT 0x80A5 #define GL_4PASS_2_EXT 0x80A6 #define GL_4PASS_3_EXT 0x80A7 #define GL_SAMPLE_BUFFERS_EXT 0x80A8 #define GL_SAMPLES_EXT 0x80A9 #define GL_SAMPLE_MASK_VALUE_EXT 0x80AA #define GL_SAMPLE_MASK_INVERT_EXT 0x80AB #define GL_SAMPLE_PATTERN_EXT 0x80AC #define GL_MULTISAMPLE_BIT_EXT 0x20000000 typedef void (APIENTRYP PFNGLSAMPLEMASKEXTPROC) (GLclampf value, GLboolean invert); typedef void (APIENTRYP PFNGLSAMPLEPATTERNEXTPROC) (GLenum pattern); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glSampleMaskEXT (GLclampf value, GLboolean invert); GLAPI void APIENTRY glSamplePatternEXT (GLenum pattern); #endif #endif /* GL_EXT_multisample */ #ifndef GL_EXT_packed_depth_stencil #define GL_EXT_packed_depth_stencil 1 #define GL_DEPTH_STENCIL_EXT 0x84F9 #define GL_UNSIGNED_INT_24_8_EXT 0x84FA #define GL_DEPTH24_STENCIL8_EXT 0x88F0 #define GL_TEXTURE_STENCIL_SIZE_EXT 0x88F1 #endif /* GL_EXT_packed_depth_stencil */ #ifndef GL_EXT_packed_float #define GL_EXT_packed_float 1 #define GL_R11F_G11F_B10F_EXT 0x8C3A #define GL_UNSIGNED_INT_10F_11F_11F_REV_EXT 0x8C3B #define GL_RGBA_SIGNED_COMPONENTS_EXT 0x8C3C #endif /* GL_EXT_packed_float */ #ifndef GL_EXT_packed_pixels #define GL_EXT_packed_pixels 1 #define GL_UNSIGNED_BYTE_3_3_2_EXT 0x8032 #define GL_UNSIGNED_SHORT_4_4_4_4_EXT 0x8033 #define GL_UNSIGNED_SHORT_5_5_5_1_EXT 0x8034 #define GL_UNSIGNED_INT_8_8_8_8_EXT 0x8035 #define GL_UNSIGNED_INT_10_10_10_2_EXT 0x8036 #endif /* GL_EXT_packed_pixels */ #ifndef GL_EXT_paletted_texture #define GL_EXT_paletted_texture 1 #define GL_COLOR_INDEX1_EXT 0x80E2 #define GL_COLOR_INDEX2_EXT 0x80E3 #define GL_COLOR_INDEX4_EXT 0x80E4 #define GL_COLOR_INDEX8_EXT 0x80E5 #define GL_COLOR_INDEX12_EXT 0x80E6 #define GL_COLOR_INDEX16_EXT 0x80E7 #define GL_TEXTURE_INDEX_SIZE_EXT 0x80ED typedef void (APIENTRYP PFNGLCOLORTABLEEXTPROC) (GLenum target, GLenum internalFormat, GLsizei width, GLenum format, GLenum type, const void *table); typedef void (APIENTRYP PFNGLGETCOLORTABLEEXTPROC) (GLenum target, GLenum format, GLenum type, void *data); typedef void (APIENTRYP PFNGLGETCOLORTABLEPARAMETERIVEXTPROC) (GLenum target, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGETCOLORTABLEPARAMETERFVEXTPROC) (GLenum target, GLenum pname, GLfloat *params); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glColorTableEXT (GLenum target, GLenum internalFormat, GLsizei width, GLenum format, GLenum type, const void *table); GLAPI void APIENTRY glGetColorTableEXT (GLenum target, GLenum format, GLenum type, void *data); GLAPI void APIENTRY glGetColorTableParameterivEXT (GLenum target, GLenum pname, GLint *params); GLAPI void APIENTRY glGetColorTableParameterfvEXT (GLenum target, GLenum pname, GLfloat *params); #endif #endif /* GL_EXT_paletted_texture */ #ifndef GL_EXT_pixel_buffer_object #define GL_EXT_pixel_buffer_object 1 #define GL_PIXEL_PACK_BUFFER_EXT 0x88EB #define GL_PIXEL_UNPACK_BUFFER_EXT 0x88EC #define GL_PIXEL_PACK_BUFFER_BINDING_EXT 0x88ED #define GL_PIXEL_UNPACK_BUFFER_BINDING_EXT 0x88EF #endif /* GL_EXT_pixel_buffer_object */ #ifndef GL_EXT_pixel_transform #define GL_EXT_pixel_transform 1 #define GL_PIXEL_TRANSFORM_2D_EXT 0x8330 #define GL_PIXEL_MAG_FILTER_EXT 0x8331 #define GL_PIXEL_MIN_FILTER_EXT 0x8332 #define GL_PIXEL_CUBIC_WEIGHT_EXT 0x8333 #define GL_CUBIC_EXT 0x8334 #define GL_AVERAGE_EXT 0x8335 #define GL_PIXEL_TRANSFORM_2D_STACK_DEPTH_EXT 0x8336 #define GL_MAX_PIXEL_TRANSFORM_2D_STACK_DEPTH_EXT 0x8337 #define GL_PIXEL_TRANSFORM_2D_MATRIX_EXT 0x8338 typedef void (APIENTRYP PFNGLPIXELTRANSFORMPARAMETERIEXTPROC) (GLenum target, GLenum pname, GLint param); typedef void (APIENTRYP PFNGLPIXELTRANSFORMPARAMETERFEXTPROC) (GLenum target, GLenum pname, GLfloat param); typedef void (APIENTRYP PFNGLPIXELTRANSFORMPARAMETERIVEXTPROC) (GLenum target, GLenum pname, const GLint *params); typedef void (APIENTRYP PFNGLPIXELTRANSFORMPARAMETERFVEXTPROC) (GLenum target, GLenum pname, const GLfloat *params); typedef void (APIENTRYP PFNGLGETPIXELTRANSFORMPARAMETERIVEXTPROC) (GLenum target, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGETPIXELTRANSFORMPARAMETERFVEXTPROC) (GLenum target, GLenum pname, GLfloat *params); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glPixelTransformParameteriEXT (GLenum target, GLenum pname, GLint param); GLAPI void APIENTRY glPixelTransformParameterfEXT (GLenum target, GLenum pname, GLfloat param); GLAPI void APIENTRY glPixelTransformParameterivEXT (GLenum target, GLenum pname, const GLint *params); GLAPI void APIENTRY glPixelTransformParameterfvEXT (GLenum target, GLenum pname, const GLfloat *params); GLAPI void APIENTRY glGetPixelTransformParameterivEXT (GLenum target, GLenum pname, GLint *params); GLAPI void APIENTRY glGetPixelTransformParameterfvEXT (GLenum target, GLenum pname, GLfloat *params); #endif #endif /* GL_EXT_pixel_transform */ #ifndef GL_EXT_pixel_transform_color_table #define GL_EXT_pixel_transform_color_table 1 #endif /* GL_EXT_pixel_transform_color_table */ #ifndef GL_EXT_point_parameters #define GL_EXT_point_parameters 1 #define GL_POINT_SIZE_MIN_EXT 0x8126 #define GL_POINT_SIZE_MAX_EXT 0x8127 #define GL_POINT_FADE_THRESHOLD_SIZE_EXT 0x8128 #define GL_DISTANCE_ATTENUATION_EXT 0x8129 typedef void (APIENTRYP PFNGLPOINTPARAMETERFEXTPROC) (GLenum pname, GLfloat param); typedef void (APIENTRYP PFNGLPOINTPARAMETERFVEXTPROC) (GLenum pname, const GLfloat *params); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glPointParameterfEXT (GLenum pname, GLfloat param); GLAPI void APIENTRY glPointParameterfvEXT (GLenum pname, const GLfloat *params); #endif #endif /* GL_EXT_point_parameters */ #ifndef GL_EXT_polygon_offset #define GL_EXT_polygon_offset 1 #define GL_POLYGON_OFFSET_EXT 0x8037 #define GL_POLYGON_OFFSET_FACTOR_EXT 0x8038 #define GL_POLYGON_OFFSET_BIAS_EXT 0x8039 typedef void (APIENTRYP PFNGLPOLYGONOFFSETEXTPROC) (GLfloat factor, GLfloat bias); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glPolygonOffsetEXT (GLfloat factor, GLfloat bias); #endif #endif /* GL_EXT_polygon_offset */ #ifndef GL_EXT_provoking_vertex #define GL_EXT_provoking_vertex 1 #define GL_QUADS_FOLLOW_PROVOKING_VERTEX_CONVENTION_EXT 0x8E4C #define GL_FIRST_VERTEX_CONVENTION_EXT 0x8E4D #define GL_LAST_VERTEX_CONVENTION_EXT 0x8E4E #define GL_PROVOKING_VERTEX_EXT 0x8E4F typedef void (APIENTRYP PFNGLPROVOKINGVERTEXEXTPROC) (GLenum mode); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glProvokingVertexEXT (GLenum mode); #endif #endif /* GL_EXT_provoking_vertex */ #ifndef GL_EXT_rescale_normal #define GL_EXT_rescale_normal 1 #define GL_RESCALE_NORMAL_EXT 0x803A #endif /* GL_EXT_rescale_normal */ #ifndef GL_EXT_secondary_color #define GL_EXT_secondary_color 1 #define GL_COLOR_SUM_EXT 0x8458 #define GL_CURRENT_SECONDARY_COLOR_EXT 0x8459 #define GL_SECONDARY_COLOR_ARRAY_SIZE_EXT 0x845A #define GL_SECONDARY_COLOR_ARRAY_TYPE_EXT 0x845B #define GL_SECONDARY_COLOR_ARRAY_STRIDE_EXT 0x845C #define GL_SECONDARY_COLOR_ARRAY_POINTER_EXT 0x845D #define GL_SECONDARY_COLOR_ARRAY_EXT 0x845E typedef void (APIENTRYP PFNGLSECONDARYCOLOR3BEXTPROC) (GLbyte red, GLbyte green, GLbyte blue); typedef void (APIENTRYP PFNGLSECONDARYCOLOR3BVEXTPROC) (const GLbyte *v); typedef void (APIENTRYP PFNGLSECONDARYCOLOR3DEXTPROC) (GLdouble red, GLdouble green, GLdouble blue); typedef void (APIENTRYP PFNGLSECONDARYCOLOR3DVEXTPROC) (const GLdouble *v); typedef void (APIENTRYP PFNGLSECONDARYCOLOR3FEXTPROC) (GLfloat red, GLfloat green, GLfloat blue); typedef void (APIENTRYP PFNGLSECONDARYCOLOR3FVEXTPROC) (const GLfloat *v); typedef void (APIENTRYP PFNGLSECONDARYCOLOR3IEXTPROC) (GLint red, GLint green, GLint blue); typedef void (APIENTRYP PFNGLSECONDARYCOLOR3IVEXTPROC) (const GLint *v); typedef void (APIENTRYP PFNGLSECONDARYCOLOR3SEXTPROC) (GLshort red, GLshort green, GLshort blue); typedef void (APIENTRYP PFNGLSECONDARYCOLOR3SVEXTPROC) (const GLshort *v); typedef void (APIENTRYP PFNGLSECONDARYCOLOR3UBEXTPROC) (GLubyte red, GLubyte green, GLubyte blue); typedef void (APIENTRYP PFNGLSECONDARYCOLOR3UBVEXTPROC) (const GLubyte *v); typedef void (APIENTRYP PFNGLSECONDARYCOLOR3UIEXTPROC) (GLuint red, GLuint green, GLuint blue); typedef void (APIENTRYP PFNGLSECONDARYCOLOR3UIVEXTPROC) (const GLuint *v); typedef void (APIENTRYP PFNGLSECONDARYCOLOR3USEXTPROC) (GLushort red, GLushort green, GLushort blue); typedef void (APIENTRYP PFNGLSECONDARYCOLOR3USVEXTPROC) (const GLushort *v); typedef void (APIENTRYP PFNGLSECONDARYCOLORPOINTEREXTPROC) (GLint size, GLenum type, GLsizei stride, const void *pointer); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glSecondaryColor3bEXT (GLbyte red, GLbyte green, GLbyte blue); GLAPI void APIENTRY glSecondaryColor3bvEXT (const GLbyte *v); GLAPI void APIENTRY glSecondaryColor3dEXT (GLdouble red, GLdouble green, GLdouble blue); GLAPI void APIENTRY glSecondaryColor3dvEXT (const GLdouble *v); GLAPI void APIENTRY glSecondaryColor3fEXT (GLfloat red, GLfloat green, GLfloat blue); GLAPI void APIENTRY glSecondaryColor3fvEXT (const GLfloat *v); GLAPI void APIENTRY glSecondaryColor3iEXT (GLint red, GLint green, GLint blue); GLAPI void APIENTRY glSecondaryColor3ivEXT (const GLint *v); GLAPI void APIENTRY glSecondaryColor3sEXT (GLshort red, GLshort green, GLshort blue); GLAPI void APIENTRY glSecondaryColor3svEXT (const GLshort *v); GLAPI void APIENTRY glSecondaryColor3ubEXT (GLubyte red, GLubyte green, GLubyte blue); GLAPI void APIENTRY glSecondaryColor3ubvEXT (const GLubyte *v); GLAPI void APIENTRY glSecondaryColor3uiEXT (GLuint red, GLuint green, GLuint blue); GLAPI void APIENTRY glSecondaryColor3uivEXT (const GLuint *v); GLAPI void APIENTRY glSecondaryColor3usEXT (GLushort red, GLushort green, GLushort blue); GLAPI void APIENTRY glSecondaryColor3usvEXT (const GLushort *v); GLAPI void APIENTRY glSecondaryColorPointerEXT (GLint size, GLenum type, GLsizei stride, const void *pointer); #endif #endif /* GL_EXT_secondary_color */ #ifndef GL_EXT_separate_shader_objects #define GL_EXT_separate_shader_objects 1 #define GL_ACTIVE_PROGRAM_EXT 0x8B8D typedef void (APIENTRYP PFNGLUSESHADERPROGRAMEXTPROC) (GLenum type, GLuint program); typedef void (APIENTRYP PFNGLACTIVEPROGRAMEXTPROC) (GLuint program); typedef GLuint (APIENTRYP PFNGLCREATESHADERPROGRAMEXTPROC) (GLenum type, const GLchar *string); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glUseShaderProgramEXT (GLenum type, GLuint program); GLAPI void APIENTRY glActiveProgramEXT (GLuint program); GLAPI GLuint APIENTRY glCreateShaderProgramEXT (GLenum type, const GLchar *string); #endif #endif /* GL_EXT_separate_shader_objects */ #ifndef GL_EXT_separate_specular_color #define GL_EXT_separate_specular_color 1 #define GL_LIGHT_MODEL_COLOR_CONTROL_EXT 0x81F8 #define GL_SINGLE_COLOR_EXT 0x81F9 #define GL_SEPARATE_SPECULAR_COLOR_EXT 0x81FA #endif /* GL_EXT_separate_specular_color */ #ifndef GL_EXT_shader_image_load_store #define GL_EXT_shader_image_load_store 1 #define GL_MAX_IMAGE_UNITS_EXT 0x8F38 #define GL_MAX_COMBINED_IMAGE_UNITS_AND_FRAGMENT_OUTPUTS_EXT 0x8F39 #define GL_IMAGE_BINDING_NAME_EXT 0x8F3A #define GL_IMAGE_BINDING_LEVEL_EXT 0x8F3B #define GL_IMAGE_BINDING_LAYERED_EXT 0x8F3C #define GL_IMAGE_BINDING_LAYER_EXT 0x8F3D #define GL_IMAGE_BINDING_ACCESS_EXT 0x8F3E #define GL_IMAGE_1D_EXT 0x904C #define GL_IMAGE_2D_EXT 0x904D #define GL_IMAGE_3D_EXT 0x904E #define GL_IMAGE_2D_RECT_EXT 0x904F #define GL_IMAGE_CUBE_EXT 0x9050 #define GL_IMAGE_BUFFER_EXT 0x9051 #define GL_IMAGE_1D_ARRAY_EXT 0x9052 #define GL_IMAGE_2D_ARRAY_EXT 0x9053 #define GL_IMAGE_CUBE_MAP_ARRAY_EXT 0x9054 #define GL_IMAGE_2D_MULTISAMPLE_EXT 0x9055 #define GL_IMAGE_2D_MULTISAMPLE_ARRAY_EXT 0x9056 #define GL_INT_IMAGE_1D_EXT 0x9057 #define GL_INT_IMAGE_2D_EXT 0x9058 #define GL_INT_IMAGE_3D_EXT 0x9059 #define GL_INT_IMAGE_2D_RECT_EXT 0x905A #define GL_INT_IMAGE_CUBE_EXT 0x905B #define GL_INT_IMAGE_BUFFER_EXT 0x905C #define GL_INT_IMAGE_1D_ARRAY_EXT 0x905D #define GL_INT_IMAGE_2D_ARRAY_EXT 0x905E #define GL_INT_IMAGE_CUBE_MAP_ARRAY_EXT 0x905F #define GL_INT_IMAGE_2D_MULTISAMPLE_EXT 0x9060 #define GL_INT_IMAGE_2D_MULTISAMPLE_ARRAY_EXT 0x9061 #define GL_UNSIGNED_INT_IMAGE_1D_EXT 0x9062 #define GL_UNSIGNED_INT_IMAGE_2D_EXT 0x9063 #define GL_UNSIGNED_INT_IMAGE_3D_EXT 0x9064 #define GL_UNSIGNED_INT_IMAGE_2D_RECT_EXT 0x9065 #define GL_UNSIGNED_INT_IMAGE_CUBE_EXT 0x9066 #define GL_UNSIGNED_INT_IMAGE_BUFFER_EXT 0x9067 #define GL_UNSIGNED_INT_IMAGE_1D_ARRAY_EXT 0x9068 #define GL_UNSIGNED_INT_IMAGE_2D_ARRAY_EXT 0x9069 #define GL_UNSIGNED_INT_IMAGE_CUBE_MAP_ARRAY_EXT 0x906A #define GL_UNSIGNED_INT_IMAGE_2D_MULTISAMPLE_EXT 0x906B #define GL_UNSIGNED_INT_IMAGE_2D_MULTISAMPLE_ARRAY_EXT 0x906C #define GL_MAX_IMAGE_SAMPLES_EXT 0x906D #define GL_IMAGE_BINDING_FORMAT_EXT 0x906E #define GL_VERTEX_ATTRIB_ARRAY_BARRIER_BIT_EXT 0x00000001 #define GL_ELEMENT_ARRAY_BARRIER_BIT_EXT 0x00000002 #define GL_UNIFORM_BARRIER_BIT_EXT 0x00000004 #define GL_TEXTURE_FETCH_BARRIER_BIT_EXT 0x00000008 #define GL_SHADER_IMAGE_ACCESS_BARRIER_BIT_EXT 0x00000020 #define GL_COMMAND_BARRIER_BIT_EXT 0x00000040 #define GL_PIXEL_BUFFER_BARRIER_BIT_EXT 0x00000080 #define GL_TEXTURE_UPDATE_BARRIER_BIT_EXT 0x00000100 #define GL_BUFFER_UPDATE_BARRIER_BIT_EXT 0x00000200 #define GL_FRAMEBUFFER_BARRIER_BIT_EXT 0x00000400 #define GL_TRANSFORM_FEEDBACK_BARRIER_BIT_EXT 0x00000800 #define GL_ATOMIC_COUNTER_BARRIER_BIT_EXT 0x00001000 #define GL_ALL_BARRIER_BITS_EXT 0xFFFFFFFF typedef void (APIENTRYP PFNGLBINDIMAGETEXTUREEXTPROC) (GLuint index, GLuint texture, GLint level, GLboolean layered, GLint layer, GLenum access, GLint format); typedef void (APIENTRYP PFNGLMEMORYBARRIEREXTPROC) (GLbitfield barriers); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glBindImageTextureEXT (GLuint index, GLuint texture, GLint level, GLboolean layered, GLint layer, GLenum access, GLint format); GLAPI void APIENTRY glMemoryBarrierEXT (GLbitfield barriers); #endif #endif /* GL_EXT_shader_image_load_store */ #ifndef GL_EXT_shader_integer_mix #define GL_EXT_shader_integer_mix 1 #endif /* GL_EXT_shader_integer_mix */ #ifndef GL_EXT_shadow_funcs #define GL_EXT_shadow_funcs 1 #endif /* GL_EXT_shadow_funcs */ #ifndef GL_EXT_shared_texture_palette #define GL_EXT_shared_texture_palette 1 #define GL_SHARED_TEXTURE_PALETTE_EXT 0x81FB #endif /* GL_EXT_shared_texture_palette */ #ifndef GL_EXT_stencil_clear_tag #define GL_EXT_stencil_clear_tag 1 #define GL_STENCIL_TAG_BITS_EXT 0x88F2 #define GL_STENCIL_CLEAR_TAG_VALUE_EXT 0x88F3 typedef void (APIENTRYP PFNGLSTENCILCLEARTAGEXTPROC) (GLsizei stencilTagBits, GLuint stencilClearTag); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glStencilClearTagEXT (GLsizei stencilTagBits, GLuint stencilClearTag); #endif #endif /* GL_EXT_stencil_clear_tag */ #ifndef GL_EXT_stencil_two_side #define GL_EXT_stencil_two_side 1 #define GL_STENCIL_TEST_TWO_SIDE_EXT 0x8910 #define GL_ACTIVE_STENCIL_FACE_EXT 0x8911 typedef void (APIENTRYP PFNGLACTIVESTENCILFACEEXTPROC) (GLenum face); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glActiveStencilFaceEXT (GLenum face); #endif #endif /* GL_EXT_stencil_two_side */ #ifndef GL_EXT_stencil_wrap #define GL_EXT_stencil_wrap 1 #define GL_INCR_WRAP_EXT 0x8507 #define GL_DECR_WRAP_EXT 0x8508 #endif /* GL_EXT_stencil_wrap */ #ifndef GL_EXT_subtexture #define GL_EXT_subtexture 1 typedef void (APIENTRYP PFNGLTEXSUBIMAGE1DEXTPROC) (GLenum target, GLint level, GLint xoffset, GLsizei width, GLenum format, GLenum type, const void *pixels); typedef void (APIENTRYP PFNGLTEXSUBIMAGE2DEXTPROC) (GLenum target, GLint level, GLint xoffset, GLint yoffset, GLsizei width, GLsizei height, GLenum format, GLenum type, const void *pixels); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glTexSubImage1DEXT (GLenum target, GLint level, GLint xoffset, GLsizei width, GLenum format, GLenum type, const void *pixels); GLAPI void APIENTRY glTexSubImage2DEXT (GLenum target, GLint level, GLint xoffset, GLint yoffset, GLsizei width, GLsizei height, GLenum format, GLenum type, const void *pixels); #endif #endif /* GL_EXT_subtexture */ #ifndef GL_EXT_texture #define GL_EXT_texture 1 #define GL_ALPHA4_EXT 0x803B #define GL_ALPHA8_EXT 0x803C #define GL_ALPHA12_EXT 0x803D #define GL_ALPHA16_EXT 0x803E #define GL_LUMINANCE4_EXT 0x803F #define GL_LUMINANCE8_EXT 0x8040 #define GL_LUMINANCE12_EXT 0x8041 #define GL_LUMINANCE16_EXT 0x8042 #define GL_LUMINANCE4_ALPHA4_EXT 0x8043 #define GL_LUMINANCE6_ALPHA2_EXT 0x8044 #define GL_LUMINANCE8_ALPHA8_EXT 0x8045 #define GL_LUMINANCE12_ALPHA4_EXT 0x8046 #define GL_LUMINANCE12_ALPHA12_EXT 0x8047 #define GL_LUMINANCE16_ALPHA16_EXT 0x8048 #define GL_INTENSITY_EXT 0x8049 #define GL_INTENSITY4_EXT 0x804A #define GL_INTENSITY8_EXT 0x804B #define GL_INTENSITY12_EXT 0x804C #define GL_INTENSITY16_EXT 0x804D #define GL_RGB2_EXT 0x804E #define GL_RGB4_EXT 0x804F #define GL_RGB5_EXT 0x8050 #define GL_RGB8_EXT 0x8051 #define GL_RGB10_EXT 0x8052 #define GL_RGB12_EXT 0x8053 #define GL_RGB16_EXT 0x8054 #define GL_RGBA2_EXT 0x8055 #define GL_RGBA4_EXT 0x8056 #define GL_RGB5_A1_EXT 0x8057 #define GL_RGBA8_EXT 0x8058 #define GL_RGB10_A2_EXT 0x8059 #define GL_RGBA12_EXT 0x805A #define GL_RGBA16_EXT 0x805B #define GL_TEXTURE_RED_SIZE_EXT 0x805C #define GL_TEXTURE_GREEN_SIZE_EXT 0x805D #define GL_TEXTURE_BLUE_SIZE_EXT 0x805E #define GL_TEXTURE_ALPHA_SIZE_EXT 0x805F #define GL_TEXTURE_LUMINANCE_SIZE_EXT 0x8060 #define GL_TEXTURE_INTENSITY_SIZE_EXT 0x8061 #define GL_REPLACE_EXT 0x8062 #define GL_PROXY_TEXTURE_1D_EXT 0x8063 #define GL_PROXY_TEXTURE_2D_EXT 0x8064 #define GL_TEXTURE_TOO_LARGE_EXT 0x8065 #endif /* GL_EXT_texture */ #ifndef GL_EXT_texture3D #define GL_EXT_texture3D 1 #define GL_PACK_SKIP_IMAGES_EXT 0x806B #define GL_PACK_IMAGE_HEIGHT_EXT 0x806C #define GL_UNPACK_SKIP_IMAGES_EXT 0x806D #define GL_UNPACK_IMAGE_HEIGHT_EXT 0x806E #define GL_TEXTURE_3D_EXT 0x806F #define GL_PROXY_TEXTURE_3D_EXT 0x8070 #define GL_TEXTURE_DEPTH_EXT 0x8071 #define GL_TEXTURE_WRAP_R_EXT 0x8072 #define GL_MAX_3D_TEXTURE_SIZE_EXT 0x8073 typedef void (APIENTRYP PFNGLTEXIMAGE3DEXTPROC) (GLenum target, GLint level, GLenum internalformat, GLsizei width, GLsizei height, GLsizei depth, GLint border, GLenum format, GLenum type, const void *pixels); typedef void (APIENTRYP PFNGLTEXSUBIMAGE3DEXTPROC) (GLenum target, GLint level, GLint xoffset, GLint yoffset, GLint zoffset, GLsizei width, GLsizei height, GLsizei depth, GLenum format, GLenum type, const void *pixels); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glTexImage3DEXT (GLenum target, GLint level, GLenum internalformat, GLsizei width, GLsizei height, GLsizei depth, GLint border, GLenum format, GLenum type, const void *pixels); GLAPI void APIENTRY glTexSubImage3DEXT (GLenum target, GLint level, GLint xoffset, GLint yoffset, GLint zoffset, GLsizei width, GLsizei height, GLsizei depth, GLenum format, GLenum type, const void *pixels); #endif #endif /* GL_EXT_texture3D */ #ifndef GL_EXT_texture_array #define GL_EXT_texture_array 1 #define GL_TEXTURE_1D_ARRAY_EXT 0x8C18 #define GL_PROXY_TEXTURE_1D_ARRAY_EXT 0x8C19 #define GL_TEXTURE_2D_ARRAY_EXT 0x8C1A #define GL_PROXY_TEXTURE_2D_ARRAY_EXT 0x8C1B #define GL_TEXTURE_BINDING_1D_ARRAY_EXT 0x8C1C #define GL_TEXTURE_BINDING_2D_ARRAY_EXT 0x8C1D #define GL_MAX_ARRAY_TEXTURE_LAYERS_EXT 0x88FF #define GL_COMPARE_REF_DEPTH_TO_TEXTURE_EXT 0x884E #endif /* GL_EXT_texture_array */ #ifndef GL_EXT_texture_buffer_object #define GL_EXT_texture_buffer_object 1 #define GL_TEXTURE_BUFFER_EXT 0x8C2A #define GL_MAX_TEXTURE_BUFFER_SIZE_EXT 0x8C2B #define GL_TEXTURE_BINDING_BUFFER_EXT 0x8C2C #define GL_TEXTURE_BUFFER_DATA_STORE_BINDING_EXT 0x8C2D #define GL_TEXTURE_BUFFER_FORMAT_EXT 0x8C2E typedef void (APIENTRYP PFNGLTEXBUFFEREXTPROC) (GLenum target, GLenum internalformat, GLuint buffer); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glTexBufferEXT (GLenum target, GLenum internalformat, GLuint buffer); #endif #endif /* GL_EXT_texture_buffer_object */ #ifndef GL_EXT_texture_compression_latc #define GL_EXT_texture_compression_latc 1 #define GL_COMPRESSED_LUMINANCE_LATC1_EXT 0x8C70 #define GL_COMPRESSED_SIGNED_LUMINANCE_LATC1_EXT 0x8C71 #define GL_COMPRESSED_LUMINANCE_ALPHA_LATC2_EXT 0x8C72 #define GL_COMPRESSED_SIGNED_LUMINANCE_ALPHA_LATC2_EXT 0x8C73 #endif /* GL_EXT_texture_compression_latc */ #ifndef GL_EXT_texture_compression_rgtc #define GL_EXT_texture_compression_rgtc 1 #define GL_COMPRESSED_RED_RGTC1_EXT 0x8DBB #define GL_COMPRESSED_SIGNED_RED_RGTC1_EXT 0x8DBC #define GL_COMPRESSED_RED_GREEN_RGTC2_EXT 0x8DBD #define GL_COMPRESSED_SIGNED_RED_GREEN_RGTC2_EXT 0x8DBE #endif /* GL_EXT_texture_compression_rgtc */ #ifndef GL_EXT_texture_compression_s3tc #define GL_EXT_texture_compression_s3tc 1 #define GL_COMPRESSED_RGB_S3TC_DXT1_EXT 0x83F0 #define GL_COMPRESSED_RGBA_S3TC_DXT1_EXT 0x83F1 #define GL_COMPRESSED_RGBA_S3TC_DXT3_EXT 0x83F2 #define GL_COMPRESSED_RGBA_S3TC_DXT5_EXT 0x83F3 #endif /* GL_EXT_texture_compression_s3tc */ #ifndef GL_EXT_texture_cube_map #define GL_EXT_texture_cube_map 1 #define GL_NORMAL_MAP_EXT 0x8511 #define GL_REFLECTION_MAP_EXT 0x8512 #define GL_TEXTURE_CUBE_MAP_EXT 0x8513 #define GL_TEXTURE_BINDING_CUBE_MAP_EXT 0x8514 #define GL_TEXTURE_CUBE_MAP_POSITIVE_X_EXT 0x8515 #define GL_TEXTURE_CUBE_MAP_NEGATIVE_X_EXT 0x8516 #define GL_TEXTURE_CUBE_MAP_POSITIVE_Y_EXT 0x8517 #define GL_TEXTURE_CUBE_MAP_NEGATIVE_Y_EXT 0x8518 #define GL_TEXTURE_CUBE_MAP_POSITIVE_Z_EXT 0x8519 #define GL_TEXTURE_CUBE_MAP_NEGATIVE_Z_EXT 0x851A #define GL_PROXY_TEXTURE_CUBE_MAP_EXT 0x851B #define GL_MAX_CUBE_MAP_TEXTURE_SIZE_EXT 0x851C #endif /* GL_EXT_texture_cube_map */ #ifndef GL_EXT_texture_env_add #define GL_EXT_texture_env_add 1 #endif /* GL_EXT_texture_env_add */ #ifndef GL_EXT_texture_env_combine #define GL_EXT_texture_env_combine 1 #define GL_COMBINE_EXT 0x8570 #define GL_COMBINE_RGB_EXT 0x8571 #define GL_COMBINE_ALPHA_EXT 0x8572 #define GL_RGB_SCALE_EXT 0x8573 #define GL_ADD_SIGNED_EXT 0x8574 #define GL_INTERPOLATE_EXT 0x8575 #define GL_CONSTANT_EXT 0x8576 #define GL_PRIMARY_COLOR_EXT 0x8577 #define GL_PREVIOUS_EXT 0x8578 #define GL_SOURCE0_RGB_EXT 0x8580 #define GL_SOURCE1_RGB_EXT 0x8581 #define GL_SOURCE2_RGB_EXT 0x8582 #define GL_SOURCE0_ALPHA_EXT 0x8588 #define GL_SOURCE1_ALPHA_EXT 0x8589 #define GL_SOURCE2_ALPHA_EXT 0x858A #define GL_OPERAND0_RGB_EXT 0x8590 #define GL_OPERAND1_RGB_EXT 0x8591 #define GL_OPERAND2_RGB_EXT 0x8592 #define GL_OPERAND0_ALPHA_EXT 0x8598 #define GL_OPERAND1_ALPHA_EXT 0x8599 #define GL_OPERAND2_ALPHA_EXT 0x859A #endif /* GL_EXT_texture_env_combine */ #ifndef GL_EXT_texture_env_dot3 #define GL_EXT_texture_env_dot3 1 #define GL_DOT3_RGB_EXT 0x8740 #define GL_DOT3_RGBA_EXT 0x8741 #endif /* GL_EXT_texture_env_dot3 */ #ifndef GL_EXT_texture_filter_anisotropic #define GL_EXT_texture_filter_anisotropic 1 #define GL_TEXTURE_MAX_ANISOTROPY_EXT 0x84FE #define GL_MAX_TEXTURE_MAX_ANISOTROPY_EXT 0x84FF #endif /* GL_EXT_texture_filter_anisotropic */ #ifndef GL_EXT_texture_integer #define GL_EXT_texture_integer 1 #define GL_RGBA32UI_EXT 0x8D70 #define GL_RGB32UI_EXT 0x8D71 #define GL_ALPHA32UI_EXT 0x8D72 #define GL_INTENSITY32UI_EXT 0x8D73 #define GL_LUMINANCE32UI_EXT 0x8D74 #define GL_LUMINANCE_ALPHA32UI_EXT 0x8D75 #define GL_RGBA16UI_EXT 0x8D76 #define GL_RGB16UI_EXT 0x8D77 #define GL_ALPHA16UI_EXT 0x8D78 #define GL_INTENSITY16UI_EXT 0x8D79 #define GL_LUMINANCE16UI_EXT 0x8D7A #define GL_LUMINANCE_ALPHA16UI_EXT 0x8D7B #define GL_RGBA8UI_EXT 0x8D7C #define GL_RGB8UI_EXT 0x8D7D #define GL_ALPHA8UI_EXT 0x8D7E #define GL_INTENSITY8UI_EXT 0x8D7F #define GL_LUMINANCE8UI_EXT 0x8D80 #define GL_LUMINANCE_ALPHA8UI_EXT 0x8D81 #define GL_RGBA32I_EXT 0x8D82 #define GL_RGB32I_EXT 0x8D83 #define GL_ALPHA32I_EXT 0x8D84 #define GL_INTENSITY32I_EXT 0x8D85 #define GL_LUMINANCE32I_EXT 0x8D86 #define GL_LUMINANCE_ALPHA32I_EXT 0x8D87 #define GL_RGBA16I_EXT 0x8D88 #define GL_RGB16I_EXT 0x8D89 #define GL_ALPHA16I_EXT 0x8D8A #define GL_INTENSITY16I_EXT 0x8D8B #define GL_LUMINANCE16I_EXT 0x8D8C #define GL_LUMINANCE_ALPHA16I_EXT 0x8D8D #define GL_RGBA8I_EXT 0x8D8E #define GL_RGB8I_EXT 0x8D8F #define GL_ALPHA8I_EXT 0x8D90 #define GL_INTENSITY8I_EXT 0x8D91 #define GL_LUMINANCE8I_EXT 0x8D92 #define GL_LUMINANCE_ALPHA8I_EXT 0x8D93 #define GL_RED_INTEGER_EXT 0x8D94 #define GL_GREEN_INTEGER_EXT 0x8D95 #define GL_BLUE_INTEGER_EXT 0x8D96 #define GL_ALPHA_INTEGER_EXT 0x8D97 #define GL_RGB_INTEGER_EXT 0x8D98 #define GL_RGBA_INTEGER_EXT 0x8D99 #define GL_BGR_INTEGER_EXT 0x8D9A #define GL_BGRA_INTEGER_EXT 0x8D9B #define GL_LUMINANCE_INTEGER_EXT 0x8D9C #define GL_LUMINANCE_ALPHA_INTEGER_EXT 0x8D9D #define GL_RGBA_INTEGER_MODE_EXT 0x8D9E typedef void (APIENTRYP PFNGLTEXPARAMETERIIVEXTPROC) (GLenum target, GLenum pname, const GLint *params); typedef void (APIENTRYP PFNGLTEXPARAMETERIUIVEXTPROC) (GLenum target, GLenum pname, const GLuint *params); typedef void (APIENTRYP PFNGLGETTEXPARAMETERIIVEXTPROC) (GLenum target, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGETTEXPARAMETERIUIVEXTPROC) (GLenum target, GLenum pname, GLuint *params); typedef void (APIENTRYP PFNGLCLEARCOLORIIEXTPROC) (GLint red, GLint green, GLint blue, GLint alpha); typedef void (APIENTRYP PFNGLCLEARCOLORIUIEXTPROC) (GLuint red, GLuint green, GLuint blue, GLuint alpha); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glTexParameterIivEXT (GLenum target, GLenum pname, const GLint *params); GLAPI void APIENTRY glTexParameterIuivEXT (GLenum target, GLenum pname, const GLuint *params); GLAPI void APIENTRY glGetTexParameterIivEXT (GLenum target, GLenum pname, GLint *params); GLAPI void APIENTRY glGetTexParameterIuivEXT (GLenum target, GLenum pname, GLuint *params); GLAPI void APIENTRY glClearColorIiEXT (GLint red, GLint green, GLint blue, GLint alpha); GLAPI void APIENTRY glClearColorIuiEXT (GLuint red, GLuint green, GLuint blue, GLuint alpha); #endif #endif /* GL_EXT_texture_integer */ #ifndef GL_EXT_texture_lod_bias #define GL_EXT_texture_lod_bias 1 #define GL_MAX_TEXTURE_LOD_BIAS_EXT 0x84FD #define GL_TEXTURE_FILTER_CONTROL_EXT 0x8500 #define GL_TEXTURE_LOD_BIAS_EXT 0x8501 #endif /* GL_EXT_texture_lod_bias */ #ifndef GL_EXT_texture_mirror_clamp #define GL_EXT_texture_mirror_clamp 1 #define GL_MIRROR_CLAMP_EXT 0x8742 #define GL_MIRROR_CLAMP_TO_EDGE_EXT 0x8743 #define GL_MIRROR_CLAMP_TO_BORDER_EXT 0x8912 #endif /* GL_EXT_texture_mirror_clamp */ #ifndef GL_EXT_texture_object #define GL_EXT_texture_object 1 #define GL_TEXTURE_PRIORITY_EXT 0x8066 #define GL_TEXTURE_RESIDENT_EXT 0x8067 #define GL_TEXTURE_1D_BINDING_EXT 0x8068 #define GL_TEXTURE_2D_BINDING_EXT 0x8069 #define GL_TEXTURE_3D_BINDING_EXT 0x806A typedef GLboolean (APIENTRYP PFNGLARETEXTURESRESIDENTEXTPROC) (GLsizei n, const GLuint *textures, GLboolean *residences); typedef void (APIENTRYP PFNGLBINDTEXTUREEXTPROC) (GLenum target, GLuint texture); typedef void (APIENTRYP PFNGLDELETETEXTURESEXTPROC) (GLsizei n, const GLuint *textures); typedef void (APIENTRYP PFNGLGENTEXTURESEXTPROC) (GLsizei n, GLuint *textures); typedef GLboolean (APIENTRYP PFNGLISTEXTUREEXTPROC) (GLuint texture); typedef void (APIENTRYP PFNGLPRIORITIZETEXTURESEXTPROC) (GLsizei n, const GLuint *textures, const GLclampf *priorities); #ifdef GL_GLEXT_PROTOTYPES GLAPI GLboolean APIENTRY glAreTexturesResidentEXT (GLsizei n, const GLuint *textures, GLboolean *residences); GLAPI void APIENTRY glBindTextureEXT (GLenum target, GLuint texture); GLAPI void APIENTRY glDeleteTexturesEXT (GLsizei n, const GLuint *textures); GLAPI void APIENTRY glGenTexturesEXT (GLsizei n, GLuint *textures); GLAPI GLboolean APIENTRY glIsTextureEXT (GLuint texture); GLAPI void APIENTRY glPrioritizeTexturesEXT (GLsizei n, const GLuint *textures, const GLclampf *priorities); #endif #endif /* GL_EXT_texture_object */ #ifndef GL_EXT_texture_perturb_normal #define GL_EXT_texture_perturb_normal 1 #define GL_PERTURB_EXT 0x85AE #define GL_TEXTURE_NORMAL_EXT 0x85AF typedef void (APIENTRYP PFNGLTEXTURENORMALEXTPROC) (GLenum mode); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glTextureNormalEXT (GLenum mode); #endif #endif /* GL_EXT_texture_perturb_normal */ #ifndef GL_EXT_texture_sRGB #define GL_EXT_texture_sRGB 1 #define GL_SRGB_EXT 0x8C40 #define GL_SRGB8_EXT 0x8C41 #define GL_SRGB_ALPHA_EXT 0x8C42 #define GL_SRGB8_ALPHA8_EXT 0x8C43 #define GL_SLUMINANCE_ALPHA_EXT 0x8C44 #define GL_SLUMINANCE8_ALPHA8_EXT 0x8C45 #define GL_SLUMINANCE_EXT 0x8C46 #define GL_SLUMINANCE8_EXT 0x8C47 #define GL_COMPRESSED_SRGB_EXT 0x8C48 #define GL_COMPRESSED_SRGB_ALPHA_EXT 0x8C49 #define GL_COMPRESSED_SLUMINANCE_EXT 0x8C4A #define GL_COMPRESSED_SLUMINANCE_ALPHA_EXT 0x8C4B #define GL_COMPRESSED_SRGB_S3TC_DXT1_EXT 0x8C4C #define GL_COMPRESSED_SRGB_ALPHA_S3TC_DXT1_EXT 0x8C4D #define GL_COMPRESSED_SRGB_ALPHA_S3TC_DXT3_EXT 0x8C4E #define GL_COMPRESSED_SRGB_ALPHA_S3TC_DXT5_EXT 0x8C4F #endif /* GL_EXT_texture_sRGB */ #ifndef GL_EXT_texture_sRGB_decode #define GL_EXT_texture_sRGB_decode 1 #define GL_TEXTURE_SRGB_DECODE_EXT 0x8A48 #define GL_DECODE_EXT 0x8A49 #define GL_SKIP_DECODE_EXT 0x8A4A #endif /* GL_EXT_texture_sRGB_decode */ #ifndef GL_EXT_texture_shared_exponent #define GL_EXT_texture_shared_exponent 1 #define GL_RGB9_E5_EXT 0x8C3D #define GL_UNSIGNED_INT_5_9_9_9_REV_EXT 0x8C3E #define GL_TEXTURE_SHARED_SIZE_EXT 0x8C3F #endif /* GL_EXT_texture_shared_exponent */ #ifndef GL_EXT_texture_snorm #define GL_EXT_texture_snorm 1 #define GL_ALPHA_SNORM 0x9010 #define GL_LUMINANCE_SNORM 0x9011 #define GL_LUMINANCE_ALPHA_SNORM 0x9012 #define GL_INTENSITY_SNORM 0x9013 #define GL_ALPHA8_SNORM 0x9014 #define GL_LUMINANCE8_SNORM 0x9015 #define GL_LUMINANCE8_ALPHA8_SNORM 0x9016 #define GL_INTENSITY8_SNORM 0x9017 #define GL_ALPHA16_SNORM 0x9018 #define GL_LUMINANCE16_SNORM 0x9019 #define GL_LUMINANCE16_ALPHA16_SNORM 0x901A #define GL_INTENSITY16_SNORM 0x901B #define GL_RED_SNORM 0x8F90 #define GL_RG_SNORM 0x8F91 #define GL_RGB_SNORM 0x8F92 #define GL_RGBA_SNORM 0x8F93 #endif /* GL_EXT_texture_snorm */ #ifndef GL_EXT_texture_swizzle #define GL_EXT_texture_swizzle 1 #define GL_TEXTURE_SWIZZLE_R_EXT 0x8E42 #define GL_TEXTURE_SWIZZLE_G_EXT 0x8E43 #define GL_TEXTURE_SWIZZLE_B_EXT 0x8E44 #define GL_TEXTURE_SWIZZLE_A_EXT 0x8E45 #define GL_TEXTURE_SWIZZLE_RGBA_EXT 0x8E46 #endif /* GL_EXT_texture_swizzle */ #ifndef GL_EXT_timer_query #define GL_EXT_timer_query 1 #define GL_TIME_ELAPSED_EXT 0x88BF typedef void (APIENTRYP PFNGLGETQUERYOBJECTI64VEXTPROC) (GLuint id, GLenum pname, GLint64 *params); typedef void (APIENTRYP PFNGLGETQUERYOBJECTUI64VEXTPROC) (GLuint id, GLenum pname, GLuint64 *params); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glGetQueryObjecti64vEXT (GLuint id, GLenum pname, GLint64 *params); GLAPI void APIENTRY glGetQueryObjectui64vEXT (GLuint id, GLenum pname, GLuint64 *params); #endif #endif /* GL_EXT_timer_query */ #ifndef GL_EXT_transform_feedback #define GL_EXT_transform_feedback 1 #define GL_TRANSFORM_FEEDBACK_BUFFER_EXT 0x8C8E #define GL_TRANSFORM_FEEDBACK_BUFFER_START_EXT 0x8C84 #define GL_TRANSFORM_FEEDBACK_BUFFER_SIZE_EXT 0x8C85 #define GL_TRANSFORM_FEEDBACK_BUFFER_BINDING_EXT 0x8C8F #define GL_INTERLEAVED_ATTRIBS_EXT 0x8C8C #define GL_SEPARATE_ATTRIBS_EXT 0x8C8D #define GL_PRIMITIVES_GENERATED_EXT 0x8C87 #define GL_TRANSFORM_FEEDBACK_PRIMITIVES_WRITTEN_EXT 0x8C88 #define GL_RASTERIZER_DISCARD_EXT 0x8C89 #define GL_MAX_TRANSFORM_FEEDBACK_INTERLEAVED_COMPONENTS_EXT 0x8C8A #define GL_MAX_TRANSFORM_FEEDBACK_SEPARATE_ATTRIBS_EXT 0x8C8B #define GL_MAX_TRANSFORM_FEEDBACK_SEPARATE_COMPONENTS_EXT 0x8C80 #define GL_TRANSFORM_FEEDBACK_VARYINGS_EXT 0x8C83 #define GL_TRANSFORM_FEEDBACK_BUFFER_MODE_EXT 0x8C7F #define GL_TRANSFORM_FEEDBACK_VARYING_MAX_LENGTH_EXT 0x8C76 typedef void (APIENTRYP PFNGLBEGINTRANSFORMFEEDBACKEXTPROC) (GLenum primitiveMode); typedef void (APIENTRYP PFNGLENDTRANSFORMFEEDBACKEXTPROC) (void); typedef void (APIENTRYP PFNGLBINDBUFFERRANGEEXTPROC) (GLenum target, GLuint index, GLuint buffer, GLintptr offset, GLsizeiptr size); typedef void (APIENTRYP PFNGLBINDBUFFEROFFSETEXTPROC) (GLenum target, GLuint index, GLuint buffer, GLintptr offset); typedef void (APIENTRYP PFNGLBINDBUFFERBASEEXTPROC) (GLenum target, GLuint index, GLuint buffer); typedef void (APIENTRYP PFNGLTRANSFORMFEEDBACKVARYINGSEXTPROC) (GLuint program, GLsizei count, const GLchar *const*varyings, GLenum bufferMode); typedef void (APIENTRYP PFNGLGETTRANSFORMFEEDBACKVARYINGEXTPROC) (GLuint program, GLuint index, GLsizei bufSize, GLsizei *length, GLsizei *size, GLenum *type, GLchar *name); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glBeginTransformFeedbackEXT (GLenum primitiveMode); GLAPI void APIENTRY glEndTransformFeedbackEXT (void); GLAPI void APIENTRY glBindBufferRangeEXT (GLenum target, GLuint index, GLuint buffer, GLintptr offset, GLsizeiptr size); GLAPI void APIENTRY glBindBufferOffsetEXT (GLenum target, GLuint index, GLuint buffer, GLintptr offset); GLAPI void APIENTRY glBindBufferBaseEXT (GLenum target, GLuint index, GLuint buffer); GLAPI void APIENTRY glTransformFeedbackVaryingsEXT (GLuint program, GLsizei count, const GLchar *const*varyings, GLenum bufferMode); GLAPI void APIENTRY glGetTransformFeedbackVaryingEXT (GLuint program, GLuint index, GLsizei bufSize, GLsizei *length, GLsizei *size, GLenum *type, GLchar *name); #endif #endif /* GL_EXT_transform_feedback */ #ifndef GL_EXT_vertex_array #define GL_EXT_vertex_array 1 #define GL_VERTEX_ARRAY_EXT 0x8074 #define GL_NORMAL_ARRAY_EXT 0x8075 #define GL_COLOR_ARRAY_EXT 0x8076 #define GL_INDEX_ARRAY_EXT 0x8077 #define GL_TEXTURE_COORD_ARRAY_EXT 0x8078 #define GL_EDGE_FLAG_ARRAY_EXT 0x8079 #define GL_VERTEX_ARRAY_SIZE_EXT 0x807A #define GL_VERTEX_ARRAY_TYPE_EXT 0x807B #define GL_VERTEX_ARRAY_STRIDE_EXT 0x807C #define GL_VERTEX_ARRAY_COUNT_EXT 0x807D #define GL_NORMAL_ARRAY_TYPE_EXT 0x807E #define GL_NORMAL_ARRAY_STRIDE_EXT 0x807F #define GL_NORMAL_ARRAY_COUNT_EXT 0x8080 #define GL_COLOR_ARRAY_SIZE_EXT 0x8081 #define GL_COLOR_ARRAY_TYPE_EXT 0x8082 #define GL_COLOR_ARRAY_STRIDE_EXT 0x8083 #define GL_COLOR_ARRAY_COUNT_EXT 0x8084 #define GL_INDEX_ARRAY_TYPE_EXT 0x8085 #define GL_INDEX_ARRAY_STRIDE_EXT 0x8086 #define GL_INDEX_ARRAY_COUNT_EXT 0x8087 #define GL_TEXTURE_COORD_ARRAY_SIZE_EXT 0x8088 #define GL_TEXTURE_COORD_ARRAY_TYPE_EXT 0x8089 #define GL_TEXTURE_COORD_ARRAY_STRIDE_EXT 0x808A #define GL_TEXTURE_COORD_ARRAY_COUNT_EXT 0x808B #define GL_EDGE_FLAG_ARRAY_STRIDE_EXT 0x808C #define GL_EDGE_FLAG_ARRAY_COUNT_EXT 0x808D #define GL_VERTEX_ARRAY_POINTER_EXT 0x808E #define GL_NORMAL_ARRAY_POINTER_EXT 0x808F #define GL_COLOR_ARRAY_POINTER_EXT 0x8090 #define GL_INDEX_ARRAY_POINTER_EXT 0x8091 #define GL_TEXTURE_COORD_ARRAY_POINTER_EXT 0x8092 #define GL_EDGE_FLAG_ARRAY_POINTER_EXT 0x8093 typedef void (APIENTRYP PFNGLARRAYELEMENTEXTPROC) (GLint i); typedef void (APIENTRYP PFNGLCOLORPOINTEREXTPROC) (GLint size, GLenum type, GLsizei stride, GLsizei count, const void *pointer); typedef void (APIENTRYP PFNGLDRAWARRAYSEXTPROC) (GLenum mode, GLint first, GLsizei count); typedef void (APIENTRYP PFNGLEDGEFLAGPOINTEREXTPROC) (GLsizei stride, GLsizei count, const GLboolean *pointer); typedef void (APIENTRYP PFNGLGETPOINTERVEXTPROC) (GLenum pname, void **params); typedef void (APIENTRYP PFNGLINDEXPOINTEREXTPROC) (GLenum type, GLsizei stride, GLsizei count, const void *pointer); typedef void (APIENTRYP PFNGLNORMALPOINTEREXTPROC) (GLenum type, GLsizei stride, GLsizei count, const void *pointer); typedef void (APIENTRYP PFNGLTEXCOORDPOINTEREXTPROC) (GLint size, GLenum type, GLsizei stride, GLsizei count, const void *pointer); typedef void (APIENTRYP PFNGLVERTEXPOINTEREXTPROC) (GLint size, GLenum type, GLsizei stride, GLsizei count, const void *pointer); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glArrayElementEXT (GLint i); GLAPI void APIENTRY glColorPointerEXT (GLint size, GLenum type, GLsizei stride, GLsizei count, const void *pointer); GLAPI void APIENTRY glDrawArraysEXT (GLenum mode, GLint first, GLsizei count); GLAPI void APIENTRY glEdgeFlagPointerEXT (GLsizei stride, GLsizei count, const GLboolean *pointer); GLAPI void APIENTRY glGetPointervEXT (GLenum pname, void **params); GLAPI void APIENTRY glIndexPointerEXT (GLenum type, GLsizei stride, GLsizei count, const void *pointer); GLAPI void APIENTRY glNormalPointerEXT (GLenum type, GLsizei stride, GLsizei count, const void *pointer); GLAPI void APIENTRY glTexCoordPointerEXT (GLint size, GLenum type, GLsizei stride, GLsizei count, const void *pointer); GLAPI void APIENTRY glVertexPointerEXT (GLint size, GLenum type, GLsizei stride, GLsizei count, const void *pointer); #endif #endif /* GL_EXT_vertex_array */ #ifndef GL_EXT_vertex_array_bgra #define GL_EXT_vertex_array_bgra 1 #endif /* GL_EXT_vertex_array_bgra */ #ifndef GL_EXT_vertex_attrib_64bit #define GL_EXT_vertex_attrib_64bit 1 #define GL_DOUBLE_VEC2_EXT 0x8FFC #define GL_DOUBLE_VEC3_EXT 0x8FFD #define GL_DOUBLE_VEC4_EXT 0x8FFE #define GL_DOUBLE_MAT2_EXT 0x8F46 #define GL_DOUBLE_MAT3_EXT 0x8F47 #define GL_DOUBLE_MAT4_EXT 0x8F48 #define GL_DOUBLE_MAT2x3_EXT 0x8F49 #define GL_DOUBLE_MAT2x4_EXT 0x8F4A #define GL_DOUBLE_MAT3x2_EXT 0x8F4B #define GL_DOUBLE_MAT3x4_EXT 0x8F4C #define GL_DOUBLE_MAT4x2_EXT 0x8F4D #define GL_DOUBLE_MAT4x3_EXT 0x8F4E typedef void (APIENTRYP PFNGLVERTEXATTRIBL1DEXTPROC) (GLuint index, GLdouble x); typedef void (APIENTRYP PFNGLVERTEXATTRIBL2DEXTPROC) (GLuint index, GLdouble x, GLdouble y); typedef void (APIENTRYP PFNGLVERTEXATTRIBL3DEXTPROC) (GLuint index, GLdouble x, GLdouble y, GLdouble z); typedef void (APIENTRYP PFNGLVERTEXATTRIBL4DEXTPROC) (GLuint index, GLdouble x, GLdouble y, GLdouble z, GLdouble w); typedef void (APIENTRYP PFNGLVERTEXATTRIBL1DVEXTPROC) (GLuint index, const GLdouble *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBL2DVEXTPROC) (GLuint index, const GLdouble *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBL3DVEXTPROC) (GLuint index, const GLdouble *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBL4DVEXTPROC) (GLuint index, const GLdouble *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBLPOINTEREXTPROC) (GLuint index, GLint size, GLenum type, GLsizei stride, const void *pointer); typedef void (APIENTRYP PFNGLGETVERTEXATTRIBLDVEXTPROC) (GLuint index, GLenum pname, GLdouble *params); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glVertexAttribL1dEXT (GLuint index, GLdouble x); GLAPI void APIENTRY glVertexAttribL2dEXT (GLuint index, GLdouble x, GLdouble y); GLAPI void APIENTRY glVertexAttribL3dEXT (GLuint index, GLdouble x, GLdouble y, GLdouble z); GLAPI void APIENTRY glVertexAttribL4dEXT (GLuint index, GLdouble x, GLdouble y, GLdouble z, GLdouble w); GLAPI void APIENTRY glVertexAttribL1dvEXT (GLuint index, const GLdouble *v); GLAPI void APIENTRY glVertexAttribL2dvEXT (GLuint index, const GLdouble *v); GLAPI void APIENTRY glVertexAttribL3dvEXT (GLuint index, const GLdouble *v); GLAPI void APIENTRY glVertexAttribL4dvEXT (GLuint index, const GLdouble *v); GLAPI void APIENTRY glVertexAttribLPointerEXT (GLuint index, GLint size, GLenum type, GLsizei stride, const void *pointer); GLAPI void APIENTRY glGetVertexAttribLdvEXT (GLuint index, GLenum pname, GLdouble *params); #endif #endif /* GL_EXT_vertex_attrib_64bit */ #ifndef GL_EXT_vertex_shader #define GL_EXT_vertex_shader 1 #define GL_VERTEX_SHADER_EXT 0x8780 #define GL_VERTEX_SHADER_BINDING_EXT 0x8781 #define GL_OP_INDEX_EXT 0x8782 #define GL_OP_NEGATE_EXT 0x8783 #define GL_OP_DOT3_EXT 0x8784 #define GL_OP_DOT4_EXT 0x8785 #define GL_OP_MUL_EXT 0x8786 #define GL_OP_ADD_EXT 0x8787 #define GL_OP_MADD_EXT 0x8788 #define GL_OP_FRAC_EXT 0x8789 #define GL_OP_MAX_EXT 0x878A #define GL_OP_MIN_EXT 0x878B #define GL_OP_SET_GE_EXT 0x878C #define GL_OP_SET_LT_EXT 0x878D #define GL_OP_CLAMP_EXT 0x878E #define GL_OP_FLOOR_EXT 0x878F #define GL_OP_ROUND_EXT 0x8790 #define GL_OP_EXP_BASE_2_EXT 0x8791 #define GL_OP_LOG_BASE_2_EXT 0x8792 #define GL_OP_POWER_EXT 0x8793 #define GL_OP_RECIP_EXT 0x8794 #define GL_OP_RECIP_SQRT_EXT 0x8795 #define GL_OP_SUB_EXT 0x8796 #define GL_OP_CROSS_PRODUCT_EXT 0x8797 #define GL_OP_MULTIPLY_MATRIX_EXT 0x8798 #define GL_OP_MOV_EXT 0x8799 #define GL_OUTPUT_VERTEX_EXT 0x879A #define GL_OUTPUT_COLOR0_EXT 0x879B #define GL_OUTPUT_COLOR1_EXT 0x879C #define GL_OUTPUT_TEXTURE_COORD0_EXT 0x879D #define GL_OUTPUT_TEXTURE_COORD1_EXT 0x879E #define GL_OUTPUT_TEXTURE_COORD2_EXT 0x879F #define GL_OUTPUT_TEXTURE_COORD3_EXT 0x87A0 #define GL_OUTPUT_TEXTURE_COORD4_EXT 0x87A1 #define GL_OUTPUT_TEXTURE_COORD5_EXT 0x87A2 #define GL_OUTPUT_TEXTURE_COORD6_EXT 0x87A3 #define GL_OUTPUT_TEXTURE_COORD7_EXT 0x87A4 #define GL_OUTPUT_TEXTURE_COORD8_EXT 0x87A5 #define GL_OUTPUT_TEXTURE_COORD9_EXT 0x87A6 #define GL_OUTPUT_TEXTURE_COORD10_EXT 0x87A7 #define GL_OUTPUT_TEXTURE_COORD11_EXT 0x87A8 #define GL_OUTPUT_TEXTURE_COORD12_EXT 0x87A9 #define GL_OUTPUT_TEXTURE_COORD13_EXT 0x87AA #define GL_OUTPUT_TEXTURE_COORD14_EXT 0x87AB #define GL_OUTPUT_TEXTURE_COORD15_EXT 0x87AC #define GL_OUTPUT_TEXTURE_COORD16_EXT 0x87AD #define GL_OUTPUT_TEXTURE_COORD17_EXT 0x87AE #define GL_OUTPUT_TEXTURE_COORD18_EXT 0x87AF #define GL_OUTPUT_TEXTURE_COORD19_EXT 0x87B0 #define GL_OUTPUT_TEXTURE_COORD20_EXT 0x87B1 #define GL_OUTPUT_TEXTURE_COORD21_EXT 0x87B2 #define GL_OUTPUT_TEXTURE_COORD22_EXT 0x87B3 #define GL_OUTPUT_TEXTURE_COORD23_EXT 0x87B4 #define GL_OUTPUT_TEXTURE_COORD24_EXT 0x87B5 #define GL_OUTPUT_TEXTURE_COORD25_EXT 0x87B6 #define GL_OUTPUT_TEXTURE_COORD26_EXT 0x87B7 #define GL_OUTPUT_TEXTURE_COORD27_EXT 0x87B8 #define GL_OUTPUT_TEXTURE_COORD28_EXT 0x87B9 #define GL_OUTPUT_TEXTURE_COORD29_EXT 0x87BA #define GL_OUTPUT_TEXTURE_COORD30_EXT 0x87BB #define GL_OUTPUT_TEXTURE_COORD31_EXT 0x87BC #define GL_OUTPUT_FOG_EXT 0x87BD #define GL_SCALAR_EXT 0x87BE #define GL_VECTOR_EXT 0x87BF #define GL_MATRIX_EXT 0x87C0 #define GL_VARIANT_EXT 0x87C1 #define GL_INVARIANT_EXT 0x87C2 #define GL_LOCAL_CONSTANT_EXT 0x87C3 #define GL_LOCAL_EXT 0x87C4 #define GL_MAX_VERTEX_SHADER_INSTRUCTIONS_EXT 0x87C5 #define GL_MAX_VERTEX_SHADER_VARIANTS_EXT 0x87C6 #define GL_MAX_VERTEX_SHADER_INVARIANTS_EXT 0x87C7 #define GL_MAX_VERTEX_SHADER_LOCAL_CONSTANTS_EXT 0x87C8 #define GL_MAX_VERTEX_SHADER_LOCALS_EXT 0x87C9 #define GL_MAX_OPTIMIZED_VERTEX_SHADER_INSTRUCTIONS_EXT 0x87CA #define GL_MAX_OPTIMIZED_VERTEX_SHADER_VARIANTS_EXT 0x87CB #define GL_MAX_OPTIMIZED_VERTEX_SHADER_LOCAL_CONSTANTS_EXT 0x87CC #define GL_MAX_OPTIMIZED_VERTEX_SHADER_INVARIANTS_EXT 0x87CD #define GL_MAX_OPTIMIZED_VERTEX_SHADER_LOCALS_EXT 0x87CE #define GL_VERTEX_SHADER_INSTRUCTIONS_EXT 0x87CF #define GL_VERTEX_SHADER_VARIANTS_EXT 0x87D0 #define GL_VERTEX_SHADER_INVARIANTS_EXT 0x87D1 #define GL_VERTEX_SHADER_LOCAL_CONSTANTS_EXT 0x87D2 #define GL_VERTEX_SHADER_LOCALS_EXT 0x87D3 #define GL_VERTEX_SHADER_OPTIMIZED_EXT 0x87D4 #define GL_X_EXT 0x87D5 #define GL_Y_EXT 0x87D6 #define GL_Z_EXT 0x87D7 #define GL_W_EXT 0x87D8 #define GL_NEGATIVE_X_EXT 0x87D9 #define GL_NEGATIVE_Y_EXT 0x87DA #define GL_NEGATIVE_Z_EXT 0x87DB #define GL_NEGATIVE_W_EXT 0x87DC #define GL_ZERO_EXT 0x87DD #define GL_ONE_EXT 0x87DE #define GL_NEGATIVE_ONE_EXT 0x87DF #define GL_NORMALIZED_RANGE_EXT 0x87E0 #define GL_FULL_RANGE_EXT 0x87E1 #define GL_CURRENT_VERTEX_EXT 0x87E2 #define GL_MVP_MATRIX_EXT 0x87E3 #define GL_VARIANT_VALUE_EXT 0x87E4 #define GL_VARIANT_DATATYPE_EXT 0x87E5 #define GL_VARIANT_ARRAY_STRIDE_EXT 0x87E6 #define GL_VARIANT_ARRAY_TYPE_EXT 0x87E7 #define GL_VARIANT_ARRAY_EXT 0x87E8 #define GL_VARIANT_ARRAY_POINTER_EXT 0x87E9 #define GL_INVARIANT_VALUE_EXT 0x87EA #define GL_INVARIANT_DATATYPE_EXT 0x87EB #define GL_LOCAL_CONSTANT_VALUE_EXT 0x87EC #define GL_LOCAL_CONSTANT_DATATYPE_EXT 0x87ED typedef void (APIENTRYP PFNGLBEGINVERTEXSHADEREXTPROC) (void); typedef void (APIENTRYP PFNGLENDVERTEXSHADEREXTPROC) (void); typedef void (APIENTRYP PFNGLBINDVERTEXSHADEREXTPROC) (GLuint id); typedef GLuint (APIENTRYP PFNGLGENVERTEXSHADERSEXTPROC) (GLuint range); typedef void (APIENTRYP PFNGLDELETEVERTEXSHADEREXTPROC) (GLuint id); typedef void (APIENTRYP PFNGLSHADEROP1EXTPROC) (GLenum op, GLuint res, GLuint arg1); typedef void (APIENTRYP PFNGLSHADEROP2EXTPROC) (GLenum op, GLuint res, GLuint arg1, GLuint arg2); typedef void (APIENTRYP PFNGLSHADEROP3EXTPROC) (GLenum op, GLuint res, GLuint arg1, GLuint arg2, GLuint arg3); typedef void (APIENTRYP PFNGLSWIZZLEEXTPROC) (GLuint res, GLuint in, GLenum outX, GLenum outY, GLenum outZ, GLenum outW); typedef void (APIENTRYP PFNGLWRITEMASKEXTPROC) (GLuint res, GLuint in, GLenum outX, GLenum outY, GLenum outZ, GLenum outW); typedef void (APIENTRYP PFNGLINSERTCOMPONENTEXTPROC) (GLuint res, GLuint src, GLuint num); typedef void (APIENTRYP PFNGLEXTRACTCOMPONENTEXTPROC) (GLuint res, GLuint src, GLuint num); typedef GLuint (APIENTRYP PFNGLGENSYMBOLSEXTPROC) (GLenum datatype, GLenum storagetype, GLenum range, GLuint components); typedef void (APIENTRYP PFNGLSETINVARIANTEXTPROC) (GLuint id, GLenum type, const void *addr); typedef void (APIENTRYP PFNGLSETLOCALCONSTANTEXTPROC) (GLuint id, GLenum type, const void *addr); typedef void (APIENTRYP PFNGLVARIANTBVEXTPROC) (GLuint id, const GLbyte *addr); typedef void (APIENTRYP PFNGLVARIANTSVEXTPROC) (GLuint id, const GLshort *addr); typedef void (APIENTRYP PFNGLVARIANTIVEXTPROC) (GLuint id, const GLint *addr); typedef void (APIENTRYP PFNGLVARIANTFVEXTPROC) (GLuint id, const GLfloat *addr); typedef void (APIENTRYP PFNGLVARIANTDVEXTPROC) (GLuint id, const GLdouble *addr); typedef void (APIENTRYP PFNGLVARIANTUBVEXTPROC) (GLuint id, const GLubyte *addr); typedef void (APIENTRYP PFNGLVARIANTUSVEXTPROC) (GLuint id, const GLushort *addr); typedef void (APIENTRYP PFNGLVARIANTUIVEXTPROC) (GLuint id, const GLuint *addr); typedef void (APIENTRYP PFNGLVARIANTPOINTEREXTPROC) (GLuint id, GLenum type, GLuint stride, const void *addr); typedef void (APIENTRYP PFNGLENABLEVARIANTCLIENTSTATEEXTPROC) (GLuint id); typedef void (APIENTRYP PFNGLDISABLEVARIANTCLIENTSTATEEXTPROC) (GLuint id); typedef GLuint (APIENTRYP PFNGLBINDLIGHTPARAMETEREXTPROC) (GLenum light, GLenum value); typedef GLuint (APIENTRYP PFNGLBINDMATERIALPARAMETEREXTPROC) (GLenum face, GLenum value); typedef GLuint (APIENTRYP PFNGLBINDTEXGENPARAMETEREXTPROC) (GLenum unit, GLenum coord, GLenum value); typedef GLuint (APIENTRYP PFNGLBINDTEXTUREUNITPARAMETEREXTPROC) (GLenum unit, GLenum value); typedef GLuint (APIENTRYP PFNGLBINDPARAMETEREXTPROC) (GLenum value); typedef GLboolean (APIENTRYP PFNGLISVARIANTENABLEDEXTPROC) (GLuint id, GLenum cap); typedef void (APIENTRYP PFNGLGETVARIANTBOOLEANVEXTPROC) (GLuint id, GLenum value, GLboolean *data); typedef void (APIENTRYP PFNGLGETVARIANTINTEGERVEXTPROC) (GLuint id, GLenum value, GLint *data); typedef void (APIENTRYP PFNGLGETVARIANTFLOATVEXTPROC) (GLuint id, GLenum value, GLfloat *data); typedef void (APIENTRYP PFNGLGETVARIANTPOINTERVEXTPROC) (GLuint id, GLenum value, void **data); typedef void (APIENTRYP PFNGLGETINVARIANTBOOLEANVEXTPROC) (GLuint id, GLenum value, GLboolean *data); typedef void (APIENTRYP PFNGLGETINVARIANTINTEGERVEXTPROC) (GLuint id, GLenum value, GLint *data); typedef void (APIENTRYP PFNGLGETINVARIANTFLOATVEXTPROC) (GLuint id, GLenum value, GLfloat *data); typedef void (APIENTRYP PFNGLGETLOCALCONSTANTBOOLEANVEXTPROC) (GLuint id, GLenum value, GLboolean *data); typedef void (APIENTRYP PFNGLGETLOCALCONSTANTINTEGERVEXTPROC) (GLuint id, GLenum value, GLint *data); typedef void (APIENTRYP PFNGLGETLOCALCONSTANTFLOATVEXTPROC) (GLuint id, GLenum value, GLfloat *data); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glBeginVertexShaderEXT (void); GLAPI void APIENTRY glEndVertexShaderEXT (void); GLAPI void APIENTRY glBindVertexShaderEXT (GLuint id); GLAPI GLuint APIENTRY glGenVertexShadersEXT (GLuint range); GLAPI void APIENTRY glDeleteVertexShaderEXT (GLuint id); GLAPI void APIENTRY glShaderOp1EXT (GLenum op, GLuint res, GLuint arg1); GLAPI void APIENTRY glShaderOp2EXT (GLenum op, GLuint res, GLuint arg1, GLuint arg2); GLAPI void APIENTRY glShaderOp3EXT (GLenum op, GLuint res, GLuint arg1, GLuint arg2, GLuint arg3); GLAPI void APIENTRY glSwizzleEXT (GLuint res, GLuint in, GLenum outX, GLenum outY, GLenum outZ, GLenum outW); GLAPI void APIENTRY glWriteMaskEXT (GLuint res, GLuint in, GLenum outX, GLenum outY, GLenum outZ, GLenum outW); GLAPI void APIENTRY glInsertComponentEXT (GLuint res, GLuint src, GLuint num); GLAPI void APIENTRY glExtractComponentEXT (GLuint res, GLuint src, GLuint num); GLAPI GLuint APIENTRY glGenSymbolsEXT (GLenum datatype, GLenum storagetype, GLenum range, GLuint components); GLAPI void APIENTRY glSetInvariantEXT (GLuint id, GLenum type, const void *addr); GLAPI void APIENTRY glSetLocalConstantEXT (GLuint id, GLenum type, const void *addr); GLAPI void APIENTRY glVariantbvEXT (GLuint id, const GLbyte *addr); GLAPI void APIENTRY glVariantsvEXT (GLuint id, const GLshort *addr); GLAPI void APIENTRY glVariantivEXT (GLuint id, const GLint *addr); GLAPI void APIENTRY glVariantfvEXT (GLuint id, const GLfloat *addr); GLAPI void APIENTRY glVariantdvEXT (GLuint id, const GLdouble *addr); GLAPI void APIENTRY glVariantubvEXT (GLuint id, const GLubyte *addr); GLAPI void APIENTRY glVariantusvEXT (GLuint id, const GLushort *addr); GLAPI void APIENTRY glVariantuivEXT (GLuint id, const GLuint *addr); GLAPI void APIENTRY glVariantPointerEXT (GLuint id, GLenum type, GLuint stride, const void *addr); GLAPI void APIENTRY glEnableVariantClientStateEXT (GLuint id); GLAPI void APIENTRY glDisableVariantClientStateEXT (GLuint id); GLAPI GLuint APIENTRY glBindLightParameterEXT (GLenum light, GLenum value); GLAPI GLuint APIENTRY glBindMaterialParameterEXT (GLenum face, GLenum value); GLAPI GLuint APIENTRY glBindTexGenParameterEXT (GLenum unit, GLenum coord, GLenum value); GLAPI GLuint APIENTRY glBindTextureUnitParameterEXT (GLenum unit, GLenum value); GLAPI GLuint APIENTRY glBindParameterEXT (GLenum value); GLAPI GLboolean APIENTRY glIsVariantEnabledEXT (GLuint id, GLenum cap); GLAPI void APIENTRY glGetVariantBooleanvEXT (GLuint id, GLenum value, GLboolean *data); GLAPI void APIENTRY glGetVariantIntegervEXT (GLuint id, GLenum value, GLint *data); GLAPI void APIENTRY glGetVariantFloatvEXT (GLuint id, GLenum value, GLfloat *data); GLAPI void APIENTRY glGetVariantPointervEXT (GLuint id, GLenum value, void **data); GLAPI void APIENTRY glGetInvariantBooleanvEXT (GLuint id, GLenum value, GLboolean *data); GLAPI void APIENTRY glGetInvariantIntegervEXT (GLuint id, GLenum value, GLint *data); GLAPI void APIENTRY glGetInvariantFloatvEXT (GLuint id, GLenum value, GLfloat *data); GLAPI void APIENTRY glGetLocalConstantBooleanvEXT (GLuint id, GLenum value, GLboolean *data); GLAPI void APIENTRY glGetLocalConstantIntegervEXT (GLuint id, GLenum value, GLint *data); GLAPI void APIENTRY glGetLocalConstantFloatvEXT (GLuint id, GLenum value, GLfloat *data); #endif #endif /* GL_EXT_vertex_shader */ #ifndef GL_EXT_vertex_weighting #define GL_EXT_vertex_weighting 1 #define GL_MODELVIEW0_STACK_DEPTH_EXT 0x0BA3 #define GL_MODELVIEW1_STACK_DEPTH_EXT 0x8502 #define GL_MODELVIEW0_MATRIX_EXT 0x0BA6 #define GL_MODELVIEW1_MATRIX_EXT 0x8506 #define GL_VERTEX_WEIGHTING_EXT 0x8509 #define GL_MODELVIEW0_EXT 0x1700 #define GL_MODELVIEW1_EXT 0x850A #define GL_CURRENT_VERTEX_WEIGHT_EXT 0x850B #define GL_VERTEX_WEIGHT_ARRAY_EXT 0x850C #define GL_VERTEX_WEIGHT_ARRAY_SIZE_EXT 0x850D #define GL_VERTEX_WEIGHT_ARRAY_TYPE_EXT 0x850E #define GL_VERTEX_WEIGHT_ARRAY_STRIDE_EXT 0x850F #define GL_VERTEX_WEIGHT_ARRAY_POINTER_EXT 0x8510 typedef void (APIENTRYP PFNGLVERTEXWEIGHTFEXTPROC) (GLfloat weight); typedef void (APIENTRYP PFNGLVERTEXWEIGHTFVEXTPROC) (const GLfloat *weight); typedef void (APIENTRYP PFNGLVERTEXWEIGHTPOINTEREXTPROC) (GLint size, GLenum type, GLsizei stride, const void *pointer); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glVertexWeightfEXT (GLfloat weight); GLAPI void APIENTRY glVertexWeightfvEXT (const GLfloat *weight); GLAPI void APIENTRY glVertexWeightPointerEXT (GLint size, GLenum type, GLsizei stride, const void *pointer); #endif #endif /* GL_EXT_vertex_weighting */ #ifndef GL_EXT_x11_sync_object #define GL_EXT_x11_sync_object 1 #define GL_SYNC_X11_FENCE_EXT 0x90E1 typedef GLsync (APIENTRYP PFNGLIMPORTSYNCEXTPROC) (GLenum external_sync_type, GLintptr external_sync, GLbitfield flags); #ifdef GL_GLEXT_PROTOTYPES GLAPI GLsync APIENTRY glImportSyncEXT (GLenum external_sync_type, GLintptr external_sync, GLbitfield flags); #endif #endif /* GL_EXT_x11_sync_object */ #ifndef GL_GREMEDY_frame_terminator #define GL_GREMEDY_frame_terminator 1 typedef void (APIENTRYP PFNGLFRAMETERMINATORGREMEDYPROC) (void); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glFrameTerminatorGREMEDY (void); #endif #endif /* GL_GREMEDY_frame_terminator */ #ifndef GL_GREMEDY_string_marker #define GL_GREMEDY_string_marker 1 typedef void (APIENTRYP PFNGLSTRINGMARKERGREMEDYPROC) (GLsizei len, const void *string); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glStringMarkerGREMEDY (GLsizei len, const void *string); #endif #endif /* GL_GREMEDY_string_marker */ #ifndef GL_HP_convolution_border_modes #define GL_HP_convolution_border_modes 1 #define GL_IGNORE_BORDER_HP 0x8150 #define GL_CONSTANT_BORDER_HP 0x8151 #define GL_REPLICATE_BORDER_HP 0x8153 #define GL_CONVOLUTION_BORDER_COLOR_HP 0x8154 #endif /* GL_HP_convolution_border_modes */ #ifndef GL_HP_image_transform #define GL_HP_image_transform 1 #define GL_IMAGE_SCALE_X_HP 0x8155 #define GL_IMAGE_SCALE_Y_HP 0x8156 #define GL_IMAGE_TRANSLATE_X_HP 0x8157 #define GL_IMAGE_TRANSLATE_Y_HP 0x8158 #define GL_IMAGE_ROTATE_ANGLE_HP 0x8159 #define GL_IMAGE_ROTATE_ORIGIN_X_HP 0x815A #define GL_IMAGE_ROTATE_ORIGIN_Y_HP 0x815B #define GL_IMAGE_MAG_FILTER_HP 0x815C #define GL_IMAGE_MIN_FILTER_HP 0x815D #define GL_IMAGE_CUBIC_WEIGHT_HP 0x815E #define GL_CUBIC_HP 0x815F #define GL_AVERAGE_HP 0x8160 #define GL_IMAGE_TRANSFORM_2D_HP 0x8161 #define GL_POST_IMAGE_TRANSFORM_COLOR_TABLE_HP 0x8162 #define GL_PROXY_POST_IMAGE_TRANSFORM_COLOR_TABLE_HP 0x8163 typedef void (APIENTRYP PFNGLIMAGETRANSFORMPARAMETERIHPPROC) (GLenum target, GLenum pname, GLint param); typedef void (APIENTRYP PFNGLIMAGETRANSFORMPARAMETERFHPPROC) (GLenum target, GLenum pname, GLfloat param); typedef void (APIENTRYP PFNGLIMAGETRANSFORMPARAMETERIVHPPROC) (GLenum target, GLenum pname, const GLint *params); typedef void (APIENTRYP PFNGLIMAGETRANSFORMPARAMETERFVHPPROC) (GLenum target, GLenum pname, const GLfloat *params); typedef void (APIENTRYP PFNGLGETIMAGETRANSFORMPARAMETERIVHPPROC) (GLenum target, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGETIMAGETRANSFORMPARAMETERFVHPPROC) (GLenum target, GLenum pname, GLfloat *params); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glImageTransformParameteriHP (GLenum target, GLenum pname, GLint param); GLAPI void APIENTRY glImageTransformParameterfHP (GLenum target, GLenum pname, GLfloat param); GLAPI void APIENTRY glImageTransformParameterivHP (GLenum target, GLenum pname, const GLint *params); GLAPI void APIENTRY glImageTransformParameterfvHP (GLenum target, GLenum pname, const GLfloat *params); GLAPI void APIENTRY glGetImageTransformParameterivHP (GLenum target, GLenum pname, GLint *params); GLAPI void APIENTRY glGetImageTransformParameterfvHP (GLenum target, GLenum pname, GLfloat *params); #endif #endif /* GL_HP_image_transform */ #ifndef GL_HP_occlusion_test #define GL_HP_occlusion_test 1 #define GL_OCCLUSION_TEST_HP 0x8165 #define GL_OCCLUSION_TEST_RESULT_HP 0x8166 #endif /* GL_HP_occlusion_test */ #ifndef GL_HP_texture_lighting #define GL_HP_texture_lighting 1 #define GL_TEXTURE_LIGHTING_MODE_HP 0x8167 #define GL_TEXTURE_POST_SPECULAR_HP 0x8168 #define GL_TEXTURE_PRE_SPECULAR_HP 0x8169 #endif /* GL_HP_texture_lighting */ #ifndef GL_IBM_cull_vertex #define GL_IBM_cull_vertex 1 #define GL_CULL_VERTEX_IBM 103050 #endif /* GL_IBM_cull_vertex */ #ifndef GL_IBM_multimode_draw_arrays #define GL_IBM_multimode_draw_arrays 1 typedef void (APIENTRYP PFNGLMULTIMODEDRAWARRAYSIBMPROC) (const GLenum *mode, const GLint *first, const GLsizei *count, GLsizei primcount, GLint modestride); typedef void (APIENTRYP PFNGLMULTIMODEDRAWELEMENTSIBMPROC) (const GLenum *mode, const GLsizei *count, GLenum type, const void *const*indices, GLsizei primcount, GLint modestride); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glMultiModeDrawArraysIBM (const GLenum *mode, const GLint *first, const GLsizei *count, GLsizei primcount, GLint modestride); GLAPI void APIENTRY glMultiModeDrawElementsIBM (const GLenum *mode, const GLsizei *count, GLenum type, const void *const*indices, GLsizei primcount, GLint modestride); #endif #endif /* GL_IBM_multimode_draw_arrays */ #ifndef GL_IBM_rasterpos_clip #define GL_IBM_rasterpos_clip 1 #define GL_RASTER_POSITION_UNCLIPPED_IBM 0x19262 #endif /* GL_IBM_rasterpos_clip */ #ifndef GL_IBM_static_data #define GL_IBM_static_data 1 #define GL_ALL_STATIC_DATA_IBM 103060 #define GL_STATIC_VERTEX_ARRAY_IBM 103061 typedef void (APIENTRYP PFNGLFLUSHSTATICDATAIBMPROC) (GLenum target); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glFlushStaticDataIBM (GLenum target); #endif #endif /* GL_IBM_static_data */ #ifndef GL_IBM_texture_mirrored_repeat #define GL_IBM_texture_mirrored_repeat 1 #define GL_MIRRORED_REPEAT_IBM 0x8370 #endif /* GL_IBM_texture_mirrored_repeat */ #ifndef GL_IBM_vertex_array_lists #define GL_IBM_vertex_array_lists 1 #define GL_VERTEX_ARRAY_LIST_IBM 103070 #define GL_NORMAL_ARRAY_LIST_IBM 103071 #define GL_COLOR_ARRAY_LIST_IBM 103072 #define GL_INDEX_ARRAY_LIST_IBM 103073 #define GL_TEXTURE_COORD_ARRAY_LIST_IBM 103074 #define GL_EDGE_FLAG_ARRAY_LIST_IBM 103075 #define GL_FOG_COORDINATE_ARRAY_LIST_IBM 103076 #define GL_SECONDARY_COLOR_ARRAY_LIST_IBM 103077 #define GL_VERTEX_ARRAY_LIST_STRIDE_IBM 103080 #define GL_NORMAL_ARRAY_LIST_STRIDE_IBM 103081 #define GL_COLOR_ARRAY_LIST_STRIDE_IBM 103082 #define GL_INDEX_ARRAY_LIST_STRIDE_IBM 103083 #define GL_TEXTURE_COORD_ARRAY_LIST_STRIDE_IBM 103084 #define GL_EDGE_FLAG_ARRAY_LIST_STRIDE_IBM 103085 #define GL_FOG_COORDINATE_ARRAY_LIST_STRIDE_IBM 103086 #define GL_SECONDARY_COLOR_ARRAY_LIST_STRIDE_IBM 103087 typedef void (APIENTRYP PFNGLCOLORPOINTERLISTIBMPROC) (GLint size, GLenum type, GLint stride, const void **pointer, GLint ptrstride); typedef void (APIENTRYP PFNGLSECONDARYCOLORPOINTERLISTIBMPROC) (GLint size, GLenum type, GLint stride, const void **pointer, GLint ptrstride); typedef void (APIENTRYP PFNGLEDGEFLAGPOINTERLISTIBMPROC) (GLint stride, const GLboolean **pointer, GLint ptrstride); typedef void (APIENTRYP PFNGLFOGCOORDPOINTERLISTIBMPROC) (GLenum type, GLint stride, const void **pointer, GLint ptrstride); typedef void (APIENTRYP PFNGLINDEXPOINTERLISTIBMPROC) (GLenum type, GLint stride, const void **pointer, GLint ptrstride); typedef void (APIENTRYP PFNGLNORMALPOINTERLISTIBMPROC) (GLenum type, GLint stride, const void **pointer, GLint ptrstride); typedef void (APIENTRYP PFNGLTEXCOORDPOINTERLISTIBMPROC) (GLint size, GLenum type, GLint stride, const void **pointer, GLint ptrstride); typedef void (APIENTRYP PFNGLVERTEXPOINTERLISTIBMPROC) (GLint size, GLenum type, GLint stride, const void **pointer, GLint ptrstride); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glColorPointerListIBM (GLint size, GLenum type, GLint stride, const void **pointer, GLint ptrstride); GLAPI void APIENTRY glSecondaryColorPointerListIBM (GLint size, GLenum type, GLint stride, const void **pointer, GLint ptrstride); GLAPI void APIENTRY glEdgeFlagPointerListIBM (GLint stride, const GLboolean **pointer, GLint ptrstride); GLAPI void APIENTRY glFogCoordPointerListIBM (GLenum type, GLint stride, const void **pointer, GLint ptrstride); GLAPI void APIENTRY glIndexPointerListIBM (GLenum type, GLint stride, const void **pointer, GLint ptrstride); GLAPI void APIENTRY glNormalPointerListIBM (GLenum type, GLint stride, const void **pointer, GLint ptrstride); GLAPI void APIENTRY glTexCoordPointerListIBM (GLint size, GLenum type, GLint stride, const void **pointer, GLint ptrstride); GLAPI void APIENTRY glVertexPointerListIBM (GLint size, GLenum type, GLint stride, const void **pointer, GLint ptrstride); #endif #endif /* GL_IBM_vertex_array_lists */ #ifndef GL_INGR_blend_func_separate #define GL_INGR_blend_func_separate 1 typedef void (APIENTRYP PFNGLBLENDFUNCSEPARATEINGRPROC) (GLenum sfactorRGB, GLenum dfactorRGB, GLenum sfactorAlpha, GLenum dfactorAlpha); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glBlendFuncSeparateINGR (GLenum sfactorRGB, GLenum dfactorRGB, GLenum sfactorAlpha, GLenum dfactorAlpha); #endif #endif /* GL_INGR_blend_func_separate */ #ifndef GL_INGR_color_clamp #define GL_INGR_color_clamp 1 #define GL_RED_MIN_CLAMP_INGR 0x8560 #define GL_GREEN_MIN_CLAMP_INGR 0x8561 #define GL_BLUE_MIN_CLAMP_INGR 0x8562 #define GL_ALPHA_MIN_CLAMP_INGR 0x8563 #define GL_RED_MAX_CLAMP_INGR 0x8564 #define GL_GREEN_MAX_CLAMP_INGR 0x8565 #define GL_BLUE_MAX_CLAMP_INGR 0x8566 #define GL_ALPHA_MAX_CLAMP_INGR 0x8567 #endif /* GL_INGR_color_clamp */ #ifndef GL_INGR_interlace_read #define GL_INGR_interlace_read 1 #define GL_INTERLACE_READ_INGR 0x8568 #endif /* GL_INGR_interlace_read */ #ifndef GL_INTEL_fragment_shader_ordering #define GL_INTEL_fragment_shader_ordering 1 #endif /* GL_INTEL_fragment_shader_ordering */ #ifndef GL_INTEL_map_texture #define GL_INTEL_map_texture 1 #define GL_TEXTURE_MEMORY_LAYOUT_INTEL 0x83FF #define GL_LAYOUT_DEFAULT_INTEL 0 #define GL_LAYOUT_LINEAR_INTEL 1 #define GL_LAYOUT_LINEAR_CPU_CACHED_INTEL 2 typedef void (APIENTRYP PFNGLSYNCTEXTUREINTELPROC) (GLuint texture); typedef void (APIENTRYP PFNGLUNMAPTEXTURE2DINTELPROC) (GLuint texture, GLint level); typedef void *(APIENTRYP PFNGLMAPTEXTURE2DINTELPROC) (GLuint texture, GLint level, GLbitfield access, GLint *stride, GLenum *layout); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glSyncTextureINTEL (GLuint texture); GLAPI void APIENTRY glUnmapTexture2DINTEL (GLuint texture, GLint level); GLAPI void *APIENTRY glMapTexture2DINTEL (GLuint texture, GLint level, GLbitfield access, GLint *stride, GLenum *layout); #endif #endif /* GL_INTEL_map_texture */ #ifndef GL_INTEL_parallel_arrays #define GL_INTEL_parallel_arrays 1 #define GL_PARALLEL_ARRAYS_INTEL 0x83F4 #define GL_VERTEX_ARRAY_PARALLEL_POINTERS_INTEL 0x83F5 #define GL_NORMAL_ARRAY_PARALLEL_POINTERS_INTEL 0x83F6 #define GL_COLOR_ARRAY_PARALLEL_POINTERS_INTEL 0x83F7 #define GL_TEXTURE_COORD_ARRAY_PARALLEL_POINTERS_INTEL 0x83F8 typedef void (APIENTRYP PFNGLVERTEXPOINTERVINTELPROC) (GLint size, GLenum type, const void **pointer); typedef void (APIENTRYP PFNGLNORMALPOINTERVINTELPROC) (GLenum type, const void **pointer); typedef void (APIENTRYP PFNGLCOLORPOINTERVINTELPROC) (GLint size, GLenum type, const void **pointer); typedef void (APIENTRYP PFNGLTEXCOORDPOINTERVINTELPROC) (GLint size, GLenum type, const void **pointer); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glVertexPointervINTEL (GLint size, GLenum type, const void **pointer); GLAPI void APIENTRY glNormalPointervINTEL (GLenum type, const void **pointer); GLAPI void APIENTRY glColorPointervINTEL (GLint size, GLenum type, const void **pointer); GLAPI void APIENTRY glTexCoordPointervINTEL (GLint size, GLenum type, const void **pointer); #endif #endif /* GL_INTEL_parallel_arrays */ #ifndef GL_INTEL_performance_query #define GL_INTEL_performance_query 1 #define GL_PERFQUERY_SINGLE_CONTEXT_INTEL 0x00000000 #define GL_PERFQUERY_GLOBAL_CONTEXT_INTEL 0x00000001 #define GL_PERFQUERY_WAIT_INTEL 0x83FB #define GL_PERFQUERY_FLUSH_INTEL 0x83FA #define GL_PERFQUERY_DONOT_FLUSH_INTEL 0x83F9 #define GL_PERFQUERY_COUNTER_EVENT_INTEL 0x94F0 #define GL_PERFQUERY_COUNTER_DURATION_NORM_INTEL 0x94F1 #define GL_PERFQUERY_COUNTER_DURATION_RAW_INTEL 0x94F2 #define GL_PERFQUERY_COUNTER_THROUGHPUT_INTEL 0x94F3 #define GL_PERFQUERY_COUNTER_RAW_INTEL 0x94F4 #define GL_PERFQUERY_COUNTER_TIMESTAMP_INTEL 0x94F5 #define GL_PERFQUERY_COUNTER_DATA_UINT32_INTEL 0x94F8 #define GL_PERFQUERY_COUNTER_DATA_UINT64_INTEL 0x94F9 #define GL_PERFQUERY_COUNTER_DATA_FLOAT_INTEL 0x94FA #define GL_PERFQUERY_COUNTER_DATA_DOUBLE_INTEL 0x94FB #define GL_PERFQUERY_COUNTER_DATA_BOOL32_INTEL 0x94FC #define GL_PERFQUERY_QUERY_NAME_LENGTH_MAX_INTEL 0x94FD #define GL_PERFQUERY_COUNTER_NAME_LENGTH_MAX_INTEL 0x94FE #define GL_PERFQUERY_COUNTER_DESC_LENGTH_MAX_INTEL 0x94FF #define GL_PERFQUERY_GPA_EXTENDED_COUNTERS_INTEL 0x9500 typedef void (APIENTRYP PFNGLBEGINPERFQUERYINTELPROC) (GLuint queryHandle); typedef void (APIENTRYP PFNGLCREATEPERFQUERYINTELPROC) (GLuint queryId, GLuint *queryHandle); typedef void (APIENTRYP PFNGLDELETEPERFQUERYINTELPROC) (GLuint queryHandle); typedef void (APIENTRYP PFNGLENDPERFQUERYINTELPROC) (GLuint queryHandle); typedef void (APIENTRYP PFNGLGETFIRSTPERFQUERYIDINTELPROC) (GLuint *queryId); typedef void (APIENTRYP PFNGLGETNEXTPERFQUERYIDINTELPROC) (GLuint queryId, GLuint *nextQueryId); typedef void (APIENTRYP PFNGLGETPERFCOUNTERINFOINTELPROC) (GLuint queryId, GLuint counterId, GLuint counterNameLength, GLchar *counterName, GLuint counterDescLength, GLchar *counterDesc, GLuint *counterOffset, GLuint *counterDataSize, GLuint *counterTypeEnum, GLuint *counterDataTypeEnum, GLuint64 *rawCounterMaxValue); typedef void (APIENTRYP PFNGLGETPERFQUERYDATAINTELPROC) (GLuint queryHandle, GLuint flags, GLsizei dataSize, GLvoid *data, GLuint *bytesWritten); typedef void (APIENTRYP PFNGLGETPERFQUERYIDBYNAMEINTELPROC) (GLchar *queryName, GLuint *queryId); typedef void (APIENTRYP PFNGLGETPERFQUERYINFOINTELPROC) (GLuint queryId, GLuint queryNameLength, GLchar *queryName, GLuint *dataSize, GLuint *noCounters, GLuint *noInstances, GLuint *capsMask); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glBeginPerfQueryINTEL (GLuint queryHandle); GLAPI void APIENTRY glCreatePerfQueryINTEL (GLuint queryId, GLuint *queryHandle); GLAPI void APIENTRY glDeletePerfQueryINTEL (GLuint queryHandle); GLAPI void APIENTRY glEndPerfQueryINTEL (GLuint queryHandle); GLAPI void APIENTRY glGetFirstPerfQueryIdINTEL (GLuint *queryId); GLAPI void APIENTRY glGetNextPerfQueryIdINTEL (GLuint queryId, GLuint *nextQueryId); GLAPI void APIENTRY glGetPerfCounterInfoINTEL (GLuint queryId, GLuint counterId, GLuint counterNameLength, GLchar *counterName, GLuint counterDescLength, GLchar *counterDesc, GLuint *counterOffset, GLuint *counterDataSize, GLuint *counterTypeEnum, GLuint *counterDataTypeEnum, GLuint64 *rawCounterMaxValue); GLAPI void APIENTRY glGetPerfQueryDataINTEL (GLuint queryHandle, GLuint flags, GLsizei dataSize, GLvoid *data, GLuint *bytesWritten); GLAPI void APIENTRY glGetPerfQueryIdByNameINTEL (GLchar *queryName, GLuint *queryId); GLAPI void APIENTRY glGetPerfQueryInfoINTEL (GLuint queryId, GLuint queryNameLength, GLchar *queryName, GLuint *dataSize, GLuint *noCounters, GLuint *noInstances, GLuint *capsMask); #endif #endif /* GL_INTEL_performance_query */ #ifndef GL_MESAX_texture_stack #define GL_MESAX_texture_stack 1 #define GL_TEXTURE_1D_STACK_MESAX 0x8759 #define GL_TEXTURE_2D_STACK_MESAX 0x875A #define GL_PROXY_TEXTURE_1D_STACK_MESAX 0x875B #define GL_PROXY_TEXTURE_2D_STACK_MESAX 0x875C #define GL_TEXTURE_1D_STACK_BINDING_MESAX 0x875D #define GL_TEXTURE_2D_STACK_BINDING_MESAX 0x875E #endif /* GL_MESAX_texture_stack */ #ifndef GL_MESA_pack_invert #define GL_MESA_pack_invert 1 #define GL_PACK_INVERT_MESA 0x8758 #endif /* GL_MESA_pack_invert */ #ifndef GL_MESA_resize_buffers #define GL_MESA_resize_buffers 1 typedef void (APIENTRYP PFNGLRESIZEBUFFERSMESAPROC) (void); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glResizeBuffersMESA (void); #endif #endif /* GL_MESA_resize_buffers */ #ifndef GL_MESA_window_pos #define GL_MESA_window_pos 1 typedef void (APIENTRYP PFNGLWINDOWPOS2DMESAPROC) (GLdouble x, GLdouble y); typedef void (APIENTRYP PFNGLWINDOWPOS2DVMESAPROC) (const GLdouble *v); typedef void (APIENTRYP PFNGLWINDOWPOS2FMESAPROC) (GLfloat x, GLfloat y); typedef void (APIENTRYP PFNGLWINDOWPOS2FVMESAPROC) (const GLfloat *v); typedef void (APIENTRYP PFNGLWINDOWPOS2IMESAPROC) (GLint x, GLint y); typedef void (APIENTRYP PFNGLWINDOWPOS2IVMESAPROC) (const GLint *v); typedef void (APIENTRYP PFNGLWINDOWPOS2SMESAPROC) (GLshort x, GLshort y); typedef void (APIENTRYP PFNGLWINDOWPOS2SVMESAPROC) (const GLshort *v); typedef void (APIENTRYP PFNGLWINDOWPOS3DMESAPROC) (GLdouble x, GLdouble y, GLdouble z); typedef void (APIENTRYP PFNGLWINDOWPOS3DVMESAPROC) (const GLdouble *v); typedef void (APIENTRYP PFNGLWINDOWPOS3FMESAPROC) (GLfloat x, GLfloat y, GLfloat z); typedef void (APIENTRYP PFNGLWINDOWPOS3FVMESAPROC) (const GLfloat *v); typedef void (APIENTRYP PFNGLWINDOWPOS3IMESAPROC) (GLint x, GLint y, GLint z); typedef void (APIENTRYP PFNGLWINDOWPOS3IVMESAPROC) (const GLint *v); typedef void (APIENTRYP PFNGLWINDOWPOS3SMESAPROC) (GLshort x, GLshort y, GLshort z); typedef void (APIENTRYP PFNGLWINDOWPOS3SVMESAPROC) (const GLshort *v); typedef void (APIENTRYP PFNGLWINDOWPOS4DMESAPROC) (GLdouble x, GLdouble y, GLdouble z, GLdouble w); typedef void (APIENTRYP PFNGLWINDOWPOS4DVMESAPROC) (const GLdouble *v); typedef void (APIENTRYP PFNGLWINDOWPOS4FMESAPROC) (GLfloat x, GLfloat y, GLfloat z, GLfloat w); typedef void (APIENTRYP PFNGLWINDOWPOS4FVMESAPROC) (const GLfloat *v); typedef void (APIENTRYP PFNGLWINDOWPOS4IMESAPROC) (GLint x, GLint y, GLint z, GLint w); typedef void (APIENTRYP PFNGLWINDOWPOS4IVMESAPROC) (const GLint *v); typedef void (APIENTRYP PFNGLWINDOWPOS4SMESAPROC) (GLshort x, GLshort y, GLshort z, GLshort w); typedef void (APIENTRYP PFNGLWINDOWPOS4SVMESAPROC) (const GLshort *v); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glWindowPos2dMESA (GLdouble x, GLdouble y); GLAPI void APIENTRY glWindowPos2dvMESA (const GLdouble *v); GLAPI void APIENTRY glWindowPos2fMESA (GLfloat x, GLfloat y); GLAPI void APIENTRY glWindowPos2fvMESA (const GLfloat *v); GLAPI void APIENTRY glWindowPos2iMESA (GLint x, GLint y); GLAPI void APIENTRY glWindowPos2ivMESA (const GLint *v); GLAPI void APIENTRY glWindowPos2sMESA (GLshort x, GLshort y); GLAPI void APIENTRY glWindowPos2svMESA (const GLshort *v); GLAPI void APIENTRY glWindowPos3dMESA (GLdouble x, GLdouble y, GLdouble z); GLAPI void APIENTRY glWindowPos3dvMESA (const GLdouble *v); GLAPI void APIENTRY glWindowPos3fMESA (GLfloat x, GLfloat y, GLfloat z); GLAPI void APIENTRY glWindowPos3fvMESA (const GLfloat *v); GLAPI void APIENTRY glWindowPos3iMESA (GLint x, GLint y, GLint z); GLAPI void APIENTRY glWindowPos3ivMESA (const GLint *v); GLAPI void APIENTRY glWindowPos3sMESA (GLshort x, GLshort y, GLshort z); GLAPI void APIENTRY glWindowPos3svMESA (const GLshort *v); GLAPI void APIENTRY glWindowPos4dMESA (GLdouble x, GLdouble y, GLdouble z, GLdouble w); GLAPI void APIENTRY glWindowPos4dvMESA (const GLdouble *v); GLAPI void APIENTRY glWindowPos4fMESA (GLfloat x, GLfloat y, GLfloat z, GLfloat w); GLAPI void APIENTRY glWindowPos4fvMESA (const GLfloat *v); GLAPI void APIENTRY glWindowPos4iMESA (GLint x, GLint y, GLint z, GLint w); GLAPI void APIENTRY glWindowPos4ivMESA (const GLint *v); GLAPI void APIENTRY glWindowPos4sMESA (GLshort x, GLshort y, GLshort z, GLshort w); GLAPI void APIENTRY glWindowPos4svMESA (const GLshort *v); #endif #endif /* GL_MESA_window_pos */ #ifndef GL_MESA_ycbcr_texture #define GL_MESA_ycbcr_texture 1 #define GL_UNSIGNED_SHORT_8_8_MESA 0x85BA #define GL_UNSIGNED_SHORT_8_8_REV_MESA 0x85BB #define GL_YCBCR_MESA 0x8757 #endif /* GL_MESA_ycbcr_texture */ #ifndef GL_NVX_conditional_render #define GL_NVX_conditional_render 1 typedef void (APIENTRYP PFNGLBEGINCONDITIONALRENDERNVXPROC) (GLuint id); typedef void (APIENTRYP PFNGLENDCONDITIONALRENDERNVXPROC) (void); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glBeginConditionalRenderNVX (GLuint id); GLAPI void APIENTRY glEndConditionalRenderNVX (void); #endif #endif /* GL_NVX_conditional_render */ #ifndef GL_NV_bindless_multi_draw_indirect #define GL_NV_bindless_multi_draw_indirect 1 typedef void (APIENTRYP PFNGLMULTIDRAWARRAYSINDIRECTBINDLESSNVPROC) (GLenum mode, const void *indirect, GLsizei drawCount, GLsizei stride, GLint vertexBufferCount); typedef void (APIENTRYP PFNGLMULTIDRAWELEMENTSINDIRECTBINDLESSNVPROC) (GLenum mode, GLenum type, const void *indirect, GLsizei drawCount, GLsizei stride, GLint vertexBufferCount); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glMultiDrawArraysIndirectBindlessNV (GLenum mode, const void *indirect, GLsizei drawCount, GLsizei stride, GLint vertexBufferCount); GLAPI void APIENTRY glMultiDrawElementsIndirectBindlessNV (GLenum mode, GLenum type, const void *indirect, GLsizei drawCount, GLsizei stride, GLint vertexBufferCount); #endif #endif /* GL_NV_bindless_multi_draw_indirect */ #ifndef GL_NV_bindless_texture #define GL_NV_bindless_texture 1 typedef GLuint64 (APIENTRYP PFNGLGETTEXTUREHANDLENVPROC) (GLuint texture); typedef GLuint64 (APIENTRYP PFNGLGETTEXTURESAMPLERHANDLENVPROC) (GLuint texture, GLuint sampler); typedef void (APIENTRYP PFNGLMAKETEXTUREHANDLERESIDENTNVPROC) (GLuint64 handle); typedef void (APIENTRYP PFNGLMAKETEXTUREHANDLENONRESIDENTNVPROC) (GLuint64 handle); typedef GLuint64 (APIENTRYP PFNGLGETIMAGEHANDLENVPROC) (GLuint texture, GLint level, GLboolean layered, GLint layer, GLenum format); typedef void (APIENTRYP PFNGLMAKEIMAGEHANDLERESIDENTNVPROC) (GLuint64 handle, GLenum access); typedef void (APIENTRYP PFNGLMAKEIMAGEHANDLENONRESIDENTNVPROC) (GLuint64 handle); typedef void (APIENTRYP PFNGLUNIFORMHANDLEUI64NVPROC) (GLint location, GLuint64 value); typedef void (APIENTRYP PFNGLUNIFORMHANDLEUI64VNVPROC) (GLint location, GLsizei count, const GLuint64 *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORMHANDLEUI64NVPROC) (GLuint program, GLint location, GLuint64 value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORMHANDLEUI64VNVPROC) (GLuint program, GLint location, GLsizei count, const GLuint64 *values); typedef GLboolean (APIENTRYP PFNGLISTEXTUREHANDLERESIDENTNVPROC) (GLuint64 handle); typedef GLboolean (APIENTRYP PFNGLISIMAGEHANDLERESIDENTNVPROC) (GLuint64 handle); #ifdef GL_GLEXT_PROTOTYPES GLAPI GLuint64 APIENTRY glGetTextureHandleNV (GLuint texture); GLAPI GLuint64 APIENTRY glGetTextureSamplerHandleNV (GLuint texture, GLuint sampler); GLAPI void APIENTRY glMakeTextureHandleResidentNV (GLuint64 handle); GLAPI void APIENTRY glMakeTextureHandleNonResidentNV (GLuint64 handle); GLAPI GLuint64 APIENTRY glGetImageHandleNV (GLuint texture, GLint level, GLboolean layered, GLint layer, GLenum format); GLAPI void APIENTRY glMakeImageHandleResidentNV (GLuint64 handle, GLenum access); GLAPI void APIENTRY glMakeImageHandleNonResidentNV (GLuint64 handle); GLAPI void APIENTRY glUniformHandleui64NV (GLint location, GLuint64 value); GLAPI void APIENTRY glUniformHandleui64vNV (GLint location, GLsizei count, const GLuint64 *value); GLAPI void APIENTRY glProgramUniformHandleui64NV (GLuint program, GLint location, GLuint64 value); GLAPI void APIENTRY glProgramUniformHandleui64vNV (GLuint program, GLint location, GLsizei count, const GLuint64 *values); GLAPI GLboolean APIENTRY glIsTextureHandleResidentNV (GLuint64 handle); GLAPI GLboolean APIENTRY glIsImageHandleResidentNV (GLuint64 handle); #endif #endif /* GL_NV_bindless_texture */ #ifndef GL_NV_blend_equation_advanced #define GL_NV_blend_equation_advanced 1 #define GL_BLEND_OVERLAP_NV 0x9281 #define GL_BLEND_PREMULTIPLIED_SRC_NV 0x9280 #define GL_BLUE_NV 0x1905 #define GL_COLORBURN_NV 0x929A #define GL_COLORDODGE_NV 0x9299 #define GL_CONJOINT_NV 0x9284 #define GL_CONTRAST_NV 0x92A1 #define GL_DARKEN_NV 0x9297 #define GL_DIFFERENCE_NV 0x929E #define GL_DISJOINT_NV 0x9283 #define GL_DST_ATOP_NV 0x928F #define GL_DST_IN_NV 0x928B #define GL_DST_NV 0x9287 #define GL_DST_OUT_NV 0x928D #define GL_DST_OVER_NV 0x9289 #define GL_EXCLUSION_NV 0x92A0 #define GL_GREEN_NV 0x1904 #define GL_HARDLIGHT_NV 0x929B #define GL_HARDMIX_NV 0x92A9 #define GL_HSL_COLOR_NV 0x92AF #define GL_HSL_HUE_NV 0x92AD #define GL_HSL_LUMINOSITY_NV 0x92B0 #define GL_HSL_SATURATION_NV 0x92AE #define GL_INVERT_OVG_NV 0x92B4 #define GL_INVERT_RGB_NV 0x92A3 #define GL_LIGHTEN_NV 0x9298 #define GL_LINEARBURN_NV 0x92A5 #define GL_LINEARDODGE_NV 0x92A4 #define GL_LINEARLIGHT_NV 0x92A7 #define GL_MINUS_CLAMPED_NV 0x92B3 #define GL_MINUS_NV 0x929F #define GL_MULTIPLY_NV 0x9294 #define GL_OVERLAY_NV 0x9296 #define GL_PINLIGHT_NV 0x92A8 #define GL_PLUS_CLAMPED_ALPHA_NV 0x92B2 #define GL_PLUS_CLAMPED_NV 0x92B1 #define GL_PLUS_DARKER_NV 0x9292 #define GL_PLUS_NV 0x9291 #define GL_RED_NV 0x1903 #define GL_SCREEN_NV 0x9295 #define GL_SOFTLIGHT_NV 0x929C #define GL_SRC_ATOP_NV 0x928E #define GL_SRC_IN_NV 0x928A #define GL_SRC_NV 0x9286 #define GL_SRC_OUT_NV 0x928C #define GL_SRC_OVER_NV 0x9288 #define GL_UNCORRELATED_NV 0x9282 #define GL_VIVIDLIGHT_NV 0x92A6 #define GL_XOR_NV 0x1506 typedef void (APIENTRYP PFNGLBLENDPARAMETERINVPROC) (GLenum pname, GLint value); typedef void (APIENTRYP PFNGLBLENDBARRIERNVPROC) (void); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glBlendParameteriNV (GLenum pname, GLint value); GLAPI void APIENTRY glBlendBarrierNV (void); #endif #endif /* GL_NV_blend_equation_advanced */ #ifndef GL_NV_blend_equation_advanced_coherent #define GL_NV_blend_equation_advanced_coherent 1 #define GL_BLEND_ADVANCED_COHERENT_NV 0x9285 #endif /* GL_NV_blend_equation_advanced_coherent */ #ifndef GL_NV_blend_square #define GL_NV_blend_square 1 #endif /* GL_NV_blend_square */ #ifndef GL_NV_compute_program5 #define GL_NV_compute_program5 1 #define GL_COMPUTE_PROGRAM_NV 0x90FB #define GL_COMPUTE_PROGRAM_PARAMETER_BUFFER_NV 0x90FC #endif /* GL_NV_compute_program5 */ #ifndef GL_NV_conditional_render #define GL_NV_conditional_render 1 #define GL_QUERY_WAIT_NV 0x8E13 #define GL_QUERY_NO_WAIT_NV 0x8E14 #define GL_QUERY_BY_REGION_WAIT_NV 0x8E15 #define GL_QUERY_BY_REGION_NO_WAIT_NV 0x8E16 typedef void (APIENTRYP PFNGLBEGINCONDITIONALRENDERNVPROC) (GLuint id, GLenum mode); typedef void (APIENTRYP PFNGLENDCONDITIONALRENDERNVPROC) (void); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glBeginConditionalRenderNV (GLuint id, GLenum mode); GLAPI void APIENTRY glEndConditionalRenderNV (void); #endif #endif /* GL_NV_conditional_render */ #ifndef GL_NV_copy_depth_to_color #define GL_NV_copy_depth_to_color 1 #define GL_DEPTH_STENCIL_TO_RGBA_NV 0x886E #define GL_DEPTH_STENCIL_TO_BGRA_NV 0x886F #endif /* GL_NV_copy_depth_to_color */ #ifndef GL_NV_copy_image #define GL_NV_copy_image 1 typedef void (APIENTRYP PFNGLCOPYIMAGESUBDATANVPROC) (GLuint srcName, GLenum srcTarget, GLint srcLevel, GLint srcX, GLint srcY, GLint srcZ, GLuint dstName, GLenum dstTarget, GLint dstLevel, GLint dstX, GLint dstY, GLint dstZ, GLsizei width, GLsizei height, GLsizei depth); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glCopyImageSubDataNV (GLuint srcName, GLenum srcTarget, GLint srcLevel, GLint srcX, GLint srcY, GLint srcZ, GLuint dstName, GLenum dstTarget, GLint dstLevel, GLint dstX, GLint dstY, GLint dstZ, GLsizei width, GLsizei height, GLsizei depth); #endif #endif /* GL_NV_copy_image */ #ifndef GL_NV_deep_texture3D #define GL_NV_deep_texture3D 1 #define GL_MAX_DEEP_3D_TEXTURE_WIDTH_HEIGHT_NV 0x90D0 #define GL_MAX_DEEP_3D_TEXTURE_DEPTH_NV 0x90D1 #endif /* GL_NV_deep_texture3D */ #ifndef GL_NV_depth_buffer_float #define GL_NV_depth_buffer_float 1 #define GL_DEPTH_COMPONENT32F_NV 0x8DAB #define GL_DEPTH32F_STENCIL8_NV 0x8DAC #define GL_FLOAT_32_UNSIGNED_INT_24_8_REV_NV 0x8DAD #define GL_DEPTH_BUFFER_FLOAT_MODE_NV 0x8DAF typedef void (APIENTRYP PFNGLDEPTHRANGEDNVPROC) (GLdouble zNear, GLdouble zFar); typedef void (APIENTRYP PFNGLCLEARDEPTHDNVPROC) (GLdouble depth); typedef void (APIENTRYP PFNGLDEPTHBOUNDSDNVPROC) (GLdouble zmin, GLdouble zmax); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glDepthRangedNV (GLdouble zNear, GLdouble zFar); GLAPI void APIENTRY glClearDepthdNV (GLdouble depth); GLAPI void APIENTRY glDepthBoundsdNV (GLdouble zmin, GLdouble zmax); #endif #endif /* GL_NV_depth_buffer_float */ #ifndef GL_NV_depth_clamp #define GL_NV_depth_clamp 1 #define GL_DEPTH_CLAMP_NV 0x864F #endif /* GL_NV_depth_clamp */ #ifndef GL_NV_draw_texture #define GL_NV_draw_texture 1 typedef void (APIENTRYP PFNGLDRAWTEXTURENVPROC) (GLuint texture, GLuint sampler, GLfloat x0, GLfloat y0, GLfloat x1, GLfloat y1, GLfloat z, GLfloat s0, GLfloat t0, GLfloat s1, GLfloat t1); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glDrawTextureNV (GLuint texture, GLuint sampler, GLfloat x0, GLfloat y0, GLfloat x1, GLfloat y1, GLfloat z, GLfloat s0, GLfloat t0, GLfloat s1, GLfloat t1); #endif #endif /* GL_NV_draw_texture */ #ifndef GL_NV_evaluators #define GL_NV_evaluators 1 #define GL_EVAL_2D_NV 0x86C0 #define GL_EVAL_TRIANGULAR_2D_NV 0x86C1 #define GL_MAP_TESSELLATION_NV 0x86C2 #define GL_MAP_ATTRIB_U_ORDER_NV 0x86C3 #define GL_MAP_ATTRIB_V_ORDER_NV 0x86C4 #define GL_EVAL_FRACTIONAL_TESSELLATION_NV 0x86C5 #define GL_EVAL_VERTEX_ATTRIB0_NV 0x86C6 #define GL_EVAL_VERTEX_ATTRIB1_NV 0x86C7 #define GL_EVAL_VERTEX_ATTRIB2_NV 0x86C8 #define GL_EVAL_VERTEX_ATTRIB3_NV 0x86C9 #define GL_EVAL_VERTEX_ATTRIB4_NV 0x86CA #define GL_EVAL_VERTEX_ATTRIB5_NV 0x86CB #define GL_EVAL_VERTEX_ATTRIB6_NV 0x86CC #define GL_EVAL_VERTEX_ATTRIB7_NV 0x86CD #define GL_EVAL_VERTEX_ATTRIB8_NV 0x86CE #define GL_EVAL_VERTEX_ATTRIB9_NV 0x86CF #define GL_EVAL_VERTEX_ATTRIB10_NV 0x86D0 #define GL_EVAL_VERTEX_ATTRIB11_NV 0x86D1 #define GL_EVAL_VERTEX_ATTRIB12_NV 0x86D2 #define GL_EVAL_VERTEX_ATTRIB13_NV 0x86D3 #define GL_EVAL_VERTEX_ATTRIB14_NV 0x86D4 #define GL_EVAL_VERTEX_ATTRIB15_NV 0x86D5 #define GL_MAX_MAP_TESSELLATION_NV 0x86D6 #define GL_MAX_RATIONAL_EVAL_ORDER_NV 0x86D7 typedef void (APIENTRYP PFNGLMAPCONTROLPOINTSNVPROC) (GLenum target, GLuint index, GLenum type, GLsizei ustride, GLsizei vstride, GLint uorder, GLint vorder, GLboolean packed, const void *points); typedef void (APIENTRYP PFNGLMAPPARAMETERIVNVPROC) (GLenum target, GLenum pname, const GLint *params); typedef void (APIENTRYP PFNGLMAPPARAMETERFVNVPROC) (GLenum target, GLenum pname, const GLfloat *params); typedef void (APIENTRYP PFNGLGETMAPCONTROLPOINTSNVPROC) (GLenum target, GLuint index, GLenum type, GLsizei ustride, GLsizei vstride, GLboolean packed, void *points); typedef void (APIENTRYP PFNGLGETMAPPARAMETERIVNVPROC) (GLenum target, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGETMAPPARAMETERFVNVPROC) (GLenum target, GLenum pname, GLfloat *params); typedef void (APIENTRYP PFNGLGETMAPATTRIBPARAMETERIVNVPROC) (GLenum target, GLuint index, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGETMAPATTRIBPARAMETERFVNVPROC) (GLenum target, GLuint index, GLenum pname, GLfloat *params); typedef void (APIENTRYP PFNGLEVALMAPSNVPROC) (GLenum target, GLenum mode); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glMapControlPointsNV (GLenum target, GLuint index, GLenum type, GLsizei ustride, GLsizei vstride, GLint uorder, GLint vorder, GLboolean packed, const void *points); GLAPI void APIENTRY glMapParameterivNV (GLenum target, GLenum pname, const GLint *params); GLAPI void APIENTRY glMapParameterfvNV (GLenum target, GLenum pname, const GLfloat *params); GLAPI void APIENTRY glGetMapControlPointsNV (GLenum target, GLuint index, GLenum type, GLsizei ustride, GLsizei vstride, GLboolean packed, void *points); GLAPI void APIENTRY glGetMapParameterivNV (GLenum target, GLenum pname, GLint *params); GLAPI void APIENTRY glGetMapParameterfvNV (GLenum target, GLenum pname, GLfloat *params); GLAPI void APIENTRY glGetMapAttribParameterivNV (GLenum target, GLuint index, GLenum pname, GLint *params); GLAPI void APIENTRY glGetMapAttribParameterfvNV (GLenum target, GLuint index, GLenum pname, GLfloat *params); GLAPI void APIENTRY glEvalMapsNV (GLenum target, GLenum mode); #endif #endif /* GL_NV_evaluators */ #ifndef GL_NV_explicit_multisample #define GL_NV_explicit_multisample 1 #define GL_SAMPLE_POSITION_NV 0x8E50 #define GL_SAMPLE_MASK_NV 0x8E51 #define GL_SAMPLE_MASK_VALUE_NV 0x8E52 #define GL_TEXTURE_BINDING_RENDERBUFFER_NV 0x8E53 #define GL_TEXTURE_RENDERBUFFER_DATA_STORE_BINDING_NV 0x8E54 #define GL_TEXTURE_RENDERBUFFER_NV 0x8E55 #define GL_SAMPLER_RENDERBUFFER_NV 0x8E56 #define GL_INT_SAMPLER_RENDERBUFFER_NV 0x8E57 #define GL_UNSIGNED_INT_SAMPLER_RENDERBUFFER_NV 0x8E58 #define GL_MAX_SAMPLE_MASK_WORDS_NV 0x8E59 typedef void (APIENTRYP PFNGLGETMULTISAMPLEFVNVPROC) (GLenum pname, GLuint index, GLfloat *val); typedef void (APIENTRYP PFNGLSAMPLEMASKINDEXEDNVPROC) (GLuint index, GLbitfield mask); typedef void (APIENTRYP PFNGLTEXRENDERBUFFERNVPROC) (GLenum target, GLuint renderbuffer); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glGetMultisamplefvNV (GLenum pname, GLuint index, GLfloat *val); GLAPI void APIENTRY glSampleMaskIndexedNV (GLuint index, GLbitfield mask); GLAPI void APIENTRY glTexRenderbufferNV (GLenum target, GLuint renderbuffer); #endif #endif /* GL_NV_explicit_multisample */ #ifndef GL_NV_fence #define GL_NV_fence 1 #define GL_ALL_COMPLETED_NV 0x84F2 #define GL_FENCE_STATUS_NV 0x84F3 #define GL_FENCE_CONDITION_NV 0x84F4 typedef void (APIENTRYP PFNGLDELETEFENCESNVPROC) (GLsizei n, const GLuint *fences); typedef void (APIENTRYP PFNGLGENFENCESNVPROC) (GLsizei n, GLuint *fences); typedef GLboolean (APIENTRYP PFNGLISFENCENVPROC) (GLuint fence); typedef GLboolean (APIENTRYP PFNGLTESTFENCENVPROC) (GLuint fence); typedef void (APIENTRYP PFNGLGETFENCEIVNVPROC) (GLuint fence, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLFINISHFENCENVPROC) (GLuint fence); typedef void (APIENTRYP PFNGLSETFENCENVPROC) (GLuint fence, GLenum condition); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glDeleteFencesNV (GLsizei n, const GLuint *fences); GLAPI void APIENTRY glGenFencesNV (GLsizei n, GLuint *fences); GLAPI GLboolean APIENTRY glIsFenceNV (GLuint fence); GLAPI GLboolean APIENTRY glTestFenceNV (GLuint fence); GLAPI void APIENTRY glGetFenceivNV (GLuint fence, GLenum pname, GLint *params); GLAPI void APIENTRY glFinishFenceNV (GLuint fence); GLAPI void APIENTRY glSetFenceNV (GLuint fence, GLenum condition); #endif #endif /* GL_NV_fence */ #ifndef GL_NV_float_buffer #define GL_NV_float_buffer 1 #define GL_FLOAT_R_NV 0x8880 #define GL_FLOAT_RG_NV 0x8881 #define GL_FLOAT_RGB_NV 0x8882 #define GL_FLOAT_RGBA_NV 0x8883 #define GL_FLOAT_R16_NV 0x8884 #define GL_FLOAT_R32_NV 0x8885 #define GL_FLOAT_RG16_NV 0x8886 #define GL_FLOAT_RG32_NV 0x8887 #define GL_FLOAT_RGB16_NV 0x8888 #define GL_FLOAT_RGB32_NV 0x8889 #define GL_FLOAT_RGBA16_NV 0x888A #define GL_FLOAT_RGBA32_NV 0x888B #define GL_TEXTURE_FLOAT_COMPONENTS_NV 0x888C #define GL_FLOAT_CLEAR_COLOR_VALUE_NV 0x888D #define GL_FLOAT_RGBA_MODE_NV 0x888E #endif /* GL_NV_float_buffer */ #ifndef GL_NV_fog_distance #define GL_NV_fog_distance 1 #define GL_FOG_DISTANCE_MODE_NV 0x855A #define GL_EYE_RADIAL_NV 0x855B #define GL_EYE_PLANE_ABSOLUTE_NV 0x855C #endif /* GL_NV_fog_distance */ #ifndef GL_NV_fragment_program #define GL_NV_fragment_program 1 #define GL_MAX_FRAGMENT_PROGRAM_LOCAL_PARAMETERS_NV 0x8868 #define GL_FRAGMENT_PROGRAM_NV 0x8870 #define GL_MAX_TEXTURE_COORDS_NV 0x8871 #define GL_MAX_TEXTURE_IMAGE_UNITS_NV 0x8872 #define GL_FRAGMENT_PROGRAM_BINDING_NV 0x8873 #define GL_PROGRAM_ERROR_STRING_NV 0x8874 typedef void (APIENTRYP PFNGLPROGRAMNAMEDPARAMETER4FNVPROC) (GLuint id, GLsizei len, const GLubyte *name, GLfloat x, GLfloat y, GLfloat z, GLfloat w); typedef void (APIENTRYP PFNGLPROGRAMNAMEDPARAMETER4FVNVPROC) (GLuint id, GLsizei len, const GLubyte *name, const GLfloat *v); typedef void (APIENTRYP PFNGLPROGRAMNAMEDPARAMETER4DNVPROC) (GLuint id, GLsizei len, const GLubyte *name, GLdouble x, GLdouble y, GLdouble z, GLdouble w); typedef void (APIENTRYP PFNGLPROGRAMNAMEDPARAMETER4DVNVPROC) (GLuint id, GLsizei len, const GLubyte *name, const GLdouble *v); typedef void (APIENTRYP PFNGLGETPROGRAMNAMEDPARAMETERFVNVPROC) (GLuint id, GLsizei len, const GLubyte *name, GLfloat *params); typedef void (APIENTRYP PFNGLGETPROGRAMNAMEDPARAMETERDVNVPROC) (GLuint id, GLsizei len, const GLubyte *name, GLdouble *params); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glProgramNamedParameter4fNV (GLuint id, GLsizei len, const GLubyte *name, GLfloat x, GLfloat y, GLfloat z, GLfloat w); GLAPI void APIENTRY glProgramNamedParameter4fvNV (GLuint id, GLsizei len, const GLubyte *name, const GLfloat *v); GLAPI void APIENTRY glProgramNamedParameter4dNV (GLuint id, GLsizei len, const GLubyte *name, GLdouble x, GLdouble y, GLdouble z, GLdouble w); GLAPI void APIENTRY glProgramNamedParameter4dvNV (GLuint id, GLsizei len, const GLubyte *name, const GLdouble *v); GLAPI void APIENTRY glGetProgramNamedParameterfvNV (GLuint id, GLsizei len, const GLubyte *name, GLfloat *params); GLAPI void APIENTRY glGetProgramNamedParameterdvNV (GLuint id, GLsizei len, const GLubyte *name, GLdouble *params); #endif #endif /* GL_NV_fragment_program */ #ifndef GL_NV_fragment_program2 #define GL_NV_fragment_program2 1 #define GL_MAX_PROGRAM_EXEC_INSTRUCTIONS_NV 0x88F4 #define GL_MAX_PROGRAM_CALL_DEPTH_NV 0x88F5 #define GL_MAX_PROGRAM_IF_DEPTH_NV 0x88F6 #define GL_MAX_PROGRAM_LOOP_DEPTH_NV 0x88F7 #define GL_MAX_PROGRAM_LOOP_COUNT_NV 0x88F8 #endif /* GL_NV_fragment_program2 */ #ifndef GL_NV_fragment_program4 #define GL_NV_fragment_program4 1 #endif /* GL_NV_fragment_program4 */ #ifndef GL_NV_fragment_program_option #define GL_NV_fragment_program_option 1 #endif /* GL_NV_fragment_program_option */ #ifndef GL_NV_framebuffer_multisample_coverage #define GL_NV_framebuffer_multisample_coverage 1 #define GL_RENDERBUFFER_COVERAGE_SAMPLES_NV 0x8CAB #define GL_RENDERBUFFER_COLOR_SAMPLES_NV 0x8E10 #define GL_MAX_MULTISAMPLE_COVERAGE_MODES_NV 0x8E11 #define GL_MULTISAMPLE_COVERAGE_MODES_NV 0x8E12 typedef void (APIENTRYP PFNGLRENDERBUFFERSTORAGEMULTISAMPLECOVERAGENVPROC) (GLenum target, GLsizei coverageSamples, GLsizei colorSamples, GLenum internalformat, GLsizei width, GLsizei height); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glRenderbufferStorageMultisampleCoverageNV (GLenum target, GLsizei coverageSamples, GLsizei colorSamples, GLenum internalformat, GLsizei width, GLsizei height); #endif #endif /* GL_NV_framebuffer_multisample_coverage */ #ifndef GL_NV_geometry_program4 #define GL_NV_geometry_program4 1 #define GL_GEOMETRY_PROGRAM_NV 0x8C26 #define GL_MAX_PROGRAM_OUTPUT_VERTICES_NV 0x8C27 #define GL_MAX_PROGRAM_TOTAL_OUTPUT_COMPONENTS_NV 0x8C28 typedef void (APIENTRYP PFNGLPROGRAMVERTEXLIMITNVPROC) (GLenum target, GLint limit); typedef void (APIENTRYP PFNGLFRAMEBUFFERTEXTUREEXTPROC) (GLenum target, GLenum attachment, GLuint texture, GLint level); typedef void (APIENTRYP PFNGLFRAMEBUFFERTEXTURELAYEREXTPROC) (GLenum target, GLenum attachment, GLuint texture, GLint level, GLint layer); typedef void (APIENTRYP PFNGLFRAMEBUFFERTEXTUREFACEEXTPROC) (GLenum target, GLenum attachment, GLuint texture, GLint level, GLenum face); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glProgramVertexLimitNV (GLenum target, GLint limit); GLAPI void APIENTRY glFramebufferTextureEXT (GLenum target, GLenum attachment, GLuint texture, GLint level); GLAPI void APIENTRY glFramebufferTextureLayerEXT (GLenum target, GLenum attachment, GLuint texture, GLint level, GLint layer); GLAPI void APIENTRY glFramebufferTextureFaceEXT (GLenum target, GLenum attachment, GLuint texture, GLint level, GLenum face); #endif #endif /* GL_NV_geometry_program4 */ #ifndef GL_NV_geometry_shader4 #define GL_NV_geometry_shader4 1 #endif /* GL_NV_geometry_shader4 */ #ifndef GL_NV_gpu_program4 #define GL_NV_gpu_program4 1 #define GL_MIN_PROGRAM_TEXEL_OFFSET_NV 0x8904 #define GL_MAX_PROGRAM_TEXEL_OFFSET_NV 0x8905 #define GL_PROGRAM_ATTRIB_COMPONENTS_NV 0x8906 #define GL_PROGRAM_RESULT_COMPONENTS_NV 0x8907 #define GL_MAX_PROGRAM_ATTRIB_COMPONENTS_NV 0x8908 #define GL_MAX_PROGRAM_RESULT_COMPONENTS_NV 0x8909 #define GL_MAX_PROGRAM_GENERIC_ATTRIBS_NV 0x8DA5 #define GL_MAX_PROGRAM_GENERIC_RESULTS_NV 0x8DA6 typedef void (APIENTRYP PFNGLPROGRAMLOCALPARAMETERI4INVPROC) (GLenum target, GLuint index, GLint x, GLint y, GLint z, GLint w); typedef void (APIENTRYP PFNGLPROGRAMLOCALPARAMETERI4IVNVPROC) (GLenum target, GLuint index, const GLint *params); typedef void (APIENTRYP PFNGLPROGRAMLOCALPARAMETERSI4IVNVPROC) (GLenum target, GLuint index, GLsizei count, const GLint *params); typedef void (APIENTRYP PFNGLPROGRAMLOCALPARAMETERI4UINVPROC) (GLenum target, GLuint index, GLuint x, GLuint y, GLuint z, GLuint w); typedef void (APIENTRYP PFNGLPROGRAMLOCALPARAMETERI4UIVNVPROC) (GLenum target, GLuint index, const GLuint *params); typedef void (APIENTRYP PFNGLPROGRAMLOCALPARAMETERSI4UIVNVPROC) (GLenum target, GLuint index, GLsizei count, const GLuint *params); typedef void (APIENTRYP PFNGLPROGRAMENVPARAMETERI4INVPROC) (GLenum target, GLuint index, GLint x, GLint y, GLint z, GLint w); typedef void (APIENTRYP PFNGLPROGRAMENVPARAMETERI4IVNVPROC) (GLenum target, GLuint index, const GLint *params); typedef void (APIENTRYP PFNGLPROGRAMENVPARAMETERSI4IVNVPROC) (GLenum target, GLuint index, GLsizei count, const GLint *params); typedef void (APIENTRYP PFNGLPROGRAMENVPARAMETERI4UINVPROC) (GLenum target, GLuint index, GLuint x, GLuint y, GLuint z, GLuint w); typedef void (APIENTRYP PFNGLPROGRAMENVPARAMETERI4UIVNVPROC) (GLenum target, GLuint index, const GLuint *params); typedef void (APIENTRYP PFNGLPROGRAMENVPARAMETERSI4UIVNVPROC) (GLenum target, GLuint index, GLsizei count, const GLuint *params); typedef void (APIENTRYP PFNGLGETPROGRAMLOCALPARAMETERIIVNVPROC) (GLenum target, GLuint index, GLint *params); typedef void (APIENTRYP PFNGLGETPROGRAMLOCALPARAMETERIUIVNVPROC) (GLenum target, GLuint index, GLuint *params); typedef void (APIENTRYP PFNGLGETPROGRAMENVPARAMETERIIVNVPROC) (GLenum target, GLuint index, GLint *params); typedef void (APIENTRYP PFNGLGETPROGRAMENVPARAMETERIUIVNVPROC) (GLenum target, GLuint index, GLuint *params); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glProgramLocalParameterI4iNV (GLenum target, GLuint index, GLint x, GLint y, GLint z, GLint w); GLAPI void APIENTRY glProgramLocalParameterI4ivNV (GLenum target, GLuint index, const GLint *params); GLAPI void APIENTRY glProgramLocalParametersI4ivNV (GLenum target, GLuint index, GLsizei count, const GLint *params); GLAPI void APIENTRY glProgramLocalParameterI4uiNV (GLenum target, GLuint index, GLuint x, GLuint y, GLuint z, GLuint w); GLAPI void APIENTRY glProgramLocalParameterI4uivNV (GLenum target, GLuint index, const GLuint *params); GLAPI void APIENTRY glProgramLocalParametersI4uivNV (GLenum target, GLuint index, GLsizei count, const GLuint *params); GLAPI void APIENTRY glProgramEnvParameterI4iNV (GLenum target, GLuint index, GLint x, GLint y, GLint z, GLint w); GLAPI void APIENTRY glProgramEnvParameterI4ivNV (GLenum target, GLuint index, const GLint *params); GLAPI void APIENTRY glProgramEnvParametersI4ivNV (GLenum target, GLuint index, GLsizei count, const GLint *params); GLAPI void APIENTRY glProgramEnvParameterI4uiNV (GLenum target, GLuint index, GLuint x, GLuint y, GLuint z, GLuint w); GLAPI void APIENTRY glProgramEnvParameterI4uivNV (GLenum target, GLuint index, const GLuint *params); GLAPI void APIENTRY glProgramEnvParametersI4uivNV (GLenum target, GLuint index, GLsizei count, const GLuint *params); GLAPI void APIENTRY glGetProgramLocalParameterIivNV (GLenum target, GLuint index, GLint *params); GLAPI void APIENTRY glGetProgramLocalParameterIuivNV (GLenum target, GLuint index, GLuint *params); GLAPI void APIENTRY glGetProgramEnvParameterIivNV (GLenum target, GLuint index, GLint *params); GLAPI void APIENTRY glGetProgramEnvParameterIuivNV (GLenum target, GLuint index, GLuint *params); #endif #endif /* GL_NV_gpu_program4 */ #ifndef GL_NV_gpu_program5 #define GL_NV_gpu_program5 1 #define GL_MAX_GEOMETRY_PROGRAM_INVOCATIONS_NV 0x8E5A #define GL_MIN_FRAGMENT_INTERPOLATION_OFFSET_NV 0x8E5B #define GL_MAX_FRAGMENT_INTERPOLATION_OFFSET_NV 0x8E5C #define GL_FRAGMENT_PROGRAM_INTERPOLATION_OFFSET_BITS_NV 0x8E5D #define GL_MIN_PROGRAM_TEXTURE_GATHER_OFFSET_NV 0x8E5E #define GL_MAX_PROGRAM_TEXTURE_GATHER_OFFSET_NV 0x8E5F #define GL_MAX_PROGRAM_SUBROUTINE_PARAMETERS_NV 0x8F44 #define GL_MAX_PROGRAM_SUBROUTINE_NUM_NV 0x8F45 typedef void (APIENTRYP PFNGLPROGRAMSUBROUTINEPARAMETERSUIVNVPROC) (GLenum target, GLsizei count, const GLuint *params); typedef void (APIENTRYP PFNGLGETPROGRAMSUBROUTINEPARAMETERUIVNVPROC) (GLenum target, GLuint index, GLuint *param); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glProgramSubroutineParametersuivNV (GLenum target, GLsizei count, const GLuint *params); GLAPI void APIENTRY glGetProgramSubroutineParameteruivNV (GLenum target, GLuint index, GLuint *param); #endif #endif /* GL_NV_gpu_program5 */ #ifndef GL_NV_gpu_program5_mem_extended #define GL_NV_gpu_program5_mem_extended 1 #endif /* GL_NV_gpu_program5_mem_extended */ #ifndef GL_NV_gpu_shader5 #define GL_NV_gpu_shader5 1 typedef int64_t GLint64EXT; #define GL_INT64_NV 0x140E #define GL_UNSIGNED_INT64_NV 0x140F #define GL_INT8_NV 0x8FE0 #define GL_INT8_VEC2_NV 0x8FE1 #define GL_INT8_VEC3_NV 0x8FE2 #define GL_INT8_VEC4_NV 0x8FE3 #define GL_INT16_NV 0x8FE4 #define GL_INT16_VEC2_NV 0x8FE5 #define GL_INT16_VEC3_NV 0x8FE6 #define GL_INT16_VEC4_NV 0x8FE7 #define GL_INT64_VEC2_NV 0x8FE9 #define GL_INT64_VEC3_NV 0x8FEA #define GL_INT64_VEC4_NV 0x8FEB #define GL_UNSIGNED_INT8_NV 0x8FEC #define GL_UNSIGNED_INT8_VEC2_NV 0x8FED #define GL_UNSIGNED_INT8_VEC3_NV 0x8FEE #define GL_UNSIGNED_INT8_VEC4_NV 0x8FEF #define GL_UNSIGNED_INT16_NV 0x8FF0 #define GL_UNSIGNED_INT16_VEC2_NV 0x8FF1 #define GL_UNSIGNED_INT16_VEC3_NV 0x8FF2 #define GL_UNSIGNED_INT16_VEC4_NV 0x8FF3 #define GL_UNSIGNED_INT64_VEC2_NV 0x8FF5 #define GL_UNSIGNED_INT64_VEC3_NV 0x8FF6 #define GL_UNSIGNED_INT64_VEC4_NV 0x8FF7 #define GL_FLOAT16_NV 0x8FF8 #define GL_FLOAT16_VEC2_NV 0x8FF9 #define GL_FLOAT16_VEC3_NV 0x8FFA #define GL_FLOAT16_VEC4_NV 0x8FFB typedef void (APIENTRYP PFNGLUNIFORM1I64NVPROC) (GLint location, GLint64EXT x); typedef void (APIENTRYP PFNGLUNIFORM2I64NVPROC) (GLint location, GLint64EXT x, GLint64EXT y); typedef void (APIENTRYP PFNGLUNIFORM3I64NVPROC) (GLint location, GLint64EXT x, GLint64EXT y, GLint64EXT z); typedef void (APIENTRYP PFNGLUNIFORM4I64NVPROC) (GLint location, GLint64EXT x, GLint64EXT y, GLint64EXT z, GLint64EXT w); typedef void (APIENTRYP PFNGLUNIFORM1I64VNVPROC) (GLint location, GLsizei count, const GLint64EXT *value); typedef void (APIENTRYP PFNGLUNIFORM2I64VNVPROC) (GLint location, GLsizei count, const GLint64EXT *value); typedef void (APIENTRYP PFNGLUNIFORM3I64VNVPROC) (GLint location, GLsizei count, const GLint64EXT *value); typedef void (APIENTRYP PFNGLUNIFORM4I64VNVPROC) (GLint location, GLsizei count, const GLint64EXT *value); typedef void (APIENTRYP PFNGLUNIFORM1UI64NVPROC) (GLint location, GLuint64EXT x); typedef void (APIENTRYP PFNGLUNIFORM2UI64NVPROC) (GLint location, GLuint64EXT x, GLuint64EXT y); typedef void (APIENTRYP PFNGLUNIFORM3UI64NVPROC) (GLint location, GLuint64EXT x, GLuint64EXT y, GLuint64EXT z); typedef void (APIENTRYP PFNGLUNIFORM4UI64NVPROC) (GLint location, GLuint64EXT x, GLuint64EXT y, GLuint64EXT z, GLuint64EXT w); typedef void (APIENTRYP PFNGLUNIFORM1UI64VNVPROC) (GLint location, GLsizei count, const GLuint64EXT *value); typedef void (APIENTRYP PFNGLUNIFORM2UI64VNVPROC) (GLint location, GLsizei count, const GLuint64EXT *value); typedef void (APIENTRYP PFNGLUNIFORM3UI64VNVPROC) (GLint location, GLsizei count, const GLuint64EXT *value); typedef void (APIENTRYP PFNGLUNIFORM4UI64VNVPROC) (GLint location, GLsizei count, const GLuint64EXT *value); typedef void (APIENTRYP PFNGLGETUNIFORMI64VNVPROC) (GLuint program, GLint location, GLint64EXT *params); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM1I64NVPROC) (GLuint program, GLint location, GLint64EXT x); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM2I64NVPROC) (GLuint program, GLint location, GLint64EXT x, GLint64EXT y); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM3I64NVPROC) (GLuint program, GLint location, GLint64EXT x, GLint64EXT y, GLint64EXT z); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM4I64NVPROC) (GLuint program, GLint location, GLint64EXT x, GLint64EXT y, GLint64EXT z, GLint64EXT w); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM1I64VNVPROC) (GLuint program, GLint location, GLsizei count, const GLint64EXT *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM2I64VNVPROC) (GLuint program, GLint location, GLsizei count, const GLint64EXT *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM3I64VNVPROC) (GLuint program, GLint location, GLsizei count, const GLint64EXT *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM4I64VNVPROC) (GLuint program, GLint location, GLsizei count, const GLint64EXT *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM1UI64NVPROC) (GLuint program, GLint location, GLuint64EXT x); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM2UI64NVPROC) (GLuint program, GLint location, GLuint64EXT x, GLuint64EXT y); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM3UI64NVPROC) (GLuint program, GLint location, GLuint64EXT x, GLuint64EXT y, GLuint64EXT z); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM4UI64NVPROC) (GLuint program, GLint location, GLuint64EXT x, GLuint64EXT y, GLuint64EXT z, GLuint64EXT w); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM1UI64VNVPROC) (GLuint program, GLint location, GLsizei count, const GLuint64EXT *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM2UI64VNVPROC) (GLuint program, GLint location, GLsizei count, const GLuint64EXT *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM3UI64VNVPROC) (GLuint program, GLint location, GLsizei count, const GLuint64EXT *value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORM4UI64VNVPROC) (GLuint program, GLint location, GLsizei count, const GLuint64EXT *value); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glUniform1i64NV (GLint location, GLint64EXT x); GLAPI void APIENTRY glUniform2i64NV (GLint location, GLint64EXT x, GLint64EXT y); GLAPI void APIENTRY glUniform3i64NV (GLint location, GLint64EXT x, GLint64EXT y, GLint64EXT z); GLAPI void APIENTRY glUniform4i64NV (GLint location, GLint64EXT x, GLint64EXT y, GLint64EXT z, GLint64EXT w); GLAPI void APIENTRY glUniform1i64vNV (GLint location, GLsizei count, const GLint64EXT *value); GLAPI void APIENTRY glUniform2i64vNV (GLint location, GLsizei count, const GLint64EXT *value); GLAPI void APIENTRY glUniform3i64vNV (GLint location, GLsizei count, const GLint64EXT *value); GLAPI void APIENTRY glUniform4i64vNV (GLint location, GLsizei count, const GLint64EXT *value); GLAPI void APIENTRY glUniform1ui64NV (GLint location, GLuint64EXT x); GLAPI void APIENTRY glUniform2ui64NV (GLint location, GLuint64EXT x, GLuint64EXT y); GLAPI void APIENTRY glUniform3ui64NV (GLint location, GLuint64EXT x, GLuint64EXT y, GLuint64EXT z); GLAPI void APIENTRY glUniform4ui64NV (GLint location, GLuint64EXT x, GLuint64EXT y, GLuint64EXT z, GLuint64EXT w); GLAPI void APIENTRY glUniform1ui64vNV (GLint location, GLsizei count, const GLuint64EXT *value); GLAPI void APIENTRY glUniform2ui64vNV (GLint location, GLsizei count, const GLuint64EXT *value); GLAPI void APIENTRY glUniform3ui64vNV (GLint location, GLsizei count, const GLuint64EXT *value); GLAPI void APIENTRY glUniform4ui64vNV (GLint location, GLsizei count, const GLuint64EXT *value); GLAPI void APIENTRY glGetUniformi64vNV (GLuint program, GLint location, GLint64EXT *params); GLAPI void APIENTRY glProgramUniform1i64NV (GLuint program, GLint location, GLint64EXT x); GLAPI void APIENTRY glProgramUniform2i64NV (GLuint program, GLint location, GLint64EXT x, GLint64EXT y); GLAPI void APIENTRY glProgramUniform3i64NV (GLuint program, GLint location, GLint64EXT x, GLint64EXT y, GLint64EXT z); GLAPI void APIENTRY glProgramUniform4i64NV (GLuint program, GLint location, GLint64EXT x, GLint64EXT y, GLint64EXT z, GLint64EXT w); GLAPI void APIENTRY glProgramUniform1i64vNV (GLuint program, GLint location, GLsizei count, const GLint64EXT *value); GLAPI void APIENTRY glProgramUniform2i64vNV (GLuint program, GLint location, GLsizei count, const GLint64EXT *value); GLAPI void APIENTRY glProgramUniform3i64vNV (GLuint program, GLint location, GLsizei count, const GLint64EXT *value); GLAPI void APIENTRY glProgramUniform4i64vNV (GLuint program, GLint location, GLsizei count, const GLint64EXT *value); GLAPI void APIENTRY glProgramUniform1ui64NV (GLuint program, GLint location, GLuint64EXT x); GLAPI void APIENTRY glProgramUniform2ui64NV (GLuint program, GLint location, GLuint64EXT x, GLuint64EXT y); GLAPI void APIENTRY glProgramUniform3ui64NV (GLuint program, GLint location, GLuint64EXT x, GLuint64EXT y, GLuint64EXT z); GLAPI void APIENTRY glProgramUniform4ui64NV (GLuint program, GLint location, GLuint64EXT x, GLuint64EXT y, GLuint64EXT z, GLuint64EXT w); GLAPI void APIENTRY glProgramUniform1ui64vNV (GLuint program, GLint location, GLsizei count, const GLuint64EXT *value); GLAPI void APIENTRY glProgramUniform2ui64vNV (GLuint program, GLint location, GLsizei count, const GLuint64EXT *value); GLAPI void APIENTRY glProgramUniform3ui64vNV (GLuint program, GLint location, GLsizei count, const GLuint64EXT *value); GLAPI void APIENTRY glProgramUniform4ui64vNV (GLuint program, GLint location, GLsizei count, const GLuint64EXT *value); #endif #endif /* GL_NV_gpu_shader5 */ #ifndef GL_NV_half_float #define GL_NV_half_float 1 typedef unsigned short GLhalfNV; #define GL_HALF_FLOAT_NV 0x140B typedef void (APIENTRYP PFNGLVERTEX2HNVPROC) (GLhalfNV x, GLhalfNV y); typedef void (APIENTRYP PFNGLVERTEX2HVNVPROC) (const GLhalfNV *v); typedef void (APIENTRYP PFNGLVERTEX3HNVPROC) (GLhalfNV x, GLhalfNV y, GLhalfNV z); typedef void (APIENTRYP PFNGLVERTEX3HVNVPROC) (const GLhalfNV *v); typedef void (APIENTRYP PFNGLVERTEX4HNVPROC) (GLhalfNV x, GLhalfNV y, GLhalfNV z, GLhalfNV w); typedef void (APIENTRYP PFNGLVERTEX4HVNVPROC) (const GLhalfNV *v); typedef void (APIENTRYP PFNGLNORMAL3HNVPROC) (GLhalfNV nx, GLhalfNV ny, GLhalfNV nz); typedef void (APIENTRYP PFNGLNORMAL3HVNVPROC) (const GLhalfNV *v); typedef void (APIENTRYP PFNGLCOLOR3HNVPROC) (GLhalfNV red, GLhalfNV green, GLhalfNV blue); typedef void (APIENTRYP PFNGLCOLOR3HVNVPROC) (const GLhalfNV *v); typedef void (APIENTRYP PFNGLCOLOR4HNVPROC) (GLhalfNV red, GLhalfNV green, GLhalfNV blue, GLhalfNV alpha); typedef void (APIENTRYP PFNGLCOLOR4HVNVPROC) (const GLhalfNV *v); typedef void (APIENTRYP PFNGLTEXCOORD1HNVPROC) (GLhalfNV s); typedef void (APIENTRYP PFNGLTEXCOORD1HVNVPROC) (const GLhalfNV *v); typedef void (APIENTRYP PFNGLTEXCOORD2HNVPROC) (GLhalfNV s, GLhalfNV t); typedef void (APIENTRYP PFNGLTEXCOORD2HVNVPROC) (const GLhalfNV *v); typedef void (APIENTRYP PFNGLTEXCOORD3HNVPROC) (GLhalfNV s, GLhalfNV t, GLhalfNV r); typedef void (APIENTRYP PFNGLTEXCOORD3HVNVPROC) (const GLhalfNV *v); typedef void (APIENTRYP PFNGLTEXCOORD4HNVPROC) (GLhalfNV s, GLhalfNV t, GLhalfNV r, GLhalfNV q); typedef void (APIENTRYP PFNGLTEXCOORD4HVNVPROC) (const GLhalfNV *v); typedef void (APIENTRYP PFNGLMULTITEXCOORD1HNVPROC) (GLenum target, GLhalfNV s); typedef void (APIENTRYP PFNGLMULTITEXCOORD1HVNVPROC) (GLenum target, const GLhalfNV *v); typedef void (APIENTRYP PFNGLMULTITEXCOORD2HNVPROC) (GLenum target, GLhalfNV s, GLhalfNV t); typedef void (APIENTRYP PFNGLMULTITEXCOORD2HVNVPROC) (GLenum target, const GLhalfNV *v); typedef void (APIENTRYP PFNGLMULTITEXCOORD3HNVPROC) (GLenum target, GLhalfNV s, GLhalfNV t, GLhalfNV r); typedef void (APIENTRYP PFNGLMULTITEXCOORD3HVNVPROC) (GLenum target, const GLhalfNV *v); typedef void (APIENTRYP PFNGLMULTITEXCOORD4HNVPROC) (GLenum target, GLhalfNV s, GLhalfNV t, GLhalfNV r, GLhalfNV q); typedef void (APIENTRYP PFNGLMULTITEXCOORD4HVNVPROC) (GLenum target, const GLhalfNV *v); typedef void (APIENTRYP PFNGLFOGCOORDHNVPROC) (GLhalfNV fog); typedef void (APIENTRYP PFNGLFOGCOORDHVNVPROC) (const GLhalfNV *fog); typedef void (APIENTRYP PFNGLSECONDARYCOLOR3HNVPROC) (GLhalfNV red, GLhalfNV green, GLhalfNV blue); typedef void (APIENTRYP PFNGLSECONDARYCOLOR3HVNVPROC) (const GLhalfNV *v); typedef void (APIENTRYP PFNGLVERTEXWEIGHTHNVPROC) (GLhalfNV weight); typedef void (APIENTRYP PFNGLVERTEXWEIGHTHVNVPROC) (const GLhalfNV *weight); typedef void (APIENTRYP PFNGLVERTEXATTRIB1HNVPROC) (GLuint index, GLhalfNV x); typedef void (APIENTRYP PFNGLVERTEXATTRIB1HVNVPROC) (GLuint index, const GLhalfNV *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB2HNVPROC) (GLuint index, GLhalfNV x, GLhalfNV y); typedef void (APIENTRYP PFNGLVERTEXATTRIB2HVNVPROC) (GLuint index, const GLhalfNV *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB3HNVPROC) (GLuint index, GLhalfNV x, GLhalfNV y, GLhalfNV z); typedef void (APIENTRYP PFNGLVERTEXATTRIB3HVNVPROC) (GLuint index, const GLhalfNV *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB4HNVPROC) (GLuint index, GLhalfNV x, GLhalfNV y, GLhalfNV z, GLhalfNV w); typedef void (APIENTRYP PFNGLVERTEXATTRIB4HVNVPROC) (GLuint index, const GLhalfNV *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBS1HVNVPROC) (GLuint index, GLsizei n, const GLhalfNV *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBS2HVNVPROC) (GLuint index, GLsizei n, const GLhalfNV *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBS3HVNVPROC) (GLuint index, GLsizei n, const GLhalfNV *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBS4HVNVPROC) (GLuint index, GLsizei n, const GLhalfNV *v); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glVertex2hNV (GLhalfNV x, GLhalfNV y); GLAPI void APIENTRY glVertex2hvNV (const GLhalfNV *v); GLAPI void APIENTRY glVertex3hNV (GLhalfNV x, GLhalfNV y, GLhalfNV z); GLAPI void APIENTRY glVertex3hvNV (const GLhalfNV *v); GLAPI void APIENTRY glVertex4hNV (GLhalfNV x, GLhalfNV y, GLhalfNV z, GLhalfNV w); GLAPI void APIENTRY glVertex4hvNV (const GLhalfNV *v); GLAPI void APIENTRY glNormal3hNV (GLhalfNV nx, GLhalfNV ny, GLhalfNV nz); GLAPI void APIENTRY glNormal3hvNV (const GLhalfNV *v); GLAPI void APIENTRY glColor3hNV (GLhalfNV red, GLhalfNV green, GLhalfNV blue); GLAPI void APIENTRY glColor3hvNV (const GLhalfNV *v); GLAPI void APIENTRY glColor4hNV (GLhalfNV red, GLhalfNV green, GLhalfNV blue, GLhalfNV alpha); GLAPI void APIENTRY glColor4hvNV (const GLhalfNV *v); GLAPI void APIENTRY glTexCoord1hNV (GLhalfNV s); GLAPI void APIENTRY glTexCoord1hvNV (const GLhalfNV *v); GLAPI void APIENTRY glTexCoord2hNV (GLhalfNV s, GLhalfNV t); GLAPI void APIENTRY glTexCoord2hvNV (const GLhalfNV *v); GLAPI void APIENTRY glTexCoord3hNV (GLhalfNV s, GLhalfNV t, GLhalfNV r); GLAPI void APIENTRY glTexCoord3hvNV (const GLhalfNV *v); GLAPI void APIENTRY glTexCoord4hNV (GLhalfNV s, GLhalfNV t, GLhalfNV r, GLhalfNV q); GLAPI void APIENTRY glTexCoord4hvNV (const GLhalfNV *v); GLAPI void APIENTRY glMultiTexCoord1hNV (GLenum target, GLhalfNV s); GLAPI void APIENTRY glMultiTexCoord1hvNV (GLenum target, const GLhalfNV *v); GLAPI void APIENTRY glMultiTexCoord2hNV (GLenum target, GLhalfNV s, GLhalfNV t); GLAPI void APIENTRY glMultiTexCoord2hvNV (GLenum target, const GLhalfNV *v); GLAPI void APIENTRY glMultiTexCoord3hNV (GLenum target, GLhalfNV s, GLhalfNV t, GLhalfNV r); GLAPI void APIENTRY glMultiTexCoord3hvNV (GLenum target, const GLhalfNV *v); GLAPI void APIENTRY glMultiTexCoord4hNV (GLenum target, GLhalfNV s, GLhalfNV t, GLhalfNV r, GLhalfNV q); GLAPI void APIENTRY glMultiTexCoord4hvNV (GLenum target, const GLhalfNV *v); GLAPI void APIENTRY glFogCoordhNV (GLhalfNV fog); GLAPI void APIENTRY glFogCoordhvNV (const GLhalfNV *fog); GLAPI void APIENTRY glSecondaryColor3hNV (GLhalfNV red, GLhalfNV green, GLhalfNV blue); GLAPI void APIENTRY glSecondaryColor3hvNV (const GLhalfNV *v); GLAPI void APIENTRY glVertexWeighthNV (GLhalfNV weight); GLAPI void APIENTRY glVertexWeighthvNV (const GLhalfNV *weight); GLAPI void APIENTRY glVertexAttrib1hNV (GLuint index, GLhalfNV x); GLAPI void APIENTRY glVertexAttrib1hvNV (GLuint index, const GLhalfNV *v); GLAPI void APIENTRY glVertexAttrib2hNV (GLuint index, GLhalfNV x, GLhalfNV y); GLAPI void APIENTRY glVertexAttrib2hvNV (GLuint index, const GLhalfNV *v); GLAPI void APIENTRY glVertexAttrib3hNV (GLuint index, GLhalfNV x, GLhalfNV y, GLhalfNV z); GLAPI void APIENTRY glVertexAttrib3hvNV (GLuint index, const GLhalfNV *v); GLAPI void APIENTRY glVertexAttrib4hNV (GLuint index, GLhalfNV x, GLhalfNV y, GLhalfNV z, GLhalfNV w); GLAPI void APIENTRY glVertexAttrib4hvNV (GLuint index, const GLhalfNV *v); GLAPI void APIENTRY glVertexAttribs1hvNV (GLuint index, GLsizei n, const GLhalfNV *v); GLAPI void APIENTRY glVertexAttribs2hvNV (GLuint index, GLsizei n, const GLhalfNV *v); GLAPI void APIENTRY glVertexAttribs3hvNV (GLuint index, GLsizei n, const GLhalfNV *v); GLAPI void APIENTRY glVertexAttribs4hvNV (GLuint index, GLsizei n, const GLhalfNV *v); #endif #endif /* GL_NV_half_float */ #ifndef GL_NV_light_max_exponent #define GL_NV_light_max_exponent 1 #define GL_MAX_SHININESS_NV 0x8504 #define GL_MAX_SPOT_EXPONENT_NV 0x8505 #endif /* GL_NV_light_max_exponent */ #ifndef GL_NV_multisample_coverage #define GL_NV_multisample_coverage 1 #define GL_COLOR_SAMPLES_NV 0x8E20 #endif /* GL_NV_multisample_coverage */ #ifndef GL_NV_multisample_filter_hint #define GL_NV_multisample_filter_hint 1 #define GL_MULTISAMPLE_FILTER_HINT_NV 0x8534 #endif /* GL_NV_multisample_filter_hint */ #ifndef GL_NV_occlusion_query #define GL_NV_occlusion_query 1 #define GL_PIXEL_COUNTER_BITS_NV 0x8864 #define GL_CURRENT_OCCLUSION_QUERY_ID_NV 0x8865 #define GL_PIXEL_COUNT_NV 0x8866 #define GL_PIXEL_COUNT_AVAILABLE_NV 0x8867 typedef void (APIENTRYP PFNGLGENOCCLUSIONQUERIESNVPROC) (GLsizei n, GLuint *ids); typedef void (APIENTRYP PFNGLDELETEOCCLUSIONQUERIESNVPROC) (GLsizei n, const GLuint *ids); typedef GLboolean (APIENTRYP PFNGLISOCCLUSIONQUERYNVPROC) (GLuint id); typedef void (APIENTRYP PFNGLBEGINOCCLUSIONQUERYNVPROC) (GLuint id); typedef void (APIENTRYP PFNGLENDOCCLUSIONQUERYNVPROC) (void); typedef void (APIENTRYP PFNGLGETOCCLUSIONQUERYIVNVPROC) (GLuint id, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGETOCCLUSIONQUERYUIVNVPROC) (GLuint id, GLenum pname, GLuint *params); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glGenOcclusionQueriesNV (GLsizei n, GLuint *ids); GLAPI void APIENTRY glDeleteOcclusionQueriesNV (GLsizei n, const GLuint *ids); GLAPI GLboolean APIENTRY glIsOcclusionQueryNV (GLuint id); GLAPI void APIENTRY glBeginOcclusionQueryNV (GLuint id); GLAPI void APIENTRY glEndOcclusionQueryNV (void); GLAPI void APIENTRY glGetOcclusionQueryivNV (GLuint id, GLenum pname, GLint *params); GLAPI void APIENTRY glGetOcclusionQueryuivNV (GLuint id, GLenum pname, GLuint *params); #endif #endif /* GL_NV_occlusion_query */ #ifndef GL_NV_packed_depth_stencil #define GL_NV_packed_depth_stencil 1 #define GL_DEPTH_STENCIL_NV 0x84F9 #define GL_UNSIGNED_INT_24_8_NV 0x84FA #endif /* GL_NV_packed_depth_stencil */ #ifndef GL_NV_parameter_buffer_object #define GL_NV_parameter_buffer_object 1 #define GL_MAX_PROGRAM_PARAMETER_BUFFER_BINDINGS_NV 0x8DA0 #define GL_MAX_PROGRAM_PARAMETER_BUFFER_SIZE_NV 0x8DA1 #define GL_VERTEX_PROGRAM_PARAMETER_BUFFER_NV 0x8DA2 #define GL_GEOMETRY_PROGRAM_PARAMETER_BUFFER_NV 0x8DA3 #define GL_FRAGMENT_PROGRAM_PARAMETER_BUFFER_NV 0x8DA4 typedef void (APIENTRYP PFNGLPROGRAMBUFFERPARAMETERSFVNVPROC) (GLenum target, GLuint bindingIndex, GLuint wordIndex, GLsizei count, const GLfloat *params); typedef void (APIENTRYP PFNGLPROGRAMBUFFERPARAMETERSIIVNVPROC) (GLenum target, GLuint bindingIndex, GLuint wordIndex, GLsizei count, const GLint *params); typedef void (APIENTRYP PFNGLPROGRAMBUFFERPARAMETERSIUIVNVPROC) (GLenum target, GLuint bindingIndex, GLuint wordIndex, GLsizei count, const GLuint *params); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glProgramBufferParametersfvNV (GLenum target, GLuint bindingIndex, GLuint wordIndex, GLsizei count, const GLfloat *params); GLAPI void APIENTRY glProgramBufferParametersIivNV (GLenum target, GLuint bindingIndex, GLuint wordIndex, GLsizei count, const GLint *params); GLAPI void APIENTRY glProgramBufferParametersIuivNV (GLenum target, GLuint bindingIndex, GLuint wordIndex, GLsizei count, const GLuint *params); #endif #endif /* GL_NV_parameter_buffer_object */ #ifndef GL_NV_parameter_buffer_object2 #define GL_NV_parameter_buffer_object2 1 #endif /* GL_NV_parameter_buffer_object2 */ #ifndef GL_NV_path_rendering #define GL_NV_path_rendering 1 #define GL_PATH_FORMAT_SVG_NV 0x9070 #define GL_PATH_FORMAT_PS_NV 0x9071 #define GL_STANDARD_FONT_NAME_NV 0x9072 #define GL_SYSTEM_FONT_NAME_NV 0x9073 #define GL_FILE_NAME_NV 0x9074 #define GL_PATH_STROKE_WIDTH_NV 0x9075 #define GL_PATH_END_CAPS_NV 0x9076 #define GL_PATH_INITIAL_END_CAP_NV 0x9077 #define GL_PATH_TERMINAL_END_CAP_NV 0x9078 #define GL_PATH_JOIN_STYLE_NV 0x9079 #define GL_PATH_MITER_LIMIT_NV 0x907A #define GL_PATH_DASH_CAPS_NV 0x907B #define GL_PATH_INITIAL_DASH_CAP_NV 0x907C #define GL_PATH_TERMINAL_DASH_CAP_NV 0x907D #define GL_PATH_DASH_OFFSET_NV 0x907E #define GL_PATH_CLIENT_LENGTH_NV 0x907F #define GL_PATH_FILL_MODE_NV 0x9080 #define GL_PATH_FILL_MASK_NV 0x9081 #define GL_PATH_FILL_COVER_MODE_NV 0x9082 #define GL_PATH_STROKE_COVER_MODE_NV 0x9083 #define GL_PATH_STROKE_MASK_NV 0x9084 #define GL_COUNT_UP_NV 0x9088 #define GL_COUNT_DOWN_NV 0x9089 #define GL_PATH_OBJECT_BOUNDING_BOX_NV 0x908A #define GL_CONVEX_HULL_NV 0x908B #define GL_BOUNDING_BOX_NV 0x908D #define GL_TRANSLATE_X_NV 0x908E #define GL_TRANSLATE_Y_NV 0x908F #define GL_TRANSLATE_2D_NV 0x9090 #define GL_TRANSLATE_3D_NV 0x9091 #define GL_AFFINE_2D_NV 0x9092 #define GL_AFFINE_3D_NV 0x9094 #define GL_TRANSPOSE_AFFINE_2D_NV 0x9096 #define GL_TRANSPOSE_AFFINE_3D_NV 0x9098 #define GL_UTF8_NV 0x909A #define GL_UTF16_NV 0x909B #define GL_BOUNDING_BOX_OF_BOUNDING_BOXES_NV 0x909C #define GL_PATH_COMMAND_COUNT_NV 0x909D #define GL_PATH_COORD_COUNT_NV 0x909E #define GL_PATH_DASH_ARRAY_COUNT_NV 0x909F #define GL_PATH_COMPUTED_LENGTH_NV 0x90A0 #define GL_PATH_FILL_BOUNDING_BOX_NV 0x90A1 #define GL_PATH_STROKE_BOUNDING_BOX_NV 0x90A2 #define GL_SQUARE_NV 0x90A3 #define GL_ROUND_NV 0x90A4 #define GL_TRIANGULAR_NV 0x90A5 #define GL_BEVEL_NV 0x90A6 #define GL_MITER_REVERT_NV 0x90A7 #define GL_MITER_TRUNCATE_NV 0x90A8 #define GL_SKIP_MISSING_GLYPH_NV 0x90A9 #define GL_USE_MISSING_GLYPH_NV 0x90AA #define GL_PATH_ERROR_POSITION_NV 0x90AB #define GL_PATH_FOG_GEN_MODE_NV 0x90AC #define GL_ACCUM_ADJACENT_PAIRS_NV 0x90AD #define GL_ADJACENT_PAIRS_NV 0x90AE #define GL_FIRST_TO_REST_NV 0x90AF #define GL_PATH_GEN_MODE_NV 0x90B0 #define GL_PATH_GEN_COEFF_NV 0x90B1 #define GL_PATH_GEN_COLOR_FORMAT_NV 0x90B2 #define GL_PATH_GEN_COMPONENTS_NV 0x90B3 #define GL_PATH_STENCIL_FUNC_NV 0x90B7 #define GL_PATH_STENCIL_REF_NV 0x90B8 #define GL_PATH_STENCIL_VALUE_MASK_NV 0x90B9 #define GL_PATH_STENCIL_DEPTH_OFFSET_FACTOR_NV 0x90BD #define GL_PATH_STENCIL_DEPTH_OFFSET_UNITS_NV 0x90BE #define GL_PATH_COVER_DEPTH_FUNC_NV 0x90BF #define GL_PATH_DASH_OFFSET_RESET_NV 0x90B4 #define GL_MOVE_TO_RESETS_NV 0x90B5 #define GL_MOVE_TO_CONTINUES_NV 0x90B6 #define GL_CLOSE_PATH_NV 0x00 #define GL_MOVE_TO_NV 0x02 #define GL_RELATIVE_MOVE_TO_NV 0x03 #define GL_LINE_TO_NV 0x04 #define GL_RELATIVE_LINE_TO_NV 0x05 #define GL_HORIZONTAL_LINE_TO_NV 0x06 #define GL_RELATIVE_HORIZONTAL_LINE_TO_NV 0x07 #define GL_VERTICAL_LINE_TO_NV 0x08 #define GL_RELATIVE_VERTICAL_LINE_TO_NV 0x09 #define GL_QUADRATIC_CURVE_TO_NV 0x0A #define GL_RELATIVE_QUADRATIC_CURVE_TO_NV 0x0B #define GL_CUBIC_CURVE_TO_NV 0x0C #define GL_RELATIVE_CUBIC_CURVE_TO_NV 0x0D #define GL_SMOOTH_QUADRATIC_CURVE_TO_NV 0x0E #define GL_RELATIVE_SMOOTH_QUADRATIC_CURVE_TO_NV 0x0F #define GL_SMOOTH_CUBIC_CURVE_TO_NV 0x10 #define GL_RELATIVE_SMOOTH_CUBIC_CURVE_TO_NV 0x11 #define GL_SMALL_CCW_ARC_TO_NV 0x12 #define GL_RELATIVE_SMALL_CCW_ARC_TO_NV 0x13 #define GL_SMALL_CW_ARC_TO_NV 0x14 #define GL_RELATIVE_SMALL_CW_ARC_TO_NV 0x15 #define GL_LARGE_CCW_ARC_TO_NV 0x16 #define GL_RELATIVE_LARGE_CCW_ARC_TO_NV 0x17 #define GL_LARGE_CW_ARC_TO_NV 0x18 #define GL_RELATIVE_LARGE_CW_ARC_TO_NV 0x19 #define GL_RESTART_PATH_NV 0xF0 #define GL_DUP_FIRST_CUBIC_CURVE_TO_NV 0xF2 #define GL_DUP_LAST_CUBIC_CURVE_TO_NV 0xF4 #define GL_RECT_NV 0xF6 #define GL_CIRCULAR_CCW_ARC_TO_NV 0xF8 #define GL_CIRCULAR_CW_ARC_TO_NV 0xFA #define GL_CIRCULAR_TANGENT_ARC_TO_NV 0xFC #define GL_ARC_TO_NV 0xFE #define GL_RELATIVE_ARC_TO_NV 0xFF #define GL_BOLD_BIT_NV 0x01 #define GL_ITALIC_BIT_NV 0x02 #define GL_GLYPH_WIDTH_BIT_NV 0x01 #define GL_GLYPH_HEIGHT_BIT_NV 0x02 #define GL_GLYPH_HORIZONTAL_BEARING_X_BIT_NV 0x04 #define GL_GLYPH_HORIZONTAL_BEARING_Y_BIT_NV 0x08 #define GL_GLYPH_HORIZONTAL_BEARING_ADVANCE_BIT_NV 0x10 #define GL_GLYPH_VERTICAL_BEARING_X_BIT_NV 0x20 #define GL_GLYPH_VERTICAL_BEARING_Y_BIT_NV 0x40 #define GL_GLYPH_VERTICAL_BEARING_ADVANCE_BIT_NV 0x80 #define GL_GLYPH_HAS_KERNING_BIT_NV 0x100 #define GL_FONT_X_MIN_BOUNDS_BIT_NV 0x00010000 #define GL_FONT_Y_MIN_BOUNDS_BIT_NV 0x00020000 #define GL_FONT_X_MAX_BOUNDS_BIT_NV 0x00040000 #define GL_FONT_Y_MAX_BOUNDS_BIT_NV 0x00080000 #define GL_FONT_UNITS_PER_EM_BIT_NV 0x00100000 #define GL_FONT_ASCENDER_BIT_NV 0x00200000 #define GL_FONT_DESCENDER_BIT_NV 0x00400000 #define GL_FONT_HEIGHT_BIT_NV 0x00800000 #define GL_FONT_MAX_ADVANCE_WIDTH_BIT_NV 0x01000000 #define GL_FONT_MAX_ADVANCE_HEIGHT_BIT_NV 0x02000000 #define GL_FONT_UNDERLINE_POSITION_BIT_NV 0x04000000 #define GL_FONT_UNDERLINE_THICKNESS_BIT_NV 0x08000000 #define GL_FONT_HAS_KERNING_BIT_NV 0x10000000 #define GL_PRIMARY_COLOR_NV 0x852C #define GL_SECONDARY_COLOR_NV 0x852D typedef GLuint (APIENTRYP PFNGLGENPATHSNVPROC) (GLsizei range); typedef void (APIENTRYP PFNGLDELETEPATHSNVPROC) (GLuint path, GLsizei range); typedef GLboolean (APIENTRYP PFNGLISPATHNVPROC) (GLuint path); typedef void (APIENTRYP PFNGLPATHCOMMANDSNVPROC) (GLuint path, GLsizei numCommands, const GLubyte *commands, GLsizei numCoords, GLenum coordType, const void *coords); typedef void (APIENTRYP PFNGLPATHCOORDSNVPROC) (GLuint path, GLsizei numCoords, GLenum coordType, const void *coords); typedef void (APIENTRYP PFNGLPATHSUBCOMMANDSNVPROC) (GLuint path, GLsizei commandStart, GLsizei commandsToDelete, GLsizei numCommands, const GLubyte *commands, GLsizei numCoords, GLenum coordType, const void *coords); typedef void (APIENTRYP PFNGLPATHSUBCOORDSNVPROC) (GLuint path, GLsizei coordStart, GLsizei numCoords, GLenum coordType, const void *coords); typedef void (APIENTRYP PFNGLPATHSTRINGNVPROC) (GLuint path, GLenum format, GLsizei length, const void *pathString); typedef void (APIENTRYP PFNGLPATHGLYPHSNVPROC) (GLuint firstPathName, GLenum fontTarget, const void *fontName, GLbitfield fontStyle, GLsizei numGlyphs, GLenum type, const void *charcodes, GLenum handleMissingGlyphs, GLuint pathParameterTemplate, GLfloat emScale); typedef void (APIENTRYP PFNGLPATHGLYPHRANGENVPROC) (GLuint firstPathName, GLenum fontTarget, const void *fontName, GLbitfield fontStyle, GLuint firstGlyph, GLsizei numGlyphs, GLenum handleMissingGlyphs, GLuint pathParameterTemplate, GLfloat emScale); typedef void (APIENTRYP PFNGLWEIGHTPATHSNVPROC) (GLuint resultPath, GLsizei numPaths, const GLuint *paths, const GLfloat *weights); typedef void (APIENTRYP PFNGLCOPYPATHNVPROC) (GLuint resultPath, GLuint srcPath); typedef void (APIENTRYP PFNGLINTERPOLATEPATHSNVPROC) (GLuint resultPath, GLuint pathA, GLuint pathB, GLfloat weight); typedef void (APIENTRYP PFNGLTRANSFORMPATHNVPROC) (GLuint resultPath, GLuint srcPath, GLenum transformType, const GLfloat *transformValues); typedef void (APIENTRYP PFNGLPATHPARAMETERIVNVPROC) (GLuint path, GLenum pname, const GLint *value); typedef void (APIENTRYP PFNGLPATHPARAMETERINVPROC) (GLuint path, GLenum pname, GLint value); typedef void (APIENTRYP PFNGLPATHPARAMETERFVNVPROC) (GLuint path, GLenum pname, const GLfloat *value); typedef void (APIENTRYP PFNGLPATHPARAMETERFNVPROC) (GLuint path, GLenum pname, GLfloat value); typedef void (APIENTRYP PFNGLPATHDASHARRAYNVPROC) (GLuint path, GLsizei dashCount, const GLfloat *dashArray); typedef void (APIENTRYP PFNGLPATHSTENCILFUNCNVPROC) (GLenum func, GLint ref, GLuint mask); typedef void (APIENTRYP PFNGLPATHSTENCILDEPTHOFFSETNVPROC) (GLfloat factor, GLfloat units); typedef void (APIENTRYP PFNGLSTENCILFILLPATHNVPROC) (GLuint path, GLenum fillMode, GLuint mask); typedef void (APIENTRYP PFNGLSTENCILSTROKEPATHNVPROC) (GLuint path, GLint reference, GLuint mask); typedef void (APIENTRYP PFNGLSTENCILFILLPATHINSTANCEDNVPROC) (GLsizei numPaths, GLenum pathNameType, const void *paths, GLuint pathBase, GLenum fillMode, GLuint mask, GLenum transformType, const GLfloat *transformValues); typedef void (APIENTRYP PFNGLSTENCILSTROKEPATHINSTANCEDNVPROC) (GLsizei numPaths, GLenum pathNameType, const void *paths, GLuint pathBase, GLint reference, GLuint mask, GLenum transformType, const GLfloat *transformValues); typedef void (APIENTRYP PFNGLPATHCOVERDEPTHFUNCNVPROC) (GLenum func); typedef void (APIENTRYP PFNGLPATHCOLORGENNVPROC) (GLenum color, GLenum genMode, GLenum colorFormat, const GLfloat *coeffs); typedef void (APIENTRYP PFNGLPATHTEXGENNVPROC) (GLenum texCoordSet, GLenum genMode, GLint components, const GLfloat *coeffs); typedef void (APIENTRYP PFNGLPATHFOGGENNVPROC) (GLenum genMode); typedef void (APIENTRYP PFNGLCOVERFILLPATHNVPROC) (GLuint path, GLenum coverMode); typedef void (APIENTRYP PFNGLCOVERSTROKEPATHNVPROC) (GLuint path, GLenum coverMode); typedef void (APIENTRYP PFNGLCOVERFILLPATHINSTANCEDNVPROC) (GLsizei numPaths, GLenum pathNameType, const void *paths, GLuint pathBase, GLenum coverMode, GLenum transformType, const GLfloat *transformValues); typedef void (APIENTRYP PFNGLCOVERSTROKEPATHINSTANCEDNVPROC) (GLsizei numPaths, GLenum pathNameType, const void *paths, GLuint pathBase, GLenum coverMode, GLenum transformType, const GLfloat *transformValues); typedef void (APIENTRYP PFNGLGETPATHPARAMETERIVNVPROC) (GLuint path, GLenum pname, GLint *value); typedef void (APIENTRYP PFNGLGETPATHPARAMETERFVNVPROC) (GLuint path, GLenum pname, GLfloat *value); typedef void (APIENTRYP PFNGLGETPATHCOMMANDSNVPROC) (GLuint path, GLubyte *commands); typedef void (APIENTRYP PFNGLGETPATHCOORDSNVPROC) (GLuint path, GLfloat *coords); typedef void (APIENTRYP PFNGLGETPATHDASHARRAYNVPROC) (GLuint path, GLfloat *dashArray); typedef void (APIENTRYP PFNGLGETPATHMETRICSNVPROC) (GLbitfield metricQueryMask, GLsizei numPaths, GLenum pathNameType, const void *paths, GLuint pathBase, GLsizei stride, GLfloat *metrics); typedef void (APIENTRYP PFNGLGETPATHMETRICRANGENVPROC) (GLbitfield metricQueryMask, GLuint firstPathName, GLsizei numPaths, GLsizei stride, GLfloat *metrics); typedef void (APIENTRYP PFNGLGETPATHSPACINGNVPROC) (GLenum pathListMode, GLsizei numPaths, GLenum pathNameType, const void *paths, GLuint pathBase, GLfloat advanceScale, GLfloat kerningScale, GLenum transformType, GLfloat *returnedSpacing); typedef void (APIENTRYP PFNGLGETPATHCOLORGENIVNVPROC) (GLenum color, GLenum pname, GLint *value); typedef void (APIENTRYP PFNGLGETPATHCOLORGENFVNVPROC) (GLenum color, GLenum pname, GLfloat *value); typedef void (APIENTRYP PFNGLGETPATHTEXGENIVNVPROC) (GLenum texCoordSet, GLenum pname, GLint *value); typedef void (APIENTRYP PFNGLGETPATHTEXGENFVNVPROC) (GLenum texCoordSet, GLenum pname, GLfloat *value); typedef GLboolean (APIENTRYP PFNGLISPOINTINFILLPATHNVPROC) (GLuint path, GLuint mask, GLfloat x, GLfloat y); typedef GLboolean (APIENTRYP PFNGLISPOINTINSTROKEPATHNVPROC) (GLuint path, GLfloat x, GLfloat y); typedef GLfloat (APIENTRYP PFNGLGETPATHLENGTHNVPROC) (GLuint path, GLsizei startSegment, GLsizei numSegments); typedef GLboolean (APIENTRYP PFNGLPOINTALONGPATHNVPROC) (GLuint path, GLsizei startSegment, GLsizei numSegments, GLfloat distance, GLfloat *x, GLfloat *y, GLfloat *tangentX, GLfloat *tangentY); #ifdef GL_GLEXT_PROTOTYPES GLAPI GLuint APIENTRY glGenPathsNV (GLsizei range); GLAPI void APIENTRY glDeletePathsNV (GLuint path, GLsizei range); GLAPI GLboolean APIENTRY glIsPathNV (GLuint path); GLAPI void APIENTRY glPathCommandsNV (GLuint path, GLsizei numCommands, const GLubyte *commands, GLsizei numCoords, GLenum coordType, const void *coords); GLAPI void APIENTRY glPathCoordsNV (GLuint path, GLsizei numCoords, GLenum coordType, const void *coords); GLAPI void APIENTRY glPathSubCommandsNV (GLuint path, GLsizei commandStart, GLsizei commandsToDelete, GLsizei numCommands, const GLubyte *commands, GLsizei numCoords, GLenum coordType, const void *coords); GLAPI void APIENTRY glPathSubCoordsNV (GLuint path, GLsizei coordStart, GLsizei numCoords, GLenum coordType, const void *coords); GLAPI void APIENTRY glPathStringNV (GLuint path, GLenum format, GLsizei length, const void *pathString); GLAPI void APIENTRY glPathGlyphsNV (GLuint firstPathName, GLenum fontTarget, const void *fontName, GLbitfield fontStyle, GLsizei numGlyphs, GLenum type, const void *charcodes, GLenum handleMissingGlyphs, GLuint pathParameterTemplate, GLfloat emScale); GLAPI void APIENTRY glPathGlyphRangeNV (GLuint firstPathName, GLenum fontTarget, const void *fontName, GLbitfield fontStyle, GLuint firstGlyph, GLsizei numGlyphs, GLenum handleMissingGlyphs, GLuint pathParameterTemplate, GLfloat emScale); GLAPI void APIENTRY glWeightPathsNV (GLuint resultPath, GLsizei numPaths, const GLuint *paths, const GLfloat *weights); GLAPI void APIENTRY glCopyPathNV (GLuint resultPath, GLuint srcPath); GLAPI void APIENTRY glInterpolatePathsNV (GLuint resultPath, GLuint pathA, GLuint pathB, GLfloat weight); GLAPI void APIENTRY glTransformPathNV (GLuint resultPath, GLuint srcPath, GLenum transformType, const GLfloat *transformValues); GLAPI void APIENTRY glPathParameterivNV (GLuint path, GLenum pname, const GLint *value); GLAPI void APIENTRY glPathParameteriNV (GLuint path, GLenum pname, GLint value); GLAPI void APIENTRY glPathParameterfvNV (GLuint path, GLenum pname, const GLfloat *value); GLAPI void APIENTRY glPathParameterfNV (GLuint path, GLenum pname, GLfloat value); GLAPI void APIENTRY glPathDashArrayNV (GLuint path, GLsizei dashCount, const GLfloat *dashArray); GLAPI void APIENTRY glPathStencilFuncNV (GLenum func, GLint ref, GLuint mask); GLAPI void APIENTRY glPathStencilDepthOffsetNV (GLfloat factor, GLfloat units); GLAPI void APIENTRY glStencilFillPathNV (GLuint path, GLenum fillMode, GLuint mask); GLAPI void APIENTRY glStencilStrokePathNV (GLuint path, GLint reference, GLuint mask); GLAPI void APIENTRY glStencilFillPathInstancedNV (GLsizei numPaths, GLenum pathNameType, const void *paths, GLuint pathBase, GLenum fillMode, GLuint mask, GLenum transformType, const GLfloat *transformValues); GLAPI void APIENTRY glStencilStrokePathInstancedNV (GLsizei numPaths, GLenum pathNameType, const void *paths, GLuint pathBase, GLint reference, GLuint mask, GLenum transformType, const GLfloat *transformValues); GLAPI void APIENTRY glPathCoverDepthFuncNV (GLenum func); GLAPI void APIENTRY glPathColorGenNV (GLenum color, GLenum genMode, GLenum colorFormat, const GLfloat *coeffs); GLAPI void APIENTRY glPathTexGenNV (GLenum texCoordSet, GLenum genMode, GLint components, const GLfloat *coeffs); GLAPI void APIENTRY glPathFogGenNV (GLenum genMode); GLAPI void APIENTRY glCoverFillPathNV (GLuint path, GLenum coverMode); GLAPI void APIENTRY glCoverStrokePathNV (GLuint path, GLenum coverMode); GLAPI void APIENTRY glCoverFillPathInstancedNV (GLsizei numPaths, GLenum pathNameType, const void *paths, GLuint pathBase, GLenum coverMode, GLenum transformType, const GLfloat *transformValues); GLAPI void APIENTRY glCoverStrokePathInstancedNV (GLsizei numPaths, GLenum pathNameType, const void *paths, GLuint pathBase, GLenum coverMode, GLenum transformType, const GLfloat *transformValues); GLAPI void APIENTRY glGetPathParameterivNV (GLuint path, GLenum pname, GLint *value); GLAPI void APIENTRY glGetPathParameterfvNV (GLuint path, GLenum pname, GLfloat *value); GLAPI void APIENTRY glGetPathCommandsNV (GLuint path, GLubyte *commands); GLAPI void APIENTRY glGetPathCoordsNV (GLuint path, GLfloat *coords); GLAPI void APIENTRY glGetPathDashArrayNV (GLuint path, GLfloat *dashArray); GLAPI void APIENTRY glGetPathMetricsNV (GLbitfield metricQueryMask, GLsizei numPaths, GLenum pathNameType, const void *paths, GLuint pathBase, GLsizei stride, GLfloat *metrics); GLAPI void APIENTRY glGetPathMetricRangeNV (GLbitfield metricQueryMask, GLuint firstPathName, GLsizei numPaths, GLsizei stride, GLfloat *metrics); GLAPI void APIENTRY glGetPathSpacingNV (GLenum pathListMode, GLsizei numPaths, GLenum pathNameType, const void *paths, GLuint pathBase, GLfloat advanceScale, GLfloat kerningScale, GLenum transformType, GLfloat *returnedSpacing); GLAPI void APIENTRY glGetPathColorGenivNV (GLenum color, GLenum pname, GLint *value); GLAPI void APIENTRY glGetPathColorGenfvNV (GLenum color, GLenum pname, GLfloat *value); GLAPI void APIENTRY glGetPathTexGenivNV (GLenum texCoordSet, GLenum pname, GLint *value); GLAPI void APIENTRY glGetPathTexGenfvNV (GLenum texCoordSet, GLenum pname, GLfloat *value); GLAPI GLboolean APIENTRY glIsPointInFillPathNV (GLuint path, GLuint mask, GLfloat x, GLfloat y); GLAPI GLboolean APIENTRY glIsPointInStrokePathNV (GLuint path, GLfloat x, GLfloat y); GLAPI GLfloat APIENTRY glGetPathLengthNV (GLuint path, GLsizei startSegment, GLsizei numSegments); GLAPI GLboolean APIENTRY glPointAlongPathNV (GLuint path, GLsizei startSegment, GLsizei numSegments, GLfloat distance, GLfloat *x, GLfloat *y, GLfloat *tangentX, GLfloat *tangentY); #endif #endif /* GL_NV_path_rendering */ #ifndef GL_NV_pixel_data_range #define GL_NV_pixel_data_range 1 #define GL_WRITE_PIXEL_DATA_RANGE_NV 0x8878 #define GL_READ_PIXEL_DATA_RANGE_NV 0x8879 #define GL_WRITE_PIXEL_DATA_RANGE_LENGTH_NV 0x887A #define GL_READ_PIXEL_DATA_RANGE_LENGTH_NV 0x887B #define GL_WRITE_PIXEL_DATA_RANGE_POINTER_NV 0x887C #define GL_READ_PIXEL_DATA_RANGE_POINTER_NV 0x887D typedef void (APIENTRYP PFNGLPIXELDATARANGENVPROC) (GLenum target, GLsizei length, const void *pointer); typedef void (APIENTRYP PFNGLFLUSHPIXELDATARANGENVPROC) (GLenum target); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glPixelDataRangeNV (GLenum target, GLsizei length, const void *pointer); GLAPI void APIENTRY glFlushPixelDataRangeNV (GLenum target); #endif #endif /* GL_NV_pixel_data_range */ #ifndef GL_NV_point_sprite #define GL_NV_point_sprite 1 #define GL_POINT_SPRITE_NV 0x8861 #define GL_COORD_REPLACE_NV 0x8862 #define GL_POINT_SPRITE_R_MODE_NV 0x8863 typedef void (APIENTRYP PFNGLPOINTPARAMETERINVPROC) (GLenum pname, GLint param); typedef void (APIENTRYP PFNGLPOINTPARAMETERIVNVPROC) (GLenum pname, const GLint *params); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glPointParameteriNV (GLenum pname, GLint param); GLAPI void APIENTRY glPointParameterivNV (GLenum pname, const GLint *params); #endif #endif /* GL_NV_point_sprite */ #ifndef GL_NV_present_video #define GL_NV_present_video 1 #define GL_FRAME_NV 0x8E26 #define GL_FIELDS_NV 0x8E27 #define GL_CURRENT_TIME_NV 0x8E28 #define GL_NUM_FILL_STREAMS_NV 0x8E29 #define GL_PRESENT_TIME_NV 0x8E2A #define GL_PRESENT_DURATION_NV 0x8E2B typedef void (APIENTRYP PFNGLPRESENTFRAMEKEYEDNVPROC) (GLuint video_slot, GLuint64EXT minPresentTime, GLuint beginPresentTimeId, GLuint presentDurationId, GLenum type, GLenum target0, GLuint fill0, GLuint key0, GLenum target1, GLuint fill1, GLuint key1); typedef void (APIENTRYP PFNGLPRESENTFRAMEDUALFILLNVPROC) (GLuint video_slot, GLuint64EXT minPresentTime, GLuint beginPresentTimeId, GLuint presentDurationId, GLenum type, GLenum target0, GLuint fill0, GLenum target1, GLuint fill1, GLenum target2, GLuint fill2, GLenum target3, GLuint fill3); typedef void (APIENTRYP PFNGLGETVIDEOIVNVPROC) (GLuint video_slot, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGETVIDEOUIVNVPROC) (GLuint video_slot, GLenum pname, GLuint *params); typedef void (APIENTRYP PFNGLGETVIDEOI64VNVPROC) (GLuint video_slot, GLenum pname, GLint64EXT *params); typedef void (APIENTRYP PFNGLGETVIDEOUI64VNVPROC) (GLuint video_slot, GLenum pname, GLuint64EXT *params); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glPresentFrameKeyedNV (GLuint video_slot, GLuint64EXT minPresentTime, GLuint beginPresentTimeId, GLuint presentDurationId, GLenum type, GLenum target0, GLuint fill0, GLuint key0, GLenum target1, GLuint fill1, GLuint key1); GLAPI void APIENTRY glPresentFrameDualFillNV (GLuint video_slot, GLuint64EXT minPresentTime, GLuint beginPresentTimeId, GLuint presentDurationId, GLenum type, GLenum target0, GLuint fill0, GLenum target1, GLuint fill1, GLenum target2, GLuint fill2, GLenum target3, GLuint fill3); GLAPI void APIENTRY glGetVideoivNV (GLuint video_slot, GLenum pname, GLint *params); GLAPI void APIENTRY glGetVideouivNV (GLuint video_slot, GLenum pname, GLuint *params); GLAPI void APIENTRY glGetVideoi64vNV (GLuint video_slot, GLenum pname, GLint64EXT *params); GLAPI void APIENTRY glGetVideoui64vNV (GLuint video_slot, GLenum pname, GLuint64EXT *params); #endif #endif /* GL_NV_present_video */ #ifndef GL_NV_primitive_restart #define GL_NV_primitive_restart 1 #define GL_PRIMITIVE_RESTART_NV 0x8558 #define GL_PRIMITIVE_RESTART_INDEX_NV 0x8559 typedef void (APIENTRYP PFNGLPRIMITIVERESTARTNVPROC) (void); typedef void (APIENTRYP PFNGLPRIMITIVERESTARTINDEXNVPROC) (GLuint index); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glPrimitiveRestartNV (void); GLAPI void APIENTRY glPrimitiveRestartIndexNV (GLuint index); #endif #endif /* GL_NV_primitive_restart */ #ifndef GL_NV_register_combiners #define GL_NV_register_combiners 1 #define GL_REGISTER_COMBINERS_NV 0x8522 #define GL_VARIABLE_A_NV 0x8523 #define GL_VARIABLE_B_NV 0x8524 #define GL_VARIABLE_C_NV 0x8525 #define GL_VARIABLE_D_NV 0x8526 #define GL_VARIABLE_E_NV 0x8527 #define GL_VARIABLE_F_NV 0x8528 #define GL_VARIABLE_G_NV 0x8529 #define GL_CONSTANT_COLOR0_NV 0x852A #define GL_CONSTANT_COLOR1_NV 0x852B #define GL_SPARE0_NV 0x852E #define GL_SPARE1_NV 0x852F #define GL_DISCARD_NV 0x8530 #define GL_E_TIMES_F_NV 0x8531 #define GL_SPARE0_PLUS_SECONDARY_COLOR_NV 0x8532 #define GL_UNSIGNED_IDENTITY_NV 0x8536 #define GL_UNSIGNED_INVERT_NV 0x8537 #define GL_EXPAND_NORMAL_NV 0x8538 #define GL_EXPAND_NEGATE_NV 0x8539 #define GL_HALF_BIAS_NORMAL_NV 0x853A #define GL_HALF_BIAS_NEGATE_NV 0x853B #define GL_SIGNED_IDENTITY_NV 0x853C #define GL_SIGNED_NEGATE_NV 0x853D #define GL_SCALE_BY_TWO_NV 0x853E #define GL_SCALE_BY_FOUR_NV 0x853F #define GL_SCALE_BY_ONE_HALF_NV 0x8540 #define GL_BIAS_BY_NEGATIVE_ONE_HALF_NV 0x8541 #define GL_COMBINER_INPUT_NV 0x8542 #define GL_COMBINER_MAPPING_NV 0x8543 #define GL_COMBINER_COMPONENT_USAGE_NV 0x8544 #define GL_COMBINER_AB_DOT_PRODUCT_NV 0x8545 #define GL_COMBINER_CD_DOT_PRODUCT_NV 0x8546 #define GL_COMBINER_MUX_SUM_NV 0x8547 #define GL_COMBINER_SCALE_NV 0x8548 #define GL_COMBINER_BIAS_NV 0x8549 #define GL_COMBINER_AB_OUTPUT_NV 0x854A #define GL_COMBINER_CD_OUTPUT_NV 0x854B #define GL_COMBINER_SUM_OUTPUT_NV 0x854C #define GL_MAX_GENERAL_COMBINERS_NV 0x854D #define GL_NUM_GENERAL_COMBINERS_NV 0x854E #define GL_COLOR_SUM_CLAMP_NV 0x854F #define GL_COMBINER0_NV 0x8550 #define GL_COMBINER1_NV 0x8551 #define GL_COMBINER2_NV 0x8552 #define GL_COMBINER3_NV 0x8553 #define GL_COMBINER4_NV 0x8554 #define GL_COMBINER5_NV 0x8555 #define GL_COMBINER6_NV 0x8556 #define GL_COMBINER7_NV 0x8557 typedef void (APIENTRYP PFNGLCOMBINERPARAMETERFVNVPROC) (GLenum pname, const GLfloat *params); typedef void (APIENTRYP PFNGLCOMBINERPARAMETERFNVPROC) (GLenum pname, GLfloat param); typedef void (APIENTRYP PFNGLCOMBINERPARAMETERIVNVPROC) (GLenum pname, const GLint *params); typedef void (APIENTRYP PFNGLCOMBINERPARAMETERINVPROC) (GLenum pname, GLint param); typedef void (APIENTRYP PFNGLCOMBINERINPUTNVPROC) (GLenum stage, GLenum portion, GLenum variable, GLenum input, GLenum mapping, GLenum componentUsage); typedef void (APIENTRYP PFNGLCOMBINEROUTPUTNVPROC) (GLenum stage, GLenum portion, GLenum abOutput, GLenum cdOutput, GLenum sumOutput, GLenum scale, GLenum bias, GLboolean abDotProduct, GLboolean cdDotProduct, GLboolean muxSum); typedef void (APIENTRYP PFNGLFINALCOMBINERINPUTNVPROC) (GLenum variable, GLenum input, GLenum mapping, GLenum componentUsage); typedef void (APIENTRYP PFNGLGETCOMBINERINPUTPARAMETERFVNVPROC) (GLenum stage, GLenum portion, GLenum variable, GLenum pname, GLfloat *params); typedef void (APIENTRYP PFNGLGETCOMBINERINPUTPARAMETERIVNVPROC) (GLenum stage, GLenum portion, GLenum variable, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGETCOMBINEROUTPUTPARAMETERFVNVPROC) (GLenum stage, GLenum portion, GLenum pname, GLfloat *params); typedef void (APIENTRYP PFNGLGETCOMBINEROUTPUTPARAMETERIVNVPROC) (GLenum stage, GLenum portion, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGETFINALCOMBINERINPUTPARAMETERFVNVPROC) (GLenum variable, GLenum pname, GLfloat *params); typedef void (APIENTRYP PFNGLGETFINALCOMBINERINPUTPARAMETERIVNVPROC) (GLenum variable, GLenum pname, GLint *params); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glCombinerParameterfvNV (GLenum pname, const GLfloat *params); GLAPI void APIENTRY glCombinerParameterfNV (GLenum pname, GLfloat param); GLAPI void APIENTRY glCombinerParameterivNV (GLenum pname, const GLint *params); GLAPI void APIENTRY glCombinerParameteriNV (GLenum pname, GLint param); GLAPI void APIENTRY glCombinerInputNV (GLenum stage, GLenum portion, GLenum variable, GLenum input, GLenum mapping, GLenum componentUsage); GLAPI void APIENTRY glCombinerOutputNV (GLenum stage, GLenum portion, GLenum abOutput, GLenum cdOutput, GLenum sumOutput, GLenum scale, GLenum bias, GLboolean abDotProduct, GLboolean cdDotProduct, GLboolean muxSum); GLAPI void APIENTRY glFinalCombinerInputNV (GLenum variable, GLenum input, GLenum mapping, GLenum componentUsage); GLAPI void APIENTRY glGetCombinerInputParameterfvNV (GLenum stage, GLenum portion, GLenum variable, GLenum pname, GLfloat *params); GLAPI void APIENTRY glGetCombinerInputParameterivNV (GLenum stage, GLenum portion, GLenum variable, GLenum pname, GLint *params); GLAPI void APIENTRY glGetCombinerOutputParameterfvNV (GLenum stage, GLenum portion, GLenum pname, GLfloat *params); GLAPI void APIENTRY glGetCombinerOutputParameterivNV (GLenum stage, GLenum portion, GLenum pname, GLint *params); GLAPI void APIENTRY glGetFinalCombinerInputParameterfvNV (GLenum variable, GLenum pname, GLfloat *params); GLAPI void APIENTRY glGetFinalCombinerInputParameterivNV (GLenum variable, GLenum pname, GLint *params); #endif #endif /* GL_NV_register_combiners */ #ifndef GL_NV_register_combiners2 #define GL_NV_register_combiners2 1 #define GL_PER_STAGE_CONSTANTS_NV 0x8535 typedef void (APIENTRYP PFNGLCOMBINERSTAGEPARAMETERFVNVPROC) (GLenum stage, GLenum pname, const GLfloat *params); typedef void (APIENTRYP PFNGLGETCOMBINERSTAGEPARAMETERFVNVPROC) (GLenum stage, GLenum pname, GLfloat *params); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glCombinerStageParameterfvNV (GLenum stage, GLenum pname, const GLfloat *params); GLAPI void APIENTRY glGetCombinerStageParameterfvNV (GLenum stage, GLenum pname, GLfloat *params); #endif #endif /* GL_NV_register_combiners2 */ #ifndef GL_NV_shader_atomic_counters #define GL_NV_shader_atomic_counters 1 #endif /* GL_NV_shader_atomic_counters */ #ifndef GL_NV_shader_atomic_float #define GL_NV_shader_atomic_float 1 #endif /* GL_NV_shader_atomic_float */ #ifndef GL_NV_shader_buffer_load #define GL_NV_shader_buffer_load 1 #define GL_BUFFER_GPU_ADDRESS_NV 0x8F1D #define GL_GPU_ADDRESS_NV 0x8F34 #define GL_MAX_SHADER_BUFFER_ADDRESS_NV 0x8F35 typedef void (APIENTRYP PFNGLMAKEBUFFERRESIDENTNVPROC) (GLenum target, GLenum access); typedef void (APIENTRYP PFNGLMAKEBUFFERNONRESIDENTNVPROC) (GLenum target); typedef GLboolean (APIENTRYP PFNGLISBUFFERRESIDENTNVPROC) (GLenum target); typedef void (APIENTRYP PFNGLMAKENAMEDBUFFERRESIDENTNVPROC) (GLuint buffer, GLenum access); typedef void (APIENTRYP PFNGLMAKENAMEDBUFFERNONRESIDENTNVPROC) (GLuint buffer); typedef GLboolean (APIENTRYP PFNGLISNAMEDBUFFERRESIDENTNVPROC) (GLuint buffer); typedef void (APIENTRYP PFNGLGETBUFFERPARAMETERUI64VNVPROC) (GLenum target, GLenum pname, GLuint64EXT *params); typedef void (APIENTRYP PFNGLGETNAMEDBUFFERPARAMETERUI64VNVPROC) (GLuint buffer, GLenum pname, GLuint64EXT *params); typedef void (APIENTRYP PFNGLGETINTEGERUI64VNVPROC) (GLenum value, GLuint64EXT *result); typedef void (APIENTRYP PFNGLUNIFORMUI64NVPROC) (GLint location, GLuint64EXT value); typedef void (APIENTRYP PFNGLUNIFORMUI64VNVPROC) (GLint location, GLsizei count, const GLuint64EXT *value); typedef void (APIENTRYP PFNGLGETUNIFORMUI64VNVPROC) (GLuint program, GLint location, GLuint64EXT *params); typedef void (APIENTRYP PFNGLPROGRAMUNIFORMUI64NVPROC) (GLuint program, GLint location, GLuint64EXT value); typedef void (APIENTRYP PFNGLPROGRAMUNIFORMUI64VNVPROC) (GLuint program, GLint location, GLsizei count, const GLuint64EXT *value); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glMakeBufferResidentNV (GLenum target, GLenum access); GLAPI void APIENTRY glMakeBufferNonResidentNV (GLenum target); GLAPI GLboolean APIENTRY glIsBufferResidentNV (GLenum target); GLAPI void APIENTRY glMakeNamedBufferResidentNV (GLuint buffer, GLenum access); GLAPI void APIENTRY glMakeNamedBufferNonResidentNV (GLuint buffer); GLAPI GLboolean APIENTRY glIsNamedBufferResidentNV (GLuint buffer); GLAPI void APIENTRY glGetBufferParameterui64vNV (GLenum target, GLenum pname, GLuint64EXT *params); GLAPI void APIENTRY glGetNamedBufferParameterui64vNV (GLuint buffer, GLenum pname, GLuint64EXT *params); GLAPI void APIENTRY glGetIntegerui64vNV (GLenum value, GLuint64EXT *result); GLAPI void APIENTRY glUniformui64NV (GLint location, GLuint64EXT value); GLAPI void APIENTRY glUniformui64vNV (GLint location, GLsizei count, const GLuint64EXT *value); GLAPI void APIENTRY glGetUniformui64vNV (GLuint program, GLint location, GLuint64EXT *params); GLAPI void APIENTRY glProgramUniformui64NV (GLuint program, GLint location, GLuint64EXT value); GLAPI void APIENTRY glProgramUniformui64vNV (GLuint program, GLint location, GLsizei count, const GLuint64EXT *value); #endif #endif /* GL_NV_shader_buffer_load */ #ifndef GL_NV_shader_buffer_store #define GL_NV_shader_buffer_store 1 #define GL_SHADER_GLOBAL_ACCESS_BARRIER_BIT_NV 0x00000010 #endif /* GL_NV_shader_buffer_store */ #ifndef GL_NV_shader_storage_buffer_object #define GL_NV_shader_storage_buffer_object 1 #endif /* GL_NV_shader_storage_buffer_object */ #ifndef GL_NV_tessellation_program5 #define GL_NV_tessellation_program5 1 #define GL_MAX_PROGRAM_PATCH_ATTRIBS_NV 0x86D8 #define GL_TESS_CONTROL_PROGRAM_NV 0x891E #define GL_TESS_EVALUATION_PROGRAM_NV 0x891F #define GL_TESS_CONTROL_PROGRAM_PARAMETER_BUFFER_NV 0x8C74 #define GL_TESS_EVALUATION_PROGRAM_PARAMETER_BUFFER_NV 0x8C75 #endif /* GL_NV_tessellation_program5 */ #ifndef GL_NV_texgen_emboss #define GL_NV_texgen_emboss 1 #define GL_EMBOSS_LIGHT_NV 0x855D #define GL_EMBOSS_CONSTANT_NV 0x855E #define GL_EMBOSS_MAP_NV 0x855F #endif /* GL_NV_texgen_emboss */ #ifndef GL_NV_texgen_reflection #define GL_NV_texgen_reflection 1 #define GL_NORMAL_MAP_NV 0x8511 #define GL_REFLECTION_MAP_NV 0x8512 #endif /* GL_NV_texgen_reflection */ #ifndef GL_NV_texture_barrier #define GL_NV_texture_barrier 1 typedef void (APIENTRYP PFNGLTEXTUREBARRIERNVPROC) (void); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glTextureBarrierNV (void); #endif #endif /* GL_NV_texture_barrier */ #ifndef GL_NV_texture_compression_vtc #define GL_NV_texture_compression_vtc 1 #endif /* GL_NV_texture_compression_vtc */ #ifndef GL_NV_texture_env_combine4 #define GL_NV_texture_env_combine4 1 #define GL_COMBINE4_NV 0x8503 #define GL_SOURCE3_RGB_NV 0x8583 #define GL_SOURCE3_ALPHA_NV 0x858B #define GL_OPERAND3_RGB_NV 0x8593 #define GL_OPERAND3_ALPHA_NV 0x859B #endif /* GL_NV_texture_env_combine4 */ #ifndef GL_NV_texture_expand_normal #define GL_NV_texture_expand_normal 1 #define GL_TEXTURE_UNSIGNED_REMAP_MODE_NV 0x888F #endif /* GL_NV_texture_expand_normal */ #ifndef GL_NV_texture_multisample #define GL_NV_texture_multisample 1 #define GL_TEXTURE_COVERAGE_SAMPLES_NV 0x9045 #define GL_TEXTURE_COLOR_SAMPLES_NV 0x9046 typedef void (APIENTRYP PFNGLTEXIMAGE2DMULTISAMPLECOVERAGENVPROC) (GLenum target, GLsizei coverageSamples, GLsizei colorSamples, GLint internalFormat, GLsizei width, GLsizei height, GLboolean fixedSampleLocations); typedef void (APIENTRYP PFNGLTEXIMAGE3DMULTISAMPLECOVERAGENVPROC) (GLenum target, GLsizei coverageSamples, GLsizei colorSamples, GLint internalFormat, GLsizei width, GLsizei height, GLsizei depth, GLboolean fixedSampleLocations); typedef void (APIENTRYP PFNGLTEXTUREIMAGE2DMULTISAMPLENVPROC) (GLuint texture, GLenum target, GLsizei samples, GLint internalFormat, GLsizei width, GLsizei height, GLboolean fixedSampleLocations); typedef void (APIENTRYP PFNGLTEXTUREIMAGE3DMULTISAMPLENVPROC) (GLuint texture, GLenum target, GLsizei samples, GLint internalFormat, GLsizei width, GLsizei height, GLsizei depth, GLboolean fixedSampleLocations); typedef void (APIENTRYP PFNGLTEXTUREIMAGE2DMULTISAMPLECOVERAGENVPROC) (GLuint texture, GLenum target, GLsizei coverageSamples, GLsizei colorSamples, GLint internalFormat, GLsizei width, GLsizei height, GLboolean fixedSampleLocations); typedef void (APIENTRYP PFNGLTEXTUREIMAGE3DMULTISAMPLECOVERAGENVPROC) (GLuint texture, GLenum target, GLsizei coverageSamples, GLsizei colorSamples, GLint internalFormat, GLsizei width, GLsizei height, GLsizei depth, GLboolean fixedSampleLocations); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glTexImage2DMultisampleCoverageNV (GLenum target, GLsizei coverageSamples, GLsizei colorSamples, GLint internalFormat, GLsizei width, GLsizei height, GLboolean fixedSampleLocations); GLAPI void APIENTRY glTexImage3DMultisampleCoverageNV (GLenum target, GLsizei coverageSamples, GLsizei colorSamples, GLint internalFormat, GLsizei width, GLsizei height, GLsizei depth, GLboolean fixedSampleLocations); GLAPI void APIENTRY glTextureImage2DMultisampleNV (GLuint texture, GLenum target, GLsizei samples, GLint internalFormat, GLsizei width, GLsizei height, GLboolean fixedSampleLocations); GLAPI void APIENTRY glTextureImage3DMultisampleNV (GLuint texture, GLenum target, GLsizei samples, GLint internalFormat, GLsizei width, GLsizei height, GLsizei depth, GLboolean fixedSampleLocations); GLAPI void APIENTRY glTextureImage2DMultisampleCoverageNV (GLuint texture, GLenum target, GLsizei coverageSamples, GLsizei colorSamples, GLint internalFormat, GLsizei width, GLsizei height, GLboolean fixedSampleLocations); GLAPI void APIENTRY glTextureImage3DMultisampleCoverageNV (GLuint texture, GLenum target, GLsizei coverageSamples, GLsizei colorSamples, GLint internalFormat, GLsizei width, GLsizei height, GLsizei depth, GLboolean fixedSampleLocations); #endif #endif /* GL_NV_texture_multisample */ #ifndef GL_NV_texture_rectangle #define GL_NV_texture_rectangle 1 #define GL_TEXTURE_RECTANGLE_NV 0x84F5 #define GL_TEXTURE_BINDING_RECTANGLE_NV 0x84F6 #define GL_PROXY_TEXTURE_RECTANGLE_NV 0x84F7 #define GL_MAX_RECTANGLE_TEXTURE_SIZE_NV 0x84F8 #endif /* GL_NV_texture_rectangle */ #ifndef GL_NV_texture_shader #define GL_NV_texture_shader 1 #define GL_OFFSET_TEXTURE_RECTANGLE_NV 0x864C #define GL_OFFSET_TEXTURE_RECTANGLE_SCALE_NV 0x864D #define GL_DOT_PRODUCT_TEXTURE_RECTANGLE_NV 0x864E #define GL_RGBA_UNSIGNED_DOT_PRODUCT_MAPPING_NV 0x86D9 #define GL_UNSIGNED_INT_S8_S8_8_8_NV 0x86DA #define GL_UNSIGNED_INT_8_8_S8_S8_REV_NV 0x86DB #define GL_DSDT_MAG_INTENSITY_NV 0x86DC #define GL_SHADER_CONSISTENT_NV 0x86DD #define GL_TEXTURE_SHADER_NV 0x86DE #define GL_SHADER_OPERATION_NV 0x86DF #define GL_CULL_MODES_NV 0x86E0 #define GL_OFFSET_TEXTURE_MATRIX_NV 0x86E1 #define GL_OFFSET_TEXTURE_SCALE_NV 0x86E2 #define GL_OFFSET_TEXTURE_BIAS_NV 0x86E3 #define GL_OFFSET_TEXTURE_2D_MATRIX_NV 0x86E1 #define GL_OFFSET_TEXTURE_2D_SCALE_NV 0x86E2 #define GL_OFFSET_TEXTURE_2D_BIAS_NV 0x86E3 #define GL_PREVIOUS_TEXTURE_INPUT_NV 0x86E4 #define GL_CONST_EYE_NV 0x86E5 #define GL_PASS_THROUGH_NV 0x86E6 #define GL_CULL_FRAGMENT_NV 0x86E7 #define GL_OFFSET_TEXTURE_2D_NV 0x86E8 #define GL_DEPENDENT_AR_TEXTURE_2D_NV 0x86E9 #define GL_DEPENDENT_GB_TEXTURE_2D_NV 0x86EA #define GL_DOT_PRODUCT_NV 0x86EC #define GL_DOT_PRODUCT_DEPTH_REPLACE_NV 0x86ED #define GL_DOT_PRODUCT_TEXTURE_2D_NV 0x86EE #define GL_DOT_PRODUCT_TEXTURE_CUBE_MAP_NV 0x86F0 #define GL_DOT_PRODUCT_DIFFUSE_CUBE_MAP_NV 0x86F1 #define GL_DOT_PRODUCT_REFLECT_CUBE_MAP_NV 0x86F2 #define GL_DOT_PRODUCT_CONST_EYE_REFLECT_CUBE_MAP_NV 0x86F3 #define GL_HILO_NV 0x86F4 #define GL_DSDT_NV 0x86F5 #define GL_DSDT_MAG_NV 0x86F6 #define GL_DSDT_MAG_VIB_NV 0x86F7 #define GL_HILO16_NV 0x86F8 #define GL_SIGNED_HILO_NV 0x86F9 #define GL_SIGNED_HILO16_NV 0x86FA #define GL_SIGNED_RGBA_NV 0x86FB #define GL_SIGNED_RGBA8_NV 0x86FC #define GL_SIGNED_RGB_NV 0x86FE #define GL_SIGNED_RGB8_NV 0x86FF #define GL_SIGNED_LUMINANCE_NV 0x8701 #define GL_SIGNED_LUMINANCE8_NV 0x8702 #define GL_SIGNED_LUMINANCE_ALPHA_NV 0x8703 #define GL_SIGNED_LUMINANCE8_ALPHA8_NV 0x8704 #define GL_SIGNED_ALPHA_NV 0x8705 #define GL_SIGNED_ALPHA8_NV 0x8706 #define GL_SIGNED_INTENSITY_NV 0x8707 #define GL_SIGNED_INTENSITY8_NV 0x8708 #define GL_DSDT8_NV 0x8709 #define GL_DSDT8_MAG8_NV 0x870A #define GL_DSDT8_MAG8_INTENSITY8_NV 0x870B #define GL_SIGNED_RGB_UNSIGNED_ALPHA_NV 0x870C #define GL_SIGNED_RGB8_UNSIGNED_ALPHA8_NV 0x870D #define GL_HI_SCALE_NV 0x870E #define GL_LO_SCALE_NV 0x870F #define GL_DS_SCALE_NV 0x8710 #define GL_DT_SCALE_NV 0x8711 #define GL_MAGNITUDE_SCALE_NV 0x8712 #define GL_VIBRANCE_SCALE_NV 0x8713 #define GL_HI_BIAS_NV 0x8714 #define GL_LO_BIAS_NV 0x8715 #define GL_DS_BIAS_NV 0x8716 #define GL_DT_BIAS_NV 0x8717 #define GL_MAGNITUDE_BIAS_NV 0x8718 #define GL_VIBRANCE_BIAS_NV 0x8719 #define GL_TEXTURE_BORDER_VALUES_NV 0x871A #define GL_TEXTURE_HI_SIZE_NV 0x871B #define GL_TEXTURE_LO_SIZE_NV 0x871C #define GL_TEXTURE_DS_SIZE_NV 0x871D #define GL_TEXTURE_DT_SIZE_NV 0x871E #define GL_TEXTURE_MAG_SIZE_NV 0x871F #endif /* GL_NV_texture_shader */ #ifndef GL_NV_texture_shader2 #define GL_NV_texture_shader2 1 #define GL_DOT_PRODUCT_TEXTURE_3D_NV 0x86EF #endif /* GL_NV_texture_shader2 */ #ifndef GL_NV_texture_shader3 #define GL_NV_texture_shader3 1 #define GL_OFFSET_PROJECTIVE_TEXTURE_2D_NV 0x8850 #define GL_OFFSET_PROJECTIVE_TEXTURE_2D_SCALE_NV 0x8851 #define GL_OFFSET_PROJECTIVE_TEXTURE_RECTANGLE_NV 0x8852 #define GL_OFFSET_PROJECTIVE_TEXTURE_RECTANGLE_SCALE_NV 0x8853 #define GL_OFFSET_HILO_TEXTURE_2D_NV 0x8854 #define GL_OFFSET_HILO_TEXTURE_RECTANGLE_NV 0x8855 #define GL_OFFSET_HILO_PROJECTIVE_TEXTURE_2D_NV 0x8856 #define GL_OFFSET_HILO_PROJECTIVE_TEXTURE_RECTANGLE_NV 0x8857 #define GL_DEPENDENT_HILO_TEXTURE_2D_NV 0x8858 #define GL_DEPENDENT_RGB_TEXTURE_3D_NV 0x8859 #define GL_DEPENDENT_RGB_TEXTURE_CUBE_MAP_NV 0x885A #define GL_DOT_PRODUCT_PASS_THROUGH_NV 0x885B #define GL_DOT_PRODUCT_TEXTURE_1D_NV 0x885C #define GL_DOT_PRODUCT_AFFINE_DEPTH_REPLACE_NV 0x885D #define GL_HILO8_NV 0x885E #define GL_SIGNED_HILO8_NV 0x885F #define GL_FORCE_BLUE_TO_ONE_NV 0x8860 #endif /* GL_NV_texture_shader3 */ #ifndef GL_NV_transform_feedback #define GL_NV_transform_feedback 1 #define GL_BACK_PRIMARY_COLOR_NV 0x8C77 #define GL_BACK_SECONDARY_COLOR_NV 0x8C78 #define GL_TEXTURE_COORD_NV 0x8C79 #define GL_CLIP_DISTANCE_NV 0x8C7A #define GL_VERTEX_ID_NV 0x8C7B #define GL_PRIMITIVE_ID_NV 0x8C7C #define GL_GENERIC_ATTRIB_NV 0x8C7D #define GL_TRANSFORM_FEEDBACK_ATTRIBS_NV 0x8C7E #define GL_TRANSFORM_FEEDBACK_BUFFER_MODE_NV 0x8C7F #define GL_MAX_TRANSFORM_FEEDBACK_SEPARATE_COMPONENTS_NV 0x8C80 #define GL_ACTIVE_VARYINGS_NV 0x8C81 #define GL_ACTIVE_VARYING_MAX_LENGTH_NV 0x8C82 #define GL_TRANSFORM_FEEDBACK_VARYINGS_NV 0x8C83 #define GL_TRANSFORM_FEEDBACK_BUFFER_START_NV 0x8C84 #define GL_TRANSFORM_FEEDBACK_BUFFER_SIZE_NV 0x8C85 #define GL_TRANSFORM_FEEDBACK_RECORD_NV 0x8C86 #define GL_PRIMITIVES_GENERATED_NV 0x8C87 #define GL_TRANSFORM_FEEDBACK_PRIMITIVES_WRITTEN_NV 0x8C88 #define GL_RASTERIZER_DISCARD_NV 0x8C89 #define GL_MAX_TRANSFORM_FEEDBACK_INTERLEAVED_COMPONENTS_NV 0x8C8A #define GL_MAX_TRANSFORM_FEEDBACK_SEPARATE_ATTRIBS_NV 0x8C8B #define GL_INTERLEAVED_ATTRIBS_NV 0x8C8C #define GL_SEPARATE_ATTRIBS_NV 0x8C8D #define GL_TRANSFORM_FEEDBACK_BUFFER_NV 0x8C8E #define GL_TRANSFORM_FEEDBACK_BUFFER_BINDING_NV 0x8C8F #define GL_LAYER_NV 0x8DAA #define GL_NEXT_BUFFER_NV -2 #define GL_SKIP_COMPONENTS4_NV -3 #define GL_SKIP_COMPONENTS3_NV -4 #define GL_SKIP_COMPONENTS2_NV -5 #define GL_SKIP_COMPONENTS1_NV -6 typedef void (APIENTRYP PFNGLBEGINTRANSFORMFEEDBACKNVPROC) (GLenum primitiveMode); typedef void (APIENTRYP PFNGLENDTRANSFORMFEEDBACKNVPROC) (void); typedef void (APIENTRYP PFNGLTRANSFORMFEEDBACKATTRIBSNVPROC) (GLuint count, const GLint *attribs, GLenum bufferMode); typedef void (APIENTRYP PFNGLBINDBUFFERRANGENVPROC) (GLenum target, GLuint index, GLuint buffer, GLintptr offset, GLsizeiptr size); typedef void (APIENTRYP PFNGLBINDBUFFEROFFSETNVPROC) (GLenum target, GLuint index, GLuint buffer, GLintptr offset); typedef void (APIENTRYP PFNGLBINDBUFFERBASENVPROC) (GLenum target, GLuint index, GLuint buffer); typedef void (APIENTRYP PFNGLTRANSFORMFEEDBACKVARYINGSNVPROC) (GLuint program, GLsizei count, const GLint *locations, GLenum bufferMode); typedef void (APIENTRYP PFNGLACTIVEVARYINGNVPROC) (GLuint program, const GLchar *name); typedef GLint (APIENTRYP PFNGLGETVARYINGLOCATIONNVPROC) (GLuint program, const GLchar *name); typedef void (APIENTRYP PFNGLGETACTIVEVARYINGNVPROC) (GLuint program, GLuint index, GLsizei bufSize, GLsizei *length, GLsizei *size, GLenum *type, GLchar *name); typedef void (APIENTRYP PFNGLGETTRANSFORMFEEDBACKVARYINGNVPROC) (GLuint program, GLuint index, GLint *location); typedef void (APIENTRYP PFNGLTRANSFORMFEEDBACKSTREAMATTRIBSNVPROC) (GLsizei count, const GLint *attribs, GLsizei nbuffers, const GLint *bufstreams, GLenum bufferMode); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glBeginTransformFeedbackNV (GLenum primitiveMode); GLAPI void APIENTRY glEndTransformFeedbackNV (void); GLAPI void APIENTRY glTransformFeedbackAttribsNV (GLuint count, const GLint *attribs, GLenum bufferMode); GLAPI void APIENTRY glBindBufferRangeNV (GLenum target, GLuint index, GLuint buffer, GLintptr offset, GLsizeiptr size); GLAPI void APIENTRY glBindBufferOffsetNV (GLenum target, GLuint index, GLuint buffer, GLintptr offset); GLAPI void APIENTRY glBindBufferBaseNV (GLenum target, GLuint index, GLuint buffer); GLAPI void APIENTRY glTransformFeedbackVaryingsNV (GLuint program, GLsizei count, const GLint *locations, GLenum bufferMode); GLAPI void APIENTRY glActiveVaryingNV (GLuint program, const GLchar *name); GLAPI GLint APIENTRY glGetVaryingLocationNV (GLuint program, const GLchar *name); GLAPI void APIENTRY glGetActiveVaryingNV (GLuint program, GLuint index, GLsizei bufSize, GLsizei *length, GLsizei *size, GLenum *type, GLchar *name); GLAPI void APIENTRY glGetTransformFeedbackVaryingNV (GLuint program, GLuint index, GLint *location); GLAPI void APIENTRY glTransformFeedbackStreamAttribsNV (GLsizei count, const GLint *attribs, GLsizei nbuffers, const GLint *bufstreams, GLenum bufferMode); #endif #endif /* GL_NV_transform_feedback */ #ifndef GL_NV_transform_feedback2 #define GL_NV_transform_feedback2 1 #define GL_TRANSFORM_FEEDBACK_NV 0x8E22 #define GL_TRANSFORM_FEEDBACK_BUFFER_PAUSED_NV 0x8E23 #define GL_TRANSFORM_FEEDBACK_BUFFER_ACTIVE_NV 0x8E24 #define GL_TRANSFORM_FEEDBACK_BINDING_NV 0x8E25 typedef void (APIENTRYP PFNGLBINDTRANSFORMFEEDBACKNVPROC) (GLenum target, GLuint id); typedef void (APIENTRYP PFNGLDELETETRANSFORMFEEDBACKSNVPROC) (GLsizei n, const GLuint *ids); typedef void (APIENTRYP PFNGLGENTRANSFORMFEEDBACKSNVPROC) (GLsizei n, GLuint *ids); typedef GLboolean (APIENTRYP PFNGLISTRANSFORMFEEDBACKNVPROC) (GLuint id); typedef void (APIENTRYP PFNGLPAUSETRANSFORMFEEDBACKNVPROC) (void); typedef void (APIENTRYP PFNGLRESUMETRANSFORMFEEDBACKNVPROC) (void); typedef void (APIENTRYP PFNGLDRAWTRANSFORMFEEDBACKNVPROC) (GLenum mode, GLuint id); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glBindTransformFeedbackNV (GLenum target, GLuint id); GLAPI void APIENTRY glDeleteTransformFeedbacksNV (GLsizei n, const GLuint *ids); GLAPI void APIENTRY glGenTransformFeedbacksNV (GLsizei n, GLuint *ids); GLAPI GLboolean APIENTRY glIsTransformFeedbackNV (GLuint id); GLAPI void APIENTRY glPauseTransformFeedbackNV (void); GLAPI void APIENTRY glResumeTransformFeedbackNV (void); GLAPI void APIENTRY glDrawTransformFeedbackNV (GLenum mode, GLuint id); #endif #endif /* GL_NV_transform_feedback2 */ #ifndef GL_NV_vdpau_interop #define GL_NV_vdpau_interop 1 typedef GLintptr GLvdpauSurfaceNV; #define GL_SURFACE_STATE_NV 0x86EB #define GL_SURFACE_REGISTERED_NV 0x86FD #define GL_SURFACE_MAPPED_NV 0x8700 #define GL_WRITE_DISCARD_NV 0x88BE typedef void (APIENTRYP PFNGLVDPAUINITNVPROC) (const void *vdpDevice, const void *getProcAddress); typedef void (APIENTRYP PFNGLVDPAUFININVPROC) (void); typedef GLvdpauSurfaceNV (APIENTRYP PFNGLVDPAUREGISTERVIDEOSURFACENVPROC) (const void *vdpSurface, GLenum target, GLsizei numTextureNames, const GLuint *textureNames); typedef GLvdpauSurfaceNV (APIENTRYP PFNGLVDPAUREGISTEROUTPUTSURFACENVPROC) (const void *vdpSurface, GLenum target, GLsizei numTextureNames, const GLuint *textureNames); typedef GLboolean (APIENTRYP PFNGLVDPAUISSURFACENVPROC) (GLvdpauSurfaceNV surface); typedef void (APIENTRYP PFNGLVDPAUUNREGISTERSURFACENVPROC) (GLvdpauSurfaceNV surface); typedef void (APIENTRYP PFNGLVDPAUGETSURFACEIVNVPROC) (GLvdpauSurfaceNV surface, GLenum pname, GLsizei bufSize, GLsizei *length, GLint *values); typedef void (APIENTRYP PFNGLVDPAUSURFACEACCESSNVPROC) (GLvdpauSurfaceNV surface, GLenum access); typedef void (APIENTRYP PFNGLVDPAUMAPSURFACESNVPROC) (GLsizei numSurfaces, const GLvdpauSurfaceNV *surfaces); typedef void (APIENTRYP PFNGLVDPAUUNMAPSURFACESNVPROC) (GLsizei numSurface, const GLvdpauSurfaceNV *surfaces); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glVDPAUInitNV (const void *vdpDevice, const void *getProcAddress); GLAPI void APIENTRY glVDPAUFiniNV (void); GLAPI GLvdpauSurfaceNV APIENTRY glVDPAURegisterVideoSurfaceNV (const void *vdpSurface, GLenum target, GLsizei numTextureNames, const GLuint *textureNames); GLAPI GLvdpauSurfaceNV APIENTRY glVDPAURegisterOutputSurfaceNV (const void *vdpSurface, GLenum target, GLsizei numTextureNames, const GLuint *textureNames); GLAPI GLboolean APIENTRY glVDPAUIsSurfaceNV (GLvdpauSurfaceNV surface); GLAPI void APIENTRY glVDPAUUnregisterSurfaceNV (GLvdpauSurfaceNV surface); GLAPI void APIENTRY glVDPAUGetSurfaceivNV (GLvdpauSurfaceNV surface, GLenum pname, GLsizei bufSize, GLsizei *length, GLint *values); GLAPI void APIENTRY glVDPAUSurfaceAccessNV (GLvdpauSurfaceNV surface, GLenum access); GLAPI void APIENTRY glVDPAUMapSurfacesNV (GLsizei numSurfaces, const GLvdpauSurfaceNV *surfaces); GLAPI void APIENTRY glVDPAUUnmapSurfacesNV (GLsizei numSurface, const GLvdpauSurfaceNV *surfaces); #endif #endif /* GL_NV_vdpau_interop */ #ifndef GL_NV_vertex_array_range #define GL_NV_vertex_array_range 1 #define GL_VERTEX_ARRAY_RANGE_NV 0x851D #define GL_VERTEX_ARRAY_RANGE_LENGTH_NV 0x851E #define GL_VERTEX_ARRAY_RANGE_VALID_NV 0x851F #define GL_MAX_VERTEX_ARRAY_RANGE_ELEMENT_NV 0x8520 #define GL_VERTEX_ARRAY_RANGE_POINTER_NV 0x8521 typedef void (APIENTRYP PFNGLFLUSHVERTEXARRAYRANGENVPROC) (void); typedef void (APIENTRYP PFNGLVERTEXARRAYRANGENVPROC) (GLsizei length, const void *pointer); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glFlushVertexArrayRangeNV (void); GLAPI void APIENTRY glVertexArrayRangeNV (GLsizei length, const void *pointer); #endif #endif /* GL_NV_vertex_array_range */ #ifndef GL_NV_vertex_array_range2 #define GL_NV_vertex_array_range2 1 #define GL_VERTEX_ARRAY_RANGE_WITHOUT_FLUSH_NV 0x8533 #endif /* GL_NV_vertex_array_range2 */ #ifndef GL_NV_vertex_attrib_integer_64bit #define GL_NV_vertex_attrib_integer_64bit 1 typedef void (APIENTRYP PFNGLVERTEXATTRIBL1I64NVPROC) (GLuint index, GLint64EXT x); typedef void (APIENTRYP PFNGLVERTEXATTRIBL2I64NVPROC) (GLuint index, GLint64EXT x, GLint64EXT y); typedef void (APIENTRYP PFNGLVERTEXATTRIBL3I64NVPROC) (GLuint index, GLint64EXT x, GLint64EXT y, GLint64EXT z); typedef void (APIENTRYP PFNGLVERTEXATTRIBL4I64NVPROC) (GLuint index, GLint64EXT x, GLint64EXT y, GLint64EXT z, GLint64EXT w); typedef void (APIENTRYP PFNGLVERTEXATTRIBL1I64VNVPROC) (GLuint index, const GLint64EXT *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBL2I64VNVPROC) (GLuint index, const GLint64EXT *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBL3I64VNVPROC) (GLuint index, const GLint64EXT *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBL4I64VNVPROC) (GLuint index, const GLint64EXT *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBL1UI64NVPROC) (GLuint index, GLuint64EXT x); typedef void (APIENTRYP PFNGLVERTEXATTRIBL2UI64NVPROC) (GLuint index, GLuint64EXT x, GLuint64EXT y); typedef void (APIENTRYP PFNGLVERTEXATTRIBL3UI64NVPROC) (GLuint index, GLuint64EXT x, GLuint64EXT y, GLuint64EXT z); typedef void (APIENTRYP PFNGLVERTEXATTRIBL4UI64NVPROC) (GLuint index, GLuint64EXT x, GLuint64EXT y, GLuint64EXT z, GLuint64EXT w); typedef void (APIENTRYP PFNGLVERTEXATTRIBL1UI64VNVPROC) (GLuint index, const GLuint64EXT *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBL2UI64VNVPROC) (GLuint index, const GLuint64EXT *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBL3UI64VNVPROC) (GLuint index, const GLuint64EXT *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBL4UI64VNVPROC) (GLuint index, const GLuint64EXT *v); typedef void (APIENTRYP PFNGLGETVERTEXATTRIBLI64VNVPROC) (GLuint index, GLenum pname, GLint64EXT *params); typedef void (APIENTRYP PFNGLGETVERTEXATTRIBLUI64VNVPROC) (GLuint index, GLenum pname, GLuint64EXT *params); typedef void (APIENTRYP PFNGLVERTEXATTRIBLFORMATNVPROC) (GLuint index, GLint size, GLenum type, GLsizei stride); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glVertexAttribL1i64NV (GLuint index, GLint64EXT x); GLAPI void APIENTRY glVertexAttribL2i64NV (GLuint index, GLint64EXT x, GLint64EXT y); GLAPI void APIENTRY glVertexAttribL3i64NV (GLuint index, GLint64EXT x, GLint64EXT y, GLint64EXT z); GLAPI void APIENTRY glVertexAttribL4i64NV (GLuint index, GLint64EXT x, GLint64EXT y, GLint64EXT z, GLint64EXT w); GLAPI void APIENTRY glVertexAttribL1i64vNV (GLuint index, const GLint64EXT *v); GLAPI void APIENTRY glVertexAttribL2i64vNV (GLuint index, const GLint64EXT *v); GLAPI void APIENTRY glVertexAttribL3i64vNV (GLuint index, const GLint64EXT *v); GLAPI void APIENTRY glVertexAttribL4i64vNV (GLuint index, const GLint64EXT *v); GLAPI void APIENTRY glVertexAttribL1ui64NV (GLuint index, GLuint64EXT x); GLAPI void APIENTRY glVertexAttribL2ui64NV (GLuint index, GLuint64EXT x, GLuint64EXT y); GLAPI void APIENTRY glVertexAttribL3ui64NV (GLuint index, GLuint64EXT x, GLuint64EXT y, GLuint64EXT z); GLAPI void APIENTRY glVertexAttribL4ui64NV (GLuint index, GLuint64EXT x, GLuint64EXT y, GLuint64EXT z, GLuint64EXT w); GLAPI void APIENTRY glVertexAttribL1ui64vNV (GLuint index, const GLuint64EXT *v); GLAPI void APIENTRY glVertexAttribL2ui64vNV (GLuint index, const GLuint64EXT *v); GLAPI void APIENTRY glVertexAttribL3ui64vNV (GLuint index, const GLuint64EXT *v); GLAPI void APIENTRY glVertexAttribL4ui64vNV (GLuint index, const GLuint64EXT *v); GLAPI void APIENTRY glGetVertexAttribLi64vNV (GLuint index, GLenum pname, GLint64EXT *params); GLAPI void APIENTRY glGetVertexAttribLui64vNV (GLuint index, GLenum pname, GLuint64EXT *params); GLAPI void APIENTRY glVertexAttribLFormatNV (GLuint index, GLint size, GLenum type, GLsizei stride); #endif #endif /* GL_NV_vertex_attrib_integer_64bit */ #ifndef GL_NV_vertex_buffer_unified_memory #define GL_NV_vertex_buffer_unified_memory 1 #define GL_VERTEX_ATTRIB_ARRAY_UNIFIED_NV 0x8F1E #define GL_ELEMENT_ARRAY_UNIFIED_NV 0x8F1F #define GL_VERTEX_ATTRIB_ARRAY_ADDRESS_NV 0x8F20 #define GL_VERTEX_ARRAY_ADDRESS_NV 0x8F21 #define GL_NORMAL_ARRAY_ADDRESS_NV 0x8F22 #define GL_COLOR_ARRAY_ADDRESS_NV 0x8F23 #define GL_INDEX_ARRAY_ADDRESS_NV 0x8F24 #define GL_TEXTURE_COORD_ARRAY_ADDRESS_NV 0x8F25 #define GL_EDGE_FLAG_ARRAY_ADDRESS_NV 0x8F26 #define GL_SECONDARY_COLOR_ARRAY_ADDRESS_NV 0x8F27 #define GL_FOG_COORD_ARRAY_ADDRESS_NV 0x8F28 #define GL_ELEMENT_ARRAY_ADDRESS_NV 0x8F29 #define GL_VERTEX_ATTRIB_ARRAY_LENGTH_NV 0x8F2A #define GL_VERTEX_ARRAY_LENGTH_NV 0x8F2B #define GL_NORMAL_ARRAY_LENGTH_NV 0x8F2C #define GL_COLOR_ARRAY_LENGTH_NV 0x8F2D #define GL_INDEX_ARRAY_LENGTH_NV 0x8F2E #define GL_TEXTURE_COORD_ARRAY_LENGTH_NV 0x8F2F #define GL_EDGE_FLAG_ARRAY_LENGTH_NV 0x8F30 #define GL_SECONDARY_COLOR_ARRAY_LENGTH_NV 0x8F31 #define GL_FOG_COORD_ARRAY_LENGTH_NV 0x8F32 #define GL_ELEMENT_ARRAY_LENGTH_NV 0x8F33 #define GL_DRAW_INDIRECT_UNIFIED_NV 0x8F40 #define GL_DRAW_INDIRECT_ADDRESS_NV 0x8F41 #define GL_DRAW_INDIRECT_LENGTH_NV 0x8F42 typedef void (APIENTRYP PFNGLBUFFERADDRESSRANGENVPROC) (GLenum pname, GLuint index, GLuint64EXT address, GLsizeiptr length); typedef void (APIENTRYP PFNGLVERTEXFORMATNVPROC) (GLint size, GLenum type, GLsizei stride); typedef void (APIENTRYP PFNGLNORMALFORMATNVPROC) (GLenum type, GLsizei stride); typedef void (APIENTRYP PFNGLCOLORFORMATNVPROC) (GLint size, GLenum type, GLsizei stride); typedef void (APIENTRYP PFNGLINDEXFORMATNVPROC) (GLenum type, GLsizei stride); typedef void (APIENTRYP PFNGLTEXCOORDFORMATNVPROC) (GLint size, GLenum type, GLsizei stride); typedef void (APIENTRYP PFNGLEDGEFLAGFORMATNVPROC) (GLsizei stride); typedef void (APIENTRYP PFNGLSECONDARYCOLORFORMATNVPROC) (GLint size, GLenum type, GLsizei stride); typedef void (APIENTRYP PFNGLFOGCOORDFORMATNVPROC) (GLenum type, GLsizei stride); typedef void (APIENTRYP PFNGLVERTEXATTRIBFORMATNVPROC) (GLuint index, GLint size, GLenum type, GLboolean normalized, GLsizei stride); typedef void (APIENTRYP PFNGLVERTEXATTRIBIFORMATNVPROC) (GLuint index, GLint size, GLenum type, GLsizei stride); typedef void (APIENTRYP PFNGLGETINTEGERUI64I_VNVPROC) (GLenum value, GLuint index, GLuint64EXT *result); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glBufferAddressRangeNV (GLenum pname, GLuint index, GLuint64EXT address, GLsizeiptr length); GLAPI void APIENTRY glVertexFormatNV (GLint size, GLenum type, GLsizei stride); GLAPI void APIENTRY glNormalFormatNV (GLenum type, GLsizei stride); GLAPI void APIENTRY glColorFormatNV (GLint size, GLenum type, GLsizei stride); GLAPI void APIENTRY glIndexFormatNV (GLenum type, GLsizei stride); GLAPI void APIENTRY glTexCoordFormatNV (GLint size, GLenum type, GLsizei stride); GLAPI void APIENTRY glEdgeFlagFormatNV (GLsizei stride); GLAPI void APIENTRY glSecondaryColorFormatNV (GLint size, GLenum type, GLsizei stride); GLAPI void APIENTRY glFogCoordFormatNV (GLenum type, GLsizei stride); GLAPI void APIENTRY glVertexAttribFormatNV (GLuint index, GLint size, GLenum type, GLboolean normalized, GLsizei stride); GLAPI void APIENTRY glVertexAttribIFormatNV (GLuint index, GLint size, GLenum type, GLsizei stride); GLAPI void APIENTRY glGetIntegerui64i_vNV (GLenum value, GLuint index, GLuint64EXT *result); #endif #endif /* GL_NV_vertex_buffer_unified_memory */ #ifndef GL_NV_vertex_program #define GL_NV_vertex_program 1 #define GL_VERTEX_PROGRAM_NV 0x8620 #define GL_VERTEX_STATE_PROGRAM_NV 0x8621 #define GL_ATTRIB_ARRAY_SIZE_NV 0x8623 #define GL_ATTRIB_ARRAY_STRIDE_NV 0x8624 #define GL_ATTRIB_ARRAY_TYPE_NV 0x8625 #define GL_CURRENT_ATTRIB_NV 0x8626 #define GL_PROGRAM_LENGTH_NV 0x8627 #define GL_PROGRAM_STRING_NV 0x8628 #define GL_MODELVIEW_PROJECTION_NV 0x8629 #define GL_IDENTITY_NV 0x862A #define GL_INVERSE_NV 0x862B #define GL_TRANSPOSE_NV 0x862C #define GL_INVERSE_TRANSPOSE_NV 0x862D #define GL_MAX_TRACK_MATRIX_STACK_DEPTH_NV 0x862E #define GL_MAX_TRACK_MATRICES_NV 0x862F #define GL_MATRIX0_NV 0x8630 #define GL_MATRIX1_NV 0x8631 #define GL_MATRIX2_NV 0x8632 #define GL_MATRIX3_NV 0x8633 #define GL_MATRIX4_NV 0x8634 #define GL_MATRIX5_NV 0x8635 #define GL_MATRIX6_NV 0x8636 #define GL_MATRIX7_NV 0x8637 #define GL_CURRENT_MATRIX_STACK_DEPTH_NV 0x8640 #define GL_CURRENT_MATRIX_NV 0x8641 #define GL_VERTEX_PROGRAM_POINT_SIZE_NV 0x8642 #define GL_VERTEX_PROGRAM_TWO_SIDE_NV 0x8643 #define GL_PROGRAM_PARAMETER_NV 0x8644 #define GL_ATTRIB_ARRAY_POINTER_NV 0x8645 #define GL_PROGRAM_TARGET_NV 0x8646 #define GL_PROGRAM_RESIDENT_NV 0x8647 #define GL_TRACK_MATRIX_NV 0x8648 #define GL_TRACK_MATRIX_TRANSFORM_NV 0x8649 #define GL_VERTEX_PROGRAM_BINDING_NV 0x864A #define GL_PROGRAM_ERROR_POSITION_NV 0x864B #define GL_VERTEX_ATTRIB_ARRAY0_NV 0x8650 #define GL_VERTEX_ATTRIB_ARRAY1_NV 0x8651 #define GL_VERTEX_ATTRIB_ARRAY2_NV 0x8652 #define GL_VERTEX_ATTRIB_ARRAY3_NV 0x8653 #define GL_VERTEX_ATTRIB_ARRAY4_NV 0x8654 #define GL_VERTEX_ATTRIB_ARRAY5_NV 0x8655 #define GL_VERTEX_ATTRIB_ARRAY6_NV 0x8656 #define GL_VERTEX_ATTRIB_ARRAY7_NV 0x8657 #define GL_VERTEX_ATTRIB_ARRAY8_NV 0x8658 #define GL_VERTEX_ATTRIB_ARRAY9_NV 0x8659 #define GL_VERTEX_ATTRIB_ARRAY10_NV 0x865A #define GL_VERTEX_ATTRIB_ARRAY11_NV 0x865B #define GL_VERTEX_ATTRIB_ARRAY12_NV 0x865C #define GL_VERTEX_ATTRIB_ARRAY13_NV 0x865D #define GL_VERTEX_ATTRIB_ARRAY14_NV 0x865E #define GL_VERTEX_ATTRIB_ARRAY15_NV 0x865F #define GL_MAP1_VERTEX_ATTRIB0_4_NV 0x8660 #define GL_MAP1_VERTEX_ATTRIB1_4_NV 0x8661 #define GL_MAP1_VERTEX_ATTRIB2_4_NV 0x8662 #define GL_MAP1_VERTEX_ATTRIB3_4_NV 0x8663 #define GL_MAP1_VERTEX_ATTRIB4_4_NV 0x8664 #define GL_MAP1_VERTEX_ATTRIB5_4_NV 0x8665 #define GL_MAP1_VERTEX_ATTRIB6_4_NV 0x8666 #define GL_MAP1_VERTEX_ATTRIB7_4_NV 0x8667 #define GL_MAP1_VERTEX_ATTRIB8_4_NV 0x8668 #define GL_MAP1_VERTEX_ATTRIB9_4_NV 0x8669 #define GL_MAP1_VERTEX_ATTRIB10_4_NV 0x866A #define GL_MAP1_VERTEX_ATTRIB11_4_NV 0x866B #define GL_MAP1_VERTEX_ATTRIB12_4_NV 0x866C #define GL_MAP1_VERTEX_ATTRIB13_4_NV 0x866D #define GL_MAP1_VERTEX_ATTRIB14_4_NV 0x866E #define GL_MAP1_VERTEX_ATTRIB15_4_NV 0x866F #define GL_MAP2_VERTEX_ATTRIB0_4_NV 0x8670 #define GL_MAP2_VERTEX_ATTRIB1_4_NV 0x8671 #define GL_MAP2_VERTEX_ATTRIB2_4_NV 0x8672 #define GL_MAP2_VERTEX_ATTRIB3_4_NV 0x8673 #define GL_MAP2_VERTEX_ATTRIB4_4_NV 0x8674 #define GL_MAP2_VERTEX_ATTRIB5_4_NV 0x8675 #define GL_MAP2_VERTEX_ATTRIB6_4_NV 0x8676 #define GL_MAP2_VERTEX_ATTRIB7_4_NV 0x8677 #define GL_MAP2_VERTEX_ATTRIB8_4_NV 0x8678 #define GL_MAP2_VERTEX_ATTRIB9_4_NV 0x8679 #define GL_MAP2_VERTEX_ATTRIB10_4_NV 0x867A #define GL_MAP2_VERTEX_ATTRIB11_4_NV 0x867B #define GL_MAP2_VERTEX_ATTRIB12_4_NV 0x867C #define GL_MAP2_VERTEX_ATTRIB13_4_NV 0x867D #define GL_MAP2_VERTEX_ATTRIB14_4_NV 0x867E #define GL_MAP2_VERTEX_ATTRIB15_4_NV 0x867F typedef GLboolean (APIENTRYP PFNGLAREPROGRAMSRESIDENTNVPROC) (GLsizei n, const GLuint *programs, GLboolean *residences); typedef void (APIENTRYP PFNGLBINDPROGRAMNVPROC) (GLenum target, GLuint id); typedef void (APIENTRYP PFNGLDELETEPROGRAMSNVPROC) (GLsizei n, const GLuint *programs); typedef void (APIENTRYP PFNGLEXECUTEPROGRAMNVPROC) (GLenum target, GLuint id, const GLfloat *params); typedef void (APIENTRYP PFNGLGENPROGRAMSNVPROC) (GLsizei n, GLuint *programs); typedef void (APIENTRYP PFNGLGETPROGRAMPARAMETERDVNVPROC) (GLenum target, GLuint index, GLenum pname, GLdouble *params); typedef void (APIENTRYP PFNGLGETPROGRAMPARAMETERFVNVPROC) (GLenum target, GLuint index, GLenum pname, GLfloat *params); typedef void (APIENTRYP PFNGLGETPROGRAMIVNVPROC) (GLuint id, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGETPROGRAMSTRINGNVPROC) (GLuint id, GLenum pname, GLubyte *program); typedef void (APIENTRYP PFNGLGETTRACKMATRIXIVNVPROC) (GLenum target, GLuint address, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGETVERTEXATTRIBDVNVPROC) (GLuint index, GLenum pname, GLdouble *params); typedef void (APIENTRYP PFNGLGETVERTEXATTRIBFVNVPROC) (GLuint index, GLenum pname, GLfloat *params); typedef void (APIENTRYP PFNGLGETVERTEXATTRIBIVNVPROC) (GLuint index, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGETVERTEXATTRIBPOINTERVNVPROC) (GLuint index, GLenum pname, void **pointer); typedef GLboolean (APIENTRYP PFNGLISPROGRAMNVPROC) (GLuint id); typedef void (APIENTRYP PFNGLLOADPROGRAMNVPROC) (GLenum target, GLuint id, GLsizei len, const GLubyte *program); typedef void (APIENTRYP PFNGLPROGRAMPARAMETER4DNVPROC) (GLenum target, GLuint index, GLdouble x, GLdouble y, GLdouble z, GLdouble w); typedef void (APIENTRYP PFNGLPROGRAMPARAMETER4DVNVPROC) (GLenum target, GLuint index, const GLdouble *v); typedef void (APIENTRYP PFNGLPROGRAMPARAMETER4FNVPROC) (GLenum target, GLuint index, GLfloat x, GLfloat y, GLfloat z, GLfloat w); typedef void (APIENTRYP PFNGLPROGRAMPARAMETER4FVNVPROC) (GLenum target, GLuint index, const GLfloat *v); typedef void (APIENTRYP PFNGLPROGRAMPARAMETERS4DVNVPROC) (GLenum target, GLuint index, GLsizei count, const GLdouble *v); typedef void (APIENTRYP PFNGLPROGRAMPARAMETERS4FVNVPROC) (GLenum target, GLuint index, GLsizei count, const GLfloat *v); typedef void (APIENTRYP PFNGLREQUESTRESIDENTPROGRAMSNVPROC) (GLsizei n, const GLuint *programs); typedef void (APIENTRYP PFNGLTRACKMATRIXNVPROC) (GLenum target, GLuint address, GLenum matrix, GLenum transform); typedef void (APIENTRYP PFNGLVERTEXATTRIBPOINTERNVPROC) (GLuint index, GLint fsize, GLenum type, GLsizei stride, const void *pointer); typedef void (APIENTRYP PFNGLVERTEXATTRIB1DNVPROC) (GLuint index, GLdouble x); typedef void (APIENTRYP PFNGLVERTEXATTRIB1DVNVPROC) (GLuint index, const GLdouble *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB1FNVPROC) (GLuint index, GLfloat x); typedef void (APIENTRYP PFNGLVERTEXATTRIB1FVNVPROC) (GLuint index, const GLfloat *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB1SNVPROC) (GLuint index, GLshort x); typedef void (APIENTRYP PFNGLVERTEXATTRIB1SVNVPROC) (GLuint index, const GLshort *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB2DNVPROC) (GLuint index, GLdouble x, GLdouble y); typedef void (APIENTRYP PFNGLVERTEXATTRIB2DVNVPROC) (GLuint index, const GLdouble *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB2FNVPROC) (GLuint index, GLfloat x, GLfloat y); typedef void (APIENTRYP PFNGLVERTEXATTRIB2FVNVPROC) (GLuint index, const GLfloat *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB2SNVPROC) (GLuint index, GLshort x, GLshort y); typedef void (APIENTRYP PFNGLVERTEXATTRIB2SVNVPROC) (GLuint index, const GLshort *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB3DNVPROC) (GLuint index, GLdouble x, GLdouble y, GLdouble z); typedef void (APIENTRYP PFNGLVERTEXATTRIB3DVNVPROC) (GLuint index, const GLdouble *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB3FNVPROC) (GLuint index, GLfloat x, GLfloat y, GLfloat z); typedef void (APIENTRYP PFNGLVERTEXATTRIB3FVNVPROC) (GLuint index, const GLfloat *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB3SNVPROC) (GLuint index, GLshort x, GLshort y, GLshort z); typedef void (APIENTRYP PFNGLVERTEXATTRIB3SVNVPROC) (GLuint index, const GLshort *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB4DNVPROC) (GLuint index, GLdouble x, GLdouble y, GLdouble z, GLdouble w); typedef void (APIENTRYP PFNGLVERTEXATTRIB4DVNVPROC) (GLuint index, const GLdouble *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB4FNVPROC) (GLuint index, GLfloat x, GLfloat y, GLfloat z, GLfloat w); typedef void (APIENTRYP PFNGLVERTEXATTRIB4FVNVPROC) (GLuint index, const GLfloat *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB4SNVPROC) (GLuint index, GLshort x, GLshort y, GLshort z, GLshort w); typedef void (APIENTRYP PFNGLVERTEXATTRIB4SVNVPROC) (GLuint index, const GLshort *v); typedef void (APIENTRYP PFNGLVERTEXATTRIB4UBNVPROC) (GLuint index, GLubyte x, GLubyte y, GLubyte z, GLubyte w); typedef void (APIENTRYP PFNGLVERTEXATTRIB4UBVNVPROC) (GLuint index, const GLubyte *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBS1DVNVPROC) (GLuint index, GLsizei count, const GLdouble *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBS1FVNVPROC) (GLuint index, GLsizei count, const GLfloat *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBS1SVNVPROC) (GLuint index, GLsizei count, const GLshort *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBS2DVNVPROC) (GLuint index, GLsizei count, const GLdouble *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBS2FVNVPROC) (GLuint index, GLsizei count, const GLfloat *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBS2SVNVPROC) (GLuint index, GLsizei count, const GLshort *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBS3DVNVPROC) (GLuint index, GLsizei count, const GLdouble *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBS3FVNVPROC) (GLuint index, GLsizei count, const GLfloat *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBS3SVNVPROC) (GLuint index, GLsizei count, const GLshort *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBS4DVNVPROC) (GLuint index, GLsizei count, const GLdouble *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBS4FVNVPROC) (GLuint index, GLsizei count, const GLfloat *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBS4SVNVPROC) (GLuint index, GLsizei count, const GLshort *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBS4UBVNVPROC) (GLuint index, GLsizei count, const GLubyte *v); #ifdef GL_GLEXT_PROTOTYPES GLAPI GLboolean APIENTRY glAreProgramsResidentNV (GLsizei n, const GLuint *programs, GLboolean *residences); GLAPI void APIENTRY glBindProgramNV (GLenum target, GLuint id); GLAPI void APIENTRY glDeleteProgramsNV (GLsizei n, const GLuint *programs); GLAPI void APIENTRY glExecuteProgramNV (GLenum target, GLuint id, const GLfloat *params); GLAPI void APIENTRY glGenProgramsNV (GLsizei n, GLuint *programs); GLAPI void APIENTRY glGetProgramParameterdvNV (GLenum target, GLuint index, GLenum pname, GLdouble *params); GLAPI void APIENTRY glGetProgramParameterfvNV (GLenum target, GLuint index, GLenum pname, GLfloat *params); GLAPI void APIENTRY glGetProgramivNV (GLuint id, GLenum pname, GLint *params); GLAPI void APIENTRY glGetProgramStringNV (GLuint id, GLenum pname, GLubyte *program); GLAPI void APIENTRY glGetTrackMatrixivNV (GLenum target, GLuint address, GLenum pname, GLint *params); GLAPI void APIENTRY glGetVertexAttribdvNV (GLuint index, GLenum pname, GLdouble *params); GLAPI void APIENTRY glGetVertexAttribfvNV (GLuint index, GLenum pname, GLfloat *params); GLAPI void APIENTRY glGetVertexAttribivNV (GLuint index, GLenum pname, GLint *params); GLAPI void APIENTRY glGetVertexAttribPointervNV (GLuint index, GLenum pname, void **pointer); GLAPI GLboolean APIENTRY glIsProgramNV (GLuint id); GLAPI void APIENTRY glLoadProgramNV (GLenum target, GLuint id, GLsizei len, const GLubyte *program); GLAPI void APIENTRY glProgramParameter4dNV (GLenum target, GLuint index, GLdouble x, GLdouble y, GLdouble z, GLdouble w); GLAPI void APIENTRY glProgramParameter4dvNV (GLenum target, GLuint index, const GLdouble *v); GLAPI void APIENTRY glProgramParameter4fNV (GLenum target, GLuint index, GLfloat x, GLfloat y, GLfloat z, GLfloat w); GLAPI void APIENTRY glProgramParameter4fvNV (GLenum target, GLuint index, const GLfloat *v); GLAPI void APIENTRY glProgramParameters4dvNV (GLenum target, GLuint index, GLsizei count, const GLdouble *v); GLAPI void APIENTRY glProgramParameters4fvNV (GLenum target, GLuint index, GLsizei count, const GLfloat *v); GLAPI void APIENTRY glRequestResidentProgramsNV (GLsizei n, const GLuint *programs); GLAPI void APIENTRY glTrackMatrixNV (GLenum target, GLuint address, GLenum matrix, GLenum transform); GLAPI void APIENTRY glVertexAttribPointerNV (GLuint index, GLint fsize, GLenum type, GLsizei stride, const void *pointer); GLAPI void APIENTRY glVertexAttrib1dNV (GLuint index, GLdouble x); GLAPI void APIENTRY glVertexAttrib1dvNV (GLuint index, const GLdouble *v); GLAPI void APIENTRY glVertexAttrib1fNV (GLuint index, GLfloat x); GLAPI void APIENTRY glVertexAttrib1fvNV (GLuint index, const GLfloat *v); GLAPI void APIENTRY glVertexAttrib1sNV (GLuint index, GLshort x); GLAPI void APIENTRY glVertexAttrib1svNV (GLuint index, const GLshort *v); GLAPI void APIENTRY glVertexAttrib2dNV (GLuint index, GLdouble x, GLdouble y); GLAPI void APIENTRY glVertexAttrib2dvNV (GLuint index, const GLdouble *v); GLAPI void APIENTRY glVertexAttrib2fNV (GLuint index, GLfloat x, GLfloat y); GLAPI void APIENTRY glVertexAttrib2fvNV (GLuint index, const GLfloat *v); GLAPI void APIENTRY glVertexAttrib2sNV (GLuint index, GLshort x, GLshort y); GLAPI void APIENTRY glVertexAttrib2svNV (GLuint index, const GLshort *v); GLAPI void APIENTRY glVertexAttrib3dNV (GLuint index, GLdouble x, GLdouble y, GLdouble z); GLAPI void APIENTRY glVertexAttrib3dvNV (GLuint index, const GLdouble *v); GLAPI void APIENTRY glVertexAttrib3fNV (GLuint index, GLfloat x, GLfloat y, GLfloat z); GLAPI void APIENTRY glVertexAttrib3fvNV (GLuint index, const GLfloat *v); GLAPI void APIENTRY glVertexAttrib3sNV (GLuint index, GLshort x, GLshort y, GLshort z); GLAPI void APIENTRY glVertexAttrib3svNV (GLuint index, const GLshort *v); GLAPI void APIENTRY glVertexAttrib4dNV (GLuint index, GLdouble x, GLdouble y, GLdouble z, GLdouble w); GLAPI void APIENTRY glVertexAttrib4dvNV (GLuint index, const GLdouble *v); GLAPI void APIENTRY glVertexAttrib4fNV (GLuint index, GLfloat x, GLfloat y, GLfloat z, GLfloat w); GLAPI void APIENTRY glVertexAttrib4fvNV (GLuint index, const GLfloat *v); GLAPI void APIENTRY glVertexAttrib4sNV (GLuint index, GLshort x, GLshort y, GLshort z, GLshort w); GLAPI void APIENTRY glVertexAttrib4svNV (GLuint index, const GLshort *v); GLAPI void APIENTRY glVertexAttrib4ubNV (GLuint index, GLubyte x, GLubyte y, GLubyte z, GLubyte w); GLAPI void APIENTRY glVertexAttrib4ubvNV (GLuint index, const GLubyte *v); GLAPI void APIENTRY glVertexAttribs1dvNV (GLuint index, GLsizei count, const GLdouble *v); GLAPI void APIENTRY glVertexAttribs1fvNV (GLuint index, GLsizei count, const GLfloat *v); GLAPI void APIENTRY glVertexAttribs1svNV (GLuint index, GLsizei count, const GLshort *v); GLAPI void APIENTRY glVertexAttribs2dvNV (GLuint index, GLsizei count, const GLdouble *v); GLAPI void APIENTRY glVertexAttribs2fvNV (GLuint index, GLsizei count, const GLfloat *v); GLAPI void APIENTRY glVertexAttribs2svNV (GLuint index, GLsizei count, const GLshort *v); GLAPI void APIENTRY glVertexAttribs3dvNV (GLuint index, GLsizei count, const GLdouble *v); GLAPI void APIENTRY glVertexAttribs3fvNV (GLuint index, GLsizei count, const GLfloat *v); GLAPI void APIENTRY glVertexAttribs3svNV (GLuint index, GLsizei count, const GLshort *v); GLAPI void APIENTRY glVertexAttribs4dvNV (GLuint index, GLsizei count, const GLdouble *v); GLAPI void APIENTRY glVertexAttribs4fvNV (GLuint index, GLsizei count, const GLfloat *v); GLAPI void APIENTRY glVertexAttribs4svNV (GLuint index, GLsizei count, const GLshort *v); GLAPI void APIENTRY glVertexAttribs4ubvNV (GLuint index, GLsizei count, const GLubyte *v); #endif #endif /* GL_NV_vertex_program */ #ifndef GL_NV_vertex_program1_1 #define GL_NV_vertex_program1_1 1 #endif /* GL_NV_vertex_program1_1 */ #ifndef GL_NV_vertex_program2 #define GL_NV_vertex_program2 1 #endif /* GL_NV_vertex_program2 */ #ifndef GL_NV_vertex_program2_option #define GL_NV_vertex_program2_option 1 #endif /* GL_NV_vertex_program2_option */ #ifndef GL_NV_vertex_program3 #define GL_NV_vertex_program3 1 #endif /* GL_NV_vertex_program3 */ #ifndef GL_NV_vertex_program4 #define GL_NV_vertex_program4 1 #define GL_VERTEX_ATTRIB_ARRAY_INTEGER_NV 0x88FD typedef void (APIENTRYP PFNGLVERTEXATTRIBI1IEXTPROC) (GLuint index, GLint x); typedef void (APIENTRYP PFNGLVERTEXATTRIBI2IEXTPROC) (GLuint index, GLint x, GLint y); typedef void (APIENTRYP PFNGLVERTEXATTRIBI3IEXTPROC) (GLuint index, GLint x, GLint y, GLint z); typedef void (APIENTRYP PFNGLVERTEXATTRIBI4IEXTPROC) (GLuint index, GLint x, GLint y, GLint z, GLint w); typedef void (APIENTRYP PFNGLVERTEXATTRIBI1UIEXTPROC) (GLuint index, GLuint x); typedef void (APIENTRYP PFNGLVERTEXATTRIBI2UIEXTPROC) (GLuint index, GLuint x, GLuint y); typedef void (APIENTRYP PFNGLVERTEXATTRIBI3UIEXTPROC) (GLuint index, GLuint x, GLuint y, GLuint z); typedef void (APIENTRYP PFNGLVERTEXATTRIBI4UIEXTPROC) (GLuint index, GLuint x, GLuint y, GLuint z, GLuint w); typedef void (APIENTRYP PFNGLVERTEXATTRIBI1IVEXTPROC) (GLuint index, const GLint *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBI2IVEXTPROC) (GLuint index, const GLint *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBI3IVEXTPROC) (GLuint index, const GLint *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBI4IVEXTPROC) (GLuint index, const GLint *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBI1UIVEXTPROC) (GLuint index, const GLuint *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBI2UIVEXTPROC) (GLuint index, const GLuint *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBI3UIVEXTPROC) (GLuint index, const GLuint *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBI4UIVEXTPROC) (GLuint index, const GLuint *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBI4BVEXTPROC) (GLuint index, const GLbyte *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBI4SVEXTPROC) (GLuint index, const GLshort *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBI4UBVEXTPROC) (GLuint index, const GLubyte *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBI4USVEXTPROC) (GLuint index, const GLushort *v); typedef void (APIENTRYP PFNGLVERTEXATTRIBIPOINTEREXTPROC) (GLuint index, GLint size, GLenum type, GLsizei stride, const void *pointer); typedef void (APIENTRYP PFNGLGETVERTEXATTRIBIIVEXTPROC) (GLuint index, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGETVERTEXATTRIBIUIVEXTPROC) (GLuint index, GLenum pname, GLuint *params); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glVertexAttribI1iEXT (GLuint index, GLint x); GLAPI void APIENTRY glVertexAttribI2iEXT (GLuint index, GLint x, GLint y); GLAPI void APIENTRY glVertexAttribI3iEXT (GLuint index, GLint x, GLint y, GLint z); GLAPI void APIENTRY glVertexAttribI4iEXT (GLuint index, GLint x, GLint y, GLint z, GLint w); GLAPI void APIENTRY glVertexAttribI1uiEXT (GLuint index, GLuint x); GLAPI void APIENTRY glVertexAttribI2uiEXT (GLuint index, GLuint x, GLuint y); GLAPI void APIENTRY glVertexAttribI3uiEXT (GLuint index, GLuint x, GLuint y, GLuint z); GLAPI void APIENTRY glVertexAttribI4uiEXT (GLuint index, GLuint x, GLuint y, GLuint z, GLuint w); GLAPI void APIENTRY glVertexAttribI1ivEXT (GLuint index, const GLint *v); GLAPI void APIENTRY glVertexAttribI2ivEXT (GLuint index, const GLint *v); GLAPI void APIENTRY glVertexAttribI3ivEXT (GLuint index, const GLint *v); GLAPI void APIENTRY glVertexAttribI4ivEXT (GLuint index, const GLint *v); GLAPI void APIENTRY glVertexAttribI1uivEXT (GLuint index, const GLuint *v); GLAPI void APIENTRY glVertexAttribI2uivEXT (GLuint index, const GLuint *v); GLAPI void APIENTRY glVertexAttribI3uivEXT (GLuint index, const GLuint *v); GLAPI void APIENTRY glVertexAttribI4uivEXT (GLuint index, const GLuint *v); GLAPI void APIENTRY glVertexAttribI4bvEXT (GLuint index, const GLbyte *v); GLAPI void APIENTRY glVertexAttribI4svEXT (GLuint index, const GLshort *v); GLAPI void APIENTRY glVertexAttribI4ubvEXT (GLuint index, const GLubyte *v); GLAPI void APIENTRY glVertexAttribI4usvEXT (GLuint index, const GLushort *v); GLAPI void APIENTRY glVertexAttribIPointerEXT (GLuint index, GLint size, GLenum type, GLsizei stride, const void *pointer); GLAPI void APIENTRY glGetVertexAttribIivEXT (GLuint index, GLenum pname, GLint *params); GLAPI void APIENTRY glGetVertexAttribIuivEXT (GLuint index, GLenum pname, GLuint *params); #endif #endif /* GL_NV_vertex_program4 */ #ifndef GL_NV_video_capture #define GL_NV_video_capture 1 #define GL_VIDEO_BUFFER_NV 0x9020 #define GL_VIDEO_BUFFER_BINDING_NV 0x9021 #define GL_FIELD_UPPER_NV 0x9022 #define GL_FIELD_LOWER_NV 0x9023 #define GL_NUM_VIDEO_CAPTURE_STREAMS_NV 0x9024 #define GL_NEXT_VIDEO_CAPTURE_BUFFER_STATUS_NV 0x9025 #define GL_VIDEO_CAPTURE_TO_422_SUPPORTED_NV 0x9026 #define GL_LAST_VIDEO_CAPTURE_STATUS_NV 0x9027 #define GL_VIDEO_BUFFER_PITCH_NV 0x9028 #define GL_VIDEO_COLOR_CONVERSION_MATRIX_NV 0x9029 #define GL_VIDEO_COLOR_CONVERSION_MAX_NV 0x902A #define GL_VIDEO_COLOR_CONVERSION_MIN_NV 0x902B #define GL_VIDEO_COLOR_CONVERSION_OFFSET_NV 0x902C #define GL_VIDEO_BUFFER_INTERNAL_FORMAT_NV 0x902D #define GL_PARTIAL_SUCCESS_NV 0x902E #define GL_SUCCESS_NV 0x902F #define GL_FAILURE_NV 0x9030 #define GL_YCBYCR8_422_NV 0x9031 #define GL_YCBAYCR8A_4224_NV 0x9032 #define GL_Z6Y10Z6CB10Z6Y10Z6CR10_422_NV 0x9033 #define GL_Z6Y10Z6CB10Z6A10Z6Y10Z6CR10Z6A10_4224_NV 0x9034 #define GL_Z4Y12Z4CB12Z4Y12Z4CR12_422_NV 0x9035 #define GL_Z4Y12Z4CB12Z4A12Z4Y12Z4CR12Z4A12_4224_NV 0x9036 #define GL_Z4Y12Z4CB12Z4CR12_444_NV 0x9037 #define GL_VIDEO_CAPTURE_FRAME_WIDTH_NV 0x9038 #define GL_VIDEO_CAPTURE_FRAME_HEIGHT_NV 0x9039 #define GL_VIDEO_CAPTURE_FIELD_UPPER_HEIGHT_NV 0x903A #define GL_VIDEO_CAPTURE_FIELD_LOWER_HEIGHT_NV 0x903B #define GL_VIDEO_CAPTURE_SURFACE_ORIGIN_NV 0x903C typedef void (APIENTRYP PFNGLBEGINVIDEOCAPTURENVPROC) (GLuint video_capture_slot); typedef void (APIENTRYP PFNGLBINDVIDEOCAPTURESTREAMBUFFERNVPROC) (GLuint video_capture_slot, GLuint stream, GLenum frame_region, GLintptrARB offset); typedef void (APIENTRYP PFNGLBINDVIDEOCAPTURESTREAMTEXTURENVPROC) (GLuint video_capture_slot, GLuint stream, GLenum frame_region, GLenum target, GLuint texture); typedef void (APIENTRYP PFNGLENDVIDEOCAPTURENVPROC) (GLuint video_capture_slot); typedef void (APIENTRYP PFNGLGETVIDEOCAPTUREIVNVPROC) (GLuint video_capture_slot, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGETVIDEOCAPTURESTREAMIVNVPROC) (GLuint video_capture_slot, GLuint stream, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGETVIDEOCAPTURESTREAMFVNVPROC) (GLuint video_capture_slot, GLuint stream, GLenum pname, GLfloat *params); typedef void (APIENTRYP PFNGLGETVIDEOCAPTURESTREAMDVNVPROC) (GLuint video_capture_slot, GLuint stream, GLenum pname, GLdouble *params); typedef GLenum (APIENTRYP PFNGLVIDEOCAPTURENVPROC) (GLuint video_capture_slot, GLuint *sequence_num, GLuint64EXT *capture_time); typedef void (APIENTRYP PFNGLVIDEOCAPTURESTREAMPARAMETERIVNVPROC) (GLuint video_capture_slot, GLuint stream, GLenum pname, const GLint *params); typedef void (APIENTRYP PFNGLVIDEOCAPTURESTREAMPARAMETERFVNVPROC) (GLuint video_capture_slot, GLuint stream, GLenum pname, const GLfloat *params); typedef void (APIENTRYP PFNGLVIDEOCAPTURESTREAMPARAMETERDVNVPROC) (GLuint video_capture_slot, GLuint stream, GLenum pname, const GLdouble *params); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glBeginVideoCaptureNV (GLuint video_capture_slot); GLAPI void APIENTRY glBindVideoCaptureStreamBufferNV (GLuint video_capture_slot, GLuint stream, GLenum frame_region, GLintptrARB offset); GLAPI void APIENTRY glBindVideoCaptureStreamTextureNV (GLuint video_capture_slot, GLuint stream, GLenum frame_region, GLenum target, GLuint texture); GLAPI void APIENTRY glEndVideoCaptureNV (GLuint video_capture_slot); GLAPI void APIENTRY glGetVideoCaptureivNV (GLuint video_capture_slot, GLenum pname, GLint *params); GLAPI void APIENTRY glGetVideoCaptureStreamivNV (GLuint video_capture_slot, GLuint stream, GLenum pname, GLint *params); GLAPI void APIENTRY glGetVideoCaptureStreamfvNV (GLuint video_capture_slot, GLuint stream, GLenum pname, GLfloat *params); GLAPI void APIENTRY glGetVideoCaptureStreamdvNV (GLuint video_capture_slot, GLuint stream, GLenum pname, GLdouble *params); GLAPI GLenum APIENTRY glVideoCaptureNV (GLuint video_capture_slot, GLuint *sequence_num, GLuint64EXT *capture_time); GLAPI void APIENTRY glVideoCaptureStreamParameterivNV (GLuint video_capture_slot, GLuint stream, GLenum pname, const GLint *params); GLAPI void APIENTRY glVideoCaptureStreamParameterfvNV (GLuint video_capture_slot, GLuint stream, GLenum pname, const GLfloat *params); GLAPI void APIENTRY glVideoCaptureStreamParameterdvNV (GLuint video_capture_slot, GLuint stream, GLenum pname, const GLdouble *params); #endif #endif /* GL_NV_video_capture */ #ifndef GL_OML_interlace #define GL_OML_interlace 1 #define GL_INTERLACE_OML 0x8980 #define GL_INTERLACE_READ_OML 0x8981 #endif /* GL_OML_interlace */ #ifndef GL_OML_resample #define GL_OML_resample 1 #define GL_PACK_RESAMPLE_OML 0x8984 #define GL_UNPACK_RESAMPLE_OML 0x8985 #define GL_RESAMPLE_REPLICATE_OML 0x8986 #define GL_RESAMPLE_ZERO_FILL_OML 0x8987 #define GL_RESAMPLE_AVERAGE_OML 0x8988 #define GL_RESAMPLE_DECIMATE_OML 0x8989 #endif /* GL_OML_resample */ #ifndef GL_OML_subsample #define GL_OML_subsample 1 #define GL_FORMAT_SUBSAMPLE_24_24_OML 0x8982 #define GL_FORMAT_SUBSAMPLE_244_244_OML 0x8983 #endif /* GL_OML_subsample */ #ifndef GL_PGI_misc_hints #define GL_PGI_misc_hints 1 #define GL_PREFER_DOUBLEBUFFER_HINT_PGI 0x1A1F8 #define GL_CONSERVE_MEMORY_HINT_PGI 0x1A1FD #define GL_RECLAIM_MEMORY_HINT_PGI 0x1A1FE #define GL_NATIVE_GRAPHICS_HANDLE_PGI 0x1A202 #define GL_NATIVE_GRAPHICS_BEGIN_HINT_PGI 0x1A203 #define GL_NATIVE_GRAPHICS_END_HINT_PGI 0x1A204 #define GL_ALWAYS_FAST_HINT_PGI 0x1A20C #define GL_ALWAYS_SOFT_HINT_PGI 0x1A20D #define GL_ALLOW_DRAW_OBJ_HINT_PGI 0x1A20E #define GL_ALLOW_DRAW_WIN_HINT_PGI 0x1A20F #define GL_ALLOW_DRAW_FRG_HINT_PGI 0x1A210 #define GL_ALLOW_DRAW_MEM_HINT_PGI 0x1A211 #define GL_STRICT_DEPTHFUNC_HINT_PGI 0x1A216 #define GL_STRICT_LIGHTING_HINT_PGI 0x1A217 #define GL_STRICT_SCISSOR_HINT_PGI 0x1A218 #define GL_FULL_STIPPLE_HINT_PGI 0x1A219 #define GL_CLIP_NEAR_HINT_PGI 0x1A220 #define GL_CLIP_FAR_HINT_PGI 0x1A221 #define GL_WIDE_LINE_HINT_PGI 0x1A222 #define GL_BACK_NORMALS_HINT_PGI 0x1A223 typedef void (APIENTRYP PFNGLHINTPGIPROC) (GLenum target, GLint mode); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glHintPGI (GLenum target, GLint mode); #endif #endif /* GL_PGI_misc_hints */ #ifndef GL_PGI_vertex_hints #define GL_PGI_vertex_hints 1 #define GL_VERTEX_DATA_HINT_PGI 0x1A22A #define GL_VERTEX_CONSISTENT_HINT_PGI 0x1A22B #define GL_MATERIAL_SIDE_HINT_PGI 0x1A22C #define GL_MAX_VERTEX_HINT_PGI 0x1A22D #define GL_COLOR3_BIT_PGI 0x00010000 #define GL_COLOR4_BIT_PGI 0x00020000 #define GL_EDGEFLAG_BIT_PGI 0x00040000 #define GL_INDEX_BIT_PGI 0x00080000 #define GL_MAT_AMBIENT_BIT_PGI 0x00100000 #define GL_MAT_AMBIENT_AND_DIFFUSE_BIT_PGI 0x00200000 #define GL_MAT_DIFFUSE_BIT_PGI 0x00400000 #define GL_MAT_EMISSION_BIT_PGI 0x00800000 #define GL_MAT_COLOR_INDEXES_BIT_PGI 0x01000000 #define GL_MAT_SHININESS_BIT_PGI 0x02000000 #define GL_MAT_SPECULAR_BIT_PGI 0x04000000 #define GL_NORMAL_BIT_PGI 0x08000000 #define GL_TEXCOORD1_BIT_PGI 0x10000000 #define GL_TEXCOORD2_BIT_PGI 0x20000000 #define GL_TEXCOORD3_BIT_PGI 0x40000000 #define GL_TEXCOORD4_BIT_PGI 0x80000000 #define GL_VERTEX23_BIT_PGI 0x00000004 #define GL_VERTEX4_BIT_PGI 0x00000008 #endif /* GL_PGI_vertex_hints */ #ifndef GL_REND_screen_coordinates #define GL_REND_screen_coordinates 1 #define GL_SCREEN_COORDINATES_REND 0x8490 #define GL_INVERTED_SCREEN_W_REND 0x8491 #endif /* GL_REND_screen_coordinates */ #ifndef GL_S3_s3tc #define GL_S3_s3tc 1 #define GL_RGB_S3TC 0x83A0 #define GL_RGB4_S3TC 0x83A1 #define GL_RGBA_S3TC 0x83A2 #define GL_RGBA4_S3TC 0x83A3 #define GL_RGBA_DXT5_S3TC 0x83A4 #define GL_RGBA4_DXT5_S3TC 0x83A5 #endif /* GL_S3_s3tc */ #ifndef GL_SGIS_detail_texture #define GL_SGIS_detail_texture 1 #define GL_DETAIL_TEXTURE_2D_SGIS 0x8095 #define GL_DETAIL_TEXTURE_2D_BINDING_SGIS 0x8096 #define GL_LINEAR_DETAIL_SGIS 0x8097 #define GL_LINEAR_DETAIL_ALPHA_SGIS 0x8098 #define GL_LINEAR_DETAIL_COLOR_SGIS 0x8099 #define GL_DETAIL_TEXTURE_LEVEL_SGIS 0x809A #define GL_DETAIL_TEXTURE_MODE_SGIS 0x809B #define GL_DETAIL_TEXTURE_FUNC_POINTS_SGIS 0x809C typedef void (APIENTRYP PFNGLDETAILTEXFUNCSGISPROC) (GLenum target, GLsizei n, const GLfloat *points); typedef void (APIENTRYP PFNGLGETDETAILTEXFUNCSGISPROC) (GLenum target, GLfloat *points); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glDetailTexFuncSGIS (GLenum target, GLsizei n, const GLfloat *points); GLAPI void APIENTRY glGetDetailTexFuncSGIS (GLenum target, GLfloat *points); #endif #endif /* GL_SGIS_detail_texture */ #ifndef GL_SGIS_fog_function #define GL_SGIS_fog_function 1 #define GL_FOG_FUNC_SGIS 0x812A #define GL_FOG_FUNC_POINTS_SGIS 0x812B #define GL_MAX_FOG_FUNC_POINTS_SGIS 0x812C typedef void (APIENTRYP PFNGLFOGFUNCSGISPROC) (GLsizei n, const GLfloat *points); typedef void (APIENTRYP PFNGLGETFOGFUNCSGISPROC) (GLfloat *points); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glFogFuncSGIS (GLsizei n, const GLfloat *points); GLAPI void APIENTRY glGetFogFuncSGIS (GLfloat *points); #endif #endif /* GL_SGIS_fog_function */ #ifndef GL_SGIS_generate_mipmap #define GL_SGIS_generate_mipmap 1 #define GL_GENERATE_MIPMAP_SGIS 0x8191 #define GL_GENERATE_MIPMAP_HINT_SGIS 0x8192 #endif /* GL_SGIS_generate_mipmap */ #ifndef GL_SGIS_multisample #define GL_SGIS_multisample 1 #define GL_MULTISAMPLE_SGIS 0x809D #define GL_SAMPLE_ALPHA_TO_MASK_SGIS 0x809E #define GL_SAMPLE_ALPHA_TO_ONE_SGIS 0x809F #define GL_SAMPLE_MASK_SGIS 0x80A0 #define GL_1PASS_SGIS 0x80A1 #define GL_2PASS_0_SGIS 0x80A2 #define GL_2PASS_1_SGIS 0x80A3 #define GL_4PASS_0_SGIS 0x80A4 #define GL_4PASS_1_SGIS 0x80A5 #define GL_4PASS_2_SGIS 0x80A6 #define GL_4PASS_3_SGIS 0x80A7 #define GL_SAMPLE_BUFFERS_SGIS 0x80A8 #define GL_SAMPLES_SGIS 0x80A9 #define GL_SAMPLE_MASK_VALUE_SGIS 0x80AA #define GL_SAMPLE_MASK_INVERT_SGIS 0x80AB #define GL_SAMPLE_PATTERN_SGIS 0x80AC typedef void (APIENTRYP PFNGLSAMPLEMASKSGISPROC) (GLclampf value, GLboolean invert); typedef void (APIENTRYP PFNGLSAMPLEPATTERNSGISPROC) (GLenum pattern); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glSampleMaskSGIS (GLclampf value, GLboolean invert); GLAPI void APIENTRY glSamplePatternSGIS (GLenum pattern); #endif #endif /* GL_SGIS_multisample */ #ifndef GL_SGIS_pixel_texture #define GL_SGIS_pixel_texture 1 #define GL_PIXEL_TEXTURE_SGIS 0x8353 #define GL_PIXEL_FRAGMENT_RGB_SOURCE_SGIS 0x8354 #define GL_PIXEL_FRAGMENT_ALPHA_SOURCE_SGIS 0x8355 #define GL_PIXEL_GROUP_COLOR_SGIS 0x8356 typedef void (APIENTRYP PFNGLPIXELTEXGENPARAMETERISGISPROC) (GLenum pname, GLint param); typedef void (APIENTRYP PFNGLPIXELTEXGENPARAMETERIVSGISPROC) (GLenum pname, const GLint *params); typedef void (APIENTRYP PFNGLPIXELTEXGENPARAMETERFSGISPROC) (GLenum pname, GLfloat param); typedef void (APIENTRYP PFNGLPIXELTEXGENPARAMETERFVSGISPROC) (GLenum pname, const GLfloat *params); typedef void (APIENTRYP PFNGLGETPIXELTEXGENPARAMETERIVSGISPROC) (GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGETPIXELTEXGENPARAMETERFVSGISPROC) (GLenum pname, GLfloat *params); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glPixelTexGenParameteriSGIS (GLenum pname, GLint param); GLAPI void APIENTRY glPixelTexGenParameterivSGIS (GLenum pname, const GLint *params); GLAPI void APIENTRY glPixelTexGenParameterfSGIS (GLenum pname, GLfloat param); GLAPI void APIENTRY glPixelTexGenParameterfvSGIS (GLenum pname, const GLfloat *params); GLAPI void APIENTRY glGetPixelTexGenParameterivSGIS (GLenum pname, GLint *params); GLAPI void APIENTRY glGetPixelTexGenParameterfvSGIS (GLenum pname, GLfloat *params); #endif #endif /* GL_SGIS_pixel_texture */ #ifndef GL_SGIS_point_line_texgen #define GL_SGIS_point_line_texgen 1 #define GL_EYE_DISTANCE_TO_POINT_SGIS 0x81F0 #define GL_OBJECT_DISTANCE_TO_POINT_SGIS 0x81F1 #define GL_EYE_DISTANCE_TO_LINE_SGIS 0x81F2 #define GL_OBJECT_DISTANCE_TO_LINE_SGIS 0x81F3 #define GL_EYE_POINT_SGIS 0x81F4 #define GL_OBJECT_POINT_SGIS 0x81F5 #define GL_EYE_LINE_SGIS 0x81F6 #define GL_OBJECT_LINE_SGIS 0x81F7 #endif /* GL_SGIS_point_line_texgen */ #ifndef GL_SGIS_point_parameters #define GL_SGIS_point_parameters 1 #define GL_POINT_SIZE_MIN_SGIS 0x8126 #define GL_POINT_SIZE_MAX_SGIS 0x8127 #define GL_POINT_FADE_THRESHOLD_SIZE_SGIS 0x8128 #define GL_DISTANCE_ATTENUATION_SGIS 0x8129 typedef void (APIENTRYP PFNGLPOINTPARAMETERFSGISPROC) (GLenum pname, GLfloat param); typedef void (APIENTRYP PFNGLPOINTPARAMETERFVSGISPROC) (GLenum pname, const GLfloat *params); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glPointParameterfSGIS (GLenum pname, GLfloat param); GLAPI void APIENTRY glPointParameterfvSGIS (GLenum pname, const GLfloat *params); #endif #endif /* GL_SGIS_point_parameters */ #ifndef GL_SGIS_sharpen_texture #define GL_SGIS_sharpen_texture 1 #define GL_LINEAR_SHARPEN_SGIS 0x80AD #define GL_LINEAR_SHARPEN_ALPHA_SGIS 0x80AE #define GL_LINEAR_SHARPEN_COLOR_SGIS 0x80AF #define GL_SHARPEN_TEXTURE_FUNC_POINTS_SGIS 0x80B0 typedef void (APIENTRYP PFNGLSHARPENTEXFUNCSGISPROC) (GLenum target, GLsizei n, const GLfloat *points); typedef void (APIENTRYP PFNGLGETSHARPENTEXFUNCSGISPROC) (GLenum target, GLfloat *points); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glSharpenTexFuncSGIS (GLenum target, GLsizei n, const GLfloat *points); GLAPI void APIENTRY glGetSharpenTexFuncSGIS (GLenum target, GLfloat *points); #endif #endif /* GL_SGIS_sharpen_texture */ #ifndef GL_SGIS_texture4D #define GL_SGIS_texture4D 1 #define GL_PACK_SKIP_VOLUMES_SGIS 0x8130 #define GL_PACK_IMAGE_DEPTH_SGIS 0x8131 #define GL_UNPACK_SKIP_VOLUMES_SGIS 0x8132 #define GL_UNPACK_IMAGE_DEPTH_SGIS 0x8133 #define GL_TEXTURE_4D_SGIS 0x8134 #define GL_PROXY_TEXTURE_4D_SGIS 0x8135 #define GL_TEXTURE_4DSIZE_SGIS 0x8136 #define GL_TEXTURE_WRAP_Q_SGIS 0x8137 #define GL_MAX_4D_TEXTURE_SIZE_SGIS 0x8138 #define GL_TEXTURE_4D_BINDING_SGIS 0x814F typedef void (APIENTRYP PFNGLTEXIMAGE4DSGISPROC) (GLenum target, GLint level, GLenum internalformat, GLsizei width, GLsizei height, GLsizei depth, GLsizei size4d, GLint border, GLenum format, GLenum type, const void *pixels); typedef void (APIENTRYP PFNGLTEXSUBIMAGE4DSGISPROC) (GLenum target, GLint level, GLint xoffset, GLint yoffset, GLint zoffset, GLint woffset, GLsizei width, GLsizei height, GLsizei depth, GLsizei size4d, GLenum format, GLenum type, const void *pixels); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glTexImage4DSGIS (GLenum target, GLint level, GLenum internalformat, GLsizei width, GLsizei height, GLsizei depth, GLsizei size4d, GLint border, GLenum format, GLenum type, const void *pixels); GLAPI void APIENTRY glTexSubImage4DSGIS (GLenum target, GLint level, GLint xoffset, GLint yoffset, GLint zoffset, GLint woffset, GLsizei width, GLsizei height, GLsizei depth, GLsizei size4d, GLenum format, GLenum type, const void *pixels); #endif #endif /* GL_SGIS_texture4D */ #ifndef GL_SGIS_texture_border_clamp #define GL_SGIS_texture_border_clamp 1 #define GL_CLAMP_TO_BORDER_SGIS 0x812D #endif /* GL_SGIS_texture_border_clamp */ #ifndef GL_SGIS_texture_color_mask #define GL_SGIS_texture_color_mask 1 #define GL_TEXTURE_COLOR_WRITEMASK_SGIS 0x81EF typedef void (APIENTRYP PFNGLTEXTURECOLORMASKSGISPROC) (GLboolean red, GLboolean green, GLboolean blue, GLboolean alpha); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glTextureColorMaskSGIS (GLboolean red, GLboolean green, GLboolean blue, GLboolean alpha); #endif #endif /* GL_SGIS_texture_color_mask */ #ifndef GL_SGIS_texture_edge_clamp #define GL_SGIS_texture_edge_clamp 1 #define GL_CLAMP_TO_EDGE_SGIS 0x812F #endif /* GL_SGIS_texture_edge_clamp */ #ifndef GL_SGIS_texture_filter4 #define GL_SGIS_texture_filter4 1 #define GL_FILTER4_SGIS 0x8146 #define GL_TEXTURE_FILTER4_SIZE_SGIS 0x8147 typedef void (APIENTRYP PFNGLGETTEXFILTERFUNCSGISPROC) (GLenum target, GLenum filter, GLfloat *weights); typedef void (APIENTRYP PFNGLTEXFILTERFUNCSGISPROC) (GLenum target, GLenum filter, GLsizei n, const GLfloat *weights); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glGetTexFilterFuncSGIS (GLenum target, GLenum filter, GLfloat *weights); GLAPI void APIENTRY glTexFilterFuncSGIS (GLenum target, GLenum filter, GLsizei n, const GLfloat *weights); #endif #endif /* GL_SGIS_texture_filter4 */ #ifndef GL_SGIS_texture_lod #define GL_SGIS_texture_lod 1 #define GL_TEXTURE_MIN_LOD_SGIS 0x813A #define GL_TEXTURE_MAX_LOD_SGIS 0x813B #define GL_TEXTURE_BASE_LEVEL_SGIS 0x813C #define GL_TEXTURE_MAX_LEVEL_SGIS 0x813D #endif /* GL_SGIS_texture_lod */ #ifndef GL_SGIS_texture_select #define GL_SGIS_texture_select 1 #define GL_DUAL_ALPHA4_SGIS 0x8110 #define GL_DUAL_ALPHA8_SGIS 0x8111 #define GL_DUAL_ALPHA12_SGIS 0x8112 #define GL_DUAL_ALPHA16_SGIS 0x8113 #define GL_DUAL_LUMINANCE4_SGIS 0x8114 #define GL_DUAL_LUMINANCE8_SGIS 0x8115 #define GL_DUAL_LUMINANCE12_SGIS 0x8116 #define GL_DUAL_LUMINANCE16_SGIS 0x8117 #define GL_DUAL_INTENSITY4_SGIS 0x8118 #define GL_DUAL_INTENSITY8_SGIS 0x8119 #define GL_DUAL_INTENSITY12_SGIS 0x811A #define GL_DUAL_INTENSITY16_SGIS 0x811B #define GL_DUAL_LUMINANCE_ALPHA4_SGIS 0x811C #define GL_DUAL_LUMINANCE_ALPHA8_SGIS 0x811D #define GL_QUAD_ALPHA4_SGIS 0x811E #define GL_QUAD_ALPHA8_SGIS 0x811F #define GL_QUAD_LUMINANCE4_SGIS 0x8120 #define GL_QUAD_LUMINANCE8_SGIS 0x8121 #define GL_QUAD_INTENSITY4_SGIS 0x8122 #define GL_QUAD_INTENSITY8_SGIS 0x8123 #define GL_DUAL_TEXTURE_SELECT_SGIS 0x8124 #define GL_QUAD_TEXTURE_SELECT_SGIS 0x8125 #endif /* GL_SGIS_texture_select */ #ifndef GL_SGIX_async #define GL_SGIX_async 1 #define GL_ASYNC_MARKER_SGIX 0x8329 typedef void (APIENTRYP PFNGLASYNCMARKERSGIXPROC) (GLuint marker); typedef GLint (APIENTRYP PFNGLFINISHASYNCSGIXPROC) (GLuint *markerp); typedef GLint (APIENTRYP PFNGLPOLLASYNCSGIXPROC) (GLuint *markerp); typedef GLuint (APIENTRYP PFNGLGENASYNCMARKERSSGIXPROC) (GLsizei range); typedef void (APIENTRYP PFNGLDELETEASYNCMARKERSSGIXPROC) (GLuint marker, GLsizei range); typedef GLboolean (APIENTRYP PFNGLISASYNCMARKERSGIXPROC) (GLuint marker); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glAsyncMarkerSGIX (GLuint marker); GLAPI GLint APIENTRY glFinishAsyncSGIX (GLuint *markerp); GLAPI GLint APIENTRY glPollAsyncSGIX (GLuint *markerp); GLAPI GLuint APIENTRY glGenAsyncMarkersSGIX (GLsizei range); GLAPI void APIENTRY glDeleteAsyncMarkersSGIX (GLuint marker, GLsizei range); GLAPI GLboolean APIENTRY glIsAsyncMarkerSGIX (GLuint marker); #endif #endif /* GL_SGIX_async */ #ifndef GL_SGIX_async_histogram #define GL_SGIX_async_histogram 1 #define GL_ASYNC_HISTOGRAM_SGIX 0x832C #define GL_MAX_ASYNC_HISTOGRAM_SGIX 0x832D #endif /* GL_SGIX_async_histogram */ #ifndef GL_SGIX_async_pixel #define GL_SGIX_async_pixel 1 #define GL_ASYNC_TEX_IMAGE_SGIX 0x835C #define GL_ASYNC_DRAW_PIXELS_SGIX 0x835D #define GL_ASYNC_READ_PIXELS_SGIX 0x835E #define GL_MAX_ASYNC_TEX_IMAGE_SGIX 0x835F #define GL_MAX_ASYNC_DRAW_PIXELS_SGIX 0x8360 #define GL_MAX_ASYNC_READ_PIXELS_SGIX 0x8361 #endif /* GL_SGIX_async_pixel */ #ifndef GL_SGIX_blend_alpha_minmax #define GL_SGIX_blend_alpha_minmax 1 #define GL_ALPHA_MIN_SGIX 0x8320 #define GL_ALPHA_MAX_SGIX 0x8321 #endif /* GL_SGIX_blend_alpha_minmax */ #ifndef GL_SGIX_calligraphic_fragment #define GL_SGIX_calligraphic_fragment 1 #define GL_CALLIGRAPHIC_FRAGMENT_SGIX 0x8183 #endif /* GL_SGIX_calligraphic_fragment */ #ifndef GL_SGIX_clipmap #define GL_SGIX_clipmap 1 #define GL_LINEAR_CLIPMAP_LINEAR_SGIX 0x8170 #define GL_TEXTURE_CLIPMAP_CENTER_SGIX 0x8171 #define GL_TEXTURE_CLIPMAP_FRAME_SGIX 0x8172 #define GL_TEXTURE_CLIPMAP_OFFSET_SGIX 0x8173 #define GL_TEXTURE_CLIPMAP_VIRTUAL_DEPTH_SGIX 0x8174 #define GL_TEXTURE_CLIPMAP_LOD_OFFSET_SGIX 0x8175 #define GL_TEXTURE_CLIPMAP_DEPTH_SGIX 0x8176 #define GL_MAX_CLIPMAP_DEPTH_SGIX 0x8177 #define GL_MAX_CLIPMAP_VIRTUAL_DEPTH_SGIX 0x8178 #define GL_NEAREST_CLIPMAP_NEAREST_SGIX 0x844D #define GL_NEAREST_CLIPMAP_LINEAR_SGIX 0x844E #define GL_LINEAR_CLIPMAP_NEAREST_SGIX 0x844F #endif /* GL_SGIX_clipmap */ #ifndef GL_SGIX_convolution_accuracy #define GL_SGIX_convolution_accuracy 1 #define GL_CONVOLUTION_HINT_SGIX 0x8316 #endif /* GL_SGIX_convolution_accuracy */ #ifndef GL_SGIX_depth_pass_instrument #define GL_SGIX_depth_pass_instrument 1 #endif /* GL_SGIX_depth_pass_instrument */ #ifndef GL_SGIX_depth_texture #define GL_SGIX_depth_texture 1 #define GL_DEPTH_COMPONENT16_SGIX 0x81A5 #define GL_DEPTH_COMPONENT24_SGIX 0x81A6 #define GL_DEPTH_COMPONENT32_SGIX 0x81A7 #endif /* GL_SGIX_depth_texture */ #ifndef GL_SGIX_flush_raster #define GL_SGIX_flush_raster 1 typedef void (APIENTRYP PFNGLFLUSHRASTERSGIXPROC) (void); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glFlushRasterSGIX (void); #endif #endif /* GL_SGIX_flush_raster */ #ifndef GL_SGIX_fog_offset #define GL_SGIX_fog_offset 1 #define GL_FOG_OFFSET_SGIX 0x8198 #define GL_FOG_OFFSET_VALUE_SGIX 0x8199 #endif /* GL_SGIX_fog_offset */ #ifndef GL_SGIX_fragment_lighting #define GL_SGIX_fragment_lighting 1 #define GL_FRAGMENT_LIGHTING_SGIX 0x8400 #define GL_FRAGMENT_COLOR_MATERIAL_SGIX 0x8401 #define GL_FRAGMENT_COLOR_MATERIAL_FACE_SGIX 0x8402 #define GL_FRAGMENT_COLOR_MATERIAL_PARAMETER_SGIX 0x8403 #define GL_MAX_FRAGMENT_LIGHTS_SGIX 0x8404 #define GL_MAX_ACTIVE_LIGHTS_SGIX 0x8405 #define GL_CURRENT_RASTER_NORMAL_SGIX 0x8406 #define GL_LIGHT_ENV_MODE_SGIX 0x8407 #define GL_FRAGMENT_LIGHT_MODEL_LOCAL_VIEWER_SGIX 0x8408 #define GL_FRAGMENT_LIGHT_MODEL_TWO_SIDE_SGIX 0x8409 #define GL_FRAGMENT_LIGHT_MODEL_AMBIENT_SGIX 0x840A #define GL_FRAGMENT_LIGHT_MODEL_NORMAL_INTERPOLATION_SGIX 0x840B #define GL_FRAGMENT_LIGHT0_SGIX 0x840C #define GL_FRAGMENT_LIGHT1_SGIX 0x840D #define GL_FRAGMENT_LIGHT2_SGIX 0x840E #define GL_FRAGMENT_LIGHT3_SGIX 0x840F #define GL_FRAGMENT_LIGHT4_SGIX 0x8410 #define GL_FRAGMENT_LIGHT5_SGIX 0x8411 #define GL_FRAGMENT_LIGHT6_SGIX 0x8412 #define GL_FRAGMENT_LIGHT7_SGIX 0x8413 typedef void (APIENTRYP PFNGLFRAGMENTCOLORMATERIALSGIXPROC) (GLenum face, GLenum mode); typedef void (APIENTRYP PFNGLFRAGMENTLIGHTFSGIXPROC) (GLenum light, GLenum pname, GLfloat param); typedef void (APIENTRYP PFNGLFRAGMENTLIGHTFVSGIXPROC) (GLenum light, GLenum pname, const GLfloat *params); typedef void (APIENTRYP PFNGLFRAGMENTLIGHTISGIXPROC) (GLenum light, GLenum pname, GLint param); typedef void (APIENTRYP PFNGLFRAGMENTLIGHTIVSGIXPROC) (GLenum light, GLenum pname, const GLint *params); typedef void (APIENTRYP PFNGLFRAGMENTLIGHTMODELFSGIXPROC) (GLenum pname, GLfloat param); typedef void (APIENTRYP PFNGLFRAGMENTLIGHTMODELFVSGIXPROC) (GLenum pname, const GLfloat *params); typedef void (APIENTRYP PFNGLFRAGMENTLIGHTMODELISGIXPROC) (GLenum pname, GLint param); typedef void (APIENTRYP PFNGLFRAGMENTLIGHTMODELIVSGIXPROC) (GLenum pname, const GLint *params); typedef void (APIENTRYP PFNGLFRAGMENTMATERIALFSGIXPROC) (GLenum face, GLenum pname, GLfloat param); typedef void (APIENTRYP PFNGLFRAGMENTMATERIALFVSGIXPROC) (GLenum face, GLenum pname, const GLfloat *params); typedef void (APIENTRYP PFNGLFRAGMENTMATERIALISGIXPROC) (GLenum face, GLenum pname, GLint param); typedef void (APIENTRYP PFNGLFRAGMENTMATERIALIVSGIXPROC) (GLenum face, GLenum pname, const GLint *params); typedef void (APIENTRYP PFNGLGETFRAGMENTLIGHTFVSGIXPROC) (GLenum light, GLenum pname, GLfloat *params); typedef void (APIENTRYP PFNGLGETFRAGMENTLIGHTIVSGIXPROC) (GLenum light, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLGETFRAGMENTMATERIALFVSGIXPROC) (GLenum face, GLenum pname, GLfloat *params); typedef void (APIENTRYP PFNGLGETFRAGMENTMATERIALIVSGIXPROC) (GLenum face, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLLIGHTENVISGIXPROC) (GLenum pname, GLint param); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glFragmentColorMaterialSGIX (GLenum face, GLenum mode); GLAPI void APIENTRY glFragmentLightfSGIX (GLenum light, GLenum pname, GLfloat param); GLAPI void APIENTRY glFragmentLightfvSGIX (GLenum light, GLenum pname, const GLfloat *params); GLAPI void APIENTRY glFragmentLightiSGIX (GLenum light, GLenum pname, GLint param); GLAPI void APIENTRY glFragmentLightivSGIX (GLenum light, GLenum pname, const GLint *params); GLAPI void APIENTRY glFragmentLightModelfSGIX (GLenum pname, GLfloat param); GLAPI void APIENTRY glFragmentLightModelfvSGIX (GLenum pname, const GLfloat *params); GLAPI void APIENTRY glFragmentLightModeliSGIX (GLenum pname, GLint param); GLAPI void APIENTRY glFragmentLightModelivSGIX (GLenum pname, const GLint *params); GLAPI void APIENTRY glFragmentMaterialfSGIX (GLenum face, GLenum pname, GLfloat param); GLAPI void APIENTRY glFragmentMaterialfvSGIX (GLenum face, GLenum pname, const GLfloat *params); GLAPI void APIENTRY glFragmentMaterialiSGIX (GLenum face, GLenum pname, GLint param); GLAPI void APIENTRY glFragmentMaterialivSGIX (GLenum face, GLenum pname, const GLint *params); GLAPI void APIENTRY glGetFragmentLightfvSGIX (GLenum light, GLenum pname, GLfloat *params); GLAPI void APIENTRY glGetFragmentLightivSGIX (GLenum light, GLenum pname, GLint *params); GLAPI void APIENTRY glGetFragmentMaterialfvSGIX (GLenum face, GLenum pname, GLfloat *params); GLAPI void APIENTRY glGetFragmentMaterialivSGIX (GLenum face, GLenum pname, GLint *params); GLAPI void APIENTRY glLightEnviSGIX (GLenum pname, GLint param); #endif #endif /* GL_SGIX_fragment_lighting */ #ifndef GL_SGIX_framezoom #define GL_SGIX_framezoom 1 #define GL_FRAMEZOOM_SGIX 0x818B #define GL_FRAMEZOOM_FACTOR_SGIX 0x818C #define GL_MAX_FRAMEZOOM_FACTOR_SGIX 0x818D typedef void (APIENTRYP PFNGLFRAMEZOOMSGIXPROC) (GLint factor); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glFrameZoomSGIX (GLint factor); #endif #endif /* GL_SGIX_framezoom */ #ifndef GL_SGIX_igloo_interface #define GL_SGIX_igloo_interface 1 typedef void (APIENTRYP PFNGLIGLOOINTERFACESGIXPROC) (GLenum pname, const void *params); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glIglooInterfaceSGIX (GLenum pname, const void *params); #endif #endif /* GL_SGIX_igloo_interface */ #ifndef GL_SGIX_instruments #define GL_SGIX_instruments 1 #define GL_INSTRUMENT_BUFFER_POINTER_SGIX 0x8180 #define GL_INSTRUMENT_MEASUREMENTS_SGIX 0x8181 typedef GLint (APIENTRYP PFNGLGETINSTRUMENTSSGIXPROC) (void); typedef void (APIENTRYP PFNGLINSTRUMENTSBUFFERSGIXPROC) (GLsizei size, GLint *buffer); typedef GLint (APIENTRYP PFNGLPOLLINSTRUMENTSSGIXPROC) (GLint *marker_p); typedef void (APIENTRYP PFNGLREADINSTRUMENTSSGIXPROC) (GLint marker); typedef void (APIENTRYP PFNGLSTARTINSTRUMENTSSGIXPROC) (void); typedef void (APIENTRYP PFNGLSTOPINSTRUMENTSSGIXPROC) (GLint marker); #ifdef GL_GLEXT_PROTOTYPES GLAPI GLint APIENTRY glGetInstrumentsSGIX (void); GLAPI void APIENTRY glInstrumentsBufferSGIX (GLsizei size, GLint *buffer); GLAPI GLint APIENTRY glPollInstrumentsSGIX (GLint *marker_p); GLAPI void APIENTRY glReadInstrumentsSGIX (GLint marker); GLAPI void APIENTRY glStartInstrumentsSGIX (void); GLAPI void APIENTRY glStopInstrumentsSGIX (GLint marker); #endif #endif /* GL_SGIX_instruments */ #ifndef GL_SGIX_interlace #define GL_SGIX_interlace 1 #define GL_INTERLACE_SGIX 0x8094 #endif /* GL_SGIX_interlace */ #ifndef GL_SGIX_ir_instrument1 #define GL_SGIX_ir_instrument1 1 #define GL_IR_INSTRUMENT1_SGIX 0x817F #endif /* GL_SGIX_ir_instrument1 */ #ifndef GL_SGIX_list_priority #define GL_SGIX_list_priority 1 #define GL_LIST_PRIORITY_SGIX 0x8182 typedef void (APIENTRYP PFNGLGETLISTPARAMETERFVSGIXPROC) (GLuint list, GLenum pname, GLfloat *params); typedef void (APIENTRYP PFNGLGETLISTPARAMETERIVSGIXPROC) (GLuint list, GLenum pname, GLint *params); typedef void (APIENTRYP PFNGLLISTPARAMETERFSGIXPROC) (GLuint list, GLenum pname, GLfloat param); typedef void (APIENTRYP PFNGLLISTPARAMETERFVSGIXPROC) (GLuint list, GLenum pname, const GLfloat *params); typedef void (APIENTRYP PFNGLLISTPARAMETERISGIXPROC) (GLuint list, GLenum pname, GLint param); typedef void (APIENTRYP PFNGLLISTPARAMETERIVSGIXPROC) (GLuint list, GLenum pname, const GLint *params); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glGetListParameterfvSGIX (GLuint list, GLenum pname, GLfloat *params); GLAPI void APIENTRY glGetListParameterivSGIX (GLuint list, GLenum pname, GLint *params); GLAPI void APIENTRY glListParameterfSGIX (GLuint list, GLenum pname, GLfloat param); GLAPI void APIENTRY glListParameterfvSGIX (GLuint list, GLenum pname, const GLfloat *params); GLAPI void APIENTRY glListParameteriSGIX (GLuint list, GLenum pname, GLint param); GLAPI void APIENTRY glListParameterivSGIX (GLuint list, GLenum pname, const GLint *params); #endif #endif /* GL_SGIX_list_priority */ #ifndef GL_SGIX_pixel_texture #define GL_SGIX_pixel_texture 1 #define GL_PIXEL_TEX_GEN_SGIX 0x8139 #define GL_PIXEL_TEX_GEN_MODE_SGIX 0x832B typedef void (APIENTRYP PFNGLPIXELTEXGENSGIXPROC) (GLenum mode); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glPixelTexGenSGIX (GLenum mode); #endif #endif /* GL_SGIX_pixel_texture */ #ifndef GL_SGIX_pixel_tiles #define GL_SGIX_pixel_tiles 1 #define GL_PIXEL_TILE_BEST_ALIGNMENT_SGIX 0x813E #define GL_PIXEL_TILE_CACHE_INCREMENT_SGIX 0x813F #define GL_PIXEL_TILE_WIDTH_SGIX 0x8140 #define GL_PIXEL_TILE_HEIGHT_SGIX 0x8141 #define GL_PIXEL_TILE_GRID_WIDTH_SGIX 0x8142 #define GL_PIXEL_TILE_GRID_HEIGHT_SGIX 0x8143 #define GL_PIXEL_TILE_GRID_DEPTH_SGIX 0x8144 #define GL_PIXEL_TILE_CACHE_SIZE_SGIX 0x8145 #endif /* GL_SGIX_pixel_tiles */ #ifndef GL_SGIX_polynomial_ffd #define GL_SGIX_polynomial_ffd 1 #define GL_TEXTURE_DEFORMATION_BIT_SGIX 0x00000001 #define GL_GEOMETRY_DEFORMATION_BIT_SGIX 0x00000002 #define GL_GEOMETRY_DEFORMATION_SGIX 0x8194 #define GL_TEXTURE_DEFORMATION_SGIX 0x8195 #define GL_DEFORMATIONS_MASK_SGIX 0x8196 #define GL_MAX_DEFORMATION_ORDER_SGIX 0x8197 typedef void (APIENTRYP PFNGLDEFORMATIONMAP3DSGIXPROC) (GLenum target, GLdouble u1, GLdouble u2, GLint ustride, GLint uorder, GLdouble v1, GLdouble v2, GLint vstride, GLint vorder, GLdouble w1, GLdouble w2, GLint wstride, GLint worder, const GLdouble *points); typedef void (APIENTRYP PFNGLDEFORMATIONMAP3FSGIXPROC) (GLenum target, GLfloat u1, GLfloat u2, GLint ustride, GLint uorder, GLfloat v1, GLfloat v2, GLint vstride, GLint vorder, GLfloat w1, GLfloat w2, GLint wstride, GLint worder, const GLfloat *points); typedef void (APIENTRYP PFNGLDEFORMSGIXPROC) (GLbitfield mask); typedef void (APIENTRYP PFNGLLOADIDENTITYDEFORMATIONMAPSGIXPROC) (GLbitfield mask); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glDeformationMap3dSGIX (GLenum target, GLdouble u1, GLdouble u2, GLint ustride, GLint uorder, GLdouble v1, GLdouble v2, GLint vstride, GLint vorder, GLdouble w1, GLdouble w2, GLint wstride, GLint worder, const GLdouble *points); GLAPI void APIENTRY glDeformationMap3fSGIX (GLenum target, GLfloat u1, GLfloat u2, GLint ustride, GLint uorder, GLfloat v1, GLfloat v2, GLint vstride, GLint vorder, GLfloat w1, GLfloat w2, GLint wstride, GLint worder, const GLfloat *points); GLAPI void APIENTRY glDeformSGIX (GLbitfield mask); GLAPI void APIENTRY glLoadIdentityDeformationMapSGIX (GLbitfield mask); #endif #endif /* GL_SGIX_polynomial_ffd */ #ifndef GL_SGIX_reference_plane #define GL_SGIX_reference_plane 1 #define GL_REFERENCE_PLANE_SGIX 0x817D #define GL_REFERENCE_PLANE_EQUATION_SGIX 0x817E typedef void (APIENTRYP PFNGLREFERENCEPLANESGIXPROC) (const GLdouble *equation); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glReferencePlaneSGIX (const GLdouble *equation); #endif #endif /* GL_SGIX_reference_plane */ #ifndef GL_SGIX_resample #define GL_SGIX_resample 1 #define GL_PACK_RESAMPLE_SGIX 0x842C #define GL_UNPACK_RESAMPLE_SGIX 0x842D #define GL_RESAMPLE_REPLICATE_SGIX 0x842E #define GL_RESAMPLE_ZERO_FILL_SGIX 0x842F #define GL_RESAMPLE_DECIMATE_SGIX 0x8430 #endif /* GL_SGIX_resample */ #ifndef GL_SGIX_scalebias_hint #define GL_SGIX_scalebias_hint 1 #define GL_SCALEBIAS_HINT_SGIX 0x8322 #endif /* GL_SGIX_scalebias_hint */ #ifndef GL_SGIX_shadow #define GL_SGIX_shadow 1 #define GL_TEXTURE_COMPARE_SGIX 0x819A #define GL_TEXTURE_COMPARE_OPERATOR_SGIX 0x819B #define GL_TEXTURE_LEQUAL_R_SGIX 0x819C #define GL_TEXTURE_GEQUAL_R_SGIX 0x819D #endif /* GL_SGIX_shadow */ #ifndef GL_SGIX_shadow_ambient #define GL_SGIX_shadow_ambient 1 #define GL_SHADOW_AMBIENT_SGIX 0x80BF #endif /* GL_SGIX_shadow_ambient */ #ifndef GL_SGIX_sprite #define GL_SGIX_sprite 1 #define GL_SPRITE_SGIX 0x8148 #define GL_SPRITE_MODE_SGIX 0x8149 #define GL_SPRITE_AXIS_SGIX 0x814A #define GL_SPRITE_TRANSLATION_SGIX 0x814B #define GL_SPRITE_AXIAL_SGIX 0x814C #define GL_SPRITE_OBJECT_ALIGNED_SGIX 0x814D #define GL_SPRITE_EYE_ALIGNED_SGIX 0x814E typedef void (APIENTRYP PFNGLSPRITEPARAMETERFSGIXPROC) (GLenum pname, GLfloat param); typedef void (APIENTRYP PFNGLSPRITEPARAMETERFVSGIXPROC) (GLenum pname, const GLfloat *params); typedef void (APIENTRYP PFNGLSPRITEPARAMETERISGIXPROC) (GLenum pname, GLint param); typedef void (APIENTRYP PFNGLSPRITEPARAMETERIVSGIXPROC) (GLenum pname, const GLint *params); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glSpriteParameterfSGIX (GLenum pname, GLfloat param); GLAPI void APIENTRY glSpriteParameterfvSGIX (GLenum pname, const GLfloat *params); GLAPI void APIENTRY glSpriteParameteriSGIX (GLenum pname, GLint param); GLAPI void APIENTRY glSpriteParameterivSGIX (GLenum pname, const GLint *params); #endif #endif /* GL_SGIX_sprite */ #ifndef GL_SGIX_subsample #define GL_SGIX_subsample 1 #define GL_PACK_SUBSAMPLE_RATE_SGIX 0x85A0 #define GL_UNPACK_SUBSAMPLE_RATE_SGIX 0x85A1 #define GL_PIXEL_SUBSAMPLE_4444_SGIX 0x85A2 #define GL_PIXEL_SUBSAMPLE_2424_SGIX 0x85A3 #define GL_PIXEL_SUBSAMPLE_4242_SGIX 0x85A4 #endif /* GL_SGIX_subsample */ #ifndef GL_SGIX_tag_sample_buffer #define GL_SGIX_tag_sample_buffer 1 typedef void (APIENTRYP PFNGLTAGSAMPLEBUFFERSGIXPROC) (void); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glTagSampleBufferSGIX (void); #endif #endif /* GL_SGIX_tag_sample_buffer */ #ifndef GL_SGIX_texture_add_env #define GL_SGIX_texture_add_env 1 #define GL_TEXTURE_ENV_BIAS_SGIX 0x80BE #endif /* GL_SGIX_texture_add_env */ #ifndef GL_SGIX_texture_coordinate_clamp #define GL_SGIX_texture_coordinate_clamp 1 #define GL_TEXTURE_MAX_CLAMP_S_SGIX 0x8369 #define GL_TEXTURE_MAX_CLAMP_T_SGIX 0x836A #define GL_TEXTURE_MAX_CLAMP_R_SGIX 0x836B #endif /* GL_SGIX_texture_coordinate_clamp */ #ifndef GL_SGIX_texture_lod_bias #define GL_SGIX_texture_lod_bias 1 #define GL_TEXTURE_LOD_BIAS_S_SGIX 0x818E #define GL_TEXTURE_LOD_BIAS_T_SGIX 0x818F #define GL_TEXTURE_LOD_BIAS_R_SGIX 0x8190 #endif /* GL_SGIX_texture_lod_bias */ #ifndef GL_SGIX_texture_multi_buffer #define GL_SGIX_texture_multi_buffer 1 #define GL_TEXTURE_MULTI_BUFFER_HINT_SGIX 0x812E #endif /* GL_SGIX_texture_multi_buffer */ #ifndef GL_SGIX_texture_scale_bias #define GL_SGIX_texture_scale_bias 1 #define GL_POST_TEXTURE_FILTER_BIAS_SGIX 0x8179 #define GL_POST_TEXTURE_FILTER_SCALE_SGIX 0x817A #define GL_POST_TEXTURE_FILTER_BIAS_RANGE_SGIX 0x817B #define GL_POST_TEXTURE_FILTER_SCALE_RANGE_SGIX 0x817C #endif /* GL_SGIX_texture_scale_bias */ #ifndef GL_SGIX_vertex_preclip #define GL_SGIX_vertex_preclip 1 #define GL_VERTEX_PRECLIP_SGIX 0x83EE #define GL_VERTEX_PRECLIP_HINT_SGIX 0x83EF #endif /* GL_SGIX_vertex_preclip */ #ifndef GL_SGIX_ycrcb #define GL_SGIX_ycrcb 1 #define GL_YCRCB_422_SGIX 0x81BB #define GL_YCRCB_444_SGIX 0x81BC #endif /* GL_SGIX_ycrcb */ #ifndef GL_SGIX_ycrcb_subsample #define GL_SGIX_ycrcb_subsample 1 #endif /* GL_SGIX_ycrcb_subsample */ #ifndef GL_SGIX_ycrcba #define GL_SGIX_ycrcba 1 #define GL_YCRCB_SGIX 0x8318 #define GL_YCRCBA_SGIX 0x8319 #endif /* GL_SGIX_ycrcba */ #ifndef GL_SGI_color_matrix #define GL_SGI_color_matrix 1 #define GL_COLOR_MATRIX_SGI 0x80B1 #define GL_COLOR_MATRIX_STACK_DEPTH_SGI 0x80B2 #define GL_MAX_COLOR_MATRIX_STACK_DEPTH_SGI 0x80B3 #define GL_POST_COLOR_MATRIX_RED_SCALE_SGI 0x80B4 #define GL_POST_COLOR_MATRIX_GREEN_SCALE_SGI 0x80B5 #define GL_POST_COLOR_MATRIX_BLUE_SCALE_SGI 0x80B6 #define GL_POST_COLOR_MATRIX_ALPHA_SCALE_SGI 0x80B7 #define GL_POST_COLOR_MATRIX_RED_BIAS_SGI 0x80B8 #define GL_POST_COLOR_MATRIX_GREEN_BIAS_SGI 0x80B9 #define GL_POST_COLOR_MATRIX_BLUE_BIAS_SGI 0x80BA #define GL_POST_COLOR_MATRIX_ALPHA_BIAS_SGI 0x80BB #endif /* GL_SGI_color_matrix */ #ifndef GL_SGI_color_table #define GL_SGI_color_table 1 #define GL_COLOR_TABLE_SGI 0x80D0 #define GL_POST_CONVOLUTION_COLOR_TABLE_SGI 0x80D1 #define GL_POST_COLOR_MATRIX_COLOR_TABLE_SGI 0x80D2 #define GL_PROXY_COLOR_TABLE_SGI 0x80D3 #define GL_PROXY_POST_CONVOLUTION_COLOR_TABLE_SGI 0x80D4 #define GL_PROXY_POST_COLOR_MATRIX_COLOR_TABLE_SGI 0x80D5 #define GL_COLOR_TABLE_SCALE_SGI 0x80D6 #define GL_COLOR_TABLE_BIAS_SGI 0x80D7 #define GL_COLOR_TABLE_FORMAT_SGI 0x80D8 #define GL_COLOR_TABLE_WIDTH_SGI 0x80D9 #define GL_COLOR_TABLE_RED_SIZE_SGI 0x80DA #define GL_COLOR_TABLE_GREEN_SIZE_SGI 0x80DB #define GL_COLOR_TABLE_BLUE_SIZE_SGI 0x80DC #define GL_COLOR_TABLE_ALPHA_SIZE_SGI 0x80DD #define GL_COLOR_TABLE_LUMINANCE_SIZE_SGI 0x80DE #define GL_COLOR_TABLE_INTENSITY_SIZE_SGI 0x80DF typedef void (APIENTRYP PFNGLCOLORTABLESGIPROC) (GLenum target, GLenum internalformat, GLsizei width, GLenum format, GLenum type, const void *table); typedef void (APIENTRYP PFNGLCOLORTABLEPARAMETERFVSGIPROC) (GLenum target, GLenum pname, const GLfloat *params); typedef void (APIENTRYP PFNGLCOLORTABLEPARAMETERIVSGIPROC) (GLenum target, GLenum pname, const GLint *params); typedef void (APIENTRYP PFNGLCOPYCOLORTABLESGIPROC) (GLenum target, GLenum internalformat, GLint x, GLint y, GLsizei width); typedef void (APIENTRYP PFNGLGETCOLORTABLESGIPROC) (GLenum target, GLenum format, GLenum type, void *table); typedef void (APIENTRYP PFNGLGETCOLORTABLEPARAMETERFVSGIPROC) (GLenum target, GLenum pname, GLfloat *params); typedef void (APIENTRYP PFNGLGETCOLORTABLEPARAMETERIVSGIPROC) (GLenum target, GLenum pname, GLint *params); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glColorTableSGI (GLenum target, GLenum internalformat, GLsizei width, GLenum format, GLenum type, const void *table); GLAPI void APIENTRY glColorTableParameterfvSGI (GLenum target, GLenum pname, const GLfloat *params); GLAPI void APIENTRY glColorTableParameterivSGI (GLenum target, GLenum pname, const GLint *params); GLAPI void APIENTRY glCopyColorTableSGI (GLenum target, GLenum internalformat, GLint x, GLint y, GLsizei width); GLAPI void APIENTRY glGetColorTableSGI (GLenum target, GLenum format, GLenum type, void *table); GLAPI void APIENTRY glGetColorTableParameterfvSGI (GLenum target, GLenum pname, GLfloat *params); GLAPI void APIENTRY glGetColorTableParameterivSGI (GLenum target, GLenum pname, GLint *params); #endif #endif /* GL_SGI_color_table */ #ifndef GL_SGI_texture_color_table #define GL_SGI_texture_color_table 1 #define GL_TEXTURE_COLOR_TABLE_SGI 0x80BC #define GL_PROXY_TEXTURE_COLOR_TABLE_SGI 0x80BD #endif /* GL_SGI_texture_color_table */ #ifndef GL_SUNX_constant_data #define GL_SUNX_constant_data 1 #define GL_UNPACK_CONSTANT_DATA_SUNX 0x81D5 #define GL_TEXTURE_CONSTANT_DATA_SUNX 0x81D6 typedef void (APIENTRYP PFNGLFINISHTEXTURESUNXPROC) (void); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glFinishTextureSUNX (void); #endif #endif /* GL_SUNX_constant_data */ #ifndef GL_SUN_convolution_border_modes #define GL_SUN_convolution_border_modes 1 #define GL_WRAP_BORDER_SUN 0x81D4 #endif /* GL_SUN_convolution_border_modes */ #ifndef GL_SUN_global_alpha #define GL_SUN_global_alpha 1 #define GL_GLOBAL_ALPHA_SUN 0x81D9 #define GL_GLOBAL_ALPHA_FACTOR_SUN 0x81DA typedef void (APIENTRYP PFNGLGLOBALALPHAFACTORBSUNPROC) (GLbyte factor); typedef void (APIENTRYP PFNGLGLOBALALPHAFACTORSSUNPROC) (GLshort factor); typedef void (APIENTRYP PFNGLGLOBALALPHAFACTORISUNPROC) (GLint factor); typedef void (APIENTRYP PFNGLGLOBALALPHAFACTORFSUNPROC) (GLfloat factor); typedef void (APIENTRYP PFNGLGLOBALALPHAFACTORDSUNPROC) (GLdouble factor); typedef void (APIENTRYP PFNGLGLOBALALPHAFACTORUBSUNPROC) (GLubyte factor); typedef void (APIENTRYP PFNGLGLOBALALPHAFACTORUSSUNPROC) (GLushort factor); typedef void (APIENTRYP PFNGLGLOBALALPHAFACTORUISUNPROC) (GLuint factor); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glGlobalAlphaFactorbSUN (GLbyte factor); GLAPI void APIENTRY glGlobalAlphaFactorsSUN (GLshort factor); GLAPI void APIENTRY glGlobalAlphaFactoriSUN (GLint factor); GLAPI void APIENTRY glGlobalAlphaFactorfSUN (GLfloat factor); GLAPI void APIENTRY glGlobalAlphaFactordSUN (GLdouble factor); GLAPI void APIENTRY glGlobalAlphaFactorubSUN (GLubyte factor); GLAPI void APIENTRY glGlobalAlphaFactorusSUN (GLushort factor); GLAPI void APIENTRY glGlobalAlphaFactoruiSUN (GLuint factor); #endif #endif /* GL_SUN_global_alpha */ #ifndef GL_SUN_mesh_array #define GL_SUN_mesh_array 1 #define GL_QUAD_MESH_SUN 0x8614 #define GL_TRIANGLE_MESH_SUN 0x8615 typedef void (APIENTRYP PFNGLDRAWMESHARRAYSSUNPROC) (GLenum mode, GLint first, GLsizei count, GLsizei width); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glDrawMeshArraysSUN (GLenum mode, GLint first, GLsizei count, GLsizei width); #endif #endif /* GL_SUN_mesh_array */ #ifndef GL_SUN_slice_accum #define GL_SUN_slice_accum 1 #define GL_SLICE_ACCUM_SUN 0x85CC #endif /* GL_SUN_slice_accum */ #ifndef GL_SUN_triangle_list #define GL_SUN_triangle_list 1 #define GL_RESTART_SUN 0x0001 #define GL_REPLACE_MIDDLE_SUN 0x0002 #define GL_REPLACE_OLDEST_SUN 0x0003 #define GL_TRIANGLE_LIST_SUN 0x81D7 #define GL_REPLACEMENT_CODE_SUN 0x81D8 #define GL_REPLACEMENT_CODE_ARRAY_SUN 0x85C0 #define GL_REPLACEMENT_CODE_ARRAY_TYPE_SUN 0x85C1 #define GL_REPLACEMENT_CODE_ARRAY_STRIDE_SUN 0x85C2 #define GL_REPLACEMENT_CODE_ARRAY_POINTER_SUN 0x85C3 #define GL_R1UI_V3F_SUN 0x85C4 #define GL_R1UI_C4UB_V3F_SUN 0x85C5 #define GL_R1UI_C3F_V3F_SUN 0x85C6 #define GL_R1UI_N3F_V3F_SUN 0x85C7 #define GL_R1UI_C4F_N3F_V3F_SUN 0x85C8 #define GL_R1UI_T2F_V3F_SUN 0x85C9 #define GL_R1UI_T2F_N3F_V3F_SUN 0x85CA #define GL_R1UI_T2F_C4F_N3F_V3F_SUN 0x85CB typedef void (APIENTRYP PFNGLREPLACEMENTCODEUISUNPROC) (GLuint code); typedef void (APIENTRYP PFNGLREPLACEMENTCODEUSSUNPROC) (GLushort code); typedef void (APIENTRYP PFNGLREPLACEMENTCODEUBSUNPROC) (GLubyte code); typedef void (APIENTRYP PFNGLREPLACEMENTCODEUIVSUNPROC) (const GLuint *code); typedef void (APIENTRYP PFNGLREPLACEMENTCODEUSVSUNPROC) (const GLushort *code); typedef void (APIENTRYP PFNGLREPLACEMENTCODEUBVSUNPROC) (const GLubyte *code); typedef void (APIENTRYP PFNGLREPLACEMENTCODEPOINTERSUNPROC) (GLenum type, GLsizei stride, const void **pointer); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glReplacementCodeuiSUN (GLuint code); GLAPI void APIENTRY glReplacementCodeusSUN (GLushort code); GLAPI void APIENTRY glReplacementCodeubSUN (GLubyte code); GLAPI void APIENTRY glReplacementCodeuivSUN (const GLuint *code); GLAPI void APIENTRY glReplacementCodeusvSUN (const GLushort *code); GLAPI void APIENTRY glReplacementCodeubvSUN (const GLubyte *code); GLAPI void APIENTRY glReplacementCodePointerSUN (GLenum type, GLsizei stride, const void **pointer); #endif #endif /* GL_SUN_triangle_list */ #ifndef GL_SUN_vertex #define GL_SUN_vertex 1 typedef void (APIENTRYP PFNGLCOLOR4UBVERTEX2FSUNPROC) (GLubyte r, GLubyte g, GLubyte b, GLubyte a, GLfloat x, GLfloat y); typedef void (APIENTRYP PFNGLCOLOR4UBVERTEX2FVSUNPROC) (const GLubyte *c, const GLfloat *v); typedef void (APIENTRYP PFNGLCOLOR4UBVERTEX3FSUNPROC) (GLubyte r, GLubyte g, GLubyte b, GLubyte a, GLfloat x, GLfloat y, GLfloat z); typedef void (APIENTRYP PFNGLCOLOR4UBVERTEX3FVSUNPROC) (const GLubyte *c, const GLfloat *v); typedef void (APIENTRYP PFNGLCOLOR3FVERTEX3FSUNPROC) (GLfloat r, GLfloat g, GLfloat b, GLfloat x, GLfloat y, GLfloat z); typedef void (APIENTRYP PFNGLCOLOR3FVERTEX3FVSUNPROC) (const GLfloat *c, const GLfloat *v); typedef void (APIENTRYP PFNGLNORMAL3FVERTEX3FSUNPROC) (GLfloat nx, GLfloat ny, GLfloat nz, GLfloat x, GLfloat y, GLfloat z); typedef void (APIENTRYP PFNGLNORMAL3FVERTEX3FVSUNPROC) (const GLfloat *n, const GLfloat *v); typedef void (APIENTRYP PFNGLCOLOR4FNORMAL3FVERTEX3FSUNPROC) (GLfloat r, GLfloat g, GLfloat b, GLfloat a, GLfloat nx, GLfloat ny, GLfloat nz, GLfloat x, GLfloat y, GLfloat z); typedef void (APIENTRYP PFNGLCOLOR4FNORMAL3FVERTEX3FVSUNPROC) (const GLfloat *c, const GLfloat *n, const GLfloat *v); typedef void (APIENTRYP PFNGLTEXCOORD2FVERTEX3FSUNPROC) (GLfloat s, GLfloat t, GLfloat x, GLfloat y, GLfloat z); typedef void (APIENTRYP PFNGLTEXCOORD2FVERTEX3FVSUNPROC) (const GLfloat *tc, const GLfloat *v); typedef void (APIENTRYP PFNGLTEXCOORD4FVERTEX4FSUNPROC) (GLfloat s, GLfloat t, GLfloat p, GLfloat q, GLfloat x, GLfloat y, GLfloat z, GLfloat w); typedef void (APIENTRYP PFNGLTEXCOORD4FVERTEX4FVSUNPROC) (const GLfloat *tc, const GLfloat *v); typedef void (APIENTRYP PFNGLTEXCOORD2FCOLOR4UBVERTEX3FSUNPROC) (GLfloat s, GLfloat t, GLubyte r, GLubyte g, GLubyte b, GLubyte a, GLfloat x, GLfloat y, GLfloat z); typedef void (APIENTRYP PFNGLTEXCOORD2FCOLOR4UBVERTEX3FVSUNPROC) (const GLfloat *tc, const GLubyte *c, const GLfloat *v); typedef void (APIENTRYP PFNGLTEXCOORD2FCOLOR3FVERTEX3FSUNPROC) (GLfloat s, GLfloat t, GLfloat r, GLfloat g, GLfloat b, GLfloat x, GLfloat y, GLfloat z); typedef void (APIENTRYP PFNGLTEXCOORD2FCOLOR3FVERTEX3FVSUNPROC) (const GLfloat *tc, const GLfloat *c, const GLfloat *v); typedef void (APIENTRYP PFNGLTEXCOORD2FNORMAL3FVERTEX3FSUNPROC) (GLfloat s, GLfloat t, GLfloat nx, GLfloat ny, GLfloat nz, GLfloat x, GLfloat y, GLfloat z); typedef void (APIENTRYP PFNGLTEXCOORD2FNORMAL3FVERTEX3FVSUNPROC) (const GLfloat *tc, const GLfloat *n, const GLfloat *v); typedef void (APIENTRYP PFNGLTEXCOORD2FCOLOR4FNORMAL3FVERTEX3FSUNPROC) (GLfloat s, GLfloat t, GLfloat r, GLfloat g, GLfloat b, GLfloat a, GLfloat nx, GLfloat ny, GLfloat nz, GLfloat x, GLfloat y, GLfloat z); typedef void (APIENTRYP PFNGLTEXCOORD2FCOLOR4FNORMAL3FVERTEX3FVSUNPROC) (const GLfloat *tc, const GLfloat *c, const GLfloat *n, const GLfloat *v); typedef void (APIENTRYP PFNGLTEXCOORD4FCOLOR4FNORMAL3FVERTEX4FSUNPROC) (GLfloat s, GLfloat t, GLfloat p, GLfloat q, GLfloat r, GLfloat g, GLfloat b, GLfloat a, GLfloat nx, GLfloat ny, GLfloat nz, GLfloat x, GLfloat y, GLfloat z, GLfloat w); typedef void (APIENTRYP PFNGLTEXCOORD4FCOLOR4FNORMAL3FVERTEX4FVSUNPROC) (const GLfloat *tc, const GLfloat *c, const GLfloat *n, const GLfloat *v); typedef void (APIENTRYP PFNGLREPLACEMENTCODEUIVERTEX3FSUNPROC) (GLuint rc, GLfloat x, GLfloat y, GLfloat z); typedef void (APIENTRYP PFNGLREPLACEMENTCODEUIVERTEX3FVSUNPROC) (const GLuint *rc, const GLfloat *v); typedef void (APIENTRYP PFNGLREPLACEMENTCODEUICOLOR4UBVERTEX3FSUNPROC) (GLuint rc, GLubyte r, GLubyte g, GLubyte b, GLubyte a, GLfloat x, GLfloat y, GLfloat z); typedef void (APIENTRYP PFNGLREPLACEMENTCODEUICOLOR4UBVERTEX3FVSUNPROC) (const GLuint *rc, const GLubyte *c, const GLfloat *v); typedef void (APIENTRYP PFNGLREPLACEMENTCODEUICOLOR3FVERTEX3FSUNPROC) (GLuint rc, GLfloat r, GLfloat g, GLfloat b, GLfloat x, GLfloat y, GLfloat z); typedef void (APIENTRYP PFNGLREPLACEMENTCODEUICOLOR3FVERTEX3FVSUNPROC) (const GLuint *rc, const GLfloat *c, const GLfloat *v); typedef void (APIENTRYP PFNGLREPLACEMENTCODEUINORMAL3FVERTEX3FSUNPROC) (GLuint rc, GLfloat nx, GLfloat ny, GLfloat nz, GLfloat x, GLfloat y, GLfloat z); typedef void (APIENTRYP PFNGLREPLACEMENTCODEUINORMAL3FVERTEX3FVSUNPROC) (const GLuint *rc, const GLfloat *n, const GLfloat *v); typedef void (APIENTRYP PFNGLREPLACEMENTCODEUICOLOR4FNORMAL3FVERTEX3FSUNPROC) (GLuint rc, GLfloat r, GLfloat g, GLfloat b, GLfloat a, GLfloat nx, GLfloat ny, GLfloat nz, GLfloat x, GLfloat y, GLfloat z); typedef void (APIENTRYP PFNGLREPLACEMENTCODEUICOLOR4FNORMAL3FVERTEX3FVSUNPROC) (const GLuint *rc, const GLfloat *c, const GLfloat *n, const GLfloat *v); typedef void (APIENTRYP PFNGLREPLACEMENTCODEUITEXCOORD2FVERTEX3FSUNPROC) (GLuint rc, GLfloat s, GLfloat t, GLfloat x, GLfloat y, GLfloat z); typedef void (APIENTRYP PFNGLREPLACEMENTCODEUITEXCOORD2FVERTEX3FVSUNPROC) (const GLuint *rc, const GLfloat *tc, const GLfloat *v); typedef void (APIENTRYP PFNGLREPLACEMENTCODEUITEXCOORD2FNORMAL3FVERTEX3FSUNPROC) (GLuint rc, GLfloat s, GLfloat t, GLfloat nx, GLfloat ny, GLfloat nz, GLfloat x, GLfloat y, GLfloat z); typedef void (APIENTRYP PFNGLREPLACEMENTCODEUITEXCOORD2FNORMAL3FVERTEX3FVSUNPROC) (const GLuint *rc, const GLfloat *tc, const GLfloat *n, const GLfloat *v); typedef void (APIENTRYP PFNGLREPLACEMENTCODEUITEXCOORD2FCOLOR4FNORMAL3FVERTEX3FSUNPROC) (GLuint rc, GLfloat s, GLfloat t, GLfloat r, GLfloat g, GLfloat b, GLfloat a, GLfloat nx, GLfloat ny, GLfloat nz, GLfloat x, GLfloat y, GLfloat z); typedef void (APIENTRYP PFNGLREPLACEMENTCODEUITEXCOORD2FCOLOR4FNORMAL3FVERTEX3FVSUNPROC) (const GLuint *rc, const GLfloat *tc, const GLfloat *c, const GLfloat *n, const GLfloat *v); #ifdef GL_GLEXT_PROTOTYPES GLAPI void APIENTRY glColor4ubVertex2fSUN (GLubyte r, GLubyte g, GLubyte b, GLubyte a, GLfloat x, GLfloat y); GLAPI void APIENTRY glColor4ubVertex2fvSUN (const GLubyte *c, const GLfloat *v); GLAPI void APIENTRY glColor4ubVertex3fSUN (GLubyte r, GLubyte g, GLubyte b, GLubyte a, GLfloat x, GLfloat y, GLfloat z); GLAPI void APIENTRY glColor4ubVertex3fvSUN (const GLubyte *c, const GLfloat *v); GLAPI void APIENTRY glColor3fVertex3fSUN (GLfloat r, GLfloat g, GLfloat b, GLfloat x, GLfloat y, GLfloat z); GLAPI void APIENTRY glColor3fVertex3fvSUN (const GLfloat *c, const GLfloat *v); GLAPI void APIENTRY glNormal3fVertex3fSUN (GLfloat nx, GLfloat ny, GLfloat nz, GLfloat x, GLfloat y, GLfloat z); GLAPI void APIENTRY glNormal3fVertex3fvSUN (const GLfloat *n, const GLfloat *v); GLAPI void APIENTRY glColor4fNormal3fVertex3fSUN (GLfloat r, GLfloat g, GLfloat b, GLfloat a, GLfloat nx, GLfloat ny, GLfloat nz, GLfloat x, GLfloat y, GLfloat z); GLAPI void APIENTRY glColor4fNormal3fVertex3fvSUN (const GLfloat *c, const GLfloat *n, const GLfloat *v); GLAPI void APIENTRY glTexCoord2fVertex3fSUN (GLfloat s, GLfloat t, GLfloat x, GLfloat y, GLfloat z); GLAPI void APIENTRY glTexCoord2fVertex3fvSUN (const GLfloat *tc, const GLfloat *v); GLAPI void APIENTRY glTexCoord4fVertex4fSUN (GLfloat s, GLfloat t, GLfloat p, GLfloat q, GLfloat x, GLfloat y, GLfloat z, GLfloat w); GLAPI void APIENTRY glTexCoord4fVertex4fvSUN (const GLfloat *tc, const GLfloat *v); GLAPI void APIENTRY glTexCoord2fColor4ubVertex3fSUN (GLfloat s, GLfloat t, GLubyte r, GLubyte g, GLubyte b, GLubyte a, GLfloat x, GLfloat y, GLfloat z); GLAPI void APIENTRY glTexCoord2fColor4ubVertex3fvSUN (const GLfloat *tc, const GLubyte *c, const GLfloat *v); GLAPI void APIENTRY glTexCoord2fColor3fVertex3fSUN (GLfloat s, GLfloat t, GLfloat r, GLfloat g, GLfloat b, GLfloat x, GLfloat y, GLfloat z); GLAPI void APIENTRY glTexCoord2fColor3fVertex3fvSUN (const GLfloat *tc, const GLfloat *c, const GLfloat *v); GLAPI void APIENTRY glTexCoord2fNormal3fVertex3fSUN (GLfloat s, GLfloat t, GLfloat nx, GLfloat ny, GLfloat nz, GLfloat x, GLfloat y, GLfloat z); GLAPI void APIENTRY glTexCoord2fNormal3fVertex3fvSUN (const GLfloat *tc, const GLfloat *n, const GLfloat *v); GLAPI void APIENTRY glTexCoord2fColor4fNormal3fVertex3fSUN (GLfloat s, GLfloat t, GLfloat r, GLfloat g, GLfloat b, GLfloat a, GLfloat nx, GLfloat ny, GLfloat nz, GLfloat x, GLfloat y, GLfloat z); GLAPI void APIENTRY glTexCoord2fColor4fNormal3fVertex3fvSUN (const GLfloat *tc, const GLfloat *c, const GLfloat *n, const GLfloat *v); GLAPI void APIENTRY glTexCoord4fColor4fNormal3fVertex4fSUN (GLfloat s, GLfloat t, GLfloat p, GLfloat q, GLfloat r, GLfloat g, GLfloat b, GLfloat a, GLfloat nx, GLfloat ny, GLfloat nz, GLfloat x, GLfloat y, GLfloat z, GLfloat w); GLAPI void APIENTRY glTexCoord4fColor4fNormal3fVertex4fvSUN (const GLfloat *tc, const GLfloat *c, const GLfloat *n, const GLfloat *v); GLAPI void APIENTRY glReplacementCodeuiVertex3fSUN (GLuint rc, GLfloat x, GLfloat y, GLfloat z); GLAPI void APIENTRY glReplacementCodeuiVertex3fvSUN (const GLuint *rc, const GLfloat *v); GLAPI void APIENTRY glReplacementCodeuiColor4ubVertex3fSUN (GLuint rc, GLubyte r, GLubyte g, GLubyte b, GLubyte a, GLfloat x, GLfloat y, GLfloat z); GLAPI void APIENTRY glReplacementCodeuiColor4ubVertex3fvSUN (const GLuint *rc, const GLubyte *c, const GLfloat *v); GLAPI void APIENTRY glReplacementCodeuiColor3fVertex3fSUN (GLuint rc, GLfloat r, GLfloat g, GLfloat b, GLfloat x, GLfloat y, GLfloat z); GLAPI void APIENTRY glReplacementCodeuiColor3fVertex3fvSUN (const GLuint *rc, const GLfloat *c, const GLfloat *v); GLAPI void APIENTRY glReplacementCodeuiNormal3fVertex3fSUN (GLuint rc, GLfloat nx, GLfloat ny, GLfloat nz, GLfloat x, GLfloat y, GLfloat z); GLAPI void APIENTRY glReplacementCodeuiNormal3fVertex3fvSUN (const GLuint *rc, const GLfloat *n, const GLfloat *v); GLAPI void APIENTRY glReplacementCodeuiColor4fNormal3fVertex3fSUN (GLuint rc, GLfloat r, GLfloat g, GLfloat b, GLfloat a, GLfloat nx, GLfloat ny, GLfloat nz, GLfloat x, GLfloat y, GLfloat z); GLAPI void APIENTRY glReplacementCodeuiColor4fNormal3fVertex3fvSUN (const GLuint *rc, const GLfloat *c, const GLfloat *n, const GLfloat *v); GLAPI void APIENTRY glReplacementCodeuiTexCoord2fVertex3fSUN (GLuint rc, GLfloat s, GLfloat t, GLfloat x, GLfloat y, GLfloat z); GLAPI void APIENTRY glReplacementCodeuiTexCoord2fVertex3fvSUN (const GLuint *rc, const GLfloat *tc, const GLfloat *v); GLAPI void APIENTRY glReplacementCodeuiTexCoord2fNormal3fVertex3fSUN (GLuint rc, GLfloat s, GLfloat t, GLfloat nx, GLfloat ny, GLfloat nz, GLfloat x, GLfloat y, GLfloat z); GLAPI void APIENTRY glReplacementCodeuiTexCoord2fNormal3fVertex3fvSUN (const GLuint *rc, const GLfloat *tc, const GLfloat *n, const GLfloat *v); GLAPI void APIENTRY glReplacementCodeuiTexCoord2fColor4fNormal3fVertex3fSUN (GLuint rc, GLfloat s, GLfloat t, GLfloat r, GLfloat g, GLfloat b, GLfloat a, GLfloat nx, GLfloat ny, GLfloat nz, GLfloat x, GLfloat y, GLfloat z); GLAPI void APIENTRY glReplacementCodeuiTexCoord2fColor4fNormal3fVertex3fvSUN (const GLuint *rc, const GLfloat *tc, const GLfloat *c, const GLfloat *n, const GLfloat *v); #endif #endif /* GL_SUN_vertex */ #ifndef GL_WIN_phong_shading #define GL_WIN_phong_shading 1 #define GL_PHONG_WIN 0x80EA #define GL_PHONG_HINT_WIN 0x80EB #endif /* GL_WIN_phong_shading */ #ifndef GL_WIN_specular_fog #define GL_WIN_specular_fog 1 #define GL_FOG_SPECULAR_TEXTURE_WIN 0x80EC #endif /* GL_WIN_specular_fog */ #ifdef __cplusplus } #endif #endif uTox/third_party/stb/stb/tests/caveview/caveview.h0000600000175000001440000000227714003056224021353 0ustar rakusers#ifndef INCLUDE_CAVEVIEW_H #define INCLUDE_CAVEVIEW_H #include "stb.h" #include "stb_voxel_render.h" typedef struct { int cx,cy; stbvox_mesh_maker mm; uint8 *build_buffer; uint8 *face_buffer; int num_quads; float transform[3][3]; float bounds[2][3]; uint8 sv_blocktype[34][34][18]; uint8 sv_lighting [34][34][18]; } raw_mesh; // a 3D checkerboard of empty,solid would be: 32x32x255x6/2 ~= 800000 // an all-leaf qchunk would be: 32 x 32 x 255 x 6 ~= 1,600,000 #define BUILD_QUAD_MAX 400000 #define BUILD_BUFFER_SIZE (4*4*BUILD_QUAD_MAX) // 4 bytes per vertex, 4 vertices per quad #define FACE_BUFFER_SIZE ( 4*BUILD_QUAD_MAX) // 4 bytes per quad extern void mesh_init(void); extern void render_init(void); extern void world_init(void); extern void ods(char *fmt, ...); // output debug string extern void reset_cache_size(int size); extern void render_caves(float pos[3]); #include "cave_parse.h" // fast_chunk extern fast_chunk *get_converted_fastchunk(int chunk_x, int chunk_y); extern void build_chunk(int chunk_x, int chunk_y, fast_chunk *fc_table[4][4], raw_mesh *rm); extern void reset_cache_size(int size); extern void deref_fastchunk(fast_chunk *fc); #endifuTox/third_party/stb/stb/tests/caveview/caveview.dsw0000600000175000001440000000077614003056224021723 0ustar rakusersMicrosoft Developer Studio Workspace File, Format Version 6.00 # WARNING: DO NOT EDIT OR DELETE THIS WORKSPACE FILE! ############################################################################### Project: "caveview"=.\caveview.dsp - Package Owner=<4> Package=<5> {{{ }}} Package=<4> {{{ }}} ############################################################################### Global: Package=<5> {{{ }}} Package=<3> {{{ }}} ############################################################################### uTox/third_party/stb/stb/tests/caveview/caveview.dsp0000600000175000001440000001117714003056224021711 0ustar rakusers# Microsoft Developer Studio Project File - Name="caveview" - Package Owner=<4> # Microsoft Developer Studio Generated Build File, Format Version 6.00 # ** DO NOT EDIT ** # TARGTYPE "Win32 (x86) Application" 0x0101 CFG=caveview - 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 "caveview.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 "caveview.mak" CFG="caveview - Win32 Debug" !MESSAGE !MESSAGE Possible choices for configuration are: !MESSAGE !MESSAGE "caveview - Win32 Release" (based on "Win32 (x86) Application") !MESSAGE "caveview - Win32 Debug" (based on "Win32 (x86) Application") !MESSAGE # Begin Project # PROP AllowPerConfigDependencies 0 # PROP Scc_ProjName "" # PROP Scc_LocalPath "" CPP=cl.exe MTL=midl.exe RSC=rc.exe !IF "$(CFG)" == "caveview - Win32 Release" # PROP BASE Use_MFC 0 # PROP BASE Use_Debug_Libraries 0 # PROP BASE Output_Dir "Release" # PROP BASE Intermediate_Dir "Release" # PROP BASE Target_Dir "" # PROP Use_MFC 0 # PROP Use_Debug_Libraries 0 # PROP Output_Dir "Release" # PROP Intermediate_Dir "Release" # PROP Ignore_Export_Lib 0 # PROP Target_Dir "" # ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_WINDOWS" /D "_MBCS" /YX /FD /c # ADD CPP /nologo /MD /W3 /WX /GX /Zd /O2 /I "../.." /D "WIN32" /D "NDEBUG" /D "_WINDOWS" /D "_MBCS" /FD /c # SUBTRACT CPP /YX # 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 /subsystem:windows /machine:I386 # ADD LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib sdl2.lib opengl32.lib glu32.lib winmm.lib sdl2_mixer.lib advapi32.lib /nologo /subsystem:windows /debug /machine:I386 # SUBTRACT LINK32 /map !ELSEIF "$(CFG)" == "caveview - Win32 Debug" # PROP BASE Use_MFC 0 # PROP BASE Use_Debug_Libraries 1 # PROP BASE Output_Dir "Debug" # PROP BASE Intermediate_Dir "Debug" # PROP BASE Target_Dir "" # PROP Use_MFC 0 # PROP Use_Debug_Libraries 1 # PROP Output_Dir "Debug" # PROP Intermediate_Dir "Debug" # PROP Ignore_Export_Lib 0 # PROP Target_Dir "" # ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_WINDOWS" /D "_MBCS" /YX /FD /GZ /c # ADD CPP /nologo /MDd /W3 /WX /Gm /GX /Zi /Od /I "../.." /D "WIN32" /D "_DEBUG" /D "_WINDOWS" /D "_MBCS" /FD /GZ /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 /subsystem:windows /debug /machine:I386 /pdbtype:sept # ADD LINK32 kernel32.lib user32.lib gdi32.lib advapi32.lib winspool.lib comdlg32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib sdl2.lib opengl32.lib glu32.lib winmm.lib sdl2_mixer.lib /nologo /subsystem:windows /incremental:no /debug /machine:I386 /pdbtype:sept !ENDIF # Begin Target # Name "caveview - Win32 Release" # Name "caveview - Win32 Debug" # Begin Source File SOURCE=.\cave_main.c # End Source File # Begin Source File SOURCE=.\cave_mesher.c # End Source File # Begin Source File SOURCE=.\cave_parse.c # End Source File # Begin Source File SOURCE=.\cave_parse.h # End Source File # Begin Source File SOURCE=.\cave_render.c # End Source File # Begin Source File SOURCE=.\caveview.h # End Source File # Begin Source File SOURCE=.\glext.h # End Source File # Begin Source File SOURCE=.\glext_list.h # End Source File # Begin Source File SOURCE=.\README.md # End Source File # Begin Source File SOURCE=.\win32\SDL_windows_main.c # End Source File # Begin Source File SOURCE=..\..\stb.h # End Source File # Begin Source File SOURCE=..\..\stb_easy_font.h # End Source File # Begin Source File SOURCE=.\stb_gl.h # End Source File # Begin Source File SOURCE=.\stb_glprog.h # End Source File # Begin Source File SOURCE=..\..\stb_image.h # End Source File # Begin Source File SOURCE=..\..\stb_voxel_render.h # End Source File # End Target # End Project uTox/third_party/stb/stb/tests/caveview/cave_render.c0000600000175000001440000007151714003056224022015 0ustar rakusers// This file renders vertex buffers, converts raw meshes // to GL meshes, and manages threads that do the raw-mesh // building (found in cave_mesher.c) #include "stb_voxel_render.h" #define STB_GLEXT_DECLARE "glext_list.h" #include "stb_gl.h" #include "stb_image.h" #include "stb_glprog.h" #include "caveview.h" #include "cave_parse.h" #include "stb.h" #include "sdl.h" #include "sdl_thread.h" #include #include //#define STBVOX_CONFIG_TEX1_EDGE_CLAMP // currently no dynamic way to set mesh cache size or view distance //#define SHORTVIEW stbvox_mesh_maker g_mesh_maker; GLuint main_prog; GLint uniform_locations[64]; //#define MAX_QUADS_PER_DRAW (65536 / 4) // assuming 16-bit indices, 4 verts per quad //#define FIXED_INDEX_BUFFER_SIZE (MAX_QUADS_PER_DRAW * 6 * 2) // 16*1024 * 12 == ~192KB // while uploading texture data, this holds our each texture #define TEX_SIZE 64 uint32 texture[TEX_SIZE][TEX_SIZE]; GLuint voxel_tex[2]; // chunk state enum { STATE_invalid, STATE_needed, STATE_requested, STATE_abandoned, STATE_valid, }; // mesh is 32x32x255 ... this is hardcoded in that // a mesh covers 2x2 minecraft chunks, no #defines for it typedef struct { int state; int chunk_x, chunk_y; int num_quads; float priority; int vbuf_size, fbuf_size; float transform[3][3]; float bounds[2][3]; GLuint vbuf;// vbuf_tex; GLuint fbuf, fbuf_tex; } chunk_mesh; void scale_texture(unsigned char *src, int x, int y, int w, int h) { int i,j,k; assert(w == 256 && h == 256); for (j=0; j < TEX_SIZE; ++j) { for (i=0; i < TEX_SIZE; ++i) { uint32 val=0; for (k=0; k < 4; ++k) { val >>= 8; val += src[ 4*(x+(i>>2)) + 4*w*(y+(j>>2)) + k]<<24; } texture[j][i] = val; } } } void build_base_texture(int n) { int x,y; uint32 color = stb_rand() | 0x808080; for (y=0; ystate == STATE_valid) { glDeleteTextures(1, &cm->fbuf_tex); glDeleteBuffersARB(1, &cm->vbuf); glDeleteBuffersARB(1, &cm->fbuf); cached_chunk_mesh[slot_y][slot_x].state = STATE_invalid; } } void upload_mesh(chunk_mesh *cm, uint8 *build_buffer, uint8 *face_buffer) { glGenBuffersARB(1, &cm->vbuf); glBindBufferARB(GL_ARRAY_BUFFER_ARB, cm->vbuf); glBufferDataARB(GL_ARRAY_BUFFER_ARB, cm->num_quads*4*sizeof(uint32), build_buffer, GL_STATIC_DRAW_ARB); glBindBufferARB(GL_ARRAY_BUFFER_ARB, 0); glGenBuffersARB(1, &cm->fbuf); glBindBufferARB(GL_TEXTURE_BUFFER_ARB, cm->fbuf); glBufferDataARB(GL_TEXTURE_BUFFER_ARB, cm->num_quads*sizeof(uint32), face_buffer , GL_STATIC_DRAW_ARB); glBindBufferARB(GL_TEXTURE_BUFFER_ARB, 0); glGenTextures(1, &cm->fbuf_tex); glBindTexture(GL_TEXTURE_BUFFER_ARB, cm->fbuf_tex); glTexBufferARB(GL_TEXTURE_BUFFER_ARB, GL_RGBA8UI, cm->fbuf); glBindTexture(GL_TEXTURE_BUFFER_ARB, 0); } static void upload_mesh_data(raw_mesh *rm) { int cx = rm->cx; int cy = rm->cy; int slot_x = (cx >> 1) & (CACHED_MESH_NUM_X-1); int slot_y = (cy >> 1) & (CACHED_MESH_NUM_Y-1); chunk_mesh *cm; free_chunk(slot_x, slot_y); cm = &cached_chunk_mesh[slot_y][slot_x]; cm->num_quads = rm->num_quads; upload_mesh(cm, rm->build_buffer, rm->face_buffer); cm->vbuf_size = rm->num_quads*4*sizeof(uint32); cm->fbuf_size = rm->num_quads*sizeof(uint32); cm->priority = 100000; cm->chunk_x = cx; cm->chunk_y = cy; memcpy(cm->bounds, rm->bounds, sizeof(cm->bounds)); memcpy(cm->transform, rm->transform, sizeof(cm->transform)); // write barrier here cm->state = STATE_valid; } GLint uniform_loc[16]; float table3[128][3]; float table4[64][4]; GLint tablei[2]; float step=0; #ifdef SHORTVIEW int view_dist_in_chunks = 50; #else int view_dist_in_chunks = 80; #endif void setup_uniforms(float pos[3]) { int i,j; step += 1.0f/60.0f; for (i=0; i < STBVOX_UNIFORM_count; ++i) { stbvox_uniform_info raw, *ui=&raw; stbvox_get_uniform_info(&raw, i); uniform_loc[i] = -1; if (i == STBVOX_UNIFORM_texscale || i == STBVOX_UNIFORM_texgen || i == STBVOX_UNIFORM_color_table) continue; if (ui) { void *data = ui->default_value; uniform_loc[i] = stbgl_find_uniform(main_prog, ui->name); switch (i) { case STBVOX_UNIFORM_face_data: tablei[0] = 2; data = tablei; break; case STBVOX_UNIFORM_tex_array: glActiveTextureARB(GL_TEXTURE0_ARB); glBindTexture(GL_TEXTURE_2D_ARRAY_EXT, voxel_tex[0]); glActiveTextureARB(GL_TEXTURE1_ARB); glBindTexture(GL_TEXTURE_2D_ARRAY_EXT, voxel_tex[1]); glActiveTextureARB(GL_TEXTURE0_ARB); tablei[0] = 0; tablei[1] = 1; data = tablei; break; case STBVOX_UNIFORM_color_table: data = ui->default_value; ((float *)data)[63*4+3] = 2.0f; // emissive break; case STBVOX_UNIFORM_camera_pos: data = table3[0]; table3[0][0] = pos[0]; table3[0][1] = pos[1]; table3[0][2] = pos[2]; table3[0][3] = stb_max(0,(float)sin(step*2)*0.125f); break; case STBVOX_UNIFORM_ambient: { float bright = 1.0; //float bright = 0.75; float amb[3][3]; // ambient direction is sky-colored upwards // "ambient" lighting is from above table4[0][0] = 0.3f; table4[0][1] = -0.5f; table4[0][2] = 0.9f; amb[1][0] = 0.3f; amb[1][1] = 0.3f; amb[1][2] = 0.3f; // dark-grey amb[2][0] = 1.0; amb[2][1] = 1.0; amb[2][2] = 1.0; // white // convert so (table[1]*dot+table[2]) gives // above interpolation // lerp((dot+1)/2, amb[1], amb[2]) // amb[1] + (amb[2] - amb[1]) * (dot+1)/2 // amb[1] + (amb[2] - amb[1]) * dot/2 + (amb[2]-amb[1])/2 for (j=0; j < 3; ++j) { table4[1][j] = (amb[2][j] - amb[1][j])/2 * bright; table4[2][j] = (amb[1][j] + amb[2][j])/2 * bright; } // fog color table4[3][0] = 0.6f, table4[3][1] = 0.7f, table4[3][2] = 0.9f; table4[3][3] = 1.0f / (view_dist_in_chunks * 16); table4[3][3] *= table4[3][3]; data = table4; break; } } switch (ui->type) { case STBVOX_UNIFORM_TYPE_sampler: stbglUniform1iv(uniform_loc[i], ui->array_length, data); break; case STBVOX_UNIFORM_TYPE_vec2: stbglUniform2fv(uniform_loc[i], ui->array_length, data); break; case STBVOX_UNIFORM_TYPE_vec3: stbglUniform3fv(uniform_loc[i], ui->array_length, data); break; case STBVOX_UNIFORM_TYPE_vec4: stbglUniform4fv(uniform_loc[i], ui->array_length, data); break; } } } } GLuint unitex[64], unibuf[64]; void make_texture_buffer_for_uniform(int uniform, int slot) { GLenum type; stbvox_uniform_info raw, *ui=&raw; GLint uloc; stbvox_get_uniform_info(ui, uniform); uloc = stbgl_find_uniform(main_prog, ui->name); if (uniform == STBVOX_UNIFORM_color_table) ((float *)ui->default_value)[63*4+3] = 2.0f; // emissive glGenBuffersARB(1, &unibuf[uniform]); glBindBufferARB(GL_ARRAY_BUFFER_ARB, unibuf[uniform]); glBufferDataARB(GL_ARRAY_BUFFER_ARB, ui->array_length * ui->bytes_per_element, ui->default_value, GL_STATIC_DRAW_ARB); glBindBufferARB(GL_ARRAY_BUFFER_ARB, 0); glGenTextures(1, &unitex[uniform]); glBindTexture(GL_TEXTURE_BUFFER_ARB, unitex[uniform]); switch (ui->type) { case STBVOX_UNIFORM_TYPE_vec2: type = GL_RG32F; break; case STBVOX_UNIFORM_TYPE_vec3: type = GL_RGB32F; break; case STBVOX_UNIFORM_TYPE_vec4: type = GL_RGBA32F; break; default: assert(0); } glTexBufferARB(GL_TEXTURE_BUFFER_ARB, type, unibuf[uniform]); glBindTexture(GL_TEXTURE_BUFFER_ARB, 0); glActiveTextureARB(GL_TEXTURE0 + slot); glBindTexture(GL_TEXTURE_BUFFER_ARB, unitex[uniform]); glActiveTextureARB(GL_TEXTURE0); stbglUseProgram(main_prog); stbglUniform1i(uloc, slot); } #define MAX_MESH_WORKERS 8 #define MAX_CHUNK_LOAD_WORKERS 2 int num_mesh_workers; int num_chunk_load_workers; typedef struct { int state; int request_cx; int request_cy; int padding[13]; SDL_sem * request_received; SDL_sem * chunk_server_done_processing; int chunk_action; int chunk_request_x; int chunk_request_y; fast_chunk *chunks[4][4]; int padding2[16]; raw_mesh rm; int padding3[16]; uint8 *build_buffer; uint8 *face_buffer ; } mesh_worker; enum { WSTATE_idle, WSTATE_requested, WSTATE_running, WSTATE_mesh_ready, }; mesh_worker mesh_data[MAX_MESH_WORKERS]; int num_meshes_started; // stats int request_chunk(int chunk_x, int chunk_y); void update_meshes_from_render_thread(void); unsigned char tex2_data[64][4]; void init_tex2_gradient(void) { int i; for (i=0; i < 16; ++i) { tex2_data[i+ 0][0] = 64 + 12*i; tex2_data[i+ 0][1] = 32; tex2_data[i+ 0][2] = 64; tex2_data[i+16][0] = 255; tex2_data[i+16][1] = 32 + 8*i; tex2_data[i+16][2] = 64; tex2_data[i+32][0] = 255; tex2_data[i+32][1] = 160; tex2_data[i+32][2] = 64 + 12*i; tex2_data[i+48][0] = 255; tex2_data[i+48][1] = 160 + 6*i; tex2_data[i+48][2] = 255; } } void set_tex2_alpha(float fa) { int i; int a = (int) stb_lerp(fa, 0, 255); if (a < 0) a = 0; else if (a > 255) a = 255; glBindTexture(GL_TEXTURE_2D_ARRAY_EXT, voxel_tex[1]); for (i=0; i < 64; ++i) { tex2_data[i][3] = a; glTexSubImage3DEXT(GL_TEXTURE_2D_ARRAY_EXT, 0, 0,0,i, 1,1,1, GL_RGBA, GL_UNSIGNED_BYTE, tex2_data[i]); } } void render_init(void) { int i; char *binds[] = { "attr_vertex", "attr_face", NULL }; char *vertex; char *fragment; int w=0,h=0; unsigned char *texdata = stbi_load("terrain.png", &w, &h, NULL, 4); stbvox_init_mesh_maker(&g_mesh_maker); for (i=0; i < num_mesh_workers; ++i) { stbvox_init_mesh_maker(&mesh_data[i].rm.mm); } vertex = stbvox_get_vertex_shader(); fragment = stbvox_get_fragment_shader(); { char error_buffer[1024]; char *main_vertex[] = { vertex, NULL }; char *main_fragment[] = { fragment, NULL }; main_prog = stbgl_create_program(main_vertex, main_fragment, binds, error_buffer, sizeof(error_buffer)); if (main_prog == 0) { ods("Compile error for main shader: %s\n", error_buffer); assert(0); exit(1); } } //init_index_buffer(); make_texture_buffer_for_uniform(STBVOX_UNIFORM_texscale , 3); make_texture_buffer_for_uniform(STBVOX_UNIFORM_texgen , 4); make_texture_buffer_for_uniform(STBVOX_UNIFORM_color_table , 5); glGenTextures(2, voxel_tex); glBindTexture(GL_TEXTURE_2D_ARRAY_EXT, voxel_tex[0]); glTexImage3DEXT(GL_TEXTURE_2D_ARRAY_EXT, 0, GL_RGBA, TEX_SIZE,TEX_SIZE,256, 0,GL_RGBA,GL_UNSIGNED_BYTE,NULL); for (i=0; i < 256; ++i) { if (texdata) scale_texture(texdata, (i&15)*w/16, (h/16)*(i>>4), w,h); else build_base_texture(i); glTexSubImage3DEXT(GL_TEXTURE_2D_ARRAY_EXT, 0, 0,0,i, TEX_SIZE,TEX_SIZE,1, GL_RGBA, GL_UNSIGNED_BYTE, texture[0]); } glTexParameteri(GL_TEXTURE_2D_ARRAY_EXT, GL_TEXTURE_MIN_FILTER, GL_LINEAR_MIPMAP_LINEAR); glTexParameteri(GL_TEXTURE_2D_ARRAY_EXT, GL_TEXTURE_MAG_FILTER, GL_LINEAR); glTexParameteri(GL_TEXTURE_2D_ARRAY_EXT, GL_TEXTURE_MAX_ANISOTROPY_EXT, 16); #ifdef STBVOX_CONFIG_TEX1_EDGE_CLAMP glTexParameteri(GL_TEXTURE_2D_ARRAY_EXT, GL_TEXTURE_WRAP_S, GL_CLAMP_TO_EDGE); glTexParameteri(GL_TEXTURE_2D_ARRAY_EXT, GL_TEXTURE_WRAP_T, GL_CLAMP_TO_EDGE); #endif glGenerateMipmapEXT(GL_TEXTURE_2D_ARRAY_EXT); glBindTexture(GL_TEXTURE_2D_ARRAY_EXT, voxel_tex[1]); glTexImage3DEXT(GL_TEXTURE_2D_ARRAY_EXT, 0, GL_RGBA, 1,1,64, 0,GL_RGBA,GL_UNSIGNED_BYTE,NULL); init_tex2_gradient(); set_tex2_alpha(0.0); #if 0 for (i=0; i < 128; ++i) { //build_overlay_texture(i); glTexSubImage3DEXT(GL_TEXTURE_2D_ARRAY_EXT, 0, 0,0,i, TEX_SIZE,TEX_SIZE,1, GL_RGBA, GL_UNSIGNED_BYTE, texture[0]); } #endif glTexParameteri(GL_TEXTURE_2D_ARRAY_EXT, GL_TEXTURE_MIN_FILTER, GL_LINEAR_MIPMAP_LINEAR); glTexParameteri(GL_TEXTURE_2D_ARRAY_EXT, GL_TEXTURE_MAG_FILTER, GL_LINEAR); glGenerateMipmapEXT(GL_TEXTURE_2D_ARRAY_EXT); } void world_init(void) { int a,b,x,y; Uint64 start_time, end_time; #ifdef NDEBUG int range = 32; #else int range = 12; #endif start_time = SDL_GetPerformanceCounter(); // iterate in 8x8 clusters of qchunks at a time to get better converted-chunk-cache reuse // than a purely row-by-row ordering is (single-threaded this is a bigger win than // any of the above optimizations were, since it halves zlib/mc-conversion costs) for (x=-range; x <= range; x += 16) for (y=-range; y <= range; y += 16) for (b=y; b < y+16 && b <= range; b += 2) for (a=x; a < x+16 && a <= range; a += 2) while (!request_chunk(a, b)) { // if request fails, all threads are busy update_meshes_from_render_thread(); SDL_Delay(1); } // wait until all the workers are done, // (this is only needed if we want to time // when the build finishes, or when we want to reset the // cache size; otherwise we could just go ahead and // start rendering whatever we've got) for(;;) { int i; update_meshes_from_render_thread(); for (i=0; i < num_mesh_workers; ++i) if (mesh_data[i].state != WSTATE_idle) break; if (i == num_mesh_workers) break; SDL_Delay(3); } end_time = SDL_GetPerformanceCounter(); ods("Build time: %7.2fs\n", (end_time - start_time) / (float) SDL_GetPerformanceFrequency()); // don't waste lots of storage on chunk caches once it's finished starting-up; // this was only needed to be this large because we worked in large blocks // to maximize sharing reset_cache_size(32); } extern SDL_mutex * chunk_cache_mutex; int mesh_worker_handler(void *data) { mesh_worker *mw = data; mw->face_buffer = malloc(FACE_BUFFER_SIZE); mw->build_buffer = malloc(BUILD_BUFFER_SIZE); // this loop only works because the compiler can't // tell that the SDL_calls don't access mw->state; // really we should barrier that stuff for(;;) { int i,j; int cx,cy; // wait for a chunk request SDL_SemWait(mw->request_received); // analyze the chunk request assert(mw->state == WSTATE_requested); cx = mw->request_cx; cy = mw->request_cy; // this is inaccurate as it can block while another thread has the cache locked mw->state = WSTATE_running; // get the chunks we need (this takes a lock and caches them) for (j=0; j < 4; ++j) for (i=0; i < 4; ++i) mw->chunks[j][i] = get_converted_fastchunk(cx-1 + i, cy-1 + j); // build the mesh based on the chunks mw->rm.build_buffer = mw->build_buffer; mw->rm.face_buffer = mw->face_buffer; build_chunk(cx, cy, mw->chunks, &mw->rm); mw->state = WSTATE_mesh_ready; // don't need to notify of this, because it gets polled // when done, free the chunks // for efficiency we just take the mutex once around the whole thing, // though this spreads the mutex logic over two files SDL_LockMutex(chunk_cache_mutex); for (j=0; j < 4; ++j) for (i=0; i < 4; ++i) { deref_fastchunk(mw->chunks[j][i]); mw->chunks[j][i] = NULL; } SDL_UnlockMutex(chunk_cache_mutex); } return 0; } int request_chunk(int chunk_x, int chunk_y) { int i; for (i=0; i < num_mesh_workers; ++i) { mesh_worker *mw = &mesh_data[i]; if (mw->state == WSTATE_idle) { mw->request_cx = chunk_x; mw->request_cy = chunk_y; mw->state = WSTATE_requested; SDL_SemPost(mw->request_received); ++num_meshes_started; return 1; } } return 0; } void prepare_threads(void) { int i; int num_proc = SDL_GetCPUCount(); if (num_proc > 6) num_mesh_workers = num_proc/2; else if (num_proc > 4) num_mesh_workers = 4; else num_mesh_workers = num_proc-1; // @TODO // Thread usage is probably pretty terrible; need to make a // separate queue of needed chunks, instead of just generating // one request per thread per frame, and a separate queue of // results. (E.g. If it takes 1.5 frames to build mesh, thread // is idle for 0.5 frames.) To fake this for now, I've just // doubled the number of threads to let those serve as a 'queue', // but that's dumb. num_mesh_workers *= 2; // try to get better thread usage if (num_mesh_workers > MAX_MESH_WORKERS) num_mesh_workers = MAX_MESH_WORKERS; for (i=0; i < num_mesh_workers; ++i) { mesh_worker *data = &mesh_data[i]; data->request_received = SDL_CreateSemaphore(0); data->chunk_server_done_processing = SDL_CreateSemaphore(0); SDL_CreateThread(mesh_worker_handler, "mesh worker", data); } } // "better" buffer uploading #if 0 if (glBufferStorage) { glDeleteBuffersARB(1, &vb->vbuf); glGenBuffersARB(1, &vb->vbuf); glBindBufferARB(GL_ARRAY_BUFFER_ARB, vb->vbuf); glBufferStorage(GL_ARRAY_BUFFER_ARB, sizeof(build_buffer), build_buffer, 0); glBindBufferARB(GL_ARRAY_BUFFER_ARB, 0); } else { glBindBufferARB(GL_ARRAY_BUFFER_ARB, vb->vbuf); glBufferDataARB(GL_ARRAY_BUFFER_ARB, sizeof(build_buffer), build_buffer, GL_STATIC_DRAW_ARB); glBindBufferARB(GL_ARRAY_BUFFER_ARB, 0); } #endif typedef struct { float x,y,z,w; } plane; static plane frustum[6]; static void matd_mul(double out[4][4], double src1[4][4], double src2[4][4]) { int i,j,k; for (j=0; j < 4; ++j) { for (i=0; i < 4; ++i) { double t=0; for (k=0; k < 4; ++k) t += src1[k][i] * src2[j][k]; out[i][j] = t; } } } // https://fgiesen.wordpress.com/2012/08/31/frustum-planes-from-the-projection-matrix/ static void compute_frustum(void) { int i; GLdouble mv[4][4],proj[4][4], mvproj[4][4]; glGetDoublev(GL_MODELVIEW_MATRIX , mv[0]); glGetDoublev(GL_PROJECTION_MATRIX, proj[0]); matd_mul(mvproj, proj, mv); for (i=0; i < 4; ++i) { (&frustum[0].x)[i] = (float) (mvproj[3][i] + mvproj[0][i]); (&frustum[1].x)[i] = (float) (mvproj[3][i] - mvproj[0][i]); (&frustum[2].x)[i] = (float) (mvproj[3][i] + mvproj[1][i]); (&frustum[3].x)[i] = (float) (mvproj[3][i] - mvproj[1][i]); (&frustum[4].x)[i] = (float) (mvproj[3][i] + mvproj[2][i]); (&frustum[5].x)[i] = (float) (mvproj[3][i] - mvproj[2][i]); } } static int test_plane(plane *p, float x0, float y0, float z0, float x1, float y1, float z1) { // return false if the box is entirely behind the plane float d=0; assert(x0 <= x1 && y0 <= y1 && z0 <= z1); if (p->x > 0) d += x1*p->x; else d += x0*p->x; if (p->y > 0) d += y1*p->y; else d += y0*p->y; if (p->z > 0) d += z1*p->z; else d += z0*p->z; return d + p->w >= 0; } static int is_box_in_frustum(float *bmin, float *bmax) { int i; for (i=0; i < 6; ++i) if (!test_plane(&frustum[i], bmin[0], bmin[1], bmin[2], bmax[0], bmax[1], bmax[2])) return 0; return 1; } float compute_priority(int cx, int cy, float x, float y) { float distx, disty, dist2; distx = (cx*16+8) - x; disty = (cy*16+8) - y; dist2 = distx*distx + disty*disty; return view_dist_in_chunks*view_dist_in_chunks * 16 * 16 - dist2; } int chunk_locations, chunks_considered, chunks_in_frustum; int quads_considered, quads_rendered; int chunk_storage_rendered, chunk_storage_considered, chunk_storage_total; int update_frustum = 1; #ifdef SHORTVIEW int max_chunk_storage = 450 << 20; int min_chunk_storage = 350 << 20; #else int max_chunk_storage = 900 << 20; int min_chunk_storage = 800 << 20; #endif float min_priority = -500; // this really wants to be in unit space, not squared space int num_meshes_uploaded; void update_meshes_from_render_thread(void) { int i; for (i=0; i < num_mesh_workers; ++i) { mesh_worker *mw = &mesh_data[i]; if (mw->state == WSTATE_mesh_ready) { upload_mesh_data(&mw->rm); ++num_meshes_uploaded; mw->state = WSTATE_idle; } } } extern float tex2_alpha; extern int global_hack; int num_threads_active; float chunk_server_activity; void render_caves(float campos[3]) { float x = campos[0], y = campos[1]; int qchunk_x, qchunk_y; int cam_x, cam_y; int i,j, rad; compute_frustum(); chunk_locations = chunks_considered = chunks_in_frustum = 0; quads_considered = quads_rendered = 0; chunk_storage_total = chunk_storage_considered = chunk_storage_rendered = 0; cam_x = (int) floor(x+0.5); cam_y = (int) floor(y+0.5); qchunk_x = (((int) floor(x)+16) >> 5) << 1; qchunk_y = (((int) floor(y)+16) >> 5) << 1; glEnable(GL_ALPHA_TEST); glAlphaFunc(GL_GREATER, 0.5); stbglUseProgram(main_prog); setup_uniforms(campos); // set uniforms to default values inefficiently glActiveTextureARB(GL_TEXTURE2_ARB); stbglEnableVertexAttribArray(0); { float lighting[2][3] = { { campos[0],campos[1],campos[2] }, { 0.75,0.75,0.65f } }; float bright = 8; lighting[1][0] *= bright; lighting[1][1] *= bright; lighting[1][2] *= bright; stbglUniform3fv(stbgl_find_uniform(main_prog, "light_source"), 2, lighting[0]); } if (global_hack) set_tex2_alpha(tex2_alpha); num_meshes_uploaded = 0; update_meshes_from_render_thread(); // traverse all in-range chunks and analyze them for (j=-view_dist_in_chunks; j <= view_dist_in_chunks; j += 2) { for (i=-view_dist_in_chunks; i <= view_dist_in_chunks; i += 2) { float priority; int cx = qchunk_x + i; int cy = qchunk_y + j; priority = compute_priority(cx, cy, x, y); if (priority >= min_priority) { int slot_x = (cx>>1) & (CACHED_MESH_NUM_X-1); int slot_y = (cy>>1) & (CACHED_MESH_NUM_Y-1); chunk_mesh *cm = &cached_chunk_mesh[slot_y][slot_x]; ++chunk_locations; if (cm->state == STATE_valid && priority >= 0) { // check if chunk pos actually matches if (cm->chunk_x != cx || cm->chunk_y != cy) { // we have a stale chunk we need to recreate free_chunk(slot_x, slot_y); // it probably will have already gotten freed, but just in case } } if (cm->state == STATE_invalid) { cm->chunk_x = cx; cm->chunk_y = cy; cm->state = STATE_needed; } cm->priority = priority; } } } // draw front-to-back for (rad = 0; rad <= view_dist_in_chunks; rad += 2) { for (j=-rad; j <= rad; j += 2) { // if j is +- rad, then iterate i through all values // if j isn't +-rad, then i should be only -rad & rad int step = 2; if (abs(j) != rad) step = 2*rad; for (i=-rad; i <= rad; i += step) { int cx = qchunk_x + i; int cy = qchunk_y + j; int slot_x = (cx>>1) & (CACHED_MESH_NUM_X-1); int slot_y = (cy>>1) & (CACHED_MESH_NUM_Y-1); chunk_mesh *cm = &cached_chunk_mesh[slot_y][slot_x]; if (cm->state == STATE_valid && cm->priority >= 0) { ++chunks_considered; quads_considered += cm->num_quads; if (is_box_in_frustum(cm->bounds[0], cm->bounds[1])) { ++chunks_in_frustum; // @TODO if in range stbglUniform3fv(uniform_loc[STBVOX_UNIFORM_transform], 3, cm->transform[0]); glBindBufferARB(GL_ARRAY_BUFFER_ARB, cm->vbuf); glVertexAttribIPointer(0, 1, GL_UNSIGNED_INT, 4, (void*) 0); glBindTexture(GL_TEXTURE_BUFFER_ARB, cm->fbuf_tex); glDrawArrays(GL_QUADS, 0, cm->num_quads*4); quads_rendered += cm->num_quads; chunk_storage_rendered += cm->vbuf_size + cm->fbuf_size; } chunk_storage_considered += cm->vbuf_size + cm->fbuf_size; } } } } stbglDisableVertexAttribArray(0); glBindBufferARB(GL_ARRAY_BUFFER_ARB, 0); glActiveTextureARB(GL_TEXTURE0_ARB); stbglUseProgram(0); num_meshes_started = 0; { #define MAX_QUEUE 8 float highest_priority[MAX_QUEUE]; int highest_i[MAX_QUEUE], highest_j[MAX_QUEUE]; float lowest_priority = view_dist_in_chunks * view_dist_in_chunks * 16 * 16.0f; int lowest_i = -1, lowest_j = -1; for (i=0; i < MAX_QUEUE; ++i) { highest_priority[i] = min_priority; highest_i[i] = -1; highest_j[i] = -1; } for (j=0; j < CACHED_MESH_NUM_Y; ++j) { for (i=0; i < CACHED_MESH_NUM_X; ++i) { chunk_mesh *cm = &cached_chunk_mesh[j][i]; if (cm->state == STATE_valid) { cm->priority = compute_priority(cm->chunk_x, cm->chunk_y, x, y); chunk_storage_total += cm->vbuf_size + cm->fbuf_size; if (cm->priority < lowest_priority) { lowest_priority = cm->priority; lowest_i = i; lowest_j = j; } } if (cm->state == STATE_needed) { cm->priority = compute_priority(cm->chunk_x, cm->chunk_y, x, y); if (cm->priority < min_priority) cm->state = STATE_invalid; else if (cm->priority > highest_priority[0]) { int k; highest_priority[0] = cm->priority; highest_i[0] = i; highest_j[0] = j; // bubble this up to right place for (k=0; k < MAX_QUEUE-1; ++k) { if (highest_priority[k] > highest_priority[k+1]) { highest_priority[k] = highest_priority[k+1]; highest_priority[k+1] = cm->priority; highest_i[k] = highest_i[k+1]; highest_i[k+1] = i; highest_j[k] = highest_j[k+1]; highest_j[k+1] = j; } else { break; } } } } } } // I couldn't find any straightforward logic that avoids // the hysteresis problem of continually creating & freeing // a block on the margin, so I just don't free a block until // it's out of range, but this doesn't actually correctly // handle when the cache is too small for the given range if (chunk_storage_total >= min_chunk_storage && lowest_i >= 0) { if (cached_chunk_mesh[lowest_j][lowest_i].priority < -1200) // -1000? 0? free_chunk(lowest_i, lowest_j); } if (chunk_storage_total < max_chunk_storage && highest_i[0] >= 0) { for (j=MAX_QUEUE-1; j >= 0; --j) { if (highest_j[0] >= 0) { chunk_mesh *cm = &cached_chunk_mesh[highest_j[j]][highest_i[j]]; if (request_chunk(cm->chunk_x, cm->chunk_y)) { cm->state = STATE_requested; } else { // if we couldn't queue this one, skip the remainder break; } } } } } update_meshes_from_render_thread(); num_threads_active = 0; for (i=0; i < num_mesh_workers; ++i) { num_threads_active += (mesh_data[i].state == WSTATE_running); } } uTox/third_party/stb/stb/tests/caveview/cave_parse.h0000600000175000001440000000171514003056224021646 0ustar rakusers#ifndef INCLUDE_CAVE_PARSE_H #define INCLUDE_CAVE_PARSE_H typedef struct { unsigned char block; unsigned char data; unsigned char light:4; unsigned char skylight:4; } raw_block; // this is the old fully-decoded chunk typedef struct { int xpos, zpos, max_y; int height[16][16]; raw_block rb[16][16][256]; // [z][x][y] which becomes [y][x][z] in stb } chunk; chunk *get_decoded_chunk(int chunk_x, int chunk_z); #define NUM_SEGMENTS 16 typedef struct { int max_y, xpos, zpos; unsigned char *blockdata[NUM_SEGMENTS]; unsigned char *data[NUM_SEGMENTS]; unsigned char *skylight[NUM_SEGMENTS]; unsigned char *light[NUM_SEGMENTS]; void *pointer_to_free; int refcount; // this allows multi-threaded building without wrapping in ANOTHER struct } fast_chunk; fast_chunk *get_decoded_fastchunk(int chunk_x, int chunk_z); // cache, never call free() fast_chunk *get_decoded_fastchunk_uncached(int chunk_x, int chunk_z); #endif uTox/third_party/stb/stb/tests/caveview/cave_parse.c0000600000175000001440000004151314003056224021641 0ustar rakusers#include #include #include #include #define FAST_CHUNK // disabling this enables the old, slower path that deblocks into a regular form #include "cave_parse.h" #include "stb_image.h" #include "stb.h" #define NUM_CHUNKS_PER_REGION 32 // only on one axis #define NUM_CHUNKS_PER_REGION_LOG2 5 #define NUM_COLUMNS_PER_CHUNK 16 #define NUM_COLUMNS_PER_CHUNK_LOG2 4 uint32 read_uint32_be(FILE *f) { unsigned char data[4]; fread(data, 1, 4, f); return (data[0]<<24) + (data[1]<<16) + (data[2]<<8) + data[3]; } typedef struct { uint8 *data; size_t len; int x,z; // chunk index int refcount; // for multi-threading } compressed_chunk; typedef struct { int x,z; uint32 sector_data[NUM_CHUNKS_PER_REGION][NUM_CHUNKS_PER_REGION]; } region; size_t cached_compressed=0; FILE *last_region; int last_region_x; int last_region_z; int opened=0; static void open_file(int reg_x, int reg_z) { if (!opened || last_region_x != reg_x || last_region_z != reg_z) { char filename[256]; if (last_region != NULL) fclose(last_region); sprintf(filename, "r.%d.%d.mca", reg_x, reg_z); last_region = fopen(filename, "rb"); last_region_x = reg_x; last_region_z = reg_z; opened = 1; } } static region *load_region(int reg_x, int reg_z) { region *r; int x,z; open_file(reg_x, reg_z); r = malloc(sizeof(*r)); if (last_region == NULL) { memset(r, 0, sizeof(*r)); } else { fseek(last_region, 0, SEEK_SET); for (z=0; z < NUM_CHUNKS_PER_REGION; ++z) for (x=0; x < NUM_CHUNKS_PER_REGION; ++x) r->sector_data[z][x] = read_uint32_be(last_region); } r->x = reg_x; r->z = reg_z; return r; } void free_region(region *r) { free(r); } #define MAX_MAP_REGIONS 64 // in one axis: 64 regions * 32 chunk/region * 16 columns/chunk = 16384 columns region *regions[MAX_MAP_REGIONS][MAX_MAP_REGIONS]; static region *get_region(int reg_x, int reg_z) { int slot_x = reg_x & (MAX_MAP_REGIONS-1); int slot_z = reg_z & (MAX_MAP_REGIONS-1); region *r; r = regions[slot_z][slot_x]; if (r) { if (r->x == reg_x && r->z == reg_z) return r; free_region(r); } r = load_region(reg_x, reg_z); regions[slot_z][slot_x] = r; return r; } // about one region, so size should be ok #define NUM_CACHED_X 64 #define NUM_CACHED_Z 64 // @TODO: is it really worth caching these? we probably can just // pull them from the disk cache nearly as efficiently. // Can test that by setting to 1x1? compressed_chunk *cached_chunk[NUM_CACHED_Z][NUM_CACHED_X]; static void deref_compressed_chunk(compressed_chunk *cc) { assert(cc->refcount > 0); --cc->refcount; if (cc->refcount == 0) { if (cc->data) free(cc->data); free(cc); } } static compressed_chunk *get_compressed_chunk(int chunk_x, int chunk_z) { int slot_x = chunk_x & (NUM_CACHED_X-1); int slot_z = chunk_z & (NUM_CACHED_Z-1); compressed_chunk *cc = cached_chunk[slot_z][slot_x]; if (cc && cc->x == chunk_x && cc->z == chunk_z) return cc; else { int reg_x = chunk_x >> NUM_CHUNKS_PER_REGION_LOG2; int reg_z = chunk_z >> NUM_CHUNKS_PER_REGION_LOG2; region *r = get_region(reg_x, reg_z); if (cc) { deref_compressed_chunk(cc); cached_chunk[slot_z][slot_x] = NULL; } cc = malloc(sizeof(*cc)); cc->x = chunk_x; cc->z = chunk_z; { int subchunk_x = chunk_x & (NUM_CHUNKS_PER_REGION-1); int subchunk_z = chunk_z & (NUM_CHUNKS_PER_REGION-1); uint32 code = r->sector_data[subchunk_z][subchunk_x]; if (code & 255) { open_file(reg_x, reg_z); fseek(last_region, (code>>8)*4096, SEEK_SET); cc->len = (code&255)*4096; cc->data = malloc(cc->len); fread(cc->data, 1, cc->len, last_region); } else { cc->len = 0; cc->data = 0; } } cc->refcount = 1; cached_chunk[slot_z][slot_x] = cc; return cc; } } // NBT parser -- can automatically parse stuff we don't // have definitions for, but want to explicitly parse // stuff we do have definitions for. // // option 1: auto-parse everything into data structures, // then read those // // option 2: have a "parse next object" which // doesn't resolve whether it expands its children // yet, and then the user either says "expand" or // "skip" after looking at the name. Anything with // "children" without names can't go through this // interface. // // Let's try option 2. typedef struct { unsigned char *buffer_start; unsigned char *buffer_end; unsigned char *cur; int nesting; char temp_buffer[256]; } nbt; enum { TAG_End=0, TAG_Byte=1, TAG_Short=2, TAG_Int=3, TAG_Long=4, TAG_Float=5, TAG_Double=6, TAG_Byte_Array=7, TAG_String=8, TAG_List=9, TAG_Compound=10, TAG_Int_Array=11 }; static void nbt_get_string_data(unsigned char *data, char *buffer, size_t bufsize) { int len = data[0]*256 + data[1]; int i; for (i=0; i < len && i+1 < (int) bufsize; ++i) buffer[i] = (char) data[i+2]; buffer[i] = 0; } static char *nbt_peek(nbt *n) { unsigned char type = *n->cur; if (type == TAG_End) return NULL; nbt_get_string_data(n->cur+1, n->temp_buffer, sizeof(n->temp_buffer)); return n->temp_buffer; } static uint32 nbt_parse_uint32(unsigned char *buffer) { return (buffer[0] << 24) + (buffer[1]<<16) + (buffer[2]<<8) + buffer[3]; } static void nbt_skip(nbt *n); // skip an item that doesn't have an id or name prefix (usable in lists) static void nbt_skip_raw(nbt *n, unsigned char type) { switch (type) { case TAG_Byte : n->cur += 1; break; case TAG_Short : n->cur += 2; break; case TAG_Int : n->cur += 4; break; case TAG_Long : n->cur += 8; break; case TAG_Float : n->cur += 4; break; case TAG_Double: n->cur += 8; break; case TAG_Byte_Array: n->cur += 4 + 1*nbt_parse_uint32(n->cur); break; case TAG_Int_Array : n->cur += 4 + 4*nbt_parse_uint32(n->cur); break; case TAG_String : n->cur += 2 + (n->cur[0]*256 + n->cur[1]); break; case TAG_List : { unsigned char list_type = *n->cur++; unsigned int list_len = nbt_parse_uint32(n->cur); unsigned int i; n->cur += 4; // list_len for (i=0; i < list_len; ++i) nbt_skip_raw(n, list_type); break; } case TAG_Compound : { while (*n->cur != TAG_End) nbt_skip(n); nbt_skip(n); // skip the TAG_end break; } } assert(n->cur <= n->buffer_end); } static void nbt_skip(nbt *n) { unsigned char type = *n->cur++; if (type == TAG_End) return; // skip name n->cur += (n->cur[0]*256 + n->cur[1]) + 2; nbt_skip_raw(n, type); } // byteswap static void nbt_swap(unsigned char *ptr, int len) { int i; for (i=0; i < (len>>1); ++i) { unsigned char t = ptr[i]; ptr[i] = ptr[len-1-i]; ptr[len-1-i] = t; } } // pass in the expected type, fail if doesn't match // returns a pointer to the data, byteswapped if appropriate static void *nbt_get_fromlist(nbt *n, unsigned char type, int *len) { unsigned char *ptr; assert(type != TAG_Compound); assert(type != TAG_List); // we could support getting lists of primitives as if they were arrays, but eh if (len) *len = 1; ptr = n->cur; switch (type) { case TAG_Byte : break; case TAG_Short : nbt_swap(ptr, 2); break; case TAG_Int : nbt_swap(ptr, 4); break; case TAG_Long : nbt_swap(ptr, 8); break; case TAG_Float : nbt_swap(ptr, 4); break; case TAG_Double: nbt_swap(ptr, 8); break; case TAG_Byte_Array: *len = nbt_parse_uint32(ptr); ptr += 4; break; case TAG_Int_Array: { int i; *len = nbt_parse_uint32(ptr); ptr += 4; for (i=0; i < *len; ++i) nbt_swap(ptr + 4*i, 4); break; } default: assert(0); // unhandled case } nbt_skip_raw(n, type); return ptr; } static void *nbt_get(nbt *n, unsigned char type, int *len) { assert(n->cur[0] == type); n->cur += 3 + (n->cur[1]*256+n->cur[2]); return nbt_get_fromlist(n, type, len); } static void nbt_begin_compound(nbt *n) // start a compound { assert(*n->cur == TAG_Compound); // skip header n->cur += 3 + (n->cur[1]*256 + n->cur[2]); ++n->nesting; } static void nbt_begin_compound_in_list(nbt *n) // start a compound { ++n->nesting; } static void nbt_end_compound(nbt *n) // end a compound { assert(*n->cur == TAG_End); assert(n->nesting != 0); ++n->cur; --n->nesting; } // @TODO no interface to get lists from lists static int nbt_begin_list(nbt *n, unsigned char type) { uint32 len; unsigned char *ptr; ptr = n->cur + 3 + (n->cur[1]*256 + n->cur[2]); if (ptr[0] != type) return -1; n->cur = ptr; len = nbt_parse_uint32(n->cur+1); assert(n->cur[0] == type); // @TODO keep a stack with the count to make sure they do it right ++n->nesting; n->cur += 5; return (int) len; } static void nbt_end_list(nbt *n) { --n->nesting; } // raw_block chunk is 16x256x16x4 = 2^(4+8+4+2) = 256KB // // if we want to process 64x64x256 at a time, that will be: // 4*4*256KB => 4MB per area in raw_block // // (plus we maybe need to decode adjacent regions) #ifdef FAST_CHUNK typedef fast_chunk parse_chunk; #else typedef chunk parse_chunk; #endif static parse_chunk *minecraft_chunk_parse(unsigned char *data, size_t len) { char *s; parse_chunk *c = NULL; nbt n_store, *n = &n_store; n->buffer_start = data; n->buffer_end = data + len; n->cur = n->buffer_start; n->nesting = 0; nbt_begin_compound(n); while ((s = nbt_peek(n)) != NULL) { if (!strcmp(s, "Level")) { int *height; c = malloc(sizeof(*c)); #ifdef FAST_CHUNK memset(c, 0, sizeof(*c)); c->pointer_to_free = data; #else c->rb[15][15][255].block = 0; #endif c->max_y = 0; nbt_begin_compound(n); while ((s = nbt_peek(n)) != NULL) { if (!strcmp(s, "xPos")) c->xpos = *(int *) nbt_get(n, TAG_Int, 0); else if (!strcmp(s, "zPos")) c->zpos = *(int *) nbt_get(n, TAG_Int, 0); else if (!strcmp(s, "Sections")) { int count = nbt_begin_list(n, TAG_Compound), i; if (count == -1) { // this not-a-list case happens in The End and I'm not sure // what it means... possibly one of those silly encodings // where it's not encoded as a list if there's only one? // not worth figuring out nbt_skip(n); count = -1; } for (i=0; i < count; ++i) { int yi, len; uint8 *light = NULL, *blocks = NULL, *data = NULL, *skylight = NULL; nbt_begin_compound_in_list(n); while ((s = nbt_peek(n)) != NULL) { if (!strcmp(s, "Y")) yi = * (uint8 *) nbt_get(n, TAG_Byte, 0); else if (!strcmp(s, "BlockLight")) { light = nbt_get(n, TAG_Byte_Array, &len); assert(len == 2048); } else if (!strcmp(s, "Blocks")) { blocks = nbt_get(n, TAG_Byte_Array, &len); assert(len == 4096); } else if (!strcmp(s, "Data")) { data = nbt_get(n, TAG_Byte_Array, &len); assert(len == 2048); } else if (!strcmp(s, "SkyLight")) { skylight = nbt_get(n, TAG_Byte_Array, &len); assert(len == 2048); } } nbt_end_compound(n); assert(yi < 16); #ifndef FAST_CHUNK // clear data below current max_y { int x,z; while (c->max_y < yi*16) { for (x=0; x < 16; ++x) for (z=0; z < 16; ++z) c->rb[z][x][c->max_y].block = 0; ++c->max_y; } } // now assemble the data { int x,y,z, o2=0,o4=0; for (y=0; y < 16; ++y) { for (z=0; z < 16; ++z) { for (x=0; x < 16; x += 2) { raw_block *rb = &c->rb[15-z][x][y + yi*16]; // 15-z because switching to z-up will require flipping an axis rb[0].block = blocks[o4]; rb[0].light = light[o2] & 15; rb[0].data = data[o2] & 15; rb[0].skylight = skylight[o2] & 15; rb[256].block = blocks[o4+1]; rb[256].light = light[o2] >> 4; rb[256].data = data[o2] >> 4; rb[256].skylight = skylight[o2] >> 4; o2 += 1; o4 += 2; } } } c->max_y += 16; } #else c->blockdata[yi] = blocks; c->data [yi] = data; c->light [yi] = light; c->skylight [yi] = skylight; #endif } //nbt_end_list(n); } else if (!strcmp(s, "HeightMap")) { height = nbt_get(n, TAG_Int_Array, &len); assert(len == 256); } else nbt_skip(n); } nbt_end_compound(n); } else nbt_skip(n); } nbt_end_compound(n); assert(n->cur == n->buffer_end); return c; } #define MAX_DECODED_CHUNK_X 64 #define MAX_DECODED_CHUNK_Z 64 typedef struct { int cx,cz; fast_chunk *fc; int valid; } decoded_buffer; static decoded_buffer decoded_buffers[MAX_DECODED_CHUNK_Z][MAX_DECODED_CHUNK_X]; void lock_chunk_get_mutex(void); void unlock_chunk_get_mutex(void); #ifdef FAST_CHUNK fast_chunk *get_decoded_fastchunk_uncached(int chunk_x, int chunk_z) { unsigned char *decoded; compressed_chunk *cc; int inlen; int len; fast_chunk *fc; lock_chunk_get_mutex(); cc = get_compressed_chunk(chunk_x, chunk_z); if (cc->len != 0) ++cc->refcount; unlock_chunk_get_mutex(); if (cc->len == 0) return NULL; assert(cc != NULL); assert(cc->data[4] == 2); inlen = nbt_parse_uint32(cc->data); decoded = stbi_zlib_decode_malloc_guesssize(cc->data+5, inlen, inlen*3, &len); assert(decoded != NULL); assert(len != 0); lock_chunk_get_mutex(); deref_compressed_chunk(cc); unlock_chunk_get_mutex(); #ifdef FAST_CHUNK fc = minecraft_chunk_parse(decoded, len); #else fc = NULL; #endif if (fc == NULL) free(decoded); return fc; } decoded_buffer *get_decoded_buffer(int chunk_x, int chunk_z) { decoded_buffer *db = &decoded_buffers[chunk_z&(MAX_DECODED_CHUNK_Z-1)][chunk_x&(MAX_DECODED_CHUNK_X-1)]; if (db->valid) { if (db->cx == chunk_x && db->cz == chunk_z) return db; if (db->fc) { free(db->fc->pointer_to_free); free(db->fc); } } db->cx = chunk_x; db->cz = chunk_z; db->valid = 1; db->fc = 0; { db->fc = get_decoded_fastchunk_uncached(chunk_x, chunk_z); return db; } } fast_chunk *get_decoded_fastchunk(int chunk_x, int chunk_z) { decoded_buffer *db = get_decoded_buffer(chunk_x, chunk_z); return db->fc; } #endif #ifndef FAST_CHUNK chunk *get_decoded_chunk_raw(int chunk_x, int chunk_z) { unsigned char *decoded; compressed_chunk *cc = get_compressed_chunk(chunk_x, chunk_z); assert(cc != NULL); if (cc->len == 0) return NULL; else { chunk *ch; int inlen = nbt_parse_uint32(cc->data); int len; assert(cc->data[4] == 2); decoded = stbi_zlib_decode_malloc_guesssize(cc->data+5, inlen, inlen*3, &len); assert(decoded != NULL); #ifdef FAST_CHUNK ch = NULL; #else ch = minecraft_chunk_parse(decoded, len); #endif free(decoded); return ch; } } static chunk *decoded_chunks[MAX_DECODED_CHUNK_Z][MAX_DECODED_CHUNK_X]; chunk *get_decoded_chunk(int chunk_x, int chunk_z) { chunk *c = decoded_chunks[chunk_z&(MAX_DECODED_CHUNK_Z-1)][chunk_x&(MAX_DECODED_CHUNK_X-1)]; if (c && c->xpos == chunk_x && c->zpos == chunk_z) return c; if (c) free(c); c = get_decoded_chunk_raw(chunk_x, chunk_z); decoded_chunks[chunk_z&(MAX_DECODED_CHUNK_Z-1)][chunk_x&(MAX_DECODED_CHUNK_X-1)] = c; return c; } #endif uTox/third_party/stb/stb/tests/caveview/cave_mesher.c0000600000175000001440000007022514003056224022014 0ustar rakusers// This file takes minecraft chunks (decoded by cave_parse) and // uses stb_voxel_render to turn them into vertex buffers. #define STB_GLEXT_DECLARE "glext_list.h" #include "stb_gl.h" #include "stb_image.h" #include "stb_glprog.h" #include "caveview.h" #include "cave_parse.h" #include "stb.h" #include "sdl.h" #include "sdl_thread.h" #include //#define VHEIGHT_TEST //#define STBVOX_OPTIMIZED_VHEIGHT #define STBVOX_CONFIG_MODE 1 #define STBVOX_CONFIG_OPENGL_MODELVIEW #define STBVOX_CONFIG_PREFER_TEXBUFFER //#define STBVOX_CONFIG_LIGHTING_SIMPLE #define STBVOX_CONFIG_FOG_SMOOTHSTEP //#define STBVOX_CONFIG_PREMULTIPLIED_ALPHA // this doesn't work properly alpha test without next #define //#define STBVOX_CONFIG_UNPREMULTIPLY // slower, fixes alpha test makes windows & fancy leaves look better //#define STBVOX_CONFIG_TEX1_EDGE_CLAMP #define STBVOX_CONFIG_DISABLE_TEX2 //#define STBVOX_CONFIG_DOWN_TEXLERP_PACKED #define STBVOX_CONFIG_ROTATION_IN_LIGHTING #define STB_VOXEL_RENDER_IMPLEMENTATION #include "stb_voxel_render.h" extern void ods(char *fmt, ...); //#define FANCY_LEAVES // nearly 2x the triangles when enabled (if underground is filled) #define FAST_CHUNK #define IN_PLACE #define SKIP_TERRAIN 48 // use to avoid building underground stuff // allows you to see what perf would be like if underground was efficiently culled, // or if you were making a game without underground enum { C_empty, C_solid, C_trans, C_cross, C_water, C_slab, C_stair, C_force, }; unsigned char geom_map[] = { STBVOX_GEOM_empty, STBVOX_GEOM_solid, STBVOX_GEOM_transp, STBVOX_GEOM_crossed_pair, STBVOX_GEOM_solid, STBVOX_GEOM_slab_lower, STBVOX_GEOM_floor_slope_north_is_top, STBVOX_GEOM_force, }; unsigned char minecraft_info[256][7] = { { C_empty, 0,0,0,0,0,0 }, { C_solid, 1,1,1,1,1,1 }, { C_solid, 3,3,3,3,40,2 }, { C_solid, 2,2,2,2,2,2 }, { C_solid, 16,16,16,16,16,16 }, { C_solid, 4,4,4,4,4,4 }, { C_cross, 15,15,15,15 }, { C_solid, 17,17,17,17,17,17 }, // 8 { C_water, 223,223,223,223,223,223 }, { C_water, 223,223,223,223,223,223 }, { C_solid, 255,255,255,255,255,255 }, { C_solid, 255,255,255,255,255,255 }, { C_solid, 18,18,18,18,18,18 }, { C_solid, 19,19,19,19,19,19 }, { C_solid, 32,32,32,32,32,32 }, { C_solid, 33,33,33,33,33,33 }, // 16 { C_solid, 34,34,34,34,34,34 }, { C_solid, 20,20,20,20,21,21 }, #ifdef FANCY_LEAVES { C_force, 52,52,52,52,52,52 }, // leaves #else { C_solid, 53,53,53,53,53,53 }, // leaves #endif { C_solid, 24,24,24,24,24,24 }, { C_trans, 49,49,49,49,49,49 }, // glass { C_solid, 160,160,160,160,160,160 }, { C_solid, 144,144,144,144,144,144 }, { C_solid, 46,45,45,45,62,62 }, // 24 { C_solid, 192,192,192,192, 176,176 }, { C_solid, 74,74,74,74,74,74 }, { C_empty }, // bed { C_empty }, // powered rail { C_empty }, // detector rail { C_solid, 106,108,109,108,108,108 }, { C_empty }, // cobweb=11 { C_cross, 39,39,39,39 }, // 32 { C_cross, 55,55,55,55,0,0 }, { C_solid, 107,108,109,108,108,108 }, { C_empty }, // piston head { C_solid, 64,64,64,64,64,64 }, // various colors { C_empty }, // unused { C_cross, 13,13,13,13,0,0 }, { C_cross, 12,12,12,12,0,0 }, { C_cross, 29,29,29,29,0,0 }, // 40 { C_cross, 28,28,28,28,0,0 }, { C_solid, 23,23,23,23,23,23 }, { C_solid, 22,22,22,22,22,22 }, { C_solid, 5,5,5,5,6,6, }, { C_slab , 5,5,5,5,6,6, }, { C_solid, 7,7,7,7,7,7, }, { C_solid, 8,8,8,8,9,10 }, { C_solid, 35,35,35,35,4,4, }, // 48 { C_solid, 36,36,36,36,36,36 }, { C_solid, 37,37,37,37,37,37 }, { C_cross, 80,80,80,80,80,80 }, // torch { C_empty }, // fire { C_trans, 65,65,65,65,65,65 }, { C_stair, 4,4,4,4,4,4 }, { C_solid, 26,26,26,27,25,25 }, { C_empty }, // redstone // 56 { C_solid, 50,50,50,50,50,50 }, { C_solid, 26,26,26,26,26,26 }, { C_solid, 60,59,59,59,43,43 }, { C_cross, 95,95,95,95 }, { C_solid, 2,2,2,2,86,2 }, { C_solid, 44,45,45,45,62,62 }, { C_solid, 61,45,45,45,62,62 }, { C_empty }, // sign // 64 { C_empty }, // door { C_empty }, // ladder { C_empty }, // rail { C_stair, 16,16,16,16,16,16 }, // cobblestone stairs { C_empty }, // sign { C_empty }, // lever { C_empty }, // stone pressure plate { C_empty }, // iron door // 72 { C_empty }, // wooden pressure { C_solid, 51,51,51,51,51,51 }, { C_solid, 51,51,51,51,51,51 }, { C_empty }, { C_empty }, { C_empty }, { C_empty }, // snow on block below, do as half slab? { C_solid, 67,67,67,67,67,67 }, // 80 { C_solid, 66,66,66,66,66,66 }, { C_solid, 70,70,70,70,69,71 }, { C_solid, 72,72,72,72,72,72 }, { C_cross, 73,73,73,73,73,73 }, { C_solid, 74,74,74,74,75,74 }, { C_empty }, // fence { C_solid,119,118,118,118,102,102 }, { C_solid,103,103,103,103,103,103 }, // 88 { C_solid, 104,104,104,104,104,104 }, { C_solid, 105,105,105,105,105,105 }, { C_solid, 167,167,167,167,167,167 }, { C_solid, 120,118,118,118,102,102 }, { C_empty }, // cake { C_empty }, // repeater { C_empty }, // repeater { C_solid, 49,49,49,49,49,49 }, // colored glass // 96 { C_empty }, { C_empty }, { C_solid, 54,54,54,54,54,54 }, { C_solid, 125,125,125,125,125,125 }, { C_solid, 126,126,126,126,126,126 }, { C_empty }, // bars { C_trans, 49,49,49,49,49,49 }, // glass pane { C_solid, 136,136,136,136,137,137 }, // melon // 104 { C_empty }, // pumpkin stem { C_empty }, // melon stem { C_empty }, // vines { C_empty }, // gate { C_stair, 7,7,7,7,7,7, }, // brick stairs { C_stair, 54,54,54,54,54,54 }, // stone brick stairs { C_empty }, // mycelium { C_empty }, // lily pad // 112 { C_solid, 224,224,224,224,224,224 }, { C_empty }, // nether brick fence { C_stair, 224,224,224,224,224,224 }, // nether brick stairs { C_empty }, // nether wart { C_solid, 182,182,182,182,166,183 }, { C_empty }, // brewing stand { C_empty }, // cauldron { C_empty }, // end portal // 120 { C_solid, 159,159,159,159,158,158 }, { C_solid, 175,175,175,175,175,175 }, { C_empty }, // dragon egg { C_solid, 211,211,211,211,211,211 }, { C_solid, 212,212,212,212,212,212 }, { C_solid, 4,4,4,4,4,4, }, // wood double-slab { C_slab , 4,4,4,4,4,4, }, // wood slab { C_empty }, // cocoa // 128 { C_solid, 192,192,192,192,176,176 }, // sandstone stairs { C_solid, 32,32,32,32,32,32 }, // emerald ore { C_solid, 26,26,26,27,25,25 }, // ender chest { C_empty }, { C_empty }, { C_solid, 23,23,23,23,23,23 }, // emerald block { C_solid, 198,198,198,198,198,198 }, // spruce stairs { C_solid, 214,214,214,214,214,214 }, // birch stairs // 136 { C_stair, 199,199,199,199,199,199 }, // jungle stairs { C_empty }, // command block { C_empty }, // beacon { C_slab, 16,16,16,16,16,16 }, // cobblestone wall { C_empty }, // flower pot { C_empty }, // carrot { C_empty }, // potatoes { C_empty }, // wooden button // 144 { C_empty }, // mob head { C_empty }, // anvil { C_solid, 26,26,26,27,25,25 }, // trapped chest { C_empty }, // weighted pressure plate light { C_empty }, // weighted pressure plat eheavy { C_empty }, // comparator inactive { C_empty }, // comparator active { C_empty }, // daylight sensor // 152 { C_solid, 135,135,135,135,135,135 }, // redstone block { C_solid, 0,0,0,0,0,0, }, // nether quartz ore { C_empty }, // hopper { C_solid, 22,22,22,22,22,22 }, // quartz block { C_stair, 22,22,22,22,22,22 }, // quartz stairs { C_empty }, // activator rail { C_solid, 46,45,45,45,62,62 }, // dropper { C_solid, 72,72,72,72,72,72 }, // stained clay // 160 { C_trans, 49,49,49,49,49,49 }, // stained glass pane #ifdef FANCY_LEAVES { C_force, 52,52,52,52,52,52 }, // leaves #else { C_solid, 53,53,53,53,53,53 }, // acacia leaves #endif { C_solid, 20,20,20,20,21,21 }, // acacia tree { C_solid, 199,199,199,199,199,199 }, // acacia wood stairs { C_solid, 198,198,198,198,198,198 }, // dark oak stairs { C_solid, 146,146,146,146,146,146 }, // slime block { C_solid, 176,176,176,176,176,176 }, // red sandstone { C_solid, 176,176,176,176,176,176 }, // red sandstone // 168 { C_empty }, { C_empty }, { C_empty }, { C_empty }, { C_solid, 72,72,72,72,72,72 }, // hardened clay { C_empty }, { C_empty }, { C_empty }, // 176 { C_empty }, { C_empty }, { C_solid, 176,176,176,176,176,176 }, // red sandstone }; unsigned char minecraft_tex1_for_blocktype[256][6]; unsigned char effective_blocktype[256]; unsigned char minecraft_color_for_blocktype[256][6]; unsigned char minecraft_geom_for_blocktype[256]; uint8 build_buffer[BUILD_BUFFER_SIZE]; uint8 face_buffer[FACE_BUFFER_SIZE]; //GLuint vbuf, fbuf, fbuf_tex; //unsigned char tex1_for_blocktype[256][6]; //unsigned char blocktype[34][34][257]; //unsigned char lighting[34][34][257]; // a superchunk is 64x64x256, with the border blocks computed as well, // which means we need 4x4 chunks plus 16 border chunks plus 4 corner chunks #define SUPERCHUNK_X 4 #define SUPERCHUNK_Y 4 unsigned char remap_data[16][16]; unsigned char remap[256]; unsigned char rotate_data[4] = { 1,3,2,0 }; void convert_fastchunk_inplace(fast_chunk *fc) { int i; int num_blocks=0, step=0; unsigned char rot[4096]; #ifndef IN_PLACE unsigned char *storage; #endif memset(rot, 0, 4096); for (i=0; i < 16; ++i) num_blocks += fc->blockdata[i] != NULL; #ifndef IN_PLACE storage = malloc(16*16*16*2 * num_blocks); #endif for (i=0; i < 16; ++i) { if (fc->blockdata[i]) { int o=0; unsigned char *bd,*dd,*lt,*sky; unsigned char *out, *outb; // this ordering allows us to determine which data we can safely overwrite for in-place processing bd = fc->blockdata[i]; dd = fc->data[i]; lt = fc->light[i]; sky = fc->skylight[i]; #ifdef IN_PLACE out = bd; #else out = storage + 16*16*16*2*step; #endif // bd is written in place, but also reads from dd for (o=0; o < 16*16*16/2; o += 1) { unsigned char v1,v2; unsigned char d = dd[o]; v1 = bd[o*2+0]; v2 = bd[o*2+1]; if (remap[v1]) { //unsigned char d = bd[o] & 15; v1 = remap_data[remap[v1]][d&15]; rot[o*2+0] = rotate_data[d&3]; } else v1 = effective_blocktype[v1]; if (remap[v2]) { //unsigned char d = bd[o] >> 4; v2 = remap_data[remap[v2]][d>>4]; rot[o*2+1] = rotate_data[(d>>4)&3]; } else v2 = effective_blocktype[v2]; out[o*2+0] = v1; out[o*2+1] = v2; } // this reads from lt & sky #ifndef IN_PLACE outb = out + 16*16*16; ++step; #endif // MC used to write in this order and it makes it possible to compute in-place if (dd < sky && sky < lt) { // @TODO go this path always if !IN_PLACE #ifdef IN_PLACE outb = dd; #endif for (o=0; o < 16*16*16/2; ++o) { int bright; bright = (lt[o]&15)*12 + 15 + (sky[o]&15)*16; if (bright > 255) bright = 255; if (bright < 32) bright = 32; outb[o*2+0] = STBVOX_MAKE_LIGHTING_EXT((unsigned char) bright, (rot[o*2+0]&3)); bright = (lt[o]>>4)*12 + 15 + (sky[o]>>4)*16; if (bright > 255) bright = 255; if (bright < 32) bright = 32; outb[o*2+1] = STBVOX_MAKE_LIGHTING_EXT((unsigned char) bright, (rot[o*2+1]&3)); } } else { // @TODO: if blocktype is in between others, this breaks; need to find which side has two pointers, and use that // overwrite rot[] array, then copy out #ifdef IN_PLACE outb = (dd < sky) ? dd : sky; if (lt < outb) lt = outb; #endif for (o=0; o < 16*16*16/2; ++o) { int bright; bright = (lt[o]&15)*12 + 15 + (sky[o]&15)*16; if (bright > 255) bright = 255; if (bright < 32) bright = 32; rot[o*2+0] = STBVOX_MAKE_LIGHTING_EXT((unsigned char) bright, (rot[o*2+0]&3)); bright = (lt[o]>>4)*12 + 15 + (sky[o]>>4)*16; if (bright > 255) bright = 255; if (bright < 32) bright = 32; rot[o*2+1] = STBVOX_MAKE_LIGHTING_EXT((unsigned char) bright, (rot[o*2+1]&3)); } memcpy(outb, rot, 4096); fc->data[i] = outb; } #ifndef IN_PLACE fc->blockdata[i] = out; fc->data[i] = outb; #endif } } #ifndef IN_PLACE free(fc->pointer_to_free); fc->pointer_to_free = storage; #endif } void make_converted_fastchunk(fast_chunk *fc, int x, int y, int segment, uint8 *sv_blocktype, uint8 *sv_lighting) { int z; assert(fc == NULL || (fc->refcount > 0 && fc->refcount < 64)); if (fc == NULL || fc->blockdata[segment] == NULL) { for (z=0; z < 16; ++z) { sv_blocktype[z] = C_empty; sv_lighting[z] = 255; } } else { unsigned char *block = fc->blockdata[segment]; unsigned char *data = fc->data[segment]; y = 15-y; for (z=0; z < 16; ++z) { sv_blocktype[z] = block[z*256 + y*16 + x]; sv_lighting [z] = data [z*256 + y*16 + x]; } } } #define CHUNK_CACHE 64 typedef struct { int valid; int chunk_x, chunk_y; fast_chunk *fc; } cached_converted_chunk; cached_converted_chunk chunk_cache[CHUNK_CACHE][CHUNK_CACHE]; int cache_size = CHUNK_CACHE; void reset_cache_size(int size) { int i,j; for (j=size; j < cache_size; ++j) { for (i=size; i < cache_size; ++i) { cached_converted_chunk *ccc = &chunk_cache[j][i]; if (ccc->valid) { if (ccc->fc) { free(ccc->fc->pointer_to_free); free(ccc->fc); ccc->fc = NULL; } ccc->valid = 0; } } } cache_size = size; } // this must be called inside mutex void deref_fastchunk(fast_chunk *fc) { if (fc) { assert(fc->refcount > 0); --fc->refcount; if (fc->refcount == 0) { free(fc->pointer_to_free); free(fc); } } } SDL_mutex * chunk_cache_mutex; SDL_mutex * chunk_get_mutex; void lock_chunk_get_mutex(void) { SDL_LockMutex(chunk_get_mutex); } void unlock_chunk_get_mutex(void) { SDL_UnlockMutex(chunk_get_mutex); } fast_chunk *get_converted_fastchunk(int chunk_x, int chunk_y) { int slot_x = (chunk_x & (cache_size-1)); int slot_y = (chunk_y & (cache_size-1)); fast_chunk *fc; cached_converted_chunk *ccc; SDL_LockMutex(chunk_cache_mutex); ccc = &chunk_cache[slot_y][slot_x]; if (ccc->valid) { if (ccc->chunk_x == chunk_x && ccc->chunk_y == chunk_y) { fast_chunk *fc = ccc->fc; if (fc) ++fc->refcount; SDL_UnlockMutex(chunk_cache_mutex); return fc; } if (ccc->fc) { deref_fastchunk(ccc->fc); ccc->fc = NULL; ccc->valid = 0; } } SDL_UnlockMutex(chunk_cache_mutex); fc = get_decoded_fastchunk_uncached(chunk_x, -chunk_y); if (fc) convert_fastchunk_inplace(fc); SDL_LockMutex(chunk_cache_mutex); // another thread might have updated it, so before we overwrite it... if (ccc->fc) { deref_fastchunk(ccc->fc); ccc->fc = NULL; } if (fc) fc->refcount = 1; // 1 in the cache ccc->chunk_x = chunk_x; ccc->chunk_y = chunk_y; ccc->valid = 1; if (fc) ++fc->refcount; ccc->fc = fc; SDL_UnlockMutex(chunk_cache_mutex); return fc; } void make_map_segment_for_superchunk_preconvert(int chunk_x, int chunk_y, int segment, fast_chunk *fc_table[4][4], uint8 sv_blocktype[34][34][18], uint8 sv_lighting[34][34][18]) { int a,b; assert((chunk_x & 1) == 0); assert((chunk_y & 1) == 0); for (b=-1; b < 3; ++b) { for (a=-1; a < 3; ++a) { int xo = a*16+1; int yo = b*16+1; int x,y; fast_chunk *fc = fc_table[b+1][a+1]; for (y=0; y < 16; ++y) for (x=0; x < 16; ++x) if (xo+x >= 0 && xo+x < 34 && yo+y >= 0 && yo+y < 34) make_converted_fastchunk(fc,x,y, segment, sv_blocktype[xo+x][yo+y], sv_lighting[xo+x][yo+y]); } } } // build 1 mesh covering 2x2 chunks void build_chunk(int chunk_x, int chunk_y, fast_chunk *fc_table[4][4], raw_mesh *rm) { int a,b,z; stbvox_input_description *map; #ifdef VHEIGHT_TEST unsigned char vheight[34][34][18]; #endif #ifndef STBVOX_CONFIG_DISABLE_TEX2 unsigned char tex2_choice[34][34][18]; #endif assert((chunk_x & 1) == 0); assert((chunk_y & 1) == 0); rm->cx = chunk_x; rm->cy = chunk_y; stbvox_set_input_stride(&rm->mm, 34*18, 18); assert(rm->mm.input.geometry == NULL); map = stbvox_get_input_description(&rm->mm); map->block_tex1_face = minecraft_tex1_for_blocktype; map->block_color_face = minecraft_color_for_blocktype; map->block_geometry = minecraft_geom_for_blocktype; stbvox_reset_buffers(&rm->mm); stbvox_set_buffer(&rm->mm, 0, 0, rm->build_buffer, BUILD_BUFFER_SIZE); stbvox_set_buffer(&rm->mm, 0, 1, rm->face_buffer , FACE_BUFFER_SIZE); map->blocktype = &rm->sv_blocktype[1][1][1]; // this is (0,0,0), but we need to be able to query off the edges map->lighting = &rm->sv_lighting[1][1][1]; // fill in the top two rows of the buffer for (a=0; a < 34; ++a) { for (b=0; b < 34; ++b) { rm->sv_blocktype[a][b][16] = 0; rm->sv_lighting [a][b][16] = 255; rm->sv_blocktype[a][b][17] = 0; rm->sv_lighting [a][b][17] = 255; } } #ifndef STBVOX_CONFIG_DISABLE_TEX2 for (a=0; a < 34; ++a) { for (b=0; b < 34; ++b) { int px = chunk_x*16 + a - 1; int py = chunk_y*16 + b - 1; float dist = (float) sqrt(px*px + py*py); float s1 = (float) sin(dist / 16), s2, s3; dist = (float) sqrt((px-80)*(px-80) + (py-50)*(py-50)); s2 = (float) sin(dist / 11); for (z=0; z < 18; ++z) { s3 = (float) sin(z * 3.141592 / 8); s3 = s1*s2*s3; tex2_choice[a][b][z] = 63 & (int) stb_linear_remap(s3,-1,1, -20,83); } } } #endif for (z=256-16; z >= SKIP_TERRAIN; z -= 16) { int z0 = z; int z1 = z+16; if (z1 == 256) z1 = 255; make_map_segment_for_superchunk_preconvert(chunk_x, chunk_y, z >> 4, fc_table, rm->sv_blocktype, rm->sv_lighting); map->blocktype = &rm->sv_blocktype[1][1][1-z]; // specify location of 0,0,0 so that accessing z0..z1 gets right data map->lighting = &rm->sv_lighting[1][1][1-z]; #ifndef STBVOX_CONFIG_DISABLE_TEX2 map->tex2 = &tex2_choice[1][1][1-z]; #endif #ifdef VHEIGHT_TEST // hacky test of vheight for (a=0; a < 34; ++a) { for (b=0; b < 34; ++b) { int c; for (c=0; c < 17; ++c) { if (rm->sv_blocktype[a][b][c] != 0 && rm->sv_blocktype[a][b][c+1] == 0) { // topmost block vheight[a][b][c] = rand() & 255; rm->sv_blocktype[a][b][c] = 168; } else if (c > 0 && rm->sv_blocktype[a][b][c] != 0 && rm->sv_blocktype[a][b][c-1] == 0) { // bottommost block vheight[a][b][c] = ((rand() % 3) << 6) + ((rand() % 3) << 4) + ((rand() % 3) << 2) + (rand() % 3); rm->sv_blocktype[a][b][c] = 169; } } vheight[a][b][c] = STBVOX_MAKE_VHEIGHT(2,2,2,2); // flat top } } map->vheight = &vheight[1][1][1-z]; #endif { stbvox_set_input_range(&rm->mm, 0,0,z0, 32,32,z1); stbvox_set_default_mesh(&rm->mm, 0); stbvox_make_mesh(&rm->mm); } // copy the bottom two rows of data up to the top for (a=0; a < 34; ++a) { for (b=0; b < 34; ++b) { rm->sv_blocktype[a][b][16] = rm->sv_blocktype[a][b][0]; rm->sv_blocktype[a][b][17] = rm->sv_blocktype[a][b][1]; rm->sv_lighting [a][b][16] = rm->sv_lighting [a][b][0]; rm->sv_lighting [a][b][17] = rm->sv_lighting [a][b][1]; } } } stbvox_set_mesh_coordinates(&rm->mm, chunk_x*16, chunk_y*16, 0); stbvox_get_transform(&rm->mm, rm->transform); stbvox_set_input_range(&rm->mm, 0,0,0, 32,32,255); stbvox_get_bounds(&rm->mm, rm->bounds); rm->num_quads = stbvox_get_quad_count(&rm->mm, 0); } int next_blocktype = 255; unsigned char mc_rot[4] = { 1,3,2,0 }; // create blocktypes with rotation baked into type... // @TODO we no longer need this now that we store rotations // in lighting void build_stair_rotations(int blocktype, unsigned char *map) { int i; // use the existing block type for floor stairs; allocate a new type for ceil stairs for (i=0; i < 6; ++i) { minecraft_color_for_blocktype[next_blocktype][i] = minecraft_color_for_blocktype[blocktype][i]; minecraft_tex1_for_blocktype [next_blocktype][i] = minecraft_tex1_for_blocktype [blocktype][i]; } minecraft_geom_for_blocktype[next_blocktype] = (unsigned char) STBVOX_MAKE_GEOMETRY(STBVOX_GEOM_ceil_slope_north_is_bottom, 0, 0); minecraft_geom_for_blocktype[ blocktype] = (unsigned char) STBVOX_MAKE_GEOMETRY(STBVOX_GEOM_floor_slope_north_is_top, 0, 0); for (i=0; i < 4; ++i) { map[0+i+8] = map[0+i] = blocktype; map[4+i+8] = map[4+i] = next_blocktype; } --next_blocktype; } void build_wool_variations(int bt, unsigned char *map) { int i,k; unsigned char tex[16] = { 64, 210, 194, 178, 162, 146, 130, 114, 225, 209, 193, 177, 161, 145, 129, 113 }; for (i=0; i < 16; ++i) { if (i == 0) map[i] = bt; else { map[i] = next_blocktype; for (k=0; k < 6; ++k) { minecraft_tex1_for_blocktype[next_blocktype][k] = tex[i]; } minecraft_geom_for_blocktype[next_blocktype] = minecraft_geom_for_blocktype[bt]; --next_blocktype; } } } void build_wood_variations(int bt, unsigned char *map) { int i,k; unsigned char tex[4] = { 5, 198, 214, 199 }; for (i=0; i < 4; ++i) { if (i == 0) map[i] = bt; else { map[i] = next_blocktype; for (k=0; k < 6; ++k) { minecraft_tex1_for_blocktype[next_blocktype][k] = tex[i]; } minecraft_geom_for_blocktype[next_blocktype] = minecraft_geom_for_blocktype[bt]; --next_blocktype; } } map[i] = map[i-1]; ++i; for (; i < 16; ++i) map[i] = bt; } void remap_in_place(int bt, int rm) { int i; remap[bt] = rm; for (i=0; i < 16; ++i) remap_data[rm][i] = bt; } void mesh_init(void) { int i; chunk_cache_mutex = SDL_CreateMutex(); chunk_get_mutex = SDL_CreateMutex(); for (i=0; i < 256; ++i) { memcpy(minecraft_tex1_for_blocktype[i], minecraft_info[i]+1, 6); effective_blocktype[i] = (minecraft_info[i][0] == C_empty ? 0 : i); minecraft_geom_for_blocktype[i] = geom_map[minecraft_info[i][0]]; } //effective_blocktype[50] = 0; // delete torches for (i=0; i < 6*256; ++i) { if (minecraft_tex1_for_blocktype[0][i] == 40) minecraft_color_for_blocktype[0][i] = 38 | 64; // apply to tex1 if (minecraft_tex1_for_blocktype[0][i] == 39) minecraft_color_for_blocktype[0][i] = 39 | 64; // apply to tex1 if (minecraft_tex1_for_blocktype[0][i] == 105) minecraft_color_for_blocktype[0][i] = 63; // emissive if (minecraft_tex1_for_blocktype[0][i] == 212) minecraft_color_for_blocktype[0][i] = 63; // emissive if (minecraft_tex1_for_blocktype[0][i] == 80) minecraft_color_for_blocktype[0][i] = 63; // emissive } for (i=0; i < 6; ++i) { minecraft_color_for_blocktype[172][i] = 47 | 64; // apply to tex1 minecraft_color_for_blocktype[178][i] = 47 | 64; // apply to tex1 minecraft_color_for_blocktype[18][i] = 39 | 64; // green minecraft_color_for_blocktype[161][i] = 37 | 64; // green minecraft_color_for_blocktype[10][i] = 63; // emissive lava minecraft_color_for_blocktype[11][i] = 63; // emissive } #ifdef VHEIGHT_TEST effective_blocktype[168] = 168; minecraft_tex1_for_blocktype[168][0] = 1; minecraft_tex1_for_blocktype[168][1] = 1; minecraft_tex1_for_blocktype[168][2] = 1; minecraft_tex1_for_blocktype[168][3] = 1; minecraft_tex1_for_blocktype[168][4] = 1; minecraft_tex1_for_blocktype[168][5] = 1; minecraft_geom_for_blocktype[168] = STBVOX_GEOM_floor_vheight_12; effective_blocktype[169] = 169; minecraft_tex1_for_blocktype[169][0] = 1; minecraft_tex1_for_blocktype[169][1] = 1; minecraft_tex1_for_blocktype[169][2] = 1; minecraft_tex1_for_blocktype[169][3] = 1; minecraft_tex1_for_blocktype[169][4] = 1; minecraft_tex1_for_blocktype[169][5] = 1; minecraft_geom_for_blocktype[169] = STBVOX_GEOM_ceil_vheight_03; #endif remap[53] = 1; remap[67] = 2; remap[108] = 3; remap[109] = 4; remap[114] = 5; remap[136] = 6; remap[156] = 7; for (i=0; i < 256; ++i) if (remap[i]) build_stair_rotations(i, remap_data[remap[i]]); remap[35] = 8; build_wool_variations(35, remap_data[remap[35]]); remap[5] = 11; build_wood_variations(5, remap_data[remap[5]]); // set the remap flags for these so they write the rotation values remap_in_place(54, 9); remap_in_place(146, 10); } // Timing stats while optimizing the single-threaded builder // 32..-32, 32..-32, SKIP_TERRAIN=0, !FANCY_LEAVES on 'mcrealm' data set // 6.27s - reblocked to do 16 z at a time instead of 256 (still using 66x66x258), 4 meshes in parallel // 5.96s - reblocked to use FAST_CHUNK (no intermediate data structure) // 5.45s - unknown change, or previous measurement was wrong // 6.12s - use preconverted data, not in-place // 5.91s - use preconverted, in-place // 5.34s - preconvert, in-place, avoid dependency chain (suggested by ryg) // 5.34s - preconvert, in-place, avoid dependency chain, use bit-table instead of byte-table // 5.50s - preconvert, in-place, branchless // 6.42s - non-preconvert, avoid dependency chain (not an error) // 5.40s - non-preconvert, w/dependency chain (same as earlier) // 5.50s - non-FAST_CHUNK, reblocked outer loop for better cache reuse // 4.73s - FAST_CHUNK non-preconvert, reblocked outer loop // 4.25s - preconvert, in-place, reblocked outer loop // 4.18s - preconvert, in-place, unrolled again // 4.10s - 34x34 1 mesh instead of 66x66 and 4 meshes (will make it easier to do multiple threads) // 4.83s - building bitmasks but not using them (2 bits per block, one if empty, one if solid) // 5.16s - using empty bitmasks to early out // 5.01s - using solid & empty bitmasks to early out - "foo" // 4.64s - empty bitmask only, test 8 at a time, then test geom // 4.72s - empty bitmask only, 8 at a time, then test bits // 4.46s - split bitmask building into three loops (each byte is separate) // 4.42s - further optimize computing bitmask // 4.58s - using solid & empty bitmasks to early out, same as "foo" but faster bitmask building // 4.12s - using solid & empty bitmasks to efficiently test neighbors // 4.04s - using 16-bit fetches (not endian-independent) // - note this is first place that beats previous best '4.10s - 34x34 1 mesh' // 4.30s - current time with bitmasks disabled again (note was 4.10s earlier) // 3.95s - bitmasks enabled again, no other changes // 4.00s - current time with bitmasks disabled again, no other changes -- wide variation that is time dependent? // (note that most of the numbers listed here are median of 3 values already) // 3.98s - bitmasks enabled // Bitmasks removed from the code as not worth the complexity increase // Raw data for Q&A: // // 26% parsing & loading minecraft files (4/5ths of which is zlib decode) // 39% building mesh from stb input format // 18% converting from minecraft blocks to stb blocks // 9% reordering from minecraft axis order to stb axis order // 7% uploading vertex buffer to OpenGL uTox/third_party/stb/stb/tests/caveview/cave_main.c0000600000175000001440000003706014003056224021455 0ustar rakusers#define _WIN32_WINNT 0x400 #include #include // stb.h #define STB_DEFINE #include "stb.h" // stb_gl.h #define STB_GL_IMPLEMENTATION #define STB_GLEXT_DEFINE "glext_list.h" #include "stb_gl.h" // SDL #include "sdl.h" #include "SDL_opengl.h" // stb_glprog.h #define STB_GLPROG_IMPLEMENTATION #define STB_GLPROG_ARB_DEFINE_EXTENSIONS #include "stb_glprog.h" // stb_image.h #define STB_IMAGE_IMPLEMENTATION #include "stb_image.h" // stb_easy_font.h #include "stb_easy_font.h" // doesn't require an IMPLEMENTATION #include "caveview.h" char *game_name = "caveview"; #define REVERSE_DEPTH static void print_string(float x, float y, char *text, float r, float g, float b) { static char buffer[99999]; int num_quads; num_quads = stb_easy_font_print(x, y, text, NULL, buffer, sizeof(buffer)); glColor3f(r,g,b); glEnableClientState(GL_VERTEX_ARRAY); glVertexPointer(2, GL_FLOAT, 16, buffer); glDrawArrays(GL_QUADS, 0, num_quads*4); glDisableClientState(GL_VERTEX_ARRAY); } static float text_color[3]; static float pos_x = 10; static float pos_y = 10; static void print(char *text, ...) { char buffer[999]; va_list va; va_start(va, text); vsprintf(buffer, text, va); va_end(va); print_string(pos_x, pos_y, buffer, text_color[0], text_color[1], text_color[2]); pos_y += 10; } float camang[3], camloc[3] = { 60,22,77 }; float player_zoom = 1.0; float rotate_view = 0.0; void camera_to_worldspace(float world[3], float cam_x, float cam_y, float cam_z) { float vec[3] = { cam_x, cam_y, cam_z }; float t[3]; float s,c; s = (float) sin(camang[0]*3.141592/180); c = (float) cos(camang[0]*3.141592/180); t[0] = vec[0]; t[1] = c*vec[1] - s*vec[2]; t[2] = s*vec[1] + c*vec[2]; s = (float) sin(camang[2]*3.141592/180); c = (float) cos(camang[2]*3.141592/180); world[0] = c*t[0] - s*t[1]; world[1] = s*t[0] + c*t[1]; world[2] = t[2]; } // camera worldspace velocity float cam_vel[3]; int controls; #define MAX_VEL 150.0f // blocks per second #define ACCEL 6.0f #define DECEL 3.0f #define STATIC_FRICTION DECEL #define EFFECTIVE_ACCEL (ACCEL+DECEL) // dynamic friction: // // if going at MAX_VEL, ACCEL and friction must cancel // EFFECTIVE_ACCEL = DECEL + DYNAMIC_FRIC*MAX_VEL #define DYNAMIC_FRICTION (ACCEL/(float)MAX_VEL) float view_x_vel = 0; float view_z_vel = 0; float pending_view_x; float pending_view_z; float pending_view_x; float pending_view_z; void process_tick_raw(float dt) { int i; float thrust[3] = { 0,0,0 }; float world_thrust[3]; // choose direction to apply thrust thrust[0] = (controls & 3)== 1 ? EFFECTIVE_ACCEL : (controls & 3)== 2 ? -EFFECTIVE_ACCEL : 0; thrust[1] = (controls & 12)== 4 ? EFFECTIVE_ACCEL : (controls & 12)== 8 ? -EFFECTIVE_ACCEL : 0; thrust[2] = (controls & 48)==16 ? EFFECTIVE_ACCEL : (controls & 48)==32 ? -EFFECTIVE_ACCEL : 0; // @TODO clamp thrust[0] & thrust[1] vector length to EFFECTIVE_ACCEL camera_to_worldspace(world_thrust, thrust[0], thrust[1], 0); world_thrust[2] += thrust[2]; for (i=0; i < 3; ++i) { float acc = world_thrust[i]; cam_vel[i] += acc*dt; } if (cam_vel[0] || cam_vel[1] || cam_vel[2]) { float vel = (float) sqrt(cam_vel[0]*cam_vel[0] + cam_vel[1]*cam_vel[1] + cam_vel[2]*cam_vel[2]); float newvel = vel; float dec = STATIC_FRICTION + DYNAMIC_FRICTION*vel; newvel = vel - dec*dt; if (newvel < 0) newvel = 0; cam_vel[0] *= newvel/vel; cam_vel[1] *= newvel/vel; cam_vel[2] *= newvel/vel; } camloc[0] += cam_vel[0] * dt; camloc[1] += cam_vel[1] * dt; camloc[2] += cam_vel[2] * dt; view_x_vel *= (float) pow(0.75, dt); view_z_vel *= (float) pow(0.75, dt); view_x_vel += (pending_view_x - view_x_vel)*dt*60; view_z_vel += (pending_view_z - view_z_vel)*dt*60; pending_view_x -= view_x_vel * dt; pending_view_z -= view_z_vel * dt; camang[0] += view_x_vel * dt; camang[2] += view_z_vel * dt; camang[0] = stb_clamp(camang[0], -90, 90); camang[2] = (float) fmod(camang[2], 360); } void process_tick(float dt) { while (dt > 1.0f/60) { process_tick_raw(1.0f/60); dt -= 1.0f/60; } process_tick_raw(dt); } void update_view(float dx, float dy) { // hard-coded mouse sensitivity, not resolution independent? pending_view_z -= dx*300; pending_view_x -= dy*700; } extern int screen_x, screen_y; extern int is_synchronous_debug; float render_time; extern int chunk_locations, chunks_considered, chunks_in_frustum; extern int quads_considered, quads_rendered; extern int chunk_storage_rendered, chunk_storage_considered, chunk_storage_total; extern int view_dist_in_chunks; extern int num_threads_active, num_meshes_started, num_meshes_uploaded; extern float chunk_server_activity; static Uint64 start_time, end_time; // render time float chunk_server_status[32]; int chunk_server_pos; void draw_stats(void) { int i; static Uint64 last_frame_time; Uint64 cur_time = SDL_GetPerformanceCounter(); float chunk_server=0; float frame_time = (cur_time - last_frame_time) / (float) SDL_GetPerformanceFrequency(); last_frame_time = cur_time; chunk_server_status[chunk_server_pos] = chunk_server_activity; chunk_server_pos = (chunk_server_pos+1) %32; for (i=0; i < 32; ++i) chunk_server += chunk_server_status[i] / 32.0f; stb_easy_font_spacing(-0.75); pos_y = 10; text_color[0] = text_color[1] = text_color[2] = 1.0f; print("Frame time: %6.2fms, CPU frame render time: %5.2fms", frame_time*1000, render_time*1000); print("Tris: %4.1fM drawn of %4.1fM in range", 2*quads_rendered/1000000.0f, 2*quads_considered/1000000.0f); print("Vbuf storage: %dMB in frustum of %dMB in range of %dMB in cache", chunk_storage_rendered>>20, chunk_storage_considered>>20, chunk_storage_total>>20); print("Num mesh builds started this frame: %d; num uploaded this frame: %d\n", num_meshes_started, num_meshes_uploaded); print("QChunks: %3d in frustum of %3d valid of %3d in range", chunks_in_frustum, chunks_considered, chunk_locations); print("Mesh worker threads active: %d", num_threads_active); print("View distance: %d blocks", view_dist_in_chunks*16); print("%s", glGetString(GL_RENDERER)); if (is_synchronous_debug) { text_color[0] = 1.0; text_color[1] = 0.5; text_color[2] = 0.5; print("SLOWNESS: Synchronous debug output is enabled!"); } } void draw_main(void) { glEnable(GL_CULL_FACE); glDisable(GL_TEXTURE_2D); glDisable(GL_LIGHTING); glEnable(GL_DEPTH_TEST); #ifdef REVERSE_DEPTH glDepthFunc(GL_GREATER); glClearDepth(0); #else glDepthFunc(GL_LESS); glClearDepth(1); #endif glDepthMask(GL_TRUE); glDisable(GL_SCISSOR_TEST); glClearColor(0.6f,0.7f,0.9f,0.0f); glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT); glBlendFunc(GL_SRC_ALPHA, GL_ONE_MINUS_SRC_ALPHA); glColor3f(1,1,1); glFrontFace(GL_CW); glEnable(GL_TEXTURE_2D); glDisable(GL_BLEND); glMatrixMode(GL_PROJECTION); glLoadIdentity(); #ifdef REVERSE_DEPTH stbgl_Perspective(player_zoom, 90, 70, 3000, 1.0/16); #else stbgl_Perspective(player_zoom, 90, 70, 1.0/16, 3000); #endif // now compute where the camera should be glMatrixMode(GL_MODELVIEW); glLoadIdentity(); stbgl_initCamera_zup_facing_y(); glRotatef(-camang[0],1,0,0); glRotatef(-camang[2],0,0,1); glTranslatef(-camloc[0], -camloc[1], -camloc[2]); start_time = SDL_GetPerformanceCounter(); render_caves(camloc); end_time = SDL_GetPerformanceCounter(); render_time = (end_time - start_time) / (float) SDL_GetPerformanceFrequency(); glMatrixMode(GL_PROJECTION); glLoadIdentity(); gluOrtho2D(0,screen_x/2,screen_y/2,0); glMatrixMode(GL_MODELVIEW); glLoadIdentity(); glDisable(GL_TEXTURE_2D); glDisable(GL_BLEND); glDisable(GL_CULL_FACE); draw_stats(); } #pragma warning(disable:4244; disable:4305; disable:4018) #define SCALE 2 void error(char *s) { SDL_ShowSimpleMessageBox(SDL_MESSAGEBOX_ERROR, "Error", s, NULL); exit(0); } void ods(char *fmt, ...) { char buffer[1000]; va_list va; va_start(va, fmt); vsprintf(buffer, fmt, va); va_end(va); SDL_Log("%s", buffer); } #define TICKS_PER_SECOND 60 static SDL_Window *window; extern void draw_main(void); extern void process_tick(float dt); extern void editor_init(void); void draw(void) { draw_main(); SDL_GL_SwapWindow(window); } static int initialized=0; static float last_dt; int screen_x,screen_y; float carried_dt = 0; #define TICKRATE 60 float tex2_alpha = 1.0; int raw_level_time; float global_timer; int global_hack; int loopmode(float dt, int real, int in_client) { if (!initialized) return 0; if (!real) return 0; // don't allow more than 6 frames to update at a time if (dt > 0.075) dt = 0.075; global_timer += dt; carried_dt += dt; while (carried_dt > 1.0/TICKRATE) { if (global_hack) { tex2_alpha += global_hack / 60.0f; if (tex2_alpha < 0) tex2_alpha = 0; if (tex2_alpha > 1) tex2_alpha = 1; } //update_input(); // if the player is dead, stop the sim carried_dt -= 1.0/TICKRATE; } process_tick(dt); draw(); return 0; } static int quit; extern int controls; void active_control_set(int key) { controls |= 1 << key; } void active_control_clear(int key) { controls &= ~(1 << key); } extern void update_view(float dx, float dy); void process_sdl_mouse(SDL_Event *e) { update_view((float) e->motion.xrel / screen_x, (float) e->motion.yrel / screen_y); } void process_event(SDL_Event *e) { switch (e->type) { case SDL_MOUSEMOTION: process_sdl_mouse(e); break; case SDL_MOUSEBUTTONDOWN: case SDL_MOUSEBUTTONUP: break; case SDL_QUIT: quit = 1; break; case SDL_WINDOWEVENT: switch (e->window.event) { case SDL_WINDOWEVENT_SIZE_CHANGED: screen_x = e->window.data1; screen_y = e->window.data2; loopmode(0,1,0); break; } break; case SDL_KEYDOWN: { int k = e->key.keysym.sym; int s = e->key.keysym.scancode; SDL_Keymod mod; mod = SDL_GetModState(); if (k == SDLK_ESCAPE) quit = 1; if (s == SDL_SCANCODE_D) active_control_set(0); if (s == SDL_SCANCODE_A) active_control_set(1); if (s == SDL_SCANCODE_W) active_control_set(2); if (s == SDL_SCANCODE_S) active_control_set(3); if (k == SDLK_SPACE) active_control_set(4); if (s == SDL_SCANCODE_LCTRL) active_control_set(5); if (s == SDL_SCANCODE_S) active_control_set(6); if (s == SDL_SCANCODE_D) active_control_set(7); if (k == '1') global_hack = !global_hack; if (k == '2') global_hack = -1; #if 0 if (game_mode == GAME_editor) { switch (k) { case SDLK_RIGHT: editor_key(STBTE_scroll_right); break; case SDLK_LEFT : editor_key(STBTE_scroll_left ); break; case SDLK_UP : editor_key(STBTE_scroll_up ); break; case SDLK_DOWN : editor_key(STBTE_scroll_down ); break; } switch (s) { case SDL_SCANCODE_S: editor_key(STBTE_tool_select); break; case SDL_SCANCODE_B: editor_key(STBTE_tool_brush ); break; case SDL_SCANCODE_E: editor_key(STBTE_tool_erase ); break; case SDL_SCANCODE_R: editor_key(STBTE_tool_rectangle ); break; case SDL_SCANCODE_I: editor_key(STBTE_tool_eyedropper); break; case SDL_SCANCODE_L: editor_key(STBTE_tool_link); break; case SDL_SCANCODE_G: editor_key(STBTE_act_toggle_grid); break; } if ((e->key.keysym.mod & KMOD_CTRL) && !(e->key.keysym.mod & ~KMOD_CTRL)) { switch (s) { case SDL_SCANCODE_X: editor_key(STBTE_act_cut ); break; case SDL_SCANCODE_C: editor_key(STBTE_act_copy ); break; case SDL_SCANCODE_V: editor_key(STBTE_act_paste); break; case SDL_SCANCODE_Z: editor_key(STBTE_act_undo ); break; case SDL_SCANCODE_Y: editor_key(STBTE_act_redo ); break; } } } #endif break; } case SDL_KEYUP: { int k = e->key.keysym.sym; int s = e->key.keysym.scancode; if (s == SDL_SCANCODE_D) active_control_clear(0); if (s == SDL_SCANCODE_A) active_control_clear(1); if (s == SDL_SCANCODE_W) active_control_clear(2); if (s == SDL_SCANCODE_S) active_control_clear(3); if (k == SDLK_SPACE) active_control_clear(4); if (s == SDL_SCANCODE_LCTRL) active_control_clear(5); if (s == SDL_SCANCODE_S) active_control_clear(6); if (s == SDL_SCANCODE_D) active_control_clear(7); break; } } } static SDL_GLContext *context; static float getTimestep(float minimum_time) { float elapsedTime; double thisTime; static double lastTime = -1; if (lastTime == -1) lastTime = SDL_GetTicks() / 1000.0 - minimum_time; for(;;) { thisTime = SDL_GetTicks() / 1000.0; elapsedTime = (float) (thisTime - lastTime); if (elapsedTime >= minimum_time) { lastTime = thisTime; return elapsedTime; } // @TODO: compute correct delay SDL_Delay(1); } } void APIENTRY gl_debug(GLenum source, GLenum type, GLuint id, GLenum severity, GLsizei length, const GLchar *message, const void *param) { ods("%s\n", message); } int is_synchronous_debug; void enable_synchronous(void) { glEnable(GL_DEBUG_OUTPUT_SYNCHRONOUS_ARB); is_synchronous_debug = 1; } void prepare_threads(void); //void stbwingraph_main(void) int SDL_main(int argc, char **argv) { SDL_Init(SDL_INIT_VIDEO); prepare_threads(); SDL_GL_SetAttribute(SDL_GL_RED_SIZE , 8); SDL_GL_SetAttribute(SDL_GL_GREEN_SIZE, 8); SDL_GL_SetAttribute(SDL_GL_BLUE_SIZE , 8); SDL_GL_SetAttribute(SDL_GL_DEPTH_SIZE, 24); SDL_GL_SetAttribute(SDL_GL_CONTEXT_PROFILE_MASK, SDL_GL_CONTEXT_PROFILE_COMPATIBILITY); SDL_GL_SetAttribute(SDL_GL_CONTEXT_MAJOR_VERSION, 3); SDL_GL_SetAttribute(SDL_GL_CONTEXT_MINOR_VERSION, 1); #ifdef GL_DEBUG SDL_GL_SetAttribute(SDL_GL_CONTEXT_FLAGS, SDL_GL_CONTEXT_DEBUG_FLAG); #endif SDL_GL_SetAttribute(SDL_GL_MULTISAMPLESAMPLES, 4); screen_x = 1920; screen_y = 1080; window = SDL_CreateWindow("caveview", SDL_WINDOWPOS_UNDEFINED, SDL_WINDOWPOS_UNDEFINED, screen_x, screen_y, SDL_WINDOW_OPENGL | SDL_WINDOW_RESIZABLE ); if (!window) error("Couldn't create window"); context = SDL_GL_CreateContext(window); if (!context) error("Couldn't create context"); SDL_GL_MakeCurrent(window, context); // is this true by default? SDL_SetRelativeMouseMode(SDL_TRUE); #if defined(_MSC_VER) && _MSC_VER < 1300 // work around broken behavior in VC6 debugging if (IsDebuggerPresent()) SDL_SetHint(SDL_HINT_MOUSE_RELATIVE_MODE_WARP, "1"); #endif stbgl_initExtensions(); #ifdef GL_DEBUG if (glDebugMessageCallbackARB) { glDebugMessageCallbackARB(gl_debug, NULL); enable_synchronous(); } #endif SDL_GL_SetSwapInterval(1); render_init(); mesh_init(); world_init(); initialized = 1; while (!quit) { SDL_Event e; while (SDL_PollEvent(&e)) process_event(&e); loopmode(getTimestep(0.0166f/8), 1, 1); } return 0; } uTox/third_party/stb/stb/tests/caveview/README.md0000600000175000001440000000657014003056224020650 0ustar rakusers# FAQ ### How to run it? There's no GUI. Find a directory with Minecraft Anvil files (.mca). Copy a Minecraft "terrain.png" into that directory (do a google image search). Run from that directory. ### How accurate is this as a Minecraft viewer? Not very. Many Minecraft blocks are not handled correctly: * No redstone, rails, or other "flat" blocks * No signs, doors, fences, carpets, or other complicated geometry * Stairs are turned into ramps * Upper slabs turn into lower slabs * Wood types only for blocks, not stairs, slabs, etc * Colored glass becomes regular glass * Glass panes become glass blocks * Water is opaque * Water level is incorrect * No biome coloration * Cactus is not shrunk, shows holes * Chests are not shrunk * Double-chests draw as two chests * Pumpkins etc. are not rotated properly * Torches are drawn hackily, do not attach to walls * Incorrect textures for blocks that postdate terrain.png * Transparent textures have black fringes due to non-premultiplied-alpha * Skylight and block light are combined in a single value * Only blocks at y=1..255 are shown (not y=0) * If a 32x32x256 "quad-chunk" needs more than 800K quads, isn't handled (very unlikely) Some of these are due to engine limitations, and some of these are because I didn't make the effort since my goal was to make a demo for stb_voxel_render.h, not to make a proper Minecraft viewer. ### Could this be turned into a proper Minecraft viewer? Yes and no. Yes, you could do it, but no, it wouldn't really resemble this code that much anymore. You could certainly use this engine to render the parts of Minecraft it works for, but many of the things it doesn't handle it can't handle at all (stairs, water, fences, carpets, etc) because it uses low-precision coordinates to store voxel data. You would have to render all of the stuff it doesn't handle through another rendering path. In a game (not a viewer) you would need such a path for movable entities like doors and carts anyway, so possibly handling other things that way wouldn't be so bad. Rails, ladders, and redstone lines could be implemented by using tex2 to overlay those effects, but you can't rotate tex1 and tex2 independently, so there may be cases where the underlying texture needs a different rotation from the overlaid texture, which would require separate rendering. Handling redstone's brightness being different from underlying block's brightness would require separate rendering. You can use the face-color effect to do biome coloration, but the change won't be smooth the way it is in Minecraft. ### Why isn't building the mesh data faster? Partly because converting from minecraft data is expensive. Here is the approximate breakdown of an older version of this executable and lib that did the building single-threaded. * 25% loading & parsing minecraft files (4/5ths of this is my crappy zlib) * 18% converting from minecraft blockids & lighting to stb blockids & lighting * 10% reordering from data[z][y]\[x] (minecraft-style) to data[y][x]\[z] (stb-style) * 40% building mesh data * 7% uploading mesh data to OpenGL I did do significant optimizations after the above, so the final breakdown is different, but it should give you some sense of the costs. uTox/third_party/stb/stb/tests/c_lexer_test.dsp0000600000175000001440000000760714003056224020752 0ustar rakusers# Microsoft Developer Studio Project File - Name="c_lexer_test" - Package Owner=<4> # Microsoft Developer Studio Generated Build File, Format Version 6.00 # ** DO NOT EDIT ** # TARGTYPE "Win32 (x86) Console Application" 0x0103 CFG=c_lexer_test - 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 "c_lexer_test.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 "c_lexer_test.mak" CFG="c_lexer_test - Win32 Debug" !MESSAGE !MESSAGE Possible choices for configuration are: !MESSAGE !MESSAGE "c_lexer_test - Win32 Release" (based on "Win32 (x86) Console Application") !MESSAGE "c_lexer_test - 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)" == "c_lexer_test - Win32 Release" # PROP BASE Use_MFC 0 # PROP BASE Use_Debug_Libraries 0 # PROP BASE Output_Dir "Release" # PROP BASE Intermediate_Dir "Release" # 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 "_CONSOLE" /D "_MBCS" /YX /FD /c # ADD CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /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 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 !ELSEIF "$(CFG)" == "c_lexer_test - Win32 Debug" # PROP BASE Use_MFC 0 # PROP BASE Use_Debug_Libraries 1 # PROP BASE Output_Dir "Debug" # PROP BASE Intermediate_Dir "Debug" # PROP BASE Target_Dir "" # PROP Use_MFC 0 # PROP Use_Debug_Libraries 1 # PROP Output_Dir "Debug" # PROP Intermediate_Dir "Debug\c_lexer_test" # 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 /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /FD /GZ /c # SUBTRACT CPP /YX # 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 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 !ENDIF # Begin Target # Name "c_lexer_test - Win32 Release" # Name "c_lexer_test - Win32 Debug" # Begin Source File SOURCE=.\c_lexer_test.c # End Source File # End Target # End Project uTox/third_party/stb/stb/tests/c_lexer_test.c0000600000175000001440000000717614003056224020407 0ustar rakusers#define STB_C_LEX_C_DECIMAL_INTS Y // "0|[1-9][0-9]*" CLEX_intlit #define STB_C_LEX_C_HEX_INTS Y // "0x[0-9a-fA-F]+" CLEX_intlit #define STB_C_LEX_C_OCTAL_INTS Y // "[0-7]+" CLEX_intlit #define STB_C_LEX_C_DECIMAL_FLOATS Y // "[0-9]*(.[0-9]*([eE][-+]?[0-9]+)?) CLEX_floatlit #define STB_C_LEX_C99_HEX_FLOATS Y // "0x{hex}+(.{hex}*)?[pP][-+]?{hex}+ CLEX_floatlit #define STB_C_LEX_C_IDENTIFIERS Y // "[_a-zA-Z][_a-zA-Z0-9]*" CLEX_id #define STB_C_LEX_C_DQ_STRINGS Y // double-quote-delimited strings with escapes CLEX_dqstring #define STB_C_LEX_C_SQ_STRINGS Y // single-quote-delimited strings with escapes CLEX_ssstring #define STB_C_LEX_C_CHARS Y // single-quote-delimited character with escape CLEX_charlits #define STB_C_LEX_C_COMMENTS Y // "/* comment */" #define STB_C_LEX_CPP_COMMENTS Y // "// comment to end of line\n" #define STB_C_LEX_C_COMPARISONS Y // "==" CLEX_eq "!=" CLEX_noteq "<=" CLEX_lesseq ">=" CLEX_greatereq #define STB_C_LEX_C_LOGICAL Y // "&&" CLEX_andand "||" CLEX_oror #define STB_C_LEX_C_SHIFTS Y // "<<" CLEX_shl ">>" CLEX_shr #define STB_C_LEX_C_INCREMENTS Y // "++" CLEX_plusplus "--" CLEX_minusminus #define STB_C_LEX_C_ARROW Y // "->" CLEX_arrow #define STB_C_LEX_EQUAL_ARROW Y // "=>" CLEX_eqarrow #define STB_C_LEX_C_BITWISEEQ Y // "&=" CLEX_andeq "|=" CLEX_oreq "^=" CLEX_xoreq #define STB_C_LEX_C_ARITHEQ Y // "+=" CLEX_pluseq "-=" CLEX_minuseq // "*=" CLEX_muleq "/=" CLEX_diveq "%=" CLEX_modeq // if both STB_C_LEX_SHIFTS & STB_C_LEX_ARITHEQ: // "<<=" CLEX_shleq ">>=" CLEX_shreq #define STB_C_LEX_PARSE_SUFFIXES Y // letters after numbers are parsed as part of those numbers, and must be in suffix list below #define STB_C_LEX_DECIMAL_SUFFIXES "uUlL" // decimal integer suffixes e.g. "uUlL" -- these are returned as-is in string storage #define STB_C_LEX_HEX_SUFFIXES "lL" // e.g. "uUlL" #define STB_C_LEX_OCTAL_SUFFIXES "lL" // e.g. "uUlL" #define STB_C_LEX_FLOAT_SUFFIXES "uulL" // #define STB_C_LEX_0_IS_EOF N // if Y, ends parsing at '\0'; if N, returns '\0' as token #define STB_C_LEX_INTEGERS_AS_DOUBLES N // parses integers as doubles so they can be larger than 'int', but only if STB_C_LEX_STDLIB==N #define STB_C_LEX_MULTILINE_DSTRINGS Y // allow newlines in double-quoted strings #define STB_C_LEX_MULTILINE_SSTRINGS Y // allow newlines in single-quoted strings #define STB_C_LEX_USE_STDLIB N // use strtod,strtol for parsing #s; otherwise inaccurate hack #define STB_C_LEX_DOLLAR_IDENTIFIER Y // allow $ as an identifier character #define STB_C_LEX_FLOAT_NO_DECIMAL Y // allow floats that have no decimal point if they have an exponent #define STB_C_LEX_DEFINE_ALL_TOKEN_NAMES Y // if Y, all CLEX_ token names are defined, even if never returned // leaving it as N should help you catch config bugs #define STB_C_LEX_DISCARD_PREPROCESSOR Y // discard C-preprocessor directives (e.g. after prepocess // still have #line, #pragma, etc) #define STB_C_LEXER_DEFINITIONS // This line prevents the header file from replacing your definitions #define STB_C_LEXER_IMPLEMENTATION #define STB_C_LEXER_SELF_TEST #include "../stb_c_lexer.h" uTox/third_party/stb/stb/tests/Makefile0000600000175000001440000000043114003056224017206 0ustar rakusersINCLUDES = -I.. CFLAGS = -Wno-pointer-to-int-cast -Wno-int-to-pointer-cast -DSTB_DIVIDE_TEST CPPFLAGS = -Wno-write-strings -DSTB_DIVIDE_TEST all: $(CC) $(INCLUDES) $(CFLAGS) ../stb_vorbis.c test_c_compilation.c -lm $(CC) $(INCLUDES) $(CPPFLAGS) test_cpp_compilation.cpp -lm uTox/third_party/stb/stb/stretchy_buffer.h0000600000175000001440000002621514003056224017763 0ustar rakusers// stretchy_buffer.h - v1.02 - public domain - nothings.org/stb // a vector<>-like dynamic array for C // // version history: // 1.02 - tweaks to syntax for no good reason // 1.01 - added a "common uses" documentation section // 1.0 - fixed bug in the version I posted prematurely // 0.9 - rewrite to try to avoid strict-aliasing optimization // issues, but won't compile as C++ // // Will probably not work correctly with strict-aliasing optimizations. // // The idea: // // This implements an approximation to C++ vector<> for C, in that it // provides a generic definition for dynamic arrays which you can // still access in a typesafe way using arr[i] or *(arr+i). However, // it is simply a convenience wrapper around the common idiom of // of keeping a set of variables (in a struct or globals) which store // - pointer to array // - the length of the "in-use" part of the array // - the current size of the allocated array // // I find it to be the single most useful non-built-in-structure when // programming in C (hash tables a close second), but to be clear // it lacks many of the capabilities of C++ vector<>: there is no // range checking, the object address isn't stable (see next section // for details), the set of methods available is small (although // the file stb.h has another implementation of stretchy buffers // called 'stb_arr' which provides more methods, e.g. for insertion // and deletion). // // How to use: // // Unlike other stb header file libraries, there is no need to // define an _IMPLEMENTATION symbol. Every #include creates as // much implementation is needed. // // stretchy_buffer.h does not define any types, so you do not // need to #include it to before defining data types that are // stretchy buffers, only in files that *manipulate* stretchy // buffers. // // If you want a stretchy buffer aka dynamic array containing // objects of TYPE, declare such an array as: // // TYPE *myarray = NULL; // // (There is no typesafe way to distinguish between stretchy // buffers and regular arrays/pointers; this is necessary to // make ordinary array indexing work on these objects.) // // Unlike C++ vector<>, the stretchy_buffer has the same // semantics as an object that you manually malloc and realloc. // The pointer may relocate every time you add a new object // to it, so you: // // 1. can't take long-term pointers to elements of the array // 2. have to return the pointer from functions which might expand it // (either as a return value or by storing it to a ptr-to-ptr) // // Now you can do the following things with this array: // // sb_free(TYPE *a) free the array // sb_count(TYPE *a) the number of elements in the array // sb_push(TYPE *a, TYPE v) adds v on the end of the array, a la push_back // sb_add(TYPE *a, int n) adds n uninitialized elements at end of array & returns pointer to first added // sb_last(TYPE *a) returns an lvalue of the last item in the array // a[n] access the nth (counting from 0) element of the array // // #define STRETCHY_BUFFER_NO_SHORT_NAMES to only export // names of the form 'stb_sb_' if you have a name that would // otherwise collide. // // Note that these are all macros and many of them evaluate // their arguments more than once, so the arguments should // be side-effect-free. // // Note that 'TYPE *a' in sb_push and sb_add must be lvalues // so that the library can overwrite the existing pointer if // the object has to be reallocated. // // In an out-of-memory condition, the code will try to // set up a null-pointer or otherwise-invalid-pointer // exception to happen later. It's possible optimizing // compilers could detect this write-to-null statically // and optimize away some of the code, but it should only // be along the failure path. Nevertheless, for more security // in the face of such compilers, #define STRETCHY_BUFFER_OUT_OF_MEMORY // to a statement such as assert(0) or exit(1) or something // to force a failure when out-of-memory occurs. // // Common use: // // The main application for this is when building a list of // things with an unknown quantity, either due to loading from // a file or through a process which produces an unpredictable // number. // // My most common idiom is something like: // // SomeStruct *arr = NULL; // while (something) // { // SomeStruct new_one; // new_one.whatever = whatever; // new_one.whatup = whatup; // new_one.foobar = barfoo; // sb_push(arr, new_one); // } // // and various closely-related factorings of that. For example, // you might have several functions to create/init new SomeStructs, // and if you use the above idiom, you might prefer to make them // return structs rather than take non-const-pointers-to-structs, // so you can do things like: // // SomeStruct *arr = NULL; // while (something) // { // if (case_A) { // sb_push(arr, some_func1()); // } else if (case_B) { // sb_push(arr, some_func2()); // } else { // sb_push(arr, some_func3()); // } // } // // Note that the above relies on the fact that sb_push doesn't // evaluate its second argument more than once. The macros do // evaluate the *array* argument multiple times, and numeric // arguments may be evaluated multiple times, but you can rely // on the second argument of sb_push being evaluated only once. // // Of course, you don't have to store bare objects in the array; // if you need the objects to have stable pointers, store an array // of pointers instead: // // SomeStruct **arr = NULL; // while (something) // { // SomeStruct *new_one = malloc(sizeof(*new_one)); // new_one->whatever = whatever; // new_one->whatup = whatup; // new_one->foobar = barfoo; // sb_push(arr, new_one); // } // // How it works: // // A long-standing tradition in things like malloc implementations // is to store extra data before the beginning of the block returned // to the user. The stretchy buffer implementation here uses the // same trick; the current-count and current-allocation-size are // stored before the beginning of the array returned to the user. // (This means you can't directly free() the pointer, because the // allocated pointer is different from the type-safe pointer provided // to the user.) // // The details are trivial and implementation is straightforward; // the main trick is in realizing in the first place that it's // possible to do this in a generic, type-safe way in C. // // LICENSE // // See end of file for license information. #ifndef STB_STRETCHY_BUFFER_H_INCLUDED #define STB_STRETCHY_BUFFER_H_INCLUDED #ifndef NO_STRETCHY_BUFFER_SHORT_NAMES #define sb_free stb_sb_free #define sb_push stb_sb_push #define sb_count stb_sb_count #define sb_add stb_sb_add #define sb_last stb_sb_last #endif #define stb_sb_free(a) ((a) ? free(stb__sbraw(a)),0 : 0) #define stb_sb_push(a,v) (stb__sbmaybegrow(a,1), (a)[stb__sbn(a)++] = (v)) #define stb_sb_count(a) ((a) ? stb__sbn(a) : 0) #define stb_sb_add(a,n) (stb__sbmaybegrow(a,n), stb__sbn(a)+=(n), &(a)[stb__sbn(a)-(n)]) #define stb_sb_last(a) ((a)[stb__sbn(a)-1]) #define stb__sbraw(a) ((int *) (a) - 2) #define stb__sbm(a) stb__sbraw(a)[0] #define stb__sbn(a) stb__sbraw(a)[1] #define stb__sbneedgrow(a,n) ((a)==0 || stb__sbn(a)+(n) >= stb__sbm(a)) #define stb__sbmaybegrow(a,n) (stb__sbneedgrow(a,(n)) ? stb__sbgrow(a,n) : 0) #define stb__sbgrow(a,n) ((a) = stb__sbgrowf((a), (n), sizeof(*(a)))) #include static void * stb__sbgrowf(void *arr, int increment, int itemsize) { int dbl_cur = arr ? 2*stb__sbm(arr) : 0; int min_needed = stb_sb_count(arr) + increment; int m = dbl_cur > min_needed ? dbl_cur : min_needed; int *p = (int *) realloc(arr ? stb__sbraw(arr) : 0, itemsize * m + sizeof(int)*2); if (p) { if (!arr) p[1] = 0; p[0] = m; return p+2; } else { #ifdef STRETCHY_BUFFER_OUT_OF_MEMORY STRETCHY_BUFFER_OUT_OF_MEMORY ; #endif return (void *) (2*sizeof(int)); // try to force a NULL pointer exception later } } #endif // STB_STRETCHY_BUFFER_H_INCLUDED /* ------------------------------------------------------------------------------ This software is available under 2 licenses -- choose whichever you prefer. ------------------------------------------------------------------------------ ALTERNATIVE A - MIT License Copyright (c) 2017 Sean Barrett 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. ------------------------------------------------------------------------------ ALTERNATIVE B - Public Domain (www.unlicense.org) This is free and unencumbered software released into the public domain. Anyone is free to copy, modify, publish, use, compile, sell, or distribute this software, either in source code form or as a compiled binary, for any purpose, commercial or non-commercial, and by any means. In jurisdictions that recognize copyright laws, the author or authors of this software dedicate any and all copyright interest in the software to the public domain. We make this dedication for the benefit of the public at large and to the detriment of our heirs and successors. We intend this dedication to be an overt act of relinquishment in perpetuity of all present and future rights to this software under copyright law. 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 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. ------------------------------------------------------------------------------ */ uTox/third_party/stb/stb/stb_voxel_render.h0000600000175000001440000047253714003056224020145 0ustar rakusers// stb_voxel_render.h - v0.85 - Sean Barrett, 2015 - public domain // // This library helps render large-scale "voxel" worlds for games, // in this case, one with blocks that can have textures and that // can also be a few shapes other than cubes. // // Video introduction: // http://www.youtube.com/watch?v=2vnTtiLrV1w // // Minecraft-viewer sample app (not very simple though): // http://github.com/nothings/stb/tree/master/tests/caveview // // It works by creating triangle meshes. The library includes // // - converter from dense 3D arrays of block info to vertex mesh // - vertex & fragment shaders for the vertex mesh // - assistance in setting up shader state // // For portability, none of the library code actually accesses // the 3D graphics API. (At the moment, it's not actually portable // since the shaders are GLSL only, but patches are welcome.) // // You have to do all the caching and tracking of vertex buffers // yourself. However, you could also try making a game with // a small enough world that it's fully loaded rather than // streaming. Currently the preferred vertex format is 20 bytes // per quad. There are designs to allow much more compact formats // with a slight reduction in shader features, but no roadmap // for actually implementing them. // // // USAGE // // #define the symbol STB_VOXEL_RENDER_IMPLEMENTATION in *one* // C/C++ file before the #include of this file; the implementation // will be generated in that file. // // If you define the symbols STB_VOXEL_RENDER_STATIC, then the // implementation will be private to that file. // // // FEATURES // // - you can choose textured blocks with the features below, // or colored voxels with 2^24 colors and no textures. // // - voxels are mostly just cubes, but there's support for // half-height cubes and diagonal slopes, half-height // diagonals, and even odder shapes especially for doing // more-continuous "ground". // // - texture coordinates are projections along one of the major // axes, with the per-texture scaling. // // - a number of aspects of the shader and the vertex format // are configurable; the library generally takes care of // coordinating the vertex format with the mesh for you. // // // FEATURES (SHADER PERSPECTIVE) // // - vertices aligned on integer lattice, z on multiples of 0.5 // - per-vertex "lighting" or "ambient occlusion" value (6 bits) // - per-vertex texture crossfade (3 bits) // // - per-face texture #1 id (8-bit index into array texture) // - per-face texture #2 id (8-bit index into second array texture) // - per-face color (6-bit palette index, 2 bits of per-texture boolean enable) // - per-face 5-bit normal for lighting calculations & texture coord computation // - per-face 2-bit texture matrix rotation to rotate faces // // - indexed-by-texture-id scale factor (separate for texture #1 and texture #2) // - indexed-by-texture-#2-id blend mode (alpha composite or modulate/multiply); // the first is good for decals, the second for detail textures, "light maps", // etc; both modes are controlled by texture #2's alpha, scaled by the // per-vertex texture crossfade and the per-face color (if enabled on texture #2); // modulate/multiply multiplies by an extra factor of 2.0 so that if you // make detail maps whose average brightness is 0.5 everything works nicely. // // - ambient lighting: half-lambert directional plus constant, all scaled by vertex ao // - face can be fullbright (emissive), controlled by per-face color // - installable lighting, with default single-point-light // - installable fog, with default hacked smoothstep // // Note that all the variations of lighting selection and texture // blending are run-time conditions in the shader, so they can be // intermixed in a single mesh. // // // INTEGRATION ARC // // The way to get this library to work from scratch is to do the following: // // Step 1. define STBVOX_CONFIG_MODE to 0 // // This mode uses only vertex attributes and uniforms, and is easiest // to get working. It requires 32 bytes per quad and limits the // size of some tables to avoid hitting uniform limits. // // Step 2. define STBVOX_CONFIG_MODE to 1 // // This requires using a texture buffer to store the quad data, // reducing the size to 20 bytes per quad. // // Step 3: define STBVOX_CONFIG_PREFER_TEXBUFFER // // This causes some uniforms to be stored as texture buffers // instead. This increases the size of some of those tables, // and avoids a potential slow path (gathering non-uniform // data from uniforms) on some hardware. // // In the future I might add additional modes that have significantly // smaller meshes but reduce features, down as small as 6 bytes per quad. // See elsewhere in this file for a table of candidate modes. Switching // to a mode will require changing some of your mesh creation code, but // everything else should be seamless. (And I'd like to change the API // so that mesh creation is data-driven the way the uniforms are, and // then you wouldn't even have to change anything but the mode number.) // // // IMPROVEMENTS FOR SHIP-WORTHY PROGRAMS USING THIS LIBRARY // // I currently tolerate a certain level of "bugginess" in this library. // // I'm referring to things which look a little wrong (as long as they // don't cause holes or cracks in the output meshes), or things which // do not produce as optimal a mesh as possible. Notable examples: // // - incorrect lighting on slopes // - inefficient meshes for vheight blocks // // I am willing to do the work to improve these things if someone is // going to ship a substantial program that would be improved by them. // (It need not be commercial, nor need it be a game.) I just didn't // want to do the work up front if it might never be leveraged. So just // submit a bug report as usual (github is preferred), but add a note // that this is for a thing that is really going to ship. (That means // you need to be far enough into the project that it's clear you're // committed to it; not during early exploratory development.) // // // VOXEL MESH API // // Context // // To understand the API, make sure you first understand the feature set // listed above. // // Because the vertices are compact, they have very limited spatial // precision. Thus a single mesh can only contain the data for a limited // area. To make very large voxel maps, you'll need to build multiple // vertex buffers. (But you want this anyway for frustum culling.) // // Each generated mesh has three components: // - vertex data (vertex buffer) // - face data (optional, stored in texture buffer) // - mesh transform (uniforms) // // Once you've generated the mesh with this library, it's up to you // to upload it to the GPU, to keep track of the state, and to render // it. // // Concept // // The basic design is that you pass in one or more 3D arrays; each array // is (typically) one-byte-per-voxel and contains information about one // or more properties of some particular voxel property. // // Because there is so much per-vertex and per-face data possible // in the output, and each voxel can have 6 faces and 8 vertices, it // would require an very large data structure to describe all // of the possibilities, and this would cause the mesh-creation // process to be slow. Instead, the API provides multiple ways // to express each property, some more compact, others less so; // each such way has some limitations on what it can express. // // Note that there are so many paths and combinations, not all of them // have been tested. Just report bugs and I'll fix 'em. // // Details // // See the API documentation in the header-file section. // // // CONTRIBUTORS // // Features Porting Bugfixes & Warnings // Sean Barrett github:r-leyh Jesus Fernandez // Miguel Lechon github:Arbeiterunfallversicherungsgesetz // Thomas Frase James Hofmann // Stephen Olsen github:guitarfreak // // VERSION HISTORY // // 0.85 (2017-03-03) add block_selector (by guitarfreak) // 0.84 (2016-04-02) fix GLSL syntax error on glModelView path // 0.83 (2015-09-13) remove non-constant struct initializers to support more compilers // 0.82 (2015-08-01) added input.packed_compact to store rot, vheight & texlerp efficiently // fix broken tex_overlay2 // 0.81 (2015-05-28) fix broken STBVOX_CONFIG_OPTIMIZED_VHEIGHT // 0.80 (2015-04-11) fix broken STBVOX_CONFIG_ROTATION_IN_LIGHTING refactoring // change STBVOX_MAKE_LIGHTING to STBVOX_MAKE_LIGHTING_EXT so // that header defs don't need to see config vars // add STBVOX_CONFIG_VHEIGHT_IN_LIGHTING and other vheight fixes // added documentation for vheight ("weird slopes") // 0.79 (2015-04-01) fix the missing types from 0.78; fix string constants being const // 0.78 (2015-04-02) bad "#else", compile as C++ // 0.77 (2015-04-01) documentation tweaks, rename config var to STB_VOXEL_RENDER_STATIC // 0.76 (2015-04-01) typos, signed/unsigned shader issue, more documentation // 0.75 (2015-04-01) initial release // // // HISTORICAL FOUNDATION // // stb_voxel_render 20-byte quads 2015/01 // zmc engine 32-byte quads 2013/12 // zmc engine 96-byte quads 2011/10 // // // LICENSE // // See end of file for license information. #ifndef INCLUDE_STB_VOXEL_RENDER_H #define INCLUDE_STB_VOXEL_RENDER_H #include typedef struct stbvox_mesh_maker stbvox_mesh_maker; typedef struct stbvox_input_description stbvox_input_description; #ifdef STB_VOXEL_RENDER_STATIC #define STBVXDEC static #else #define STBVXDEC extern #endif #ifdef __cplusplus extern "C" { #endif ////////////////////////////////////////////////////////////////////////////// // // CONFIGURATION MACROS // // #define STBVOX_CONFIG_MODE // REQUIRED // Configures the overall behavior of stb_voxel_render. This // can affect the shaders, the uniform info, and other things. // (If you need more than one mode in the same app, you can // use STB_VOXEL_RENDER_STATIC to create multiple versions // in separate files, and then wrap them.) // // Mode value Meaning // 0 Textured blocks, 32-byte quads // 1 Textured blocks, 20-byte quads // 20 Untextured blocks, 32-byte quads // 21 Untextured blocks, 20-byte quads // // // #define STBVOX_CONFIG_PRECISION_Z // OPTIONAL // Defines the number of bits of fractional position for Z. // Only 0 or 1 are valid. 1 is the default. If 0, then a // single mesh has twice the legal Z range; e.g. in // modes 0,1,20,21, Z in the mesh can extend to 511 instead // of 255. However, half-height blocks cannot be used. // // All of the following are just #ifdef tested so need no values, and are optional. // // STBVOX_CONFIG_BLOCKTYPE_SHORT // use unsigned 16-bit values for 'blocktype' in the input instead of 8-bit values // // STBVOX_CONFIG_OPENGL_MODELVIEW // use the gl_ModelView matrix rather than the explicit uniform // // STBVOX_CONFIG_HLSL // NOT IMPLEMENTED! Define HLSL shaders instead of GLSL shaders // // STBVOX_CONFIG_PREFER_TEXBUFFER // Stores many of the uniform arrays in texture buffers intead, // so they can be larger and may be more efficient on some hardware. // // STBVOX_CONFIG_LIGHTING_SIMPLE // Creates a simple lighting engine with a single point light source // in addition to the default half-lambert ambient light. // // STBVOX_CONFIG_LIGHTING // Declares a lighting function hook; you must append a lighting function // to the shader before compiling it: // vec3 compute_lighting(vec3 pos, vec3 norm, vec3 albedo, vec3 ambient); // 'ambient' is the half-lambert ambient light with vertex ambient-occlusion applied // // STBVOX_CONFIG_FOG_SMOOTHSTEP // Defines a simple unrealistic fog system designed to maximize // unobscured view distance while not looking too weird when things // emerge from the fog. Configured using an extra array element // in the STBVOX_UNIFORM_ambient uniform. // // STBVOX_CONFIG_FOG // Defines a fog function hook; you must append a fog function to // the shader before compiling it: // vec3 compute_fog(vec3 color, vec3 relative_pos, float fragment_alpha); // "color" is the incoming pre-fogged color, fragment_alpha is the alpha value, // and relative_pos is the vector from the point to the camera in worldspace // // STBVOX_CONFIG_DISABLE_TEX2 // This disables all processing of texture 2 in the shader in case // you don't use it. Eventually this could be replaced with a mode // that omits the unused data entirely. // // STBVOX_CONFIG_TEX1_EDGE_CLAMP // STBVOX_CONFIG_TEX2_EDGE_CLAMP // If you want to edge clamp the textures, instead of letting them wrap, // set this flag. By default stb_voxel_render relies on texture wrapping // to simplify texture coordinate generation. This flag forces it to do // it correctly, although there can still be minor artifacts. // // STBVOX_CONFIG_ROTATION_IN_LIGHTING // Changes the meaning of the 'lighting' mesher input variable to also // store the rotation; see later discussion. // // STBVOX_CONFIG_VHEIGHT_IN_LIGHTING // Changes the meaning of the 'lighting' mesher input variable to also // store the vheight; see later discussion. Cannot use both this and // the previous variable. // // STBVOX_CONFIG_PREMULTIPLIED_ALPHA // Adjusts the shader calculations on the assumption that tex1.rgba, // tex2.rgba, and color.rgba all use premultiplied values, and that // the output of the fragment shader should be premultiplied. // // STBVOX_CONFIG_UNPREMULTIPLY // Only meaningful if STBVOX_CONFIG_PREMULTIPLIED_ALPHA is defined. // Changes the behavior described above so that the inputs are // still premultiplied alpha, but the output of the fragment // shader is not premultiplied alpha. This is needed when allowing // non-unit alpha values but not doing alpha-blending (for example // when alpha testing). // ////////////////////////////////////////////////////////////////////////////// // // MESHING // // A mesh represents a (typically) small chunk of a larger world. // Meshes encode coordinates using small integers, so those // coordinates must be relative to some base location. // All of the coordinates in the functions below use // these relative coordinates unless explicitly stated // otherwise. // // Input to the meshing step is documented further down STBVXDEC void stbvox_init_mesh_maker(stbvox_mesh_maker *mm); // Call this function to initialize a mesh-maker context structure // used to build meshes. You should have one context per thread // that's building meshes. STBVXDEC void stbvox_set_buffer(stbvox_mesh_maker *mm, int mesh, int slot, void *buffer, size_t len); // Call this to set the buffer into which stbvox will write the mesh // it creates. It can build more than one mesh in parallel (distinguished // by the 'mesh' parameter), and each mesh can be made up of more than // one buffer (distinguished by the 'slot' parameter). // // Multiple meshes are under your control; use the 'selector' input // variable to choose which mesh each voxel's vertices are written to. // For example, you can use this to generate separate meshes for opaque // and transparent data. // // You can query the number of slots by calling stbvox_get_buffer_count // described below. The meaning of the buffer for each slot depends // on STBVOX_CONFIG_MODE. // // In mode 0 & mode 20, there is only one slot. The mesh data for that // slot is two interleaved vertex attributes: attr_vertex, a single // 32-bit uint, and attr_face, a single 32-bit uint. // // In mode 1 & mode 21, there are two slots. The first buffer should // be four times as large as the second buffer. The first buffer // contains a single vertex attribute: 'attr_vertex', a single 32-bit uint. // The second buffer contains texture buffer data (an array of 32-bit uints) // that will be accessed through the sampler identified by STBVOX_UNIFORM_face_data. STBVXDEC int stbvox_get_buffer_count(stbvox_mesh_maker *mm); // Returns the number of buffers needed per mesh as described above. STBVXDEC int stbvox_get_buffer_size_per_quad(stbvox_mesh_maker *mm, int slot); // Returns how much of a given buffer will get used per quad. This // allows you to choose correct relative sizes for each buffer, although // the values are fixed based on the configuration you've selected at // compile time, and the details are described in stbvox_set_buffer. STBVXDEC void stbvox_set_default_mesh(stbvox_mesh_maker *mm, int mesh); // Selects which mesh the mesher will output to (see previous function) // if the input doesn't specify a per-voxel selector. (I doubt this is // useful, but it's here just in case.) STBVXDEC stbvox_input_description *stbvox_get_input_description(stbvox_mesh_maker *mm); // This function call returns a pointer to the stbvox_input_description part // of stbvox_mesh_maker (which you should otherwise treat as opaque). You // zero this structure, then fill out the relevant pointers to the data // describing your voxel object/world. // // See further documentation at the description of stbvox_input_description below. STBVXDEC void stbvox_set_input_stride(stbvox_mesh_maker *mm, int x_stride_in_elements, int y_stride_in_elements); // This sets the stride between successive elements of the 3D arrays // in the stbvox_input_description. Z values are always stored consecutively. // (The preferred coordinate system for stbvox is X right, Y forwards, Z up.) STBVXDEC void stbvox_set_input_range(stbvox_mesh_maker *mm, int x0, int y0, int z0, int x1, int y1, int z1); // This sets the range of values in the 3D array for the voxels that // the mesh generator will convert. The lower values are inclusive, // the higher values are exclusive, so (0,0,0) to (16,16,16) generates // mesh data associated with voxels up to (15,15,15) but no higher. // // The mesh generate generates faces at the boundary between open space // and solid space but associates them with the solid space, so if (15,0,0) // is open and (16,0,0) is solid, then the mesh will contain the boundary // between them if x0 <= 16 and x1 > 16. // // Note that the mesh generator will access array elements 1 beyond the // limits set in these parameters. For example, if you set the limits // to be (0,0,0) and (16,16,16), then the generator will access all of // the voxels between (-1,-1,-1) and (16,16,16), including (16,16,16). // You may have to do pointer arithmetic to make it work. // // For example, caveview processes mesh chunks that are 32x32x16, but it // does this using input buffers that are 34x34x18. // // The lower limits are x0 >= 0, y0 >= 0, and z0 >= 0. // // The upper limits are mode dependent, but all the current methods are // limited to x1 < 127, y1 < 127, z1 < 255. Note that these are not // powers of two; if you want to use power-of-two chunks (to make // it efficient to decide which chunk a coordinate falls in), you're // limited to at most x1=64, y1=64, z1=128. For classic Minecraft-style // worlds with limited vertical extent, I recommend using a single // chunk for the entire height, which limits the height to 255 blocks // (one less than Minecraft), and only chunk the map in X & Y. STBVXDEC int stbvox_make_mesh(stbvox_mesh_maker *mm); // Call this function to create mesh data for the currently configured // set of input data. This appends to the currently configured mesh output // buffer. Returns 1 on success. If there is not enough room in the buffer, // it outputs as much as it can, and returns 0; you need to switch output // buffers (either by calling stbvox_set_buffer to set new buffers, or // by copying the data out and calling stbvox_reset_buffers), and then // call this function again without changing any of the input parameters. // // Note that this function appends; you can call it multiple times to // build a single mesh. For example, caveview uses chunks that are // 32x32x255, but builds the mesh for it by processing 32x32x16 at atime // (this is faster as it is reuses the same 34x34x18 input buffers rather // than needing 34x34x257 input buffers). // Once you're done creating a mesh into a given buffer, // consider the following functions: STBVXDEC int stbvox_get_quad_count(stbvox_mesh_maker *mm, int mesh); // Returns the number of quads in the mesh currently generated by mm. // This is the sum of all consecutive stbvox_make_mesh runs appending // to the same buffer. 'mesh' distinguishes between the multiple user // meshes available via 'selector' or stbvox_set_default_mesh. // // Typically you use this function when you're done building the mesh // and want to record how to draw it. // // Note that there are no index buffers; the data stored in the buffers // should be drawn as quads (e.g. with GL_QUAD); if your API does not // support quads, you can create a single index buffer large enough to // draw your largest vertex buffer, and reuse it for every rendering. // (Note that if you use 32-bit indices, you'll use 24 bytes of bandwidth // per quad, more than the 20 bytes for the vertex/face mesh data.) STBVXDEC void stbvox_set_mesh_coordinates(stbvox_mesh_maker *mm, int x, int y, int z); // Sets the global coordinates for this chunk, such that (0,0,0) relative // coordinates will be at (x,y,z) in global coordinates. STBVXDEC void stbvox_get_bounds(stbvox_mesh_maker *mm, float bounds[2][3]); // Returns the bounds for the mesh in global coordinates. Use this // for e.g. frustum culling the mesh. @BUG: this just uses the // values from stbvox_set_input_range(), so if you build by // appending multiple values, this will be wrong, and you need to // set stbvox_set_input_range() to the full size. Someday this // will switch to tracking the actual bounds of the *mesh*, though. STBVXDEC void stbvox_get_transform(stbvox_mesh_maker *mm, float transform[3][3]); // Returns the 'transform' data for the shader uniforms. It is your // job to set this to the shader before drawing the mesh. It is the // only uniform that needs to change per-mesh. Note that it is not // a 3x3 matrix, but rather a scale to decode fixed point numbers as // floats, a translate from relative to global space, and a special // translation for texture coordinate generation that avoids // floating-point precision issues. @TODO: currently we add the // global translation to the vertex, than multiply by modelview, // but this means if camera location and vertex are far from the // origin, we lose precision. Need to make a special modelview with // the translation (or some of it) factored out to avoid this. STBVXDEC void stbvox_reset_buffers(stbvox_mesh_maker *mm); // Call this function if you're done with the current output buffer // but want to reuse it (e.g. you're done appending with // stbvox_make_mesh and you've copied the data out to your graphics API // so can reuse the buffer). ////////////////////////////////////////////////////////////////////////////// // // RENDERING // STBVXDEC char *stbvox_get_vertex_shader(void); // Returns the (currently GLSL-only) vertex shader. STBVXDEC char *stbvox_get_fragment_shader(void); // Returns the (currently GLSL-only) fragment shader. // You can override the lighting and fogging calculations // by appending data to the end of these; see the #define // documentation for more information. STBVXDEC char *stbvox_get_fragment_shader_alpha_only(void); // Returns a slightly cheaper fragment shader that computes // alpha but not color. This is useful for e.g. a depth-only // pass when using alpha test. typedef struct stbvox_uniform_info stbvox_uniform_info; STBVXDEC int stbvox_get_uniform_info(stbvox_uniform_info *info, int uniform); // Gets the information about a uniform necessary for you to // set up each uniform with a minimal amount of explicit code. // See the sample code after the structure definition for stbvox_uniform_info, // further down in this header section. // // "uniform" is from the list immediately following. For many // of these, default values are provided which you can set. // Most values are shared for most draw calls; e.g. for stateful // APIs you can set most of the state only once. Only // STBVOX_UNIFORM_transform needs to change per draw call. // // STBVOX_UNIFORM_texscale // 64- or 128-long vec4 array. (128 only if STBVOX_CONFIG_PREFER_TEXBUFFER) // x: scale factor to apply to texture #1. must be a power of two. 1.0 means 'face-sized' // y: scale factor to apply to texture #2. must be a power of two. 1.0 means 'face-sized' // z: blend mode indexed by texture #2. 0.0 is alpha compositing; 1.0 is multiplication. // w: unused currently. @TODO use to support texture animation? // // Texscale is indexed by the bottom 6 or 7 bits of the texture id; thus for // example the texture at index 0 in the array and the texture in index 128 of // the array must be scaled the same. This means that if you only have 64 or 128 // unique textures, they all get distinct values anyway; otherwise you have // to group them in pairs or sets of four. // // STBVOX_UNIFORM_ambient // 4-long vec4 array: // ambient[0].xyz - negative of direction of a directional light for half-lambert // ambient[1].rgb - color of light scaled by NdotL (can be negative) // ambient[2].rgb - constant light added to above calculation; // effectively light ranges from ambient[2]-ambient[1] to ambient[2]+ambient[1] // ambient[3].rgb - fog color for STBVOX_CONFIG_FOG_SMOOTHSTEP // ambient[3].a - reciprocal of squared distance of farthest fog point (viewing distance) // +----- has a default value // | +-- you should always use the default value enum // V V { // ------------------------------------------------ STBVOX_UNIFORM_face_data, // n the sampler with the face texture buffer STBVOX_UNIFORM_transform, // n the transform data from stbvox_get_transform STBVOX_UNIFORM_tex_array, // n an array of two texture samplers containing the two texture arrays STBVOX_UNIFORM_texscale, // Y a table of texture properties, see above STBVOX_UNIFORM_color_table, // Y 64 vec4 RGBA values; a default palette is provided; if A > 1.0, fullbright STBVOX_UNIFORM_normals, // Y Y table of normals, internal-only STBVOX_UNIFORM_texgen, // Y Y table of texgen vectors, internal-only STBVOX_UNIFORM_ambient, // n lighting & fog info, see above STBVOX_UNIFORM_camera_pos, // Y camera position in global voxel space (for lighting & fog) STBVOX_UNIFORM_count, }; enum { STBVOX_UNIFORM_TYPE_none, STBVOX_UNIFORM_TYPE_sampler, STBVOX_UNIFORM_TYPE_vec2, STBVOX_UNIFORM_TYPE_vec3, STBVOX_UNIFORM_TYPE_vec4, }; struct stbvox_uniform_info { int type; // which type of uniform int bytes_per_element; // the size of each uniform array element (e.g. vec3 = 12 bytes) int array_length; // length of the uniform array char *name; // name in the shader @TODO use numeric binding float *default_value; // if not NULL, you can use this as the uniform pointer int use_tex_buffer; // if true, then the uniform is a sampler but the data can come from default_value }; ////////////////////////////////////////////////////////////////////////////// // // Uniform sample code // #if 0 // Run this once per frame before drawing all the meshes. // You still need to separately set the 'transform' uniform for every mesh. void setup_uniforms(GLuint shader, float camera_pos[4], GLuint tex1, GLuint tex2) { int i; glUseProgram(shader); // so uniform binding works for (i=0; i < STBVOX_UNIFORM_count; ++i) { stbvox_uniform_info sui; if (stbvox_get_uniform_info(&sui, i)) { GLint loc = glGetUniformLocation(shader, sui.name); if (loc != 0) { switch (i) { case STBVOX_UNIFORM_camera_pos: // only needed for fog glUniform4fv(loc, sui.array_length, camera_pos); break; case STBVOX_UNIFORM_tex_array: { GLuint tex_unit[2] = { 0, 1 }; // your choice of samplers glUniform1iv(loc, 2, tex_unit); glActiveTexture(GL_TEXTURE0 + tex_unit[0]); glBindTexture(GL_TEXTURE_2D_ARRAY, tex1); glActiveTexture(GL_TEXTURE0 + tex_unit[1]); glBindTexture(GL_TEXTURE_2D_ARRAY, tex2); glActiveTexture(GL_TEXTURE0); // reset to default break; } case STBVOX_UNIFORM_face_data: glUniform1i(loc, SAMPLER_YOU_WILL_BIND_PER_MESH_FACE_DATA_TO); break; case STBVOX_UNIFORM_ambient: // you definitely want to override this case STBVOX_UNIFORM_color_table: // you might want to override this case STBVOX_UNIFORM_texscale: // you may want to override this glUniform4fv(loc, sui.array_length, sui.default_value); break; case STBVOX_UNIFORM_normals: // you never want to override this case STBVOX_UNIFORM_texgen: // you never want to override this glUniform3fv(loc, sui.array_length, sui.default_value); break; } } } } } #endif #ifdef __cplusplus } #endif ////////////////////////////////////////////////////////////////////////////// // // INPUT TO MESHING // // Shapes of blocks that aren't always cubes enum { STBVOX_GEOM_empty, STBVOX_GEOM_knockout, // creates a hole in the mesh STBVOX_GEOM_solid, STBVOX_GEOM_transp, // solid geometry, but transparent contents so neighbors generate normally, unless same blocktype // following 4 can be represented by vheight as well STBVOX_GEOM_slab_upper, STBVOX_GEOM_slab_lower, STBVOX_GEOM_floor_slope_north_is_top, STBVOX_GEOM_ceil_slope_north_is_bottom, STBVOX_GEOM_floor_slope_north_is_top_as_wall_UNIMPLEMENTED, // same as floor_slope above, but uses wall's texture & texture projection STBVOX_GEOM_ceil_slope_north_is_bottom_as_wall_UNIMPLEMENTED, STBVOX_GEOM_crossed_pair, // corner-to-corner pairs, with normal vector bumped upwards STBVOX_GEOM_force, // like GEOM_transp, but faces visible even if neighbor is same type, e.g. minecraft fancy leaves // these access vheight input STBVOX_GEOM_floor_vheight_03 = 12, // diagonal is SW-NE STBVOX_GEOM_floor_vheight_12, // diagonal is SE-NW STBVOX_GEOM_ceil_vheight_03, STBVOX_GEOM_ceil_vheight_12, STBVOX_GEOM_count, // number of geom cases }; enum { STBVOX_FACE_east, STBVOX_FACE_north, STBVOX_FACE_west, STBVOX_FACE_south, STBVOX_FACE_up, STBVOX_FACE_down, STBVOX_FACE_count, }; #ifdef STBVOX_CONFIG_BLOCKTYPE_SHORT typedef unsigned short stbvox_block_type; #else typedef unsigned char stbvox_block_type; #endif // 24-bit color typedef struct { unsigned char r,g,b; } stbvox_rgb; #define STBVOX_COLOR_TEX1_ENABLE 64 #define STBVOX_COLOR_TEX2_ENABLE 128 // This is the data structure you fill out. Most of the arrays can be // NULL, except when one is required to get the value to index another. // // The compass system used in the following descriptions is: // east means increasing x // north means increasing y // up means increasing z struct stbvox_input_description { unsigned char lighting_at_vertices; // The default is lighting values (i.e. ambient occlusion) are at block // center, and the vertex light is gathered from those adjacent block // centers that the vertex is facing. This makes smooth lighting // consistent across adjacent faces with the same orientation. // // Setting this flag to non-zero gives you explicit control // of light at each vertex, but now the lighting/ao will be // shared by all vertices at the same point, even if they // have different normals. // these are mostly 3D maps you use to define your voxel world, using x_stride and y_stride // note that for cache efficiency, you want to use the block_foo palettes as much as possible instead stbvox_rgb *rgb; // Indexed by 3D coordinate. // 24-bit voxel color for STBVOX_CONFIG_MODE = 20 or 21 only unsigned char *lighting; // Indexed by 3D coordinate. The lighting value / ambient occlusion // value that is used to define the vertex lighting values. // The raw lighting values are defined at the center of blocks // (or at vertex if 'lighting_at_vertices' is true). // // If the macro STBVOX_CONFIG_ROTATION_IN_LIGHTING is defined, // then an additional 2-bit block rotation value is stored // in this field as well. // // Encode with STBVOX_MAKE_LIGHTING_EXT(lighting,rot)--here // 'lighting' should still be 8 bits, as the macro will // discard the bottom bits automatically. Similarly, if // using STBVOX_CONFIG_VHEIGHT_IN_LIGHTING, encode with // STBVOX_MAKE_LIGHTING_EXT(lighting,vheight). // // (Rationale: rotation needs to be independent of blocktype, // but is only 2 bits so doesn't want to be its own array. // Lighting is the one thing that was likely to already be // in use and that I could easily steal 2 bits from.) stbvox_block_type *blocktype; // Indexed by 3D coordinate. This is a core "block type" value, which is used // to index into other arrays; essentially a "palette". This is much more // memory-efficient and performance-friendly than storing the values explicitly, // but only makes sense if the values are always synchronized. // // If a voxel's blocktype is 0, it is assumed to be empty (STBVOX_GEOM_empty), // and no other blocktypes should be STBVOX_GEOM_empty. (Only if you do not // have blocktypes should STBVOX_GEOM_empty ever used.) // // Normally it is an unsigned byte, but you can override it to be // a short if you have too many blocktypes. unsigned char *geometry; // Indexed by 3D coordinate. Contains the geometry type for the block. // Also contains a 2-bit rotation for how the whole block is rotated. // Also includes a 2-bit vheight value when using shared vheight values. // See the separate vheight documentation. // Encode with STBVOX_MAKE_GEOMETRY(geom, rot, vheight) unsigned char *block_geometry; // Array indexed by blocktype containing the geometry for this block, plus // a 2-bit "simple rotation". Note rotation has limited use since it's not // independent of blocktype. // // Encode with STBVOX_MAKE_GEOMETRY(geom,simple_rot,0) unsigned char *block_tex1; // Array indexed by blocktype containing the texture id for texture #1. unsigned char (*block_tex1_face)[6]; // Array indexed by blocktype and face containing the texture id for texture #1. // The N/E/S/W face choices can be rotated by one of the rotation selectors; // The top & bottom face textures will rotate to match. // Note that it only makes sense to use one of block_tex1 or block_tex1_face; // this pattern repeats throughout and this notice is not repeated. unsigned char *tex2; // Indexed by 3D coordinate. Contains the texture id for texture #2 // to use on all faces of the block. unsigned char *block_tex2; // Array indexed by blocktype containing the texture id for texture #2. unsigned char (*block_tex2_face)[6]; // Array indexed by blocktype and face containing the texture id for texture #2. // The N/E/S/W face choices can be rotated by one of the rotation selectors; // The top & bottom face textures will rotate to match. unsigned char *color; // Indexed by 3D coordinate. Contains the color for all faces of the block. // The core color value is 0..63. // Encode with STBVOX_MAKE_COLOR(color_number, tex1_enable, tex2_enable) unsigned char *block_color; // Array indexed by blocktype containing the color value to apply to the faces. // The core color value is 0..63. // Encode with STBVOX_MAKE_COLOR(color_number, tex1_enable, tex2_enable) unsigned char (*block_color_face)[6]; // Array indexed by blocktype and face containing the color value to apply to that face. // The core color value is 0..63. // Encode with STBVOX_MAKE_COLOR(color_number, tex1_enable, tex2_enable) unsigned char *block_texlerp; // Array indexed by blocktype containing 3-bit scalar for texture #2 alpha // (known throughout as 'texlerp'). This is constant over every face even // though the property is potentially per-vertex. unsigned char (*block_texlerp_face)[6]; // Array indexed by blocktype and face containing 3-bit scalar for texture #2 alpha. // This is constant over the face even though the property is potentially per-vertex. unsigned char *block_vheight; // Array indexed by blocktype containing the vheight values for the // top or bottom face of this block. These will rotate properly if the // block is rotated. See discussion of vheight. // Encode with STBVOX_MAKE_VHEIGHT(sw_height, se_height, nw_height, ne_height) unsigned char *selector; // Array indexed by 3D coordinates indicating which output mesh to select. unsigned char *block_selector; // Array indexed by blocktype indicating which output mesh to select. unsigned char *side_texrot; // Array indexed by 3D coordinates encoding 2-bit texture rotations for the // faces on the E/N/W/S sides of the block. // Encode with STBVOX_MAKE_SIDE_TEXROT(rot_e, rot_n, rot_w, rot_s) unsigned char *block_side_texrot; // Array indexed by blocktype encoding 2-bit texture rotations for the faces // on the E/N/W/S sides of the block. // Encode with STBVOX_MAKE_SIDE_TEXROT(rot_e, rot_n, rot_w, rot_s) unsigned char *overlay; // index into palettes listed below // Indexed by 3D coordinate. If 0, there is no overlay. If non-zero, // it indexes into to the below arrays and overrides the values // defined by the blocktype. unsigned char (*overlay_tex1)[6]; // Array indexed by overlay value and face, containing an override value // for the texture id for texture #1. If 0, the value defined by blocktype // is used. unsigned char (*overlay_tex2)[6]; // Array indexed by overlay value and face, containing an override value // for the texture id for texture #2. If 0, the value defined by blocktype // is used. unsigned char (*overlay_color)[6]; // Array indexed by overlay value and face, containing an override value // for the face color. If 0, the value defined by blocktype is used. unsigned char *overlay_side_texrot; // Array indexed by overlay value, encoding 2-bit texture rotations for the faces // on the E/N/W/S sides of the block. // Encode with STBVOX_MAKE_SIDE_TEXROT(rot_e, rot_n, rot_w, rot_s) unsigned char *rotate; // Indexed by 3D coordinate. Allows independent rotation of several // parts of the voxel, where by rotation I mean swapping textures // and colors between E/N/S/W faces. // Block: rotates anything indexed by blocktype // Overlay: rotates anything indexed by overlay // EColor: rotates faces defined in ecolor_facemask // Encode with STBVOX_MAKE_MATROT(block,overlay,ecolor) unsigned char *tex2_for_tex1; // Array indexed by tex1 containing the texture id for texture #2. // You can use this if the two are always/almost-always strictly // correlated (e.g. if tex2 is a detail texture for tex1), as it // will be more efficient (touching fewer cache lines) than using // e.g. block_tex2_face. unsigned char *tex2_replace; // Indexed by 3D coordinate. Specifies the texture id for texture #2 // to use on a single face of the voxel, which must be E/N/W/S (not U/D). // The texture id is limited to 6 bits unless tex2_facemask is also // defined (see below). // Encode with STBVOX_MAKE_TEX2_REPLACE(tex2, face) unsigned char *tex2_facemask; // Indexed by 3D coordinate. Specifies which of the six faces should // have their tex2 replaced by the value of tex2_replace. In this // case, all 8 bits of tex2_replace are used as the texture id. // Encode with STBVOX_MAKE_FACE_MASK(east,north,west,south,up,down) unsigned char *extended_color; // Indexed by 3D coordinate. Specifies a value that indexes into // the ecolor arrays below (both of which must be defined). unsigned char *ecolor_color; // Indexed by extended_color value, specifies an optional override // for the color value on some faces. // Encode with STBVOX_MAKE_COLOR(color_number, tex1_enable, tex2_enable) unsigned char *ecolor_facemask; // Indexed by extended_color value, this specifies which faces the // color in ecolor_color should be applied to. The faces can be // independently rotated by the ecolor value of 'rotate', if it exists. // Encode with STBVOX_MAKE_FACE_MASK(e,n,w,s,u,d) unsigned char *color2; // Indexed by 3D coordinates, specifies an alternative color to apply // to some of the faces of the block. // Encode with STBVOX_MAKE_COLOR(color_number, tex1_enable, tex2_enable) unsigned char *color2_facemask; // Indexed by 3D coordinates, specifies which faces should use the // color defined in color2. No rotation value is applied. // Encode with STBVOX_MAKE_FACE_MASK(e,n,w,s,u,d) unsigned char *color3; // Indexed by 3D coordinates, specifies an alternative color to apply // to some of the faces of the block. // Encode with STBVOX_MAKE_COLOR(color_number, tex1_enable, tex2_enable) unsigned char *color3_facemask; // Indexed by 3D coordinates, specifies which faces should use the // color defined in color3. No rotation value is applied. // Encode with STBVOX_MAKE_FACE_MASK(e,n,w,s,u,d) unsigned char *texlerp_simple; // Indexed by 3D coordinates, this is the smallest texlerp encoding // that can do useful work. It consits of three values: baselerp, // vertlerp, and face_vertlerp. Baselerp defines the value // to use on all of the faces but one, from the STBVOX_TEXLERP_BASE // values. face_vertlerp is one of the 6 face values (or STBVOX_FACE_NONE) // which specifies the face should use the vertlerp values. // Vertlerp defines a lerp value at every vertex of the mesh. // Thus, one face can have per-vertex texlerp values, and those // values are encoded in the space so that they will be shared // by adjacent faces that also use vertlerp, allowing continuity // (this is used for the "texture crossfade" bit of the release video). // Encode with STBVOX_MAKE_TEXLERP_SIMPLE(baselerp, vertlerp, face_vertlerp) // The following texlerp encodings are experimental and maybe not // that useful. unsigned char *texlerp; // Indexed by 3D coordinates, this defines four values: // vertlerp is a lerp value at every vertex of the mesh (using STBVOX_TEXLERP_BASE values). // ud is the value to use on up and down faces, from STBVOX_TEXLERP_FACE values // ew is the value to use on east and west faces, from STBVOX_TEXLERP_FACE values // ns is the value to use on north and south faces, from STBVOX_TEXLERP_FACE values // If any of ud, ew, or ns is STBVOX_TEXLERP_FACE_use_vert, then the // vertlerp values for the vertices are gathered and used for those faces. // Encode with STBVOX_MAKE_TEXLERP(vertlerp,ud,ew,sw) unsigned short *texlerp_vert3; // Indexed by 3D coordinates, this works with texlerp and // provides a unique texlerp value for every direction at // every vertex. The same rules of whether faces share values // applies. The STBVOX_TEXLERP_FACE vertlerp value defined in // texlerp is only used for the down direction. The values at // each vertex in other directions are defined in this array, // and each uses the STBVOX_TEXLERP3 values (i.e. full precision // 3-bit texlerp values). // Encode with STBVOX_MAKE_VERT3(vertlerp_e,vertlerp_n,vertlerp_w,vertlerp_s,vertlerp_u) unsigned short *texlerp_face3; // e:3,n:3,w:3,s:3,u:2,d:2 // Indexed by 3D coordinates, this provides a compact way to // fully specify the texlerp value indepenendly for every face, // but doesn't allow per-vertex variation. E/N/W/S values are // encoded using STBVOX_TEXLERP3 values, whereas up and down // use STBVOX_TEXLERP_SIMPLE values. // Encode with STBVOX_MAKE_FACE3(face_e,face_n,face_w,face_s,face_u,face_d) unsigned char *vheight; // STBVOX_MAKE_VHEIGHT -- sw:2, se:2, nw:2, ne:2, doesn't rotate // Indexed by 3D coordinates, this defines the four // vheight values to use if the geometry is STBVOX_GEOM_vheight*. // See the vheight discussion. unsigned char *packed_compact; // Stores block rotation, vheight, and texlerp values: // block rotation: 2 bits // vertex vheight: 2 bits // use_texlerp : 1 bit // vertex texlerp: 3 bits // If STBVOX_CONFIG_UP_TEXLERP_PACKED is defined, then 'vertex texlerp' is // used for up faces if use_texlerp is 1. If STBVOX_CONFIG_DOWN_TEXLERP_PACKED // is defined, then 'vertex texlerp' is used for down faces if use_texlerp is 1. // Note if those symbols are defined but packed_compact is NULL, the normal // texlerp default will be used. // Encode with STBVOX_MAKE_PACKED_COMPACT(rot, vheight, texlerp, use_texlerp) }; // @OPTIMIZE allow specializing; build a single struct with all of the // 3D-indexed arrays combined so it's AoS instead of SoA for better // cache efficiency ////////////////////////////////////////////////////////////////////////////// // // VHEIGHT DOCUMENTATION // // "vheight" is the internal name for the special block types // with sloped tops or bottoms. "vheight" stands for "vertex height". // // Note that these blocks are very flexible (there are 256 of them, // although at least 17 of them should never be used), but they // also have a disadvantage that they generate extra invisible // faces; the generator does not currently detect whether adjacent // vheight blocks hide each others sides, so those side faces are // always generated. For a continuous ground terrain, this means // that you may generate 5x as many quads as needed. See notes // on "improvements for shipping products" in the introduction. enum { STBVOX_VERTEX_HEIGHT_0, STBVOX_VERTEX_HEIGHT_half, STBVOX_VERTEX_HEIGHT_1, STBVOX_VERTEX_HEIGHT_one_and_a_half, }; // These are the "vheight" values. Vheight stands for "vertex height". // The idea is that for a "floor vheight" block, you take a cube and // reposition the top-most vertices at various heights as specified by // the vheight values. Similarly, a "ceiling vheight" block takes a // cube and repositions the bottom-most vertices. // // A floor block only adjusts the top four vertices; the bottom four vertices // remain at the bottom of the block. The height values are 2 bits, // measured in halves of a block; so you can specify heights of 0/2, // 1/2, 2/2, or 3/2. 0 is the bottom of the block, 1 is halfway // up the block, 2 is the top of the block, and 3 is halfway up the // next block (and actually outside of the block). The value 3 is // actually legal for floor vheight (but not ceiling), and allows you to: // // (A) have smoother terrain by having slopes that cross blocks, // e.g. (1,1,3,3) is a regular-seeming slope halfway between blocks // (B) make slopes steeper than 45-degrees, e.g. (0,0,3,3) // // (Because only z coordinates have half-block precision, and x&y are // limited to block corner precision, it's not possible to make these // things "properly" out of blocks, e.g. a half-slope block on its side // or a sloped block halfway between blocks that's made out of two blocks.) // // If you define STBVOX_CONFIG_OPTIMIZED_VHEIGHT, then the top face // (or bottom face for a ceiling vheight block) will be drawn as a // single quad even if the four vertex heights aren't planar, and a // single normal will be used over the entire quad. If you // don't define it, then if the top face is non-planar, it will be // split into two triangles, each with their own normal/lighting. // (Note that since all output from stb_voxel_render is quad meshes, // triangles are actually rendered as degenerate quads.) In this case, // the distinction betwen STBVOX_GEOM_floor_vheight_03 and // STBVOX_GEOM_floor_vheight_12 comes into play; the former introduces // an edge from the SW to NE corner (i.e. from <0,0,?> to <1,1,?>), // while the latter introduces an edge from the NW to SE corner // (i.e. from <0,1,?> to <1,0,?>.) For a "lazy mesh" look, use // exclusively _03 or _12. For a "classic mesh" look, alternate // _03 and _12 in a checkerboard pattern. For a "smoothest surface" // look, choose the edge based on actual vertex heights. // // The four vertex heights can come from several places. The simplest // encoding is to just use the 'vheight' parameter which stores four // explicit vertex heights for every block. This allows total independence, // but at the cost of the largest memory usage, 1 byte per 3D block. // Encode this with STBVOX_MAKE_VHEIGHT(vh_sw, vh_se, vh_nw, vh_ne). // These coordinates are absolute, not affected by block rotations. // // An alternative if you just want to encode some very specific block // types, not all the possibilities--say you just want half-height slopes, // so you want (0,0,1,1) and (1,1,2,2)--then you can use block_vheight // to specify them. The geometry rotation will cause block_vheight values // to be rotated (because it's as if you're just defining a type of // block). This value is also encoded with STBVOX_MAKE_VHEIGHT. // // If you want to save memory and you're creating a "continuous ground" // sort of effect, you can make each vertex of the lattice share the // vheight value; that is, two adjacent blocks that share a vertex will // always get the same vheight value for that vertex. Then you need to // store two bits of vheight for every block, which you do by storing it // as part another data structure. Store the south-west vertex's vheight // with the block. You can either use the "geometry" mesh variable (it's // a parameter to STBVOX_MAKE_GEOMETRY) or you can store it in the // "lighting" mesh variable if you defined STBVOX_CONFIG_VHEIGHT_IN_LIGHTING, // using STBVOX_MAKE_LIGHTING_EXT(lighting,vheight). // // Note that if you start with a 2D height map and generate vheight data from // it, you don't necessarily store only one value per (x,y) coordinate, // as the same value may need to be set up at multiple z heights. For // example, if height(8,8) = 13.5, then you want the block at (8,8,13) // to store STBVOX_VERTEX_HEIGHT_half, and this will be used by blocks // at (7,7,13), (8,7,13), (7,8,13), and (8,8,13). However, if you're // allowing steep slopes, it might be the case that you have a block // at (7,7,12) which is supposed to stick up to 13.5; that means // you also need to store STBVOX_VERTEX_HEIGHT_one_and_a_half at (8,8,12). enum { STBVOX_TEXLERP_FACE_0, STBVOX_TEXLERP_FACE_half, STBVOX_TEXLERP_FACE_1, STBVOX_TEXLERP_FACE_use_vert, }; enum { STBVOX_TEXLERP_BASE_0, // 0.0 STBVOX_TEXLERP_BASE_2_7, // 2/7 STBVOX_TEXLERP_BASE_5_7, // 4/7 STBVOX_TEXLERP_BASE_1 // 1.0 }; enum { STBVOX_TEXLERP3_0_8, STBVOX_TEXLERP3_1_8, STBVOX_TEXLERP3_2_8, STBVOX_TEXLERP3_3_8, STBVOX_TEXLERP3_4_8, STBVOX_TEXLERP3_5_8, STBVOX_TEXLERP3_6_8, STBVOX_TEXLERP3_7_8, }; #define STBVOX_FACE_NONE 7 #define STBVOX_BLOCKTYPE_EMPTY 0 #ifdef STBVOX_BLOCKTYPE_SHORT #define STBVOX_BLOCKTYPE_HOLE 65535 #else #define STBVOX_BLOCKTYPE_HOLE 255 #endif #define STBVOX_MAKE_GEOMETRY(geom, rotate, vheight) ((geom) + (rotate)*16 + (vheight)*64) #define STBVOX_MAKE_VHEIGHT(v_sw, v_se, v_nw, v_ne) ((v_sw) + (v_se)*4 + (v_nw)*16 + (v_ne)*64) #define STBVOX_MAKE_MATROT(block, overlay, color) ((block) + (overlay)*4 + (color)*64) #define STBVOX_MAKE_TEX2_REPLACE(tex2, tex2_replace_face) ((tex2) + ((tex2_replace_face) & 3)*64) #define STBVOX_MAKE_TEXLERP(ns2, ew2, ud2, vert) ((ew2) + (ns2)*4 + (ud2)*16 + (vert)*64) #define STBVOX_MAKE_TEXLERP_SIMPLE(baselerp,vert,face) ((vert)*32 + (face)*4 + (baselerp)) #define STBVOX_MAKE_TEXLERP1(vert,e2,n2,w2,s2,u4,d2) STBVOX_MAKE_TEXLERP(s2, w2, d2, vert) #define STBVOX_MAKE_TEXLERP2(vert,e2,n2,w2,s2,u4,d2) ((u2)*16 + (n2)*4 + (s2)) #define STBVOX_MAKE_FACE_MASK(e,n,w,s,u,d) ((e)+(n)*2+(w)*4+(s)*8+(u)*16+(d)*32) #define STBVOX_MAKE_SIDE_TEXROT(e,n,w,s) ((e)+(n)*4+(w)*16+(s)*64) #define STBVOX_MAKE_COLOR(color,t1,t2) ((color)+(t1)*64+(t2)*128) #define STBVOX_MAKE_TEXLERP_VERT3(e,n,w,s,u) ((e)+(n)*8+(w)*64+(s)*512+(u)*4096) #define STBVOX_MAKE_TEXLERP_FACE3(e,n,w,s,u,d) ((e)+(n)*8+(w)*64+(s)*512+(u)*4096+(d)*16384) #define STBVOX_MAKE_PACKED_COMPACT(rot, vheight, texlerp, def) ((rot)+4*(vheight)+16*(use)+32*(texlerp)) #define STBVOX_MAKE_LIGHTING_EXT(lighting, rot) (((lighting)&~3)+(rot)) #define STBVOX_MAKE_LIGHTING(lighting) (lighting) #ifndef STBVOX_MAX_MESHES #define STBVOX_MAX_MESHES 2 // opaque & transparent #endif #define STBVOX_MAX_MESH_SLOTS 3 // one vertex & two faces, or two vertex and one face // don't mess with this directly, it's just here so you can // declare stbvox_mesh_maker on the stack or as a global struct stbvox_mesh_maker { stbvox_input_description input; int cur_x, cur_y, cur_z; // last unprocessed voxel if it splits into multiple buffers int x0,y0,z0,x1,y1,z1; int x_stride_in_bytes; int y_stride_in_bytes; int config_dirty; int default_mesh; unsigned int tags; int cube_vertex_offset[6][4]; // this allows access per-vertex data stored block-centered (like texlerp, ambient) int vertex_gather_offset[6][4]; int pos_x,pos_y,pos_z; int full; // computed from user input char *output_cur [STBVOX_MAX_MESHES][STBVOX_MAX_MESH_SLOTS]; char *output_end [STBVOX_MAX_MESHES][STBVOX_MAX_MESH_SLOTS]; char *output_buffer[STBVOX_MAX_MESHES][STBVOX_MAX_MESH_SLOTS]; int output_len [STBVOX_MAX_MESHES][STBVOX_MAX_MESH_SLOTS]; // computed from config int output_size [STBVOX_MAX_MESHES][STBVOX_MAX_MESH_SLOTS]; // per quad int output_step [STBVOX_MAX_MESHES][STBVOX_MAX_MESH_SLOTS]; // per vertex or per face, depending int num_mesh_slots; float default_tex_scale[128][2]; }; #endif // INCLUDE_STB_VOXEL_RENDER_H #ifdef STB_VOXEL_RENDER_IMPLEMENTATION #include #include #include // memset // have to use our own names to avoid the _MSC_VER path having conflicting type names #ifndef _MSC_VER #include typedef uint16_t stbvox_uint16; typedef uint32_t stbvox_uint32; #else typedef unsigned short stbvox_uint16; typedef unsigned int stbvox_uint32; #endif #ifdef _MSC_VER #define STBVOX_NOTUSED(v) (void)(v) #else #define STBVOX_NOTUSED(v) (void)sizeof(v) #endif #ifndef STBVOX_CONFIG_MODE #error "Must defined STBVOX_CONFIG_MODE to select the mode" #endif #if defined(STBVOX_CONFIG_ROTATION_IN_LIGHTING) && defined(STBVOX_CONFIG_VHEIGHT_IN_LIGHTING) #error "Can't store both rotation and vheight in lighting" #endif // The following are candidate voxel modes. Only modes 0, 1, and 20, and 21 are // currently implemented. Reducing the storage-per-quad further // shouldn't improve performance, although obviously it allow you // to create larger worlds without streaming. // // // ----------- Two textures ----------- -- One texture -- ---- Color only ---- // Mode: 0 1 2 3 4 5 6 10 11 12 20 21 22 23 24 // ============================================================================================================ // uses Tex Buffer n Y Y Y Y Y Y Y Y Y n Y Y Y Y // bytes per quad 32 20 14 12 10 6 6 8 8 4 32 20 10 6 4 // non-blocks all all some some some slabs stairs some some none all all slabs slabs none // tex1 256 256 256 256 256 256 256 256 256 256 n n n n n // tex2 256 256 256 256 256 256 128 n n n n n n n n // colors 64 64 64 64 64 64 64 8 n n 2^24 2^24 2^24 2^24 256 // vertex ao Y Y Y Y Y n n Y Y n Y Y Y n n // vertex texlerp Y Y Y n n n n - - - - - - - - // x&y extents 127 127 128 64 64 128 64 64 128 128 127 127 128 128 128 // z extents 255 255 128 64? 64? 64 64 32 64 128 255 255 128 64 128 // not sure why I only wrote down the above "result data" and didn't preserve // the vertex formats, but here I've tried to reconstruct the designs... // mode # 3 is wrong, one byte too large, but they may have been an error originally // Mode: 0 1 2 3 4 5 6 10 11 12 20 21 22 23 24 // ============================================================================================================= // bytes per quad 32 20 14 12 10 6 6 8 8 4 20 10 6 4 // // vertex x bits 7 7 0 6 0 0 0 0 0 0 7 0 0 0 // vertex y bits 7 7 0 0 0 0 0 0 0 0 7 0 0 0 // vertex z bits 9 9 7 4 2 0 0 2 2 0 9 2 0 0 // vertex ao bits 6 6 6 6 6 0 0 6 6 0 6 6 0 0 // vertex txl bits 3 3 3 0 0 0 0 0 0 0 (3) 0 0 0 // // face tex1 bits (8) 8 8 8 8 8 8 8 8 8 // face tex2 bits (8) 8 8 8 8 8 7 - - - // face color bits (8) 8 8 8 8 8 8 3 0 0 24 24 24 8 // face normal bits (8) 8 8 8 6 4 7 4 4 3 8 3 4 3 // face x bits 7 0 6 7 6 6 7 7 0 7 7 7 // face y bits 7 6 6 7 6 6 7 7 0 7 7 7 // face z bits 2 2 6 6 6 5 6 7 0 7 6 7 #if STBVOX_CONFIG_MODE==0 || STBVOX_CONFIG_MODE==1 #define STBVOX_ICONFIG_VERTEX_32 #define STBVOX_ICONFIG_FACE1_1 #elif STBVOX_CONFIG_MODE==20 || STBVOX_CONFIG_MODE==21 #define STBVOX_ICONFIG_VERTEX_32 #define STBVOX_ICONFIG_FACE1_1 #define STBVOX_ICONFIG_UNTEXTURED #else #error "Selected value of STBVOX_CONFIG_MODE is not supported" #endif #if STBVOX_CONFIG_MODE==0 || STBVOX_CONFIG_MODE==20 #define STBVOX_ICONFIG_FACE_ATTRIBUTE #endif #ifndef STBVOX_CONFIG_HLSL // the fallback if all others are exhausted is GLSL #define STBVOX_ICONFIG_GLSL #endif #ifdef STBVOX_CONFIG_OPENGL_MODELVIEW #define STBVOX_ICONFIG_OPENGL_3_1_COMPATIBILITY #endif #if defined(STBVOX_ICONFIG_VERTEX_32) typedef stbvox_uint32 stbvox_mesh_vertex; #define stbvox_vertex_encode(x,y,z,ao,texlerp) \ ((stbvox_uint32) ((x)+((y)<<7)+((z)<<14)+((ao)<<23)+((texlerp)<<29))) #elif defined(STBVOX_ICONFIG_VERTEX_16_1) // mode=2 typedef stbvox_uint16 stbvox_mesh_vertex; #define stbvox_vertex_encode(x,y,z,ao,texlerp) \ ((stbvox_uint16) ((z)+((ao)<<7)+((texlerp)<<13) #elif defined(STBVOX_ICONFIG_VERTEX_16_2) // mode=3 typedef stbvox_uint16 stbvox_mesh_vertex; #define stbvox_vertex_encode(x,y,z,ao,texlerp) \ ((stbvox_uint16) ((x)+((z)<<6))+((ao)<<10)) #elif defined(STBVOX_ICONFIG_VERTEX_8) typedef stbvox_uint8 stbvox_mesh_vertex; #define stbvox_vertex_encode(x,y,z,ao,texlerp) \ ((stbvox_uint8) ((z)+((ao)<<6)) #else #error "internal error, no vertex type" #endif #ifdef STBVOX_ICONFIG_FACE1_1 typedef struct { unsigned char tex1,tex2,color,face_info; } stbvox_mesh_face; #else #error "internal error, no face type" #endif // 20-byte quad format: // // per vertex: // // x:7 // y:7 // z:9 // ao:6 // tex_lerp:3 // // per face: // // tex1:8 // tex2:8 // face:8 // color:8 // Faces: // // Faces use the bottom 3 bits to choose the texgen // mode, and all the bits to choose the normal. // Thus the bottom 3 bits have to be: // e, n, w, s, u, d, u, d // // These use compact names so tables are readable enum { STBVF_e, STBVF_n, STBVF_w, STBVF_s, STBVF_u, STBVF_d, STBVF_eu, STBVF_ed, STBVF_eu_wall, STBVF_nu_wall, STBVF_wu_wall, STBVF_su_wall, STBVF_ne_u, STBVF_ne_d, STBVF_nu, STBVF_nd, STBVF_ed_wall, STBVF_nd_wall, STBVF_wd_wall, STBVF_sd_wall, STBVF_nw_u, STBVF_nw_d, STBVF_wu, STBVF_wd, STBVF_ne_u_cross, STBVF_nw_u_cross, STBVF_sw_u_cross, STBVF_se_u_cross, STBVF_sw_u, STBVF_sw_d, STBVF_su, STBVF_sd, // @TODO we need more than 5 bits to encode the normal to fit the following // so for now we use the right projection but the wrong normal STBVF_se_u = STBVF_su, STBVF_se_d = STBVF_sd, STBVF_count, }; ///////////////////////////////////////////////////////////////////////////// // // tables -- i'd prefer if these were at the end of the file, but: C++ // static float stbvox_default_texgen[2][32][3] = { { { 0, 1,0 }, { 0, 0, 1 }, { 0,-1,0 }, { 0, 0,-1 }, { -1, 0,0 }, { 0, 0, 1 }, { 1, 0,0 }, { 0, 0,-1 }, { 0,-1,0 }, { 0, 0, 1 }, { 0, 1,0 }, { 0, 0,-1 }, { 1, 0,0 }, { 0, 0, 1 }, { -1, 0,0 }, { 0, 0,-1 }, { 1, 0,0 }, { 0, 1, 0 }, { -1, 0,0 }, { 0,-1, 0 }, { -1, 0,0 }, { 0,-1, 0 }, { 1, 0,0 }, { 0, 1, 0 }, { 1, 0,0 }, { 0, 1, 0 }, { -1, 0,0 }, { 0,-1, 0 }, { -1, 0,0 }, { 0,-1, 0 }, { 1, 0,0 }, { 0, 1, 0 }, }, { { 0, 0,-1 }, { 0, 1,0 }, { 0, 0, 1 }, { 0,-1,0 }, { 0, 0,-1 }, { -1, 0,0 }, { 0, 0, 1 }, { 1, 0,0 }, { 0, 0,-1 }, { 0,-1,0 }, { 0, 0, 1 }, { 0, 1,0 }, { 0, 0,-1 }, { 1, 0,0 }, { 0, 0, 1 }, { -1, 0,0 }, { 0,-1, 0 }, { 1, 0,0 }, { 0, 1, 0 }, { -1, 0,0 }, { 0, 1, 0 }, { -1, 0,0 }, { 0,-1, 0 }, { 1, 0,0 }, { 0,-1, 0 }, { 1, 0,0 }, { 0, 1, 0 }, { -1, 0,0 }, { 0, 1, 0 }, { -1, 0,0 }, { 0,-1, 0 }, { 1, 0,0 }, }, }; #define STBVOX_RSQRT2 0.7071067811865f #define STBVOX_RSQRT3 0.5773502691896f static float stbvox_default_normals[32][3] = { { 1,0,0 }, // east { 0,1,0 }, // north { -1,0,0 }, // west { 0,-1,0 }, // south { 0,0,1 }, // up { 0,0,-1 }, // down { STBVOX_RSQRT2,0, STBVOX_RSQRT2 }, // east & up { STBVOX_RSQRT2,0, -STBVOX_RSQRT2 }, // east & down { STBVOX_RSQRT2,0, STBVOX_RSQRT2 }, // east & up { 0, STBVOX_RSQRT2, STBVOX_RSQRT2 }, // north & up { -STBVOX_RSQRT2,0, STBVOX_RSQRT2 }, // west & up { 0,-STBVOX_RSQRT2, STBVOX_RSQRT2 }, // south & up { STBVOX_RSQRT3, STBVOX_RSQRT3, STBVOX_RSQRT3 }, // ne & up { STBVOX_RSQRT3, STBVOX_RSQRT3,-STBVOX_RSQRT3 }, // ne & down { 0, STBVOX_RSQRT2, STBVOX_RSQRT2 }, // north & up { 0, STBVOX_RSQRT2, -STBVOX_RSQRT2 }, // north & down { STBVOX_RSQRT2,0, -STBVOX_RSQRT2 }, // east & down { 0, STBVOX_RSQRT2, -STBVOX_RSQRT2 }, // north & down { -STBVOX_RSQRT2,0, -STBVOX_RSQRT2 }, // west & down { 0,-STBVOX_RSQRT2, -STBVOX_RSQRT2 }, // south & down { -STBVOX_RSQRT3, STBVOX_RSQRT3, STBVOX_RSQRT3 }, // NW & up { -STBVOX_RSQRT3, STBVOX_RSQRT3,-STBVOX_RSQRT3 }, // NW & down { -STBVOX_RSQRT2,0, STBVOX_RSQRT2 }, // west & up { -STBVOX_RSQRT2,0, -STBVOX_RSQRT2 }, // west & down { STBVOX_RSQRT3, STBVOX_RSQRT3,STBVOX_RSQRT3 }, // NE & up crossed { -STBVOX_RSQRT3, STBVOX_RSQRT3,STBVOX_RSQRT3 }, // NW & up crossed { -STBVOX_RSQRT3,-STBVOX_RSQRT3,STBVOX_RSQRT3 }, // SW & up crossed { STBVOX_RSQRT3,-STBVOX_RSQRT3,STBVOX_RSQRT3 }, // SE & up crossed { -STBVOX_RSQRT3,-STBVOX_RSQRT3, STBVOX_RSQRT3 }, // SW & up { -STBVOX_RSQRT3,-STBVOX_RSQRT3,-STBVOX_RSQRT3 }, // SW & up { 0,-STBVOX_RSQRT2, STBVOX_RSQRT2 }, // south & up { 0,-STBVOX_RSQRT2, -STBVOX_RSQRT2 }, // south & down }; static float stbvox_default_texscale[128][4] = { {1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0}, {1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0}, {1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0}, {1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0}, {1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0}, {1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0}, {1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0}, {1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0}, {1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0}, {1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0}, {1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0}, {1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0}, {1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0}, {1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0}, {1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0}, {1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0},{1,1,0,0}, }; static unsigned char stbvox_default_palette_compact[64][3] = { { 255,255,255 }, { 238,238,238 }, { 221,221,221 }, { 204,204,204 }, { 187,187,187 }, { 170,170,170 }, { 153,153,153 }, { 136,136,136 }, { 119,119,119 }, { 102,102,102 }, { 85, 85, 85 }, { 68, 68, 68 }, { 51, 51, 51 }, { 34, 34, 34 }, { 17, 17, 17 }, { 0, 0, 0 }, { 255,240,240 }, { 255,220,220 }, { 255,160,160 }, { 255, 32, 32 }, { 200,120,160 }, { 200, 60,150 }, { 220,100,130 }, { 255, 0,128 }, { 240,240,255 }, { 220,220,255 }, { 160,160,255 }, { 32, 32,255 }, { 120,160,200 }, { 60,150,200 }, { 100,130,220 }, { 0,128,255 }, { 240,255,240 }, { 220,255,220 }, { 160,255,160 }, { 32,255, 32 }, { 160,200,120 }, { 150,200, 60 }, { 130,220,100 }, { 128,255, 0 }, { 255,255,240 }, { 255,255,220 }, { 220,220,180 }, { 255,255, 32 }, { 200,160,120 }, { 200,150, 60 }, { 220,130,100 }, { 255,128, 0 }, { 255,240,255 }, { 255,220,255 }, { 220,180,220 }, { 255, 32,255 }, { 160,120,200 }, { 150, 60,200 }, { 130,100,220 }, { 128, 0,255 }, { 240,255,255 }, { 220,255,255 }, { 180,220,220 }, { 32,255,255 }, { 120,200,160 }, { 60,200,150 }, { 100,220,130 }, { 0,255,128 }, }; static float stbvox_default_ambient[4][4] = { { 0,0,1 ,0 }, // reversed lighting direction { 0.5,0.5,0.5,0 }, // directional color { 0.5,0.5,0.5,0 }, // constant color { 0.5,0.5,0.5,1.0f/1000.0f/1000.0f }, // fog data for simple_fog }; static float stbvox_default_palette[64][4]; static void stbvox_build_default_palette(void) { int i; for (i=0; i < 64; ++i) { stbvox_default_palette[i][0] = stbvox_default_palette_compact[i][0] / 255.0f; stbvox_default_palette[i][1] = stbvox_default_palette_compact[i][1] / 255.0f; stbvox_default_palette[i][2] = stbvox_default_palette_compact[i][2] / 255.0f; stbvox_default_palette[i][3] = 1.0f; } } ////////////////////////////////////////////////////////////////////////////// // // Shaders // #if defined(STBVOX_ICONFIG_OPENGL_3_1_COMPATIBILITY) #define STBVOX_SHADER_VERSION "#version 150 compatibility\n" #elif defined(STBVOX_ICONFIG_OPENGL_3_0) #define STBVOX_SHADER_VERSION "#version 130\n" #elif defined(STBVOX_ICONFIG_GLSL) #define STBVOX_SHADER_VERSION "#version 150\n" #else #define STBVOX_SHADER_VERSION "" #endif static const char *stbvox_vertex_program = { STBVOX_SHADER_VERSION #ifdef STBVOX_ICONFIG_FACE_ATTRIBUTE // NOT TAG_face_sampled "in uvec4 attr_face;\n" #else "uniform usamplerBuffer facearray;\n" #endif #ifdef STBVOX_ICONFIG_FACE_ARRAY_2 "uniform usamplerBuffer facearray2;\n" #endif // vertex input data "in uint attr_vertex;\n" // per-buffer data "uniform vec3 transform[3];\n" // per-frame data "uniform vec4 camera_pos;\n" // 4th value is used for arbitrary hacking // to simplify things, we avoid using more than 256 uniform vectors // in fragment shader to avoid possible 1024 component limit, so // we access this table in the fragment shader. "uniform vec3 normal_table[32];\n" #ifndef STBVOX_CONFIG_OPENGL_MODELVIEW "uniform mat4x4 model_view;\n" #endif // fragment output data "flat out uvec4 facedata;\n" " out vec3 voxelspace_pos;\n" " out vec3 vnormal;\n" " out float texlerp;\n" " out float amb_occ;\n" // @TODO handle the HLSL way to do this "void main()\n" "{\n" #ifdef STBVOX_ICONFIG_FACE_ATTRIBUTE " facedata = attr_face;\n" #else " int faceID = gl_VertexID >> 2;\n" " facedata = texelFetch(facearray, faceID);\n" #endif // extract data for vertex " vec3 offset;\n" " offset.x = float( (attr_vertex ) & 127u );\n" // a[0..6] " offset.y = float( (attr_vertex >> 7u) & 127u );\n" // a[7..13] " offset.z = float( (attr_vertex >> 14u) & 511u );\n" // a[14..22] " amb_occ = float( (attr_vertex >> 23u) & 63u ) / 63.0;\n" // a[23..28] " texlerp = float( (attr_vertex >> 29u) ) / 7.0;\n" // a[29..31] " vnormal = normal_table[(facedata.w>>2u) & 31u];\n" " voxelspace_pos = offset * transform[0];\n" // mesh-to-object scale " vec3 position = voxelspace_pos + transform[1];\n" // mesh-to-object translate #ifdef STBVOX_DEBUG_TEST_NORMALS " if ((facedata.w & 28u) == 16u || (facedata.w & 28u) == 24u)\n" " position += vnormal.xyz * camera_pos.w;\n" #endif #ifndef STBVOX_CONFIG_OPENGL_MODELVIEW " gl_Position = model_view * vec4(position,1.0);\n" #else " gl_Position = gl_ModelViewProjectionMatrix * vec4(position,1.0);\n" #endif "}\n" }; static const char *stbvox_fragment_program = { STBVOX_SHADER_VERSION // rlerp is lerp but with t on the left, like god intended #if defined(STBVOX_ICONFIG_GLSL) "#define rlerp(t,x,y) mix(x,y,t)\n" #elif defined(STBVOX_CONFIG_HLSL) "#define rlerp(t,x,y) lerp(x,y,t)\n" #else #error "need definition of rlerp()" #endif // vertex-shader output data "flat in uvec4 facedata;\n" " in vec3 voxelspace_pos;\n" " in vec3 vnormal;\n" " in float texlerp;\n" " in float amb_occ;\n" // per-buffer data "uniform vec3 transform[3];\n" // per-frame data "uniform vec4 camera_pos;\n" // 4th value is used for arbitrary hacking // probably constant data "uniform vec4 ambient[4];\n" #ifndef STBVOX_ICONFIG_UNTEXTURED // generally constant data "uniform sampler2DArray tex_array[2];\n" #ifdef STBVOX_CONFIG_PREFER_TEXBUFFER "uniform samplerBuffer color_table;\n" "uniform samplerBuffer texscale;\n" "uniform samplerBuffer texgen;\n" #else "uniform vec4 color_table[64];\n" "uniform vec4 texscale[64];\n" // instead of 128, to avoid running out of uniforms "uniform vec3 texgen[64];\n" #endif #endif "out vec4 outcolor;\n" #if defined(STBVOX_CONFIG_LIGHTING) || defined(STBVOX_CONFIG_LIGHTING_SIMPLE) "vec3 compute_lighting(vec3 pos, vec3 norm, vec3 albedo, vec3 ambient);\n" #endif #if defined(STBVOX_CONFIG_FOG) || defined(STBVOX_CONFIG_FOG_SMOOTHSTEP) "vec3 compute_fog(vec3 color, vec3 relative_pos, float fragment_alpha);\n" #endif "void main()\n" "{\n" " vec3 albedo;\n" " float fragment_alpha;\n" #ifndef STBVOX_ICONFIG_UNTEXTURED // unpack the values " uint tex1_id = facedata.x;\n" " uint tex2_id = facedata.y;\n" " uint texprojid = facedata.w & 31u;\n" " uint color_id = facedata.z;\n" #ifndef STBVOX_CONFIG_PREFER_TEXBUFFER // load from uniforms / texture buffers " vec3 texgen_s = texgen[texprojid];\n" " vec3 texgen_t = texgen[texprojid+32u];\n" " float tex1_scale = texscale[tex1_id & 63u].x;\n" " vec4 color = color_table[color_id & 63u];\n" #ifndef STBVOX_CONFIG_DISABLE_TEX2 " vec4 tex2_props = texscale[tex2_id & 63u];\n" #endif #else " vec3 texgen_s = texelFetch(texgen, int(texprojid)).xyz;\n" " vec3 texgen_t = texelFetch(texgen, int(texprojid+32u)).xyz;\n" " float tex1_scale = texelFetch(texscale, int(tex1_id & 127u)).x;\n" " vec4 color = texelFetch(color_table, int(color_id & 63u));\n" #ifndef STBVOX_CONFIG_DISABLE_TEX2 " vec4 tex2_props = texelFetch(texscale, int(tex1_id & 127u));\n" #endif #endif #ifndef STBVOX_CONFIG_DISABLE_TEX2 " float tex2_scale = tex2_props.y;\n" " bool texblend_mode = tex2_props.z != 0.0;\n" #endif " vec2 texcoord;\n" " vec3 texturespace_pos = voxelspace_pos + transform[2].xyz;\n" " texcoord.s = dot(texturespace_pos, texgen_s);\n" " texcoord.t = dot(texturespace_pos, texgen_t);\n" " vec2 texcoord_1 = tex1_scale * texcoord;\n" #ifndef STBVOX_CONFIG_DISABLE_TEX2 " vec2 texcoord_2 = tex2_scale * texcoord;\n" #endif #ifdef STBVOX_CONFIG_TEX1_EDGE_CLAMP " texcoord_1 = texcoord_1 - floor(texcoord_1);\n" " vec4 tex1 = textureGrad(tex_array[0], vec3(texcoord_1, float(tex1_id)), dFdx(tex1_scale*texcoord), dFdy(tex1_scale*texcoord));\n" #else " vec4 tex1 = texture(tex_array[0], vec3(texcoord_1, float(tex1_id)));\n" #endif #ifndef STBVOX_CONFIG_DISABLE_TEX2 #ifdef STBVOX_CONFIG_TEX2_EDGE_CLAMP " texcoord_2 = texcoord_2 - floor(texcoord_2);\n" " vec4 tex2 = textureGrad(tex_array[0], vec3(texcoord_2, float(tex2_id)), dFdx(tex2_scale*texcoord), dFdy(tex2_scale*texcoord));\n" #else " vec4 tex2 = texture(tex_array[1], vec3(texcoord_2, float(tex2_id)));\n" #endif #endif " bool emissive = (color.a > 1.0);\n" " color.a = min(color.a, 1.0);\n" // recolor textures " if ((color_id & 64u) != 0u) tex1.rgba *= color.rgba;\n" " fragment_alpha = tex1.a;\n" #ifndef STBVOX_CONFIG_DISABLE_TEX2 " if ((color_id & 128u) != 0u) tex2.rgba *= color.rgba;\n" #ifdef STBVOX_CONFIG_PREMULTIPLIED_ALPHA " tex2.rgba *= texlerp;\n" #else " tex2.a *= texlerp;\n" #endif " if (texblend_mode)\n" " albedo = tex1.xyz * rlerp(tex2.a, vec3(1.0,1.0,1.0), 2.0*tex2.xyz);\n" " else {\n" #ifdef STBVOX_CONFIG_PREMULTIPLIED_ALPHA " albedo = (1.0-tex2.a)*tex1.xyz + tex2.xyz;\n" #else " albedo = rlerp(tex2.a, tex1.xyz, tex2.xyz);\n" #endif " fragment_alpha = tex1.a*(1-tex2.a)+tex2.a;\n" " }\n" #else " albedo = tex1.xyz;\n" #endif #else // UNTEXTURED " vec4 color;" " color.xyz = vec3(facedata.xyz) / 255.0;\n" " bool emissive = false;\n" " albedo = color.xyz;\n" " fragment_alpha = 1.0;\n" #endif #ifdef STBVOX_ICONFIG_VARYING_VERTEX_NORMALS // currently, there are no modes that trigger this path; idea is that there // could be a couple of bits per vertex to perturb the normal to e.g. get curved look " vec3 normal = normalize(vnormal);\n" #else " vec3 normal = vnormal;\n" #endif " vec3 ambient_color = dot(normal, ambient[0].xyz) * ambient[1].xyz + ambient[2].xyz;\n" " ambient_color = clamp(ambient_color, 0.0, 1.0);" " ambient_color *= amb_occ;\n" " vec3 lit_color;\n" " if (!emissive)\n" #if defined(STBVOX_ICONFIG_LIGHTING) || defined(STBVOX_CONFIG_LIGHTING_SIMPLE) " lit_color = compute_lighting(voxelspace_pos + transform[1], normal, albedo, ambient_color);\n" #else " lit_color = albedo * ambient_color ;\n" #endif " else\n" " lit_color = albedo;\n" #if defined(STBVOX_ICONFIG_FOG) || defined(STBVOX_CONFIG_FOG_SMOOTHSTEP) " vec3 dist = voxelspace_pos + (transform[1] - camera_pos.xyz);\n" " lit_color = compute_fog(lit_color, dist, fragment_alpha);\n" #endif #ifdef STBVOX_CONFIG_UNPREMULTIPLY " vec4 final_color = vec4(lit_color/fragment_alpha, fragment_alpha);\n" #else " vec4 final_color = vec4(lit_color, fragment_alpha);\n" #endif " outcolor = final_color;\n" "}\n" #ifdef STBVOX_CONFIG_LIGHTING_SIMPLE "\n" "uniform vec3 light_source[2];\n" "vec3 compute_lighting(vec3 pos, vec3 norm, vec3 albedo, vec3 ambient)\n" "{\n" " vec3 light_dir = light_source[0] - pos;\n" " float lambert = dot(light_dir, norm) / dot(light_dir, light_dir);\n" " vec3 diffuse = clamp(light_source[1] * clamp(lambert, 0.0, 1.0), 0.0, 1.0);\n" " return (diffuse + ambient) * albedo;\n" "}\n" #endif #ifdef STBVOX_CONFIG_FOG_SMOOTHSTEP "\n" "vec3 compute_fog(vec3 color, vec3 relative_pos, float fragment_alpha)\n" "{\n" " float f = dot(relative_pos,relative_pos)*ambient[3].w;\n" //" f = rlerp(f, -2,1);\n" " f = clamp(f, 0.0, 1.0);\n" " f = 3.0*f*f - 2.0*f*f*f;\n" // smoothstep //" f = f*f;\n" // fade in more smoothly #ifdef STBVOX_CONFIG_PREMULTIPLIED_ALPHA " return rlerp(f, color.xyz, ambient[3].xyz*fragment_alpha);\n" #else " return rlerp(f, color.xyz, ambient[3].xyz);\n" #endif "}\n" #endif }; // still requires full alpha lookups, including tex2 if texblend is enabled static const char *stbvox_fragment_program_alpha_only = { STBVOX_SHADER_VERSION // vertex-shader output data "flat in uvec4 facedata;\n" " in vec3 voxelspace_pos;\n" " in float texlerp;\n" // per-buffer data "uniform vec3 transform[3];\n" #ifndef STBVOX_ICONFIG_UNTEXTURED // generally constant data "uniform sampler2DArray tex_array[2];\n" #ifdef STBVOX_CONFIG_PREFER_TEXBUFFER "uniform samplerBuffer texscale;\n" "uniform samplerBuffer texgen;\n" #else "uniform vec4 texscale[64];\n" // instead of 128, to avoid running out of uniforms "uniform vec3 texgen[64];\n" #endif #endif "out vec4 outcolor;\n" "void main()\n" "{\n" " vec3 albedo;\n" " float fragment_alpha;\n" #ifndef STBVOX_ICONFIG_UNTEXTURED // unpack the values " uint tex1_id = facedata.x;\n" " uint tex2_id = facedata.y;\n" " uint texprojid = facedata.w & 31u;\n" " uint color_id = facedata.z;\n" #ifndef STBVOX_CONFIG_PREFER_TEXBUFFER // load from uniforms / texture buffers " vec3 texgen_s = texgen[texprojid];\n" " vec3 texgen_t = texgen[texprojid+32u];\n" " float tex1_scale = texscale[tex1_id & 63u].x;\n" " vec4 color = color_table[color_id & 63u];\n" " vec4 tex2_props = texscale[tex2_id & 63u];\n" #else " vec3 texgen_s = texelFetch(texgen, int(texprojid)).xyz;\n" " vec3 texgen_t = texelFetch(texgen, int(texprojid+32u)).xyz;\n" " float tex1_scale = texelFetch(texscale, int(tex1_id & 127u)).x;\n" " vec4 color = texelFetch(color_table, int(color_id & 63u));\n" " vec4 tex2_props = texelFetch(texscale, int(tex2_id & 127u));\n" #endif #ifndef STBVOX_CONFIG_DISABLE_TEX2 " float tex2_scale = tex2_props.y;\n" " bool texblend_mode = tex2_props.z &((facedata.w & 128u) != 0u);\n" #endif " color.a = min(color.a, 1.0);\n" " vec2 texcoord;\n" " vec3 texturespace_pos = voxelspace_pos + transform[2].xyz;\n" " texcoord.s = dot(texturespace_pos, texgen_s);\n" " texcoord.t = dot(texturespace_pos, texgen_t);\n" " vec2 texcoord_1 = tex1_scale * texcoord;\n" " vec2 texcoord_2 = tex2_scale * texcoord;\n" #ifdef STBVOX_CONFIG_TEX1_EDGE_CLAMP " texcoord_1 = texcoord_1 - floor(texcoord_1);\n" " vec4 tex1 = textureGrad(tex_array[0], vec3(texcoord_1, float(tex1_id)), dFdx(tex1_scale*texcoord), dFdy(tex1_scale*texcoord));\n" #else " vec4 tex1 = texture(tex_array[0], vec3(texcoord_1, float(tex1_id)));\n" #endif " if ((color_id & 64u) != 0u) tex1.a *= color.a;\n" " fragment_alpha = tex1.a;\n" #ifndef STBVOX_CONFIG_DISABLE_TEX2 " if (!texblend_mode) {\n" #ifdef STBVOX_CONFIG_TEX2_EDGE_CLAMP " texcoord_2 = texcoord_2 - floor(texcoord_2);\n" " vec4 tex2 = textureGrad(tex_array[0], vec3(texcoord_2, float(tex2_id)), dFdx(tex2_scale*texcoord), dFdy(tex2_scale*texcoord));\n" #else " vec4 tex2 = texture(tex_array[1], vec3(texcoord_2, float(tex2_id)));\n" #endif " tex2.a *= texlerp;\n" " if ((color_id & 128u) != 0u) tex2.rgba *= color.a;\n" " fragment_alpha = tex1.a*(1-tex2.a)+tex2.a;\n" "}\n" "\n" #endif #else // UNTEXTURED " fragment_alpha = 1.0;\n" #endif " outcolor = vec4(0.0, 0.0, 0.0, fragment_alpha);\n" "}\n" }; STBVXDEC char *stbvox_get_vertex_shader(void) { return (char *) stbvox_vertex_program; } STBVXDEC char *stbvox_get_fragment_shader(void) { return (char *) stbvox_fragment_program; } STBVXDEC char *stbvox_get_fragment_shader_alpha_only(void) { return (char *) stbvox_fragment_program_alpha_only; } static float stbvox_dummy_transform[3][3]; #ifdef STBVOX_CONFIG_PREFER_TEXBUFFER #define STBVOX_TEXBUF 1 #else #define STBVOX_TEXBUF 0 #endif static stbvox_uniform_info stbvox_uniforms[] = { { STBVOX_UNIFORM_TYPE_sampler , 4, 1, (char*) "facearray" , 0 }, { STBVOX_UNIFORM_TYPE_vec3 , 12, 3, (char*) "transform" , stbvox_dummy_transform[0] }, { STBVOX_UNIFORM_TYPE_sampler , 4, 2, (char*) "tex_array" , 0 }, { STBVOX_UNIFORM_TYPE_vec4 , 16, 128, (char*) "texscale" , stbvox_default_texscale[0] , STBVOX_TEXBUF }, { STBVOX_UNIFORM_TYPE_vec4 , 16, 64, (char*) "color_table" , stbvox_default_palette[0] , STBVOX_TEXBUF }, { STBVOX_UNIFORM_TYPE_vec3 , 12, 32, (char*) "normal_table" , stbvox_default_normals[0] }, { STBVOX_UNIFORM_TYPE_vec3 , 12, 64, (char*) "texgen" , stbvox_default_texgen[0][0], STBVOX_TEXBUF }, { STBVOX_UNIFORM_TYPE_vec4 , 16, 4, (char*) "ambient" , stbvox_default_ambient[0] }, { STBVOX_UNIFORM_TYPE_vec4 , 16, 1, (char*) "camera_pos" , stbvox_dummy_transform[0] }, }; STBVXDEC int stbvox_get_uniform_info(stbvox_uniform_info *info, int uniform) { if (uniform < 0 || uniform >= STBVOX_UNIFORM_count) return 0; *info = stbvox_uniforms[uniform]; return 1; } #define STBVOX_GET_GEO(geom_data) ((geom_data) & 15) typedef struct { unsigned char block:2; unsigned char overlay:2; unsigned char facerot:2; unsigned char ecolor:2; } stbvox_rotate; typedef struct { unsigned char x,y,z; } stbvox_pos; static unsigned char stbvox_rotate_face[6][4] = { { 0,1,2,3 }, { 1,2,3,0 }, { 2,3,0,1 }, { 3,0,1,2 }, { 4,4,4,4 }, { 5,5,5,5 }, }; #define STBVOX_ROTATE(x,r) stbvox_rotate_face[x][r] // (((x)+(r))&3) stbvox_mesh_face stbvox_compute_mesh_face_value(stbvox_mesh_maker *mm, stbvox_rotate rot, int face, int v_off, int normal) { stbvox_mesh_face face_data = { 0 }; stbvox_block_type bt = mm->input.blocktype[v_off]; unsigned char bt_face = STBVOX_ROTATE(face, rot.block); int facerot = rot.facerot; #ifdef STBVOX_ICONFIG_UNTEXTURED if (mm->input.rgb) { face_data.tex1 = mm->input.rgb[v_off].r; face_data.tex2 = mm->input.rgb[v_off].g; face_data.color = mm->input.rgb[v_off].b; face_data.face_info = (normal<<2); return face_data; } #else unsigned char color_face; if (mm->input.color) face_data.color = mm->input.color[v_off]; if (mm->input.block_tex1) face_data.tex1 = mm->input.block_tex1[bt]; else if (mm->input.block_tex1_face) face_data.tex1 = mm->input.block_tex1_face[bt][bt_face]; else face_data.tex1 = bt; if (mm->input.block_tex2) face_data.tex2 = mm->input.block_tex2[bt]; else if (mm->input.block_tex2_face) face_data.tex2 = mm->input.block_tex2_face[bt][bt_face]; if (mm->input.block_color) { unsigned char mcol = mm->input.block_color[bt]; if (mcol) face_data.color = mcol; } else if (mm->input.block_color_face) { unsigned char mcol = mm->input.block_color_face[bt][bt_face]; if (mcol) face_data.color = mcol; } if (face <= STBVOX_FACE_south) { if (mm->input.side_texrot) facerot = mm->input.side_texrot[v_off] >> (2 * face); else if (mm->input.block_side_texrot) facerot = mm->input.block_side_texrot[v_off] >> (2 * bt_face); } if (mm->input.overlay) { int over_face = STBVOX_ROTATE(face, rot.overlay); unsigned char over = mm->input.overlay[v_off]; if (over) { if (mm->input.overlay_tex1) { unsigned char rep1 = mm->input.overlay_tex1[over][over_face]; if (rep1) face_data.tex1 = rep1; } if (mm->input.overlay_tex2) { unsigned char rep2 = mm->input.overlay_tex2[over][over_face]; if (rep2) face_data.tex2 = rep2; } if (mm->input.overlay_color) { unsigned char rep3 = mm->input.overlay_color[over][over_face]; if (rep3) face_data.color = rep3; } if (mm->input.overlay_side_texrot && face <= STBVOX_FACE_south) facerot = mm->input.overlay_side_texrot[over] >> (2*over_face); } } if (mm->input.tex2_for_tex1) face_data.tex2 = mm->input.tex2_for_tex1[face_data.tex1]; if (mm->input.tex2) face_data.tex2 = mm->input.tex2[v_off]; if (mm->input.tex2_replace) { if (mm->input.tex2_facemask[v_off] & (1 << face)) face_data.tex2 = mm->input.tex2_replace[v_off]; } color_face = STBVOX_ROTATE(face, rot.ecolor); if (mm->input.extended_color) { unsigned char ec = mm->input.extended_color[v_off]; if (mm->input.ecolor_facemask[ec] & (1 << color_face)) face_data.color = mm->input.ecolor_color[ec]; } if (mm->input.color2) { if (mm->input.color2_facemask[v_off] & (1 << color_face)) face_data.color = mm->input.color2[v_off]; if (mm->input.color3 && (mm->input.color3_facemask[v_off] & (1 << color_face))) face_data.color = mm->input.color3[v_off]; } #endif face_data.face_info = (normal<<2) + facerot; return face_data; } // these are the types of faces each block can have enum { STBVOX_FT_none , STBVOX_FT_upper , STBVOX_FT_lower , STBVOX_FT_solid , STBVOX_FT_diag_012, STBVOX_FT_diag_023, STBVOX_FT_diag_013, STBVOX_FT_diag_123, STBVOX_FT_force , // can't be covered up, used for internal faces, also hides nothing STBVOX_FT_partial , // only covered by solid, never covers anything else STBVOX_FT_count }; static unsigned char stbvox_face_lerp[6] = { 0,2,0,2,4,4 }; static unsigned char stbvox_vert3_lerp[5] = { 0,3,6,9,12 }; static unsigned char stbvox_vert_lerp_for_face_lerp[4] = { 0, 4, 7, 7 }; static unsigned char stbvox_face3_lerp[6] = { 0,3,6,9,12,14 }; static unsigned char stbvox_vert_lerp_for_simple[4] = { 0,2,5,7 }; static unsigned char stbvox_face3_updown[8] = { 0,2,5,7,0,2,5,7 }; // ignore top bit // vertex offsets for face vertices static unsigned char stbvox_vertex_vector[6][4][3] = { { { 1,0,1 }, { 1,1,1 }, { 1,1,0 }, { 1,0,0 } }, // east { { 1,1,1 }, { 0,1,1 }, { 0,1,0 }, { 1,1,0 } }, // north { { 0,1,1 }, { 0,0,1 }, { 0,0,0 }, { 0,1,0 } }, // west { { 0,0,1 }, { 1,0,1 }, { 1,0,0 }, { 0,0,0 } }, // south { { 0,1,1 }, { 1,1,1 }, { 1,0,1 }, { 0,0,1 } }, // up { { 0,0,0 }, { 1,0,0 }, { 1,1,0 }, { 0,1,0 } }, // down }; // stbvox_vertex_vector, but read coordinates as binary numbers, zyx static unsigned char stbvox_vertex_selector[6][4] = { { 5,7,3,1 }, { 7,6,2,3 }, { 6,4,0,2 }, { 4,5,1,0 }, { 6,7,5,4 }, { 0,1,3,2 }, }; static stbvox_mesh_vertex stbvox_vmesh_delta_normal[6][4] = { { stbvox_vertex_encode(1,0,1,0,0) , stbvox_vertex_encode(1,1,1,0,0) , stbvox_vertex_encode(1,1,0,0,0) , stbvox_vertex_encode(1,0,0,0,0) }, { stbvox_vertex_encode(1,1,1,0,0) , stbvox_vertex_encode(0,1,1,0,0) , stbvox_vertex_encode(0,1,0,0,0) , stbvox_vertex_encode(1,1,0,0,0) }, { stbvox_vertex_encode(0,1,1,0,0) , stbvox_vertex_encode(0,0,1,0,0) , stbvox_vertex_encode(0,0,0,0,0) , stbvox_vertex_encode(0,1,0,0,0) }, { stbvox_vertex_encode(0,0,1,0,0) , stbvox_vertex_encode(1,0,1,0,0) , stbvox_vertex_encode(1,0,0,0,0) , stbvox_vertex_encode(0,0,0,0,0) }, { stbvox_vertex_encode(0,1,1,0,0) , stbvox_vertex_encode(1,1,1,0,0) , stbvox_vertex_encode(1,0,1,0,0) , stbvox_vertex_encode(0,0,1,0,0) }, { stbvox_vertex_encode(0,0,0,0,0) , stbvox_vertex_encode(1,0,0,0,0) , stbvox_vertex_encode(1,1,0,0,0) , stbvox_vertex_encode(0,1,0,0,0) } }; static stbvox_mesh_vertex stbvox_vmesh_pre_vheight[6][4] = { { stbvox_vertex_encode(1,0,0,0,0) , stbvox_vertex_encode(1,1,0,0,0) , stbvox_vertex_encode(1,1,0,0,0) , stbvox_vertex_encode(1,0,0,0,0) }, { stbvox_vertex_encode(1,1,0,0,0) , stbvox_vertex_encode(0,1,0,0,0) , stbvox_vertex_encode(0,1,0,0,0) , stbvox_vertex_encode(1,1,0,0,0) }, { stbvox_vertex_encode(0,1,0,0,0) , stbvox_vertex_encode(0,0,0,0,0) , stbvox_vertex_encode(0,0,0,0,0) , stbvox_vertex_encode(0,1,0,0,0) }, { stbvox_vertex_encode(0,0,0,0,0) , stbvox_vertex_encode(1,0,0,0,0) , stbvox_vertex_encode(1,0,0,0,0) , stbvox_vertex_encode(0,0,0,0,0) }, { stbvox_vertex_encode(0,1,0,0,0) , stbvox_vertex_encode(1,1,0,0,0) , stbvox_vertex_encode(1,0,0,0,0) , stbvox_vertex_encode(0,0,0,0,0) }, { stbvox_vertex_encode(0,0,0,0,0) , stbvox_vertex_encode(1,0,0,0,0) , stbvox_vertex_encode(1,1,0,0,0) , stbvox_vertex_encode(0,1,0,0,0) } }; static stbvox_mesh_vertex stbvox_vmesh_delta_half_z[6][4] = { { stbvox_vertex_encode(1,0,2,0,0) , stbvox_vertex_encode(1,1,2,0,0) , stbvox_vertex_encode(1,1,0,0,0) , stbvox_vertex_encode(1,0,0,0,0) }, { stbvox_vertex_encode(1,1,2,0,0) , stbvox_vertex_encode(0,1,2,0,0) , stbvox_vertex_encode(0,1,0,0,0) , stbvox_vertex_encode(1,1,0,0,0) }, { stbvox_vertex_encode(0,1,2,0,0) , stbvox_vertex_encode(0,0,2,0,0) , stbvox_vertex_encode(0,0,0,0,0) , stbvox_vertex_encode(0,1,0,0,0) }, { stbvox_vertex_encode(0,0,2,0,0) , stbvox_vertex_encode(1,0,2,0,0) , stbvox_vertex_encode(1,0,0,0,0) , stbvox_vertex_encode(0,0,0,0,0) }, { stbvox_vertex_encode(0,1,2,0,0) , stbvox_vertex_encode(1,1,2,0,0) , stbvox_vertex_encode(1,0,2,0,0) , stbvox_vertex_encode(0,0,2,0,0) }, { stbvox_vertex_encode(0,0,0,0,0) , stbvox_vertex_encode(1,0,0,0,0) , stbvox_vertex_encode(1,1,0,0,0) , stbvox_vertex_encode(0,1,0,0,0) } }; static stbvox_mesh_vertex stbvox_vmesh_crossed_pair[6][4] = { { stbvox_vertex_encode(1,0,2,0,0) , stbvox_vertex_encode(0,1,2,0,0) , stbvox_vertex_encode(0,1,0,0,0) , stbvox_vertex_encode(1,0,0,0,0) }, { stbvox_vertex_encode(1,1,2,0,0) , stbvox_vertex_encode(0,0,2,0,0) , stbvox_vertex_encode(0,0,0,0,0) , stbvox_vertex_encode(1,1,0,0,0) }, { stbvox_vertex_encode(0,1,2,0,0) , stbvox_vertex_encode(1,0,2,0,0) , stbvox_vertex_encode(1,0,0,0,0) , stbvox_vertex_encode(0,1,0,0,0) }, { stbvox_vertex_encode(0,0,2,0,0) , stbvox_vertex_encode(1,1,2,0,0) , stbvox_vertex_encode(1,1,0,0,0) , stbvox_vertex_encode(0,0,0,0,0) }, // not used, so we leave it non-degenerate to make sure it doesn't get gen'd accidentally { stbvox_vertex_encode(0,1,2,0,0) , stbvox_vertex_encode(1,1,2,0,0) , stbvox_vertex_encode(1,0,2,0,0) , stbvox_vertex_encode(0,0,2,0,0) }, { stbvox_vertex_encode(0,0,0,0,0) , stbvox_vertex_encode(1,0,0,0,0) , stbvox_vertex_encode(1,1,0,0,0) , stbvox_vertex_encode(0,1,0,0,0) } }; #define STBVOX_MAX_GEOM 16 #define STBVOX_NUM_ROTATION 4 // this is used to determine if a face is ever generated at all static unsigned char stbvox_hasface[STBVOX_MAX_GEOM][STBVOX_NUM_ROTATION] = { { 0,0,0,0 }, // empty { 0,0,0,0 }, // knockout { 63,63,63,63 }, // solid { 63,63,63,63 }, // transp { 63,63,63,63 }, // slab { 63,63,63,63 }, // slab { 1|2|4|48, 8|1|2|48, 4|8|1|48, 2|4|8|48, }, // floor slopes { 1|2|4|48, 8|1|2|48, 4|8|1|48, 2|4|8|48, }, // ceil slopes { 47,47,47,47 }, // wall-projected diagonal with down face { 31,31,31,31 }, // wall-projected diagonal with up face { 63,63,63,63 }, // crossed-pair has special handling, but avoid early-out { 63,63,63,63 }, // force { 63,63,63,63 }, // vheight { 63,63,63,63 }, // vheight { 63,63,63,63 }, // vheight { 63,63,63,63 }, // vheight }; // this determines which face type above is visible on each side of the geometry static unsigned char stbvox_facetype[STBVOX_GEOM_count][6] = { { 0, }, // STBVOX_GEOM_empty { STBVOX_FT_solid, STBVOX_FT_solid, STBVOX_FT_solid, STBVOX_FT_solid, STBVOX_FT_solid, STBVOX_FT_solid }, // knockout { STBVOX_FT_solid, STBVOX_FT_solid, STBVOX_FT_solid, STBVOX_FT_solid, STBVOX_FT_solid, STBVOX_FT_solid }, // solid { STBVOX_FT_force, STBVOX_FT_force, STBVOX_FT_force, STBVOX_FT_force, STBVOX_FT_force, STBVOX_FT_force }, // transp { STBVOX_FT_upper, STBVOX_FT_upper, STBVOX_FT_upper, STBVOX_FT_upper, STBVOX_FT_solid, STBVOX_FT_force }, { STBVOX_FT_lower, STBVOX_FT_lower, STBVOX_FT_lower, STBVOX_FT_lower, STBVOX_FT_force, STBVOX_FT_solid }, { STBVOX_FT_diag_123, STBVOX_FT_solid, STBVOX_FT_diag_023, STBVOX_FT_none, STBVOX_FT_force, STBVOX_FT_solid }, { STBVOX_FT_diag_012, STBVOX_FT_solid, STBVOX_FT_diag_013, STBVOX_FT_none, STBVOX_FT_solid, STBVOX_FT_force }, { STBVOX_FT_diag_123, STBVOX_FT_solid, STBVOX_FT_diag_023, STBVOX_FT_force, STBVOX_FT_none, STBVOX_FT_solid }, { STBVOX_FT_diag_012, STBVOX_FT_solid, STBVOX_FT_diag_013, STBVOX_FT_force, STBVOX_FT_solid, STBVOX_FT_none }, { STBVOX_FT_force, STBVOX_FT_force, STBVOX_FT_force, STBVOX_FT_force, 0,0 }, // crossed pair { STBVOX_FT_force, STBVOX_FT_force, STBVOX_FT_force, STBVOX_FT_force, STBVOX_FT_force, STBVOX_FT_force }, // GEOM_force { STBVOX_FT_partial,STBVOX_FT_partial,STBVOX_FT_partial,STBVOX_FT_partial, STBVOX_FT_force, STBVOX_FT_solid }, // floor vheight, all neighbors forced { STBVOX_FT_partial,STBVOX_FT_partial,STBVOX_FT_partial,STBVOX_FT_partial, STBVOX_FT_force, STBVOX_FT_solid }, // floor vheight, all neighbors forced { STBVOX_FT_partial,STBVOX_FT_partial,STBVOX_FT_partial,STBVOX_FT_partial, STBVOX_FT_solid, STBVOX_FT_force }, // ceil vheight, all neighbors forced { STBVOX_FT_partial,STBVOX_FT_partial,STBVOX_FT_partial,STBVOX_FT_partial, STBVOX_FT_solid, STBVOX_FT_force }, // ceil vheight, all neighbors forced }; // This table indicates what normal to use for the "up" face of a sloped geom // @TODO this could be done with math given the current arrangement of the enum, but let's not require it static unsigned char stbvox_floor_slope_for_rot[4] = { STBVF_su, STBVF_wu, // @TODO: why is this reversed from what it should be? this is a north-is-up face, so slope should be south&up STBVF_nu, STBVF_eu, }; static unsigned char stbvox_ceil_slope_for_rot[4] = { STBVF_sd, STBVF_ed, STBVF_nd, STBVF_wd, }; // this table indicates whether, for each pair of types above, a face is visible. // each value indicates whether a given type is visible for all neighbor types static unsigned short stbvox_face_visible[STBVOX_FT_count] = { // we encode the table by listing which cases cause *obscuration*, and bitwise inverting that // table is pre-shifted by 5 to save a shift when it's accessed (unsigned short) ((~0x07ff )<<5), // none is completely obscured by everything (unsigned short) ((~((1<output_cur[mesh][0]; int step = mm->output_step[mesh][0]; // allocate a new quad from the mesh vertices[0] = (stbvox_mesh_vertex *) p; p += step; vertices[1] = (stbvox_mesh_vertex *) p; p += step; vertices[2] = (stbvox_mesh_vertex *) p; p += step; vertices[3] = (stbvox_mesh_vertex *) p; p += step; mm->output_cur[mesh][0] = p; // output the face #ifdef STBVOX_ICONFIG_FACE_ATTRIBUTE // write face as interleaved vertex data *(stbvox_mesh_face *) (vertices[0]+1) = face; *(stbvox_mesh_face *) (vertices[1]+1) = face; *(stbvox_mesh_face *) (vertices[2]+1) = face; *(stbvox_mesh_face *) (vertices[3]+1) = face; #else *(stbvox_mesh_face *) mm->output_cur[mesh][1] = face; mm->output_cur[mesh][1] += 4; #endif } void stbvox_make_mesh_for_face(stbvox_mesh_maker *mm, stbvox_rotate rot, int face, int v_off, stbvox_pos pos, stbvox_mesh_vertex vertbase, stbvox_mesh_vertex *face_coord, unsigned char mesh, int normal) { stbvox_mesh_face face_data = stbvox_compute_mesh_face_value(mm,rot,face,v_off, normal); // still need to compute ao & texlerp for each vertex // first compute texlerp into p1 stbvox_mesh_vertex p1[4] = { 0 }; #if defined(STBVOX_CONFIG_DOWN_TEXLERP_PACKED) && defined(STBVOX_CONFIG_UP_TEXLERP_PACKED) #define STBVOX_USE_PACKED(f) ((f) == STBVOX_FACE_up || (f) == STBVOX_FACE_down) #elif defined(STBVOX_CONFIG_UP_TEXLERP_PACKED) #define STBVOX_USE_PACKED(f) ((f) == STBVOX_FACE_up ) #elif defined(STBVOX_CONFIG_DOWN_TEXLERP_PACKED) #define STBVOX_USE_PACKED(f) ( (f) == STBVOX_FACE_down) #endif #if defined(STBVOX_CONFIG_DOWN_TEXLERP_PACKED) || defined(STBVOX_CONFIG_UP_TEXLERP_PACKED) if (STBVOX_USE_PACKED(face)) { if (!mm->input.packed_compact || 0==(mm->input.packed_compact[v_off]&16)) goto set_default; p1[0] = (mm->input.packed_compact[v_off + mm->cube_vertex_offset[face][0]] >> 5); p1[1] = (mm->input.packed_compact[v_off + mm->cube_vertex_offset[face][1]] >> 5); p1[2] = (mm->input.packed_compact[v_off + mm->cube_vertex_offset[face][2]] >> 5); p1[3] = (mm->input.packed_compact[v_off + mm->cube_vertex_offset[face][3]] >> 5); p1[0] = stbvox_vertex_encode(0,0,0,0,p1[0]); p1[1] = stbvox_vertex_encode(0,0,0,0,p1[1]); p1[2] = stbvox_vertex_encode(0,0,0,0,p1[2]); p1[3] = stbvox_vertex_encode(0,0,0,0,p1[3]); goto skip; } #endif if (mm->input.block_texlerp) { stbvox_block_type bt = mm->input.blocktype[v_off]; unsigned char val = mm->input.block_texlerp[bt]; p1[0] = p1[1] = p1[2] = p1[3] = stbvox_vertex_encode(0,0,0,0,val); } else if (mm->input.block_texlerp_face) { stbvox_block_type bt = mm->input.blocktype[v_off]; unsigned char bt_face = STBVOX_ROTATE(face, rot.block); unsigned char val = mm->input.block_texlerp_face[bt][bt_face]; p1[0] = p1[1] = p1[2] = p1[3] = stbvox_vertex_encode(0,0,0,0,val); } else if (mm->input.texlerp_face3) { unsigned char val = (mm->input.texlerp_face3[v_off] >> stbvox_face3_lerp[face]) & 7; if (face >= STBVOX_FACE_up) val = stbvox_face3_updown[val]; p1[0] = p1[1] = p1[2] = p1[3] = stbvox_vertex_encode(0,0,0,0,val); } else if (mm->input.texlerp_simple) { unsigned char val = mm->input.texlerp_simple[v_off]; unsigned char lerp_face = (val >> 2) & 7; if (lerp_face == face) { p1[0] = (mm->input.texlerp_simple[v_off + mm->cube_vertex_offset[face][0]] >> 5) & 7; p1[1] = (mm->input.texlerp_simple[v_off + mm->cube_vertex_offset[face][1]] >> 5) & 7; p1[2] = (mm->input.texlerp_simple[v_off + mm->cube_vertex_offset[face][2]] >> 5) & 7; p1[3] = (mm->input.texlerp_simple[v_off + mm->cube_vertex_offset[face][3]] >> 5) & 7; p1[0] = stbvox_vertex_encode(0,0,0,0,p1[0]); p1[1] = stbvox_vertex_encode(0,0,0,0,p1[1]); p1[2] = stbvox_vertex_encode(0,0,0,0,p1[2]); p1[3] = stbvox_vertex_encode(0,0,0,0,p1[3]); } else { unsigned char base = stbvox_vert_lerp_for_simple[val&3]; p1[0] = p1[1] = p1[2] = p1[3] = stbvox_vertex_encode(0,0,0,0,base); } } else if (mm->input.texlerp) { unsigned char facelerp = (mm->input.texlerp[v_off] >> stbvox_face_lerp[face]) & 3; if (facelerp == STBVOX_TEXLERP_FACE_use_vert) { if (mm->input.texlerp_vert3 && face != STBVOX_FACE_down) { unsigned char shift = stbvox_vert3_lerp[face]; p1[0] = (mm->input.texlerp_vert3[mm->cube_vertex_offset[face][0]] >> shift) & 7; p1[1] = (mm->input.texlerp_vert3[mm->cube_vertex_offset[face][1]] >> shift) & 7; p1[2] = (mm->input.texlerp_vert3[mm->cube_vertex_offset[face][2]] >> shift) & 7; p1[3] = (mm->input.texlerp_vert3[mm->cube_vertex_offset[face][3]] >> shift) & 7; } else { p1[0] = stbvox_vert_lerp_for_simple[mm->input.texlerp[mm->cube_vertex_offset[face][0]]>>6]; p1[1] = stbvox_vert_lerp_for_simple[mm->input.texlerp[mm->cube_vertex_offset[face][1]]>>6]; p1[2] = stbvox_vert_lerp_for_simple[mm->input.texlerp[mm->cube_vertex_offset[face][2]]>>6]; p1[3] = stbvox_vert_lerp_for_simple[mm->input.texlerp[mm->cube_vertex_offset[face][3]]>>6]; } p1[0] = stbvox_vertex_encode(0,0,0,0,p1[0]); p1[1] = stbvox_vertex_encode(0,0,0,0,p1[1]); p1[2] = stbvox_vertex_encode(0,0,0,0,p1[2]); p1[3] = stbvox_vertex_encode(0,0,0,0,p1[3]); } else { p1[0] = p1[1] = p1[2] = p1[3] = stbvox_vertex_encode(0,0,0,0,stbvox_vert_lerp_for_face_lerp[facelerp]); } } else { #if defined(STBVOX_CONFIG_UP_TEXLERP_PACKED) || defined(STBVOX_CONFIG_DOWN_TEXLERP_PACKED) set_default: #endif p1[0] = p1[1] = p1[2] = p1[3] = stbvox_vertex_encode(0,0,0,0,7); // @TODO make this configurable } #if defined(STBVOX_CONFIG_UP_TEXLERP_PACKED) || defined(STBVOX_CONFIG_DOWN_TEXLERP_PACKED) skip: #endif // now compute lighting and store to vertices { stbvox_mesh_vertex *mv[4]; stbvox_get_quad_vertex_pointer(mm, mesh, mv, face_data); if (mm->input.lighting) { // @TODO: lighting at block centers, but not gathered, instead constant-per-face if (mm->input.lighting_at_vertices) { int i; for (i=0; i < 4; ++i) { *mv[i] = vertbase + face_coord[i] + stbvox_vertex_encode(0,0,0,mm->input.lighting[v_off + mm->cube_vertex_offset[face][i]] & 63,0) + p1[i]; } } else { unsigned char *amb = &mm->input.lighting[v_off]; int i,j; #if defined(STBVOX_CONFIG_ROTATION_IN_LIGHTING) || defined(STBVOX_CONFIG_VHEIGHT_IN_LIGHTING) #define STBVOX_GET_LIGHTING(light) ((light) & ~3) #define STBVOX_LIGHTING_ROUNDOFF 8 #else #define STBVOX_GET_LIGHTING(light) (light) #define STBVOX_LIGHTING_ROUNDOFF 2 #endif for (i=0; i < 4; ++i) { // for each vertex, gather from the four neighbor blocks it's facing unsigned char *vamb = &amb[mm->cube_vertex_offset[face][i]]; int total=0; for (j=0; j < 4; ++j) total += STBVOX_GET_LIGHTING(vamb[mm->vertex_gather_offset[face][j]]); *mv[i] = vertbase + face_coord[i] + stbvox_vertex_encode(0,0,0,(total+STBVOX_LIGHTING_ROUNDOFF)>>4,0) + p1[i]; // >> 4 is because: // >> 2 to divide by 4 to get average over 4 samples // >> 2 because input is 8 bits, output is 6 bits } // @TODO: note that gathering baked *lighting* // is different from gathering baked ao; baked ao can count // solid blocks as 0 ao, but baked lighting wants average // of non-blocked--not take average & treat blocked as 0. And // we can't bake the right value into the solid blocks // because they can have different lighting values on // different sides. So we need to actually gather and // then divide by 0..4 (which we can do with a table-driven // multiply, or have an 'if' for the 3 case) } } else { vertbase += stbvox_vertex_encode(0,0,0,63,0); *mv[0] = vertbase + face_coord[0] + p1[0]; *mv[1] = vertbase + face_coord[1] + p1[1]; *mv[2] = vertbase + face_coord[2] + p1[2]; *mv[3] = vertbase + face_coord[3] + p1[3]; } } } // get opposite-facing normal & texgen for opposite face, used to map up-facing vheight data to down-facing data static unsigned char stbvox_reverse_face[STBVF_count] = { STBVF_w, STBVF_s, STBVF_e, STBVF_n, STBVF_d , STBVF_u , STBVF_wd, STBVF_wu, 0, 0, 0, 0, STBVF_sw_d, STBVF_sw_u, STBVF_sd, STBVF_su, 0, 0, 0, 0, STBVF_se_d, STBVF_se_u, STBVF_ed, STBVF_eu, 0, 0, 0, 0, STBVF_ne_d, STBVF_ne_d, STBVF_nd, STBVF_nu }; #ifndef STBVOX_CONFIG_OPTIMIZED_VHEIGHT // render non-planar quads by splitting into two triangles, rendering each as a degenerate quad static void stbvox_make_12_split_mesh_for_face(stbvox_mesh_maker *mm, stbvox_rotate rot, int face, int v_off, stbvox_pos pos, stbvox_mesh_vertex vertbase, stbvox_mesh_vertex *face_coord, unsigned char mesh, unsigned char *ht) { stbvox_mesh_vertex v[4]; unsigned char normal1 = stbvox_face_up_normal_012[ht[2]][ht[1]][ht[0]]; unsigned char normal2 = stbvox_face_up_normal_123[ht[3]][ht[2]][ht[1]]; if (face == STBVOX_FACE_down) { normal1 = stbvox_reverse_face[normal1]; normal2 = stbvox_reverse_face[normal2]; } // the floor side face_coord is stored in order NW,NE,SE,SW, but ht[] is stored SW,SE,NW,NE v[0] = face_coord[2]; v[1] = face_coord[3]; v[2] = face_coord[0]; v[3] = face_coord[2]; stbvox_make_mesh_for_face(mm, rot, face, v_off, pos, vertbase, v, mesh, normal1); v[1] = face_coord[0]; v[2] = face_coord[1]; stbvox_make_mesh_for_face(mm, rot, face, v_off, pos, vertbase, v, mesh, normal2); } static void stbvox_make_03_split_mesh_for_face(stbvox_mesh_maker *mm, stbvox_rotate rot, int face, int v_off, stbvox_pos pos, stbvox_mesh_vertex vertbase, stbvox_mesh_vertex *face_coord, unsigned char mesh, unsigned char *ht) { stbvox_mesh_vertex v[4]; unsigned char normal1 = stbvox_face_up_normal_013[ht[3]][ht[1]][ht[0]]; unsigned char normal2 = stbvox_face_up_normal_023[ht[3]][ht[2]][ht[0]]; if (face == STBVOX_FACE_down) { normal1 = stbvox_reverse_face[normal1]; normal2 = stbvox_reverse_face[normal2]; } v[0] = face_coord[1]; v[1] = face_coord[2]; v[2] = face_coord[3]; v[3] = face_coord[1]; stbvox_make_mesh_for_face(mm, rot, face, v_off, pos, vertbase, v, mesh, normal1); v[1] = face_coord[3]; v[2] = face_coord[0]; stbvox_make_mesh_for_face(mm, rot, face, v_off, pos, vertbase, v, mesh, normal2); // this one is correct! } #endif #ifndef STBVOX_CONFIG_PRECISION_Z #define STBVOX_CONFIG_PRECISION_Z 1 #endif // simple case for mesh generation: we have only solid and empty blocks static void stbvox_make_mesh_for_block(stbvox_mesh_maker *mm, stbvox_pos pos, int v_off, stbvox_mesh_vertex *vmesh) { int ns_off = mm->y_stride_in_bytes; int ew_off = mm->x_stride_in_bytes; unsigned char *blockptr = &mm->input.blocktype[v_off]; stbvox_mesh_vertex basevert = stbvox_vertex_encode(pos.x, pos.y, pos.z << STBVOX_CONFIG_PRECISION_Z , 0,0); stbvox_rotate rot = { 0,0,0,0 }; unsigned char simple_rot = 0; unsigned char mesh = mm->default_mesh; if (mm->input.selector) mesh = mm->input.selector[v_off]; else if (mm->input.block_selector) mesh = mm->input.block_selector[mm->input.blocktype[v_off]]; // check if we're going off the end if (mm->output_cur[mesh][0] + mm->output_size[mesh][0]*6 > mm->output_end[mesh][0]) { mm->full = 1; return; } #ifdef STBVOX_CONFIG_ROTATION_IN_LIGHTING simple_rot = mm->input.lighting[v_off] & 3; #endif if (mm->input.packed_compact) simple_rot = mm->input.packed_compact[v_off] & 3; if (blockptr[ 1]==0) { rot.facerot = simple_rot; stbvox_make_mesh_for_face(mm, rot, STBVOX_FACE_up , v_off, pos, basevert, vmesh+4*STBVOX_FACE_up, mesh, STBVOX_FACE_up); } if (blockptr[-1]==0) { rot.facerot = (-simple_rot) & 3; stbvox_make_mesh_for_face(mm, rot, STBVOX_FACE_down, v_off, pos, basevert, vmesh+4*STBVOX_FACE_down, mesh, STBVOX_FACE_down); } if (mm->input.rotate) { unsigned char val = mm->input.rotate[v_off]; rot.block = (val >> 0) & 3; rot.overlay = (val >> 2) & 3; //rot.tex2 = (val >> 4) & 3; rot.ecolor = (val >> 6) & 3; } else { rot.block = rot.overlay = rot.ecolor = simple_rot; } rot.facerot = 0; if (blockptr[ ns_off]==0) stbvox_make_mesh_for_face(mm, rot, STBVOX_FACE_north, v_off, pos, basevert, vmesh+4*STBVOX_FACE_north, mesh, STBVOX_FACE_north); if (blockptr[-ns_off]==0) stbvox_make_mesh_for_face(mm, rot, STBVOX_FACE_south, v_off, pos, basevert, vmesh+4*STBVOX_FACE_south, mesh, STBVOX_FACE_south); if (blockptr[ ew_off]==0) stbvox_make_mesh_for_face(mm, rot, STBVOX_FACE_east , v_off, pos, basevert, vmesh+4*STBVOX_FACE_east, mesh, STBVOX_FACE_east); if (blockptr[-ew_off]==0) stbvox_make_mesh_for_face(mm, rot, STBVOX_FACE_west , v_off, pos, basevert, vmesh+4*STBVOX_FACE_west, mesh, STBVOX_FACE_west); } // complex case for mesh generation: we have lots of different // block types, and we don't want to generate faces of blocks // if they're hidden by neighbors. // // we use lots of tables to determine this: we have a table // which tells us what face type is generated for each type of // geometry, and then a table that tells us whether that type // is hidden by a neighbor. static void stbvox_make_mesh_for_block_with_geo(stbvox_mesh_maker *mm, stbvox_pos pos, int v_off) { int ns_off = mm->y_stride_in_bytes; int ew_off = mm->x_stride_in_bytes; int visible_faces, visible_base; unsigned char mesh; // first gather the geometry info for this block and all neighbors unsigned char bt, nbt[6]; unsigned char geo, ngeo[6]; unsigned char rot, nrot[6]; bt = mm->input.blocktype[v_off]; nbt[0] = mm->input.blocktype[v_off + ew_off]; nbt[1] = mm->input.blocktype[v_off + ns_off]; nbt[2] = mm->input.blocktype[v_off - ew_off]; nbt[3] = mm->input.blocktype[v_off - ns_off]; nbt[4] = mm->input.blocktype[v_off + 1]; nbt[5] = mm->input.blocktype[v_off - 1]; if (mm->input.geometry) { int i; geo = mm->input.geometry[v_off]; ngeo[0] = mm->input.geometry[v_off + ew_off]; ngeo[1] = mm->input.geometry[v_off + ns_off]; ngeo[2] = mm->input.geometry[v_off - ew_off]; ngeo[3] = mm->input.geometry[v_off - ns_off]; ngeo[4] = mm->input.geometry[v_off + 1]; ngeo[5] = mm->input.geometry[v_off - 1]; rot = (geo >> 4) & 3; geo &= 15; for (i=0; i < 6; ++i) { nrot[i] = (ngeo[i] >> 4) & 3; ngeo[i] &= 15; } } else { int i; assert(mm->input.block_geometry); geo = mm->input.block_geometry[bt]; for (i=0; i < 6; ++i) ngeo[i] = mm->input.block_geometry[nbt[i]]; if (mm->input.selector) { #ifndef STBVOX_CONFIG_ROTATION_IN_LIGHTING if (mm->input.packed_compact == NULL) { rot = (mm->input.selector[v_off ] >> 4) & 3; nrot[0] = (mm->input.selector[v_off + ew_off] >> 4) & 3; nrot[1] = (mm->input.selector[v_off + ns_off] >> 4) & 3; nrot[2] = (mm->input.selector[v_off - ew_off] >> 4) & 3; nrot[3] = (mm->input.selector[v_off - ns_off] >> 4) & 3; nrot[4] = (mm->input.selector[v_off + 1] >> 4) & 3; nrot[5] = (mm->input.selector[v_off - 1] >> 4) & 3; } #endif } else { #ifndef STBVOX_CONFIG_ROTATION_IN_LIGHTING if (mm->input.packed_compact == NULL) { rot = (geo>>4)&3; geo &= 15; for (i=0; i < 6; ++i) { nrot[i] = (ngeo[i]>>4)&3; ngeo[i] &= 15; } } #endif } } #ifndef STBVOX_CONFIG_ROTATION_IN_LIGHTING if (mm->input.packed_compact) { rot = mm->input.packed_compact[rot] & 3; nrot[0] = mm->input.packed_compact[v_off + ew_off] & 3; nrot[1] = mm->input.packed_compact[v_off + ns_off] & 3; nrot[2] = mm->input.packed_compact[v_off - ew_off] & 3; nrot[3] = mm->input.packed_compact[v_off - ns_off] & 3; nrot[4] = mm->input.packed_compact[v_off + 1] & 3; nrot[5] = mm->input.packed_compact[v_off - 1] & 3; } #else rot = mm->input.lighting[v_off] & 3; nrot[0] = (mm->input.lighting[v_off + ew_off]) & 3; nrot[1] = (mm->input.lighting[v_off + ns_off]) & 3; nrot[2] = (mm->input.lighting[v_off - ew_off]) & 3; nrot[3] = (mm->input.lighting[v_off - ns_off]) & 3; nrot[4] = (mm->input.lighting[v_off + 1]) & 3; nrot[5] = (mm->input.lighting[v_off - 1]) & 3; #endif if (geo == STBVOX_GEOM_transp) { // transparency has a special rule: if the blocktype is the same, // and the faces are compatible, then can hide them; otherwise, // force them on // Note that this means we don't support any transparentshapes other // than solid blocks, since detecting them is too complicated. If // you wanted to do something like minecraft water, you probably // should just do that with a separate renderer anyway. (We don't // support transparency sorting so you need to use alpha test // anyway) int i; for (i=0; i < 6; ++i) if (nbt[i] != bt) { nbt[i] = 0; ngeo[i] = STBVOX_GEOM_empty; } else ngeo[i] = STBVOX_GEOM_solid; geo = STBVOX_GEOM_solid; } // now compute the face visibility visible_base = stbvox_hasface[geo][rot]; // @TODO: assert(visible_base != 0); // we should have early-outted earlier in this case visible_faces = 0; // now, for every face that might be visible, check if neighbor hides it if (visible_base & (1 << STBVOX_FACE_east)) { int type = stbvox_facetype[ geo ][(STBVOX_FACE_east+ rot )&3]; int ntype = stbvox_facetype[ngeo[0]][(STBVOX_FACE_west+nrot[0])&3]; visible_faces |= ((stbvox_face_visible[type]) >> (ntype + 5 - STBVOX_FACE_east)) & (1 << STBVOX_FACE_east); } if (visible_base & (1 << STBVOX_FACE_north)) { int type = stbvox_facetype[ geo ][(STBVOX_FACE_north+ rot )&3]; int ntype = stbvox_facetype[ngeo[1]][(STBVOX_FACE_south+nrot[1])&3]; visible_faces |= ((stbvox_face_visible[type]) >> (ntype + 5 - STBVOX_FACE_north)) & (1 << STBVOX_FACE_north); } if (visible_base & (1 << STBVOX_FACE_west)) { int type = stbvox_facetype[ geo ][(STBVOX_FACE_west+ rot )&3]; int ntype = stbvox_facetype[ngeo[2]][(STBVOX_FACE_east+nrot[2])&3]; visible_faces |= ((stbvox_face_visible[type]) >> (ntype + 5 - STBVOX_FACE_west)) & (1 << STBVOX_FACE_west); } if (visible_base & (1 << STBVOX_FACE_south)) { int type = stbvox_facetype[ geo ][(STBVOX_FACE_south+ rot )&3]; int ntype = stbvox_facetype[ngeo[3]][(STBVOX_FACE_north+nrot[3])&3]; visible_faces |= ((stbvox_face_visible[type]) >> (ntype + 5 - STBVOX_FACE_south)) & (1 << STBVOX_FACE_south); } if (visible_base & (1 << STBVOX_FACE_up)) { int type = stbvox_facetype[ geo ][STBVOX_FACE_up]; int ntype = stbvox_facetype[ngeo[4]][STBVOX_FACE_down]; visible_faces |= ((stbvox_face_visible[type]) >> (ntype + 5 - STBVOX_FACE_up)) & (1 << STBVOX_FACE_up); } if (visible_base & (1 << STBVOX_FACE_down)) { int type = stbvox_facetype[ geo ][STBVOX_FACE_down]; int ntype = stbvox_facetype[ngeo[5]][STBVOX_FACE_up]; visible_faces |= ((stbvox_face_visible[type]) >> (ntype + 5 - STBVOX_FACE_down)) & (1 << STBVOX_FACE_down); } if (geo == STBVOX_GEOM_force) geo = STBVOX_GEOM_solid; assert((geo == STBVOX_GEOM_crossed_pair) ? (visible_faces == 15) : 1); // now we finally know for sure which faces are getting generated if (visible_faces == 0) return; mesh = mm->default_mesh; if (mm->input.selector) mesh = mm->input.selector[v_off]; else if (mm->input.block_selector) mesh = mm->input.block_selector[bt]; if (geo <= STBVOX_GEOM_ceil_slope_north_is_bottom) { // this is the simple case, we can just use regular block gen with special vmesh calculated with vheight stbvox_mesh_vertex basevert; stbvox_mesh_vertex vmesh[6][4]; stbvox_rotate rotate = { 0,0,0,0 }; unsigned char simple_rot = rot; int i; // we only need to do this for the displayed faces, but it's easier // to just do it up front; @OPTIMIZE check if it's faster to do it // for visible faces only for (i=0; i < 6*4; ++i) { int vert = stbvox_vertex_selector[0][i]; vert = stbvox_rotate_vertex[vert][rot]; vmesh[0][i] = stbvox_vmesh_pre_vheight[0][i] + stbvox_geometry_vheight[geo][vert]; } basevert = stbvox_vertex_encode(pos.x, pos.y, pos.z << STBVOX_CONFIG_PRECISION_Z, 0,0); if (mm->input.selector) { mesh = mm->input.selector[v_off]; } else if (mm->input.block_selector) mesh = mm->input.block_selector[bt]; // check if we're going off the end if (mm->output_cur[mesh][0] + mm->output_size[mesh][0]*6 > mm->output_end[mesh][0]) { mm->full = 1; return; } if (geo >= STBVOX_GEOM_floor_slope_north_is_top) { if (visible_faces & (1 << STBVOX_FACE_up)) { int normal = geo == STBVOX_GEOM_floor_slope_north_is_top ? stbvox_floor_slope_for_rot[simple_rot] : STBVOX_FACE_up; rotate.facerot = simple_rot; stbvox_make_mesh_for_face(mm, rotate, STBVOX_FACE_up , v_off, pos, basevert, vmesh[STBVOX_FACE_up], mesh, normal); } if (visible_faces & (1 << STBVOX_FACE_down)) { int normal = geo == STBVOX_GEOM_ceil_slope_north_is_bottom ? stbvox_ceil_slope_for_rot[simple_rot] : STBVOX_FACE_down; rotate.facerot = (-rotate.facerot) & 3; stbvox_make_mesh_for_face(mm, rotate, STBVOX_FACE_down, v_off, pos, basevert, vmesh[STBVOX_FACE_down], mesh, normal); } } else { if (visible_faces & (1 << STBVOX_FACE_up)) { rotate.facerot = simple_rot; stbvox_make_mesh_for_face(mm, rotate, STBVOX_FACE_up , v_off, pos, basevert, vmesh[STBVOX_FACE_up], mesh, STBVOX_FACE_up); } if (visible_faces & (1 << STBVOX_FACE_down)) { rotate.facerot = (-rotate.facerot) & 3; stbvox_make_mesh_for_face(mm, rotate, STBVOX_FACE_down, v_off, pos, basevert, vmesh[STBVOX_FACE_down], mesh, STBVOX_FACE_down); } } if (mm->input.rotate) { unsigned char val = mm->input.rotate[v_off]; rotate.block = (val >> 0) & 3; rotate.overlay = (val >> 2) & 3; //rotate.tex2 = (val >> 4) & 3; rotate.ecolor = (val >> 6) & 3; } else { rotate.block = rotate.overlay = rotate.ecolor = simple_rot; } rotate.facerot = 0; if (visible_faces & (1 << STBVOX_FACE_north)) stbvox_make_mesh_for_face(mm, rotate, STBVOX_FACE_north, v_off, pos, basevert, vmesh[STBVOX_FACE_north], mesh, STBVOX_FACE_north); if (visible_faces & (1 << STBVOX_FACE_south)) stbvox_make_mesh_for_face(mm, rotate, STBVOX_FACE_south, v_off, pos, basevert, vmesh[STBVOX_FACE_south], mesh, STBVOX_FACE_south); if (visible_faces & (1 << STBVOX_FACE_east)) stbvox_make_mesh_for_face(mm, rotate, STBVOX_FACE_east , v_off, pos, basevert, vmesh[STBVOX_FACE_east ], mesh, STBVOX_FACE_east); if (visible_faces & (1 << STBVOX_FACE_west)) stbvox_make_mesh_for_face(mm, rotate, STBVOX_FACE_west , v_off, pos, basevert, vmesh[STBVOX_FACE_west ], mesh, STBVOX_FACE_west); } if (geo >= STBVOX_GEOM_floor_vheight_03) { // this case can also be generated with regular block gen with special vmesh, // except: // if we want to generate middle diagonal for 'weird' blocks // it's more complicated to detect neighbor matchups stbvox_mesh_vertex vmesh[6][4]; stbvox_mesh_vertex cube[8]; stbvox_mesh_vertex basevert; stbvox_rotate rotate = { 0,0,0,0 }; unsigned char simple_rot = rot; unsigned char ht[4]; int extreme; // extract the heights #ifdef STBVOX_CONFIG_VHEIGHT_IN_LIGHTING ht[0] = mm->input.lighting[v_off ] & 3; ht[1] = mm->input.lighting[v_off+ew_off ] & 3; ht[2] = mm->input.lighting[v_off +ns_off] & 3; ht[3] = mm->input.lighting[v_off+ew_off+ns_off] & 3; #else if (mm->input.vheight) { unsigned char v = mm->input.vheight[v_off]; ht[0] = (v >> 0) & 3; ht[1] = (v >> 2) & 3; ht[2] = (v >> 4) & 3; ht[3] = (v >> 6) & 3; } else if (mm->input.block_vheight) { unsigned char v = mm->input.block_vheight[bt]; unsigned char raw[4]; int i; raw[0] = (v >> 0) & 3; raw[1] = (v >> 2) & 3; raw[2] = (v >> 4) & 3; raw[3] = (v >> 6) & 3; for (i=0; i < 4; ++i) ht[i] = raw[stbvox_rotate_vertex[i][rot]]; } else if (mm->input.packed_compact) { ht[0] = (mm->input.packed_compact[v_off ] >> 2) & 3; ht[1] = (mm->input.packed_compact[v_off+ew_off ] >> 2) & 3; ht[2] = (mm->input.packed_compact[v_off +ns_off] >> 2) & 3; ht[3] = (mm->input.packed_compact[v_off+ew_off+ns_off] >> 2) & 3; } else if (mm->input.geometry) { ht[0] = mm->input.geometry[v_off ] >> 6; ht[1] = mm->input.geometry[v_off+ew_off ] >> 6; ht[2] = mm->input.geometry[v_off +ns_off] >> 6; ht[3] = mm->input.geometry[v_off+ew_off+ns_off] >> 6; } else { assert(0); } #endif // flag whether any sides go off the top of the block, which means // our visible_faces test was wrong extreme = (ht[0] == 3 || ht[1] == 3 || ht[2] == 3 || ht[3] == 3); if (geo >= STBVOX_GEOM_ceil_vheight_03) { cube[0] = stbvox_vertex_encode(0,0,ht[0],0,0); cube[1] = stbvox_vertex_encode(0,0,ht[1],0,0); cube[2] = stbvox_vertex_encode(0,0,ht[2],0,0); cube[3] = stbvox_vertex_encode(0,0,ht[3],0,0); cube[4] = stbvox_vertex_encode(0,0,2,0,0); cube[5] = stbvox_vertex_encode(0,0,2,0,0); cube[6] = stbvox_vertex_encode(0,0,2,0,0); cube[7] = stbvox_vertex_encode(0,0,2,0,0); } else { cube[0] = stbvox_vertex_encode(0,0,0,0,0); cube[1] = stbvox_vertex_encode(0,0,0,0,0); cube[2] = stbvox_vertex_encode(0,0,0,0,0); cube[3] = stbvox_vertex_encode(0,0,0,0,0); cube[4] = stbvox_vertex_encode(0,0,ht[0],0,0); cube[5] = stbvox_vertex_encode(0,0,ht[1],0,0); cube[6] = stbvox_vertex_encode(0,0,ht[2],0,0); cube[7] = stbvox_vertex_encode(0,0,ht[3],0,0); } if (!mm->input.vheight && mm->input.block_vheight) { // @TODO: support block vheight here, I've forgotten what needs to be done specially } // build vertex mesh { int i; for (i=0; i < 6*4; ++i) { int vert = stbvox_vertex_selector[0][i]; vmesh[0][i] = stbvox_vmesh_pre_vheight[0][i] + cube[vert]; } } basevert = stbvox_vertex_encode(pos.x, pos.y, pos.z << STBVOX_CONFIG_PRECISION_Z, 0,0); // check if we're going off the end if (mm->output_cur[mesh][0] + mm->output_size[mesh][0]*6 > mm->output_end[mesh][0]) { mm->full = 1; return; } // @TODO generate split faces if (visible_faces & (1 << STBVOX_FACE_up)) { if (geo >= STBVOX_GEOM_ceil_vheight_03) // flat stbvox_make_mesh_for_face(mm, rotate, STBVOX_FACE_up , v_off, pos, basevert, vmesh[STBVOX_FACE_up], mesh, STBVOX_FACE_up); else { #ifndef STBVOX_CONFIG_OPTIMIZED_VHEIGHT // check if it's non-planar if (cube[5] + cube[6] != cube[4] + cube[7]) { // not planar, split along diagonal and make degenerate quads if (geo == STBVOX_GEOM_floor_vheight_03) stbvox_make_03_split_mesh_for_face(mm, rotate, STBVOX_FACE_up, v_off, pos, basevert, vmesh[STBVOX_FACE_up], mesh, ht); else stbvox_make_12_split_mesh_for_face(mm, rotate, STBVOX_FACE_up, v_off, pos, basevert, vmesh[STBVOX_FACE_up], mesh, ht); } else stbvox_make_mesh_for_face(mm, rotate, STBVOX_FACE_up , v_off, pos, basevert, vmesh[STBVOX_FACE_up], mesh, stbvox_planar_face_up_normal[ht[2]][ht[1]][ht[0]]); #else stbvox_make_mesh_for_face(mm, rotate, STBVOX_FACE_up , v_off, pos, basevert, vmesh[STBVOX_FACE_up], mesh, stbvox_optimized_face_up_normal[ht[3]][ht[2]][ht[1]][ht[0]]); #endif } } if (visible_faces & (1 << STBVOX_FACE_down)) { if (geo < STBVOX_GEOM_ceil_vheight_03) // flat stbvox_make_mesh_for_face(mm, rotate, STBVOX_FACE_down, v_off, pos, basevert, vmesh[STBVOX_FACE_down], mesh, STBVOX_FACE_down); else { #ifndef STBVOX_CONFIG_OPTIMIZED_VHEIGHT // check if it's non-planar if (cube[1] + cube[2] != cube[0] + cube[3]) { // not planar, split along diagonal and make degenerate quads if (geo == STBVOX_GEOM_ceil_vheight_03) stbvox_make_03_split_mesh_for_face(mm, rotate, STBVOX_FACE_down, v_off, pos, basevert, vmesh[STBVOX_FACE_down], mesh, ht); else stbvox_make_12_split_mesh_for_face(mm, rotate, STBVOX_FACE_down, v_off, pos, basevert, vmesh[STBVOX_FACE_down], mesh, ht); } else stbvox_make_mesh_for_face(mm, rotate, STBVOX_FACE_down, v_off, pos, basevert, vmesh[STBVOX_FACE_down], mesh, stbvox_reverse_face[stbvox_planar_face_up_normal[ht[2]][ht[1]][ht[0]]]); #else stbvox_make_mesh_for_face(mm, rotate, STBVOX_FACE_down, v_off, pos, basevert, vmesh[STBVOX_FACE_down], mesh, stbvox_reverse_face[stbvox_optimized_face_up_normal[ht[3]][ht[2]][ht[1]][ht[0]]]); #endif } } if (mm->input.rotate) { unsigned char val = mm->input.rotate[v_off]; rotate.block = (val >> 0) & 3; rotate.overlay = (val >> 2) & 3; //rotate.tex2 = (val >> 4) & 3; rotate.ecolor = (val >> 6) & 3; } else if (mm->input.selector) { rotate.block = rotate.overlay = rotate.ecolor = simple_rot; } if ((visible_faces & (1 << STBVOX_FACE_north)) || (extreme && (ht[2] == 3 || ht[3] == 3))) stbvox_make_mesh_for_face(mm, rotate, STBVOX_FACE_north, v_off, pos, basevert, vmesh[STBVOX_FACE_north], mesh, STBVOX_FACE_north); if ((visible_faces & (1 << STBVOX_FACE_south)) || (extreme && (ht[0] == 3 || ht[1] == 3))) stbvox_make_mesh_for_face(mm, rotate, STBVOX_FACE_south, v_off, pos, basevert, vmesh[STBVOX_FACE_south], mesh, STBVOX_FACE_south); if ((visible_faces & (1 << STBVOX_FACE_east)) || (extreme && (ht[1] == 3 || ht[3] == 3))) stbvox_make_mesh_for_face(mm, rotate, STBVOX_FACE_east , v_off, pos, basevert, vmesh[STBVOX_FACE_east ], mesh, STBVOX_FACE_east); if ((visible_faces & (1 << STBVOX_FACE_west)) || (extreme && (ht[0] == 3 || ht[2] == 3))) stbvox_make_mesh_for_face(mm, rotate, STBVOX_FACE_west , v_off, pos, basevert, vmesh[STBVOX_FACE_west ], mesh, STBVOX_FACE_west); } if (geo == STBVOX_GEOM_crossed_pair) { // this can be generated with a special vmesh stbvox_mesh_vertex basevert = stbvox_vertex_encode(pos.x, pos.y, pos.z << STBVOX_CONFIG_PRECISION_Z , 0,0); unsigned char simple_rot=0; stbvox_rotate rot = { 0,0,0,0 }; unsigned char mesh = mm->default_mesh; if (mm->input.selector) { mesh = mm->input.selector[v_off]; simple_rot = mesh >> 4; mesh &= 15; } if (mm->input.block_selector) { mesh = mm->input.block_selector[bt]; } // check if we're going off the end if (mm->output_cur[mesh][0] + mm->output_size[mesh][0]*4 > mm->output_end[mesh][0]) { mm->full = 1; return; } if (mm->input.rotate) { unsigned char val = mm->input.rotate[v_off]; rot.block = (val >> 0) & 3; rot.overlay = (val >> 2) & 3; //rot.tex2 = (val >> 4) & 3; rot.ecolor = (val >> 6) & 3; } else if (mm->input.selector) { rot.block = rot.overlay = rot.ecolor = simple_rot; } rot.facerot = 0; stbvox_make_mesh_for_face(mm, rot, STBVOX_FACE_north, v_off, pos, basevert, stbvox_vmesh_crossed_pair[STBVOX_FACE_north], mesh, STBVF_ne_u_cross); stbvox_make_mesh_for_face(mm, rot, STBVOX_FACE_south, v_off, pos, basevert, stbvox_vmesh_crossed_pair[STBVOX_FACE_south], mesh, STBVF_sw_u_cross); stbvox_make_mesh_for_face(mm, rot, STBVOX_FACE_east , v_off, pos, basevert, stbvox_vmesh_crossed_pair[STBVOX_FACE_east ], mesh, STBVF_se_u_cross); stbvox_make_mesh_for_face(mm, rot, STBVOX_FACE_west , v_off, pos, basevert, stbvox_vmesh_crossed_pair[STBVOX_FACE_west ], mesh, STBVF_nw_u_cross); } // @TODO // STBVOX_GEOM_floor_slope_north_is_top_as_wall, // STBVOX_GEOM_ceil_slope_north_is_bottom_as_wall, } static void stbvox_make_mesh_for_column(stbvox_mesh_maker *mm, int x, int y, int z0) { stbvox_pos pos; int v_off = x * mm->x_stride_in_bytes + y * mm->y_stride_in_bytes; int ns_off = mm->y_stride_in_bytes; int ew_off = mm->x_stride_in_bytes; pos.x = x; pos.y = y; pos.z = 0; if (mm->input.geometry) { unsigned char *bt = mm->input.blocktype + v_off; unsigned char *geo = mm->input.geometry + v_off; int z; for (z=z0; z < mm->z1; ++z) { if (bt[z] && ( !bt[z+ns_off] || !STBVOX_GET_GEO(geo[z+ns_off]) || !bt[z-ns_off] || !STBVOX_GET_GEO(geo[z-ns_off]) || !bt[z+ew_off] || !STBVOX_GET_GEO(geo[z+ew_off]) || !bt[z-ew_off] || !STBVOX_GET_GEO(geo[z-ew_off]) || !bt[z-1] || !STBVOX_GET_GEO(geo[z-1]) || !bt[z+1] || !STBVOX_GET_GEO(geo[z+1]))) { // TODO check up and down pos.z = z; stbvox_make_mesh_for_block_with_geo(mm, pos, v_off+z); if (mm->full) { mm->cur_z = z; return; } } } } else if (mm->input.block_geometry) { int z; unsigned char *bt = mm->input.blocktype + v_off; unsigned char *geo = mm->input.block_geometry; for (z=z0; z < mm->z1; ++z) { if (bt[z] && ( geo[bt[z+ns_off]] != STBVOX_GEOM_solid || geo[bt[z-ns_off]] != STBVOX_GEOM_solid || geo[bt[z+ew_off]] != STBVOX_GEOM_solid || geo[bt[z-ew_off]] != STBVOX_GEOM_solid || geo[bt[z-1]] != STBVOX_GEOM_solid || geo[bt[z+1]] != STBVOX_GEOM_solid)) { pos.z = z; stbvox_make_mesh_for_block_with_geo(mm, pos, v_off+z); if (mm->full) { mm->cur_z = z; return; } } } } else { unsigned char *bt = mm->input.blocktype + v_off; int z; #if STBVOX_CONFIG_PRECISION_Z == 1 stbvox_mesh_vertex *vmesh = stbvox_vmesh_delta_half_z[0]; #else stbvox_mesh_vertex *vmesh = stbvox_vmesh_delta_normal[0]; #endif for (z=z0; z < mm->z1; ++z) { // if it's solid and at least one neighbor isn't solid if (bt[z] && (!bt[z+ns_off] || !bt[z-ns_off] || !bt[z+ew_off] || !bt[z-ew_off] || !bt[z-1] || !bt[z+1])) { pos.z = z; stbvox_make_mesh_for_block(mm, pos, v_off+z, vmesh); if (mm->full) { mm->cur_z = z; return; } } } } } static void stbvox_bring_up_to_date(stbvox_mesh_maker *mm) { if (mm->config_dirty) { int i; #ifdef STBVOX_ICONFIG_FACE_ATTRIBUTE mm->num_mesh_slots = 1; for (i=0; i < STBVOX_MAX_MESHES; ++i) { mm->output_size[i][0] = 32; mm->output_step[i][0] = 8; } #else mm->num_mesh_slots = 2; for (i=0; i < STBVOX_MAX_MESHES; ++i) { mm->output_size[i][0] = 16; mm->output_step[i][0] = 4; mm->output_size[i][1] = 4; mm->output_step[i][1] = 4; } #endif mm->config_dirty = 0; } } int stbvox_make_mesh(stbvox_mesh_maker *mm) { int x,y; stbvox_bring_up_to_date(mm); mm->full = 0; if (mm->cur_x > mm->x0 || mm->cur_y > mm->y0 || mm->cur_z > mm->z0) { stbvox_make_mesh_for_column(mm, mm->cur_x, mm->cur_y, mm->cur_z); if (mm->full) return 0; ++mm->cur_y; while (mm->cur_y < mm->y1 && !mm->full) { stbvox_make_mesh_for_column(mm, mm->cur_x, mm->cur_y, mm->z0); if (mm->full) return 0; ++mm->cur_y; } ++mm->cur_x; } for (x=mm->cur_x; x < mm->x1; ++x) { for (y=mm->y0; y < mm->y1; ++y) { stbvox_make_mesh_for_column(mm, x, y, mm->z0); if (mm->full) { mm->cur_x = x; mm->cur_y = y; return 0; } } } return 1; } void stbvox_init_mesh_maker(stbvox_mesh_maker *mm) { memset(mm, 0, sizeof(*mm)); stbvox_build_default_palette(); mm->config_dirty = 1; mm->default_mesh = 0; } int stbvox_get_buffer_count(stbvox_mesh_maker *mm) { stbvox_bring_up_to_date(mm); return mm->num_mesh_slots; } int stbvox_get_buffer_size_per_quad(stbvox_mesh_maker *mm, int n) { return mm->output_size[0][n]; } void stbvox_reset_buffers(stbvox_mesh_maker *mm) { int i; for (i=0; i < STBVOX_MAX_MESHES*STBVOX_MAX_MESH_SLOTS; ++i) { mm->output_cur[0][i] = 0; mm->output_buffer[0][i] = 0; } } void stbvox_set_buffer(stbvox_mesh_maker *mm, int mesh, int slot, void *buffer, size_t len) { int i; stbvox_bring_up_to_date(mm); mm->output_buffer[mesh][slot] = (char *) buffer; mm->output_cur [mesh][slot] = (char *) buffer; mm->output_len [mesh][slot] = len; mm->output_end [mesh][slot] = (char *) buffer + len; for (i=0; i < STBVOX_MAX_MESH_SLOTS; ++i) { if (mm->output_buffer[mesh][i]) { assert(mm->output_len[mesh][i] / mm->output_size[mesh][i] == mm->output_len[mesh][slot] / mm->output_size[mesh][slot]); } } } void stbvox_set_default_mesh(stbvox_mesh_maker *mm, int mesh) { mm->default_mesh = mesh; } int stbvox_get_quad_count(stbvox_mesh_maker *mm, int mesh) { return (mm->output_cur[mesh][0] - mm->output_buffer[mesh][0]) / mm->output_size[mesh][0]; } stbvox_input_description *stbvox_get_input_description(stbvox_mesh_maker *mm) { return &mm->input; } void stbvox_set_input_range(stbvox_mesh_maker *mm, int x0, int y0, int z0, int x1, int y1, int z1) { mm->x0 = x0; mm->y0 = y0; mm->z0 = z0; mm->x1 = x1; mm->y1 = y1; mm->z1 = z1; mm->cur_x = x0; mm->cur_y = y0; mm->cur_z = z0; // @TODO validate that this range is representable in this mode } void stbvox_get_transform(stbvox_mesh_maker *mm, float transform[3][3]) { // scale transform[0][0] = 1.0; transform[0][1] = 1.0; #if STBVOX_CONFIG_PRECISION_Z==1 transform[0][2] = 0.5f; #else transform[0][2] = 1.0f; #endif // translation transform[1][0] = (float) (mm->pos_x); transform[1][1] = (float) (mm->pos_y); transform[1][2] = (float) (mm->pos_z); // texture coordinate projection translation transform[2][0] = (float) (mm->pos_x & 255); // @TODO depends on max texture scale transform[2][1] = (float) (mm->pos_y & 255); transform[2][2] = (float) (mm->pos_z & 255); } void stbvox_get_bounds(stbvox_mesh_maker *mm, float bounds[2][3]) { bounds[0][0] = (float) (mm->pos_x + mm->x0); bounds[0][1] = (float) (mm->pos_y + mm->y0); bounds[0][2] = (float) (mm->pos_z + mm->z0); bounds[1][0] = (float) (mm->pos_x + mm->x1); bounds[1][1] = (float) (mm->pos_y + mm->y1); bounds[1][2] = (float) (mm->pos_z + mm->z1); } void stbvox_set_mesh_coordinates(stbvox_mesh_maker *mm, int x, int y, int z) { mm->pos_x = x; mm->pos_y = y; mm->pos_z = z; } void stbvox_set_input_stride(stbvox_mesh_maker *mm, int x_stride_in_bytes, int y_stride_in_bytes) { int f,v; mm->x_stride_in_bytes = x_stride_in_bytes; mm->y_stride_in_bytes = y_stride_in_bytes; for (f=0; f < 6; ++f) { for (v=0; v < 4; ++v) { mm->cube_vertex_offset[f][v] = stbvox_vertex_vector[f][v][0] * mm->x_stride_in_bytes + stbvox_vertex_vector[f][v][1] * mm->y_stride_in_bytes + stbvox_vertex_vector[f][v][2] ; mm->vertex_gather_offset[f][v] = (stbvox_vertex_vector[f][v][0]-1) * mm->x_stride_in_bytes + (stbvox_vertex_vector[f][v][1]-1) * mm->y_stride_in_bytes + (stbvox_vertex_vector[f][v][2]-1) ; } } } ///////////////////////////////////////////////////////////////////////////// // // offline computation of tables // #if 0 // compute optimized vheight table static char *normal_names[32] = { 0,0,0,0,"u ",0, "eu ",0, 0,0,0,0,"ne_u",0, "nu ",0, 0,0,0,0,"nw_u",0, "wu ",0, 0,0,0,0,"sw_u",0, "su ",0, }; static char *find_best_normal(float x, float y, float z) { int best_slot = 4; float best_dot = 0; int i; for (i=0; i < 32; ++i) { if (normal_names[i]) { float dot = x * stbvox_default_normals[i][0] + y * stbvox_default_normals[i][1] + z * stbvox_default_normals[i][2]; if (dot > best_dot) { best_dot = dot; best_slot = i; } } } return normal_names[best_slot]; } int main(int argc, char **argv) { int sw,se,nw,ne; for (ne=0; ne < 4; ++ne) { for (nw=0; nw < 4; ++nw) { for (se=0; se < 4; ++se) { printf(" { "); for (sw=0; sw < 4; ++sw) { float x = (float) (nw + sw - ne - se); float y = (float) (sw + se - nw - ne); float z = 2; printf("STBVF_%s, ", find_best_normal(x,y,z)); } printf("},\n"); } } } return 0; } #endif // @TODO // // - test API for texture rotation on side faces // - API for texture rotation on top & bottom // - better culling of vheight faces with vheight neighbors // - better culling of non-vheight faces with vheight neighbors // - gather vertex lighting from slopes correctly // - better support texture edge_clamp: currently if you fall // exactly on 1.0 you get wrapped incorrectly; this is rare, but // can avoid: compute texcoords in vertex shader, offset towards // center before modding, need 2 bits per vertex to know offset direction) // - other mesh modes (10,6,4-byte quads) // // // With TexBuffer for the fixed vertex data, we can actually do // minecrafty non-blocks like stairs -- we still probably only // want 256 or so, so we can't do the equivalent of all the vheight // combos, but that's ok. The 256 includes baked rotations, but only // some of them need it, and lots of block types share some faces. // // mode 5 (6 bytes): mode 6 (6 bytes) // x:7 x:6 // y:7 y:6 // z:6 z:6 // tex1:8 tex1:8 // tex2:8 tex2:7 // color:8 color:8 // face:4 face:7 // // // side faces (all x4) top&bottom faces (2x) internal faces (1x) // 1 regular 1 regular // 2 slabs 2 // 8 stairs 4 stairs 16 // 4 diag side 8 // 4 upper diag side 8 // 4 lower diag side 8 // 4 crossed pairs // // 23*4 + 5*4 + 46 // == 92 + 20 + 46 = 158 // // Must drop 30 of them to fit in 7 bits: // ceiling half diagonals: 16+8 = 24 // Need to get rid of 6 more. // ceiling diagonals: 8+4 = 12 // This brings it to 122, so can add a crossed-pair variant. // (diagonal and non-diagonal, or randomly offset) // Or carpet, which would be 5 more. // // // Mode 4 (10 bytes): // v: z:2,light:6 // f: x:6,y:6,z:7, t1:8,t2:8,c:8,f:5 // // Mode ? (10 bytes) // v: xyz:5 (27 values), light:3 // f: x:7,y:7,z:6, t1:8,t2:8,c:8,f:4 // (v: x:2,y:2,z:2,light:2) #endif // STB_VOXEL_RENDER_IMPLEMENTATION /* ------------------------------------------------------------------------------ This software is available under 2 licenses -- choose whichever you prefer. ------------------------------------------------------------------------------ ALTERNATIVE A - MIT License Copyright (c) 2017 Sean Barrett 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. ------------------------------------------------------------------------------ ALTERNATIVE B - Public Domain (www.unlicense.org) This is free and unencumbered software released into the public domain. Anyone is free to copy, modify, publish, use, compile, sell, or distribute this software, either in source code form or as a compiled binary, for any purpose, commercial or non-commercial, and by any means. In jurisdictions that recognize copyright laws, the author or authors of this software dedicate any and all copyright interest in the software to the public domain. We make this dedication for the benefit of the public at large and to the detriment of our heirs and successors. We intend this dedication to be an overt act of relinquishment in perpetuity of all present and future rights to this software under copyright law. 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 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. ------------------------------------------------------------------------------ */ uTox/third_party/stb/stb/stb_vorbis.c0000600000175000001440000055567014003056224016750 0ustar rakusers// Ogg Vorbis audio decoder - v1.11 - public domain // http://nothings.org/stb_vorbis/ // // Original version written by Sean Barrett in 2007. // // Originally sponsored by RAD Game Tools. Seeking sponsored // by Phillip Bennefall, Marc Andersen, Aaron Baker, Elias Software, // Aras Pranckevicius, and Sean Barrett. // // LICENSE // // See end of file for license information. // // Limitations: // // - floor 0 not supported (used in old ogg vorbis files pre-2004) // - lossless sample-truncation at beginning ignored // - cannot concatenate multiple vorbis streams // - sample positions are 32-bit, limiting seekable 192Khz // files to around 6 hours (Ogg supports 64-bit) // // Feature contributors: // Dougall Johnson (sample-exact seeking) // // Bugfix/warning contributors: // Terje Mathisen Niklas Frykholm Andy Hill // Casey Muratori John Bolton Gargaj // Laurent Gomila Marc LeBlanc Ronny Chevalier // Bernhard Wodo Evan Balster alxprd@github // Tom Beaumont Ingo Leitgeb Nicolas Guillemot // Phillip Bennefall Rohit Thiago Goulart // manxorist@github saga musix github:infatum // // Partial history: // 1.11 - 2017/07/23 - fix MinGW compilation // 1.10 - 2017/03/03 - more robust seeking; fix negative ilog(); clear error in open_memory // 1.09 - 2016/04/04 - back out 'truncation of last frame' fix from previous version // 1.08 - 2016/04/02 - warnings; setup memory leaks; truncation of last frame // 1.07 - 2015/01/16 - fixes for crashes on invalid files; warning fixes; const // 1.06 - 2015/08/31 - full, correct support for seeking API (Dougall Johnson) // some crash fixes when out of memory or with corrupt files // fix some inappropriately signed shifts // 1.05 - 2015/04/19 - don't define __forceinline if it's redundant // 1.04 - 2014/08/27 - fix missing const-correct case in API // 1.03 - 2014/08/07 - warning fixes // 1.02 - 2014/07/09 - declare qsort comparison as explicitly _cdecl in Windows // 1.01 - 2014/06/18 - fix stb_vorbis_get_samples_float (interleaved was correct) // 1.0 - 2014/05/26 - fix memory leaks; fix warnings; fix bugs in >2-channel; // (API change) report sample rate for decode-full-file funcs // // See end of file for full version history. ////////////////////////////////////////////////////////////////////////////// // // HEADER BEGINS HERE // #ifndef STB_VORBIS_INCLUDE_STB_VORBIS_H #define STB_VORBIS_INCLUDE_STB_VORBIS_H #if defined(STB_VORBIS_NO_CRT) && !defined(STB_VORBIS_NO_STDIO) #define STB_VORBIS_NO_STDIO 1 #endif #ifndef STB_VORBIS_NO_STDIO #include #endif #ifdef __cplusplus extern "C" { #endif /////////// THREAD SAFETY // Individual stb_vorbis* handles are not thread-safe; you cannot decode from // them from multiple threads at the same time. However, you can have multiple // stb_vorbis* handles and decode from them independently in multiple thrads. /////////// MEMORY ALLOCATION // normally stb_vorbis uses malloc() to allocate memory at startup, // and alloca() to allocate temporary memory during a frame on the // stack. (Memory consumption will depend on the amount of setup // data in the file and how you set the compile flags for speed // vs. size. In my test files the maximal-size usage is ~150KB.) // // You can modify the wrapper functions in the source (setup_malloc, // setup_temp_malloc, temp_malloc) to change this behavior, or you // can use a simpler allocation model: you pass in a buffer from // which stb_vorbis will allocate _all_ its memory (including the // temp memory). "open" may fail with a VORBIS_outofmem if you // do not pass in enough data; there is no way to determine how // much you do need except to succeed (at which point you can // query get_info to find the exact amount required. yes I know // this is lame). // // If you pass in a non-NULL buffer of the type below, allocation // will occur from it as described above. Otherwise just pass NULL // to use malloc()/alloca() typedef struct { char *alloc_buffer; int alloc_buffer_length_in_bytes; } stb_vorbis_alloc; /////////// FUNCTIONS USEABLE WITH ALL INPUT MODES typedef struct stb_vorbis stb_vorbis; typedef struct { unsigned int sample_rate; int channels; unsigned int setup_memory_required; unsigned int setup_temp_memory_required; unsigned int temp_memory_required; int max_frame_size; } stb_vorbis_info; // get general information about the file extern stb_vorbis_info stb_vorbis_get_info(stb_vorbis *f); // get the last error detected (clears it, too) extern int stb_vorbis_get_error(stb_vorbis *f); // close an ogg vorbis file and free all memory in use extern void stb_vorbis_close(stb_vorbis *f); // this function returns the offset (in samples) from the beginning of the // file that will be returned by the next decode, if it is known, or -1 // otherwise. after a flush_pushdata() call, this may take a while before // it becomes valid again. // NOT WORKING YET after a seek with PULLDATA API extern int stb_vorbis_get_sample_offset(stb_vorbis *f); // returns the current seek point within the file, or offset from the beginning // of the memory buffer. In pushdata mode it returns 0. extern unsigned int stb_vorbis_get_file_offset(stb_vorbis *f); /////////// PUSHDATA API #ifndef STB_VORBIS_NO_PUSHDATA_API // this API allows you to get blocks of data from any source and hand // them to stb_vorbis. you have to buffer them; stb_vorbis will tell // you how much it used, and you have to give it the rest next time; // and stb_vorbis may not have enough data to work with and you will // need to give it the same data again PLUS more. Note that the Vorbis // specification does not bound the size of an individual frame. extern stb_vorbis *stb_vorbis_open_pushdata( const unsigned char * datablock, int datablock_length_in_bytes, int *datablock_memory_consumed_in_bytes, int *error, const stb_vorbis_alloc *alloc_buffer); // create a vorbis decoder by passing in the initial data block containing // the ogg&vorbis headers (you don't need to do parse them, just provide // the first N bytes of the file--you're told if it's not enough, see below) // on success, returns an stb_vorbis *, does not set error, returns the amount of // data parsed/consumed on this call in *datablock_memory_consumed_in_bytes; // on failure, returns NULL on error and sets *error, does not change *datablock_memory_consumed // if returns NULL and *error is VORBIS_need_more_data, then the input block was // incomplete and you need to pass in a larger block from the start of the file extern int stb_vorbis_decode_frame_pushdata( stb_vorbis *f, const unsigned char *datablock, int datablock_length_in_bytes, int *channels, // place to write number of float * buffers float ***output, // place to write float ** array of float * buffers int *samples // place to write number of output samples ); // decode a frame of audio sample data if possible from the passed-in data block // // return value: number of bytes we used from datablock // // possible cases: // 0 bytes used, 0 samples output (need more data) // N bytes used, 0 samples output (resynching the stream, keep going) // N bytes used, M samples output (one frame of data) // note that after opening a file, you will ALWAYS get one N-bytes,0-sample // frame, because Vorbis always "discards" the first frame. // // Note that on resynch, stb_vorbis will rarely consume all of the buffer, // instead only datablock_length_in_bytes-3 or less. This is because it wants // to avoid missing parts of a page header if they cross a datablock boundary, // without writing state-machiney code to record a partial detection. // // The number of channels returned are stored in *channels (which can be // NULL--it is always the same as the number of channels reported by // get_info). *output will contain an array of float* buffers, one per // channel. In other words, (*output)[0][0] contains the first sample from // the first channel, and (*output)[1][0] contains the first sample from // the second channel. extern void stb_vorbis_flush_pushdata(stb_vorbis *f); // inform stb_vorbis that your next datablock will not be contiguous with // previous ones (e.g. you've seeked in the data); future attempts to decode // frames will cause stb_vorbis to resynchronize (as noted above), and // once it sees a valid Ogg page (typically 4-8KB, as large as 64KB), it // will begin decoding the _next_ frame. // // if you want to seek using pushdata, you need to seek in your file, then // call stb_vorbis_flush_pushdata(), then start calling decoding, then once // decoding is returning you data, call stb_vorbis_get_sample_offset, and // if you don't like the result, seek your file again and repeat. #endif ////////// PULLING INPUT API #ifndef STB_VORBIS_NO_PULLDATA_API // This API assumes stb_vorbis is allowed to pull data from a source-- // either a block of memory containing the _entire_ vorbis stream, or a // FILE * that you or it create, or possibly some other reading mechanism // if you go modify the source to replace the FILE * case with some kind // of callback to your code. (But if you don't support seeking, you may // just want to go ahead and use pushdata.) #if !defined(STB_VORBIS_NO_STDIO) && !defined(STB_VORBIS_NO_INTEGER_CONVERSION) extern int stb_vorbis_decode_filename(const char *filename, int *channels, int *sample_rate, short **output); #endif #if !defined(STB_VORBIS_NO_INTEGER_CONVERSION) extern int stb_vorbis_decode_memory(const unsigned char *mem, int len, int *channels, int *sample_rate, short **output); #endif // decode an entire file and output the data interleaved into a malloc()ed // buffer stored in *output. The return value is the number of samples // decoded, or -1 if the file could not be opened or was not an ogg vorbis file. // When you're done with it, just free() the pointer returned in *output. extern stb_vorbis * stb_vorbis_open_memory(const unsigned char *data, int len, int *error, const stb_vorbis_alloc *alloc_buffer); // create an ogg vorbis decoder from an ogg vorbis stream in memory (note // this must be the entire stream!). on failure, returns NULL and sets *error #ifndef STB_VORBIS_NO_STDIO extern stb_vorbis * stb_vorbis_open_filename(const char *filename, int *error, const stb_vorbis_alloc *alloc_buffer); // create an ogg vorbis decoder from a filename via fopen(). on failure, // returns NULL and sets *error (possibly to VORBIS_file_open_failure). extern stb_vorbis * stb_vorbis_open_file(FILE *f, int close_handle_on_close, int *error, const stb_vorbis_alloc *alloc_buffer); // create an ogg vorbis decoder from an open FILE *, looking for a stream at // the _current_ seek point (ftell). on failure, returns NULL and sets *error. // note that stb_vorbis must "own" this stream; if you seek it in between // calls to stb_vorbis, it will become confused. Morever, if you attempt to // perform stb_vorbis_seek_*() operations on this file, it will assume it // owns the _entire_ rest of the file after the start point. Use the next // function, stb_vorbis_open_file_section(), to limit it. extern stb_vorbis * stb_vorbis_open_file_section(FILE *f, int close_handle_on_close, int *error, const stb_vorbis_alloc *alloc_buffer, unsigned int len); // create an ogg vorbis decoder from an open FILE *, looking for a stream at // the _current_ seek point (ftell); the stream will be of length 'len' bytes. // on failure, returns NULL and sets *error. note that stb_vorbis must "own" // this stream; if you seek it in between calls to stb_vorbis, it will become // confused. #endif extern int stb_vorbis_seek_frame(stb_vorbis *f, unsigned int sample_number); extern int stb_vorbis_seek(stb_vorbis *f, unsigned int sample_number); // these functions seek in the Vorbis file to (approximately) 'sample_number'. // after calling seek_frame(), the next call to get_frame_*() will include // the specified sample. after calling stb_vorbis_seek(), the next call to // stb_vorbis_get_samples_* will start with the specified sample. If you // do not need to seek to EXACTLY the target sample when using get_samples_*, // you can also use seek_frame(). extern int stb_vorbis_seek_start(stb_vorbis *f); // this function is equivalent to stb_vorbis_seek(f,0) extern unsigned int stb_vorbis_stream_length_in_samples(stb_vorbis *f); extern float stb_vorbis_stream_length_in_seconds(stb_vorbis *f); // these functions return the total length of the vorbis stream extern int stb_vorbis_get_frame_float(stb_vorbis *f, int *channels, float ***output); // decode the next frame and return the number of samples. the number of // channels returned are stored in *channels (which can be NULL--it is always // the same as the number of channels reported by get_info). *output will // contain an array of float* buffers, one per channel. These outputs will // be overwritten on the next call to stb_vorbis_get_frame_*. // // You generally should not intermix calls to stb_vorbis_get_frame_*() // and stb_vorbis_get_samples_*(), since the latter calls the former. #ifndef STB_VORBIS_NO_INTEGER_CONVERSION extern int stb_vorbis_get_frame_short_interleaved(stb_vorbis *f, int num_c, short *buffer, int num_shorts); extern int stb_vorbis_get_frame_short (stb_vorbis *f, int num_c, short **buffer, int num_samples); #endif // decode the next frame and return the number of *samples* per channel. // Note that for interleaved data, you pass in the number of shorts (the // size of your array), but the return value is the number of samples per // channel, not the total number of samples. // // The data is coerced to the number of channels you request according to the // channel coercion rules (see below). You must pass in the size of your // buffer(s) so that stb_vorbis will not overwrite the end of the buffer. // The maximum buffer size needed can be gotten from get_info(); however, // the Vorbis I specification implies an absolute maximum of 4096 samples // per channel. // Channel coercion rules: // Let M be the number of channels requested, and N the number of channels present, // and Cn be the nth channel; let stereo L be the sum of all L and center channels, // and stereo R be the sum of all R and center channels (channel assignment from the // vorbis spec). // M N output // 1 k sum(Ck) for all k // 2 * stereo L, stereo R // k l k > l, the first l channels, then 0s // k l k <= l, the first k channels // Note that this is not _good_ surround etc. mixing at all! It's just so // you get something useful. extern int stb_vorbis_get_samples_float_interleaved(stb_vorbis *f, int channels, float *buffer, int num_floats); extern int stb_vorbis_get_samples_float(stb_vorbis *f, int channels, float **buffer, int num_samples); // gets num_samples samples, not necessarily on a frame boundary--this requires // buffering so you have to supply the buffers. DOES NOT APPLY THE COERCION RULES. // Returns the number of samples stored per channel; it may be less than requested // at the end of the file. If there are no more samples in the file, returns 0. #ifndef STB_VORBIS_NO_INTEGER_CONVERSION extern int stb_vorbis_get_samples_short_interleaved(stb_vorbis *f, int channels, short *buffer, int num_shorts); extern int stb_vorbis_get_samples_short(stb_vorbis *f, int channels, short **buffer, int num_samples); #endif // gets num_samples samples, not necessarily on a frame boundary--this requires // buffering so you have to supply the buffers. Applies the coercion rules above // to produce 'channels' channels. Returns the number of samples stored per channel; // it may be less than requested at the end of the file. If there are no more // samples in the file, returns 0. #endif //////// ERROR CODES enum STBVorbisError { VORBIS__no_error, VORBIS_need_more_data=1, // not a real error VORBIS_invalid_api_mixing, // can't mix API modes VORBIS_outofmem, // not enough memory VORBIS_feature_not_supported, // uses floor 0 VORBIS_too_many_channels, // STB_VORBIS_MAX_CHANNELS is too small VORBIS_file_open_failure, // fopen() failed VORBIS_seek_without_length, // can't seek in unknown-length file VORBIS_unexpected_eof=10, // file is truncated? VORBIS_seek_invalid, // seek past EOF // decoding errors (corrupt/invalid stream) -- you probably // don't care about the exact details of these // vorbis errors: VORBIS_invalid_setup=20, VORBIS_invalid_stream, // ogg errors: VORBIS_missing_capture_pattern=30, VORBIS_invalid_stream_structure_version, VORBIS_continued_packet_flag_invalid, VORBIS_incorrect_stream_serial_number, VORBIS_invalid_first_page, VORBIS_bad_packet_type, VORBIS_cant_find_last_page, VORBIS_seek_failed }; #ifdef __cplusplus } #endif #endif // STB_VORBIS_INCLUDE_STB_VORBIS_H // // HEADER ENDS HERE // ////////////////////////////////////////////////////////////////////////////// #ifndef STB_VORBIS_HEADER_ONLY // global configuration settings (e.g. set these in the project/makefile), // or just set them in this file at the top (although ideally the first few // should be visible when the header file is compiled too, although it's not // crucial) // STB_VORBIS_NO_PUSHDATA_API // does not compile the code for the various stb_vorbis_*_pushdata() // functions // #define STB_VORBIS_NO_PUSHDATA_API // STB_VORBIS_NO_PULLDATA_API // does not compile the code for the non-pushdata APIs // #define STB_VORBIS_NO_PULLDATA_API // STB_VORBIS_NO_STDIO // does not compile the code for the APIs that use FILE *s internally // or externally (implied by STB_VORBIS_NO_PULLDATA_API) // #define STB_VORBIS_NO_STDIO // STB_VORBIS_NO_INTEGER_CONVERSION // does not compile the code for converting audio sample data from // float to integer (implied by STB_VORBIS_NO_PULLDATA_API) // #define STB_VORBIS_NO_INTEGER_CONVERSION // STB_VORBIS_NO_FAST_SCALED_FLOAT // does not use a fast float-to-int trick to accelerate float-to-int on // most platforms which requires endianness be defined correctly. //#define STB_VORBIS_NO_FAST_SCALED_FLOAT // STB_VORBIS_MAX_CHANNELS [number] // globally define this to the maximum number of channels you need. // The spec does not put a restriction on channels except that // the count is stored in a byte, so 255 is the hard limit. // Reducing this saves about 16 bytes per value, so using 16 saves // (255-16)*16 or around 4KB. Plus anything other memory usage // I forgot to account for. Can probably go as low as 8 (7.1 audio), // 6 (5.1 audio), or 2 (stereo only). #ifndef STB_VORBIS_MAX_CHANNELS #define STB_VORBIS_MAX_CHANNELS 16 // enough for anyone? #endif // STB_VORBIS_PUSHDATA_CRC_COUNT [number] // after a flush_pushdata(), stb_vorbis begins scanning for the // next valid page, without backtracking. when it finds something // that looks like a page, it streams through it and verifies its // CRC32. Should that validation fail, it keeps scanning. But it's // possible that _while_ streaming through to check the CRC32 of // one candidate page, it sees another candidate page. This #define // determines how many "overlapping" candidate pages it can search // at once. Note that "real" pages are typically ~4KB to ~8KB, whereas // garbage pages could be as big as 64KB, but probably average ~16KB. // So don't hose ourselves by scanning an apparent 64KB page and // missing a ton of real ones in the interim; so minimum of 2 #ifndef STB_VORBIS_PUSHDATA_CRC_COUNT #define STB_VORBIS_PUSHDATA_CRC_COUNT 4 #endif // STB_VORBIS_FAST_HUFFMAN_LENGTH [number] // sets the log size of the huffman-acceleration table. Maximum // supported value is 24. with larger numbers, more decodings are O(1), // but the table size is larger so worse cache missing, so you'll have // to probe (and try multiple ogg vorbis files) to find the sweet spot. #ifndef STB_VORBIS_FAST_HUFFMAN_LENGTH #define STB_VORBIS_FAST_HUFFMAN_LENGTH 10 #endif // STB_VORBIS_FAST_BINARY_LENGTH [number] // sets the log size of the binary-search acceleration table. this // is used in similar fashion to the fast-huffman size to set initial // parameters for the binary search // STB_VORBIS_FAST_HUFFMAN_INT // The fast huffman tables are much more efficient if they can be // stored as 16-bit results instead of 32-bit results. This restricts // the codebooks to having only 65535 possible outcomes, though. // (At least, accelerated by the huffman table.) #ifndef STB_VORBIS_FAST_HUFFMAN_INT #define STB_VORBIS_FAST_HUFFMAN_SHORT #endif // STB_VORBIS_NO_HUFFMAN_BINARY_SEARCH // If the 'fast huffman' search doesn't succeed, then stb_vorbis falls // back on binary searching for the correct one. This requires storing // extra tables with the huffman codes in sorted order. Defining this // symbol trades off space for speed by forcing a linear search in the // non-fast case, except for "sparse" codebooks. // #define STB_VORBIS_NO_HUFFMAN_BINARY_SEARCH // STB_VORBIS_DIVIDES_IN_RESIDUE // stb_vorbis precomputes the result of the scalar residue decoding // that would otherwise require a divide per chunk. you can trade off // space for time by defining this symbol. // #define STB_VORBIS_DIVIDES_IN_RESIDUE // STB_VORBIS_DIVIDES_IN_CODEBOOK // vorbis VQ codebooks can be encoded two ways: with every case explicitly // stored, or with all elements being chosen from a small range of values, // and all values possible in all elements. By default, stb_vorbis expands // this latter kind out to look like the former kind for ease of decoding, // because otherwise an integer divide-per-vector-element is required to // unpack the index. If you define STB_VORBIS_DIVIDES_IN_CODEBOOK, you can // trade off storage for speed. //#define STB_VORBIS_DIVIDES_IN_CODEBOOK #ifdef STB_VORBIS_CODEBOOK_SHORTS #error "STB_VORBIS_CODEBOOK_SHORTS is no longer supported as it produced incorrect results for some input formats" #endif // STB_VORBIS_DIVIDE_TABLE // this replaces small integer divides in the floor decode loop with // table lookups. made less than 1% difference, so disabled by default. // STB_VORBIS_NO_INLINE_DECODE // disables the inlining of the scalar codebook fast-huffman decode. // might save a little codespace; useful for debugging // #define STB_VORBIS_NO_INLINE_DECODE // STB_VORBIS_NO_DEFER_FLOOR // Normally we only decode the floor without synthesizing the actual // full curve. We can instead synthesize the curve immediately. This // requires more memory and is very likely slower, so I don't think // you'd ever want to do it except for debugging. // #define STB_VORBIS_NO_DEFER_FLOOR ////////////////////////////////////////////////////////////////////////////// #ifdef STB_VORBIS_NO_PULLDATA_API #define STB_VORBIS_NO_INTEGER_CONVERSION #define STB_VORBIS_NO_STDIO #endif #if defined(STB_VORBIS_NO_CRT) && !defined(STB_VORBIS_NO_STDIO) #define STB_VORBIS_NO_STDIO 1 #endif #ifndef STB_VORBIS_NO_INTEGER_CONVERSION #ifndef STB_VORBIS_NO_FAST_SCALED_FLOAT // only need endianness for fast-float-to-int, which we don't // use for pushdata #ifndef STB_VORBIS_BIG_ENDIAN #define STB_VORBIS_ENDIAN 0 #else #define STB_VORBIS_ENDIAN 1 #endif #endif #endif #ifndef STB_VORBIS_NO_STDIO #include #endif #ifndef STB_VORBIS_NO_CRT #include #include #include #include // find definition of alloca if it's not in stdlib.h: #if defined(_MSC_VER) || defined(__MINGW32__) #include #endif #if defined(__linux__) || defined(__linux) || defined(__EMSCRIPTEN__) #include #endif #else // STB_VORBIS_NO_CRT #define NULL 0 #define malloc(s) 0 #define free(s) ((void) 0) #define realloc(s) 0 #endif // STB_VORBIS_NO_CRT #include #ifdef __MINGW32__ // eff you mingw: // "fixed": // http://sourceforge.net/p/mingw-w64/mailman/message/32882927/ // "no that broke the build, reverted, who cares about C": // http://sourceforge.net/p/mingw-w64/mailman/message/32890381/ #ifdef __forceinline #undef __forceinline #endif #define __forceinline #define alloca __builtin_alloca #elif !defined(_MSC_VER) #if __GNUC__ #define __forceinline inline #else #define __forceinline #endif #endif #if STB_VORBIS_MAX_CHANNELS > 256 #error "Value of STB_VORBIS_MAX_CHANNELS outside of allowed range" #endif #if STB_VORBIS_FAST_HUFFMAN_LENGTH > 24 #error "Value of STB_VORBIS_FAST_HUFFMAN_LENGTH outside of allowed range" #endif #if 0 #include #define CHECK(f) _CrtIsValidHeapPointer(f->channel_buffers[1]) #else #define CHECK(f) ((void) 0) #endif #define MAX_BLOCKSIZE_LOG 13 // from specification #define MAX_BLOCKSIZE (1 << MAX_BLOCKSIZE_LOG) typedef unsigned char uint8; typedef signed char int8; typedef unsigned short uint16; typedef signed short int16; typedef unsigned int uint32; typedef signed int int32; #ifndef TRUE #define TRUE 1 #define FALSE 0 #endif typedef float codetype; // @NOTE // // Some arrays below are tagged "//varies", which means it's actually // a variable-sized piece of data, but rather than malloc I assume it's // small enough it's better to just allocate it all together with the // main thing // // Most of the variables are specified with the smallest size I could pack // them into. It might give better performance to make them all full-sized // integers. It should be safe to freely rearrange the structures or change // the sizes larger--nothing relies on silently truncating etc., nor the // order of variables. #define FAST_HUFFMAN_TABLE_SIZE (1 << STB_VORBIS_FAST_HUFFMAN_LENGTH) #define FAST_HUFFMAN_TABLE_MASK (FAST_HUFFMAN_TABLE_SIZE - 1) typedef struct { int dimensions, entries; uint8 *codeword_lengths; float minimum_value; float delta_value; uint8 value_bits; uint8 lookup_type; uint8 sequence_p; uint8 sparse; uint32 lookup_values; codetype *multiplicands; uint32 *codewords; #ifdef STB_VORBIS_FAST_HUFFMAN_SHORT int16 fast_huffman[FAST_HUFFMAN_TABLE_SIZE]; #else int32 fast_huffman[FAST_HUFFMAN_TABLE_SIZE]; #endif uint32 *sorted_codewords; int *sorted_values; int sorted_entries; } Codebook; typedef struct { uint8 order; uint16 rate; uint16 bark_map_size; uint8 amplitude_bits; uint8 amplitude_offset; uint8 number_of_books; uint8 book_list[16]; // varies } Floor0; typedef struct { uint8 partitions; uint8 partition_class_list[32]; // varies uint8 class_dimensions[16]; // varies uint8 class_subclasses[16]; // varies uint8 class_masterbooks[16]; // varies int16 subclass_books[16][8]; // varies uint16 Xlist[31*8+2]; // varies uint8 sorted_order[31*8+2]; uint8 neighbors[31*8+2][2]; uint8 floor1_multiplier; uint8 rangebits; int values; } Floor1; typedef union { Floor0 floor0; Floor1 floor1; } Floor; typedef struct { uint32 begin, end; uint32 part_size; uint8 classifications; uint8 classbook; uint8 **classdata; int16 (*residue_books)[8]; } Residue; typedef struct { uint8 magnitude; uint8 angle; uint8 mux; } MappingChannel; typedef struct { uint16 coupling_steps; MappingChannel *chan; uint8 submaps; uint8 submap_floor[15]; // varies uint8 submap_residue[15]; // varies } Mapping; typedef struct { uint8 blockflag; uint8 mapping; uint16 windowtype; uint16 transformtype; } Mode; typedef struct { uint32 goal_crc; // expected crc if match int bytes_left; // bytes left in packet uint32 crc_so_far; // running crc int bytes_done; // bytes processed in _current_ chunk uint32 sample_loc; // granule pos encoded in page } CRCscan; typedef struct { uint32 page_start, page_end; uint32 last_decoded_sample; } ProbedPage; struct stb_vorbis { // user-accessible info unsigned int sample_rate; int channels; unsigned int setup_memory_required; unsigned int temp_memory_required; unsigned int setup_temp_memory_required; // input config #ifndef STB_VORBIS_NO_STDIO FILE *f; uint32 f_start; int close_on_free; #endif uint8 *stream; uint8 *stream_start; uint8 *stream_end; uint32 stream_len; uint8 push_mode; uint32 first_audio_page_offset; ProbedPage p_first, p_last; // memory management stb_vorbis_alloc alloc; int setup_offset; int temp_offset; // run-time results int eof; enum STBVorbisError error; // user-useful data // header info int blocksize[2]; int blocksize_0, blocksize_1; int codebook_count; Codebook *codebooks; int floor_count; uint16 floor_types[64]; // varies Floor *floor_config; int residue_count; uint16 residue_types[64]; // varies Residue *residue_config; int mapping_count; Mapping *mapping; int mode_count; Mode mode_config[64]; // varies uint32 total_samples; // decode buffer float *channel_buffers[STB_VORBIS_MAX_CHANNELS]; float *outputs [STB_VORBIS_MAX_CHANNELS]; float *previous_window[STB_VORBIS_MAX_CHANNELS]; int previous_length; #ifndef STB_VORBIS_NO_DEFER_FLOOR int16 *finalY[STB_VORBIS_MAX_CHANNELS]; #else float *floor_buffers[STB_VORBIS_MAX_CHANNELS]; #endif uint32 current_loc; // sample location of next frame to decode int current_loc_valid; // per-blocksize precomputed data // twiddle factors float *A[2],*B[2],*C[2]; float *window[2]; uint16 *bit_reverse[2]; // current page/packet/segment streaming info uint32 serial; // stream serial number for verification int last_page; int segment_count; uint8 segments[255]; uint8 page_flag; uint8 bytes_in_seg; uint8 first_decode; int next_seg; int last_seg; // flag that we're on the last segment int last_seg_which; // what was the segment number of the last seg? uint32 acc; int valid_bits; int packet_bytes; int end_seg_with_known_loc; uint32 known_loc_for_packet; int discard_samples_deferred; uint32 samples_output; // push mode scanning int page_crc_tests; // only in push_mode: number of tests active; -1 if not searching #ifndef STB_VORBIS_NO_PUSHDATA_API CRCscan scan[STB_VORBIS_PUSHDATA_CRC_COUNT]; #endif // sample-access int channel_buffer_start; int channel_buffer_end; }; #if defined(STB_VORBIS_NO_PUSHDATA_API) #define IS_PUSH_MODE(f) FALSE #elif defined(STB_VORBIS_NO_PULLDATA_API) #define IS_PUSH_MODE(f) TRUE #else #define IS_PUSH_MODE(f) ((f)->push_mode) #endif typedef struct stb_vorbis vorb; static int error(vorb *f, enum STBVorbisError e) { f->error = e; if (!f->eof && e != VORBIS_need_more_data) { f->error=e; // breakpoint for debugging } return 0; } // these functions are used for allocating temporary memory // while decoding. if you can afford the stack space, use // alloca(); otherwise, provide a temp buffer and it will // allocate out of those. #define array_size_required(count,size) (count*(sizeof(void *)+(size))) #define temp_alloc(f,size) (f->alloc.alloc_buffer ? setup_temp_malloc(f,size) : alloca(size)) #ifdef dealloca #define temp_free(f,p) (f->alloc.alloc_buffer ? 0 : dealloca(size)) #else #define temp_free(f,p) 0 #endif #define temp_alloc_save(f) ((f)->temp_offset) #define temp_alloc_restore(f,p) ((f)->temp_offset = (p)) #define temp_block_array(f,count,size) make_block_array(temp_alloc(f,array_size_required(count,size)), count, size) // given a sufficiently large block of memory, make an array of pointers to subblocks of it static void *make_block_array(void *mem, int count, int size) { int i; void ** p = (void **) mem; char *q = (char *) (p + count); for (i=0; i < count; ++i) { p[i] = q; q += size; } return p; } static void *setup_malloc(vorb *f, int sz) { sz = (sz+3) & ~3; f->setup_memory_required += sz; if (f->alloc.alloc_buffer) { void *p = (char *) f->alloc.alloc_buffer + f->setup_offset; if (f->setup_offset + sz > f->temp_offset) return NULL; f->setup_offset += sz; return p; } return sz ? malloc(sz) : NULL; } static void setup_free(vorb *f, void *p) { if (f->alloc.alloc_buffer) return; // do nothing; setup mem is a stack free(p); } static void *setup_temp_malloc(vorb *f, int sz) { sz = (sz+3) & ~3; if (f->alloc.alloc_buffer) { if (f->temp_offset - sz < f->setup_offset) return NULL; f->temp_offset -= sz; return (char *) f->alloc.alloc_buffer + f->temp_offset; } return malloc(sz); } static void setup_temp_free(vorb *f, void *p, int sz) { if (f->alloc.alloc_buffer) { f->temp_offset += (sz+3)&~3; return; } free(p); } #define CRC32_POLY 0x04c11db7 // from spec static uint32 crc_table[256]; static void crc32_init(void) { int i,j; uint32 s; for(i=0; i < 256; i++) { for (s=(uint32) i << 24, j=0; j < 8; ++j) s = (s << 1) ^ (s >= (1U<<31) ? CRC32_POLY : 0); crc_table[i] = s; } } static __forceinline uint32 crc32_update(uint32 crc, uint8 byte) { return (crc << 8) ^ crc_table[byte ^ (crc >> 24)]; } // used in setup, and for huffman that doesn't go fast path static unsigned int bit_reverse(unsigned int n) { n = ((n & 0xAAAAAAAA) >> 1) | ((n & 0x55555555) << 1); n = ((n & 0xCCCCCCCC) >> 2) | ((n & 0x33333333) << 2); n = ((n & 0xF0F0F0F0) >> 4) | ((n & 0x0F0F0F0F) << 4); n = ((n & 0xFF00FF00) >> 8) | ((n & 0x00FF00FF) << 8); return (n >> 16) | (n << 16); } static float square(float x) { return x*x; } // this is a weird definition of log2() for which log2(1) = 1, log2(2) = 2, log2(4) = 3 // as required by the specification. fast(?) implementation from stb.h // @OPTIMIZE: called multiple times per-packet with "constants"; move to setup static int ilog(int32 n) { static signed char log2_4[16] = { 0,1,2,2,3,3,3,3,4,4,4,4,4,4,4,4 }; if (n < 0) return 0; // signed n returns 0 // 2 compares if n < 16, 3 compares otherwise (4 if signed or n > 1<<29) if (n < (1 << 14)) if (n < (1 << 4)) return 0 + log2_4[n ]; else if (n < (1 << 9)) return 5 + log2_4[n >> 5]; else return 10 + log2_4[n >> 10]; else if (n < (1 << 24)) if (n < (1 << 19)) return 15 + log2_4[n >> 15]; else return 20 + log2_4[n >> 20]; else if (n < (1 << 29)) return 25 + log2_4[n >> 25]; else return 30 + log2_4[n >> 30]; } #ifndef M_PI #define M_PI 3.14159265358979323846264f // from CRC #endif // code length assigned to a value with no huffman encoding #define NO_CODE 255 /////////////////////// LEAF SETUP FUNCTIONS ////////////////////////// // // these functions are only called at setup, and only a few times // per file static float float32_unpack(uint32 x) { // from the specification uint32 mantissa = x & 0x1fffff; uint32 sign = x & 0x80000000; uint32 exp = (x & 0x7fe00000) >> 21; double res = sign ? -(double)mantissa : (double)mantissa; return (float) ldexp((float)res, exp-788); } // zlib & jpeg huffman tables assume that the output symbols // can either be arbitrarily arranged, or have monotonically // increasing frequencies--they rely on the lengths being sorted; // this makes for a very simple generation algorithm. // vorbis allows a huffman table with non-sorted lengths. This // requires a more sophisticated construction, since symbols in // order do not map to huffman codes "in order". static void add_entry(Codebook *c, uint32 huff_code, int symbol, int count, int len, uint32 *values) { if (!c->sparse) { c->codewords [symbol] = huff_code; } else { c->codewords [count] = huff_code; c->codeword_lengths[count] = len; values [count] = symbol; } } static int compute_codewords(Codebook *c, uint8 *len, int n, uint32 *values) { int i,k,m=0; uint32 available[32]; memset(available, 0, sizeof(available)); // find the first entry for (k=0; k < n; ++k) if (len[k] < NO_CODE) break; if (k == n) { assert(c->sorted_entries == 0); return TRUE; } // add to the list add_entry(c, 0, k, m++, len[k], values); // add all available leaves for (i=1; i <= len[k]; ++i) available[i] = 1U << (32-i); // note that the above code treats the first case specially, // but it's really the same as the following code, so they // could probably be combined (except the initial code is 0, // and I use 0 in available[] to mean 'empty') for (i=k+1; i < n; ++i) { uint32 res; int z = len[i], y; if (z == NO_CODE) continue; // find lowest available leaf (should always be earliest, // which is what the specification calls for) // note that this property, and the fact we can never have // more than one free leaf at a given level, isn't totally // trivial to prove, but it seems true and the assert never // fires, so! while (z > 0 && !available[z]) --z; if (z == 0) { return FALSE; } res = available[z]; assert(z >= 0 && z < 32); available[z] = 0; add_entry(c, bit_reverse(res), i, m++, len[i], values); // propogate availability up the tree if (z != len[i]) { assert(len[i] >= 0 && len[i] < 32); for (y=len[i]; y > z; --y) { assert(available[y] == 0); available[y] = res + (1 << (32-y)); } } } return TRUE; } // accelerated huffman table allows fast O(1) match of all symbols // of length <= STB_VORBIS_FAST_HUFFMAN_LENGTH static void compute_accelerated_huffman(Codebook *c) { int i, len; for (i=0; i < FAST_HUFFMAN_TABLE_SIZE; ++i) c->fast_huffman[i] = -1; len = c->sparse ? c->sorted_entries : c->entries; #ifdef STB_VORBIS_FAST_HUFFMAN_SHORT if (len > 32767) len = 32767; // largest possible value we can encode! #endif for (i=0; i < len; ++i) { if (c->codeword_lengths[i] <= STB_VORBIS_FAST_HUFFMAN_LENGTH) { uint32 z = c->sparse ? bit_reverse(c->sorted_codewords[i]) : c->codewords[i]; // set table entries for all bit combinations in the higher bits while (z < FAST_HUFFMAN_TABLE_SIZE) { c->fast_huffman[z] = i; z += 1 << c->codeword_lengths[i]; } } } } #ifdef _MSC_VER #define STBV_CDECL __cdecl #else #define STBV_CDECL #endif static int STBV_CDECL uint32_compare(const void *p, const void *q) { uint32 x = * (uint32 *) p; uint32 y = * (uint32 *) q; return x < y ? -1 : x > y; } static int include_in_sort(Codebook *c, uint8 len) { if (c->sparse) { assert(len != NO_CODE); return TRUE; } if (len == NO_CODE) return FALSE; if (len > STB_VORBIS_FAST_HUFFMAN_LENGTH) return TRUE; return FALSE; } // if the fast table above doesn't work, we want to binary // search them... need to reverse the bits static void compute_sorted_huffman(Codebook *c, uint8 *lengths, uint32 *values) { int i, len; // build a list of all the entries // OPTIMIZATION: don't include the short ones, since they'll be caught by FAST_HUFFMAN. // this is kind of a frivolous optimization--I don't see any performance improvement, // but it's like 4 extra lines of code, so. if (!c->sparse) { int k = 0; for (i=0; i < c->entries; ++i) if (include_in_sort(c, lengths[i])) c->sorted_codewords[k++] = bit_reverse(c->codewords[i]); assert(k == c->sorted_entries); } else { for (i=0; i < c->sorted_entries; ++i) c->sorted_codewords[i] = bit_reverse(c->codewords[i]); } qsort(c->sorted_codewords, c->sorted_entries, sizeof(c->sorted_codewords[0]), uint32_compare); c->sorted_codewords[c->sorted_entries] = 0xffffffff; len = c->sparse ? c->sorted_entries : c->entries; // now we need to indicate how they correspond; we could either // #1: sort a different data structure that says who they correspond to // #2: for each sorted entry, search the original list to find who corresponds // #3: for each original entry, find the sorted entry // #1 requires extra storage, #2 is slow, #3 can use binary search! for (i=0; i < len; ++i) { int huff_len = c->sparse ? lengths[values[i]] : lengths[i]; if (include_in_sort(c,huff_len)) { uint32 code = bit_reverse(c->codewords[i]); int x=0, n=c->sorted_entries; while (n > 1) { // invariant: sc[x] <= code < sc[x+n] int m = x + (n >> 1); if (c->sorted_codewords[m] <= code) { x = m; n -= (n>>1); } else { n >>= 1; } } assert(c->sorted_codewords[x] == code); if (c->sparse) { c->sorted_values[x] = values[i]; c->codeword_lengths[x] = huff_len; } else { c->sorted_values[x] = i; } } } } // only run while parsing the header (3 times) static int vorbis_validate(uint8 *data) { static uint8 vorbis[6] = { 'v', 'o', 'r', 'b', 'i', 's' }; return memcmp(data, vorbis, 6) == 0; } // called from setup only, once per code book // (formula implied by specification) static int lookup1_values(int entries, int dim) { int r = (int) floor(exp((float) log((float) entries) / dim)); if ((int) floor(pow((float) r+1, dim)) <= entries) // (int) cast for MinGW warning; ++r; // floor() to avoid _ftol() when non-CRT assert(pow((float) r+1, dim) > entries); assert((int) floor(pow((float) r, dim)) <= entries); // (int),floor() as above return r; } // called twice per file static void compute_twiddle_factors(int n, float *A, float *B, float *C) { int n4 = n >> 2, n8 = n >> 3; int k,k2; for (k=k2=0; k < n4; ++k,k2+=2) { A[k2 ] = (float) cos(4*k*M_PI/n); A[k2+1] = (float) -sin(4*k*M_PI/n); B[k2 ] = (float) cos((k2+1)*M_PI/n/2) * 0.5f; B[k2+1] = (float) sin((k2+1)*M_PI/n/2) * 0.5f; } for (k=k2=0; k < n8; ++k,k2+=2) { C[k2 ] = (float) cos(2*(k2+1)*M_PI/n); C[k2+1] = (float) -sin(2*(k2+1)*M_PI/n); } } static void compute_window(int n, float *window) { int n2 = n >> 1, i; for (i=0; i < n2; ++i) window[i] = (float) sin(0.5 * M_PI * square((float) sin((i - 0 + 0.5) / n2 * 0.5 * M_PI))); } static void compute_bitreverse(int n, uint16 *rev) { int ld = ilog(n) - 1; // ilog is off-by-one from normal definitions int i, n8 = n >> 3; for (i=0; i < n8; ++i) rev[i] = (bit_reverse(i) >> (32-ld+3)) << 2; } static int init_blocksize(vorb *f, int b, int n) { int n2 = n >> 1, n4 = n >> 2, n8 = n >> 3; f->A[b] = (float *) setup_malloc(f, sizeof(float) * n2); f->B[b] = (float *) setup_malloc(f, sizeof(float) * n2); f->C[b] = (float *) setup_malloc(f, sizeof(float) * n4); if (!f->A[b] || !f->B[b] || !f->C[b]) return error(f, VORBIS_outofmem); compute_twiddle_factors(n, f->A[b], f->B[b], f->C[b]); f->window[b] = (float *) setup_malloc(f, sizeof(float) * n2); if (!f->window[b]) return error(f, VORBIS_outofmem); compute_window(n, f->window[b]); f->bit_reverse[b] = (uint16 *) setup_malloc(f, sizeof(uint16) * n8); if (!f->bit_reverse[b]) return error(f, VORBIS_outofmem); compute_bitreverse(n, f->bit_reverse[b]); return TRUE; } static void neighbors(uint16 *x, int n, int *plow, int *phigh) { int low = -1; int high = 65536; int i; for (i=0; i < n; ++i) { if (x[i] > low && x[i] < x[n]) { *plow = i; low = x[i]; } if (x[i] < high && x[i] > x[n]) { *phigh = i; high = x[i]; } } } // this has been repurposed so y is now the original index instead of y typedef struct { uint16 x,id; } stbv__floor_ordering; static int STBV_CDECL point_compare(const void *p, const void *q) { stbv__floor_ordering *a = (stbv__floor_ordering *) p; stbv__floor_ordering *b = (stbv__floor_ordering *) q; return a->x < b->x ? -1 : a->x > b->x; } // /////////////////////// END LEAF SETUP FUNCTIONS ////////////////////////// #if defined(STB_VORBIS_NO_STDIO) #define USE_MEMORY(z) TRUE #else #define USE_MEMORY(z) ((z)->stream) #endif static uint8 get8(vorb *z) { if (USE_MEMORY(z)) { if (z->stream >= z->stream_end) { z->eof = TRUE; return 0; } return *z->stream++; } #ifndef STB_VORBIS_NO_STDIO { int c = fgetc(z->f); if (c == EOF) { z->eof = TRUE; return 0; } return c; } #endif } static uint32 get32(vorb *f) { uint32 x; x = get8(f); x += get8(f) << 8; x += get8(f) << 16; x += (uint32) get8(f) << 24; return x; } static int getn(vorb *z, uint8 *data, int n) { if (USE_MEMORY(z)) { if (z->stream+n > z->stream_end) { z->eof = 1; return 0; } memcpy(data, z->stream, n); z->stream += n; return 1; } #ifndef STB_VORBIS_NO_STDIO if (fread(data, n, 1, z->f) == 1) return 1; else { z->eof = 1; return 0; } #endif } static void skip(vorb *z, int n) { if (USE_MEMORY(z)) { z->stream += n; if (z->stream >= z->stream_end) z->eof = 1; return; } #ifndef STB_VORBIS_NO_STDIO { long x = ftell(z->f); fseek(z->f, x+n, SEEK_SET); } #endif } static int set_file_offset(stb_vorbis *f, unsigned int loc) { #ifndef STB_VORBIS_NO_PUSHDATA_API if (f->push_mode) return 0; #endif f->eof = 0; if (USE_MEMORY(f)) { if (f->stream_start + loc >= f->stream_end || f->stream_start + loc < f->stream_start) { f->stream = f->stream_end; f->eof = 1; return 0; } else { f->stream = f->stream_start + loc; return 1; } } #ifndef STB_VORBIS_NO_STDIO if (loc + f->f_start < loc || loc >= 0x80000000) { loc = 0x7fffffff; f->eof = 1; } else { loc += f->f_start; } if (!fseek(f->f, loc, SEEK_SET)) return 1; f->eof = 1; fseek(f->f, f->f_start, SEEK_END); return 0; #endif } static uint8 ogg_page_header[4] = { 0x4f, 0x67, 0x67, 0x53 }; static int capture_pattern(vorb *f) { if (0x4f != get8(f)) return FALSE; if (0x67 != get8(f)) return FALSE; if (0x67 != get8(f)) return FALSE; if (0x53 != get8(f)) return FALSE; return TRUE; } #define PAGEFLAG_continued_packet 1 #define PAGEFLAG_first_page 2 #define PAGEFLAG_last_page 4 static int start_page_no_capturepattern(vorb *f) { uint32 loc0,loc1,n; // stream structure version if (0 != get8(f)) return error(f, VORBIS_invalid_stream_structure_version); // header flag f->page_flag = get8(f); // absolute granule position loc0 = get32(f); loc1 = get32(f); // @TODO: validate loc0,loc1 as valid positions? // stream serial number -- vorbis doesn't interleave, so discard get32(f); //if (f->serial != get32(f)) return error(f, VORBIS_incorrect_stream_serial_number); // page sequence number n = get32(f); f->last_page = n; // CRC32 get32(f); // page_segments f->segment_count = get8(f); if (!getn(f, f->segments, f->segment_count)) return error(f, VORBIS_unexpected_eof); // assume we _don't_ know any the sample position of any segments f->end_seg_with_known_loc = -2; if (loc0 != ~0U || loc1 != ~0U) { int i; // determine which packet is the last one that will complete for (i=f->segment_count-1; i >= 0; --i) if (f->segments[i] < 255) break; // 'i' is now the index of the _last_ segment of a packet that ends if (i >= 0) { f->end_seg_with_known_loc = i; f->known_loc_for_packet = loc0; } } if (f->first_decode) { int i,len; ProbedPage p; len = 0; for (i=0; i < f->segment_count; ++i) len += f->segments[i]; len += 27 + f->segment_count; p.page_start = f->first_audio_page_offset; p.page_end = p.page_start + len; p.last_decoded_sample = loc0; f->p_first = p; } f->next_seg = 0; return TRUE; } static int start_page(vorb *f) { if (!capture_pattern(f)) return error(f, VORBIS_missing_capture_pattern); return start_page_no_capturepattern(f); } static int start_packet(vorb *f) { while (f->next_seg == -1) { if (!start_page(f)) return FALSE; if (f->page_flag & PAGEFLAG_continued_packet) return error(f, VORBIS_continued_packet_flag_invalid); } f->last_seg = FALSE; f->valid_bits = 0; f->packet_bytes = 0; f->bytes_in_seg = 0; // f->next_seg is now valid return TRUE; } static int maybe_start_packet(vorb *f) { if (f->next_seg == -1) { int x = get8(f); if (f->eof) return FALSE; // EOF at page boundary is not an error! if (0x4f != x ) return error(f, VORBIS_missing_capture_pattern); if (0x67 != get8(f)) return error(f, VORBIS_missing_capture_pattern); if (0x67 != get8(f)) return error(f, VORBIS_missing_capture_pattern); if (0x53 != get8(f)) return error(f, VORBIS_missing_capture_pattern); if (!start_page_no_capturepattern(f)) return FALSE; if (f->page_flag & PAGEFLAG_continued_packet) { // set up enough state that we can read this packet if we want, // e.g. during recovery f->last_seg = FALSE; f->bytes_in_seg = 0; return error(f, VORBIS_continued_packet_flag_invalid); } } return start_packet(f); } static int next_segment(vorb *f) { int len; if (f->last_seg) return 0; if (f->next_seg == -1) { f->last_seg_which = f->segment_count-1; // in case start_page fails if (!start_page(f)) { f->last_seg = 1; return 0; } if (!(f->page_flag & PAGEFLAG_continued_packet)) return error(f, VORBIS_continued_packet_flag_invalid); } len = f->segments[f->next_seg++]; if (len < 255) { f->last_seg = TRUE; f->last_seg_which = f->next_seg-1; } if (f->next_seg >= f->segment_count) f->next_seg = -1; assert(f->bytes_in_seg == 0); f->bytes_in_seg = len; return len; } #define EOP (-1) #define INVALID_BITS (-1) static int get8_packet_raw(vorb *f) { if (!f->bytes_in_seg) { // CLANG! if (f->last_seg) return EOP; else if (!next_segment(f)) return EOP; } assert(f->bytes_in_seg > 0); --f->bytes_in_seg; ++f->packet_bytes; return get8(f); } static int get8_packet(vorb *f) { int x = get8_packet_raw(f); f->valid_bits = 0; return x; } static void flush_packet(vorb *f) { while (get8_packet_raw(f) != EOP); } // @OPTIMIZE: this is the secondary bit decoder, so it's probably not as important // as the huffman decoder? static uint32 get_bits(vorb *f, int n) { uint32 z; if (f->valid_bits < 0) return 0; if (f->valid_bits < n) { if (n > 24) { // the accumulator technique below would not work correctly in this case z = get_bits(f, 24); z += get_bits(f, n-24) << 24; return z; } if (f->valid_bits == 0) f->acc = 0; while (f->valid_bits < n) { int z = get8_packet_raw(f); if (z == EOP) { f->valid_bits = INVALID_BITS; return 0; } f->acc += z << f->valid_bits; f->valid_bits += 8; } } if (f->valid_bits < 0) return 0; z = f->acc & ((1 << n)-1); f->acc >>= n; f->valid_bits -= n; return z; } // @OPTIMIZE: primary accumulator for huffman // expand the buffer to as many bits as possible without reading off end of packet // it might be nice to allow f->valid_bits and f->acc to be stored in registers, // e.g. cache them locally and decode locally static __forceinline void prep_huffman(vorb *f) { if (f->valid_bits <= 24) { if (f->valid_bits == 0) f->acc = 0; do { int z; if (f->last_seg && !f->bytes_in_seg) return; z = get8_packet_raw(f); if (z == EOP) return; f->acc += (unsigned) z << f->valid_bits; f->valid_bits += 8; } while (f->valid_bits <= 24); } } enum { VORBIS_packet_id = 1, VORBIS_packet_comment = 3, VORBIS_packet_setup = 5 }; static int codebook_decode_scalar_raw(vorb *f, Codebook *c) { int i; prep_huffman(f); if (c->codewords == NULL && c->sorted_codewords == NULL) return -1; // cases to use binary search: sorted_codewords && !c->codewords // sorted_codewords && c->entries > 8 if (c->entries > 8 ? c->sorted_codewords!=NULL : !c->codewords) { // binary search uint32 code = bit_reverse(f->acc); int x=0, n=c->sorted_entries, len; while (n > 1) { // invariant: sc[x] <= code < sc[x+n] int m = x + (n >> 1); if (c->sorted_codewords[m] <= code) { x = m; n -= (n>>1); } else { n >>= 1; } } // x is now the sorted index if (!c->sparse) x = c->sorted_values[x]; // x is now sorted index if sparse, or symbol otherwise len = c->codeword_lengths[x]; if (f->valid_bits >= len) { f->acc >>= len; f->valid_bits -= len; return x; } f->valid_bits = 0; return -1; } // if small, linear search assert(!c->sparse); for (i=0; i < c->entries; ++i) { if (c->codeword_lengths[i] == NO_CODE) continue; if (c->codewords[i] == (f->acc & ((1 << c->codeword_lengths[i])-1))) { if (f->valid_bits >= c->codeword_lengths[i]) { f->acc >>= c->codeword_lengths[i]; f->valid_bits -= c->codeword_lengths[i]; return i; } f->valid_bits = 0; return -1; } } error(f, VORBIS_invalid_stream); f->valid_bits = 0; return -1; } #ifndef STB_VORBIS_NO_INLINE_DECODE #define DECODE_RAW(var, f,c) \ if (f->valid_bits < STB_VORBIS_FAST_HUFFMAN_LENGTH) \ prep_huffman(f); \ var = f->acc & FAST_HUFFMAN_TABLE_MASK; \ var = c->fast_huffman[var]; \ if (var >= 0) { \ int n = c->codeword_lengths[var]; \ f->acc >>= n; \ f->valid_bits -= n; \ if (f->valid_bits < 0) { f->valid_bits = 0; var = -1; } \ } else { \ var = codebook_decode_scalar_raw(f,c); \ } #else static int codebook_decode_scalar(vorb *f, Codebook *c) { int i; if (f->valid_bits < STB_VORBIS_FAST_HUFFMAN_LENGTH) prep_huffman(f); // fast huffman table lookup i = f->acc & FAST_HUFFMAN_TABLE_MASK; i = c->fast_huffman[i]; if (i >= 0) { f->acc >>= c->codeword_lengths[i]; f->valid_bits -= c->codeword_lengths[i]; if (f->valid_bits < 0) { f->valid_bits = 0; return -1; } return i; } return codebook_decode_scalar_raw(f,c); } #define DECODE_RAW(var,f,c) var = codebook_decode_scalar(f,c); #endif #define DECODE(var,f,c) \ DECODE_RAW(var,f,c) \ if (c->sparse) var = c->sorted_values[var]; #ifndef STB_VORBIS_DIVIDES_IN_CODEBOOK #define DECODE_VQ(var,f,c) DECODE_RAW(var,f,c) #else #define DECODE_VQ(var,f,c) DECODE(var,f,c) #endif // CODEBOOK_ELEMENT_FAST is an optimization for the CODEBOOK_FLOATS case // where we avoid one addition #define CODEBOOK_ELEMENT(c,off) (c->multiplicands[off]) #define CODEBOOK_ELEMENT_FAST(c,off) (c->multiplicands[off]) #define CODEBOOK_ELEMENT_BASE(c) (0) static int codebook_decode_start(vorb *f, Codebook *c) { int z = -1; // type 0 is only legal in a scalar context if (c->lookup_type == 0) error(f, VORBIS_invalid_stream); else { DECODE_VQ(z,f,c); if (c->sparse) assert(z < c->sorted_entries); if (z < 0) { // check for EOP if (!f->bytes_in_seg) if (f->last_seg) return z; error(f, VORBIS_invalid_stream); } } return z; } static int codebook_decode(vorb *f, Codebook *c, float *output, int len) { int i,z = codebook_decode_start(f,c); if (z < 0) return FALSE; if (len > c->dimensions) len = c->dimensions; #ifdef STB_VORBIS_DIVIDES_IN_CODEBOOK if (c->lookup_type == 1) { float last = CODEBOOK_ELEMENT_BASE(c); int div = 1; for (i=0; i < len; ++i) { int off = (z / div) % c->lookup_values; float val = CODEBOOK_ELEMENT_FAST(c,off) + last; output[i] += val; if (c->sequence_p) last = val + c->minimum_value; div *= c->lookup_values; } return TRUE; } #endif z *= c->dimensions; if (c->sequence_p) { float last = CODEBOOK_ELEMENT_BASE(c); for (i=0; i < len; ++i) { float val = CODEBOOK_ELEMENT_FAST(c,z+i) + last; output[i] += val; last = val + c->minimum_value; } } else { float last = CODEBOOK_ELEMENT_BASE(c); for (i=0; i < len; ++i) { output[i] += CODEBOOK_ELEMENT_FAST(c,z+i) + last; } } return TRUE; } static int codebook_decode_step(vorb *f, Codebook *c, float *output, int len, int step) { int i,z = codebook_decode_start(f,c); float last = CODEBOOK_ELEMENT_BASE(c); if (z < 0) return FALSE; if (len > c->dimensions) len = c->dimensions; #ifdef STB_VORBIS_DIVIDES_IN_CODEBOOK if (c->lookup_type == 1) { int div = 1; for (i=0; i < len; ++i) { int off = (z / div) % c->lookup_values; float val = CODEBOOK_ELEMENT_FAST(c,off) + last; output[i*step] += val; if (c->sequence_p) last = val; div *= c->lookup_values; } return TRUE; } #endif z *= c->dimensions; for (i=0; i < len; ++i) { float val = CODEBOOK_ELEMENT_FAST(c,z+i) + last; output[i*step] += val; if (c->sequence_p) last = val; } return TRUE; } static int codebook_decode_deinterleave_repeat(vorb *f, Codebook *c, float **outputs, int ch, int *c_inter_p, int *p_inter_p, int len, int total_decode) { int c_inter = *c_inter_p; int p_inter = *p_inter_p; int i,z, effective = c->dimensions; // type 0 is only legal in a scalar context if (c->lookup_type == 0) return error(f, VORBIS_invalid_stream); while (total_decode > 0) { float last = CODEBOOK_ELEMENT_BASE(c); DECODE_VQ(z,f,c); #ifndef STB_VORBIS_DIVIDES_IN_CODEBOOK assert(!c->sparse || z < c->sorted_entries); #endif if (z < 0) { if (!f->bytes_in_seg) if (f->last_seg) return FALSE; return error(f, VORBIS_invalid_stream); } // if this will take us off the end of the buffers, stop short! // we check by computing the length of the virtual interleaved // buffer (len*ch), our current offset within it (p_inter*ch)+(c_inter), // and the length we'll be using (effective) if (c_inter + p_inter*ch + effective > len * ch) { effective = len*ch - (p_inter*ch - c_inter); } #ifdef STB_VORBIS_DIVIDES_IN_CODEBOOK if (c->lookup_type == 1) { int div = 1; for (i=0; i < effective; ++i) { int off = (z / div) % c->lookup_values; float val = CODEBOOK_ELEMENT_FAST(c,off) + last; if (outputs[c_inter]) outputs[c_inter][p_inter] += val; if (++c_inter == ch) { c_inter = 0; ++p_inter; } if (c->sequence_p) last = val; div *= c->lookup_values; } } else #endif { z *= c->dimensions; if (c->sequence_p) { for (i=0; i < effective; ++i) { float val = CODEBOOK_ELEMENT_FAST(c,z+i) + last; if (outputs[c_inter]) outputs[c_inter][p_inter] += val; if (++c_inter == ch) { c_inter = 0; ++p_inter; } last = val; } } else { for (i=0; i < effective; ++i) { float val = CODEBOOK_ELEMENT_FAST(c,z+i) + last; if (outputs[c_inter]) outputs[c_inter][p_inter] += val; if (++c_inter == ch) { c_inter = 0; ++p_inter; } } } } total_decode -= effective; } *c_inter_p = c_inter; *p_inter_p = p_inter; return TRUE; } static int predict_point(int x, int x0, int x1, int y0, int y1) { int dy = y1 - y0; int adx = x1 - x0; // @OPTIMIZE: force int division to round in the right direction... is this necessary on x86? int err = abs(dy) * (x - x0); int off = err / adx; return dy < 0 ? y0 - off : y0 + off; } // the following table is block-copied from the specification static float inverse_db_table[256] = { 1.0649863e-07f, 1.1341951e-07f, 1.2079015e-07f, 1.2863978e-07f, 1.3699951e-07f, 1.4590251e-07f, 1.5538408e-07f, 1.6548181e-07f, 1.7623575e-07f, 1.8768855e-07f, 1.9988561e-07f, 2.1287530e-07f, 2.2670913e-07f, 2.4144197e-07f, 2.5713223e-07f, 2.7384213e-07f, 2.9163793e-07f, 3.1059021e-07f, 3.3077411e-07f, 3.5226968e-07f, 3.7516214e-07f, 3.9954229e-07f, 4.2550680e-07f, 4.5315863e-07f, 4.8260743e-07f, 5.1396998e-07f, 5.4737065e-07f, 5.8294187e-07f, 6.2082472e-07f, 6.6116941e-07f, 7.0413592e-07f, 7.4989464e-07f, 7.9862701e-07f, 8.5052630e-07f, 9.0579828e-07f, 9.6466216e-07f, 1.0273513e-06f, 1.0941144e-06f, 1.1652161e-06f, 1.2409384e-06f, 1.3215816e-06f, 1.4074654e-06f, 1.4989305e-06f, 1.5963394e-06f, 1.7000785e-06f, 1.8105592e-06f, 1.9282195e-06f, 2.0535261e-06f, 2.1869758e-06f, 2.3290978e-06f, 2.4804557e-06f, 2.6416497e-06f, 2.8133190e-06f, 2.9961443e-06f, 3.1908506e-06f, 3.3982101e-06f, 3.6190449e-06f, 3.8542308e-06f, 4.1047004e-06f, 4.3714470e-06f, 4.6555282e-06f, 4.9580707e-06f, 5.2802740e-06f, 5.6234160e-06f, 5.9888572e-06f, 6.3780469e-06f, 6.7925283e-06f, 7.2339451e-06f, 7.7040476e-06f, 8.2047000e-06f, 8.7378876e-06f, 9.3057248e-06f, 9.9104632e-06f, 1.0554501e-05f, 1.1240392e-05f, 1.1970856e-05f, 1.2748789e-05f, 1.3577278e-05f, 1.4459606e-05f, 1.5399272e-05f, 1.6400004e-05f, 1.7465768e-05f, 1.8600792e-05f, 1.9809576e-05f, 2.1096914e-05f, 2.2467911e-05f, 2.3928002e-05f, 2.5482978e-05f, 2.7139006e-05f, 2.8902651e-05f, 3.0780908e-05f, 3.2781225e-05f, 3.4911534e-05f, 3.7180282e-05f, 3.9596466e-05f, 4.2169667e-05f, 4.4910090e-05f, 4.7828601e-05f, 5.0936773e-05f, 5.4246931e-05f, 5.7772202e-05f, 6.1526565e-05f, 6.5524908e-05f, 6.9783085e-05f, 7.4317983e-05f, 7.9147585e-05f, 8.4291040e-05f, 8.9768747e-05f, 9.5602426e-05f, 0.00010181521f, 0.00010843174f, 0.00011547824f, 0.00012298267f, 0.00013097477f, 0.00013948625f, 0.00014855085f, 0.00015820453f, 0.00016848555f, 0.00017943469f, 0.00019109536f, 0.00020351382f, 0.00021673929f, 0.00023082423f, 0.00024582449f, 0.00026179955f, 0.00027881276f, 0.00029693158f, 0.00031622787f, 0.00033677814f, 0.00035866388f, 0.00038197188f, 0.00040679456f, 0.00043323036f, 0.00046138411f, 0.00049136745f, 0.00052329927f, 0.00055730621f, 0.00059352311f, 0.00063209358f, 0.00067317058f, 0.00071691700f, 0.00076350630f, 0.00081312324f, 0.00086596457f, 0.00092223983f, 0.00098217216f, 0.0010459992f, 0.0011139742f, 0.0011863665f, 0.0012634633f, 0.0013455702f, 0.0014330129f, 0.0015261382f, 0.0016253153f, 0.0017309374f, 0.0018434235f, 0.0019632195f, 0.0020908006f, 0.0022266726f, 0.0023713743f, 0.0025254795f, 0.0026895994f, 0.0028643847f, 0.0030505286f, 0.0032487691f, 0.0034598925f, 0.0036847358f, 0.0039241906f, 0.0041792066f, 0.0044507950f, 0.0047400328f, 0.0050480668f, 0.0053761186f, 0.0057254891f, 0.0060975636f, 0.0064938176f, 0.0069158225f, 0.0073652516f, 0.0078438871f, 0.0083536271f, 0.0088964928f, 0.009474637f, 0.010090352f, 0.010746080f, 0.011444421f, 0.012188144f, 0.012980198f, 0.013823725f, 0.014722068f, 0.015678791f, 0.016697687f, 0.017782797f, 0.018938423f, 0.020169149f, 0.021479854f, 0.022875735f, 0.024362330f, 0.025945531f, 0.027631618f, 0.029427276f, 0.031339626f, 0.033376252f, 0.035545228f, 0.037855157f, 0.040315199f, 0.042935108f, 0.045725273f, 0.048696758f, 0.051861348f, 0.055231591f, 0.058820850f, 0.062643361f, 0.066714279f, 0.071049749f, 0.075666962f, 0.080584227f, 0.085821044f, 0.091398179f, 0.097337747f, 0.10366330f, 0.11039993f, 0.11757434f, 0.12521498f, 0.13335215f, 0.14201813f, 0.15124727f, 0.16107617f, 0.17154380f, 0.18269168f, 0.19456402f, 0.20720788f, 0.22067342f, 0.23501402f, 0.25028656f, 0.26655159f, 0.28387361f, 0.30232132f, 0.32196786f, 0.34289114f, 0.36517414f, 0.38890521f, 0.41417847f, 0.44109412f, 0.46975890f, 0.50028648f, 0.53279791f, 0.56742212f, 0.60429640f, 0.64356699f, 0.68538959f, 0.72993007f, 0.77736504f, 0.82788260f, 0.88168307f, 0.9389798f, 1.0f }; // @OPTIMIZE: if you want to replace this bresenham line-drawing routine, // note that you must produce bit-identical output to decode correctly; // this specific sequence of operations is specified in the spec (it's // drawing integer-quantized frequency-space lines that the encoder // expects to be exactly the same) // ... also, isn't the whole point of Bresenham's algorithm to NOT // have to divide in the setup? sigh. #ifndef STB_VORBIS_NO_DEFER_FLOOR #define LINE_OP(a,b) a *= b #else #define LINE_OP(a,b) a = b #endif #ifdef STB_VORBIS_DIVIDE_TABLE #define DIVTAB_NUMER 32 #define DIVTAB_DENOM 64 int8 integer_divide_table[DIVTAB_NUMER][DIVTAB_DENOM]; // 2KB #endif static __forceinline void draw_line(float *output, int x0, int y0, int x1, int y1, int n) { int dy = y1 - y0; int adx = x1 - x0; int ady = abs(dy); int base; int x=x0,y=y0; int err = 0; int sy; #ifdef STB_VORBIS_DIVIDE_TABLE if (adx < DIVTAB_DENOM && ady < DIVTAB_NUMER) { if (dy < 0) { base = -integer_divide_table[ady][adx]; sy = base-1; } else { base = integer_divide_table[ady][adx]; sy = base+1; } } else { base = dy / adx; if (dy < 0) sy = base - 1; else sy = base+1; } #else base = dy / adx; if (dy < 0) sy = base - 1; else sy = base+1; #endif ady -= abs(base) * adx; if (x1 > n) x1 = n; if (x < x1) { LINE_OP(output[x], inverse_db_table[y]); for (++x; x < x1; ++x) { err += ady; if (err >= adx) { err -= adx; y += sy; } else y += base; LINE_OP(output[x], inverse_db_table[y]); } } } static int residue_decode(vorb *f, Codebook *book, float *target, int offset, int n, int rtype) { int k; if (rtype == 0) { int step = n / book->dimensions; for (k=0; k < step; ++k) if (!codebook_decode_step(f, book, target+offset+k, n-offset-k, step)) return FALSE; } else { for (k=0; k < n; ) { if (!codebook_decode(f, book, target+offset, n-k)) return FALSE; k += book->dimensions; offset += book->dimensions; } } return TRUE; } static void decode_residue(vorb *f, float *residue_buffers[], int ch, int n, int rn, uint8 *do_not_decode) { int i,j,pass; Residue *r = f->residue_config + rn; int rtype = f->residue_types[rn]; int c = r->classbook; int classwords = f->codebooks[c].dimensions; int n_read = r->end - r->begin; int part_read = n_read / r->part_size; int temp_alloc_point = temp_alloc_save(f); #ifndef STB_VORBIS_DIVIDES_IN_RESIDUE uint8 ***part_classdata = (uint8 ***) temp_block_array(f,f->channels, part_read * sizeof(**part_classdata)); #else int **classifications = (int **) temp_block_array(f,f->channels, part_read * sizeof(**classifications)); #endif CHECK(f); for (i=0; i < ch; ++i) if (!do_not_decode[i]) memset(residue_buffers[i], 0, sizeof(float) * n); if (rtype == 2 && ch != 1) { for (j=0; j < ch; ++j) if (!do_not_decode[j]) break; if (j == ch) goto done; for (pass=0; pass < 8; ++pass) { int pcount = 0, class_set = 0; if (ch == 2) { while (pcount < part_read) { int z = r->begin + pcount*r->part_size; int c_inter = (z & 1), p_inter = z>>1; if (pass == 0) { Codebook *c = f->codebooks+r->classbook; int q; DECODE(q,f,c); if (q == EOP) goto done; #ifndef STB_VORBIS_DIVIDES_IN_RESIDUE part_classdata[0][class_set] = r->classdata[q]; #else for (i=classwords-1; i >= 0; --i) { classifications[0][i+pcount] = q % r->classifications; q /= r->classifications; } #endif } for (i=0; i < classwords && pcount < part_read; ++i, ++pcount) { int z = r->begin + pcount*r->part_size; #ifndef STB_VORBIS_DIVIDES_IN_RESIDUE int c = part_classdata[0][class_set][i]; #else int c = classifications[0][pcount]; #endif int b = r->residue_books[c][pass]; if (b >= 0) { Codebook *book = f->codebooks + b; #ifdef STB_VORBIS_DIVIDES_IN_CODEBOOK if (!codebook_decode_deinterleave_repeat(f, book, residue_buffers, ch, &c_inter, &p_inter, n, r->part_size)) goto done; #else // saves 1% if (!codebook_decode_deinterleave_repeat(f, book, residue_buffers, ch, &c_inter, &p_inter, n, r->part_size)) goto done; #endif } else { z += r->part_size; c_inter = z & 1; p_inter = z >> 1; } } #ifndef STB_VORBIS_DIVIDES_IN_RESIDUE ++class_set; #endif } } else if (ch == 1) { while (pcount < part_read) { int z = r->begin + pcount*r->part_size; int c_inter = 0, p_inter = z; if (pass == 0) { Codebook *c = f->codebooks+r->classbook; int q; DECODE(q,f,c); if (q == EOP) goto done; #ifndef STB_VORBIS_DIVIDES_IN_RESIDUE part_classdata[0][class_set] = r->classdata[q]; #else for (i=classwords-1; i >= 0; --i) { classifications[0][i+pcount] = q % r->classifications; q /= r->classifications; } #endif } for (i=0; i < classwords && pcount < part_read; ++i, ++pcount) { int z = r->begin + pcount*r->part_size; #ifndef STB_VORBIS_DIVIDES_IN_RESIDUE int c = part_classdata[0][class_set][i]; #else int c = classifications[0][pcount]; #endif int b = r->residue_books[c][pass]; if (b >= 0) { Codebook *book = f->codebooks + b; if (!codebook_decode_deinterleave_repeat(f, book, residue_buffers, ch, &c_inter, &p_inter, n, r->part_size)) goto done; } else { z += r->part_size; c_inter = 0; p_inter = z; } } #ifndef STB_VORBIS_DIVIDES_IN_RESIDUE ++class_set; #endif } } else { while (pcount < part_read) { int z = r->begin + pcount*r->part_size; int c_inter = z % ch, p_inter = z/ch; if (pass == 0) { Codebook *c = f->codebooks+r->classbook; int q; DECODE(q,f,c); if (q == EOP) goto done; #ifndef STB_VORBIS_DIVIDES_IN_RESIDUE part_classdata[0][class_set] = r->classdata[q]; #else for (i=classwords-1; i >= 0; --i) { classifications[0][i+pcount] = q % r->classifications; q /= r->classifications; } #endif } for (i=0; i < classwords && pcount < part_read; ++i, ++pcount) { int z = r->begin + pcount*r->part_size; #ifndef STB_VORBIS_DIVIDES_IN_RESIDUE int c = part_classdata[0][class_set][i]; #else int c = classifications[0][pcount]; #endif int b = r->residue_books[c][pass]; if (b >= 0) { Codebook *book = f->codebooks + b; if (!codebook_decode_deinterleave_repeat(f, book, residue_buffers, ch, &c_inter, &p_inter, n, r->part_size)) goto done; } else { z += r->part_size; c_inter = z % ch; p_inter = z / ch; } } #ifndef STB_VORBIS_DIVIDES_IN_RESIDUE ++class_set; #endif } } } goto done; } CHECK(f); for (pass=0; pass < 8; ++pass) { int pcount = 0, class_set=0; while (pcount < part_read) { if (pass == 0) { for (j=0; j < ch; ++j) { if (!do_not_decode[j]) { Codebook *c = f->codebooks+r->classbook; int temp; DECODE(temp,f,c); if (temp == EOP) goto done; #ifndef STB_VORBIS_DIVIDES_IN_RESIDUE part_classdata[j][class_set] = r->classdata[temp]; #else for (i=classwords-1; i >= 0; --i) { classifications[j][i+pcount] = temp % r->classifications; temp /= r->classifications; } #endif } } } for (i=0; i < classwords && pcount < part_read; ++i, ++pcount) { for (j=0; j < ch; ++j) { if (!do_not_decode[j]) { #ifndef STB_VORBIS_DIVIDES_IN_RESIDUE int c = part_classdata[j][class_set][i]; #else int c = classifications[j][pcount]; #endif int b = r->residue_books[c][pass]; if (b >= 0) { float *target = residue_buffers[j]; int offset = r->begin + pcount * r->part_size; int n = r->part_size; Codebook *book = f->codebooks + b; if (!residue_decode(f, book, target, offset, n, rtype)) goto done; } } } } #ifndef STB_VORBIS_DIVIDES_IN_RESIDUE ++class_set; #endif } } done: CHECK(f); #ifndef STB_VORBIS_DIVIDES_IN_RESIDUE temp_free(f,part_classdata); #else temp_free(f,classifications); #endif temp_alloc_restore(f,temp_alloc_point); } #if 0 // slow way for debugging void inverse_mdct_slow(float *buffer, int n) { int i,j; int n2 = n >> 1; float *x = (float *) malloc(sizeof(*x) * n2); memcpy(x, buffer, sizeof(*x) * n2); for (i=0; i < n; ++i) { float acc = 0; for (j=0; j < n2; ++j) // formula from paper: //acc += n/4.0f * x[j] * (float) cos(M_PI / 2 / n * (2 * i + 1 + n/2.0)*(2*j+1)); // formula from wikipedia //acc += 2.0f / n2 * x[j] * (float) cos(M_PI/n2 * (i + 0.5 + n2/2)*(j + 0.5)); // these are equivalent, except the formula from the paper inverts the multiplier! // however, what actually works is NO MULTIPLIER!?! //acc += 64 * 2.0f / n2 * x[j] * (float) cos(M_PI/n2 * (i + 0.5 + n2/2)*(j + 0.5)); acc += x[j] * (float) cos(M_PI / 2 / n * (2 * i + 1 + n/2.0)*(2*j+1)); buffer[i] = acc; } free(x); } #elif 0 // same as above, but just barely able to run in real time on modern machines void inverse_mdct_slow(float *buffer, int n, vorb *f, int blocktype) { float mcos[16384]; int i,j; int n2 = n >> 1, nmask = (n << 2) -1; float *x = (float *) malloc(sizeof(*x) * n2); memcpy(x, buffer, sizeof(*x) * n2); for (i=0; i < 4*n; ++i) mcos[i] = (float) cos(M_PI / 2 * i / n); for (i=0; i < n; ++i) { float acc = 0; for (j=0; j < n2; ++j) acc += x[j] * mcos[(2 * i + 1 + n2)*(2*j+1) & nmask]; buffer[i] = acc; } free(x); } #elif 0 // transform to use a slow dct-iv; this is STILL basically trivial, // but only requires half as many ops void dct_iv_slow(float *buffer, int n) { float mcos[16384]; float x[2048]; int i,j; int n2 = n >> 1, nmask = (n << 3) - 1; memcpy(x, buffer, sizeof(*x) * n); for (i=0; i < 8*n; ++i) mcos[i] = (float) cos(M_PI / 4 * i / n); for (i=0; i < n; ++i) { float acc = 0; for (j=0; j < n; ++j) acc += x[j] * mcos[((2 * i + 1)*(2*j+1)) & nmask]; buffer[i] = acc; } } void inverse_mdct_slow(float *buffer, int n, vorb *f, int blocktype) { int i, n4 = n >> 2, n2 = n >> 1, n3_4 = n - n4; float temp[4096]; memcpy(temp, buffer, n2 * sizeof(float)); dct_iv_slow(temp, n2); // returns -c'-d, a-b' for (i=0; i < n4 ; ++i) buffer[i] = temp[i+n4]; // a-b' for ( ; i < n3_4; ++i) buffer[i] = -temp[n3_4 - i - 1]; // b-a', c+d' for ( ; i < n ; ++i) buffer[i] = -temp[i - n3_4]; // c'+d } #endif #ifndef LIBVORBIS_MDCT #define LIBVORBIS_MDCT 0 #endif #if LIBVORBIS_MDCT // directly call the vorbis MDCT using an interface documented // by Jeff Roberts... useful for performance comparison typedef struct { int n; int log2n; float *trig; int *bitrev; float scale; } mdct_lookup; extern void mdct_init(mdct_lookup *lookup, int n); extern void mdct_clear(mdct_lookup *l); extern void mdct_backward(mdct_lookup *init, float *in, float *out); mdct_lookup M1,M2; void inverse_mdct(float *buffer, int n, vorb *f, int blocktype) { mdct_lookup *M; if (M1.n == n) M = &M1; else if (M2.n == n) M = &M2; else if (M1.n == 0) { mdct_init(&M1, n); M = &M1; } else { if (M2.n) __asm int 3; mdct_init(&M2, n); M = &M2; } mdct_backward(M, buffer, buffer); } #endif // the following were split out into separate functions while optimizing; // they could be pushed back up but eh. __forceinline showed no change; // they're probably already being inlined. static void imdct_step3_iter0_loop(int n, float *e, int i_off, int k_off, float *A) { float *ee0 = e + i_off; float *ee2 = ee0 + k_off; int i; assert((n & 3) == 0); for (i=(n>>2); i > 0; --i) { float k00_20, k01_21; k00_20 = ee0[ 0] - ee2[ 0]; k01_21 = ee0[-1] - ee2[-1]; ee0[ 0] += ee2[ 0];//ee0[ 0] = ee0[ 0] + ee2[ 0]; ee0[-1] += ee2[-1];//ee0[-1] = ee0[-1] + ee2[-1]; ee2[ 0] = k00_20 * A[0] - k01_21 * A[1]; ee2[-1] = k01_21 * A[0] + k00_20 * A[1]; A += 8; k00_20 = ee0[-2] - ee2[-2]; k01_21 = ee0[-3] - ee2[-3]; ee0[-2] += ee2[-2];//ee0[-2] = ee0[-2] + ee2[-2]; ee0[-3] += ee2[-3];//ee0[-3] = ee0[-3] + ee2[-3]; ee2[-2] = k00_20 * A[0] - k01_21 * A[1]; ee2[-3] = k01_21 * A[0] + k00_20 * A[1]; A += 8; k00_20 = ee0[-4] - ee2[-4]; k01_21 = ee0[-5] - ee2[-5]; ee0[-4] += ee2[-4];//ee0[-4] = ee0[-4] + ee2[-4]; ee0[-5] += ee2[-5];//ee0[-5] = ee0[-5] + ee2[-5]; ee2[-4] = k00_20 * A[0] - k01_21 * A[1]; ee2[-5] = k01_21 * A[0] + k00_20 * A[1]; A += 8; k00_20 = ee0[-6] - ee2[-6]; k01_21 = ee0[-7] - ee2[-7]; ee0[-6] += ee2[-6];//ee0[-6] = ee0[-6] + ee2[-6]; ee0[-7] += ee2[-7];//ee0[-7] = ee0[-7] + ee2[-7]; ee2[-6] = k00_20 * A[0] - k01_21 * A[1]; ee2[-7] = k01_21 * A[0] + k00_20 * A[1]; A += 8; ee0 -= 8; ee2 -= 8; } } static void imdct_step3_inner_r_loop(int lim, float *e, int d0, int k_off, float *A, int k1) { int i; float k00_20, k01_21; float *e0 = e + d0; float *e2 = e0 + k_off; for (i=lim >> 2; i > 0; --i) { k00_20 = e0[-0] - e2[-0]; k01_21 = e0[-1] - e2[-1]; e0[-0] += e2[-0];//e0[-0] = e0[-0] + e2[-0]; e0[-1] += e2[-1];//e0[-1] = e0[-1] + e2[-1]; e2[-0] = (k00_20)*A[0] - (k01_21) * A[1]; e2[-1] = (k01_21)*A[0] + (k00_20) * A[1]; A += k1; k00_20 = e0[-2] - e2[-2]; k01_21 = e0[-3] - e2[-3]; e0[-2] += e2[-2];//e0[-2] = e0[-2] + e2[-2]; e0[-3] += e2[-3];//e0[-3] = e0[-3] + e2[-3]; e2[-2] = (k00_20)*A[0] - (k01_21) * A[1]; e2[-3] = (k01_21)*A[0] + (k00_20) * A[1]; A += k1; k00_20 = e0[-4] - e2[-4]; k01_21 = e0[-5] - e2[-5]; e0[-4] += e2[-4];//e0[-4] = e0[-4] + e2[-4]; e0[-5] += e2[-5];//e0[-5] = e0[-5] + e2[-5]; e2[-4] = (k00_20)*A[0] - (k01_21) * A[1]; e2[-5] = (k01_21)*A[0] + (k00_20) * A[1]; A += k1; k00_20 = e0[-6] - e2[-6]; k01_21 = e0[-7] - e2[-7]; e0[-6] += e2[-6];//e0[-6] = e0[-6] + e2[-6]; e0[-7] += e2[-7];//e0[-7] = e0[-7] + e2[-7]; e2[-6] = (k00_20)*A[0] - (k01_21) * A[1]; e2[-7] = (k01_21)*A[0] + (k00_20) * A[1]; e0 -= 8; e2 -= 8; A += k1; } } static void imdct_step3_inner_s_loop(int n, float *e, int i_off, int k_off, float *A, int a_off, int k0) { int i; float A0 = A[0]; float A1 = A[0+1]; float A2 = A[0+a_off]; float A3 = A[0+a_off+1]; float A4 = A[0+a_off*2+0]; float A5 = A[0+a_off*2+1]; float A6 = A[0+a_off*3+0]; float A7 = A[0+a_off*3+1]; float k00,k11; float *ee0 = e +i_off; float *ee2 = ee0+k_off; for (i=n; i > 0; --i) { k00 = ee0[ 0] - ee2[ 0]; k11 = ee0[-1] - ee2[-1]; ee0[ 0] = ee0[ 0] + ee2[ 0]; ee0[-1] = ee0[-1] + ee2[-1]; ee2[ 0] = (k00) * A0 - (k11) * A1; ee2[-1] = (k11) * A0 + (k00) * A1; k00 = ee0[-2] - ee2[-2]; k11 = ee0[-3] - ee2[-3]; ee0[-2] = ee0[-2] + ee2[-2]; ee0[-3] = ee0[-3] + ee2[-3]; ee2[-2] = (k00) * A2 - (k11) * A3; ee2[-3] = (k11) * A2 + (k00) * A3; k00 = ee0[-4] - ee2[-4]; k11 = ee0[-5] - ee2[-5]; ee0[-4] = ee0[-4] + ee2[-4]; ee0[-5] = ee0[-5] + ee2[-5]; ee2[-4] = (k00) * A4 - (k11) * A5; ee2[-5] = (k11) * A4 + (k00) * A5; k00 = ee0[-6] - ee2[-6]; k11 = ee0[-7] - ee2[-7]; ee0[-6] = ee0[-6] + ee2[-6]; ee0[-7] = ee0[-7] + ee2[-7]; ee2[-6] = (k00) * A6 - (k11) * A7; ee2[-7] = (k11) * A6 + (k00) * A7; ee0 -= k0; ee2 -= k0; } } static __forceinline void iter_54(float *z) { float k00,k11,k22,k33; float y0,y1,y2,y3; k00 = z[ 0] - z[-4]; y0 = z[ 0] + z[-4]; y2 = z[-2] + z[-6]; k22 = z[-2] - z[-6]; z[-0] = y0 + y2; // z0 + z4 + z2 + z6 z[-2] = y0 - y2; // z0 + z4 - z2 - z6 // done with y0,y2 k33 = z[-3] - z[-7]; z[-4] = k00 + k33; // z0 - z4 + z3 - z7 z[-6] = k00 - k33; // z0 - z4 - z3 + z7 // done with k33 k11 = z[-1] - z[-5]; y1 = z[-1] + z[-5]; y3 = z[-3] + z[-7]; z[-1] = y1 + y3; // z1 + z5 + z3 + z7 z[-3] = y1 - y3; // z1 + z5 - z3 - z7 z[-5] = k11 - k22; // z1 - z5 + z2 - z6 z[-7] = k11 + k22; // z1 - z5 - z2 + z6 } static void imdct_step3_inner_s_loop_ld654(int n, float *e, int i_off, float *A, int base_n) { int a_off = base_n >> 3; float A2 = A[0+a_off]; float *z = e + i_off; float *base = z - 16 * n; while (z > base) { float k00,k11; k00 = z[-0] - z[-8]; k11 = z[-1] - z[-9]; z[-0] = z[-0] + z[-8]; z[-1] = z[-1] + z[-9]; z[-8] = k00; z[-9] = k11 ; k00 = z[ -2] - z[-10]; k11 = z[ -3] - z[-11]; z[ -2] = z[ -2] + z[-10]; z[ -3] = z[ -3] + z[-11]; z[-10] = (k00+k11) * A2; z[-11] = (k11-k00) * A2; k00 = z[-12] - z[ -4]; // reverse to avoid a unary negation k11 = z[ -5] - z[-13]; z[ -4] = z[ -4] + z[-12]; z[ -5] = z[ -5] + z[-13]; z[-12] = k11; z[-13] = k00; k00 = z[-14] - z[ -6]; // reverse to avoid a unary negation k11 = z[ -7] - z[-15]; z[ -6] = z[ -6] + z[-14]; z[ -7] = z[ -7] + z[-15]; z[-14] = (k00+k11) * A2; z[-15] = (k00-k11) * A2; iter_54(z); iter_54(z-8); z -= 16; } } static void inverse_mdct(float *buffer, int n, vorb *f, int blocktype) { int n2 = n >> 1, n4 = n >> 2, n8 = n >> 3, l; int ld; // @OPTIMIZE: reduce register pressure by using fewer variables? int save_point = temp_alloc_save(f); float *buf2 = (float *) temp_alloc(f, n2 * sizeof(*buf2)); float *u=NULL,*v=NULL; // twiddle factors float *A = f->A[blocktype]; // IMDCT algorithm from "The use of multirate filter banks for coding of high quality digital audio" // See notes about bugs in that paper in less-optimal implementation 'inverse_mdct_old' after this function. // kernel from paper // merged: // copy and reflect spectral data // step 0 // note that it turns out that the items added together during // this step are, in fact, being added to themselves (as reflected // by step 0). inexplicable inefficiency! this became obvious // once I combined the passes. // so there's a missing 'times 2' here (for adding X to itself). // this propogates through linearly to the end, where the numbers // are 1/2 too small, and need to be compensated for. { float *d,*e, *AA, *e_stop; d = &buf2[n2-2]; AA = A; e = &buffer[0]; e_stop = &buffer[n2]; while (e != e_stop) { d[1] = (e[0] * AA[0] - e[2]*AA[1]); d[0] = (e[0] * AA[1] + e[2]*AA[0]); d -= 2; AA += 2; e += 4; } e = &buffer[n2-3]; while (d >= buf2) { d[1] = (-e[2] * AA[0] - -e[0]*AA[1]); d[0] = (-e[2] * AA[1] + -e[0]*AA[0]); d -= 2; AA += 2; e -= 4; } } // now we use symbolic names for these, so that we can // possibly swap their meaning as we change which operations // are in place u = buffer; v = buf2; // step 2 (paper output is w, now u) // this could be in place, but the data ends up in the wrong // place... _somebody_'s got to swap it, so this is nominated { float *AA = &A[n2-8]; float *d0,*d1, *e0, *e1; e0 = &v[n4]; e1 = &v[0]; d0 = &u[n4]; d1 = &u[0]; while (AA >= A) { float v40_20, v41_21; v41_21 = e0[1] - e1[1]; v40_20 = e0[0] - e1[0]; d0[1] = e0[1] + e1[1]; d0[0] = e0[0] + e1[0]; d1[1] = v41_21*AA[4] - v40_20*AA[5]; d1[0] = v40_20*AA[4] + v41_21*AA[5]; v41_21 = e0[3] - e1[3]; v40_20 = e0[2] - e1[2]; d0[3] = e0[3] + e1[3]; d0[2] = e0[2] + e1[2]; d1[3] = v41_21*AA[0] - v40_20*AA[1]; d1[2] = v40_20*AA[0] + v41_21*AA[1]; AA -= 8; d0 += 4; d1 += 4; e0 += 4; e1 += 4; } } // step 3 ld = ilog(n) - 1; // ilog is off-by-one from normal definitions // optimized step 3: // the original step3 loop can be nested r inside s or s inside r; // it's written originally as s inside r, but this is dumb when r // iterates many times, and s few. So I have two copies of it and // switch between them halfway. // this is iteration 0 of step 3 imdct_step3_iter0_loop(n >> 4, u, n2-1-n4*0, -(n >> 3), A); imdct_step3_iter0_loop(n >> 4, u, n2-1-n4*1, -(n >> 3), A); // this is iteration 1 of step 3 imdct_step3_inner_r_loop(n >> 5, u, n2-1 - n8*0, -(n >> 4), A, 16); imdct_step3_inner_r_loop(n >> 5, u, n2-1 - n8*1, -(n >> 4), A, 16); imdct_step3_inner_r_loop(n >> 5, u, n2-1 - n8*2, -(n >> 4), A, 16); imdct_step3_inner_r_loop(n >> 5, u, n2-1 - n8*3, -(n >> 4), A, 16); l=2; for (; l < (ld-3)>>1; ++l) { int k0 = n >> (l+2), k0_2 = k0>>1; int lim = 1 << (l+1); int i; for (i=0; i < lim; ++i) imdct_step3_inner_r_loop(n >> (l+4), u, n2-1 - k0*i, -k0_2, A, 1 << (l+3)); } for (; l < ld-6; ++l) { int k0 = n >> (l+2), k1 = 1 << (l+3), k0_2 = k0>>1; int rlim = n >> (l+6), r; int lim = 1 << (l+1); int i_off; float *A0 = A; i_off = n2-1; for (r=rlim; r > 0; --r) { imdct_step3_inner_s_loop(lim, u, i_off, -k0_2, A0, k1, k0); A0 += k1*4; i_off -= 8; } } // iterations with count: // ld-6,-5,-4 all interleaved together // the big win comes from getting rid of needless flops // due to the constants on pass 5 & 4 being all 1 and 0; // combining them to be simultaneous to improve cache made little difference imdct_step3_inner_s_loop_ld654(n >> 5, u, n2-1, A, n); // output is u // step 4, 5, and 6 // cannot be in-place because of step 5 { uint16 *bitrev = f->bit_reverse[blocktype]; // weirdly, I'd have thought reading sequentially and writing // erratically would have been better than vice-versa, but in // fact that's not what my testing showed. (That is, with // j = bitreverse(i), do you read i and write j, or read j and write i.) float *d0 = &v[n4-4]; float *d1 = &v[n2-4]; while (d0 >= v) { int k4; k4 = bitrev[0]; d1[3] = u[k4+0]; d1[2] = u[k4+1]; d0[3] = u[k4+2]; d0[2] = u[k4+3]; k4 = bitrev[1]; d1[1] = u[k4+0]; d1[0] = u[k4+1]; d0[1] = u[k4+2]; d0[0] = u[k4+3]; d0 -= 4; d1 -= 4; bitrev += 2; } } // (paper output is u, now v) // data must be in buf2 assert(v == buf2); // step 7 (paper output is v, now v) // this is now in place { float *C = f->C[blocktype]; float *d, *e; d = v; e = v + n2 - 4; while (d < e) { float a02,a11,b0,b1,b2,b3; a02 = d[0] - e[2]; a11 = d[1] + e[3]; b0 = C[1]*a02 + C[0]*a11; b1 = C[1]*a11 - C[0]*a02; b2 = d[0] + e[ 2]; b3 = d[1] - e[ 3]; d[0] = b2 + b0; d[1] = b3 + b1; e[2] = b2 - b0; e[3] = b1 - b3; a02 = d[2] - e[0]; a11 = d[3] + e[1]; b0 = C[3]*a02 + C[2]*a11; b1 = C[3]*a11 - C[2]*a02; b2 = d[2] + e[ 0]; b3 = d[3] - e[ 1]; d[2] = b2 + b0; d[3] = b3 + b1; e[0] = b2 - b0; e[1] = b1 - b3; C += 4; d += 4; e -= 4; } } // data must be in buf2 // step 8+decode (paper output is X, now buffer) // this generates pairs of data a la 8 and pushes them directly through // the decode kernel (pushing rather than pulling) to avoid having // to make another pass later // this cannot POSSIBLY be in place, so we refer to the buffers directly { float *d0,*d1,*d2,*d3; float *B = f->B[blocktype] + n2 - 8; float *e = buf2 + n2 - 8; d0 = &buffer[0]; d1 = &buffer[n2-4]; d2 = &buffer[n2]; d3 = &buffer[n-4]; while (e >= v) { float p0,p1,p2,p3; p3 = e[6]*B[7] - e[7]*B[6]; p2 = -e[6]*B[6] - e[7]*B[7]; d0[0] = p3; d1[3] = - p3; d2[0] = p2; d3[3] = p2; p1 = e[4]*B[5] - e[5]*B[4]; p0 = -e[4]*B[4] - e[5]*B[5]; d0[1] = p1; d1[2] = - p1; d2[1] = p0; d3[2] = p0; p3 = e[2]*B[3] - e[3]*B[2]; p2 = -e[2]*B[2] - e[3]*B[3]; d0[2] = p3; d1[1] = - p3; d2[2] = p2; d3[1] = p2; p1 = e[0]*B[1] - e[1]*B[0]; p0 = -e[0]*B[0] - e[1]*B[1]; d0[3] = p1; d1[0] = - p1; d2[3] = p0; d3[0] = p0; B -= 8; e -= 8; d0 += 4; d2 += 4; d1 -= 4; d3 -= 4; } } temp_free(f,buf2); temp_alloc_restore(f,save_point); } #if 0 // this is the original version of the above code, if you want to optimize it from scratch void inverse_mdct_naive(float *buffer, int n) { float s; float A[1 << 12], B[1 << 12], C[1 << 11]; int i,k,k2,k4, n2 = n >> 1, n4 = n >> 2, n8 = n >> 3, l; int n3_4 = n - n4, ld; // how can they claim this only uses N words?! // oh, because they're only used sparsely, whoops float u[1 << 13], X[1 << 13], v[1 << 13], w[1 << 13]; // set up twiddle factors for (k=k2=0; k < n4; ++k,k2+=2) { A[k2 ] = (float) cos(4*k*M_PI/n); A[k2+1] = (float) -sin(4*k*M_PI/n); B[k2 ] = (float) cos((k2+1)*M_PI/n/2); B[k2+1] = (float) sin((k2+1)*M_PI/n/2); } for (k=k2=0; k < n8; ++k,k2+=2) { C[k2 ] = (float) cos(2*(k2+1)*M_PI/n); C[k2+1] = (float) -sin(2*(k2+1)*M_PI/n); } // IMDCT algorithm from "The use of multirate filter banks for coding of high quality digital audio" // Note there are bugs in that pseudocode, presumably due to them attempting // to rename the arrays nicely rather than representing the way their actual // implementation bounces buffers back and forth. As a result, even in the // "some formulars corrected" version, a direct implementation fails. These // are noted below as "paper bug". // copy and reflect spectral data for (k=0; k < n2; ++k) u[k] = buffer[k]; for ( ; k < n ; ++k) u[k] = -buffer[n - k - 1]; // kernel from paper // step 1 for (k=k2=k4=0; k < n4; k+=1, k2+=2, k4+=4) { v[n-k4-1] = (u[k4] - u[n-k4-1]) * A[k2] - (u[k4+2] - u[n-k4-3])*A[k2+1]; v[n-k4-3] = (u[k4] - u[n-k4-1]) * A[k2+1] + (u[k4+2] - u[n-k4-3])*A[k2]; } // step 2 for (k=k4=0; k < n8; k+=1, k4+=4) { w[n2+3+k4] = v[n2+3+k4] + v[k4+3]; w[n2+1+k4] = v[n2+1+k4] + v[k4+1]; w[k4+3] = (v[n2+3+k4] - v[k4+3])*A[n2-4-k4] - (v[n2+1+k4]-v[k4+1])*A[n2-3-k4]; w[k4+1] = (v[n2+1+k4] - v[k4+1])*A[n2-4-k4] + (v[n2+3+k4]-v[k4+3])*A[n2-3-k4]; } // step 3 ld = ilog(n) - 1; // ilog is off-by-one from normal definitions for (l=0; l < ld-3; ++l) { int k0 = n >> (l+2), k1 = 1 << (l+3); int rlim = n >> (l+4), r4, r; int s2lim = 1 << (l+2), s2; for (r=r4=0; r < rlim; r4+=4,++r) { for (s2=0; s2 < s2lim; s2+=2) { u[n-1-k0*s2-r4] = w[n-1-k0*s2-r4] + w[n-1-k0*(s2+1)-r4]; u[n-3-k0*s2-r4] = w[n-3-k0*s2-r4] + w[n-3-k0*(s2+1)-r4]; u[n-1-k0*(s2+1)-r4] = (w[n-1-k0*s2-r4] - w[n-1-k0*(s2+1)-r4]) * A[r*k1] - (w[n-3-k0*s2-r4] - w[n-3-k0*(s2+1)-r4]) * A[r*k1+1]; u[n-3-k0*(s2+1)-r4] = (w[n-3-k0*s2-r4] - w[n-3-k0*(s2+1)-r4]) * A[r*k1] + (w[n-1-k0*s2-r4] - w[n-1-k0*(s2+1)-r4]) * A[r*k1+1]; } } if (l+1 < ld-3) { // paper bug: ping-ponging of u&w here is omitted memcpy(w, u, sizeof(u)); } } // step 4 for (i=0; i < n8; ++i) { int j = bit_reverse(i) >> (32-ld+3); assert(j < n8); if (i == j) { // paper bug: original code probably swapped in place; if copying, // need to directly copy in this case int i8 = i << 3; v[i8+1] = u[i8+1]; v[i8+3] = u[i8+3]; v[i8+5] = u[i8+5]; v[i8+7] = u[i8+7]; } else if (i < j) { int i8 = i << 3, j8 = j << 3; v[j8+1] = u[i8+1], v[i8+1] = u[j8 + 1]; v[j8+3] = u[i8+3], v[i8+3] = u[j8 + 3]; v[j8+5] = u[i8+5], v[i8+5] = u[j8 + 5]; v[j8+7] = u[i8+7], v[i8+7] = u[j8 + 7]; } } // step 5 for (k=0; k < n2; ++k) { w[k] = v[k*2+1]; } // step 6 for (k=k2=k4=0; k < n8; ++k, k2 += 2, k4 += 4) { u[n-1-k2] = w[k4]; u[n-2-k2] = w[k4+1]; u[n3_4 - 1 - k2] = w[k4+2]; u[n3_4 - 2 - k2] = w[k4+3]; } // step 7 for (k=k2=0; k < n8; ++k, k2 += 2) { v[n2 + k2 ] = ( u[n2 + k2] + u[n-2-k2] + C[k2+1]*(u[n2+k2]-u[n-2-k2]) + C[k2]*(u[n2+k2+1]+u[n-2-k2+1]))/2; v[n-2 - k2] = ( u[n2 + k2] + u[n-2-k2] - C[k2+1]*(u[n2+k2]-u[n-2-k2]) - C[k2]*(u[n2+k2+1]+u[n-2-k2+1]))/2; v[n2+1+ k2] = ( u[n2+1+k2] - u[n-1-k2] + C[k2+1]*(u[n2+1+k2]+u[n-1-k2]) - C[k2]*(u[n2+k2]-u[n-2-k2]))/2; v[n-1 - k2] = (-u[n2+1+k2] + u[n-1-k2] + C[k2+1]*(u[n2+1+k2]+u[n-1-k2]) - C[k2]*(u[n2+k2]-u[n-2-k2]))/2; } // step 8 for (k=k2=0; k < n4; ++k,k2 += 2) { X[k] = v[k2+n2]*B[k2 ] + v[k2+1+n2]*B[k2+1]; X[n2-1-k] = v[k2+n2]*B[k2+1] - v[k2+1+n2]*B[k2 ]; } // decode kernel to output // determined the following value experimentally // (by first figuring out what made inverse_mdct_slow work); then matching that here // (probably vorbis encoder premultiplies by n or n/2, to save it on the decoder?) s = 0.5; // theoretically would be n4 // [[[ note! the s value of 0.5 is compensated for by the B[] in the current code, // so it needs to use the "old" B values to behave correctly, or else // set s to 1.0 ]]] for (i=0; i < n4 ; ++i) buffer[i] = s * X[i+n4]; for ( ; i < n3_4; ++i) buffer[i] = -s * X[n3_4 - i - 1]; for ( ; i < n ; ++i) buffer[i] = -s * X[i - n3_4]; } #endif static float *get_window(vorb *f, int len) { len <<= 1; if (len == f->blocksize_0) return f->window[0]; if (len == f->blocksize_1) return f->window[1]; assert(0); return NULL; } #ifndef STB_VORBIS_NO_DEFER_FLOOR typedef int16 YTYPE; #else typedef int YTYPE; #endif static int do_floor(vorb *f, Mapping *map, int i, int n, float *target, YTYPE *finalY, uint8 *step2_flag) { int n2 = n >> 1; int s = map->chan[i].mux, floor; floor = map->submap_floor[s]; if (f->floor_types[floor] == 0) { return error(f, VORBIS_invalid_stream); } else { Floor1 *g = &f->floor_config[floor].floor1; int j,q; int lx = 0, ly = finalY[0] * g->floor1_multiplier; for (q=1; q < g->values; ++q) { j = g->sorted_order[q]; #ifndef STB_VORBIS_NO_DEFER_FLOOR if (finalY[j] >= 0) #else if (step2_flag[j]) #endif { int hy = finalY[j] * g->floor1_multiplier; int hx = g->Xlist[j]; if (lx != hx) draw_line(target, lx,ly, hx,hy, n2); CHECK(f); lx = hx, ly = hy; } } if (lx < n2) { // optimization of: draw_line(target, lx,ly, n,ly, n2); for (j=lx; j < n2; ++j) LINE_OP(target[j], inverse_db_table[ly]); CHECK(f); } } return TRUE; } // The meaning of "left" and "right" // // For a given frame: // we compute samples from 0..n // window_center is n/2 // we'll window and mix the samples from left_start to left_end with data from the previous frame // all of the samples from left_end to right_start can be output without mixing; however, // this interval is 0-length except when transitioning between short and long frames // all of the samples from right_start to right_end need to be mixed with the next frame, // which we don't have, so those get saved in a buffer // frame N's right_end-right_start, the number of samples to mix with the next frame, // has to be the same as frame N+1's left_end-left_start (which they are by // construction) static int vorbis_decode_initial(vorb *f, int *p_left_start, int *p_left_end, int *p_right_start, int *p_right_end, int *mode) { Mode *m; int i, n, prev, next, window_center; f->channel_buffer_start = f->channel_buffer_end = 0; retry: if (f->eof) return FALSE; if (!maybe_start_packet(f)) return FALSE; // check packet type if (get_bits(f,1) != 0) { if (IS_PUSH_MODE(f)) return error(f,VORBIS_bad_packet_type); while (EOP != get8_packet(f)); goto retry; } if (f->alloc.alloc_buffer) assert(f->alloc.alloc_buffer_length_in_bytes == f->temp_offset); i = get_bits(f, ilog(f->mode_count-1)); if (i == EOP) return FALSE; if (i >= f->mode_count) return FALSE; *mode = i; m = f->mode_config + i; if (m->blockflag) { n = f->blocksize_1; prev = get_bits(f,1); next = get_bits(f,1); } else { prev = next = 0; n = f->blocksize_0; } // WINDOWING window_center = n >> 1; if (m->blockflag && !prev) { *p_left_start = (n - f->blocksize_0) >> 2; *p_left_end = (n + f->blocksize_0) >> 2; } else { *p_left_start = 0; *p_left_end = window_center; } if (m->blockflag && !next) { *p_right_start = (n*3 - f->blocksize_0) >> 2; *p_right_end = (n*3 + f->blocksize_0) >> 2; } else { *p_right_start = window_center; *p_right_end = n; } return TRUE; } static int vorbis_decode_packet_rest(vorb *f, int *len, Mode *m, int left_start, int left_end, int right_start, int right_end, int *p_left) { Mapping *map; int i,j,k,n,n2; int zero_channel[256]; int really_zero_channel[256]; // WINDOWING n = f->blocksize[m->blockflag]; map = &f->mapping[m->mapping]; // FLOORS n2 = n >> 1; CHECK(f); for (i=0; i < f->channels; ++i) { int s = map->chan[i].mux, floor; zero_channel[i] = FALSE; floor = map->submap_floor[s]; if (f->floor_types[floor] == 0) { return error(f, VORBIS_invalid_stream); } else { Floor1 *g = &f->floor_config[floor].floor1; if (get_bits(f, 1)) { short *finalY; uint8 step2_flag[256]; static int range_list[4] = { 256, 128, 86, 64 }; int range = range_list[g->floor1_multiplier-1]; int offset = 2; finalY = f->finalY[i]; finalY[0] = get_bits(f, ilog(range)-1); finalY[1] = get_bits(f, ilog(range)-1); for (j=0; j < g->partitions; ++j) { int pclass = g->partition_class_list[j]; int cdim = g->class_dimensions[pclass]; int cbits = g->class_subclasses[pclass]; int csub = (1 << cbits)-1; int cval = 0; if (cbits) { Codebook *c = f->codebooks + g->class_masterbooks[pclass]; DECODE(cval,f,c); } for (k=0; k < cdim; ++k) { int book = g->subclass_books[pclass][cval & csub]; cval = cval >> cbits; if (book >= 0) { int temp; Codebook *c = f->codebooks + book; DECODE(temp,f,c); finalY[offset++] = temp; } else finalY[offset++] = 0; } } if (f->valid_bits == INVALID_BITS) goto error; // behavior according to spec step2_flag[0] = step2_flag[1] = 1; for (j=2; j < g->values; ++j) { int low, high, pred, highroom, lowroom, room, val; low = g->neighbors[j][0]; high = g->neighbors[j][1]; //neighbors(g->Xlist, j, &low, &high); pred = predict_point(g->Xlist[j], g->Xlist[low], g->Xlist[high], finalY[low], finalY[high]); val = finalY[j]; highroom = range - pred; lowroom = pred; if (highroom < lowroom) room = highroom * 2; else room = lowroom * 2; if (val) { step2_flag[low] = step2_flag[high] = 1; step2_flag[j] = 1; if (val >= room) if (highroom > lowroom) finalY[j] = val - lowroom + pred; else finalY[j] = pred - val + highroom - 1; else if (val & 1) finalY[j] = pred - ((val+1)>>1); else finalY[j] = pred + (val>>1); } else { step2_flag[j] = 0; finalY[j] = pred; } } #ifdef STB_VORBIS_NO_DEFER_FLOOR do_floor(f, map, i, n, f->floor_buffers[i], finalY, step2_flag); #else // defer final floor computation until _after_ residue for (j=0; j < g->values; ++j) { if (!step2_flag[j]) finalY[j] = -1; } #endif } else { error: zero_channel[i] = TRUE; } // So we just defer everything else to later // at this point we've decoded the floor into buffer } } CHECK(f); // at this point we've decoded all floors if (f->alloc.alloc_buffer) assert(f->alloc.alloc_buffer_length_in_bytes == f->temp_offset); // re-enable coupled channels if necessary memcpy(really_zero_channel, zero_channel, sizeof(really_zero_channel[0]) * f->channels); for (i=0; i < map->coupling_steps; ++i) if (!zero_channel[map->chan[i].magnitude] || !zero_channel[map->chan[i].angle]) { zero_channel[map->chan[i].magnitude] = zero_channel[map->chan[i].angle] = FALSE; } CHECK(f); // RESIDUE DECODE for (i=0; i < map->submaps; ++i) { float *residue_buffers[STB_VORBIS_MAX_CHANNELS]; int r; uint8 do_not_decode[256]; int ch = 0; for (j=0; j < f->channels; ++j) { if (map->chan[j].mux == i) { if (zero_channel[j]) { do_not_decode[ch] = TRUE; residue_buffers[ch] = NULL; } else { do_not_decode[ch] = FALSE; residue_buffers[ch] = f->channel_buffers[j]; } ++ch; } } r = map->submap_residue[i]; decode_residue(f, residue_buffers, ch, n2, r, do_not_decode); } if (f->alloc.alloc_buffer) assert(f->alloc.alloc_buffer_length_in_bytes == f->temp_offset); CHECK(f); // INVERSE COUPLING for (i = map->coupling_steps-1; i >= 0; --i) { int n2 = n >> 1; float *m = f->channel_buffers[map->chan[i].magnitude]; float *a = f->channel_buffers[map->chan[i].angle ]; for (j=0; j < n2; ++j) { float a2,m2; if (m[j] > 0) if (a[j] > 0) m2 = m[j], a2 = m[j] - a[j]; else a2 = m[j], m2 = m[j] + a[j]; else if (a[j] > 0) m2 = m[j], a2 = m[j] + a[j]; else a2 = m[j], m2 = m[j] - a[j]; m[j] = m2; a[j] = a2; } } CHECK(f); // finish decoding the floors #ifndef STB_VORBIS_NO_DEFER_FLOOR for (i=0; i < f->channels; ++i) { if (really_zero_channel[i]) { memset(f->channel_buffers[i], 0, sizeof(*f->channel_buffers[i]) * n2); } else { do_floor(f, map, i, n, f->channel_buffers[i], f->finalY[i], NULL); } } #else for (i=0; i < f->channels; ++i) { if (really_zero_channel[i]) { memset(f->channel_buffers[i], 0, sizeof(*f->channel_buffers[i]) * n2); } else { for (j=0; j < n2; ++j) f->channel_buffers[i][j] *= f->floor_buffers[i][j]; } } #endif // INVERSE MDCT CHECK(f); for (i=0; i < f->channels; ++i) inverse_mdct(f->channel_buffers[i], n, f, m->blockflag); CHECK(f); // this shouldn't be necessary, unless we exited on an error // and want to flush to get to the next packet flush_packet(f); if (f->first_decode) { // assume we start so first non-discarded sample is sample 0 // this isn't to spec, but spec would require us to read ahead // and decode the size of all current frames--could be done, // but presumably it's not a commonly used feature f->current_loc = -n2; // start of first frame is positioned for discard // we might have to discard samples "from" the next frame too, // if we're lapping a large block then a small at the start? f->discard_samples_deferred = n - right_end; f->current_loc_valid = TRUE; f->first_decode = FALSE; } else if (f->discard_samples_deferred) { if (f->discard_samples_deferred >= right_start - left_start) { f->discard_samples_deferred -= (right_start - left_start); left_start = right_start; *p_left = left_start; } else { left_start += f->discard_samples_deferred; *p_left = left_start; f->discard_samples_deferred = 0; } } else if (f->previous_length == 0 && f->current_loc_valid) { // we're recovering from a seek... that means we're going to discard // the samples from this packet even though we know our position from // the last page header, so we need to update the position based on // the discarded samples here // but wait, the code below is going to add this in itself even // on a discard, so we don't need to do it here... } // check if we have ogg information about the sample # for this packet if (f->last_seg_which == f->end_seg_with_known_loc) { // if we have a valid current loc, and this is final: if (f->current_loc_valid && (f->page_flag & PAGEFLAG_last_page)) { uint32 current_end = f->known_loc_for_packet - (n-right_end); // then let's infer the size of the (probably) short final frame if (current_end < f->current_loc + (right_end-left_start)) { if (current_end < f->current_loc) { // negative truncation, that's impossible! *len = 0; } else { *len = current_end - f->current_loc; } *len += left_start; if (*len > right_end) *len = right_end; // this should never happen f->current_loc += *len; return TRUE; } } // otherwise, just set our sample loc // guess that the ogg granule pos refers to the _middle_ of the // last frame? // set f->current_loc to the position of left_start f->current_loc = f->known_loc_for_packet - (n2-left_start); f->current_loc_valid = TRUE; } if (f->current_loc_valid) f->current_loc += (right_start - left_start); if (f->alloc.alloc_buffer) assert(f->alloc.alloc_buffer_length_in_bytes == f->temp_offset); *len = right_end; // ignore samples after the window goes to 0 CHECK(f); return TRUE; } static int vorbis_decode_packet(vorb *f, int *len, int *p_left, int *p_right) { int mode, left_end, right_end; if (!vorbis_decode_initial(f, p_left, &left_end, p_right, &right_end, &mode)) return 0; return vorbis_decode_packet_rest(f, len, f->mode_config + mode, *p_left, left_end, *p_right, right_end, p_left); } static int vorbis_finish_frame(stb_vorbis *f, int len, int left, int right) { int prev,i,j; // we use right&left (the start of the right- and left-window sin()-regions) // to determine how much to return, rather than inferring from the rules // (same result, clearer code); 'left' indicates where our sin() window // starts, therefore where the previous window's right edge starts, and // therefore where to start mixing from the previous buffer. 'right' // indicates where our sin() ending-window starts, therefore that's where // we start saving, and where our returned-data ends. // mixin from previous window if (f->previous_length) { int i,j, n = f->previous_length; float *w = get_window(f, n); for (i=0; i < f->channels; ++i) { for (j=0; j < n; ++j) f->channel_buffers[i][left+j] = f->channel_buffers[i][left+j]*w[ j] + f->previous_window[i][ j]*w[n-1-j]; } } prev = f->previous_length; // last half of this data becomes previous window f->previous_length = len - right; // @OPTIMIZE: could avoid this copy by double-buffering the // output (flipping previous_window with channel_buffers), but // then previous_window would have to be 2x as large, and // channel_buffers couldn't be temp mem (although they're NOT // currently temp mem, they could be (unless we want to level // performance by spreading out the computation)) for (i=0; i < f->channels; ++i) for (j=0; right+j < len; ++j) f->previous_window[i][j] = f->channel_buffers[i][right+j]; if (!prev) // there was no previous packet, so this data isn't valid... // this isn't entirely true, only the would-have-overlapped data // isn't valid, but this seems to be what the spec requires return 0; // truncate a short frame if (len < right) right = len; f->samples_output += right-left; return right - left; } static int vorbis_pump_first_frame(stb_vorbis *f) { int len, right, left, res; res = vorbis_decode_packet(f, &len, &left, &right); if (res) vorbis_finish_frame(f, len, left, right); return res; } #ifndef STB_VORBIS_NO_PUSHDATA_API static int is_whole_packet_present(stb_vorbis *f, int end_page) { // make sure that we have the packet available before continuing... // this requires a full ogg parse, but we know we can fetch from f->stream // instead of coding this out explicitly, we could save the current read state, // read the next packet with get8() until end-of-packet, check f->eof, then // reset the state? but that would be slower, esp. since we'd have over 256 bytes // of state to restore (primarily the page segment table) int s = f->next_seg, first = TRUE; uint8 *p = f->stream; if (s != -1) { // if we're not starting the packet with a 'continue on next page' flag for (; s < f->segment_count; ++s) { p += f->segments[s]; if (f->segments[s] < 255) // stop at first short segment break; } // either this continues, or it ends it... if (end_page) if (s < f->segment_count-1) return error(f, VORBIS_invalid_stream); if (s == f->segment_count) s = -1; // set 'crosses page' flag if (p > f->stream_end) return error(f, VORBIS_need_more_data); first = FALSE; } for (; s == -1;) { uint8 *q; int n; // check that we have the page header ready if (p + 26 >= f->stream_end) return error(f, VORBIS_need_more_data); // validate the page if (memcmp(p, ogg_page_header, 4)) return error(f, VORBIS_invalid_stream); if (p[4] != 0) return error(f, VORBIS_invalid_stream); if (first) { // the first segment must NOT have 'continued_packet', later ones MUST if (f->previous_length) if ((p[5] & PAGEFLAG_continued_packet)) return error(f, VORBIS_invalid_stream); // if no previous length, we're resynching, so we can come in on a continued-packet, // which we'll just drop } else { if (!(p[5] & PAGEFLAG_continued_packet)) return error(f, VORBIS_invalid_stream); } n = p[26]; // segment counts q = p+27; // q points to segment table p = q + n; // advance past header // make sure we've read the segment table if (p > f->stream_end) return error(f, VORBIS_need_more_data); for (s=0; s < n; ++s) { p += q[s]; if (q[s] < 255) break; } if (end_page) if (s < n-1) return error(f, VORBIS_invalid_stream); if (s == n) s = -1; // set 'crosses page' flag if (p > f->stream_end) return error(f, VORBIS_need_more_data); first = FALSE; } return TRUE; } #endif // !STB_VORBIS_NO_PUSHDATA_API static int start_decoder(vorb *f) { uint8 header[6], x,y; int len,i,j,k, max_submaps = 0; int longest_floorlist=0; // first page, first packet if (!start_page(f)) return FALSE; // validate page flag if (!(f->page_flag & PAGEFLAG_first_page)) return error(f, VORBIS_invalid_first_page); if (f->page_flag & PAGEFLAG_last_page) return error(f, VORBIS_invalid_first_page); if (f->page_flag & PAGEFLAG_continued_packet) return error(f, VORBIS_invalid_first_page); // check for expected packet length if (f->segment_count != 1) return error(f, VORBIS_invalid_first_page); if (f->segments[0] != 30) return error(f, VORBIS_invalid_first_page); // read packet // check packet header if (get8(f) != VORBIS_packet_id) return error(f, VORBIS_invalid_first_page); if (!getn(f, header, 6)) return error(f, VORBIS_unexpected_eof); if (!vorbis_validate(header)) return error(f, VORBIS_invalid_first_page); // vorbis_version if (get32(f) != 0) return error(f, VORBIS_invalid_first_page); f->channels = get8(f); if (!f->channels) return error(f, VORBIS_invalid_first_page); if (f->channels > STB_VORBIS_MAX_CHANNELS) return error(f, VORBIS_too_many_channels); f->sample_rate = get32(f); if (!f->sample_rate) return error(f, VORBIS_invalid_first_page); get32(f); // bitrate_maximum get32(f); // bitrate_nominal get32(f); // bitrate_minimum x = get8(f); { int log0,log1; log0 = x & 15; log1 = x >> 4; f->blocksize_0 = 1 << log0; f->blocksize_1 = 1 << log1; if (log0 < 6 || log0 > 13) return error(f, VORBIS_invalid_setup); if (log1 < 6 || log1 > 13) return error(f, VORBIS_invalid_setup); if (log0 > log1) return error(f, VORBIS_invalid_setup); } // framing_flag x = get8(f); if (!(x & 1)) return error(f, VORBIS_invalid_first_page); // second packet! if (!start_page(f)) return FALSE; if (!start_packet(f)) return FALSE; do { len = next_segment(f); skip(f, len); f->bytes_in_seg = 0; } while (len); // third packet! if (!start_packet(f)) return FALSE; #ifndef STB_VORBIS_NO_PUSHDATA_API if (IS_PUSH_MODE(f)) { if (!is_whole_packet_present(f, TRUE)) { // convert error in ogg header to write type if (f->error == VORBIS_invalid_stream) f->error = VORBIS_invalid_setup; return FALSE; } } #endif crc32_init(); // always init it, to avoid multithread race conditions if (get8_packet(f) != VORBIS_packet_setup) return error(f, VORBIS_invalid_setup); for (i=0; i < 6; ++i) header[i] = get8_packet(f); if (!vorbis_validate(header)) return error(f, VORBIS_invalid_setup); // codebooks f->codebook_count = get_bits(f,8) + 1; f->codebooks = (Codebook *) setup_malloc(f, sizeof(*f->codebooks) * f->codebook_count); if (f->codebooks == NULL) return error(f, VORBIS_outofmem); memset(f->codebooks, 0, sizeof(*f->codebooks) * f->codebook_count); for (i=0; i < f->codebook_count; ++i) { uint32 *values; int ordered, sorted_count; int total=0; uint8 *lengths; Codebook *c = f->codebooks+i; CHECK(f); x = get_bits(f, 8); if (x != 0x42) return error(f, VORBIS_invalid_setup); x = get_bits(f, 8); if (x != 0x43) return error(f, VORBIS_invalid_setup); x = get_bits(f, 8); if (x != 0x56) return error(f, VORBIS_invalid_setup); x = get_bits(f, 8); c->dimensions = (get_bits(f, 8)<<8) + x; x = get_bits(f, 8); y = get_bits(f, 8); c->entries = (get_bits(f, 8)<<16) + (y<<8) + x; ordered = get_bits(f,1); c->sparse = ordered ? 0 : get_bits(f,1); if (c->dimensions == 0 && c->entries != 0) return error(f, VORBIS_invalid_setup); if (c->sparse) lengths = (uint8 *) setup_temp_malloc(f, c->entries); else lengths = c->codeword_lengths = (uint8 *) setup_malloc(f, c->entries); if (!lengths) return error(f, VORBIS_outofmem); if (ordered) { int current_entry = 0; int current_length = get_bits(f,5) + 1; while (current_entry < c->entries) { int limit = c->entries - current_entry; int n = get_bits(f, ilog(limit)); if (current_entry + n > (int) c->entries) { return error(f, VORBIS_invalid_setup); } memset(lengths + current_entry, current_length, n); current_entry += n; ++current_length; } } else { for (j=0; j < c->entries; ++j) { int present = c->sparse ? get_bits(f,1) : 1; if (present) { lengths[j] = get_bits(f, 5) + 1; ++total; if (lengths[j] == 32) return error(f, VORBIS_invalid_setup); } else { lengths[j] = NO_CODE; } } } if (c->sparse && total >= c->entries >> 2) { // convert sparse items to non-sparse! if (c->entries > (int) f->setup_temp_memory_required) f->setup_temp_memory_required = c->entries; c->codeword_lengths = (uint8 *) setup_malloc(f, c->entries); if (c->codeword_lengths == NULL) return error(f, VORBIS_outofmem); memcpy(c->codeword_lengths, lengths, c->entries); setup_temp_free(f, lengths, c->entries); // note this is only safe if there have been no intervening temp mallocs! lengths = c->codeword_lengths; c->sparse = 0; } // compute the size of the sorted tables if (c->sparse) { sorted_count = total; } else { sorted_count = 0; #ifndef STB_VORBIS_NO_HUFFMAN_BINARY_SEARCH for (j=0; j < c->entries; ++j) if (lengths[j] > STB_VORBIS_FAST_HUFFMAN_LENGTH && lengths[j] != NO_CODE) ++sorted_count; #endif } c->sorted_entries = sorted_count; values = NULL; CHECK(f); if (!c->sparse) { c->codewords = (uint32 *) setup_malloc(f, sizeof(c->codewords[0]) * c->entries); if (!c->codewords) return error(f, VORBIS_outofmem); } else { unsigned int size; if (c->sorted_entries) { c->codeword_lengths = (uint8 *) setup_malloc(f, c->sorted_entries); if (!c->codeword_lengths) return error(f, VORBIS_outofmem); c->codewords = (uint32 *) setup_temp_malloc(f, sizeof(*c->codewords) * c->sorted_entries); if (!c->codewords) return error(f, VORBIS_outofmem); values = (uint32 *) setup_temp_malloc(f, sizeof(*values) * c->sorted_entries); if (!values) return error(f, VORBIS_outofmem); } size = c->entries + (sizeof(*c->codewords) + sizeof(*values)) * c->sorted_entries; if (size > f->setup_temp_memory_required) f->setup_temp_memory_required = size; } if (!compute_codewords(c, lengths, c->entries, values)) { if (c->sparse) setup_temp_free(f, values, 0); return error(f, VORBIS_invalid_setup); } if (c->sorted_entries) { // allocate an extra slot for sentinels c->sorted_codewords = (uint32 *) setup_malloc(f, sizeof(*c->sorted_codewords) * (c->sorted_entries+1)); if (c->sorted_codewords == NULL) return error(f, VORBIS_outofmem); // allocate an extra slot at the front so that c->sorted_values[-1] is defined // so that we can catch that case without an extra if c->sorted_values = ( int *) setup_malloc(f, sizeof(*c->sorted_values ) * (c->sorted_entries+1)); if (c->sorted_values == NULL) return error(f, VORBIS_outofmem); ++c->sorted_values; c->sorted_values[-1] = -1; compute_sorted_huffman(c, lengths, values); } if (c->sparse) { setup_temp_free(f, values, sizeof(*values)*c->sorted_entries); setup_temp_free(f, c->codewords, sizeof(*c->codewords)*c->sorted_entries); setup_temp_free(f, lengths, c->entries); c->codewords = NULL; } compute_accelerated_huffman(c); CHECK(f); c->lookup_type = get_bits(f, 4); if (c->lookup_type > 2) return error(f, VORBIS_invalid_setup); if (c->lookup_type > 0) { uint16 *mults; c->minimum_value = float32_unpack(get_bits(f, 32)); c->delta_value = float32_unpack(get_bits(f, 32)); c->value_bits = get_bits(f, 4)+1; c->sequence_p = get_bits(f,1); if (c->lookup_type == 1) { c->lookup_values = lookup1_values(c->entries, c->dimensions); } else { c->lookup_values = c->entries * c->dimensions; } if (c->lookup_values == 0) return error(f, VORBIS_invalid_setup); mults = (uint16 *) setup_temp_malloc(f, sizeof(mults[0]) * c->lookup_values); if (mults == NULL) return error(f, VORBIS_outofmem); for (j=0; j < (int) c->lookup_values; ++j) { int q = get_bits(f, c->value_bits); if (q == EOP) { setup_temp_free(f,mults,sizeof(mults[0])*c->lookup_values); return error(f, VORBIS_invalid_setup); } mults[j] = q; } #ifndef STB_VORBIS_DIVIDES_IN_CODEBOOK if (c->lookup_type == 1) { int len, sparse = c->sparse; float last=0; // pre-expand the lookup1-style multiplicands, to avoid a divide in the inner loop if (sparse) { if (c->sorted_entries == 0) goto skip; c->multiplicands = (codetype *) setup_malloc(f, sizeof(c->multiplicands[0]) * c->sorted_entries * c->dimensions); } else c->multiplicands = (codetype *) setup_malloc(f, sizeof(c->multiplicands[0]) * c->entries * c->dimensions); if (c->multiplicands == NULL) { setup_temp_free(f,mults,sizeof(mults[0])*c->lookup_values); return error(f, VORBIS_outofmem); } len = sparse ? c->sorted_entries : c->entries; for (j=0; j < len; ++j) { unsigned int z = sparse ? c->sorted_values[j] : j; unsigned int div=1; for (k=0; k < c->dimensions; ++k) { int off = (z / div) % c->lookup_values; float val = mults[off]; val = mults[off]*c->delta_value + c->minimum_value + last; c->multiplicands[j*c->dimensions + k] = val; if (c->sequence_p) last = val; if (k+1 < c->dimensions) { if (div > UINT_MAX / (unsigned int) c->lookup_values) { setup_temp_free(f, mults,sizeof(mults[0])*c->lookup_values); return error(f, VORBIS_invalid_setup); } div *= c->lookup_values; } } } c->lookup_type = 2; } else #endif { float last=0; CHECK(f); c->multiplicands = (codetype *) setup_malloc(f, sizeof(c->multiplicands[0]) * c->lookup_values); if (c->multiplicands == NULL) { setup_temp_free(f, mults,sizeof(mults[0])*c->lookup_values); return error(f, VORBIS_outofmem); } for (j=0; j < (int) c->lookup_values; ++j) { float val = mults[j] * c->delta_value + c->minimum_value + last; c->multiplicands[j] = val; if (c->sequence_p) last = val; } } #ifndef STB_VORBIS_DIVIDES_IN_CODEBOOK skip:; #endif setup_temp_free(f, mults, sizeof(mults[0])*c->lookup_values); CHECK(f); } CHECK(f); } // time domain transfers (notused) x = get_bits(f, 6) + 1; for (i=0; i < x; ++i) { uint32 z = get_bits(f, 16); if (z != 0) return error(f, VORBIS_invalid_setup); } // Floors f->floor_count = get_bits(f, 6)+1; f->floor_config = (Floor *) setup_malloc(f, f->floor_count * sizeof(*f->floor_config)); if (f->floor_config == NULL) return error(f, VORBIS_outofmem); for (i=0; i < f->floor_count; ++i) { f->floor_types[i] = get_bits(f, 16); if (f->floor_types[i] > 1) return error(f, VORBIS_invalid_setup); if (f->floor_types[i] == 0) { Floor0 *g = &f->floor_config[i].floor0; g->order = get_bits(f,8); g->rate = get_bits(f,16); g->bark_map_size = get_bits(f,16); g->amplitude_bits = get_bits(f,6); g->amplitude_offset = get_bits(f,8); g->number_of_books = get_bits(f,4) + 1; for (j=0; j < g->number_of_books; ++j) g->book_list[j] = get_bits(f,8); return error(f, VORBIS_feature_not_supported); } else { stbv__floor_ordering p[31*8+2]; Floor1 *g = &f->floor_config[i].floor1; int max_class = -1; g->partitions = get_bits(f, 5); for (j=0; j < g->partitions; ++j) { g->partition_class_list[j] = get_bits(f, 4); if (g->partition_class_list[j] > max_class) max_class = g->partition_class_list[j]; } for (j=0; j <= max_class; ++j) { g->class_dimensions[j] = get_bits(f, 3)+1; g->class_subclasses[j] = get_bits(f, 2); if (g->class_subclasses[j]) { g->class_masterbooks[j] = get_bits(f, 8); if (g->class_masterbooks[j] >= f->codebook_count) return error(f, VORBIS_invalid_setup); } for (k=0; k < 1 << g->class_subclasses[j]; ++k) { g->subclass_books[j][k] = get_bits(f,8)-1; if (g->subclass_books[j][k] >= f->codebook_count) return error(f, VORBIS_invalid_setup); } } g->floor1_multiplier = get_bits(f,2)+1; g->rangebits = get_bits(f,4); g->Xlist[0] = 0; g->Xlist[1] = 1 << g->rangebits; g->values = 2; for (j=0; j < g->partitions; ++j) { int c = g->partition_class_list[j]; for (k=0; k < g->class_dimensions[c]; ++k) { g->Xlist[g->values] = get_bits(f, g->rangebits); ++g->values; } } // precompute the sorting for (j=0; j < g->values; ++j) { p[j].x = g->Xlist[j]; p[j].id = j; } qsort(p, g->values, sizeof(p[0]), point_compare); for (j=0; j < g->values; ++j) g->sorted_order[j] = (uint8) p[j].id; // precompute the neighbors for (j=2; j < g->values; ++j) { int low,hi; neighbors(g->Xlist, j, &low,&hi); g->neighbors[j][0] = low; g->neighbors[j][1] = hi; } if (g->values > longest_floorlist) longest_floorlist = g->values; } } // Residue f->residue_count = get_bits(f, 6)+1; f->residue_config = (Residue *) setup_malloc(f, f->residue_count * sizeof(f->residue_config[0])); if (f->residue_config == NULL) return error(f, VORBIS_outofmem); memset(f->residue_config, 0, f->residue_count * sizeof(f->residue_config[0])); for (i=0; i < f->residue_count; ++i) { uint8 residue_cascade[64]; Residue *r = f->residue_config+i; f->residue_types[i] = get_bits(f, 16); if (f->residue_types[i] > 2) return error(f, VORBIS_invalid_setup); r->begin = get_bits(f, 24); r->end = get_bits(f, 24); if (r->end < r->begin) return error(f, VORBIS_invalid_setup); r->part_size = get_bits(f,24)+1; r->classifications = get_bits(f,6)+1; r->classbook = get_bits(f,8); if (r->classbook >= f->codebook_count) return error(f, VORBIS_invalid_setup); for (j=0; j < r->classifications; ++j) { uint8 high_bits=0; uint8 low_bits=get_bits(f,3); if (get_bits(f,1)) high_bits = get_bits(f,5); residue_cascade[j] = high_bits*8 + low_bits; } r->residue_books = (short (*)[8]) setup_malloc(f, sizeof(r->residue_books[0]) * r->classifications); if (r->residue_books == NULL) return error(f, VORBIS_outofmem); for (j=0; j < r->classifications; ++j) { for (k=0; k < 8; ++k) { if (residue_cascade[j] & (1 << k)) { r->residue_books[j][k] = get_bits(f, 8); if (r->residue_books[j][k] >= f->codebook_count) return error(f, VORBIS_invalid_setup); } else { r->residue_books[j][k] = -1; } } } // precompute the classifications[] array to avoid inner-loop mod/divide // call it 'classdata' since we already have r->classifications r->classdata = (uint8 **) setup_malloc(f, sizeof(*r->classdata) * f->codebooks[r->classbook].entries); if (!r->classdata) return error(f, VORBIS_outofmem); memset(r->classdata, 0, sizeof(*r->classdata) * f->codebooks[r->classbook].entries); for (j=0; j < f->codebooks[r->classbook].entries; ++j) { int classwords = f->codebooks[r->classbook].dimensions; int temp = j; r->classdata[j] = (uint8 *) setup_malloc(f, sizeof(r->classdata[j][0]) * classwords); if (r->classdata[j] == NULL) return error(f, VORBIS_outofmem); for (k=classwords-1; k >= 0; --k) { r->classdata[j][k] = temp % r->classifications; temp /= r->classifications; } } } f->mapping_count = get_bits(f,6)+1; f->mapping = (Mapping *) setup_malloc(f, f->mapping_count * sizeof(*f->mapping)); if (f->mapping == NULL) return error(f, VORBIS_outofmem); memset(f->mapping, 0, f->mapping_count * sizeof(*f->mapping)); for (i=0; i < f->mapping_count; ++i) { Mapping *m = f->mapping + i; int mapping_type = get_bits(f,16); if (mapping_type != 0) return error(f, VORBIS_invalid_setup); m->chan = (MappingChannel *) setup_malloc(f, f->channels * sizeof(*m->chan)); if (m->chan == NULL) return error(f, VORBIS_outofmem); if (get_bits(f,1)) m->submaps = get_bits(f,4)+1; else m->submaps = 1; if (m->submaps > max_submaps) max_submaps = m->submaps; if (get_bits(f,1)) { m->coupling_steps = get_bits(f,8)+1; for (k=0; k < m->coupling_steps; ++k) { m->chan[k].magnitude = get_bits(f, ilog(f->channels-1)); m->chan[k].angle = get_bits(f, ilog(f->channels-1)); if (m->chan[k].magnitude >= f->channels) return error(f, VORBIS_invalid_setup); if (m->chan[k].angle >= f->channels) return error(f, VORBIS_invalid_setup); if (m->chan[k].magnitude == m->chan[k].angle) return error(f, VORBIS_invalid_setup); } } else m->coupling_steps = 0; // reserved field if (get_bits(f,2)) return error(f, VORBIS_invalid_setup); if (m->submaps > 1) { for (j=0; j < f->channels; ++j) { m->chan[j].mux = get_bits(f, 4); if (m->chan[j].mux >= m->submaps) return error(f, VORBIS_invalid_setup); } } else // @SPECIFICATION: this case is missing from the spec for (j=0; j < f->channels; ++j) m->chan[j].mux = 0; for (j=0; j < m->submaps; ++j) { get_bits(f,8); // discard m->submap_floor[j] = get_bits(f,8); m->submap_residue[j] = get_bits(f,8); if (m->submap_floor[j] >= f->floor_count) return error(f, VORBIS_invalid_setup); if (m->submap_residue[j] >= f->residue_count) return error(f, VORBIS_invalid_setup); } } // Modes f->mode_count = get_bits(f, 6)+1; for (i=0; i < f->mode_count; ++i) { Mode *m = f->mode_config+i; m->blockflag = get_bits(f,1); m->windowtype = get_bits(f,16); m->transformtype = get_bits(f,16); m->mapping = get_bits(f,8); if (m->windowtype != 0) return error(f, VORBIS_invalid_setup); if (m->transformtype != 0) return error(f, VORBIS_invalid_setup); if (m->mapping >= f->mapping_count) return error(f, VORBIS_invalid_setup); } flush_packet(f); f->previous_length = 0; for (i=0; i < f->channels; ++i) { f->channel_buffers[i] = (float *) setup_malloc(f, sizeof(float) * f->blocksize_1); f->previous_window[i] = (float *) setup_malloc(f, sizeof(float) * f->blocksize_1/2); f->finalY[i] = (int16 *) setup_malloc(f, sizeof(int16) * longest_floorlist); if (f->channel_buffers[i] == NULL || f->previous_window[i] == NULL || f->finalY[i] == NULL) return error(f, VORBIS_outofmem); #ifdef STB_VORBIS_NO_DEFER_FLOOR f->floor_buffers[i] = (float *) setup_malloc(f, sizeof(float) * f->blocksize_1/2); if (f->floor_buffers[i] == NULL) return error(f, VORBIS_outofmem); #endif } if (!init_blocksize(f, 0, f->blocksize_0)) return FALSE; if (!init_blocksize(f, 1, f->blocksize_1)) return FALSE; f->blocksize[0] = f->blocksize_0; f->blocksize[1] = f->blocksize_1; #ifdef STB_VORBIS_DIVIDE_TABLE if (integer_divide_table[1][1]==0) for (i=0; i < DIVTAB_NUMER; ++i) for (j=1; j < DIVTAB_DENOM; ++j) integer_divide_table[i][j] = i / j; #endif // compute how much temporary memory is needed // 1. { uint32 imdct_mem = (f->blocksize_1 * sizeof(float) >> 1); uint32 classify_mem; int i,max_part_read=0; for (i=0; i < f->residue_count; ++i) { Residue *r = f->residue_config + i; int n_read = r->end - r->begin; int part_read = n_read / r->part_size; if (part_read > max_part_read) max_part_read = part_read; } #ifndef STB_VORBIS_DIVIDES_IN_RESIDUE classify_mem = f->channels * (sizeof(void*) + max_part_read * sizeof(uint8 *)); #else classify_mem = f->channels * (sizeof(void*) + max_part_read * sizeof(int *)); #endif f->temp_memory_required = classify_mem; if (imdct_mem > f->temp_memory_required) f->temp_memory_required = imdct_mem; } f->first_decode = TRUE; if (f->alloc.alloc_buffer) { assert(f->temp_offset == f->alloc.alloc_buffer_length_in_bytes); // check if there's enough temp memory so we don't error later if (f->setup_offset + sizeof(*f) + f->temp_memory_required > (unsigned) f->temp_offset) return error(f, VORBIS_outofmem); } f->first_audio_page_offset = stb_vorbis_get_file_offset(f); return TRUE; } static void vorbis_deinit(stb_vorbis *p) { int i,j; if (p->residue_config) { for (i=0; i < p->residue_count; ++i) { Residue *r = p->residue_config+i; if (r->classdata) { for (j=0; j < p->codebooks[r->classbook].entries; ++j) setup_free(p, r->classdata[j]); setup_free(p, r->classdata); } setup_free(p, r->residue_books); } } if (p->codebooks) { CHECK(p); for (i=0; i < p->codebook_count; ++i) { Codebook *c = p->codebooks + i; setup_free(p, c->codeword_lengths); setup_free(p, c->multiplicands); setup_free(p, c->codewords); setup_free(p, c->sorted_codewords); // c->sorted_values[-1] is the first entry in the array setup_free(p, c->sorted_values ? c->sorted_values-1 : NULL); } setup_free(p, p->codebooks); } setup_free(p, p->floor_config); setup_free(p, p->residue_config); if (p->mapping) { for (i=0; i < p->mapping_count; ++i) setup_free(p, p->mapping[i].chan); setup_free(p, p->mapping); } CHECK(p); for (i=0; i < p->channels && i < STB_VORBIS_MAX_CHANNELS; ++i) { setup_free(p, p->channel_buffers[i]); setup_free(p, p->previous_window[i]); #ifdef STB_VORBIS_NO_DEFER_FLOOR setup_free(p, p->floor_buffers[i]); #endif setup_free(p, p->finalY[i]); } for (i=0; i < 2; ++i) { setup_free(p, p->A[i]); setup_free(p, p->B[i]); setup_free(p, p->C[i]); setup_free(p, p->window[i]); setup_free(p, p->bit_reverse[i]); } #ifndef STB_VORBIS_NO_STDIO if (p->close_on_free) fclose(p->f); #endif } void stb_vorbis_close(stb_vorbis *p) { if (p == NULL) return; vorbis_deinit(p); setup_free(p,p); } static void vorbis_init(stb_vorbis *p, const stb_vorbis_alloc *z) { memset(p, 0, sizeof(*p)); // NULL out all malloc'd pointers to start if (z) { p->alloc = *z; p->alloc.alloc_buffer_length_in_bytes = (p->alloc.alloc_buffer_length_in_bytes+3) & ~3; p->temp_offset = p->alloc.alloc_buffer_length_in_bytes; } p->eof = 0; p->error = VORBIS__no_error; p->stream = NULL; p->codebooks = NULL; p->page_crc_tests = -1; #ifndef STB_VORBIS_NO_STDIO p->close_on_free = FALSE; p->f = NULL; #endif } int stb_vorbis_get_sample_offset(stb_vorbis *f) { if (f->current_loc_valid) return f->current_loc; else return -1; } stb_vorbis_info stb_vorbis_get_info(stb_vorbis *f) { stb_vorbis_info d; d.channels = f->channels; d.sample_rate = f->sample_rate; d.setup_memory_required = f->setup_memory_required; d.setup_temp_memory_required = f->setup_temp_memory_required; d.temp_memory_required = f->temp_memory_required; d.max_frame_size = f->blocksize_1 >> 1; return d; } int stb_vorbis_get_error(stb_vorbis *f) { int e = f->error; f->error = VORBIS__no_error; return e; } static stb_vorbis * vorbis_alloc(stb_vorbis *f) { stb_vorbis *p = (stb_vorbis *) setup_malloc(f, sizeof(*p)); return p; } #ifndef STB_VORBIS_NO_PUSHDATA_API void stb_vorbis_flush_pushdata(stb_vorbis *f) { f->previous_length = 0; f->page_crc_tests = 0; f->discard_samples_deferred = 0; f->current_loc_valid = FALSE; f->first_decode = FALSE; f->samples_output = 0; f->channel_buffer_start = 0; f->channel_buffer_end = 0; } static int vorbis_search_for_page_pushdata(vorb *f, uint8 *data, int data_len) { int i,n; for (i=0; i < f->page_crc_tests; ++i) f->scan[i].bytes_done = 0; // if we have room for more scans, search for them first, because // they may cause us to stop early if their header is incomplete if (f->page_crc_tests < STB_VORBIS_PUSHDATA_CRC_COUNT) { if (data_len < 4) return 0; data_len -= 3; // need to look for 4-byte sequence, so don't miss // one that straddles a boundary for (i=0; i < data_len; ++i) { if (data[i] == 0x4f) { if (0==memcmp(data+i, ogg_page_header, 4)) { int j,len; uint32 crc; // make sure we have the whole page header if (i+26 >= data_len || i+27+data[i+26] >= data_len) { // only read up to this page start, so hopefully we'll // have the whole page header start next time data_len = i; break; } // ok, we have it all; compute the length of the page len = 27 + data[i+26]; for (j=0; j < data[i+26]; ++j) len += data[i+27+j]; // scan everything up to the embedded crc (which we must 0) crc = 0; for (j=0; j < 22; ++j) crc = crc32_update(crc, data[i+j]); // now process 4 0-bytes for ( ; j < 26; ++j) crc = crc32_update(crc, 0); // len is the total number of bytes we need to scan n = f->page_crc_tests++; f->scan[n].bytes_left = len-j; f->scan[n].crc_so_far = crc; f->scan[n].goal_crc = data[i+22] + (data[i+23] << 8) + (data[i+24]<<16) + (data[i+25]<<24); // if the last frame on a page is continued to the next, then // we can't recover the sample_loc immediately if (data[i+27+data[i+26]-1] == 255) f->scan[n].sample_loc = ~0; else f->scan[n].sample_loc = data[i+6] + (data[i+7] << 8) + (data[i+ 8]<<16) + (data[i+ 9]<<24); f->scan[n].bytes_done = i+j; if (f->page_crc_tests == STB_VORBIS_PUSHDATA_CRC_COUNT) break; // keep going if we still have room for more } } } } for (i=0; i < f->page_crc_tests;) { uint32 crc; int j; int n = f->scan[i].bytes_done; int m = f->scan[i].bytes_left; if (m > data_len - n) m = data_len - n; // m is the bytes to scan in the current chunk crc = f->scan[i].crc_so_far; for (j=0; j < m; ++j) crc = crc32_update(crc, data[n+j]); f->scan[i].bytes_left -= m; f->scan[i].crc_so_far = crc; if (f->scan[i].bytes_left == 0) { // does it match? if (f->scan[i].crc_so_far == f->scan[i].goal_crc) { // Houston, we have page data_len = n+m; // consumption amount is wherever that scan ended f->page_crc_tests = -1; // drop out of page scan mode f->previous_length = 0; // decode-but-don't-output one frame f->next_seg = -1; // start a new page f->current_loc = f->scan[i].sample_loc; // set the current sample location // to the amount we'd have decoded had we decoded this page f->current_loc_valid = f->current_loc != ~0U; return data_len; } // delete entry f->scan[i] = f->scan[--f->page_crc_tests]; } else { ++i; } } return data_len; } // return value: number of bytes we used int stb_vorbis_decode_frame_pushdata( stb_vorbis *f, // the file we're decoding const uint8 *data, int data_len, // the memory available for decoding int *channels, // place to write number of float * buffers float ***output, // place to write float ** array of float * buffers int *samples // place to write number of output samples ) { int i; int len,right,left; if (!IS_PUSH_MODE(f)) return error(f, VORBIS_invalid_api_mixing); if (f->page_crc_tests >= 0) { *samples = 0; return vorbis_search_for_page_pushdata(f, (uint8 *) data, data_len); } f->stream = (uint8 *) data; f->stream_end = (uint8 *) data + data_len; f->error = VORBIS__no_error; // check that we have the entire packet in memory if (!is_whole_packet_present(f, FALSE)) { *samples = 0; return 0; } if (!vorbis_decode_packet(f, &len, &left, &right)) { // save the actual error we encountered enum STBVorbisError error = f->error; if (error == VORBIS_bad_packet_type) { // flush and resynch f->error = VORBIS__no_error; while (get8_packet(f) != EOP) if (f->eof) break; *samples = 0; return (int) (f->stream - data); } if (error == VORBIS_continued_packet_flag_invalid) { if (f->previous_length == 0) { // we may be resynching, in which case it's ok to hit one // of these; just discard the packet f->error = VORBIS__no_error; while (get8_packet(f) != EOP) if (f->eof) break; *samples = 0; return (int) (f->stream - data); } } // if we get an error while parsing, what to do? // well, it DEFINITELY won't work to continue from where we are! stb_vorbis_flush_pushdata(f); // restore the error that actually made us bail f->error = error; *samples = 0; return 1; } // success! len = vorbis_finish_frame(f, len, left, right); for (i=0; i < f->channels; ++i) f->outputs[i] = f->channel_buffers[i] + left; if (channels) *channels = f->channels; *samples = len; *output = f->outputs; return (int) (f->stream - data); } stb_vorbis *stb_vorbis_open_pushdata( const unsigned char *data, int data_len, // the memory available for decoding int *data_used, // only defined if result is not NULL int *error, const stb_vorbis_alloc *alloc) { stb_vorbis *f, p; vorbis_init(&p, alloc); p.stream = (uint8 *) data; p.stream_end = (uint8 *) data + data_len; p.push_mode = TRUE; if (!start_decoder(&p)) { if (p.eof) *error = VORBIS_need_more_data; else *error = p.error; return NULL; } f = vorbis_alloc(&p); if (f) { *f = p; *data_used = (int) (f->stream - data); *error = 0; return f; } else { vorbis_deinit(&p); return NULL; } } #endif // STB_VORBIS_NO_PUSHDATA_API unsigned int stb_vorbis_get_file_offset(stb_vorbis *f) { #ifndef STB_VORBIS_NO_PUSHDATA_API if (f->push_mode) return 0; #endif if (USE_MEMORY(f)) return (unsigned int) (f->stream - f->stream_start); #ifndef STB_VORBIS_NO_STDIO return (unsigned int) (ftell(f->f) - f->f_start); #endif } #ifndef STB_VORBIS_NO_PULLDATA_API // // DATA-PULLING API // static uint32 vorbis_find_page(stb_vorbis *f, uint32 *end, uint32 *last) { for(;;) { int n; if (f->eof) return 0; n = get8(f); if (n == 0x4f) { // page header candidate unsigned int retry_loc = stb_vorbis_get_file_offset(f); int i; // check if we're off the end of a file_section stream if (retry_loc - 25 > f->stream_len) return 0; // check the rest of the header for (i=1; i < 4; ++i) if (get8(f) != ogg_page_header[i]) break; if (f->eof) return 0; if (i == 4) { uint8 header[27]; uint32 i, crc, goal, len; for (i=0; i < 4; ++i) header[i] = ogg_page_header[i]; for (; i < 27; ++i) header[i] = get8(f); if (f->eof) return 0; if (header[4] != 0) goto invalid; goal = header[22] + (header[23] << 8) + (header[24]<<16) + (header[25]<<24); for (i=22; i < 26; ++i) header[i] = 0; crc = 0; for (i=0; i < 27; ++i) crc = crc32_update(crc, header[i]); len = 0; for (i=0; i < header[26]; ++i) { int s = get8(f); crc = crc32_update(crc, s); len += s; } if (len && f->eof) return 0; for (i=0; i < len; ++i) crc = crc32_update(crc, get8(f)); // finished parsing probable page if (crc == goal) { // we could now check that it's either got the last // page flag set, OR it's followed by the capture // pattern, but I guess TECHNICALLY you could have // a file with garbage between each ogg page and recover // from it automatically? So even though that paranoia // might decrease the chance of an invalid decode by // another 2^32, not worth it since it would hose those // invalid-but-useful files? if (end) *end = stb_vorbis_get_file_offset(f); if (last) { if (header[5] & 0x04) *last = 1; else *last = 0; } set_file_offset(f, retry_loc-1); return 1; } } invalid: // not a valid page, so rewind and look for next one set_file_offset(f, retry_loc); } } } #define SAMPLE_unknown 0xffffffff // seeking is implemented with a binary search, which narrows down the range to // 64K, before using a linear search (because finding the synchronization // pattern can be expensive, and the chance we'd find the end page again is // relatively high for small ranges) // // two initial interpolation-style probes are used at the start of the search // to try to bound either side of the binary search sensibly, while still // working in O(log n) time if they fail. static int get_seek_page_info(stb_vorbis *f, ProbedPage *z) { uint8 header[27], lacing[255]; int i,len; // record where the page starts z->page_start = stb_vorbis_get_file_offset(f); // parse the header getn(f, header, 27); if (header[0] != 'O' || header[1] != 'g' || header[2] != 'g' || header[3] != 'S') return 0; getn(f, lacing, header[26]); // determine the length of the payload len = 0; for (i=0; i < header[26]; ++i) len += lacing[i]; // this implies where the page ends z->page_end = z->page_start + 27 + header[26] + len; // read the last-decoded sample out of the data z->last_decoded_sample = header[6] + (header[7] << 8) + (header[8] << 16) + (header[9] << 24); // restore file state to where we were set_file_offset(f, z->page_start); return 1; } // rarely used function to seek back to the preceeding page while finding the // start of a packet static int go_to_page_before(stb_vorbis *f, unsigned int limit_offset) { unsigned int previous_safe, end; // now we want to seek back 64K from the limit if (limit_offset >= 65536 && limit_offset-65536 >= f->first_audio_page_offset) previous_safe = limit_offset - 65536; else previous_safe = f->first_audio_page_offset; set_file_offset(f, previous_safe); while (vorbis_find_page(f, &end, NULL)) { if (end >= limit_offset && stb_vorbis_get_file_offset(f) < limit_offset) return 1; set_file_offset(f, end); } return 0; } // implements the search logic for finding a page and starting decoding. if // the function succeeds, current_loc_valid will be true and current_loc will // be less than or equal to the provided sample number (the closer the // better). static int seek_to_sample_coarse(stb_vorbis *f, uint32 sample_number) { ProbedPage left, right, mid; int i, start_seg_with_known_loc, end_pos, page_start; uint32 delta, stream_length, padding; double offset, bytes_per_sample; int probe = 0; // find the last page and validate the target sample stream_length = stb_vorbis_stream_length_in_samples(f); if (stream_length == 0) return error(f, VORBIS_seek_without_length); if (sample_number > stream_length) return error(f, VORBIS_seek_invalid); // this is the maximum difference between the window-center (which is the // actual granule position value), and the right-start (which the spec // indicates should be the granule position (give or take one)). padding = ((f->blocksize_1 - f->blocksize_0) >> 2); if (sample_number < padding) sample_number = 0; else sample_number -= padding; left = f->p_first; while (left.last_decoded_sample == ~0U) { // (untested) the first page does not have a 'last_decoded_sample' set_file_offset(f, left.page_end); if (!get_seek_page_info(f, &left)) goto error; } right = f->p_last; assert(right.last_decoded_sample != ~0U); // starting from the start is handled differently if (sample_number <= left.last_decoded_sample) { if (stb_vorbis_seek_start(f)) return 1; return 0; } while (left.page_end != right.page_start) { assert(left.page_end < right.page_start); // search range in bytes delta = right.page_start - left.page_end; if (delta <= 65536) { // there's only 64K left to search - handle it linearly set_file_offset(f, left.page_end); } else { if (probe < 2) { if (probe == 0) { // first probe (interpolate) double data_bytes = right.page_end - left.page_start; bytes_per_sample = data_bytes / right.last_decoded_sample; offset = left.page_start + bytes_per_sample * (sample_number - left.last_decoded_sample); } else { // second probe (try to bound the other side) double error = ((double) sample_number - mid.last_decoded_sample) * bytes_per_sample; if (error >= 0 && error < 8000) error = 8000; if (error < 0 && error > -8000) error = -8000; offset += error * 2; } // ensure the offset is valid if (offset < left.page_end) offset = left.page_end; if (offset > right.page_start - 65536) offset = right.page_start - 65536; set_file_offset(f, (unsigned int) offset); } else { // binary search for large ranges (offset by 32K to ensure // we don't hit the right page) set_file_offset(f, left.page_end + (delta / 2) - 32768); } if (!vorbis_find_page(f, NULL, NULL)) goto error; } for (;;) { if (!get_seek_page_info(f, &mid)) goto error; if (mid.last_decoded_sample != ~0U) break; // (untested) no frames end on this page set_file_offset(f, mid.page_end); assert(mid.page_start < right.page_start); } // if we've just found the last page again then we're in a tricky file, // and we're close enough. if (mid.page_start == right.page_start) break; if (sample_number < mid.last_decoded_sample) right = mid; else left = mid; ++probe; } // seek back to start of the last packet page_start = left.page_start; set_file_offset(f, page_start); if (!start_page(f)) return error(f, VORBIS_seek_failed); end_pos = f->end_seg_with_known_loc; assert(end_pos >= 0); for (;;) { for (i = end_pos; i > 0; --i) if (f->segments[i-1] != 255) break; start_seg_with_known_loc = i; if (start_seg_with_known_loc > 0 || !(f->page_flag & PAGEFLAG_continued_packet)) break; // (untested) the final packet begins on an earlier page if (!go_to_page_before(f, page_start)) goto error; page_start = stb_vorbis_get_file_offset(f); if (!start_page(f)) goto error; end_pos = f->segment_count - 1; } // prepare to start decoding f->current_loc_valid = FALSE; f->last_seg = FALSE; f->valid_bits = 0; f->packet_bytes = 0; f->bytes_in_seg = 0; f->previous_length = 0; f->next_seg = start_seg_with_known_loc; for (i = 0; i < start_seg_with_known_loc; i++) skip(f, f->segments[i]); // start decoding (optimizable - this frame is generally discarded) if (!vorbis_pump_first_frame(f)) return 0; if (f->current_loc > sample_number) return error(f, VORBIS_seek_failed); return 1; error: // try to restore the file to a valid state stb_vorbis_seek_start(f); return error(f, VORBIS_seek_failed); } // the same as vorbis_decode_initial, but without advancing static int peek_decode_initial(vorb *f, int *p_left_start, int *p_left_end, int *p_right_start, int *p_right_end, int *mode) { int bits_read, bytes_read; if (!vorbis_decode_initial(f, p_left_start, p_left_end, p_right_start, p_right_end, mode)) return 0; // either 1 or 2 bytes were read, figure out which so we can rewind bits_read = 1 + ilog(f->mode_count-1); if (f->mode_config[*mode].blockflag) bits_read += 2; bytes_read = (bits_read + 7) / 8; f->bytes_in_seg += bytes_read; f->packet_bytes -= bytes_read; skip(f, -bytes_read); if (f->next_seg == -1) f->next_seg = f->segment_count - 1; else f->next_seg--; f->valid_bits = 0; return 1; } int stb_vorbis_seek_frame(stb_vorbis *f, unsigned int sample_number) { uint32 max_frame_samples; if (IS_PUSH_MODE(f)) return error(f, VORBIS_invalid_api_mixing); // fast page-level search if (!seek_to_sample_coarse(f, sample_number)) return 0; assert(f->current_loc_valid); assert(f->current_loc <= sample_number); // linear search for the relevant packet max_frame_samples = (f->blocksize_1*3 - f->blocksize_0) >> 2; while (f->current_loc < sample_number) { int left_start, left_end, right_start, right_end, mode, frame_samples; if (!peek_decode_initial(f, &left_start, &left_end, &right_start, &right_end, &mode)) return error(f, VORBIS_seek_failed); // calculate the number of samples returned by the next frame frame_samples = right_start - left_start; if (f->current_loc + frame_samples > sample_number) { return 1; // the next frame will contain the sample } else if (f->current_loc + frame_samples + max_frame_samples > sample_number) { // there's a chance the frame after this could contain the sample vorbis_pump_first_frame(f); } else { // this frame is too early to be relevant f->current_loc += frame_samples; f->previous_length = 0; maybe_start_packet(f); flush_packet(f); } } // the next frame will start with the sample assert(f->current_loc == sample_number); return 1; } int stb_vorbis_seek(stb_vorbis *f, unsigned int sample_number) { if (!stb_vorbis_seek_frame(f, sample_number)) return 0; if (sample_number != f->current_loc) { int n; uint32 frame_start = f->current_loc; stb_vorbis_get_frame_float(f, &n, NULL); assert(sample_number > frame_start); assert(f->channel_buffer_start + (int) (sample_number-frame_start) <= f->channel_buffer_end); f->channel_buffer_start += (sample_number - frame_start); } return 1; } int stb_vorbis_seek_start(stb_vorbis *f) { if (IS_PUSH_MODE(f)) { return error(f, VORBIS_invalid_api_mixing); } set_file_offset(f, f->first_audio_page_offset); f->previous_length = 0; f->first_decode = TRUE; f->next_seg = -1; return vorbis_pump_first_frame(f); } unsigned int stb_vorbis_stream_length_in_samples(stb_vorbis *f) { unsigned int restore_offset, previous_safe; unsigned int end, last_page_loc; if (IS_PUSH_MODE(f)) return error(f, VORBIS_invalid_api_mixing); if (!f->total_samples) { unsigned int last; uint32 lo,hi; char header[6]; // first, store the current decode position so we can restore it restore_offset = stb_vorbis_get_file_offset(f); // now we want to seek back 64K from the end (the last page must // be at most a little less than 64K, but let's allow a little slop) if (f->stream_len >= 65536 && f->stream_len-65536 >= f->first_audio_page_offset) previous_safe = f->stream_len - 65536; else previous_safe = f->first_audio_page_offset; set_file_offset(f, previous_safe); // previous_safe is now our candidate 'earliest known place that seeking // to will lead to the final page' if (!vorbis_find_page(f, &end, &last)) { // if we can't find a page, we're hosed! f->error = VORBIS_cant_find_last_page; f->total_samples = 0xffffffff; goto done; } // check if there are more pages last_page_loc = stb_vorbis_get_file_offset(f); // stop when the last_page flag is set, not when we reach eof; // this allows us to stop short of a 'file_section' end without // explicitly checking the length of the section while (!last) { set_file_offset(f, end); if (!vorbis_find_page(f, &end, &last)) { // the last page we found didn't have the 'last page' flag // set. whoops! break; } previous_safe = last_page_loc+1; last_page_loc = stb_vorbis_get_file_offset(f); } set_file_offset(f, last_page_loc); // parse the header getn(f, (unsigned char *)header, 6); // extract the absolute granule position lo = get32(f); hi = get32(f); if (lo == 0xffffffff && hi == 0xffffffff) { f->error = VORBIS_cant_find_last_page; f->total_samples = SAMPLE_unknown; goto done; } if (hi) lo = 0xfffffffe; // saturate f->total_samples = lo; f->p_last.page_start = last_page_loc; f->p_last.page_end = end; f->p_last.last_decoded_sample = lo; done: set_file_offset(f, restore_offset); } return f->total_samples == SAMPLE_unknown ? 0 : f->total_samples; } float stb_vorbis_stream_length_in_seconds(stb_vorbis *f) { return stb_vorbis_stream_length_in_samples(f) / (float) f->sample_rate; } int stb_vorbis_get_frame_float(stb_vorbis *f, int *channels, float ***output) { int len, right,left,i; if (IS_PUSH_MODE(f)) return error(f, VORBIS_invalid_api_mixing); if (!vorbis_decode_packet(f, &len, &left, &right)) { f->channel_buffer_start = f->channel_buffer_end = 0; return 0; } len = vorbis_finish_frame(f, len, left, right); for (i=0; i < f->channels; ++i) f->outputs[i] = f->channel_buffers[i] + left; f->channel_buffer_start = left; f->channel_buffer_end = left+len; if (channels) *channels = f->channels; if (output) *output = f->outputs; return len; } #ifndef STB_VORBIS_NO_STDIO stb_vorbis * stb_vorbis_open_file_section(FILE *file, int close_on_free, int *error, const stb_vorbis_alloc *alloc, unsigned int length) { stb_vorbis *f, p; vorbis_init(&p, alloc); p.f = file; p.f_start = (uint32) ftell(file); p.stream_len = length; p.close_on_free = close_on_free; if (start_decoder(&p)) { f = vorbis_alloc(&p); if (f) { *f = p; vorbis_pump_first_frame(f); return f; } } if (error) *error = p.error; vorbis_deinit(&p); return NULL; } stb_vorbis * stb_vorbis_open_file(FILE *file, int close_on_free, int *error, const stb_vorbis_alloc *alloc) { unsigned int len, start; start = (unsigned int) ftell(file); fseek(file, 0, SEEK_END); len = (unsigned int) (ftell(file) - start); fseek(file, start, SEEK_SET); return stb_vorbis_open_file_section(file, close_on_free, error, alloc, len); } stb_vorbis * stb_vorbis_open_filename(const char *filename, int *error, const stb_vorbis_alloc *alloc) { FILE *f = fopen(filename, "rb"); if (f) return stb_vorbis_open_file(f, TRUE, error, alloc); if (error) *error = VORBIS_file_open_failure; return NULL; } #endif // STB_VORBIS_NO_STDIO stb_vorbis * stb_vorbis_open_memory(const unsigned char *data, int len, int *error, const stb_vorbis_alloc *alloc) { stb_vorbis *f, p; if (data == NULL) return NULL; vorbis_init(&p, alloc); p.stream = (uint8 *) data; p.stream_end = (uint8 *) data + len; p.stream_start = (uint8 *) p.stream; p.stream_len = len; p.push_mode = FALSE; if (start_decoder(&p)) { f = vorbis_alloc(&p); if (f) { *f = p; vorbis_pump_first_frame(f); if (error) *error = VORBIS__no_error; return f; } } if (error) *error = p.error; vorbis_deinit(&p); return NULL; } #ifndef STB_VORBIS_NO_INTEGER_CONVERSION #define PLAYBACK_MONO 1 #define PLAYBACK_LEFT 2 #define PLAYBACK_RIGHT 4 #define L (PLAYBACK_LEFT | PLAYBACK_MONO) #define C (PLAYBACK_LEFT | PLAYBACK_RIGHT | PLAYBACK_MONO) #define R (PLAYBACK_RIGHT | PLAYBACK_MONO) static int8 channel_position[7][6] = { { 0 }, { C }, { L, R }, { L, C, R }, { L, R, L, R }, { L, C, R, L, R }, { L, C, R, L, R, C }, }; #ifndef STB_VORBIS_NO_FAST_SCALED_FLOAT typedef union { float f; int i; } float_conv; typedef char stb_vorbis_float_size_test[sizeof(float)==4 && sizeof(int) == 4]; #define FASTDEF(x) float_conv x // add (1<<23) to convert to int, then divide by 2^SHIFT, then add 0.5/2^SHIFT to round #define MAGIC(SHIFT) (1.5f * (1 << (23-SHIFT)) + 0.5f/(1 << SHIFT)) #define ADDEND(SHIFT) (((150-SHIFT) << 23) + (1 << 22)) #define FAST_SCALED_FLOAT_TO_INT(temp,x,s) (temp.f = (x) + MAGIC(s), temp.i - ADDEND(s)) #define check_endianness() #else #define FAST_SCALED_FLOAT_TO_INT(temp,x,s) ((int) ((x) * (1 << (s)))) #define check_endianness() #define FASTDEF(x) #endif static void copy_samples(short *dest, float *src, int len) { int i; check_endianness(); for (i=0; i < len; ++i) { FASTDEF(temp); int v = FAST_SCALED_FLOAT_TO_INT(temp, src[i],15); if ((unsigned int) (v + 32768) > 65535) v = v < 0 ? -32768 : 32767; dest[i] = v; } } static void compute_samples(int mask, short *output, int num_c, float **data, int d_offset, int len) { #define BUFFER_SIZE 32 float buffer[BUFFER_SIZE]; int i,j,o,n = BUFFER_SIZE; check_endianness(); for (o = 0; o < len; o += BUFFER_SIZE) { memset(buffer, 0, sizeof(buffer)); if (o + n > len) n = len - o; for (j=0; j < num_c; ++j) { if (channel_position[num_c][j] & mask) { for (i=0; i < n; ++i) buffer[i] += data[j][d_offset+o+i]; } } for (i=0; i < n; ++i) { FASTDEF(temp); int v = FAST_SCALED_FLOAT_TO_INT(temp,buffer[i],15); if ((unsigned int) (v + 32768) > 65535) v = v < 0 ? -32768 : 32767; output[o+i] = v; } } } static void compute_stereo_samples(short *output, int num_c, float **data, int d_offset, int len) { #define BUFFER_SIZE 32 float buffer[BUFFER_SIZE]; int i,j,o,n = BUFFER_SIZE >> 1; // o is the offset in the source data check_endianness(); for (o = 0; o < len; o += BUFFER_SIZE >> 1) { // o2 is the offset in the output data int o2 = o << 1; memset(buffer, 0, sizeof(buffer)); if (o + n > len) n = len - o; for (j=0; j < num_c; ++j) { int m = channel_position[num_c][j] & (PLAYBACK_LEFT | PLAYBACK_RIGHT); if (m == (PLAYBACK_LEFT | PLAYBACK_RIGHT)) { for (i=0; i < n; ++i) { buffer[i*2+0] += data[j][d_offset+o+i]; buffer[i*2+1] += data[j][d_offset+o+i]; } } else if (m == PLAYBACK_LEFT) { for (i=0; i < n; ++i) { buffer[i*2+0] += data[j][d_offset+o+i]; } } else if (m == PLAYBACK_RIGHT) { for (i=0; i < n; ++i) { buffer[i*2+1] += data[j][d_offset+o+i]; } } } for (i=0; i < (n<<1); ++i) { FASTDEF(temp); int v = FAST_SCALED_FLOAT_TO_INT(temp,buffer[i],15); if ((unsigned int) (v + 32768) > 65535) v = v < 0 ? -32768 : 32767; output[o2+i] = v; } } } static void convert_samples_short(int buf_c, short **buffer, int b_offset, int data_c, float **data, int d_offset, int samples) { int i; if (buf_c != data_c && buf_c <= 2 && data_c <= 6) { static int channel_selector[3][2] = { {0}, {PLAYBACK_MONO}, {PLAYBACK_LEFT, PLAYBACK_RIGHT} }; for (i=0; i < buf_c; ++i) compute_samples(channel_selector[buf_c][i], buffer[i]+b_offset, data_c, data, d_offset, samples); } else { int limit = buf_c < data_c ? buf_c : data_c; for (i=0; i < limit; ++i) copy_samples(buffer[i]+b_offset, data[i]+d_offset, samples); for ( ; i < buf_c; ++i) memset(buffer[i]+b_offset, 0, sizeof(short) * samples); } } int stb_vorbis_get_frame_short(stb_vorbis *f, int num_c, short **buffer, int num_samples) { float **output; int len = stb_vorbis_get_frame_float(f, NULL, &output); if (len > num_samples) len = num_samples; if (len) convert_samples_short(num_c, buffer, 0, f->channels, output, 0, len); return len; } static void convert_channels_short_interleaved(int buf_c, short *buffer, int data_c, float **data, int d_offset, int len) { int i; check_endianness(); if (buf_c != data_c && buf_c <= 2 && data_c <= 6) { assert(buf_c == 2); for (i=0; i < buf_c; ++i) compute_stereo_samples(buffer, data_c, data, d_offset, len); } else { int limit = buf_c < data_c ? buf_c : data_c; int j; for (j=0; j < len; ++j) { for (i=0; i < limit; ++i) { FASTDEF(temp); float f = data[i][d_offset+j]; int v = FAST_SCALED_FLOAT_TO_INT(temp, f,15);//data[i][d_offset+j],15); if ((unsigned int) (v + 32768) > 65535) v = v < 0 ? -32768 : 32767; *buffer++ = v; } for ( ; i < buf_c; ++i) *buffer++ = 0; } } } int stb_vorbis_get_frame_short_interleaved(stb_vorbis *f, int num_c, short *buffer, int num_shorts) { float **output; int len; if (num_c == 1) return stb_vorbis_get_frame_short(f,num_c,&buffer, num_shorts); len = stb_vorbis_get_frame_float(f, NULL, &output); if (len) { if (len*num_c > num_shorts) len = num_shorts / num_c; convert_channels_short_interleaved(num_c, buffer, f->channels, output, 0, len); } return len; } int stb_vorbis_get_samples_short_interleaved(stb_vorbis *f, int channels, short *buffer, int num_shorts) { float **outputs; int len = num_shorts / channels; int n=0; int z = f->channels; if (z > channels) z = channels; while (n < len) { int k = f->channel_buffer_end - f->channel_buffer_start; if (n+k >= len) k = len - n; if (k) convert_channels_short_interleaved(channels, buffer, f->channels, f->channel_buffers, f->channel_buffer_start, k); buffer += k*channels; n += k; f->channel_buffer_start += k; if (n == len) break; if (!stb_vorbis_get_frame_float(f, NULL, &outputs)) break; } return n; } int stb_vorbis_get_samples_short(stb_vorbis *f, int channels, short **buffer, int len) { float **outputs; int n=0; int z = f->channels; if (z > channels) z = channels; while (n < len) { int k = f->channel_buffer_end - f->channel_buffer_start; if (n+k >= len) k = len - n; if (k) convert_samples_short(channels, buffer, n, f->channels, f->channel_buffers, f->channel_buffer_start, k); n += k; f->channel_buffer_start += k; if (n == len) break; if (!stb_vorbis_get_frame_float(f, NULL, &outputs)) break; } return n; } #ifndef STB_VORBIS_NO_STDIO int stb_vorbis_decode_filename(const char *filename, int *channels, int *sample_rate, short **output) { int data_len, offset, total, limit, error; short *data; stb_vorbis *v = stb_vorbis_open_filename(filename, &error, NULL); if (v == NULL) return -1; limit = v->channels * 4096; *channels = v->channels; if (sample_rate) *sample_rate = v->sample_rate; offset = data_len = 0; total = limit; data = (short *) malloc(total * sizeof(*data)); if (data == NULL) { stb_vorbis_close(v); return -2; } for (;;) { int n = stb_vorbis_get_frame_short_interleaved(v, v->channels, data+offset, total-offset); if (n == 0) break; data_len += n; offset += n * v->channels; if (offset + limit > total) { short *data2; total *= 2; data2 = (short *) realloc(data, total * sizeof(*data)); if (data2 == NULL) { free(data); stb_vorbis_close(v); return -2; } data = data2; } } *output = data; stb_vorbis_close(v); return data_len; } #endif // NO_STDIO int stb_vorbis_decode_memory(const uint8 *mem, int len, int *channels, int *sample_rate, short **output) { int data_len, offset, total, limit, error; short *data; stb_vorbis *v = stb_vorbis_open_memory(mem, len, &error, NULL); if (v == NULL) return -1; limit = v->channels * 4096; *channels = v->channels; if (sample_rate) *sample_rate = v->sample_rate; offset = data_len = 0; total = limit; data = (short *) malloc(total * sizeof(*data)); if (data == NULL) { stb_vorbis_close(v); return -2; } for (;;) { int n = stb_vorbis_get_frame_short_interleaved(v, v->channels, data+offset, total-offset); if (n == 0) break; data_len += n; offset += n * v->channels; if (offset + limit > total) { short *data2; total *= 2; data2 = (short *) realloc(data, total * sizeof(*data)); if (data2 == NULL) { free(data); stb_vorbis_close(v); return -2; } data = data2; } } *output = data; stb_vorbis_close(v); return data_len; } #endif // STB_VORBIS_NO_INTEGER_CONVERSION int stb_vorbis_get_samples_float_interleaved(stb_vorbis *f, int channels, float *buffer, int num_floats) { float **outputs; int len = num_floats / channels; int n=0; int z = f->channels; if (z > channels) z = channels; while (n < len) { int i,j; int k = f->channel_buffer_end - f->channel_buffer_start; if (n+k >= len) k = len - n; for (j=0; j < k; ++j) { for (i=0; i < z; ++i) *buffer++ = f->channel_buffers[i][f->channel_buffer_start+j]; for ( ; i < channels; ++i) *buffer++ = 0; } n += k; f->channel_buffer_start += k; if (n == len) break; if (!stb_vorbis_get_frame_float(f, NULL, &outputs)) break; } return n; } int stb_vorbis_get_samples_float(stb_vorbis *f, int channels, float **buffer, int num_samples) { float **outputs; int n=0; int z = f->channels; if (z > channels) z = channels; while (n < num_samples) { int i; int k = f->channel_buffer_end - f->channel_buffer_start; if (n+k >= num_samples) k = num_samples - n; if (k) { for (i=0; i < z; ++i) memcpy(buffer[i]+n, f->channel_buffers[i]+f->channel_buffer_start, sizeof(float)*k); for ( ; i < channels; ++i) memset(buffer[i]+n, 0, sizeof(float) * k); } n += k; f->channel_buffer_start += k; if (n == num_samples) break; if (!stb_vorbis_get_frame_float(f, NULL, &outputs)) break; } return n; } #endif // STB_VORBIS_NO_PULLDATA_API /* Version history 1.10 - 2017/03/03 - more robust seeking; fix negative ilog(); clear error in open_memory 1.09 - 2016/04/04 - back out 'avoid discarding last frame' fix from previous version 1.08 - 2016/04/02 - fixed multiple warnings; fix setup memory leaks; avoid discarding last frame of audio data 1.07 - 2015/01/16 - fixed some warnings, fix mingw, const-correct API some more crash fixes when out of memory or with corrupt files 1.06 - 2015/08/31 - full, correct support for seeking API (Dougall Johnson) some crash fixes when out of memory or with corrupt files 1.05 - 2015/04/19 - don't define __forceinline if it's redundant 1.04 - 2014/08/27 - fix missing const-correct case in API 1.03 - 2014/08/07 - Warning fixes 1.02 - 2014/07/09 - Declare qsort compare function _cdecl on windows 1.01 - 2014/06/18 - fix stb_vorbis_get_samples_float 1.0 - 2014/05/26 - fix memory leaks; fix warnings; fix bugs in multichannel (API change) report sample rate for decode-full-file funcs 0.99996 - bracket #include for macintosh compilation by Laurent Gomila 0.99995 - use union instead of pointer-cast for fast-float-to-int to avoid alias-optimization problem 0.99994 - change fast-float-to-int to work in single-precision FPU mode, remove endian-dependence 0.99993 - remove assert that fired on legal files with empty tables 0.99992 - rewind-to-start 0.99991 - bugfix to stb_vorbis_get_samples_short by Bernhard Wodo 0.9999 - (should have been 0.99990) fix no-CRT support, compiling as C++ 0.9998 - add a full-decode function with a memory source 0.9997 - fix a bug in the read-from-FILE case in 0.9996 addition 0.9996 - query length of vorbis stream in samples/seconds 0.9995 - bugfix to another optimization that only happened in certain files 0.9994 - bugfix to one of the optimizations that caused significant (but inaudible?) errors 0.9993 - performance improvements; runs in 99% to 104% of time of reference implementation 0.9992 - performance improvement of IMDCT; now performs close to reference implementation 0.9991 - performance improvement of IMDCT 0.999 - (should have been 0.9990) performance improvement of IMDCT 0.998 - no-CRT support from Casey Muratori 0.997 - bugfixes for bugs found by Terje Mathisen 0.996 - bugfix: fast-huffman decode initialized incorrectly for sparse codebooks; fixing gives 10% speedup - found by Terje Mathisen 0.995 - bugfix: fix to 'effective' overrun detection - found by Terje Mathisen 0.994 - bugfix: garbage decode on final VQ symbol of a non-multiple - found by Terje Mathisen 0.993 - bugfix: pushdata API required 1 extra byte for empty page (failed to consume final page if empty) - found by Terje Mathisen 0.992 - fixes for MinGW warning 0.991 - turn fast-float-conversion on by default 0.990 - fix push-mode seek recovery if you seek into the headers 0.98b - fix to bad release of 0.98 0.98 - fix push-mode seek recovery; robustify float-to-int and support non-fast mode 0.97 - builds under c++ (typecasting, don't use 'class' keyword) 0.96 - somehow MY 0.95 was right, but the web one was wrong, so here's my 0.95 rereleased as 0.96, fixes a typo in the clamping code 0.95 - clamping code for 16-bit functions 0.94 - not publically released 0.93 - fixed all-zero-floor case (was decoding garbage) 0.92 - fixed a memory leak 0.91 - conditional compiles to omit parts of the API and the infrastructure to support them: STB_VORBIS_NO_PULLDATA_API, STB_VORBIS_NO_PUSHDATA_API, STB_VORBIS_NO_STDIO, STB_VORBIS_NO_INTEGER_CONVERSION 0.90 - first public release */ #endif // STB_VORBIS_HEADER_ONLY /* ------------------------------------------------------------------------------ This software is available under 2 licenses -- choose whichever you prefer. ------------------------------------------------------------------------------ ALTERNATIVE A - MIT License Copyright (c) 2017 Sean Barrett 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. ------------------------------------------------------------------------------ ALTERNATIVE B - Public Domain (www.unlicense.org) This is free and unencumbered software released into the public domain. Anyone is free to copy, modify, publish, use, compile, sell, or distribute this software, either in source code form or as a compiled binary, for any purpose, commercial or non-commercial, and by any means. In jurisdictions that recognize copyright laws, the author or authors of this software dedicate any and all copyright interest in the software to the public domain. We make this dedication for the benefit of the public at large and to the detriment of our heirs and successors. We intend this dedication to be an overt act of relinquishment in perpetuity of all present and future rights to this software under copyright law. 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 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. ------------------------------------------------------------------------------ */ uTox/third_party/stb/stb/stb_truetype.h0000600000175000001440000053171414003056224017323 0ustar rakusers// stb_truetype.h - v1.17 - public domain // authored from 2009-2016 by Sean Barrett / RAD Game Tools // // This library processes TrueType files: // parse files // extract glyph metrics // extract glyph shapes // render glyphs to one-channel bitmaps with antialiasing (box filter) // render glyphs to one-channel SDF bitmaps (signed-distance field/function) // // Todo: // non-MS cmaps // crashproof on bad data // hinting? (no longer patented) // cleartype-style AA? // optimize: use simple memory allocator for intermediates // optimize: build edge-list directly from curves // optimize: rasterize directly from curves? // // ADDITIONAL CONTRIBUTORS // // Mikko Mononen: compound shape support, more cmap formats // Tor Andersson: kerning, subpixel rendering // Dougall Johnson: OpenType / Type 2 font handling // // Misc other: // Ryan Gordon // Simon Glass // github:IntellectualKitty // Imanol Celaya // // Bug/warning reports/fixes: // "Zer" on mollyrocket // Cass Everitt // stoiko (Haemimont Games) // Brian Hook // Walter van Niftrik // David Gow // David Given // Ivan-Assen Ivanov // Anthony Pesch // Johan Duparc // Hou Qiming // Fabian "ryg" Giesen // Martins Mozeiko // Cap Petschulat // Omar Cornut // github:aloucks // Peter LaValle // Sergey Popov // Giumo X. Clanjor // Higor Euripedes // Thomas Fields // Derek Vinyard // Cort Stratton // github:oyvindjam // // VERSION HISTORY // // 1.17 (2017-07-23) make more arguments const; doc fix // 1.16 (2017-07-12) SDF support // 1.15 (2017-03-03) make more arguments const // 1.14 (2017-01-16) num-fonts-in-TTC function // 1.13 (2017-01-02) support OpenType fonts, certain Apple fonts // 1.12 (2016-10-25) suppress warnings about casting away const with -Wcast-qual // 1.11 (2016-04-02) fix unused-variable warning // 1.10 (2016-04-02) user-defined fabs(); rare memory leak; remove duplicate typedef // 1.09 (2016-01-16) warning fix; avoid crash on outofmem; use allocation userdata properly // 1.08 (2015-09-13) document stbtt_Rasterize(); fixes for vertical & horizontal edges // 1.07 (2015-08-01) allow PackFontRanges to accept arrays of sparse codepoints; // variant PackFontRanges to pack and render in separate phases; // fix stbtt_GetFontOFfsetForIndex (never worked for non-0 input?); // fixed an assert() bug in the new rasterizer // replace assert() with STBTT_assert() in new rasterizer // // Full history can be found at the end of this file. // // LICENSE // // See end of file for license information. // // USAGE // // Include this file in whatever places neeed to refer to it. In ONE C/C++ // file, write: // #define STB_TRUETYPE_IMPLEMENTATION // before the #include of this file. This expands out the actual // implementation into that C/C++ file. // // To make the implementation private to the file that generates the implementation, // #define STBTT_STATIC // // Simple 3D API (don't ship this, but it's fine for tools and quick start) // stbtt_BakeFontBitmap() -- bake a font to a bitmap for use as texture // stbtt_GetBakedQuad() -- compute quad to draw for a given char // // Improved 3D API (more shippable): // #include "stb_rect_pack.h" -- optional, but you really want it // stbtt_PackBegin() // stbtt_PackSetOversampling() -- for improved quality on small fonts // stbtt_PackFontRanges() -- pack and renders // stbtt_PackEnd() // stbtt_GetPackedQuad() // // "Load" a font file from a memory buffer (you have to keep the buffer loaded) // stbtt_InitFont() // stbtt_GetFontOffsetForIndex() -- indexing for TTC font collections // stbtt_GetNumberOfFonts() -- number of fonts for TTC font collections // // Render a unicode codepoint to a bitmap // stbtt_GetCodepointBitmap() -- allocates and returns a bitmap // stbtt_MakeCodepointBitmap() -- renders into bitmap you provide // stbtt_GetCodepointBitmapBox() -- how big the bitmap must be // // Character advance/positioning // stbtt_GetCodepointHMetrics() // stbtt_GetFontVMetrics() // stbtt_GetFontVMetricsOS2() // stbtt_GetCodepointKernAdvance() // // Starting with version 1.06, the rasterizer was replaced with a new, // faster and generally-more-precise rasterizer. The new rasterizer more // accurately measures pixel coverage for anti-aliasing, except in the case // where multiple shapes overlap, in which case it overestimates the AA pixel // coverage. Thus, anti-aliasing of intersecting shapes may look wrong. If // this turns out to be a problem, you can re-enable the old rasterizer with // #define STBTT_RASTERIZER_VERSION 1 // which will incur about a 15% speed hit. // // ADDITIONAL DOCUMENTATION // // Immediately after this block comment are a series of sample programs. // // After the sample programs is the "header file" section. This section // includes documentation for each API function. // // Some important concepts to understand to use this library: // // Codepoint // Characters are defined by unicode codepoints, e.g. 65 is // uppercase A, 231 is lowercase c with a cedilla, 0x7e30 is // the hiragana for "ma". // // Glyph // A visual character shape (every codepoint is rendered as // some glyph) // // Glyph index // A font-specific integer ID representing a glyph // // Baseline // Glyph shapes are defined relative to a baseline, which is the // bottom of uppercase characters. Characters extend both above // and below the baseline. // // Current Point // As you draw text to the screen, you keep track of a "current point" // which is the origin of each character. The current point's vertical // position is the baseline. Even "baked fonts" use this model. // // Vertical Font Metrics // The vertical qualities of the font, used to vertically position // and space the characters. See docs for stbtt_GetFontVMetrics. // // Font Size in Pixels or Points // The preferred interface for specifying font sizes in stb_truetype // is to specify how tall the font's vertical extent should be in pixels. // If that sounds good enough, skip the next paragraph. // // Most font APIs instead use "points", which are a common typographic // measurement for describing font size, defined as 72 points per inch. // stb_truetype provides a point API for compatibility. However, true // "per inch" conventions don't make much sense on computer displays // since they different monitors have different number of pixels per // inch. For example, Windows traditionally uses a convention that // there are 96 pixels per inch, thus making 'inch' measurements have // nothing to do with inches, and thus effectively defining a point to // be 1.333 pixels. Additionally, the TrueType font data provides // an explicit scale factor to scale a given font's glyphs to points, // but the author has observed that this scale factor is often wrong // for non-commercial fonts, thus making fonts scaled in points // according to the TrueType spec incoherently sized in practice. // // ADVANCED USAGE // // Quality: // // - Use the functions with Subpixel at the end to allow your characters // to have subpixel positioning. Since the font is anti-aliased, not // hinted, this is very import for quality. (This is not possible with // baked fonts.) // // - Kerning is now supported, and if you're supporting subpixel rendering // then kerning is worth using to give your text a polished look. // // Performance: // // - Convert Unicode codepoints to glyph indexes and operate on the glyphs; // if you don't do this, stb_truetype is forced to do the conversion on // every call. // // - There are a lot of memory allocations. We should modify it to take // a temp buffer and allocate from the temp buffer (without freeing), // should help performance a lot. // // NOTES // // The system uses the raw data found in the .ttf file without changing it // and without building auxiliary data structures. This is a bit inefficient // on little-endian systems (the data is big-endian), but assuming you're // caching the bitmaps or glyph shapes this shouldn't be a big deal. // // It appears to be very hard to programmatically determine what font a // given file is in a general way. I provide an API for this, but I don't // recommend it. // // // SOURCE STATISTICS (based on v0.6c, 2050 LOC) // // Documentation & header file 520 LOC \___ 660 LOC documentation // Sample code 140 LOC / // Truetype parsing 620 LOC ---- 620 LOC TrueType // Software rasterization 240 LOC \ . // Curve tesselation 120 LOC \__ 550 LOC Bitmap creation // Bitmap management 100 LOC / // Baked bitmap interface 70 LOC / // Font name matching & access 150 LOC ---- 150 // C runtime library abstraction 60 LOC ---- 60 // // // PERFORMANCE MEASUREMENTS FOR 1.06: // // 32-bit 64-bit // Previous release: 8.83 s 7.68 s // Pool allocations: 7.72 s 6.34 s // Inline sort : 6.54 s 5.65 s // New rasterizer : 5.63 s 5.00 s ////////////////////////////////////////////////////////////////////////////// ////////////////////////////////////////////////////////////////////////////// //// //// SAMPLE PROGRAMS //// // // Incomplete text-in-3d-api example, which draws quads properly aligned to be lossless // #if 0 #define STB_TRUETYPE_IMPLEMENTATION // force following include to generate implementation #include "stb_truetype.h" unsigned char ttf_buffer[1<<20]; unsigned char temp_bitmap[512*512]; stbtt_bakedchar cdata[96]; // ASCII 32..126 is 95 glyphs GLuint ftex; void my_stbtt_initfont(void) { fread(ttf_buffer, 1, 1<<20, fopen("c:/windows/fonts/times.ttf", "rb")); stbtt_BakeFontBitmap(ttf_buffer,0, 32.0, temp_bitmap,512,512, 32,96, cdata); // no guarantee this fits! // can free ttf_buffer at this point glGenTextures(1, &ftex); glBindTexture(GL_TEXTURE_2D, ftex); glTexImage2D(GL_TEXTURE_2D, 0, GL_ALPHA, 512,512, 0, GL_ALPHA, GL_UNSIGNED_BYTE, temp_bitmap); // can free temp_bitmap at this point glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR); } void my_stbtt_print(float x, float y, char *text) { // assume orthographic projection with units = screen pixels, origin at top left glEnable(GL_TEXTURE_2D); glBindTexture(GL_TEXTURE_2D, ftex); glBegin(GL_QUADS); while (*text) { if (*text >= 32 && *text < 128) { stbtt_aligned_quad q; stbtt_GetBakedQuad(cdata, 512,512, *text-32, &x,&y,&q,1);//1=opengl & d3d10+,0=d3d9 glTexCoord2f(q.s0,q.t1); glVertex2f(q.x0,q.y0); glTexCoord2f(q.s1,q.t1); glVertex2f(q.x1,q.y0); glTexCoord2f(q.s1,q.t0); glVertex2f(q.x1,q.y1); glTexCoord2f(q.s0,q.t0); glVertex2f(q.x0,q.y1); } ++text; } glEnd(); } #endif // // ////////////////////////////////////////////////////////////////////////////// // // Complete program (this compiles): get a single bitmap, print as ASCII art // #if 0 #include #define STB_TRUETYPE_IMPLEMENTATION // force following include to generate implementation #include "stb_truetype.h" char ttf_buffer[1<<25]; int main(int argc, char **argv) { stbtt_fontinfo font; unsigned char *bitmap; int w,h,i,j,c = (argc > 1 ? atoi(argv[1]) : 'a'), s = (argc > 2 ? atoi(argv[2]) : 20); fread(ttf_buffer, 1, 1<<25, fopen(argc > 3 ? argv[3] : "c:/windows/fonts/arialbd.ttf", "rb")); stbtt_InitFont(&font, ttf_buffer, stbtt_GetFontOffsetForIndex(ttf_buffer,0)); bitmap = stbtt_GetCodepointBitmap(&font, 0,stbtt_ScaleForPixelHeight(&font, s), c, &w, &h, 0,0); for (j=0; j < h; ++j) { for (i=0; i < w; ++i) putchar(" .:ioVM@"[bitmap[j*w+i]>>5]); putchar('\n'); } return 0; } #endif // // Output: // // .ii. // @@@@@@. // V@Mio@@o // :i. V@V // :oM@@M // :@@@MM@M // @@o o@M // :@@. M@M // @@@o@@@@ // :M@@V:@@. // ////////////////////////////////////////////////////////////////////////////// // // Complete program: print "Hello World!" banner, with bugs // #if 0 char buffer[24<<20]; unsigned char screen[20][79]; int main(int arg, char **argv) { stbtt_fontinfo font; int i,j,ascent,baseline,ch=0; float scale, xpos=2; // leave a little padding in case the character extends left char *text = "Heljo World!"; // intentionally misspelled to show 'lj' brokenness fread(buffer, 1, 1000000, fopen("c:/windows/fonts/arialbd.ttf", "rb")); stbtt_InitFont(&font, buffer, 0); scale = stbtt_ScaleForPixelHeight(&font, 15); stbtt_GetFontVMetrics(&font, &ascent,0,0); baseline = (int) (ascent*scale); while (text[ch]) { int advance,lsb,x0,y0,x1,y1; float x_shift = xpos - (float) floor(xpos); stbtt_GetCodepointHMetrics(&font, text[ch], &advance, &lsb); stbtt_GetCodepointBitmapBoxSubpixel(&font, text[ch], scale,scale,x_shift,0, &x0,&y0,&x1,&y1); stbtt_MakeCodepointBitmapSubpixel(&font, &screen[baseline + y0][(int) xpos + x0], x1-x0,y1-y0, 79, scale,scale,x_shift,0, text[ch]); // note that this stomps the old data, so where character boxes overlap (e.g. 'lj') it's wrong // because this API is really for baking character bitmaps into textures. if you want to render // a sequence of characters, you really need to render each bitmap to a temp buffer, then // "alpha blend" that into the working buffer xpos += (advance * scale); if (text[ch+1]) xpos += scale*stbtt_GetCodepointKernAdvance(&font, text[ch],text[ch+1]); ++ch; } for (j=0; j < 20; ++j) { for (i=0; i < 78; ++i) putchar(" .:ioVM@"[screen[j][i]>>5]); putchar('\n'); } return 0; } #endif ////////////////////////////////////////////////////////////////////////////// ////////////////////////////////////////////////////////////////////////////// //// //// INTEGRATION WITH YOUR CODEBASE //// //// The following sections allow you to supply alternate definitions //// of C library functions used by stb_truetype. #ifdef STB_TRUETYPE_IMPLEMENTATION // #define your own (u)stbtt_int8/16/32 before including to override this #ifndef stbtt_uint8 typedef unsigned char stbtt_uint8; typedef signed char stbtt_int8; typedef unsigned short stbtt_uint16; typedef signed short stbtt_int16; typedef unsigned int stbtt_uint32; typedef signed int stbtt_int32; #endif typedef char stbtt__check_size32[sizeof(stbtt_int32)==4 ? 1 : -1]; typedef char stbtt__check_size16[sizeof(stbtt_int16)==2 ? 1 : -1]; // #define your own STBTT_ifloor/STBTT_iceil() to avoid math.h #ifndef STBTT_ifloor #include #define STBTT_ifloor(x) ((int) floor(x)) #define STBTT_iceil(x) ((int) ceil(x)) #endif #ifndef STBTT_sqrt #include #define STBTT_sqrt(x) sqrt(x) #define STBTT_pow(x,y) pow(x,y) #endif #ifndef STBTT_cos #include #define STBTT_cos(x) cos(x) #define STBTT_acos(x) acos(x) #endif #ifndef STBTT_fabs #include #define STBTT_fabs(x) fabs(x) #endif #ifndef STBTT_fabs #include #define STBTT_fabs(x) fabs(x) #endif // #define your own functions "STBTT_malloc" / "STBTT_free" to avoid malloc.h #ifndef STBTT_malloc #include #define STBTT_malloc(x,u) ((void)(u),malloc(x)) #define STBTT_free(x,u) ((void)(u),free(x)) #endif #ifndef STBTT_assert #include #define STBTT_assert(x) assert(x) #endif #ifndef STBTT_strlen #include #define STBTT_strlen(x) strlen(x) #endif #ifndef STBTT_memcpy #include #define STBTT_memcpy memcpy #define STBTT_memset memset #endif #endif /////////////////////////////////////////////////////////////////////////////// /////////////////////////////////////////////////////////////////////////////// //// //// INTERFACE //// //// #ifndef __STB_INCLUDE_STB_TRUETYPE_H__ #define __STB_INCLUDE_STB_TRUETYPE_H__ #ifdef STBTT_STATIC #define STBTT_DEF static #else #define STBTT_DEF extern #endif #ifdef __cplusplus extern "C" { #endif // private structure typedef struct { unsigned char *data; int cursor; int size; } stbtt__buf; ////////////////////////////////////////////////////////////////////////////// // // TEXTURE BAKING API // // If you use this API, you only have to call two functions ever. // typedef struct { unsigned short x0,y0,x1,y1; // coordinates of bbox in bitmap float xoff,yoff,xadvance; } stbtt_bakedchar; STBTT_DEF int stbtt_BakeFontBitmap(const unsigned char *data, int offset, // font location (use offset=0 for plain .ttf) float pixel_height, // height of font in pixels unsigned char *pixels, int pw, int ph, // bitmap to be filled in int first_char, int num_chars, // characters to bake stbtt_bakedchar *chardata); // you allocate this, it's num_chars long // if return is positive, the first unused row of the bitmap // if return is negative, returns the negative of the number of characters that fit // if return is 0, no characters fit and no rows were used // This uses a very crappy packing. typedef struct { float x0,y0,s0,t0; // top-left float x1,y1,s1,t1; // bottom-right } stbtt_aligned_quad; STBTT_DEF void stbtt_GetBakedQuad(const stbtt_bakedchar *chardata, int pw, int ph, // same data as above int char_index, // character to display float *xpos, float *ypos, // pointers to current position in screen pixel space stbtt_aligned_quad *q, // output: quad to draw int opengl_fillrule); // true if opengl fill rule; false if DX9 or earlier // Call GetBakedQuad with char_index = 'character - first_char', and it // creates the quad you need to draw and advances the current position. // // The coordinate system used assumes y increases downwards. // // Characters will extend both above and below the current position; // see discussion of "BASELINE" above. // // It's inefficient; you might want to c&p it and optimize it. ////////////////////////////////////////////////////////////////////////////// // // NEW TEXTURE BAKING API // // This provides options for packing multiple fonts into one atlas, not // perfectly but better than nothing. typedef struct { unsigned short x0,y0,x1,y1; // coordinates of bbox in bitmap float xoff,yoff,xadvance; float xoff2,yoff2; } stbtt_packedchar; typedef struct stbtt_pack_context stbtt_pack_context; typedef struct stbtt_fontinfo stbtt_fontinfo; #ifndef STB_RECT_PACK_VERSION typedef struct stbrp_rect stbrp_rect; #endif STBTT_DEF int stbtt_PackBegin(stbtt_pack_context *spc, unsigned char *pixels, int width, int height, int stride_in_bytes, int padding, void *alloc_context); // Initializes a packing context stored in the passed-in stbtt_pack_context. // Future calls using this context will pack characters into the bitmap passed // in here: a 1-channel bitmap that is width * height. stride_in_bytes is // the distance from one row to the next (or 0 to mean they are packed tightly // together). "padding" is the amount of padding to leave between each // character (normally you want '1' for bitmaps you'll use as textures with // bilinear filtering). // // Returns 0 on failure, 1 on success. STBTT_DEF void stbtt_PackEnd (stbtt_pack_context *spc); // Cleans up the packing context and frees all memory. #define STBTT_POINT_SIZE(x) (-(x)) STBTT_DEF int stbtt_PackFontRange(stbtt_pack_context *spc, const unsigned char *fontdata, int font_index, float font_size, int first_unicode_char_in_range, int num_chars_in_range, stbtt_packedchar *chardata_for_range); // Creates character bitmaps from the font_index'th font found in fontdata (use // font_index=0 if you don't know what that is). It creates num_chars_in_range // bitmaps for characters with unicode values starting at first_unicode_char_in_range // and increasing. Data for how to render them is stored in chardata_for_range; // pass these to stbtt_GetPackedQuad to get back renderable quads. // // font_size is the full height of the character from ascender to descender, // as computed by stbtt_ScaleForPixelHeight. To use a point size as computed // by stbtt_ScaleForMappingEmToPixels, wrap the point size in STBTT_POINT_SIZE() // and pass that result as 'font_size': // ..., 20 , ... // font max minus min y is 20 pixels tall // ..., STBTT_POINT_SIZE(20), ... // 'M' is 20 pixels tall typedef struct { float font_size; int first_unicode_codepoint_in_range; // if non-zero, then the chars are continuous, and this is the first codepoint int *array_of_unicode_codepoints; // if non-zero, then this is an array of unicode codepoints int num_chars; stbtt_packedchar *chardata_for_range; // output unsigned char h_oversample, v_oversample; // don't set these, they're used internally } stbtt_pack_range; STBTT_DEF int stbtt_PackFontRanges(stbtt_pack_context *spc, const unsigned char *fontdata, int font_index, stbtt_pack_range *ranges, int num_ranges); // Creates character bitmaps from multiple ranges of characters stored in // ranges. This will usually create a better-packed bitmap than multiple // calls to stbtt_PackFontRange. Note that you can call this multiple // times within a single PackBegin/PackEnd. STBTT_DEF void stbtt_PackSetOversampling(stbtt_pack_context *spc, unsigned int h_oversample, unsigned int v_oversample); // Oversampling a font increases the quality by allowing higher-quality subpixel // positioning, and is especially valuable at smaller text sizes. // // This function sets the amount of oversampling for all following calls to // stbtt_PackFontRange(s) or stbtt_PackFontRangesGatherRects for a given // pack context. The default (no oversampling) is achieved by h_oversample=1 // and v_oversample=1. The total number of pixels required is // h_oversample*v_oversample larger than the default; for example, 2x2 // oversampling requires 4x the storage of 1x1. For best results, render // oversampled textures with bilinear filtering. Look at the readme in // stb/tests/oversample for information about oversampled fonts // // To use with PackFontRangesGather etc., you must set it before calls // call to PackFontRangesGatherRects. STBTT_DEF void stbtt_GetPackedQuad(const stbtt_packedchar *chardata, int pw, int ph, // same data as above int char_index, // character to display float *xpos, float *ypos, // pointers to current position in screen pixel space stbtt_aligned_quad *q, // output: quad to draw int align_to_integer); STBTT_DEF int stbtt_PackFontRangesGatherRects(stbtt_pack_context *spc, const stbtt_fontinfo *info, stbtt_pack_range *ranges, int num_ranges, stbrp_rect *rects); STBTT_DEF void stbtt_PackFontRangesPackRects(stbtt_pack_context *spc, stbrp_rect *rects, int num_rects); STBTT_DEF int stbtt_PackFontRangesRenderIntoRects(stbtt_pack_context *spc, const stbtt_fontinfo *info, stbtt_pack_range *ranges, int num_ranges, stbrp_rect *rects); // Calling these functions in sequence is roughly equivalent to calling // stbtt_PackFontRanges(). If you more control over the packing of multiple // fonts, or if you want to pack custom data into a font texture, take a look // at the source to of stbtt_PackFontRanges() and create a custom version // using these functions, e.g. call GatherRects multiple times, // building up a single array of rects, then call PackRects once, // then call RenderIntoRects repeatedly. This may result in a // better packing than calling PackFontRanges multiple times // (or it may not). // this is an opaque structure that you shouldn't mess with which holds // all the context needed from PackBegin to PackEnd. struct stbtt_pack_context { void *user_allocator_context; void *pack_info; int width; int height; int stride_in_bytes; int padding; unsigned int h_oversample, v_oversample; unsigned char *pixels; void *nodes; }; ////////////////////////////////////////////////////////////////////////////// // // FONT LOADING // // STBTT_DEF int stbtt_GetNumberOfFonts(const unsigned char *data); // This function will determine the number of fonts in a font file. TrueType // collection (.ttc) files may contain multiple fonts, while TrueType font // (.ttf) files only contain one font. The number of fonts can be used for // indexing with the previous function where the index is between zero and one // less than the total fonts. If an error occurs, -1 is returned. STBTT_DEF int stbtt_GetFontOffsetForIndex(const unsigned char *data, int index); // Each .ttf/.ttc file may have more than one font. Each font has a sequential // index number starting from 0. Call this function to get the font offset for // a given index; it returns -1 if the index is out of range. A regular .ttf // file will only define one font and it always be at offset 0, so it will // return '0' for index 0, and -1 for all other indices. // The following structure is defined publically so you can declare one on // the stack or as a global or etc, but you should treat it as opaque. struct stbtt_fontinfo { void * userdata; unsigned char * data; // pointer to .ttf file int fontstart; // offset of start of font int numGlyphs; // number of glyphs, needed for range checking int loca,head,glyf,hhea,hmtx,kern; // table locations as offset from start of .ttf int index_map; // a cmap mapping for our chosen character encoding int indexToLocFormat; // format needed to map from glyph index to glyph stbtt__buf cff; // cff font data stbtt__buf charstrings; // the charstring index stbtt__buf gsubrs; // global charstring subroutines index stbtt__buf subrs; // private charstring subroutines index stbtt__buf fontdicts; // array of font dicts stbtt__buf fdselect; // map from glyph to fontdict }; STBTT_DEF int stbtt_InitFont(stbtt_fontinfo *info, const unsigned char *data, int offset); // Given an offset into the file that defines a font, this function builds // the necessary cached info for the rest of the system. You must allocate // the stbtt_fontinfo yourself, and stbtt_InitFont will fill it out. You don't // need to do anything special to free it, because the contents are pure // value data with no additional data structures. Returns 0 on failure. ////////////////////////////////////////////////////////////////////////////// // // CHARACTER TO GLYPH-INDEX CONVERSIOn STBTT_DEF int stbtt_FindGlyphIndex(const stbtt_fontinfo *info, int unicode_codepoint); // If you're going to perform multiple operations on the same character // and you want a speed-up, call this function with the character you're // going to process, then use glyph-based functions instead of the // codepoint-based functions. ////////////////////////////////////////////////////////////////////////////// // // CHARACTER PROPERTIES // STBTT_DEF float stbtt_ScaleForPixelHeight(const stbtt_fontinfo *info, float pixels); // computes a scale factor to produce a font whose "height" is 'pixels' tall. // Height is measured as the distance from the highest ascender to the lowest // descender; in other words, it's equivalent to calling stbtt_GetFontVMetrics // and computing: // scale = pixels / (ascent - descent) // so if you prefer to measure height by the ascent only, use a similar calculation. STBTT_DEF float stbtt_ScaleForMappingEmToPixels(const stbtt_fontinfo *info, float pixels); // computes a scale factor to produce a font whose EM size is mapped to // 'pixels' tall. This is probably what traditional APIs compute, but // I'm not positive. STBTT_DEF void stbtt_GetFontVMetrics(const stbtt_fontinfo *info, int *ascent, int *descent, int *lineGap); // ascent is the coordinate above the baseline the font extends; descent // is the coordinate below the baseline the font extends (i.e. it is typically negative) // lineGap is the spacing between one row's descent and the next row's ascent... // so you should advance the vertical position by "*ascent - *descent + *lineGap" // these are expressed in unscaled coordinates, so you must multiply by // the scale factor for a given size STBTT_DEF int stbtt_GetFontVMetricsOS2(const stbtt_fontinfo *info, int *typoAscent, int *typoDescent, int *typoLineGap); // analogous to GetFontVMetrics, but returns the "typographic" values from the OS/2 // table (specific to MS/Windows TTF files). // // Returns 1 on success (table present), 0 on failure. STBTT_DEF void stbtt_GetFontBoundingBox(const stbtt_fontinfo *info, int *x0, int *y0, int *x1, int *y1); // the bounding box around all possible characters STBTT_DEF void stbtt_GetCodepointHMetrics(const stbtt_fontinfo *info, int codepoint, int *advanceWidth, int *leftSideBearing); // leftSideBearing is the offset from the current horizontal position to the left edge of the character // advanceWidth is the offset from the current horizontal position to the next horizontal position // these are expressed in unscaled coordinates STBTT_DEF int stbtt_GetCodepointKernAdvance(const stbtt_fontinfo *info, int ch1, int ch2); // an additional amount to add to the 'advance' value between ch1 and ch2 STBTT_DEF int stbtt_GetCodepointBox(const stbtt_fontinfo *info, int codepoint, int *x0, int *y0, int *x1, int *y1); // Gets the bounding box of the visible part of the glyph, in unscaled coordinates STBTT_DEF void stbtt_GetGlyphHMetrics(const stbtt_fontinfo *info, int glyph_index, int *advanceWidth, int *leftSideBearing); STBTT_DEF int stbtt_GetGlyphKernAdvance(const stbtt_fontinfo *info, int glyph1, int glyph2); STBTT_DEF int stbtt_GetGlyphBox(const stbtt_fontinfo *info, int glyph_index, int *x0, int *y0, int *x1, int *y1); // as above, but takes one or more glyph indices for greater efficiency ////////////////////////////////////////////////////////////////////////////// // // GLYPH SHAPES (you probably don't need these, but they have to go before // the bitmaps for C declaration-order reasons) // #ifndef STBTT_vmove // you can predefine these to use different values (but why?) enum { STBTT_vmove=1, STBTT_vline, STBTT_vcurve, STBTT_vcubic }; #endif #ifndef stbtt_vertex // you can predefine this to use different values // (we share this with other code at RAD) #define stbtt_vertex_type short // can't use stbtt_int16 because that's not visible in the header file typedef struct { stbtt_vertex_type x,y,cx,cy,cx1,cy1; unsigned char type,padding; } stbtt_vertex; #endif STBTT_DEF int stbtt_IsGlyphEmpty(const stbtt_fontinfo *info, int glyph_index); // returns non-zero if nothing is drawn for this glyph STBTT_DEF int stbtt_GetCodepointShape(const stbtt_fontinfo *info, int unicode_codepoint, stbtt_vertex **vertices); STBTT_DEF int stbtt_GetGlyphShape(const stbtt_fontinfo *info, int glyph_index, stbtt_vertex **vertices); // returns # of vertices and fills *vertices with the pointer to them // these are expressed in "unscaled" coordinates // // The shape is a series of countours. Each one starts with // a STBTT_moveto, then consists of a series of mixed // STBTT_lineto and STBTT_curveto segments. A lineto // draws a line from previous endpoint to its x,y; a curveto // draws a quadratic bezier from previous endpoint to // its x,y, using cx,cy as the bezier control point. STBTT_DEF void stbtt_FreeShape(const stbtt_fontinfo *info, stbtt_vertex *vertices); // frees the data allocated above ////////////////////////////////////////////////////////////////////////////// // // BITMAP RENDERING // STBTT_DEF void stbtt_FreeBitmap(unsigned char *bitmap, void *userdata); // frees the bitmap allocated below STBTT_DEF unsigned char *stbtt_GetCodepointBitmap(const stbtt_fontinfo *info, float scale_x, float scale_y, int codepoint, int *width, int *height, int *xoff, int *yoff); // allocates a large-enough single-channel 8bpp bitmap and renders the // specified character/glyph at the specified scale into it, with // antialiasing. 0 is no coverage (transparent), 255 is fully covered (opaque). // *width & *height are filled out with the width & height of the bitmap, // which is stored left-to-right, top-to-bottom. // // xoff/yoff are the offset it pixel space from the glyph origin to the top-left of the bitmap STBTT_DEF unsigned char *stbtt_GetCodepointBitmapSubpixel(const stbtt_fontinfo *info, float scale_x, float scale_y, float shift_x, float shift_y, int codepoint, int *width, int *height, int *xoff, int *yoff); // the same as stbtt_GetCodepoitnBitmap, but you can specify a subpixel // shift for the character STBTT_DEF void stbtt_MakeCodepointBitmap(const stbtt_fontinfo *info, unsigned char *output, int out_w, int out_h, int out_stride, float scale_x, float scale_y, int codepoint); // the same as stbtt_GetCodepointBitmap, but you pass in storage for the bitmap // in the form of 'output', with row spacing of 'out_stride' bytes. the bitmap // is clipped to out_w/out_h bytes. Call stbtt_GetCodepointBitmapBox to get the // width and height and positioning info for it first. STBTT_DEF void stbtt_MakeCodepointBitmapSubpixel(const stbtt_fontinfo *info, unsigned char *output, int out_w, int out_h, int out_stride, float scale_x, float scale_y, float shift_x, float shift_y, int codepoint); // same as stbtt_MakeCodepointBitmap, but you can specify a subpixel // shift for the character STBTT_DEF void stbtt_MakeCodepointBitmapSubpixelPrefilter(const stbtt_fontinfo *info, unsigned char *output, int out_w, int out_h, int out_stride, float scale_x, float scale_y, float shift_x, float shift_y, int oversample_x, int oversample_y, float *sub_x, float *sub_y, int codepoint); // same as stbtt_MakeCodepointBitmapSubpixel, but prefiltering // is performed (see stbtt_PackSetOversampling) STBTT_DEF void stbtt_GetCodepointBitmapBox(const stbtt_fontinfo *font, int codepoint, float scale_x, float scale_y, int *ix0, int *iy0, int *ix1, int *iy1); // get the bbox of the bitmap centered around the glyph origin; so the // bitmap width is ix1-ix0, height is iy1-iy0, and location to place // the bitmap top left is (leftSideBearing*scale,iy0). // (Note that the bitmap uses y-increases-down, but the shape uses // y-increases-up, so CodepointBitmapBox and CodepointBox are inverted.) STBTT_DEF void stbtt_GetCodepointBitmapBoxSubpixel(const stbtt_fontinfo *font, int codepoint, float scale_x, float scale_y, float shift_x, float shift_y, int *ix0, int *iy0, int *ix1, int *iy1); // same as stbtt_GetCodepointBitmapBox, but you can specify a subpixel // shift for the character // the following functions are equivalent to the above functions, but operate // on glyph indices instead of Unicode codepoints (for efficiency) STBTT_DEF unsigned char *stbtt_GetGlyphBitmap(const stbtt_fontinfo *info, float scale_x, float scale_y, int glyph, int *width, int *height, int *xoff, int *yoff); STBTT_DEF unsigned char *stbtt_GetGlyphBitmapSubpixel(const stbtt_fontinfo *info, float scale_x, float scale_y, float shift_x, float shift_y, int glyph, int *width, int *height, int *xoff, int *yoff); STBTT_DEF void stbtt_MakeGlyphBitmap(const stbtt_fontinfo *info, unsigned char *output, int out_w, int out_h, int out_stride, float scale_x, float scale_y, int glyph); STBTT_DEF void stbtt_MakeGlyphBitmapSubpixel(const stbtt_fontinfo *info, unsigned char *output, int out_w, int out_h, int out_stride, float scale_x, float scale_y, float shift_x, float shift_y, int glyph); STBTT_DEF void stbtt_MakeGlyphBitmapSubpixelPrefilter(const stbtt_fontinfo *info, unsigned char *output, int out_w, int out_h, int out_stride, float scale_x, float scale_y, float shift_x, float shift_y, int oversample_x, int oversample_y, float *sub_x, float *sub_y, int glyph); STBTT_DEF void stbtt_GetGlyphBitmapBox(const stbtt_fontinfo *font, int glyph, float scale_x, float scale_y, int *ix0, int *iy0, int *ix1, int *iy1); STBTT_DEF void stbtt_GetGlyphBitmapBoxSubpixel(const stbtt_fontinfo *font, int glyph, float scale_x, float scale_y,float shift_x, float shift_y, int *ix0, int *iy0, int *ix1, int *iy1); // @TODO: don't expose this structure typedef struct { int w,h,stride; unsigned char *pixels; } stbtt__bitmap; // rasterize a shape with quadratic beziers into a bitmap STBTT_DEF void stbtt_Rasterize(stbtt__bitmap *result, // 1-channel bitmap to draw into float flatness_in_pixels, // allowable error of curve in pixels stbtt_vertex *vertices, // array of vertices defining shape int num_verts, // number of vertices in above array float scale_x, float scale_y, // scale applied to input vertices float shift_x, float shift_y, // translation applied to input vertices int x_off, int y_off, // another translation applied to input int invert, // if non-zero, vertically flip shape void *userdata); // context for to STBTT_MALLOC ////////////////////////////////////////////////////////////////////////////// // // Signed Distance Function (or Field) rendering STBTT_DEF void stbtt_FreeSDF(unsigned char *bitmap, void *userdata); // frees the SDF bitmap allocated below STBTT_DEF unsigned char * stbtt_GetGlyphSDF(const stbtt_fontinfo *info, float scale, int glyph, int padding, unsigned char onedge_value, float pixel_dist_scale, int *width, int *height, int *xoff, int *yoff); STBTT_DEF unsigned char * stbtt_GetCodepointSDF(const stbtt_fontinfo *info, float scale, int codepoint, int padding, unsigned char onedge_value, float pixel_dist_scale, int *width, int *height, int *xoff, int *yoff); // These functions compute a discretized SDF field for a single character, suitable for storing // in a single-channel texture, sampling with bilinear filtering, and testing against // larger than some threshhold to produce scalable fonts. // info -- the font // scale -- controls the size of the resulting SDF bitmap, same as it would be creating a regular bitmap // glyph/codepoint -- the character to generate the SDF for // padding -- extra "pixels" around the character which are filled with the distance to the character (not 0), // which allows effects like bit outlines // onedge_value -- value 0-255 to test the SDF against to reconstruct the character (i.e. the isocontour of the character) // pixel_dist_scale -- what value the SDF should increase by when moving one SDF "pixel" away from the edge (on the 0..255 scale) // if positive, > onedge_value is inside; if negative, < onedge_value is inside // width,height -- output height & width of the SDF bitmap (including padding) // xoff,yoff -- output origin of the character // return value -- a 2D array of bytes 0..255, width*height in size // // pixel_dist_scale & onedge_value are a scale & bias that allows you to make // optimal use of the limited 0..255 for your application, trading off precision // and special effects. SDF values outside the range 0..255 are clamped to 0..255. // // Example: // scale = stbtt_ScaleForPixelHeight(22) // padding = 5 // onedge_value = 180 // pixel_dist_scale = 180/5.0 = 36.0 // // This will create an SDF bitmap in which the character is about 22 pixels // high but the whole bitmap is about 22+5+5=32 pixels high. To produce a filled // shape, sample the SDF at each pixel and fill the pixel if the SDF value // is greater than or equal to 180/255. (You'll actually want to antialias, // which is beyond the scope of this example.) Additionally, you can compute // offset outlines (e.g. to stroke the character border inside & outside, // or only outside). For example, to fill outside the character up to 3 SDF // pixels, you would compare against (180-36.0*3)/255 = 72/255. The above // choice of variables maps a range from 5 pixels outside the shape to // 2 pixels inside the shape to 0..255; this is intended primarily for apply // outside effects only (the interior range is needed to allow proper // antialiasing of the font at *smaller* sizes) // // The function computes the SDF analytically at each SDF pixel, not by e.g. // building a higher-res bitmap and approximating it. In theory the quality // should be as high as possible for an SDF of this size & representation, but // unclear if this is true in practice (perhaps building a higher-res bitmap // and computing from that can allow drop-out prevention). // // The algorithm has not been optimized at all, so expect it to be slow // if computing lots of characters or very large sizes. ////////////////////////////////////////////////////////////////////////////// // // Finding the right font... // // You should really just solve this offline, keep your own tables // of what font is what, and don't try to get it out of the .ttf file. // That's because getting it out of the .ttf file is really hard, because // the names in the file can appear in many possible encodings, in many // possible languages, and e.g. if you need a case-insensitive comparison, // the details of that depend on the encoding & language in a complex way // (actually underspecified in truetype, but also gigantic). // // But you can use the provided functions in two possible ways: // stbtt_FindMatchingFont() will use *case-sensitive* comparisons on // unicode-encoded names to try to find the font you want; // you can run this before calling stbtt_InitFont() // // stbtt_GetFontNameString() lets you get any of the various strings // from the file yourself and do your own comparisons on them. // You have to have called stbtt_InitFont() first. STBTT_DEF int stbtt_FindMatchingFont(const unsigned char *fontdata, const char *name, int flags); // returns the offset (not index) of the font that matches, or -1 if none // if you use STBTT_MACSTYLE_DONTCARE, use a font name like "Arial Bold". // if you use any other flag, use a font name like "Arial"; this checks // the 'macStyle' header field; i don't know if fonts set this consistently #define STBTT_MACSTYLE_DONTCARE 0 #define STBTT_MACSTYLE_BOLD 1 #define STBTT_MACSTYLE_ITALIC 2 #define STBTT_MACSTYLE_UNDERSCORE 4 #define STBTT_MACSTYLE_NONE 8 // <= not same as 0, this makes us check the bitfield is 0 STBTT_DEF int stbtt_CompareUTF8toUTF16_bigendian(const char *s1, int len1, const char *s2, int len2); // returns 1/0 whether the first string interpreted as utf8 is identical to // the second string interpreted as big-endian utf16... useful for strings from next func STBTT_DEF const char *stbtt_GetFontNameString(const stbtt_fontinfo *font, int *length, int platformID, int encodingID, int languageID, int nameID); // returns the string (which may be big-endian double byte, e.g. for unicode) // and puts the length in bytes in *length. // // some of the values for the IDs are below; for more see the truetype spec: // http://developer.apple.com/textfonts/TTRefMan/RM06/Chap6name.html // http://www.microsoft.com/typography/otspec/name.htm enum { // platformID STBTT_PLATFORM_ID_UNICODE =0, STBTT_PLATFORM_ID_MAC =1, STBTT_PLATFORM_ID_ISO =2, STBTT_PLATFORM_ID_MICROSOFT =3 }; enum { // encodingID for STBTT_PLATFORM_ID_UNICODE STBTT_UNICODE_EID_UNICODE_1_0 =0, STBTT_UNICODE_EID_UNICODE_1_1 =1, STBTT_UNICODE_EID_ISO_10646 =2, STBTT_UNICODE_EID_UNICODE_2_0_BMP=3, STBTT_UNICODE_EID_UNICODE_2_0_FULL=4 }; enum { // encodingID for STBTT_PLATFORM_ID_MICROSOFT STBTT_MS_EID_SYMBOL =0, STBTT_MS_EID_UNICODE_BMP =1, STBTT_MS_EID_SHIFTJIS =2, STBTT_MS_EID_UNICODE_FULL =10 }; enum { // encodingID for STBTT_PLATFORM_ID_MAC; same as Script Manager codes STBTT_MAC_EID_ROMAN =0, STBTT_MAC_EID_ARABIC =4, STBTT_MAC_EID_JAPANESE =1, STBTT_MAC_EID_HEBREW =5, STBTT_MAC_EID_CHINESE_TRAD =2, STBTT_MAC_EID_GREEK =6, STBTT_MAC_EID_KOREAN =3, STBTT_MAC_EID_RUSSIAN =7 }; enum { // languageID for STBTT_PLATFORM_ID_MICROSOFT; same as LCID... // problematic because there are e.g. 16 english LCIDs and 16 arabic LCIDs STBTT_MS_LANG_ENGLISH =0x0409, STBTT_MS_LANG_ITALIAN =0x0410, STBTT_MS_LANG_CHINESE =0x0804, STBTT_MS_LANG_JAPANESE =0x0411, STBTT_MS_LANG_DUTCH =0x0413, STBTT_MS_LANG_KOREAN =0x0412, STBTT_MS_LANG_FRENCH =0x040c, STBTT_MS_LANG_RUSSIAN =0x0419, STBTT_MS_LANG_GERMAN =0x0407, STBTT_MS_LANG_SPANISH =0x0409, STBTT_MS_LANG_HEBREW =0x040d, STBTT_MS_LANG_SWEDISH =0x041D }; enum { // languageID for STBTT_PLATFORM_ID_MAC STBTT_MAC_LANG_ENGLISH =0 , STBTT_MAC_LANG_JAPANESE =11, STBTT_MAC_LANG_ARABIC =12, STBTT_MAC_LANG_KOREAN =23, STBTT_MAC_LANG_DUTCH =4 , STBTT_MAC_LANG_RUSSIAN =32, STBTT_MAC_LANG_FRENCH =1 , STBTT_MAC_LANG_SPANISH =6 , STBTT_MAC_LANG_GERMAN =2 , STBTT_MAC_LANG_SWEDISH =5 , STBTT_MAC_LANG_HEBREW =10, STBTT_MAC_LANG_CHINESE_SIMPLIFIED =33, STBTT_MAC_LANG_ITALIAN =3 , STBTT_MAC_LANG_CHINESE_TRAD =19 }; #ifdef __cplusplus } #endif #endif // __STB_INCLUDE_STB_TRUETYPE_H__ /////////////////////////////////////////////////////////////////////////////// /////////////////////////////////////////////////////////////////////////////// //// //// IMPLEMENTATION //// //// #ifdef STB_TRUETYPE_IMPLEMENTATION #ifndef STBTT_MAX_OVERSAMPLE #define STBTT_MAX_OVERSAMPLE 8 #endif #if STBTT_MAX_OVERSAMPLE > 255 #error "STBTT_MAX_OVERSAMPLE cannot be > 255" #endif typedef int stbtt__test_oversample_pow2[(STBTT_MAX_OVERSAMPLE & (STBTT_MAX_OVERSAMPLE-1)) == 0 ? 1 : -1]; #ifndef STBTT_RASTERIZER_VERSION #define STBTT_RASTERIZER_VERSION 2 #endif #ifdef _MSC_VER #define STBTT__NOTUSED(v) (void)(v) #else #define STBTT__NOTUSED(v) (void)sizeof(v) #endif ////////////////////////////////////////////////////////////////////////// // // stbtt__buf helpers to parse data from file // static stbtt_uint8 stbtt__buf_get8(stbtt__buf *b) { if (b->cursor >= b->size) return 0; return b->data[b->cursor++]; } static stbtt_uint8 stbtt__buf_peek8(stbtt__buf *b) { if (b->cursor >= b->size) return 0; return b->data[b->cursor]; } static void stbtt__buf_seek(stbtt__buf *b, int o) { STBTT_assert(!(o > b->size || o < 0)); b->cursor = (o > b->size || o < 0) ? b->size : o; } static void stbtt__buf_skip(stbtt__buf *b, int o) { stbtt__buf_seek(b, b->cursor + o); } static stbtt_uint32 stbtt__buf_get(stbtt__buf *b, int n) { stbtt_uint32 v = 0; int i; STBTT_assert(n >= 1 && n <= 4); for (i = 0; i < n; i++) v = (v << 8) | stbtt__buf_get8(b); return v; } static stbtt__buf stbtt__new_buf(const void *p, size_t size) { stbtt__buf r; STBTT_assert(size < 0x40000000); r.data = (stbtt_uint8*) p; r.size = (int) size; r.cursor = 0; return r; } #define stbtt__buf_get16(b) stbtt__buf_get((b), 2) #define stbtt__buf_get32(b) stbtt__buf_get((b), 4) static stbtt__buf stbtt__buf_range(const stbtt__buf *b, int o, int s) { stbtt__buf r = stbtt__new_buf(NULL, 0); if (o < 0 || s < 0 || o > b->size || s > b->size - o) return r; r.data = b->data + o; r.size = s; return r; } static stbtt__buf stbtt__cff_get_index(stbtt__buf *b) { int count, start, offsize; start = b->cursor; count = stbtt__buf_get16(b); if (count) { offsize = stbtt__buf_get8(b); STBTT_assert(offsize >= 1 && offsize <= 4); stbtt__buf_skip(b, offsize * count); stbtt__buf_skip(b, stbtt__buf_get(b, offsize) - 1); } return stbtt__buf_range(b, start, b->cursor - start); } static stbtt_uint32 stbtt__cff_int(stbtt__buf *b) { int b0 = stbtt__buf_get8(b); if (b0 >= 32 && b0 <= 246) return b0 - 139; else if (b0 >= 247 && b0 <= 250) return (b0 - 247)*256 + stbtt__buf_get8(b) + 108; else if (b0 >= 251 && b0 <= 254) return -(b0 - 251)*256 - stbtt__buf_get8(b) - 108; else if (b0 == 28) return stbtt__buf_get16(b); else if (b0 == 29) return stbtt__buf_get32(b); STBTT_assert(0); return 0; } static void stbtt__cff_skip_operand(stbtt__buf *b) { int v, b0 = stbtt__buf_peek8(b); STBTT_assert(b0 >= 28); if (b0 == 30) { stbtt__buf_skip(b, 1); while (b->cursor < b->size) { v = stbtt__buf_get8(b); if ((v & 0xF) == 0xF || (v >> 4) == 0xF) break; } } else { stbtt__cff_int(b); } } static stbtt__buf stbtt__dict_get(stbtt__buf *b, int key) { stbtt__buf_seek(b, 0); while (b->cursor < b->size) { int start = b->cursor, end, op; while (stbtt__buf_peek8(b) >= 28) stbtt__cff_skip_operand(b); end = b->cursor; op = stbtt__buf_get8(b); if (op == 12) op = stbtt__buf_get8(b) | 0x100; if (op == key) return stbtt__buf_range(b, start, end-start); } return stbtt__buf_range(b, 0, 0); } static void stbtt__dict_get_ints(stbtt__buf *b, int key, int outcount, stbtt_uint32 *out) { int i; stbtt__buf operands = stbtt__dict_get(b, key); for (i = 0; i < outcount && operands.cursor < operands.size; i++) out[i] = stbtt__cff_int(&operands); } static int stbtt__cff_index_count(stbtt__buf *b) { stbtt__buf_seek(b, 0); return stbtt__buf_get16(b); } static stbtt__buf stbtt__cff_index_get(stbtt__buf b, int i) { int count, offsize, start, end; stbtt__buf_seek(&b, 0); count = stbtt__buf_get16(&b); offsize = stbtt__buf_get8(&b); STBTT_assert(i >= 0 && i < count); STBTT_assert(offsize >= 1 && offsize <= 4); stbtt__buf_skip(&b, i*offsize); start = stbtt__buf_get(&b, offsize); end = stbtt__buf_get(&b, offsize); return stbtt__buf_range(&b, 2+(count+1)*offsize+start, end - start); } ////////////////////////////////////////////////////////////////////////// // // accessors to parse data from file // // on platforms that don't allow misaligned reads, if we want to allow // truetype fonts that aren't padded to alignment, define ALLOW_UNALIGNED_TRUETYPE #define ttBYTE(p) (* (stbtt_uint8 *) (p)) #define ttCHAR(p) (* (stbtt_int8 *) (p)) #define ttFixed(p) ttLONG(p) static stbtt_uint16 ttUSHORT(stbtt_uint8 *p) { return p[0]*256 + p[1]; } static stbtt_int16 ttSHORT(stbtt_uint8 *p) { return p[0]*256 + p[1]; } static stbtt_uint32 ttULONG(stbtt_uint8 *p) { return (p[0]<<24) + (p[1]<<16) + (p[2]<<8) + p[3]; } static stbtt_int32 ttLONG(stbtt_uint8 *p) { return (p[0]<<24) + (p[1]<<16) + (p[2]<<8) + p[3]; } #define stbtt_tag4(p,c0,c1,c2,c3) ((p)[0] == (c0) && (p)[1] == (c1) && (p)[2] == (c2) && (p)[3] == (c3)) #define stbtt_tag(p,str) stbtt_tag4(p,str[0],str[1],str[2],str[3]) static int stbtt__isfont(stbtt_uint8 *font) { // check the version number if (stbtt_tag4(font, '1',0,0,0)) return 1; // TrueType 1 if (stbtt_tag(font, "typ1")) return 1; // TrueType with type 1 font -- we don't support this! if (stbtt_tag(font, "OTTO")) return 1; // OpenType with CFF if (stbtt_tag4(font, 0,1,0,0)) return 1; // OpenType 1.0 if (stbtt_tag(font, "true")) return 1; // Apple specification for TrueType fonts return 0; } // @OPTIMIZE: binary search static stbtt_uint32 stbtt__find_table(stbtt_uint8 *data, stbtt_uint32 fontstart, const char *tag) { stbtt_int32 num_tables = ttUSHORT(data+fontstart+4); stbtt_uint32 tabledir = fontstart + 12; stbtt_int32 i; for (i=0; i < num_tables; ++i) { stbtt_uint32 loc = tabledir + 16*i; if (stbtt_tag(data+loc+0, tag)) return ttULONG(data+loc+8); } return 0; } static int stbtt_GetFontOffsetForIndex_internal(unsigned char *font_collection, int index) { // if it's just a font, there's only one valid index if (stbtt__isfont(font_collection)) return index == 0 ? 0 : -1; // check if it's a TTC if (stbtt_tag(font_collection, "ttcf")) { // version 1? if (ttULONG(font_collection+4) == 0x00010000 || ttULONG(font_collection+4) == 0x00020000) { stbtt_int32 n = ttLONG(font_collection+8); if (index >= n) return -1; return ttULONG(font_collection+12+index*4); } } return -1; } static int stbtt_GetNumberOfFonts_internal(unsigned char *font_collection) { // if it's just a font, there's only one valid font if (stbtt__isfont(font_collection)) return 1; // check if it's a TTC if (stbtt_tag(font_collection, "ttcf")) { // version 1? if (ttULONG(font_collection+4) == 0x00010000 || ttULONG(font_collection+4) == 0x00020000) { return ttLONG(font_collection+8); } } return 0; } static stbtt__buf stbtt__get_subrs(stbtt__buf cff, stbtt__buf fontdict) { stbtt_uint32 subrsoff = 0, private_loc[2] = { 0, 0 }; stbtt__buf pdict; stbtt__dict_get_ints(&fontdict, 18, 2, private_loc); if (!private_loc[1] || !private_loc[0]) return stbtt__new_buf(NULL, 0); pdict = stbtt__buf_range(&cff, private_loc[1], private_loc[0]); stbtt__dict_get_ints(&pdict, 19, 1, &subrsoff); if (!subrsoff) return stbtt__new_buf(NULL, 0); stbtt__buf_seek(&cff, private_loc[1]+subrsoff); return stbtt__cff_get_index(&cff); } static int stbtt_InitFont_internal(stbtt_fontinfo *info, unsigned char *data, int fontstart) { stbtt_uint32 cmap, t; stbtt_int32 i,numTables; info->data = data; info->fontstart = fontstart; info->cff = stbtt__new_buf(NULL, 0); cmap = stbtt__find_table(data, fontstart, "cmap"); // required info->loca = stbtt__find_table(data, fontstart, "loca"); // required info->head = stbtt__find_table(data, fontstart, "head"); // required info->glyf = stbtt__find_table(data, fontstart, "glyf"); // required info->hhea = stbtt__find_table(data, fontstart, "hhea"); // required info->hmtx = stbtt__find_table(data, fontstart, "hmtx"); // required info->kern = stbtt__find_table(data, fontstart, "kern"); // not required if (!cmap || !info->head || !info->hhea || !info->hmtx) return 0; if (info->glyf) { // required for truetype if (!info->loca) return 0; } else { // initialization for CFF / Type2 fonts (OTF) stbtt__buf b, topdict, topdictidx; stbtt_uint32 cstype = 2, charstrings = 0, fdarrayoff = 0, fdselectoff = 0; stbtt_uint32 cff; cff = stbtt__find_table(data, fontstart, "CFF "); if (!cff) return 0; info->fontdicts = stbtt__new_buf(NULL, 0); info->fdselect = stbtt__new_buf(NULL, 0); // @TODO this should use size from table (not 512MB) info->cff = stbtt__new_buf(data+cff, 512*1024*1024); b = info->cff; // read the header stbtt__buf_skip(&b, 2); stbtt__buf_seek(&b, stbtt__buf_get8(&b)); // hdrsize // @TODO the name INDEX could list multiple fonts, // but we just use the first one. stbtt__cff_get_index(&b); // name INDEX topdictidx = stbtt__cff_get_index(&b); topdict = stbtt__cff_index_get(topdictidx, 0); stbtt__cff_get_index(&b); // string INDEX info->gsubrs = stbtt__cff_get_index(&b); stbtt__dict_get_ints(&topdict, 17, 1, &charstrings); stbtt__dict_get_ints(&topdict, 0x100 | 6, 1, &cstype); stbtt__dict_get_ints(&topdict, 0x100 | 36, 1, &fdarrayoff); stbtt__dict_get_ints(&topdict, 0x100 | 37, 1, &fdselectoff); info->subrs = stbtt__get_subrs(b, topdict); // we only support Type 2 charstrings if (cstype != 2) return 0; if (charstrings == 0) return 0; if (fdarrayoff) { // looks like a CID font if (!fdselectoff) return 0; stbtt__buf_seek(&b, fdarrayoff); info->fontdicts = stbtt__cff_get_index(&b); info->fdselect = stbtt__buf_range(&b, fdselectoff, b.size-fdselectoff); } stbtt__buf_seek(&b, charstrings); info->charstrings = stbtt__cff_get_index(&b); } t = stbtt__find_table(data, fontstart, "maxp"); if (t) info->numGlyphs = ttUSHORT(data+t+4); else info->numGlyphs = 0xffff; // find a cmap encoding table we understand *now* to avoid searching // later. (todo: could make this installable) // the same regardless of glyph. numTables = ttUSHORT(data + cmap + 2); info->index_map = 0; for (i=0; i < numTables; ++i) { stbtt_uint32 encoding_record = cmap + 4 + 8 * i; // find an encoding we understand: switch(ttUSHORT(data+encoding_record)) { case STBTT_PLATFORM_ID_MICROSOFT: switch (ttUSHORT(data+encoding_record+2)) { case STBTT_MS_EID_UNICODE_BMP: case STBTT_MS_EID_UNICODE_FULL: // MS/Unicode info->index_map = cmap + ttULONG(data+encoding_record+4); break; } break; case STBTT_PLATFORM_ID_UNICODE: // Mac/iOS has these // all the encodingIDs are unicode, so we don't bother to check it info->index_map = cmap + ttULONG(data+encoding_record+4); break; } } if (info->index_map == 0) return 0; info->indexToLocFormat = ttUSHORT(data+info->head + 50); return 1; } STBTT_DEF int stbtt_FindGlyphIndex(const stbtt_fontinfo *info, int unicode_codepoint) { stbtt_uint8 *data = info->data; stbtt_uint32 index_map = info->index_map; stbtt_uint16 format = ttUSHORT(data + index_map + 0); if (format == 0) { // apple byte encoding stbtt_int32 bytes = ttUSHORT(data + index_map + 2); if (unicode_codepoint < bytes-6) return ttBYTE(data + index_map + 6 + unicode_codepoint); return 0; } else if (format == 6) { stbtt_uint32 first = ttUSHORT(data + index_map + 6); stbtt_uint32 count = ttUSHORT(data + index_map + 8); if ((stbtt_uint32) unicode_codepoint >= first && (stbtt_uint32) unicode_codepoint < first+count) return ttUSHORT(data + index_map + 10 + (unicode_codepoint - first)*2); return 0; } else if (format == 2) { STBTT_assert(0); // @TODO: high-byte mapping for japanese/chinese/korean return 0; } else if (format == 4) { // standard mapping for windows fonts: binary search collection of ranges stbtt_uint16 segcount = ttUSHORT(data+index_map+6) >> 1; stbtt_uint16 searchRange = ttUSHORT(data+index_map+8) >> 1; stbtt_uint16 entrySelector = ttUSHORT(data+index_map+10); stbtt_uint16 rangeShift = ttUSHORT(data+index_map+12) >> 1; // do a binary search of the segments stbtt_uint32 endCount = index_map + 14; stbtt_uint32 search = endCount; if (unicode_codepoint > 0xffff) return 0; // they lie from endCount .. endCount + segCount // but searchRange is the nearest power of two, so... if (unicode_codepoint >= ttUSHORT(data + search + rangeShift*2)) search += rangeShift*2; // now decrement to bias correctly to find smallest search -= 2; while (entrySelector) { stbtt_uint16 end; searchRange >>= 1; end = ttUSHORT(data + search + searchRange*2); if (unicode_codepoint > end) search += searchRange*2; --entrySelector; } search += 2; { stbtt_uint16 offset, start; stbtt_uint16 item = (stbtt_uint16) ((search - endCount) >> 1); STBTT_assert(unicode_codepoint <= ttUSHORT(data + endCount + 2*item)); start = ttUSHORT(data + index_map + 14 + segcount*2 + 2 + 2*item); if (unicode_codepoint < start) return 0; offset = ttUSHORT(data + index_map + 14 + segcount*6 + 2 + 2*item); if (offset == 0) return (stbtt_uint16) (unicode_codepoint + ttSHORT(data + index_map + 14 + segcount*4 + 2 + 2*item)); return ttUSHORT(data + offset + (unicode_codepoint-start)*2 + index_map + 14 + segcount*6 + 2 + 2*item); } } else if (format == 12 || format == 13) { stbtt_uint32 ngroups = ttULONG(data+index_map+12); stbtt_int32 low,high; low = 0; high = (stbtt_int32)ngroups; // Binary search the right group. while (low < high) { stbtt_int32 mid = low + ((high-low) >> 1); // rounds down, so low <= mid < high stbtt_uint32 start_char = ttULONG(data+index_map+16+mid*12); stbtt_uint32 end_char = ttULONG(data+index_map+16+mid*12+4); if ((stbtt_uint32) unicode_codepoint < start_char) high = mid; else if ((stbtt_uint32) unicode_codepoint > end_char) low = mid+1; else { stbtt_uint32 start_glyph = ttULONG(data+index_map+16+mid*12+8); if (format == 12) return start_glyph + unicode_codepoint-start_char; else // format == 13 return start_glyph; } } return 0; // not found } // @TODO STBTT_assert(0); return 0; } STBTT_DEF int stbtt_GetCodepointShape(const stbtt_fontinfo *info, int unicode_codepoint, stbtt_vertex **vertices) { return stbtt_GetGlyphShape(info, stbtt_FindGlyphIndex(info, unicode_codepoint), vertices); } static void stbtt_setvertex(stbtt_vertex *v, stbtt_uint8 type, stbtt_int32 x, stbtt_int32 y, stbtt_int32 cx, stbtt_int32 cy) { v->type = type; v->x = (stbtt_int16) x; v->y = (stbtt_int16) y; v->cx = (stbtt_int16) cx; v->cy = (stbtt_int16) cy; } static int stbtt__GetGlyfOffset(const stbtt_fontinfo *info, int glyph_index) { int g1,g2; STBTT_assert(!info->cff.size); if (glyph_index >= info->numGlyphs) return -1; // glyph index out of range if (info->indexToLocFormat >= 2) return -1; // unknown index->glyph map format if (info->indexToLocFormat == 0) { g1 = info->glyf + ttUSHORT(info->data + info->loca + glyph_index * 2) * 2; g2 = info->glyf + ttUSHORT(info->data + info->loca + glyph_index * 2 + 2) * 2; } else { g1 = info->glyf + ttULONG (info->data + info->loca + glyph_index * 4); g2 = info->glyf + ttULONG (info->data + info->loca + glyph_index * 4 + 4); } return g1==g2 ? -1 : g1; // if length is 0, return -1 } static int stbtt__GetGlyphInfoT2(const stbtt_fontinfo *info, int glyph_index, int *x0, int *y0, int *x1, int *y1); STBTT_DEF int stbtt_GetGlyphBox(const stbtt_fontinfo *info, int glyph_index, int *x0, int *y0, int *x1, int *y1) { if (info->cff.size) { stbtt__GetGlyphInfoT2(info, glyph_index, x0, y0, x1, y1); } else { int g = stbtt__GetGlyfOffset(info, glyph_index); if (g < 0) return 0; if (x0) *x0 = ttSHORT(info->data + g + 2); if (y0) *y0 = ttSHORT(info->data + g + 4); if (x1) *x1 = ttSHORT(info->data + g + 6); if (y1) *y1 = ttSHORT(info->data + g + 8); } return 1; } STBTT_DEF int stbtt_GetCodepointBox(const stbtt_fontinfo *info, int codepoint, int *x0, int *y0, int *x1, int *y1) { return stbtt_GetGlyphBox(info, stbtt_FindGlyphIndex(info,codepoint), x0,y0,x1,y1); } STBTT_DEF int stbtt_IsGlyphEmpty(const stbtt_fontinfo *info, int glyph_index) { stbtt_int16 numberOfContours; int g; if (info->cff.size) return stbtt__GetGlyphInfoT2(info, glyph_index, NULL, NULL, NULL, NULL) == 0; g = stbtt__GetGlyfOffset(info, glyph_index); if (g < 0) return 1; numberOfContours = ttSHORT(info->data + g); return numberOfContours == 0; } static int stbtt__close_shape(stbtt_vertex *vertices, int num_vertices, int was_off, int start_off, stbtt_int32 sx, stbtt_int32 sy, stbtt_int32 scx, stbtt_int32 scy, stbtt_int32 cx, stbtt_int32 cy) { if (start_off) { if (was_off) stbtt_setvertex(&vertices[num_vertices++], STBTT_vcurve, (cx+scx)>>1, (cy+scy)>>1, cx,cy); stbtt_setvertex(&vertices[num_vertices++], STBTT_vcurve, sx,sy,scx,scy); } else { if (was_off) stbtt_setvertex(&vertices[num_vertices++], STBTT_vcurve,sx,sy,cx,cy); else stbtt_setvertex(&vertices[num_vertices++], STBTT_vline,sx,sy,0,0); } return num_vertices; } static int stbtt__GetGlyphShapeTT(const stbtt_fontinfo *info, int glyph_index, stbtt_vertex **pvertices) { stbtt_int16 numberOfContours; stbtt_uint8 *endPtsOfContours; stbtt_uint8 *data = info->data; stbtt_vertex *vertices=0; int num_vertices=0; int g = stbtt__GetGlyfOffset(info, glyph_index); *pvertices = NULL; if (g < 0) return 0; numberOfContours = ttSHORT(data + g); if (numberOfContours > 0) { stbtt_uint8 flags=0,flagcount; stbtt_int32 ins, i,j=0,m,n, next_move, was_off=0, off, start_off=0; stbtt_int32 x,y,cx,cy,sx,sy, scx,scy; stbtt_uint8 *points; endPtsOfContours = (data + g + 10); ins = ttUSHORT(data + g + 10 + numberOfContours * 2); points = data + g + 10 + numberOfContours * 2 + 2 + ins; n = 1+ttUSHORT(endPtsOfContours + numberOfContours*2-2); m = n + 2*numberOfContours; // a loose bound on how many vertices we might need vertices = (stbtt_vertex *) STBTT_malloc(m * sizeof(vertices[0]), info->userdata); if (vertices == 0) return 0; next_move = 0; flagcount=0; // in first pass, we load uninterpreted data into the allocated array // above, shifted to the end of the array so we won't overwrite it when // we create our final data starting from the front off = m - n; // starting offset for uninterpreted data, regardless of how m ends up being calculated // first load flags for (i=0; i < n; ++i) { if (flagcount == 0) { flags = *points++; if (flags & 8) flagcount = *points++; } else --flagcount; vertices[off+i].type = flags; } // now load x coordinates x=0; for (i=0; i < n; ++i) { flags = vertices[off+i].type; if (flags & 2) { stbtt_int16 dx = *points++; x += (flags & 16) ? dx : -dx; // ??? } else { if (!(flags & 16)) { x = x + (stbtt_int16) (points[0]*256 + points[1]); points += 2; } } vertices[off+i].x = (stbtt_int16) x; } // now load y coordinates y=0; for (i=0; i < n; ++i) { flags = vertices[off+i].type; if (flags & 4) { stbtt_int16 dy = *points++; y += (flags & 32) ? dy : -dy; // ??? } else { if (!(flags & 32)) { y = y + (stbtt_int16) (points[0]*256 + points[1]); points += 2; } } vertices[off+i].y = (stbtt_int16) y; } // now convert them to our format num_vertices=0; sx = sy = cx = cy = scx = scy = 0; for (i=0; i < n; ++i) { flags = vertices[off+i].type; x = (stbtt_int16) vertices[off+i].x; y = (stbtt_int16) vertices[off+i].y; if (next_move == i) { if (i != 0) num_vertices = stbtt__close_shape(vertices, num_vertices, was_off, start_off, sx,sy,scx,scy,cx,cy); // now start the new one start_off = !(flags & 1); if (start_off) { // if we start off with an off-curve point, then when we need to find a point on the curve // where we can start, and we need to save some state for when we wraparound. scx = x; scy = y; if (!(vertices[off+i+1].type & 1)) { // next point is also a curve point, so interpolate an on-point curve sx = (x + (stbtt_int32) vertices[off+i+1].x) >> 1; sy = (y + (stbtt_int32) vertices[off+i+1].y) >> 1; } else { // otherwise just use the next point as our start point sx = (stbtt_int32) vertices[off+i+1].x; sy = (stbtt_int32) vertices[off+i+1].y; ++i; // we're using point i+1 as the starting point, so skip it } } else { sx = x; sy = y; } stbtt_setvertex(&vertices[num_vertices++], STBTT_vmove,sx,sy,0,0); was_off = 0; next_move = 1 + ttUSHORT(endPtsOfContours+j*2); ++j; } else { if (!(flags & 1)) { // if it's a curve if (was_off) // two off-curve control points in a row means interpolate an on-curve midpoint stbtt_setvertex(&vertices[num_vertices++], STBTT_vcurve, (cx+x)>>1, (cy+y)>>1, cx, cy); cx = x; cy = y; was_off = 1; } else { if (was_off) stbtt_setvertex(&vertices[num_vertices++], STBTT_vcurve, x,y, cx, cy); else stbtt_setvertex(&vertices[num_vertices++], STBTT_vline, x,y,0,0); was_off = 0; } } } num_vertices = stbtt__close_shape(vertices, num_vertices, was_off, start_off, sx,sy,scx,scy,cx,cy); } else if (numberOfContours == -1) { // Compound shapes. int more = 1; stbtt_uint8 *comp = data + g + 10; num_vertices = 0; vertices = 0; while (more) { stbtt_uint16 flags, gidx; int comp_num_verts = 0, i; stbtt_vertex *comp_verts = 0, *tmp = 0; float mtx[6] = {1,0,0,1,0,0}, m, n; flags = ttSHORT(comp); comp+=2; gidx = ttSHORT(comp); comp+=2; if (flags & 2) { // XY values if (flags & 1) { // shorts mtx[4] = ttSHORT(comp); comp+=2; mtx[5] = ttSHORT(comp); comp+=2; } else { mtx[4] = ttCHAR(comp); comp+=1; mtx[5] = ttCHAR(comp); comp+=1; } } else { // @TODO handle matching point STBTT_assert(0); } if (flags & (1<<3)) { // WE_HAVE_A_SCALE mtx[0] = mtx[3] = ttSHORT(comp)/16384.0f; comp+=2; mtx[1] = mtx[2] = 0; } else if (flags & (1<<6)) { // WE_HAVE_AN_X_AND_YSCALE mtx[0] = ttSHORT(comp)/16384.0f; comp+=2; mtx[1] = mtx[2] = 0; mtx[3] = ttSHORT(comp)/16384.0f; comp+=2; } else if (flags & (1<<7)) { // WE_HAVE_A_TWO_BY_TWO mtx[0] = ttSHORT(comp)/16384.0f; comp+=2; mtx[1] = ttSHORT(comp)/16384.0f; comp+=2; mtx[2] = ttSHORT(comp)/16384.0f; comp+=2; mtx[3] = ttSHORT(comp)/16384.0f; comp+=2; } // Find transformation scales. m = (float) STBTT_sqrt(mtx[0]*mtx[0] + mtx[1]*mtx[1]); n = (float) STBTT_sqrt(mtx[2]*mtx[2] + mtx[3]*mtx[3]); // Get indexed glyph. comp_num_verts = stbtt_GetGlyphShape(info, gidx, &comp_verts); if (comp_num_verts > 0) { // Transform vertices. for (i = 0; i < comp_num_verts; ++i) { stbtt_vertex* v = &comp_verts[i]; stbtt_vertex_type x,y; x=v->x; y=v->y; v->x = (stbtt_vertex_type)(m * (mtx[0]*x + mtx[2]*y + mtx[4])); v->y = (stbtt_vertex_type)(n * (mtx[1]*x + mtx[3]*y + mtx[5])); x=v->cx; y=v->cy; v->cx = (stbtt_vertex_type)(m * (mtx[0]*x + mtx[2]*y + mtx[4])); v->cy = (stbtt_vertex_type)(n * (mtx[1]*x + mtx[3]*y + mtx[5])); } // Append vertices. tmp = (stbtt_vertex*)STBTT_malloc((num_vertices+comp_num_verts)*sizeof(stbtt_vertex), info->userdata); if (!tmp) { if (vertices) STBTT_free(vertices, info->userdata); if (comp_verts) STBTT_free(comp_verts, info->userdata); return 0; } if (num_vertices > 0) STBTT_memcpy(tmp, vertices, num_vertices*sizeof(stbtt_vertex)); STBTT_memcpy(tmp+num_vertices, comp_verts, comp_num_verts*sizeof(stbtt_vertex)); if (vertices) STBTT_free(vertices, info->userdata); vertices = tmp; STBTT_free(comp_verts, info->userdata); num_vertices += comp_num_verts; } // More components ? more = flags & (1<<5); } } else if (numberOfContours < 0) { // @TODO other compound variations? STBTT_assert(0); } else { // numberOfCounters == 0, do nothing } *pvertices = vertices; return num_vertices; } typedef struct { int bounds; int started; float first_x, first_y; float x, y; stbtt_int32 min_x, max_x, min_y, max_y; stbtt_vertex *pvertices; int num_vertices; } stbtt__csctx; #define STBTT__CSCTX_INIT(bounds) {bounds,0, 0,0, 0,0, 0,0,0,0, NULL, 0} static void stbtt__track_vertex(stbtt__csctx *c, stbtt_int32 x, stbtt_int32 y) { if (x > c->max_x || !c->started) c->max_x = x; if (y > c->max_y || !c->started) c->max_y = y; if (x < c->min_x || !c->started) c->min_x = x; if (y < c->min_y || !c->started) c->min_y = y; c->started = 1; } static void stbtt__csctx_v(stbtt__csctx *c, stbtt_uint8 type, stbtt_int32 x, stbtt_int32 y, stbtt_int32 cx, stbtt_int32 cy, stbtt_int32 cx1, stbtt_int32 cy1) { if (c->bounds) { stbtt__track_vertex(c, x, y); if (type == STBTT_vcubic) { stbtt__track_vertex(c, cx, cy); stbtt__track_vertex(c, cx1, cy1); } } else { stbtt_setvertex(&c->pvertices[c->num_vertices], type, x, y, cx, cy); c->pvertices[c->num_vertices].cx1 = (stbtt_int16) cx1; c->pvertices[c->num_vertices].cy1 = (stbtt_int16) cy1; } c->num_vertices++; } static void stbtt__csctx_close_shape(stbtt__csctx *ctx) { if (ctx->first_x != ctx->x || ctx->first_y != ctx->y) stbtt__csctx_v(ctx, STBTT_vline, (int)ctx->first_x, (int)ctx->first_y, 0, 0, 0, 0); } static void stbtt__csctx_rmove_to(stbtt__csctx *ctx, float dx, float dy) { stbtt__csctx_close_shape(ctx); ctx->first_x = ctx->x = ctx->x + dx; ctx->first_y = ctx->y = ctx->y + dy; stbtt__csctx_v(ctx, STBTT_vmove, (int)ctx->x, (int)ctx->y, 0, 0, 0, 0); } static void stbtt__csctx_rline_to(stbtt__csctx *ctx, float dx, float dy) { ctx->x += dx; ctx->y += dy; stbtt__csctx_v(ctx, STBTT_vline, (int)ctx->x, (int)ctx->y, 0, 0, 0, 0); } static void stbtt__csctx_rccurve_to(stbtt__csctx *ctx, float dx1, float dy1, float dx2, float dy2, float dx3, float dy3) { float cx1 = ctx->x + dx1; float cy1 = ctx->y + dy1; float cx2 = cx1 + dx2; float cy2 = cy1 + dy2; ctx->x = cx2 + dx3; ctx->y = cy2 + dy3; stbtt__csctx_v(ctx, STBTT_vcubic, (int)ctx->x, (int)ctx->y, (int)cx1, (int)cy1, (int)cx2, (int)cy2); } static stbtt__buf stbtt__get_subr(stbtt__buf idx, int n) { int count = stbtt__cff_index_count(&idx); int bias = 107; if (count >= 33900) bias = 32768; else if (count >= 1240) bias = 1131; n += bias; if (n < 0 || n >= count) return stbtt__new_buf(NULL, 0); return stbtt__cff_index_get(idx, n); } static stbtt__buf stbtt__cid_get_glyph_subrs(const stbtt_fontinfo *info, int glyph_index) { stbtt__buf fdselect = info->fdselect; int nranges, start, end, v, fmt, fdselector = -1, i; stbtt__buf_seek(&fdselect, 0); fmt = stbtt__buf_get8(&fdselect); if (fmt == 0) { // untested stbtt__buf_skip(&fdselect, glyph_index); fdselector = stbtt__buf_get8(&fdselect); } else if (fmt == 3) { nranges = stbtt__buf_get16(&fdselect); start = stbtt__buf_get16(&fdselect); for (i = 0; i < nranges; i++) { v = stbtt__buf_get8(&fdselect); end = stbtt__buf_get16(&fdselect); if (glyph_index >= start && glyph_index < end) { fdselector = v; break; } start = end; } } if (fdselector == -1) stbtt__new_buf(NULL, 0); return stbtt__get_subrs(info->cff, stbtt__cff_index_get(info->fontdicts, fdselector)); } static int stbtt__run_charstring(const stbtt_fontinfo *info, int glyph_index, stbtt__csctx *c) { int in_header = 1, maskbits = 0, subr_stack_height = 0, sp = 0, v, i, b0; int has_subrs = 0, clear_stack; float s[48]; stbtt__buf subr_stack[10], subrs = info->subrs, b; float f; #define STBTT__CSERR(s) (0) // this currently ignores the initial width value, which isn't needed if we have hmtx b = stbtt__cff_index_get(info->charstrings, glyph_index); while (b.cursor < b.size) { i = 0; clear_stack = 1; b0 = stbtt__buf_get8(&b); switch (b0) { // @TODO implement hinting case 0x13: // hintmask case 0x14: // cntrmask if (in_header) maskbits += (sp / 2); // implicit "vstem" in_header = 0; stbtt__buf_skip(&b, (maskbits + 7) / 8); break; case 0x01: // hstem case 0x03: // vstem case 0x12: // hstemhm case 0x17: // vstemhm maskbits += (sp / 2); break; case 0x15: // rmoveto in_header = 0; if (sp < 2) return STBTT__CSERR("rmoveto stack"); stbtt__csctx_rmove_to(c, s[sp-2], s[sp-1]); break; case 0x04: // vmoveto in_header = 0; if (sp < 1) return STBTT__CSERR("vmoveto stack"); stbtt__csctx_rmove_to(c, 0, s[sp-1]); break; case 0x16: // hmoveto in_header = 0; if (sp < 1) return STBTT__CSERR("hmoveto stack"); stbtt__csctx_rmove_to(c, s[sp-1], 0); break; case 0x05: // rlineto if (sp < 2) return STBTT__CSERR("rlineto stack"); for (; i + 1 < sp; i += 2) stbtt__csctx_rline_to(c, s[i], s[i+1]); break; // hlineto/vlineto and vhcurveto/hvcurveto alternate horizontal and vertical // starting from a different place. case 0x07: // vlineto if (sp < 1) return STBTT__CSERR("vlineto stack"); goto vlineto; case 0x06: // hlineto if (sp < 1) return STBTT__CSERR("hlineto stack"); for (;;) { if (i >= sp) break; stbtt__csctx_rline_to(c, s[i], 0); i++; vlineto: if (i >= sp) break; stbtt__csctx_rline_to(c, 0, s[i]); i++; } break; case 0x1F: // hvcurveto if (sp < 4) return STBTT__CSERR("hvcurveto stack"); goto hvcurveto; case 0x1E: // vhcurveto if (sp < 4) return STBTT__CSERR("vhcurveto stack"); for (;;) { if (i + 3 >= sp) break; stbtt__csctx_rccurve_to(c, 0, s[i], s[i+1], s[i+2], s[i+3], (sp - i == 5) ? s[i + 4] : 0.0f); i += 4; hvcurveto: if (i + 3 >= sp) break; stbtt__csctx_rccurve_to(c, s[i], 0, s[i+1], s[i+2], (sp - i == 5) ? s[i+4] : 0.0f, s[i+3]); i += 4; } break; case 0x08: // rrcurveto if (sp < 6) return STBTT__CSERR("rcurveline stack"); for (; i + 5 < sp; i += 6) stbtt__csctx_rccurve_to(c, s[i], s[i+1], s[i+2], s[i+3], s[i+4], s[i+5]); break; case 0x18: // rcurveline if (sp < 8) return STBTT__CSERR("rcurveline stack"); for (; i + 5 < sp - 2; i += 6) stbtt__csctx_rccurve_to(c, s[i], s[i+1], s[i+2], s[i+3], s[i+4], s[i+5]); if (i + 1 >= sp) return STBTT__CSERR("rcurveline stack"); stbtt__csctx_rline_to(c, s[i], s[i+1]); break; case 0x19: // rlinecurve if (sp < 8) return STBTT__CSERR("rlinecurve stack"); for (; i + 1 < sp - 6; i += 2) stbtt__csctx_rline_to(c, s[i], s[i+1]); if (i + 5 >= sp) return STBTT__CSERR("rlinecurve stack"); stbtt__csctx_rccurve_to(c, s[i], s[i+1], s[i+2], s[i+3], s[i+4], s[i+5]); break; case 0x1A: // vvcurveto case 0x1B: // hhcurveto if (sp < 4) return STBTT__CSERR("(vv|hh)curveto stack"); f = 0.0; if (sp & 1) { f = s[i]; i++; } for (; i + 3 < sp; i += 4) { if (b0 == 0x1B) stbtt__csctx_rccurve_to(c, s[i], f, s[i+1], s[i+2], s[i+3], 0.0); else stbtt__csctx_rccurve_to(c, f, s[i], s[i+1], s[i+2], 0.0, s[i+3]); f = 0.0; } break; case 0x0A: // callsubr if (!has_subrs) { if (info->fdselect.size) subrs = stbtt__cid_get_glyph_subrs(info, glyph_index); has_subrs = 1; } // fallthrough case 0x1D: // callgsubr if (sp < 1) return STBTT__CSERR("call(g|)subr stack"); v = (int) s[--sp]; if (subr_stack_height >= 10) return STBTT__CSERR("recursion limit"); subr_stack[subr_stack_height++] = b; b = stbtt__get_subr(b0 == 0x0A ? subrs : info->gsubrs, v); if (b.size == 0) return STBTT__CSERR("subr not found"); b.cursor = 0; clear_stack = 0; break; case 0x0B: // return if (subr_stack_height <= 0) return STBTT__CSERR("return outside subr"); b = subr_stack[--subr_stack_height]; clear_stack = 0; break; case 0x0E: // endchar stbtt__csctx_close_shape(c); return 1; case 0x0C: { // two-byte escape float dx1, dx2, dx3, dx4, dx5, dx6, dy1, dy2, dy3, dy4, dy5, dy6; float dx, dy; int b1 = stbtt__buf_get8(&b); switch (b1) { // @TODO These "flex" implementations ignore the flex-depth and resolution, // and always draw beziers. case 0x22: // hflex if (sp < 7) return STBTT__CSERR("hflex stack"); dx1 = s[0]; dx2 = s[1]; dy2 = s[2]; dx3 = s[3]; dx4 = s[4]; dx5 = s[5]; dx6 = s[6]; stbtt__csctx_rccurve_to(c, dx1, 0, dx2, dy2, dx3, 0); stbtt__csctx_rccurve_to(c, dx4, 0, dx5, -dy2, dx6, 0); break; case 0x23: // flex if (sp < 13) return STBTT__CSERR("flex stack"); dx1 = s[0]; dy1 = s[1]; dx2 = s[2]; dy2 = s[3]; dx3 = s[4]; dy3 = s[5]; dx4 = s[6]; dy4 = s[7]; dx5 = s[8]; dy5 = s[9]; dx6 = s[10]; dy6 = s[11]; //fd is s[12] stbtt__csctx_rccurve_to(c, dx1, dy1, dx2, dy2, dx3, dy3); stbtt__csctx_rccurve_to(c, dx4, dy4, dx5, dy5, dx6, dy6); break; case 0x24: // hflex1 if (sp < 9) return STBTT__CSERR("hflex1 stack"); dx1 = s[0]; dy1 = s[1]; dx2 = s[2]; dy2 = s[3]; dx3 = s[4]; dx4 = s[5]; dx5 = s[6]; dy5 = s[7]; dx6 = s[8]; stbtt__csctx_rccurve_to(c, dx1, dy1, dx2, dy2, dx3, 0); stbtt__csctx_rccurve_to(c, dx4, 0, dx5, dy5, dx6, -(dy1+dy2+dy5)); break; case 0x25: // flex1 if (sp < 11) return STBTT__CSERR("flex1 stack"); dx1 = s[0]; dy1 = s[1]; dx2 = s[2]; dy2 = s[3]; dx3 = s[4]; dy3 = s[5]; dx4 = s[6]; dy4 = s[7]; dx5 = s[8]; dy5 = s[9]; dx6 = dy6 = s[10]; dx = dx1+dx2+dx3+dx4+dx5; dy = dy1+dy2+dy3+dy4+dy5; if (STBTT_fabs(dx) > STBTT_fabs(dy)) dy6 = -dy; else dx6 = -dx; stbtt__csctx_rccurve_to(c, dx1, dy1, dx2, dy2, dx3, dy3); stbtt__csctx_rccurve_to(c, dx4, dy4, dx5, dy5, dx6, dy6); break; default: return STBTT__CSERR("unimplemented"); } } break; default: if (b0 != 255 && b0 != 28 && (b0 < 32 || b0 > 254)) return STBTT__CSERR("reserved operator"); // push immediate if (b0 == 255) { f = (float)stbtt__buf_get32(&b) / 0x10000; } else { stbtt__buf_skip(&b, -1); f = (float)(stbtt_int16)stbtt__cff_int(&b); } if (sp >= 48) return STBTT__CSERR("push stack overflow"); s[sp++] = f; clear_stack = 0; break; } if (clear_stack) sp = 0; } return STBTT__CSERR("no endchar"); #undef STBTT__CSERR } static int stbtt__GetGlyphShapeT2(const stbtt_fontinfo *info, int glyph_index, stbtt_vertex **pvertices) { // runs the charstring twice, once to count and once to output (to avoid realloc) stbtt__csctx count_ctx = STBTT__CSCTX_INIT(1); stbtt__csctx output_ctx = STBTT__CSCTX_INIT(0); if (stbtt__run_charstring(info, glyph_index, &count_ctx)) { *pvertices = (stbtt_vertex*)STBTT_malloc(count_ctx.num_vertices*sizeof(stbtt_vertex), info->userdata); output_ctx.pvertices = *pvertices; if (stbtt__run_charstring(info, glyph_index, &output_ctx)) { STBTT_assert(output_ctx.num_vertices == count_ctx.num_vertices); return output_ctx.num_vertices; } } *pvertices = NULL; return 0; } static int stbtt__GetGlyphInfoT2(const stbtt_fontinfo *info, int glyph_index, int *x0, int *y0, int *x1, int *y1) { stbtt__csctx c = STBTT__CSCTX_INIT(1); int r = stbtt__run_charstring(info, glyph_index, &c); if (x0) { *x0 = r ? c.min_x : 0; *y0 = r ? c.min_y : 0; *x1 = r ? c.max_x : 0; *y1 = r ? c.max_y : 0; } return r ? c.num_vertices : 0; } STBTT_DEF int stbtt_GetGlyphShape(const stbtt_fontinfo *info, int glyph_index, stbtt_vertex **pvertices) { if (!info->cff.size) return stbtt__GetGlyphShapeTT(info, glyph_index, pvertices); else return stbtt__GetGlyphShapeT2(info, glyph_index, pvertices); } STBTT_DEF void stbtt_GetGlyphHMetrics(const stbtt_fontinfo *info, int glyph_index, int *advanceWidth, int *leftSideBearing) { stbtt_uint16 numOfLongHorMetrics = ttUSHORT(info->data+info->hhea + 34); if (glyph_index < numOfLongHorMetrics) { if (advanceWidth) *advanceWidth = ttSHORT(info->data + info->hmtx + 4*glyph_index); if (leftSideBearing) *leftSideBearing = ttSHORT(info->data + info->hmtx + 4*glyph_index + 2); } else { if (advanceWidth) *advanceWidth = ttSHORT(info->data + info->hmtx + 4*(numOfLongHorMetrics-1)); if (leftSideBearing) *leftSideBearing = ttSHORT(info->data + info->hmtx + 4*numOfLongHorMetrics + 2*(glyph_index - numOfLongHorMetrics)); } } STBTT_DEF int stbtt_GetGlyphKernAdvance(const stbtt_fontinfo *info, int glyph1, int glyph2) { stbtt_uint8 *data = info->data + info->kern; stbtt_uint32 needle, straw; int l, r, m; // we only look at the first table. it must be 'horizontal' and format 0. if (!info->kern) return 0; if (ttUSHORT(data+2) < 1) // number of tables, need at least 1 return 0; if (ttUSHORT(data+8) != 1) // horizontal flag must be set in format return 0; l = 0; r = ttUSHORT(data+10) - 1; needle = glyph1 << 16 | glyph2; while (l <= r) { m = (l + r) >> 1; straw = ttULONG(data+18+(m*6)); // note: unaligned read if (needle < straw) r = m - 1; else if (needle > straw) l = m + 1; else return ttSHORT(data+22+(m*6)); } return 0; } STBTT_DEF int stbtt_GetCodepointKernAdvance(const stbtt_fontinfo *info, int ch1, int ch2) { if (!info->kern) // if no kerning table, don't waste time looking up both codepoint->glyphs return 0; return stbtt_GetGlyphKernAdvance(info, stbtt_FindGlyphIndex(info,ch1), stbtt_FindGlyphIndex(info,ch2)); } STBTT_DEF void stbtt_GetCodepointHMetrics(const stbtt_fontinfo *info, int codepoint, int *advanceWidth, int *leftSideBearing) { stbtt_GetGlyphHMetrics(info, stbtt_FindGlyphIndex(info,codepoint), advanceWidth, leftSideBearing); } STBTT_DEF void stbtt_GetFontVMetrics(const stbtt_fontinfo *info, int *ascent, int *descent, int *lineGap) { if (ascent ) *ascent = ttSHORT(info->data+info->hhea + 4); if (descent) *descent = ttSHORT(info->data+info->hhea + 6); if (lineGap) *lineGap = ttSHORT(info->data+info->hhea + 8); } STBTT_DEF int stbtt_GetFontVMetricsOS2(const stbtt_fontinfo *info, int *typoAscent, int *typoDescent, int *typoLineGap) { int tab = stbtt__find_table(info->data, info->fontstart, "OS/2"); if (!tab) return 0; if (typoAscent ) *typoAscent = ttSHORT(info->data+tab + 68); if (typoDescent) *typoDescent = ttSHORT(info->data+tab + 70); if (typoLineGap) *typoLineGap = ttSHORT(info->data+tab + 72); return 1; } STBTT_DEF void stbtt_GetFontBoundingBox(const stbtt_fontinfo *info, int *x0, int *y0, int *x1, int *y1) { *x0 = ttSHORT(info->data + info->head + 36); *y0 = ttSHORT(info->data + info->head + 38); *x1 = ttSHORT(info->data + info->head + 40); *y1 = ttSHORT(info->data + info->head + 42); } STBTT_DEF float stbtt_ScaleForPixelHeight(const stbtt_fontinfo *info, float height) { int fheight = ttSHORT(info->data + info->hhea + 4) - ttSHORT(info->data + info->hhea + 6); return (float) height / fheight; } STBTT_DEF float stbtt_ScaleForMappingEmToPixels(const stbtt_fontinfo *info, float pixels) { int unitsPerEm = ttUSHORT(info->data + info->head + 18); return pixels / unitsPerEm; } STBTT_DEF void stbtt_FreeShape(const stbtt_fontinfo *info, stbtt_vertex *v) { STBTT_free(v, info->userdata); } ////////////////////////////////////////////////////////////////////////////// // // antialiasing software rasterizer // STBTT_DEF void stbtt_GetGlyphBitmapBoxSubpixel(const stbtt_fontinfo *font, int glyph, float scale_x, float scale_y,float shift_x, float shift_y, int *ix0, int *iy0, int *ix1, int *iy1) { int x0=0,y0=0,x1,y1; // =0 suppresses compiler warning if (!stbtt_GetGlyphBox(font, glyph, &x0,&y0,&x1,&y1)) { // e.g. space character if (ix0) *ix0 = 0; if (iy0) *iy0 = 0; if (ix1) *ix1 = 0; if (iy1) *iy1 = 0; } else { // move to integral bboxes (treating pixels as little squares, what pixels get touched)? if (ix0) *ix0 = STBTT_ifloor( x0 * scale_x + shift_x); if (iy0) *iy0 = STBTT_ifloor(-y1 * scale_y + shift_y); if (ix1) *ix1 = STBTT_iceil ( x1 * scale_x + shift_x); if (iy1) *iy1 = STBTT_iceil (-y0 * scale_y + shift_y); } } STBTT_DEF void stbtt_GetGlyphBitmapBox(const stbtt_fontinfo *font, int glyph, float scale_x, float scale_y, int *ix0, int *iy0, int *ix1, int *iy1) { stbtt_GetGlyphBitmapBoxSubpixel(font, glyph, scale_x, scale_y,0.0f,0.0f, ix0, iy0, ix1, iy1); } STBTT_DEF void stbtt_GetCodepointBitmapBoxSubpixel(const stbtt_fontinfo *font, int codepoint, float scale_x, float scale_y, float shift_x, float shift_y, int *ix0, int *iy0, int *ix1, int *iy1) { stbtt_GetGlyphBitmapBoxSubpixel(font, stbtt_FindGlyphIndex(font,codepoint), scale_x, scale_y,shift_x,shift_y, ix0,iy0,ix1,iy1); } STBTT_DEF void stbtt_GetCodepointBitmapBox(const stbtt_fontinfo *font, int codepoint, float scale_x, float scale_y, int *ix0, int *iy0, int *ix1, int *iy1) { stbtt_GetCodepointBitmapBoxSubpixel(font, codepoint, scale_x, scale_y,0.0f,0.0f, ix0,iy0,ix1,iy1); } ////////////////////////////////////////////////////////////////////////////// // // Rasterizer typedef struct stbtt__hheap_chunk { struct stbtt__hheap_chunk *next; } stbtt__hheap_chunk; typedef struct stbtt__hheap { struct stbtt__hheap_chunk *head; void *first_free; int num_remaining_in_head_chunk; } stbtt__hheap; static void *stbtt__hheap_alloc(stbtt__hheap *hh, size_t size, void *userdata) { if (hh->first_free) { void *p = hh->first_free; hh->first_free = * (void **) p; return p; } else { if (hh->num_remaining_in_head_chunk == 0) { int count = (size < 32 ? 2000 : size < 128 ? 800 : 100); stbtt__hheap_chunk *c = (stbtt__hheap_chunk *) STBTT_malloc(sizeof(stbtt__hheap_chunk) + size * count, userdata); if (c == NULL) return NULL; c->next = hh->head; hh->head = c; hh->num_remaining_in_head_chunk = count; } --hh->num_remaining_in_head_chunk; return (char *) (hh->head) + size * hh->num_remaining_in_head_chunk; } } static void stbtt__hheap_free(stbtt__hheap *hh, void *p) { *(void **) p = hh->first_free; hh->first_free = p; } static void stbtt__hheap_cleanup(stbtt__hheap *hh, void *userdata) { stbtt__hheap_chunk *c = hh->head; while (c) { stbtt__hheap_chunk *n = c->next; STBTT_free(c, userdata); c = n; } } typedef struct stbtt__edge { float x0,y0, x1,y1; int invert; } stbtt__edge; typedef struct stbtt__active_edge { struct stbtt__active_edge *next; #if STBTT_RASTERIZER_VERSION==1 int x,dx; float ey; int direction; #elif STBTT_RASTERIZER_VERSION==2 float fx,fdx,fdy; float direction; float sy; float ey; #else #error "Unrecognized value of STBTT_RASTERIZER_VERSION" #endif } stbtt__active_edge; #if STBTT_RASTERIZER_VERSION == 1 #define STBTT_FIXSHIFT 10 #define STBTT_FIX (1 << STBTT_FIXSHIFT) #define STBTT_FIXMASK (STBTT_FIX-1) static stbtt__active_edge *stbtt__new_active(stbtt__hheap *hh, stbtt__edge *e, int off_x, float start_point, void *userdata) { stbtt__active_edge *z = (stbtt__active_edge *) stbtt__hheap_alloc(hh, sizeof(*z), userdata); float dxdy = (e->x1 - e->x0) / (e->y1 - e->y0); STBTT_assert(z != NULL); if (!z) return z; // round dx down to avoid overshooting if (dxdy < 0) z->dx = -STBTT_ifloor(STBTT_FIX * -dxdy); else z->dx = STBTT_ifloor(STBTT_FIX * dxdy); z->x = STBTT_ifloor(STBTT_FIX * e->x0 + z->dx * (start_point - e->y0)); // use z->dx so when we offset later it's by the same amount z->x -= off_x * STBTT_FIX; z->ey = e->y1; z->next = 0; z->direction = e->invert ? 1 : -1; return z; } #elif STBTT_RASTERIZER_VERSION == 2 static stbtt__active_edge *stbtt__new_active(stbtt__hheap *hh, stbtt__edge *e, int off_x, float start_point, void *userdata) { stbtt__active_edge *z = (stbtt__active_edge *) stbtt__hheap_alloc(hh, sizeof(*z), userdata); float dxdy = (e->x1 - e->x0) / (e->y1 - e->y0); STBTT_assert(z != NULL); //STBTT_assert(e->y0 <= start_point); if (!z) return z; z->fdx = dxdy; z->fdy = dxdy != 0.0f ? (1.0f/dxdy) : 0.0f; z->fx = e->x0 + dxdy * (start_point - e->y0); z->fx -= off_x; z->direction = e->invert ? 1.0f : -1.0f; z->sy = e->y0; z->ey = e->y1; z->next = 0; return z; } #else #error "Unrecognized value of STBTT_RASTERIZER_VERSION" #endif #if STBTT_RASTERIZER_VERSION == 1 // note: this routine clips fills that extend off the edges... ideally this // wouldn't happen, but it could happen if the truetype glyph bounding boxes // are wrong, or if the user supplies a too-small bitmap static void stbtt__fill_active_edges(unsigned char *scanline, int len, stbtt__active_edge *e, int max_weight) { // non-zero winding fill int x0=0, w=0; while (e) { if (w == 0) { // if we're currently at zero, we need to record the edge start point x0 = e->x; w += e->direction; } else { int x1 = e->x; w += e->direction; // if we went to zero, we need to draw if (w == 0) { int i = x0 >> STBTT_FIXSHIFT; int j = x1 >> STBTT_FIXSHIFT; if (i < len && j >= 0) { if (i == j) { // x0,x1 are the same pixel, so compute combined coverage scanline[i] = scanline[i] + (stbtt_uint8) ((x1 - x0) * max_weight >> STBTT_FIXSHIFT); } else { if (i >= 0) // add antialiasing for x0 scanline[i] = scanline[i] + (stbtt_uint8) (((STBTT_FIX - (x0 & STBTT_FIXMASK)) * max_weight) >> STBTT_FIXSHIFT); else i = -1; // clip if (j < len) // add antialiasing for x1 scanline[j] = scanline[j] + (stbtt_uint8) (((x1 & STBTT_FIXMASK) * max_weight) >> STBTT_FIXSHIFT); else j = len; // clip for (++i; i < j; ++i) // fill pixels between x0 and x1 scanline[i] = scanline[i] + (stbtt_uint8) max_weight; } } } } e = e->next; } } static void stbtt__rasterize_sorted_edges(stbtt__bitmap *result, stbtt__edge *e, int n, int vsubsample, int off_x, int off_y, void *userdata) { stbtt__hheap hh = { 0, 0, 0 }; stbtt__active_edge *active = NULL; int y,j=0; int max_weight = (255 / vsubsample); // weight per vertical scanline int s; // vertical subsample index unsigned char scanline_data[512], *scanline; if (result->w > 512) scanline = (unsigned char *) STBTT_malloc(result->w, userdata); else scanline = scanline_data; y = off_y * vsubsample; e[n].y0 = (off_y + result->h) * (float) vsubsample + 1; while (j < result->h) { STBTT_memset(scanline, 0, result->w); for (s=0; s < vsubsample; ++s) { // find center of pixel for this scanline float scan_y = y + 0.5f; stbtt__active_edge **step = &active; // update all active edges; // remove all active edges that terminate before the center of this scanline while (*step) { stbtt__active_edge * z = *step; if (z->ey <= scan_y) { *step = z->next; // delete from list STBTT_assert(z->direction); z->direction = 0; stbtt__hheap_free(&hh, z); } else { z->x += z->dx; // advance to position for current scanline step = &((*step)->next); // advance through list } } // resort the list if needed for(;;) { int changed=0; step = &active; while (*step && (*step)->next) { if ((*step)->x > (*step)->next->x) { stbtt__active_edge *t = *step; stbtt__active_edge *q = t->next; t->next = q->next; q->next = t; *step = q; changed = 1; } step = &(*step)->next; } if (!changed) break; } // insert all edges that start before the center of this scanline -- omit ones that also end on this scanline while (e->y0 <= scan_y) { if (e->y1 > scan_y) { stbtt__active_edge *z = stbtt__new_active(&hh, e, off_x, scan_y, userdata); if (z != NULL) { // find insertion point if (active == NULL) active = z; else if (z->x < active->x) { // insert at front z->next = active; active = z; } else { // find thing to insert AFTER stbtt__active_edge *p = active; while (p->next && p->next->x < z->x) p = p->next; // at this point, p->next->x is NOT < z->x z->next = p->next; p->next = z; } } } ++e; } // now process all active edges in XOR fashion if (active) stbtt__fill_active_edges(scanline, result->w, active, max_weight); ++y; } STBTT_memcpy(result->pixels + j * result->stride, scanline, result->w); ++j; } stbtt__hheap_cleanup(&hh, userdata); if (scanline != scanline_data) STBTT_free(scanline, userdata); } #elif STBTT_RASTERIZER_VERSION == 2 // the edge passed in here does not cross the vertical line at x or the vertical line at x+1 // (i.e. it has already been clipped to those) static void stbtt__handle_clipped_edge(float *scanline, int x, stbtt__active_edge *e, float x0, float y0, float x1, float y1) { if (y0 == y1) return; STBTT_assert(y0 < y1); STBTT_assert(e->sy <= e->ey); if (y0 > e->ey) return; if (y1 < e->sy) return; if (y0 < e->sy) { x0 += (x1-x0) * (e->sy - y0) / (y1-y0); y0 = e->sy; } if (y1 > e->ey) { x1 += (x1-x0) * (e->ey - y1) / (y1-y0); y1 = e->ey; } if (x0 == x) STBTT_assert(x1 <= x+1); else if (x0 == x+1) STBTT_assert(x1 >= x); else if (x0 <= x) STBTT_assert(x1 <= x); else if (x0 >= x+1) STBTT_assert(x1 >= x+1); else STBTT_assert(x1 >= x && x1 <= x+1); if (x0 <= x && x1 <= x) scanline[x] += e->direction * (y1-y0); else if (x0 >= x+1 && x1 >= x+1) ; else { STBTT_assert(x0 >= x && x0 <= x+1 && x1 >= x && x1 <= x+1); scanline[x] += e->direction * (y1-y0) * (1-((x0-x)+(x1-x))/2); // coverage = 1 - average x position } } static void stbtt__fill_active_edges_new(float *scanline, float *scanline_fill, int len, stbtt__active_edge *e, float y_top) { float y_bottom = y_top+1; while (e) { // brute force every pixel // compute intersection points with top & bottom STBTT_assert(e->ey >= y_top); if (e->fdx == 0) { float x0 = e->fx; if (x0 < len) { if (x0 >= 0) { stbtt__handle_clipped_edge(scanline,(int) x0,e, x0,y_top, x0,y_bottom); stbtt__handle_clipped_edge(scanline_fill-1,(int) x0+1,e, x0,y_top, x0,y_bottom); } else { stbtt__handle_clipped_edge(scanline_fill-1,0,e, x0,y_top, x0,y_bottom); } } } else { float x0 = e->fx; float dx = e->fdx; float xb = x0 + dx; float x_top, x_bottom; float sy0,sy1; float dy = e->fdy; STBTT_assert(e->sy <= y_bottom && e->ey >= y_top); // compute endpoints of line segment clipped to this scanline (if the // line segment starts on this scanline. x0 is the intersection of the // line with y_top, but that may be off the line segment. if (e->sy > y_top) { x_top = x0 + dx * (e->sy - y_top); sy0 = e->sy; } else { x_top = x0; sy0 = y_top; } if (e->ey < y_bottom) { x_bottom = x0 + dx * (e->ey - y_top); sy1 = e->ey; } else { x_bottom = xb; sy1 = y_bottom; } if (x_top >= 0 && x_bottom >= 0 && x_top < len && x_bottom < len) { // from here on, we don't have to range check x values if ((int) x_top == (int) x_bottom) { float height; // simple case, only spans one pixel int x = (int) x_top; height = sy1 - sy0; STBTT_assert(x >= 0 && x < len); scanline[x] += e->direction * (1-((x_top - x) + (x_bottom-x))/2) * height; scanline_fill[x] += e->direction * height; // everything right of this pixel is filled } else { int x,x1,x2; float y_crossing, step, sign, area; // covers 2+ pixels if (x_top > x_bottom) { // flip scanline vertically; signed area is the same float t; sy0 = y_bottom - (sy0 - y_top); sy1 = y_bottom - (sy1 - y_top); t = sy0, sy0 = sy1, sy1 = t; t = x_bottom, x_bottom = x_top, x_top = t; dx = -dx; dy = -dy; t = x0, x0 = xb, xb = t; } x1 = (int) x_top; x2 = (int) x_bottom; // compute intersection with y axis at x1+1 y_crossing = (x1+1 - x0) * dy + y_top; sign = e->direction; // area of the rectangle covered from y0..y_crossing area = sign * (y_crossing-sy0); // area of the triangle (x_top,y0), (x+1,y0), (x+1,y_crossing) scanline[x1] += area * (1-((x_top - x1)+(x1+1-x1))/2); step = sign * dy; for (x = x1+1; x < x2; ++x) { scanline[x] += area + step/2; area += step; } y_crossing += dy * (x2 - (x1+1)); STBTT_assert(STBTT_fabs(area) <= 1.01f); scanline[x2] += area + sign * (1-((x2-x2)+(x_bottom-x2))/2) * (sy1-y_crossing); scanline_fill[x2] += sign * (sy1-sy0); } } else { // if edge goes outside of box we're drawing, we require // clipping logic. since this does not match the intended use // of this library, we use a different, very slow brute // force implementation int x; for (x=0; x < len; ++x) { // cases: // // there can be up to two intersections with the pixel. any intersection // with left or right edges can be handled by splitting into two (or three) // regions. intersections with top & bottom do not necessitate case-wise logic. // // the old way of doing this found the intersections with the left & right edges, // then used some simple logic to produce up to three segments in sorted order // from top-to-bottom. however, this had a problem: if an x edge was epsilon // across the x border, then the corresponding y position might not be distinct // from the other y segment, and it might ignored as an empty segment. to avoid // that, we need to explicitly produce segments based on x positions. // rename variables to clearly-defined pairs float y0 = y_top; float x1 = (float) (x); float x2 = (float) (x+1); float x3 = xb; float y3 = y_bottom; // x = e->x + e->dx * (y-y_top) // (y-y_top) = (x - e->x) / e->dx // y = (x - e->x) / e->dx + y_top float y1 = (x - x0) / dx + y_top; float y2 = (x+1 - x0) / dx + y_top; if (x0 < x1 && x3 > x2) { // three segments descending down-right stbtt__handle_clipped_edge(scanline,x,e, x0,y0, x1,y1); stbtt__handle_clipped_edge(scanline,x,e, x1,y1, x2,y2); stbtt__handle_clipped_edge(scanline,x,e, x2,y2, x3,y3); } else if (x3 < x1 && x0 > x2) { // three segments descending down-left stbtt__handle_clipped_edge(scanline,x,e, x0,y0, x2,y2); stbtt__handle_clipped_edge(scanline,x,e, x2,y2, x1,y1); stbtt__handle_clipped_edge(scanline,x,e, x1,y1, x3,y3); } else if (x0 < x1 && x3 > x1) { // two segments across x, down-right stbtt__handle_clipped_edge(scanline,x,e, x0,y0, x1,y1); stbtt__handle_clipped_edge(scanline,x,e, x1,y1, x3,y3); } else if (x3 < x1 && x0 > x1) { // two segments across x, down-left stbtt__handle_clipped_edge(scanline,x,e, x0,y0, x1,y1); stbtt__handle_clipped_edge(scanline,x,e, x1,y1, x3,y3); } else if (x0 < x2 && x3 > x2) { // two segments across x+1, down-right stbtt__handle_clipped_edge(scanline,x,e, x0,y0, x2,y2); stbtt__handle_clipped_edge(scanline,x,e, x2,y2, x3,y3); } else if (x3 < x2 && x0 > x2) { // two segments across x+1, down-left stbtt__handle_clipped_edge(scanline,x,e, x0,y0, x2,y2); stbtt__handle_clipped_edge(scanline,x,e, x2,y2, x3,y3); } else { // one segment stbtt__handle_clipped_edge(scanline,x,e, x0,y0, x3,y3); } } } } e = e->next; } } // directly AA rasterize edges w/o supersampling static void stbtt__rasterize_sorted_edges(stbtt__bitmap *result, stbtt__edge *e, int n, int vsubsample, int off_x, int off_y, void *userdata) { stbtt__hheap hh = { 0, 0, 0 }; stbtt__active_edge *active = NULL; int y,j=0, i; float scanline_data[129], *scanline, *scanline2; STBTT__NOTUSED(vsubsample); if (result->w > 64) scanline = (float *) STBTT_malloc((result->w*2+1) * sizeof(float), userdata); else scanline = scanline_data; scanline2 = scanline + result->w; y = off_y; e[n].y0 = (float) (off_y + result->h) + 1; while (j < result->h) { // find center of pixel for this scanline float scan_y_top = y + 0.0f; float scan_y_bottom = y + 1.0f; stbtt__active_edge **step = &active; STBTT_memset(scanline , 0, result->w*sizeof(scanline[0])); STBTT_memset(scanline2, 0, (result->w+1)*sizeof(scanline[0])); // update all active edges; // remove all active edges that terminate before the top of this scanline while (*step) { stbtt__active_edge * z = *step; if (z->ey <= scan_y_top) { *step = z->next; // delete from list STBTT_assert(z->direction); z->direction = 0; stbtt__hheap_free(&hh, z); } else { step = &((*step)->next); // advance through list } } // insert all edges that start before the bottom of this scanline while (e->y0 <= scan_y_bottom) { if (e->y0 != e->y1) { stbtt__active_edge *z = stbtt__new_active(&hh, e, off_x, scan_y_top, userdata); if (z != NULL) { STBTT_assert(z->ey >= scan_y_top); // insert at front z->next = active; active = z; } } ++e; } // now process all active edges if (active) stbtt__fill_active_edges_new(scanline, scanline2+1, result->w, active, scan_y_top); { float sum = 0; for (i=0; i < result->w; ++i) { float k; int m; sum += scanline2[i]; k = scanline[i] + sum; k = (float) STBTT_fabs(k)*255 + 0.5f; m = (int) k; if (m > 255) m = 255; result->pixels[j*result->stride + i] = (unsigned char) m; } } // advance all the edges step = &active; while (*step) { stbtt__active_edge *z = *step; z->fx += z->fdx; // advance to position for current scanline step = &((*step)->next); // advance through list } ++y; ++j; } stbtt__hheap_cleanup(&hh, userdata); if (scanline != scanline_data) STBTT_free(scanline, userdata); } #else #error "Unrecognized value of STBTT_RASTERIZER_VERSION" #endif #define STBTT__COMPARE(a,b) ((a)->y0 < (b)->y0) static void stbtt__sort_edges_ins_sort(stbtt__edge *p, int n) { int i,j; for (i=1; i < n; ++i) { stbtt__edge t = p[i], *a = &t; j = i; while (j > 0) { stbtt__edge *b = &p[j-1]; int c = STBTT__COMPARE(a,b); if (!c) break; p[j] = p[j-1]; --j; } if (i != j) p[j] = t; } } static void stbtt__sort_edges_quicksort(stbtt__edge *p, int n) { /* threshhold for transitioning to insertion sort */ while (n > 12) { stbtt__edge t; int c01,c12,c,m,i,j; /* compute median of three */ m = n >> 1; c01 = STBTT__COMPARE(&p[0],&p[m]); c12 = STBTT__COMPARE(&p[m],&p[n-1]); /* if 0 >= mid >= end, or 0 < mid < end, then use mid */ if (c01 != c12) { /* otherwise, we'll need to swap something else to middle */ int z; c = STBTT__COMPARE(&p[0],&p[n-1]); /* 0>mid && midn => n; 0 0 */ /* 0n: 0>n => 0; 0 n */ z = (c == c12) ? 0 : n-1; t = p[z]; p[z] = p[m]; p[m] = t; } /* now p[m] is the median-of-three */ /* swap it to the beginning so it won't move around */ t = p[0]; p[0] = p[m]; p[m] = t; /* partition loop */ i=1; j=n-1; for(;;) { /* handling of equality is crucial here */ /* for sentinels & efficiency with duplicates */ for (;;++i) { if (!STBTT__COMPARE(&p[i], &p[0])) break; } for (;;--j) { if (!STBTT__COMPARE(&p[0], &p[j])) break; } /* make sure we haven't crossed */ if (i >= j) break; t = p[i]; p[i] = p[j]; p[j] = t; ++i; --j; } /* recurse on smaller side, iterate on larger */ if (j < (n-i)) { stbtt__sort_edges_quicksort(p,j); p = p+i; n = n-i; } else { stbtt__sort_edges_quicksort(p+i, n-i); n = j; } } } static void stbtt__sort_edges(stbtt__edge *p, int n) { stbtt__sort_edges_quicksort(p, n); stbtt__sort_edges_ins_sort(p, n); } typedef struct { float x,y; } stbtt__point; static void stbtt__rasterize(stbtt__bitmap *result, stbtt__point *pts, int *wcount, int windings, float scale_x, float scale_y, float shift_x, float shift_y, int off_x, int off_y, int invert, void *userdata) { float y_scale_inv = invert ? -scale_y : scale_y; stbtt__edge *e; int n,i,j,k,m; #if STBTT_RASTERIZER_VERSION == 1 int vsubsample = result->h < 8 ? 15 : 5; #elif STBTT_RASTERIZER_VERSION == 2 int vsubsample = 1; #else #error "Unrecognized value of STBTT_RASTERIZER_VERSION" #endif // vsubsample should divide 255 evenly; otherwise we won't reach full opacity // now we have to blow out the windings into explicit edge lists n = 0; for (i=0; i < windings; ++i) n += wcount[i]; e = (stbtt__edge *) STBTT_malloc(sizeof(*e) * (n+1), userdata); // add an extra one as a sentinel if (e == 0) return; n = 0; m=0; for (i=0; i < windings; ++i) { stbtt__point *p = pts + m; m += wcount[i]; j = wcount[i]-1; for (k=0; k < wcount[i]; j=k++) { int a=k,b=j; // skip the edge if horizontal if (p[j].y == p[k].y) continue; // add edge from j to k to the list e[n].invert = 0; if (invert ? p[j].y > p[k].y : p[j].y < p[k].y) { e[n].invert = 1; a=j,b=k; } e[n].x0 = p[a].x * scale_x + shift_x; e[n].y0 = (p[a].y * y_scale_inv + shift_y) * vsubsample; e[n].x1 = p[b].x * scale_x + shift_x; e[n].y1 = (p[b].y * y_scale_inv + shift_y) * vsubsample; ++n; } } // now sort the edges by their highest point (should snap to integer, and then by x) //STBTT_sort(e, n, sizeof(e[0]), stbtt__edge_compare); stbtt__sort_edges(e, n); // now, traverse the scanlines and find the intersections on each scanline, use xor winding rule stbtt__rasterize_sorted_edges(result, e, n, vsubsample, off_x, off_y, userdata); STBTT_free(e, userdata); } static void stbtt__add_point(stbtt__point *points, int n, float x, float y) { if (!points) return; // during first pass, it's unallocated points[n].x = x; points[n].y = y; } // tesselate until threshhold p is happy... @TODO warped to compensate for non-linear stretching static int stbtt__tesselate_curve(stbtt__point *points, int *num_points, float x0, float y0, float x1, float y1, float x2, float y2, float objspace_flatness_squared, int n) { // midpoint float mx = (x0 + 2*x1 + x2)/4; float my = (y0 + 2*y1 + y2)/4; // versus directly drawn line float dx = (x0+x2)/2 - mx; float dy = (y0+y2)/2 - my; if (n > 16) // 65536 segments on one curve better be enough! return 1; if (dx*dx+dy*dy > objspace_flatness_squared) { // half-pixel error allowed... need to be smaller if AA stbtt__tesselate_curve(points, num_points, x0,y0, (x0+x1)/2.0f,(y0+y1)/2.0f, mx,my, objspace_flatness_squared,n+1); stbtt__tesselate_curve(points, num_points, mx,my, (x1+x2)/2.0f,(y1+y2)/2.0f, x2,y2, objspace_flatness_squared,n+1); } else { stbtt__add_point(points, *num_points,x2,y2); *num_points = *num_points+1; } return 1; } static void stbtt__tesselate_cubic(stbtt__point *points, int *num_points, float x0, float y0, float x1, float y1, float x2, float y2, float x3, float y3, float objspace_flatness_squared, int n) { // @TODO this "flatness" calculation is just made-up nonsense that seems to work well enough float dx0 = x1-x0; float dy0 = y1-y0; float dx1 = x2-x1; float dy1 = y2-y1; float dx2 = x3-x2; float dy2 = y3-y2; float dx = x3-x0; float dy = y3-y0; float longlen = (float) (STBTT_sqrt(dx0*dx0+dy0*dy0)+STBTT_sqrt(dx1*dx1+dy1*dy1)+STBTT_sqrt(dx2*dx2+dy2*dy2)); float shortlen = (float) STBTT_sqrt(dx*dx+dy*dy); float flatness_squared = longlen*longlen-shortlen*shortlen; if (n > 16) // 65536 segments on one curve better be enough! return; if (flatness_squared > objspace_flatness_squared) { float x01 = (x0+x1)/2; float y01 = (y0+y1)/2; float x12 = (x1+x2)/2; float y12 = (y1+y2)/2; float x23 = (x2+x3)/2; float y23 = (y2+y3)/2; float xa = (x01+x12)/2; float ya = (y01+y12)/2; float xb = (x12+x23)/2; float yb = (y12+y23)/2; float mx = (xa+xb)/2; float my = (ya+yb)/2; stbtt__tesselate_cubic(points, num_points, x0,y0, x01,y01, xa,ya, mx,my, objspace_flatness_squared,n+1); stbtt__tesselate_cubic(points, num_points, mx,my, xb,yb, x23,y23, x3,y3, objspace_flatness_squared,n+1); } else { stbtt__add_point(points, *num_points,x3,y3); *num_points = *num_points+1; } } // returns number of contours static stbtt__point *stbtt_FlattenCurves(stbtt_vertex *vertices, int num_verts, float objspace_flatness, int **contour_lengths, int *num_contours, void *userdata) { stbtt__point *points=0; int num_points=0; float objspace_flatness_squared = objspace_flatness * objspace_flatness; int i,n=0,start=0, pass; // count how many "moves" there are to get the contour count for (i=0; i < num_verts; ++i) if (vertices[i].type == STBTT_vmove) ++n; *num_contours = n; if (n == 0) return 0; *contour_lengths = (int *) STBTT_malloc(sizeof(**contour_lengths) * n, userdata); if (*contour_lengths == 0) { *num_contours = 0; return 0; } // make two passes through the points so we don't need to realloc for (pass=0; pass < 2; ++pass) { float x=0,y=0; if (pass == 1) { points = (stbtt__point *) STBTT_malloc(num_points * sizeof(points[0]), userdata); if (points == NULL) goto error; } num_points = 0; n= -1; for (i=0; i < num_verts; ++i) { switch (vertices[i].type) { case STBTT_vmove: // start the next contour if (n >= 0) (*contour_lengths)[n] = num_points - start; ++n; start = num_points; x = vertices[i].x, y = vertices[i].y; stbtt__add_point(points, num_points++, x,y); break; case STBTT_vline: x = vertices[i].x, y = vertices[i].y; stbtt__add_point(points, num_points++, x, y); break; case STBTT_vcurve: stbtt__tesselate_curve(points, &num_points, x,y, vertices[i].cx, vertices[i].cy, vertices[i].x, vertices[i].y, objspace_flatness_squared, 0); x = vertices[i].x, y = vertices[i].y; break; case STBTT_vcubic: stbtt__tesselate_cubic(points, &num_points, x,y, vertices[i].cx, vertices[i].cy, vertices[i].cx1, vertices[i].cy1, vertices[i].x, vertices[i].y, objspace_flatness_squared, 0); x = vertices[i].x, y = vertices[i].y; break; } } (*contour_lengths)[n] = num_points - start; } return points; error: STBTT_free(points, userdata); STBTT_free(*contour_lengths, userdata); *contour_lengths = 0; *num_contours = 0; return NULL; } STBTT_DEF void stbtt_Rasterize(stbtt__bitmap *result, float flatness_in_pixels, stbtt_vertex *vertices, int num_verts, float scale_x, float scale_y, float shift_x, float shift_y, int x_off, int y_off, int invert, void *userdata) { float scale = scale_x > scale_y ? scale_y : scale_x; int winding_count, *winding_lengths; stbtt__point *windings = stbtt_FlattenCurves(vertices, num_verts, flatness_in_pixels / scale, &winding_lengths, &winding_count, userdata); if (windings) { stbtt__rasterize(result, windings, winding_lengths, winding_count, scale_x, scale_y, shift_x, shift_y, x_off, y_off, invert, userdata); STBTT_free(winding_lengths, userdata); STBTT_free(windings, userdata); } } STBTT_DEF void stbtt_FreeBitmap(unsigned char *bitmap, void *userdata) { STBTT_free(bitmap, userdata); } STBTT_DEF unsigned char *stbtt_GetGlyphBitmapSubpixel(const stbtt_fontinfo *info, float scale_x, float scale_y, float shift_x, float shift_y, int glyph, int *width, int *height, int *xoff, int *yoff) { int ix0,iy0,ix1,iy1; stbtt__bitmap gbm; stbtt_vertex *vertices; int num_verts = stbtt_GetGlyphShape(info, glyph, &vertices); if (scale_x == 0) scale_x = scale_y; if (scale_y == 0) { if (scale_x == 0) { STBTT_free(vertices, info->userdata); return NULL; } scale_y = scale_x; } stbtt_GetGlyphBitmapBoxSubpixel(info, glyph, scale_x, scale_y, shift_x, shift_y, &ix0,&iy0,&ix1,&iy1); // now we get the size gbm.w = (ix1 - ix0); gbm.h = (iy1 - iy0); gbm.pixels = NULL; // in case we error if (width ) *width = gbm.w; if (height) *height = gbm.h; if (xoff ) *xoff = ix0; if (yoff ) *yoff = iy0; if (gbm.w && gbm.h) { gbm.pixels = (unsigned char *) STBTT_malloc(gbm.w * gbm.h, info->userdata); if (gbm.pixels) { gbm.stride = gbm.w; stbtt_Rasterize(&gbm, 0.35f, vertices, num_verts, scale_x, scale_y, shift_x, shift_y, ix0, iy0, 1, info->userdata); } } STBTT_free(vertices, info->userdata); return gbm.pixels; } STBTT_DEF unsigned char *stbtt_GetGlyphBitmap(const stbtt_fontinfo *info, float scale_x, float scale_y, int glyph, int *width, int *height, int *xoff, int *yoff) { return stbtt_GetGlyphBitmapSubpixel(info, scale_x, scale_y, 0.0f, 0.0f, glyph, width, height, xoff, yoff); } STBTT_DEF void stbtt_MakeGlyphBitmapSubpixel(const stbtt_fontinfo *info, unsigned char *output, int out_w, int out_h, int out_stride, float scale_x, float scale_y, float shift_x, float shift_y, int glyph) { int ix0,iy0; stbtt_vertex *vertices; int num_verts = stbtt_GetGlyphShape(info, glyph, &vertices); stbtt__bitmap gbm; stbtt_GetGlyphBitmapBoxSubpixel(info, glyph, scale_x, scale_y, shift_x, shift_y, &ix0,&iy0,0,0); gbm.pixels = output; gbm.w = out_w; gbm.h = out_h; gbm.stride = out_stride; if (gbm.w && gbm.h) stbtt_Rasterize(&gbm, 0.35f, vertices, num_verts, scale_x, scale_y, shift_x, shift_y, ix0,iy0, 1, info->userdata); STBTT_free(vertices, info->userdata); } STBTT_DEF void stbtt_MakeGlyphBitmap(const stbtt_fontinfo *info, unsigned char *output, int out_w, int out_h, int out_stride, float scale_x, float scale_y, int glyph) { stbtt_MakeGlyphBitmapSubpixel(info, output, out_w, out_h, out_stride, scale_x, scale_y, 0.0f,0.0f, glyph); } STBTT_DEF unsigned char *stbtt_GetCodepointBitmapSubpixel(const stbtt_fontinfo *info, float scale_x, float scale_y, float shift_x, float shift_y, int codepoint, int *width, int *height, int *xoff, int *yoff) { return stbtt_GetGlyphBitmapSubpixel(info, scale_x, scale_y,shift_x,shift_y, stbtt_FindGlyphIndex(info,codepoint), width,height,xoff,yoff); } STBTT_DEF void stbtt_MakeCodepointBitmapSubpixel(const stbtt_fontinfo *info, unsigned char *output, int out_w, int out_h, int out_stride, float scale_x, float scale_y, float shift_x, float shift_y, int codepoint) { stbtt_MakeGlyphBitmapSubpixel(info, output, out_w, out_h, out_stride, scale_x, scale_y, shift_x, shift_y, stbtt_FindGlyphIndex(info,codepoint)); } STBTT_DEF unsigned char *stbtt_GetCodepointBitmap(const stbtt_fontinfo *info, float scale_x, float scale_y, int codepoint, int *width, int *height, int *xoff, int *yoff) { return stbtt_GetCodepointBitmapSubpixel(info, scale_x, scale_y, 0.0f,0.0f, codepoint, width,height,xoff,yoff); } STBTT_DEF void stbtt_MakeCodepointBitmap(const stbtt_fontinfo *info, unsigned char *output, int out_w, int out_h, int out_stride, float scale_x, float scale_y, int codepoint) { stbtt_MakeCodepointBitmapSubpixel(info, output, out_w, out_h, out_stride, scale_x, scale_y, 0.0f,0.0f, codepoint); } ////////////////////////////////////////////////////////////////////////////// // // bitmap baking // // This is SUPER-CRAPPY packing to keep source code small static int stbtt_BakeFontBitmap_internal(unsigned char *data, int offset, // font location (use offset=0 for plain .ttf) float pixel_height, // height of font in pixels unsigned char *pixels, int pw, int ph, // bitmap to be filled in int first_char, int num_chars, // characters to bake stbtt_bakedchar *chardata) { float scale; int x,y,bottom_y, i; stbtt_fontinfo f; f.userdata = NULL; if (!stbtt_InitFont(&f, data, offset)) return -1; STBTT_memset(pixels, 0, pw*ph); // background of 0 around pixels x=y=1; bottom_y = 1; scale = stbtt_ScaleForPixelHeight(&f, pixel_height); for (i=0; i < num_chars; ++i) { int advance, lsb, x0,y0,x1,y1,gw,gh; int g = stbtt_FindGlyphIndex(&f, first_char + i); stbtt_GetGlyphHMetrics(&f, g, &advance, &lsb); stbtt_GetGlyphBitmapBox(&f, g, scale,scale, &x0,&y0,&x1,&y1); gw = x1-x0; gh = y1-y0; if (x + gw + 1 >= pw) y = bottom_y, x = 1; // advance to next row if (y + gh + 1 >= ph) // check if it fits vertically AFTER potentially moving to next row return -i; STBTT_assert(x+gw < pw); STBTT_assert(y+gh < ph); stbtt_MakeGlyphBitmap(&f, pixels+x+y*pw, gw,gh,pw, scale,scale, g); chardata[i].x0 = (stbtt_int16) x; chardata[i].y0 = (stbtt_int16) y; chardata[i].x1 = (stbtt_int16) (x + gw); chardata[i].y1 = (stbtt_int16) (y + gh); chardata[i].xadvance = scale * advance; chardata[i].xoff = (float) x0; chardata[i].yoff = (float) y0; x = x + gw + 1; if (y+gh+1 > bottom_y) bottom_y = y+gh+1; } return bottom_y; } STBTT_DEF void stbtt_GetBakedQuad(const stbtt_bakedchar *chardata, int pw, int ph, int char_index, float *xpos, float *ypos, stbtt_aligned_quad *q, int opengl_fillrule) { float d3d_bias = opengl_fillrule ? 0 : -0.5f; float ipw = 1.0f / pw, iph = 1.0f / ph; const stbtt_bakedchar *b = chardata + char_index; int round_x = STBTT_ifloor((*xpos + b->xoff) + 0.5f); int round_y = STBTT_ifloor((*ypos + b->yoff) + 0.5f); q->x0 = round_x + d3d_bias; q->y0 = round_y + d3d_bias; q->x1 = round_x + b->x1 - b->x0 + d3d_bias; q->y1 = round_y + b->y1 - b->y0 + d3d_bias; q->s0 = b->x0 * ipw; q->t0 = b->y0 * iph; q->s1 = b->x1 * ipw; q->t1 = b->y1 * iph; *xpos += b->xadvance; } ////////////////////////////////////////////////////////////////////////////// // // rectangle packing replacement routines if you don't have stb_rect_pack.h // #ifndef STB_RECT_PACK_VERSION typedef int stbrp_coord; //////////////////////////////////////////////////////////////////////////////////// // // // // // COMPILER WARNING ?!?!? // // // // // // if you get a compile warning due to these symbols being defined more than // // once, move #include "stb_rect_pack.h" before #include "stb_truetype.h" // // // //////////////////////////////////////////////////////////////////////////////////// typedef struct { int width,height; int x,y,bottom_y; } stbrp_context; typedef struct { unsigned char x; } stbrp_node; struct stbrp_rect { stbrp_coord x,y; int id,w,h,was_packed; }; static void stbrp_init_target(stbrp_context *con, int pw, int ph, stbrp_node *nodes, int num_nodes) { con->width = pw; con->height = ph; con->x = 0; con->y = 0; con->bottom_y = 0; STBTT__NOTUSED(nodes); STBTT__NOTUSED(num_nodes); } static void stbrp_pack_rects(stbrp_context *con, stbrp_rect *rects, int num_rects) { int i; for (i=0; i < num_rects; ++i) { if (con->x + rects[i].w > con->width) { con->x = 0; con->y = con->bottom_y; } if (con->y + rects[i].h > con->height) break; rects[i].x = con->x; rects[i].y = con->y; rects[i].was_packed = 1; con->x += rects[i].w; if (con->y + rects[i].h > con->bottom_y) con->bottom_y = con->y + rects[i].h; } for ( ; i < num_rects; ++i) rects[i].was_packed = 0; } #endif ////////////////////////////////////////////////////////////////////////////// // // bitmap baking // // This is SUPER-AWESOME (tm Ryan Gordon) packing using stb_rect_pack.h. If // stb_rect_pack.h isn't available, it uses the BakeFontBitmap strategy. STBTT_DEF int stbtt_PackBegin(stbtt_pack_context *spc, unsigned char *pixels, int pw, int ph, int stride_in_bytes, int padding, void *alloc_context) { stbrp_context *context = (stbrp_context *) STBTT_malloc(sizeof(*context) ,alloc_context); int num_nodes = pw - padding; stbrp_node *nodes = (stbrp_node *) STBTT_malloc(sizeof(*nodes ) * num_nodes,alloc_context); if (context == NULL || nodes == NULL) { if (context != NULL) STBTT_free(context, alloc_context); if (nodes != NULL) STBTT_free(nodes , alloc_context); return 0; } spc->user_allocator_context = alloc_context; spc->width = pw; spc->height = ph; spc->pixels = pixels; spc->pack_info = context; spc->nodes = nodes; spc->padding = padding; spc->stride_in_bytes = stride_in_bytes != 0 ? stride_in_bytes : pw; spc->h_oversample = 1; spc->v_oversample = 1; stbrp_init_target(context, pw-padding, ph-padding, nodes, num_nodes); if (pixels) STBTT_memset(pixels, 0, pw*ph); // background of 0 around pixels return 1; } STBTT_DEF void stbtt_PackEnd (stbtt_pack_context *spc) { STBTT_free(spc->nodes , spc->user_allocator_context); STBTT_free(spc->pack_info, spc->user_allocator_context); } STBTT_DEF void stbtt_PackSetOversampling(stbtt_pack_context *spc, unsigned int h_oversample, unsigned int v_oversample) { STBTT_assert(h_oversample <= STBTT_MAX_OVERSAMPLE); STBTT_assert(v_oversample <= STBTT_MAX_OVERSAMPLE); if (h_oversample <= STBTT_MAX_OVERSAMPLE) spc->h_oversample = h_oversample; if (v_oversample <= STBTT_MAX_OVERSAMPLE) spc->v_oversample = v_oversample; } #define STBTT__OVER_MASK (STBTT_MAX_OVERSAMPLE-1) static void stbtt__h_prefilter(unsigned char *pixels, int w, int h, int stride_in_bytes, unsigned int kernel_width) { unsigned char buffer[STBTT_MAX_OVERSAMPLE]; int safe_w = w - kernel_width; int j; STBTT_memset(buffer, 0, STBTT_MAX_OVERSAMPLE); // suppress bogus warning from VS2013 -analyze for (j=0; j < h; ++j) { int i; unsigned int total; STBTT_memset(buffer, 0, kernel_width); total = 0; // make kernel_width a constant in common cases so compiler can optimize out the divide switch (kernel_width) { case 2: for (i=0; i <= safe_w; ++i) { total += pixels[i] - buffer[i & STBTT__OVER_MASK]; buffer[(i+kernel_width) & STBTT__OVER_MASK] = pixels[i]; pixels[i] = (unsigned char) (total / 2); } break; case 3: for (i=0; i <= safe_w; ++i) { total += pixels[i] - buffer[i & STBTT__OVER_MASK]; buffer[(i+kernel_width) & STBTT__OVER_MASK] = pixels[i]; pixels[i] = (unsigned char) (total / 3); } break; case 4: for (i=0; i <= safe_w; ++i) { total += pixels[i] - buffer[i & STBTT__OVER_MASK]; buffer[(i+kernel_width) & STBTT__OVER_MASK] = pixels[i]; pixels[i] = (unsigned char) (total / 4); } break; case 5: for (i=0; i <= safe_w; ++i) { total += pixels[i] - buffer[i & STBTT__OVER_MASK]; buffer[(i+kernel_width) & STBTT__OVER_MASK] = pixels[i]; pixels[i] = (unsigned char) (total / 5); } break; default: for (i=0; i <= safe_w; ++i) { total += pixels[i] - buffer[i & STBTT__OVER_MASK]; buffer[(i+kernel_width) & STBTT__OVER_MASK] = pixels[i]; pixels[i] = (unsigned char) (total / kernel_width); } break; } for (; i < w; ++i) { STBTT_assert(pixels[i] == 0); total -= buffer[i & STBTT__OVER_MASK]; pixels[i] = (unsigned char) (total / kernel_width); } pixels += stride_in_bytes; } } static void stbtt__v_prefilter(unsigned char *pixels, int w, int h, int stride_in_bytes, unsigned int kernel_width) { unsigned char buffer[STBTT_MAX_OVERSAMPLE]; int safe_h = h - kernel_width; int j; STBTT_memset(buffer, 0, STBTT_MAX_OVERSAMPLE); // suppress bogus warning from VS2013 -analyze for (j=0; j < w; ++j) { int i; unsigned int total; STBTT_memset(buffer, 0, kernel_width); total = 0; // make kernel_width a constant in common cases so compiler can optimize out the divide switch (kernel_width) { case 2: for (i=0; i <= safe_h; ++i) { total += pixels[i*stride_in_bytes] - buffer[i & STBTT__OVER_MASK]; buffer[(i+kernel_width) & STBTT__OVER_MASK] = pixels[i*stride_in_bytes]; pixels[i*stride_in_bytes] = (unsigned char) (total / 2); } break; case 3: for (i=0; i <= safe_h; ++i) { total += pixels[i*stride_in_bytes] - buffer[i & STBTT__OVER_MASK]; buffer[(i+kernel_width) & STBTT__OVER_MASK] = pixels[i*stride_in_bytes]; pixels[i*stride_in_bytes] = (unsigned char) (total / 3); } break; case 4: for (i=0; i <= safe_h; ++i) { total += pixels[i*stride_in_bytes] - buffer[i & STBTT__OVER_MASK]; buffer[(i+kernel_width) & STBTT__OVER_MASK] = pixels[i*stride_in_bytes]; pixels[i*stride_in_bytes] = (unsigned char) (total / 4); } break; case 5: for (i=0; i <= safe_h; ++i) { total += pixels[i*stride_in_bytes] - buffer[i & STBTT__OVER_MASK]; buffer[(i+kernel_width) & STBTT__OVER_MASK] = pixels[i*stride_in_bytes]; pixels[i*stride_in_bytes] = (unsigned char) (total / 5); } break; default: for (i=0; i <= safe_h; ++i) { total += pixels[i*stride_in_bytes] - buffer[i & STBTT__OVER_MASK]; buffer[(i+kernel_width) & STBTT__OVER_MASK] = pixels[i*stride_in_bytes]; pixels[i*stride_in_bytes] = (unsigned char) (total / kernel_width); } break; } for (; i < h; ++i) { STBTT_assert(pixels[i*stride_in_bytes] == 0); total -= buffer[i & STBTT__OVER_MASK]; pixels[i*stride_in_bytes] = (unsigned char) (total / kernel_width); } pixels += 1; } } static float stbtt__oversample_shift(int oversample) { if (!oversample) return 0.0f; // The prefilter is a box filter of width "oversample", // which shifts phase by (oversample - 1)/2 pixels in // oversampled space. We want to shift in the opposite // direction to counter this. return (float)-(oversample - 1) / (2.0f * (float)oversample); } // rects array must be big enough to accommodate all characters in the given ranges STBTT_DEF int stbtt_PackFontRangesGatherRects(stbtt_pack_context *spc, const stbtt_fontinfo *info, stbtt_pack_range *ranges, int num_ranges, stbrp_rect *rects) { int i,j,k; k=0; for (i=0; i < num_ranges; ++i) { float fh = ranges[i].font_size; float scale = fh > 0 ? stbtt_ScaleForPixelHeight(info, fh) : stbtt_ScaleForMappingEmToPixels(info, -fh); ranges[i].h_oversample = (unsigned char) spc->h_oversample; ranges[i].v_oversample = (unsigned char) spc->v_oversample; for (j=0; j < ranges[i].num_chars; ++j) { int x0,y0,x1,y1; int codepoint = ranges[i].array_of_unicode_codepoints == NULL ? ranges[i].first_unicode_codepoint_in_range + j : ranges[i].array_of_unicode_codepoints[j]; int glyph = stbtt_FindGlyphIndex(info, codepoint); stbtt_GetGlyphBitmapBoxSubpixel(info,glyph, scale * spc->h_oversample, scale * spc->v_oversample, 0,0, &x0,&y0,&x1,&y1); rects[k].w = (stbrp_coord) (x1-x0 + spc->padding + spc->h_oversample-1); rects[k].h = (stbrp_coord) (y1-y0 + spc->padding + spc->v_oversample-1); ++k; } } return k; } STBTT_DEF void stbtt_MakeGlyphBitmapSubpixelPrefilter(const stbtt_fontinfo *info, unsigned char *output, int out_w, int out_h, int out_stride, float scale_x, float scale_y, float shift_x, float shift_y, int prefilter_x, int prefilter_y, float *sub_x, float *sub_y, int glyph) { stbtt_MakeGlyphBitmapSubpixel(info, output, out_w - (prefilter_x - 1), out_h - (prefilter_y - 1), out_stride, scale_x, scale_y, shift_x, shift_y, glyph); if (prefilter_x > 1) stbtt__h_prefilter(output, out_w, out_h, out_stride, prefilter_x); if (prefilter_y > 1) stbtt__v_prefilter(output, out_w, out_h, out_stride, prefilter_y); *sub_x = stbtt__oversample_shift(prefilter_x); *sub_y = stbtt__oversample_shift(prefilter_y); } // rects array must be big enough to accommodate all characters in the given ranges STBTT_DEF int stbtt_PackFontRangesRenderIntoRects(stbtt_pack_context *spc, const stbtt_fontinfo *info, stbtt_pack_range *ranges, int num_ranges, stbrp_rect *rects) { int i,j,k, return_value = 1; // save current values int old_h_over = spc->h_oversample; int old_v_over = spc->v_oversample; k = 0; for (i=0; i < num_ranges; ++i) { float fh = ranges[i].font_size; float scale = fh > 0 ? stbtt_ScaleForPixelHeight(info, fh) : stbtt_ScaleForMappingEmToPixels(info, -fh); float recip_h,recip_v,sub_x,sub_y; spc->h_oversample = ranges[i].h_oversample; spc->v_oversample = ranges[i].v_oversample; recip_h = 1.0f / spc->h_oversample; recip_v = 1.0f / spc->v_oversample; sub_x = stbtt__oversample_shift(spc->h_oversample); sub_y = stbtt__oversample_shift(spc->v_oversample); for (j=0; j < ranges[i].num_chars; ++j) { stbrp_rect *r = &rects[k]; if (r->was_packed) { stbtt_packedchar *bc = &ranges[i].chardata_for_range[j]; int advance, lsb, x0,y0,x1,y1; int codepoint = ranges[i].array_of_unicode_codepoints == NULL ? ranges[i].first_unicode_codepoint_in_range + j : ranges[i].array_of_unicode_codepoints[j]; int glyph = stbtt_FindGlyphIndex(info, codepoint); stbrp_coord pad = (stbrp_coord) spc->padding; // pad on left and top r->x += pad; r->y += pad; r->w -= pad; r->h -= pad; stbtt_GetGlyphHMetrics(info, glyph, &advance, &lsb); stbtt_GetGlyphBitmapBox(info, glyph, scale * spc->h_oversample, scale * spc->v_oversample, &x0,&y0,&x1,&y1); stbtt_MakeGlyphBitmapSubpixel(info, spc->pixels + r->x + r->y*spc->stride_in_bytes, r->w - spc->h_oversample+1, r->h - spc->v_oversample+1, spc->stride_in_bytes, scale * spc->h_oversample, scale * spc->v_oversample, 0,0, glyph); if (spc->h_oversample > 1) stbtt__h_prefilter(spc->pixels + r->x + r->y*spc->stride_in_bytes, r->w, r->h, spc->stride_in_bytes, spc->h_oversample); if (spc->v_oversample > 1) stbtt__v_prefilter(spc->pixels + r->x + r->y*spc->stride_in_bytes, r->w, r->h, spc->stride_in_bytes, spc->v_oversample); bc->x0 = (stbtt_int16) r->x; bc->y0 = (stbtt_int16) r->y; bc->x1 = (stbtt_int16) (r->x + r->w); bc->y1 = (stbtt_int16) (r->y + r->h); bc->xadvance = scale * advance; bc->xoff = (float) x0 * recip_h + sub_x; bc->yoff = (float) y0 * recip_v + sub_y; bc->xoff2 = (x0 + r->w) * recip_h + sub_x; bc->yoff2 = (y0 + r->h) * recip_v + sub_y; } else { return_value = 0; // if any fail, report failure } ++k; } } // restore original values spc->h_oversample = old_h_over; spc->v_oversample = old_v_over; return return_value; } STBTT_DEF void stbtt_PackFontRangesPackRects(stbtt_pack_context *spc, stbrp_rect *rects, int num_rects) { stbrp_pack_rects((stbrp_context *) spc->pack_info, rects, num_rects); } STBTT_DEF int stbtt_PackFontRanges(stbtt_pack_context *spc, const unsigned char *fontdata, int font_index, stbtt_pack_range *ranges, int num_ranges) { stbtt_fontinfo info; int i,j,n, return_value = 1; //stbrp_context *context = (stbrp_context *) spc->pack_info; stbrp_rect *rects; // flag all characters as NOT packed for (i=0; i < num_ranges; ++i) for (j=0; j < ranges[i].num_chars; ++j) ranges[i].chardata_for_range[j].x0 = ranges[i].chardata_for_range[j].y0 = ranges[i].chardata_for_range[j].x1 = ranges[i].chardata_for_range[j].y1 = 0; n = 0; for (i=0; i < num_ranges; ++i) n += ranges[i].num_chars; rects = (stbrp_rect *) STBTT_malloc(sizeof(*rects) * n, spc->user_allocator_context); if (rects == NULL) return 0; info.userdata = spc->user_allocator_context; stbtt_InitFont(&info, fontdata, stbtt_GetFontOffsetForIndex(fontdata,font_index)); n = stbtt_PackFontRangesGatherRects(spc, &info, ranges, num_ranges, rects); stbtt_PackFontRangesPackRects(spc, rects, n); return_value = stbtt_PackFontRangesRenderIntoRects(spc, &info, ranges, num_ranges, rects); STBTT_free(rects, spc->user_allocator_context); return return_value; } STBTT_DEF int stbtt_PackFontRange(stbtt_pack_context *spc, const unsigned char *fontdata, int font_index, float font_size, int first_unicode_codepoint_in_range, int num_chars_in_range, stbtt_packedchar *chardata_for_range) { stbtt_pack_range range; range.first_unicode_codepoint_in_range = first_unicode_codepoint_in_range; range.array_of_unicode_codepoints = NULL; range.num_chars = num_chars_in_range; range.chardata_for_range = chardata_for_range; range.font_size = font_size; return stbtt_PackFontRanges(spc, fontdata, font_index, &range, 1); } STBTT_DEF void stbtt_GetPackedQuad(const stbtt_packedchar *chardata, int pw, int ph, int char_index, float *xpos, float *ypos, stbtt_aligned_quad *q, int align_to_integer) { float ipw = 1.0f / pw, iph = 1.0f / ph; const stbtt_packedchar *b = chardata + char_index; if (align_to_integer) { float x = (float) STBTT_ifloor((*xpos + b->xoff) + 0.5f); float y = (float) STBTT_ifloor((*ypos + b->yoff) + 0.5f); q->x0 = x; q->y0 = y; q->x1 = x + b->xoff2 - b->xoff; q->y1 = y + b->yoff2 - b->yoff; } else { q->x0 = *xpos + b->xoff; q->y0 = *ypos + b->yoff; q->x1 = *xpos + b->xoff2; q->y1 = *ypos + b->yoff2; } q->s0 = b->x0 * ipw; q->t0 = b->y0 * iph; q->s1 = b->x1 * ipw; q->t1 = b->y1 * iph; *xpos += b->xadvance; } ////////////////////////////////////////////////////////////////////////////// // // sdf computation // #define STBTT_min(a,b) ((a) < (b) ? (a) : (b)) #define STBTT_max(a,b) ((a) < (b) ? (b) : (a)) static int stbtt__ray_intersect_bezier(float orig[2], float ray[2], float q0[2], float q1[2], float q2[2], float hits[2][2]) { float q0perp = q0[1]*ray[0] - q0[0]*ray[1]; float q1perp = q1[1]*ray[0] - q1[0]*ray[1]; float q2perp = q2[1]*ray[0] - q2[0]*ray[1]; float roperp = orig[1]*ray[0] - orig[0]*ray[1]; float a = q0perp - 2*q1perp + q2perp; float b = q1perp - q0perp; float c = q0perp - roperp; float s0 = 0., s1 = 0.; int num_s = 0; if (a != 0.0) { float discr = b*b - a*c; if (discr > 0.0) { float rcpna = -1 / a; float d = (float) sqrt(discr); s0 = (b+d) * rcpna; s1 = (b-d) * rcpna; if (s0 >= 0.0 && s0 <= 1.0) num_s = 1; if (d > 0.0 && s1 >= 0.0 && s1 <= 1.0) { if (num_s == 0) s0 = s1; ++num_s; } } } else { // 2*b*s + c = 0 // s = -c / (2*b) s0 = c / (-2 * b); if (s0 >= 0.0 && s0 <= 1.0) num_s = 1; } if (num_s == 0) return 0; else { float rcp_len2 = 1 / (ray[0]*ray[0] + ray[1]*ray[1]); float rayn_x = ray[0] * rcp_len2, rayn_y = ray[1] * rcp_len2; float q0d = q0[0]*rayn_x + q0[1]*rayn_y; float q1d = q1[0]*rayn_x + q1[1]*rayn_y; float q2d = q2[0]*rayn_x + q2[1]*rayn_y; float rod = orig[0]*rayn_x + orig[1]*rayn_y; float q10d = q1d - q0d; float q20d = q2d - q0d; float q0rd = q0d - rod; hits[0][0] = q0rd + s0*(2.0f - 2.0f*s0)*q10d + s0*s0*q20d; hits[0][1] = a*s0+b; if (num_s > 1) { hits[1][0] = q0rd + s1*(2.0f - 2.0f*s1)*q10d + s1*s1*q20d; hits[1][1] = a*s1+b; return 2; } else { return 1; } } } static int equal(float *a, float *b) { return (a[0] == b[0] && a[1] == b[1]); } static int stbtt__compute_crossings_x(float x, float y, int nverts, stbtt_vertex *verts) { int i; float orig[2], ray[2] = { 1, 0 }; float y_frac; int winding = 0; orig[0] = x; orig[1] = y; // make sure y never passes through a vertex of the shape y_frac = (float) fmod(y, 1.0f); if (y_frac < 0.01f) y += 0.01f; else if (y_frac > 0.99f) y -= 0.01f; orig[1] = y; // test a ray from (-infinity,y) to (x,y) for (i=0; i < nverts; ++i) { if (verts[i].type == STBTT_vline) { int x0 = (int) verts[i-1].x, y0 = (int) verts[i-1].y; int x1 = (int) verts[i ].x, y1 = (int) verts[i ].y; if (y > STBTT_min(y0,y1) && y < STBTT_max(y0,y1) && x > STBTT_min(x0,x1)) { float x_inter = (y - y0) / (y1 - y0) * (x1-x0) + x0; if (x_inter < x) winding += (y0 < y1) ? 1 : -1; } } if (verts[i].type == STBTT_vcurve) { int x0 = (int) verts[i-1].x , y0 = (int) verts[i-1].y ; int x1 = (int) verts[i ].cx, y1 = (int) verts[i ].cy; int x2 = (int) verts[i ].x , y2 = (int) verts[i ].y ; int ax = STBTT_min(x0,STBTT_min(x1,x2)), ay = STBTT_min(y0,STBTT_min(y1,y2)); int by = STBTT_max(y0,STBTT_max(y1,y2)); if (y > ay && y < by && x > ax) { float q0[2],q1[2],q2[2]; float hits[2][2]; q0[0] = (float)x0; q0[1] = (float)y0; q1[0] = (float)x1; q1[1] = (float)y1; q2[0] = (float)x2; q2[1] = (float)y2; if (equal(q0,q1) || equal(q1,q2)) { x0 = (int)verts[i-1].x; y0 = (int)verts[i-1].y; x1 = (int)verts[i ].x; y1 = (int)verts[i ].y; if (y > STBTT_min(y0,y1) && y < STBTT_max(y0,y1) && x > STBTT_min(x0,x1)) { float x_inter = (y - y0) / (y1 - y0) * (x1-x0) + x0; if (x_inter < x) winding += (y0 < y1) ? 1 : -1; } } else { int num_hits = stbtt__ray_intersect_bezier(orig, ray, q0, q1, q2, hits); if (num_hits >= 1) if (hits[0][0] < 0) winding += (hits[0][1] < 0 ? -1 : 1); if (num_hits >= 2) if (hits[1][0] < 0) winding += (hits[1][1] < 0 ? -1 : 1); } } } } return winding; } static float stbtt__cuberoot( float x ) { if (x<0) return -(float) STBTT_pow(-x,1.0f/3.0f); else return (float) STBTT_pow( x,1.0f/3.0f); } // x^3 + c*x^2 + b*x + a = 0 static int stbtt__solve_cubic(float a, float b, float c, float* r) { float s = -a / 3; float p = b - a*a / 3; float q = a * (2*a*a - 9*b) / 27 + c; float p3 = p*p*p; float d = q*q + 4*p3 / 27; if (d >= 0) { float z = (float) STBTT_sqrt(d); float u = (-q + z) / 2; float v = (-q - z) / 2; u = stbtt__cuberoot(u); v = stbtt__cuberoot(v); r[0] = s + u + v; return 1; } else { float u = (float) STBTT_sqrt(-p/3); float v = (float) STBTT_acos(-STBTT_sqrt(-27/p3) * q / 2) / 3; // p3 must be negative, since d is negative float m = (float) STBTT_cos(v); float n = (float) STBTT_cos(v-3.141592/2)*1.732050808f; r[0] = s + u * 2 * m; r[1] = s - u * (m + n); r[2] = s - u * (m - n); //STBTT_assert( STBTT_fabs(((r[0]+a)*r[0]+b)*r[0]+c) < 0.05f); // these asserts may not be safe at all scales, though they're in bezier t parameter units so maybe? //STBTT_assert( STBTT_fabs(((r[1]+a)*r[1]+b)*r[1]+c) < 0.05f); //STBTT_assert( STBTT_fabs(((r[2]+a)*r[2]+b)*r[2]+c) < 0.05f); return 3; } } STBTT_DEF unsigned char * stbtt_GetGlyphSDF(const stbtt_fontinfo *info, float scale, int glyph, int padding, unsigned char onedge_value, float pixel_dist_scale, int *width, int *height, int *xoff, int *yoff) { float scale_x = scale, scale_y = scale; int ix0,iy0,ix1,iy1; int w,h; unsigned char *data; // if one scale is 0, use same scale for both if (scale_x == 0) scale_x = scale_y; if (scale_y == 0) { if (scale_x == 0) return NULL; // if both scales are 0, return NULL scale_y = scale_x; } stbtt_GetGlyphBitmapBoxSubpixel(info, glyph, scale, scale, 0.0f,0.0f, &ix0,&iy0,&ix1,&iy1); // if empty, return NULL if (ix0 == ix1 || iy0 == iy1) return NULL; ix0 -= padding; iy0 -= padding; ix1 += padding; iy1 += padding; w = (ix1 - ix0); h = (iy1 - iy0); if (width ) *width = w; if (height) *height = h; if (xoff ) *xoff = ix0; if (yoff ) *yoff = iy0; // invert for y-downwards bitmaps scale_y = -scale_y; { int x,y,i,j; float *precompute; stbtt_vertex *verts; int num_verts = stbtt_GetGlyphShape(info, glyph, &verts); data = (unsigned char *) STBTT_malloc(w * h, info->userdata); precompute = (float *) STBTT_malloc(num_verts * sizeof(float), info->userdata); for (i=0,j=num_verts-1; i < num_verts; j=i++) { if (verts[i].type == STBTT_vline) { float x0 = verts[i].x*scale_x, y0 = verts[i].y*scale_y; float x1 = verts[j].x*scale_x, y1 = verts[j].y*scale_y; float dist = (float) STBTT_sqrt((x1-x0)*(x1-x0) + (y1-y0)*(y1-y0)); precompute[i] = (dist == 0) ? 0.0f : 1.0f / dist; } else if (verts[i].type == STBTT_vcurve) { float x2 = verts[j].x *scale_x, y2 = verts[j].y *scale_y; float x1 = verts[i].cx*scale_x, y1 = verts[i].cy*scale_y; float x0 = verts[i].x *scale_x, y0 = verts[i].y *scale_y; float bx = x0 - 2*x1 + x2, by = y0 - 2*y1 + y2; float len2 = bx*bx + by*by; if (len2 != 0.0f) precompute[i] = 1.0f / (bx*bx + by*by); else precompute[i] = 0.0f; } else precompute[i] = 0.0f; } for (y=iy0; y < iy1; ++y) { for (x=ix0; x < ix1; ++x) { float val; float min_dist = 999999.0f; float sx = (float) x + 0.5f; float sy = (float) y + 0.5f; float x_gspace = (sx / scale_x); float y_gspace = (sy / scale_y); int winding = stbtt__compute_crossings_x(x_gspace, y_gspace, num_verts, verts); // @OPTIMIZE: this could just be a rasterization, but needs to be line vs. non-tesselated curves so a new path for (i=0; i < num_verts; ++i) { float x0 = verts[i].x*scale_x, y0 = verts[i].y*scale_y; // check against every point here rather than inside line/curve primitives -- @TODO: wrong if multiple 'moves' in a row produce a garbage point, and given culling, probably more efficient to do within line/curve float dist2 = (x0-sx)*(x0-sx) + (y0-sy)*(y0-sy); if (dist2 < min_dist*min_dist) min_dist = (float) STBTT_sqrt(dist2); if (verts[i].type == STBTT_vline) { float x1 = verts[i-1].x*scale_x, y1 = verts[i-1].y*scale_y; // coarse culling against bbox //if (sx > STBTT_min(x0,x1)-min_dist && sx < STBTT_max(x0,x1)+min_dist && // sy > STBTT_min(y0,y1)-min_dist && sy < STBTT_max(y0,y1)+min_dist) float dist = (float) STBTT_fabs((x1-x0)*(y0-sy) - (y1-y0)*(x0-sx)) * precompute[i]; STBTT_assert(i != 0); if (dist < min_dist) { // check position along line // x' = x0 + t*(x1-x0), y' = y0 + t*(y1-y0) // minimize (x'-sx)*(x'-sx)+(y'-sy)*(y'-sy) float dx = x1-x0, dy = y1-y0; float px = x0-sx, py = y0-sy; // minimize (px+t*dx)^2 + (py+t*dy)^2 = px*px + 2*px*dx*t + t^2*dx*dx + py*py + 2*py*dy*t + t^2*dy*dy // derivative: 2*px*dx + 2*py*dy + (2*dx*dx+2*dy*dy)*t, set to 0 and solve float t = -(px*dx + py*dy) / (dx*dx + dy*dy); if (t >= 0.0f && t <= 1.0f) min_dist = dist; } } else if (verts[i].type == STBTT_vcurve) { float x2 = verts[i-1].x *scale_x, y2 = verts[i-1].y *scale_y; float x1 = verts[i ].cx*scale_x, y1 = verts[i ].cy*scale_y; float box_x0 = STBTT_min(STBTT_min(x0,x1),x2); float box_y0 = STBTT_min(STBTT_min(y0,y1),y2); float box_x1 = STBTT_max(STBTT_max(x0,x1),x2); float box_y1 = STBTT_max(STBTT_max(y0,y1),y2); // coarse culling against bbox to avoid computing cubic unnecessarily if (sx > box_x0-min_dist && sx < box_x1+min_dist && sy > box_y0-min_dist && sy < box_y1+min_dist) { int num=0; float ax = x1-x0, ay = y1-y0; float bx = x0 - 2*x1 + x2, by = y0 - 2*y1 + y2; float mx = x0 - sx, my = y0 - sy; float res[3],px,py,t,it; float a_inv = precompute[i]; if (a_inv == 0.0) { // if a_inv is 0, it's 2nd degree so use quadratic formula float a = 3*(ax*bx + ay*by); float b = 2*(ax*ax + ay*ay) + (mx*bx+my*by); float c = mx*ax+my*ay; if (a == 0.0) { // if a is 0, it's linear if (b != 0.0) { res[num++] = -c/b; } } else { float discriminant = b*b - 4*a*c; if (discriminant < 0) num = 0; else { float root = (float) STBTT_sqrt(discriminant); res[0] = (-b - root)/(2*a); res[1] = (-b + root)/(2*a); num = 2; // don't bother distinguishing 1-solution case, as code below will still work } } } else { float b = 3*(ax*bx + ay*by) * a_inv; // could precompute this as it doesn't depend on sample point float c = (2*(ax*ax + ay*ay) + (mx*bx+my*by)) * a_inv; float d = (mx*ax+my*ay) * a_inv; num = stbtt__solve_cubic(b, c, d, res); } if (num >= 1 && res[0] >= 0.0f && res[0] <= 1.0f) { t = res[0], it = 1.0f - t; px = it*it*x0 + 2*t*it*x1 + t*t*x2; py = it*it*y0 + 2*t*it*y1 + t*t*y2; dist2 = (px-sx)*(px-sx) + (py-sy)*(py-sy); if (dist2 < min_dist * min_dist) min_dist = (float) STBTT_sqrt(dist2); } if (num >= 2 && res[1] >= 0.0f && res[1] <= 1.0f) { t = res[1], it = 1.0f - t; px = it*it*x0 + 2*t*it*x1 + t*t*x2; py = it*it*y0 + 2*t*it*y1 + t*t*y2; dist2 = (px-sx)*(px-sx) + (py-sy)*(py-sy); if (dist2 < min_dist * min_dist) min_dist = (float) STBTT_sqrt(dist2); } if (num >= 3 && res[2] >= 0.0f && res[2] <= 1.0f) { t = res[2], it = 1.0f - t; px = it*it*x0 + 2*t*it*x1 + t*t*x2; py = it*it*y0 + 2*t*it*y1 + t*t*y2; dist2 = (px-sx)*(px-sx) + (py-sy)*(py-sy); if (dist2 < min_dist * min_dist) min_dist = (float) STBTT_sqrt(dist2); } } } } if (winding == 0) min_dist = -min_dist; // if outside the shape, value is negative val = onedge_value + pixel_dist_scale * min_dist; if (val < 0) val = 0; else if (val > 255) val = 255; data[(y-iy0)*w+(x-ix0)] = (unsigned char) val; } } STBTT_free(precompute, info->userdata); STBTT_free(verts, info->userdata); } return data; } STBTT_DEF unsigned char * stbtt_GetCodepointSDF(const stbtt_fontinfo *info, float scale, int codepoint, int padding, unsigned char onedge_value, float pixel_dist_scale, int *width, int *height, int *xoff, int *yoff) { return stbtt_GetGlyphSDF(info, scale, stbtt_FindGlyphIndex(info, codepoint), padding, onedge_value, pixel_dist_scale, width, height, xoff, yoff); } STBTT_DEF void stbtt_FreeSDF(unsigned char *bitmap, void *userdata) { STBTT_free(bitmap, userdata); } ////////////////////////////////////////////////////////////////////////////// // // font name matching -- recommended not to use this // // check if a utf8 string contains a prefix which is the utf16 string; if so return length of matching utf8 string static stbtt_int32 stbtt__CompareUTF8toUTF16_bigendian_prefix(stbtt_uint8 *s1, stbtt_int32 len1, stbtt_uint8 *s2, stbtt_int32 len2) { stbtt_int32 i=0; // convert utf16 to utf8 and compare the results while converting while (len2) { stbtt_uint16 ch = s2[0]*256 + s2[1]; if (ch < 0x80) { if (i >= len1) return -1; if (s1[i++] != ch) return -1; } else if (ch < 0x800) { if (i+1 >= len1) return -1; if (s1[i++] != 0xc0 + (ch >> 6)) return -1; if (s1[i++] != 0x80 + (ch & 0x3f)) return -1; } else if (ch >= 0xd800 && ch < 0xdc00) { stbtt_uint32 c; stbtt_uint16 ch2 = s2[2]*256 + s2[3]; if (i+3 >= len1) return -1; c = ((ch - 0xd800) << 10) + (ch2 - 0xdc00) + 0x10000; if (s1[i++] != 0xf0 + (c >> 18)) return -1; if (s1[i++] != 0x80 + ((c >> 12) & 0x3f)) return -1; if (s1[i++] != 0x80 + ((c >> 6) & 0x3f)) return -1; if (s1[i++] != 0x80 + ((c ) & 0x3f)) return -1; s2 += 2; // plus another 2 below len2 -= 2; } else if (ch >= 0xdc00 && ch < 0xe000) { return -1; } else { if (i+2 >= len1) return -1; if (s1[i++] != 0xe0 + (ch >> 12)) return -1; if (s1[i++] != 0x80 + ((ch >> 6) & 0x3f)) return -1; if (s1[i++] != 0x80 + ((ch ) & 0x3f)) return -1; } s2 += 2; len2 -= 2; } return i; } static int stbtt_CompareUTF8toUTF16_bigendian_internal(char *s1, int len1, char *s2, int len2) { return len1 == stbtt__CompareUTF8toUTF16_bigendian_prefix((stbtt_uint8*) s1, len1, (stbtt_uint8*) s2, len2); } // returns results in whatever encoding you request... but note that 2-byte encodings // will be BIG-ENDIAN... use stbtt_CompareUTF8toUTF16_bigendian() to compare STBTT_DEF const char *stbtt_GetFontNameString(const stbtt_fontinfo *font, int *length, int platformID, int encodingID, int languageID, int nameID) { stbtt_int32 i,count,stringOffset; stbtt_uint8 *fc = font->data; stbtt_uint32 offset = font->fontstart; stbtt_uint32 nm = stbtt__find_table(fc, offset, "name"); if (!nm) return NULL; count = ttUSHORT(fc+nm+2); stringOffset = nm + ttUSHORT(fc+nm+4); for (i=0; i < count; ++i) { stbtt_uint32 loc = nm + 6 + 12 * i; if (platformID == ttUSHORT(fc+loc+0) && encodingID == ttUSHORT(fc+loc+2) && languageID == ttUSHORT(fc+loc+4) && nameID == ttUSHORT(fc+loc+6)) { *length = ttUSHORT(fc+loc+8); return (const char *) (fc+stringOffset+ttUSHORT(fc+loc+10)); } } return NULL; } static int stbtt__matchpair(stbtt_uint8 *fc, stbtt_uint32 nm, stbtt_uint8 *name, stbtt_int32 nlen, stbtt_int32 target_id, stbtt_int32 next_id) { stbtt_int32 i; stbtt_int32 count = ttUSHORT(fc+nm+2); stbtt_int32 stringOffset = nm + ttUSHORT(fc+nm+4); for (i=0; i < count; ++i) { stbtt_uint32 loc = nm + 6 + 12 * i; stbtt_int32 id = ttUSHORT(fc+loc+6); if (id == target_id) { // find the encoding stbtt_int32 platform = ttUSHORT(fc+loc+0), encoding = ttUSHORT(fc+loc+2), language = ttUSHORT(fc+loc+4); // is this a Unicode encoding? if (platform == 0 || (platform == 3 && encoding == 1) || (platform == 3 && encoding == 10)) { stbtt_int32 slen = ttUSHORT(fc+loc+8); stbtt_int32 off = ttUSHORT(fc+loc+10); // check if there's a prefix match stbtt_int32 matchlen = stbtt__CompareUTF8toUTF16_bigendian_prefix(name, nlen, fc+stringOffset+off,slen); if (matchlen >= 0) { // check for target_id+1 immediately following, with same encoding & language if (i+1 < count && ttUSHORT(fc+loc+12+6) == next_id && ttUSHORT(fc+loc+12) == platform && ttUSHORT(fc+loc+12+2) == encoding && ttUSHORT(fc+loc+12+4) == language) { slen = ttUSHORT(fc+loc+12+8); off = ttUSHORT(fc+loc+12+10); if (slen == 0) { if (matchlen == nlen) return 1; } else if (matchlen < nlen && name[matchlen] == ' ') { ++matchlen; if (stbtt_CompareUTF8toUTF16_bigendian_internal((char*) (name+matchlen), nlen-matchlen, (char*)(fc+stringOffset+off),slen)) return 1; } } else { // if nothing immediately following if (matchlen == nlen) return 1; } } } // @TODO handle other encodings } } return 0; } static int stbtt__matches(stbtt_uint8 *fc, stbtt_uint32 offset, stbtt_uint8 *name, stbtt_int32 flags) { stbtt_int32 nlen = (stbtt_int32) STBTT_strlen((char *) name); stbtt_uint32 nm,hd; if (!stbtt__isfont(fc+offset)) return 0; // check italics/bold/underline flags in macStyle... if (flags) { hd = stbtt__find_table(fc, offset, "head"); if ((ttUSHORT(fc+hd+44) & 7) != (flags & 7)) return 0; } nm = stbtt__find_table(fc, offset, "name"); if (!nm) return 0; if (flags) { // if we checked the macStyle flags, then just check the family and ignore the subfamily if (stbtt__matchpair(fc, nm, name, nlen, 16, -1)) return 1; if (stbtt__matchpair(fc, nm, name, nlen, 1, -1)) return 1; if (stbtt__matchpair(fc, nm, name, nlen, 3, -1)) return 1; } else { if (stbtt__matchpair(fc, nm, name, nlen, 16, 17)) return 1; if (stbtt__matchpair(fc, nm, name, nlen, 1, 2)) return 1; if (stbtt__matchpair(fc, nm, name, nlen, 3, -1)) return 1; } return 0; } static int stbtt_FindMatchingFont_internal(unsigned char *font_collection, char *name_utf8, stbtt_int32 flags) { stbtt_int32 i; for (i=0;;++i) { stbtt_int32 off = stbtt_GetFontOffsetForIndex(font_collection, i); if (off < 0) return off; if (stbtt__matches((stbtt_uint8 *) font_collection, off, (stbtt_uint8*) name_utf8, flags)) return off; } } #if defined(__GNUC__) || defined(__clang__) #pragma GCC diagnostic push #pragma GCC diagnostic ignored "-Wcast-qual" #endif STBTT_DEF int stbtt_BakeFontBitmap(const unsigned char *data, int offset, float pixel_height, unsigned char *pixels, int pw, int ph, int first_char, int num_chars, stbtt_bakedchar *chardata) { return stbtt_BakeFontBitmap_internal((unsigned char *) data, offset, pixel_height, pixels, pw, ph, first_char, num_chars, chardata); } STBTT_DEF int stbtt_GetFontOffsetForIndex(const unsigned char *data, int index) { return stbtt_GetFontOffsetForIndex_internal((unsigned char *) data, index); } STBTT_DEF int stbtt_GetNumberOfFonts(const unsigned char *data) { return stbtt_GetNumberOfFonts_internal((unsigned char *) data); } STBTT_DEF int stbtt_InitFont(stbtt_fontinfo *info, const unsigned char *data, int offset) { return stbtt_InitFont_internal(info, (unsigned char *) data, offset); } STBTT_DEF int stbtt_FindMatchingFont(const unsigned char *fontdata, const char *name, int flags) { return stbtt_FindMatchingFont_internal((unsigned char *) fontdata, (char *) name, flags); } STBTT_DEF int stbtt_CompareUTF8toUTF16_bigendian(const char *s1, int len1, const char *s2, int len2) { return stbtt_CompareUTF8toUTF16_bigendian_internal((char *) s1, len1, (char *) s2, len2); } #if defined(__GNUC__) || defined(__clang__) #pragma GCC diagnostic pop #endif #endif // STB_TRUETYPE_IMPLEMENTATION // FULL VERSION HISTORY // // 1.16 (2017-07-12) SDF support // 1.15 (2017-03-03) make more arguments const // 1.14 (2017-01-16) num-fonts-in-TTC function // 1.13 (2017-01-02) support OpenType fonts, certain Apple fonts // 1.12 (2016-10-25) suppress warnings about casting away const with -Wcast-qual // 1.11 (2016-04-02) fix unused-variable warning // 1.10 (2016-04-02) allow user-defined fabs() replacement // fix memory leak if fontsize=0.0 // fix warning from duplicate typedef // 1.09 (2016-01-16) warning fix; avoid crash on outofmem; use alloc userdata for PackFontRanges // 1.08 (2015-09-13) document stbtt_Rasterize(); fixes for vertical & horizontal edges // 1.07 (2015-08-01) allow PackFontRanges to accept arrays of sparse codepoints; // allow PackFontRanges to pack and render in separate phases; // fix stbtt_GetFontOFfsetForIndex (never worked for non-0 input?); // fixed an assert() bug in the new rasterizer // replace assert() with STBTT_assert() in new rasterizer // 1.06 (2015-07-14) performance improvements (~35% faster on x86 and x64 on test machine) // also more precise AA rasterizer, except if shapes overlap // remove need for STBTT_sort // 1.05 (2015-04-15) fix misplaced definitions for STBTT_STATIC // 1.04 (2015-04-15) typo in example // 1.03 (2015-04-12) STBTT_STATIC, fix memory leak in new packing, various fixes // 1.02 (2014-12-10) fix various warnings & compile issues w/ stb_rect_pack, C++ // 1.01 (2014-12-08) fix subpixel position when oversampling to exactly match // non-oversampled; STBTT_POINT_SIZE for packed case only // 1.00 (2014-12-06) add new PackBegin etc. API, w/ support for oversampling // 0.99 (2014-09-18) fix multiple bugs with subpixel rendering (ryg) // 0.9 (2014-08-07) support certain mac/iOS fonts without an MS platformID // 0.8b (2014-07-07) fix a warning // 0.8 (2014-05-25) fix a few more warnings // 0.7 (2013-09-25) bugfix: subpixel glyph bug fixed in 0.5 had come back // 0.6c (2012-07-24) improve documentation // 0.6b (2012-07-20) fix a few more warnings // 0.6 (2012-07-17) fix warnings; added stbtt_ScaleForMappingEmToPixels, // stbtt_GetFontBoundingBox, stbtt_IsGlyphEmpty // 0.5 (2011-12-09) bugfixes: // subpixel glyph renderer computed wrong bounding box // first vertex of shape can be off-curve (FreeSans) // 0.4b (2011-12-03) fixed an error in the font baking example // 0.4 (2011-12-01) kerning, subpixel rendering (tor) // bugfixes for: // codepoint-to-glyph conversion using table fmt=12 // codepoint-to-glyph conversion using table fmt=4 // stbtt_GetBakedQuad with non-square texture (Zer) // updated Hello World! sample to use kerning and subpixel // fixed some warnings // 0.3 (2009-06-24) cmap fmt=12, compound shapes (MM) // userdata, malloc-from-userdata, non-zero fill (stb) // 0.2 (2009-03-11) Fix unsigned/signed char warnings // 0.1 (2009-03-09) First public release // /* ------------------------------------------------------------------------------ This software is available under 2 licenses -- choose whichever you prefer. ------------------------------------------------------------------------------ ALTERNATIVE A - MIT License Copyright (c) 2017 Sean Barrett 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. ------------------------------------------------------------------------------ ALTERNATIVE B - Public Domain (www.unlicense.org) This is free and unencumbered software released into the public domain. Anyone is free to copy, modify, publish, use, compile, sell, or distribute this software, either in source code form or as a compiled binary, for any purpose, commercial or non-commercial, and by any means. In jurisdictions that recognize copyright laws, the author or authors of this software dedicate any and all copyright interest in the software to the public domain. We make this dedication for the benefit of the public at large and to the detriment of our heirs and successors. We intend this dedication to be an overt act of relinquishment in perpetuity of all present and future rights to this software under copyright law. 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 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. ------------------------------------------------------------------------------ */ uTox/third_party/stb/stb/stb_tilemap_editor.h0000600000175000001440000043567314003056224020452 0ustar rakusers// stb_tilemap_editor.h - v0.38 - Sean Barrett - http://nothings.org/stb // placed in the public domain - not copyrighted - first released 2014-09 // // Embeddable tilemap editor for C/C++ // // // TABLE OF CONTENTS // FAQ // How to compile/use the library // Additional configuration macros // API documentation // Info on editing multiple levels // Revision history // Todo // Credits // License // // // FAQ // // Q: What counts as a tilemap for this library? // // A: An array of rectangles, where each rectangle contains a small // stack of images. // // Q: What are the limitations? // // A: Maps are limited to 4096x4096 in dimension. // Each map square can only contain a stack of at most 32 images. // A map can only use up to 32768 distinct image tiles. // // Q: How do I compile this? // // A: You need to #define several symbols before #including it, but only // in one file. This will cause all the function definitions to be // generated in that file. See the "HOW TO COMPILE" section. // // Q: What advantages does this have over a standalone editor? // // A: For one, you can integrate the editor into your game so you can // flip between editing and testing without even switching windows. // For another, you don't need an XML parser to get at the map data. // // Q: Can I live-edit my game maps? // // A: Not really, the editor keeps its own map representation. // // Q: How do I save and load maps? // // A: You have to do this yourself. The editor provides serialization // functions (get & set) for reading and writing the map it holds. // You can choose whatever format you want to store the map to on // disk; you just need to provide functions to convert. (For example, // I actually store the editor's map representation to disk basically // as-is; then I have a single function that converts from the editor // map representation to the game representation, which is used both // to go from editor-to-game and from loaded-map-to-game.) // // Q: I want to have tiles change appearance based on what's // adjacent, or other tile-display/substitution trickiness. // // A: You can do this when you convert from the editor's map // representation to the game representation, but there's // no way to show this live in the editor. // // Q: The editor appears to be put map location (0,0) at the top left? // I want to use a different coordinate system in my game (e.g. y // increasing upwards, or origin at the center). // // A: You can do this when you convert from the editor's map // representation to the game representation. (Don't forget to // translate link coordinates as well!) // // Q: The editor appears to put pixel (0,0) at the top left? I want // to use a different coordinate system in my game. // // A: The editor defines an "editor pixel coordinate system" with // (0,0) at the top left and requires you to display things in // that coordinate system. You can freely remap those coordinates // to anything you want on screen. // // Q: How do I scale the user interface? // // A: Since you do all the rendering, you can scale up all the rendering // calls that the library makes to you. If you do, (a) you need // to also scale up the mouse coordinates, and (b) you may want // to scale the map display back down so that you're only scaling // the UI and not everything. See the next question. // // Q: How do I scale the map display? // // A: Use stbte_set_spacing() to change the size that the map is displayed // at. Note that the "callbacks" to draw tiles are used for both drawing // the map and drawing the tile palette, so that callback may need to // draw at two different scales. You should choose the scales to match // You can tell them apart because the // tile palette gets NULL for the property pointer. // // Q: How does object editing work? // // A: One way to think of this is that in the editor, you're placing // spawners, not objects. Each spawner must be tile-aligned, because // it's only a tile editor. Each tile (stack of layers) gets // an associated set of properties, and it's up to you to // determine what properties should appear for a given tile, // based on e.g. the spawners that are in it. // // Q: How are properties themselves handled? // // A: All properties, regardless of UI behavior, are internally floats. // Each tile has an array of floats associated with it, which is // passed back to you when drawing the tiles so you can draw // objects appropriately modified by the properties. // // Q: What if I want to have two different objects/spawners in // one tile, both of which have their own properties? // // A: Make sure STBTE_MAX_PROPERTIES is large enough for the sum of // properties in both objects, and then you have to explicitly // map the property slot #s to the appropriate objects. They'll // still all appear in a single property panel; there's no way // to get multiple panels. // // Q: Can I do one-to-many linking? // // A: The library only supports one link per tile. However, you // can have multiple tiles all link to a single tile. So, you // can fake one-to-many linking by linking in the reverse // direction. // // Q: What if I have two objects in the same tile, and they each // need an independent link? Or I have two kinds of link associated // with a single object? // // A: There is no way to do this. (Unless you can reverse one link.) // // Q: How does cut & paste interact with object properties & links? // // A: Currently the library has no idea which properties or links // are associated with which layers of a tile. So currently, the // library will only copy properties & links if the layer panel // is set to allow all layers to be copied, OR if you set the // "props" in the layer panel to "always". Similarly, you can // set "props" to "none" so it will never copy. // // Q: What happens if the library gets a memory allocation failure // while I'm editing? Will I lose my work? // // A: The library allocates all editor memory when you create // the tilemap. It allocates a maximally-sized map and a // fixed-size undo buffer (and the fixed-size copy buffer // is static), and never allocates memory while it's running. // So it can't fail due to running out of memory. // // Q: What happens if the library crashes while I'm editing? Will // I lose my work? // // A: Yes. Save often. // // // HOW TO COMPILE // // This header file contains both the header file and the // implementation file in one. To create the implementation, // in one source file define a few symbols first and then // include this header: // // #define STB_TILEMAP_EDITOR_IMPLEMENTATION // // this triggers the implementation // // void STBTE_DRAW_RECT(int x0, int y0, int x1, int y1, uint color); // // this must draw a filled rectangle (exclusive on right/bottom) // // color = (r<<16)|(g<<8)|(b) // // void STBTE_DRAW_TILE(int x0, int y0, // unsigned short id, int highlight, float *data); // // this draws the tile image identified by 'id' in one of several // // highlight modes (see STBTE_drawmode_* in the header section); // // if 'data' is NULL, it's drawing the tile in the palette; if 'data' // // is not NULL, it's drawing a tile on the map, and that is the data // // associated with that map tile // // #include "stb_tilemap_editor.h" // // Optionally you can define the following functions before the include; // note these must be macros (but they can just call a function) so // this library can #ifdef to detect if you've defined them: // // #define STBTE_PROP_TYPE(int n, short *tiledata, float *params) ... // // Returns the type of the n'th property of a given tile, which // // controls how it is edited. Legal types are: // // 0 /* no editable property in this slot */ // // STBTE_PROP_int /* uses a slider to adjust value */ // // STBTE_PROP_float /* uses a weird multi-axis control */ // // STBTE_PROP_bool /* uses a checkbox to change value */ // // And you can bitwise-OR in the following flags: // // STBTE_PROP_disabled // // Note that all of these are stored as floats in the param array. // // The integer slider is limited in precision based on the space // // available on screen, so for wide-ranged integers you may want // // to use floats instead. // // // // Since the tiledata is passed to you, you can choose which property // // is bound to that slot based on that data. // // // // Changing the type of a parameter does not cause the underlying // // value to be clamped to the type min/max except when the tile is // // explicitly selected. // // #define STBTE_PROP_NAME(int n, short *tiledata, float *params) ... // // these return a string with the name for slot #n in the float // // property list for the tile. // // #define STBTE_PROP_MIN(int n, short *tiledata) ...your code here... // #define STBTE_PROP_MAX(int n, short *tiledata) ...your code here... // // These return the allowable range for the property values for // // the specified slot. It is never called for boolean types. // // #define STBTE_PROP_FLOAT_SCALE(int n, short *tiledata, float *params) // // This rescales the float control for a given property; by default // // left mouse drags add integers, right mouse drags adds fractions, // // but you can rescale this per-property. // // #define STBTE_FLOAT_CONTROL_GRANULARITY ... value ... // // This returns the number of pixels of mouse motion necessary // // to advance the object float control. Default is 4 // // #define STBTE_ALLOW_LINK(short *src, float *src_data, \ // short *dest, float *dest_data) ...your code... // // this returns true or false depending on whether you allow a link // // to be drawn from a tile 'src' to a tile 'dest'. if you don't // // define this, linking will not be supported // // #define STBTE_LINK_COLOR(short *src, float *src_data, \ // short *dest, float *dest_data) ...your code... // // return a color encoded as a 24-bit unsigned integer in the // // form 0xRRGGBB. If you don't define this, default colors will // // be used. // // // [[ support for those below is not implemented yet ]] // // #define STBTE_HITTEST_TILE(x0,y0,id,mx,my) ...your code here... // // this returns true or false depending on whether the mouse // // pointer at mx,my is over (touching) a tile of type 'id' // // displayed at x0,y0. Normally stb_tilemap_editor just does // // this hittest based on the tile geometry, but if you have // // tiles whose images extend out of the tile, you'll need this. // // ADDITIONAL CONFIGURATION // // The following symbols set static limits which determine how much // memory will be allocated for the editor. You can override them // by making similiar definitions, but memory usage will increase. // // #define STBTE_MAX_TILEMAP_X 200 // max 4096 // #define STBTE_MAX_TILEMAP_Y 200 // max 4096 // #define STBTE_MAX_LAYERS 8 // max 32 // #define STBTE_MAX_CATEGORIES 100 // #define STBTE_UNDO_BUFFER_BYTES (1 << 24) // 16 MB // #define STBTE_MAX_COPY 90000 // e.g. 300x300 // #define STBTE_MAX_PROPERTIES 10 // max properties per tile // // API // // Further documentation appears in the header-file section below. // // EDITING MULTIPLE LEVELS // // You can only have one active editor instance. To switch between multiple // levels, you can either store the levels in your own format and copy them // in and out of the editor format, or you can create multiple stbte_tilemap // objects and switch between them. The latter has the advantage that each // stbte_tilemap keeps its own undo state. (The clipboard is global, so // either approach allows cut&pasting between levels.) // // REVISION HISTORY // 0.38 fix warning // 0.37 fix warning // 0.36 minor compiler support // 0.35 layername button changes // - layername buttons grow with the layer panel // - fix stbte_create_map being declared as stbte_create // - fix declaration of stbte_create_map // 0.30 properties release // - properties panel for editing user-defined "object" properties // - can link each tile to one other tile // - keyboard interface // - fix eraser tool bug (worked in complex cases, failed in simple) // - undo/redo tools have visible disabled state // - tiles on higher layers draw on top of adjacent lower-layer tiles // 0.20 erasable release // - eraser tool // - fix bug when pasting into protected layer // - better color scheme // - internal-use color picker // 0.10 initial release // // TODO // // Separate scroll state for each category // Implement paint bucket // Support STBTE_HITTEST_TILE above // ?Cancel drags by clicking other button? - may be fixed // Finish support for toolbar at side // // CREDITS // // // Main editor & features // Sean Barrett // Additional features: // Josh Huelsman // Bugfixes: // Ryan Whitworth // Eugene Opalev // // LICENSE // // See end of file for license information. /////////////////////////////////////////////////////////////////////// // // HEADER SECTION #ifndef STB_TILEMAP_INCLUDE_STB_TILEMAP_EDITOR_H #define STB_TILEMAP_INCLUDE_STB_TILEMAP_EDITOR_H #ifdef _WIN32 #ifndef _CRT_SECURE_NO_WARNINGS #define _CRT_SECURE_NO_WARNINGS #endif #include #include #endif typedef struct stbte_tilemap stbte_tilemap; // these are the drawmodes used in STBTE_DRAW_TILE enum { STBTE_drawmode_deemphasize = -1, STBTE_drawmode_normal = 0, STBTE_drawmode_emphasize = 1, }; // these are the property types #define STBTE_PROP_none 0 #define STBTE_PROP_int 1 #define STBTE_PROP_float 2 #define STBTE_PROP_bool 3 #define STBTE_PROP_disabled 4 //////// // // creation // extern stbte_tilemap *stbte_create_map(int map_x, int map_y, int map_layers, int spacing_x, int spacing_y, int max_tiles); // create an editable tilemap // map_x : dimensions of map horizontally (user can change this in editor), <= STBTE_MAX_TILEMAP_X // map_y : dimensions of map vertically (user can change this in editor) <= STBTE_MAX_TILEMAP_Y // map_layers : number of layers to use (fixed), <= STBTE_MAX_LAYERS // spacing_x : initial horizontal distance between left edges of map tiles in stb_tilemap_editor pixels // spacing_y : initial vertical distance between top edges of map tiles in stb_tilemap_editor pixels // max_tiles : maximum number of tiles that can defined // // If insufficient memory, returns NULL extern void stbte_define_tile(stbte_tilemap *tm, unsigned short id, unsigned int layermask, const char * category); // call this repeatedly for each tile to install the tile definitions into the editable tilemap // tm : tilemap created by stbte_create_map // id : unique identifier for each tile, 0 <= id < 32768 // layermask : bitmask of which layers tile is allowed on: 1 = layer 0, 255 = layers 0..7 // (note that onscreen, the editor numbers the layers from 1 not 0) // layer 0 is the furthest back, layer 1 is just in front of layer 0, etc // category : which category this tile is grouped in extern void stbte_set_display(int x0, int y0, int x1, int y1); // call this once to set the size; if you resize, call it again ///////// // // every frame // extern void stbte_draw(stbte_tilemap *tm); extern void stbte_tick(stbte_tilemap *tm, float time_in_seconds_since_last_frame); //////////// // // user input // // if you're using SDL, call the next function for SDL_MOUSEMOVE, SDL_MOUSEBUTTON, SDL_MOUSEWHEEL; // the transformation lets you scale from SDL mouse coords to stb_tilemap_editor coords extern void stbte_mouse_sdl(stbte_tilemap *tm, const void *sdl_event, float xscale, float yscale, int xoffset, int yoffset); // otherwise, hook these up explicitly: extern void stbte_mouse_move(stbte_tilemap *tm, int x, int y, int shifted, int scrollkey); extern void stbte_mouse_button(stbte_tilemap *tm, int x, int y, int right, int down, int shifted, int scrollkey); extern void stbte_mouse_wheel(stbte_tilemap *tm, int x, int y, int vscroll); // for keyboard, define your own mapping from keys to the following actions. // this is totally optional, as all features are accessible with the mouse enum stbte_action { STBTE_tool_select, STBTE_tool_brush, STBTE_tool_erase, STBTE_tool_rectangle, STBTE_tool_eyedropper, STBTE_tool_link, STBTE_act_toggle_grid, STBTE_act_toggle_links, STBTE_act_undo, STBTE_act_redo, STBTE_act_cut, STBTE_act_copy, STBTE_act_paste, STBTE_scroll_left, STBTE_scroll_right, STBTE_scroll_up, STBTE_scroll_down, }; extern void stbte_action(stbte_tilemap *tm, enum stbte_action act); //////////////// // // save/load // // There is no editor file format. You have to save and load the data yourself // through the following functions. You can also use these functions to get the // data to generate game-formatted levels directly. (But make sure you save // first! You may also want to autosave to a temp file periodically, etc etc.) #define STBTE_EMPTY -1 extern void stbte_get_dimensions(stbte_tilemap *tm, int *max_x, int *max_y); // get the dimensions of the level, since the user can change them extern short* stbte_get_tile(stbte_tilemap *tm, int x, int y); // returns an array of shorts that is 'map_layers' in length. each short is // either one of the tile_id values from define_tile, or STBTE_EMPTY. extern float *stbte_get_properties(stbte_tilemap *tm, int x, int y); // get the property array associated with the tile at x,y. this is an // array of floats that is STBTE_MAX_PROPERTIES in length; you have to // interpret the slots according to the semantics you've chosen extern void stbte_get_link(stbte_tilemap *tm, int x, int y, int *destx, int *desty); // gets the link associated with the tile at x,y. extern void stbte_set_dimensions(stbte_tilemap *tm, int max_x, int max_y); // set the dimensions of the level, overrides previous stbte_create_map() // values or anything the user has changed extern void stbte_clear_map(stbte_tilemap *tm); // clears the map, including the region outside the defined region, so if the // user expands the map, they won't see garbage there extern void stbte_set_tile(stbte_tilemap *tm, int x, int y, int layer, signed short tile); // tile is your tile_id from define_tile, or STBTE_EMPTY extern void stbte_set_property(stbte_tilemap *tm, int x, int y, int n, float val); // set the value of the n'th slot of the tile at x,y extern void stbte_set_link(stbte_tilemap *tm, int x, int y, int destx, int desty); // set a link going from x,y to destx,desty. to force no link, // use destx=desty=-1 //////// // // optional // extern void stbte_set_background_tile(stbte_tilemap *tm, short id); // selects the tile to fill the bottom layer with and used to clear bottom tiles to; // should be same ID as extern void stbte_set_sidewidths(int left, int right); // call this once to set the left & right side widths. don't call // it again since the user can change it extern void stbte_set_spacing(stbte_tilemap *tm, int spacing_x, int spacing_y, int palette_spacing_x, int palette_spacing_y); // call this to set the spacing of map tiles and the spacing of palette tiles. // if you rescale your display, call it again (e.g. you can implement map zooming yourself) extern void stbte_set_layername(stbte_tilemap *tm, int layer, const char *layername); // sets a string name for your layer that shows in the layer selector. note that this // makes the layer selector wider. 'layer' is from 0..(map_layers-1) #endif #ifdef STB_TILEMAP_EDITOR_IMPLEMENTATION #ifndef STBTE_ASSERT #define STBTE_ASSERT assert #include #endif #ifdef _MSC_VER #define STBTE__NOTUSED(v) (void)(v) #else #define STBTE__NOTUSED(v) (void)sizeof(v) #endif #ifndef STBTE_MAX_TILEMAP_X #define STBTE_MAX_TILEMAP_X 200 #endif #ifndef STBTE_MAX_TILEMAP_Y #define STBTE_MAX_TILEMAP_Y 200 #endif #ifndef STBTE_MAX_LAYERS #define STBTE_MAX_LAYERS 8 #endif #ifndef STBTE_MAX_CATEGORIES #define STBTE_MAX_CATEGORIES 100 #endif #ifndef STBTE_MAX_COPY #define STBTE_MAX_COPY 65536 #endif #ifndef STBTE_UNDO_BUFFER_BYTES #define STBTE_UNDO_BUFFER_BYTES (1 << 24) // 16 MB #endif #ifndef STBTE_PROP_TYPE #define STBTE__NO_PROPS #define STBTE_PROP_TYPE(n,td,tp) 0 #endif #ifndef STBTE_PROP_NAME #define STBTE_PROP_NAME(n,td,tp) "" #endif #ifndef STBTE_MAX_PROPERTIES #define STBTE_MAX_PROPERTIES 10 #endif #ifndef STBTE_PROP_MIN #define STBTE_PROP_MIN(n,td,tp) 0 #endif #ifndef STBTE_PROP_MAX #define STBTE_PROP_MAX(n,td,tp) 100.0 #endif #ifndef STBTE_PROP_FLOAT_SCALE #define STBTE_PROP_FLOAT_SCALE(n,td,tp) 1 // default scale size #endif #ifndef STBTE_FLOAT_CONTROL_GRANULARITY #define STBTE_FLOAT_CONTROL_GRANULARITY 4 #endif #define STBTE__UNDO_BUFFER_COUNT (STBTE_UNDO_BUFFER_BYTES>>1) #if STBTE_MAX_TILEMAP_X > 4096 || STBTE_MAX_TILEMAP_Y > 4096 #error "Maximum editable map size is 4096 x 4096" #endif #if STBTE_MAX_LAYERS > 32 #error "Maximum layers allowed is 32" #endif #if STBTE_UNDO_BUFFER_COUNT & (STBTE_UNDO_BUFFER_COUNT-1) #error "Undo buffer size must be a power of 2" #endif #if STBTE_MAX_PROPERTIES == 0 #define STBTE__NO_PROPS #endif #ifdef STBTE__NO_PROPS #undef STBTE_MAX_PROPERTIES #define STBTE_MAX_PROPERTIES 1 // so we can declare arrays #endif typedef struct { short x,y; } stbte__link; enum { STBTE__base, STBTE__outline, STBTE__text, STBTE__num_color_aspects, }; enum { STBTE__idle, STBTE__over, STBTE__down, STBTE__over_down, STBTE__selected, STBTE__selected_over, STBTE__disabled, STBTE__num_color_states, }; enum { STBTE__cexpander, STBTE__ctoolbar, STBTE__ctoolbar_button, STBTE__cpanel, STBTE__cpanel_sider, STBTE__cpanel_sizer, STBTE__cscrollbar, STBTE__cmapsize, STBTE__clayer_button, STBTE__clayer_hide, STBTE__clayer_lock, STBTE__clayer_solo, STBTE__ccategory_button, STBTE__num_color_modes, }; #ifdef STBTE__COLORPICKER static char *stbte__color_names[] = { "expander", "toolbar", "tool button", "panel", "panel c1", "panel c2", "scollbar", "map button", "layer", "hide", "lock", "solo", "category", }; #endif // STBTE__COLORPICKER // idle, over, down, over&down, selected, sel&over, disabled static int stbte__color_table[STBTE__num_color_modes][STBTE__num_color_aspects][STBTE__num_color_states] = { { { 0x000000, 0x84987c, 0xdcdca8, 0xdcdca8, 0x40c040, 0x60d060, 0x505050, }, { 0xa4b090, 0xe0ec80, 0xffffc0, 0xffffc0, 0x80ff80, 0x80ff80, 0x606060, }, { 0xffffff, 0xffffff, 0xffffff, 0xffffff, 0xffffff, 0xffffff, 0x909090, }, }, { { 0x808890, 0x606060, 0x606060, 0x606060, 0x606060, 0x606060, 0x606060, }, { 0x605860, 0x606060, 0x606060, 0x606060, 0x606060, 0x606060, 0x606060, }, { 0x000000, 0x000000, 0x000000, 0x000000, 0x000000, 0x000000, 0x000000, }, }, { { 0x3c5068, 0x7088a8, 0x647488, 0x94b4dc, 0x8890c4, 0x9caccc, 0x404040, }, { 0x889cb8, 0x889cb8, 0x889cb8, 0x889cb8, 0x84c4e8, 0xacc8ff, 0x0c0c08, }, { 0xbcc4cc, 0xffffff, 0xffffff, 0xffffff, 0xffffff, 0xffffff, 0x707074, }, }, { { 0x403848, 0x403010, 0x403010, 0x403010, 0x403010, 0x403010, 0x303024, }, { 0x68546c, 0xc08040, 0xc08040, 0xc08040, 0xc08040, 0xc08040, 0x605030, }, { 0xf4e4ff, 0xffffff, 0xffffff, 0xffffff, 0xffffff, 0xffffff, 0x909090, }, }, { { 0xb4b04c, 0xacac60, 0xc0ffc0, 0xc0ffc0, 0x40c040, 0x60d060, 0x505050, }, { 0xa0a04c, 0xd0d04c, 0xffff80, 0xffff80, 0x80ff80, 0x80ff80, 0x606060, }, { 0xffffff, 0xffffff, 0xffffff, 0xffffff, 0xffffff, 0xffffff, 0x909090, }, }, { { 0x40c440, 0x60d060, 0xc0ffc0, 0xc0ffc0, 0x40c040, 0x60d060, 0x505050, }, { 0x40c040, 0x80ff80, 0x80ff80, 0x80ff80, 0x80ff80, 0x80ff80, 0x606060, }, { 0xffffff, 0xffffff, 0xffffff, 0xffffff, 0xffffff, 0xffffff, 0x909090, }, }, { { 0x9090ac, 0xa0a0b8, 0xbcb8cc, 0xbcb8cc, 0x909040, 0x909040, 0x909040, }, { 0xa0a0b8, 0xb0b4d0, 0xa0a0b8, 0xa0a0b8, 0xa0a050, 0xa0a050, 0xa0a050, }, { 0x808088, 0x808030, 0x808030, 0x808030, 0x808030, 0x808030, 0x808030, }, }, { { 0x704c70, 0x885c8c, 0x9c68a4, 0xb870bc, 0xb490bc, 0xb490bc, 0x302828, }, { 0x646064, 0xcca8d4, 0xc060c0, 0xa07898, 0xe0b8e0, 0xe0b8e0, 0x403838, }, { 0xdccce4, 0xffffff, 0xffffff, 0xffffff, 0xffffff, 0xffffff, 0x909090, }, }, { { 0x704c70, 0x885c8c, 0x9c68a4, 0xb870bc, 0xb490bc, 0xb490bc, 0x302828, }, { 0xb09cb4, 0xcca8d4, 0xc060c0, 0xa07898, 0xe0b8e0, 0xe0b8e0, 0x403838, }, { 0xdccce4, 0xffffff, 0xffffff, 0xffffff, 0xffffff, 0xffffff, 0x909090, }, }, { { 0x646494, 0x888cb8, 0xb0b0b0, 0xb0b0cc, 0x9c9cf4, 0x8888b0, 0x50506c, }, { 0x9090a4, 0xb0b4d4, 0xb0b0dc, 0xb0b0cc, 0xd0d0fc, 0xd0d4f0, 0x606060, }, { 0xb4b4d4, 0xe4e4ff, 0xffffff, 0xffffff, 0xe0e4ff, 0xececff, 0x909090, }, }, { { 0x646444, 0x888c64, 0xb0b0b0, 0xb0b088, 0xaca858, 0x88886c, 0x505050, }, { 0x88886c, 0xb0b490, 0xb0b0b0, 0xb0b088, 0xd8d898, 0xd0d4b0, 0x606060, }, { 0xb4b49c, 0xffffd8, 0xffffff, 0xffffd4, 0xffffdc, 0xffffcc, 0x909090, }, }, { { 0x906464, 0xb48c8c, 0xd4b0b0, 0xdcb0b0, 0xff9c9c, 0xc88888, 0x505050, }, { 0xb47c80, 0xd4b4b8, 0xc4a8a8, 0xdcb0b0, 0xffc0c0, 0xfce8ec, 0x606060, }, { 0xe0b4b4, 0xffdcd8, 0xffd8d4, 0xffe0e4, 0xffece8, 0xffffff, 0x909090, }, }, { { 0x403848, 0x403848, 0x403848, 0x886894, 0x7c80c8, 0x7c80c8, 0x302828, }, { 0x403848, 0x403848, 0x403848, 0x403848, 0x7c80c8, 0x7c80c8, 0x403838, }, { 0xc8c4c8, 0xffffff, 0xffffff, 0xffffff, 0xe8e8ec, 0xffffff, 0x909090, }, }, }; #define STBTE_COLOR_TILEMAP_BACKGROUND 0x000000 #define STBTE_COLOR_TILEMAP_BORDER 0x203060 #define STBTE_COLOR_TILEMAP_HIGHLIGHT 0xffffff #define STBTE_COLOR_GRID 0x404040 #define STBTE_COLOR_SELECTION_OUTLINE1 0xdfdfdf #define STBTE_COLOR_SELECTION_OUTLINE2 0x303030 #define STBTE_COLOR_TILEPALETTE_OUTLINE 0xffffff #define STBTE_COLOR_TILEPALETTE_BACKGROUND 0x000000 #ifndef STBTE_LINK_COLOR #define STBTE_LINK_COLOR(src,sp,dest,dp) 0x5030ff #endif #ifndef STBTE_LINK_COLOR_DRAWING #define STBTE_LINK_COLOR_DRAWING 0xff40ff #endif #ifndef STBTE_LINK_COLOR_DISALLOWED #define STBTE_LINK_COLOR_DISALLOWED 0x602060 #endif // disabled, selected, down, over static unsigned char stbte__state_to_index[2][2][2][2] = { { { { STBTE__idle , STBTE__over }, { STBTE__down , STBTE__over_down }, }, { { STBTE__selected, STBTE__selected_over }, { STBTE__down , STBTE__over_down }, }, },{ { { STBTE__disabled, STBTE__disabled }, { STBTE__disabled, STBTE__disabled }, }, { { STBTE__selected, STBTE__selected_over }, { STBTE__disabled, STBTE__disabled }, }, } }; #define STBTE__INDEX_FOR_STATE(disable,select,down,over) stbte__state_to_index[disable][select][down][over] #define STBTE__INDEX_FOR_ID(id,disable,select) STBTE__INDEX_FOR_STATE(disable,select,STBTE__IS_ACTIVE(id),STBTE__IS_HOT(id)) #define STBTE__FONT_HEIGHT 9 static short stbte__font_offset[95+16]; static short stbte__fontdata[769] = { 4,9,6,9,9,9,9,8,9,8,4,9,7,7,7,7,4,2,6,8,6,6,7,3,4,4,8,6,3,6,2,6,6,6,6,6,6, 6,6,6,6,6,2,3,5,4,5,6,6,6,6,6,6,6,6,6,6,6,6,7,6,7,7,7,6,7,6,6,6,6,7,7,6,6, 6,4,6,4,7,7,3,6,6,5,6,6,5,6,6,4,5,6,4,7,6,6,6,6,6,6,6,6,6,7,6,6,6,5,2,5,8, 0,0,0,0,2,253,130,456,156,8,72,184,64,2,125,66,64,160,64,146,511,146,146, 511,146,146,511,146,511,257,341,297,341,297,341,257,511,16,56,124,16,16,16, 124,56,16,96,144,270,261,262,136,80,48,224,192,160,80,40,22,14,15,3,448,496, 496,240,232,20,10,5,2,112,232,452,450,225,113,58,28,63,30,60,200,455,257, 257,0,0,0,257,257,455,120,204,132,132,159,14,4,4,14,159,132,132,204,120,8, 24,56,120,56,24,8,32,48,56,60,56,48,32,0,0,0,0,111,111,7,7,0,0,7,7,34,127, 127,34,34,127,127,34,36,46,107,107,58,18,99,51,24,12,102,99,48,122,79,93, 55,114,80,4,7,3,62,127,99,65,65,99,127,62,8,42,62,28,28,62,42,8,8,8,62,62, 8,8,128,224,96,8,8,8,8,8,8,96,96,96,48,24,12,6,3,62,127,89,77,127,62,64,66, 127,127,64,64,98,115,89,77,71,66,33,97,73,93,119,35,24,28,22,127,127,16,39, 103,69,69,125,57,62,127,73,73,121,48,1,1,113,121,15,7,54,127,73,73,127,54, 6,79,73,105,63,30,54,54,128,246,118,8,28,54,99,65,20,20,20,20,65,99,54,28, 8,2,3,105,109,7,2,30,63,33,45,47,46,124,126,19,19,126,124,127,127,73,73,127, 54,62,127,65,65,99,34,127,127,65,99,62,28,127,127,73,73,73,65,127,127,9,9, 9,1,62,127,65,73,121,121,127,127,8,8,127,127,65,65,127,127,65,65,32,96,64, 64,127,63,127,127,8,28,54,99,65,127,127,64,64,64,64,127,127,6,12,6,127,127, 127,127,6,12,24,127,127,62,127,65,65,65,127,62,127,127,9,9,15,6,62,127,65, 81,49,127,94,127,127,9,25,127,102,70,79,73,73,121,49,1,1,127,127,1,1,63,127, 64,64,127,63,15,31,48,96,48,31,15,127,127,48,24,48,127,127,99,119,28,28,119, 99,7,15,120,120,15,7,97,113,89,77,71,67,127,127,65,65,3,6,12,24,48,96,65, 65,127,127,8,12,6,3,6,12,8,64,64,64,64,64,64,64,3,7,4,32,116,84,84,124,120, 127,127,68,68,124,56,56,124,68,68,68,56,124,68,68,127,127,56,124,84,84,92, 24,8,124,126,10,10,56,380,324,324,508,252,127,127,4,4,124,120,72,122,122, 64,256,256,256,506,250,126,126,16,56,104,64,66,126,126,64,124,124,24,56,28, 124,120,124,124,4,4,124,120,56,124,68,68,124,56,508,508,68,68,124,56,56,124, 68,68,508,508,124,124,4,4,12,8,72,92,84,84,116,36,4,4,62,126,68,68,60,124, 64,64,124,124,28,60,96,96,60,28,28,124,112,56,112,124,28,68,108,56,56,108, 68,284,316,352,320,508,252,68,100,116,92,76,68,8,62,119,65,65,127,127,65, 65,119,62,8,16,24,12,12,24,24,12,4, }; typedef struct { short id; unsigned short category_id; char *category; unsigned int layermask; } stbte__tileinfo; #define MAX_LAYERMASK (1 << (8*sizeof(unsigned int))) typedef short stbte__tiledata; #define STBTE__NO_TILE -1 enum { STBTE__panel_toolbar, STBTE__panel_colorpick, STBTE__panel_info, STBTE__panel_layers, STBTE__panel_props, STBTE__panel_categories, STBTE__panel_tiles, STBTE__num_panel, }; enum { STBTE__side_left, STBTE__side_right, STBTE__side_top, STBTE__side_bottom, }; enum { STBTE__tool_select, STBTE__tool_brush, STBTE__tool_erase, STBTE__tool_rect, STBTE__tool_eyedrop, STBTE__tool_fill, STBTE__tool_link, STBTE__tool_showgrid, STBTE__tool_showlinks, STBTE__tool_undo, STBTE__tool_redo, // copy/cut/paste aren't included here because they're displayed differently STBTE__num_tool, }; // icons are stored in the 0-31 range of ASCII in the font static int toolchar[] = { 26,24,25,20,23,22,18, 19,17, 29,28, }; enum { STBTE__propmode_default, STBTE__propmode_always, STBTE__propmode_never, }; enum { STBTE__paint, // from here down does hittesting STBTE__tick, STBTE__mousemove, STBTE__mousewheel, STBTE__leftdown, STBTE__leftup, STBTE__rightdown, STBTE__rightup, }; typedef struct { int expanded, mode; int delta_height; // number of rows they've requested for this int side; int width,height; int x0,y0; } stbte__panel; typedef struct { int x0,y0,x1,y1,color; } stbte__colorrect; #define STBTE__MAX_DELAYRECT 256 typedef struct { int tool, active_event; int active_id, hot_id, next_hot_id; int event; int mx,my, dx,dy; int ms_time; int shift, scrollkey; int initted; int side_extended[2]; stbte__colorrect delayrect[STBTE__MAX_DELAYRECT]; int delaycount; int show_grid, show_links; int brush_state; // used to decide which kind of erasing int eyedrop_x, eyedrop_y, eyedrop_last_layer; int pasting, paste_x, paste_y; int scrolling, start_x, start_y; int last_mouse_x, last_mouse_y; int accum_x, accum_y; int linking; int dragging; int drag_x, drag_y, drag_w, drag_h; int drag_offx, drag_offy, drag_dest_x, drag_dest_y; int undoing; int has_selection, select_x0, select_y0, select_x1, select_y1; int sx,sy; int x0,y0,x1,y1, left_width, right_width; // configurable widths float alert_timer; const char *alert_msg; float dt; stbte__panel panel[STBTE__num_panel]; short copybuffer[STBTE_MAX_COPY][STBTE_MAX_LAYERS]; float copyprops[STBTE_MAX_COPY][STBTE_MAX_PROPERTIES]; #ifdef STBTE_ALLOW_LINK stbte__link copylinks[STBTE_MAX_COPY]; #endif int copy_src_x, copy_src_y; stbte_tilemap *copy_src; int copy_width,copy_height,has_copy,copy_has_props; } stbte__ui_t; // there's only one UI system at a time, so we can globalize this static stbte__ui_t stbte__ui = { STBTE__tool_brush, 0 }; #define STBTE__INACTIVE() (stbte__ui.active_id == 0) #define STBTE__IS_ACTIVE(id) (stbte__ui.active_id == (id)) #define STBTE__IS_HOT(id) (stbte__ui.hot_id == (id)) #define STBTE__BUTTON_HEIGHT (STBTE__FONT_HEIGHT + 2 * STBTE__BUTTON_INTERNAL_SPACING) #define STBTE__BUTTON_INTERNAL_SPACING (2 + (STBTE__FONT_HEIGHT>>4)) typedef struct { const char *name; int locked; int hidden; } stbte__layer; enum { STBTE__unlocked, STBTE__protected, STBTE__locked, }; struct stbte_tilemap { stbte__tiledata data[STBTE_MAX_TILEMAP_Y][STBTE_MAX_TILEMAP_X][STBTE_MAX_LAYERS]; float props[STBTE_MAX_TILEMAP_Y][STBTE_MAX_TILEMAP_X][STBTE_MAX_PROPERTIES]; #ifdef STBTE_ALLOW_LINK stbte__link link[STBTE_MAX_TILEMAP_Y][STBTE_MAX_TILEMAP_X]; int linkcount[STBTE_MAX_TILEMAP_Y][STBTE_MAX_TILEMAP_X]; #endif int max_x, max_y, num_layers; int spacing_x, spacing_y; int palette_spacing_x, palette_spacing_y; int scroll_x,scroll_y; int cur_category, cur_tile, cur_layer; char *categories[STBTE_MAX_CATEGORIES]; int num_categories, category_scroll; stbte__tileinfo *tiles; int num_tiles, max_tiles, digits; unsigned char undo_available_valid; unsigned char undo_available; unsigned char redo_available; unsigned char padding; int cur_palette_count; int palette_scroll; int tileinfo_dirty; stbte__layer layerinfo[STBTE_MAX_LAYERS]; int has_layer_names; int layername_width; int layer_scroll; int propmode; int solo_layer; int undo_pos, undo_len, redo_len; short background_tile; unsigned char id_in_use[32768>>3]; short *undo_buffer; }; static char *default_category = "[unassigned]"; static void stbte__init_gui(void) { int i,n; stbte__ui.initted = 1; // init UI state stbte__ui.show_links = 1; for (i=0; i < STBTE__num_panel; ++i) { stbte__ui.panel[i].expanded = 1; // visible if not autohidden stbte__ui.panel[i].delta_height = 0; stbte__ui.panel[i].side = STBTE__side_left; } stbte__ui.panel[STBTE__panel_toolbar ].side = STBTE__side_top; stbte__ui.panel[STBTE__panel_colorpick].side = STBTE__side_right; if (stbte__ui.left_width == 0) stbte__ui.left_width = 80; if (stbte__ui.right_width == 0) stbte__ui.right_width = 80; // init font n=95+16; for (i=0; i < 95+16; ++i) { stbte__font_offset[i] = n; n += stbte__fontdata[i]; } } stbte_tilemap *stbte_create_map(int map_x, int map_y, int map_layers, int spacing_x, int spacing_y, int max_tiles) { int i; stbte_tilemap *tm; STBTE_ASSERT(map_layers >= 0 && map_layers <= STBTE_MAX_LAYERS); STBTE_ASSERT(map_x >= 0 && map_x <= STBTE_MAX_TILEMAP_X); STBTE_ASSERT(map_y >= 0 && map_y <= STBTE_MAX_TILEMAP_Y); if (map_x < 0 || map_y < 0 || map_layers < 0 || map_x > STBTE_MAX_TILEMAP_X || map_y > STBTE_MAX_TILEMAP_Y || map_layers > STBTE_MAX_LAYERS) return NULL; if (!stbte__ui.initted) stbte__init_gui(); tm = (stbte_tilemap *) malloc(sizeof(*tm) + sizeof(*tm->tiles) * max_tiles + STBTE_UNDO_BUFFER_BYTES); if (tm == NULL) return NULL; tm->tiles = (stbte__tileinfo *) (tm+1); tm->undo_buffer = (short *) (tm->tiles + max_tiles); tm->num_layers = map_layers; tm->max_x = map_x; tm->max_y = map_y; tm->spacing_x = spacing_x; tm->spacing_y = spacing_y; tm->scroll_x = 0; tm->scroll_y = 0; tm->palette_scroll = 0; tm->palette_spacing_x = spacing_x+1; tm->palette_spacing_y = spacing_y+1; tm->cur_category = -1; tm->cur_tile = 0; tm->solo_layer = -1; tm->undo_len = 0; tm->redo_len = 0; tm->undo_pos = 0; tm->category_scroll = 0; tm->layer_scroll = 0; tm->propmode = 0; tm->has_layer_names = 0; tm->layername_width = 0; tm->undo_available_valid = 0; for (i=0; i < tm->num_layers; ++i) { tm->layerinfo[i].hidden = 0; tm->layerinfo[i].locked = STBTE__unlocked; tm->layerinfo[i].name = 0; } tm->background_tile = STBTE__NO_TILE; stbte_clear_map(tm); tm->max_tiles = max_tiles; tm->num_tiles = 0; for (i=0; i < 32768/8; ++i) tm->id_in_use[i] = 0; tm->tileinfo_dirty = 1; return tm; } void stbte_set_background_tile(stbte_tilemap *tm, short id) { int i; STBTE_ASSERT(id >= -1 && id < 32768); if (id >= 32768 || id < -1) return; for (i=0; i < STBTE_MAX_TILEMAP_X * STBTE_MAX_TILEMAP_Y; ++i) if (tm->data[0][i][0] == -1) tm->data[0][i][0] = id; tm->background_tile = id; } void stbte_set_spacing(stbte_tilemap *tm, int spacing_x, int spacing_y, int palette_spacing_x, int palette_spacing_y) { tm->spacing_x = spacing_x; tm->spacing_y = spacing_y; tm->palette_spacing_x = palette_spacing_x; tm->palette_spacing_y = palette_spacing_y; } void stbte_set_sidewidths(int left, int right) { stbte__ui.left_width = left; stbte__ui.right_width = right; } void stbte_set_display(int x0, int y0, int x1, int y1) { stbte__ui.x0 = x0; stbte__ui.y0 = y0; stbte__ui.x1 = x1; stbte__ui.y1 = y1; } void stbte_define_tile(stbte_tilemap *tm, unsigned short id, unsigned int layermask, const char * category_c) { char *category = (char *) category_c; STBTE_ASSERT(id < 32768); STBTE_ASSERT(tm->num_tiles < tm->max_tiles); STBTE_ASSERT((tm->id_in_use[id>>3]&(1<<(id&7))) == 0); if (id >= 32768 || tm->num_tiles >= tm->max_tiles || (tm->id_in_use[id>>3]&(1<<(id&7)))) return; if (category == NULL) category = (char*) default_category; tm->id_in_use[id>>3] |= 1 << (id&7); tm->tiles[tm->num_tiles].category = category; tm->tiles[tm->num_tiles].id = id; tm->tiles[tm->num_tiles].layermask = layermask; ++tm->num_tiles; tm->tileinfo_dirty = 1; } static int stbte__text_width(const char *str); void stbte_set_layername(stbte_tilemap *tm, int layer, const char *layername) { STBTE_ASSERT(layer >= 0 && layer < tm->num_layers); if (layer >= 0 && layer < tm->num_layers) { int width; tm->layerinfo[layer].name = layername; tm->has_layer_names = 1; width = stbte__text_width(layername); tm->layername_width = (width > tm->layername_width ? width : tm->layername_width); } } void stbte_get_dimensions(stbte_tilemap *tm, int *max_x, int *max_y) { *max_x = tm->max_x; *max_y = tm->max_y; } short* stbte_get_tile(stbte_tilemap *tm, int x, int y) { STBTE_ASSERT(x >= 0 && x < tm->max_x && y >= 0 && y < tm->max_y); if (x < 0 || x >= STBTE_MAX_TILEMAP_X || y < 0 || y >= STBTE_MAX_TILEMAP_Y) return NULL; return tm->data[y][x]; } float *stbte_get_properties(stbte_tilemap *tm, int x, int y) { STBTE_ASSERT(x >= 0 && x < tm->max_x && y >= 0 && y < tm->max_y); if (x < 0 || x >= STBTE_MAX_TILEMAP_X || y < 0 || y >= STBTE_MAX_TILEMAP_Y) return NULL; return tm->props[y][x]; } void stbte_get_link(stbte_tilemap *tm, int x, int y, int *destx, int *desty) { int gx=-1,gy=-1; STBTE_ASSERT(x >= 0 && x < tm->max_x && y >= 0 && y < tm->max_y); #ifdef STBTE_ALLOW_LINK if (x >= 0 && x < STBTE_MAX_TILEMAP_X && y >= 0 && y < STBTE_MAX_TILEMAP_Y) { gx = tm->link[y][x].x; gy = tm->link[y][x].y; if (gx >= 0) if (!STBTE_ALLOW_LINK(tm->data[y][x], tm->props[y][x], tm->data[gy][gx], tm->props[gy][gx])) gx = gy = -1; } #endif *destx = gx; *desty = gy; } void stbte_set_property(stbte_tilemap *tm, int x, int y, int n, float val) { tm->props[y][x][n] = val; } static void stbte__set_link(stbte_tilemap *tm, int src_x, int src_y, int dest_x, int dest_y, int undo_mode); enum { STBTE__undo_none, STBTE__undo_record, STBTE__undo_block, }; void stbte_set_link(stbte_tilemap *tm, int x, int y, int destx, int desty) { #ifdef STBTE_ALLOW_LINK stbte__set_link(tm, x, y, destx, desty, STBTE__undo_none); #else STBTE_ASSERT(0); #endif } // returns an array of map_layers shorts. each short is either // one of the tile_id values from define_tile, or STBTE_EMPTY void stbte_set_dimensions(stbte_tilemap *tm, int map_x, int map_y) { STBTE_ASSERT(map_x >= 0 && map_x <= STBTE_MAX_TILEMAP_X); STBTE_ASSERT(map_y >= 0 && map_y <= STBTE_MAX_TILEMAP_Y); if (map_x < 0 || map_y < 0 || map_x > STBTE_MAX_TILEMAP_X || map_y > STBTE_MAX_TILEMAP_Y) return; tm->max_x = map_x; tm->max_y = map_y; } void stbte_clear_map(stbte_tilemap *tm) { int i,j; for (i=0; i < STBTE_MAX_TILEMAP_X * STBTE_MAX_TILEMAP_Y; ++i) { tm->data[0][i][0] = tm->background_tile; for (j=1; j < tm->num_layers; ++j) tm->data[0][i][j] = STBTE__NO_TILE; for (j=0; j < STBTE_MAX_PROPERTIES; ++j) tm->props[0][i][j] = 0; #ifdef STBTE_ALLOW_LINK tm->link[0][i].x = -1; tm->link[0][i].y = -1; tm->linkcount[0][i] = 0; #endif } } void stbte_set_tile(stbte_tilemap *tm, int x, int y, int layer, signed short tile) { STBTE_ASSERT(x >= 0 && x < tm->max_x && y >= 0 && y < tm->max_y); STBTE_ASSERT(layer >= 0 && layer < tm->num_layers); STBTE_ASSERT(tile >= -1 && tile < 32768); if (x < 0 || x >= STBTE_MAX_TILEMAP_X || y < 0 || y >= STBTE_MAX_TILEMAP_Y) return; if (layer < 0 || layer >= tm->num_layers || tile < -1) return; tm->data[y][x][layer] = tile; } static void stbte__choose_category(stbte_tilemap *tm, int category) { int i,n=0; tm->cur_category = category; for (i=0; i < tm->num_tiles; ++i) if (tm->tiles[i].category_id == category || category == -1) ++n; tm->cur_palette_count = n; tm->palette_scroll = 0; } static int stbte__strequal(char *p, char *q) { while (*p) if (*p++ != *q++) return 0; return *q == 0; } static void stbte__compute_tileinfo(stbte_tilemap *tm) { int i,j,n=0; tm->num_categories=0; for (i=0; i < tm->num_tiles; ++i) { stbte__tileinfo *t = &tm->tiles[i]; // find category for (j=0; j < tm->num_categories; ++j) if (stbte__strequal(t->category, tm->categories[j])) goto found; tm->categories[j] = t->category; ++tm->num_categories; found: t->category_id = (unsigned short) j; } // currently number of categories can never decrease because you // can't remove tile definitions, but let's get it right anyway if (tm->cur_category > tm->num_categories) { tm->cur_category = -1; } stbte__choose_category(tm, tm->cur_category); tm->tileinfo_dirty = 0; } static void stbte__prepare_tileinfo(stbte_tilemap *tm) { if (tm->tileinfo_dirty) stbte__compute_tileinfo(tm); } /////////////////////// undo system //////////////////////// // the undo system works by storing "commands" into a buffer, and // then playing back those commands. undo and redo have to store // the commands in different order. // // the commands are: // // 1) end_of_undo_record // -1:short // // 2) end_of_redo_record // -2:short // // 3) tile update // tile_id:short (-1..32767) // x_coord:short // y_coord:short // layer:short (0..31) // // 4) property update (also used for links) // value_hi:short // value_lo:short // y_coord:short // x_coord:short // property:short (256+prop#) // // Since we use a circular buffer, we might overwrite the undo storage. // To detect this, before playing back commands we scan back and see // if we see an end_of_undo_record before hitting the relevant boundary, // it's wholly contained. // // When we read back through, we see them in reverse order, so // we'll see the layer number or property number first // // To be clearer about the circular buffer, there are two cases: // 1. a single record is larger than the whole buffer. // this is caught because the end_of_undo_record will // get overwritten. // 2. multiple records written are larger than the whole // buffer, so some of them have been overwritten by // the later ones. this is handled by explicitly tracking // the undo length; we never try to parse the data that // got overwritten // given two points, compute the length between them #define stbte__wrap(pos) ((pos) & (STBTE__UNDO_BUFFER_COUNT-1)) #define STBTE__undo_record -2 #define STBTE__redo_record -3 #define STBTE__undo_junk -4 // this is written underneath the undo pointer, never used static void stbte__write_undo(stbte_tilemap *tm, short value) { int pos = tm->undo_pos; tm->undo_buffer[pos] = value; tm->undo_pos = stbte__wrap(pos+1); tm->undo_len += (tm->undo_len < STBTE__UNDO_BUFFER_COUNT-2); tm->redo_len -= (tm->redo_len > 0); tm->undo_available_valid = 0; } static void stbte__write_redo(stbte_tilemap *tm, short value) { int pos = tm->undo_pos; tm->undo_buffer[pos] = value; tm->undo_pos = stbte__wrap(pos-1); tm->redo_len += (tm->redo_len < STBTE__UNDO_BUFFER_COUNT-2); tm->undo_len -= (tm->undo_len > 0); tm->undo_available_valid = 0; } static void stbte__begin_undo(stbte_tilemap *tm) { tm->redo_len = 0; stbte__write_undo(tm, STBTE__undo_record); stbte__ui.undoing = 1; stbte__ui.alert_msg = 0; // clear alert if they start doing something } static void stbte__end_undo(stbte_tilemap *tm) { if (stbte__ui.undoing) { // check if anything got written int pos = stbte__wrap(tm->undo_pos-1); if (tm->undo_buffer[pos] == STBTE__undo_record) { // empty undo record, move back tm->undo_pos = pos; STBTE_ASSERT(tm->undo_len > 0); tm->undo_len -= 1; } tm->undo_buffer[tm->undo_pos] = STBTE__undo_junk; // otherwise do nothing stbte__ui.undoing = 0; } } static void stbte__undo_record(stbte_tilemap *tm, int x, int y, int i, int v) { STBTE_ASSERT(stbte__ui.undoing); if (stbte__ui.undoing) { stbte__write_undo(tm, v); stbte__write_undo(tm, x); stbte__write_undo(tm, y); stbte__write_undo(tm, i); } } static void stbte__redo_record(stbte_tilemap *tm, int x, int y, int i, int v) { stbte__write_redo(tm, v); stbte__write_redo(tm, x); stbte__write_redo(tm, y); stbte__write_redo(tm, i); } static float stbte__extract_float(short s0, short s1) { union { float f; short s[2]; } converter; converter.s[0] = s0; converter.s[1] = s1; return converter.f; } static short stbte__extract_short(float f, int slot) { union { float f; short s[2]; } converter; converter.f = f; return converter.s[slot]; } static void stbte__undo_record_prop(stbte_tilemap *tm, int x, int y, int i, short s0, short s1) { STBTE_ASSERT(stbte__ui.undoing); if (stbte__ui.undoing) { stbte__write_undo(tm, s1); stbte__write_undo(tm, s0); stbte__write_undo(tm, x); stbte__write_undo(tm, y); stbte__write_undo(tm, 256+i); } } static void stbte__undo_record_prop_float(stbte_tilemap *tm, int x, int y, int i, float f) { stbte__undo_record_prop(tm, x,y,i, stbte__extract_short(f,0), stbte__extract_short(f,1)); } static void stbte__redo_record_prop(stbte_tilemap *tm, int x, int y, int i, short s0, short s1) { stbte__write_redo(tm, s1); stbte__write_redo(tm, s0); stbte__write_redo(tm, x); stbte__write_redo(tm, y); stbte__write_redo(tm, 256+i); } static int stbte__undo_find_end(stbte_tilemap *tm) { // first scan through for the end record int i, pos = stbte__wrap(tm->undo_pos-1); for (i=0; i < tm->undo_len;) { STBTE_ASSERT(tm->undo_buffer[pos] != STBTE__undo_junk); if (tm->undo_buffer[pos] == STBTE__undo_record) break; if (tm->undo_buffer[pos] >= 255) pos = stbte__wrap(pos-5), i += 5; else pos = stbte__wrap(pos-4), i += 4; } if (i >= tm->undo_len) return -1; return pos; } static void stbte__undo(stbte_tilemap *tm) { int i, pos, endpos; endpos = stbte__undo_find_end(tm); if (endpos < 0) return; // we found a complete undo record pos = stbte__wrap(tm->undo_pos-1); // start a redo record stbte__write_redo(tm, STBTE__redo_record); // so now go back through undo and apply in reverse // order, and copy it to redo for (i=0; endpos != pos; i += 4) { int x,y,n,v; // get the undo entry n = tm->undo_buffer[pos]; y = tm->undo_buffer[stbte__wrap(pos-1)]; x = tm->undo_buffer[stbte__wrap(pos-2)]; v = tm->undo_buffer[stbte__wrap(pos-3)]; if (n >= 255) { short s0=0,s1=0; int v2 = tm->undo_buffer[stbte__wrap(pos-4)]; pos = stbte__wrap(pos-5); if (n > 255) { float vf = stbte__extract_float(v, v2); s0 = stbte__extract_short(tm->props[y][x][n-256], 0); s1 = stbte__extract_short(tm->props[y][x][n-256], 1); tm->props[y][x][n-256] = vf; } else { #ifdef STBTE_ALLOW_LINK s0 = tm->link[y][x].x; s1 = tm->link[y][x].y; stbte__set_link(tm, x,y, v, v2, STBTE__undo_none); #endif } // write the redo entry stbte__redo_record_prop(tm, x, y, n-256, s0,s1); // apply the undo entry } else { pos = stbte__wrap(pos-4); // write the redo entry stbte__redo_record(tm, x, y, n, tm->data[y][x][n]); // apply the undo entry tm->data[y][x][n] = (short) v; } } // overwrite undo record with junk tm->undo_buffer[tm->undo_pos] = STBTE__undo_junk; } static int stbte__redo_find_end(stbte_tilemap *tm) { // first scan through for the end record int i, pos = stbte__wrap(tm->undo_pos+1); for (i=0; i < tm->redo_len;) { STBTE_ASSERT(tm->undo_buffer[pos] != STBTE__undo_junk); if (tm->undo_buffer[pos] == STBTE__redo_record) break; if (tm->undo_buffer[pos] >= 255) pos = stbte__wrap(pos+5), i += 5; else pos = stbte__wrap(pos+4), i += 4; } if (i >= tm->redo_len) return -1; // this should only ever happen if redo buffer is empty return pos; } static void stbte__redo(stbte_tilemap *tm) { // first scan through for the end record int i, pos, endpos; endpos = stbte__redo_find_end(tm); if (endpos < 0) return; // we found a complete redo record pos = stbte__wrap(tm->undo_pos+1); // start an undo record stbte__write_undo(tm, STBTE__undo_record); for (i=0; pos != endpos; i += 4) { int x,y,n,v; n = tm->undo_buffer[pos]; y = tm->undo_buffer[stbte__wrap(pos+1)]; x = tm->undo_buffer[stbte__wrap(pos+2)]; v = tm->undo_buffer[stbte__wrap(pos+3)]; if (n >= 255) { int v2 = tm->undo_buffer[stbte__wrap(pos+4)]; short s0=0,s1=0; pos = stbte__wrap(pos+5); if (n > 255) { float vf = stbte__extract_float(v, v2); s0 = stbte__extract_short(tm->props[y][x][n-256],0); s1 = stbte__extract_short(tm->props[y][x][n-256],1); tm->props[y][x][n-256] = vf; } else { #ifdef STBTE_ALLOW_LINK s0 = tm->link[y][x].x; s1 = tm->link[y][x].y; stbte__set_link(tm, x,y,v,v2, STBTE__undo_none); #endif } // don't use stbte__undo_record_prop because it's guarded stbte__write_undo(tm, s1); stbte__write_undo(tm, s0); stbte__write_undo(tm, x); stbte__write_undo(tm, y); stbte__write_undo(tm, n); } else { pos = stbte__wrap(pos+4); // don't use stbte__undo_record because it's guarded stbte__write_undo(tm, tm->data[y][x][n]); stbte__write_undo(tm, x); stbte__write_undo(tm, y); stbte__write_undo(tm, n); tm->data[y][x][n] = (short) v; } } tm->undo_buffer[tm->undo_pos] = STBTE__undo_junk; } // because detecting that undo is available static void stbte__recompute_undo_available(stbte_tilemap *tm) { tm->undo_available = (stbte__undo_find_end(tm) >= 0); tm->redo_available = (stbte__redo_find_end(tm) >= 0); } static int stbte__undo_available(stbte_tilemap *tm) { if (!tm->undo_available_valid) stbte__recompute_undo_available(tm); return tm->undo_available; } static int stbte__redo_available(stbte_tilemap *tm) { if (!tm->undo_available_valid) stbte__recompute_undo_available(tm); return tm->redo_available; } /////////////////////////////////////////////////////////////////////////////////////////////////// #ifdef STBTE_ALLOW_LINK static void stbte__set_link(stbte_tilemap *tm, int src_x, int src_y, int dest_x, int dest_y, int undo_mode) { stbte__link *a; STBTE_ASSERT(src_x >= 0 && src_x < STBTE_MAX_TILEMAP_X && src_y >= 0 && src_y < STBTE_MAX_TILEMAP_Y); a = &tm->link[src_y][src_x]; // check if it's a do nothing if (a->x == dest_x && a->y == dest_y) return; if (undo_mode != STBTE__undo_none ) { if (undo_mode == STBTE__undo_block) stbte__begin_undo(tm); stbte__undo_record_prop(tm, src_x, src_y, -1, a->x, a->y); if (undo_mode == STBTE__undo_block) stbte__end_undo(tm); } // check if there's an existing link if (a->x >= 0) { // decrement existing link refcount STBTE_ASSERT(tm->linkcount[a->y][a->x] > 0); --tm->linkcount[a->y][a->x]; } // increment new dest if (dest_x >= 0) { ++tm->linkcount[dest_y][dest_x]; } a->x = dest_x; a->y = dest_y; } #endif static void stbte__draw_rect(int x0, int y0, int x1, int y1, unsigned int color) { STBTE_DRAW_RECT(x0,y0,x1,y1, color); } static void stbte__draw_line(int x0, int y0, int x1, int y1, unsigned int color) { int temp; if (x1 < x0) temp=x0,x0=x1,x1=temp; if (y1 < y0) temp=y0,y0=y1,y1=temp; stbte__draw_rect(x0,y0,x1+1,y1+1,color); } static void stbte__draw_link(int x0, int y0, int x1, int y1, unsigned int color) { stbte__draw_line(x0,y0,x0,y1, color); stbte__draw_line(x0,y1,x1,y1, color); } static void stbte__draw_frame(int x0, int y0, int x1, int y1, unsigned int color) { stbte__draw_rect(x0,y0,x1-1,y0+1,color); stbte__draw_rect(x1-1,y0,x1,y1-1,color); stbte__draw_rect(x0+1,y1-1,x1,y1,color); stbte__draw_rect(x0,y0+1,x0+1,y1,color); } static void stbte__draw_halfframe(int x0, int y0, int x1, int y1, unsigned int color) { stbte__draw_rect(x0,y0,x1,y0+1,color); stbte__draw_rect(x0,y0+1,x0+1,y1,color); } static int stbte__get_char_width(int ch) { return stbte__fontdata[ch-16]; } static short *stbte__get_char_bitmap(int ch) { return stbte__fontdata + stbte__font_offset[ch-16]; } static void stbte__draw_bitmask_as_columns(int x, int y, short bitmask, int color) { int start_i = -1, i=0; while (bitmask) { if (bitmask & (1<= 0) { stbte__draw_rect(x, y+start_i, x+1, y+i, color); start_i = -1; bitmask &= ~((1< x_end) break; stbte__draw_bitmap(x, y, cw, stbte__get_char_bitmap(c), color); if (digitspace && c == ' ') cw = stbte__get_char_width('0'); x += cw+1; } } static void stbte__draw_text(int x, int y, const char *str, int w, int color) { stbte__draw_text_core(x,y,str,w,color,0); } static int stbte__text_width(const char *str) { int x = 0; while (*str) { int c = *str++; int cw = stbte__get_char_width(c); x += cw+1; } return x; } static void stbte__draw_frame_delayed(int x0, int y0, int x1, int y1, int color) { if (stbte__ui.delaycount < STBTE__MAX_DELAYRECT) { stbte__colorrect r = { x0,y0,x1,y1,color }; stbte__ui.delayrect[stbte__ui.delaycount++] = r; } } static void stbte__flush_delay(void) { stbte__colorrect *r; int i; r = stbte__ui.delayrect; for (i=0; i < stbte__ui.delaycount; ++i,++r) stbte__draw_frame(r->x0,r->y0,r->x1,r->y1,r->color); stbte__ui.delaycount = 0; } static void stbte__activate(int id) { stbte__ui.active_id = id; stbte__ui.active_event = stbte__ui.event; stbte__ui.accum_x = 0; stbte__ui.accum_y = 0; } static int stbte__hittest(int x0, int y0, int x1, int y1, int id) { int over = stbte__ui.mx >= x0 && stbte__ui.my >= y0 && stbte__ui.mx < x1 && stbte__ui.my < y1; if (over && stbte__ui.event >= STBTE__tick) stbte__ui.next_hot_id = id; return over; } static int stbte__button_core(int id) { switch (stbte__ui.event) { case STBTE__leftdown: if (stbte__ui.hot_id == id && STBTE__INACTIVE()) stbte__activate(id); break; case STBTE__leftup: if (stbte__ui.active_id == id && STBTE__IS_HOT(id)) { stbte__activate(0); return 1; } break; case STBTE__rightdown: if (stbte__ui.hot_id == id && STBTE__INACTIVE()) stbte__activate(id); break; case STBTE__rightup: if (stbte__ui.active_id == id && STBTE__IS_HOT(id)) { stbte__activate(0); return -1; } break; } return 0; } static void stbte__draw_box(int x0, int y0, int x1, int y1, int colormode, int colorindex) { stbte__draw_rect (x0,y0,x1,y1, stbte__color_table[colormode][STBTE__base ][colorindex]); stbte__draw_frame(x0,y0,x1,y1, stbte__color_table[colormode][STBTE__outline][colorindex]); } static void stbte__draw_textbox(int x0, int y0, int x1, int y1, char *text, int xoff, int yoff, int colormode, int colorindex) { stbte__draw_box(x0,y0,x1,y1,colormode,colorindex); stbte__draw_text(x0+xoff,y0+yoff, text, x1-x0-xoff-1, stbte__color_table[colormode][STBTE__text][colorindex]); } static int stbte__button(int colormode, char *label, int x, int y, int textoff, int width, int id, int toggled, int disabled) { int x0=x,y0=y, x1=x+width,y1=y+STBTE__BUTTON_HEIGHT; int s = STBTE__BUTTON_INTERNAL_SPACING; int over = !disabled && stbte__hittest(x0,y0,x1,y1,id); if (stbte__ui.event == STBTE__paint) stbte__draw_textbox(x0,y0,x1,y1, label,s+textoff,s, colormode, STBTE__INDEX_FOR_ID(id,disabled,toggled)); if (disabled) return 0; return (stbte__button_core(id) == 1); } static int stbte__button_icon(int colormode, char ch, int x, int y, int width, int id, int toggled, int disabled) { int x0=x,y0=y, x1=x+width,y1=y+STBTE__BUTTON_HEIGHT; int s = STBTE__BUTTON_INTERNAL_SPACING; int over = stbte__hittest(x0,y0,x1,y1,id); if (stbte__ui.event == STBTE__paint) { char label[2] = { ch, 0 }; int pad = (9 - stbte__get_char_width(ch))/2; stbte__draw_textbox(x0,y0,x1,y1, label,s+pad,s, colormode, STBTE__INDEX_FOR_ID(id,disabled,toggled)); } if (disabled) return 0; return (stbte__button_core(id) == 1); } static int stbte__minibutton(int colormode, int x, int y, int ch, int id) { int x0 = x, y0 = y, x1 = x+8, y1 = y+7; int over = stbte__hittest(x0,y0,x1,y1,id); if (stbte__ui.event == STBTE__paint) { char str[2] = { ch,0 }; stbte__draw_textbox(x0,y0,x1,y1, str,1,0,colormode, STBTE__INDEX_FOR_ID(id,0,0)); } return stbte__button_core(id); } static int stbte__layerbutton(int x, int y, int ch, int id, int toggled, int disabled, int colormode) { int x0 = x, y0 = y, x1 = x+10, y1 = y+11; int over = !disabled && stbte__hittest(x0,y0,x1,y1,id); if (stbte__ui.event == STBTE__paint) { char str[2] = { ch,0 }; int off = (9-stbte__get_char_width(ch))/2; stbte__draw_textbox(x0,y0,x1,y1, str, off+1,2, colormode, STBTE__INDEX_FOR_ID(id,disabled,toggled)); } if (disabled) return 0; return stbte__button_core(id); } static int stbte__microbutton(int x, int y, int size, int id, int colormode) { int x0 = x, y0 = y, x1 = x+size, y1 = y+size; int over = stbte__hittest(x0,y0,x1,y1,id); if (stbte__ui.event == STBTE__paint) { stbte__draw_box(x0,y0,x1,y1, colormode, STBTE__INDEX_FOR_ID(id,0,0)); } return stbte__button_core(id); } static int stbte__microbutton_dragger(int x, int y, int size, int id, int *pos) { int x0 = x, y0 = y, x1 = x+size, y1 = y+size; int over = stbte__hittest(x0,y0,x1,y1,id); switch (stbte__ui.event) { case STBTE__paint: stbte__draw_box(x0,y0,x1,y1, STBTE__cexpander, STBTE__INDEX_FOR_ID(id,0,0)); break; case STBTE__leftdown: if (STBTE__IS_HOT(id) && STBTE__INACTIVE()) { stbte__activate(id); stbte__ui.sx = stbte__ui.mx - *pos; } break; case STBTE__mousemove: if (STBTE__IS_ACTIVE(id) && stbte__ui.active_event == STBTE__leftdown) { *pos = stbte__ui.mx - stbte__ui.sx; } break; case STBTE__leftup: if (STBTE__IS_ACTIVE(id)) stbte__activate(0); break; default: return stbte__button_core(id); } return 0; } static int stbte__category_button(char *label, int x, int y, int width, int id, int toggled) { int x0=x,y0=y, x1=x+width,y1=y+STBTE__BUTTON_HEIGHT; int s = STBTE__BUTTON_INTERNAL_SPACING; int over = stbte__hittest(x0,y0,x1,y1,id); if (stbte__ui.event == STBTE__paint) stbte__draw_textbox(x0,y0,x1,y1, label, s,s, STBTE__ccategory_button, STBTE__INDEX_FOR_ID(id,0,toggled)); return (stbte__button_core(id) == 1); } enum { STBTE__none, STBTE__begin, STBTE__end, STBTE__change, }; // returns -1 if value changes, 1 at end of drag static int stbte__slider(int x0, int w, int y, int range, int *value, int id) { int x1 = x0+w; int pos = *value * w / (range+1); int over = stbte__hittest(x0,y-2,x1,y+3,id); int event_mouse_move = STBTE__change; switch (stbte__ui.event) { case STBTE__paint: stbte__draw_rect(x0,y,x1,y+1, 0x808080); stbte__draw_rect(x0+pos-1,y-1,x0+pos+2,y+2, 0xffffff); break; case STBTE__leftdown: if (STBTE__IS_HOT(id) && STBTE__INACTIVE()) { stbte__activate(id); event_mouse_move = STBTE__begin; } // fall through case STBTE__mousemove: if (STBTE__IS_ACTIVE(id)) { int v = (stbte__ui.mx-x0)*(range+1)/w; if (v < 0) v = 0; else if (v > range) v = range; *value = v; return event_mouse_move; } break; case STBTE__leftup: if (STBTE__IS_ACTIVE(id)) { stbte__activate(0); return STBTE__end; } break; } return STBTE__none; } static int stbte__float_control(int x0, int y0, int w, float minv, float maxv, float scale, char *fmt, float *value, int colormode, int id) { int x1 = x0+w; int y1 = y0+11; int over = stbte__hittest(x0,y0,x1,y1,id); switch (stbte__ui.event) { case STBTE__paint: { char text[32]; sprintf(text, fmt ? fmt : "%6.2f", *value); stbte__draw_textbox(x0,y0,x1,y1, text, 1,2, colormode, STBTE__INDEX_FOR_ID(id,0,0)); break; } case STBTE__leftdown: case STBTE__rightdown: if (STBTE__IS_HOT(id) && STBTE__INACTIVE()) stbte__activate(id); return STBTE__begin; break; case STBTE__leftup: case STBTE__rightup: if (STBTE__IS_ACTIVE(id)) { stbte__activate(0); return STBTE__end; } break; case STBTE__mousemove: if (STBTE__IS_ACTIVE(id)) { float v = *value, delta; int ax = stbte__ui.accum_x/STBTE_FLOAT_CONTROL_GRANULARITY; int ay = stbte__ui.accum_y/STBTE_FLOAT_CONTROL_GRANULARITY; stbte__ui.accum_x -= ax*STBTE_FLOAT_CONTROL_GRANULARITY; stbte__ui.accum_y -= ay*STBTE_FLOAT_CONTROL_GRANULARITY; if (stbte__ui.shift) { if (stbte__ui.active_event == STBTE__leftdown) delta = ax * 16.0f + ay; else delta = ax / 16.0f + ay / 256.0f; } else { if (stbte__ui.active_event == STBTE__leftdown) delta = ax*10.0f + ay; else delta = ax * 0.1f + ay * 0.01f; } v += delta * scale; if (v < minv) v = minv; if (v > maxv) v = maxv; *value = v; return STBTE__change; } break; } return STBTE__none; } static void stbte__scrollbar(int x, int y0, int y1, int *val, int v0, int v1, int num_vis, int id) { int over; int thumbpos; if (v1 - v0 <= num_vis) return; // generate thumbpos from numvis thumbpos = y0+2 + (y1-y0-4) * *val / (v1 - v0 - num_vis); if (thumbpos < y0) thumbpos = y0; if (thumbpos >= y1) thumbpos = y1; over = stbte__hittest(x-1,y0,x+2,y1,id); switch (stbte__ui.event) { case STBTE__paint: stbte__draw_rect(x,y0,x+1,y1, stbte__color_table[STBTE__cscrollbar][STBTE__text][STBTE__idle]); stbte__draw_box(x-1,thumbpos-3,x+2,thumbpos+4, STBTE__cscrollbar, STBTE__INDEX_FOR_ID(id,0,0)); break; case STBTE__leftdown: if (STBTE__IS_HOT(id) && STBTE__INACTIVE()) { // check if it's over the thumb stbte__activate(id); *val = ((stbte__ui.my-y0) * (v1 - v0 - num_vis) + (y1-y0)/2)/ (y1-y0); } break; case STBTE__mousemove: if (STBTE__IS_ACTIVE(id) && stbte__ui.mx >= x-15 && stbte__ui.mx <= x+15) *val = ((stbte__ui.my-y0) * (v1 - v0 - num_vis) + (y1-y0)/2)/ (y1-y0); break; case STBTE__leftup: if (STBTE__IS_ACTIVE(id)) stbte__activate(0); break; } if (*val >= v1-num_vis) *val = v1-num_vis; if (*val <= v0) *val = v0; } static void stbte__compute_digits(stbte_tilemap *tm) { if (tm->max_x >= 1000 || tm->max_y >= 1000) tm->digits = 4; else if (tm->max_x >= 100 || tm->max_y >= 100) tm->digits = 3; else tm->digits = 2; } static int stbte__is_single_selection(void) { return stbte__ui.has_selection && stbte__ui.select_x0 == stbte__ui.select_x1 && stbte__ui.select_y0 == stbte__ui.select_y1; } typedef struct { int width, height; int x,y; int active; float retracted; } stbte__region_t; static stbte__region_t stbte__region[4]; #define STBTE__TOOLBAR_ICON_SIZE (9+2*2) #define STBTE__TOOLBAR_PASTE_SIZE (34+2*2) // This routine computes where every panel goes onscreen: computes // a minimum width for each side based on which panels are on that // side, and accounts for width-dependent layout of certain panels. static void stbte__compute_panel_locations(stbte_tilemap *tm) { int i, limit, w, k; int window_width = stbte__ui.x1 - stbte__ui.x0; int window_height = stbte__ui.y1 - stbte__ui.y0; int min_width[STBTE__num_panel]={0,0,0,0,0,0,0}; int height[STBTE__num_panel]={0,0,0,0,0,0,0}; int panel_active[STBTE__num_panel]={1,0,1,1,1,1,1}; int vpos[4] = { 0,0,0,0 }; stbte__panel *p = stbte__ui.panel; stbte__panel *pt = &p[STBTE__panel_toolbar]; #ifdef STBTE__NO_PROPS int props = 0; #else int props = 1; #endif for (i=0; i < 4; ++i) { stbte__region[i].active = 0; stbte__region[i].width = 0; stbte__region[i].height = 0; } // compute number of digits needs for info panel stbte__compute_digits(tm); // determine which panels are active panel_active[STBTE__panel_categories] = tm->num_categories != 0; panel_active[STBTE__panel_layers ] = tm->num_layers > 1; #ifdef STBTE__COLORPICKER panel_active[STBTE__panel_colorpick ] = 1; #endif panel_active[STBTE__panel_props ] = props && stbte__is_single_selection(); // compute minimum widths for each panel (assuming they're on sides not top) min_width[STBTE__panel_info ] = 8 + 11 + 7*tm->digits+17+7; // estimate min width of "w:0000" min_width[STBTE__panel_colorpick ] = 120; min_width[STBTE__panel_tiles ] = 4 + tm->palette_spacing_x + 5; // 5 for scrollbar min_width[STBTE__panel_categories] = 4 + 42 + 5; // 42 is enough to show ~7 chars; 5 for scrollbar min_width[STBTE__panel_layers ] = 4 + 54 + 30*tm->has_layer_names; // 2 digits plus 3 buttons plus scrollbar min_width[STBTE__panel_toolbar ] = 4 + STBTE__TOOLBAR_PASTE_SIZE; // wide enough for 'Paste' button min_width[STBTE__panel_props ] = 80; // narrowest info panel // compute minimum widths for left & right panels based on the above stbte__region[0].width = stbte__ui.left_width; stbte__region[1].width = stbte__ui.right_width; for (i=0; i < STBTE__num_panel; ++i) { if (panel_active[i]) { int side = stbte__ui.panel[i].side; if (min_width[i] > stbte__region[side].width) stbte__region[side].width = min_width[i]; stbte__region[side].active = 1; } } // now compute the heights of each panel // if toolbar at top, compute its size & push the left and right start points down if (stbte__region[STBTE__side_top].active) { int height = STBTE__TOOLBAR_ICON_SIZE+2; pt->x0 = stbte__ui.x0; pt->y0 = stbte__ui.y0; pt->width = window_width; pt->height = height; vpos[STBTE__side_left] = vpos[STBTE__side_right] = height; } else { int num_rows = STBTE__num_tool * ((stbte__region[pt->side].width-4)/STBTE__TOOLBAR_ICON_SIZE); height[STBTE__panel_toolbar] = num_rows*13 + 3*15 + 4; // 3*15 for cut/copy/paste, which are stacked vertically } for (i=0; i < 4; ++i) stbte__region[i].y = stbte__ui.y0 + vpos[i]; for (i=0; i < 2; ++i) { int anim = (int) (stbte__region[i].width * stbte__region[i].retracted); stbte__region[i].x = (i == STBTE__side_left) ? stbte__ui.x0 - anim : stbte__ui.x1 - stbte__region[i].width + anim; } // color picker height[STBTE__panel_colorpick] = 300; // info panel w = stbte__region[p[STBTE__panel_info].side].width; p[STBTE__panel_info].mode = (w >= 8 + (11+7*tm->digits+17)*2 + 4); if (p[STBTE__panel_info].mode) height[STBTE__panel_info] = 5 + 11*2 + 2 + tm->palette_spacing_y; else height[STBTE__panel_info] = 5 + 11*4 + 2 + tm->palette_spacing_y; // layers limit = 6 + stbte__ui.panel[STBTE__panel_layers].delta_height; height[STBTE__panel_layers] = (tm->num_layers > limit ? limit : tm->num_layers)*15 + 7 + (tm->has_layer_names ? 0 : 11) + props*13; // categories limit = 6 + stbte__ui.panel[STBTE__panel_categories].delta_height; height[STBTE__panel_categories] = (tm->num_categories+1 > limit ? limit : tm->num_categories+1)*11 + 14; if (stbte__ui.panel[STBTE__panel_categories].side == stbte__ui.panel[STBTE__panel_categories].side) height[STBTE__panel_categories] -= 4; // palette k = (stbte__region[p[STBTE__panel_tiles].side].width - 8) / tm->palette_spacing_x; if (k == 0) k = 1; height[STBTE__panel_tiles] = ((tm->num_tiles+k-1)/k) * tm->palette_spacing_y + 8; // properties panel height[STBTE__panel_props] = 9 + STBTE_MAX_PROPERTIES*14; // now compute the locations of all the panels for (i=0; i < STBTE__num_panel; ++i) { if (panel_active[i]) { int side = p[i].side; if (side == STBTE__side_left || side == STBTE__side_right) { p[i].width = stbte__region[side].width; p[i].x0 = stbte__region[side].x; p[i].y0 = stbte__ui.y0 + vpos[side]; p[i].height = height[i]; vpos[side] += height[i]; if (vpos[side] > window_height) { vpos[side] = window_height; p[i].height = stbte__ui.y1 - p[i].y0; } } else { ; // it's at top, it's already been explicitly set up earlier } } else { // inactive panel p[i].height = 0; p[i].width = 0; p[i].x0 = stbte__ui.x1; p[i].y0 = stbte__ui.y1; } } } // unique identifiers for imgui enum { STBTE__map=1, STBTE__region, STBTE__panel, // panel background to hide map, and misc controls STBTE__info, // info data STBTE__toolbarA, STBTE__toolbarB, // toolbar buttons: param is tool number STBTE__palette, // palette selectors: param is tile index STBTE__categories, // category selectors: param is category index STBTE__layer, // STBTE__solo, STBTE__hide, STBTE__lock, // layer controls: param is layer STBTE__scrollbar, // param is panel ID STBTE__panel_mover, // p1 is panel ID, p2 is destination side STBTE__panel_sizer, // param panel ID STBTE__scrollbar_id, STBTE__colorpick_id, STBTE__prop_flag, STBTE__prop_float, STBTE__prop_int, }; // id is: [ 24-bit data : 7-bit identifer ] // map id is: [ 12-bit y : 12 bit x : 7-bit identifier ] #define STBTE__ID(n,p) ((n) + ((p)<<7)) #define STBTE__ID2(n,p,q) STBTE__ID(n, ((p)<<12)+(q) ) #define STBTE__IDMAP(x,y) STBTE__ID2(STBTE__map, x,y) static void stbte__activate_map(int x, int y) { stbte__ui.active_id = STBTE__IDMAP(x,y); stbte__ui.active_event = stbte__ui.event; stbte__ui.sx = x; stbte__ui.sy = y; } static void stbte__alert(const char *msg) { stbte__ui.alert_msg = msg; stbte__ui.alert_timer = 3; } #define STBTE__BG(tm,layer) ((layer) == 0 ? (tm)->background_tile : STBTE__NO_TILE) static void stbte__brush_predict(stbte_tilemap *tm, short result[]) { int layer_to_paint = tm->cur_layer; stbte__tileinfo *ti; int i; if (tm->cur_tile < 0) return; ti = &tm->tiles[tm->cur_tile]; // find lowest legit layer to paint it on, and put it there for (i=0; i < tm->num_layers; ++i) { // check if object is allowed on layer if (!(ti->layermask & (1 << i))) continue; if (i != tm->solo_layer) { // if there's a selected layer, can only paint on that if (tm->cur_layer >= 0 && i != tm->cur_layer) continue; // if the layer is hidden, we can't see it if (tm->layerinfo[i].hidden) continue; // if the layer is locked, we can't write to it if (tm->layerinfo[i].locked == STBTE__locked) continue; // if the layer is non-empty and protected, can't write to it if (tm->layerinfo[i].locked == STBTE__protected && result[i] != STBTE__BG(tm,i)) continue; } result[i] = ti->id; return; } } static void stbte__brush(stbte_tilemap *tm, int x, int y) { int layer_to_paint = tm->cur_layer; stbte__tileinfo *ti; // find lowest legit layer to paint it on, and put it there int i; if (tm->cur_tile < 0) return; ti = &tm->tiles[tm->cur_tile]; for (i=0; i < tm->num_layers; ++i) { // check if object is allowed on layer if (!(ti->layermask & (1 << i))) continue; if (i != tm->solo_layer) { // if there's a selected layer, can only paint on that if (tm->cur_layer >= 0 && i != tm->cur_layer) continue; // if the layer is hidden, we can't see it if (tm->layerinfo[i].hidden) continue; // if the layer is locked, we can't write to it if (tm->layerinfo[i].locked == STBTE__locked) continue; // if the layer is non-empty and protected, can't write to it if (tm->layerinfo[i].locked == STBTE__protected && tm->data[y][x][i] != STBTE__BG(tm,i)) continue; } stbte__undo_record(tm,x,y,i,tm->data[y][x][i]); tm->data[y][x][i] = ti->id; return; } //stbte__alert("Selected tile not valid on active layer(s)"); } enum { STBTE__erase_none = -1, STBTE__erase_brushonly = 0, STBTE__erase_any = 1, STBTE__erase_all = 2, }; static int stbte__erase_predict(stbte_tilemap *tm, short result[], int allow_any) { stbte__tileinfo *ti = tm->cur_tile >= 0 ? &tm->tiles[tm->cur_tile] : NULL; int i; if (allow_any == STBTE__erase_none) return allow_any; // first check if only one layer is legit i = tm->cur_layer; if (tm->solo_layer >= 0) i = tm->solo_layer; // if only one layer is legit, directly process that one for clarity if (i >= 0) { short bg = (i == 0 ? tm->background_tile : -1); if (tm->solo_layer < 0) { // check that we're allowed to write to it if (tm->layerinfo[i].hidden) return STBTE__erase_none; if (tm->layerinfo[i].locked) return STBTE__erase_none; } if (result[i] == bg) return STBTE__erase_none; // didn't erase anything if (ti && result[i] == ti->id && (i != 0 || ti->id != tm->background_tile)) { result[i] = bg; return STBTE__erase_brushonly; } if (allow_any == STBTE__erase_any) { result[i] = bg; return STBTE__erase_any; } return STBTE__erase_none; } // if multiple layers are legit, first scan all for brush data if (ti && allow_any != STBTE__erase_all) { for (i=tm->num_layers-1; i >= 0; --i) { if (result[i] != ti->id) continue; if (tm->layerinfo[i].locked || tm->layerinfo[i].hidden) continue; if (i == 0 && result[i] == tm->background_tile) return STBTE__erase_none; result[i] = STBTE__BG(tm,i); return STBTE__erase_brushonly; } } if (allow_any != STBTE__erase_any && allow_any != STBTE__erase_all) return STBTE__erase_none; // apply layer filters, erase from top for (i=tm->num_layers-1; i >= 0; --i) { if (result[i] < 0) continue; if (tm->layerinfo[i].locked || tm->layerinfo[i].hidden) continue; if (i == 0 && result[i] == tm->background_tile) return STBTE__erase_none; result[i] = STBTE__BG(tm,i); if (allow_any != STBTE__erase_all) return STBTE__erase_any; } if (allow_any == STBTE__erase_all) return allow_any; return STBTE__erase_none; } static int stbte__erase(stbte_tilemap *tm, int x, int y, int allow_any) { stbte__tileinfo *ti = tm->cur_tile >= 0 ? &tm->tiles[tm->cur_tile] : NULL; int i; if (allow_any == STBTE__erase_none) return allow_any; // first check if only one layer is legit i = tm->cur_layer; if (tm->solo_layer >= 0) i = tm->solo_layer; // if only one layer is legit, directly process that one for clarity if (i >= 0) { short bg = (i == 0 ? tm->background_tile : -1); if (tm->solo_layer < 0) { // check that we're allowed to write to it if (tm->layerinfo[i].hidden) return STBTE__erase_none; if (tm->layerinfo[i].locked) return STBTE__erase_none; } if (tm->data[y][x][i] == bg) return -1; // didn't erase anything if (ti && tm->data[y][x][i] == ti->id && (i != 0 || ti->id != tm->background_tile)) { stbte__undo_record(tm,x,y,i,tm->data[y][x][i]); tm->data[y][x][i] = bg; return STBTE__erase_brushonly; } if (allow_any == STBTE__erase_any) { stbte__undo_record(tm,x,y,i,tm->data[y][x][i]); tm->data[y][x][i] = bg; return STBTE__erase_any; } return STBTE__erase_none; } // if multiple layers are legit, first scan all for brush data if (ti && allow_any != STBTE__erase_all) { for (i=tm->num_layers-1; i >= 0; --i) { if (tm->data[y][x][i] != ti->id) continue; if (tm->layerinfo[i].locked || tm->layerinfo[i].hidden) continue; if (i == 0 && tm->data[y][x][i] == tm->background_tile) return STBTE__erase_none; stbte__undo_record(tm,x,y,i,tm->data[y][x][i]); tm->data[y][x][i] = STBTE__BG(tm,i); return STBTE__erase_brushonly; } } if (allow_any != STBTE__erase_any && allow_any != STBTE__erase_all) return STBTE__erase_none; // apply layer filters, erase from top for (i=tm->num_layers-1; i >= 0; --i) { if (tm->data[y][x][i] < 0) continue; if (tm->layerinfo[i].locked || tm->layerinfo[i].hidden) continue; if (i == 0 && tm->data[y][x][i] == tm->background_tile) return STBTE__erase_none; stbte__undo_record(tm,x,y,i,tm->data[y][x][i]); tm->data[y][x][i] = STBTE__BG(tm,i); if (allow_any != STBTE__erase_all) return STBTE__erase_any; } if (allow_any == STBTE__erase_all) return allow_any; return STBTE__erase_none; } static int stbte__find_tile(stbte_tilemap *tm, int tile_id) { int i; for (i=0; i < tm->num_tiles; ++i) if (tm->tiles[i].id == tile_id) return i; stbte__alert("Eyedropped tile that isn't in tileset"); return -1; } static void stbte__eyedrop(stbte_tilemap *tm, int x, int y) { int i,j; // flush eyedropper state if (stbte__ui.eyedrop_x != x || stbte__ui.eyedrop_y != y) { stbte__ui.eyedrop_x = x; stbte__ui.eyedrop_y = y; stbte__ui.eyedrop_last_layer = tm->num_layers; } // if only one layer is active, query that i = tm->cur_layer; if (tm->solo_layer >= 0) i = tm->solo_layer; if (i >= 0) { if (tm->data[y][x][i] == STBTE__NO_TILE) return; tm->cur_tile = stbte__find_tile(tm, tm->data[y][x][i]); return; } // if multiple layers, continue from previous i = stbte__ui.eyedrop_last_layer; for (j=0; j < tm->num_layers; ++j) { if (--i < 0) i = tm->num_layers-1; if (tm->layerinfo[i].hidden) continue; if (tm->data[y][x][i] == STBTE__NO_TILE) continue; stbte__ui.eyedrop_last_layer = i; tm->cur_tile = stbte__find_tile(tm, tm->data[y][x][i]); return; } } static int stbte__should_copy_properties(stbte_tilemap *tm) { int i; if (tm->propmode == STBTE__propmode_always) return 1; if (tm->propmode == STBTE__propmode_never) return 0; if (tm->solo_layer >= 0 || tm->cur_layer >= 0) return 0; for (i=0; i < tm->num_layers; ++i) if (tm->layerinfo[i].hidden || tm->layerinfo[i].locked) return 0; return 1; } // compute the result of pasting into a tile non-destructively so we can preview it static void stbte__paste_stack(stbte_tilemap *tm, short result[], short dest[], short src[], int dragging) { int i; // special case single-layer i = tm->cur_layer; if (tm->solo_layer >= 0) i = tm->solo_layer; if (i >= 0) { if (tm->solo_layer < 0) { // check that we're allowed to write to it if (tm->layerinfo[i].hidden) return; if (tm->layerinfo[i].locked == STBTE__locked) return; // if protected, dest has to be empty if (tm->layerinfo[i].locked == STBTE__protected && dest[i] != STBTE__BG(tm,i)) return; // if dragging w/o copy, we will try to erase stuff, which protection disallows if (dragging && tm->layerinfo[i].locked == STBTE__protected) return; } result[i] = dest[i]; if (src[i] != STBTE__BG(tm,i)) result[i] = src[i]; return; } for (i=0; i < tm->num_layers; ++i) { result[i] = dest[i]; if (src[i] != STBTE__NO_TILE) if (!tm->layerinfo[i].hidden && tm->layerinfo[i].locked != STBTE__locked) if (tm->layerinfo[i].locked == STBTE__unlocked || (!dragging && dest[i] == STBTE__BG(tm,i))) result[i] = src[i]; } } // compute the result of dragging away from a tile static void stbte__clear_stack(stbte_tilemap *tm, short result[]) { int i; // special case single-layer i = tm->cur_layer; if (tm->solo_layer >= 0) i = tm->solo_layer; if (i >= 0) result[i] = STBTE__BG(tm,i); else for (i=0; i < tm->num_layers; ++i) if (!tm->layerinfo[i].hidden && tm->layerinfo[i].locked == STBTE__unlocked) result[i] = STBTE__BG(tm,i); } // check if some map square is active #define STBTE__IS_MAP_ACTIVE() ((stbte__ui.active_id & 127) == STBTE__map) #define STBTE__IS_MAP_HOT() ((stbte__ui.hot_id & 127) == STBTE__map) static void stbte__fillrect(stbte_tilemap *tm, int x0, int y0, int x1, int y1, int fill) { int i,j; int x=x0,y=y0; stbte__begin_undo(tm); if (x0 > x1) i=x0,x0=x1,x1=i; if (y0 > y1) j=y0,y0=y1,y1=j; for (j=y0; j <= y1; ++j) for (i=x0; i <= x1; ++i) if (fill) stbte__brush(tm, i,j); else stbte__erase(tm, i,j,STBTE__erase_any); stbte__end_undo(tm); // suppress warning from brush stbte__ui.alert_msg = 0; } static void stbte__select_rect(stbte_tilemap *tm, int x0, int y0, int x1, int y1) { stbte__ui.has_selection = 1; stbte__ui.select_x0 = (x0 < x1 ? x0 : x1); stbte__ui.select_x1 = (x0 < x1 ? x1 : x0); stbte__ui.select_y0 = (y0 < y1 ? y0 : y1); stbte__ui.select_y1 = (y0 < y1 ? y1 : y0); } static void stbte__copy_properties(float *dest, float *src) { int i; for (i=0; i < STBTE_MAX_PROPERTIES; ++i) dest[i] = src[i]; } static void stbte__copy_cut(stbte_tilemap *tm, int cut) { int i,j,n,w,h,p=0; int copy_props = stbte__should_copy_properties(tm); if (!stbte__ui.has_selection) return; w = stbte__ui.select_x1 - stbte__ui.select_x0 + 1; h = stbte__ui.select_y1 - stbte__ui.select_y0 + 1; if (STBTE_MAX_COPY / w < h) { stbte__alert("Selection too large for copy buffer, increase STBTE_MAX_COPY"); return; } for (i=0; i < w*h; ++i) for (n=0; n < tm->num_layers; ++n) stbte__ui.copybuffer[i][n] = STBTE__NO_TILE; if (cut) stbte__begin_undo(tm); for (j=stbte__ui.select_y0; j <= stbte__ui.select_y1; ++j) { for (i=stbte__ui.select_x0; i <= stbte__ui.select_x1; ++i) { for (n=0; n < tm->num_layers; ++n) { if (tm->solo_layer >= 0) { if (tm->solo_layer != n) continue; } else { if (tm->cur_layer >= 0) if (tm->cur_layer != n) continue; if (tm->layerinfo[n].hidden) continue; if (cut && tm->layerinfo[n].locked) continue; } stbte__ui.copybuffer[p][n] = tm->data[j][i][n]; if (cut) { stbte__undo_record(tm,i,j,n, tm->data[j][i][n]); tm->data[j][i][n] = (n==0 ? tm->background_tile : -1); } } if (copy_props) { stbte__copy_properties(stbte__ui.copyprops[p], tm->props[j][i]); #ifdef STBTE_ALLOW_LINK stbte__ui.copylinks[p] = tm->link[j][i]; if (cut) stbte__set_link(tm, i,j,-1,-1, STBTE__undo_record); #endif } ++p; } } if (cut) stbte__end_undo(tm); stbte__ui.copy_width = w; stbte__ui.copy_height = h; stbte__ui.has_copy = 1; //stbte__ui.has_selection = 0; stbte__ui.copy_has_props = copy_props; stbte__ui.copy_src = tm; // used to give better semantics when copying links stbte__ui.copy_src_x = stbte__ui.select_x0; stbte__ui.copy_src_y = stbte__ui.select_y0; } static int stbte__in_rect(int x, int y, int x0, int y0, int w, int h) { return x >= x0 && x < x0+w && y >= y0 && y < y0+h; } static int stbte__in_src_rect(int x, int y) { return stbte__in_rect(x,y, stbte__ui.copy_src_x, stbte__ui.copy_src_y, stbte__ui.copy_width, stbte__ui.copy_height); } static int stbte__in_dest_rect(int x, int y, int destx, int desty) { return stbte__in_rect(x,y, destx, desty, stbte__ui.copy_width, stbte__ui.copy_height); } static void stbte__paste(stbte_tilemap *tm, int mapx, int mapy) { int w = stbte__ui.copy_width; int h = stbte__ui.copy_height; int i,j,k,p; int x = mapx - (w>>1); int y = mapy - (h>>1); int copy_props = stbte__should_copy_properties(tm) && stbte__ui.copy_has_props; if (stbte__ui.has_copy == 0) return; stbte__begin_undo(tm); p = 0; for (j=0; j < h; ++j) { for (i=0; i < w; ++i) { if (y+j >= 0 && y+j < tm->max_y && x+i >= 0 && x+i < tm->max_x) { // compute the new stack short tilestack[STBTE_MAX_LAYERS]; for (k=0; k < tm->num_layers; ++k) tilestack[k] = tm->data[y+j][x+i][k]; stbte__paste_stack(tm, tilestack, tilestack, stbte__ui.copybuffer[p], 0); // update anything that changed for (k=0; k < tm->num_layers; ++k) { if (tilestack[k] != tm->data[y+j][x+i][k]) { stbte__undo_record(tm, x+i,y+j,k, tm->data[y+j][x+i][k]); tm->data[y+j][x+i][k] = tilestack[k]; } } } if (copy_props) { #ifdef STBTE_ALLOW_LINK // need to decide how to paste a link, so there's a few cases int destx = -1, desty = -1; stbte__link *link = &stbte__ui.copylinks[p]; // check if link is within-rect if (stbte__in_src_rect(link->x, link->y)) { // new link should point to copy (but only if copy is within map) destx = x + (link->x - stbte__ui.copy_src_x); desty = y + (link->y - stbte__ui.copy_src_y); } else if (tm == stbte__ui.copy_src) { // if same map, then preserve link unless target is overwritten if (!stbte__in_dest_rect(link->x,link->y,x,y)) { destx = link->x; desty = link->y; } } // this is necessary for offset-copy, but also in case max_x/max_y has changed if (destx < 0 || destx >= tm->max_x || desty < 0 || desty >= tm->max_y) destx = -1, desty = -1; stbte__set_link(tm, x+i, y+j, destx, desty, STBTE__undo_record); #endif for (k=0; k < STBTE_MAX_PROPERTIES; ++k) { if (tm->props[y+j][x+i][k] != stbte__ui.copyprops[p][k]) stbte__undo_record_prop_float(tm, x+i, y+j, k, tm->props[y+j][x+i][k]); } stbte__copy_properties(tm->props[y+j][x+i], stbte__ui.copyprops[p]); } ++p; } } stbte__end_undo(tm); } static void stbte__drag_update(stbte_tilemap *tm, int mapx, int mapy, int copy_props) { int w = stbte__ui.drag_w, h = stbte__ui.drag_h; int ox,oy,i,deleted=0,written=0; short temp[STBTE_MAX_LAYERS]; short *data = NULL; if (!stbte__ui.shift) { ox = mapx - stbte__ui.drag_x; oy = mapy - stbte__ui.drag_y; if (ox >= 0 && ox < w && oy >= 0 && oy < h) { deleted=1; for (i=0; i < tm->num_layers; ++i) temp[i] = tm->data[mapy][mapx][i]; data = temp; stbte__clear_stack(tm, data); } } ox = mapx - stbte__ui.drag_dest_x; oy = mapy - stbte__ui.drag_dest_y; // if this map square is in the target drag region if (ox >= 0 && ox < w && oy >= 0 && oy < h) { // and the src map square is on the map if (stbte__in_rect(stbte__ui.drag_x+ox, stbte__ui.drag_y+oy, 0, 0, tm->max_x, tm->max_y)) { written = 1; if (data == NULL) { for (i=0; i < tm->num_layers; ++i) temp[i] = tm->data[mapy][mapx][i]; data = temp; } stbte__paste_stack(tm, data, data, tm->data[stbte__ui.drag_y+oy][stbte__ui.drag_x+ox], !stbte__ui.shift); if (copy_props) { for (i=0; i < STBTE_MAX_PROPERTIES; ++i) { if (tm->props[mapy][mapx][i] != tm->props[stbte__ui.drag_y+oy][stbte__ui.drag_x+ox][i]) { stbte__undo_record_prop_float(tm, mapx, mapy, i, tm->props[mapy][mapx][i]); tm->props[mapy][mapx][i] = tm->props[stbte__ui.drag_y+oy][stbte__ui.drag_x+ox][i]; } } } } } if (data) { for (i=0; i < tm->num_layers; ++i) { if (tm->data[mapy][mapx][i] != data[i]) { stbte__undo_record(tm, mapx, mapy, i, tm->data[mapy][mapx][i]); tm->data[mapy][mapx][i] = data[i]; } } } #ifdef STBTE_ALLOW_LINK if (copy_props) { int overwritten=0, moved=0, copied=0; // since this function is called on EVERY tile, we can fix up even tiles not // involved in the move stbte__link *k; // first, determine what src link ends up here k = &tm->link[mapy][mapx]; // by default, it's the one currently here if (deleted) // if dragged away, it's erased k = NULL; if (written) // if dragged into, it gets that link k = &tm->link[stbte__ui.drag_y+oy][stbte__ui.drag_x+ox]; // now check whether the *target* gets moved or overwritten if (k && k->x >= 0) { overwritten = stbte__in_rect(k->x, k->y, stbte__ui.drag_dest_x, stbte__ui.drag_dest_y, w, h); if (!stbte__ui.shift) moved = stbte__in_rect(k->x, k->y, stbte__ui.drag_x , stbte__ui.drag_y , w, h); else copied = stbte__in_rect(k->x, k->y, stbte__ui.drag_x , stbte__ui.drag_y , w, h); } if (deleted || written || overwritten || moved || copied) { // choose the final link value based on the above if (k == NULL || k->x < 0) stbte__set_link(tm, mapx, mapy, -1, -1, STBTE__undo_record); else if (moved || (copied && written)) { // if we move the target, we update to point to the new target; // or, if we copy the target and the source is part ofthe copy, then update to new target int x = k->x + (stbte__ui.drag_dest_x - stbte__ui.drag_x); int y = k->y + (stbte__ui.drag_dest_y - stbte__ui.drag_y); if (!(x >= 0 && y >= 0 && x < tm->max_x && y < tm->max_y)) x = -1, y = -1; stbte__set_link(tm, mapx, mapy, x, y, STBTE__undo_record); } else if (overwritten) { stbte__set_link(tm, mapx, mapy, -1, -1, STBTE__undo_record); } else stbte__set_link(tm, mapx, mapy, k->x, k->y, STBTE__undo_record); } } #endif } static void stbte__drag_place(stbte_tilemap *tm, int mapx, int mapy) { int i,j; int copy_props = stbte__should_copy_properties(tm); int move_x = (stbte__ui.drag_dest_x - stbte__ui.drag_x); int move_y = (stbte__ui.drag_dest_y - stbte__ui.drag_y); if (move_x == 0 && move_y == 0) return; stbte__begin_undo(tm); // we now need a 2D memmove-style mover that doesn't // overwrite any data as it goes. this requires being // direction sensitive in the same way as memmove if (move_y > 0 || (move_y == 0 && move_x > 0)) { for (j=tm->max_y-1; j >= 0; --j) for (i=tm->max_x-1; i >= 0; --i) stbte__drag_update(tm,i,j,copy_props); } else { for (j=0; j < tm->max_y; ++j) for (i=0; i < tm->max_x; ++i) stbte__drag_update(tm,i,j,copy_props); } stbte__end_undo(tm); stbte__ui.has_selection = 1; stbte__ui.select_x0 = stbte__ui.drag_dest_x; stbte__ui.select_y0 = stbte__ui.drag_dest_y; stbte__ui.select_x1 = stbte__ui.select_x0 + stbte__ui.drag_w - 1; stbte__ui.select_y1 = stbte__ui.select_y0 + stbte__ui.drag_h - 1; } static void stbte__tile_paint(stbte_tilemap *tm, int sx, int sy, int mapx, int mapy, int layer) { int i; int id = STBTE__IDMAP(mapx,mapy); int x0=sx, y0=sy; int x1=sx+tm->spacing_x, y1=sy+tm->spacing_y; int over = stbte__hittest(x0,y0,x1,y1, id); short *data = tm->data[mapy][mapx]; short temp[STBTE_MAX_LAYERS]; if (STBTE__IS_MAP_HOT()) { if (stbte__ui.pasting) { int ox = mapx - stbte__ui.paste_x; int oy = mapy - stbte__ui.paste_y; if (ox >= 0 && ox < stbte__ui.copy_width && oy >= 0 && oy < stbte__ui.copy_height) { stbte__paste_stack(tm, temp, tm->data[mapy][mapx], stbte__ui.copybuffer[oy*stbte__ui.copy_width+ox], 0); data = temp; } } else if (stbte__ui.dragging) { int ox,oy; for (i=0; i < tm->num_layers; ++i) temp[i] = tm->data[mapy][mapx][i]; data = temp; // if it's in the source area, remove things unless shift-dragging ox = mapx - stbte__ui.drag_x; oy = mapy - stbte__ui.drag_y; if (!stbte__ui.shift && ox >= 0 && ox < stbte__ui.drag_w && oy >= 0 && oy < stbte__ui.drag_h) { stbte__clear_stack(tm, temp); } ox = mapx - stbte__ui.drag_dest_x; oy = mapy - stbte__ui.drag_dest_y; if (ox >= 0 && ox < stbte__ui.drag_w && oy >= 0 && oy < stbte__ui.drag_h) { stbte__paste_stack(tm, temp, temp, tm->data[stbte__ui.drag_y+oy][stbte__ui.drag_x+ox], !stbte__ui.shift); } } else if (STBTE__IS_MAP_ACTIVE()) { if (stbte__ui.tool == STBTE__tool_rect) { if ((stbte__ui.ms_time & 511) < 380) { int ex = ((stbte__ui.hot_id >> 19) & 4095); int ey = ((stbte__ui.hot_id >> 7) & 4095); int sx = stbte__ui.sx; int sy = stbte__ui.sy; if ( ((mapx >= sx && mapx < ex+1) || (mapx >= ex && mapx < sx+1)) && ((mapy >= sy && mapy < ey+1) || (mapy >= ey && mapy < sy+1))) { int i; for (i=0; i < tm->num_layers; ++i) temp[i] = tm->data[mapy][mapx][i]; data = temp; if (stbte__ui.active_event == STBTE__leftdown) stbte__brush_predict(tm, temp); else stbte__erase_predict(tm, temp, STBTE__erase_any); } } } } } if (STBTE__IS_HOT(id) && STBTE__INACTIVE() && !stbte__ui.pasting) { if (stbte__ui.tool == STBTE__tool_brush) { if ((stbte__ui.ms_time & 511) < 300) { data = temp; for (i=0; i < tm->num_layers; ++i) temp[i] = tm->data[mapy][mapx][i]; stbte__brush_predict(tm, temp); } } } { i = layer; if (i == tm->solo_layer || (!tm->layerinfo[i].hidden && tm->solo_layer < 0)) if (data[i] >= 0) STBTE_DRAW_TILE(x0,y0, (unsigned short) data[i], 0, tm->props[mapy][mapx]); } } static void stbte__tile(stbte_tilemap *tm, int sx, int sy, int mapx, int mapy) { int tool = stbte__ui.tool; int x0=sx, y0=sy; int x1=sx+tm->spacing_x, y1=sy+tm->spacing_y; int id = STBTE__IDMAP(mapx,mapy); int over = stbte__hittest(x0,y0,x1,y1, id); switch (stbte__ui.event) { case STBTE__paint: { if (stbte__ui.pasting || stbte__ui.dragging || stbte__ui.scrolling) break; if (stbte__ui.scrollkey && !STBTE__IS_MAP_ACTIVE()) break; if (STBTE__IS_HOT(id) && STBTE__IS_MAP_ACTIVE() && (tool == STBTE__tool_rect || tool == STBTE__tool_select)) { int rx0,ry0,rx1,ry1,t; // compute the center of each rect rx0 = x0 + tm->spacing_x/2; ry0 = y0 + tm->spacing_y/2; rx1 = rx0 + (stbte__ui.sx - mapx) * tm->spacing_x; ry1 = ry0 + (stbte__ui.sy - mapy) * tm->spacing_y; if (rx0 > rx1) t=rx0,rx0=rx1,rx1=t; if (ry0 > ry1) t=ry0,ry0=ry1,ry1=t; rx0 -= tm->spacing_x/2; ry0 -= tm->spacing_y/2; rx1 += tm->spacing_x/2; ry1 += tm->spacing_y/2; stbte__draw_frame(rx0-1,ry0-1,rx1+1,ry1+1, STBTE_COLOR_TILEMAP_HIGHLIGHT); break; } if (STBTE__IS_HOT(id) && STBTE__INACTIVE()) { stbte__draw_frame(x0-1,y0-1,x1+1,y1+1, STBTE_COLOR_TILEMAP_HIGHLIGHT); } #ifdef STBTE_ALLOW_LINK if (stbte__ui.show_links && tm->link[mapy][mapx].x >= 0) { int tx = tm->link[mapy][mapx].x; int ty = tm->link[mapy][mapx].y; int lx0,ly0,lx1,ly1; if (STBTE_ALLOW_LINK(tm->data[mapy][mapx], tm->props[mapy][mapx], tm->data[ty ][tx ], tm->props[ty ][tx ])) { lx0 = x0 + (tm->spacing_x >> 1) - 1; ly0 = y0 + (tm->spacing_y >> 1) - 1; lx1 = lx0 + (tx - mapx) * tm->spacing_x + 2; ly1 = ly0 + (ty - mapy) * tm->spacing_y + 2; stbte__draw_link(lx0,ly0,lx1,ly1, STBTE_LINK_COLOR(tm->data[mapy][mapx], tm->props[mapy][mapx], tm->data[ty ][tx ], tm->props[ty ][tx])); } } #endif break; } } if (stbte__ui.pasting) { switch (stbte__ui.event) { case STBTE__leftdown: if (STBTE__IS_HOT(id)) { stbte__ui.pasting = 0; stbte__paste(tm, mapx, mapy); stbte__activate(0); } break; case STBTE__leftup: // just clear it no matter what, since they might click away to clear it stbte__activate(0); break; case STBTE__rightdown: if (STBTE__IS_HOT(id)) { stbte__activate(0); stbte__ui.pasting = 0; } break; } return; } if (stbte__ui.scrolling) { if (stbte__ui.event == STBTE__leftup) { stbte__activate(0); stbte__ui.scrolling = 0; } if (stbte__ui.event == STBTE__mousemove) { tm->scroll_x += (stbte__ui.start_x - stbte__ui.mx); tm->scroll_y += (stbte__ui.start_y - stbte__ui.my); stbte__ui.start_x = stbte__ui.mx; stbte__ui.start_y = stbte__ui.my; } return; } // regardless of tool, leftdown is a scrolldrag if (STBTE__IS_HOT(id) && stbte__ui.scrollkey && stbte__ui.event == STBTE__leftdown) { stbte__ui.scrolling = 1; stbte__ui.start_x = stbte__ui.mx; stbte__ui.start_y = stbte__ui.my; return; } switch (tool) { case STBTE__tool_brush: switch (stbte__ui.event) { case STBTE__mousemove: if (STBTE__IS_MAP_ACTIVE() && over) { // don't brush/erase same tile multiple times unless they move away and back @TODO should just be only once, but that needs another data structure if (!STBTE__IS_ACTIVE(id)) { if (stbte__ui.active_event == STBTE__leftdown) stbte__brush(tm, mapx, mapy); else stbte__erase(tm, mapx, mapy, stbte__ui.brush_state); stbte__ui.active_id = id; // switch to this map square so we don't rebrush IT multiple times } } break; case STBTE__leftdown: if (STBTE__IS_HOT(id) && STBTE__INACTIVE()) { stbte__activate(id); stbte__begin_undo(tm); stbte__brush(tm, mapx, mapy); } break; case STBTE__rightdown: if (STBTE__IS_HOT(id) && STBTE__INACTIVE()) { stbte__activate(id); stbte__begin_undo(tm); if (stbte__erase(tm, mapx, mapy, STBTE__erase_any) == STBTE__erase_brushonly) stbte__ui.brush_state = STBTE__erase_brushonly; else stbte__ui.brush_state = STBTE__erase_any; } break; case STBTE__leftup: case STBTE__rightup: if (STBTE__IS_MAP_ACTIVE()) { stbte__end_undo(tm); stbte__activate(0); } break; } break; #ifdef STBTE_ALLOW_LINK case STBTE__tool_link: switch (stbte__ui.event) { case STBTE__leftdown: if (STBTE__IS_HOT(id) && STBTE__INACTIVE()) { stbte__activate(id); stbte__ui.linking = 1; stbte__ui.sx = mapx; stbte__ui.sy = mapy; // @TODO: undo } break; case STBTE__leftup: if (STBTE__IS_HOT(id) && STBTE__IS_MAP_ACTIVE()) { if ((mapx != stbte__ui.sx || mapy != stbte__ui.sy) && STBTE_ALLOW_LINK(tm->data[stbte__ui.sy][stbte__ui.sx], tm->props[stbte__ui.sy][stbte__ui.sx], tm->data[mapy][mapx], tm->props[mapy][mapx])) stbte__set_link(tm, stbte__ui.sx, stbte__ui.sy, mapx, mapy, STBTE__undo_block); else stbte__set_link(tm, stbte__ui.sx, stbte__ui.sy, -1,-1, STBTE__undo_block); stbte__ui.linking = 0; stbte__activate(0); } break; case STBTE__rightdown: if (STBTE__IS_ACTIVE(id)) { stbte__activate(0); stbte__ui.linking = 0; } break; } break; #endif case STBTE__tool_erase: switch (stbte__ui.event) { case STBTE__mousemove: if (STBTE__IS_MAP_ACTIVE() && over) stbte__erase(tm, mapx, mapy, STBTE__erase_all); break; case STBTE__leftdown: if (STBTE__IS_HOT(id) && STBTE__INACTIVE()) { stbte__activate(id); stbte__begin_undo(tm); stbte__erase(tm, mapx, mapy, STBTE__erase_all); } break; case STBTE__leftup: if (STBTE__IS_MAP_ACTIVE()) { stbte__end_undo(tm); stbte__activate(0); } break; } break; case STBTE__tool_select: if (STBTE__IS_HOT(id)) { switch (stbte__ui.event) { case STBTE__leftdown: if (STBTE__INACTIVE()) { // if we're clicking in an existing selection... if (stbte__ui.has_selection) { if ( mapx >= stbte__ui.select_x0 && mapx <= stbte__ui.select_x1 && mapy >= stbte__ui.select_y0 && mapy <= stbte__ui.select_y1) { stbte__ui.dragging = 1; stbte__ui.drag_x = stbte__ui.select_x0; stbte__ui.drag_y = stbte__ui.select_y0; stbte__ui.drag_w = stbte__ui.select_x1 - stbte__ui.select_x0 + 1; stbte__ui.drag_h = stbte__ui.select_y1 - stbte__ui.select_y0 + 1; stbte__ui.drag_offx = mapx - stbte__ui.select_x0; stbte__ui.drag_offy = mapy - stbte__ui.select_y0; } } stbte__ui.has_selection = 0; // no selection until it completes stbte__activate_map(mapx,mapy); } break; case STBTE__leftup: if (STBTE__IS_MAP_ACTIVE()) { if (stbte__ui.dragging) { stbte__drag_place(tm, mapx,mapy); stbte__ui.dragging = 0; stbte__activate(0); } else { stbte__select_rect(tm, stbte__ui.sx, stbte__ui.sy, mapx, mapy); stbte__activate(0); } } break; case STBTE__rightdown: stbte__ui.has_selection = 0; break; } } break; case STBTE__tool_rect: if (STBTE__IS_HOT(id)) { switch (stbte__ui.event) { case STBTE__leftdown: if (STBTE__INACTIVE()) stbte__activate_map(mapx,mapy); break; case STBTE__leftup: if (STBTE__IS_MAP_ACTIVE()) { stbte__fillrect(tm, stbte__ui.sx, stbte__ui.sy, mapx, mapy, 1); stbte__activate(0); } break; case STBTE__rightdown: if (STBTE__INACTIVE()) stbte__activate_map(mapx,mapy); break; case STBTE__rightup: if (STBTE__IS_MAP_ACTIVE()) { stbte__fillrect(tm, stbte__ui.sx, stbte__ui.sy, mapx, mapy, 0); stbte__activate(0); } break; } } break; case STBTE__tool_eyedrop: switch (stbte__ui.event) { case STBTE__leftdown: if (STBTE__IS_HOT(id) && STBTE__INACTIVE()) stbte__eyedrop(tm,mapx,mapy); break; } break; } } static void stbte__start_paste(stbte_tilemap *tm) { if (stbte__ui.has_copy) { stbte__ui.pasting = 1; stbte__activate(STBTE__ID(STBTE__toolbarB,3)); } } static void stbte__toolbar(stbte_tilemap *tm, int x0, int y0, int w, int h) { int i; int estimated_width = 13 * STBTE__num_tool + 8+8+ 120+4 - 30; int x = x0 + w/2 - estimated_width/2; int y = y0+1; for (i=0; i < STBTE__num_tool; ++i) { int highlight=0, disable=0; highlight = (stbte__ui.tool == i); if (i == STBTE__tool_undo || i == STBTE__tool_showgrid) x += 8; if (i == STBTE__tool_showgrid && stbte__ui.show_grid) highlight = 1; if (i == STBTE__tool_showlinks && stbte__ui.show_links) highlight = 1; if (i == STBTE__tool_fill) continue; #ifndef STBTE_ALLOW_LINK if (i == STBTE__tool_link || i == STBTE__tool_showlinks) disable = 1; #endif if (i == STBTE__tool_undo && !stbte__undo_available(tm)) disable = 1; if (i == STBTE__tool_redo && !stbte__redo_available(tm)) disable = 1; if (stbte__button_icon(STBTE__ctoolbar_button, toolchar[i], x, y, 13, STBTE__ID(STBTE__toolbarA, i), highlight, disable)) { switch (i) { case STBTE__tool_eyedrop: stbte__ui.eyedrop_last_layer = tm->num_layers; // flush eyedropper state // fallthrough default: stbte__ui.tool = i; stbte__ui.has_selection = 0; break; case STBTE__tool_showlinks: stbte__ui.show_links = !stbte__ui.show_links; break; case STBTE__tool_showgrid: stbte__ui.show_grid = (stbte__ui.show_grid+1)%3; break; case STBTE__tool_undo: stbte__undo(tm); break; case STBTE__tool_redo: stbte__redo(tm); break; } } x += 13; } x += 8; if (stbte__button(STBTE__ctoolbar_button, "cut" , x, y,10, 40, STBTE__ID(STBTE__toolbarB,0), 0, !stbte__ui.has_selection)) stbte__copy_cut(tm, 1); x += 42; if (stbte__button(STBTE__ctoolbar_button, "copy" , x, y, 5, 40, STBTE__ID(STBTE__toolbarB,1), 0, !stbte__ui.has_selection)) stbte__copy_cut(tm, 0); x += 42; if (stbte__button(STBTE__ctoolbar_button, "paste", x, y, 0, 40, STBTE__ID(STBTE__toolbarB,2), stbte__ui.pasting, !stbte__ui.has_copy)) stbte__start_paste(tm); } #define STBTE__TEXTCOLOR(n) stbte__color_table[n][STBTE__text][STBTE__idle] static int stbte__info_value(const char *label, int x, int y, int val, int digits, int id) { if (stbte__ui.event == STBTE__paint) { int off = 9-stbte__get_char_width(label[0]); char text[16]; sprintf(text, label, digits, val); stbte__draw_text_core(x+off,y, text, 999, STBTE__TEXTCOLOR(STBTE__cpanel),1); } if (id) { x += 9+7*digits+4; if (stbte__minibutton(STBTE__cmapsize, x,y, '+', STBTE__ID2(id,1,0))) val += (stbte__ui.shift ? 10 : 1); x += 9; if (stbte__minibutton(STBTE__cmapsize, x,y, '-', STBTE__ID2(id,2,0))) val -= (stbte__ui.shift ? 10 : 1); if (val < 1) val = 1; else if (val > 4096) val = 4096; } return val; } static void stbte__info(stbte_tilemap *tm, int x0, int y0, int w, int h) { int mode = stbte__ui.panel[STBTE__panel_info].mode; int s = 11+7*tm->digits+4+15; int x,y; int in_region; x = x0+2; y = y0+2; tm->max_x = stbte__info_value("w:%*d",x,y, tm->max_x, tm->digits, STBTE__ID(STBTE__info,0)); if (mode) x += s; else y += 11; tm->max_y = stbte__info_value("h:%*d",x,y, tm->max_y, tm->digits, STBTE__ID(STBTE__info,1)); x = x0+2; y += 11; in_region = (stbte__ui.hot_id & 127) == STBTE__map; stbte__info_value(in_region ? "x:%*d" : "x:",x,y, (stbte__ui.hot_id>>19)&4095, tm->digits, 0); if (mode) x += s; else y += 11; stbte__info_value(in_region ? "y:%*d" : "y:",x,y, (stbte__ui.hot_id>> 7)&4095, tm->digits, 0); y += 15; x = x0+2; stbte__draw_text(x,y,"brush:",40,STBTE__TEXTCOLOR(STBTE__cpanel)); if (tm->cur_tile >= 0) STBTE_DRAW_TILE(x+43,y-3,tm->tiles[tm->cur_tile].id,1,0); } static void stbte__layers(stbte_tilemap *tm, int x0, int y0, int w, int h) { static char *propmodes[3] = { "default", "always", "never" }; int num_rows; int i, y, n; int x1 = x0+w; int y1 = y0+h; int xoff = 20; if (tm->has_layer_names) { int side = stbte__ui.panel[STBTE__panel_layers].side; xoff = stbte__region[side].width - 42; xoff = (xoff < tm->layername_width + 10 ? xoff : tm->layername_width + 10); } x0 += 2; y0 += 5; if (!tm->has_layer_names) { if (stbte__ui.event == STBTE__paint) { stbte__draw_text(x0,y0, "Layers", w-4, STBTE__TEXTCOLOR(STBTE__cpanel)); } y0 += 11; } num_rows = (y1-y0)/15; #ifndef STBTE_NO_PROPS --num_rows; #endif y = y0; for (i=0; i < tm->num_layers; ++i) { char text[3], *str = (char *) tm->layerinfo[i].name; static char lockedchar[3] = { 'U', 'P', 'L' }; int locked = tm->layerinfo[i].locked; int disabled = (tm->solo_layer >= 0 && tm->solo_layer != i); if (i-tm->layer_scroll >= 0 && i-tm->layer_scroll < num_rows) { if (str == NULL) sprintf(str=text, "%2d", i+1); if (stbte__button(STBTE__clayer_button, str, x0,y,(i+1<10)*2,xoff-2, STBTE__ID(STBTE__layer,i), tm->cur_layer==i,0)) tm->cur_layer = (tm->cur_layer == i ? -1 : i); if (stbte__layerbutton(x0+xoff + 0,y+1,'H',STBTE__ID(STBTE__hide,i), tm->layerinfo[i].hidden,disabled,STBTE__clayer_hide)) tm->layerinfo[i].hidden = !tm->layerinfo[i].hidden; if (stbte__layerbutton(x0+xoff + 12,y+1,lockedchar[locked],STBTE__ID(STBTE__lock,i), locked!=0,disabled,STBTE__clayer_lock)) tm->layerinfo[i].locked = (locked+1)%3; if (stbte__layerbutton(x0+xoff + 24,y+1,'S',STBTE__ID(STBTE__solo,i), tm->solo_layer==i,0,STBTE__clayer_solo)) tm->solo_layer = (tm->solo_layer == i ? -1 : i); y += 15; } } stbte__scrollbar(x1-4, y0,y-2, &tm->layer_scroll, 0, tm->num_layers, num_rows, STBTE__ID(STBTE__scrollbar_id, STBTE__layer)); #ifndef STBTE_NO_PROPS n = stbte__text_width("prop:")+2; stbte__draw_text(x0,y+2, "prop:", w, STBTE__TEXTCOLOR(STBTE__cpanel)); i = w - n - 4; if (i > 50) i = 50; if (stbte__button(STBTE__clayer_button, propmodes[tm->propmode], x0+n,y,0,i, STBTE__ID(STBTE__layer,256), 0,0)) tm->propmode = (tm->propmode+1)%3; #endif } static void stbte__categories(stbte_tilemap *tm, int x0, int y0, int w, int h) { int s=11, x,y, i; int num_rows = h / s; w -= 4; x = x0+2; y = y0+4; if (tm->category_scroll == 0) { if (stbte__category_button("*ALL*", x,y, w, STBTE__ID(STBTE__categories, 65535), tm->cur_category == -1)) { stbte__choose_category(tm, -1); } y += s; } for (i=0; i < tm->num_categories; ++i) { if (i+1 - tm->category_scroll >= 0 && i+1 - tm->category_scroll < num_rows) { if (y + 10 > y0+h) return; if (stbte__category_button(tm->categories[i], x,y,w, STBTE__ID(STBTE__categories,i), tm->cur_category == i)) stbte__choose_category(tm, i); y += s; } } stbte__scrollbar(x0+w, y0+4, y0+h-4, &tm->category_scroll, 0, tm->num_categories+1, num_rows, STBTE__ID(STBTE__scrollbar_id, STBTE__categories)); } static void stbte__tile_in_palette(stbte_tilemap *tm, int x, int y, int slot) { stbte__tileinfo *t = &tm->tiles[slot]; int x0=x, y0=y, x1 = x+tm->palette_spacing_x - 1, y1 = y+tm->palette_spacing_y; int id = STBTE__ID(STBTE__palette, slot); int over = stbte__hittest(x0,y0,x1,y1, id); switch (stbte__ui.event) { case STBTE__paint: stbte__draw_rect(x,y,x+tm->palette_spacing_x-1,y+tm->palette_spacing_x-1, STBTE_COLOR_TILEPALETTE_BACKGROUND); STBTE_DRAW_TILE(x,y,t->id, slot == tm->cur_tile,0); if (slot == tm->cur_tile) stbte__draw_frame_delayed(x-1,y-1,x+tm->palette_spacing_x,y+tm->palette_spacing_y, STBTE_COLOR_TILEPALETTE_OUTLINE); break; default: if (stbte__button_core(id)) tm->cur_tile = slot; break; } } static void stbte__palette_of_tiles(stbte_tilemap *tm, int x0, int y0, int w, int h) { int i,x,y; int num_vis_rows = (h-6) / tm->palette_spacing_y; int num_columns = (w-2-6) / tm->palette_spacing_x; int num_total_rows; int column,row; int x1 = x0+w, y1=y0+h; x = x0+2; y = y0+6; if (num_columns == 0) return; num_total_rows = (tm->cur_palette_count + num_columns-1) / num_columns; // ceil() column = 0; row = -tm->palette_scroll; for (i=0; i < tm->num_tiles; ++i) { stbte__tileinfo *t = &tm->tiles[i]; // filter based on category if (tm->cur_category >= 0 && t->category_id != tm->cur_category) continue; // display it if (row >= 0 && row < num_vis_rows) { x = x0 + 2 + tm->palette_spacing_x * column; y = y0 + 6 + tm->palette_spacing_y * row; stbte__tile_in_palette(tm,x,y,i); } ++column; if (column == num_columns) { column = 0; ++row; } } stbte__flush_delay(); stbte__scrollbar(x1-4, y0+6, y1-2, &tm->palette_scroll, 0, num_total_rows, num_vis_rows, STBTE__ID(STBTE__scrollbar_id, STBTE__palette)); } static float stbte__linear_remap(float n, float x0, float x1, float y0, float y1) { return (n-x0)/(x1-x0)*(y1-y0) + y0; } static float stbte__saved; static void stbte__props_panel(stbte_tilemap *tm, int x0, int y0, int w, int h) { int x1 = x0+w, y1 = y0+h; int i; int y = y0 + 5, x = x0+2; int slider_width = 60; int mx,my; float *p; short *data; if (!stbte__is_single_selection()) return; mx = stbte__ui.select_x0; my = stbte__ui.select_y0; p = tm->props[my][mx]; data = tm->data[my][mx]; for (i=0; i < STBTE_MAX_PROPERTIES; ++i) { unsigned int n = STBTE_PROP_TYPE(i, data, p); if (n) { char *s = STBTE_PROP_NAME(i, data, p); if (s == NULL) s = ""; switch (n & 3) { case STBTE_PROP_bool: { int flag = (int) p[i]; if (stbte__layerbutton(x,y, flag ? 'x' : ' ', STBTE__ID(STBTE__prop_flag,i), flag, 0, 2)) { stbte__begin_undo(tm); stbte__undo_record_prop_float(tm,mx,my,i,(float) flag); p[i] = (float) !flag; stbte__end_undo(tm); } stbte__draw_text(x+13,y+1,s,x1-(x+13)-2,STBTE__TEXTCOLOR(STBTE__cpanel)); y += 13; break; } case STBTE_PROP_int: { int a = (int) STBTE_PROP_MIN(i,data,p); int b = (int) STBTE_PROP_MAX(i,data,p); int v = (int) p[i] - a; if (a+v != p[i] || v < 0 || v > b-a) { if (v < 0) v = 0; if (v > b-a) v = b-a; p[i] = (float) (a+v); // @TODO undo } switch (stbte__slider(x, slider_width, y+7, b-a, &v, STBTE__ID(STBTE__prop_int,i))) { case STBTE__begin: stbte__saved = p[i]; // fallthrough case STBTE__change: p[i] = (float) (a+v); // @TODO undo break; case STBTE__end: if (p[i] != stbte__saved) { stbte__begin_undo(tm); stbte__undo_record_prop_float(tm,mx,my,i,stbte__saved); stbte__end_undo(tm); } break; } stbte__draw_text(x+slider_width+2,y+2, s, x1-1-(x+slider_width+2), STBTE__TEXTCOLOR(STBTE__cpanel)); y += 12; break; } case STBTE_PROP_float: { float a = (float) STBTE_PROP_MIN(i, data,p); float b = (float) STBTE_PROP_MAX(i, data,p); float c = STBTE_PROP_FLOAT_SCALE(i, data, p); float old; if (p[i] < a || p[i] > b) { // @TODO undo if (p[i] < a) p[i] = a; if (p[i] > b) p[i] = b; } old = p[i]; switch (stbte__float_control(x, y, 50, a, b, c, "%8.4f", &p[i], STBTE__layer,STBTE__ID(STBTE__prop_float,i))) { case STBTE__begin: stbte__saved = old; break; case STBTE__end: if (stbte__saved != p[i]) { stbte__begin_undo(tm); stbte__undo_record_prop_float(tm,mx,my,i, stbte__saved); stbte__end_undo(tm); } break; } stbte__draw_text(x+53,y+1, s, x1-1-(x+53), STBTE__TEXTCOLOR(STBTE__cpanel)); y += 12; break; } } } } } static int stbte__cp_mode, stbte__cp_aspect, stbte__cp_state, stbte__cp_index, stbte__save, stbte__cp_altered, stbte__color_copy; #ifdef STBTE__COLORPICKER static void stbte__dump_colorstate(void) { int i,j,k; printf("static int stbte__color_table[STBTE__num_color_modes][STBTE__num_color_aspects][STBTE__num_color_states] =\n"); printf("{\n"); printf(" {\n"); for (k=0; k < STBTE__num_color_modes; ++k) { for (j=0; j < STBTE__num_color_aspects; ++j) { printf(" { "); for (i=0; i < STBTE__num_color_states; ++i) { printf("0x%06x, ", stbte__color_table[k][j][i]); } printf("},\n"); } if (k+1 < STBTE__num_color_modes) printf(" }, {\n"); else printf(" },\n"); } printf("};\n"); } static void stbte__colorpicker(int x0, int y0, int w, int h) { int x1 = x0+w, y1 = y0+h, x,y, i; x = x0+2; y = y0+6; y += 5; x += 8; { int color = stbte__color_table[stbte__cp_mode][stbte__cp_aspect][stbte__cp_index]; int rgb[3]; if (stbte__cp_altered && stbte__cp_index == STBTE__idle) color = stbte__save; if (stbte__minibutton(STBTE__cmapsize, x1-20,y+ 5, 'C', STBTE__ID2(STBTE__colorpick_id,4,0))) stbte__color_copy = color; if (stbte__minibutton(STBTE__cmapsize, x1-20,y+15, 'P', STBTE__ID2(STBTE__colorpick_id,4,1))) color = stbte__color_copy; rgb[0] = color >> 16; rgb[1] = (color>>8)&255; rgb[2] = color & 255; for (i=0; i < 3; ++i) { if (stbte__slider(x+8,64, y, 255, rgb+i, STBTE__ID2(STBTE__colorpick_id,3,i)) > 0) stbte__dump_colorstate(); y += 15; } if (stbte__ui.event != STBTE__paint && stbte__ui.event != STBTE__tick) stbte__color_table[stbte__cp_mode][stbte__cp_aspect][stbte__cp_index] = (rgb[0]<<16)|(rgb[1]<<8)|(rgb[2]); } y += 5; // states x = x0+2+35; if (stbte__ui.event == STBTE__paint) { static char *states[] = { "idle", "over", "down", "down&over", "selected", "selected&over", "disabled" }; stbte__draw_text(x, y+1, states[stbte__cp_index], x1-x-1, 0xffffff); } x = x0+24; y += 12; for (i=3; i >= 0; --i) { int state = 0 != (stbte__cp_state & (1 << i)); if (stbte__layerbutton(x,y, "OASD"[i], STBTE__ID2(STBTE__colorpick_id, 0,i), state,0, STBTE__clayer_button)) { stbte__cp_state ^= (1 << i); stbte__cp_index = stbte__state_to_index[0][0][0][stbte__cp_state]; } x += 16; } x = x0+2; y += 18; for (i=0; i < 3; ++i) { static char *labels[] = { "Base", "Edge", "Text" }; if (stbte__button(STBTE__ctoolbar_button, labels[i], x,y,0,36, STBTE__ID2(STBTE__colorpick_id,1,i), stbte__cp_aspect==i,0)) stbte__cp_aspect = i; x += 40; } y += 18; x = x0+2; for (i=0; i < STBTE__num_color_modes; ++i) { if (stbte__button(STBTE__ctoolbar_button, stbte__color_names[i], x, y, 0,80, STBTE__ID2(STBTE__colorpick_id,2,i), stbte__cp_mode == i,0)) stbte__cp_mode = i; y += 12; } // make the currently selected aspect flash, unless we're actively dragging color slider etc if (stbte__ui.event == STBTE__tick) { stbte__save = stbte__color_table[stbte__cp_mode][stbte__cp_aspect][STBTE__idle]; if ((stbte__ui.active_id & 127) != STBTE__colorpick_id) { if ((stbte__ui.ms_time & 2047) < 200) { stbte__color_table[stbte__cp_mode][stbte__cp_aspect][STBTE__idle] ^= 0x1f1f1f; stbte__cp_altered = 1; } } } } #endif static void stbte__editor_traverse(stbte_tilemap *tm) { int i,j,i0,j0,i1,j1,n; if (tm == NULL) return; if (stbte__ui.x0 == stbte__ui.x1 || stbte__ui.y0 == stbte__ui.y1) return; stbte__prepare_tileinfo(tm); stbte__compute_panel_locations(tm); // @OPTIMIZE: we don't need to recompute this every time if (stbte__ui.event == STBTE__paint) { // fill screen with border stbte__draw_rect(stbte__ui.x0, stbte__ui.y0, stbte__ui.x1, stbte__ui.y1, STBTE_COLOR_TILEMAP_BORDER); // fill tilemap with tilemap background stbte__draw_rect(stbte__ui.x0 - tm->scroll_x, stbte__ui.y0 - tm->scroll_y, stbte__ui.x0 - tm->scroll_x + tm->spacing_x * tm->max_x, stbte__ui.y0 - tm->scroll_y + tm->spacing_y * tm->max_y, STBTE_COLOR_TILEMAP_BACKGROUND); } // step 1: traverse all the tilemap data... i0 = (tm->scroll_x - tm->spacing_x) / tm->spacing_x; j0 = (tm->scroll_y - tm->spacing_y) / tm->spacing_y; i1 = (tm->scroll_x + stbte__ui.x1 - stbte__ui.x0) / tm->spacing_x + 1; j1 = (tm->scroll_y + stbte__ui.y1 - stbte__ui.y0) / tm->spacing_y + 1; if (i0 < 0) i0 = 0; if (j0 < 0) j0 = 0; if (i1 > tm->max_x) i1 = tm->max_x; if (j1 > tm->max_y) j1 = tm->max_y; if (stbte__ui.event == STBTE__paint) { // draw all of layer 0, then all of layer 1, etc, instead of old // way which drew entire stack of each tile at once for (n=0; n < tm->num_layers; ++n) { for (j=j0; j < j1; ++j) { for (i=i0; i < i1; ++i) { int x = stbte__ui.x0 + i * tm->spacing_x - tm->scroll_x; int y = stbte__ui.y0 + j * tm->spacing_y - tm->scroll_y; stbte__tile_paint(tm, x, y, i, j, n); } } if (n == 0 && stbte__ui.show_grid == 1) { int x = stbte__ui.x0 + i0 * tm->spacing_x - tm->scroll_x; int y = stbte__ui.y0 + j0 * tm->spacing_y - tm->scroll_y; for (i=0; x < stbte__ui.x1 && i <= i1; ++i, x += tm->spacing_x) stbte__draw_rect(x, stbte__ui.y0, x+1, stbte__ui.y1, STBTE_COLOR_GRID); for (j=0; y < stbte__ui.y1 && j <= j1; ++j, y += tm->spacing_y) stbte__draw_rect(stbte__ui.x0, y, stbte__ui.x1, y+1, STBTE_COLOR_GRID); } } } if (stbte__ui.event == STBTE__paint) { // draw grid on top of everything except UI if (stbte__ui.show_grid == 2) { int x = stbte__ui.x0 + i0 * tm->spacing_x - tm->scroll_x; int y = stbte__ui.y0 + j0 * tm->spacing_y - tm->scroll_y; for (i=0; x < stbte__ui.x1 && i <= i1; ++i, x += tm->spacing_x) stbte__draw_rect(x, stbte__ui.y0, x+1, stbte__ui.y1, STBTE_COLOR_GRID); for (j=0; y < stbte__ui.y1 && j <= j1; ++j, y += tm->spacing_y) stbte__draw_rect(stbte__ui.x0, y, stbte__ui.x1, y+1, STBTE_COLOR_GRID); } } for (j=j0; j < j1; ++j) { for (i=i0; i < i1; ++i) { int x = stbte__ui.x0 + i * tm->spacing_x - tm->scroll_x; int y = stbte__ui.y0 + j * tm->spacing_y - tm->scroll_y; stbte__tile(tm, x, y, i, j); } } if (stbte__ui.event == STBTE__paint) { // draw the selection border if (stbte__ui.has_selection) { int x0,y0,x1,y1; x0 = stbte__ui.x0 + (stbte__ui.select_x0 ) * tm->spacing_x - tm->scroll_x; y0 = stbte__ui.y0 + (stbte__ui.select_y0 ) * tm->spacing_y - tm->scroll_y; x1 = stbte__ui.x0 + (stbte__ui.select_x1 + 1) * tm->spacing_x - tm->scroll_x + 1; y1 = stbte__ui.y0 + (stbte__ui.select_y1 + 1) * tm->spacing_y - tm->scroll_y + 1; stbte__draw_frame(x0,y0,x1,y1, (stbte__ui.ms_time & 256 ? STBTE_COLOR_SELECTION_OUTLINE1 : STBTE_COLOR_SELECTION_OUTLINE2)); } stbte__flush_delay(); // draw a dynamic link on top of the queued links #ifdef STBTE_ALLOW_LINK if (stbte__ui.linking && STBTE__IS_MAP_HOT()) { int x0,y0,x1,y1; int color; int ex = ((stbte__ui.hot_id >> 19) & 4095); int ey = ((stbte__ui.hot_id >> 7) & 4095); x0 = stbte__ui.x0 + (stbte__ui.sx ) * tm->spacing_x - tm->scroll_x + (tm->spacing_x>>1)+1; y0 = stbte__ui.y0 + (stbte__ui.sy ) * tm->spacing_y - tm->scroll_y + (tm->spacing_y>>1)+1; x1 = stbte__ui.x0 + (ex ) * tm->spacing_x - tm->scroll_x + (tm->spacing_x>>1)-1; y1 = stbte__ui.y0 + (ey ) * tm->spacing_y - tm->scroll_y + (tm->spacing_y>>1)-1; if (STBTE_ALLOW_LINK(tm->data[stbte__ui.sy][stbte__ui.sx], tm->props[stbte__ui.sy][stbte__ui.sx], tm->data[ey][ex], tm->props[ey][ex])) color = STBTE_LINK_COLOR_DRAWING; else color = STBTE_LINK_COLOR_DISALLOWED; stbte__draw_link(x0,y0,x1,y1, color); } #endif } stbte__flush_delay(); // step 2: traverse the panels for (i=0; i < STBTE__num_panel; ++i) { stbte__panel *p = &stbte__ui.panel[i]; if (stbte__ui.event == STBTE__paint) { stbte__draw_box(p->x0,p->y0,p->x0+p->width,p->y0+p->height, STBTE__cpanel, STBTE__idle); } // obscure tilemap data underneath panel stbte__hittest(p->x0,p->y0,p->x0+p->width,p->y0+p->height, STBTE__ID2(STBTE__panel, i, 0)); switch (i) { case STBTE__panel_toolbar: if (stbte__ui.event == STBTE__paint) stbte__draw_rect(p->x0,p->y0,p->x0+p->width,p->y0+p->height, stbte__color_table[STBTE__ctoolbar][STBTE__base][STBTE__idle]); stbte__toolbar(tm,p->x0,p->y0,p->width,p->height); break; case STBTE__panel_info: stbte__info(tm,p->x0,p->y0,p->width,p->height); break; case STBTE__panel_layers: stbte__layers(tm,p->x0,p->y0,p->width,p->height); break; case STBTE__panel_categories: stbte__categories(tm,p->x0,p->y0,p->width,p->height); break; case STBTE__panel_colorpick: #ifdef STBTE__COLORPICKER stbte__colorpicker(p->x0,p->y0,p->width,p->height); #endif break; case STBTE__panel_tiles: // erase boundary between categories and tiles if they're on same side if (stbte__ui.event == STBTE__paint && p->side == stbte__ui.panel[STBTE__panel_categories].side) stbte__draw_rect(p->x0+1,p->y0-1,p->x0+p->width-1,p->y0+1, stbte__color_table[STBTE__cpanel][STBTE__base][STBTE__idle]); stbte__palette_of_tiles(tm,p->x0,p->y0,p->width,p->height); break; case STBTE__panel_props: stbte__props_panel(tm,p->x0,p->y0,p->width,p->height); break; } // draw the panel side selectors for (j=0; j < 2; ++j) { int result; if (i == STBTE__panel_toolbar) continue; result = stbte__microbutton(p->x0+p->width - 1 - 2*4 + 4*j,p->y0+2,3, STBTE__ID2(STBTE__panel, i, j+1), STBTE__cpanel_sider+j); if (result) { switch (j) { case 0: p->side = result > 0 ? STBTE__side_left : STBTE__side_right; break; case 1: p->delta_height += result; break; } } } } if (stbte__ui.panel[STBTE__panel_categories].delta_height < -5) stbte__ui.panel[STBTE__panel_categories].delta_height = -5; if (stbte__ui.panel[STBTE__panel_layers ].delta_height < -5) stbte__ui.panel[STBTE__panel_layers ].delta_height = -5; // step 3: traverse the regions to place expander controls on them for (i=0; i < 2; ++i) { if (stbte__region[i].active) { int x = stbte__region[i].x; int width; if (i == STBTE__side_left) width = stbte__ui.left_width , x += stbte__region[i].width + 1; else width = -stbte__ui.right_width, x -= 6; if (stbte__microbutton_dragger(x, stbte__region[i].y+2, 5, STBTE__ID(STBTE__region,i), &width)) { // if non-0, it is expanding, so retract it if (stbte__region[i].retracted == 0.0) stbte__region[i].retracted = 0.01f; else stbte__region[i].retracted = 0.0; } if (i == STBTE__side_left) stbte__ui.left_width = width; else stbte__ui.right_width = -width; if (stbte__ui.event == STBTE__tick) { if (stbte__region[i].retracted && stbte__region[i].retracted < 1.0f) { stbte__region[i].retracted += stbte__ui.dt*4; if (stbte__region[i].retracted > 1) stbte__region[i].retracted = 1; } } } } if (stbte__ui.event == STBTE__paint && stbte__ui.alert_msg) { int w = stbte__text_width(stbte__ui.alert_msg); int x = (stbte__ui.x0+stbte__ui.x1)/2; int y = (stbte__ui.y0+stbte__ui.y1)*5/6; stbte__draw_rect (x-w/2-4,y-8, x+w/2+4,y+8, 0x604020); stbte__draw_frame(x-w/2-4,y-8, x+w/2+4,y+8, 0x906030); stbte__draw_text (x-w/2,y-4, stbte__ui.alert_msg, w+1, 0xff8040); } #ifdef STBTE_SHOW_CURSOR if (stbte__ui.event == STBTE__paint) stbte__draw_bitmap(stbte__ui.mx, stbte__ui.my, stbte__get_char_width(26), stbte__get_char_bitmap(26), 0xe0e0e0); #endif if (stbte__ui.event == STBTE__tick && stbte__ui.alert_msg) { stbte__ui.alert_timer -= stbte__ui.dt; if (stbte__ui.alert_timer < 0) { stbte__ui.alert_timer = 0; stbte__ui.alert_msg = 0; } } if (stbte__ui.event == STBTE__paint) { stbte__color_table[stbte__cp_mode][stbte__cp_aspect][STBTE__idle] = stbte__save; stbte__cp_altered = 0; } } static void stbte__do_event(stbte_tilemap *tm) { stbte__ui.next_hot_id = 0; stbte__editor_traverse(tm); stbte__ui.hot_id = stbte__ui.next_hot_id; // automatically cancel on mouse-up in case the object that triggered it // doesn't exist anymore if (stbte__ui.active_id) { if (stbte__ui.event == STBTE__leftup || stbte__ui.event == STBTE__rightup) { if (!stbte__ui.pasting) { stbte__activate(0); if (stbte__ui.undoing) stbte__end_undo(tm); stbte__ui.scrolling = 0; stbte__ui.dragging = 0; stbte__ui.linking = 0; } } } // we could do this stuff in the widgets directly, but it would keep recomputing // the same thing on every tile, which seems dumb. if (stbte__ui.pasting) { if (STBTE__IS_MAP_HOT()) { // compute pasting location based on last hot stbte__ui.paste_x = ((stbte__ui.hot_id >> 19) & 4095) - (stbte__ui.copy_width >> 1); stbte__ui.paste_y = ((stbte__ui.hot_id >> 7) & 4095) - (stbte__ui.copy_height >> 1); } } if (stbte__ui.dragging) { if (STBTE__IS_MAP_HOT()) { stbte__ui.drag_dest_x = ((stbte__ui.hot_id >> 19) & 4095) - stbte__ui.drag_offx; stbte__ui.drag_dest_y = ((stbte__ui.hot_id >> 7) & 4095) - stbte__ui.drag_offy; } } } static void stbte__set_event(int event, int x, int y) { stbte__ui.event = event; stbte__ui.mx = x; stbte__ui.my = y; stbte__ui.dx = x - stbte__ui.last_mouse_x; stbte__ui.dy = y - stbte__ui.last_mouse_y; stbte__ui.last_mouse_x = x; stbte__ui.last_mouse_y = y; stbte__ui.accum_x += stbte__ui.dx; stbte__ui.accum_y += stbte__ui.dy; } void stbte_draw(stbte_tilemap *tm) { stbte__ui.event = STBTE__paint; stbte__editor_traverse(tm); } void stbte_mouse_move(stbte_tilemap *tm, int x, int y, int shifted, int scrollkey) { stbte__set_event(STBTE__mousemove, x,y); stbte__ui.shift = shifted; stbte__ui.scrollkey = scrollkey; stbte__do_event(tm); } void stbte_mouse_button(stbte_tilemap *tm, int x, int y, int right, int down, int shifted, int scrollkey) { static int events[2][2] = { { STBTE__leftup , STBTE__leftdown }, { STBTE__rightup, STBTE__rightdown } }; stbte__set_event(events[right][down], x,y); stbte__ui.shift = shifted; stbte__ui.scrollkey = scrollkey; stbte__do_event(tm); } void stbte_mouse_wheel(stbte_tilemap *tm, int x, int y, int vscroll) { // not implemented yet -- need different way of hittesting } void stbte_action(stbte_tilemap *tm, enum stbte_action act) { switch (act) { case STBTE_tool_select: stbte__ui.tool = STBTE__tool_select; break; case STBTE_tool_brush: stbte__ui.tool = STBTE__tool_brush; break; case STBTE_tool_erase: stbte__ui.tool = STBTE__tool_erase; break; case STBTE_tool_rectangle: stbte__ui.tool = STBTE__tool_rect; break; case STBTE_tool_eyedropper: stbte__ui.tool = STBTE__tool_eyedrop; break; case STBTE_tool_link: stbte__ui.tool = STBTE__tool_link; break; case STBTE_act_toggle_grid: stbte__ui.show_grid = (stbte__ui.show_grid+1) % 3; break; case STBTE_act_toggle_links: stbte__ui.show_links ^= 1; break; case STBTE_act_undo: stbte__undo(tm); break; case STBTE_act_redo: stbte__redo(tm); break; case STBTE_act_cut: stbte__copy_cut(tm, 1); break; case STBTE_act_copy: stbte__copy_cut(tm, 0); break; case STBTE_act_paste: stbte__start_paste(tm); break; case STBTE_scroll_left: tm->scroll_x -= tm->spacing_x; break; case STBTE_scroll_right: tm->scroll_x += tm->spacing_x; break; case STBTE_scroll_up: tm->scroll_y -= tm->spacing_y; break; case STBTE_scroll_down: tm->scroll_y += tm->spacing_y; break; } } void stbte_tick(stbte_tilemap *tm, float dt) { stbte__ui.event = STBTE__tick; stbte__ui.dt = dt; stbte__do_event(tm); stbte__ui.ms_time += (int) (dt * 1024) + 1; // make sure if time is superfast it always updates a little } void stbte_mouse_sdl(stbte_tilemap *tm, const void *sdl_event, float xs, float ys, int xo, int yo) { #ifdef _SDL_H SDL_Event *event = (SDL_Event *) sdl_event; SDL_Keymod km = SDL_GetModState(); int shift = (km & KMOD_LCTRL) || (km & KMOD_RCTRL); int scrollkey = 0 != SDL_GetKeyboardState(NULL)[SDL_SCANCODE_SPACE]; switch (event->type) { case SDL_MOUSEMOTION: stbte_mouse_move(tm, (int) (xs*event->motion.x+xo), (int) (ys*event->motion.y+yo), shift, scrollkey); break; case SDL_MOUSEBUTTONUP: stbte_mouse_button(tm, (int) (xs*event->button.x+xo), (int) (ys*event->button.y+yo), event->button.button != SDL_BUTTON_LEFT, 0, shift, scrollkey); break; case SDL_MOUSEBUTTONDOWN: stbte_mouse_button(tm, (int) (xs*event->button.x+xo), (int) (ys*event->button.y+yo), event->button.button != SDL_BUTTON_LEFT, 1, shift, scrollkey); break; case SDL_MOUSEWHEEL: stbte_mouse_wheel(tm, stbte__ui.mx, stbte__ui.my, event->wheel.y); break; } #else STBTE__NOTUSED(tm); STBTE__NOTUSED(sdl_event); STBTE__NOTUSED(xs); STBTE__NOTUSED(ys); STBTE__NOTUSED(xo); STBTE__NOTUSED(yo); #endif } #endif // STB_TILEMAP_EDITOR_IMPLEMENTATION /* ------------------------------------------------------------------------------ This software is available under 2 licenses -- choose whichever you prefer. ------------------------------------------------------------------------------ ALTERNATIVE A - MIT License Copyright (c) 2017 Sean Barrett 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. ------------------------------------------------------------------------------ ALTERNATIVE B - Public Domain (www.unlicense.org) This is free and unencumbered software released into the public domain. Anyone is free to copy, modify, publish, use, compile, sell, or distribute this software, either in source code form or as a compiled binary, for any purpose, commercial or non-commercial, and by any means. In jurisdictions that recognize copyright laws, the author or authors of this software dedicate any and all copyright interest in the software to the public domain. We make this dedication for the benefit of the public at large and to the detriment of our heirs and successors. We intend this dedication to be an overt act of relinquishment in perpetuity of all present and future rights to this software under copyright law. 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 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. ------------------------------------------------------------------------------ */ uTox/third_party/stb/stb/stb_textedit.h0000600000175000001440000014603114003056224017266 0ustar rakusers// stb_textedit.h - v1.11 - public domain - Sean Barrett // Development of this library was sponsored by RAD Game Tools // // This C header file implements the guts of a multi-line text-editing // widget; you implement display, word-wrapping, and low-level string // insertion/deletion, and stb_textedit will map user inputs into // insertions & deletions, plus updates to the cursor position, // selection state, and undo state. // // It is intended for use in games and other systems that need to build // their own custom widgets and which do not have heavy text-editing // requirements (this library is not recommended for use for editing large // texts, as its performance does not scale and it has limited undo). // // Non-trivial behaviors are modelled after Windows text controls. // // // LICENSE // // See end of file for license information. // // // DEPENDENCIES // // Uses the C runtime function 'memmove', which you can override // by defining STB_TEXTEDIT_memmove before the implementation. // Uses no other functions. Performs no runtime allocations. // // // VERSION HISTORY // // 1.11 (2017-03-03) fix HOME on last line, dragging off single-line textfield // 1.10 (2016-10-25) supress warnings about casting away const with -Wcast-qual // 1.9 (2016-08-27) customizable move-by-word // 1.8 (2016-04-02) better keyboard handling when mouse button is down // 1.7 (2015-09-13) change y range handling in case baseline is non-0 // 1.6 (2015-04-15) allow STB_TEXTEDIT_memmove // 1.5 (2014-09-10) add support for secondary keys for OS X // 1.4 (2014-08-17) fix signed/unsigned warnings // 1.3 (2014-06-19) fix mouse clicking to round to nearest char boundary // 1.2 (2014-05-27) fix some RAD types that had crept into the new code // 1.1 (2013-12-15) move-by-word (requires STB_TEXTEDIT_IS_SPACE ) // 1.0 (2012-07-26) improve documentation, initial public release // 0.3 (2012-02-24) bugfixes, single-line mode; insert mode // 0.2 (2011-11-28) fixes to undo/redo // 0.1 (2010-07-08) initial version // // ADDITIONAL CONTRIBUTORS // // Ulf Winklemann: move-by-word in 1.1 // Fabian Giesen: secondary key inputs in 1.5 // Martins Mozeiko: STB_TEXTEDIT_memmove in 1.6 // // Bugfixes: // Scott Graham // Daniel Keller // Omar Cornut // Dan Thompson // // USAGE // // This file behaves differently depending on what symbols you define // before including it. // // // Header-file mode: // // If you do not define STB_TEXTEDIT_IMPLEMENTATION before including this, // it will operate in "header file" mode. In this mode, it declares a // single public symbol, STB_TexteditState, which encapsulates the current // state of a text widget (except for the string, which you will store // separately). // // To compile in this mode, you must define STB_TEXTEDIT_CHARTYPE to a // primitive type that defines a single character (e.g. char, wchar_t, etc). // // To save space or increase undo-ability, you can optionally define the // following things that are used by the undo system: // // STB_TEXTEDIT_POSITIONTYPE small int type encoding a valid cursor position // STB_TEXTEDIT_UNDOSTATECOUNT the number of undo states to allow // STB_TEXTEDIT_UNDOCHARCOUNT the number of characters to store in the undo buffer // // If you don't define these, they are set to permissive types and // moderate sizes. The undo system does no memory allocations, so // it grows STB_TexteditState by the worst-case storage which is (in bytes): // // [4 + sizeof(STB_TEXTEDIT_POSITIONTYPE)] * STB_TEXTEDIT_UNDOSTATE_COUNT // + sizeof(STB_TEXTEDIT_CHARTYPE) * STB_TEXTEDIT_UNDOCHAR_COUNT // // // Implementation mode: // // If you define STB_TEXTEDIT_IMPLEMENTATION before including this, it // will compile the implementation of the text edit widget, depending // on a large number of symbols which must be defined before the include. // // The implementation is defined only as static functions. You will then // need to provide your own APIs in the same file which will access the // static functions. // // The basic concept is that you provide a "string" object which // behaves like an array of characters. stb_textedit uses indices to // refer to positions in the string, implicitly representing positions // in the displayed textedit. This is true for both plain text and // rich text; even with rich text stb_truetype interacts with your // code as if there was an array of all the displayed characters. // // Symbols that must be the same in header-file and implementation mode: // // STB_TEXTEDIT_CHARTYPE the character type // STB_TEXTEDIT_POSITIONTYPE small type that a valid cursor position // STB_TEXTEDIT_UNDOSTATECOUNT the number of undo states to allow // STB_TEXTEDIT_UNDOCHARCOUNT the number of characters to store in the undo buffer // // Symbols you must define for implementation mode: // // STB_TEXTEDIT_STRING the type of object representing a string being edited, // typically this is a wrapper object with other data you need // // STB_TEXTEDIT_STRINGLEN(obj) the length of the string (ideally O(1)) // STB_TEXTEDIT_LAYOUTROW(&r,obj,n) returns the results of laying out a line of characters // starting from character #n (see discussion below) // STB_TEXTEDIT_GETWIDTH(obj,n,i) returns the pixel delta from the xpos of the i'th character // to the xpos of the i+1'th char for a line of characters // starting at character #n (i.e. accounts for kerning // with previous char) // STB_TEXTEDIT_KEYTOTEXT(k) maps a keyboard input to an insertable character // (return type is int, -1 means not valid to insert) // STB_TEXTEDIT_GETCHAR(obj,i) returns the i'th character of obj, 0-based // STB_TEXTEDIT_NEWLINE the character returned by _GETCHAR() we recognize // as manually wordwrapping for end-of-line positioning // // STB_TEXTEDIT_DELETECHARS(obj,i,n) delete n characters starting at i // STB_TEXTEDIT_INSERTCHARS(obj,i,c*,n) insert n characters at i (pointed to by STB_TEXTEDIT_CHARTYPE*) // // STB_TEXTEDIT_K_SHIFT a power of two that is or'd in to a keyboard input to represent the shift key // // STB_TEXTEDIT_K_LEFT keyboard input to move cursor left // STB_TEXTEDIT_K_RIGHT keyboard input to move cursor right // STB_TEXTEDIT_K_UP keyboard input to move cursor up // STB_TEXTEDIT_K_DOWN keyboard input to move cursor down // STB_TEXTEDIT_K_LINESTART keyboard input to move cursor to start of line // e.g. HOME // STB_TEXTEDIT_K_LINEEND keyboard input to move cursor to end of line // e.g. END // STB_TEXTEDIT_K_TEXTSTART keyboard input to move cursor to start of text // e.g. ctrl-HOME // STB_TEXTEDIT_K_TEXTEND keyboard input to move cursor to end of text // e.g. ctrl-END // STB_TEXTEDIT_K_DELETE keyboard input to delete selection or character under cursor // STB_TEXTEDIT_K_BACKSPACE keyboard input to delete selection or character left of cursor // STB_TEXTEDIT_K_UNDO keyboard input to perform undo // STB_TEXTEDIT_K_REDO keyboard input to perform redo // // Optional: // STB_TEXTEDIT_K_INSERT keyboard input to toggle insert mode // STB_TEXTEDIT_IS_SPACE(ch) true if character is whitespace (e.g. 'isspace'), // required for default WORDLEFT/WORDRIGHT handlers // STB_TEXTEDIT_MOVEWORDLEFT(obj,i) custom handler for WORDLEFT, returns index to move cursor to // STB_TEXTEDIT_MOVEWORDRIGHT(obj,i) custom handler for WORDRIGHT, returns index to move cursor to // STB_TEXTEDIT_K_WORDLEFT keyboard input to move cursor left one word // e.g. ctrl-LEFT // STB_TEXTEDIT_K_WORDRIGHT keyboard input to move cursor right one word // e.g. ctrl-RIGHT // STB_TEXTEDIT_K_LINESTART2 secondary keyboard input to move cursor to start of line // STB_TEXTEDIT_K_LINEEND2 secondary keyboard input to move cursor to end of line // STB_TEXTEDIT_K_TEXTSTART2 secondary keyboard input to move cursor to start of text // STB_TEXTEDIT_K_TEXTEND2 secondary keyboard input to move cursor to end of text // // Todo: // STB_TEXTEDIT_K_PGUP keyboard input to move cursor up a page // STB_TEXTEDIT_K_PGDOWN keyboard input to move cursor down a page // // Keyboard input must be encoded as a single integer value; e.g. a character code // and some bitflags that represent shift states. to simplify the interface, SHIFT must // be a bitflag, so we can test the shifted state of cursor movements to allow selection, // i.e. (STB_TEXTED_K_RIGHT|STB_TEXTEDIT_K_SHIFT) should be shifted right-arrow. // // You can encode other things, such as CONTROL or ALT, in additional bits, and // then test for their presence in e.g. STB_TEXTEDIT_K_WORDLEFT. For example, // my Windows implementations add an additional CONTROL bit, and an additional KEYDOWN // bit. Then all of the STB_TEXTEDIT_K_ values bitwise-or in the KEYDOWN bit, // and I pass both WM_KEYDOWN and WM_CHAR events to the "key" function in the // API below. The control keys will only match WM_KEYDOWN events because of the // keydown bit I add, and STB_TEXTEDIT_KEYTOTEXT only tests for the KEYDOWN // bit so it only decodes WM_CHAR events. // // STB_TEXTEDIT_LAYOUTROW returns information about the shape of one displayed // row of characters assuming they start on the i'th character--the width and // the height and the number of characters consumed. This allows this library // to traverse the entire layout incrementally. You need to compute word-wrapping // here. // // Each textfield keeps its own insert mode state, which is not how normal // applications work. To keep an app-wide insert mode, update/copy the // "insert_mode" field of STB_TexteditState before/after calling API functions. // // API // // void stb_textedit_initialize_state(STB_TexteditState *state, int is_single_line) // // void stb_textedit_click(STB_TEXTEDIT_STRING *str, STB_TexteditState *state, float x, float y) // void stb_textedit_drag(STB_TEXTEDIT_STRING *str, STB_TexteditState *state, float x, float y) // int stb_textedit_cut(STB_TEXTEDIT_STRING *str, STB_TexteditState *state) // int stb_textedit_paste(STB_TEXTEDIT_STRING *str, STB_TexteditState *state, STB_TEXTEDIT_CHARTYPE *text, int len) // void stb_textedit_key(STB_TEXTEDIT_STRING *str, STB_TexteditState *state, int key) // // Each of these functions potentially updates the string and updates the // state. // // initialize_state: // set the textedit state to a known good default state when initially // constructing the textedit. // // click: // call this with the mouse x,y on a mouse down; it will update the cursor // and reset the selection start/end to the cursor point. the x,y must // be relative to the text widget, with (0,0) being the top left. // // drag: // call this with the mouse x,y on a mouse drag/up; it will update the // cursor and the selection end point // // cut: // call this to delete the current selection; returns true if there was // one. you should FIRST copy the current selection to the system paste buffer. // (To copy, just copy the current selection out of the string yourself.) // // paste: // call this to paste text at the current cursor point or over the current // selection if there is one. // // key: // call this for keyboard inputs sent to the textfield. you can use it // for "key down" events or for "translated" key events. if you need to // do both (as in Win32), or distinguish Unicode characters from control // inputs, set a high bit to distinguish the two; then you can define the // various definitions like STB_TEXTEDIT_K_LEFT have the is-key-event bit // set, and make STB_TEXTEDIT_KEYTOCHAR check that the is-key-event bit is // clear. // // When rendering, you can read the cursor position and selection state from // the STB_TexteditState. // // // Notes: // // This is designed to be usable in IMGUI, so it allows for the possibility of // running in an IMGUI that has NOT cached the multi-line layout. For this // reason, it provides an interface that is compatible with computing the // layout incrementally--we try to make sure we make as few passes through // as possible. (For example, to locate the mouse pointer in the text, we // could define functions that return the X and Y positions of characters // and binary search Y and then X, but if we're doing dynamic layout this // will run the layout algorithm many times, so instead we manually search // forward in one pass. Similar logic applies to e.g. up-arrow and // down-arrow movement.) // // If it's run in a widget that *has* cached the layout, then this is less // efficient, but it's not horrible on modern computers. But you wouldn't // want to edit million-line files with it. //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //// //// Header-file mode //// //// #ifndef INCLUDE_STB_TEXTEDIT_H #define INCLUDE_STB_TEXTEDIT_H //////////////////////////////////////////////////////////////////////// // // STB_TexteditState // // Definition of STB_TexteditState which you should store // per-textfield; it includes cursor position, selection state, // and undo state. // #ifndef STB_TEXTEDIT_UNDOSTATECOUNT #define STB_TEXTEDIT_UNDOSTATECOUNT 99 #endif #ifndef STB_TEXTEDIT_UNDOCHARCOUNT #define STB_TEXTEDIT_UNDOCHARCOUNT 999 #endif #ifndef STB_TEXTEDIT_CHARTYPE #define STB_TEXTEDIT_CHARTYPE int #endif #ifndef STB_TEXTEDIT_POSITIONTYPE #define STB_TEXTEDIT_POSITIONTYPE int #endif typedef struct { // private data STB_TEXTEDIT_POSITIONTYPE where; short insert_length; short delete_length; short char_storage; } StbUndoRecord; typedef struct { // private data StbUndoRecord undo_rec [STB_TEXTEDIT_UNDOSTATECOUNT]; STB_TEXTEDIT_CHARTYPE undo_char[STB_TEXTEDIT_UNDOCHARCOUNT]; short undo_point, redo_point; short undo_char_point, redo_char_point; } StbUndoState; typedef struct { ///////////////////// // // public data // int cursor; // position of the text cursor within the string int select_start; // selection start point int select_end; // selection start and end point in characters; if equal, no selection. // note that start may be less than or greater than end (e.g. when // dragging the mouse, start is where the initial click was, and you // can drag in either direction) unsigned char insert_mode; // each textfield keeps its own insert mode state. to keep an app-wide // insert mode, copy this value in/out of the app state ///////////////////// // // private data // unsigned char cursor_at_end_of_line; // not implemented yet unsigned char initialized; unsigned char has_preferred_x; unsigned char single_line; unsigned char padding1, padding2, padding3; float preferred_x; // this determines where the cursor up/down tries to seek to along x StbUndoState undostate; } STB_TexteditState; //////////////////////////////////////////////////////////////////////// // // StbTexteditRow // // Result of layout query, used by stb_textedit to determine where // the text in each row is. // result of layout query typedef struct { float x0,x1; // starting x location, end x location (allows for align=right, etc) float baseline_y_delta; // position of baseline relative to previous row's baseline float ymin,ymax; // height of row above and below baseline int num_chars; } StbTexteditRow; #endif //INCLUDE_STB_TEXTEDIT_H //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //// //// Implementation mode //// //// // implementation isn't include-guarded, since it might have indirectly // included just the "header" portion #ifdef STB_TEXTEDIT_IMPLEMENTATION #ifndef STB_TEXTEDIT_memmove #include #define STB_TEXTEDIT_memmove memmove #endif ///////////////////////////////////////////////////////////////////////////// // // Mouse input handling // // traverse the layout to locate the nearest character to a display position static int stb_text_locate_coord(STB_TEXTEDIT_STRING *str, float x, float y) { StbTexteditRow r; int n = STB_TEXTEDIT_STRINGLEN(str); float base_y = 0, prev_x; int i=0, k; r.x0 = r.x1 = 0; r.ymin = r.ymax = 0; r.num_chars = 0; // search rows to find one that straddles 'y' while (i < n) { STB_TEXTEDIT_LAYOUTROW(&r, str, i); if (r.num_chars <= 0) return n; if (i==0 && y < base_y + r.ymin) return 0; if (y < base_y + r.ymax) break; i += r.num_chars; base_y += r.baseline_y_delta; } // below all text, return 'after' last character if (i >= n) return n; // check if it's before the beginning of the line if (x < r.x0) return i; // check if it's before the end of the line if (x < r.x1) { // search characters in row for one that straddles 'x' prev_x = r.x0; for (k=0; k < r.num_chars; ++k) { float w = STB_TEXTEDIT_GETWIDTH(str, i, k); if (x < prev_x+w) { if (x < prev_x+w/2) return k+i; else return k+i+1; } prev_x += w; } // shouldn't happen, but if it does, fall through to end-of-line case } // if the last character is a newline, return that. otherwise return 'after' the last character if (STB_TEXTEDIT_GETCHAR(str, i+r.num_chars-1) == STB_TEXTEDIT_NEWLINE) return i+r.num_chars-1; else return i+r.num_chars; } // API click: on mouse down, move the cursor to the clicked location, and reset the selection static void stb_textedit_click(STB_TEXTEDIT_STRING *str, STB_TexteditState *state, float x, float y) { // In single-line mode, just always make y = 0. This lets the drag keep working if the mouse // goes off the top or bottom of the text if( state->single_line ) { StbTexteditRow r; STB_TEXTEDIT_LAYOUTROW(&r, str, 0); y = r.ymin; } state->cursor = stb_text_locate_coord(str, x, y); state->select_start = state->cursor; state->select_end = state->cursor; state->has_preferred_x = 0; } // API drag: on mouse drag, move the cursor and selection endpoint to the clicked location static void stb_textedit_drag(STB_TEXTEDIT_STRING *str, STB_TexteditState *state, float x, float y) { int p = 0; // In single-line mode, just always make y = 0. This lets the drag keep working if the mouse // goes off the top or bottom of the text if( state->single_line ) { StbTexteditRow r; STB_TEXTEDIT_LAYOUTROW(&r, str, 0); y = r.ymin; } if (state->select_start == state->select_end) state->select_start = state->cursor; p = stb_text_locate_coord(str, x, y); state->cursor = state->select_end = p; } ///////////////////////////////////////////////////////////////////////////// // // Keyboard input handling // // forward declarations static void stb_text_undo(STB_TEXTEDIT_STRING *str, STB_TexteditState *state); static void stb_text_redo(STB_TEXTEDIT_STRING *str, STB_TexteditState *state); static void stb_text_makeundo_delete(STB_TEXTEDIT_STRING *str, STB_TexteditState *state, int where, int length); static void stb_text_makeundo_insert(STB_TexteditState *state, int where, int length); static void stb_text_makeundo_replace(STB_TEXTEDIT_STRING *str, STB_TexteditState *state, int where, int old_length, int new_length); typedef struct { float x,y; // position of n'th character float height; // height of line int first_char, length; // first char of row, and length int prev_first; // first char of previous row } StbFindState; // find the x/y location of a character, and remember info about the previous row in // case we get a move-up event (for page up, we'll have to rescan) static void stb_textedit_find_charpos(StbFindState *find, STB_TEXTEDIT_STRING *str, int n, int single_line) { StbTexteditRow r; int prev_start = 0; int z = STB_TEXTEDIT_STRINGLEN(str); int i=0, first; if (n == z) { // if it's at the end, then find the last line -- simpler than trying to // explicitly handle this case in the regular code if (single_line) { STB_TEXTEDIT_LAYOUTROW(&r, str, 0); find->y = 0; find->first_char = 0; find->length = z; find->height = r.ymax - r.ymin; find->x = r.x1; } else { find->y = 0; find->x = 0; find->height = 1; while (i < z) { STB_TEXTEDIT_LAYOUTROW(&r, str, i); prev_start = i; i += r.num_chars; } find->first_char = i; find->length = 0; find->prev_first = prev_start; } return; } // search rows to find the one that straddles character n find->y = 0; for(;;) { STB_TEXTEDIT_LAYOUTROW(&r, str, i); if (n < i + r.num_chars) break; prev_start = i; i += r.num_chars; find->y += r.baseline_y_delta; } find->first_char = first = i; find->length = r.num_chars; find->height = r.ymax - r.ymin; find->prev_first = prev_start; // now scan to find xpos find->x = r.x0; i = 0; for (i=0; first+i < n; ++i) find->x += STB_TEXTEDIT_GETWIDTH(str, first, i); } #define STB_TEXT_HAS_SELECTION(s) ((s)->select_start != (s)->select_end) // make the selection/cursor state valid if client altered the string static void stb_textedit_clamp(STB_TEXTEDIT_STRING *str, STB_TexteditState *state) { int n = STB_TEXTEDIT_STRINGLEN(str); if (STB_TEXT_HAS_SELECTION(state)) { if (state->select_start > n) state->select_start = n; if (state->select_end > n) state->select_end = n; // if clamping forced them to be equal, move the cursor to match if (state->select_start == state->select_end) state->cursor = state->select_start; } if (state->cursor > n) state->cursor = n; } // delete characters while updating undo static void stb_textedit_delete(STB_TEXTEDIT_STRING *str, STB_TexteditState *state, int where, int len) { stb_text_makeundo_delete(str, state, where, len); STB_TEXTEDIT_DELETECHARS(str, where, len); state->has_preferred_x = 0; } // delete the section static void stb_textedit_delete_selection(STB_TEXTEDIT_STRING *str, STB_TexteditState *state) { stb_textedit_clamp(str, state); if (STB_TEXT_HAS_SELECTION(state)) { if (state->select_start < state->select_end) { stb_textedit_delete(str, state, state->select_start, state->select_end - state->select_start); state->select_end = state->cursor = state->select_start; } else { stb_textedit_delete(str, state, state->select_end, state->select_start - state->select_end); state->select_start = state->cursor = state->select_end; } state->has_preferred_x = 0; } } // canoncialize the selection so start <= end static void stb_textedit_sortselection(STB_TexteditState *state) { if (state->select_end < state->select_start) { int temp = state->select_end; state->select_end = state->select_start; state->select_start = temp; } } // move cursor to first character of selection static void stb_textedit_move_to_first(STB_TexteditState *state) { if (STB_TEXT_HAS_SELECTION(state)) { stb_textedit_sortselection(state); state->cursor = state->select_start; state->select_end = state->select_start; state->has_preferred_x = 0; } } // move cursor to last character of selection static void stb_textedit_move_to_last(STB_TEXTEDIT_STRING *str, STB_TexteditState *state) { if (STB_TEXT_HAS_SELECTION(state)) { stb_textedit_sortselection(state); stb_textedit_clamp(str, state); state->cursor = state->select_end; state->select_start = state->select_end; state->has_preferred_x = 0; } } #ifdef STB_TEXTEDIT_IS_SPACE static int is_word_boundary( STB_TEXTEDIT_STRING *str, int idx ) { return idx > 0 ? (STB_TEXTEDIT_IS_SPACE( STB_TEXTEDIT_GETCHAR(str,idx-1) ) && !STB_TEXTEDIT_IS_SPACE( STB_TEXTEDIT_GETCHAR(str, idx) ) ) : 1; } #ifndef STB_TEXTEDIT_MOVEWORDLEFT static int stb_textedit_move_to_word_previous( STB_TEXTEDIT_STRING *str, int c ) { --c; // always move at least one character while( c >= 0 && !is_word_boundary( str, c ) ) --c; if( c < 0 ) c = 0; return c; } #define STB_TEXTEDIT_MOVEWORDLEFT stb_textedit_move_to_word_previous #endif #ifndef STB_TEXTEDIT_MOVEWORDRIGHT static int stb_textedit_move_to_word_next( STB_TEXTEDIT_STRING *str, int c ) { const int len = STB_TEXTEDIT_STRINGLEN(str); ++c; // always move at least one character while( c < len && !is_word_boundary( str, c ) ) ++c; if( c > len ) c = len; return c; } #define STB_TEXTEDIT_MOVEWORDRIGHT stb_textedit_move_to_word_next #endif #endif // update selection and cursor to match each other static void stb_textedit_prep_selection_at_cursor(STB_TexteditState *state) { if (!STB_TEXT_HAS_SELECTION(state)) state->select_start = state->select_end = state->cursor; else state->cursor = state->select_end; } // API cut: delete selection static int stb_textedit_cut(STB_TEXTEDIT_STRING *str, STB_TexteditState *state) { if (STB_TEXT_HAS_SELECTION(state)) { stb_textedit_delete_selection(str,state); // implicity clamps state->has_preferred_x = 0; return 1; } return 0; } // API paste: replace existing selection with passed-in text static int stb_textedit_paste_internal(STB_TEXTEDIT_STRING *str, STB_TexteditState *state, STB_TEXTEDIT_CHARTYPE *text, int len) { // if there's a selection, the paste should delete it stb_textedit_clamp(str, state); stb_textedit_delete_selection(str,state); // try to insert the characters if (STB_TEXTEDIT_INSERTCHARS(str, state->cursor, text, len)) { stb_text_makeundo_insert(state, state->cursor, len); state->cursor += len; state->has_preferred_x = 0; return 1; } // remove the undo since we didn't actually insert the characters if (state->undostate.undo_point) --state->undostate.undo_point; return 0; } // API key: process a keyboard input static void stb_textedit_key(STB_TEXTEDIT_STRING *str, STB_TexteditState *state, int key) { retry: switch (key) { default: { int c = STB_TEXTEDIT_KEYTOTEXT(key); if (c > 0) { STB_TEXTEDIT_CHARTYPE ch = (STB_TEXTEDIT_CHARTYPE) c; // can't add newline in single-line mode if (c == '\n' && state->single_line) break; if (state->insert_mode && !STB_TEXT_HAS_SELECTION(state) && state->cursor < STB_TEXTEDIT_STRINGLEN(str)) { stb_text_makeundo_replace(str, state, state->cursor, 1, 1); STB_TEXTEDIT_DELETECHARS(str, state->cursor, 1); if (STB_TEXTEDIT_INSERTCHARS(str, state->cursor, &ch, 1)) { ++state->cursor; state->has_preferred_x = 0; } } else { stb_textedit_delete_selection(str,state); // implicity clamps if (STB_TEXTEDIT_INSERTCHARS(str, state->cursor, &ch, 1)) { stb_text_makeundo_insert(state, state->cursor, 1); ++state->cursor; state->has_preferred_x = 0; } } } break; } #ifdef STB_TEXTEDIT_K_INSERT case STB_TEXTEDIT_K_INSERT: state->insert_mode = !state->insert_mode; break; #endif case STB_TEXTEDIT_K_UNDO: stb_text_undo(str, state); state->has_preferred_x = 0; break; case STB_TEXTEDIT_K_REDO: stb_text_redo(str, state); state->has_preferred_x = 0; break; case STB_TEXTEDIT_K_LEFT: // if currently there's a selection, move cursor to start of selection if (STB_TEXT_HAS_SELECTION(state)) stb_textedit_move_to_first(state); else if (state->cursor > 0) --state->cursor; state->has_preferred_x = 0; break; case STB_TEXTEDIT_K_RIGHT: // if currently there's a selection, move cursor to end of selection if (STB_TEXT_HAS_SELECTION(state)) stb_textedit_move_to_last(str, state); else ++state->cursor; stb_textedit_clamp(str, state); state->has_preferred_x = 0; break; case STB_TEXTEDIT_K_LEFT | STB_TEXTEDIT_K_SHIFT: stb_textedit_clamp(str, state); stb_textedit_prep_selection_at_cursor(state); // move selection left if (state->select_end > 0) --state->select_end; state->cursor = state->select_end; state->has_preferred_x = 0; break; #ifdef STB_TEXTEDIT_MOVEWORDLEFT case STB_TEXTEDIT_K_WORDLEFT: if (STB_TEXT_HAS_SELECTION(state)) stb_textedit_move_to_first(state); else { state->cursor = STB_TEXTEDIT_MOVEWORDLEFT(str, state->cursor); stb_textedit_clamp( str, state ); } break; case STB_TEXTEDIT_K_WORDLEFT | STB_TEXTEDIT_K_SHIFT: if( !STB_TEXT_HAS_SELECTION( state ) ) stb_textedit_prep_selection_at_cursor(state); state->cursor = STB_TEXTEDIT_MOVEWORDLEFT(str, state->cursor); state->select_end = state->cursor; stb_textedit_clamp( str, state ); break; #endif #ifdef STB_TEXTEDIT_MOVEWORDRIGHT case STB_TEXTEDIT_K_WORDRIGHT: if (STB_TEXT_HAS_SELECTION(state)) stb_textedit_move_to_last(str, state); else { state->cursor = STB_TEXTEDIT_MOVEWORDRIGHT(str, state->cursor); stb_textedit_clamp( str, state ); } break; case STB_TEXTEDIT_K_WORDRIGHT | STB_TEXTEDIT_K_SHIFT: if( !STB_TEXT_HAS_SELECTION( state ) ) stb_textedit_prep_selection_at_cursor(state); state->cursor = STB_TEXTEDIT_MOVEWORDRIGHT(str, state->cursor); state->select_end = state->cursor; stb_textedit_clamp( str, state ); break; #endif case STB_TEXTEDIT_K_RIGHT | STB_TEXTEDIT_K_SHIFT: stb_textedit_prep_selection_at_cursor(state); // move selection right ++state->select_end; stb_textedit_clamp(str, state); state->cursor = state->select_end; state->has_preferred_x = 0; break; case STB_TEXTEDIT_K_DOWN: case STB_TEXTEDIT_K_DOWN | STB_TEXTEDIT_K_SHIFT: { StbFindState find; StbTexteditRow row; int i, sel = (key & STB_TEXTEDIT_K_SHIFT) != 0; if (state->single_line) { // on windows, up&down in single-line behave like left&right key = STB_TEXTEDIT_K_RIGHT | (key & STB_TEXTEDIT_K_SHIFT); goto retry; } if (sel) stb_textedit_prep_selection_at_cursor(state); else if (STB_TEXT_HAS_SELECTION(state)) stb_textedit_move_to_last(str,state); // compute current position of cursor point stb_textedit_clamp(str, state); stb_textedit_find_charpos(&find, str, state->cursor, state->single_line); // now find character position down a row if (find.length) { float goal_x = state->has_preferred_x ? state->preferred_x : find.x; float x; int start = find.first_char + find.length; state->cursor = start; STB_TEXTEDIT_LAYOUTROW(&row, str, state->cursor); x = row.x0; for (i=0; i < row.num_chars; ++i) { float dx = STB_TEXTEDIT_GETWIDTH(str, start, i); #ifdef STB_TEXTEDIT_GETWIDTH_NEWLINE if (dx == STB_TEXTEDIT_GETWIDTH_NEWLINE) break; #endif x += dx; if (x > goal_x) break; ++state->cursor; } stb_textedit_clamp(str, state); state->has_preferred_x = 1; state->preferred_x = goal_x; if (sel) state->select_end = state->cursor; } break; } case STB_TEXTEDIT_K_UP: case STB_TEXTEDIT_K_UP | STB_TEXTEDIT_K_SHIFT: { StbFindState find; StbTexteditRow row; int i, sel = (key & STB_TEXTEDIT_K_SHIFT) != 0; if (state->single_line) { // on windows, up&down become left&right key = STB_TEXTEDIT_K_LEFT | (key & STB_TEXTEDIT_K_SHIFT); goto retry; } if (sel) stb_textedit_prep_selection_at_cursor(state); else if (STB_TEXT_HAS_SELECTION(state)) stb_textedit_move_to_first(state); // compute current position of cursor point stb_textedit_clamp(str, state); stb_textedit_find_charpos(&find, str, state->cursor, state->single_line); // can only go up if there's a previous row if (find.prev_first != find.first_char) { // now find character position up a row float goal_x = state->has_preferred_x ? state->preferred_x : find.x; float x; state->cursor = find.prev_first; STB_TEXTEDIT_LAYOUTROW(&row, str, state->cursor); x = row.x0; for (i=0; i < row.num_chars; ++i) { float dx = STB_TEXTEDIT_GETWIDTH(str, find.prev_first, i); #ifdef STB_TEXTEDIT_GETWIDTH_NEWLINE if (dx == STB_TEXTEDIT_GETWIDTH_NEWLINE) break; #endif x += dx; if (x > goal_x) break; ++state->cursor; } stb_textedit_clamp(str, state); state->has_preferred_x = 1; state->preferred_x = goal_x; if (sel) state->select_end = state->cursor; } break; } case STB_TEXTEDIT_K_DELETE: case STB_TEXTEDIT_K_DELETE | STB_TEXTEDIT_K_SHIFT: if (STB_TEXT_HAS_SELECTION(state)) stb_textedit_delete_selection(str, state); else { int n = STB_TEXTEDIT_STRINGLEN(str); if (state->cursor < n) stb_textedit_delete(str, state, state->cursor, 1); } state->has_preferred_x = 0; break; case STB_TEXTEDIT_K_BACKSPACE: case STB_TEXTEDIT_K_BACKSPACE | STB_TEXTEDIT_K_SHIFT: if (STB_TEXT_HAS_SELECTION(state)) stb_textedit_delete_selection(str, state); else { stb_textedit_clamp(str, state); if (state->cursor > 0) { stb_textedit_delete(str, state, state->cursor-1, 1); --state->cursor; } } state->has_preferred_x = 0; break; #ifdef STB_TEXTEDIT_K_TEXTSTART2 case STB_TEXTEDIT_K_TEXTSTART2: #endif case STB_TEXTEDIT_K_TEXTSTART: state->cursor = state->select_start = state->select_end = 0; state->has_preferred_x = 0; break; #ifdef STB_TEXTEDIT_K_TEXTEND2 case STB_TEXTEDIT_K_TEXTEND2: #endif case STB_TEXTEDIT_K_TEXTEND: state->cursor = STB_TEXTEDIT_STRINGLEN(str); state->select_start = state->select_end = 0; state->has_preferred_x = 0; break; #ifdef STB_TEXTEDIT_K_TEXTSTART2 case STB_TEXTEDIT_K_TEXTSTART2 | STB_TEXTEDIT_K_SHIFT: #endif case STB_TEXTEDIT_K_TEXTSTART | STB_TEXTEDIT_K_SHIFT: stb_textedit_prep_selection_at_cursor(state); state->cursor = state->select_end = 0; state->has_preferred_x = 0; break; #ifdef STB_TEXTEDIT_K_TEXTEND2 case STB_TEXTEDIT_K_TEXTEND2 | STB_TEXTEDIT_K_SHIFT: #endif case STB_TEXTEDIT_K_TEXTEND | STB_TEXTEDIT_K_SHIFT: stb_textedit_prep_selection_at_cursor(state); state->cursor = state->select_end = STB_TEXTEDIT_STRINGLEN(str); state->has_preferred_x = 0; break; #ifdef STB_TEXTEDIT_K_LINESTART2 case STB_TEXTEDIT_K_LINESTART2: #endif case STB_TEXTEDIT_K_LINESTART: stb_textedit_clamp(str, state); stb_textedit_move_to_first(state); if (state->single_line) state->cursor = 0; else while (state->cursor > 0 && STB_TEXTEDIT_GETCHAR(str, state->cursor-1) != STB_TEXTEDIT_NEWLINE) --state->cursor; state->has_preferred_x = 0; break; #ifdef STB_TEXTEDIT_K_LINEEND2 case STB_TEXTEDIT_K_LINEEND2: #endif case STB_TEXTEDIT_K_LINEEND: { int n = STB_TEXTEDIT_STRINGLEN(str); stb_textedit_clamp(str, state); stb_textedit_move_to_first(state); if (state->single_line) state->cursor = n; else while (state->cursor < n && STB_TEXTEDIT_GETCHAR(str, state->cursor) != STB_TEXTEDIT_NEWLINE) ++state->cursor; state->has_preferred_x = 0; break; } #ifdef STB_TEXTEDIT_K_LINESTART2 case STB_TEXTEDIT_K_LINESTART2 | STB_TEXTEDIT_K_SHIFT: #endif case STB_TEXTEDIT_K_LINESTART | STB_TEXTEDIT_K_SHIFT: stb_textedit_clamp(str, state); stb_textedit_prep_selection_at_cursor(state); if (state->single_line) state->cursor = 0; else while (state->cursor > 0 && STB_TEXTEDIT_GETCHAR(str, state->cursor-1) != STB_TEXTEDIT_NEWLINE) --state->cursor; state->select_end = state->cursor; state->has_preferred_x = 0; break; #ifdef STB_TEXTEDIT_K_LINEEND2 case STB_TEXTEDIT_K_LINEEND2 | STB_TEXTEDIT_K_SHIFT: #endif case STB_TEXTEDIT_K_LINEEND | STB_TEXTEDIT_K_SHIFT: { int n = STB_TEXTEDIT_STRINGLEN(str); stb_textedit_clamp(str, state); stb_textedit_prep_selection_at_cursor(state); if (state->single_line) state->cursor = n; else while (state->cursor < n && STB_TEXTEDIT_GETCHAR(str, state->cursor) != STB_TEXTEDIT_NEWLINE) ++state->cursor; state->select_end = state->cursor; state->has_preferred_x = 0; break; } // @TODO: // STB_TEXTEDIT_K_PGUP - move cursor up a page // STB_TEXTEDIT_K_PGDOWN - move cursor down a page } } ///////////////////////////////////////////////////////////////////////////// // // Undo processing // // @OPTIMIZE: the undo/redo buffer should be circular static void stb_textedit_flush_redo(StbUndoState *state) { state->redo_point = STB_TEXTEDIT_UNDOSTATECOUNT; state->redo_char_point = STB_TEXTEDIT_UNDOCHARCOUNT; } // discard the oldest entry in the undo list static void stb_textedit_discard_undo(StbUndoState *state) { if (state->undo_point > 0) { // if the 0th undo state has characters, clean those up if (state->undo_rec[0].char_storage >= 0) { int n = state->undo_rec[0].insert_length, i; // delete n characters from all other records state->undo_char_point = state->undo_char_point - (short) n; // vsnet05 STB_TEXTEDIT_memmove(state->undo_char, state->undo_char + n, (size_t) (state->undo_char_point*sizeof(STB_TEXTEDIT_CHARTYPE))); for (i=0; i < state->undo_point; ++i) if (state->undo_rec[i].char_storage >= 0) state->undo_rec[i].char_storage = state->undo_rec[i].char_storage - (short) n; // vsnet05 // @OPTIMIZE: get rid of char_storage and infer it } --state->undo_point; STB_TEXTEDIT_memmove(state->undo_rec, state->undo_rec+1, (size_t) (state->undo_point*sizeof(state->undo_rec[0]))); } } // discard the oldest entry in the redo list--it's bad if this // ever happens, but because undo & redo have to store the actual // characters in different cases, the redo character buffer can // fill up even though the undo buffer didn't static void stb_textedit_discard_redo(StbUndoState *state) { int k = STB_TEXTEDIT_UNDOSTATECOUNT-1; if (state->redo_point <= k) { // if the k'th undo state has characters, clean those up if (state->undo_rec[k].char_storage >= 0) { int n = state->undo_rec[k].insert_length, i; // delete n characters from all other records state->redo_char_point = state->redo_char_point + (short) n; // vsnet05 STB_TEXTEDIT_memmove(state->undo_char + state->redo_char_point, state->undo_char + state->redo_char_point-n, (size_t) ((STB_TEXTEDIT_UNDOSTATECOUNT - state->redo_char_point)*sizeof(STB_TEXTEDIT_CHARTYPE))); for (i=state->redo_point; i < k; ++i) if (state->undo_rec[i].char_storage >= 0) state->undo_rec[i].char_storage = state->undo_rec[i].char_storage + (short) n; // vsnet05 } ++state->redo_point; STB_TEXTEDIT_memmove(state->undo_rec + state->redo_point-1, state->undo_rec + state->redo_point, (size_t) ((STB_TEXTEDIT_UNDOSTATECOUNT - state->redo_point)*sizeof(state->undo_rec[0]))); } } static StbUndoRecord *stb_text_create_undo_record(StbUndoState *state, int numchars) { // any time we create a new undo record, we discard redo stb_textedit_flush_redo(state); // if we have no free records, we have to make room, by sliding the // existing records down if (state->undo_point == STB_TEXTEDIT_UNDOSTATECOUNT) stb_textedit_discard_undo(state); // if the characters to store won't possibly fit in the buffer, we can't undo if (numchars > STB_TEXTEDIT_UNDOCHARCOUNT) { state->undo_point = 0; state->undo_char_point = 0; return NULL; } // if we don't have enough free characters in the buffer, we have to make room while (state->undo_char_point + numchars > STB_TEXTEDIT_UNDOCHARCOUNT) stb_textedit_discard_undo(state); return &state->undo_rec[state->undo_point++]; } static STB_TEXTEDIT_CHARTYPE *stb_text_createundo(StbUndoState *state, int pos, int insert_len, int delete_len) { StbUndoRecord *r = stb_text_create_undo_record(state, insert_len); if (r == NULL) return NULL; r->where = pos; r->insert_length = (short) insert_len; r->delete_length = (short) delete_len; if (insert_len == 0) { r->char_storage = -1; return NULL; } else { r->char_storage = state->undo_char_point; state->undo_char_point = state->undo_char_point + (short) insert_len; return &state->undo_char[r->char_storage]; } } static void stb_text_undo(STB_TEXTEDIT_STRING *str, STB_TexteditState *state) { StbUndoState *s = &state->undostate; StbUndoRecord u, *r; if (s->undo_point == 0) return; // we need to do two things: apply the undo record, and create a redo record u = s->undo_rec[s->undo_point-1]; r = &s->undo_rec[s->redo_point-1]; r->char_storage = -1; r->insert_length = u.delete_length; r->delete_length = u.insert_length; r->where = u.where; if (u.delete_length) { // if the undo record says to delete characters, then the redo record will // need to re-insert the characters that get deleted, so we need to store // them. // there are three cases: // there's enough room to store the characters // characters stored for *redoing* don't leave room for redo // characters stored for *undoing* don't leave room for redo // if the last is true, we have to bail if (s->undo_char_point + u.delete_length >= STB_TEXTEDIT_UNDOCHARCOUNT) { // the undo records take up too much character space; there's no space to store the redo characters r->insert_length = 0; } else { int i; // there's definitely room to store the characters eventually while (s->undo_char_point + u.delete_length > s->redo_char_point) { // there's currently not enough room, so discard a redo record stb_textedit_discard_redo(s); // should never happen: if (s->redo_point == STB_TEXTEDIT_UNDOSTATECOUNT) return; } r = &s->undo_rec[s->redo_point-1]; r->char_storage = s->redo_char_point - u.delete_length; s->redo_char_point = s->redo_char_point - (short) u.delete_length; // now save the characters for (i=0; i < u.delete_length; ++i) s->undo_char[r->char_storage + i] = STB_TEXTEDIT_GETCHAR(str, u.where + i); } // now we can carry out the deletion STB_TEXTEDIT_DELETECHARS(str, u.where, u.delete_length); } // check type of recorded action: if (u.insert_length) { // easy case: was a deletion, so we need to insert n characters STB_TEXTEDIT_INSERTCHARS(str, u.where, &s->undo_char[u.char_storage], u.insert_length); s->undo_char_point -= u.insert_length; } state->cursor = u.where + u.insert_length; s->undo_point--; s->redo_point--; } static void stb_text_redo(STB_TEXTEDIT_STRING *str, STB_TexteditState *state) { StbUndoState *s = &state->undostate; StbUndoRecord *u, r; if (s->redo_point == STB_TEXTEDIT_UNDOSTATECOUNT) return; // we need to do two things: apply the redo record, and create an undo record u = &s->undo_rec[s->undo_point]; r = s->undo_rec[s->redo_point]; // we KNOW there must be room for the undo record, because the redo record // was derived from an undo record u->delete_length = r.insert_length; u->insert_length = r.delete_length; u->where = r.where; u->char_storage = -1; if (r.delete_length) { // the redo record requires us to delete characters, so the undo record // needs to store the characters if (s->undo_char_point + u->insert_length > s->redo_char_point) { u->insert_length = 0; u->delete_length = 0; } else { int i; u->char_storage = s->undo_char_point; s->undo_char_point = s->undo_char_point + u->insert_length; // now save the characters for (i=0; i < u->insert_length; ++i) s->undo_char[u->char_storage + i] = STB_TEXTEDIT_GETCHAR(str, u->where + i); } STB_TEXTEDIT_DELETECHARS(str, r.where, r.delete_length); } if (r.insert_length) { // easy case: need to insert n characters STB_TEXTEDIT_INSERTCHARS(str, r.where, &s->undo_char[r.char_storage], r.insert_length); } state->cursor = r.where + r.insert_length; s->undo_point++; s->redo_point++; } static void stb_text_makeundo_insert(STB_TexteditState *state, int where, int length) { stb_text_createundo(&state->undostate, where, 0, length); } static void stb_text_makeundo_delete(STB_TEXTEDIT_STRING *str, STB_TexteditState *state, int where, int length) { int i; STB_TEXTEDIT_CHARTYPE *p = stb_text_createundo(&state->undostate, where, length, 0); if (p) { for (i=0; i < length; ++i) p[i] = STB_TEXTEDIT_GETCHAR(str, where+i); } } static void stb_text_makeundo_replace(STB_TEXTEDIT_STRING *str, STB_TexteditState *state, int where, int old_length, int new_length) { int i; STB_TEXTEDIT_CHARTYPE *p = stb_text_createundo(&state->undostate, where, old_length, new_length); if (p) { for (i=0; i < old_length; ++i) p[i] = STB_TEXTEDIT_GETCHAR(str, where+i); } } // reset the state to default static void stb_textedit_clear_state(STB_TexteditState *state, int is_single_line) { state->undostate.undo_point = 0; state->undostate.undo_char_point = 0; state->undostate.redo_point = STB_TEXTEDIT_UNDOSTATECOUNT; state->undostate.redo_char_point = STB_TEXTEDIT_UNDOCHARCOUNT; state->select_end = state->select_start = 0; state->cursor = 0; state->has_preferred_x = 0; state->preferred_x = 0; state->cursor_at_end_of_line = 0; state->initialized = 1; state->single_line = (unsigned char) is_single_line; state->insert_mode = 0; } // API initialize static void stb_textedit_initialize_state(STB_TexteditState *state, int is_single_line) { stb_textedit_clear_state(state, is_single_line); } #if defined(__GNUC__) || defined(__clang__) #pragma GCC diagnostic push #pragma GCC diagnostic ignored "-Wcast-qual" #endif static int stb_textedit_paste(STB_TEXTEDIT_STRING *str, STB_TexteditState *state, STB_TEXTEDIT_CHARTYPE const *ctext, int len) { return stb_textedit_paste_internal(str, state, (STB_TEXTEDIT_CHARTYPE *) ctext, len); } #if defined(__GNUC__) || defined(__clang__) #pragma GCC diagnostic pop #endif #endif//STB_TEXTEDIT_IMPLEMENTATION /* ------------------------------------------------------------------------------ This software is available under 2 licenses -- choose whichever you prefer. ------------------------------------------------------------------------------ ALTERNATIVE A - MIT License Copyright (c) 2017 Sean Barrett 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. ------------------------------------------------------------------------------ ALTERNATIVE B - Public Domain (www.unlicense.org) This is free and unencumbered software released into the public domain. Anyone is free to copy, modify, publish, use, compile, sell, or distribute this software, either in source code form or as a compiled binary, for any purpose, commercial or non-commercial, and by any means. In jurisdictions that recognize copyright laws, the author or authors of this software dedicate any and all copyright interest in the software to the public domain. We make this dedication for the benefit of the public at large and to the detriment of our heirs and successors. We intend this dedication to be an overt act of relinquishment in perpetuity of all present and future rights to this software under copyright law. 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 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. ------------------------------------------------------------------------------ */ uTox/third_party/stb/stb/stb_sprintf.h0000600000175000001440000015407514003056224017130 0ustar rakusers// stb_sprintf - v1.03 - public domain snprintf() implementation // originally by Jeff Roberts / RAD Game Tools, 2015/10/20 // http://github.com/nothings/stb // // allowed types: sc uidBboXx p AaGgEef n // lengths : h ll j z t I64 I32 I // // Contributors: // Fabian "ryg" Giesen (reformatting) // // Contributors (bugfixes): // github:d26435 // github:trex78 // Jari Komppa (SI suffixes) // // LICENSE: // // See end of file for license information. #ifndef STB_SPRINTF_H_INCLUDE #define STB_SPRINTF_H_INCLUDE /* Single file sprintf replacement. Originally written by Jeff Roberts at RAD Game Tools - 2015/10/20. Hereby placed in public domain. This is a full sprintf replacement that supports everything that the C runtime sprintfs support, including float/double, 64-bit integers, hex floats, field parameters (%*.*d stuff), length reads backs, etc. Why would you need this if sprintf already exists? Well, first off, it's *much* faster (see below). It's also much smaller than the CRT versions code-space-wise. We've also added some simple improvements that are super handy (commas in thousands, callbacks at buffer full, for example). Finally, the format strings for MSVC and GCC differ for 64-bit integers (among other small things), so this lets you use the same format strings in cross platform code. It uses the standard single file trick of being both the header file and the source itself. If you just include it normally, you just get the header file function definitions. To get the code, you include it from a C or C++ file and define STB_SPRINTF_IMPLEMENTATION first. It only uses va_args macros from the C runtime to do it's work. It does cast doubles to S64s and shifts and divides U64s, which does drag in CRT code on most platforms. It compiles to roughly 8K with float support, and 4K without. As a comparison, when using MSVC static libs, calling sprintf drags in 16K. API: ==== int stbsp_sprintf( char * buf, char const * fmt, ... ) int stbsp_snprintf( char * buf, int count, char const * fmt, ... ) Convert an arg list into a buffer. stbsp_snprintf always returns a zero-terminated string (unlike regular snprintf). int stbsp_vsprintf( char * buf, char const * fmt, va_list va ) int stbsp_vsnprintf( char * buf, int count, char const * fmt, va_list va ) Convert a va_list arg list into a buffer. stbsp_vsnprintf always returns a zero-terminated string (unlike regular snprintf). int stbsp_vsprintfcb( STBSP_SPRINTFCB * callback, void * user, char * buf, char const * fmt, va_list va ) typedef char * STBSP_SPRINTFCB( char const * buf, void * user, int len ); Convert into a buffer, calling back every STB_SPRINTF_MIN chars. Your callback can then copy the chars out, print them or whatever. This function is actually the workhorse for everything else. The buffer you pass in must hold at least STB_SPRINTF_MIN characters. // you return the next buffer to use or 0 to stop converting void stbsp_set_separators( char comma, char period ) Set the comma and period characters to use. FLOATS/DOUBLES: =============== This code uses a internal float->ascii conversion method that uses doubles with error correction (double-doubles, for ~105 bits of precision). This conversion is round-trip perfect - that is, an atof of the values output here will give you the bit-exact double back. One difference is that our insignificant digits will be different than with MSVC or GCC (but they don't match each other either). We also don't attempt to find the minimum length matching float (pre-MSVC15 doesn't either). If you don't need float or doubles at all, define STB_SPRINTF_NOFLOAT and you'll save 4K of code space. 64-BIT INTS: ============ This library also supports 64-bit integers and you can use MSVC style or GCC style indicators (%I64d or %lld). It supports the C99 specifiers for size_t and ptr_diff_t (%jd %zd) as well. EXTRAS: ======= Like some GCCs, for integers and floats, you can use a ' (single quote) specifier and commas will be inserted on the thousands: "%'d" on 12345 would print 12,345. For integers and floats, you can use a "$" specifier and the number will be converted to float and then divided to get kilo, mega, giga or tera and then printed, so "%$d" 1000 is "1.0 k", "%$.2d" 2536000 is "2.53 M", etc. For byte values, use two $:s, like "%$$d" to turn 2536000 to "2.42 Mi". If you prefer JEDEC suffixes to SI ones, use three $:s: "%$$$d" -> "2.42 M". To remove the space between the number and the suffix, add "_" specifier: "%_$d" -> "2.53M". In addition to octal and hexadecimal conversions, you can print integers in binary: "%b" for 256 would print 100. PERFORMANCE vs MSVC 2008 32-/64-bit (GCC is even slower than MSVC): =================================================================== "%d" across all 32-bit ints (4.8x/4.0x faster than 32-/64-bit MSVC) "%24d" across all 32-bit ints (4.5x/4.2x faster) "%x" across all 32-bit ints (4.5x/3.8x faster) "%08x" across all 32-bit ints (4.3x/3.8x faster) "%f" across e-10 to e+10 floats (7.3x/6.0x faster) "%e" across e-10 to e+10 floats (8.1x/6.0x faster) "%g" across e-10 to e+10 floats (10.0x/7.1x faster) "%f" for values near e-300 (7.9x/6.5x faster) "%f" for values near e+300 (10.0x/9.1x faster) "%e" for values near e-300 (10.1x/7.0x faster) "%e" for values near e+300 (9.2x/6.0x faster) "%.320f" for values near e-300 (12.6x/11.2x faster) "%a" for random values (8.6x/4.3x faster) "%I64d" for 64-bits with 32-bit values (4.8x/3.4x faster) "%I64d" for 64-bits > 32-bit values (4.9x/5.5x faster) "%s%s%s" for 64 char strings (7.1x/7.3x faster) "...512 char string..." ( 35.0x/32.5x faster!) */ #if defined(__has_feature) #if __has_feature(address_sanitizer) #define STBI__ASAN __attribute__((no_sanitize("address"))) #endif #endif #ifndef STBI__ASAN #define STBI__ASAN #endif #ifdef STB_SPRINTF_STATIC #define STBSP__PUBLICDEC static #define STBSP__PUBLICDEF static STBI__ASAN #else #ifdef __cplusplus #define STBSP__PUBLICDEC extern "C" #define STBSP__PUBLICDEF extern "C" STBI__ASAN #else #define STBSP__PUBLICDEC extern #define STBSP__PUBLICDEF STBI__ASAN #endif #endif #include // for va_list() #ifndef STB_SPRINTF_MIN #define STB_SPRINTF_MIN 512 // how many characters per callback #endif typedef char *STBSP_SPRINTFCB(char *buf, void *user, int len); #ifndef STB_SPRINTF_DECORATE #define STB_SPRINTF_DECORATE(name) stbsp_##name // define this before including if you want to change the names #endif STBSP__PUBLICDEF int STB_SPRINTF_DECORATE(vsprintf)(char *buf, char const *fmt, va_list va); STBSP__PUBLICDEF int STB_SPRINTF_DECORATE(vsnprintf)(char *buf, int count, char const *fmt, va_list va); STBSP__PUBLICDEF int STB_SPRINTF_DECORATE(sprintf)(char *buf, char const *fmt, ...); STBSP__PUBLICDEF int STB_SPRINTF_DECORATE(snprintf)(char *buf, int count, char const *fmt, ...); STBSP__PUBLICDEF int STB_SPRINTF_DECORATE(vsprintfcb)(STBSP_SPRINTFCB *callback, void *user, char *buf, char const *fmt, va_list va); STBSP__PUBLICDEF void STB_SPRINTF_DECORATE(set_separators)(char comma, char period); #endif // STB_SPRINTF_H_INCLUDE #ifdef STB_SPRINTF_IMPLEMENTATION #include // for va_arg() #define stbsp__uint32 unsigned int #define stbsp__int32 signed int #ifdef _MSC_VER #define stbsp__uint64 unsigned __int64 #define stbsp__int64 signed __int64 #else #define stbsp__uint64 unsigned long long #define stbsp__int64 signed long long #endif #define stbsp__uint16 unsigned short #ifndef stbsp__uintptr #if defined(__ppc64__) || defined(__aarch64__) || defined(_M_X64) || defined(__x86_64__) || defined(__x86_64) #define stbsp__uintptr stbsp__uint64 #else #define stbsp__uintptr stbsp__uint32 #endif #endif #ifndef STB_SPRINTF_MSVC_MODE // used for MSVC2013 and earlier (MSVC2015 matches GCC) #if defined(_MSC_VER) && (_MSC_VER < 1900) #define STB_SPRINTF_MSVC_MODE #endif #endif #ifdef STB_SPRINTF_NOUNALIGNED // define this before inclusion to force stbsp_sprintf to always use aligned accesses #define STBSP__UNALIGNED(code) #else #define STBSP__UNALIGNED(code) code #endif #ifndef STB_SPRINTF_NOFLOAT // internal float utility functions static stbsp__int32 stbsp__real_to_str(char const **start, stbsp__uint32 *len, char *out, stbsp__int32 *decimal_pos, double value, stbsp__uint32 frac_digits); static stbsp__int32 stbsp__real_to_parts(stbsp__int64 *bits, stbsp__int32 *expo, double value); #define STBSP__SPECIAL 0x7000 #endif static char stbsp__period = '.'; static char stbsp__comma = ','; static char stbsp__digitpair[201] = "0001020304050607080910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576" "7778798081828384858687888990919293949596979899"; STBSP__PUBLICDEF void STB_SPRINTF_DECORATE(set_separators)(char pcomma, char pperiod) { stbsp__period = pperiod; stbsp__comma = pcomma; } #define STBSP__LEFTJUST 1 #define STBSP__LEADINGPLUS 2 #define STBSP__LEADINGSPACE 4 #define STBSP__LEADING_0X 8 #define STBSP__LEADINGZERO 16 #define STBSP__INTMAX 32 #define STBSP__TRIPLET_COMMA 64 #define STBSP__NEGATIVE 128 #define STBSP__METRIC_SUFFIX 256 #define STBSP__HALFWIDTH 512 #define STBSP__METRIC_NOSPACE 1024 #define STBSP__METRIC_1024 2048 #define STBSP__METRIC_JEDEC 4096 static void stbsp__lead_sign(stbsp__uint32 fl, char *sign) { sign[0] = 0; if (fl & STBSP__NEGATIVE) { sign[0] = 1; sign[1] = '-'; } else if (fl & STBSP__LEADINGSPACE) { sign[0] = 1; sign[1] = ' '; } else if (fl & STBSP__LEADINGPLUS) { sign[0] = 1; sign[1] = '+'; } } STBSP__PUBLICDEF int STB_SPRINTF_DECORATE(vsprintfcb)(STBSP_SPRINTFCB *callback, void *user, char *buf, char const *fmt, va_list va) { static char hex[] = "0123456789abcdefxp"; static char hexu[] = "0123456789ABCDEFXP"; char *bf; char const *f; int tlen = 0; bf = buf; f = fmt; for (;;) { stbsp__int32 fw, pr, tz; stbsp__uint32 fl; // macros for the callback buffer stuff #define stbsp__chk_cb_bufL(bytes) \ { \ int len = (int)(bf - buf); \ if ((len + (bytes)) >= STB_SPRINTF_MIN) { \ tlen += len; \ if (0 == (bf = buf = callback(buf, user, len))) \ goto done; \ } \ } #define stbsp__chk_cb_buf(bytes) \ { \ if (callback) { \ stbsp__chk_cb_bufL(bytes); \ } \ } #define stbsp__flush_cb() \ { \ stbsp__chk_cb_bufL(STB_SPRINTF_MIN - 1); \ } // flush if there is even one byte in the buffer #define stbsp__cb_buf_clamp(cl, v) \ cl = v; \ if (callback) { \ int lg = STB_SPRINTF_MIN - (int)(bf - buf); \ if (cl > lg) \ cl = lg; \ } // fast copy everything up to the next % (or end of string) for (;;) { while (((stbsp__uintptr)f) & 3) { schk1: if (f[0] == '%') goto scandd; schk2: if (f[0] == 0) goto endfmt; stbsp__chk_cb_buf(1); *bf++ = f[0]; ++f; } for (;;) { // Check if the next 4 bytes contain %(0x25) or end of string. // Using the 'hasless' trick: // https://graphics.stanford.edu/~seander/bithacks.html#HasLessInWord stbsp__uint32 v, c; v = *(stbsp__uint32 *)f; c = (~v) & 0x80808080; if (((v ^ 0x25252525) - 0x01010101) & c) goto schk1; if ((v - 0x01010101) & c) goto schk2; if (callback) if ((STB_SPRINTF_MIN - (int)(bf - buf)) < 4) goto schk1; *(stbsp__uint32 *)bf = v; bf += 4; f += 4; } } scandd: ++f; // ok, we have a percent, read the modifiers first fw = 0; pr = -1; fl = 0; tz = 0; // flags for (;;) { switch (f[0]) { // if we have left justify case '-': fl |= STBSP__LEFTJUST; ++f; continue; // if we have leading plus case '+': fl |= STBSP__LEADINGPLUS; ++f; continue; // if we have leading space case ' ': fl |= STBSP__LEADINGSPACE; ++f; continue; // if we have leading 0x case '#': fl |= STBSP__LEADING_0X; ++f; continue; // if we have thousand commas case '\'': fl |= STBSP__TRIPLET_COMMA; ++f; continue; // if we have kilo marker (none->kilo->kibi->jedec) case '$': if (fl & STBSP__METRIC_SUFFIX) { if (fl & STBSP__METRIC_1024) { fl |= STBSP__METRIC_JEDEC; } else { fl |= STBSP__METRIC_1024; } } else { fl |= STBSP__METRIC_SUFFIX; } ++f; continue; // if we don't want space between metric suffix and number case '_': fl |= STBSP__METRIC_NOSPACE; ++f; continue; // if we have leading zero case '0': fl |= STBSP__LEADINGZERO; ++f; goto flags_done; default: goto flags_done; } } flags_done: // get the field width if (f[0] == '*') { fw = va_arg(va, stbsp__uint32); ++f; } else { while ((f[0] >= '0') && (f[0] <= '9')) { fw = fw * 10 + f[0] - '0'; f++; } } // get the precision if (f[0] == '.') { ++f; if (f[0] == '*') { pr = va_arg(va, stbsp__uint32); ++f; } else { pr = 0; while ((f[0] >= '0') && (f[0] <= '9')) { pr = pr * 10 + f[0] - '0'; f++; } } } // handle integer size overrides switch (f[0]) { // are we halfwidth? case 'h': fl |= STBSP__HALFWIDTH; ++f; break; // are we 64-bit (unix style) case 'l': ++f; if (f[0] == 'l') { fl |= STBSP__INTMAX; ++f; } break; // are we 64-bit on intmax? (c99) case 'j': fl |= STBSP__INTMAX; ++f; break; // are we 64-bit on size_t or ptrdiff_t? (c99) case 'z': case 't': fl |= ((sizeof(char *) == 8) ? STBSP__INTMAX : 0); ++f; break; // are we 64-bit (msft style) case 'I': if ((f[1] == '6') && (f[2] == '4')) { fl |= STBSP__INTMAX; f += 3; } else if ((f[1] == '3') && (f[2] == '2')) { f += 3; } else { fl |= ((sizeof(void *) == 8) ? STBSP__INTMAX : 0); ++f; } break; default: break; } // handle each replacement switch (f[0]) { #define STBSP__NUMSZ 512 // big enough for e308 (with commas) or e-307 char num[STBSP__NUMSZ]; char lead[8]; char tail[8]; char *s; char const *h; stbsp__uint32 l, n, cs; stbsp__uint64 n64; #ifndef STB_SPRINTF_NOFLOAT double fv; #endif stbsp__int32 dp; char const *sn; case 's': // get the string s = va_arg(va, char *); if (s == 0) s = (char *)"null"; // get the length sn = s; for (;;) { if ((((stbsp__uintptr)sn) & 3) == 0) break; lchk: if (sn[0] == 0) goto ld; ++sn; } n = 0xffffffff; if (pr >= 0) { n = (stbsp__uint32)(sn - s); if (n >= (stbsp__uint32)pr) goto ld; n = ((stbsp__uint32)(pr - n)) >> 2; } while (n) { stbsp__uint32 v = *(stbsp__uint32 *)sn; if ((v - 0x01010101) & (~v) & 0x80808080UL) goto lchk; sn += 4; --n; } goto lchk; ld: l = (stbsp__uint32)(sn - s); // clamp to precision if (l > (stbsp__uint32)pr) l = pr; lead[0] = 0; tail[0] = 0; pr = 0; dp = 0; cs = 0; // copy the string in goto scopy; case 'c': // char // get the character s = num + STBSP__NUMSZ - 1; *s = (char)va_arg(va, int); l = 1; lead[0] = 0; tail[0] = 0; pr = 0; dp = 0; cs = 0; goto scopy; case 'n': // weird write-bytes specifier { int *d = va_arg(va, int *); *d = tlen + (int)(bf - buf); } break; #ifdef STB_SPRINTF_NOFLOAT case 'A': // float case 'a': // hex float case 'G': // float case 'g': // float case 'E': // float case 'e': // float case 'f': // float va_arg(va, double); // eat it s = (char *)"No float"; l = 8; lead[0] = 0; tail[0] = 0; pr = 0; dp = 0; cs = 0; goto scopy; #else case 'A': // hex float case 'a': // hex float h = (f[0] == 'A') ? hexu : hex; fv = va_arg(va, double); if (pr == -1) pr = 6; // default is 6 // read the double into a string if (stbsp__real_to_parts((stbsp__int64 *)&n64, &dp, fv)) fl |= STBSP__NEGATIVE; s = num + 64; stbsp__lead_sign(fl, lead); if (dp == -1023) dp = (n64) ? -1022 : 0; else n64 |= (((stbsp__uint64)1) << 52); n64 <<= (64 - 56); if (pr < 15) n64 += ((((stbsp__uint64)8) << 56) >> (pr * 4)); // add leading chars #ifdef STB_SPRINTF_MSVC_MODE *s++ = '0'; *s++ = 'x'; #else lead[1 + lead[0]] = '0'; lead[2 + lead[0]] = 'x'; lead[0] += 2; #endif *s++ = h[(n64 >> 60) & 15]; n64 <<= 4; if (pr) *s++ = stbsp__period; sn = s; // print the bits n = pr; if (n > 13) n = 13; if (pr > (stbsp__int32)n) tz = pr - n; pr = 0; while (n--) { *s++ = h[(n64 >> 60) & 15]; n64 <<= 4; } // print the expo tail[1] = h[17]; if (dp < 0) { tail[2] = '-'; dp = -dp; } else tail[2] = '+'; n = (dp >= 1000) ? 6 : ((dp >= 100) ? 5 : ((dp >= 10) ? 4 : 3)); tail[0] = (char)n; for (;;) { tail[n] = '0' + dp % 10; if (n <= 3) break; --n; dp /= 10; } dp = (int)(s - sn); l = (int)(s - (num + 64)); s = num + 64; cs = 1 + (3 << 24); goto scopy; case 'G': // float case 'g': // float h = (f[0] == 'G') ? hexu : hex; fv = va_arg(va, double); if (pr == -1) pr = 6; else if (pr == 0) pr = 1; // default is 6 // read the double into a string if (stbsp__real_to_str(&sn, &l, num, &dp, fv, (pr - 1) | 0x80000000)) fl |= STBSP__NEGATIVE; // clamp the precision and delete extra zeros after clamp n = pr; if (l > (stbsp__uint32)pr) l = pr; while ((l > 1) && (pr) && (sn[l - 1] == '0')) { --pr; --l; } // should we use %e if ((dp <= -4) || (dp > (stbsp__int32)n)) { if (pr > (stbsp__int32)l) pr = l - 1; else if (pr) --pr; // when using %e, there is one digit before the decimal goto doexpfromg; } // this is the insane action to get the pr to match %g sematics for %f if (dp > 0) { pr = (dp < (stbsp__int32)l) ? l - dp : 0; } else { pr = -dp + ((pr > (stbsp__int32)l) ? l : pr); } goto dofloatfromg; case 'E': // float case 'e': // float h = (f[0] == 'E') ? hexu : hex; fv = va_arg(va, double); if (pr == -1) pr = 6; // default is 6 // read the double into a string if (stbsp__real_to_str(&sn, &l, num, &dp, fv, pr | 0x80000000)) fl |= STBSP__NEGATIVE; doexpfromg: tail[0] = 0; stbsp__lead_sign(fl, lead); if (dp == STBSP__SPECIAL) { s = (char *)sn; cs = 0; pr = 0; goto scopy; } s = num + 64; // handle leading chars *s++ = sn[0]; if (pr) *s++ = stbsp__period; // handle after decimal if ((l - 1) > (stbsp__uint32)pr) l = pr + 1; for (n = 1; n < l; n++) *s++ = sn[n]; // trailing zeros tz = pr - (l - 1); pr = 0; // dump expo tail[1] = h[0xe]; dp -= 1; if (dp < 0) { tail[2] = '-'; dp = -dp; } else tail[2] = '+'; #ifdef STB_SPRINTF_MSVC_MODE n = 5; #else n = (dp >= 100) ? 5 : 4; #endif tail[0] = (char)n; for (;;) { tail[n] = '0' + dp % 10; if (n <= 3) break; --n; dp /= 10; } cs = 1 + (3 << 24); // how many tens goto flt_lead; case 'f': // float fv = va_arg(va, double); doafloat: // do kilos if (fl & STBSP__METRIC_SUFFIX) { double divisor; divisor = 1000.0f; if (fl & STBSP__METRIC_1024) divisor = 1024.0; while (fl < 0x4000000) { if ((fv < divisor) && (fv > -divisor)) break; fv /= divisor; fl += 0x1000000; } } if (pr == -1) pr = 6; // default is 6 // read the double into a string if (stbsp__real_to_str(&sn, &l, num, &dp, fv, pr)) fl |= STBSP__NEGATIVE; dofloatfromg: tail[0] = 0; stbsp__lead_sign(fl, lead); if (dp == STBSP__SPECIAL) { s = (char *)sn; cs = 0; pr = 0; goto scopy; } s = num + 64; // handle the three decimal varieties if (dp <= 0) { stbsp__int32 i; // handle 0.000*000xxxx *s++ = '0'; if (pr) *s++ = stbsp__period; n = -dp; if ((stbsp__int32)n > pr) n = pr; i = n; while (i) { if ((((stbsp__uintptr)s) & 3) == 0) break; *s++ = '0'; --i; } while (i >= 4) { *(stbsp__uint32 *)s = 0x30303030; s += 4; i -= 4; } while (i) { *s++ = '0'; --i; } if ((stbsp__int32)(l + n) > pr) l = pr - n; i = l; while (i) { *s++ = *sn++; --i; } tz = pr - (n + l); cs = 1 + (3 << 24); // how many tens did we write (for commas below) } else { cs = (fl & STBSP__TRIPLET_COMMA) ? ((600 - (stbsp__uint32)dp) % 3) : 0; if ((stbsp__uint32)dp >= l) { // handle xxxx000*000.0 n = 0; for (;;) { if ((fl & STBSP__TRIPLET_COMMA) && (++cs == 4)) { cs = 0; *s++ = stbsp__comma; } else { *s++ = sn[n]; ++n; if (n >= l) break; } } if (n < (stbsp__uint32)dp) { n = dp - n; if ((fl & STBSP__TRIPLET_COMMA) == 0) { while (n) { if ((((stbsp__uintptr)s) & 3) == 0) break; *s++ = '0'; --n; } while (n >= 4) { *(stbsp__uint32 *)s = 0x30303030; s += 4; n -= 4; } } while (n) { if ((fl & STBSP__TRIPLET_COMMA) && (++cs == 4)) { cs = 0; *s++ = stbsp__comma; } else { *s++ = '0'; --n; } } } cs = (int)(s - (num + 64)) + (3 << 24); // cs is how many tens if (pr) { *s++ = stbsp__period; tz = pr; } } else { // handle xxxxx.xxxx000*000 n = 0; for (;;) { if ((fl & STBSP__TRIPLET_COMMA) && (++cs == 4)) { cs = 0; *s++ = stbsp__comma; } else { *s++ = sn[n]; ++n; if (n >= (stbsp__uint32)dp) break; } } cs = (int)(s - (num + 64)) + (3 << 24); // cs is how many tens if (pr) *s++ = stbsp__period; if ((l - dp) > (stbsp__uint32)pr) l = pr + dp; while (n < l) { *s++ = sn[n]; ++n; } tz = pr - (l - dp); } } pr = 0; // handle k,m,g,t if (fl & STBSP__METRIC_SUFFIX) { char idx; idx = 1; if (fl & STBSP__METRIC_NOSPACE) idx = 0; tail[0] = idx; tail[1] = ' '; { if (fl >> 24) { // SI kilo is 'k', JEDEC and SI kibits are 'K'. if (fl & STBSP__METRIC_1024) tail[idx + 1] = "_KMGT"[fl >> 24]; else tail[idx + 1] = "_kMGT"[fl >> 24]; idx++; // If printing kibits and not in jedec, add the 'i'. if (fl & STBSP__METRIC_1024 && !(fl & STBSP__METRIC_JEDEC)) { tail[idx + 1] = 'i'; idx++; } tail[0] = idx; } } }; flt_lead: // get the length that we copied l = (stbsp__uint32)(s - (num + 64)); s = num + 64; goto scopy; #endif case 'B': // upper binary case 'b': // lower binary h = (f[0] == 'B') ? hexu : hex; lead[0] = 0; if (fl & STBSP__LEADING_0X) { lead[0] = 2; lead[1] = '0'; lead[2] = h[0xb]; } l = (8 << 4) | (1 << 8); goto radixnum; case 'o': // octal h = hexu; lead[0] = 0; if (fl & STBSP__LEADING_0X) { lead[0] = 1; lead[1] = '0'; } l = (3 << 4) | (3 << 8); goto radixnum; case 'p': // pointer fl |= (sizeof(void *) == 8) ? STBSP__INTMAX : 0; pr = sizeof(void *) * 2; fl &= ~STBSP__LEADINGZERO; // 'p' only prints the pointer with zeros // drop through to X case 'X': // upper hex case 'x': // lower hex h = (f[0] == 'X') ? hexu : hex; l = (4 << 4) | (4 << 8); lead[0] = 0; if (fl & STBSP__LEADING_0X) { lead[0] = 2; lead[1] = '0'; lead[2] = h[16]; } radixnum: // get the number if (fl & STBSP__INTMAX) n64 = va_arg(va, stbsp__uint64); else n64 = va_arg(va, stbsp__uint32); s = num + STBSP__NUMSZ; dp = 0; // clear tail, and clear leading if value is zero tail[0] = 0; if (n64 == 0) { lead[0] = 0; if (pr == 0) { l = 0; cs = (((l >> 4) & 15)) << 24; goto scopy; } } // convert to string for (;;) { *--s = h[n64 & ((1 << (l >> 8)) - 1)]; n64 >>= (l >> 8); if (!((n64) || ((stbsp__int32)((num + STBSP__NUMSZ) - s) < pr))) break; if (fl & STBSP__TRIPLET_COMMA) { ++l; if ((l & 15) == ((l >> 4) & 15)) { l &= ~15; *--s = stbsp__comma; } } }; // get the tens and the comma pos cs = (stbsp__uint32)((num + STBSP__NUMSZ) - s) + ((((l >> 4) & 15)) << 24); // get the length that we copied l = (stbsp__uint32)((num + STBSP__NUMSZ) - s); // copy it goto scopy; case 'u': // unsigned case 'i': case 'd': // integer // get the integer and abs it if (fl & STBSP__INTMAX) { stbsp__int64 i64 = va_arg(va, stbsp__int64); n64 = (stbsp__uint64)i64; if ((f[0] != 'u') && (i64 < 0)) { n64 = (stbsp__uint64)-i64; fl |= STBSP__NEGATIVE; } } else { stbsp__int32 i = va_arg(va, stbsp__int32); n64 = (stbsp__uint32)i; if ((f[0] != 'u') && (i < 0)) { n64 = (stbsp__uint32)-i; fl |= STBSP__NEGATIVE; } } #ifndef STB_SPRINTF_NOFLOAT if (fl & STBSP__METRIC_SUFFIX) { if (n64 < 1024) pr = 0; else if (pr == -1) pr = 1; fv = (double)(stbsp__int64)n64; goto doafloat; } #endif // convert to string s = num + STBSP__NUMSZ; l = 0; for (;;) { // do in 32-bit chunks (avoid lots of 64-bit divides even with constant denominators) char *o = s - 8; if (n64 >= 100000000) { n = (stbsp__uint32)(n64 % 100000000); n64 /= 100000000; } else { n = (stbsp__uint32)n64; n64 = 0; } if ((fl & STBSP__TRIPLET_COMMA) == 0) { while (n) { s -= 2; *(stbsp__uint16 *)s = *(stbsp__uint16 *)&stbsp__digitpair[(n % 100) * 2]; n /= 100; } } while (n) { if ((fl & STBSP__TRIPLET_COMMA) && (l++ == 3)) { l = 0; *--s = stbsp__comma; --o; } else { *--s = (char)(n % 10) + '0'; n /= 10; } } if (n64 == 0) { if ((s[0] == '0') && (s != (num + STBSP__NUMSZ))) ++s; break; } while (s != o) if ((fl & STBSP__TRIPLET_COMMA) && (l++ == 3)) { l = 0; *--s = stbsp__comma; --o; } else { *--s = '0'; } } tail[0] = 0; stbsp__lead_sign(fl, lead); // get the length that we copied l = (stbsp__uint32)((num + STBSP__NUMSZ) - s); if (l == 0) { *--s = '0'; l = 1; } cs = l + (3 << 24); if (pr < 0) pr = 0; scopy: // get fw=leading/trailing space, pr=leading zeros if (pr < (stbsp__int32)l) pr = l; n = pr + lead[0] + tail[0] + tz; if (fw < (stbsp__int32)n) fw = n; fw -= n; pr -= l; // handle right justify and leading zeros if ((fl & STBSP__LEFTJUST) == 0) { if (fl & STBSP__LEADINGZERO) // if leading zeros, everything is in pr { pr = (fw > pr) ? fw : pr; fw = 0; } else { fl &= ~STBSP__TRIPLET_COMMA; // if no leading zeros, then no commas } } // copy the spaces and/or zeros if (fw + pr) { stbsp__int32 i; stbsp__uint32 c; // copy leading spaces (or when doing %8.4d stuff) if ((fl & STBSP__LEFTJUST) == 0) while (fw > 0) { stbsp__cb_buf_clamp(i, fw); fw -= i; while (i) { if ((((stbsp__uintptr)bf) & 3) == 0) break; *bf++ = ' '; --i; } while (i >= 4) { *(stbsp__uint32 *)bf = 0x20202020; bf += 4; i -= 4; } while (i) { *bf++ = ' '; --i; } stbsp__chk_cb_buf(1); } // copy leader sn = lead + 1; while (lead[0]) { stbsp__cb_buf_clamp(i, lead[0]); lead[0] -= (char)i; while (i) { *bf++ = *sn++; --i; } stbsp__chk_cb_buf(1); } // copy leading zeros c = cs >> 24; cs &= 0xffffff; cs = (fl & STBSP__TRIPLET_COMMA) ? ((stbsp__uint32)(c - ((pr + cs) % (c + 1)))) : 0; while (pr > 0) { stbsp__cb_buf_clamp(i, pr); pr -= i; if ((fl & STBSP__TRIPLET_COMMA) == 0) { while (i) { if ((((stbsp__uintptr)bf) & 3) == 0) break; *bf++ = '0'; --i; } while (i >= 4) { *(stbsp__uint32 *)bf = 0x30303030; bf += 4; i -= 4; } } while (i) { if ((fl & STBSP__TRIPLET_COMMA) && (cs++ == c)) { cs = 0; *bf++ = stbsp__comma; } else *bf++ = '0'; --i; } stbsp__chk_cb_buf(1); } } // copy leader if there is still one sn = lead + 1; while (lead[0]) { stbsp__int32 i; stbsp__cb_buf_clamp(i, lead[0]); lead[0] -= (char)i; while (i) { *bf++ = *sn++; --i; } stbsp__chk_cb_buf(1); } // copy the string n = l; while (n) { stbsp__int32 i; stbsp__cb_buf_clamp(i, n); n -= i; STBSP__UNALIGNED(while (i >= 4) { *(stbsp__uint32 *)bf = *(stbsp__uint32 *)s; bf += 4; s += 4; i -= 4; }) while (i) { *bf++ = *s++; --i; } stbsp__chk_cb_buf(1); } // copy trailing zeros while (tz) { stbsp__int32 i; stbsp__cb_buf_clamp(i, tz); tz -= i; while (i) { if ((((stbsp__uintptr)bf) & 3) == 0) break; *bf++ = '0'; --i; } while (i >= 4) { *(stbsp__uint32 *)bf = 0x30303030; bf += 4; i -= 4; } while (i) { *bf++ = '0'; --i; } stbsp__chk_cb_buf(1); } // copy tail if there is one sn = tail + 1; while (tail[0]) { stbsp__int32 i; stbsp__cb_buf_clamp(i, tail[0]); tail[0] -= (char)i; while (i) { *bf++ = *sn++; --i; } stbsp__chk_cb_buf(1); } // handle the left justify if (fl & STBSP__LEFTJUST) if (fw > 0) { while (fw) { stbsp__int32 i; stbsp__cb_buf_clamp(i, fw); fw -= i; while (i) { if ((((stbsp__uintptr)bf) & 3) == 0) break; *bf++ = ' '; --i; } while (i >= 4) { *(stbsp__uint32 *)bf = 0x20202020; bf += 4; i -= 4; } while (i--) *bf++ = ' '; stbsp__chk_cb_buf(1); } } break; default: // unknown, just copy code s = num + STBSP__NUMSZ - 1; *s = f[0]; l = 1; fw = pr = fl = 0; lead[0] = 0; tail[0] = 0; pr = 0; dp = 0; cs = 0; goto scopy; } ++f; } endfmt: if (!callback) *bf = 0; else stbsp__flush_cb(); done: return tlen + (int)(bf - buf); } // cleanup #undef STBSP__LEFTJUST #undef STBSP__LEADINGPLUS #undef STBSP__LEADINGSPACE #undef STBSP__LEADING_0X #undef STBSP__LEADINGZERO #undef STBSP__INTMAX #undef STBSP__TRIPLET_COMMA #undef STBSP__NEGATIVE #undef STBSP__METRIC_SUFFIX #undef STBSP__NUMSZ #undef stbsp__chk_cb_bufL #undef stbsp__chk_cb_buf #undef stbsp__flush_cb #undef stbsp__cb_buf_clamp // ============================================================================ // wrapper functions STBSP__PUBLICDEF int STB_SPRINTF_DECORATE(sprintf)(char *buf, char const *fmt, ...) { int result; va_list va; va_start(va, fmt); result = STB_SPRINTF_DECORATE(vsprintfcb)(0, 0, buf, fmt, va); va_end(va); return result; } typedef struct stbsp__context { char *buf; int count; char tmp[STB_SPRINTF_MIN]; } stbsp__context; static char *stbsp__clamp_callback(char *buf, void *user, int len) { stbsp__context *c = (stbsp__context *)user; if (len > c->count) len = c->count; if (len) { if (buf != c->buf) { char *s, *d, *se; d = c->buf; s = buf; se = buf + len; do { *d++ = *s++; } while (s < se); } c->buf += len; c->count -= len; } if (c->count <= 0) return 0; return (c->count >= STB_SPRINTF_MIN) ? c->buf : c->tmp; // go direct into buffer if you can } STBSP__PUBLICDEF int STB_SPRINTF_DECORATE(vsnprintf)(char *buf, int count, char const *fmt, va_list va) { stbsp__context c; int l; if (count == 0) return 0; c.buf = buf; c.count = count; STB_SPRINTF_DECORATE(vsprintfcb)(stbsp__clamp_callback, &c, stbsp__clamp_callback(0, &c, 0), fmt, va); // zero-terminate l = (int)(c.buf - buf); if (l >= count) // should never be greater, only equal (or less) than count l = count - 1; buf[l] = 0; return l; } STBSP__PUBLICDEF int STB_SPRINTF_DECORATE(snprintf)(char *buf, int count, char const *fmt, ...) { int result; va_list va; va_start(va, fmt); result = STB_SPRINTF_DECORATE(vsnprintf)(buf, count, fmt, va); va_end(va); return result; } STBSP__PUBLICDEF int STB_SPRINTF_DECORATE(vsprintf)(char *buf, char const *fmt, va_list va) { return STB_SPRINTF_DECORATE(vsprintfcb)(0, 0, buf, fmt, va); } // ======================================================================= // low level float utility functions #ifndef STB_SPRINTF_NOFLOAT // copies d to bits w/ strict aliasing (this compiles to nothing on /Ox) #define STBSP__COPYFP(dest, src) \ { \ int cn; \ for (cn = 0; cn < 8; cn++) \ ((char *)&dest)[cn] = ((char *)&src)[cn]; \ } // get float info static stbsp__int32 stbsp__real_to_parts(stbsp__int64 *bits, stbsp__int32 *expo, double value) { double d; stbsp__int64 b = 0; // load value and round at the frac_digits d = value; STBSP__COPYFP(b, d); *bits = b & ((((stbsp__uint64)1) << 52) - 1); *expo = (stbsp__int32)(((b >> 52) & 2047) - 1023); return (stbsp__int32)(b >> 63); } static double const stbsp__bot[23] = { 1e+000, 1e+001, 1e+002, 1e+003, 1e+004, 1e+005, 1e+006, 1e+007, 1e+008, 1e+009, 1e+010, 1e+011, 1e+012, 1e+013, 1e+014, 1e+015, 1e+016, 1e+017, 1e+018, 1e+019, 1e+020, 1e+021, 1e+022 }; static double const stbsp__negbot[22] = { 1e-001, 1e-002, 1e-003, 1e-004, 1e-005, 1e-006, 1e-007, 1e-008, 1e-009, 1e-010, 1e-011, 1e-012, 1e-013, 1e-014, 1e-015, 1e-016, 1e-017, 1e-018, 1e-019, 1e-020, 1e-021, 1e-022 }; static double const stbsp__negboterr[22] = { -5.551115123125783e-018, -2.0816681711721684e-019, -2.0816681711721686e-020, -4.7921736023859299e-021, -8.1803053914031305e-022, 4.5251888174113741e-023, 4.5251888174113739e-024, -2.0922560830128471e-025, -6.2281591457779853e-026, -3.6432197315497743e-027, 6.0503030718060191e-028, 2.0113352370744385e-029, -3.0373745563400371e-030, 1.1806906454401013e-032, -7.7705399876661076e-032, 2.0902213275965398e-033, -7.1542424054621921e-034, -7.1542424054621926e-035, 2.4754073164739869e-036, 5.4846728545790429e-037, 9.2462547772103625e-038, -4.8596774326570872e-039 }; static double const stbsp__top[13] = { 1e+023, 1e+046, 1e+069, 1e+092, 1e+115, 1e+138, 1e+161, 1e+184, 1e+207, 1e+230, 1e+253, 1e+276, 1e+299 }; static double const stbsp__negtop[13] = { 1e-023, 1e-046, 1e-069, 1e-092, 1e-115, 1e-138, 1e-161, 1e-184, 1e-207, 1e-230, 1e-253, 1e-276, 1e-299 }; static double const stbsp__toperr[13] = { 8388608, 6.8601809640529717e+028, -7.253143638152921e+052, -4.3377296974619174e+075, -1.5559416129466825e+098, -3.2841562489204913e+121, -3.7745893248228135e+144, -1.7356668416969134e+167, -3.8893577551088374e+190, -9.9566444326005119e+213, 6.3641293062232429e+236, -5.2069140800249813e+259, -5.2504760255204387e+282 }; static double const stbsp__negtoperr[13] = { 3.9565301985100693e-040, -2.299904345391321e-063, 3.6506201437945798e-086, 1.1875228833981544e-109, -5.0644902316928607e-132, -6.7156837247865426e-155, -2.812077463003139e-178, -5.7778912386589953e-201, 7.4997100559334532e-224, -4.6439668915134491e-247, -6.3691100762962136e-270, -9.436808465446358e-293, 8.0970921678014997e-317 }; #if defined(_MSC_VER) && (_MSC_VER <= 1200) static stbsp__uint64 const stbsp__powten[20] = { 1, 10, 100, 1000, 10000, 100000, 1000000, 10000000, 100000000, 1000000000, 10000000000, 100000000000, 1000000000000, 10000000000000, 100000000000000, 1000000000000000, 10000000000000000, 100000000000000000, 1000000000000000000, 10000000000000000000U }; #define stbsp__tento19th ((stbsp__uint64)1000000000000000000) #else static stbsp__uint64 const stbsp__powten[20] = { 1, 10, 100, 1000, 10000, 100000, 1000000, 10000000, 100000000, 1000000000, 10000000000ULL, 100000000000ULL, 1000000000000ULL, 10000000000000ULL, 100000000000000ULL, 1000000000000000ULL, 10000000000000000ULL, 100000000000000000ULL, 1000000000000000000ULL, 10000000000000000000ULL }; #define stbsp__tento19th (1000000000000000000ULL) #endif #define stbsp__ddmulthi(oh, ol, xh, yh) \ { \ double ahi = 0, alo, bhi = 0, blo; \ stbsp__int64 bt; \ oh = xh * yh; \ STBSP__COPYFP(bt, xh); \ bt &= ((~(stbsp__uint64)0) << 27); \ STBSP__COPYFP(ahi, bt); \ alo = xh - ahi; \ STBSP__COPYFP(bt, yh); \ bt &= ((~(stbsp__uint64)0) << 27); \ STBSP__COPYFP(bhi, bt); \ blo = yh - bhi; \ ol = ((ahi * bhi - oh) + ahi * blo + alo * bhi) + alo * blo; \ } #define stbsp__ddtoS64(ob, xh, xl) \ { \ double ahi = 0, alo, vh, t; \ ob = (stbsp__int64)ph; \ vh = (double)ob; \ ahi = (xh - vh); \ t = (ahi - xh); \ alo = (xh - (ahi - t)) - (vh + t); \ ob += (stbsp__int64)(ahi + alo + xl); \ } #define stbsp__ddrenorm(oh, ol) \ { \ double s; \ s = oh + ol; \ ol = ol - (s - oh); \ oh = s; \ } #define stbsp__ddmultlo(oh, ol, xh, xl, yh, yl) ol = ol + (xh * yl + xl * yh); #define stbsp__ddmultlos(oh, ol, xh, yl) ol = ol + (xh * yl); static void stbsp__raise_to_power10(double *ohi, double *olo, double d, stbsp__int32 power) // power can be -323 to +350 { double ph, pl; if ((power >= 0) && (power <= 22)) { stbsp__ddmulthi(ph, pl, d, stbsp__bot[power]); } else { stbsp__int32 e, et, eb; double p2h, p2l; e = power; if (power < 0) e = -e; et = (e * 0x2c9) >> 14; /* %23 */ if (et > 13) et = 13; eb = e - (et * 23); ph = d; pl = 0.0; if (power < 0) { if (eb) { --eb; stbsp__ddmulthi(ph, pl, d, stbsp__negbot[eb]); stbsp__ddmultlos(ph, pl, d, stbsp__negboterr[eb]); } if (et) { stbsp__ddrenorm(ph, pl); --et; stbsp__ddmulthi(p2h, p2l, ph, stbsp__negtop[et]); stbsp__ddmultlo(p2h, p2l, ph, pl, stbsp__negtop[et], stbsp__negtoperr[et]); ph = p2h; pl = p2l; } } else { if (eb) { e = eb; if (eb > 22) eb = 22; e -= eb; stbsp__ddmulthi(ph, pl, d, stbsp__bot[eb]); if (e) { stbsp__ddrenorm(ph, pl); stbsp__ddmulthi(p2h, p2l, ph, stbsp__bot[e]); stbsp__ddmultlos(p2h, p2l, stbsp__bot[e], pl); ph = p2h; pl = p2l; } } if (et) { stbsp__ddrenorm(ph, pl); --et; stbsp__ddmulthi(p2h, p2l, ph, stbsp__top[et]); stbsp__ddmultlo(p2h, p2l, ph, pl, stbsp__top[et], stbsp__toperr[et]); ph = p2h; pl = p2l; } } } stbsp__ddrenorm(ph, pl); *ohi = ph; *olo = pl; } // given a float value, returns the significant bits in bits, and the position of the // decimal point in decimal_pos. +/-INF and NAN are specified by special values // returned in the decimal_pos parameter. // frac_digits is absolute normally, but if you want from first significant digits (got %g and %e), or in 0x80000000 static stbsp__int32 stbsp__real_to_str(char const **start, stbsp__uint32 *len, char *out, stbsp__int32 *decimal_pos, double value, stbsp__uint32 frac_digits) { double d; stbsp__int64 bits = 0; stbsp__int32 expo, e, ng, tens; d = value; STBSP__COPYFP(bits, d); expo = (stbsp__int32)((bits >> 52) & 2047); ng = (stbsp__int32)(bits >> 63); if (ng) d = -d; if (expo == 2047) // is nan or inf? { *start = (bits & ((((stbsp__uint64)1) << 52) - 1)) ? "NaN" : "Inf"; *decimal_pos = STBSP__SPECIAL; *len = 3; return ng; } if (expo == 0) // is zero or denormal { if ((bits << 1) == 0) // do zero { *decimal_pos = 1; *start = out; out[0] = '0'; *len = 1; return ng; } // find the right expo for denormals { stbsp__int64 v = ((stbsp__uint64)1) << 51; while ((bits & v) == 0) { --expo; v >>= 1; } } } // find the decimal exponent as well as the decimal bits of the value { double ph, pl; // log10 estimate - very specifically tweaked to hit or undershoot by no more than 1 of log10 of all expos 1..2046 tens = expo - 1023; tens = (tens < 0) ? ((tens * 617) / 2048) : (((tens * 1233) / 4096) + 1); // move the significant bits into position and stick them into an int stbsp__raise_to_power10(&ph, &pl, d, 18 - tens); // get full as much precision from double-double as possible stbsp__ddtoS64(bits, ph, pl); // check if we undershot if (((stbsp__uint64)bits) >= stbsp__tento19th) ++tens; } // now do the rounding in integer land frac_digits = (frac_digits & 0x80000000) ? ((frac_digits & 0x7ffffff) + 1) : (tens + frac_digits); if ((frac_digits < 24)) { stbsp__uint32 dg = 1; if ((stbsp__uint64)bits >= stbsp__powten[9]) dg = 10; while ((stbsp__uint64)bits >= stbsp__powten[dg]) { ++dg; if (dg == 20) goto noround; } if (frac_digits < dg) { stbsp__uint64 r; // add 0.5 at the right position and round e = dg - frac_digits; if ((stbsp__uint32)e >= 24) goto noround; r = stbsp__powten[e]; bits = bits + (r / 2); if ((stbsp__uint64)bits >= stbsp__powten[dg]) ++tens; bits /= r; } noround:; } // kill long trailing runs of zeros if (bits) { stbsp__uint32 n; for (;;) { if (bits <= 0xffffffff) break; if (bits % 1000) goto donez; bits /= 1000; } n = (stbsp__uint32)bits; while ((n % 1000) == 0) n /= 1000; bits = n; donez:; } // convert to string out += 64; e = 0; for (;;) { stbsp__uint32 n; char *o = out - 8; // do the conversion in chunks of U32s (avoid most 64-bit divides, worth it, constant denomiators be damned) if (bits >= 100000000) { n = (stbsp__uint32)(bits % 100000000); bits /= 100000000; } else { n = (stbsp__uint32)bits; bits = 0; } while (n) { out -= 2; *(stbsp__uint16 *)out = *(stbsp__uint16 *)&stbsp__digitpair[(n % 100) * 2]; n /= 100; e += 2; } if (bits == 0) { if ((e) && (out[0] == '0')) { ++out; --e; } break; } while (out != o) { *--out = '0'; ++e; } } *decimal_pos = tens; *start = out; *len = e; return ng; } #undef stbsp__ddmulthi #undef stbsp__ddrenorm #undef stbsp__ddmultlo #undef stbsp__ddmultlos #undef STBSP__SPECIAL #undef STBSP__COPYFP #endif // STB_SPRINTF_NOFLOAT // clean up #undef stbsp__uint16 #undef stbsp__uint32 #undef stbsp__int32 #undef stbsp__uint64 #undef stbsp__int64 #undef STBSP__UNALIGNED #endif // STB_SPRINTF_IMPLEMENTATION /* ------------------------------------------------------------------------------ This software is available under 2 licenses -- choose whichever you prefer. ------------------------------------------------------------------------------ ALTERNATIVE A - MIT License Copyright (c) 2017 Sean Barrett 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. ------------------------------------------------------------------------------ ALTERNATIVE B - Public Domain (www.unlicense.org) This is free and unencumbered software released into the public domain. Anyone is free to copy, modify, publish, use, compile, sell, or distribute this software, either in source code form or as a compiled binary, for any purpose, commercial or non-commercial, and by any means. In jurisdictions that recognize copyright laws, the author or authors of this software dedicate any and all copyright interest in the software to the public domain. We make this dedication for the benefit of the public at large and to the detriment of our heirs and successors. We intend this dedication to be an overt act of relinquishment in perpetuity of all present and future rights to this software under copyright law. 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 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. ------------------------------------------------------------------------------ */ uTox/third_party/stb/stb/stb_rect_pack.h0000600000175000001440000004706114003056224017372 0ustar rakusers// stb_rect_pack.h - v0.11 - public domain - rectangle packing // Sean Barrett 2014 // // Useful for e.g. packing rectangular textures into an atlas. // Does not do rotation. // // Not necessarily the awesomest packing method, but better than // the totally naive one in stb_truetype (which is primarily what // this is meant to replace). // // Has only had a few tests run, may have issues. // // More docs to come. // // No memory allocations; uses qsort() and assert() from stdlib. // Can override those by defining STBRP_SORT and STBRP_ASSERT. // // This library currently uses the Skyline Bottom-Left algorithm. // // Please note: better rectangle packers are welcome! Please // implement them to the same API, but with a different init // function. // // Credits // // Library // Sean Barrett // Minor features // Martins Mozeiko // github:IntellectualKitty // // Bugfixes / warning fixes // Jeremy Jaussaud // // Version history: // // 0.11 (2017-03-03) return packing success/fail result // 0.10 (2016-10-25) remove cast-away-const to avoid warnings // 0.09 (2016-08-27) fix compiler warnings // 0.08 (2015-09-13) really fix bug with empty rects (w=0 or h=0) // 0.07 (2015-09-13) fix bug with empty rects (w=0 or h=0) // 0.06 (2015-04-15) added STBRP_SORT to allow replacing qsort // 0.05: added STBRP_ASSERT to allow replacing assert // 0.04: fixed minor bug in STBRP_LARGE_RECTS support // 0.01: initial release // // LICENSE // // See end of file for license information. ////////////////////////////////////////////////////////////////////////////// // // INCLUDE SECTION // #ifndef STB_INCLUDE_STB_RECT_PACK_H #define STB_INCLUDE_STB_RECT_PACK_H #define STB_RECT_PACK_VERSION 1 #ifdef STBRP_STATIC #define STBRP_DEF static #else #define STBRP_DEF extern #endif #ifdef __cplusplus extern "C" { #endif typedef struct stbrp_context stbrp_context; typedef struct stbrp_node stbrp_node; typedef struct stbrp_rect stbrp_rect; #ifdef STBRP_LARGE_RECTS typedef int stbrp_coord; #else typedef unsigned short stbrp_coord; #endif STBRP_DEF int stbrp_pack_rects (stbrp_context *context, stbrp_rect *rects, int num_rects); // Assign packed locations to rectangles. The rectangles are of type // 'stbrp_rect' defined below, stored in the array 'rects', and there // are 'num_rects' many of them. // // Rectangles which are successfully packed have the 'was_packed' flag // set to a non-zero value and 'x' and 'y' store the minimum location // on each axis (i.e. bottom-left in cartesian coordinates, top-left // if you imagine y increasing downwards). Rectangles which do not fit // have the 'was_packed' flag set to 0. // // You should not try to access the 'rects' array from another thread // while this function is running, as the function temporarily reorders // the array while it executes. // // To pack into another rectangle, you need to call stbrp_init_target // again. To continue packing into the same rectangle, you can call // this function again. Calling this multiple times with multiple rect // arrays will probably produce worse packing results than calling it // a single time with the full rectangle array, but the option is // available. // // The function returns 1 if all of the rectangles were successfully // packed and 0 otherwise. struct stbrp_rect { // reserved for your use: int id; // input: stbrp_coord w, h; // output: stbrp_coord x, y; int was_packed; // non-zero if valid packing }; // 16 bytes, nominally STBRP_DEF void stbrp_init_target (stbrp_context *context, int width, int height, stbrp_node *nodes, int num_nodes); // Initialize a rectangle packer to: // pack a rectangle that is 'width' by 'height' in dimensions // using temporary storage provided by the array 'nodes', which is 'num_nodes' long // // You must call this function every time you start packing into a new target. // // There is no "shutdown" function. The 'nodes' memory must stay valid for // the following stbrp_pack_rects() call (or calls), but can be freed after // the call (or calls) finish. // // Note: to guarantee best results, either: // 1. make sure 'num_nodes' >= 'width' // or 2. call stbrp_allow_out_of_mem() defined below with 'allow_out_of_mem = 1' // // If you don't do either of the above things, widths will be quantized to multiples // of small integers to guarantee the algorithm doesn't run out of temporary storage. // // If you do #2, then the non-quantized algorithm will be used, but the algorithm // may run out of temporary storage and be unable to pack some rectangles. STBRP_DEF void stbrp_setup_allow_out_of_mem (stbrp_context *context, int allow_out_of_mem); // Optionally call this function after init but before doing any packing to // change the handling of the out-of-temp-memory scenario, described above. // If you call init again, this will be reset to the default (false). STBRP_DEF void stbrp_setup_heuristic (stbrp_context *context, int heuristic); // Optionally select which packing heuristic the library should use. Different // heuristics will produce better/worse results for different data sets. // If you call init again, this will be reset to the default. enum { STBRP_HEURISTIC_Skyline_default=0, STBRP_HEURISTIC_Skyline_BL_sortHeight = STBRP_HEURISTIC_Skyline_default, STBRP_HEURISTIC_Skyline_BF_sortHeight }; ////////////////////////////////////////////////////////////////////////////// // // the details of the following structures don't matter to you, but they must // be visible so you can handle the memory allocations for them struct stbrp_node { stbrp_coord x,y; stbrp_node *next; }; struct stbrp_context { int width; int height; int align; int init_mode; int heuristic; int num_nodes; stbrp_node *active_head; stbrp_node *free_head; stbrp_node extra[2]; // we allocate two extra nodes so optimal user-node-count is 'width' not 'width+2' }; #ifdef __cplusplus } #endif #endif ////////////////////////////////////////////////////////////////////////////// // // IMPLEMENTATION SECTION // #ifdef STB_RECT_PACK_IMPLEMENTATION #ifndef STBRP_SORT #include #define STBRP_SORT qsort #endif #ifndef STBRP_ASSERT #include #define STBRP_ASSERT assert #endif #ifdef _MSC_VER #define STBRP__NOTUSED(v) (void)(v) #else #define STBRP__NOTUSED(v) (void)sizeof(v) #endif enum { STBRP__INIT_skyline = 1 }; STBRP_DEF void stbrp_setup_heuristic(stbrp_context *context, int heuristic) { switch (context->init_mode) { case STBRP__INIT_skyline: STBRP_ASSERT(heuristic == STBRP_HEURISTIC_Skyline_BL_sortHeight || heuristic == STBRP_HEURISTIC_Skyline_BF_sortHeight); context->heuristic = heuristic; break; default: STBRP_ASSERT(0); } } STBRP_DEF void stbrp_setup_allow_out_of_mem(stbrp_context *context, int allow_out_of_mem) { if (allow_out_of_mem) // if it's ok to run out of memory, then don't bother aligning them; // this gives better packing, but may fail due to OOM (even though // the rectangles easily fit). @TODO a smarter approach would be to only // quantize once we've hit OOM, then we could get rid of this parameter. context->align = 1; else { // if it's not ok to run out of memory, then quantize the widths // so that num_nodes is always enough nodes. // // I.e. num_nodes * align >= width // align >= width / num_nodes // align = ceil(width/num_nodes) context->align = (context->width + context->num_nodes-1) / context->num_nodes; } } STBRP_DEF void stbrp_init_target(stbrp_context *context, int width, int height, stbrp_node *nodes, int num_nodes) { int i; #ifndef STBRP_LARGE_RECTS STBRP_ASSERT(width <= 0xffff && height <= 0xffff); #endif for (i=0; i < num_nodes-1; ++i) nodes[i].next = &nodes[i+1]; nodes[i].next = NULL; context->init_mode = STBRP__INIT_skyline; context->heuristic = STBRP_HEURISTIC_Skyline_default; context->free_head = &nodes[0]; context->active_head = &context->extra[0]; context->width = width; context->height = height; context->num_nodes = num_nodes; stbrp_setup_allow_out_of_mem(context, 0); // node 0 is the full width, node 1 is the sentinel (lets us not store width explicitly) context->extra[0].x = 0; context->extra[0].y = 0; context->extra[0].next = &context->extra[1]; context->extra[1].x = (stbrp_coord) width; #ifdef STBRP_LARGE_RECTS context->extra[1].y = (1<<30); #else context->extra[1].y = 65535; #endif context->extra[1].next = NULL; } // find minimum y position if it starts at x1 static int stbrp__skyline_find_min_y(stbrp_context *c, stbrp_node *first, int x0, int width, int *pwaste) { stbrp_node *node = first; int x1 = x0 + width; int min_y, visited_width, waste_area; STBRP__NOTUSED(c); STBRP_ASSERT(first->x <= x0); #if 0 // skip in case we're past the node while (node->next->x <= x0) ++node; #else STBRP_ASSERT(node->next->x > x0); // we ended up handling this in the caller for efficiency #endif STBRP_ASSERT(node->x <= x0); min_y = 0; waste_area = 0; visited_width = 0; while (node->x < x1) { if (node->y > min_y) { // raise min_y higher. // we've accounted for all waste up to min_y, // but we'll now add more waste for everything we've visted waste_area += visited_width * (node->y - min_y); min_y = node->y; // the first time through, visited_width might be reduced if (node->x < x0) visited_width += node->next->x - x0; else visited_width += node->next->x - node->x; } else { // add waste area int under_width = node->next->x - node->x; if (under_width + visited_width > width) under_width = width - visited_width; waste_area += under_width * (min_y - node->y); visited_width += under_width; } node = node->next; } *pwaste = waste_area; return min_y; } typedef struct { int x,y; stbrp_node **prev_link; } stbrp__findresult; static stbrp__findresult stbrp__skyline_find_best_pos(stbrp_context *c, int width, int height) { int best_waste = (1<<30), best_x, best_y = (1 << 30); stbrp__findresult fr; stbrp_node **prev, *node, *tail, **best = NULL; // align to multiple of c->align width = (width + c->align - 1); width -= width % c->align; STBRP_ASSERT(width % c->align == 0); node = c->active_head; prev = &c->active_head; while (node->x + width <= c->width) { int y,waste; y = stbrp__skyline_find_min_y(c, node, node->x, width, &waste); if (c->heuristic == STBRP_HEURISTIC_Skyline_BL_sortHeight) { // actually just want to test BL // bottom left if (y < best_y) { best_y = y; best = prev; } } else { // best-fit if (y + height <= c->height) { // can only use it if it first vertically if (y < best_y || (y == best_y && waste < best_waste)) { best_y = y; best_waste = waste; best = prev; } } } prev = &node->next; node = node->next; } best_x = (best == NULL) ? 0 : (*best)->x; // if doing best-fit (BF), we also have to try aligning right edge to each node position // // e.g, if fitting // // ____________________ // |____________________| // // into // // | | // | ____________| // |____________| // // then right-aligned reduces waste, but bottom-left BL is always chooses left-aligned // // This makes BF take about 2x the time if (c->heuristic == STBRP_HEURISTIC_Skyline_BF_sortHeight) { tail = c->active_head; node = c->active_head; prev = &c->active_head; // find first node that's admissible while (tail->x < width) tail = tail->next; while (tail) { int xpos = tail->x - width; int y,waste; STBRP_ASSERT(xpos >= 0); // find the left position that matches this while (node->next->x <= xpos) { prev = &node->next; node = node->next; } STBRP_ASSERT(node->next->x > xpos && node->x <= xpos); y = stbrp__skyline_find_min_y(c, node, xpos, width, &waste); if (y + height < c->height) { if (y <= best_y) { if (y < best_y || waste < best_waste || (waste==best_waste && xpos < best_x)) { best_x = xpos; STBRP_ASSERT(y <= best_y); best_y = y; best_waste = waste; best = prev; } } } tail = tail->next; } } fr.prev_link = best; fr.x = best_x; fr.y = best_y; return fr; } static stbrp__findresult stbrp__skyline_pack_rectangle(stbrp_context *context, int width, int height) { // find best position according to heuristic stbrp__findresult res = stbrp__skyline_find_best_pos(context, width, height); stbrp_node *node, *cur; // bail if: // 1. it failed // 2. the best node doesn't fit (we don't always check this) // 3. we're out of memory if (res.prev_link == NULL || res.y + height > context->height || context->free_head == NULL) { res.prev_link = NULL; return res; } // on success, create new node node = context->free_head; node->x = (stbrp_coord) res.x; node->y = (stbrp_coord) (res.y + height); context->free_head = node->next; // insert the new node into the right starting point, and // let 'cur' point to the remaining nodes needing to be // stiched back in cur = *res.prev_link; if (cur->x < res.x) { // preserve the existing one, so start testing with the next one stbrp_node *next = cur->next; cur->next = node; cur = next; } else { *res.prev_link = node; } // from here, traverse cur and free the nodes, until we get to one // that shouldn't be freed while (cur->next && cur->next->x <= res.x + width) { stbrp_node *next = cur->next; // move the current node to the free list cur->next = context->free_head; context->free_head = cur; cur = next; } // stitch the list back in node->next = cur; if (cur->x < res.x + width) cur->x = (stbrp_coord) (res.x + width); #ifdef _DEBUG cur = context->active_head; while (cur->x < context->width) { STBRP_ASSERT(cur->x < cur->next->x); cur = cur->next; } STBRP_ASSERT(cur->next == NULL); { stbrp_node *L1 = NULL, *L2 = NULL; int count=0; cur = context->active_head; while (cur) { L1 = cur; cur = cur->next; ++count; } cur = context->free_head; while (cur) { L2 = cur; cur = cur->next; ++count; } STBRP_ASSERT(count == context->num_nodes+2); } #endif return res; } static int rect_height_compare(const void *a, const void *b) { const stbrp_rect *p = (const stbrp_rect *) a; const stbrp_rect *q = (const stbrp_rect *) b; if (p->h > q->h) return -1; if (p->h < q->h) return 1; return (p->w > q->w) ? -1 : (p->w < q->w); } static int rect_original_order(const void *a, const void *b) { const stbrp_rect *p = (const stbrp_rect *) a; const stbrp_rect *q = (const stbrp_rect *) b; return (p->was_packed < q->was_packed) ? -1 : (p->was_packed > q->was_packed); } #ifdef STBRP_LARGE_RECTS #define STBRP__MAXVAL 0xffffffff #else #define STBRP__MAXVAL 0xffff #endif STBRP_DEF int stbrp_pack_rects(stbrp_context *context, stbrp_rect *rects, int num_rects) { int i, all_rects_packed = 1; // we use the 'was_packed' field internally to allow sorting/unsorting for (i=0; i < num_rects; ++i) { rects[i].was_packed = i; #ifndef STBRP_LARGE_RECTS STBRP_ASSERT(rects[i].w <= 0xffff && rects[i].h <= 0xffff); #endif } // sort according to heuristic STBRP_SORT(rects, num_rects, sizeof(rects[0]), rect_height_compare); for (i=0; i < num_rects; ++i) { if (rects[i].w == 0 || rects[i].h == 0) { rects[i].x = rects[i].y = 0; // empty rect needs no space } else { stbrp__findresult fr = stbrp__skyline_pack_rectangle(context, rects[i].w, rects[i].h); if (fr.prev_link) { rects[i].x = (stbrp_coord) fr.x; rects[i].y = (stbrp_coord) fr.y; } else { rects[i].x = rects[i].y = STBRP__MAXVAL; } } } // unsort STBRP_SORT(rects, num_rects, sizeof(rects[0]), rect_original_order); // set was_packed flags and all_rects_packed status for (i=0; i < num_rects; ++i) { rects[i].was_packed = !(rects[i].x == STBRP__MAXVAL && rects[i].y == STBRP__MAXVAL); if (!rects[i].was_packed) all_rects_packed = 0; } // return the all_rects_packed status return all_rects_packed; } #endif /* ------------------------------------------------------------------------------ This software is available under 2 licenses -- choose whichever you prefer. ------------------------------------------------------------------------------ ALTERNATIVE A - MIT License Copyright (c) 2017 Sean Barrett 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. ------------------------------------------------------------------------------ ALTERNATIVE B - Public Domain (www.unlicense.org) This is free and unencumbered software released into the public domain. Anyone is free to copy, modify, publish, use, compile, sell, or distribute this software, either in source code form or as a compiled binary, for any purpose, commercial or non-commercial, and by any means. In jurisdictions that recognize copyright laws, the author or authors of this software dedicate any and all copyright interest in the software to the public domain. We make this dedication for the benefit of the public at large and to the detriment of our heirs and successors. We intend this dedication to be an overt act of relinquishment in perpetuity of all present and future rights to this software under copyright law. 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 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. ------------------------------------------------------------------------------ */ uTox/third_party/stb/stb/stb_perlin.h0000600000175000001440000003216614003056224016730 0ustar rakusers// stb_perlin.h - v0.3 - perlin noise // public domain single-file C implementation by Sean Barrett // // LICENSE // // See end of file. // // // to create the implementation, // #define STB_PERLIN_IMPLEMENTATION // in *one* C/CPP file that includes this file. // // // Documentation: // // float stb_perlin_noise3( float x, // float y, // float z, // int x_wrap=0, // int y_wrap=0, // int z_wrap=0) // // This function computes a random value at the coordinate (x,y,z). // Adjacent random values are continuous but the noise fluctuates // its randomness with period 1, i.e. takes on wholly unrelated values // at integer points. Specifically, this implements Ken Perlin's // revised noise function from 2002. // // The "wrap" parameters can be used to create wraparound noise that // wraps at powers of two. The numbers MUST be powers of two. Specify // 0 to mean "don't care". (The noise always wraps every 256 due // details of the implementation, even if you ask for larger or no // wrapping.) // // Fractal Noise: // // Three common fractal noise functions are included, which produce // a wide variety of nice effects depending on the parameters // provided. Note that each function will call stb_perlin_noise3 // 'octaves' times, so this parameter will affect runtime. // // float stb_perlin_ridge_noise3(float x, float y, float z, // float lacunarity, float gain, float offset, int octaves, // int x_wrap, int y_wrap, int z_wrap); // // float stb_perlin_fbm_noise3(float x, float y, float z, // float lacunarity, float gain, int octaves, // int x_wrap, int y_wrap, int z_wrap); // // float stb_perlin_turbulence_noise3(float x, float y, float z, // float lacunarity, float gain,int octaves, // int x_wrap, int y_wrap, int z_wrap); // // Typical values to start playing with: // octaves = 6 -- number of "octaves" of noise3() to sum // lacunarity = ~ 2.0 -- spacing between successive octaves (use exactly 2.0 for wrapping output) // gain = 0.5 -- relative weighting applied to each successive octave // offset = 1.0? -- used to invert the ridges, may need to be larger, not sure // // // Contributors: // Jack Mott - additional noise functions // #ifdef __cplusplus extern "C" { #endif extern float stb_perlin_noise3(float x, float y, float z, int x_wrap, int y_wrap, int z_wrap); extern float stb_perlin_ridge_noise3(float x, float y, float z,float lacunarity, float gain, float offset, int octaves,int x_wrap, int y_wrap, int z_wrap); extern float stb_perlin_fbm_noise3(float x, float y, float z,float lacunarity, float gain, int octaves,int x_wrap, int y_wrap, int z_wrap); extern float stb_perlin_turbulence_noise3(float x, float y, float z, float lacunarity, float gain, int octaves,int x_wrap, int y_wrap, int z_wrap); #ifdef __cplusplus } #endif #ifdef STB_PERLIN_IMPLEMENTATION // not same permutation table as Perlin's reference to avoid copyright issues; // Perlin's table can be found at http://mrl.nyu.edu/~perlin/noise/ // @OPTIMIZE: should this be unsigned char instead of int for cache? static unsigned char stb__perlin_randtab[512] = { 23, 125, 161, 52, 103, 117, 70, 37, 247, 101, 203, 169, 124, 126, 44, 123, 152, 238, 145, 45, 171, 114, 253, 10, 192, 136, 4, 157, 249, 30, 35, 72, 175, 63, 77, 90, 181, 16, 96, 111, 133, 104, 75, 162, 93, 56, 66, 240, 8, 50, 84, 229, 49, 210, 173, 239, 141, 1, 87, 18, 2, 198, 143, 57, 225, 160, 58, 217, 168, 206, 245, 204, 199, 6, 73, 60, 20, 230, 211, 233, 94, 200, 88, 9, 74, 155, 33, 15, 219, 130, 226, 202, 83, 236, 42, 172, 165, 218, 55, 222, 46, 107, 98, 154, 109, 67, 196, 178, 127, 158, 13, 243, 65, 79, 166, 248, 25, 224, 115, 80, 68, 51, 184, 128, 232, 208, 151, 122, 26, 212, 105, 43, 179, 213, 235, 148, 146, 89, 14, 195, 28, 78, 112, 76, 250, 47, 24, 251, 140, 108, 186, 190, 228, 170, 183, 139, 39, 188, 244, 246, 132, 48, 119, 144, 180, 138, 134, 193, 82, 182, 120, 121, 86, 220, 209, 3, 91, 241, 149, 85, 205, 150, 113, 216, 31, 100, 41, 164, 177, 214, 153, 231, 38, 71, 185, 174, 97, 201, 29, 95, 7, 92, 54, 254, 191, 118, 34, 221, 131, 11, 163, 99, 234, 81, 227, 147, 156, 176, 17, 142, 69, 12, 110, 62, 27, 255, 0, 194, 59, 116, 242, 252, 19, 21, 187, 53, 207, 129, 64, 135, 61, 40, 167, 237, 102, 223, 106, 159, 197, 189, 215, 137, 36, 32, 22, 5, // and a second copy so we don't need an extra mask or static initializer 23, 125, 161, 52, 103, 117, 70, 37, 247, 101, 203, 169, 124, 126, 44, 123, 152, 238, 145, 45, 171, 114, 253, 10, 192, 136, 4, 157, 249, 30, 35, 72, 175, 63, 77, 90, 181, 16, 96, 111, 133, 104, 75, 162, 93, 56, 66, 240, 8, 50, 84, 229, 49, 210, 173, 239, 141, 1, 87, 18, 2, 198, 143, 57, 225, 160, 58, 217, 168, 206, 245, 204, 199, 6, 73, 60, 20, 230, 211, 233, 94, 200, 88, 9, 74, 155, 33, 15, 219, 130, 226, 202, 83, 236, 42, 172, 165, 218, 55, 222, 46, 107, 98, 154, 109, 67, 196, 178, 127, 158, 13, 243, 65, 79, 166, 248, 25, 224, 115, 80, 68, 51, 184, 128, 232, 208, 151, 122, 26, 212, 105, 43, 179, 213, 235, 148, 146, 89, 14, 195, 28, 78, 112, 76, 250, 47, 24, 251, 140, 108, 186, 190, 228, 170, 183, 139, 39, 188, 244, 246, 132, 48, 119, 144, 180, 138, 134, 193, 82, 182, 120, 121, 86, 220, 209, 3, 91, 241, 149, 85, 205, 150, 113, 216, 31, 100, 41, 164, 177, 214, 153, 231, 38, 71, 185, 174, 97, 201, 29, 95, 7, 92, 54, 254, 191, 118, 34, 221, 131, 11, 163, 99, 234, 81, 227, 147, 156, 176, 17, 142, 69, 12, 110, 62, 27, 255, 0, 194, 59, 116, 242, 252, 19, 21, 187, 53, 207, 129, 64, 135, 61, 40, 167, 237, 102, 223, 106, 159, 197, 189, 215, 137, 36, 32, 22, 5, }; static float stb__perlin_lerp(float a, float b, float t) { return a + (b-a) * t; } static int stb__perlin_fastfloor(float a) { int ai = (int) a; return (a < ai) ? ai-1 : ai; } // different grad function from Perlin's, but easy to modify to match reference static float stb__perlin_grad(int hash, float x, float y, float z) { static float basis[12][4] = { { 1, 1, 0 }, { -1, 1, 0 }, { 1,-1, 0 }, { -1,-1, 0 }, { 1, 0, 1 }, { -1, 0, 1 }, { 1, 0,-1 }, { -1, 0,-1 }, { 0, 1, 1 }, { 0,-1, 1 }, { 0, 1,-1 }, { 0,-1,-1 }, }; // perlin's gradient has 12 cases so some get used 1/16th of the time // and some 2/16ths. We reduce bias by changing those fractions // to 5/64ths and 6/64ths, and the same 4 cases get the extra weight. static unsigned char indices[64] = { 0,1,2,3,4,5,6,7,8,9,10,11, 0,9,1,11, 0,1,2,3,4,5,6,7,8,9,10,11, 0,1,2,3,4,5,6,7,8,9,10,11, 0,1,2,3,4,5,6,7,8,9,10,11, 0,1,2,3,4,5,6,7,8,9,10,11, }; // if you use reference permutation table, change 63 below to 15 to match reference // (this is why the ordering of the table above is funky) float *grad = basis[indices[hash & 63]]; return grad[0]*x + grad[1]*y + grad[2]*z; } float stb_perlin_noise3(float x, float y, float z, int x_wrap, int y_wrap, int z_wrap) { float u,v,w; float n000,n001,n010,n011,n100,n101,n110,n111; float n00,n01,n10,n11; float n0,n1; unsigned int x_mask = (x_wrap-1) & 255; unsigned int y_mask = (y_wrap-1) & 255; unsigned int z_mask = (z_wrap-1) & 255; int px = stb__perlin_fastfloor(x); int py = stb__perlin_fastfloor(y); int pz = stb__perlin_fastfloor(z); int x0 = px & x_mask, x1 = (px+1) & x_mask; int y0 = py & y_mask, y1 = (py+1) & y_mask; int z0 = pz & z_mask, z1 = (pz+1) & z_mask; int r0,r1, r00,r01,r10,r11; #define stb__perlin_ease(a) (((a*6-15)*a + 10) * a * a * a) x -= px; u = stb__perlin_ease(x); y -= py; v = stb__perlin_ease(y); z -= pz; w = stb__perlin_ease(z); r0 = stb__perlin_randtab[x0]; r1 = stb__perlin_randtab[x1]; r00 = stb__perlin_randtab[r0+y0]; r01 = stb__perlin_randtab[r0+y1]; r10 = stb__perlin_randtab[r1+y0]; r11 = stb__perlin_randtab[r1+y1]; n000 = stb__perlin_grad(stb__perlin_randtab[r00+z0], x , y , z ); n001 = stb__perlin_grad(stb__perlin_randtab[r00+z1], x , y , z-1 ); n010 = stb__perlin_grad(stb__perlin_randtab[r01+z0], x , y-1, z ); n011 = stb__perlin_grad(stb__perlin_randtab[r01+z1], x , y-1, z-1 ); n100 = stb__perlin_grad(stb__perlin_randtab[r10+z0], x-1, y , z ); n101 = stb__perlin_grad(stb__perlin_randtab[r10+z1], x-1, y , z-1 ); n110 = stb__perlin_grad(stb__perlin_randtab[r11+z0], x-1, y-1, z ); n111 = stb__perlin_grad(stb__perlin_randtab[r11+z1], x-1, y-1, z-1 ); n00 = stb__perlin_lerp(n000,n001,w); n01 = stb__perlin_lerp(n010,n011,w); n10 = stb__perlin_lerp(n100,n101,w); n11 = stb__perlin_lerp(n110,n111,w); n0 = stb__perlin_lerp(n00,n01,v); n1 = stb__perlin_lerp(n10,n11,v); return stb__perlin_lerp(n0,n1,u); } float stb_perlin_ridge_noise3(float x, float y, float z,float lacunarity, float gain, float offset, int octaves,int x_wrap, int y_wrap, int z_wrap) { int i; float frequency = 1.0f; float prev = 1.0f; float amplitude = 0.5f; float sum = 0.0f; for (i = 0; i < octaves; i++) { float r = (float)(stb_perlin_noise3(x*frequency,y*frequency,z*frequency,x_wrap,y_wrap,z_wrap)); r = r<0 ? -r : r; // fabs() r = offset - r; r = r*r; sum += r*amplitude*prev; prev = r; frequency *= lacunarity; amplitude *= gain; } return sum; } float stb_perlin_fbm_noise3(float x, float y, float z,float lacunarity, float gain, int octaves,int x_wrap, int y_wrap, int z_wrap) { int i; float frequency = 1.0f; float amplitude = 1.0f; float sum = 0.0f; for (i = 0; i < octaves; i++) { sum += stb_perlin_noise3(x*frequency,y*frequency,z*frequency,x_wrap,y_wrap,z_wrap)*amplitude; frequency *= lacunarity; amplitude *= gain; } return sum; } float stb_perlin_turbulence_noise3(float x, float y, float z, float lacunarity, float gain, int octaves,int x_wrap, int y_wrap, int z_wrap) { int i; float frequency = 1.0f; float amplitude = 1.0f; float sum = 0.0f; for (i = 0; i < octaves; i++) { float r = stb_perlin_noise3(x*frequency,y*frequency,z*frequency,x_wrap,y_wrap,z_wrap)*amplitude; r = r<0 ? -r : r; // fabs() sum += r; frequency *= lacunarity; amplitude *= gain; } return sum; } #endif // STB_PERLIN_IMPLEMENTATION /* ------------------------------------------------------------------------------ This software is available under 2 licenses -- choose whichever you prefer. ------------------------------------------------------------------------------ ALTERNATIVE A - MIT License Copyright (c) 2017 Sean Barrett 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. ------------------------------------------------------------------------------ ALTERNATIVE B - Public Domain (www.unlicense.org) This is free and unencumbered software released into the public domain. Anyone is free to copy, modify, publish, use, compile, sell, or distribute this software, either in source code form or as a compiled binary, for any purpose, commercial or non-commercial, and by any means. In jurisdictions that recognize copyright laws, the author or authors of this software dedicate any and all copyright interest in the software to the public domain. We make this dedication for the benefit of the public at large and to the detriment of our heirs and successors. We intend this dedication to be an overt act of relinquishment in perpetuity of all present and future rights to this software under copyright law. 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 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. ------------------------------------------------------------------------------ */ uTox/third_party/stb/stb/stb_leakcheck.h0000600000175000001440000001550014003056224017342 0ustar rakusers// stb_leakcheck.h - v0.4 - quick & dirty malloc leak-checking - public domain // LICENSE // // See end of file. #ifdef STB_LEAKCHECK_IMPLEMENTATION #undef STB_LEAKCHECK_IMPLEMENTATION // don't implement more than once // if we've already included leakcheck before, undefine the macros #ifdef malloc #undef malloc #undef free #undef realloc #endif #include #include #include #include #include typedef struct malloc_info stb_leakcheck_malloc_info; struct malloc_info { const char *file; int line; size_t size; stb_leakcheck_malloc_info *next,*prev; }; static stb_leakcheck_malloc_info *mi_head; void *stb_leakcheck_malloc(size_t sz, const char *file, int line) { stb_leakcheck_malloc_info *mi = (stb_leakcheck_malloc_info *) malloc(sz + sizeof(*mi)); if (mi == NULL) return mi; mi->file = file; mi->line = line; mi->next = mi_head; if (mi_head) mi->next->prev = mi; mi->prev = NULL; mi->size = (int) sz; mi_head = mi; return mi+1; } void stb_leakcheck_free(void *ptr) { if (ptr != NULL) { stb_leakcheck_malloc_info *mi = (stb_leakcheck_malloc_info *) ptr - 1; mi->size = ~mi->size; #ifndef STB_LEAKCHECK_SHOWALL if (mi->prev == NULL) { assert(mi_head == mi); mi_head = mi->next; } else mi->prev->next = mi->next; if (mi->next) mi->next->prev = mi->prev; #endif free(mi); } } void *stb_leakcheck_realloc(void *ptr, size_t sz, const char *file, int line) { if (ptr == NULL) { return stb_leakcheck_malloc(sz, file, line); } else if (sz == 0) { stb_leakcheck_free(ptr); return NULL; } else { stb_leakcheck_malloc_info *mi = (stb_leakcheck_malloc_info *) ptr - 1; if (sz <= mi->size) return ptr; else { #ifdef STB_LEAKCHECK_REALLOC_PRESERVE_MALLOC_FILELINE void *q = stb_leakcheck_malloc(sz, mi->file, mi->line); #else void *q = stb_leakcheck_malloc(sz, file, line); #endif if (q) { memcpy(q, ptr, mi->size); stb_leakcheck_free(ptr); } return q; } } } static void stblkck_internal_print(const char *reason, const char *file, int line, size_t size, void *ptr) { #if (defined(_MSC_VER) && _MSC_VER < 1900) /* 1900=VS 2015 */ || defined(__MINGW32__) // Compilers that use the old MS C runtime library don't have %zd // and the older ones don't even have %lld either... however, the old compilers // without "long long" don't support 64-bit targets either, so here's the // compromise: #if defined(_MSC_VER) && _MSC_VER < 1400 // before VS 2005 printf("%-6s: %s (%4d): %8d bytes at %p\n", reason, file, line, (int)size, ptr); #else printf("%-6s: %s (%4d): %8lld bytes at %p\n", reason, file, line, (long long)size, ptr); #endif #else // Assume we have %zd on other targets. printf("%-6s: %s (%4d): %zd bytes at %p\n", reason, file, line, size, ptr); #endif } void stb_leakcheck_dumpmem(void) { stb_leakcheck_malloc_info *mi = mi_head; while (mi) { if ((ptrdiff_t) mi->size >= 0) stblkck_internal_print("LEAKED", mi->file, mi->line, mi->size, mi+1); printf("LEAKED: %s (%4d): %8d bytes at %p\n", mi->file, mi->line, (int) mi->size, mi+1); mi = mi->next; } #ifdef STB_LEAKCHECK_SHOWALL mi = mi_head; while (mi) { if ((ptrdiff_t) mi->size < 0) stblkck_internal_print("FREED", mi->file, mi->line, ~mi->size, mi+1); printf("FREED : %s (%4d): %8d bytes at %p\n", mi->file, mi->line, (int) ~mi->size, mi+1); mi = mi->next; } #endif } #endif // STB_LEAKCHECK_IMPLEMENTATION #ifndef INCLUDE_STB_LEAKCHECK_H #define INCLUDE_STB_LEAKCHECK_H #define malloc(sz) stb_leakcheck_malloc(sz, __FILE__, __LINE__) #define free(p) stb_leakcheck_free(p) #define realloc(p,sz) stb_leakcheck_realloc(p,sz, __FILE__, __LINE__) extern void * stb_leakcheck_malloc(size_t sz, const char *file, int line); extern void * stb_leakcheck_realloc(void *ptr, size_t sz, const char *file, int line); extern void stb_leakcheck_free(void *ptr); extern void stb_leakcheck_dumpmem(void); #endif // INCLUDE_STB_LEAKCHECK_H /* ------------------------------------------------------------------------------ This software is available under 2 licenses -- choose whichever you prefer. ------------------------------------------------------------------------------ ALTERNATIVE A - MIT License Copyright (c) 2017 Sean Barrett 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. ------------------------------------------------------------------------------ ALTERNATIVE B - Public Domain (www.unlicense.org) This is free and unencumbered software released into the public domain. Anyone is free to copy, modify, publish, use, compile, sell, or distribute this software, either in source code form or as a compiled binary, for any purpose, commercial or non-commercial, and by any means. In jurisdictions that recognize copyright laws, the author or authors of this software dedicate any and all copyright interest in the software to the public domain. We make this dedication for the benefit of the public at large and to the detriment of our heirs and successors. We intend this dedication to be an overt act of relinquishment in perpetuity of all present and future rights to this software under copyright law. 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 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. ------------------------------------------------------------------------------ */ uTox/third_party/stb/stb/stb_image_write.h0000600000175000001440000016521014003056224017730 0ustar rakusers/* stb_image_write - v1.07 - public domain - http://nothings.org/stb/stb_image_write.h writes out PNG/BMP/TGA/JPEG/HDR images to C stdio - Sean Barrett 2010-2015 no warranty implied; use at your own risk Before #including, #define STB_IMAGE_WRITE_IMPLEMENTATION in the file that you want to have the implementation. Will probably not work correctly with strict-aliasing optimizations. ABOUT: This header file is a library for writing images to C stdio. It could be adapted to write to memory or a general streaming interface; let me know. The PNG output is not optimal; it is 20-50% larger than the file written by a decent optimizing implementation. This library is designed for source code compactness and simplicity, not optimal image file size or run-time performance. BUILDING: You can #define STBIW_ASSERT(x) before the #include to avoid using assert.h. You can #define STBIW_MALLOC(), STBIW_REALLOC(), and STBIW_FREE() to replace malloc,realloc,free. You can define STBIW_MEMMOVE() to replace memmove() USAGE: There are four functions, one for each image file format: int stbi_write_png(char const *filename, int w, int h, int comp, const void *data, int stride_in_bytes); int stbi_write_bmp(char const *filename, int w, int h, int comp, const void *data); int stbi_write_tga(char const *filename, int w, int h, int comp, const void *data); int stbi_write_hdr(char const *filename, int w, int h, int comp, const float *data); int stbi_write_jpg(char const *filename, int w, int h, int comp, const float *data); There are also four equivalent functions that use an arbitrary write function. You are expected to open/close your file-equivalent before and after calling these: int stbi_write_png_to_func(stbi_write_func *func, void *context, int w, int h, int comp, const void *data, int stride_in_bytes); int stbi_write_bmp_to_func(stbi_write_func *func, void *context, int w, int h, int comp, const void *data); int stbi_write_tga_to_func(stbi_write_func *func, void *context, int w, int h, int comp, const void *data); int stbi_write_hdr_to_func(stbi_write_func *func, void *context, int w, int h, int comp, const float *data); int stbi_write_jpg_to_func(stbi_write_func *func, void *context, int x, int y, int comp, const void *data, int quality); where the callback is: void stbi_write_func(void *context, void *data, int size); You can define STBI_WRITE_NO_STDIO to disable the file variant of these functions, so the library will not use stdio.h at all. However, this will also disable HDR writing, because it requires stdio for formatted output. Each function returns 0 on failure and non-0 on success. The functions create an image file defined by the parameters. The image is a rectangle of pixels stored from left-to-right, top-to-bottom. Each pixel contains 'comp' channels of data stored interleaved with 8-bits per channel, in the following order: 1=Y, 2=YA, 3=RGB, 4=RGBA. (Y is monochrome color.) The rectangle is 'w' pixels wide and 'h' pixels tall. The *data pointer points to the first byte of the top-left-most pixel. For PNG, "stride_in_bytes" is the distance in bytes from the first byte of a row of pixels to the first byte of the next row of pixels. PNG creates output files with the same number of components as the input. The BMP format expands Y to RGB in the file format and does not output alpha. PNG supports writing rectangles of data even when the bytes storing rows of data are not consecutive in memory (e.g. sub-rectangles of a larger image), by supplying the stride between the beginning of adjacent rows. The other formats do not. (Thus you cannot write a native-format BMP through the BMP writer, both because it is in BGR order and because it may have padding at the end of the line.) HDR expects linear float data. Since the format is always 32-bit rgb(e) data, alpha (if provided) is discarded, and for monochrome data it is replicated across all three channels. TGA supports RLE or non-RLE compressed data. To use non-RLE-compressed data, set the global variable 'stbi_write_tga_with_rle' to 0. JPEG does ignore alpha channels in input data; quality is between 1 and 100. Higher quality looks better but results in a bigger image. JPEG baseline (no JPEG progressive). CREDITS: PNG/BMP/TGA Sean Barrett HDR Baldur Karlsson TGA monochrome: Jean-Sebastien Guay misc enhancements: Tim Kelsey TGA RLE Alan Hickman initial file IO callback implementation Emmanuel Julien JPEG Jon Olick (original jo_jpeg.cpp code) Daniel Gibson bugfixes: github:Chribba Guillaume Chereau github:jry2 github:romigrou Sergio Gonzalez Jonas Karlsson Filip Wasil Thatcher Ulrich github:poppolopoppo Patrick Boettcher LICENSE See end of file for license information. */ #ifndef INCLUDE_STB_IMAGE_WRITE_H #define INCLUDE_STB_IMAGE_WRITE_H #ifdef __cplusplus extern "C" { #endif #ifdef STB_IMAGE_WRITE_STATIC #define STBIWDEF static #else #define STBIWDEF extern extern int stbi_write_tga_with_rle; #endif #ifndef STBI_WRITE_NO_STDIO STBIWDEF int stbi_write_png(char const *filename, int w, int h, int comp, const void *data, int stride_in_bytes); STBIWDEF int stbi_write_bmp(char const *filename, int w, int h, int comp, const void *data); STBIWDEF int stbi_write_tga(char const *filename, int w, int h, int comp, const void *data); STBIWDEF int stbi_write_hdr(char const *filename, int w, int h, int comp, const float *data); STBIWDEF int stbi_write_jpg(char const *filename, int x, int y, int comp, const void *data, int quality); #endif typedef void stbi_write_func(void *context, void *data, int size); STBIWDEF int stbi_write_png_to_func(stbi_write_func *func, void *context, int w, int h, int comp, const void *data, int stride_in_bytes); STBIWDEF int stbi_write_bmp_to_func(stbi_write_func *func, void *context, int w, int h, int comp, const void *data); STBIWDEF int stbi_write_tga_to_func(stbi_write_func *func, void *context, int w, int h, int comp, const void *data); STBIWDEF int stbi_write_hdr_to_func(stbi_write_func *func, void *context, int w, int h, int comp, const float *data); STBIWDEF int stbi_write_jpg_to_func(stbi_write_func *func, void *context, int x, int y, int comp, const void *data, int quality); #ifdef __cplusplus } #endif #endif//INCLUDE_STB_IMAGE_WRITE_H #ifdef STB_IMAGE_WRITE_IMPLEMENTATION #ifdef _WIN32 #ifndef _CRT_SECURE_NO_WARNINGS #define _CRT_SECURE_NO_WARNINGS #endif #ifndef _CRT_NONSTDC_NO_DEPRECATE #define _CRT_NONSTDC_NO_DEPRECATE #endif #endif #ifndef STBI_WRITE_NO_STDIO #include #endif // STBI_WRITE_NO_STDIO #include #include #include #include #if defined(STBIW_MALLOC) && defined(STBIW_FREE) && (defined(STBIW_REALLOC) || defined(STBIW_REALLOC_SIZED)) // ok #elif !defined(STBIW_MALLOC) && !defined(STBIW_FREE) && !defined(STBIW_REALLOC) && !defined(STBIW_REALLOC_SIZED) // ok #else #error "Must define all or none of STBIW_MALLOC, STBIW_FREE, and STBIW_REALLOC (or STBIW_REALLOC_SIZED)." #endif #ifndef STBIW_MALLOC #define STBIW_MALLOC(sz) malloc(sz) #define STBIW_REALLOC(p,newsz) realloc(p,newsz) #define STBIW_FREE(p) free(p) #endif #ifndef STBIW_REALLOC_SIZED #define STBIW_REALLOC_SIZED(p,oldsz,newsz) STBIW_REALLOC(p,newsz) #endif #ifndef STBIW_MEMMOVE #define STBIW_MEMMOVE(a,b,sz) memmove(a,b,sz) #endif #ifndef STBIW_ASSERT #include #define STBIW_ASSERT(x) assert(x) #endif #define STBIW_UCHAR(x) (unsigned char) ((x) & 0xff) typedef struct { stbi_write_func *func; void *context; } stbi__write_context; // initialize a callback-based context static void stbi__start_write_callbacks(stbi__write_context *s, stbi_write_func *c, void *context) { s->func = c; s->context = context; } #ifndef STBI_WRITE_NO_STDIO static void stbi__stdio_write(void *context, void *data, int size) { fwrite(data,1,size,(FILE*) context); } static int stbi__start_write_file(stbi__write_context *s, const char *filename) { FILE *f = fopen(filename, "wb"); stbi__start_write_callbacks(s, stbi__stdio_write, (void *) f); return f != NULL; } static void stbi__end_write_file(stbi__write_context *s) { fclose((FILE *)s->context); } #endif // !STBI_WRITE_NO_STDIO typedef unsigned int stbiw_uint32; typedef int stb_image_write_test[sizeof(stbiw_uint32)==4 ? 1 : -1]; #ifdef STB_IMAGE_WRITE_STATIC static int stbi_write_tga_with_rle = 1; #else int stbi_write_tga_with_rle = 1; #endif static void stbiw__writefv(stbi__write_context *s, const char *fmt, va_list v) { while (*fmt) { switch (*fmt++) { case ' ': break; case '1': { unsigned char x = STBIW_UCHAR(va_arg(v, int)); s->func(s->context,&x,1); break; } case '2': { int x = va_arg(v,int); unsigned char b[2]; b[0] = STBIW_UCHAR(x); b[1] = STBIW_UCHAR(x>>8); s->func(s->context,b,2); break; } case '4': { stbiw_uint32 x = va_arg(v,int); unsigned char b[4]; b[0]=STBIW_UCHAR(x); b[1]=STBIW_UCHAR(x>>8); b[2]=STBIW_UCHAR(x>>16); b[3]=STBIW_UCHAR(x>>24); s->func(s->context,b,4); break; } default: STBIW_ASSERT(0); return; } } } static void stbiw__writef(stbi__write_context *s, const char *fmt, ...) { va_list v; va_start(v, fmt); stbiw__writefv(s, fmt, v); va_end(v); } static void stbiw__putc(stbi__write_context *s, unsigned char c) { s->func(s->context, &c, 1); } static void stbiw__write3(stbi__write_context *s, unsigned char a, unsigned char b, unsigned char c) { unsigned char arr[3]; arr[0] = a, arr[1] = b, arr[2] = c; s->func(s->context, arr, 3); } static void stbiw__write_pixel(stbi__write_context *s, int rgb_dir, int comp, int write_alpha, int expand_mono, unsigned char *d) { unsigned char bg[3] = { 255, 0, 255}, px[3]; int k; if (write_alpha < 0) s->func(s->context, &d[comp - 1], 1); switch (comp) { case 2: // 2 pixels = mono + alpha, alpha is written separately, so same as 1-channel case case 1: if (expand_mono) stbiw__write3(s, d[0], d[0], d[0]); // monochrome bmp else s->func(s->context, d, 1); // monochrome TGA break; case 4: if (!write_alpha) { // composite against pink background for (k = 0; k < 3; ++k) px[k] = bg[k] + ((d[k] - bg[k]) * d[3]) / 255; stbiw__write3(s, px[1 - rgb_dir], px[1], px[1 + rgb_dir]); break; } /* FALLTHROUGH */ case 3: stbiw__write3(s, d[1 - rgb_dir], d[1], d[1 + rgb_dir]); break; } if (write_alpha > 0) s->func(s->context, &d[comp - 1], 1); } static void stbiw__write_pixels(stbi__write_context *s, int rgb_dir, int vdir, int x, int y, int comp, void *data, int write_alpha, int scanline_pad, int expand_mono) { stbiw_uint32 zero = 0; int i,j, j_end; if (y <= 0) return; if (vdir < 0) j_end = -1, j = y-1; else j_end = y, j = 0; for (; j != j_end; j += vdir) { for (i=0; i < x; ++i) { unsigned char *d = (unsigned char *) data + (j*x+i)*comp; stbiw__write_pixel(s, rgb_dir, comp, write_alpha, expand_mono, d); } s->func(s->context, &zero, scanline_pad); } } static int stbiw__outfile(stbi__write_context *s, int rgb_dir, int vdir, int x, int y, int comp, int expand_mono, void *data, int alpha, int pad, const char *fmt, ...) { if (y < 0 || x < 0) { return 0; } else { va_list v; va_start(v, fmt); stbiw__writefv(s, fmt, v); va_end(v); stbiw__write_pixels(s,rgb_dir,vdir,x,y,comp,data,alpha,pad, expand_mono); return 1; } } static int stbi_write_bmp_core(stbi__write_context *s, int x, int y, int comp, const void *data) { int pad = (-x*3) & 3; return stbiw__outfile(s,-1,-1,x,y,comp,1,(void *) data,0,pad, "11 4 22 4" "4 44 22 444444", 'B', 'M', 14+40+(x*3+pad)*y, 0,0, 14+40, // file header 40, x,y, 1,24, 0,0,0,0,0,0); // bitmap header } STBIWDEF int stbi_write_bmp_to_func(stbi_write_func *func, void *context, int x, int y, int comp, const void *data) { stbi__write_context s; stbi__start_write_callbacks(&s, func, context); return stbi_write_bmp_core(&s, x, y, comp, data); } #ifndef STBI_WRITE_NO_STDIO STBIWDEF int stbi_write_bmp(char const *filename, int x, int y, int comp, const void *data) { stbi__write_context s; if (stbi__start_write_file(&s,filename)) { int r = stbi_write_bmp_core(&s, x, y, comp, data); stbi__end_write_file(&s); return r; } else return 0; } #endif //!STBI_WRITE_NO_STDIO static int stbi_write_tga_core(stbi__write_context *s, int x, int y, int comp, void *data) { int has_alpha = (comp == 2 || comp == 4); int colorbytes = has_alpha ? comp-1 : comp; int format = colorbytes < 2 ? 3 : 2; // 3 color channels (RGB/RGBA) = 2, 1 color channel (Y/YA) = 3 if (y < 0 || x < 0) return 0; if (!stbi_write_tga_with_rle) { return stbiw__outfile(s, -1, -1, x, y, comp, 0, (void *) data, has_alpha, 0, "111 221 2222 11", 0, 0, format, 0, 0, 0, 0, 0, x, y, (colorbytes + has_alpha) * 8, has_alpha * 8); } else { int i,j,k; stbiw__writef(s, "111 221 2222 11", 0,0,format+8, 0,0,0, 0,0,x,y, (colorbytes + has_alpha) * 8, has_alpha * 8); for (j = y - 1; j >= 0; --j) { unsigned char *row = (unsigned char *) data + j * x * comp; int len; for (i = 0; i < x; i += len) { unsigned char *begin = row + i * comp; int diff = 1; len = 1; if (i < x - 1) { ++len; diff = memcmp(begin, row + (i + 1) * comp, comp); if (diff) { const unsigned char *prev = begin; for (k = i + 2; k < x && len < 128; ++k) { if (memcmp(prev, row + k * comp, comp)) { prev += comp; ++len; } else { --len; break; } } } else { for (k = i + 2; k < x && len < 128; ++k) { if (!memcmp(begin, row + k * comp, comp)) { ++len; } else { break; } } } } if (diff) { unsigned char header = STBIW_UCHAR(len - 1); s->func(s->context, &header, 1); for (k = 0; k < len; ++k) { stbiw__write_pixel(s, -1, comp, has_alpha, 0, begin + k * comp); } } else { unsigned char header = STBIW_UCHAR(len - 129); s->func(s->context, &header, 1); stbiw__write_pixel(s, -1, comp, has_alpha, 0, begin); } } } } return 1; } STBIWDEF int stbi_write_tga_to_func(stbi_write_func *func, void *context, int x, int y, int comp, const void *data) { stbi__write_context s; stbi__start_write_callbacks(&s, func, context); return stbi_write_tga_core(&s, x, y, comp, (void *) data); } #ifndef STBI_WRITE_NO_STDIO STBIWDEF int stbi_write_tga(char const *filename, int x, int y, int comp, const void *data) { stbi__write_context s; if (stbi__start_write_file(&s,filename)) { int r = stbi_write_tga_core(&s, x, y, comp, (void *) data); stbi__end_write_file(&s); return r; } else return 0; } #endif // ************************************************************************************************* // Radiance RGBE HDR writer // by Baldur Karlsson #define stbiw__max(a, b) ((a) > (b) ? (a) : (b)) void stbiw__linear_to_rgbe(unsigned char *rgbe, float *linear) { int exponent; float maxcomp = stbiw__max(linear[0], stbiw__max(linear[1], linear[2])); if (maxcomp < 1e-32f) { rgbe[0] = rgbe[1] = rgbe[2] = rgbe[3] = 0; } else { float normalize = (float) frexp(maxcomp, &exponent) * 256.0f/maxcomp; rgbe[0] = (unsigned char)(linear[0] * normalize); rgbe[1] = (unsigned char)(linear[1] * normalize); rgbe[2] = (unsigned char)(linear[2] * normalize); rgbe[3] = (unsigned char)(exponent + 128); } } void stbiw__write_run_data(stbi__write_context *s, int length, unsigned char databyte) { unsigned char lengthbyte = STBIW_UCHAR(length+128); STBIW_ASSERT(length+128 <= 255); s->func(s->context, &lengthbyte, 1); s->func(s->context, &databyte, 1); } void stbiw__write_dump_data(stbi__write_context *s, int length, unsigned char *data) { unsigned char lengthbyte = STBIW_UCHAR(length); STBIW_ASSERT(length <= 128); // inconsistent with spec but consistent with official code s->func(s->context, &lengthbyte, 1); s->func(s->context, data, length); } void stbiw__write_hdr_scanline(stbi__write_context *s, int width, int ncomp, unsigned char *scratch, float *scanline) { unsigned char scanlineheader[4] = { 2, 2, 0, 0 }; unsigned char rgbe[4]; float linear[3]; int x; scanlineheader[2] = (width&0xff00)>>8; scanlineheader[3] = (width&0x00ff); /* skip RLE for images too small or large */ if (width < 8 || width >= 32768) { for (x=0; x < width; x++) { switch (ncomp) { case 4: /* fallthrough */ case 3: linear[2] = scanline[x*ncomp + 2]; linear[1] = scanline[x*ncomp + 1]; linear[0] = scanline[x*ncomp + 0]; break; default: linear[0] = linear[1] = linear[2] = scanline[x*ncomp + 0]; break; } stbiw__linear_to_rgbe(rgbe, linear); s->func(s->context, rgbe, 4); } } else { int c,r; /* encode into scratch buffer */ for (x=0; x < width; x++) { switch(ncomp) { case 4: /* fallthrough */ case 3: linear[2] = scanline[x*ncomp + 2]; linear[1] = scanline[x*ncomp + 1]; linear[0] = scanline[x*ncomp + 0]; break; default: linear[0] = linear[1] = linear[2] = scanline[x*ncomp + 0]; break; } stbiw__linear_to_rgbe(rgbe, linear); scratch[x + width*0] = rgbe[0]; scratch[x + width*1] = rgbe[1]; scratch[x + width*2] = rgbe[2]; scratch[x + width*3] = rgbe[3]; } s->func(s->context, scanlineheader, 4); /* RLE each component separately */ for (c=0; c < 4; c++) { unsigned char *comp = &scratch[width*c]; x = 0; while (x < width) { // find first run r = x; while (r+2 < width) { if (comp[r] == comp[r+1] && comp[r] == comp[r+2]) break; ++r; } if (r+2 >= width) r = width; // dump up to first run while (x < r) { int len = r-x; if (len > 128) len = 128; stbiw__write_dump_data(s, len, &comp[x]); x += len; } // if there's a run, output it if (r+2 < width) { // same test as what we break out of in search loop, so only true if we break'd // find next byte after run while (r < width && comp[r] == comp[x]) ++r; // output run up to r while (x < r) { int len = r-x; if (len > 127) len = 127; stbiw__write_run_data(s, len, comp[x]); x += len; } } } } } } static int stbi_write_hdr_core(stbi__write_context *s, int x, int y, int comp, float *data) { if (y <= 0 || x <= 0 || data == NULL) return 0; else { // Each component is stored separately. Allocate scratch space for full output scanline. unsigned char *scratch = (unsigned char *) STBIW_MALLOC(x*4); int i, len; char buffer[128]; char header[] = "#?RADIANCE\n# Written by stb_image_write.h\nFORMAT=32-bit_rle_rgbe\n"; s->func(s->context, header, sizeof(header)-1); len = sprintf(buffer, "EXPOSURE= 1.0000000000000\n\n-Y %d +X %d\n", y, x); s->func(s->context, buffer, len); for(i=0; i < y; i++) stbiw__write_hdr_scanline(s, x, comp, scratch, data + comp*i*x); STBIW_FREE(scratch); return 1; } } STBIWDEF int stbi_write_hdr_to_func(stbi_write_func *func, void *context, int x, int y, int comp, const float *data) { stbi__write_context s; stbi__start_write_callbacks(&s, func, context); return stbi_write_hdr_core(&s, x, y, comp, (float *) data); } #ifndef STBI_WRITE_NO_STDIO STBIWDEF int stbi_write_hdr(char const *filename, int x, int y, int comp, const float *data) { stbi__write_context s; if (stbi__start_write_file(&s,filename)) { int r = stbi_write_hdr_core(&s, x, y, comp, (float *) data); stbi__end_write_file(&s); return r; } else return 0; } #endif // STBI_WRITE_NO_STDIO ////////////////////////////////////////////////////////////////////////////// // // PNG writer // // stretchy buffer; stbiw__sbpush() == vector<>::push_back() -- stbiw__sbcount() == vector<>::size() #define stbiw__sbraw(a) ((int *) (a) - 2) #define stbiw__sbm(a) stbiw__sbraw(a)[0] #define stbiw__sbn(a) stbiw__sbraw(a)[1] #define stbiw__sbneedgrow(a,n) ((a)==0 || stbiw__sbn(a)+n >= stbiw__sbm(a)) #define stbiw__sbmaybegrow(a,n) (stbiw__sbneedgrow(a,(n)) ? stbiw__sbgrow(a,n) : 0) #define stbiw__sbgrow(a,n) stbiw__sbgrowf((void **) &(a), (n), sizeof(*(a))) #define stbiw__sbpush(a, v) (stbiw__sbmaybegrow(a,1), (a)[stbiw__sbn(a)++] = (v)) #define stbiw__sbcount(a) ((a) ? stbiw__sbn(a) : 0) #define stbiw__sbfree(a) ((a) ? STBIW_FREE(stbiw__sbraw(a)),0 : 0) static void *stbiw__sbgrowf(void **arr, int increment, int itemsize) { int m = *arr ? 2*stbiw__sbm(*arr)+increment : increment+1; void *p = STBIW_REALLOC_SIZED(*arr ? stbiw__sbraw(*arr) : 0, *arr ? (stbiw__sbm(*arr)*itemsize + sizeof(int)*2) : 0, itemsize * m + sizeof(int)*2); STBIW_ASSERT(p); if (p) { if (!*arr) ((int *) p)[1] = 0; *arr = (void *) ((int *) p + 2); stbiw__sbm(*arr) = m; } return *arr; } static unsigned char *stbiw__zlib_flushf(unsigned char *data, unsigned int *bitbuffer, int *bitcount) { while (*bitcount >= 8) { stbiw__sbpush(data, STBIW_UCHAR(*bitbuffer)); *bitbuffer >>= 8; *bitcount -= 8; } return data; } static int stbiw__zlib_bitrev(int code, int codebits) { int res=0; while (codebits--) { res = (res << 1) | (code & 1); code >>= 1; } return res; } static unsigned int stbiw__zlib_countm(unsigned char *a, unsigned char *b, int limit) { int i; for (i=0; i < limit && i < 258; ++i) if (a[i] != b[i]) break; return i; } static unsigned int stbiw__zhash(unsigned char *data) { stbiw_uint32 hash = data[0] + (data[1] << 8) + (data[2] << 16); hash ^= hash << 3; hash += hash >> 5; hash ^= hash << 4; hash += hash >> 17; hash ^= hash << 25; hash += hash >> 6; return hash; } #define stbiw__zlib_flush() (out = stbiw__zlib_flushf(out, &bitbuf, &bitcount)) #define stbiw__zlib_add(code,codebits) \ (bitbuf |= (code) << bitcount, bitcount += (codebits), stbiw__zlib_flush()) #define stbiw__zlib_huffa(b,c) stbiw__zlib_add(stbiw__zlib_bitrev(b,c),c) // default huffman tables #define stbiw__zlib_huff1(n) stbiw__zlib_huffa(0x30 + (n), 8) #define stbiw__zlib_huff2(n) stbiw__zlib_huffa(0x190 + (n)-144, 9) #define stbiw__zlib_huff3(n) stbiw__zlib_huffa(0 + (n)-256,7) #define stbiw__zlib_huff4(n) stbiw__zlib_huffa(0xc0 + (n)-280,8) #define stbiw__zlib_huff(n) ((n) <= 143 ? stbiw__zlib_huff1(n) : (n) <= 255 ? stbiw__zlib_huff2(n) : (n) <= 279 ? stbiw__zlib_huff3(n) : stbiw__zlib_huff4(n)) #define stbiw__zlib_huffb(n) ((n) <= 143 ? stbiw__zlib_huff1(n) : stbiw__zlib_huff2(n)) #define stbiw__ZHASH 16384 unsigned char * stbi_zlib_compress(unsigned char *data, int data_len, int *out_len, int quality) { static unsigned short lengthc[] = { 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, 259 }; static unsigned char lengtheb[]= { 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 unsigned short distc[] = { 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, 32768 }; static unsigned char disteb[] = { 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 }; unsigned int bitbuf=0; int i,j, bitcount=0; unsigned char *out = NULL; unsigned char ***hash_table = (unsigned char***) STBIW_MALLOC(stbiw__ZHASH * sizeof(char**)); if (quality < 5) quality = 5; stbiw__sbpush(out, 0x78); // DEFLATE 32K window stbiw__sbpush(out, 0x5e); // FLEVEL = 1 stbiw__zlib_add(1,1); // BFINAL = 1 stbiw__zlib_add(1,2); // BTYPE = 1 -- fixed huffman for (i=0; i < stbiw__ZHASH; ++i) hash_table[i] = NULL; i=0; while (i < data_len-3) { // hash next 3 bytes of data to be compressed int h = stbiw__zhash(data+i)&(stbiw__ZHASH-1), best=3; unsigned char *bestloc = 0; unsigned char **hlist = hash_table[h]; int n = stbiw__sbcount(hlist); for (j=0; j < n; ++j) { if (hlist[j]-data > i-32768) { // if entry lies within window int d = stbiw__zlib_countm(hlist[j], data+i, data_len-i); if (d >= best) best=d,bestloc=hlist[j]; } } // when hash table entry is too long, delete half the entries if (hash_table[h] && stbiw__sbn(hash_table[h]) == 2*quality) { STBIW_MEMMOVE(hash_table[h], hash_table[h]+quality, sizeof(hash_table[h][0])*quality); stbiw__sbn(hash_table[h]) = quality; } stbiw__sbpush(hash_table[h],data+i); if (bestloc) { // "lazy matching" - check match at *next* byte, and if it's better, do cur byte as literal h = stbiw__zhash(data+i+1)&(stbiw__ZHASH-1); hlist = hash_table[h]; n = stbiw__sbcount(hlist); for (j=0; j < n; ++j) { if (hlist[j]-data > i-32767) { int e = stbiw__zlib_countm(hlist[j], data+i+1, data_len-i-1); if (e > best) { // if next match is better, bail on current match bestloc = NULL; break; } } } } if (bestloc) { int d = (int) (data+i - bestloc); // distance back STBIW_ASSERT(d <= 32767 && best <= 258); for (j=0; best > lengthc[j+1]-1; ++j); stbiw__zlib_huff(j+257); if (lengtheb[j]) stbiw__zlib_add(best - lengthc[j], lengtheb[j]); for (j=0; d > distc[j+1]-1; ++j); stbiw__zlib_add(stbiw__zlib_bitrev(j,5),5); if (disteb[j]) stbiw__zlib_add(d - distc[j], disteb[j]); i += best; } else { stbiw__zlib_huffb(data[i]); ++i; } } // write out final bytes for (;i < data_len; ++i) stbiw__zlib_huffb(data[i]); stbiw__zlib_huff(256); // end of block // pad with 0 bits to byte boundary while (bitcount) stbiw__zlib_add(0,1); for (i=0; i < stbiw__ZHASH; ++i) (void) stbiw__sbfree(hash_table[i]); STBIW_FREE(hash_table); { // compute adler32 on input unsigned int s1=1, s2=0; int blocklen = (int) (data_len % 5552); j=0; while (j < data_len) { for (i=0; i < blocklen; ++i) s1 += data[j+i], s2 += s1; s1 %= 65521, s2 %= 65521; j += blocklen; blocklen = 5552; } stbiw__sbpush(out, STBIW_UCHAR(s2 >> 8)); stbiw__sbpush(out, STBIW_UCHAR(s2)); stbiw__sbpush(out, STBIW_UCHAR(s1 >> 8)); stbiw__sbpush(out, STBIW_UCHAR(s1)); } *out_len = stbiw__sbn(out); // make returned pointer freeable STBIW_MEMMOVE(stbiw__sbraw(out), out, *out_len); return (unsigned char *) stbiw__sbraw(out); } static unsigned int stbiw__crc32(unsigned char *buffer, int len) { static unsigned int crc_table[256] = { 0x00000000, 0x77073096, 0xEE0E612C, 0x990951BA, 0x076DC419, 0x706AF48F, 0xE963A535, 0x9E6495A3, 0x0eDB8832, 0x79DCB8A4, 0xE0D5E91E, 0x97D2D988, 0x09B64C2B, 0x7EB17CBD, 0xE7B82D07, 0x90BF1D91, 0x1DB71064, 0x6AB020F2, 0xF3B97148, 0x84BE41DE, 0x1ADAD47D, 0x6DDDE4EB, 0xF4D4B551, 0x83D385C7, 0x136C9856, 0x646BA8C0, 0xFD62F97A, 0x8A65C9EC, 0x14015C4F, 0x63066CD9, 0xFA0F3D63, 0x8D080DF5, 0x3B6E20C8, 0x4C69105E, 0xD56041E4, 0xA2677172, 0x3C03E4D1, 0x4B04D447, 0xD20D85FD, 0xA50AB56B, 0x35B5A8FA, 0x42B2986C, 0xDBBBC9D6, 0xACBCF940, 0x32D86CE3, 0x45DF5C75, 0xDCD60DCF, 0xABD13D59, 0x26D930AC, 0x51DE003A, 0xC8D75180, 0xBFD06116, 0x21B4F4B5, 0x56B3C423, 0xCFBA9599, 0xB8BDA50F, 0x2802B89E, 0x5F058808, 0xC60CD9B2, 0xB10BE924, 0x2F6F7C87, 0x58684C11, 0xC1611DAB, 0xB6662D3D, 0x76DC4190, 0x01DB7106, 0x98D220BC, 0xEFD5102A, 0x71B18589, 0x06B6B51F, 0x9FBFE4A5, 0xE8B8D433, 0x7807C9A2, 0x0F00F934, 0x9609A88E, 0xE10E9818, 0x7F6A0DBB, 0x086D3D2D, 0x91646C97, 0xE6635C01, 0x6B6B51F4, 0x1C6C6162, 0x856530D8, 0xF262004E, 0x6C0695ED, 0x1B01A57B, 0x8208F4C1, 0xF50FC457, 0x65B0D9C6, 0x12B7E950, 0x8BBEB8EA, 0xFCB9887C, 0x62DD1DDF, 0x15DA2D49, 0x8CD37CF3, 0xFBD44C65, 0x4DB26158, 0x3AB551CE, 0xA3BC0074, 0xD4BB30E2, 0x4ADFA541, 0x3DD895D7, 0xA4D1C46D, 0xD3D6F4FB, 0x4369E96A, 0x346ED9FC, 0xAD678846, 0xDA60B8D0, 0x44042D73, 0x33031DE5, 0xAA0A4C5F, 0xDD0D7CC9, 0x5005713C, 0x270241AA, 0xBE0B1010, 0xC90C2086, 0x5768B525, 0x206F85B3, 0xB966D409, 0xCE61E49F, 0x5EDEF90E, 0x29D9C998, 0xB0D09822, 0xC7D7A8B4, 0x59B33D17, 0x2EB40D81, 0xB7BD5C3B, 0xC0BA6CAD, 0xEDB88320, 0x9ABFB3B6, 0x03B6E20C, 0x74B1D29A, 0xEAD54739, 0x9DD277AF, 0x04DB2615, 0x73DC1683, 0xE3630B12, 0x94643B84, 0x0D6D6A3E, 0x7A6A5AA8, 0xE40ECF0B, 0x9309FF9D, 0x0A00AE27, 0x7D079EB1, 0xF00F9344, 0x8708A3D2, 0x1E01F268, 0x6906C2FE, 0xF762575D, 0x806567CB, 0x196C3671, 0x6E6B06E7, 0xFED41B76, 0x89D32BE0, 0x10DA7A5A, 0x67DD4ACC, 0xF9B9DF6F, 0x8EBEEFF9, 0x17B7BE43, 0x60B08ED5, 0xD6D6A3E8, 0xA1D1937E, 0x38D8C2C4, 0x4FDFF252, 0xD1BB67F1, 0xA6BC5767, 0x3FB506DD, 0x48B2364B, 0xD80D2BDA, 0xAF0A1B4C, 0x36034AF6, 0x41047A60, 0xDF60EFC3, 0xA867DF55, 0x316E8EEF, 0x4669BE79, 0xCB61B38C, 0xBC66831A, 0x256FD2A0, 0x5268E236, 0xCC0C7795, 0xBB0B4703, 0x220216B9, 0x5505262F, 0xC5BA3BBE, 0xB2BD0B28, 0x2BB45A92, 0x5CB36A04, 0xC2D7FFA7, 0xB5D0CF31, 0x2CD99E8B, 0x5BDEAE1D, 0x9B64C2B0, 0xEC63F226, 0x756AA39C, 0x026D930A, 0x9C0906A9, 0xEB0E363F, 0x72076785, 0x05005713, 0x95BF4A82, 0xE2B87A14, 0x7BB12BAE, 0x0CB61B38, 0x92D28E9B, 0xE5D5BE0D, 0x7CDCEFB7, 0x0BDBDF21, 0x86D3D2D4, 0xF1D4E242, 0x68DDB3F8, 0x1FDA836E, 0x81BE16CD, 0xF6B9265B, 0x6FB077E1, 0x18B74777, 0x88085AE6, 0xFF0F6A70, 0x66063BCA, 0x11010B5C, 0x8F659EFF, 0xF862AE69, 0x616BFFD3, 0x166CCF45, 0xA00AE278, 0xD70DD2EE, 0x4E048354, 0x3903B3C2, 0xA7672661, 0xD06016F7, 0x4969474D, 0x3E6E77DB, 0xAED16A4A, 0xD9D65ADC, 0x40DF0B66, 0x37D83BF0, 0xA9BCAE53, 0xDEBB9EC5, 0x47B2CF7F, 0x30B5FFE9, 0xBDBDF21C, 0xCABAC28A, 0x53B39330, 0x24B4A3A6, 0xBAD03605, 0xCDD70693, 0x54DE5729, 0x23D967BF, 0xB3667A2E, 0xC4614AB8, 0x5D681B02, 0x2A6F2B94, 0xB40BBE37, 0xC30C8EA1, 0x5A05DF1B, 0x2D02EF8D }; unsigned int crc = ~0u; int i; for (i=0; i < len; ++i) crc = (crc >> 8) ^ crc_table[buffer[i] ^ (crc & 0xff)]; return ~crc; } #define stbiw__wpng4(o,a,b,c,d) ((o)[0]=STBIW_UCHAR(a),(o)[1]=STBIW_UCHAR(b),(o)[2]=STBIW_UCHAR(c),(o)[3]=STBIW_UCHAR(d),(o)+=4) #define stbiw__wp32(data,v) stbiw__wpng4(data, (v)>>24,(v)>>16,(v)>>8,(v)); #define stbiw__wptag(data,s) stbiw__wpng4(data, s[0],s[1],s[2],s[3]) static void stbiw__wpcrc(unsigned char **data, int len) { unsigned int crc = stbiw__crc32(*data - len - 4, len+4); stbiw__wp32(*data, crc); } static unsigned char stbiw__paeth(int a, int b, int c) { int p = a + b - c, pa = abs(p-a), pb = abs(p-b), pc = abs(p-c); if (pa <= pb && pa <= pc) return STBIW_UCHAR(a); if (pb <= pc) return STBIW_UCHAR(b); return STBIW_UCHAR(c); } // @OPTIMIZE: provide an option that always forces left-predict or paeth predict unsigned char *stbi_write_png_to_mem(unsigned char *pixels, int stride_bytes, int x, int y, int n, int *out_len) { int ctype[5] = { -1, 0, 4, 2, 6 }; unsigned char sig[8] = { 137,80,78,71,13,10,26,10 }; unsigned char *out,*o, *filt, *zlib; signed char *line_buffer; int i,j,k,p,zlen; if (stride_bytes == 0) stride_bytes = x * n; filt = (unsigned char *) STBIW_MALLOC((x*n+1) * y); if (!filt) return 0; line_buffer = (signed char *) STBIW_MALLOC(x * n); if (!line_buffer) { STBIW_FREE(filt); return 0; } for (j=0; j < y; ++j) { static int mapping[] = { 0,1,2,3,4 }; static int firstmap[] = { 0,1,0,5,6 }; int *mymap = (j != 0) ? mapping : firstmap; int best = 0, bestval = 0x7fffffff; for (p=0; p < 2; ++p) { for (k= p?best:0; k < 5; ++k) { // @TODO: clarity: rewrite this to go 0..5, and 'continue' the unwanted ones during 2nd pass int type = mymap[k],est=0; unsigned char *z = pixels + stride_bytes*j; for (i=0; i < n; ++i) switch (type) { case 0: line_buffer[i] = z[i]; break; case 1: line_buffer[i] = z[i]; break; case 2: line_buffer[i] = z[i] - z[i-stride_bytes]; break; case 3: line_buffer[i] = z[i] - (z[i-stride_bytes]>>1); break; case 4: line_buffer[i] = (signed char) (z[i] - stbiw__paeth(0,z[i-stride_bytes],0)); break; case 5: line_buffer[i] = z[i]; break; case 6: line_buffer[i] = z[i]; break; } for (i=n; i < x*n; ++i) { switch (type) { case 0: line_buffer[i] = z[i]; break; case 1: line_buffer[i] = z[i] - z[i-n]; break; case 2: line_buffer[i] = z[i] - z[i-stride_bytes]; break; case 3: line_buffer[i] = z[i] - ((z[i-n] + z[i-stride_bytes])>>1); break; case 4: line_buffer[i] = z[i] - stbiw__paeth(z[i-n], z[i-stride_bytes], z[i-stride_bytes-n]); break; case 5: line_buffer[i] = z[i] - (z[i-n]>>1); break; case 6: line_buffer[i] = z[i] - stbiw__paeth(z[i-n], 0,0); break; } } if (p) break; for (i=0; i < x*n; ++i) est += abs((signed char) line_buffer[i]); if (est < bestval) { bestval = est; best = k; } } } // when we get here, best contains the filter type, and line_buffer contains the data filt[j*(x*n+1)] = (unsigned char) best; STBIW_MEMMOVE(filt+j*(x*n+1)+1, line_buffer, x*n); } STBIW_FREE(line_buffer); zlib = stbi_zlib_compress(filt, y*( x*n+1), &zlen, 8); // increase 8 to get smaller but use more memory STBIW_FREE(filt); if (!zlib) return 0; // each tag requires 12 bytes of overhead out = (unsigned char *) STBIW_MALLOC(8 + 12+13 + 12+zlen + 12); if (!out) return 0; *out_len = 8 + 12+13 + 12+zlen + 12; o=out; STBIW_MEMMOVE(o,sig,8); o+= 8; stbiw__wp32(o, 13); // header length stbiw__wptag(o, "IHDR"); stbiw__wp32(o, x); stbiw__wp32(o, y); *o++ = 8; *o++ = STBIW_UCHAR(ctype[n]); *o++ = 0; *o++ = 0; *o++ = 0; stbiw__wpcrc(&o,13); stbiw__wp32(o, zlen); stbiw__wptag(o, "IDAT"); STBIW_MEMMOVE(o, zlib, zlen); o += zlen; STBIW_FREE(zlib); stbiw__wpcrc(&o, zlen); stbiw__wp32(o,0); stbiw__wptag(o, "IEND"); stbiw__wpcrc(&o,0); STBIW_ASSERT(o == out + *out_len); return out; } #ifndef STBI_WRITE_NO_STDIO STBIWDEF int stbi_write_png(char const *filename, int x, int y, int comp, const void *data, int stride_bytes) { FILE *f; int len; unsigned char *png = stbi_write_png_to_mem((unsigned char *) data, stride_bytes, x, y, comp, &len); if (png == NULL) return 0; f = fopen(filename, "wb"); if (!f) { STBIW_FREE(png); return 0; } fwrite(png, 1, len, f); fclose(f); STBIW_FREE(png); return 1; } #endif STBIWDEF int stbi_write_png_to_func(stbi_write_func *func, void *context, int x, int y, int comp, const void *data, int stride_bytes) { int len; unsigned char *png = stbi_write_png_to_mem((unsigned char *) data, stride_bytes, x, y, comp, &len); if (png == NULL) return 0; func(context, png, len); STBIW_FREE(png); return 1; } /* *************************************************************************** * * JPEG writer * * This is based on Jon Olick's jo_jpeg.cpp: * public domain Simple, Minimalistic JPEG writer - http://www.jonolick.com/code.html */ static const unsigned char stbiw__jpg_ZigZag[] = { 0,1,5,6,14,15,27,28,2,4,7,13,16,26,29,42,3,8,12,17,25,30,41,43,9,11,18, 24,31,40,44,53,10,19,23,32,39,45,52,54,20,22,33,38,46,51,55,60,21,34,37,47,50,56,59,61,35,36,48,49,57,58,62,63 }; static void stbiw__jpg_writeBits(stbi__write_context *s, int *bitBufP, int *bitCntP, const unsigned short *bs) { int bitBuf = *bitBufP, bitCnt = *bitCntP; bitCnt += bs[1]; bitBuf |= bs[0] << (24 - bitCnt); while(bitCnt >= 8) { unsigned char c = (bitBuf >> 16) & 255; stbiw__putc(s, c); if(c == 255) { stbiw__putc(s, 0); } bitBuf <<= 8; bitCnt -= 8; } *bitBufP = bitBuf; *bitCntP = bitCnt; } static void stbiw__jpg_DCT(float *d0p, float *d1p, float *d2p, float *d3p, float *d4p, float *d5p, float *d6p, float *d7p) { float d0 = *d0p, d1 = *d1p, d2 = *d2p, d3 = *d3p, d4 = *d4p, d5 = *d5p, d6 = *d6p, d7 = *d7p; float z1, z2, z3, z4, z5, z11, z13; float tmp0 = d0 + d7; float tmp7 = d0 - d7; float tmp1 = d1 + d6; float tmp6 = d1 - d6; float tmp2 = d2 + d5; float tmp5 = d2 - d5; float tmp3 = d3 + d4; float tmp4 = d3 - d4; // Even part float tmp10 = tmp0 + tmp3; // phase 2 float tmp13 = tmp0 - tmp3; float tmp11 = tmp1 + tmp2; float tmp12 = tmp1 - tmp2; d0 = tmp10 + tmp11; // phase 3 d4 = tmp10 - tmp11; z1 = (tmp12 + tmp13) * 0.707106781f; // c4 d2 = tmp13 + z1; // phase 5 d6 = tmp13 - z1; // Odd part tmp10 = tmp4 + tmp5; // phase 2 tmp11 = tmp5 + tmp6; tmp12 = tmp6 + tmp7; // The rotator is modified from fig 4-8 to avoid extra negations. z5 = (tmp10 - tmp12) * 0.382683433f; // c6 z2 = tmp10 * 0.541196100f + z5; // c2-c6 z4 = tmp12 * 1.306562965f + z5; // c2+c6 z3 = tmp11 * 0.707106781f; // c4 z11 = tmp7 + z3; // phase 5 z13 = tmp7 - z3; *d5p = z13 + z2; // phase 6 *d3p = z13 - z2; *d1p = z11 + z4; *d7p = z11 - z4; *d0p = d0; *d2p = d2; *d4p = d4; *d6p = d6; } static void stbiw__jpg_calcBits(int val, unsigned short bits[2]) { int tmp1 = val < 0 ? -val : val; val = val < 0 ? val-1 : val; bits[1] = 1; while(tmp1 >>= 1) { ++bits[1]; } bits[0] = val & ((1<0)&&(DU[end0pos]==0); --end0pos) { } // end0pos = first element in reverse order !=0 if(end0pos == 0) { stbiw__jpg_writeBits(s, bitBuf, bitCnt, EOB); return DU[0]; } for(i = 1; i <= end0pos; ++i) { int startpos = i; int nrzeroes; unsigned short bits[2]; for (; DU[i]==0 && i<=end0pos; ++i) { } nrzeroes = i-startpos; if ( nrzeroes >= 16 ) { int lng = nrzeroes>>4; int nrmarker; for (nrmarker=1; nrmarker <= lng; ++nrmarker) stbiw__jpg_writeBits(s, bitBuf, bitCnt, M16zeroes); nrzeroes &= 15; } stbiw__jpg_calcBits(DU[i], bits); stbiw__jpg_writeBits(s, bitBuf, bitCnt, HTAC[(nrzeroes<<4)+bits[1]]); stbiw__jpg_writeBits(s, bitBuf, bitCnt, bits); } if(end0pos != 63) { stbiw__jpg_writeBits(s, bitBuf, bitCnt, EOB); } return DU[0]; } static int stbi_write_jpg_core(stbi__write_context *s, int width, int height, int comp, const void* data, int quality) { // Constants that don't pollute global namespace static const unsigned char std_dc_luminance_nrcodes[] = {0,0,1,5,1,1,1,1,1,1,0,0,0,0,0,0,0}; static const unsigned char std_dc_luminance_values[] = {0,1,2,3,4,5,6,7,8,9,10,11}; static const unsigned char std_ac_luminance_nrcodes[] = {0,0,2,1,3,3,2,4,3,5,5,4,4,0,0,1,0x7d}; static const unsigned char std_ac_luminance_values[] = { 0x01,0x02,0x03,0x00,0x04,0x11,0x05,0x12,0x21,0x31,0x41,0x06,0x13,0x51,0x61,0x07,0x22,0x71,0x14,0x32,0x81,0x91,0xa1,0x08, 0x23,0x42,0xb1,0xc1,0x15,0x52,0xd1,0xf0,0x24,0x33,0x62,0x72,0x82,0x09,0x0a,0x16,0x17,0x18,0x19,0x1a,0x25,0x26,0x27,0x28, 0x29,0x2a,0x34,0x35,0x36,0x37,0x38,0x39,0x3a,0x43,0x44,0x45,0x46,0x47,0x48,0x49,0x4a,0x53,0x54,0x55,0x56,0x57,0x58,0x59, 0x5a,0x63,0x64,0x65,0x66,0x67,0x68,0x69,0x6a,0x73,0x74,0x75,0x76,0x77,0x78,0x79,0x7a,0x83,0x84,0x85,0x86,0x87,0x88,0x89, 0x8a,0x92,0x93,0x94,0x95,0x96,0x97,0x98,0x99,0x9a,0xa2,0xa3,0xa4,0xa5,0xa6,0xa7,0xa8,0xa9,0xaa,0xb2,0xb3,0xb4,0xb5,0xb6, 0xb7,0xb8,0xb9,0xba,0xc2,0xc3,0xc4,0xc5,0xc6,0xc7,0xc8,0xc9,0xca,0xd2,0xd3,0xd4,0xd5,0xd6,0xd7,0xd8,0xd9,0xda,0xe1,0xe2, 0xe3,0xe4,0xe5,0xe6,0xe7,0xe8,0xe9,0xea,0xf1,0xf2,0xf3,0xf4,0xf5,0xf6,0xf7,0xf8,0xf9,0xfa }; static const unsigned char std_dc_chrominance_nrcodes[] = {0,0,3,1,1,1,1,1,1,1,1,1,0,0,0,0,0}; static const unsigned char std_dc_chrominance_values[] = {0,1,2,3,4,5,6,7,8,9,10,11}; static const unsigned char std_ac_chrominance_nrcodes[] = {0,0,2,1,2,4,4,3,4,7,5,4,4,0,1,2,0x77}; static const unsigned char std_ac_chrominance_values[] = { 0x00,0x01,0x02,0x03,0x11,0x04,0x05,0x21,0x31,0x06,0x12,0x41,0x51,0x07,0x61,0x71,0x13,0x22,0x32,0x81,0x08,0x14,0x42,0x91, 0xa1,0xb1,0xc1,0x09,0x23,0x33,0x52,0xf0,0x15,0x62,0x72,0xd1,0x0a,0x16,0x24,0x34,0xe1,0x25,0xf1,0x17,0x18,0x19,0x1a,0x26, 0x27,0x28,0x29,0x2a,0x35,0x36,0x37,0x38,0x39,0x3a,0x43,0x44,0x45,0x46,0x47,0x48,0x49,0x4a,0x53,0x54,0x55,0x56,0x57,0x58, 0x59,0x5a,0x63,0x64,0x65,0x66,0x67,0x68,0x69,0x6a,0x73,0x74,0x75,0x76,0x77,0x78,0x79,0x7a,0x82,0x83,0x84,0x85,0x86,0x87, 0x88,0x89,0x8a,0x92,0x93,0x94,0x95,0x96,0x97,0x98,0x99,0x9a,0xa2,0xa3,0xa4,0xa5,0xa6,0xa7,0xa8,0xa9,0xaa,0xb2,0xb3,0xb4, 0xb5,0xb6,0xb7,0xb8,0xb9,0xba,0xc2,0xc3,0xc4,0xc5,0xc6,0xc7,0xc8,0xc9,0xca,0xd2,0xd3,0xd4,0xd5,0xd6,0xd7,0xd8,0xd9,0xda, 0xe2,0xe3,0xe4,0xe5,0xe6,0xe7,0xe8,0xe9,0xea,0xf2,0xf3,0xf4,0xf5,0xf6,0xf7,0xf8,0xf9,0xfa }; // Huffman tables static const unsigned short YDC_HT[256][2] = { {0,2},{2,3},{3,3},{4,3},{5,3},{6,3},{14,4},{30,5},{62,6},{126,7},{254,8},{510,9}}; static const unsigned short UVDC_HT[256][2] = { {0,2},{1,2},{2,2},{6,3},{14,4},{30,5},{62,6},{126,7},{254,8},{510,9},{1022,10},{2046,11}}; static const unsigned short YAC_HT[256][2] = { {10,4},{0,2},{1,2},{4,3},{11,4},{26,5},{120,7},{248,8},{1014,10},{65410,16},{65411,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, {12,4},{27,5},{121,7},{502,9},{2038,11},{65412,16},{65413,16},{65414,16},{65415,16},{65416,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, {28,5},{249,8},{1015,10},{4084,12},{65417,16},{65418,16},{65419,16},{65420,16},{65421,16},{65422,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, {58,6},{503,9},{4085,12},{65423,16},{65424,16},{65425,16},{65426,16},{65427,16},{65428,16},{65429,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, {59,6},{1016,10},{65430,16},{65431,16},{65432,16},{65433,16},{65434,16},{65435,16},{65436,16},{65437,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, {122,7},{2039,11},{65438,16},{65439,16},{65440,16},{65441,16},{65442,16},{65443,16},{65444,16},{65445,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, {123,7},{4086,12},{65446,16},{65447,16},{65448,16},{65449,16},{65450,16},{65451,16},{65452,16},{65453,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, {250,8},{4087,12},{65454,16},{65455,16},{65456,16},{65457,16},{65458,16},{65459,16},{65460,16},{65461,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, {504,9},{32704,15},{65462,16},{65463,16},{65464,16},{65465,16},{65466,16},{65467,16},{65468,16},{65469,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, {505,9},{65470,16},{65471,16},{65472,16},{65473,16},{65474,16},{65475,16},{65476,16},{65477,16},{65478,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, {506,9},{65479,16},{65480,16},{65481,16},{65482,16},{65483,16},{65484,16},{65485,16},{65486,16},{65487,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, {1017,10},{65488,16},{65489,16},{65490,16},{65491,16},{65492,16},{65493,16},{65494,16},{65495,16},{65496,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, {1018,10},{65497,16},{65498,16},{65499,16},{65500,16},{65501,16},{65502,16},{65503,16},{65504,16},{65505,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, {2040,11},{65506,16},{65507,16},{65508,16},{65509,16},{65510,16},{65511,16},{65512,16},{65513,16},{65514,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, {65515,16},{65516,16},{65517,16},{65518,16},{65519,16},{65520,16},{65521,16},{65522,16},{65523,16},{65524,16},{0,0},{0,0},{0,0},{0,0},{0,0}, {2041,11},{65525,16},{65526,16},{65527,16},{65528,16},{65529,16},{65530,16},{65531,16},{65532,16},{65533,16},{65534,16},{0,0},{0,0},{0,0},{0,0},{0,0} }; static const unsigned short UVAC_HT[256][2] = { {0,2},{1,2},{4,3},{10,4},{24,5},{25,5},{56,6},{120,7},{500,9},{1014,10},{4084,12},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, {11,4},{57,6},{246,8},{501,9},{2038,11},{4085,12},{65416,16},{65417,16},{65418,16},{65419,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, {26,5},{247,8},{1015,10},{4086,12},{32706,15},{65420,16},{65421,16},{65422,16},{65423,16},{65424,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, {27,5},{248,8},{1016,10},{4087,12},{65425,16},{65426,16},{65427,16},{65428,16},{65429,16},{65430,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, {58,6},{502,9},{65431,16},{65432,16},{65433,16},{65434,16},{65435,16},{65436,16},{65437,16},{65438,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, {59,6},{1017,10},{65439,16},{65440,16},{65441,16},{65442,16},{65443,16},{65444,16},{65445,16},{65446,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, {121,7},{2039,11},{65447,16},{65448,16},{65449,16},{65450,16},{65451,16},{65452,16},{65453,16},{65454,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, {122,7},{2040,11},{65455,16},{65456,16},{65457,16},{65458,16},{65459,16},{65460,16},{65461,16},{65462,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, {249,8},{65463,16},{65464,16},{65465,16},{65466,16},{65467,16},{65468,16},{65469,16},{65470,16},{65471,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, {503,9},{65472,16},{65473,16},{65474,16},{65475,16},{65476,16},{65477,16},{65478,16},{65479,16},{65480,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, {504,9},{65481,16},{65482,16},{65483,16},{65484,16},{65485,16},{65486,16},{65487,16},{65488,16},{65489,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, {505,9},{65490,16},{65491,16},{65492,16},{65493,16},{65494,16},{65495,16},{65496,16},{65497,16},{65498,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, {506,9},{65499,16},{65500,16},{65501,16},{65502,16},{65503,16},{65504,16},{65505,16},{65506,16},{65507,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, {2041,11},{65508,16},{65509,16},{65510,16},{65511,16},{65512,16},{65513,16},{65514,16},{65515,16},{65516,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, {16352,14},{65517,16},{65518,16},{65519,16},{65520,16},{65521,16},{65522,16},{65523,16},{65524,16},{65525,16},{0,0},{0,0},{0,0},{0,0},{0,0}, {1018,10},{32707,15},{65526,16},{65527,16},{65528,16},{65529,16},{65530,16},{65531,16},{65532,16},{65533,16},{65534,16},{0,0},{0,0},{0,0},{0,0},{0,0} }; static const int YQT[] = {16,11,10,16,24,40,51,61,12,12,14,19,26,58,60,55,14,13,16,24,40,57,69,56,14,17,22,29,51,87,80,62,18,22, 37,56,68,109,103,77,24,35,55,64,81,104,113,92,49,64,78,87,103,121,120,101,72,92,95,98,112,100,103,99}; static const int UVQT[] = {17,18,24,47,99,99,99,99,18,21,26,66,99,99,99,99,24,26,56,99,99,99,99,99,47,66,99,99,99,99,99,99, 99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99}; static const float aasf[] = { 1.0f * 2.828427125f, 1.387039845f * 2.828427125f, 1.306562965f * 2.828427125f, 1.175875602f * 2.828427125f, 1.0f * 2.828427125f, 0.785694958f * 2.828427125f, 0.541196100f * 2.828427125f, 0.275899379f * 2.828427125f }; int row, col, i, k; float fdtbl_Y[64], fdtbl_UV[64]; unsigned char YTable[64], UVTable[64]; if(!data || !width || !height || comp > 4 || comp < 1) { return 0; } quality = quality ? quality : 90; quality = quality < 1 ? 1 : quality > 100 ? 100 : quality; quality = quality < 50 ? 5000 / quality : 200 - quality * 2; for(i = 0; i < 64; ++i) { int uvti, yti = (YQT[i]*quality+50)/100; YTable[stbiw__jpg_ZigZag[i]] = (unsigned char) (yti < 1 ? 1 : yti > 255 ? 255 : yti); uvti = (UVQT[i]*quality+50)/100; UVTable[stbiw__jpg_ZigZag[i]] = (unsigned char) (uvti < 1 ? 1 : uvti > 255 ? 255 : uvti); } for(row = 0, k = 0; row < 8; ++row) { for(col = 0; col < 8; ++col, ++k) { fdtbl_Y[k] = 1 / (YTable [stbiw__jpg_ZigZag[k]] * aasf[row] * aasf[col]); fdtbl_UV[k] = 1 / (UVTable[stbiw__jpg_ZigZag[k]] * aasf[row] * aasf[col]); } } // Write Headers { static const unsigned char head0[] = { 0xFF,0xD8,0xFF,0xE0,0,0x10,'J','F','I','F',0,1,1,0,0,1,0,1,0,0,0xFF,0xDB,0,0x84,0 }; static const unsigned char head2[] = { 0xFF,0xDA,0,0xC,3,1,0,2,0x11,3,0x11,0,0x3F,0 }; const unsigned char head1[] = { 0xFF,0xC0,0,0x11,8,(unsigned char)(height>>8),STBIW_UCHAR(height),(unsigned char)(width>>8),STBIW_UCHAR(width), 3,1,0x11,0,2,0x11,1,3,0x11,1,0xFF,0xC4,0x01,0xA2,0 }; s->func(s->context, (void*)head0, sizeof(head0)); s->func(s->context, (void*)YTable, sizeof(YTable)); stbiw__putc(s, 1); s->func(s->context, UVTable, sizeof(UVTable)); s->func(s->context, (void*)head1, sizeof(head1)); s->func(s->context, (void*)(std_dc_luminance_nrcodes+1), sizeof(std_dc_luminance_nrcodes)-1); s->func(s->context, (void*)std_dc_luminance_values, sizeof(std_dc_luminance_values)); stbiw__putc(s, 0x10); // HTYACinfo s->func(s->context, (void*)(std_ac_luminance_nrcodes+1), sizeof(std_ac_luminance_nrcodes)-1); s->func(s->context, (void*)std_ac_luminance_values, sizeof(std_ac_luminance_values)); stbiw__putc(s, 1); // HTUDCinfo s->func(s->context, (void*)(std_dc_chrominance_nrcodes+1), sizeof(std_dc_chrominance_nrcodes)-1); s->func(s->context, (void*)std_dc_chrominance_values, sizeof(std_dc_chrominance_values)); stbiw__putc(s, 0x11); // HTUACinfo s->func(s->context, (void*)(std_ac_chrominance_nrcodes+1), sizeof(std_ac_chrominance_nrcodes)-1); s->func(s->context, (void*)std_ac_chrominance_values, sizeof(std_ac_chrominance_values)); s->func(s->context, (void*)head2, sizeof(head2)); } // Encode 8x8 macroblocks { static const unsigned short fillBits[] = {0x7F, 7}; const unsigned char *imageData = (const unsigned char *)data; int DCY=0, DCU=0, DCV=0; int bitBuf=0, bitCnt=0; // comp == 2 is grey+alpha (alpha is ignored) int ofsG = comp > 2 ? 1 : 0, ofsB = comp > 2 ? 2 : 0; int x, y, pos; for(y = 0; y < height; y += 8) { for(x = 0; x < width; x += 8) { float YDU[64], UDU[64], VDU[64]; for(row = y, pos = 0; row < y+8; ++row) { for(col = x; col < x+8; ++col, ++pos) { int p = row*width*comp + col*comp; float r, g, b; if(row >= height) { p -= width*comp*(row+1 - height); } if(col >= width) { p -= comp*(col+1 - width); } r = imageData[p+0]; g = imageData[p+ofsG]; b = imageData[p+ofsB]; YDU[pos]=+0.29900f*r+0.58700f*g+0.11400f*b-128; UDU[pos]=-0.16874f*r-0.33126f*g+0.50000f*b; VDU[pos]=+0.50000f*r-0.41869f*g-0.08131f*b; } } DCY = stbiw__jpg_processDU(s, &bitBuf, &bitCnt, YDU, fdtbl_Y, DCY, YDC_HT, YAC_HT); DCU = stbiw__jpg_processDU(s, &bitBuf, &bitCnt, UDU, fdtbl_UV, DCU, UVDC_HT, UVAC_HT); DCV = stbiw__jpg_processDU(s, &bitBuf, &bitCnt, VDU, fdtbl_UV, DCV, UVDC_HT, UVAC_HT); } } // Do the bit alignment of the EOI marker stbiw__jpg_writeBits(s, &bitBuf, &bitCnt, fillBits); } // EOI stbiw__putc(s, 0xFF); stbiw__putc(s, 0xD9); return 1; } STBIWDEF int stbi_write_jpg_to_func(stbi_write_func *func, void *context, int x, int y, int comp, const void *data, int quality) { stbi__write_context s; stbi__start_write_callbacks(&s, func, context); return stbi_write_jpg_core(&s, x, y, comp, (void *) data, quality); } #ifndef STBI_WRITE_NO_STDIO STBIWDEF int stbi_write_jpg(char const *filename, int x, int y, int comp, const void *data, int quality) { stbi__write_context s; if (stbi__start_write_file(&s,filename)) { int r = stbi_write_jpg_core(&s, x, y, comp, data, quality); stbi__end_write_file(&s); return r; } else return 0; } #endif #endif // STB_IMAGE_WRITE_IMPLEMENTATION /* Revision history 1.07 (2017-07-24) doc fix 1.06 (2017-07-23) writing JPEG (using Jon Olick's code) 1.05 ??? 1.04 (2017-03-03) monochrome BMP expansion 1.03 ??? 1.02 (2016-04-02) avoid allocating large structures on the stack 1.01 (2016-01-16) STBIW_REALLOC_SIZED: support allocators with no realloc support avoid race-condition in crc initialization minor compile issues 1.00 (2015-09-14) installable file IO function 0.99 (2015-09-13) warning fixes; TGA rle support 0.98 (2015-04-08) added STBIW_MALLOC, STBIW_ASSERT etc 0.97 (2015-01-18) fixed HDR asserts, rewrote HDR rle logic 0.96 (2015-01-17) add HDR output fix monochrome BMP 0.95 (2014-08-17) add monochrome TGA output 0.94 (2014-05-31) rename private functions to avoid conflicts with stb_image.h 0.93 (2014-05-27) warning fixes 0.92 (2010-08-01) casts to unsigned char to fix warnings 0.91 (2010-07-17) first public release 0.90 first internal release */ /* ------------------------------------------------------------------------------ This software is available under 2 licenses -- choose whichever you prefer. ------------------------------------------------------------------------------ ALTERNATIVE A - MIT License Copyright (c) 2017 Sean Barrett 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. ------------------------------------------------------------------------------ ALTERNATIVE B - Public Domain (www.unlicense.org) This is free and unencumbered software released into the public domain. Anyone is free to copy, modify, publish, use, compile, sell, or distribute this software, either in source code form or as a compiled binary, for any purpose, commercial or non-commercial, and by any means. In jurisdictions that recognize copyright laws, the author or authors of this software dedicate any and all copyright interest in the software to the public domain. We make this dedication for the benefit of the public at large and to the detriment of our heirs and successors. We intend this dedication to be an overt act of relinquishment in perpetuity of all present and future rights to this software under copyright law. 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 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. ------------------------------------------------------------------------------ */ uTox/third_party/stb/stb/stb_image_resize.h0000600000175000001440000034243714003056224020107 0ustar rakusers/* stb_image_resize - v0.95 - public domain image resizing by Jorge L Rodriguez (@VinoBS) - 2014 http://github.com/nothings/stb Written with emphasis on usability, portability, and efficiency. (No SIMD or threads, so it be easily outperformed by libs that use those.) Only scaling and translation is supported, no rotations or shears. Easy API downsamples w/Mitchell filter, upsamples w/cubic interpolation. COMPILING & LINKING In one C/C++ file that #includes this file, do this: #define STB_IMAGE_RESIZE_IMPLEMENTATION before the #include. That will create the implementation in that file. QUICKSTART stbir_resize_uint8( input_pixels , in_w , in_h , 0, output_pixels, out_w, out_h, 0, num_channels) stbir_resize_float(...) stbir_resize_uint8_srgb( input_pixels , in_w , in_h , 0, output_pixels, out_w, out_h, 0, num_channels , alpha_chan , 0) stbir_resize_uint8_srgb_edgemode( input_pixels , in_w , in_h , 0, output_pixels, out_w, out_h, 0, num_channels , alpha_chan , 0, STBIR_EDGE_CLAMP) // WRAP/REFLECT/ZERO FULL API See the "header file" section of the source for API documentation. ADDITIONAL DOCUMENTATION SRGB & FLOATING POINT REPRESENTATION The sRGB functions presume IEEE floating point. If you do not have IEEE floating point, define STBIR_NON_IEEE_FLOAT. This will use a slower implementation. MEMORY ALLOCATION The resize functions here perform a single memory allocation using malloc. To control the memory allocation, before the #include that triggers the implementation, do: #define STBIR_MALLOC(size,context) ... #define STBIR_FREE(ptr,context) ... Each resize function makes exactly one call to malloc/free, so to use temp memory, store the temp memory in the context and return that. ASSERT Define STBIR_ASSERT(boolval) to override assert() and not use assert.h OPTIMIZATION Define STBIR_SATURATE_INT to compute clamp values in-range using integer operations instead of float operations. This may be faster on some platforms. DEFAULT FILTERS For functions which don't provide explicit control over what filters to use, you can change the compile-time defaults with #define STBIR_DEFAULT_FILTER_UPSAMPLE STBIR_FILTER_something #define STBIR_DEFAULT_FILTER_DOWNSAMPLE STBIR_FILTER_something See stbir_filter in the header-file section for the list of filters. NEW FILTERS A number of 1D filter kernels are used. For a list of supported filters see the stbir_filter enum. To add a new filter, write a filter function and add it to stbir__filter_info_table. PROGRESS For interactive use with slow resize operations, you can install a progress-report callback: #define STBIR_PROGRESS_REPORT(val) some_func(val) The parameter val is a float which goes from 0 to 1 as progress is made. For example: static void my_progress_report(float progress); #define STBIR_PROGRESS_REPORT(val) my_progress_report(val) #define STB_IMAGE_RESIZE_IMPLEMENTATION #include "stb_image_resize.h" static void my_progress_report(float progress) { printf("Progress: %f%%\n", progress*100); } MAX CHANNELS If your image has more than 64 channels, define STBIR_MAX_CHANNELS to the max you'll have. ALPHA CHANNEL Most of the resizing functions provide the ability to control how the alpha channel of an image is processed. The important things to know about this: 1. The best mathematically-behaved version of alpha to use is called "premultiplied alpha", in which the other color channels have had the alpha value multiplied in. If you use premultiplied alpha, linear filtering (such as image resampling done by this library, or performed in texture units on GPUs) does the "right thing". While premultiplied alpha is standard in the movie CGI industry, it is still uncommon in the videogame/real-time world. If you linearly filter non-premultiplied alpha, strange effects occur. (For example, the 50/50 average of 99% transparent bright green and 1% transparent black produces 50% transparent dark green when non-premultiplied, whereas premultiplied it produces 50% transparent near-black. The former introduces green energy that doesn't exist in the source image.) 2. Artists should not edit premultiplied-alpha images; artists want non-premultiplied alpha images. Thus, art tools generally output non-premultiplied alpha images. 3. You will get best results in most cases by converting images to premultiplied alpha before processing them mathematically. 4. If you pass the flag STBIR_FLAG_ALPHA_PREMULTIPLIED, the resizer does not do anything special for the alpha channel; it is resampled identically to other channels. This produces the correct results for premultiplied-alpha images, but produces less-than-ideal results for non-premultiplied-alpha images. 5. If you do not pass the flag STBIR_FLAG_ALPHA_PREMULTIPLIED, then the resizer weights the contribution of input pixels based on their alpha values, or, equivalently, it multiplies the alpha value into the color channels, resamples, then divides by the resultant alpha value. Input pixels which have alpha=0 do not contribute at all to output pixels unless _all_ of the input pixels affecting that output pixel have alpha=0, in which case the result for that pixel is the same as it would be without STBIR_FLAG_ALPHA_PREMULTIPLIED. However, this is only true for input images in integer formats. For input images in float format, input pixels with alpha=0 have no effect, and output pixels which have alpha=0 will be 0 in all channels. (For float images, you can manually achieve the same result by adding a tiny epsilon value to the alpha channel of every image, and then subtracting or clamping it at the end.) 6. You can suppress the behavior described in #5 and make all-0-alpha pixels have 0 in all channels by #defining STBIR_NO_ALPHA_EPSILON. 7. You can separately control whether the alpha channel is interpreted as linear or affected by the colorspace. By default it is linear; you almost never want to apply the colorspace. (For example, graphics hardware does not apply sRGB conversion to the alpha channel.) CONTRIBUTORS Jorge L Rodriguez: Implementation Sean Barrett: API design, optimizations Aras Pranckevicius: bugfix Nathan Reed: warning fixes REVISIONS 0.95 (2017-07-23) fixed warnings 0.94 (2017-03-18) fixed warnings 0.93 (2017-03-03) fixed bug with certain combinations of heights 0.92 (2017-01-02) fix integer overflow on large (>2GB) images 0.91 (2016-04-02) fix warnings; fix handling of subpixel regions 0.90 (2014-09-17) first released version LICENSE See end of file for license information. TODO Don't decode all of the image data when only processing a partial tile Don't use full-width decode buffers when only processing a partial tile When processing wide images, break processing into tiles so data fits in L1 cache Installable filters? Resize that respects alpha test coverage (Reference code: FloatImage::alphaTestCoverage and FloatImage::scaleAlphaToCoverage: https://code.google.com/p/nvidia-texture-tools/source/browse/trunk/src/nvimage/FloatImage.cpp ) */ #ifndef STBIR_INCLUDE_STB_IMAGE_RESIZE_H #define STBIR_INCLUDE_STB_IMAGE_RESIZE_H #ifdef _MSC_VER typedef unsigned char stbir_uint8; typedef unsigned short stbir_uint16; typedef unsigned int stbir_uint32; #else #include typedef uint8_t stbir_uint8; typedef uint16_t stbir_uint16; typedef uint32_t stbir_uint32; #endif #ifdef STB_IMAGE_RESIZE_STATIC #define STBIRDEF static #else #ifdef __cplusplus #define STBIRDEF extern "C" #else #define STBIRDEF extern #endif #endif ////////////////////////////////////////////////////////////////////////////// // // Easy-to-use API: // // * "input pixels" points to an array of image data with 'num_channels' channels (e.g. RGB=3, RGBA=4) // * input_w is input image width (x-axis), input_h is input image height (y-axis) // * stride is the offset between successive rows of image data in memory, in bytes. you can // specify 0 to mean packed continuously in memory // * alpha channel is treated identically to other channels. // * colorspace is linear or sRGB as specified by function name // * returned result is 1 for success or 0 in case of an error. // #define STBIR_ASSERT() to trigger an assert on parameter validation errors. // * Memory required grows approximately linearly with input and output size, but with // discontinuities at input_w == output_w and input_h == output_h. // * These functions use a "default" resampling filter defined at compile time. To change the filter, // you can change the compile-time defaults by #defining STBIR_DEFAULT_FILTER_UPSAMPLE // and STBIR_DEFAULT_FILTER_DOWNSAMPLE, or you can use the medium-complexity API. STBIRDEF int stbir_resize_uint8( const unsigned char *input_pixels , int input_w , int input_h , int input_stride_in_bytes, unsigned char *output_pixels, int output_w, int output_h, int output_stride_in_bytes, int num_channels); STBIRDEF int stbir_resize_float( const float *input_pixels , int input_w , int input_h , int input_stride_in_bytes, float *output_pixels, int output_w, int output_h, int output_stride_in_bytes, int num_channels); // The following functions interpret image data as gamma-corrected sRGB. // Specify STBIR_ALPHA_CHANNEL_NONE if you have no alpha channel, // or otherwise provide the index of the alpha channel. Flags value // of 0 will probably do the right thing if you're not sure what // the flags mean. #define STBIR_ALPHA_CHANNEL_NONE -1 // Set this flag if your texture has premultiplied alpha. Otherwise, stbir will // use alpha-weighted resampling (effectively premultiplying, resampling, // then unpremultiplying). #define STBIR_FLAG_ALPHA_PREMULTIPLIED (1 << 0) // The specified alpha channel should be handled as gamma-corrected value even // when doing sRGB operations. #define STBIR_FLAG_ALPHA_USES_COLORSPACE (1 << 1) STBIRDEF int stbir_resize_uint8_srgb(const unsigned char *input_pixels , int input_w , int input_h , int input_stride_in_bytes, unsigned char *output_pixels, int output_w, int output_h, int output_stride_in_bytes, int num_channels, int alpha_channel, int flags); typedef enum { STBIR_EDGE_CLAMP = 1, STBIR_EDGE_REFLECT = 2, STBIR_EDGE_WRAP = 3, STBIR_EDGE_ZERO = 4, } stbir_edge; // This function adds the ability to specify how requests to sample off the edge of the image are handled. STBIRDEF int stbir_resize_uint8_srgb_edgemode(const unsigned char *input_pixels , int input_w , int input_h , int input_stride_in_bytes, unsigned char *output_pixels, int output_w, int output_h, int output_stride_in_bytes, int num_channels, int alpha_channel, int flags, stbir_edge edge_wrap_mode); ////////////////////////////////////////////////////////////////////////////// // // Medium-complexity API // // This extends the easy-to-use API as follows: // // * Alpha-channel can be processed separately // * If alpha_channel is not STBIR_ALPHA_CHANNEL_NONE // * Alpha channel will not be gamma corrected (unless flags&STBIR_FLAG_GAMMA_CORRECT) // * Filters will be weighted by alpha channel (unless flags&STBIR_FLAG_ALPHA_PREMULTIPLIED) // * Filter can be selected explicitly // * uint16 image type // * sRGB colorspace available for all types // * context parameter for passing to STBIR_MALLOC typedef enum { STBIR_FILTER_DEFAULT = 0, // use same filter type that easy-to-use API chooses STBIR_FILTER_BOX = 1, // A trapezoid w/1-pixel wide ramps, same result as box for integer scale ratios STBIR_FILTER_TRIANGLE = 2, // On upsampling, produces same results as bilinear texture filtering STBIR_FILTER_CUBICBSPLINE = 3, // The cubic b-spline (aka Mitchell-Netrevalli with B=1,C=0), gaussian-esque STBIR_FILTER_CATMULLROM = 4, // An interpolating cubic spline STBIR_FILTER_MITCHELL = 5, // Mitchell-Netrevalli filter with B=1/3, C=1/3 } stbir_filter; typedef enum { STBIR_COLORSPACE_LINEAR, STBIR_COLORSPACE_SRGB, STBIR_MAX_COLORSPACES, } stbir_colorspace; // The following functions are all identical except for the type of the image data STBIRDEF int stbir_resize_uint8_generic( const unsigned char *input_pixels , int input_w , int input_h , int input_stride_in_bytes, unsigned char *output_pixels, int output_w, int output_h, int output_stride_in_bytes, int num_channels, int alpha_channel, int flags, stbir_edge edge_wrap_mode, stbir_filter filter, stbir_colorspace space, void *alloc_context); STBIRDEF int stbir_resize_uint16_generic(const stbir_uint16 *input_pixels , int input_w , int input_h , int input_stride_in_bytes, stbir_uint16 *output_pixels , int output_w, int output_h, int output_stride_in_bytes, int num_channels, int alpha_channel, int flags, stbir_edge edge_wrap_mode, stbir_filter filter, stbir_colorspace space, void *alloc_context); STBIRDEF int stbir_resize_float_generic( const float *input_pixels , int input_w , int input_h , int input_stride_in_bytes, float *output_pixels , int output_w, int output_h, int output_stride_in_bytes, int num_channels, int alpha_channel, int flags, stbir_edge edge_wrap_mode, stbir_filter filter, stbir_colorspace space, void *alloc_context); ////////////////////////////////////////////////////////////////////////////// // // Full-complexity API // // This extends the medium API as follows: // // * uint32 image type // * not typesafe // * separate filter types for each axis // * separate edge modes for each axis // * can specify scale explicitly for subpixel correctness // * can specify image source tile using texture coordinates typedef enum { STBIR_TYPE_UINT8 , STBIR_TYPE_UINT16, STBIR_TYPE_UINT32, STBIR_TYPE_FLOAT , STBIR_MAX_TYPES } stbir_datatype; STBIRDEF int stbir_resize( const void *input_pixels , int input_w , int input_h , int input_stride_in_bytes, void *output_pixels, int output_w, int output_h, int output_stride_in_bytes, stbir_datatype datatype, int num_channels, int alpha_channel, int flags, stbir_edge edge_mode_horizontal, stbir_edge edge_mode_vertical, stbir_filter filter_horizontal, stbir_filter filter_vertical, stbir_colorspace space, void *alloc_context); STBIRDEF int stbir_resize_subpixel(const void *input_pixels , int input_w , int input_h , int input_stride_in_bytes, void *output_pixels, int output_w, int output_h, int output_stride_in_bytes, stbir_datatype datatype, int num_channels, int alpha_channel, int flags, stbir_edge edge_mode_horizontal, stbir_edge edge_mode_vertical, stbir_filter filter_horizontal, stbir_filter filter_vertical, stbir_colorspace space, void *alloc_context, float x_scale, float y_scale, float x_offset, float y_offset); STBIRDEF int stbir_resize_region( const void *input_pixels , int input_w , int input_h , int input_stride_in_bytes, void *output_pixels, int output_w, int output_h, int output_stride_in_bytes, stbir_datatype datatype, int num_channels, int alpha_channel, int flags, stbir_edge edge_mode_horizontal, stbir_edge edge_mode_vertical, stbir_filter filter_horizontal, stbir_filter filter_vertical, stbir_colorspace space, void *alloc_context, float s0, float t0, float s1, float t1); // (s0, t0) & (s1, t1) are the top-left and bottom right corner (uv addressing style: [0, 1]x[0, 1]) of a region of the input image to use. // // //// end header file ///////////////////////////////////////////////////// #endif // STBIR_INCLUDE_STB_IMAGE_RESIZE_H #ifdef STB_IMAGE_RESIZE_IMPLEMENTATION #ifndef STBIR_ASSERT #include #define STBIR_ASSERT(x) assert(x) #endif // For memset #include #include #ifndef STBIR_MALLOC #include // use comma operator to evaluate c, to avoid "unused parameter" warnings #define STBIR_MALLOC(size,c) ((void)(c), malloc(size)) #define STBIR_FREE(ptr,c) ((void)(c), free(ptr)) #endif #ifndef _MSC_VER #ifdef __cplusplus #define stbir__inline inline #else #define stbir__inline #endif #else #define stbir__inline __forceinline #endif // should produce compiler error if size is wrong typedef unsigned char stbir__validate_uint32[sizeof(stbir_uint32) == 4 ? 1 : -1]; #ifdef _MSC_VER #define STBIR__NOTUSED(v) (void)(v) #else #define STBIR__NOTUSED(v) (void)sizeof(v) #endif #define STBIR__ARRAY_SIZE(a) (sizeof((a))/sizeof((a)[0])) #ifndef STBIR_DEFAULT_FILTER_UPSAMPLE #define STBIR_DEFAULT_FILTER_UPSAMPLE STBIR_FILTER_CATMULLROM #endif #ifndef STBIR_DEFAULT_FILTER_DOWNSAMPLE #define STBIR_DEFAULT_FILTER_DOWNSAMPLE STBIR_FILTER_MITCHELL #endif #ifndef STBIR_PROGRESS_REPORT #define STBIR_PROGRESS_REPORT(float_0_to_1) #endif #ifndef STBIR_MAX_CHANNELS #define STBIR_MAX_CHANNELS 64 #endif #if STBIR_MAX_CHANNELS > 65536 #error "Too many channels; STBIR_MAX_CHANNELS must be no more than 65536." // because we store the indices in 16-bit variables #endif // This value is added to alpha just before premultiplication to avoid // zeroing out color values. It is equivalent to 2^-80. If you don't want // that behavior (it may interfere if you have floating point images with // very small alpha values) then you can define STBIR_NO_ALPHA_EPSILON to // disable it. #ifndef STBIR_ALPHA_EPSILON #define STBIR_ALPHA_EPSILON ((float)1 / (1 << 20) / (1 << 20) / (1 << 20) / (1 << 20)) #endif #ifdef _MSC_VER #define STBIR__UNUSED_PARAM(v) (void)(v) #else #define STBIR__UNUSED_PARAM(v) (void)sizeof(v) #endif // must match stbir_datatype static unsigned char stbir__type_size[] = { 1, // STBIR_TYPE_UINT8 2, // STBIR_TYPE_UINT16 4, // STBIR_TYPE_UINT32 4, // STBIR_TYPE_FLOAT }; // Kernel function centered at 0 typedef float (stbir__kernel_fn)(float x, float scale); typedef float (stbir__support_fn)(float scale); typedef struct { stbir__kernel_fn* kernel; stbir__support_fn* support; } stbir__filter_info; // When upsampling, the contributors are which source pixels contribute. // When downsampling, the contributors are which destination pixels are contributed to. typedef struct { int n0; // First contributing pixel int n1; // Last contributing pixel } stbir__contributors; typedef struct { const void* input_data; int input_w; int input_h; int input_stride_bytes; void* output_data; int output_w; int output_h; int output_stride_bytes; float s0, t0, s1, t1; float horizontal_shift; // Units: output pixels float vertical_shift; // Units: output pixels float horizontal_scale; float vertical_scale; int channels; int alpha_channel; stbir_uint32 flags; stbir_datatype type; stbir_filter horizontal_filter; stbir_filter vertical_filter; stbir_edge edge_horizontal; stbir_edge edge_vertical; stbir_colorspace colorspace; stbir__contributors* horizontal_contributors; float* horizontal_coefficients; stbir__contributors* vertical_contributors; float* vertical_coefficients; int decode_buffer_pixels; float* decode_buffer; float* horizontal_buffer; // cache these because ceil/floor are inexplicably showing up in profile int horizontal_coefficient_width; int vertical_coefficient_width; int horizontal_filter_pixel_width; int vertical_filter_pixel_width; int horizontal_filter_pixel_margin; int vertical_filter_pixel_margin; int horizontal_num_contributors; int vertical_num_contributors; int ring_buffer_length_bytes; // The length of an individual entry in the ring buffer. The total number of ring buffers is stbir__get_filter_pixel_width(filter) int ring_buffer_num_entries; // Total number of entries in the ring buffer. int ring_buffer_first_scanline; int ring_buffer_last_scanline; int ring_buffer_begin_index; // first_scanline is at this index in the ring buffer float* ring_buffer; float* encode_buffer; // A temporary buffer to store floats so we don't lose precision while we do multiply-adds. int horizontal_contributors_size; int horizontal_coefficients_size; int vertical_contributors_size; int vertical_coefficients_size; int decode_buffer_size; int horizontal_buffer_size; int ring_buffer_size; int encode_buffer_size; } stbir__info; static const float stbir__max_uint8_as_float = 255.0f; static const float stbir__max_uint16_as_float = 65535.0f; static const double stbir__max_uint32_as_float = 4294967295.0; static stbir__inline int stbir__min(int a, int b) { return a < b ? a : b; } static stbir__inline float stbir__saturate(float x) { if (x < 0) return 0; if (x > 1) return 1; return x; } #ifdef STBIR_SATURATE_INT static stbir__inline stbir_uint8 stbir__saturate8(int x) { if ((unsigned int) x <= 255) return x; if (x < 0) return 0; return 255; } static stbir__inline stbir_uint16 stbir__saturate16(int x) { if ((unsigned int) x <= 65535) return x; if (x < 0) return 0; return 65535; } #endif static float stbir__srgb_uchar_to_linear_float[256] = { 0.000000f, 0.000304f, 0.000607f, 0.000911f, 0.001214f, 0.001518f, 0.001821f, 0.002125f, 0.002428f, 0.002732f, 0.003035f, 0.003347f, 0.003677f, 0.004025f, 0.004391f, 0.004777f, 0.005182f, 0.005605f, 0.006049f, 0.006512f, 0.006995f, 0.007499f, 0.008023f, 0.008568f, 0.009134f, 0.009721f, 0.010330f, 0.010960f, 0.011612f, 0.012286f, 0.012983f, 0.013702f, 0.014444f, 0.015209f, 0.015996f, 0.016807f, 0.017642f, 0.018500f, 0.019382f, 0.020289f, 0.021219f, 0.022174f, 0.023153f, 0.024158f, 0.025187f, 0.026241f, 0.027321f, 0.028426f, 0.029557f, 0.030713f, 0.031896f, 0.033105f, 0.034340f, 0.035601f, 0.036889f, 0.038204f, 0.039546f, 0.040915f, 0.042311f, 0.043735f, 0.045186f, 0.046665f, 0.048172f, 0.049707f, 0.051269f, 0.052861f, 0.054480f, 0.056128f, 0.057805f, 0.059511f, 0.061246f, 0.063010f, 0.064803f, 0.066626f, 0.068478f, 0.070360f, 0.072272f, 0.074214f, 0.076185f, 0.078187f, 0.080220f, 0.082283f, 0.084376f, 0.086500f, 0.088656f, 0.090842f, 0.093059f, 0.095307f, 0.097587f, 0.099899f, 0.102242f, 0.104616f, 0.107023f, 0.109462f, 0.111932f, 0.114435f, 0.116971f, 0.119538f, 0.122139f, 0.124772f, 0.127438f, 0.130136f, 0.132868f, 0.135633f, 0.138432f, 0.141263f, 0.144128f, 0.147027f, 0.149960f, 0.152926f, 0.155926f, 0.158961f, 0.162029f, 0.165132f, 0.168269f, 0.171441f, 0.174647f, 0.177888f, 0.181164f, 0.184475f, 0.187821f, 0.191202f, 0.194618f, 0.198069f, 0.201556f, 0.205079f, 0.208637f, 0.212231f, 0.215861f, 0.219526f, 0.223228f, 0.226966f, 0.230740f, 0.234551f, 0.238398f, 0.242281f, 0.246201f, 0.250158f, 0.254152f, 0.258183f, 0.262251f, 0.266356f, 0.270498f, 0.274677f, 0.278894f, 0.283149f, 0.287441f, 0.291771f, 0.296138f, 0.300544f, 0.304987f, 0.309469f, 0.313989f, 0.318547f, 0.323143f, 0.327778f, 0.332452f, 0.337164f, 0.341914f, 0.346704f, 0.351533f, 0.356400f, 0.361307f, 0.366253f, 0.371238f, 0.376262f, 0.381326f, 0.386430f, 0.391573f, 0.396755f, 0.401978f, 0.407240f, 0.412543f, 0.417885f, 0.423268f, 0.428691f, 0.434154f, 0.439657f, 0.445201f, 0.450786f, 0.456411f, 0.462077f, 0.467784f, 0.473532f, 0.479320f, 0.485150f, 0.491021f, 0.496933f, 0.502887f, 0.508881f, 0.514918f, 0.520996f, 0.527115f, 0.533276f, 0.539480f, 0.545725f, 0.552011f, 0.558340f, 0.564712f, 0.571125f, 0.577581f, 0.584078f, 0.590619f, 0.597202f, 0.603827f, 0.610496f, 0.617207f, 0.623960f, 0.630757f, 0.637597f, 0.644480f, 0.651406f, 0.658375f, 0.665387f, 0.672443f, 0.679543f, 0.686685f, 0.693872f, 0.701102f, 0.708376f, 0.715694f, 0.723055f, 0.730461f, 0.737911f, 0.745404f, 0.752942f, 0.760525f, 0.768151f, 0.775822f, 0.783538f, 0.791298f, 0.799103f, 0.806952f, 0.814847f, 0.822786f, 0.830770f, 0.838799f, 0.846873f, 0.854993f, 0.863157f, 0.871367f, 0.879622f, 0.887923f, 0.896269f, 0.904661f, 0.913099f, 0.921582f, 0.930111f, 0.938686f, 0.947307f, 0.955974f, 0.964686f, 0.973445f, 0.982251f, 0.991102f, 1.0f }; static float stbir__srgb_to_linear(float f) { if (f <= 0.04045f) return f / 12.92f; else return (float)pow((f + 0.055f) / 1.055f, 2.4f); } static float stbir__linear_to_srgb(float f) { if (f <= 0.0031308f) return f * 12.92f; else return 1.055f * (float)pow(f, 1 / 2.4f) - 0.055f; } #ifndef STBIR_NON_IEEE_FLOAT // From https://gist.github.com/rygorous/2203834 typedef union { stbir_uint32 u; float f; } stbir__FP32; static const stbir_uint32 fp32_to_srgb8_tab4[104] = { 0x0073000d, 0x007a000d, 0x0080000d, 0x0087000d, 0x008d000d, 0x0094000d, 0x009a000d, 0x00a1000d, 0x00a7001a, 0x00b4001a, 0x00c1001a, 0x00ce001a, 0x00da001a, 0x00e7001a, 0x00f4001a, 0x0101001a, 0x010e0033, 0x01280033, 0x01410033, 0x015b0033, 0x01750033, 0x018f0033, 0x01a80033, 0x01c20033, 0x01dc0067, 0x020f0067, 0x02430067, 0x02760067, 0x02aa0067, 0x02dd0067, 0x03110067, 0x03440067, 0x037800ce, 0x03df00ce, 0x044600ce, 0x04ad00ce, 0x051400ce, 0x057b00c5, 0x05dd00bc, 0x063b00b5, 0x06970158, 0x07420142, 0x07e30130, 0x087b0120, 0x090b0112, 0x09940106, 0x0a1700fc, 0x0a9500f2, 0x0b0f01cb, 0x0bf401ae, 0x0ccb0195, 0x0d950180, 0x0e56016e, 0x0f0d015e, 0x0fbc0150, 0x10630143, 0x11070264, 0x1238023e, 0x1357021d, 0x14660201, 0x156601e9, 0x165a01d3, 0x174401c0, 0x182401af, 0x18fe0331, 0x1a9602fe, 0x1c1502d2, 0x1d7e02ad, 0x1ed4028d, 0x201a0270, 0x21520256, 0x227d0240, 0x239f0443, 0x25c003fe, 0x27bf03c4, 0x29a10392, 0x2b6a0367, 0x2d1d0341, 0x2ebe031f, 0x304d0300, 0x31d105b0, 0x34a80555, 0x37520507, 0x39d504c5, 0x3c37048b, 0x3e7c0458, 0x40a8042a, 0x42bd0401, 0x44c20798, 0x488e071e, 0x4c1c06b6, 0x4f76065d, 0x52a50610, 0x55ac05cc, 0x5892058f, 0x5b590559, 0x5e0c0a23, 0x631c0980, 0x67db08f6, 0x6c55087f, 0x70940818, 0x74a007bd, 0x787d076c, 0x7c330723, }; static stbir_uint8 stbir__linear_to_srgb_uchar(float in) { static const stbir__FP32 almostone = { 0x3f7fffff }; // 1-eps static const stbir__FP32 minval = { (127-13) << 23 }; stbir_uint32 tab,bias,scale,t; stbir__FP32 f; // Clamp to [2^(-13), 1-eps]; these two values map to 0 and 1, respectively. // The tests are carefully written so that NaNs map to 0, same as in the reference // implementation. if (!(in > minval.f)) // written this way to catch NaNs in = minval.f; if (in > almostone.f) in = almostone.f; // Do the table lookup and unpack bias, scale f.f = in; tab = fp32_to_srgb8_tab4[(f.u - minval.u) >> 20]; bias = (tab >> 16) << 9; scale = tab & 0xffff; // Grab next-highest mantissa bits and perform linear interpolation t = (f.u >> 12) & 0xff; return (unsigned char) ((bias + scale*t) >> 16); } #else // sRGB transition values, scaled by 1<<28 static int stbir__srgb_offset_to_linear_scaled[256] = { 0, 40738, 122216, 203693, 285170, 366648, 448125, 529603, 611080, 692557, 774035, 855852, 942009, 1033024, 1128971, 1229926, 1335959, 1447142, 1563542, 1685229, 1812268, 1944725, 2082664, 2226148, 2375238, 2529996, 2690481, 2856753, 3028870, 3206888, 3390865, 3580856, 3776916, 3979100, 4187460, 4402049, 4622919, 4850123, 5083710, 5323731, 5570236, 5823273, 6082892, 6349140, 6622065, 6901714, 7188133, 7481369, 7781466, 8088471, 8402427, 8723380, 9051372, 9386448, 9728650, 10078021, 10434603, 10798439, 11169569, 11548036, 11933879, 12327139, 12727857, 13136073, 13551826, 13975156, 14406100, 14844697, 15290987, 15745007, 16206795, 16676389, 17153826, 17639142, 18132374, 18633560, 19142734, 19659934, 20185196, 20718552, 21260042, 21809696, 22367554, 22933648, 23508010, 24090680, 24681686, 25281066, 25888850, 26505076, 27129772, 27762974, 28404716, 29055026, 29713942, 30381490, 31057708, 31742624, 32436272, 33138682, 33849884, 34569912, 35298800, 36036568, 36783260, 37538896, 38303512, 39077136, 39859796, 40651528, 41452360, 42262316, 43081432, 43909732, 44747252, 45594016, 46450052, 47315392, 48190064, 49074096, 49967516, 50870356, 51782636, 52704392, 53635648, 54576432, 55526772, 56486700, 57456236, 58435408, 59424248, 60422780, 61431036, 62449032, 63476804, 64514376, 65561776, 66619028, 67686160, 68763192, 69850160, 70947088, 72053992, 73170912, 74297864, 75434880, 76581976, 77739184, 78906536, 80084040, 81271736, 82469648, 83677792, 84896192, 86124888, 87363888, 88613232, 89872928, 91143016, 92423512, 93714432, 95015816, 96327688, 97650056, 98982952, 100326408, 101680440, 103045072, 104420320, 105806224, 107202800, 108610064, 110028048, 111456776, 112896264, 114346544, 115807632, 117279552, 118762328, 120255976, 121760536, 123276016, 124802440, 126339832, 127888216, 129447616, 131018048, 132599544, 134192112, 135795792, 137410592, 139036528, 140673648, 142321952, 143981456, 145652208, 147334208, 149027488, 150732064, 152447968, 154175200, 155913792, 157663776, 159425168, 161197984, 162982240, 164777968, 166585184, 168403904, 170234160, 172075968, 173929344, 175794320, 177670896, 179559120, 181458992, 183370528, 185293776, 187228736, 189175424, 191133888, 193104112, 195086128, 197079968, 199085648, 201103184, 203132592, 205173888, 207227120, 209292272, 211369392, 213458480, 215559568, 217672656, 219797792, 221934976, 224084240, 226245600, 228419056, 230604656, 232802400, 235012320, 237234432, 239468736, 241715280, 243974080, 246245120, 248528464, 250824112, 253132064, 255452368, 257785040, 260130080, 262487520, 264857376, 267239664, }; static stbir_uint8 stbir__linear_to_srgb_uchar(float f) { int x = (int) (f * (1 << 28)); // has headroom so you don't need to clamp int v = 0; int i; // Refine the guess with a short binary search. i = v + 128; if (x >= stbir__srgb_offset_to_linear_scaled[i]) v = i; i = v + 64; if (x >= stbir__srgb_offset_to_linear_scaled[i]) v = i; i = v + 32; if (x >= stbir__srgb_offset_to_linear_scaled[i]) v = i; i = v + 16; if (x >= stbir__srgb_offset_to_linear_scaled[i]) v = i; i = v + 8; if (x >= stbir__srgb_offset_to_linear_scaled[i]) v = i; i = v + 4; if (x >= stbir__srgb_offset_to_linear_scaled[i]) v = i; i = v + 2; if (x >= stbir__srgb_offset_to_linear_scaled[i]) v = i; i = v + 1; if (x >= stbir__srgb_offset_to_linear_scaled[i]) v = i; return (stbir_uint8) v; } #endif static float stbir__filter_trapezoid(float x, float scale) { float halfscale = scale / 2; float t = 0.5f + halfscale; STBIR_ASSERT(scale <= 1); x = (float)fabs(x); if (x >= t) return 0; else { float r = 0.5f - halfscale; if (x <= r) return 1; else return (t - x) / scale; } } static float stbir__support_trapezoid(float scale) { STBIR_ASSERT(scale <= 1); return 0.5f + scale / 2; } static float stbir__filter_triangle(float x, float s) { STBIR__UNUSED_PARAM(s); x = (float)fabs(x); if (x <= 1.0f) return 1 - x; else return 0; } static float stbir__filter_cubic(float x, float s) { STBIR__UNUSED_PARAM(s); x = (float)fabs(x); if (x < 1.0f) return (4 + x*x*(3*x - 6))/6; else if (x < 2.0f) return (8 + x*(-12 + x*(6 - x)))/6; return (0.0f); } static float stbir__filter_catmullrom(float x, float s) { STBIR__UNUSED_PARAM(s); x = (float)fabs(x); if (x < 1.0f) return 1 - x*x*(2.5f - 1.5f*x); else if (x < 2.0f) return 2 - x*(4 + x*(0.5f*x - 2.5f)); return (0.0f); } static float stbir__filter_mitchell(float x, float s) { STBIR__UNUSED_PARAM(s); x = (float)fabs(x); if (x < 1.0f) return (16 + x*x*(21 * x - 36))/18; else if (x < 2.0f) return (32 + x*(-60 + x*(36 - 7*x)))/18; return (0.0f); } static float stbir__support_zero(float s) { STBIR__UNUSED_PARAM(s); return 0; } static float stbir__support_one(float s) { STBIR__UNUSED_PARAM(s); return 1; } static float stbir__support_two(float s) { STBIR__UNUSED_PARAM(s); return 2; } static stbir__filter_info stbir__filter_info_table[] = { { NULL, stbir__support_zero }, { stbir__filter_trapezoid, stbir__support_trapezoid }, { stbir__filter_triangle, stbir__support_one }, { stbir__filter_cubic, stbir__support_two }, { stbir__filter_catmullrom, stbir__support_two }, { stbir__filter_mitchell, stbir__support_two }, }; stbir__inline static int stbir__use_upsampling(float ratio) { return ratio > 1; } stbir__inline static int stbir__use_width_upsampling(stbir__info* stbir_info) { return stbir__use_upsampling(stbir_info->horizontal_scale); } stbir__inline static int stbir__use_height_upsampling(stbir__info* stbir_info) { return stbir__use_upsampling(stbir_info->vertical_scale); } // This is the maximum number of input samples that can affect an output sample // with the given filter static int stbir__get_filter_pixel_width(stbir_filter filter, float scale) { STBIR_ASSERT(filter != 0); STBIR_ASSERT(filter < STBIR__ARRAY_SIZE(stbir__filter_info_table)); if (stbir__use_upsampling(scale)) return (int)ceil(stbir__filter_info_table[filter].support(1/scale) * 2); else return (int)ceil(stbir__filter_info_table[filter].support(scale) * 2 / scale); } // This is how much to expand buffers to account for filters seeking outside // the image boundaries. static int stbir__get_filter_pixel_margin(stbir_filter filter, float scale) { return stbir__get_filter_pixel_width(filter, scale) / 2; } static int stbir__get_coefficient_width(stbir_filter filter, float scale) { if (stbir__use_upsampling(scale)) return (int)ceil(stbir__filter_info_table[filter].support(1 / scale) * 2); else return (int)ceil(stbir__filter_info_table[filter].support(scale) * 2); } static int stbir__get_contributors(float scale, stbir_filter filter, int input_size, int output_size) { if (stbir__use_upsampling(scale)) return output_size; else return (input_size + stbir__get_filter_pixel_margin(filter, scale) * 2); } static int stbir__get_total_horizontal_coefficients(stbir__info* info) { return info->horizontal_num_contributors * stbir__get_coefficient_width (info->horizontal_filter, info->horizontal_scale); } static int stbir__get_total_vertical_coefficients(stbir__info* info) { return info->vertical_num_contributors * stbir__get_coefficient_width (info->vertical_filter, info->vertical_scale); } static stbir__contributors* stbir__get_contributor(stbir__contributors* contributors, int n) { return &contributors[n]; } // For perf reasons this code is duplicated in stbir__resample_horizontal_upsample/downsample, // if you change it here change it there too. static float* stbir__get_coefficient(float* coefficients, stbir_filter filter, float scale, int n, int c) { int width = stbir__get_coefficient_width(filter, scale); return &coefficients[width*n + c]; } static int stbir__edge_wrap_slow(stbir_edge edge, int n, int max) { switch (edge) { case STBIR_EDGE_ZERO: return 0; // we'll decode the wrong pixel here, and then overwrite with 0s later case STBIR_EDGE_CLAMP: if (n < 0) return 0; if (n >= max) return max - 1; return n; // NOTREACHED case STBIR_EDGE_REFLECT: { if (n < 0) { if (n < max) return -n; else return max - 1; } if (n >= max) { int max2 = max * 2; if (n >= max2) return 0; else return max2 - n - 1; } return n; // NOTREACHED } case STBIR_EDGE_WRAP: if (n >= 0) return (n % max); else { int m = (-n) % max; if (m != 0) m = max - m; return (m); } // NOTREACHED default: STBIR_ASSERT(!"Unimplemented edge type"); return 0; } } stbir__inline static int stbir__edge_wrap(stbir_edge edge, int n, int max) { // avoid per-pixel switch if (n >= 0 && n < max) return n; return stbir__edge_wrap_slow(edge, n, max); } // What input pixels contribute to this output pixel? static void stbir__calculate_sample_range_upsample(int n, float out_filter_radius, float scale_ratio, float out_shift, int* in_first_pixel, int* in_last_pixel, float* in_center_of_out) { float out_pixel_center = (float)n + 0.5f; float out_pixel_influence_lowerbound = out_pixel_center - out_filter_radius; float out_pixel_influence_upperbound = out_pixel_center + out_filter_radius; float in_pixel_influence_lowerbound = (out_pixel_influence_lowerbound + out_shift) / scale_ratio; float in_pixel_influence_upperbound = (out_pixel_influence_upperbound + out_shift) / scale_ratio; *in_center_of_out = (out_pixel_center + out_shift) / scale_ratio; *in_first_pixel = (int)(floor(in_pixel_influence_lowerbound + 0.5)); *in_last_pixel = (int)(floor(in_pixel_influence_upperbound - 0.5)); } // What output pixels does this input pixel contribute to? static void stbir__calculate_sample_range_downsample(int n, float in_pixels_radius, float scale_ratio, float out_shift, int* out_first_pixel, int* out_last_pixel, float* out_center_of_in) { float in_pixel_center = (float)n + 0.5f; float in_pixel_influence_lowerbound = in_pixel_center - in_pixels_radius; float in_pixel_influence_upperbound = in_pixel_center + in_pixels_radius; float out_pixel_influence_lowerbound = in_pixel_influence_lowerbound * scale_ratio - out_shift; float out_pixel_influence_upperbound = in_pixel_influence_upperbound * scale_ratio - out_shift; *out_center_of_in = in_pixel_center * scale_ratio - out_shift; *out_first_pixel = (int)(floor(out_pixel_influence_lowerbound + 0.5)); *out_last_pixel = (int)(floor(out_pixel_influence_upperbound - 0.5)); } static void stbir__calculate_coefficients_upsample(stbir_filter filter, float scale, int in_first_pixel, int in_last_pixel, float in_center_of_out, stbir__contributors* contributor, float* coefficient_group) { int i; float total_filter = 0; float filter_scale; STBIR_ASSERT(in_last_pixel - in_first_pixel <= (int)ceil(stbir__filter_info_table[filter].support(1/scale) * 2)); // Taken directly from stbir__get_coefficient_width() which we can't call because we don't know if we're horizontal or vertical. contributor->n0 = in_first_pixel; contributor->n1 = in_last_pixel; STBIR_ASSERT(contributor->n1 >= contributor->n0); for (i = 0; i <= in_last_pixel - in_first_pixel; i++) { float in_pixel_center = (float)(i + in_first_pixel) + 0.5f; coefficient_group[i] = stbir__filter_info_table[filter].kernel(in_center_of_out - in_pixel_center, 1 / scale); // If the coefficient is zero, skip it. (Don't do the <0 check here, we want the influence of those outside pixels.) if (i == 0 && !coefficient_group[i]) { contributor->n0 = ++in_first_pixel; i--; continue; } total_filter += coefficient_group[i]; } STBIR_ASSERT(stbir__filter_info_table[filter].kernel((float)(in_last_pixel + 1) + 0.5f - in_center_of_out, 1/scale) == 0); STBIR_ASSERT(total_filter > 0.9); STBIR_ASSERT(total_filter < 1.1f); // Make sure it's not way off. // Make sure the sum of all coefficients is 1. filter_scale = 1 / total_filter; for (i = 0; i <= in_last_pixel - in_first_pixel; i++) coefficient_group[i] *= filter_scale; for (i = in_last_pixel - in_first_pixel; i >= 0; i--) { if (coefficient_group[i]) break; // This line has no weight. We can skip it. contributor->n1 = contributor->n0 + i - 1; } } static void stbir__calculate_coefficients_downsample(stbir_filter filter, float scale_ratio, int out_first_pixel, int out_last_pixel, float out_center_of_in, stbir__contributors* contributor, float* coefficient_group) { int i; STBIR_ASSERT(out_last_pixel - out_first_pixel <= (int)ceil(stbir__filter_info_table[filter].support(scale_ratio) * 2)); // Taken directly from stbir__get_coefficient_width() which we can't call because we don't know if we're horizontal or vertical. contributor->n0 = out_first_pixel; contributor->n1 = out_last_pixel; STBIR_ASSERT(contributor->n1 >= contributor->n0); for (i = 0; i <= out_last_pixel - out_first_pixel; i++) { float out_pixel_center = (float)(i + out_first_pixel) + 0.5f; float x = out_pixel_center - out_center_of_in; coefficient_group[i] = stbir__filter_info_table[filter].kernel(x, scale_ratio) * scale_ratio; } STBIR_ASSERT(stbir__filter_info_table[filter].kernel((float)(out_last_pixel + 1) + 0.5f - out_center_of_in, scale_ratio) == 0); for (i = out_last_pixel - out_first_pixel; i >= 0; i--) { if (coefficient_group[i]) break; // This line has no weight. We can skip it. contributor->n1 = contributor->n0 + i - 1; } } static void stbir__normalize_downsample_coefficients(stbir__contributors* contributors, float* coefficients, stbir_filter filter, float scale_ratio, int input_size, int output_size) { int num_contributors = stbir__get_contributors(scale_ratio, filter, input_size, output_size); int num_coefficients = stbir__get_coefficient_width(filter, scale_ratio); int i, j; int skip; for (i = 0; i < output_size; i++) { float scale; float total = 0; for (j = 0; j < num_contributors; j++) { if (i >= contributors[j].n0 && i <= contributors[j].n1) { float coefficient = *stbir__get_coefficient(coefficients, filter, scale_ratio, j, i - contributors[j].n0); total += coefficient; } else if (i < contributors[j].n0) break; } STBIR_ASSERT(total > 0.9f); STBIR_ASSERT(total < 1.1f); scale = 1 / total; for (j = 0; j < num_contributors; j++) { if (i >= contributors[j].n0 && i <= contributors[j].n1) *stbir__get_coefficient(coefficients, filter, scale_ratio, j, i - contributors[j].n0) *= scale; else if (i < contributors[j].n0) break; } } // Optimize: Skip zero coefficients and contributions outside of image bounds. // Do this after normalizing because normalization depends on the n0/n1 values. for (j = 0; j < num_contributors; j++) { int range, max, width; skip = 0; while (*stbir__get_coefficient(coefficients, filter, scale_ratio, j, skip) == 0) skip++; contributors[j].n0 += skip; while (contributors[j].n0 < 0) { contributors[j].n0++; skip++; } range = contributors[j].n1 - contributors[j].n0 + 1; max = stbir__min(num_coefficients, range); width = stbir__get_coefficient_width(filter, scale_ratio); for (i = 0; i < max; i++) { if (i + skip >= width) break; *stbir__get_coefficient(coefficients, filter, scale_ratio, j, i) = *stbir__get_coefficient(coefficients, filter, scale_ratio, j, i + skip); } continue; } // Using min to avoid writing into invalid pixels. for (i = 0; i < num_contributors; i++) contributors[i].n1 = stbir__min(contributors[i].n1, output_size - 1); } // Each scan line uses the same kernel values so we should calculate the kernel // values once and then we can use them for every scan line. static void stbir__calculate_filters(stbir__contributors* contributors, float* coefficients, stbir_filter filter, float scale_ratio, float shift, int input_size, int output_size) { int n; int total_contributors = stbir__get_contributors(scale_ratio, filter, input_size, output_size); if (stbir__use_upsampling(scale_ratio)) { float out_pixels_radius = stbir__filter_info_table[filter].support(1 / scale_ratio) * scale_ratio; // Looping through out pixels for (n = 0; n < total_contributors; n++) { float in_center_of_out; // Center of the current out pixel in the in pixel space int in_first_pixel, in_last_pixel; stbir__calculate_sample_range_upsample(n, out_pixels_radius, scale_ratio, shift, &in_first_pixel, &in_last_pixel, &in_center_of_out); stbir__calculate_coefficients_upsample(filter, scale_ratio, in_first_pixel, in_last_pixel, in_center_of_out, stbir__get_contributor(contributors, n), stbir__get_coefficient(coefficients, filter, scale_ratio, n, 0)); } } else { float in_pixels_radius = stbir__filter_info_table[filter].support(scale_ratio) / scale_ratio; // Looping through in pixels for (n = 0; n < total_contributors; n++) { float out_center_of_in; // Center of the current out pixel in the in pixel space int out_first_pixel, out_last_pixel; int n_adjusted = n - stbir__get_filter_pixel_margin(filter, scale_ratio); stbir__calculate_sample_range_downsample(n_adjusted, in_pixels_radius, scale_ratio, shift, &out_first_pixel, &out_last_pixel, &out_center_of_in); stbir__calculate_coefficients_downsample(filter, scale_ratio, out_first_pixel, out_last_pixel, out_center_of_in, stbir__get_contributor(contributors, n), stbir__get_coefficient(coefficients, filter, scale_ratio, n, 0)); } stbir__normalize_downsample_coefficients(contributors, coefficients, filter, scale_ratio, input_size, output_size); } } static float* stbir__get_decode_buffer(stbir__info* stbir_info) { // The 0 index of the decode buffer starts after the margin. This makes // it okay to use negative indexes on the decode buffer. return &stbir_info->decode_buffer[stbir_info->horizontal_filter_pixel_margin * stbir_info->channels]; } #define STBIR__DECODE(type, colorspace) ((type) * (STBIR_MAX_COLORSPACES) + (colorspace)) static void stbir__decode_scanline(stbir__info* stbir_info, int n) { int c; int channels = stbir_info->channels; int alpha_channel = stbir_info->alpha_channel; int type = stbir_info->type; int colorspace = stbir_info->colorspace; int input_w = stbir_info->input_w; size_t input_stride_bytes = stbir_info->input_stride_bytes; float* decode_buffer = stbir__get_decode_buffer(stbir_info); stbir_edge edge_horizontal = stbir_info->edge_horizontal; stbir_edge edge_vertical = stbir_info->edge_vertical; size_t in_buffer_row_offset = stbir__edge_wrap(edge_vertical, n, stbir_info->input_h) * input_stride_bytes; const void* input_data = (char *) stbir_info->input_data + in_buffer_row_offset; int max_x = input_w + stbir_info->horizontal_filter_pixel_margin; int decode = STBIR__DECODE(type, colorspace); int x = -stbir_info->horizontal_filter_pixel_margin; // special handling for STBIR_EDGE_ZERO because it needs to return an item that doesn't appear in the input, // and we want to avoid paying overhead on every pixel if not STBIR_EDGE_ZERO if (edge_vertical == STBIR_EDGE_ZERO && (n < 0 || n >= stbir_info->input_h)) { for (; x < max_x; x++) for (c = 0; c < channels; c++) decode_buffer[x*channels + c] = 0; return; } switch (decode) { case STBIR__DECODE(STBIR_TYPE_UINT8, STBIR_COLORSPACE_LINEAR): for (; x < max_x; x++) { int decode_pixel_index = x * channels; int input_pixel_index = stbir__edge_wrap(edge_horizontal, x, input_w) * channels; for (c = 0; c < channels; c++) decode_buffer[decode_pixel_index + c] = ((float)((const unsigned char*)input_data)[input_pixel_index + c]) / stbir__max_uint8_as_float; } break; case STBIR__DECODE(STBIR_TYPE_UINT8, STBIR_COLORSPACE_SRGB): for (; x < max_x; x++) { int decode_pixel_index = x * channels; int input_pixel_index = stbir__edge_wrap(edge_horizontal, x, input_w) * channels; for (c = 0; c < channels; c++) decode_buffer[decode_pixel_index + c] = stbir__srgb_uchar_to_linear_float[((const unsigned char*)input_data)[input_pixel_index + c]]; if (!(stbir_info->flags&STBIR_FLAG_ALPHA_USES_COLORSPACE)) decode_buffer[decode_pixel_index + alpha_channel] = ((float)((const unsigned char*)input_data)[input_pixel_index + alpha_channel]) / stbir__max_uint8_as_float; } break; case STBIR__DECODE(STBIR_TYPE_UINT16, STBIR_COLORSPACE_LINEAR): for (; x < max_x; x++) { int decode_pixel_index = x * channels; int input_pixel_index = stbir__edge_wrap(edge_horizontal, x, input_w) * channels; for (c = 0; c < channels; c++) decode_buffer[decode_pixel_index + c] = ((float)((const unsigned short*)input_data)[input_pixel_index + c]) / stbir__max_uint16_as_float; } break; case STBIR__DECODE(STBIR_TYPE_UINT16, STBIR_COLORSPACE_SRGB): for (; x < max_x; x++) { int decode_pixel_index = x * channels; int input_pixel_index = stbir__edge_wrap(edge_horizontal, x, input_w) * channels; for (c = 0; c < channels; c++) decode_buffer[decode_pixel_index + c] = stbir__srgb_to_linear(((float)((const unsigned short*)input_data)[input_pixel_index + c]) / stbir__max_uint16_as_float); if (!(stbir_info->flags&STBIR_FLAG_ALPHA_USES_COLORSPACE)) decode_buffer[decode_pixel_index + alpha_channel] = ((float)((const unsigned short*)input_data)[input_pixel_index + alpha_channel]) / stbir__max_uint16_as_float; } break; case STBIR__DECODE(STBIR_TYPE_UINT32, STBIR_COLORSPACE_LINEAR): for (; x < max_x; x++) { int decode_pixel_index = x * channels; int input_pixel_index = stbir__edge_wrap(edge_horizontal, x, input_w) * channels; for (c = 0; c < channels; c++) decode_buffer[decode_pixel_index + c] = (float)(((double)((const unsigned int*)input_data)[input_pixel_index + c]) / stbir__max_uint32_as_float); } break; case STBIR__DECODE(STBIR_TYPE_UINT32, STBIR_COLORSPACE_SRGB): for (; x < max_x; x++) { int decode_pixel_index = x * channels; int input_pixel_index = stbir__edge_wrap(edge_horizontal, x, input_w) * channels; for (c = 0; c < channels; c++) decode_buffer[decode_pixel_index + c] = stbir__srgb_to_linear((float)(((double)((const unsigned int*)input_data)[input_pixel_index + c]) / stbir__max_uint32_as_float)); if (!(stbir_info->flags&STBIR_FLAG_ALPHA_USES_COLORSPACE)) decode_buffer[decode_pixel_index + alpha_channel] = (float)(((double)((const unsigned int*)input_data)[input_pixel_index + alpha_channel]) / stbir__max_uint32_as_float); } break; case STBIR__DECODE(STBIR_TYPE_FLOAT, STBIR_COLORSPACE_LINEAR): for (; x < max_x; x++) { int decode_pixel_index = x * channels; int input_pixel_index = stbir__edge_wrap(edge_horizontal, x, input_w) * channels; for (c = 0; c < channels; c++) decode_buffer[decode_pixel_index + c] = ((const float*)input_data)[input_pixel_index + c]; } break; case STBIR__DECODE(STBIR_TYPE_FLOAT, STBIR_COLORSPACE_SRGB): for (; x < max_x; x++) { int decode_pixel_index = x * channels; int input_pixel_index = stbir__edge_wrap(edge_horizontal, x, input_w) * channels; for (c = 0; c < channels; c++) decode_buffer[decode_pixel_index + c] = stbir__srgb_to_linear(((const float*)input_data)[input_pixel_index + c]); if (!(stbir_info->flags&STBIR_FLAG_ALPHA_USES_COLORSPACE)) decode_buffer[decode_pixel_index + alpha_channel] = ((const float*)input_data)[input_pixel_index + alpha_channel]; } break; default: STBIR_ASSERT(!"Unknown type/colorspace/channels combination."); break; } if (!(stbir_info->flags & STBIR_FLAG_ALPHA_PREMULTIPLIED)) { for (x = -stbir_info->horizontal_filter_pixel_margin; x < max_x; x++) { int decode_pixel_index = x * channels; // If the alpha value is 0 it will clobber the color values. Make sure it's not. float alpha = decode_buffer[decode_pixel_index + alpha_channel]; #ifndef STBIR_NO_ALPHA_EPSILON if (stbir_info->type != STBIR_TYPE_FLOAT) { alpha += STBIR_ALPHA_EPSILON; decode_buffer[decode_pixel_index + alpha_channel] = alpha; } #endif for (c = 0; c < channels; c++) { if (c == alpha_channel) continue; decode_buffer[decode_pixel_index + c] *= alpha; } } } if (edge_horizontal == STBIR_EDGE_ZERO) { for (x = -stbir_info->horizontal_filter_pixel_margin; x < 0; x++) { for (c = 0; c < channels; c++) decode_buffer[x*channels + c] = 0; } for (x = input_w; x < max_x; x++) { for (c = 0; c < channels; c++) decode_buffer[x*channels + c] = 0; } } } static float* stbir__get_ring_buffer_entry(float* ring_buffer, int index, int ring_buffer_length) { return &ring_buffer[index * ring_buffer_length]; } static float* stbir__add_empty_ring_buffer_entry(stbir__info* stbir_info, int n) { int ring_buffer_index; float* ring_buffer; stbir_info->ring_buffer_last_scanline = n; if (stbir_info->ring_buffer_begin_index < 0) { ring_buffer_index = stbir_info->ring_buffer_begin_index = 0; stbir_info->ring_buffer_first_scanline = n; } else { ring_buffer_index = (stbir_info->ring_buffer_begin_index + (stbir_info->ring_buffer_last_scanline - stbir_info->ring_buffer_first_scanline)) % stbir_info->ring_buffer_num_entries; STBIR_ASSERT(ring_buffer_index != stbir_info->ring_buffer_begin_index); } ring_buffer = stbir__get_ring_buffer_entry(stbir_info->ring_buffer, ring_buffer_index, stbir_info->ring_buffer_length_bytes / sizeof(float)); memset(ring_buffer, 0, stbir_info->ring_buffer_length_bytes); return ring_buffer; } static void stbir__resample_horizontal_upsample(stbir__info* stbir_info, float* output_buffer) { int x, k; int output_w = stbir_info->output_w; int channels = stbir_info->channels; float* decode_buffer = stbir__get_decode_buffer(stbir_info); stbir__contributors* horizontal_contributors = stbir_info->horizontal_contributors; float* horizontal_coefficients = stbir_info->horizontal_coefficients; int coefficient_width = stbir_info->horizontal_coefficient_width; for (x = 0; x < output_w; x++) { int n0 = horizontal_contributors[x].n0; int n1 = horizontal_contributors[x].n1; int out_pixel_index = x * channels; int coefficient_group = coefficient_width * x; int coefficient_counter = 0; STBIR_ASSERT(n1 >= n0); STBIR_ASSERT(n0 >= -stbir_info->horizontal_filter_pixel_margin); STBIR_ASSERT(n1 >= -stbir_info->horizontal_filter_pixel_margin); STBIR_ASSERT(n0 < stbir_info->input_w + stbir_info->horizontal_filter_pixel_margin); STBIR_ASSERT(n1 < stbir_info->input_w + stbir_info->horizontal_filter_pixel_margin); switch (channels) { case 1: for (k = n0; k <= n1; k++) { int in_pixel_index = k * 1; float coefficient = horizontal_coefficients[coefficient_group + coefficient_counter++]; STBIR_ASSERT(coefficient != 0); output_buffer[out_pixel_index + 0] += decode_buffer[in_pixel_index + 0] * coefficient; } break; case 2: for (k = n0; k <= n1; k++) { int in_pixel_index = k * 2; float coefficient = horizontal_coefficients[coefficient_group + coefficient_counter++]; STBIR_ASSERT(coefficient != 0); output_buffer[out_pixel_index + 0] += decode_buffer[in_pixel_index + 0] * coefficient; output_buffer[out_pixel_index + 1] += decode_buffer[in_pixel_index + 1] * coefficient; } break; case 3: for (k = n0; k <= n1; k++) { int in_pixel_index = k * 3; float coefficient = horizontal_coefficients[coefficient_group + coefficient_counter++]; STBIR_ASSERT(coefficient != 0); output_buffer[out_pixel_index + 0] += decode_buffer[in_pixel_index + 0] * coefficient; output_buffer[out_pixel_index + 1] += decode_buffer[in_pixel_index + 1] * coefficient; output_buffer[out_pixel_index + 2] += decode_buffer[in_pixel_index + 2] * coefficient; } break; case 4: for (k = n0; k <= n1; k++) { int in_pixel_index = k * 4; float coefficient = horizontal_coefficients[coefficient_group + coefficient_counter++]; STBIR_ASSERT(coefficient != 0); output_buffer[out_pixel_index + 0] += decode_buffer[in_pixel_index + 0] * coefficient; output_buffer[out_pixel_index + 1] += decode_buffer[in_pixel_index + 1] * coefficient; output_buffer[out_pixel_index + 2] += decode_buffer[in_pixel_index + 2] * coefficient; output_buffer[out_pixel_index + 3] += decode_buffer[in_pixel_index + 3] * coefficient; } break; default: for (k = n0; k <= n1; k++) { int in_pixel_index = k * channels; float coefficient = horizontal_coefficients[coefficient_group + coefficient_counter++]; int c; STBIR_ASSERT(coefficient != 0); for (c = 0; c < channels; c++) output_buffer[out_pixel_index + c] += decode_buffer[in_pixel_index + c] * coefficient; } break; } } } static void stbir__resample_horizontal_downsample(stbir__info* stbir_info, float* output_buffer) { int x, k; int input_w = stbir_info->input_w; int channels = stbir_info->channels; float* decode_buffer = stbir__get_decode_buffer(stbir_info); stbir__contributors* horizontal_contributors = stbir_info->horizontal_contributors; float* horizontal_coefficients = stbir_info->horizontal_coefficients; int coefficient_width = stbir_info->horizontal_coefficient_width; int filter_pixel_margin = stbir_info->horizontal_filter_pixel_margin; int max_x = input_w + filter_pixel_margin * 2; STBIR_ASSERT(!stbir__use_width_upsampling(stbir_info)); switch (channels) { case 1: for (x = 0; x < max_x; x++) { int n0 = horizontal_contributors[x].n0; int n1 = horizontal_contributors[x].n1; int in_x = x - filter_pixel_margin; int in_pixel_index = in_x * 1; int max_n = n1; int coefficient_group = coefficient_width * x; for (k = n0; k <= max_n; k++) { int out_pixel_index = k * 1; float coefficient = horizontal_coefficients[coefficient_group + k - n0]; STBIR_ASSERT(coefficient != 0); output_buffer[out_pixel_index + 0] += decode_buffer[in_pixel_index + 0] * coefficient; } } break; case 2: for (x = 0; x < max_x; x++) { int n0 = horizontal_contributors[x].n0; int n1 = horizontal_contributors[x].n1; int in_x = x - filter_pixel_margin; int in_pixel_index = in_x * 2; int max_n = n1; int coefficient_group = coefficient_width * x; for (k = n0; k <= max_n; k++) { int out_pixel_index = k * 2; float coefficient = horizontal_coefficients[coefficient_group + k - n0]; STBIR_ASSERT(coefficient != 0); output_buffer[out_pixel_index + 0] += decode_buffer[in_pixel_index + 0] * coefficient; output_buffer[out_pixel_index + 1] += decode_buffer[in_pixel_index + 1] * coefficient; } } break; case 3: for (x = 0; x < max_x; x++) { int n0 = horizontal_contributors[x].n0; int n1 = horizontal_contributors[x].n1; int in_x = x - filter_pixel_margin; int in_pixel_index = in_x * 3; int max_n = n1; int coefficient_group = coefficient_width * x; for (k = n0; k <= max_n; k++) { int out_pixel_index = k * 3; float coefficient = horizontal_coefficients[coefficient_group + k - n0]; STBIR_ASSERT(coefficient != 0); output_buffer[out_pixel_index + 0] += decode_buffer[in_pixel_index + 0] * coefficient; output_buffer[out_pixel_index + 1] += decode_buffer[in_pixel_index + 1] * coefficient; output_buffer[out_pixel_index + 2] += decode_buffer[in_pixel_index + 2] * coefficient; } } break; case 4: for (x = 0; x < max_x; x++) { int n0 = horizontal_contributors[x].n0; int n1 = horizontal_contributors[x].n1; int in_x = x - filter_pixel_margin; int in_pixel_index = in_x * 4; int max_n = n1; int coefficient_group = coefficient_width * x; for (k = n0; k <= max_n; k++) { int out_pixel_index = k * 4; float coefficient = horizontal_coefficients[coefficient_group + k - n0]; STBIR_ASSERT(coefficient != 0); output_buffer[out_pixel_index + 0] += decode_buffer[in_pixel_index + 0] * coefficient; output_buffer[out_pixel_index + 1] += decode_buffer[in_pixel_index + 1] * coefficient; output_buffer[out_pixel_index + 2] += decode_buffer[in_pixel_index + 2] * coefficient; output_buffer[out_pixel_index + 3] += decode_buffer[in_pixel_index + 3] * coefficient; } } break; default: for (x = 0; x < max_x; x++) { int n0 = horizontal_contributors[x].n0; int n1 = horizontal_contributors[x].n1; int in_x = x - filter_pixel_margin; int in_pixel_index = in_x * channels; int max_n = n1; int coefficient_group = coefficient_width * x; for (k = n0; k <= max_n; k++) { int c; int out_pixel_index = k * channels; float coefficient = horizontal_coefficients[coefficient_group + k - n0]; STBIR_ASSERT(coefficient != 0); for (c = 0; c < channels; c++) output_buffer[out_pixel_index + c] += decode_buffer[in_pixel_index + c] * coefficient; } } break; } } static void stbir__decode_and_resample_upsample(stbir__info* stbir_info, int n) { // Decode the nth scanline from the source image into the decode buffer. stbir__decode_scanline(stbir_info, n); // Now resample it into the ring buffer. if (stbir__use_width_upsampling(stbir_info)) stbir__resample_horizontal_upsample(stbir_info, stbir__add_empty_ring_buffer_entry(stbir_info, n)); else stbir__resample_horizontal_downsample(stbir_info, stbir__add_empty_ring_buffer_entry(stbir_info, n)); // Now it's sitting in the ring buffer ready to be used as source for the vertical sampling. } static void stbir__decode_and_resample_downsample(stbir__info* stbir_info, int n) { // Decode the nth scanline from the source image into the decode buffer. stbir__decode_scanline(stbir_info, n); memset(stbir_info->horizontal_buffer, 0, stbir_info->output_w * stbir_info->channels * sizeof(float)); // Now resample it into the horizontal buffer. if (stbir__use_width_upsampling(stbir_info)) stbir__resample_horizontal_upsample(stbir_info, stbir_info->horizontal_buffer); else stbir__resample_horizontal_downsample(stbir_info, stbir_info->horizontal_buffer); // Now it's sitting in the horizontal buffer ready to be distributed into the ring buffers. } // Get the specified scan line from the ring buffer. static float* stbir__get_ring_buffer_scanline(int get_scanline, float* ring_buffer, int begin_index, int first_scanline, int ring_buffer_num_entries, int ring_buffer_length) { int ring_buffer_index = (begin_index + (get_scanline - first_scanline)) % ring_buffer_num_entries; return stbir__get_ring_buffer_entry(ring_buffer, ring_buffer_index, ring_buffer_length); } static void stbir__encode_scanline(stbir__info* stbir_info, int num_pixels, void *output_buffer, float *encode_buffer, int channels, int alpha_channel, int decode) { int x; int n; int num_nonalpha; stbir_uint16 nonalpha[STBIR_MAX_CHANNELS]; if (!(stbir_info->flags&STBIR_FLAG_ALPHA_PREMULTIPLIED)) { for (x=0; x < num_pixels; ++x) { int pixel_index = x*channels; float alpha = encode_buffer[pixel_index + alpha_channel]; float reciprocal_alpha = alpha ? 1.0f / alpha : 0; // unrolling this produced a 1% slowdown upscaling a large RGBA linear-space image on my machine - stb for (n = 0; n < channels; n++) if (n != alpha_channel) encode_buffer[pixel_index + n] *= reciprocal_alpha; // We added in a small epsilon to prevent the color channel from being deleted with zero alpha. // Because we only add it for integer types, it will automatically be discarded on integer // conversion, so we don't need to subtract it back out (which would be problematic for // numeric precision reasons). } } // build a table of all channels that need colorspace correction, so // we don't perform colorspace correction on channels that don't need it. for (x = 0, num_nonalpha = 0; x < channels; ++x) { if (x != alpha_channel || (stbir_info->flags & STBIR_FLAG_ALPHA_USES_COLORSPACE)) { nonalpha[num_nonalpha++] = (stbir_uint16)x; } } #define STBIR__ROUND_INT(f) ((int) ((f)+0.5)) #define STBIR__ROUND_UINT(f) ((stbir_uint32) ((f)+0.5)) #ifdef STBIR__SATURATE_INT #define STBIR__ENCODE_LINEAR8(f) stbir__saturate8 (STBIR__ROUND_INT((f) * stbir__max_uint8_as_float )) #define STBIR__ENCODE_LINEAR16(f) stbir__saturate16(STBIR__ROUND_INT((f) * stbir__max_uint16_as_float)) #else #define STBIR__ENCODE_LINEAR8(f) (unsigned char ) STBIR__ROUND_INT(stbir__saturate(f) * stbir__max_uint8_as_float ) #define STBIR__ENCODE_LINEAR16(f) (unsigned short) STBIR__ROUND_INT(stbir__saturate(f) * stbir__max_uint16_as_float) #endif switch (decode) { case STBIR__DECODE(STBIR_TYPE_UINT8, STBIR_COLORSPACE_LINEAR): for (x=0; x < num_pixels; ++x) { int pixel_index = x*channels; for (n = 0; n < channels; n++) { int index = pixel_index + n; ((unsigned char*)output_buffer)[index] = STBIR__ENCODE_LINEAR8(encode_buffer[index]); } } break; case STBIR__DECODE(STBIR_TYPE_UINT8, STBIR_COLORSPACE_SRGB): for (x=0; x < num_pixels; ++x) { int pixel_index = x*channels; for (n = 0; n < num_nonalpha; n++) { int index = pixel_index + nonalpha[n]; ((unsigned char*)output_buffer)[index] = stbir__linear_to_srgb_uchar(encode_buffer[index]); } if (!(stbir_info->flags & STBIR_FLAG_ALPHA_USES_COLORSPACE)) ((unsigned char *)output_buffer)[pixel_index + alpha_channel] = STBIR__ENCODE_LINEAR8(encode_buffer[pixel_index+alpha_channel]); } break; case STBIR__DECODE(STBIR_TYPE_UINT16, STBIR_COLORSPACE_LINEAR): for (x=0; x < num_pixels; ++x) { int pixel_index = x*channels; for (n = 0; n < channels; n++) { int index = pixel_index + n; ((unsigned short*)output_buffer)[index] = STBIR__ENCODE_LINEAR16(encode_buffer[index]); } } break; case STBIR__DECODE(STBIR_TYPE_UINT16, STBIR_COLORSPACE_SRGB): for (x=0; x < num_pixels; ++x) { int pixel_index = x*channels; for (n = 0; n < num_nonalpha; n++) { int index = pixel_index + nonalpha[n]; ((unsigned short*)output_buffer)[index] = (unsigned short)STBIR__ROUND_INT(stbir__linear_to_srgb(stbir__saturate(encode_buffer[index])) * stbir__max_uint16_as_float); } if (!(stbir_info->flags&STBIR_FLAG_ALPHA_USES_COLORSPACE)) ((unsigned short*)output_buffer)[pixel_index + alpha_channel] = STBIR__ENCODE_LINEAR16(encode_buffer[pixel_index + alpha_channel]); } break; case STBIR__DECODE(STBIR_TYPE_UINT32, STBIR_COLORSPACE_LINEAR): for (x=0; x < num_pixels; ++x) { int pixel_index = x*channels; for (n = 0; n < channels; n++) { int index = pixel_index + n; ((unsigned int*)output_buffer)[index] = (unsigned int)STBIR__ROUND_UINT(((double)stbir__saturate(encode_buffer[index])) * stbir__max_uint32_as_float); } } break; case STBIR__DECODE(STBIR_TYPE_UINT32, STBIR_COLORSPACE_SRGB): for (x=0; x < num_pixels; ++x) { int pixel_index = x*channels; for (n = 0; n < num_nonalpha; n++) { int index = pixel_index + nonalpha[n]; ((unsigned int*)output_buffer)[index] = (unsigned int)STBIR__ROUND_UINT(((double)stbir__linear_to_srgb(stbir__saturate(encode_buffer[index]))) * stbir__max_uint32_as_float); } if (!(stbir_info->flags&STBIR_FLAG_ALPHA_USES_COLORSPACE)) ((unsigned int*)output_buffer)[pixel_index + alpha_channel] = (unsigned int)STBIR__ROUND_INT(((double)stbir__saturate(encode_buffer[pixel_index + alpha_channel])) * stbir__max_uint32_as_float); } break; case STBIR__DECODE(STBIR_TYPE_FLOAT, STBIR_COLORSPACE_LINEAR): for (x=0; x < num_pixels; ++x) { int pixel_index = x*channels; for (n = 0; n < channels; n++) { int index = pixel_index + n; ((float*)output_buffer)[index] = encode_buffer[index]; } } break; case STBIR__DECODE(STBIR_TYPE_FLOAT, STBIR_COLORSPACE_SRGB): for (x=0; x < num_pixels; ++x) { int pixel_index = x*channels; for (n = 0; n < num_nonalpha; n++) { int index = pixel_index + nonalpha[n]; ((float*)output_buffer)[index] = stbir__linear_to_srgb(encode_buffer[index]); } if (!(stbir_info->flags&STBIR_FLAG_ALPHA_USES_COLORSPACE)) ((float*)output_buffer)[pixel_index + alpha_channel] = encode_buffer[pixel_index + alpha_channel]; } break; default: STBIR_ASSERT(!"Unknown type/colorspace/channels combination."); break; } } static void stbir__resample_vertical_upsample(stbir__info* stbir_info, int n) { int x, k; int output_w = stbir_info->output_w; stbir__contributors* vertical_contributors = stbir_info->vertical_contributors; float* vertical_coefficients = stbir_info->vertical_coefficients; int channels = stbir_info->channels; int alpha_channel = stbir_info->alpha_channel; int type = stbir_info->type; int colorspace = stbir_info->colorspace; int ring_buffer_entries = stbir_info->ring_buffer_num_entries; void* output_data = stbir_info->output_data; float* encode_buffer = stbir_info->encode_buffer; int decode = STBIR__DECODE(type, colorspace); int coefficient_width = stbir_info->vertical_coefficient_width; int coefficient_counter; int contributor = n; float* ring_buffer = stbir_info->ring_buffer; int ring_buffer_begin_index = stbir_info->ring_buffer_begin_index; int ring_buffer_first_scanline = stbir_info->ring_buffer_first_scanline; int ring_buffer_length = stbir_info->ring_buffer_length_bytes/sizeof(float); int n0,n1, output_row_start; int coefficient_group = coefficient_width * contributor; n0 = vertical_contributors[contributor].n0; n1 = vertical_contributors[contributor].n1; output_row_start = n * stbir_info->output_stride_bytes; STBIR_ASSERT(stbir__use_height_upsampling(stbir_info)); memset(encode_buffer, 0, output_w * sizeof(float) * channels); // I tried reblocking this for better cache usage of encode_buffer // (using x_outer, k, x_inner), but it lost speed. -- stb coefficient_counter = 0; switch (channels) { case 1: for (k = n0; k <= n1; k++) { int coefficient_index = coefficient_counter++; float* ring_buffer_entry = stbir__get_ring_buffer_scanline(k, ring_buffer, ring_buffer_begin_index, ring_buffer_first_scanline, ring_buffer_entries, ring_buffer_length); float coefficient = vertical_coefficients[coefficient_group + coefficient_index]; for (x = 0; x < output_w; ++x) { int in_pixel_index = x * 1; encode_buffer[in_pixel_index + 0] += ring_buffer_entry[in_pixel_index + 0] * coefficient; } } break; case 2: for (k = n0; k <= n1; k++) { int coefficient_index = coefficient_counter++; float* ring_buffer_entry = stbir__get_ring_buffer_scanline(k, ring_buffer, ring_buffer_begin_index, ring_buffer_first_scanline, ring_buffer_entries, ring_buffer_length); float coefficient = vertical_coefficients[coefficient_group + coefficient_index]; for (x = 0; x < output_w; ++x) { int in_pixel_index = x * 2; encode_buffer[in_pixel_index + 0] += ring_buffer_entry[in_pixel_index + 0] * coefficient; encode_buffer[in_pixel_index + 1] += ring_buffer_entry[in_pixel_index + 1] * coefficient; } } break; case 3: for (k = n0; k <= n1; k++) { int coefficient_index = coefficient_counter++; float* ring_buffer_entry = stbir__get_ring_buffer_scanline(k, ring_buffer, ring_buffer_begin_index, ring_buffer_first_scanline, ring_buffer_entries, ring_buffer_length); float coefficient = vertical_coefficients[coefficient_group + coefficient_index]; for (x = 0; x < output_w; ++x) { int in_pixel_index = x * 3; encode_buffer[in_pixel_index + 0] += ring_buffer_entry[in_pixel_index + 0] * coefficient; encode_buffer[in_pixel_index + 1] += ring_buffer_entry[in_pixel_index + 1] * coefficient; encode_buffer[in_pixel_index + 2] += ring_buffer_entry[in_pixel_index + 2] * coefficient; } } break; case 4: for (k = n0; k <= n1; k++) { int coefficient_index = coefficient_counter++; float* ring_buffer_entry = stbir__get_ring_buffer_scanline(k, ring_buffer, ring_buffer_begin_index, ring_buffer_first_scanline, ring_buffer_entries, ring_buffer_length); float coefficient = vertical_coefficients[coefficient_group + coefficient_index]; for (x = 0; x < output_w; ++x) { int in_pixel_index = x * 4; encode_buffer[in_pixel_index + 0] += ring_buffer_entry[in_pixel_index + 0] * coefficient; encode_buffer[in_pixel_index + 1] += ring_buffer_entry[in_pixel_index + 1] * coefficient; encode_buffer[in_pixel_index + 2] += ring_buffer_entry[in_pixel_index + 2] * coefficient; encode_buffer[in_pixel_index + 3] += ring_buffer_entry[in_pixel_index + 3] * coefficient; } } break; default: for (k = n0; k <= n1; k++) { int coefficient_index = coefficient_counter++; float* ring_buffer_entry = stbir__get_ring_buffer_scanline(k, ring_buffer, ring_buffer_begin_index, ring_buffer_first_scanline, ring_buffer_entries, ring_buffer_length); float coefficient = vertical_coefficients[coefficient_group + coefficient_index]; for (x = 0; x < output_w; ++x) { int in_pixel_index = x * channels; int c; for (c = 0; c < channels; c++) encode_buffer[in_pixel_index + c] += ring_buffer_entry[in_pixel_index + c] * coefficient; } } break; } stbir__encode_scanline(stbir_info, output_w, (char *) output_data + output_row_start, encode_buffer, channels, alpha_channel, decode); } static void stbir__resample_vertical_downsample(stbir__info* stbir_info, int n) { int x, k; int output_w = stbir_info->output_w; stbir__contributors* vertical_contributors = stbir_info->vertical_contributors; float* vertical_coefficients = stbir_info->vertical_coefficients; int channels = stbir_info->channels; int ring_buffer_entries = stbir_info->ring_buffer_num_entries; float* horizontal_buffer = stbir_info->horizontal_buffer; int coefficient_width = stbir_info->vertical_coefficient_width; int contributor = n + stbir_info->vertical_filter_pixel_margin; float* ring_buffer = stbir_info->ring_buffer; int ring_buffer_begin_index = stbir_info->ring_buffer_begin_index; int ring_buffer_first_scanline = stbir_info->ring_buffer_first_scanline; int ring_buffer_length = stbir_info->ring_buffer_length_bytes/sizeof(float); int n0,n1; n0 = vertical_contributors[contributor].n0; n1 = vertical_contributors[contributor].n1; STBIR_ASSERT(!stbir__use_height_upsampling(stbir_info)); for (k = n0; k <= n1; k++) { int coefficient_index = k - n0; int coefficient_group = coefficient_width * contributor; float coefficient = vertical_coefficients[coefficient_group + coefficient_index]; float* ring_buffer_entry = stbir__get_ring_buffer_scanline(k, ring_buffer, ring_buffer_begin_index, ring_buffer_first_scanline, ring_buffer_entries, ring_buffer_length); switch (channels) { case 1: for (x = 0; x < output_w; x++) { int in_pixel_index = x * 1; ring_buffer_entry[in_pixel_index + 0] += horizontal_buffer[in_pixel_index + 0] * coefficient; } break; case 2: for (x = 0; x < output_w; x++) { int in_pixel_index = x * 2; ring_buffer_entry[in_pixel_index + 0] += horizontal_buffer[in_pixel_index + 0] * coefficient; ring_buffer_entry[in_pixel_index + 1] += horizontal_buffer[in_pixel_index + 1] * coefficient; } break; case 3: for (x = 0; x < output_w; x++) { int in_pixel_index = x * 3; ring_buffer_entry[in_pixel_index + 0] += horizontal_buffer[in_pixel_index + 0] * coefficient; ring_buffer_entry[in_pixel_index + 1] += horizontal_buffer[in_pixel_index + 1] * coefficient; ring_buffer_entry[in_pixel_index + 2] += horizontal_buffer[in_pixel_index + 2] * coefficient; } break; case 4: for (x = 0; x < output_w; x++) { int in_pixel_index = x * 4; ring_buffer_entry[in_pixel_index + 0] += horizontal_buffer[in_pixel_index + 0] * coefficient; ring_buffer_entry[in_pixel_index + 1] += horizontal_buffer[in_pixel_index + 1] * coefficient; ring_buffer_entry[in_pixel_index + 2] += horizontal_buffer[in_pixel_index + 2] * coefficient; ring_buffer_entry[in_pixel_index + 3] += horizontal_buffer[in_pixel_index + 3] * coefficient; } break; default: for (x = 0; x < output_w; x++) { int in_pixel_index = x * channels; int c; for (c = 0; c < channels; c++) ring_buffer_entry[in_pixel_index + c] += horizontal_buffer[in_pixel_index + c] * coefficient; } break; } } } static void stbir__buffer_loop_upsample(stbir__info* stbir_info) { int y; float scale_ratio = stbir_info->vertical_scale; float out_scanlines_radius = stbir__filter_info_table[stbir_info->vertical_filter].support(1/scale_ratio) * scale_ratio; STBIR_ASSERT(stbir__use_height_upsampling(stbir_info)); for (y = 0; y < stbir_info->output_h; y++) { float in_center_of_out = 0; // Center of the current out scanline in the in scanline space int in_first_scanline = 0, in_last_scanline = 0; stbir__calculate_sample_range_upsample(y, out_scanlines_radius, scale_ratio, stbir_info->vertical_shift, &in_first_scanline, &in_last_scanline, &in_center_of_out); STBIR_ASSERT(in_last_scanline - in_first_scanline + 1 <= stbir_info->ring_buffer_num_entries); if (stbir_info->ring_buffer_begin_index >= 0) { // Get rid of whatever we don't need anymore. while (in_first_scanline > stbir_info->ring_buffer_first_scanline) { if (stbir_info->ring_buffer_first_scanline == stbir_info->ring_buffer_last_scanline) { // We just popped the last scanline off the ring buffer. // Reset it to the empty state. stbir_info->ring_buffer_begin_index = -1; stbir_info->ring_buffer_first_scanline = 0; stbir_info->ring_buffer_last_scanline = 0; break; } else { stbir_info->ring_buffer_first_scanline++; stbir_info->ring_buffer_begin_index = (stbir_info->ring_buffer_begin_index + 1) % stbir_info->ring_buffer_num_entries; } } } // Load in new ones. if (stbir_info->ring_buffer_begin_index < 0) stbir__decode_and_resample_upsample(stbir_info, in_first_scanline); while (in_last_scanline > stbir_info->ring_buffer_last_scanline) stbir__decode_and_resample_upsample(stbir_info, stbir_info->ring_buffer_last_scanline + 1); // Now all buffers should be ready to write a row of vertical sampling. stbir__resample_vertical_upsample(stbir_info, y); STBIR_PROGRESS_REPORT((float)y / stbir_info->output_h); } } static void stbir__empty_ring_buffer(stbir__info* stbir_info, int first_necessary_scanline) { int output_stride_bytes = stbir_info->output_stride_bytes; int channels = stbir_info->channels; int alpha_channel = stbir_info->alpha_channel; int type = stbir_info->type; int colorspace = stbir_info->colorspace; int output_w = stbir_info->output_w; void* output_data = stbir_info->output_data; int decode = STBIR__DECODE(type, colorspace); float* ring_buffer = stbir_info->ring_buffer; int ring_buffer_length = stbir_info->ring_buffer_length_bytes/sizeof(float); if (stbir_info->ring_buffer_begin_index >= 0) { // Get rid of whatever we don't need anymore. while (first_necessary_scanline > stbir_info->ring_buffer_first_scanline) { if (stbir_info->ring_buffer_first_scanline >= 0 && stbir_info->ring_buffer_first_scanline < stbir_info->output_h) { int output_row_start = stbir_info->ring_buffer_first_scanline * output_stride_bytes; float* ring_buffer_entry = stbir__get_ring_buffer_entry(ring_buffer, stbir_info->ring_buffer_begin_index, ring_buffer_length); stbir__encode_scanline(stbir_info, output_w, (char *) output_data + output_row_start, ring_buffer_entry, channels, alpha_channel, decode); STBIR_PROGRESS_REPORT((float)stbir_info->ring_buffer_first_scanline / stbir_info->output_h); } if (stbir_info->ring_buffer_first_scanline == stbir_info->ring_buffer_last_scanline) { // We just popped the last scanline off the ring buffer. // Reset it to the empty state. stbir_info->ring_buffer_begin_index = -1; stbir_info->ring_buffer_first_scanline = 0; stbir_info->ring_buffer_last_scanline = 0; break; } else { stbir_info->ring_buffer_first_scanline++; stbir_info->ring_buffer_begin_index = (stbir_info->ring_buffer_begin_index + 1) % stbir_info->ring_buffer_num_entries; } } } } static void stbir__buffer_loop_downsample(stbir__info* stbir_info) { int y; float scale_ratio = stbir_info->vertical_scale; int output_h = stbir_info->output_h; float in_pixels_radius = stbir__filter_info_table[stbir_info->vertical_filter].support(scale_ratio) / scale_ratio; int pixel_margin = stbir_info->vertical_filter_pixel_margin; int max_y = stbir_info->input_h + pixel_margin; STBIR_ASSERT(!stbir__use_height_upsampling(stbir_info)); for (y = -pixel_margin; y < max_y; y++) { float out_center_of_in; // Center of the current out scanline in the in scanline space int out_first_scanline, out_last_scanline; stbir__calculate_sample_range_downsample(y, in_pixels_radius, scale_ratio, stbir_info->vertical_shift, &out_first_scanline, &out_last_scanline, &out_center_of_in); STBIR_ASSERT(out_last_scanline - out_first_scanline + 1 <= stbir_info->ring_buffer_num_entries); if (out_last_scanline < 0 || out_first_scanline >= output_h) continue; stbir__empty_ring_buffer(stbir_info, out_first_scanline); stbir__decode_and_resample_downsample(stbir_info, y); // Load in new ones. if (stbir_info->ring_buffer_begin_index < 0) stbir__add_empty_ring_buffer_entry(stbir_info, out_first_scanline); while (out_last_scanline > stbir_info->ring_buffer_last_scanline) stbir__add_empty_ring_buffer_entry(stbir_info, stbir_info->ring_buffer_last_scanline + 1); // Now the horizontal buffer is ready to write to all ring buffer rows. stbir__resample_vertical_downsample(stbir_info, y); } stbir__empty_ring_buffer(stbir_info, stbir_info->output_h); } static void stbir__setup(stbir__info *info, int input_w, int input_h, int output_w, int output_h, int channels) { info->input_w = input_w; info->input_h = input_h; info->output_w = output_w; info->output_h = output_h; info->channels = channels; } static void stbir__calculate_transform(stbir__info *info, float s0, float t0, float s1, float t1, float *transform) { info->s0 = s0; info->t0 = t0; info->s1 = s1; info->t1 = t1; if (transform) { info->horizontal_scale = transform[0]; info->vertical_scale = transform[1]; info->horizontal_shift = transform[2]; info->vertical_shift = transform[3]; } else { info->horizontal_scale = ((float)info->output_w / info->input_w) / (s1 - s0); info->vertical_scale = ((float)info->output_h / info->input_h) / (t1 - t0); info->horizontal_shift = s0 * info->output_w / (s1 - s0); info->vertical_shift = t0 * info->output_h / (t1 - t0); } } static void stbir__choose_filter(stbir__info *info, stbir_filter h_filter, stbir_filter v_filter) { if (h_filter == 0) h_filter = stbir__use_upsampling(info->horizontal_scale) ? STBIR_DEFAULT_FILTER_UPSAMPLE : STBIR_DEFAULT_FILTER_DOWNSAMPLE; if (v_filter == 0) v_filter = stbir__use_upsampling(info->vertical_scale) ? STBIR_DEFAULT_FILTER_UPSAMPLE : STBIR_DEFAULT_FILTER_DOWNSAMPLE; info->horizontal_filter = h_filter; info->vertical_filter = v_filter; } static stbir_uint32 stbir__calculate_memory(stbir__info *info) { int pixel_margin = stbir__get_filter_pixel_margin(info->horizontal_filter, info->horizontal_scale); int filter_height = stbir__get_filter_pixel_width(info->vertical_filter, info->vertical_scale); info->horizontal_num_contributors = stbir__get_contributors(info->horizontal_scale, info->horizontal_filter, info->input_w, info->output_w); info->vertical_num_contributors = stbir__get_contributors(info->vertical_scale , info->vertical_filter , info->input_h, info->output_h); // One extra entry because floating point precision problems sometimes cause an extra to be necessary. info->ring_buffer_num_entries = filter_height + 1; info->horizontal_contributors_size = info->horizontal_num_contributors * sizeof(stbir__contributors); info->horizontal_coefficients_size = stbir__get_total_horizontal_coefficients(info) * sizeof(float); info->vertical_contributors_size = info->vertical_num_contributors * sizeof(stbir__contributors); info->vertical_coefficients_size = stbir__get_total_vertical_coefficients(info) * sizeof(float); info->decode_buffer_size = (info->input_w + pixel_margin * 2) * info->channels * sizeof(float); info->horizontal_buffer_size = info->output_w * info->channels * sizeof(float); info->ring_buffer_size = info->output_w * info->channels * info->ring_buffer_num_entries * sizeof(float); info->encode_buffer_size = info->output_w * info->channels * sizeof(float); STBIR_ASSERT(info->horizontal_filter != 0); STBIR_ASSERT(info->horizontal_filter < STBIR__ARRAY_SIZE(stbir__filter_info_table)); // this now happens too late STBIR_ASSERT(info->vertical_filter != 0); STBIR_ASSERT(info->vertical_filter < STBIR__ARRAY_SIZE(stbir__filter_info_table)); // this now happens too late if (stbir__use_height_upsampling(info)) // The horizontal buffer is for when we're downsampling the height and we // can't output the result of sampling the decode buffer directly into the // ring buffers. info->horizontal_buffer_size = 0; else // The encode buffer is to retain precision in the height upsampling method // and isn't used when height downsampling. info->encode_buffer_size = 0; return info->horizontal_contributors_size + info->horizontal_coefficients_size + info->vertical_contributors_size + info->vertical_coefficients_size + info->decode_buffer_size + info->horizontal_buffer_size + info->ring_buffer_size + info->encode_buffer_size; } static int stbir__resize_allocated(stbir__info *info, const void* input_data, int input_stride_in_bytes, void* output_data, int output_stride_in_bytes, int alpha_channel, stbir_uint32 flags, stbir_datatype type, stbir_edge edge_horizontal, stbir_edge edge_vertical, stbir_colorspace colorspace, void* tempmem, size_t tempmem_size_in_bytes) { size_t memory_required = stbir__calculate_memory(info); int width_stride_input = input_stride_in_bytes ? input_stride_in_bytes : info->channels * info->input_w * stbir__type_size[type]; int width_stride_output = output_stride_in_bytes ? output_stride_in_bytes : info->channels * info->output_w * stbir__type_size[type]; #ifdef STBIR_DEBUG_OVERWRITE_TEST #define OVERWRITE_ARRAY_SIZE 8 unsigned char overwrite_output_before_pre[OVERWRITE_ARRAY_SIZE]; unsigned char overwrite_tempmem_before_pre[OVERWRITE_ARRAY_SIZE]; unsigned char overwrite_output_after_pre[OVERWRITE_ARRAY_SIZE]; unsigned char overwrite_tempmem_after_pre[OVERWRITE_ARRAY_SIZE]; size_t begin_forbidden = width_stride_output * (info->output_h - 1) + info->output_w * info->channels * stbir__type_size[type]; memcpy(overwrite_output_before_pre, &((unsigned char*)output_data)[-OVERWRITE_ARRAY_SIZE], OVERWRITE_ARRAY_SIZE); memcpy(overwrite_output_after_pre, &((unsigned char*)output_data)[begin_forbidden], OVERWRITE_ARRAY_SIZE); memcpy(overwrite_tempmem_before_pre, &((unsigned char*)tempmem)[-OVERWRITE_ARRAY_SIZE], OVERWRITE_ARRAY_SIZE); memcpy(overwrite_tempmem_after_pre, &((unsigned char*)tempmem)[tempmem_size_in_bytes], OVERWRITE_ARRAY_SIZE); #endif STBIR_ASSERT(info->channels >= 0); STBIR_ASSERT(info->channels <= STBIR_MAX_CHANNELS); if (info->channels < 0 || info->channels > STBIR_MAX_CHANNELS) return 0; STBIR_ASSERT(info->horizontal_filter < STBIR__ARRAY_SIZE(stbir__filter_info_table)); STBIR_ASSERT(info->vertical_filter < STBIR__ARRAY_SIZE(stbir__filter_info_table)); if (info->horizontal_filter >= STBIR__ARRAY_SIZE(stbir__filter_info_table)) return 0; if (info->vertical_filter >= STBIR__ARRAY_SIZE(stbir__filter_info_table)) return 0; if (alpha_channel < 0) flags |= STBIR_FLAG_ALPHA_USES_COLORSPACE | STBIR_FLAG_ALPHA_PREMULTIPLIED; if (!(flags&STBIR_FLAG_ALPHA_USES_COLORSPACE) || !(flags&STBIR_FLAG_ALPHA_PREMULTIPLIED)) STBIR_ASSERT(alpha_channel >= 0 && alpha_channel < info->channels); if (alpha_channel >= info->channels) return 0; STBIR_ASSERT(tempmem); if (!tempmem) return 0; STBIR_ASSERT(tempmem_size_in_bytes >= memory_required); if (tempmem_size_in_bytes < memory_required) return 0; memset(tempmem, 0, tempmem_size_in_bytes); info->input_data = input_data; info->input_stride_bytes = width_stride_input; info->output_data = output_data; info->output_stride_bytes = width_stride_output; info->alpha_channel = alpha_channel; info->flags = flags; info->type = type; info->edge_horizontal = edge_horizontal; info->edge_vertical = edge_vertical; info->colorspace = colorspace; info->horizontal_coefficient_width = stbir__get_coefficient_width (info->horizontal_filter, info->horizontal_scale); info->vertical_coefficient_width = stbir__get_coefficient_width (info->vertical_filter , info->vertical_scale ); info->horizontal_filter_pixel_width = stbir__get_filter_pixel_width (info->horizontal_filter, info->horizontal_scale); info->vertical_filter_pixel_width = stbir__get_filter_pixel_width (info->vertical_filter , info->vertical_scale ); info->horizontal_filter_pixel_margin = stbir__get_filter_pixel_margin(info->horizontal_filter, info->horizontal_scale); info->vertical_filter_pixel_margin = stbir__get_filter_pixel_margin(info->vertical_filter , info->vertical_scale ); info->ring_buffer_length_bytes = info->output_w * info->channels * sizeof(float); info->decode_buffer_pixels = info->input_w + info->horizontal_filter_pixel_margin * 2; #define STBIR__NEXT_MEMPTR(current, newtype) (newtype*)(((unsigned char*)current) + current##_size) info->horizontal_contributors = (stbir__contributors *) tempmem; info->horizontal_coefficients = STBIR__NEXT_MEMPTR(info->horizontal_contributors, float); info->vertical_contributors = STBIR__NEXT_MEMPTR(info->horizontal_coefficients, stbir__contributors); info->vertical_coefficients = STBIR__NEXT_MEMPTR(info->vertical_contributors, float); info->decode_buffer = STBIR__NEXT_MEMPTR(info->vertical_coefficients, float); if (stbir__use_height_upsampling(info)) { info->horizontal_buffer = NULL; info->ring_buffer = STBIR__NEXT_MEMPTR(info->decode_buffer, float); info->encode_buffer = STBIR__NEXT_MEMPTR(info->ring_buffer, float); STBIR_ASSERT((size_t)STBIR__NEXT_MEMPTR(info->encode_buffer, unsigned char) == (size_t)tempmem + tempmem_size_in_bytes); } else { info->horizontal_buffer = STBIR__NEXT_MEMPTR(info->decode_buffer, float); info->ring_buffer = STBIR__NEXT_MEMPTR(info->horizontal_buffer, float); info->encode_buffer = NULL; STBIR_ASSERT((size_t)STBIR__NEXT_MEMPTR(info->ring_buffer, unsigned char) == (size_t)tempmem + tempmem_size_in_bytes); } #undef STBIR__NEXT_MEMPTR // This signals that the ring buffer is empty info->ring_buffer_begin_index = -1; stbir__calculate_filters(info->horizontal_contributors, info->horizontal_coefficients, info->horizontal_filter, info->horizontal_scale, info->horizontal_shift, info->input_w, info->output_w); stbir__calculate_filters(info->vertical_contributors, info->vertical_coefficients, info->vertical_filter, info->vertical_scale, info->vertical_shift, info->input_h, info->output_h); STBIR_PROGRESS_REPORT(0); if (stbir__use_height_upsampling(info)) stbir__buffer_loop_upsample(info); else stbir__buffer_loop_downsample(info); STBIR_PROGRESS_REPORT(1); #ifdef STBIR_DEBUG_OVERWRITE_TEST STBIR_ASSERT(memcmp(overwrite_output_before_pre, &((unsigned char*)output_data)[-OVERWRITE_ARRAY_SIZE], OVERWRITE_ARRAY_SIZE) == 0); STBIR_ASSERT(memcmp(overwrite_output_after_pre, &((unsigned char*)output_data)[begin_forbidden], OVERWRITE_ARRAY_SIZE) == 0); STBIR_ASSERT(memcmp(overwrite_tempmem_before_pre, &((unsigned char*)tempmem)[-OVERWRITE_ARRAY_SIZE], OVERWRITE_ARRAY_SIZE) == 0); STBIR_ASSERT(memcmp(overwrite_tempmem_after_pre, &((unsigned char*)tempmem)[tempmem_size_in_bytes], OVERWRITE_ARRAY_SIZE) == 0); #endif return 1; } static int stbir__resize_arbitrary( void *alloc_context, const void* input_data, int input_w, int input_h, int input_stride_in_bytes, void* output_data, int output_w, int output_h, int output_stride_in_bytes, float s0, float t0, float s1, float t1, float *transform, int channels, int alpha_channel, stbir_uint32 flags, stbir_datatype type, stbir_filter h_filter, stbir_filter v_filter, stbir_edge edge_horizontal, stbir_edge edge_vertical, stbir_colorspace colorspace) { stbir__info info; int result; size_t memory_required; void* extra_memory; stbir__setup(&info, input_w, input_h, output_w, output_h, channels); stbir__calculate_transform(&info, s0,t0,s1,t1,transform); stbir__choose_filter(&info, h_filter, v_filter); memory_required = stbir__calculate_memory(&info); extra_memory = STBIR_MALLOC(memory_required, alloc_context); if (!extra_memory) return 0; result = stbir__resize_allocated(&info, input_data, input_stride_in_bytes, output_data, output_stride_in_bytes, alpha_channel, flags, type, edge_horizontal, edge_vertical, colorspace, extra_memory, memory_required); STBIR_FREE(extra_memory, alloc_context); return result; } STBIRDEF int stbir_resize_uint8( const unsigned char *input_pixels , int input_w , int input_h , int input_stride_in_bytes, unsigned char *output_pixels, int output_w, int output_h, int output_stride_in_bytes, int num_channels) { return stbir__resize_arbitrary(NULL, input_pixels, input_w, input_h, input_stride_in_bytes, output_pixels, output_w, output_h, output_stride_in_bytes, 0,0,1,1,NULL,num_channels,-1,0, STBIR_TYPE_UINT8, STBIR_FILTER_DEFAULT, STBIR_FILTER_DEFAULT, STBIR_EDGE_CLAMP, STBIR_EDGE_CLAMP, STBIR_COLORSPACE_LINEAR); } STBIRDEF int stbir_resize_float( const float *input_pixels , int input_w , int input_h , int input_stride_in_bytes, float *output_pixels, int output_w, int output_h, int output_stride_in_bytes, int num_channels) { return stbir__resize_arbitrary(NULL, input_pixels, input_w, input_h, input_stride_in_bytes, output_pixels, output_w, output_h, output_stride_in_bytes, 0,0,1,1,NULL,num_channels,-1,0, STBIR_TYPE_FLOAT, STBIR_FILTER_DEFAULT, STBIR_FILTER_DEFAULT, STBIR_EDGE_CLAMP, STBIR_EDGE_CLAMP, STBIR_COLORSPACE_LINEAR); } STBIRDEF int stbir_resize_uint8_srgb(const unsigned char *input_pixels , int input_w , int input_h , int input_stride_in_bytes, unsigned char *output_pixels, int output_w, int output_h, int output_stride_in_bytes, int num_channels, int alpha_channel, int flags) { return stbir__resize_arbitrary(NULL, input_pixels, input_w, input_h, input_stride_in_bytes, output_pixels, output_w, output_h, output_stride_in_bytes, 0,0,1,1,NULL,num_channels,alpha_channel,flags, STBIR_TYPE_UINT8, STBIR_FILTER_DEFAULT, STBIR_FILTER_DEFAULT, STBIR_EDGE_CLAMP, STBIR_EDGE_CLAMP, STBIR_COLORSPACE_SRGB); } STBIRDEF int stbir_resize_uint8_srgb_edgemode(const unsigned char *input_pixels , int input_w , int input_h , int input_stride_in_bytes, unsigned char *output_pixels, int output_w, int output_h, int output_stride_in_bytes, int num_channels, int alpha_channel, int flags, stbir_edge edge_wrap_mode) { return stbir__resize_arbitrary(NULL, input_pixels, input_w, input_h, input_stride_in_bytes, output_pixels, output_w, output_h, output_stride_in_bytes, 0,0,1,1,NULL,num_channels,alpha_channel,flags, STBIR_TYPE_UINT8, STBIR_FILTER_DEFAULT, STBIR_FILTER_DEFAULT, edge_wrap_mode, edge_wrap_mode, STBIR_COLORSPACE_SRGB); } STBIRDEF int stbir_resize_uint8_generic( const unsigned char *input_pixels , int input_w , int input_h , int input_stride_in_bytes, unsigned char *output_pixels, int output_w, int output_h, int output_stride_in_bytes, int num_channels, int alpha_channel, int flags, stbir_edge edge_wrap_mode, stbir_filter filter, stbir_colorspace space, void *alloc_context) { return stbir__resize_arbitrary(alloc_context, input_pixels, input_w, input_h, input_stride_in_bytes, output_pixels, output_w, output_h, output_stride_in_bytes, 0,0,1,1,NULL,num_channels,alpha_channel,flags, STBIR_TYPE_UINT8, filter, filter, edge_wrap_mode, edge_wrap_mode, space); } STBIRDEF int stbir_resize_uint16_generic(const stbir_uint16 *input_pixels , int input_w , int input_h , int input_stride_in_bytes, stbir_uint16 *output_pixels , int output_w, int output_h, int output_stride_in_bytes, int num_channels, int alpha_channel, int flags, stbir_edge edge_wrap_mode, stbir_filter filter, stbir_colorspace space, void *alloc_context) { return stbir__resize_arbitrary(alloc_context, input_pixels, input_w, input_h, input_stride_in_bytes, output_pixels, output_w, output_h, output_stride_in_bytes, 0,0,1,1,NULL,num_channels,alpha_channel,flags, STBIR_TYPE_UINT16, filter, filter, edge_wrap_mode, edge_wrap_mode, space); } STBIRDEF int stbir_resize_float_generic( const float *input_pixels , int input_w , int input_h , int input_stride_in_bytes, float *output_pixels , int output_w, int output_h, int output_stride_in_bytes, int num_channels, int alpha_channel, int flags, stbir_edge edge_wrap_mode, stbir_filter filter, stbir_colorspace space, void *alloc_context) { return stbir__resize_arbitrary(alloc_context, input_pixels, input_w, input_h, input_stride_in_bytes, output_pixels, output_w, output_h, output_stride_in_bytes, 0,0,1,1,NULL,num_channels,alpha_channel,flags, STBIR_TYPE_FLOAT, filter, filter, edge_wrap_mode, edge_wrap_mode, space); } STBIRDEF int stbir_resize( const void *input_pixels , int input_w , int input_h , int input_stride_in_bytes, void *output_pixels, int output_w, int output_h, int output_stride_in_bytes, stbir_datatype datatype, int num_channels, int alpha_channel, int flags, stbir_edge edge_mode_horizontal, stbir_edge edge_mode_vertical, stbir_filter filter_horizontal, stbir_filter filter_vertical, stbir_colorspace space, void *alloc_context) { return stbir__resize_arbitrary(alloc_context, input_pixels, input_w, input_h, input_stride_in_bytes, output_pixels, output_w, output_h, output_stride_in_bytes, 0,0,1,1,NULL,num_channels,alpha_channel,flags, datatype, filter_horizontal, filter_vertical, edge_mode_horizontal, edge_mode_vertical, space); } STBIRDEF int stbir_resize_subpixel(const void *input_pixels , int input_w , int input_h , int input_stride_in_bytes, void *output_pixels, int output_w, int output_h, int output_stride_in_bytes, stbir_datatype datatype, int num_channels, int alpha_channel, int flags, stbir_edge edge_mode_horizontal, stbir_edge edge_mode_vertical, stbir_filter filter_horizontal, stbir_filter filter_vertical, stbir_colorspace space, void *alloc_context, float x_scale, float y_scale, float x_offset, float y_offset) { float transform[4]; transform[0] = x_scale; transform[1] = y_scale; transform[2] = x_offset; transform[3] = y_offset; return stbir__resize_arbitrary(alloc_context, input_pixels, input_w, input_h, input_stride_in_bytes, output_pixels, output_w, output_h, output_stride_in_bytes, 0,0,1,1,transform,num_channels,alpha_channel,flags, datatype, filter_horizontal, filter_vertical, edge_mode_horizontal, edge_mode_vertical, space); } STBIRDEF int stbir_resize_region( const void *input_pixels , int input_w , int input_h , int input_stride_in_bytes, void *output_pixels, int output_w, int output_h, int output_stride_in_bytes, stbir_datatype datatype, int num_channels, int alpha_channel, int flags, stbir_edge edge_mode_horizontal, stbir_edge edge_mode_vertical, stbir_filter filter_horizontal, stbir_filter filter_vertical, stbir_colorspace space, void *alloc_context, float s0, float t0, float s1, float t1) { return stbir__resize_arbitrary(alloc_context, input_pixels, input_w, input_h, input_stride_in_bytes, output_pixels, output_w, output_h, output_stride_in_bytes, s0,t0,s1,t1,NULL,num_channels,alpha_channel,flags, datatype, filter_horizontal, filter_vertical, edge_mode_horizontal, edge_mode_vertical, space); } #endif // STB_IMAGE_RESIZE_IMPLEMENTATION /* ------------------------------------------------------------------------------ This software is available under 2 licenses -- choose whichever you prefer. ------------------------------------------------------------------------------ ALTERNATIVE A - MIT License Copyright (c) 2017 Sean Barrett 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. ------------------------------------------------------------------------------ ALTERNATIVE B - Public Domain (www.unlicense.org) This is free and unencumbered software released into the public domain. Anyone is free to copy, modify, publish, use, compile, sell, or distribute this software, either in source code form or as a compiled binary, for any purpose, commercial or non-commercial, and by any means. In jurisdictions that recognize copyright laws, the author or authors of this software dedicate any and all copyright interest in the software to the public domain. We make this dedication for the benefit of the public at large and to the detriment of our heirs and successors. We intend this dedication to be an overt act of relinquishment in perpetuity of all present and future rights to this software under copyright law. 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 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. ------------------------------------------------------------------------------ */ uTox/third_party/stb/stb/stb_image.h0000600000175000001440000075175514003056224016535 0ustar rakusers/* stb_image - v2.16 - public domain image loader - http://nothings.org/stb_image.h no warranty implied; use at your own risk Do this: #define STB_IMAGE_IMPLEMENTATION before you include this file in *one* C or C++ file to create the implementation. // i.e. it should look like this: #include ... #include ... #include ... #define STB_IMAGE_IMPLEMENTATION #include "stb_image.h" You can #define STBI_ASSERT(x) before the #include to avoid using assert.h. And #define STBI_MALLOC, STBI_REALLOC, and STBI_FREE to avoid using malloc,realloc,free QUICK NOTES: Primarily of interest to game developers and other people who can avoid problematic images and only need the trivial interface JPEG baseline & progressive (12 bpc/arithmetic not supported, same as stock IJG lib) PNG 1/2/4/8/16-bit-per-channel TGA (not sure what subset, if a subset) BMP non-1bpp, non-RLE PSD (composited view only, no extra channels, 8/16 bit-per-channel) GIF (*comp always reports as 4-channel) HDR (radiance rgbE format) PIC (Softimage PIC) PNM (PPM and PGM binary only) Animated GIF still needs a proper API, but here's one way to do it: http://gist.github.com/urraka/685d9a6340b26b830d49 - decode from memory or through FILE (define STBI_NO_STDIO to remove code) - decode from arbitrary I/O callbacks - SIMD acceleration on x86/x64 (SSE2) and ARM (NEON) Full documentation under "DOCUMENTATION" below. LICENSE See end of file for license information. RECENT REVISION HISTORY: 2.16 (2017-07-23) all functions have 16-bit variants; optimizations; bugfixes 2.15 (2017-03-18) fix png-1,2,4; all Imagenet JPGs; no runtime SSE detection on GCC 2.14 (2017-03-03) remove deprecated STBI_JPEG_OLD; fixes for Imagenet JPGs 2.13 (2016-12-04) experimental 16-bit API, only for PNG so far; fixes 2.12 (2016-04-02) fix typo in 2.11 PSD fix that caused crashes 2.11 (2016-04-02) 16-bit PNGS; enable SSE2 in non-gcc x64 RGB-format JPEG; remove white matting in PSD; allocate large structures on the stack; correct channel count for PNG & BMP 2.10 (2016-01-22) avoid warning introduced in 2.09 2.09 (2016-01-16) 16-bit TGA; comments in PNM files; STBI_REALLOC_SIZED See end of file for full revision history. ============================ Contributors ========================= Image formats Extensions, features Sean Barrett (jpeg, png, bmp) Jetro Lauha (stbi_info) Nicolas Schulz (hdr, psd) Martin "SpartanJ" Golini (stbi_info) Jonathan Dummer (tga) James "moose2000" Brown (iPhone PNG) Jean-Marc Lienher (gif) Ben "Disch" Wenger (io callbacks) Tom Seddon (pic) Omar Cornut (1/2/4-bit PNG) Thatcher Ulrich (psd) Nicolas Guillemot (vertical flip) Ken Miller (pgm, ppm) Richard Mitton (16-bit PSD) github:urraka (animated gif) Junggon Kim (PNM comments) Daniel Gibson (16-bit TGA) socks-the-fox (16-bit PNG) Jeremy Sawicki (handle all ImageNet JPGs) Optimizations & bugfixes Fabian "ryg" Giesen Arseny Kapoulkine John-Mark Allen Bug & warning fixes Marc LeBlanc David Woo Guillaume George Martins Mozeiko Christpher Lloyd Jerry Jansson Joseph Thomson Phil Jordan Dave Moore Roy Eltham Hayaki Saito Nathan Reed Won Chun Luke Graham Johan Duparc Nick Verigakis the Horde3D community Thomas Ruf Ronny Chevalier Baldur Karlsson Janez Zemva John Bartholomew Michal Cichon github:rlyeh Jonathan Blow Ken Hamada Tero Hanninen github:romigrou Laurent Gomila Cort Stratton Sergio Gonzalez github:svdijk Aruelien Pocheville Thibault Reuille Cass Everitt github:snagar Ryamond Barbiero Paul Du Bois Engin Manap github:Zelex Michaelangel007@github Philipp Wiesemann Dale Weiler github:grim210 Oriol Ferrer Mesia Josh Tobin Matthew Gregan github:sammyhw Blazej Dariusz Roszkowski Gregory Mullen github:phprus Christian Floisand Kevin Schmidt github:poppolopoppo */ #ifndef STBI_INCLUDE_STB_IMAGE_H #define STBI_INCLUDE_STB_IMAGE_H // DOCUMENTATION // // Limitations: // - no 16-bit-per-channel PNG // - no 12-bit-per-channel JPEG // - no JPEGs with arithmetic coding // - no 1-bit BMP // - GIF always returns *comp=4 // // Basic usage (see HDR discussion below for HDR usage): // int x,y,n; // unsigned char *data = stbi_load(filename, &x, &y, &n, 0); // // ... process data if not NULL ... // // ... x = width, y = height, n = # 8-bit components per pixel ... // // ... replace '0' with '1'..'4' to force that many components per pixel // // ... but 'n' will always be the number that it would have been if you said 0 // stbi_image_free(data) // // Standard parameters: // int *x -- outputs image width in pixels // int *y -- outputs image height in pixels // int *channels_in_file -- outputs # of image components in image file // int desired_channels -- if non-zero, # of image components requested in result // // The return value from an image loader is an 'unsigned char *' which points // to the pixel data, or NULL on an allocation failure or if the image is // corrupt or invalid. The pixel data consists of *y scanlines of *x pixels, // with each pixel consisting of N interleaved 8-bit components; the first // pixel pointed to is top-left-most in the image. There is no padding between // image scanlines or between pixels, regardless of format. The number of // components N is 'desired_channels' if desired_channels is non-zero, or // *channels_in_file otherwise. If desired_channels is non-zero, // *channels_in_file has the number of components that _would_ have been // output otherwise. E.g. if you set desired_channels to 4, you will always // get RGBA output, but you can check *channels_in_file to see if it's trivially // opaque because e.g. there were only 3 channels in the source image. // // An output image with N components has the following components interleaved // in this order in each pixel: // // N=#comp components // 1 grey // 2 grey, alpha // 3 red, green, blue // 4 red, green, blue, alpha // // If image loading fails for any reason, the return value will be NULL, // and *x, *y, *channels_in_file will be unchanged. The function // stbi_failure_reason() can be queried for an extremely brief, end-user // unfriendly explanation of why the load failed. Define STBI_NO_FAILURE_STRINGS // to avoid compiling these strings at all, and STBI_FAILURE_USERMSG to get slightly // more user-friendly ones. // // Paletted PNG, BMP, GIF, and PIC images are automatically depalettized. // // =========================================================================== // // Philosophy // // stb libraries are designed with the following priorities: // // 1. easy to use // 2. easy to maintain // 3. good performance // // Sometimes I let "good performance" creep up in priority over "easy to maintain", // and for best performance I may provide less-easy-to-use APIs that give higher // performance, in addition to the easy to use ones. Nevertheless, it's important // to keep in mind that from the standpoint of you, a client of this library, // all you care about is #1 and #3, and stb libraries DO NOT emphasize #3 above all. // // Some secondary priorities arise directly from the first two, some of which // make more explicit reasons why performance can't be emphasized. // // - Portable ("ease of use") // - Small source code footprint ("easy to maintain") // - No dependencies ("ease of use") // // =========================================================================== // // I/O callbacks // // I/O callbacks allow you to read from arbitrary sources, like packaged // files or some other source. Data read from callbacks are processed // through a small internal buffer (currently 128 bytes) to try to reduce // overhead. // // The three functions you must define are "read" (reads some bytes of data), // "skip" (skips some bytes of data), "eof" (reports if the stream is at the end). // // =========================================================================== // // SIMD support // // The JPEG decoder will try to automatically use SIMD kernels on x86 when // supported by the compiler. For ARM Neon support, you must explicitly // request it. // // (The old do-it-yourself SIMD API is no longer supported in the current // code.) // // On x86, SSE2 will automatically be used when available based on a run-time // test; if not, the generic C versions are used as a fall-back. On ARM targets, // the typical path is to have separate builds for NEON and non-NEON devices // (at least this is true for iOS and Android). Therefore, the NEON support is // toggled by a build flag: define STBI_NEON to get NEON loops. // // If for some reason you do not want to use any of SIMD code, or if // you have issues compiling it, you can disable it entirely by // defining STBI_NO_SIMD. // // =========================================================================== // // HDR image support (disable by defining STBI_NO_HDR) // // stb_image now supports loading HDR images in general, and currently // the Radiance .HDR file format, although the support is provided // generically. You can still load any file through the existing interface; // if you attempt to load an HDR file, it will be automatically remapped to // LDR, assuming gamma 2.2 and an arbitrary scale factor defaulting to 1; // both of these constants can be reconfigured through this interface: // // stbi_hdr_to_ldr_gamma(2.2f); // stbi_hdr_to_ldr_scale(1.0f); // // (note, do not use _inverse_ constants; stbi_image will invert them // appropriately). // // Additionally, there is a new, parallel interface for loading files as // (linear) floats to preserve the full dynamic range: // // float *data = stbi_loadf(filename, &x, &y, &n, 0); // // If you load LDR images through this interface, those images will // be promoted to floating point values, run through the inverse of // constants corresponding to the above: // // stbi_ldr_to_hdr_scale(1.0f); // stbi_ldr_to_hdr_gamma(2.2f); // // Finally, given a filename (or an open file or memory block--see header // file for details) containing image data, you can query for the "most // appropriate" interface to use (that is, whether the image is HDR or // not), using: // // stbi_is_hdr(char *filename); // // =========================================================================== // // iPhone PNG support: // // By default we convert iphone-formatted PNGs back to RGB, even though // they are internally encoded differently. You can disable this conversion // by by calling stbi_convert_iphone_png_to_rgb(0), in which case // you will always just get the native iphone "format" through (which // is BGR stored in RGB). // // Call stbi_set_unpremultiply_on_load(1) as well to force a divide per // pixel to remove any premultiplied alpha *only* if the image file explicitly // says there's premultiplied data (currently only happens in iPhone images, // and only if iPhone convert-to-rgb processing is on). // // =========================================================================== // // ADDITIONAL CONFIGURATION // // - You can suppress implementation of any of the decoders to reduce // your code footprint by #defining one or more of the following // symbols before creating the implementation. // // STBI_NO_JPEG // STBI_NO_PNG // STBI_NO_BMP // STBI_NO_PSD // STBI_NO_TGA // STBI_NO_GIF // STBI_NO_HDR // STBI_NO_PIC // STBI_NO_PNM (.ppm and .pgm) // // - You can request *only* certain decoders and suppress all other ones // (this will be more forward-compatible, as addition of new decoders // doesn't require you to disable them explicitly): // // STBI_ONLY_JPEG // STBI_ONLY_PNG // STBI_ONLY_BMP // STBI_ONLY_PSD // STBI_ONLY_TGA // STBI_ONLY_GIF // STBI_ONLY_HDR // STBI_ONLY_PIC // STBI_ONLY_PNM (.ppm and .pgm) // // - If you use STBI_NO_PNG (or _ONLY_ without PNG), and you still // want the zlib decoder to be available, #define STBI_SUPPORT_ZLIB // #ifndef STBI_NO_STDIO #include #endif // STBI_NO_STDIO #define STBI_VERSION 1 enum { STBI_default = 0, // only used for desired_channels STBI_grey = 1, STBI_grey_alpha = 2, STBI_rgb = 3, STBI_rgb_alpha = 4 }; typedef unsigned char stbi_uc; typedef unsigned short stbi_us; #ifdef __cplusplus extern "C" { #endif #ifdef STB_IMAGE_STATIC #define STBIDEF static #else #define STBIDEF extern #endif ////////////////////////////////////////////////////////////////////////////// // // PRIMARY API - works on images of any type // // // load image by filename, open file, or memory buffer // typedef struct { int (*read) (void *user,char *data,int size); // fill 'data' with 'size' bytes. return number of bytes actually read void (*skip) (void *user,int n); // skip the next 'n' bytes, or 'unget' the last -n bytes if negative int (*eof) (void *user); // returns nonzero if we are at end of file/data } stbi_io_callbacks; //////////////////////////////////// // // 8-bits-per-channel interface // STBIDEF stbi_uc *stbi_load_from_memory (stbi_uc const *buffer, int len , int *x, int *y, int *channels_in_file, int desired_channels); STBIDEF stbi_uc *stbi_load_from_callbacks(stbi_io_callbacks const *clbk , void *user, int *x, int *y, int *channels_in_file, int desired_channels); #ifndef STBI_NO_STDIO STBIDEF stbi_uc *stbi_load (char const *filename, int *x, int *y, int *channels_in_file, int desired_channels); STBIDEF stbi_uc *stbi_load_from_file (FILE *f, int *x, int *y, int *channels_in_file, int desired_channels); // for stbi_load_from_file, file pointer is left pointing immediately after image #endif //////////////////////////////////// // // 16-bits-per-channel interface // STBIDEF stbi_us *stbi_load_16_from_memory (stbi_uc const *buffer, int len, int *x, int *y, int *channels_in_file, int desired_channels); STBIDEF stbi_us *stbi_load_16_from_callbacks(stbi_io_callbacks const *clbk, void *user, int *x, int *y, int *channels_in_file, int desired_channels); #ifndef STBI_NO_STDIO STBIDEF stbi_us *stbi_load_16 (char const *filename, int *x, int *y, int *channels_in_file, int desired_channels); STBIDEF stbi_us *stbi_load_from_file_16(FILE *f, int *x, int *y, int *channels_in_file, int desired_channels); #endif //////////////////////////////////// // // float-per-channel interface // #ifndef STBI_NO_LINEAR STBIDEF float *stbi_loadf_from_memory (stbi_uc const *buffer, int len, int *x, int *y, int *channels_in_file, int desired_channels); STBIDEF float *stbi_loadf_from_callbacks (stbi_io_callbacks const *clbk, void *user, int *x, int *y, int *channels_in_file, int desired_channels); #ifndef STBI_NO_STDIO STBIDEF float *stbi_loadf (char const *filename, int *x, int *y, int *channels_in_file, int desired_channels); STBIDEF float *stbi_loadf_from_file (FILE *f, int *x, int *y, int *channels_in_file, int desired_channels); #endif #endif #ifndef STBI_NO_HDR STBIDEF void stbi_hdr_to_ldr_gamma(float gamma); STBIDEF void stbi_hdr_to_ldr_scale(float scale); #endif // STBI_NO_HDR #ifndef STBI_NO_LINEAR STBIDEF void stbi_ldr_to_hdr_gamma(float gamma); STBIDEF void stbi_ldr_to_hdr_scale(float scale); #endif // STBI_NO_LINEAR // stbi_is_hdr is always defined, but always returns false if STBI_NO_HDR STBIDEF int stbi_is_hdr_from_callbacks(stbi_io_callbacks const *clbk, void *user); STBIDEF int stbi_is_hdr_from_memory(stbi_uc const *buffer, int len); #ifndef STBI_NO_STDIO STBIDEF int stbi_is_hdr (char const *filename); STBIDEF int stbi_is_hdr_from_file(FILE *f); #endif // STBI_NO_STDIO // get a VERY brief reason for failure // NOT THREADSAFE STBIDEF const char *stbi_failure_reason (void); // free the loaded image -- this is just free() STBIDEF void stbi_image_free (void *retval_from_stbi_load); // get image dimensions & components without fully decoding STBIDEF int stbi_info_from_memory(stbi_uc const *buffer, int len, int *x, int *y, int *comp); STBIDEF int stbi_info_from_callbacks(stbi_io_callbacks const *clbk, void *user, int *x, int *y, int *comp); #ifndef STBI_NO_STDIO STBIDEF int stbi_info (char const *filename, int *x, int *y, int *comp); STBIDEF int stbi_info_from_file (FILE *f, int *x, int *y, int *comp); #endif // for image formats that explicitly notate that they have premultiplied alpha, // we just return the colors as stored in the file. set this flag to force // unpremultiplication. results are undefined if the unpremultiply overflow. STBIDEF void stbi_set_unpremultiply_on_load(int flag_true_if_should_unpremultiply); // indicate whether we should process iphone images back to canonical format, // or just pass them through "as-is" STBIDEF void stbi_convert_iphone_png_to_rgb(int flag_true_if_should_convert); // flip the image vertically, so the first pixel in the output array is the bottom left STBIDEF void stbi_set_flip_vertically_on_load(int flag_true_if_should_flip); // ZLIB client - used by PNG, available for other purposes STBIDEF char *stbi_zlib_decode_malloc_guesssize(const char *buffer, int len, int initial_size, int *outlen); STBIDEF char *stbi_zlib_decode_malloc_guesssize_headerflag(const char *buffer, int len, int initial_size, int *outlen, int parse_header); STBIDEF char *stbi_zlib_decode_malloc(const char *buffer, int len, int *outlen); STBIDEF int stbi_zlib_decode_buffer(char *obuffer, int olen, const char *ibuffer, int ilen); STBIDEF char *stbi_zlib_decode_noheader_malloc(const char *buffer, int len, int *outlen); STBIDEF int stbi_zlib_decode_noheader_buffer(char *obuffer, int olen, const char *ibuffer, int ilen); #ifdef __cplusplus } #endif // // //// end header file ///////////////////////////////////////////////////// #endif // STBI_INCLUDE_STB_IMAGE_H #ifdef STB_IMAGE_IMPLEMENTATION #if defined(STBI_ONLY_JPEG) || defined(STBI_ONLY_PNG) || defined(STBI_ONLY_BMP) \ || defined(STBI_ONLY_TGA) || defined(STBI_ONLY_GIF) || defined(STBI_ONLY_PSD) \ || defined(STBI_ONLY_HDR) || defined(STBI_ONLY_PIC) || defined(STBI_ONLY_PNM) \ || defined(STBI_ONLY_ZLIB) #ifndef STBI_ONLY_JPEG #define STBI_NO_JPEG #endif #ifndef STBI_ONLY_PNG #define STBI_NO_PNG #endif #ifndef STBI_ONLY_BMP #define STBI_NO_BMP #endif #ifndef STBI_ONLY_PSD #define STBI_NO_PSD #endif #ifndef STBI_ONLY_TGA #define STBI_NO_TGA #endif #ifndef STBI_ONLY_GIF #define STBI_NO_GIF #endif #ifndef STBI_ONLY_HDR #define STBI_NO_HDR #endif #ifndef STBI_ONLY_PIC #define STBI_NO_PIC #endif #ifndef STBI_ONLY_PNM #define STBI_NO_PNM #endif #endif #if defined(STBI_NO_PNG) && !defined(STBI_SUPPORT_ZLIB) && !defined(STBI_NO_ZLIB) #define STBI_NO_ZLIB #endif #include #include // ptrdiff_t on osx #include #include #include #if !defined(STBI_NO_LINEAR) || !defined(STBI_NO_HDR) #include // ldexp #endif #ifndef STBI_NO_STDIO #include #endif #ifndef STBI_ASSERT #include #define STBI_ASSERT(x) assert(x) #endif #ifndef _MSC_VER #ifdef __cplusplus #define stbi_inline inline #else #define stbi_inline #endif #else #define stbi_inline __forceinline #endif #ifdef _MSC_VER typedef unsigned short stbi__uint16; typedef signed short stbi__int16; typedef unsigned int stbi__uint32; typedef signed int stbi__int32; #else #include typedef uint16_t stbi__uint16; typedef int16_t stbi__int16; typedef uint32_t stbi__uint32; typedef int32_t stbi__int32; #endif // should produce compiler error if size is wrong typedef unsigned char validate_uint32[sizeof(stbi__uint32)==4 ? 1 : -1]; #ifdef _MSC_VER #define STBI_NOTUSED(v) (void)(v) #else #define STBI_NOTUSED(v) (void)sizeof(v) #endif #ifdef _MSC_VER #define STBI_HAS_LROTL #endif #ifdef STBI_HAS_LROTL #define stbi_lrot(x,y) _lrotl(x,y) #else #define stbi_lrot(x,y) (((x) << (y)) | ((x) >> (32 - (y)))) #endif #if defined(STBI_MALLOC) && defined(STBI_FREE) && (defined(STBI_REALLOC) || defined(STBI_REALLOC_SIZED)) // ok #elif !defined(STBI_MALLOC) && !defined(STBI_FREE) && !defined(STBI_REALLOC) && !defined(STBI_REALLOC_SIZED) // ok #else #error "Must define all or none of STBI_MALLOC, STBI_FREE, and STBI_REALLOC (or STBI_REALLOC_SIZED)." #endif #ifndef STBI_MALLOC #define STBI_MALLOC(sz) malloc(sz) #define STBI_REALLOC(p,newsz) realloc(p,newsz) #define STBI_FREE(p) free(p) #endif #ifndef STBI_REALLOC_SIZED #define STBI_REALLOC_SIZED(p,oldsz,newsz) STBI_REALLOC(p,newsz) #endif // x86/x64 detection #if defined(__x86_64__) || defined(_M_X64) #define STBI__X64_TARGET #elif defined(__i386) || defined(_M_IX86) #define STBI__X86_TARGET #endif #if defined(__GNUC__) && defined(STBI__X86_TARGET) && !defined(__SSE2__) && !defined(STBI_NO_SIMD) // gcc doesn't support sse2 intrinsics unless you compile with -msse2, // which in turn means it gets to use SSE2 everywhere. This is unfortunate, // but previous attempts to provide the SSE2 functions with runtime // detection caused numerous issues. The way architecture extensions are // exposed in GCC/Clang is, sadly, not really suited for one-file libs. // New behavior: if compiled with -msse2, we use SSE2 without any // detection; if not, we don't use it at all. #define STBI_NO_SIMD #endif #if defined(__MINGW32__) && defined(STBI__X86_TARGET) && !defined(STBI_MINGW_ENABLE_SSE2) && !defined(STBI_NO_SIMD) // Note that __MINGW32__ doesn't actually mean 32-bit, so we have to avoid STBI__X64_TARGET // // 32-bit MinGW wants ESP to be 16-byte aligned, but this is not in the // Windows ABI and VC++ as well as Windows DLLs don't maintain that invariant. // As a result, enabling SSE2 on 32-bit MinGW is dangerous when not // simultaneously enabling "-mstackrealign". // // See https://github.com/nothings/stb/issues/81 for more information. // // So default to no SSE2 on 32-bit MinGW. If you've read this far and added // -mstackrealign to your build settings, feel free to #define STBI_MINGW_ENABLE_SSE2. #define STBI_NO_SIMD #endif #if !defined(STBI_NO_SIMD) && (defined(STBI__X86_TARGET) || defined(STBI__X64_TARGET)) #define STBI_SSE2 #include #ifdef _MSC_VER #if _MSC_VER >= 1400 // not VC6 #include // __cpuid static int stbi__cpuid3(void) { int info[4]; __cpuid(info,1); return info[3]; } #else static int stbi__cpuid3(void) { int res; __asm { mov eax,1 cpuid mov res,edx } return res; } #endif #define STBI_SIMD_ALIGN(type, name) __declspec(align(16)) type name static int stbi__sse2_available(void) { int info3 = stbi__cpuid3(); return ((info3 >> 26) & 1) != 0; } #else // assume GCC-style if not VC++ #define STBI_SIMD_ALIGN(type, name) type name __attribute__((aligned(16))) static int stbi__sse2_available(void) { // If we're even attempting to compile this on GCC/Clang, that means // -msse2 is on, which means the compiler is allowed to use SSE2 // instructions at will, and so are we. return 1; } #endif #endif // ARM NEON #if defined(STBI_NO_SIMD) && defined(STBI_NEON) #undef STBI_NEON #endif #ifdef STBI_NEON #include // assume GCC or Clang on ARM targets #define STBI_SIMD_ALIGN(type, name) type name __attribute__((aligned(16))) #endif #ifndef STBI_SIMD_ALIGN #define STBI_SIMD_ALIGN(type, name) type name #endif /////////////////////////////////////////////// // // stbi__context struct and start_xxx functions // stbi__context structure is our basic context used by all images, so it // contains all the IO context, plus some basic image information typedef struct { stbi__uint32 img_x, img_y; int img_n, img_out_n; stbi_io_callbacks io; void *io_user_data; int read_from_callbacks; int buflen; stbi_uc buffer_start[128]; stbi_uc *img_buffer, *img_buffer_end; stbi_uc *img_buffer_original, *img_buffer_original_end; } stbi__context; static void stbi__refill_buffer(stbi__context *s); // initialize a memory-decode context static void stbi__start_mem(stbi__context *s, stbi_uc const *buffer, int len) { s->io.read = NULL; s->read_from_callbacks = 0; s->img_buffer = s->img_buffer_original = (stbi_uc *) buffer; s->img_buffer_end = s->img_buffer_original_end = (stbi_uc *) buffer+len; } // initialize a callback-based context static void stbi__start_callbacks(stbi__context *s, stbi_io_callbacks *c, void *user) { s->io = *c; s->io_user_data = user; s->buflen = sizeof(s->buffer_start); s->read_from_callbacks = 1; s->img_buffer_original = s->buffer_start; stbi__refill_buffer(s); s->img_buffer_original_end = s->img_buffer_end; } #ifndef STBI_NO_STDIO static int stbi__stdio_read(void *user, char *data, int size) { return (int) fread(data,1,size,(FILE*) user); } static void stbi__stdio_skip(void *user, int n) { fseek((FILE*) user, n, SEEK_CUR); } static int stbi__stdio_eof(void *user) { return feof((FILE*) user); } static stbi_io_callbacks stbi__stdio_callbacks = { stbi__stdio_read, stbi__stdio_skip, stbi__stdio_eof, }; static void stbi__start_file(stbi__context *s, FILE *f) { stbi__start_callbacks(s, &stbi__stdio_callbacks, (void *) f); } //static void stop_file(stbi__context *s) { } #endif // !STBI_NO_STDIO static void stbi__rewind(stbi__context *s) { // conceptually rewind SHOULD rewind to the beginning of the stream, // but we just rewind to the beginning of the initial buffer, because // we only use it after doing 'test', which only ever looks at at most 92 bytes s->img_buffer = s->img_buffer_original; s->img_buffer_end = s->img_buffer_original_end; } enum { STBI_ORDER_RGB, STBI_ORDER_BGR }; typedef struct { int bits_per_channel; int num_channels; int channel_order; } stbi__result_info; #ifndef STBI_NO_JPEG static int stbi__jpeg_test(stbi__context *s); static void *stbi__jpeg_load(stbi__context *s, int *x, int *y, int *comp, int req_comp, stbi__result_info *ri); static int stbi__jpeg_info(stbi__context *s, int *x, int *y, int *comp); #endif #ifndef STBI_NO_PNG static int stbi__png_test(stbi__context *s); static void *stbi__png_load(stbi__context *s, int *x, int *y, int *comp, int req_comp, stbi__result_info *ri); static int stbi__png_info(stbi__context *s, int *x, int *y, int *comp); #endif #ifndef STBI_NO_BMP static int stbi__bmp_test(stbi__context *s); static void *stbi__bmp_load(stbi__context *s, int *x, int *y, int *comp, int req_comp, stbi__result_info *ri); static int stbi__bmp_info(stbi__context *s, int *x, int *y, int *comp); #endif #ifndef STBI_NO_TGA static int stbi__tga_test(stbi__context *s); static void *stbi__tga_load(stbi__context *s, int *x, int *y, int *comp, int req_comp, stbi__result_info *ri); static int stbi__tga_info(stbi__context *s, int *x, int *y, int *comp); #endif #ifndef STBI_NO_PSD static int stbi__psd_test(stbi__context *s); static void *stbi__psd_load(stbi__context *s, int *x, int *y, int *comp, int req_comp, stbi__result_info *ri, int bpc); static int stbi__psd_info(stbi__context *s, int *x, int *y, int *comp); #endif #ifndef STBI_NO_HDR static int stbi__hdr_test(stbi__context *s); static float *stbi__hdr_load(stbi__context *s, int *x, int *y, int *comp, int req_comp, stbi__result_info *ri); static int stbi__hdr_info(stbi__context *s, int *x, int *y, int *comp); #endif #ifndef STBI_NO_PIC static int stbi__pic_test(stbi__context *s); static void *stbi__pic_load(stbi__context *s, int *x, int *y, int *comp, int req_comp, stbi__result_info *ri); static int stbi__pic_info(stbi__context *s, int *x, int *y, int *comp); #endif #ifndef STBI_NO_GIF static int stbi__gif_test(stbi__context *s); static void *stbi__gif_load(stbi__context *s, int *x, int *y, int *comp, int req_comp, stbi__result_info *ri); static int stbi__gif_info(stbi__context *s, int *x, int *y, int *comp); #endif #ifndef STBI_NO_PNM static int stbi__pnm_test(stbi__context *s); static void *stbi__pnm_load(stbi__context *s, int *x, int *y, int *comp, int req_comp, stbi__result_info *ri); static int stbi__pnm_info(stbi__context *s, int *x, int *y, int *comp); #endif // this is not threadsafe static const char *stbi__g_failure_reason; STBIDEF const char *stbi_failure_reason(void) { return stbi__g_failure_reason; } static int stbi__err(const char *str) { stbi__g_failure_reason = str; return 0; } static void *stbi__malloc(size_t size) { return STBI_MALLOC(size); } // stb_image uses ints pervasively, including for offset calculations. // therefore the largest decoded image size we can support with the // current code, even on 64-bit targets, is INT_MAX. this is not a // significant limitation for the intended use case. // // we do, however, need to make sure our size calculations don't // overflow. hence a few helper functions for size calculations that // multiply integers together, making sure that they're non-negative // and no overflow occurs. // return 1 if the sum is valid, 0 on overflow. // negative terms are considered invalid. static int stbi__addsizes_valid(int a, int b) { if (b < 0) return 0; // now 0 <= b <= INT_MAX, hence also // 0 <= INT_MAX - b <= INTMAX. // And "a + b <= INT_MAX" (which might overflow) is the // same as a <= INT_MAX - b (no overflow) return a <= INT_MAX - b; } // returns 1 if the product is valid, 0 on overflow. // negative factors are considered invalid. static int stbi__mul2sizes_valid(int a, int b) { if (a < 0 || b < 0) return 0; if (b == 0) return 1; // mul-by-0 is always safe // portable way to check for no overflows in a*b return a <= INT_MAX/b; } // returns 1 if "a*b + add" has no negative terms/factors and doesn't overflow static int stbi__mad2sizes_valid(int a, int b, int add) { return stbi__mul2sizes_valid(a, b) && stbi__addsizes_valid(a*b, add); } // returns 1 if "a*b*c + add" has no negative terms/factors and doesn't overflow static int stbi__mad3sizes_valid(int a, int b, int c, int add) { return stbi__mul2sizes_valid(a, b) && stbi__mul2sizes_valid(a*b, c) && stbi__addsizes_valid(a*b*c, add); } // returns 1 if "a*b*c*d + add" has no negative terms/factors and doesn't overflow static int stbi__mad4sizes_valid(int a, int b, int c, int d, int add) { return stbi__mul2sizes_valid(a, b) && stbi__mul2sizes_valid(a*b, c) && stbi__mul2sizes_valid(a*b*c, d) && stbi__addsizes_valid(a*b*c*d, add); } // mallocs with size overflow checking static void *stbi__malloc_mad2(int a, int b, int add) { if (!stbi__mad2sizes_valid(a, b, add)) return NULL; return stbi__malloc(a*b + add); } static void *stbi__malloc_mad3(int a, int b, int c, int add) { if (!stbi__mad3sizes_valid(a, b, c, add)) return NULL; return stbi__malloc(a*b*c + add); } static void *stbi__malloc_mad4(int a, int b, int c, int d, int add) { if (!stbi__mad4sizes_valid(a, b, c, d, add)) return NULL; return stbi__malloc(a*b*c*d + add); } // stbi__err - error // stbi__errpf - error returning pointer to float // stbi__errpuc - error returning pointer to unsigned char #ifdef STBI_NO_FAILURE_STRINGS #define stbi__err(x,y) 0 #elif defined(STBI_FAILURE_USERMSG) #define stbi__err(x,y) stbi__err(y) #else #define stbi__err(x,y) stbi__err(x) #endif #define stbi__errpf(x,y) ((float *)(size_t) (stbi__err(x,y)?NULL:NULL)) #define stbi__errpuc(x,y) ((unsigned char *)(size_t) (stbi__err(x,y)?NULL:NULL)) STBIDEF void stbi_image_free(void *retval_from_stbi_load) { STBI_FREE(retval_from_stbi_load); } #ifndef STBI_NO_LINEAR static float *stbi__ldr_to_hdr(stbi_uc *data, int x, int y, int comp); #endif #ifndef STBI_NO_HDR static stbi_uc *stbi__hdr_to_ldr(float *data, int x, int y, int comp); #endif static int stbi__vertically_flip_on_load = 0; STBIDEF void stbi_set_flip_vertically_on_load(int flag_true_if_should_flip) { stbi__vertically_flip_on_load = flag_true_if_should_flip; } static void *stbi__load_main(stbi__context *s, int *x, int *y, int *comp, int req_comp, stbi__result_info *ri, int bpc) { memset(ri, 0, sizeof(*ri)); // make sure it's initialized if we add new fields ri->bits_per_channel = 8; // default is 8 so most paths don't have to be changed ri->channel_order = STBI_ORDER_RGB; // all current input & output are this, but this is here so we can add BGR order ri->num_channels = 0; #ifndef STBI_NO_JPEG if (stbi__jpeg_test(s)) return stbi__jpeg_load(s,x,y,comp,req_comp, ri); #endif #ifndef STBI_NO_PNG if (stbi__png_test(s)) return stbi__png_load(s,x,y,comp,req_comp, ri); #endif #ifndef STBI_NO_BMP if (stbi__bmp_test(s)) return stbi__bmp_load(s,x,y,comp,req_comp, ri); #endif #ifndef STBI_NO_GIF if (stbi__gif_test(s)) return stbi__gif_load(s,x,y,comp,req_comp, ri); #endif #ifndef STBI_NO_PSD if (stbi__psd_test(s)) return stbi__psd_load(s,x,y,comp,req_comp, ri, bpc); #endif #ifndef STBI_NO_PIC if (stbi__pic_test(s)) return stbi__pic_load(s,x,y,comp,req_comp, ri); #endif #ifndef STBI_NO_PNM if (stbi__pnm_test(s)) return stbi__pnm_load(s,x,y,comp,req_comp, ri); #endif #ifndef STBI_NO_HDR if (stbi__hdr_test(s)) { float *hdr = stbi__hdr_load(s, x,y,comp,req_comp, ri); return stbi__hdr_to_ldr(hdr, *x, *y, req_comp ? req_comp : *comp); } #endif #ifndef STBI_NO_TGA // test tga last because it's a crappy test! if (stbi__tga_test(s)) return stbi__tga_load(s,x,y,comp,req_comp, ri); #endif return stbi__errpuc("unknown image type", "Image not of any known type, or corrupt"); } static stbi_uc *stbi__convert_16_to_8(stbi__uint16 *orig, int w, int h, int channels) { int i; int img_len = w * h * channels; stbi_uc *reduced; reduced = (stbi_uc *) stbi__malloc(img_len); if (reduced == NULL) return stbi__errpuc("outofmem", "Out of memory"); for (i = 0; i < img_len; ++i) reduced[i] = (stbi_uc)((orig[i] >> 8) & 0xFF); // top half of each byte is sufficient approx of 16->8 bit scaling STBI_FREE(orig); return reduced; } static stbi__uint16 *stbi__convert_8_to_16(stbi_uc *orig, int w, int h, int channels) { int i; int img_len = w * h * channels; stbi__uint16 *enlarged; enlarged = (stbi__uint16 *) stbi__malloc(img_len*2); if (enlarged == NULL) return (stbi__uint16 *) stbi__errpuc("outofmem", "Out of memory"); for (i = 0; i < img_len; ++i) enlarged[i] = (stbi__uint16)((orig[i] << 8) + orig[i]); // replicate to high and low byte, maps 0->0, 255->0xffff STBI_FREE(orig); return enlarged; } static void stbi__vertical_flip(void *image, int w, int h, int bytes_per_pixel) { int row; size_t bytes_per_row = (size_t)w * bytes_per_pixel; stbi_uc temp[2048]; stbi_uc *bytes = (stbi_uc *)image; for (row = 0; row < (h>>1); row++) { stbi_uc *row0 = bytes + row*bytes_per_row; stbi_uc *row1 = bytes + (h - row - 1)*bytes_per_row; // swap row0 with row1 size_t bytes_left = bytes_per_row; while (bytes_left) { size_t bytes_copy = (bytes_left < sizeof(temp)) ? bytes_left : sizeof(temp); memcpy(temp, row0, bytes_copy); memcpy(row0, row1, bytes_copy); memcpy(row1, temp, bytes_copy); row0 += bytes_copy; row1 += bytes_copy; bytes_left -= bytes_copy; } } } static unsigned char *stbi__load_and_postprocess_8bit(stbi__context *s, int *x, int *y, int *comp, int req_comp) { stbi__result_info ri; void *result = stbi__load_main(s, x, y, comp, req_comp, &ri, 8); if (result == NULL) return NULL; if (ri.bits_per_channel != 8) { STBI_ASSERT(ri.bits_per_channel == 16); result = stbi__convert_16_to_8((stbi__uint16 *) result, *x, *y, req_comp == 0 ? *comp : req_comp); ri.bits_per_channel = 8; } // @TODO: move stbi__convert_format to here if (stbi__vertically_flip_on_load) { int channels = req_comp ? req_comp : *comp; stbi__vertical_flip(result, *x, *y, channels * sizeof(stbi_uc)); } return (unsigned char *) result; } static stbi__uint16 *stbi__load_and_postprocess_16bit(stbi__context *s, int *x, int *y, int *comp, int req_comp) { stbi__result_info ri; void *result = stbi__load_main(s, x, y, comp, req_comp, &ri, 16); if (result == NULL) return NULL; if (ri.bits_per_channel != 16) { STBI_ASSERT(ri.bits_per_channel == 8); result = stbi__convert_8_to_16((stbi_uc *) result, *x, *y, req_comp == 0 ? *comp : req_comp); ri.bits_per_channel = 16; } // @TODO: move stbi__convert_format16 to here // @TODO: special case RGB-to-Y (and RGBA-to-YA) for 8-bit-to-16-bit case to keep more precision if (stbi__vertically_flip_on_load) { int channels = req_comp ? req_comp : *comp; stbi__vertical_flip(result, *x, *y, channels * sizeof(stbi__uint16)); } return (stbi__uint16 *) result; } #ifndef STBI_NO_HDR static void stbi__float_postprocess(float *result, int *x, int *y, int *comp, int req_comp) { if (stbi__vertically_flip_on_load && result != NULL) { int channels = req_comp ? req_comp : *comp; stbi__vertical_flip(result, *x, *y, channels * sizeof(float)); } } #endif #ifndef STBI_NO_STDIO static FILE *stbi__fopen(char const *filename, char const *mode) { FILE *f; #if defined(_MSC_VER) && _MSC_VER >= 1400 if (0 != fopen_s(&f, filename, mode)) f=0; #else f = fopen(filename, mode); #endif return f; } STBIDEF stbi_uc *stbi_load(char const *filename, int *x, int *y, int *comp, int req_comp) { FILE *f = stbi__fopen(filename, "rb"); unsigned char *result; if (!f) return stbi__errpuc("can't fopen", "Unable to open file"); result = stbi_load_from_file(f,x,y,comp,req_comp); fclose(f); return result; } STBIDEF stbi_uc *stbi_load_from_file(FILE *f, int *x, int *y, int *comp, int req_comp) { unsigned char *result; stbi__context s; stbi__start_file(&s,f); result = stbi__load_and_postprocess_8bit(&s,x,y,comp,req_comp); if (result) { // need to 'unget' all the characters in the IO buffer fseek(f, - (int) (s.img_buffer_end - s.img_buffer), SEEK_CUR); } return result; } STBIDEF stbi__uint16 *stbi_load_from_file_16(FILE *f, int *x, int *y, int *comp, int req_comp) { stbi__uint16 *result; stbi__context s; stbi__start_file(&s,f); result = stbi__load_and_postprocess_16bit(&s,x,y,comp,req_comp); if (result) { // need to 'unget' all the characters in the IO buffer fseek(f, - (int) (s.img_buffer_end - s.img_buffer), SEEK_CUR); } return result; } STBIDEF stbi_us *stbi_load_16(char const *filename, int *x, int *y, int *comp, int req_comp) { FILE *f = stbi__fopen(filename, "rb"); stbi__uint16 *result; if (!f) return (stbi_us *) stbi__errpuc("can't fopen", "Unable to open file"); result = stbi_load_from_file_16(f,x,y,comp,req_comp); fclose(f); return result; } #endif //!STBI_NO_STDIO STBIDEF stbi_us *stbi_load_16_from_memory(stbi_uc const *buffer, int len, int *x, int *y, int *channels_in_file, int desired_channels) { stbi__context s; stbi__start_mem(&s,buffer,len); return stbi__load_and_postprocess_16bit(&s,x,y,channels_in_file,desired_channels); } STBIDEF stbi_us *stbi_load_16_from_callbacks(stbi_io_callbacks const *clbk, void *user, int *x, int *y, int *channels_in_file, int desired_channels) { stbi__context s; stbi__start_callbacks(&s, (stbi_io_callbacks *)clbk, user); return stbi__load_and_postprocess_16bit(&s,x,y,channels_in_file,desired_channels); } STBIDEF stbi_uc *stbi_load_from_memory(stbi_uc const *buffer, int len, int *x, int *y, int *comp, int req_comp) { stbi__context s; stbi__start_mem(&s,buffer,len); return stbi__load_and_postprocess_8bit(&s,x,y,comp,req_comp); } STBIDEF stbi_uc *stbi_load_from_callbacks(stbi_io_callbacks const *clbk, void *user, int *x, int *y, int *comp, int req_comp) { stbi__context s; stbi__start_callbacks(&s, (stbi_io_callbacks *) clbk, user); return stbi__load_and_postprocess_8bit(&s,x,y,comp,req_comp); } #ifndef STBI_NO_LINEAR static float *stbi__loadf_main(stbi__context *s, int *x, int *y, int *comp, int req_comp) { unsigned char *data; #ifndef STBI_NO_HDR if (stbi__hdr_test(s)) { stbi__result_info ri; float *hdr_data = stbi__hdr_load(s,x,y,comp,req_comp, &ri); if (hdr_data) stbi__float_postprocess(hdr_data,x,y,comp,req_comp); return hdr_data; } #endif data = stbi__load_and_postprocess_8bit(s, x, y, comp, req_comp); if (data) return stbi__ldr_to_hdr(data, *x, *y, req_comp ? req_comp : *comp); return stbi__errpf("unknown image type", "Image not of any known type, or corrupt"); } STBIDEF float *stbi_loadf_from_memory(stbi_uc const *buffer, int len, int *x, int *y, int *comp, int req_comp) { stbi__context s; stbi__start_mem(&s,buffer,len); return stbi__loadf_main(&s,x,y,comp,req_comp); } STBIDEF float *stbi_loadf_from_callbacks(stbi_io_callbacks const *clbk, void *user, int *x, int *y, int *comp, int req_comp) { stbi__context s; stbi__start_callbacks(&s, (stbi_io_callbacks *) clbk, user); return stbi__loadf_main(&s,x,y,comp,req_comp); } #ifndef STBI_NO_STDIO STBIDEF float *stbi_loadf(char const *filename, int *x, int *y, int *comp, int req_comp) { float *result; FILE *f = stbi__fopen(filename, "rb"); if (!f) return stbi__errpf("can't fopen", "Unable to open file"); result = stbi_loadf_from_file(f,x,y,comp,req_comp); fclose(f); return result; } STBIDEF float *stbi_loadf_from_file(FILE *f, int *x, int *y, int *comp, int req_comp) { stbi__context s; stbi__start_file(&s,f); return stbi__loadf_main(&s,x,y,comp,req_comp); } #endif // !STBI_NO_STDIO #endif // !STBI_NO_LINEAR // these is-hdr-or-not is defined independent of whether STBI_NO_LINEAR is // defined, for API simplicity; if STBI_NO_LINEAR is defined, it always // reports false! STBIDEF int stbi_is_hdr_from_memory(stbi_uc const *buffer, int len) { #ifndef STBI_NO_HDR stbi__context s; stbi__start_mem(&s,buffer,len); return stbi__hdr_test(&s); #else STBI_NOTUSED(buffer); STBI_NOTUSED(len); return 0; #endif } #ifndef STBI_NO_STDIO STBIDEF int stbi_is_hdr (char const *filename) { FILE *f = stbi__fopen(filename, "rb"); int result=0; if (f) { result = stbi_is_hdr_from_file(f); fclose(f); } return result; } STBIDEF int stbi_is_hdr_from_file(FILE *f) { #ifndef STBI_NO_HDR stbi__context s; stbi__start_file(&s,f); return stbi__hdr_test(&s); #else STBI_NOTUSED(f); return 0; #endif } #endif // !STBI_NO_STDIO STBIDEF int stbi_is_hdr_from_callbacks(stbi_io_callbacks const *clbk, void *user) { #ifndef STBI_NO_HDR stbi__context s; stbi__start_callbacks(&s, (stbi_io_callbacks *) clbk, user); return stbi__hdr_test(&s); #else STBI_NOTUSED(clbk); STBI_NOTUSED(user); return 0; #endif } #ifndef STBI_NO_LINEAR static float stbi__l2h_gamma=2.2f, stbi__l2h_scale=1.0f; STBIDEF void stbi_ldr_to_hdr_gamma(float gamma) { stbi__l2h_gamma = gamma; } STBIDEF void stbi_ldr_to_hdr_scale(float scale) { stbi__l2h_scale = scale; } #endif static float stbi__h2l_gamma_i=1.0f/2.2f, stbi__h2l_scale_i=1.0f; STBIDEF void stbi_hdr_to_ldr_gamma(float gamma) { stbi__h2l_gamma_i = 1/gamma; } STBIDEF void stbi_hdr_to_ldr_scale(float scale) { stbi__h2l_scale_i = 1/scale; } ////////////////////////////////////////////////////////////////////////////// // // Common code used by all image loaders // enum { STBI__SCAN_load=0, STBI__SCAN_type, STBI__SCAN_header }; static void stbi__refill_buffer(stbi__context *s) { int n = (s->io.read)(s->io_user_data,(char*)s->buffer_start,s->buflen); if (n == 0) { // at end of file, treat same as if from memory, but need to handle case // where s->img_buffer isn't pointing to safe memory, e.g. 0-byte file s->read_from_callbacks = 0; s->img_buffer = s->buffer_start; s->img_buffer_end = s->buffer_start+1; *s->img_buffer = 0; } else { s->img_buffer = s->buffer_start; s->img_buffer_end = s->buffer_start + n; } } stbi_inline static stbi_uc stbi__get8(stbi__context *s) { if (s->img_buffer < s->img_buffer_end) return *s->img_buffer++; if (s->read_from_callbacks) { stbi__refill_buffer(s); return *s->img_buffer++; } return 0; } stbi_inline static int stbi__at_eof(stbi__context *s) { if (s->io.read) { if (!(s->io.eof)(s->io_user_data)) return 0; // if feof() is true, check if buffer = end // special case: we've only got the special 0 character at the end if (s->read_from_callbacks == 0) return 1; } return s->img_buffer >= s->img_buffer_end; } static void stbi__skip(stbi__context *s, int n) { if (n < 0) { s->img_buffer = s->img_buffer_end; return; } if (s->io.read) { int blen = (int) (s->img_buffer_end - s->img_buffer); if (blen < n) { s->img_buffer = s->img_buffer_end; (s->io.skip)(s->io_user_data, n - blen); return; } } s->img_buffer += n; } static int stbi__getn(stbi__context *s, stbi_uc *buffer, int n) { if (s->io.read) { int blen = (int) (s->img_buffer_end - s->img_buffer); if (blen < n) { int res, count; memcpy(buffer, s->img_buffer, blen); count = (s->io.read)(s->io_user_data, (char*) buffer + blen, n - blen); res = (count == (n-blen)); s->img_buffer = s->img_buffer_end; return res; } } if (s->img_buffer+n <= s->img_buffer_end) { memcpy(buffer, s->img_buffer, n); s->img_buffer += n; return 1; } else return 0; } static int stbi__get16be(stbi__context *s) { int z = stbi__get8(s); return (z << 8) + stbi__get8(s); } static stbi__uint32 stbi__get32be(stbi__context *s) { stbi__uint32 z = stbi__get16be(s); return (z << 16) + stbi__get16be(s); } #if defined(STBI_NO_BMP) && defined(STBI_NO_TGA) && defined(STBI_NO_GIF) // nothing #else static int stbi__get16le(stbi__context *s) { int z = stbi__get8(s); return z + (stbi__get8(s) << 8); } #endif #ifndef STBI_NO_BMP static stbi__uint32 stbi__get32le(stbi__context *s) { stbi__uint32 z = stbi__get16le(s); return z + (stbi__get16le(s) << 16); } #endif #define STBI__BYTECAST(x) ((stbi_uc) ((x) & 255)) // truncate int to byte without warnings ////////////////////////////////////////////////////////////////////////////// // // generic converter from built-in img_n to req_comp // individual types do this automatically as much as possible (e.g. jpeg // does all cases internally since it needs to colorspace convert anyway, // and it never has alpha, so very few cases ). png can automatically // interleave an alpha=255 channel, but falls back to this for other cases // // assume data buffer is malloced, so malloc a new one and free that one // only failure mode is malloc failing static stbi_uc stbi__compute_y(int r, int g, int b) { return (stbi_uc) (((r*77) + (g*150) + (29*b)) >> 8); } static unsigned char *stbi__convert_format(unsigned char *data, int img_n, int req_comp, unsigned int x, unsigned int y) { int i,j; unsigned char *good; if (req_comp == img_n) return data; STBI_ASSERT(req_comp >= 1 && req_comp <= 4); good = (unsigned char *) stbi__malloc_mad3(req_comp, x, y, 0); if (good == NULL) { STBI_FREE(data); return stbi__errpuc("outofmem", "Out of memory"); } for (j=0; j < (int) y; ++j) { unsigned char *src = data + j * x * img_n ; unsigned char *dest = good + j * x * req_comp; #define STBI__COMBO(a,b) ((a)*8+(b)) #define STBI__CASE(a,b) case STBI__COMBO(a,b): for(i=x-1; i >= 0; --i, src += a, dest += b) // convert source image with img_n components to one with req_comp components; // avoid switch per pixel, so use switch per scanline and massive macros switch (STBI__COMBO(img_n, req_comp)) { STBI__CASE(1,2) { dest[0]=src[0], dest[1]=255; } break; STBI__CASE(1,3) { dest[0]=dest[1]=dest[2]=src[0]; } break; STBI__CASE(1,4) { dest[0]=dest[1]=dest[2]=src[0], dest[3]=255; } break; STBI__CASE(2,1) { dest[0]=src[0]; } break; STBI__CASE(2,3) { dest[0]=dest[1]=dest[2]=src[0]; } break; STBI__CASE(2,4) { dest[0]=dest[1]=dest[2]=src[0], dest[3]=src[1]; } break; STBI__CASE(3,4) { dest[0]=src[0],dest[1]=src[1],dest[2]=src[2],dest[3]=255; } break; STBI__CASE(3,1) { dest[0]=stbi__compute_y(src[0],src[1],src[2]); } break; STBI__CASE(3,2) { dest[0]=stbi__compute_y(src[0],src[1],src[2]), dest[1] = 255; } break; STBI__CASE(4,1) { dest[0]=stbi__compute_y(src[0],src[1],src[2]); } break; STBI__CASE(4,2) { dest[0]=stbi__compute_y(src[0],src[1],src[2]), dest[1] = src[3]; } break; STBI__CASE(4,3) { dest[0]=src[0],dest[1]=src[1],dest[2]=src[2]; } break; default: STBI_ASSERT(0); } #undef STBI__CASE } STBI_FREE(data); return good; } static stbi__uint16 stbi__compute_y_16(int r, int g, int b) { return (stbi__uint16) (((r*77) + (g*150) + (29*b)) >> 8); } static stbi__uint16 *stbi__convert_format16(stbi__uint16 *data, int img_n, int req_comp, unsigned int x, unsigned int y) { int i,j; stbi__uint16 *good; if (req_comp == img_n) return data; STBI_ASSERT(req_comp >= 1 && req_comp <= 4); good = (stbi__uint16 *) stbi__malloc(req_comp * x * y * 2); if (good == NULL) { STBI_FREE(data); return (stbi__uint16 *) stbi__errpuc("outofmem", "Out of memory"); } for (j=0; j < (int) y; ++j) { stbi__uint16 *src = data + j * x * img_n ; stbi__uint16 *dest = good + j * x * req_comp; #define STBI__COMBO(a,b) ((a)*8+(b)) #define STBI__CASE(a,b) case STBI__COMBO(a,b): for(i=x-1; i >= 0; --i, src += a, dest += b) // convert source image with img_n components to one with req_comp components; // avoid switch per pixel, so use switch per scanline and massive macros switch (STBI__COMBO(img_n, req_comp)) { STBI__CASE(1,2) { dest[0]=src[0], dest[1]=0xffff; } break; STBI__CASE(1,3) { dest[0]=dest[1]=dest[2]=src[0]; } break; STBI__CASE(1,4) { dest[0]=dest[1]=dest[2]=src[0], dest[3]=0xffff; } break; STBI__CASE(2,1) { dest[0]=src[0]; } break; STBI__CASE(2,3) { dest[0]=dest[1]=dest[2]=src[0]; } break; STBI__CASE(2,4) { dest[0]=dest[1]=dest[2]=src[0], dest[3]=src[1]; } break; STBI__CASE(3,4) { dest[0]=src[0],dest[1]=src[1],dest[2]=src[2],dest[3]=0xffff; } break; STBI__CASE(3,1) { dest[0]=stbi__compute_y_16(src[0],src[1],src[2]); } break; STBI__CASE(3,2) { dest[0]=stbi__compute_y_16(src[0],src[1],src[2]), dest[1] = 0xffff; } break; STBI__CASE(4,1) { dest[0]=stbi__compute_y_16(src[0],src[1],src[2]); } break; STBI__CASE(4,2) { dest[0]=stbi__compute_y_16(src[0],src[1],src[2]), dest[1] = src[3]; } break; STBI__CASE(4,3) { dest[0]=src[0],dest[1]=src[1],dest[2]=src[2]; } break; default: STBI_ASSERT(0); } #undef STBI__CASE } STBI_FREE(data); return good; } #ifndef STBI_NO_LINEAR static float *stbi__ldr_to_hdr(stbi_uc *data, int x, int y, int comp) { int i,k,n; float *output; if (!data) return NULL; output = (float *) stbi__malloc_mad4(x, y, comp, sizeof(float), 0); if (output == NULL) { STBI_FREE(data); return stbi__errpf("outofmem", "Out of memory"); } // compute number of non-alpha components if (comp & 1) n = comp; else n = comp-1; for (i=0; i < x*y; ++i) { for (k=0; k < n; ++k) { output[i*comp + k] = (float) (pow(data[i*comp+k]/255.0f, stbi__l2h_gamma) * stbi__l2h_scale); } if (k < comp) output[i*comp + k] = data[i*comp+k]/255.0f; } STBI_FREE(data); return output; } #endif #ifndef STBI_NO_HDR #define stbi__float2int(x) ((int) (x)) static stbi_uc *stbi__hdr_to_ldr(float *data, int x, int y, int comp) { int i,k,n; stbi_uc *output; if (!data) return NULL; output = (stbi_uc *) stbi__malloc_mad3(x, y, comp, 0); if (output == NULL) { STBI_FREE(data); return stbi__errpuc("outofmem", "Out of memory"); } // compute number of non-alpha components if (comp & 1) n = comp; else n = comp-1; for (i=0; i < x*y; ++i) { for (k=0; k < n; ++k) { float z = (float) pow(data[i*comp+k]*stbi__h2l_scale_i, stbi__h2l_gamma_i) * 255 + 0.5f; if (z < 0) z = 0; if (z > 255) z = 255; output[i*comp + k] = (stbi_uc) stbi__float2int(z); } if (k < comp) { float z = data[i*comp+k] * 255 + 0.5f; if (z < 0) z = 0; if (z > 255) z = 255; output[i*comp + k] = (stbi_uc) stbi__float2int(z); } } STBI_FREE(data); return output; } #endif ////////////////////////////////////////////////////////////////////////////// // // "baseline" JPEG/JFIF decoder // // simple implementation // - doesn't support delayed output of y-dimension // - simple interface (only one output format: 8-bit interleaved RGB) // - doesn't try to recover corrupt jpegs // - doesn't allow partial loading, loading multiple at once // - still fast on x86 (copying globals into locals doesn't help x86) // - allocates lots of intermediate memory (full size of all components) // - non-interleaved case requires this anyway // - allows good upsampling (see next) // high-quality // - upsampled channels are bilinearly interpolated, even across blocks // - quality integer IDCT derived from IJG's 'slow' // performance // - fast huffman; reasonable integer IDCT // - some SIMD kernels for common paths on targets with SSE2/NEON // - uses a lot of intermediate memory, could cache poorly #ifndef STBI_NO_JPEG // huffman decoding acceleration #define FAST_BITS 9 // larger handles more cases; smaller stomps less cache typedef struct { stbi_uc fast[1 << FAST_BITS]; // weirdly, repacking this into AoS is a 10% speed loss, instead of a win stbi__uint16 code[256]; stbi_uc values[256]; stbi_uc size[257]; unsigned int maxcode[18]; int delta[17]; // old 'firstsymbol' - old 'firstcode' } stbi__huffman; typedef struct { stbi__context *s; stbi__huffman huff_dc[4]; stbi__huffman huff_ac[4]; stbi__uint16 dequant[4][64]; stbi__int16 fast_ac[4][1 << FAST_BITS]; // sizes for components, interleaved MCUs int img_h_max, img_v_max; int img_mcu_x, img_mcu_y; int img_mcu_w, img_mcu_h; // definition of jpeg image component struct { int id; int h,v; int tq; int hd,ha; int dc_pred; int x,y,w2,h2; stbi_uc *data; void *raw_data, *raw_coeff; stbi_uc *linebuf; short *coeff; // progressive only int coeff_w, coeff_h; // number of 8x8 coefficient blocks } img_comp[4]; stbi__uint32 code_buffer; // jpeg entropy-coded buffer int code_bits; // number of valid bits unsigned char marker; // marker seen while filling entropy buffer int nomore; // flag if we saw a marker so must stop int progressive; int spec_start; int spec_end; int succ_high; int succ_low; int eob_run; int jfif; int app14_color_transform; // Adobe APP14 tag int rgb; int scan_n, order[4]; int restart_interval, todo; // kernels void (*idct_block_kernel)(stbi_uc *out, int out_stride, short data[64]); void (*YCbCr_to_RGB_kernel)(stbi_uc *out, const stbi_uc *y, const stbi_uc *pcb, const stbi_uc *pcr, int count, int step); stbi_uc *(*resample_row_hv_2_kernel)(stbi_uc *out, stbi_uc *in_near, stbi_uc *in_far, int w, int hs); } stbi__jpeg; static int stbi__build_huffman(stbi__huffman *h, int *count) { int i,j,k=0,code; // build size list for each symbol (from JPEG spec) for (i=0; i < 16; ++i) for (j=0; j < count[i]; ++j) h->size[k++] = (stbi_uc) (i+1); h->size[k] = 0; // compute actual symbols (from jpeg spec) code = 0; k = 0; for(j=1; j <= 16; ++j) { // compute delta to add to code to compute symbol id h->delta[j] = k - code; if (h->size[k] == j) { while (h->size[k] == j) h->code[k++] = (stbi__uint16) (code++); if (code-1 >= (1 << j)) return stbi__err("bad code lengths","Corrupt JPEG"); } // compute largest code + 1 for this size, preshifted as needed later h->maxcode[j] = code << (16-j); code <<= 1; } h->maxcode[j] = 0xffffffff; // build non-spec acceleration table; 255 is flag for not-accelerated memset(h->fast, 255, 1 << FAST_BITS); for (i=0; i < k; ++i) { int s = h->size[i]; if (s <= FAST_BITS) { int c = h->code[i] << (FAST_BITS-s); int m = 1 << (FAST_BITS-s); for (j=0; j < m; ++j) { h->fast[c+j] = (stbi_uc) i; } } } return 1; } // build a table that decodes both magnitude and value of small ACs in // one go. static void stbi__build_fast_ac(stbi__int16 *fast_ac, stbi__huffman *h) { int i; for (i=0; i < (1 << FAST_BITS); ++i) { stbi_uc fast = h->fast[i]; fast_ac[i] = 0; if (fast < 255) { int rs = h->values[fast]; int run = (rs >> 4) & 15; int magbits = rs & 15; int len = h->size[fast]; if (magbits && len + magbits <= FAST_BITS) { // magnitude code followed by receive_extend code int k = ((i << len) & ((1 << FAST_BITS) - 1)) >> (FAST_BITS - magbits); int m = 1 << (magbits - 1); if (k < m) k += (~0U << magbits) + 1; // if the result is small enough, we can fit it in fast_ac table if (k >= -128 && k <= 127) fast_ac[i] = (stbi__int16) ((k << 8) + (run << 4) + (len + magbits)); } } } } static void stbi__grow_buffer_unsafe(stbi__jpeg *j) { do { int b = j->nomore ? 0 : stbi__get8(j->s); if (b == 0xff) { int c = stbi__get8(j->s); while (c == 0xff) c = stbi__get8(j->s); // consume fill bytes if (c != 0) { j->marker = (unsigned char) c; j->nomore = 1; return; } } j->code_buffer |= b << (24 - j->code_bits); j->code_bits += 8; } while (j->code_bits <= 24); } // (1 << n) - 1 static stbi__uint32 stbi__bmask[17]={0,1,3,7,15,31,63,127,255,511,1023,2047,4095,8191,16383,32767,65535}; // decode a jpeg huffman value from the bitstream stbi_inline static int stbi__jpeg_huff_decode(stbi__jpeg *j, stbi__huffman *h) { unsigned int temp; int c,k; if (j->code_bits < 16) stbi__grow_buffer_unsafe(j); // look at the top FAST_BITS and determine what symbol ID it is, // if the code is <= FAST_BITS c = (j->code_buffer >> (32 - FAST_BITS)) & ((1 << FAST_BITS)-1); k = h->fast[c]; if (k < 255) { int s = h->size[k]; if (s > j->code_bits) return -1; j->code_buffer <<= s; j->code_bits -= s; return h->values[k]; } // naive test is to shift the code_buffer down so k bits are // valid, then test against maxcode. To speed this up, we've // preshifted maxcode left so that it has (16-k) 0s at the // end; in other words, regardless of the number of bits, it // wants to be compared against something shifted to have 16; // that way we don't need to shift inside the loop. temp = j->code_buffer >> 16; for (k=FAST_BITS+1 ; ; ++k) if (temp < h->maxcode[k]) break; if (k == 17) { // error! code not found j->code_bits -= 16; return -1; } if (k > j->code_bits) return -1; // convert the huffman code to the symbol id c = ((j->code_buffer >> (32 - k)) & stbi__bmask[k]) + h->delta[k]; STBI_ASSERT((((j->code_buffer) >> (32 - h->size[c])) & stbi__bmask[h->size[c]]) == h->code[c]); // convert the id to a symbol j->code_bits -= k; j->code_buffer <<= k; return h->values[c]; } // bias[n] = (-1<code_bits < n) stbi__grow_buffer_unsafe(j); sgn = (stbi__int32)j->code_buffer >> 31; // sign bit is always in MSB k = stbi_lrot(j->code_buffer, n); STBI_ASSERT(n >= 0 && n < (int) (sizeof(stbi__bmask)/sizeof(*stbi__bmask))); j->code_buffer = k & ~stbi__bmask[n]; k &= stbi__bmask[n]; j->code_bits -= n; return k + (stbi__jbias[n] & ~sgn); } // get some unsigned bits stbi_inline static int stbi__jpeg_get_bits(stbi__jpeg *j, int n) { unsigned int k; if (j->code_bits < n) stbi__grow_buffer_unsafe(j); k = stbi_lrot(j->code_buffer, n); j->code_buffer = k & ~stbi__bmask[n]; k &= stbi__bmask[n]; j->code_bits -= n; return k; } stbi_inline static int stbi__jpeg_get_bit(stbi__jpeg *j) { unsigned int k; if (j->code_bits < 1) stbi__grow_buffer_unsafe(j); k = j->code_buffer; j->code_buffer <<= 1; --j->code_bits; return k & 0x80000000; } // given a value that's at position X in the zigzag stream, // where does it appear in the 8x8 matrix coded as row-major? static stbi_uc stbi__jpeg_dezigzag[64+15] = { 0, 1, 8, 16, 9, 2, 3, 10, 17, 24, 32, 25, 18, 11, 4, 5, 12, 19, 26, 33, 40, 48, 41, 34, 27, 20, 13, 6, 7, 14, 21, 28, 35, 42, 49, 56, 57, 50, 43, 36, 29, 22, 15, 23, 30, 37, 44, 51, 58, 59, 52, 45, 38, 31, 39, 46, 53, 60, 61, 54, 47, 55, 62, 63, // let corrupt input sample past end 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63 }; // decode one 64-entry block-- static int stbi__jpeg_decode_block(stbi__jpeg *j, short data[64], stbi__huffman *hdc, stbi__huffman *hac, stbi__int16 *fac, int b, stbi__uint16 *dequant) { int diff,dc,k; int t; if (j->code_bits < 16) stbi__grow_buffer_unsafe(j); t = stbi__jpeg_huff_decode(j, hdc); if (t < 0) return stbi__err("bad huffman code","Corrupt JPEG"); // 0 all the ac values now so we can do it 32-bits at a time memset(data,0,64*sizeof(data[0])); diff = t ? stbi__extend_receive(j, t) : 0; dc = j->img_comp[b].dc_pred + diff; j->img_comp[b].dc_pred = dc; data[0] = (short) (dc * dequant[0]); // decode AC components, see JPEG spec k = 1; do { unsigned int zig; int c,r,s; if (j->code_bits < 16) stbi__grow_buffer_unsafe(j); c = (j->code_buffer >> (32 - FAST_BITS)) & ((1 << FAST_BITS)-1); r = fac[c]; if (r) { // fast-AC path k += (r >> 4) & 15; // run s = r & 15; // combined length j->code_buffer <<= s; j->code_bits -= s; // decode into unzigzag'd location zig = stbi__jpeg_dezigzag[k++]; data[zig] = (short) ((r >> 8) * dequant[zig]); } else { int rs = stbi__jpeg_huff_decode(j, hac); if (rs < 0) return stbi__err("bad huffman code","Corrupt JPEG"); s = rs & 15; r = rs >> 4; if (s == 0) { if (rs != 0xf0) break; // end block k += 16; } else { k += r; // decode into unzigzag'd location zig = stbi__jpeg_dezigzag[k++]; data[zig] = (short) (stbi__extend_receive(j,s) * dequant[zig]); } } } while (k < 64); return 1; } static int stbi__jpeg_decode_block_prog_dc(stbi__jpeg *j, short data[64], stbi__huffman *hdc, int b) { int diff,dc; int t; if (j->spec_end != 0) return stbi__err("can't merge dc and ac", "Corrupt JPEG"); if (j->code_bits < 16) stbi__grow_buffer_unsafe(j); if (j->succ_high == 0) { // first scan for DC coefficient, must be first memset(data,0,64*sizeof(data[0])); // 0 all the ac values now t = stbi__jpeg_huff_decode(j, hdc); diff = t ? stbi__extend_receive(j, t) : 0; dc = j->img_comp[b].dc_pred + diff; j->img_comp[b].dc_pred = dc; data[0] = (short) (dc << j->succ_low); } else { // refinement scan for DC coefficient if (stbi__jpeg_get_bit(j)) data[0] += (short) (1 << j->succ_low); } return 1; } // @OPTIMIZE: store non-zigzagged during the decode passes, // and only de-zigzag when dequantizing static int stbi__jpeg_decode_block_prog_ac(stbi__jpeg *j, short data[64], stbi__huffman *hac, stbi__int16 *fac) { int k; if (j->spec_start == 0) return stbi__err("can't merge dc and ac", "Corrupt JPEG"); if (j->succ_high == 0) { int shift = j->succ_low; if (j->eob_run) { --j->eob_run; return 1; } k = j->spec_start; do { unsigned int zig; int c,r,s; if (j->code_bits < 16) stbi__grow_buffer_unsafe(j); c = (j->code_buffer >> (32 - FAST_BITS)) & ((1 << FAST_BITS)-1); r = fac[c]; if (r) { // fast-AC path k += (r >> 4) & 15; // run s = r & 15; // combined length j->code_buffer <<= s; j->code_bits -= s; zig = stbi__jpeg_dezigzag[k++]; data[zig] = (short) ((r >> 8) << shift); } else { int rs = stbi__jpeg_huff_decode(j, hac); if (rs < 0) return stbi__err("bad huffman code","Corrupt JPEG"); s = rs & 15; r = rs >> 4; if (s == 0) { if (r < 15) { j->eob_run = (1 << r); if (r) j->eob_run += stbi__jpeg_get_bits(j, r); --j->eob_run; break; } k += 16; } else { k += r; zig = stbi__jpeg_dezigzag[k++]; data[zig] = (short) (stbi__extend_receive(j,s) << shift); } } } while (k <= j->spec_end); } else { // refinement scan for these AC coefficients short bit = (short) (1 << j->succ_low); if (j->eob_run) { --j->eob_run; for (k = j->spec_start; k <= j->spec_end; ++k) { short *p = &data[stbi__jpeg_dezigzag[k]]; if (*p != 0) if (stbi__jpeg_get_bit(j)) if ((*p & bit)==0) { if (*p > 0) *p += bit; else *p -= bit; } } } else { k = j->spec_start; do { int r,s; int rs = stbi__jpeg_huff_decode(j, hac); // @OPTIMIZE see if we can use the fast path here, advance-by-r is so slow, eh if (rs < 0) return stbi__err("bad huffman code","Corrupt JPEG"); s = rs & 15; r = rs >> 4; if (s == 0) { if (r < 15) { j->eob_run = (1 << r) - 1; if (r) j->eob_run += stbi__jpeg_get_bits(j, r); r = 64; // force end of block } else { // r=15 s=0 should write 16 0s, so we just do // a run of 15 0s and then write s (which is 0), // so we don't have to do anything special here } } else { if (s != 1) return stbi__err("bad huffman code", "Corrupt JPEG"); // sign bit if (stbi__jpeg_get_bit(j)) s = bit; else s = -bit; } // advance by r while (k <= j->spec_end) { short *p = &data[stbi__jpeg_dezigzag[k++]]; if (*p != 0) { if (stbi__jpeg_get_bit(j)) if ((*p & bit)==0) { if (*p > 0) *p += bit; else *p -= bit; } } else { if (r == 0) { *p = (short) s; break; } --r; } } } while (k <= j->spec_end); } } return 1; } // take a -128..127 value and stbi__clamp it and convert to 0..255 stbi_inline static stbi_uc stbi__clamp(int x) { // trick to use a single test to catch both cases if ((unsigned int) x > 255) { if (x < 0) return 0; if (x > 255) return 255; } return (stbi_uc) x; } #define stbi__f2f(x) ((int) (((x) * 4096 + 0.5))) #define stbi__fsh(x) ((x) << 12) // derived from jidctint -- DCT_ISLOW #define STBI__IDCT_1D(s0,s1,s2,s3,s4,s5,s6,s7) \ int t0,t1,t2,t3,p1,p2,p3,p4,p5,x0,x1,x2,x3; \ p2 = s2; \ p3 = s6; \ p1 = (p2+p3) * stbi__f2f(0.5411961f); \ t2 = p1 + p3*stbi__f2f(-1.847759065f); \ t3 = p1 + p2*stbi__f2f( 0.765366865f); \ p2 = s0; \ p3 = s4; \ t0 = stbi__fsh(p2+p3); \ t1 = stbi__fsh(p2-p3); \ x0 = t0+t3; \ x3 = t0-t3; \ x1 = t1+t2; \ x2 = t1-t2; \ t0 = s7; \ t1 = s5; \ t2 = s3; \ t3 = s1; \ p3 = t0+t2; \ p4 = t1+t3; \ p1 = t0+t3; \ p2 = t1+t2; \ p5 = (p3+p4)*stbi__f2f( 1.175875602f); \ t0 = t0*stbi__f2f( 0.298631336f); \ t1 = t1*stbi__f2f( 2.053119869f); \ t2 = t2*stbi__f2f( 3.072711026f); \ t3 = t3*stbi__f2f( 1.501321110f); \ p1 = p5 + p1*stbi__f2f(-0.899976223f); \ p2 = p5 + p2*stbi__f2f(-2.562915447f); \ p3 = p3*stbi__f2f(-1.961570560f); \ p4 = p4*stbi__f2f(-0.390180644f); \ t3 += p1+p4; \ t2 += p2+p3; \ t1 += p2+p4; \ t0 += p1+p3; static void stbi__idct_block(stbi_uc *out, int out_stride, short data[64]) { int i,val[64],*v=val; stbi_uc *o; short *d = data; // columns for (i=0; i < 8; ++i,++d, ++v) { // if all zeroes, shortcut -- this avoids dequantizing 0s and IDCTing if (d[ 8]==0 && d[16]==0 && d[24]==0 && d[32]==0 && d[40]==0 && d[48]==0 && d[56]==0) { // no shortcut 0 seconds // (1|2|3|4|5|6|7)==0 0 seconds // all separate -0.047 seconds // 1 && 2|3 && 4|5 && 6|7: -0.047 seconds int dcterm = d[0] << 2; v[0] = v[8] = v[16] = v[24] = v[32] = v[40] = v[48] = v[56] = dcterm; } else { STBI__IDCT_1D(d[ 0],d[ 8],d[16],d[24],d[32],d[40],d[48],d[56]) // constants scaled things up by 1<<12; let's bring them back // down, but keep 2 extra bits of precision x0 += 512; x1 += 512; x2 += 512; x3 += 512; v[ 0] = (x0+t3) >> 10; v[56] = (x0-t3) >> 10; v[ 8] = (x1+t2) >> 10; v[48] = (x1-t2) >> 10; v[16] = (x2+t1) >> 10; v[40] = (x2-t1) >> 10; v[24] = (x3+t0) >> 10; v[32] = (x3-t0) >> 10; } } for (i=0, v=val, o=out; i < 8; ++i,v+=8,o+=out_stride) { // no fast case since the first 1D IDCT spread components out STBI__IDCT_1D(v[0],v[1],v[2],v[3],v[4],v[5],v[6],v[7]) // constants scaled things up by 1<<12, plus we had 1<<2 from first // loop, plus horizontal and vertical each scale by sqrt(8) so together // we've got an extra 1<<3, so 1<<17 total we need to remove. // so we want to round that, which means adding 0.5 * 1<<17, // aka 65536. Also, we'll end up with -128 to 127 that we want // to encode as 0..255 by adding 128, so we'll add that before the shift x0 += 65536 + (128<<17); x1 += 65536 + (128<<17); x2 += 65536 + (128<<17); x3 += 65536 + (128<<17); // tried computing the shifts into temps, or'ing the temps to see // if any were out of range, but that was slower o[0] = stbi__clamp((x0+t3) >> 17); o[7] = stbi__clamp((x0-t3) >> 17); o[1] = stbi__clamp((x1+t2) >> 17); o[6] = stbi__clamp((x1-t2) >> 17); o[2] = stbi__clamp((x2+t1) >> 17); o[5] = stbi__clamp((x2-t1) >> 17); o[3] = stbi__clamp((x3+t0) >> 17); o[4] = stbi__clamp((x3-t0) >> 17); } } #ifdef STBI_SSE2 // sse2 integer IDCT. not the fastest possible implementation but it // produces bit-identical results to the generic C version so it's // fully "transparent". static void stbi__idct_simd(stbi_uc *out, int out_stride, short data[64]) { // This is constructed to match our regular (generic) integer IDCT exactly. __m128i row0, row1, row2, row3, row4, row5, row6, row7; __m128i tmp; // dot product constant: even elems=x, odd elems=y #define dct_const(x,y) _mm_setr_epi16((x),(y),(x),(y),(x),(y),(x),(y)) // out(0) = c0[even]*x + c0[odd]*y (c0, x, y 16-bit, out 32-bit) // out(1) = c1[even]*x + c1[odd]*y #define dct_rot(out0,out1, x,y,c0,c1) \ __m128i c0##lo = _mm_unpacklo_epi16((x),(y)); \ __m128i c0##hi = _mm_unpackhi_epi16((x),(y)); \ __m128i out0##_l = _mm_madd_epi16(c0##lo, c0); \ __m128i out0##_h = _mm_madd_epi16(c0##hi, c0); \ __m128i out1##_l = _mm_madd_epi16(c0##lo, c1); \ __m128i out1##_h = _mm_madd_epi16(c0##hi, c1) // out = in << 12 (in 16-bit, out 32-bit) #define dct_widen(out, in) \ __m128i out##_l = _mm_srai_epi32(_mm_unpacklo_epi16(_mm_setzero_si128(), (in)), 4); \ __m128i out##_h = _mm_srai_epi32(_mm_unpackhi_epi16(_mm_setzero_si128(), (in)), 4) // wide add #define dct_wadd(out, a, b) \ __m128i out##_l = _mm_add_epi32(a##_l, b##_l); \ __m128i out##_h = _mm_add_epi32(a##_h, b##_h) // wide sub #define dct_wsub(out, a, b) \ __m128i out##_l = _mm_sub_epi32(a##_l, b##_l); \ __m128i out##_h = _mm_sub_epi32(a##_h, b##_h) // butterfly a/b, add bias, then shift by "s" and pack #define dct_bfly32o(out0, out1, a,b,bias,s) \ { \ __m128i abiased_l = _mm_add_epi32(a##_l, bias); \ __m128i abiased_h = _mm_add_epi32(a##_h, bias); \ dct_wadd(sum, abiased, b); \ dct_wsub(dif, abiased, b); \ out0 = _mm_packs_epi32(_mm_srai_epi32(sum_l, s), _mm_srai_epi32(sum_h, s)); \ out1 = _mm_packs_epi32(_mm_srai_epi32(dif_l, s), _mm_srai_epi32(dif_h, s)); \ } // 8-bit interleave step (for transposes) #define dct_interleave8(a, b) \ tmp = a; \ a = _mm_unpacklo_epi8(a, b); \ b = _mm_unpackhi_epi8(tmp, b) // 16-bit interleave step (for transposes) #define dct_interleave16(a, b) \ tmp = a; \ a = _mm_unpacklo_epi16(a, b); \ b = _mm_unpackhi_epi16(tmp, b) #define dct_pass(bias,shift) \ { \ /* even part */ \ dct_rot(t2e,t3e, row2,row6, rot0_0,rot0_1); \ __m128i sum04 = _mm_add_epi16(row0, row4); \ __m128i dif04 = _mm_sub_epi16(row0, row4); \ dct_widen(t0e, sum04); \ dct_widen(t1e, dif04); \ dct_wadd(x0, t0e, t3e); \ dct_wsub(x3, t0e, t3e); \ dct_wadd(x1, t1e, t2e); \ dct_wsub(x2, t1e, t2e); \ /* odd part */ \ dct_rot(y0o,y2o, row7,row3, rot2_0,rot2_1); \ dct_rot(y1o,y3o, row5,row1, rot3_0,rot3_1); \ __m128i sum17 = _mm_add_epi16(row1, row7); \ __m128i sum35 = _mm_add_epi16(row3, row5); \ dct_rot(y4o,y5o, sum17,sum35, rot1_0,rot1_1); \ dct_wadd(x4, y0o, y4o); \ dct_wadd(x5, y1o, y5o); \ dct_wadd(x6, y2o, y5o); \ dct_wadd(x7, y3o, y4o); \ dct_bfly32o(row0,row7, x0,x7,bias,shift); \ dct_bfly32o(row1,row6, x1,x6,bias,shift); \ dct_bfly32o(row2,row5, x2,x5,bias,shift); \ dct_bfly32o(row3,row4, x3,x4,bias,shift); \ } __m128i rot0_0 = dct_const(stbi__f2f(0.5411961f), stbi__f2f(0.5411961f) + stbi__f2f(-1.847759065f)); __m128i rot0_1 = dct_const(stbi__f2f(0.5411961f) + stbi__f2f( 0.765366865f), stbi__f2f(0.5411961f)); __m128i rot1_0 = dct_const(stbi__f2f(1.175875602f) + stbi__f2f(-0.899976223f), stbi__f2f(1.175875602f)); __m128i rot1_1 = dct_const(stbi__f2f(1.175875602f), stbi__f2f(1.175875602f) + stbi__f2f(-2.562915447f)); __m128i rot2_0 = dct_const(stbi__f2f(-1.961570560f) + stbi__f2f( 0.298631336f), stbi__f2f(-1.961570560f)); __m128i rot2_1 = dct_const(stbi__f2f(-1.961570560f), stbi__f2f(-1.961570560f) + stbi__f2f( 3.072711026f)); __m128i rot3_0 = dct_const(stbi__f2f(-0.390180644f) + stbi__f2f( 2.053119869f), stbi__f2f(-0.390180644f)); __m128i rot3_1 = dct_const(stbi__f2f(-0.390180644f), stbi__f2f(-0.390180644f) + stbi__f2f( 1.501321110f)); // rounding biases in column/row passes, see stbi__idct_block for explanation. __m128i bias_0 = _mm_set1_epi32(512); __m128i bias_1 = _mm_set1_epi32(65536 + (128<<17)); // load row0 = _mm_load_si128((const __m128i *) (data + 0*8)); row1 = _mm_load_si128((const __m128i *) (data + 1*8)); row2 = _mm_load_si128((const __m128i *) (data + 2*8)); row3 = _mm_load_si128((const __m128i *) (data + 3*8)); row4 = _mm_load_si128((const __m128i *) (data + 4*8)); row5 = _mm_load_si128((const __m128i *) (data + 5*8)); row6 = _mm_load_si128((const __m128i *) (data + 6*8)); row7 = _mm_load_si128((const __m128i *) (data + 7*8)); // column pass dct_pass(bias_0, 10); { // 16bit 8x8 transpose pass 1 dct_interleave16(row0, row4); dct_interleave16(row1, row5); dct_interleave16(row2, row6); dct_interleave16(row3, row7); // transpose pass 2 dct_interleave16(row0, row2); dct_interleave16(row1, row3); dct_interleave16(row4, row6); dct_interleave16(row5, row7); // transpose pass 3 dct_interleave16(row0, row1); dct_interleave16(row2, row3); dct_interleave16(row4, row5); dct_interleave16(row6, row7); } // row pass dct_pass(bias_1, 17); { // pack __m128i p0 = _mm_packus_epi16(row0, row1); // a0a1a2a3...a7b0b1b2b3...b7 __m128i p1 = _mm_packus_epi16(row2, row3); __m128i p2 = _mm_packus_epi16(row4, row5); __m128i p3 = _mm_packus_epi16(row6, row7); // 8bit 8x8 transpose pass 1 dct_interleave8(p0, p2); // a0e0a1e1... dct_interleave8(p1, p3); // c0g0c1g1... // transpose pass 2 dct_interleave8(p0, p1); // a0c0e0g0... dct_interleave8(p2, p3); // b0d0f0h0... // transpose pass 3 dct_interleave8(p0, p2); // a0b0c0d0... dct_interleave8(p1, p3); // a4b4c4d4... // store _mm_storel_epi64((__m128i *) out, p0); out += out_stride; _mm_storel_epi64((__m128i *) out, _mm_shuffle_epi32(p0, 0x4e)); out += out_stride; _mm_storel_epi64((__m128i *) out, p2); out += out_stride; _mm_storel_epi64((__m128i *) out, _mm_shuffle_epi32(p2, 0x4e)); out += out_stride; _mm_storel_epi64((__m128i *) out, p1); out += out_stride; _mm_storel_epi64((__m128i *) out, _mm_shuffle_epi32(p1, 0x4e)); out += out_stride; _mm_storel_epi64((__m128i *) out, p3); out += out_stride; _mm_storel_epi64((__m128i *) out, _mm_shuffle_epi32(p3, 0x4e)); } #undef dct_const #undef dct_rot #undef dct_widen #undef dct_wadd #undef dct_wsub #undef dct_bfly32o #undef dct_interleave8 #undef dct_interleave16 #undef dct_pass } #endif // STBI_SSE2 #ifdef STBI_NEON // NEON integer IDCT. should produce bit-identical // results to the generic C version. static void stbi__idct_simd(stbi_uc *out, int out_stride, short data[64]) { int16x8_t row0, row1, row2, row3, row4, row5, row6, row7; int16x4_t rot0_0 = vdup_n_s16(stbi__f2f(0.5411961f)); int16x4_t rot0_1 = vdup_n_s16(stbi__f2f(-1.847759065f)); int16x4_t rot0_2 = vdup_n_s16(stbi__f2f( 0.765366865f)); int16x4_t rot1_0 = vdup_n_s16(stbi__f2f( 1.175875602f)); int16x4_t rot1_1 = vdup_n_s16(stbi__f2f(-0.899976223f)); int16x4_t rot1_2 = vdup_n_s16(stbi__f2f(-2.562915447f)); int16x4_t rot2_0 = vdup_n_s16(stbi__f2f(-1.961570560f)); int16x4_t rot2_1 = vdup_n_s16(stbi__f2f(-0.390180644f)); int16x4_t rot3_0 = vdup_n_s16(stbi__f2f( 0.298631336f)); int16x4_t rot3_1 = vdup_n_s16(stbi__f2f( 2.053119869f)); int16x4_t rot3_2 = vdup_n_s16(stbi__f2f( 3.072711026f)); int16x4_t rot3_3 = vdup_n_s16(stbi__f2f( 1.501321110f)); #define dct_long_mul(out, inq, coeff) \ int32x4_t out##_l = vmull_s16(vget_low_s16(inq), coeff); \ int32x4_t out##_h = vmull_s16(vget_high_s16(inq), coeff) #define dct_long_mac(out, acc, inq, coeff) \ int32x4_t out##_l = vmlal_s16(acc##_l, vget_low_s16(inq), coeff); \ int32x4_t out##_h = vmlal_s16(acc##_h, vget_high_s16(inq), coeff) #define dct_widen(out, inq) \ int32x4_t out##_l = vshll_n_s16(vget_low_s16(inq), 12); \ int32x4_t out##_h = vshll_n_s16(vget_high_s16(inq), 12) // wide add #define dct_wadd(out, a, b) \ int32x4_t out##_l = vaddq_s32(a##_l, b##_l); \ int32x4_t out##_h = vaddq_s32(a##_h, b##_h) // wide sub #define dct_wsub(out, a, b) \ int32x4_t out##_l = vsubq_s32(a##_l, b##_l); \ int32x4_t out##_h = vsubq_s32(a##_h, b##_h) // butterfly a/b, then shift using "shiftop" by "s" and pack #define dct_bfly32o(out0,out1, a,b,shiftop,s) \ { \ dct_wadd(sum, a, b); \ dct_wsub(dif, a, b); \ out0 = vcombine_s16(shiftop(sum_l, s), shiftop(sum_h, s)); \ out1 = vcombine_s16(shiftop(dif_l, s), shiftop(dif_h, s)); \ } #define dct_pass(shiftop, shift) \ { \ /* even part */ \ int16x8_t sum26 = vaddq_s16(row2, row6); \ dct_long_mul(p1e, sum26, rot0_0); \ dct_long_mac(t2e, p1e, row6, rot0_1); \ dct_long_mac(t3e, p1e, row2, rot0_2); \ int16x8_t sum04 = vaddq_s16(row0, row4); \ int16x8_t dif04 = vsubq_s16(row0, row4); \ dct_widen(t0e, sum04); \ dct_widen(t1e, dif04); \ dct_wadd(x0, t0e, t3e); \ dct_wsub(x3, t0e, t3e); \ dct_wadd(x1, t1e, t2e); \ dct_wsub(x2, t1e, t2e); \ /* odd part */ \ int16x8_t sum15 = vaddq_s16(row1, row5); \ int16x8_t sum17 = vaddq_s16(row1, row7); \ int16x8_t sum35 = vaddq_s16(row3, row5); \ int16x8_t sum37 = vaddq_s16(row3, row7); \ int16x8_t sumodd = vaddq_s16(sum17, sum35); \ dct_long_mul(p5o, sumodd, rot1_0); \ dct_long_mac(p1o, p5o, sum17, rot1_1); \ dct_long_mac(p2o, p5o, sum35, rot1_2); \ dct_long_mul(p3o, sum37, rot2_0); \ dct_long_mul(p4o, sum15, rot2_1); \ dct_wadd(sump13o, p1o, p3o); \ dct_wadd(sump24o, p2o, p4o); \ dct_wadd(sump23o, p2o, p3o); \ dct_wadd(sump14o, p1o, p4o); \ dct_long_mac(x4, sump13o, row7, rot3_0); \ dct_long_mac(x5, sump24o, row5, rot3_1); \ dct_long_mac(x6, sump23o, row3, rot3_2); \ dct_long_mac(x7, sump14o, row1, rot3_3); \ dct_bfly32o(row0,row7, x0,x7,shiftop,shift); \ dct_bfly32o(row1,row6, x1,x6,shiftop,shift); \ dct_bfly32o(row2,row5, x2,x5,shiftop,shift); \ dct_bfly32o(row3,row4, x3,x4,shiftop,shift); \ } // load row0 = vld1q_s16(data + 0*8); row1 = vld1q_s16(data + 1*8); row2 = vld1q_s16(data + 2*8); row3 = vld1q_s16(data + 3*8); row4 = vld1q_s16(data + 4*8); row5 = vld1q_s16(data + 5*8); row6 = vld1q_s16(data + 6*8); row7 = vld1q_s16(data + 7*8); // add DC bias row0 = vaddq_s16(row0, vsetq_lane_s16(1024, vdupq_n_s16(0), 0)); // column pass dct_pass(vrshrn_n_s32, 10); // 16bit 8x8 transpose { // these three map to a single VTRN.16, VTRN.32, and VSWP, respectively. // whether compilers actually get this is another story, sadly. #define dct_trn16(x, y) { int16x8x2_t t = vtrnq_s16(x, y); x = t.val[0]; y = t.val[1]; } #define dct_trn32(x, y) { int32x4x2_t t = vtrnq_s32(vreinterpretq_s32_s16(x), vreinterpretq_s32_s16(y)); x = vreinterpretq_s16_s32(t.val[0]); y = vreinterpretq_s16_s32(t.val[1]); } #define dct_trn64(x, y) { int16x8_t x0 = x; int16x8_t y0 = y; x = vcombine_s16(vget_low_s16(x0), vget_low_s16(y0)); y = vcombine_s16(vget_high_s16(x0), vget_high_s16(y0)); } // pass 1 dct_trn16(row0, row1); // a0b0a2b2a4b4a6b6 dct_trn16(row2, row3); dct_trn16(row4, row5); dct_trn16(row6, row7); // pass 2 dct_trn32(row0, row2); // a0b0c0d0a4b4c4d4 dct_trn32(row1, row3); dct_trn32(row4, row6); dct_trn32(row5, row7); // pass 3 dct_trn64(row0, row4); // a0b0c0d0e0f0g0h0 dct_trn64(row1, row5); dct_trn64(row2, row6); dct_trn64(row3, row7); #undef dct_trn16 #undef dct_trn32 #undef dct_trn64 } // row pass // vrshrn_n_s32 only supports shifts up to 16, we need // 17. so do a non-rounding shift of 16 first then follow // up with a rounding shift by 1. dct_pass(vshrn_n_s32, 16); { // pack and round uint8x8_t p0 = vqrshrun_n_s16(row0, 1); uint8x8_t p1 = vqrshrun_n_s16(row1, 1); uint8x8_t p2 = vqrshrun_n_s16(row2, 1); uint8x8_t p3 = vqrshrun_n_s16(row3, 1); uint8x8_t p4 = vqrshrun_n_s16(row4, 1); uint8x8_t p5 = vqrshrun_n_s16(row5, 1); uint8x8_t p6 = vqrshrun_n_s16(row6, 1); uint8x8_t p7 = vqrshrun_n_s16(row7, 1); // again, these can translate into one instruction, but often don't. #define dct_trn8_8(x, y) { uint8x8x2_t t = vtrn_u8(x, y); x = t.val[0]; y = t.val[1]; } #define dct_trn8_16(x, y) { uint16x4x2_t t = vtrn_u16(vreinterpret_u16_u8(x), vreinterpret_u16_u8(y)); x = vreinterpret_u8_u16(t.val[0]); y = vreinterpret_u8_u16(t.val[1]); } #define dct_trn8_32(x, y) { uint32x2x2_t t = vtrn_u32(vreinterpret_u32_u8(x), vreinterpret_u32_u8(y)); x = vreinterpret_u8_u32(t.val[0]); y = vreinterpret_u8_u32(t.val[1]); } // sadly can't use interleaved stores here since we only write // 8 bytes to each scan line! // 8x8 8-bit transpose pass 1 dct_trn8_8(p0, p1); dct_trn8_8(p2, p3); dct_trn8_8(p4, p5); dct_trn8_8(p6, p7); // pass 2 dct_trn8_16(p0, p2); dct_trn8_16(p1, p3); dct_trn8_16(p4, p6); dct_trn8_16(p5, p7); // pass 3 dct_trn8_32(p0, p4); dct_trn8_32(p1, p5); dct_trn8_32(p2, p6); dct_trn8_32(p3, p7); // store vst1_u8(out, p0); out += out_stride; vst1_u8(out, p1); out += out_stride; vst1_u8(out, p2); out += out_stride; vst1_u8(out, p3); out += out_stride; vst1_u8(out, p4); out += out_stride; vst1_u8(out, p5); out += out_stride; vst1_u8(out, p6); out += out_stride; vst1_u8(out, p7); #undef dct_trn8_8 #undef dct_trn8_16 #undef dct_trn8_32 } #undef dct_long_mul #undef dct_long_mac #undef dct_widen #undef dct_wadd #undef dct_wsub #undef dct_bfly32o #undef dct_pass } #endif // STBI_NEON #define STBI__MARKER_none 0xff // if there's a pending marker from the entropy stream, return that // otherwise, fetch from the stream and get a marker. if there's no // marker, return 0xff, which is never a valid marker value static stbi_uc stbi__get_marker(stbi__jpeg *j) { stbi_uc x; if (j->marker != STBI__MARKER_none) { x = j->marker; j->marker = STBI__MARKER_none; return x; } x = stbi__get8(j->s); if (x != 0xff) return STBI__MARKER_none; while (x == 0xff) x = stbi__get8(j->s); // consume repeated 0xff fill bytes return x; } // in each scan, we'll have scan_n components, and the order // of the components is specified by order[] #define STBI__RESTART(x) ((x) >= 0xd0 && (x) <= 0xd7) // after a restart interval, stbi__jpeg_reset the entropy decoder and // the dc prediction static void stbi__jpeg_reset(stbi__jpeg *j) { j->code_bits = 0; j->code_buffer = 0; j->nomore = 0; j->img_comp[0].dc_pred = j->img_comp[1].dc_pred = j->img_comp[2].dc_pred = j->img_comp[3].dc_pred = 0; j->marker = STBI__MARKER_none; j->todo = j->restart_interval ? j->restart_interval : 0x7fffffff; j->eob_run = 0; // no more than 1<<31 MCUs if no restart_interal? that's plenty safe, // since we don't even allow 1<<30 pixels } static int stbi__parse_entropy_coded_data(stbi__jpeg *z) { stbi__jpeg_reset(z); if (!z->progressive) { if (z->scan_n == 1) { int i,j; STBI_SIMD_ALIGN(short, data[64]); int n = z->order[0]; // non-interleaved data, we just need to process one block at a time, // in trivial scanline order // number of blocks to do just depends on how many actual "pixels" this // component has, independent of interleaved MCU blocking and such int w = (z->img_comp[n].x+7) >> 3; int h = (z->img_comp[n].y+7) >> 3; for (j=0; j < h; ++j) { for (i=0; i < w; ++i) { int ha = z->img_comp[n].ha; if (!stbi__jpeg_decode_block(z, data, z->huff_dc+z->img_comp[n].hd, z->huff_ac+ha, z->fast_ac[ha], n, z->dequant[z->img_comp[n].tq])) return 0; z->idct_block_kernel(z->img_comp[n].data+z->img_comp[n].w2*j*8+i*8, z->img_comp[n].w2, data); // every data block is an MCU, so countdown the restart interval if (--z->todo <= 0) { if (z->code_bits < 24) stbi__grow_buffer_unsafe(z); // if it's NOT a restart, then just bail, so we get corrupt data // rather than no data if (!STBI__RESTART(z->marker)) return 1; stbi__jpeg_reset(z); } } } return 1; } else { // interleaved int i,j,k,x,y; STBI_SIMD_ALIGN(short, data[64]); for (j=0; j < z->img_mcu_y; ++j) { for (i=0; i < z->img_mcu_x; ++i) { // scan an interleaved mcu... process scan_n components in order for (k=0; k < z->scan_n; ++k) { int n = z->order[k]; // scan out an mcu's worth of this component; that's just determined // by the basic H and V specified for the component for (y=0; y < z->img_comp[n].v; ++y) { for (x=0; x < z->img_comp[n].h; ++x) { int x2 = (i*z->img_comp[n].h + x)*8; int y2 = (j*z->img_comp[n].v + y)*8; int ha = z->img_comp[n].ha; if (!stbi__jpeg_decode_block(z, data, z->huff_dc+z->img_comp[n].hd, z->huff_ac+ha, z->fast_ac[ha], n, z->dequant[z->img_comp[n].tq])) return 0; z->idct_block_kernel(z->img_comp[n].data+z->img_comp[n].w2*y2+x2, z->img_comp[n].w2, data); } } } // after all interleaved components, that's an interleaved MCU, // so now count down the restart interval if (--z->todo <= 0) { if (z->code_bits < 24) stbi__grow_buffer_unsafe(z); if (!STBI__RESTART(z->marker)) return 1; stbi__jpeg_reset(z); } } } return 1; } } else { if (z->scan_n == 1) { int i,j; int n = z->order[0]; // non-interleaved data, we just need to process one block at a time, // in trivial scanline order // number of blocks to do just depends on how many actual "pixels" this // component has, independent of interleaved MCU blocking and such int w = (z->img_comp[n].x+7) >> 3; int h = (z->img_comp[n].y+7) >> 3; for (j=0; j < h; ++j) { for (i=0; i < w; ++i) { short *data = z->img_comp[n].coeff + 64 * (i + j * z->img_comp[n].coeff_w); if (z->spec_start == 0) { if (!stbi__jpeg_decode_block_prog_dc(z, data, &z->huff_dc[z->img_comp[n].hd], n)) return 0; } else { int ha = z->img_comp[n].ha; if (!stbi__jpeg_decode_block_prog_ac(z, data, &z->huff_ac[ha], z->fast_ac[ha])) return 0; } // every data block is an MCU, so countdown the restart interval if (--z->todo <= 0) { if (z->code_bits < 24) stbi__grow_buffer_unsafe(z); if (!STBI__RESTART(z->marker)) return 1; stbi__jpeg_reset(z); } } } return 1; } else { // interleaved int i,j,k,x,y; for (j=0; j < z->img_mcu_y; ++j) { for (i=0; i < z->img_mcu_x; ++i) { // scan an interleaved mcu... process scan_n components in order for (k=0; k < z->scan_n; ++k) { int n = z->order[k]; // scan out an mcu's worth of this component; that's just determined // by the basic H and V specified for the component for (y=0; y < z->img_comp[n].v; ++y) { for (x=0; x < z->img_comp[n].h; ++x) { int x2 = (i*z->img_comp[n].h + x); int y2 = (j*z->img_comp[n].v + y); short *data = z->img_comp[n].coeff + 64 * (x2 + y2 * z->img_comp[n].coeff_w); if (!stbi__jpeg_decode_block_prog_dc(z, data, &z->huff_dc[z->img_comp[n].hd], n)) return 0; } } } // after all interleaved components, that's an interleaved MCU, // so now count down the restart interval if (--z->todo <= 0) { if (z->code_bits < 24) stbi__grow_buffer_unsafe(z); if (!STBI__RESTART(z->marker)) return 1; stbi__jpeg_reset(z); } } } return 1; } } } static void stbi__jpeg_dequantize(short *data, stbi__uint16 *dequant) { int i; for (i=0; i < 64; ++i) data[i] *= dequant[i]; } static void stbi__jpeg_finish(stbi__jpeg *z) { if (z->progressive) { // dequantize and idct the data int i,j,n; for (n=0; n < z->s->img_n; ++n) { int w = (z->img_comp[n].x+7) >> 3; int h = (z->img_comp[n].y+7) >> 3; for (j=0; j < h; ++j) { for (i=0; i < w; ++i) { short *data = z->img_comp[n].coeff + 64 * (i + j * z->img_comp[n].coeff_w); stbi__jpeg_dequantize(data, z->dequant[z->img_comp[n].tq]); z->idct_block_kernel(z->img_comp[n].data+z->img_comp[n].w2*j*8+i*8, z->img_comp[n].w2, data); } } } } } static int stbi__process_marker(stbi__jpeg *z, int m) { int L; switch (m) { case STBI__MARKER_none: // no marker found return stbi__err("expected marker","Corrupt JPEG"); case 0xDD: // DRI - specify restart interval if (stbi__get16be(z->s) != 4) return stbi__err("bad DRI len","Corrupt JPEG"); z->restart_interval = stbi__get16be(z->s); return 1; case 0xDB: // DQT - define quantization table L = stbi__get16be(z->s)-2; while (L > 0) { int q = stbi__get8(z->s); int p = q >> 4, sixteen = (p != 0); int t = q & 15,i; if (p != 0 && p != 1) return stbi__err("bad DQT type","Corrupt JPEG"); if (t > 3) return stbi__err("bad DQT table","Corrupt JPEG"); for (i=0; i < 64; ++i) z->dequant[t][stbi__jpeg_dezigzag[i]] = (stbi__uint16)(sixteen ? stbi__get16be(z->s) : stbi__get8(z->s)); L -= (sixteen ? 129 : 65); } return L==0; case 0xC4: // DHT - define huffman table L = stbi__get16be(z->s)-2; while (L > 0) { stbi_uc *v; int sizes[16],i,n=0; int q = stbi__get8(z->s); int tc = q >> 4; int th = q & 15; if (tc > 1 || th > 3) return stbi__err("bad DHT header","Corrupt JPEG"); for (i=0; i < 16; ++i) { sizes[i] = stbi__get8(z->s); n += sizes[i]; } L -= 17; if (tc == 0) { if (!stbi__build_huffman(z->huff_dc+th, sizes)) return 0; v = z->huff_dc[th].values; } else { if (!stbi__build_huffman(z->huff_ac+th, sizes)) return 0; v = z->huff_ac[th].values; } for (i=0; i < n; ++i) v[i] = stbi__get8(z->s); if (tc != 0) stbi__build_fast_ac(z->fast_ac[th], z->huff_ac + th); L -= n; } return L==0; } // check for comment block or APP blocks if ((m >= 0xE0 && m <= 0xEF) || m == 0xFE) { L = stbi__get16be(z->s); if (L < 2) { if (m == 0xFE) return stbi__err("bad COM len","Corrupt JPEG"); else return stbi__err("bad APP len","Corrupt JPEG"); } L -= 2; if (m == 0xE0 && L >= 5) { // JFIF APP0 segment static const unsigned char tag[5] = {'J','F','I','F','\0'}; int ok = 1; int i; for (i=0; i < 5; ++i) if (stbi__get8(z->s) != tag[i]) ok = 0; L -= 5; if (ok) z->jfif = 1; } else if (m == 0xEE && L >= 12) { // Adobe APP14 segment static const unsigned char tag[6] = {'A','d','o','b','e','\0'}; int ok = 1; int i; for (i=0; i < 6; ++i) if (stbi__get8(z->s) != tag[i]) ok = 0; L -= 6; if (ok) { stbi__get8(z->s); // version stbi__get16be(z->s); // flags0 stbi__get16be(z->s); // flags1 z->app14_color_transform = stbi__get8(z->s); // color transform L -= 6; } } stbi__skip(z->s, L); return 1; } return stbi__err("unknown marker","Corrupt JPEG"); } // after we see SOS static int stbi__process_scan_header(stbi__jpeg *z) { int i; int Ls = stbi__get16be(z->s); z->scan_n = stbi__get8(z->s); if (z->scan_n < 1 || z->scan_n > 4 || z->scan_n > (int) z->s->img_n) return stbi__err("bad SOS component count","Corrupt JPEG"); if (Ls != 6+2*z->scan_n) return stbi__err("bad SOS len","Corrupt JPEG"); for (i=0; i < z->scan_n; ++i) { int id = stbi__get8(z->s), which; int q = stbi__get8(z->s); for (which = 0; which < z->s->img_n; ++which) if (z->img_comp[which].id == id) break; if (which == z->s->img_n) return 0; // no match z->img_comp[which].hd = q >> 4; if (z->img_comp[which].hd > 3) return stbi__err("bad DC huff","Corrupt JPEG"); z->img_comp[which].ha = q & 15; if (z->img_comp[which].ha > 3) return stbi__err("bad AC huff","Corrupt JPEG"); z->order[i] = which; } { int aa; z->spec_start = stbi__get8(z->s); z->spec_end = stbi__get8(z->s); // should be 63, but might be 0 aa = stbi__get8(z->s); z->succ_high = (aa >> 4); z->succ_low = (aa & 15); if (z->progressive) { if (z->spec_start > 63 || z->spec_end > 63 || z->spec_start > z->spec_end || z->succ_high > 13 || z->succ_low > 13) return stbi__err("bad SOS", "Corrupt JPEG"); } else { if (z->spec_start != 0) return stbi__err("bad SOS","Corrupt JPEG"); if (z->succ_high != 0 || z->succ_low != 0) return stbi__err("bad SOS","Corrupt JPEG"); z->spec_end = 63; } } return 1; } static int stbi__free_jpeg_components(stbi__jpeg *z, int ncomp, int why) { int i; for (i=0; i < ncomp; ++i) { if (z->img_comp[i].raw_data) { STBI_FREE(z->img_comp[i].raw_data); z->img_comp[i].raw_data = NULL; z->img_comp[i].data = NULL; } if (z->img_comp[i].raw_coeff) { STBI_FREE(z->img_comp[i].raw_coeff); z->img_comp[i].raw_coeff = 0; z->img_comp[i].coeff = 0; } if (z->img_comp[i].linebuf) { STBI_FREE(z->img_comp[i].linebuf); z->img_comp[i].linebuf = NULL; } } return why; } static int stbi__process_frame_header(stbi__jpeg *z, int scan) { stbi__context *s = z->s; int Lf,p,i,q, h_max=1,v_max=1,c; Lf = stbi__get16be(s); if (Lf < 11) return stbi__err("bad SOF len","Corrupt JPEG"); // JPEG p = stbi__get8(s); if (p != 8) return stbi__err("only 8-bit","JPEG format not supported: 8-bit only"); // JPEG baseline s->img_y = stbi__get16be(s); if (s->img_y == 0) return stbi__err("no header height", "JPEG format not supported: delayed height"); // Legal, but we don't handle it--but neither does IJG s->img_x = stbi__get16be(s); if (s->img_x == 0) return stbi__err("0 width","Corrupt JPEG"); // JPEG requires c = stbi__get8(s); if (c != 3 && c != 1 && c != 4) return stbi__err("bad component count","Corrupt JPEG"); s->img_n = c; for (i=0; i < c; ++i) { z->img_comp[i].data = NULL; z->img_comp[i].linebuf = NULL; } if (Lf != 8+3*s->img_n) return stbi__err("bad SOF len","Corrupt JPEG"); z->rgb = 0; for (i=0; i < s->img_n; ++i) { static unsigned char rgb[3] = { 'R', 'G', 'B' }; z->img_comp[i].id = stbi__get8(s); if (s->img_n == 3 && z->img_comp[i].id == rgb[i]) ++z->rgb; q = stbi__get8(s); z->img_comp[i].h = (q >> 4); if (!z->img_comp[i].h || z->img_comp[i].h > 4) return stbi__err("bad H","Corrupt JPEG"); z->img_comp[i].v = q & 15; if (!z->img_comp[i].v || z->img_comp[i].v > 4) return stbi__err("bad V","Corrupt JPEG"); z->img_comp[i].tq = stbi__get8(s); if (z->img_comp[i].tq > 3) return stbi__err("bad TQ","Corrupt JPEG"); } if (scan != STBI__SCAN_load) return 1; if (!stbi__mad3sizes_valid(s->img_x, s->img_y, s->img_n, 0)) return stbi__err("too large", "Image too large to decode"); for (i=0; i < s->img_n; ++i) { if (z->img_comp[i].h > h_max) h_max = z->img_comp[i].h; if (z->img_comp[i].v > v_max) v_max = z->img_comp[i].v; } // compute interleaved mcu info z->img_h_max = h_max; z->img_v_max = v_max; z->img_mcu_w = h_max * 8; z->img_mcu_h = v_max * 8; // these sizes can't be more than 17 bits z->img_mcu_x = (s->img_x + z->img_mcu_w-1) / z->img_mcu_w; z->img_mcu_y = (s->img_y + z->img_mcu_h-1) / z->img_mcu_h; for (i=0; i < s->img_n; ++i) { // number of effective pixels (e.g. for non-interleaved MCU) z->img_comp[i].x = (s->img_x * z->img_comp[i].h + h_max-1) / h_max; z->img_comp[i].y = (s->img_y * z->img_comp[i].v + v_max-1) / v_max; // to simplify generation, we'll allocate enough memory to decode // the bogus oversized data from using interleaved MCUs and their // big blocks (e.g. a 16x16 iMCU on an image of width 33); we won't // discard the extra data until colorspace conversion // // img_mcu_x, img_mcu_y: <=17 bits; comp[i].h and .v are <=4 (checked earlier) // so these muls can't overflow with 32-bit ints (which we require) z->img_comp[i].w2 = z->img_mcu_x * z->img_comp[i].h * 8; z->img_comp[i].h2 = z->img_mcu_y * z->img_comp[i].v * 8; z->img_comp[i].coeff = 0; z->img_comp[i].raw_coeff = 0; z->img_comp[i].linebuf = NULL; z->img_comp[i].raw_data = stbi__malloc_mad2(z->img_comp[i].w2, z->img_comp[i].h2, 15); if (z->img_comp[i].raw_data == NULL) return stbi__free_jpeg_components(z, i+1, stbi__err("outofmem", "Out of memory")); // align blocks for idct using mmx/sse z->img_comp[i].data = (stbi_uc*) (((size_t) z->img_comp[i].raw_data + 15) & ~15); if (z->progressive) { // w2, h2 are multiples of 8 (see above) z->img_comp[i].coeff_w = z->img_comp[i].w2 / 8; z->img_comp[i].coeff_h = z->img_comp[i].h2 / 8; z->img_comp[i].raw_coeff = stbi__malloc_mad3(z->img_comp[i].w2, z->img_comp[i].h2, sizeof(short), 15); if (z->img_comp[i].raw_coeff == NULL) return stbi__free_jpeg_components(z, i+1, stbi__err("outofmem", "Out of memory")); z->img_comp[i].coeff = (short*) (((size_t) z->img_comp[i].raw_coeff + 15) & ~15); } } return 1; } // use comparisons since in some cases we handle more than one case (e.g. SOF) #define stbi__DNL(x) ((x) == 0xdc) #define stbi__SOI(x) ((x) == 0xd8) #define stbi__EOI(x) ((x) == 0xd9) #define stbi__SOF(x) ((x) == 0xc0 || (x) == 0xc1 || (x) == 0xc2) #define stbi__SOS(x) ((x) == 0xda) #define stbi__SOF_progressive(x) ((x) == 0xc2) static int stbi__decode_jpeg_header(stbi__jpeg *z, int scan) { int m; z->jfif = 0; z->app14_color_transform = -1; // valid values are 0,1,2 z->marker = STBI__MARKER_none; // initialize cached marker to empty m = stbi__get_marker(z); if (!stbi__SOI(m)) return stbi__err("no SOI","Corrupt JPEG"); if (scan == STBI__SCAN_type) return 1; m = stbi__get_marker(z); while (!stbi__SOF(m)) { if (!stbi__process_marker(z,m)) return 0; m = stbi__get_marker(z); while (m == STBI__MARKER_none) { // some files have extra padding after their blocks, so ok, we'll scan if (stbi__at_eof(z->s)) return stbi__err("no SOF", "Corrupt JPEG"); m = stbi__get_marker(z); } } z->progressive = stbi__SOF_progressive(m); if (!stbi__process_frame_header(z, scan)) return 0; return 1; } // decode image to YCbCr format static int stbi__decode_jpeg_image(stbi__jpeg *j) { int m; for (m = 0; m < 4; m++) { j->img_comp[m].raw_data = NULL; j->img_comp[m].raw_coeff = NULL; } j->restart_interval = 0; if (!stbi__decode_jpeg_header(j, STBI__SCAN_load)) return 0; m = stbi__get_marker(j); while (!stbi__EOI(m)) { if (stbi__SOS(m)) { if (!stbi__process_scan_header(j)) return 0; if (!stbi__parse_entropy_coded_data(j)) return 0; if (j->marker == STBI__MARKER_none ) { // handle 0s at the end of image data from IP Kamera 9060 while (!stbi__at_eof(j->s)) { int x = stbi__get8(j->s); if (x == 255) { j->marker = stbi__get8(j->s); break; } } // if we reach eof without hitting a marker, stbi__get_marker() below will fail and we'll eventually return 0 } } else if (stbi__DNL(m)) { int Ld = stbi__get16be(j->s); stbi__uint32 NL = stbi__get16be(j->s); if (Ld != 4) stbi__err("bad DNL len", "Corrupt JPEG"); if (NL != j->s->img_y) stbi__err("bad DNL height", "Corrupt JPEG"); } else { if (!stbi__process_marker(j, m)) return 0; } m = stbi__get_marker(j); } if (j->progressive) stbi__jpeg_finish(j); return 1; } // static jfif-centered resampling (across block boundaries) typedef stbi_uc *(*resample_row_func)(stbi_uc *out, stbi_uc *in0, stbi_uc *in1, int w, int hs); #define stbi__div4(x) ((stbi_uc) ((x) >> 2)) static stbi_uc *resample_row_1(stbi_uc *out, stbi_uc *in_near, stbi_uc *in_far, int w, int hs) { STBI_NOTUSED(out); STBI_NOTUSED(in_far); STBI_NOTUSED(w); STBI_NOTUSED(hs); return in_near; } static stbi_uc* stbi__resample_row_v_2(stbi_uc *out, stbi_uc *in_near, stbi_uc *in_far, int w, int hs) { // need to generate two samples vertically for every one in input int i; STBI_NOTUSED(hs); for (i=0; i < w; ++i) out[i] = stbi__div4(3*in_near[i] + in_far[i] + 2); return out; } static stbi_uc* stbi__resample_row_h_2(stbi_uc *out, stbi_uc *in_near, stbi_uc *in_far, int w, int hs) { // need to generate two samples horizontally for every one in input int i; stbi_uc *input = in_near; if (w == 1) { // if only one sample, can't do any interpolation out[0] = out[1] = input[0]; return out; } out[0] = input[0]; out[1] = stbi__div4(input[0]*3 + input[1] + 2); for (i=1; i < w-1; ++i) { int n = 3*input[i]+2; out[i*2+0] = stbi__div4(n+input[i-1]); out[i*2+1] = stbi__div4(n+input[i+1]); } out[i*2+0] = stbi__div4(input[w-2]*3 + input[w-1] + 2); out[i*2+1] = input[w-1]; STBI_NOTUSED(in_far); STBI_NOTUSED(hs); return out; } #define stbi__div16(x) ((stbi_uc) ((x) >> 4)) static stbi_uc *stbi__resample_row_hv_2(stbi_uc *out, stbi_uc *in_near, stbi_uc *in_far, int w, int hs) { // need to generate 2x2 samples for every one in input int i,t0,t1; if (w == 1) { out[0] = out[1] = stbi__div4(3*in_near[0] + in_far[0] + 2); return out; } t1 = 3*in_near[0] + in_far[0]; out[0] = stbi__div4(t1+2); for (i=1; i < w; ++i) { t0 = t1; t1 = 3*in_near[i]+in_far[i]; out[i*2-1] = stbi__div16(3*t0 + t1 + 8); out[i*2 ] = stbi__div16(3*t1 + t0 + 8); } out[w*2-1] = stbi__div4(t1+2); STBI_NOTUSED(hs); return out; } #if defined(STBI_SSE2) || defined(STBI_NEON) static stbi_uc *stbi__resample_row_hv_2_simd(stbi_uc *out, stbi_uc *in_near, stbi_uc *in_far, int w, int hs) { // need to generate 2x2 samples for every one in input int i=0,t0,t1; if (w == 1) { out[0] = out[1] = stbi__div4(3*in_near[0] + in_far[0] + 2); return out; } t1 = 3*in_near[0] + in_far[0]; // process groups of 8 pixels for as long as we can. // note we can't handle the last pixel in a row in this loop // because we need to handle the filter boundary conditions. for (; i < ((w-1) & ~7); i += 8) { #if defined(STBI_SSE2) // load and perform the vertical filtering pass // this uses 3*x + y = 4*x + (y - x) __m128i zero = _mm_setzero_si128(); __m128i farb = _mm_loadl_epi64((__m128i *) (in_far + i)); __m128i nearb = _mm_loadl_epi64((__m128i *) (in_near + i)); __m128i farw = _mm_unpacklo_epi8(farb, zero); __m128i nearw = _mm_unpacklo_epi8(nearb, zero); __m128i diff = _mm_sub_epi16(farw, nearw); __m128i nears = _mm_slli_epi16(nearw, 2); __m128i curr = _mm_add_epi16(nears, diff); // current row // horizontal filter works the same based on shifted vers of current // row. "prev" is current row shifted right by 1 pixel; we need to // insert the previous pixel value (from t1). // "next" is current row shifted left by 1 pixel, with first pixel // of next block of 8 pixels added in. __m128i prv0 = _mm_slli_si128(curr, 2); __m128i nxt0 = _mm_srli_si128(curr, 2); __m128i prev = _mm_insert_epi16(prv0, t1, 0); __m128i next = _mm_insert_epi16(nxt0, 3*in_near[i+8] + in_far[i+8], 7); // horizontal filter, polyphase implementation since it's convenient: // even pixels = 3*cur + prev = cur*4 + (prev - cur) // odd pixels = 3*cur + next = cur*4 + (next - cur) // note the shared term. __m128i bias = _mm_set1_epi16(8); __m128i curs = _mm_slli_epi16(curr, 2); __m128i prvd = _mm_sub_epi16(prev, curr); __m128i nxtd = _mm_sub_epi16(next, curr); __m128i curb = _mm_add_epi16(curs, bias); __m128i even = _mm_add_epi16(prvd, curb); __m128i odd = _mm_add_epi16(nxtd, curb); // interleave even and odd pixels, then undo scaling. __m128i int0 = _mm_unpacklo_epi16(even, odd); __m128i int1 = _mm_unpackhi_epi16(even, odd); __m128i de0 = _mm_srli_epi16(int0, 4); __m128i de1 = _mm_srli_epi16(int1, 4); // pack and write output __m128i outv = _mm_packus_epi16(de0, de1); _mm_storeu_si128((__m128i *) (out + i*2), outv); #elif defined(STBI_NEON) // load and perform the vertical filtering pass // this uses 3*x + y = 4*x + (y - x) uint8x8_t farb = vld1_u8(in_far + i); uint8x8_t nearb = vld1_u8(in_near + i); int16x8_t diff = vreinterpretq_s16_u16(vsubl_u8(farb, nearb)); int16x8_t nears = vreinterpretq_s16_u16(vshll_n_u8(nearb, 2)); int16x8_t curr = vaddq_s16(nears, diff); // current row // horizontal filter works the same based on shifted vers of current // row. "prev" is current row shifted right by 1 pixel; we need to // insert the previous pixel value (from t1). // "next" is current row shifted left by 1 pixel, with first pixel // of next block of 8 pixels added in. int16x8_t prv0 = vextq_s16(curr, curr, 7); int16x8_t nxt0 = vextq_s16(curr, curr, 1); int16x8_t prev = vsetq_lane_s16(t1, prv0, 0); int16x8_t next = vsetq_lane_s16(3*in_near[i+8] + in_far[i+8], nxt0, 7); // horizontal filter, polyphase implementation since it's convenient: // even pixels = 3*cur + prev = cur*4 + (prev - cur) // odd pixels = 3*cur + next = cur*4 + (next - cur) // note the shared term. int16x8_t curs = vshlq_n_s16(curr, 2); int16x8_t prvd = vsubq_s16(prev, curr); int16x8_t nxtd = vsubq_s16(next, curr); int16x8_t even = vaddq_s16(curs, prvd); int16x8_t odd = vaddq_s16(curs, nxtd); // undo scaling and round, then store with even/odd phases interleaved uint8x8x2_t o; o.val[0] = vqrshrun_n_s16(even, 4); o.val[1] = vqrshrun_n_s16(odd, 4); vst2_u8(out + i*2, o); #endif // "previous" value for next iter t1 = 3*in_near[i+7] + in_far[i+7]; } t0 = t1; t1 = 3*in_near[i] + in_far[i]; out[i*2] = stbi__div16(3*t1 + t0 + 8); for (++i; i < w; ++i) { t0 = t1; t1 = 3*in_near[i]+in_far[i]; out[i*2-1] = stbi__div16(3*t0 + t1 + 8); out[i*2 ] = stbi__div16(3*t1 + t0 + 8); } out[w*2-1] = stbi__div4(t1+2); STBI_NOTUSED(hs); return out; } #endif static stbi_uc *stbi__resample_row_generic(stbi_uc *out, stbi_uc *in_near, stbi_uc *in_far, int w, int hs) { // resample with nearest-neighbor int i,j; STBI_NOTUSED(in_far); for (i=0; i < w; ++i) for (j=0; j < hs; ++j) out[i*hs+j] = in_near[i]; return out; } // this is a reduced-precision calculation of YCbCr-to-RGB introduced // to make sure the code produces the same results in both SIMD and scalar #define stbi__float2fixed(x) (((int) ((x) * 4096.0f + 0.5f)) << 8) static void stbi__YCbCr_to_RGB_row(stbi_uc *out, const stbi_uc *y, const stbi_uc *pcb, const stbi_uc *pcr, int count, int step) { int i; for (i=0; i < count; ++i) { int y_fixed = (y[i] << 20) + (1<<19); // rounding int r,g,b; int cr = pcr[i] - 128; int cb = pcb[i] - 128; r = y_fixed + cr* stbi__float2fixed(1.40200f); g = y_fixed + (cr*-stbi__float2fixed(0.71414f)) + ((cb*-stbi__float2fixed(0.34414f)) & 0xffff0000); b = y_fixed + cb* stbi__float2fixed(1.77200f); r >>= 20; g >>= 20; b >>= 20; if ((unsigned) r > 255) { if (r < 0) r = 0; else r = 255; } if ((unsigned) g > 255) { if (g < 0) g = 0; else g = 255; } if ((unsigned) b > 255) { if (b < 0) b = 0; else b = 255; } out[0] = (stbi_uc)r; out[1] = (stbi_uc)g; out[2] = (stbi_uc)b; out[3] = 255; out += step; } } #if defined(STBI_SSE2) || defined(STBI_NEON) static void stbi__YCbCr_to_RGB_simd(stbi_uc *out, stbi_uc const *y, stbi_uc const *pcb, stbi_uc const *pcr, int count, int step) { int i = 0; #ifdef STBI_SSE2 // step == 3 is pretty ugly on the final interleave, and i'm not convinced // it's useful in practice (you wouldn't use it for textures, for example). // so just accelerate step == 4 case. if (step == 4) { // this is a fairly straightforward implementation and not super-optimized. __m128i signflip = _mm_set1_epi8(-0x80); __m128i cr_const0 = _mm_set1_epi16( (short) ( 1.40200f*4096.0f+0.5f)); __m128i cr_const1 = _mm_set1_epi16( - (short) ( 0.71414f*4096.0f+0.5f)); __m128i cb_const0 = _mm_set1_epi16( - (short) ( 0.34414f*4096.0f+0.5f)); __m128i cb_const1 = _mm_set1_epi16( (short) ( 1.77200f*4096.0f+0.5f)); __m128i y_bias = _mm_set1_epi8((char) (unsigned char) 128); __m128i xw = _mm_set1_epi16(255); // alpha channel for (; i+7 < count; i += 8) { // load __m128i y_bytes = _mm_loadl_epi64((__m128i *) (y+i)); __m128i cr_bytes = _mm_loadl_epi64((__m128i *) (pcr+i)); __m128i cb_bytes = _mm_loadl_epi64((__m128i *) (pcb+i)); __m128i cr_biased = _mm_xor_si128(cr_bytes, signflip); // -128 __m128i cb_biased = _mm_xor_si128(cb_bytes, signflip); // -128 // unpack to short (and left-shift cr, cb by 8) __m128i yw = _mm_unpacklo_epi8(y_bias, y_bytes); __m128i crw = _mm_unpacklo_epi8(_mm_setzero_si128(), cr_biased); __m128i cbw = _mm_unpacklo_epi8(_mm_setzero_si128(), cb_biased); // color transform __m128i yws = _mm_srli_epi16(yw, 4); __m128i cr0 = _mm_mulhi_epi16(cr_const0, crw); __m128i cb0 = _mm_mulhi_epi16(cb_const0, cbw); __m128i cb1 = _mm_mulhi_epi16(cbw, cb_const1); __m128i cr1 = _mm_mulhi_epi16(crw, cr_const1); __m128i rws = _mm_add_epi16(cr0, yws); __m128i gwt = _mm_add_epi16(cb0, yws); __m128i bws = _mm_add_epi16(yws, cb1); __m128i gws = _mm_add_epi16(gwt, cr1); // descale __m128i rw = _mm_srai_epi16(rws, 4); __m128i bw = _mm_srai_epi16(bws, 4); __m128i gw = _mm_srai_epi16(gws, 4); // back to byte, set up for transpose __m128i brb = _mm_packus_epi16(rw, bw); __m128i gxb = _mm_packus_epi16(gw, xw); // transpose to interleave channels __m128i t0 = _mm_unpacklo_epi8(brb, gxb); __m128i t1 = _mm_unpackhi_epi8(brb, gxb); __m128i o0 = _mm_unpacklo_epi16(t0, t1); __m128i o1 = _mm_unpackhi_epi16(t0, t1); // store _mm_storeu_si128((__m128i *) (out + 0), o0); _mm_storeu_si128((__m128i *) (out + 16), o1); out += 32; } } #endif #ifdef STBI_NEON // in this version, step=3 support would be easy to add. but is there demand? if (step == 4) { // this is a fairly straightforward implementation and not super-optimized. uint8x8_t signflip = vdup_n_u8(0x80); int16x8_t cr_const0 = vdupq_n_s16( (short) ( 1.40200f*4096.0f+0.5f)); int16x8_t cr_const1 = vdupq_n_s16( - (short) ( 0.71414f*4096.0f+0.5f)); int16x8_t cb_const0 = vdupq_n_s16( - (short) ( 0.34414f*4096.0f+0.5f)); int16x8_t cb_const1 = vdupq_n_s16( (short) ( 1.77200f*4096.0f+0.5f)); for (; i+7 < count; i += 8) { // load uint8x8_t y_bytes = vld1_u8(y + i); uint8x8_t cr_bytes = vld1_u8(pcr + i); uint8x8_t cb_bytes = vld1_u8(pcb + i); int8x8_t cr_biased = vreinterpret_s8_u8(vsub_u8(cr_bytes, signflip)); int8x8_t cb_biased = vreinterpret_s8_u8(vsub_u8(cb_bytes, signflip)); // expand to s16 int16x8_t yws = vreinterpretq_s16_u16(vshll_n_u8(y_bytes, 4)); int16x8_t crw = vshll_n_s8(cr_biased, 7); int16x8_t cbw = vshll_n_s8(cb_biased, 7); // color transform int16x8_t cr0 = vqdmulhq_s16(crw, cr_const0); int16x8_t cb0 = vqdmulhq_s16(cbw, cb_const0); int16x8_t cr1 = vqdmulhq_s16(crw, cr_const1); int16x8_t cb1 = vqdmulhq_s16(cbw, cb_const1); int16x8_t rws = vaddq_s16(yws, cr0); int16x8_t gws = vaddq_s16(vaddq_s16(yws, cb0), cr1); int16x8_t bws = vaddq_s16(yws, cb1); // undo scaling, round, convert to byte uint8x8x4_t o; o.val[0] = vqrshrun_n_s16(rws, 4); o.val[1] = vqrshrun_n_s16(gws, 4); o.val[2] = vqrshrun_n_s16(bws, 4); o.val[3] = vdup_n_u8(255); // store, interleaving r/g/b/a vst4_u8(out, o); out += 8*4; } } #endif for (; i < count; ++i) { int y_fixed = (y[i] << 20) + (1<<19); // rounding int r,g,b; int cr = pcr[i] - 128; int cb = pcb[i] - 128; r = y_fixed + cr* stbi__float2fixed(1.40200f); g = y_fixed + cr*-stbi__float2fixed(0.71414f) + ((cb*-stbi__float2fixed(0.34414f)) & 0xffff0000); b = y_fixed + cb* stbi__float2fixed(1.77200f); r >>= 20; g >>= 20; b >>= 20; if ((unsigned) r > 255) { if (r < 0) r = 0; else r = 255; } if ((unsigned) g > 255) { if (g < 0) g = 0; else g = 255; } if ((unsigned) b > 255) { if (b < 0) b = 0; else b = 255; } out[0] = (stbi_uc)r; out[1] = (stbi_uc)g; out[2] = (stbi_uc)b; out[3] = 255; out += step; } } #endif // set up the kernels static void stbi__setup_jpeg(stbi__jpeg *j) { j->idct_block_kernel = stbi__idct_block; j->YCbCr_to_RGB_kernel = stbi__YCbCr_to_RGB_row; j->resample_row_hv_2_kernel = stbi__resample_row_hv_2; #ifdef STBI_SSE2 if (stbi__sse2_available()) { j->idct_block_kernel = stbi__idct_simd; j->YCbCr_to_RGB_kernel = stbi__YCbCr_to_RGB_simd; j->resample_row_hv_2_kernel = stbi__resample_row_hv_2_simd; } #endif #ifdef STBI_NEON j->idct_block_kernel = stbi__idct_simd; j->YCbCr_to_RGB_kernel = stbi__YCbCr_to_RGB_simd; j->resample_row_hv_2_kernel = stbi__resample_row_hv_2_simd; #endif } // clean up the temporary component buffers static void stbi__cleanup_jpeg(stbi__jpeg *j) { stbi__free_jpeg_components(j, j->s->img_n, 0); } typedef struct { resample_row_func resample; stbi_uc *line0,*line1; int hs,vs; // expansion factor in each axis int w_lores; // horizontal pixels pre-expansion int ystep; // how far through vertical expansion we are int ypos; // which pre-expansion row we're on } stbi__resample; // fast 0..255 * 0..255 => 0..255 rounded multiplication static stbi_uc stbi__blinn_8x8(stbi_uc x, stbi_uc y) { unsigned int t = x*y + 128; return (stbi_uc) ((t + (t >>8)) >> 8); } static stbi_uc *load_jpeg_image(stbi__jpeg *z, int *out_x, int *out_y, int *comp, int req_comp) { int n, decode_n, is_rgb; z->s->img_n = 0; // make stbi__cleanup_jpeg safe // validate req_comp if (req_comp < 0 || req_comp > 4) return stbi__errpuc("bad req_comp", "Internal error"); // load a jpeg image from whichever source, but leave in YCbCr format if (!stbi__decode_jpeg_image(z)) { stbi__cleanup_jpeg(z); return NULL; } // determine actual number of components to generate n = req_comp ? req_comp : z->s->img_n >= 3 ? 3 : 1; is_rgb = z->s->img_n == 3 && (z->rgb == 3 || (z->app14_color_transform == 0 && !z->jfif)); if (z->s->img_n == 3 && n < 3 && !is_rgb) decode_n = 1; else decode_n = z->s->img_n; // resample and color-convert { int k; unsigned int i,j; stbi_uc *output; stbi_uc *coutput[4]; stbi__resample res_comp[4]; for (k=0; k < decode_n; ++k) { stbi__resample *r = &res_comp[k]; // allocate line buffer big enough for upsampling off the edges // with upsample factor of 4 z->img_comp[k].linebuf = (stbi_uc *) stbi__malloc(z->s->img_x + 3); if (!z->img_comp[k].linebuf) { stbi__cleanup_jpeg(z); return stbi__errpuc("outofmem", "Out of memory"); } r->hs = z->img_h_max / z->img_comp[k].h; r->vs = z->img_v_max / z->img_comp[k].v; r->ystep = r->vs >> 1; r->w_lores = (z->s->img_x + r->hs-1) / r->hs; r->ypos = 0; r->line0 = r->line1 = z->img_comp[k].data; if (r->hs == 1 && r->vs == 1) r->resample = resample_row_1; else if (r->hs == 1 && r->vs == 2) r->resample = stbi__resample_row_v_2; else if (r->hs == 2 && r->vs == 1) r->resample = stbi__resample_row_h_2; else if (r->hs == 2 && r->vs == 2) r->resample = z->resample_row_hv_2_kernel; else r->resample = stbi__resample_row_generic; } // can't error after this so, this is safe output = (stbi_uc *) stbi__malloc_mad3(n, z->s->img_x, z->s->img_y, 1); if (!output) { stbi__cleanup_jpeg(z); return stbi__errpuc("outofmem", "Out of memory"); } // now go ahead and resample for (j=0; j < z->s->img_y; ++j) { stbi_uc *out = output + n * z->s->img_x * j; for (k=0; k < decode_n; ++k) { stbi__resample *r = &res_comp[k]; int y_bot = r->ystep >= (r->vs >> 1); coutput[k] = r->resample(z->img_comp[k].linebuf, y_bot ? r->line1 : r->line0, y_bot ? r->line0 : r->line1, r->w_lores, r->hs); if (++r->ystep >= r->vs) { r->ystep = 0; r->line0 = r->line1; if (++r->ypos < z->img_comp[k].y) r->line1 += z->img_comp[k].w2; } } if (n >= 3) { stbi_uc *y = coutput[0]; if (z->s->img_n == 3) { if (is_rgb) { for (i=0; i < z->s->img_x; ++i) { out[0] = y[i]; out[1] = coutput[1][i]; out[2] = coutput[2][i]; out[3] = 255; out += n; } } else { z->YCbCr_to_RGB_kernel(out, y, coutput[1], coutput[2], z->s->img_x, n); } } else if (z->s->img_n == 4) { if (z->app14_color_transform == 0) { // CMYK for (i=0; i < z->s->img_x; ++i) { stbi_uc m = coutput[3][i]; out[0] = stbi__blinn_8x8(coutput[0][i], m); out[1] = stbi__blinn_8x8(coutput[1][i], m); out[2] = stbi__blinn_8x8(coutput[2][i], m); out[3] = 255; out += n; } } else if (z->app14_color_transform == 2) { // YCCK z->YCbCr_to_RGB_kernel(out, y, coutput[1], coutput[2], z->s->img_x, n); for (i=0; i < z->s->img_x; ++i) { stbi_uc m = coutput[3][i]; out[0] = stbi__blinn_8x8(255 - out[0], m); out[1] = stbi__blinn_8x8(255 - out[1], m); out[2] = stbi__blinn_8x8(255 - out[2], m); out += n; } } else { // YCbCr + alpha? Ignore the fourth channel for now z->YCbCr_to_RGB_kernel(out, y, coutput[1], coutput[2], z->s->img_x, n); } } else for (i=0; i < z->s->img_x; ++i) { out[0] = out[1] = out[2] = y[i]; out[3] = 255; // not used if n==3 out += n; } } else { if (is_rgb) { if (n == 1) for (i=0; i < z->s->img_x; ++i) *out++ = stbi__compute_y(coutput[0][i], coutput[1][i], coutput[2][i]); else { for (i=0; i < z->s->img_x; ++i, out += 2) { out[0] = stbi__compute_y(coutput[0][i], coutput[1][i], coutput[2][i]); out[1] = 255; } } } else if (z->s->img_n == 4 && z->app14_color_transform == 0) { for (i=0; i < z->s->img_x; ++i) { stbi_uc m = coutput[3][i]; stbi_uc r = stbi__blinn_8x8(coutput[0][i], m); stbi_uc g = stbi__blinn_8x8(coutput[1][i], m); stbi_uc b = stbi__blinn_8x8(coutput[2][i], m); out[0] = stbi__compute_y(r, g, b); out[1] = 255; out += n; } } else if (z->s->img_n == 4 && z->app14_color_transform == 2) { for (i=0; i < z->s->img_x; ++i) { out[0] = stbi__blinn_8x8(255 - coutput[0][i], coutput[3][i]); out[1] = 255; out += n; } } else { stbi_uc *y = coutput[0]; if (n == 1) for (i=0; i < z->s->img_x; ++i) out[i] = y[i]; else for (i=0; i < z->s->img_x; ++i) *out++ = y[i], *out++ = 255; } } } stbi__cleanup_jpeg(z); *out_x = z->s->img_x; *out_y = z->s->img_y; if (comp) *comp = z->s->img_n >= 3 ? 3 : 1; // report original components, not output return output; } } static void *stbi__jpeg_load(stbi__context *s, int *x, int *y, int *comp, int req_comp, stbi__result_info *ri) { unsigned char* result; stbi__jpeg* j = (stbi__jpeg*) stbi__malloc(sizeof(stbi__jpeg)); STBI_NOTUSED(ri); j->s = s; stbi__setup_jpeg(j); result = load_jpeg_image(j, x,y,comp,req_comp); STBI_FREE(j); return result; } static int stbi__jpeg_test(stbi__context *s) { int r; stbi__jpeg* j = (stbi__jpeg*)stbi__malloc(sizeof(stbi__jpeg)); j->s = s; stbi__setup_jpeg(j); r = stbi__decode_jpeg_header(j, STBI__SCAN_type); stbi__rewind(s); STBI_FREE(j); return r; } static int stbi__jpeg_info_raw(stbi__jpeg *j, int *x, int *y, int *comp) { if (!stbi__decode_jpeg_header(j, STBI__SCAN_header)) { stbi__rewind( j->s ); return 0; } if (x) *x = j->s->img_x; if (y) *y = j->s->img_y; if (comp) *comp = j->s->img_n >= 3 ? 3 : 1; return 1; } static int stbi__jpeg_info(stbi__context *s, int *x, int *y, int *comp) { int result; stbi__jpeg* j = (stbi__jpeg*) (stbi__malloc(sizeof(stbi__jpeg))); j->s = s; result = stbi__jpeg_info_raw(j, x, y, comp); STBI_FREE(j); return result; } #endif // public domain zlib decode v0.2 Sean Barrett 2006-11-18 // simple implementation // - all input must be provided in an upfront buffer // - all output is written to a single output buffer (can malloc/realloc) // performance // - fast huffman #ifndef STBI_NO_ZLIB // fast-way is faster to check than jpeg huffman, but slow way is slower #define STBI__ZFAST_BITS 9 // accelerate all cases in default tables #define STBI__ZFAST_MASK ((1 << STBI__ZFAST_BITS) - 1) // zlib-style huffman encoding // (jpegs packs from left, zlib from right, so can't share code) typedef struct { stbi__uint16 fast[1 << STBI__ZFAST_BITS]; stbi__uint16 firstcode[16]; int maxcode[17]; stbi__uint16 firstsymbol[16]; stbi_uc size[288]; stbi__uint16 value[288]; } stbi__zhuffman; stbi_inline static int stbi__bitreverse16(int n) { n = ((n & 0xAAAA) >> 1) | ((n & 0x5555) << 1); n = ((n & 0xCCCC) >> 2) | ((n & 0x3333) << 2); n = ((n & 0xF0F0) >> 4) | ((n & 0x0F0F) << 4); n = ((n & 0xFF00) >> 8) | ((n & 0x00FF) << 8); return n; } stbi_inline static int stbi__bit_reverse(int v, int bits) { STBI_ASSERT(bits <= 16); // to bit reverse n bits, reverse 16 and shift // e.g. 11 bits, bit reverse and shift away 5 return stbi__bitreverse16(v) >> (16-bits); } static int stbi__zbuild_huffman(stbi__zhuffman *z, const stbi_uc *sizelist, int num) { int i,k=0; int code, next_code[16], sizes[17]; // DEFLATE spec for generating codes memset(sizes, 0, sizeof(sizes)); memset(z->fast, 0, sizeof(z->fast)); for (i=0; i < num; ++i) ++sizes[sizelist[i]]; sizes[0] = 0; for (i=1; i < 16; ++i) if (sizes[i] > (1 << i)) return stbi__err("bad sizes", "Corrupt PNG"); code = 0; for (i=1; i < 16; ++i) { next_code[i] = code; z->firstcode[i] = (stbi__uint16) code; z->firstsymbol[i] = (stbi__uint16) k; code = (code + sizes[i]); if (sizes[i]) if (code-1 >= (1 << i)) return stbi__err("bad codelengths","Corrupt PNG"); z->maxcode[i] = code << (16-i); // preshift for inner loop code <<= 1; k += sizes[i]; } z->maxcode[16] = 0x10000; // sentinel for (i=0; i < num; ++i) { int s = sizelist[i]; if (s) { int c = next_code[s] - z->firstcode[s] + z->firstsymbol[s]; stbi__uint16 fastv = (stbi__uint16) ((s << 9) | i); z->size [c] = (stbi_uc ) s; z->value[c] = (stbi__uint16) i; if (s <= STBI__ZFAST_BITS) { int j = stbi__bit_reverse(next_code[s],s); while (j < (1 << STBI__ZFAST_BITS)) { z->fast[j] = fastv; j += (1 << s); } } ++next_code[s]; } } return 1; } // zlib-from-memory implementation for PNG reading // because PNG allows splitting the zlib stream arbitrarily, // and it's annoying structurally to have PNG call ZLIB call PNG, // we require PNG read all the IDATs and combine them into a single // memory buffer typedef struct { stbi_uc *zbuffer, *zbuffer_end; int num_bits; stbi__uint32 code_buffer; char *zout; char *zout_start; char *zout_end; int z_expandable; stbi__zhuffman z_length, z_distance; } stbi__zbuf; stbi_inline static stbi_uc stbi__zget8(stbi__zbuf *z) { if (z->zbuffer >= z->zbuffer_end) return 0; return *z->zbuffer++; } static void stbi__fill_bits(stbi__zbuf *z) { do { STBI_ASSERT(z->code_buffer < (1U << z->num_bits)); z->code_buffer |= (unsigned int) stbi__zget8(z) << z->num_bits; z->num_bits += 8; } while (z->num_bits <= 24); } stbi_inline static unsigned int stbi__zreceive(stbi__zbuf *z, int n) { unsigned int k; if (z->num_bits < n) stbi__fill_bits(z); k = z->code_buffer & ((1 << n) - 1); z->code_buffer >>= n; z->num_bits -= n; return k; } static int stbi__zhuffman_decode_slowpath(stbi__zbuf *a, stbi__zhuffman *z) { int b,s,k; // not resolved by fast table, so compute it the slow way // use jpeg approach, which requires MSbits at top k = stbi__bit_reverse(a->code_buffer, 16); for (s=STBI__ZFAST_BITS+1; ; ++s) if (k < z->maxcode[s]) break; if (s == 16) return -1; // invalid code! // code size is s, so: b = (k >> (16-s)) - z->firstcode[s] + z->firstsymbol[s]; STBI_ASSERT(z->size[b] == s); a->code_buffer >>= s; a->num_bits -= s; return z->value[b]; } stbi_inline static int stbi__zhuffman_decode(stbi__zbuf *a, stbi__zhuffman *z) { int b,s; if (a->num_bits < 16) stbi__fill_bits(a); b = z->fast[a->code_buffer & STBI__ZFAST_MASK]; if (b) { s = b >> 9; a->code_buffer >>= s; a->num_bits -= s; return b & 511; } return stbi__zhuffman_decode_slowpath(a, z); } static int stbi__zexpand(stbi__zbuf *z, char *zout, int n) // need to make room for n bytes { char *q; int cur, limit, old_limit; z->zout = zout; if (!z->z_expandable) return stbi__err("output buffer limit","Corrupt PNG"); cur = (int) (z->zout - z->zout_start); limit = old_limit = (int) (z->zout_end - z->zout_start); while (cur + n > limit) limit *= 2; q = (char *) STBI_REALLOC_SIZED(z->zout_start, old_limit, limit); STBI_NOTUSED(old_limit); if (q == NULL) return stbi__err("outofmem", "Out of memory"); z->zout_start = q; z->zout = q + cur; z->zout_end = q + limit; return 1; } static int stbi__zlength_base[31] = { 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,0,0 }; static int stbi__zlength_extra[31]= { 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,0,0 }; static int stbi__zdist_base[32] = { 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,0,0}; static int stbi__zdist_extra[32] = { 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}; static int stbi__parse_huffman_block(stbi__zbuf *a) { char *zout = a->zout; for(;;) { int z = stbi__zhuffman_decode(a, &a->z_length); if (z < 256) { if (z < 0) return stbi__err("bad huffman code","Corrupt PNG"); // error in huffman codes if (zout >= a->zout_end) { if (!stbi__zexpand(a, zout, 1)) return 0; zout = a->zout; } *zout++ = (char) z; } else { stbi_uc *p; int len,dist; if (z == 256) { a->zout = zout; return 1; } z -= 257; len = stbi__zlength_base[z]; if (stbi__zlength_extra[z]) len += stbi__zreceive(a, stbi__zlength_extra[z]); z = stbi__zhuffman_decode(a, &a->z_distance); if (z < 0) return stbi__err("bad huffman code","Corrupt PNG"); dist = stbi__zdist_base[z]; if (stbi__zdist_extra[z]) dist += stbi__zreceive(a, stbi__zdist_extra[z]); if (zout - a->zout_start < dist) return stbi__err("bad dist","Corrupt PNG"); if (zout + len > a->zout_end) { if (!stbi__zexpand(a, zout, len)) return 0; zout = a->zout; } p = (stbi_uc *) (zout - dist); if (dist == 1) { // run of one byte; common in images. stbi_uc v = *p; if (len) { do *zout++ = v; while (--len); } } else { if (len) { do *zout++ = *p++; while (--len); } } } } } static int stbi__compute_huffman_codes(stbi__zbuf *a) { static stbi_uc length_dezigzag[19] = { 16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15 }; stbi__zhuffman z_codelength; stbi_uc lencodes[286+32+137];//padding for maximum single op stbi_uc codelength_sizes[19]; int i,n; int hlit = stbi__zreceive(a,5) + 257; int hdist = stbi__zreceive(a,5) + 1; int hclen = stbi__zreceive(a,4) + 4; int ntot = hlit + hdist; memset(codelength_sizes, 0, sizeof(codelength_sizes)); for (i=0; i < hclen; ++i) { int s = stbi__zreceive(a,3); codelength_sizes[length_dezigzag[i]] = (stbi_uc) s; } if (!stbi__zbuild_huffman(&z_codelength, codelength_sizes, 19)) return 0; n = 0; while (n < ntot) { int c = stbi__zhuffman_decode(a, &z_codelength); if (c < 0 || c >= 19) return stbi__err("bad codelengths", "Corrupt PNG"); if (c < 16) lencodes[n++] = (stbi_uc) c; else { stbi_uc fill = 0; if (c == 16) { c = stbi__zreceive(a,2)+3; if (n == 0) return stbi__err("bad codelengths", "Corrupt PNG"); fill = lencodes[n-1]; } else if (c == 17) c = stbi__zreceive(a,3)+3; else { STBI_ASSERT(c == 18); c = stbi__zreceive(a,7)+11; } if (ntot - n < c) return stbi__err("bad codelengths", "Corrupt PNG"); memset(lencodes+n, fill, c); n += c; } } if (n != ntot) return stbi__err("bad codelengths","Corrupt PNG"); if (!stbi__zbuild_huffman(&a->z_length, lencodes, hlit)) return 0; if (!stbi__zbuild_huffman(&a->z_distance, lencodes+hlit, hdist)) return 0; return 1; } static int stbi__parse_uncompressed_block(stbi__zbuf *a) { stbi_uc header[4]; int len,nlen,k; if (a->num_bits & 7) stbi__zreceive(a, a->num_bits & 7); // discard // drain the bit-packed data into header k = 0; while (a->num_bits > 0) { header[k++] = (stbi_uc) (a->code_buffer & 255); // suppress MSVC run-time check a->code_buffer >>= 8; a->num_bits -= 8; } STBI_ASSERT(a->num_bits == 0); // now fill header the normal way while (k < 4) header[k++] = stbi__zget8(a); len = header[1] * 256 + header[0]; nlen = header[3] * 256 + header[2]; if (nlen != (len ^ 0xffff)) return stbi__err("zlib corrupt","Corrupt PNG"); if (a->zbuffer + len > a->zbuffer_end) return stbi__err("read past buffer","Corrupt PNG"); if (a->zout + len > a->zout_end) if (!stbi__zexpand(a, a->zout, len)) return 0; memcpy(a->zout, a->zbuffer, len); a->zbuffer += len; a->zout += len; return 1; } static int stbi__parse_zlib_header(stbi__zbuf *a) { int cmf = stbi__zget8(a); int cm = cmf & 15; /* int cinfo = cmf >> 4; */ int flg = stbi__zget8(a); if ((cmf*256+flg) % 31 != 0) return stbi__err("bad zlib header","Corrupt PNG"); // zlib spec if (flg & 32) return stbi__err("no preset dict","Corrupt PNG"); // preset dictionary not allowed in png if (cm != 8) return stbi__err("bad compression","Corrupt PNG"); // DEFLATE required for png // window = 1 << (8 + cinfo)... but who cares, we fully buffer output return 1; } static const stbi_uc stbi__zdefault_length[288] = { 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, 9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9, 9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9, 9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9, 9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9, 9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9, 9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9, 9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9, 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7, 7,7,7,7,7,7,7,7,8,8,8,8,8,8,8,8 }; static const stbi_uc stbi__zdefault_distance[32] = { 5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5 }; /* Init algorithm: { int i; // use <= to match clearly with spec for (i=0; i <= 143; ++i) stbi__zdefault_length[i] = 8; for ( ; i <= 255; ++i) stbi__zdefault_length[i] = 9; for ( ; i <= 279; ++i) stbi__zdefault_length[i] = 7; for ( ; i <= 287; ++i) stbi__zdefault_length[i] = 8; for (i=0; i <= 31; ++i) stbi__zdefault_distance[i] = 5; } */ static int stbi__parse_zlib(stbi__zbuf *a, int parse_header) { int final, type; if (parse_header) if (!stbi__parse_zlib_header(a)) return 0; a->num_bits = 0; a->code_buffer = 0; do { final = stbi__zreceive(a,1); type = stbi__zreceive(a,2); if (type == 0) { if (!stbi__parse_uncompressed_block(a)) return 0; } else if (type == 3) { return 0; } else { if (type == 1) { // use fixed code lengths if (!stbi__zbuild_huffman(&a->z_length , stbi__zdefault_length , 288)) return 0; if (!stbi__zbuild_huffman(&a->z_distance, stbi__zdefault_distance, 32)) return 0; } else { if (!stbi__compute_huffman_codes(a)) return 0; } if (!stbi__parse_huffman_block(a)) return 0; } } while (!final); return 1; } static int stbi__do_zlib(stbi__zbuf *a, char *obuf, int olen, int exp, int parse_header) { a->zout_start = obuf; a->zout = obuf; a->zout_end = obuf + olen; a->z_expandable = exp; return stbi__parse_zlib(a, parse_header); } STBIDEF char *stbi_zlib_decode_malloc_guesssize(const char *buffer, int len, int initial_size, int *outlen) { stbi__zbuf a; char *p = (char *) stbi__malloc(initial_size); if (p == NULL) return NULL; a.zbuffer = (stbi_uc *) buffer; a.zbuffer_end = (stbi_uc *) buffer + len; if (stbi__do_zlib(&a, p, initial_size, 1, 1)) { if (outlen) *outlen = (int) (a.zout - a.zout_start); return a.zout_start; } else { STBI_FREE(a.zout_start); return NULL; } } STBIDEF char *stbi_zlib_decode_malloc(char const *buffer, int len, int *outlen) { return stbi_zlib_decode_malloc_guesssize(buffer, len, 16384, outlen); } STBIDEF char *stbi_zlib_decode_malloc_guesssize_headerflag(const char *buffer, int len, int initial_size, int *outlen, int parse_header) { stbi__zbuf a; char *p = (char *) stbi__malloc(initial_size); if (p == NULL) return NULL; a.zbuffer = (stbi_uc *) buffer; a.zbuffer_end = (stbi_uc *) buffer + len; if (stbi__do_zlib(&a, p, initial_size, 1, parse_header)) { if (outlen) *outlen = (int) (a.zout - a.zout_start); return a.zout_start; } else { STBI_FREE(a.zout_start); return NULL; } } STBIDEF int stbi_zlib_decode_buffer(char *obuffer, int olen, char const *ibuffer, int ilen) { stbi__zbuf a; a.zbuffer = (stbi_uc *) ibuffer; a.zbuffer_end = (stbi_uc *) ibuffer + ilen; if (stbi__do_zlib(&a, obuffer, olen, 0, 1)) return (int) (a.zout - a.zout_start); else return -1; } STBIDEF char *stbi_zlib_decode_noheader_malloc(char const *buffer, int len, int *outlen) { stbi__zbuf a; char *p = (char *) stbi__malloc(16384); if (p == NULL) return NULL; a.zbuffer = (stbi_uc *) buffer; a.zbuffer_end = (stbi_uc *) buffer+len; if (stbi__do_zlib(&a, p, 16384, 1, 0)) { if (outlen) *outlen = (int) (a.zout - a.zout_start); return a.zout_start; } else { STBI_FREE(a.zout_start); return NULL; } } STBIDEF int stbi_zlib_decode_noheader_buffer(char *obuffer, int olen, const char *ibuffer, int ilen) { stbi__zbuf a; a.zbuffer = (stbi_uc *) ibuffer; a.zbuffer_end = (stbi_uc *) ibuffer + ilen; if (stbi__do_zlib(&a, obuffer, olen, 0, 0)) return (int) (a.zout - a.zout_start); else return -1; } #endif // public domain "baseline" PNG decoder v0.10 Sean Barrett 2006-11-18 // simple implementation // - only 8-bit samples // - no CRC checking // - allocates lots of intermediate memory // - avoids problem of streaming data between subsystems // - avoids explicit window management // performance // - uses stb_zlib, a PD zlib implementation with fast huffman decoding #ifndef STBI_NO_PNG typedef struct { stbi__uint32 length; stbi__uint32 type; } stbi__pngchunk; static stbi__pngchunk stbi__get_chunk_header(stbi__context *s) { stbi__pngchunk c; c.length = stbi__get32be(s); c.type = stbi__get32be(s); return c; } static int stbi__check_png_header(stbi__context *s) { static stbi_uc png_sig[8] = { 137,80,78,71,13,10,26,10 }; int i; for (i=0; i < 8; ++i) if (stbi__get8(s) != png_sig[i]) return stbi__err("bad png sig","Not a PNG"); return 1; } typedef struct { stbi__context *s; stbi_uc *idata, *expanded, *out; int depth; } stbi__png; enum { STBI__F_none=0, STBI__F_sub=1, STBI__F_up=2, STBI__F_avg=3, STBI__F_paeth=4, // synthetic filters used for first scanline to avoid needing a dummy row of 0s STBI__F_avg_first, STBI__F_paeth_first }; static stbi_uc first_row_filter[5] = { STBI__F_none, STBI__F_sub, STBI__F_none, STBI__F_avg_first, STBI__F_paeth_first }; static int stbi__paeth(int a, int b, int c) { int p = a + b - c; int pa = abs(p-a); int pb = abs(p-b); int pc = abs(p-c); if (pa <= pb && pa <= pc) return a; if (pb <= pc) return b; return c; } static stbi_uc stbi__depth_scale_table[9] = { 0, 0xff, 0x55, 0, 0x11, 0,0,0, 0x01 }; // create the png data from post-deflated data static int stbi__create_png_image_raw(stbi__png *a, stbi_uc *raw, stbi__uint32 raw_len, int out_n, stbi__uint32 x, stbi__uint32 y, int depth, int color) { int bytes = (depth == 16? 2 : 1); stbi__context *s = a->s; stbi__uint32 i,j,stride = x*out_n*bytes; stbi__uint32 img_len, img_width_bytes; int k; int img_n = s->img_n; // copy it into a local for later int output_bytes = out_n*bytes; int filter_bytes = img_n*bytes; int width = x; STBI_ASSERT(out_n == s->img_n || out_n == s->img_n+1); a->out = (stbi_uc *) stbi__malloc_mad3(x, y, output_bytes, 0); // extra bytes to write off the end into if (!a->out) return stbi__err("outofmem", "Out of memory"); img_width_bytes = (((img_n * x * depth) + 7) >> 3); img_len = (img_width_bytes + 1) * y; // we used to check for exact match between raw_len and img_len on non-interlaced PNGs, // but issue #276 reported a PNG in the wild that had extra data at the end (all zeros), // so just check for raw_len < img_len always. if (raw_len < img_len) return stbi__err("not enough pixels","Corrupt PNG"); for (j=0; j < y; ++j) { stbi_uc *cur = a->out + stride*j; stbi_uc *prior; int filter = *raw++; if (filter > 4) return stbi__err("invalid filter","Corrupt PNG"); if (depth < 8) { STBI_ASSERT(img_width_bytes <= x); cur += x*out_n - img_width_bytes; // store output to the rightmost img_len bytes, so we can decode in place filter_bytes = 1; width = img_width_bytes; } prior = cur - stride; // bugfix: need to compute this after 'cur +=' computation above // if first row, use special filter that doesn't sample previous row if (j == 0) filter = first_row_filter[filter]; // handle first byte explicitly for (k=0; k < filter_bytes; ++k) { switch (filter) { case STBI__F_none : cur[k] = raw[k]; break; case STBI__F_sub : cur[k] = raw[k]; break; case STBI__F_up : cur[k] = STBI__BYTECAST(raw[k] + prior[k]); break; case STBI__F_avg : cur[k] = STBI__BYTECAST(raw[k] + (prior[k]>>1)); break; case STBI__F_paeth : cur[k] = STBI__BYTECAST(raw[k] + stbi__paeth(0,prior[k],0)); break; case STBI__F_avg_first : cur[k] = raw[k]; break; case STBI__F_paeth_first: cur[k] = raw[k]; break; } } if (depth == 8) { if (img_n != out_n) cur[img_n] = 255; // first pixel raw += img_n; cur += out_n; prior += out_n; } else if (depth == 16) { if (img_n != out_n) { cur[filter_bytes] = 255; // first pixel top byte cur[filter_bytes+1] = 255; // first pixel bottom byte } raw += filter_bytes; cur += output_bytes; prior += output_bytes; } else { raw += 1; cur += 1; prior += 1; } // this is a little gross, so that we don't switch per-pixel or per-component if (depth < 8 || img_n == out_n) { int nk = (width - 1)*filter_bytes; #define STBI__CASE(f) \ case f: \ for (k=0; k < nk; ++k) switch (filter) { // "none" filter turns into a memcpy here; make that explicit. case STBI__F_none: memcpy(cur, raw, nk); break; STBI__CASE(STBI__F_sub) { cur[k] = STBI__BYTECAST(raw[k] + cur[k-filter_bytes]); } break; STBI__CASE(STBI__F_up) { cur[k] = STBI__BYTECAST(raw[k] + prior[k]); } break; STBI__CASE(STBI__F_avg) { cur[k] = STBI__BYTECAST(raw[k] + ((prior[k] + cur[k-filter_bytes])>>1)); } break; STBI__CASE(STBI__F_paeth) { cur[k] = STBI__BYTECAST(raw[k] + stbi__paeth(cur[k-filter_bytes],prior[k],prior[k-filter_bytes])); } break; STBI__CASE(STBI__F_avg_first) { cur[k] = STBI__BYTECAST(raw[k] + (cur[k-filter_bytes] >> 1)); } break; STBI__CASE(STBI__F_paeth_first) { cur[k] = STBI__BYTECAST(raw[k] + stbi__paeth(cur[k-filter_bytes],0,0)); } break; } #undef STBI__CASE raw += nk; } else { STBI_ASSERT(img_n+1 == out_n); #define STBI__CASE(f) \ case f: \ for (i=x-1; i >= 1; --i, cur[filter_bytes]=255,raw+=filter_bytes,cur+=output_bytes,prior+=output_bytes) \ for (k=0; k < filter_bytes; ++k) switch (filter) { STBI__CASE(STBI__F_none) { cur[k] = raw[k]; } break; STBI__CASE(STBI__F_sub) { cur[k] = STBI__BYTECAST(raw[k] + cur[k- output_bytes]); } break; STBI__CASE(STBI__F_up) { cur[k] = STBI__BYTECAST(raw[k] + prior[k]); } break; STBI__CASE(STBI__F_avg) { cur[k] = STBI__BYTECAST(raw[k] + ((prior[k] + cur[k- output_bytes])>>1)); } break; STBI__CASE(STBI__F_paeth) { cur[k] = STBI__BYTECAST(raw[k] + stbi__paeth(cur[k- output_bytes],prior[k],prior[k- output_bytes])); } break; STBI__CASE(STBI__F_avg_first) { cur[k] = STBI__BYTECAST(raw[k] + (cur[k- output_bytes] >> 1)); } break; STBI__CASE(STBI__F_paeth_first) { cur[k] = STBI__BYTECAST(raw[k] + stbi__paeth(cur[k- output_bytes],0,0)); } break; } #undef STBI__CASE // the loop above sets the high byte of the pixels' alpha, but for // 16 bit png files we also need the low byte set. we'll do that here. if (depth == 16) { cur = a->out + stride*j; // start at the beginning of the row again for (i=0; i < x; ++i,cur+=output_bytes) { cur[filter_bytes+1] = 255; } } } } // we make a separate pass to expand bits to pixels; for performance, // this could run two scanlines behind the above code, so it won't // intefere with filtering but will still be in the cache. if (depth < 8) { for (j=0; j < y; ++j) { stbi_uc *cur = a->out + stride*j; stbi_uc *in = a->out + stride*j + x*out_n - img_width_bytes; // unpack 1/2/4-bit into a 8-bit buffer. allows us to keep the common 8-bit path optimal at minimal cost for 1/2/4-bit // png guarante byte alignment, if width is not multiple of 8/4/2 we'll decode dummy trailing data that will be skipped in the later loop stbi_uc scale = (color == 0) ? stbi__depth_scale_table[depth] : 1; // scale grayscale values to 0..255 range // note that the final byte might overshoot and write more data than desired. // we can allocate enough data that this never writes out of memory, but it // could also overwrite the next scanline. can it overwrite non-empty data // on the next scanline? yes, consider 1-pixel-wide scanlines with 1-bit-per-pixel. // so we need to explicitly clamp the final ones if (depth == 4) { for (k=x*img_n; k >= 2; k-=2, ++in) { *cur++ = scale * ((*in >> 4) ); *cur++ = scale * ((*in ) & 0x0f); } if (k > 0) *cur++ = scale * ((*in >> 4) ); } else if (depth == 2) { for (k=x*img_n; k >= 4; k-=4, ++in) { *cur++ = scale * ((*in >> 6) ); *cur++ = scale * ((*in >> 4) & 0x03); *cur++ = scale * ((*in >> 2) & 0x03); *cur++ = scale * ((*in ) & 0x03); } if (k > 0) *cur++ = scale * ((*in >> 6) ); if (k > 1) *cur++ = scale * ((*in >> 4) & 0x03); if (k > 2) *cur++ = scale * ((*in >> 2) & 0x03); } else if (depth == 1) { for (k=x*img_n; k >= 8; k-=8, ++in) { *cur++ = scale * ((*in >> 7) ); *cur++ = scale * ((*in >> 6) & 0x01); *cur++ = scale * ((*in >> 5) & 0x01); *cur++ = scale * ((*in >> 4) & 0x01); *cur++ = scale * ((*in >> 3) & 0x01); *cur++ = scale * ((*in >> 2) & 0x01); *cur++ = scale * ((*in >> 1) & 0x01); *cur++ = scale * ((*in ) & 0x01); } if (k > 0) *cur++ = scale * ((*in >> 7) ); if (k > 1) *cur++ = scale * ((*in >> 6) & 0x01); if (k > 2) *cur++ = scale * ((*in >> 5) & 0x01); if (k > 3) *cur++ = scale * ((*in >> 4) & 0x01); if (k > 4) *cur++ = scale * ((*in >> 3) & 0x01); if (k > 5) *cur++ = scale * ((*in >> 2) & 0x01); if (k > 6) *cur++ = scale * ((*in >> 1) & 0x01); } if (img_n != out_n) { int q; // insert alpha = 255 cur = a->out + stride*j; if (img_n == 1) { for (q=x-1; q >= 0; --q) { cur[q*2+1] = 255; cur[q*2+0] = cur[q]; } } else { STBI_ASSERT(img_n == 3); for (q=x-1; q >= 0; --q) { cur[q*4+3] = 255; cur[q*4+2] = cur[q*3+2]; cur[q*4+1] = cur[q*3+1]; cur[q*4+0] = cur[q*3+0]; } } } } } else if (depth == 16) { // force the image data from big-endian to platform-native. // this is done in a separate pass due to the decoding relying // on the data being untouched, but could probably be done // per-line during decode if care is taken. stbi_uc *cur = a->out; stbi__uint16 *cur16 = (stbi__uint16*)cur; for(i=0; i < x*y*out_n; ++i,cur16++,cur+=2) { *cur16 = (cur[0] << 8) | cur[1]; } } return 1; } static int stbi__create_png_image(stbi__png *a, stbi_uc *image_data, stbi__uint32 image_data_len, int out_n, int depth, int color, int interlaced) { int bytes = (depth == 16 ? 2 : 1); int out_bytes = out_n * bytes; stbi_uc *final; int p; if (!interlaced) return stbi__create_png_image_raw(a, image_data, image_data_len, out_n, a->s->img_x, a->s->img_y, depth, color); // de-interlacing final = (stbi_uc *) stbi__malloc_mad3(a->s->img_x, a->s->img_y, out_bytes, 0); for (p=0; p < 7; ++p) { int xorig[] = { 0,4,0,2,0,1,0 }; int yorig[] = { 0,0,4,0,2,0,1 }; int xspc[] = { 8,8,4,4,2,2,1 }; int yspc[] = { 8,8,8,4,4,2,2 }; int i,j,x,y; // pass1_x[4] = 0, pass1_x[5] = 1, pass1_x[12] = 1 x = (a->s->img_x - xorig[p] + xspc[p]-1) / xspc[p]; y = (a->s->img_y - yorig[p] + yspc[p]-1) / yspc[p]; if (x && y) { stbi__uint32 img_len = ((((a->s->img_n * x * depth) + 7) >> 3) + 1) * y; if (!stbi__create_png_image_raw(a, image_data, image_data_len, out_n, x, y, depth, color)) { STBI_FREE(final); return 0; } for (j=0; j < y; ++j) { for (i=0; i < x; ++i) { int out_y = j*yspc[p]+yorig[p]; int out_x = i*xspc[p]+xorig[p]; memcpy(final + out_y*a->s->img_x*out_bytes + out_x*out_bytes, a->out + (j*x+i)*out_bytes, out_bytes); } } STBI_FREE(a->out); image_data += img_len; image_data_len -= img_len; } } a->out = final; return 1; } static int stbi__compute_transparency(stbi__png *z, stbi_uc tc[3], int out_n) { stbi__context *s = z->s; stbi__uint32 i, pixel_count = s->img_x * s->img_y; stbi_uc *p = z->out; // compute color-based transparency, assuming we've // already got 255 as the alpha value in the output STBI_ASSERT(out_n == 2 || out_n == 4); if (out_n == 2) { for (i=0; i < pixel_count; ++i) { p[1] = (p[0] == tc[0] ? 0 : 255); p += 2; } } else { for (i=0; i < pixel_count; ++i) { if (p[0] == tc[0] && p[1] == tc[1] && p[2] == tc[2]) p[3] = 0; p += 4; } } return 1; } static int stbi__compute_transparency16(stbi__png *z, stbi__uint16 tc[3], int out_n) { stbi__context *s = z->s; stbi__uint32 i, pixel_count = s->img_x * s->img_y; stbi__uint16 *p = (stbi__uint16*) z->out; // compute color-based transparency, assuming we've // already got 65535 as the alpha value in the output STBI_ASSERT(out_n == 2 || out_n == 4); if (out_n == 2) { for (i = 0; i < pixel_count; ++i) { p[1] = (p[0] == tc[0] ? 0 : 65535); p += 2; } } else { for (i = 0; i < pixel_count; ++i) { if (p[0] == tc[0] && p[1] == tc[1] && p[2] == tc[2]) p[3] = 0; p += 4; } } return 1; } static int stbi__expand_png_palette(stbi__png *a, stbi_uc *palette, int len, int pal_img_n) { stbi__uint32 i, pixel_count = a->s->img_x * a->s->img_y; stbi_uc *p, *temp_out, *orig = a->out; p = (stbi_uc *) stbi__malloc_mad2(pixel_count, pal_img_n, 0); if (p == NULL) return stbi__err("outofmem", "Out of memory"); // between here and free(out) below, exitting would leak temp_out = p; if (pal_img_n == 3) { for (i=0; i < pixel_count; ++i) { int n = orig[i]*4; p[0] = palette[n ]; p[1] = palette[n+1]; p[2] = palette[n+2]; p += 3; } } else { for (i=0; i < pixel_count; ++i) { int n = orig[i]*4; p[0] = palette[n ]; p[1] = palette[n+1]; p[2] = palette[n+2]; p[3] = palette[n+3]; p += 4; } } STBI_FREE(a->out); a->out = temp_out; STBI_NOTUSED(len); return 1; } static int stbi__unpremultiply_on_load = 0; static int stbi__de_iphone_flag = 0; STBIDEF void stbi_set_unpremultiply_on_load(int flag_true_if_should_unpremultiply) { stbi__unpremultiply_on_load = flag_true_if_should_unpremultiply; } STBIDEF void stbi_convert_iphone_png_to_rgb(int flag_true_if_should_convert) { stbi__de_iphone_flag = flag_true_if_should_convert; } static void stbi__de_iphone(stbi__png *z) { stbi__context *s = z->s; stbi__uint32 i, pixel_count = s->img_x * s->img_y; stbi_uc *p = z->out; if (s->img_out_n == 3) { // convert bgr to rgb for (i=0; i < pixel_count; ++i) { stbi_uc t = p[0]; p[0] = p[2]; p[2] = t; p += 3; } } else { STBI_ASSERT(s->img_out_n == 4); if (stbi__unpremultiply_on_load) { // convert bgr to rgb and unpremultiply for (i=0; i < pixel_count; ++i) { stbi_uc a = p[3]; stbi_uc t = p[0]; if (a) { stbi_uc half = a / 2; p[0] = (p[2] * 255 + half) / a; p[1] = (p[1] * 255 + half) / a; p[2] = ( t * 255 + half) / a; } else { p[0] = p[2]; p[2] = t; } p += 4; } } else { // convert bgr to rgb for (i=0; i < pixel_count; ++i) { stbi_uc t = p[0]; p[0] = p[2]; p[2] = t; p += 4; } } } } #define STBI__PNG_TYPE(a,b,c,d) (((a) << 24) + ((b) << 16) + ((c) << 8) + (d)) static int stbi__parse_png_file(stbi__png *z, int scan, int req_comp) { stbi_uc palette[1024], pal_img_n=0; stbi_uc has_trans=0, tc[3]; stbi__uint16 tc16[3]; stbi__uint32 ioff=0, idata_limit=0, i, pal_len=0; int first=1,k,interlace=0, color=0, is_iphone=0; stbi__context *s = z->s; z->expanded = NULL; z->idata = NULL; z->out = NULL; if (!stbi__check_png_header(s)) return 0; if (scan == STBI__SCAN_type) return 1; for (;;) { stbi__pngchunk c = stbi__get_chunk_header(s); switch (c.type) { case STBI__PNG_TYPE('C','g','B','I'): is_iphone = 1; stbi__skip(s, c.length); break; case STBI__PNG_TYPE('I','H','D','R'): { int comp,filter; if (!first) return stbi__err("multiple IHDR","Corrupt PNG"); first = 0; if (c.length != 13) return stbi__err("bad IHDR len","Corrupt PNG"); s->img_x = stbi__get32be(s); if (s->img_x > (1 << 24)) return stbi__err("too large","Very large image (corrupt?)"); s->img_y = stbi__get32be(s); if (s->img_y > (1 << 24)) return stbi__err("too large","Very large image (corrupt?)"); z->depth = stbi__get8(s); if (z->depth != 1 && z->depth != 2 && z->depth != 4 && z->depth != 8 && z->depth != 16) return stbi__err("1/2/4/8/16-bit only","PNG not supported: 1/2/4/8/16-bit only"); color = stbi__get8(s); if (color > 6) return stbi__err("bad ctype","Corrupt PNG"); if (color == 3 && z->depth == 16) return stbi__err("bad ctype","Corrupt PNG"); if (color == 3) pal_img_n = 3; else if (color & 1) return stbi__err("bad ctype","Corrupt PNG"); comp = stbi__get8(s); if (comp) return stbi__err("bad comp method","Corrupt PNG"); filter= stbi__get8(s); if (filter) return stbi__err("bad filter method","Corrupt PNG"); interlace = stbi__get8(s); if (interlace>1) return stbi__err("bad interlace method","Corrupt PNG"); if (!s->img_x || !s->img_y) return stbi__err("0-pixel image","Corrupt PNG"); if (!pal_img_n) { s->img_n = (color & 2 ? 3 : 1) + (color & 4 ? 1 : 0); if ((1 << 30) / s->img_x / s->img_n < s->img_y) return stbi__err("too large", "Image too large to decode"); if (scan == STBI__SCAN_header) return 1; } else { // if paletted, then pal_n is our final components, and // img_n is # components to decompress/filter. s->img_n = 1; if ((1 << 30) / s->img_x / 4 < s->img_y) return stbi__err("too large","Corrupt PNG"); // if SCAN_header, have to scan to see if we have a tRNS } break; } case STBI__PNG_TYPE('P','L','T','E'): { if (first) return stbi__err("first not IHDR", "Corrupt PNG"); if (c.length > 256*3) return stbi__err("invalid PLTE","Corrupt PNG"); pal_len = c.length / 3; if (pal_len * 3 != c.length) return stbi__err("invalid PLTE","Corrupt PNG"); for (i=0; i < pal_len; ++i) { palette[i*4+0] = stbi__get8(s); palette[i*4+1] = stbi__get8(s); palette[i*4+2] = stbi__get8(s); palette[i*4+3] = 255; } break; } case STBI__PNG_TYPE('t','R','N','S'): { if (first) return stbi__err("first not IHDR", "Corrupt PNG"); if (z->idata) return stbi__err("tRNS after IDAT","Corrupt PNG"); if (pal_img_n) { if (scan == STBI__SCAN_header) { s->img_n = 4; return 1; } if (pal_len == 0) return stbi__err("tRNS before PLTE","Corrupt PNG"); if (c.length > pal_len) return stbi__err("bad tRNS len","Corrupt PNG"); pal_img_n = 4; for (i=0; i < c.length; ++i) palette[i*4+3] = stbi__get8(s); } else { if (!(s->img_n & 1)) return stbi__err("tRNS with alpha","Corrupt PNG"); if (c.length != (stbi__uint32) s->img_n*2) return stbi__err("bad tRNS len","Corrupt PNG"); has_trans = 1; if (z->depth == 16) { for (k = 0; k < s->img_n; ++k) tc16[k] = (stbi__uint16)stbi__get16be(s); // copy the values as-is } else { for (k = 0; k < s->img_n; ++k) tc[k] = (stbi_uc)(stbi__get16be(s) & 255) * stbi__depth_scale_table[z->depth]; // non 8-bit images will be larger } } break; } case STBI__PNG_TYPE('I','D','A','T'): { if (first) return stbi__err("first not IHDR", "Corrupt PNG"); if (pal_img_n && !pal_len) return stbi__err("no PLTE","Corrupt PNG"); if (scan == STBI__SCAN_header) { s->img_n = pal_img_n; return 1; } if ((int)(ioff + c.length) < (int)ioff) return 0; if (ioff + c.length > idata_limit) { stbi__uint32 idata_limit_old = idata_limit; stbi_uc *p; if (idata_limit == 0) idata_limit = c.length > 4096 ? c.length : 4096; while (ioff + c.length > idata_limit) idata_limit *= 2; STBI_NOTUSED(idata_limit_old); p = (stbi_uc *) STBI_REALLOC_SIZED(z->idata, idata_limit_old, idata_limit); if (p == NULL) return stbi__err("outofmem", "Out of memory"); z->idata = p; } if (!stbi__getn(s, z->idata+ioff,c.length)) return stbi__err("outofdata","Corrupt PNG"); ioff += c.length; break; } case STBI__PNG_TYPE('I','E','N','D'): { stbi__uint32 raw_len, bpl; if (first) return stbi__err("first not IHDR", "Corrupt PNG"); if (scan != STBI__SCAN_load) return 1; if (z->idata == NULL) return stbi__err("no IDAT","Corrupt PNG"); // initial guess for decoded data size to avoid unnecessary reallocs bpl = (s->img_x * z->depth + 7) / 8; // bytes per line, per component raw_len = bpl * s->img_y * s->img_n /* pixels */ + s->img_y /* filter mode per row */; z->expanded = (stbi_uc *) stbi_zlib_decode_malloc_guesssize_headerflag((char *) z->idata, ioff, raw_len, (int *) &raw_len, !is_iphone); if (z->expanded == NULL) return 0; // zlib should set error STBI_FREE(z->idata); z->idata = NULL; if ((req_comp == s->img_n+1 && req_comp != 3 && !pal_img_n) || has_trans) s->img_out_n = s->img_n+1; else s->img_out_n = s->img_n; if (!stbi__create_png_image(z, z->expanded, raw_len, s->img_out_n, z->depth, color, interlace)) return 0; if (has_trans) { if (z->depth == 16) { if (!stbi__compute_transparency16(z, tc16, s->img_out_n)) return 0; } else { if (!stbi__compute_transparency(z, tc, s->img_out_n)) return 0; } } if (is_iphone && stbi__de_iphone_flag && s->img_out_n > 2) stbi__de_iphone(z); if (pal_img_n) { // pal_img_n == 3 or 4 s->img_n = pal_img_n; // record the actual colors we had s->img_out_n = pal_img_n; if (req_comp >= 3) s->img_out_n = req_comp; if (!stbi__expand_png_palette(z, palette, pal_len, s->img_out_n)) return 0; } else if (has_trans) { // non-paletted image with tRNS -> source image has (constant) alpha ++s->img_n; } STBI_FREE(z->expanded); z->expanded = NULL; return 1; } default: // if critical, fail if (first) return stbi__err("first not IHDR", "Corrupt PNG"); if ((c.type & (1 << 29)) == 0) { #ifndef STBI_NO_FAILURE_STRINGS // not threadsafe static char invalid_chunk[] = "XXXX PNG chunk not known"; invalid_chunk[0] = STBI__BYTECAST(c.type >> 24); invalid_chunk[1] = STBI__BYTECAST(c.type >> 16); invalid_chunk[2] = STBI__BYTECAST(c.type >> 8); invalid_chunk[3] = STBI__BYTECAST(c.type >> 0); #endif return stbi__err(invalid_chunk, "PNG not supported: unknown PNG chunk type"); } stbi__skip(s, c.length); break; } // end of PNG chunk, read and skip CRC stbi__get32be(s); } } static void *stbi__do_png(stbi__png *p, int *x, int *y, int *n, int req_comp, stbi__result_info *ri) { void *result=NULL; if (req_comp < 0 || req_comp > 4) return stbi__errpuc("bad req_comp", "Internal error"); if (stbi__parse_png_file(p, STBI__SCAN_load, req_comp)) { if (p->depth < 8) ri->bits_per_channel = 8; else ri->bits_per_channel = p->depth; result = p->out; p->out = NULL; if (req_comp && req_comp != p->s->img_out_n) { if (ri->bits_per_channel == 8) result = stbi__convert_format((unsigned char *) result, p->s->img_out_n, req_comp, p->s->img_x, p->s->img_y); else result = stbi__convert_format16((stbi__uint16 *) result, p->s->img_out_n, req_comp, p->s->img_x, p->s->img_y); p->s->img_out_n = req_comp; if (result == NULL) return result; } *x = p->s->img_x; *y = p->s->img_y; if (n) *n = p->s->img_n; } STBI_FREE(p->out); p->out = NULL; STBI_FREE(p->expanded); p->expanded = NULL; STBI_FREE(p->idata); p->idata = NULL; return result; } static void *stbi__png_load(stbi__context *s, int *x, int *y, int *comp, int req_comp, stbi__result_info *ri) { stbi__png p; p.s = s; return stbi__do_png(&p, x,y,comp,req_comp, ri); } static int stbi__png_test(stbi__context *s) { int r; r = stbi__check_png_header(s); stbi__rewind(s); return r; } static int stbi__png_info_raw(stbi__png *p, int *x, int *y, int *comp) { if (!stbi__parse_png_file(p, STBI__SCAN_header, 0)) { stbi__rewind( p->s ); return 0; } if (x) *x = p->s->img_x; if (y) *y = p->s->img_y; if (comp) *comp = p->s->img_n; return 1; } static int stbi__png_info(stbi__context *s, int *x, int *y, int *comp) { stbi__png p; p.s = s; return stbi__png_info_raw(&p, x, y, comp); } #endif // Microsoft/Windows BMP image #ifndef STBI_NO_BMP static int stbi__bmp_test_raw(stbi__context *s) { int r; int sz; if (stbi__get8(s) != 'B') return 0; if (stbi__get8(s) != 'M') return 0; stbi__get32le(s); // discard filesize stbi__get16le(s); // discard reserved stbi__get16le(s); // discard reserved stbi__get32le(s); // discard data offset sz = stbi__get32le(s); r = (sz == 12 || sz == 40 || sz == 56 || sz == 108 || sz == 124); return r; } static int stbi__bmp_test(stbi__context *s) { int r = stbi__bmp_test_raw(s); stbi__rewind(s); return r; } // returns 0..31 for the highest set bit static int stbi__high_bit(unsigned int z) { int n=0; if (z == 0) return -1; if (z >= 0x10000) n += 16, z >>= 16; if (z >= 0x00100) n += 8, z >>= 8; if (z >= 0x00010) n += 4, z >>= 4; if (z >= 0x00004) n += 2, z >>= 2; if (z >= 0x00002) n += 1, z >>= 1; return n; } static int stbi__bitcount(unsigned int a) { a = (a & 0x55555555) + ((a >> 1) & 0x55555555); // max 2 a = (a & 0x33333333) + ((a >> 2) & 0x33333333); // max 4 a = (a + (a >> 4)) & 0x0f0f0f0f; // max 8 per 4, now 8 bits a = (a + (a >> 8)); // max 16 per 8 bits a = (a + (a >> 16)); // max 32 per 8 bits return a & 0xff; } static int stbi__shiftsigned(int v, int shift, int bits) { int result; int z=0; if (shift < 0) v <<= -shift; else v >>= shift; result = v; z = bits; while (z < 8) { result += v >> z; z += bits; } return result; } typedef struct { int bpp, offset, hsz; unsigned int mr,mg,mb,ma, all_a; } stbi__bmp_data; static void *stbi__bmp_parse_header(stbi__context *s, stbi__bmp_data *info) { int hsz; if (stbi__get8(s) != 'B' || stbi__get8(s) != 'M') return stbi__errpuc("not BMP", "Corrupt BMP"); stbi__get32le(s); // discard filesize stbi__get16le(s); // discard reserved stbi__get16le(s); // discard reserved info->offset = stbi__get32le(s); info->hsz = hsz = stbi__get32le(s); info->mr = info->mg = info->mb = info->ma = 0; if (hsz != 12 && hsz != 40 && hsz != 56 && hsz != 108 && hsz != 124) return stbi__errpuc("unknown BMP", "BMP type not supported: unknown"); if (hsz == 12) { s->img_x = stbi__get16le(s); s->img_y = stbi__get16le(s); } else { s->img_x = stbi__get32le(s); s->img_y = stbi__get32le(s); } if (stbi__get16le(s) != 1) return stbi__errpuc("bad BMP", "bad BMP"); info->bpp = stbi__get16le(s); if (info->bpp == 1) return stbi__errpuc("monochrome", "BMP type not supported: 1-bit"); if (hsz != 12) { int compress = stbi__get32le(s); if (compress == 1 || compress == 2) return stbi__errpuc("BMP RLE", "BMP type not supported: RLE"); stbi__get32le(s); // discard sizeof stbi__get32le(s); // discard hres stbi__get32le(s); // discard vres stbi__get32le(s); // discard colorsused stbi__get32le(s); // discard max important if (hsz == 40 || hsz == 56) { if (hsz == 56) { stbi__get32le(s); stbi__get32le(s); stbi__get32le(s); stbi__get32le(s); } if (info->bpp == 16 || info->bpp == 32) { if (compress == 0) { if (info->bpp == 32) { info->mr = 0xffu << 16; info->mg = 0xffu << 8; info->mb = 0xffu << 0; info->ma = 0xffu << 24; info->all_a = 0; // if all_a is 0 at end, then we loaded alpha channel but it was all 0 } else { info->mr = 31u << 10; info->mg = 31u << 5; info->mb = 31u << 0; } } else if (compress == 3) { info->mr = stbi__get32le(s); info->mg = stbi__get32le(s); info->mb = stbi__get32le(s); // not documented, but generated by photoshop and handled by mspaint if (info->mr == info->mg && info->mg == info->mb) { // ?!?!? return stbi__errpuc("bad BMP", "bad BMP"); } } else return stbi__errpuc("bad BMP", "bad BMP"); } } else { int i; if (hsz != 108 && hsz != 124) return stbi__errpuc("bad BMP", "bad BMP"); info->mr = stbi__get32le(s); info->mg = stbi__get32le(s); info->mb = stbi__get32le(s); info->ma = stbi__get32le(s); stbi__get32le(s); // discard color space for (i=0; i < 12; ++i) stbi__get32le(s); // discard color space parameters if (hsz == 124) { stbi__get32le(s); // discard rendering intent stbi__get32le(s); // discard offset of profile data stbi__get32le(s); // discard size of profile data stbi__get32le(s); // discard reserved } } } return (void *) 1; } static void *stbi__bmp_load(stbi__context *s, int *x, int *y, int *comp, int req_comp, stbi__result_info *ri) { stbi_uc *out; unsigned int mr=0,mg=0,mb=0,ma=0, all_a; stbi_uc pal[256][4]; int psize=0,i,j,width; int flip_vertically, pad, target; stbi__bmp_data info; STBI_NOTUSED(ri); info.all_a = 255; if (stbi__bmp_parse_header(s, &info) == NULL) return NULL; // error code already set flip_vertically = ((int) s->img_y) > 0; s->img_y = abs((int) s->img_y); mr = info.mr; mg = info.mg; mb = info.mb; ma = info.ma; all_a = info.all_a; if (info.hsz == 12) { if (info.bpp < 24) psize = (info.offset - 14 - 24) / 3; } else { if (info.bpp < 16) psize = (info.offset - 14 - info.hsz) >> 2; } s->img_n = ma ? 4 : 3; if (req_comp && req_comp >= 3) // we can directly decode 3 or 4 target = req_comp; else target = s->img_n; // if they want monochrome, we'll post-convert // sanity-check size if (!stbi__mad3sizes_valid(target, s->img_x, s->img_y, 0)) return stbi__errpuc("too large", "Corrupt BMP"); out = (stbi_uc *) stbi__malloc_mad3(target, s->img_x, s->img_y, 0); if (!out) return stbi__errpuc("outofmem", "Out of memory"); if (info.bpp < 16) { int z=0; if (psize == 0 || psize > 256) { STBI_FREE(out); return stbi__errpuc("invalid", "Corrupt BMP"); } for (i=0; i < psize; ++i) { pal[i][2] = stbi__get8(s); pal[i][1] = stbi__get8(s); pal[i][0] = stbi__get8(s); if (info.hsz != 12) stbi__get8(s); pal[i][3] = 255; } stbi__skip(s, info.offset - 14 - info.hsz - psize * (info.hsz == 12 ? 3 : 4)); if (info.bpp == 4) width = (s->img_x + 1) >> 1; else if (info.bpp == 8) width = s->img_x; else { STBI_FREE(out); return stbi__errpuc("bad bpp", "Corrupt BMP"); } pad = (-width)&3; for (j=0; j < (int) s->img_y; ++j) { for (i=0; i < (int) s->img_x; i += 2) { int v=stbi__get8(s),v2=0; if (info.bpp == 4) { v2 = v & 15; v >>= 4; } out[z++] = pal[v][0]; out[z++] = pal[v][1]; out[z++] = pal[v][2]; if (target == 4) out[z++] = 255; if (i+1 == (int) s->img_x) break; v = (info.bpp == 8) ? stbi__get8(s) : v2; out[z++] = pal[v][0]; out[z++] = pal[v][1]; out[z++] = pal[v][2]; if (target == 4) out[z++] = 255; } stbi__skip(s, pad); } } else { int rshift=0,gshift=0,bshift=0,ashift=0,rcount=0,gcount=0,bcount=0,acount=0; int z = 0; int easy=0; stbi__skip(s, info.offset - 14 - info.hsz); if (info.bpp == 24) width = 3 * s->img_x; else if (info.bpp == 16) width = 2*s->img_x; else /* bpp = 32 and pad = 0 */ width=0; pad = (-width) & 3; if (info.bpp == 24) { easy = 1; } else if (info.bpp == 32) { if (mb == 0xff && mg == 0xff00 && mr == 0x00ff0000 && ma == 0xff000000) easy = 2; } if (!easy) { if (!mr || !mg || !mb) { STBI_FREE(out); return stbi__errpuc("bad masks", "Corrupt BMP"); } // right shift amt to put high bit in position #7 rshift = stbi__high_bit(mr)-7; rcount = stbi__bitcount(mr); gshift = stbi__high_bit(mg)-7; gcount = stbi__bitcount(mg); bshift = stbi__high_bit(mb)-7; bcount = stbi__bitcount(mb); ashift = stbi__high_bit(ma)-7; acount = stbi__bitcount(ma); } for (j=0; j < (int) s->img_y; ++j) { if (easy) { for (i=0; i < (int) s->img_x; ++i) { unsigned char a; out[z+2] = stbi__get8(s); out[z+1] = stbi__get8(s); out[z+0] = stbi__get8(s); z += 3; a = (easy == 2 ? stbi__get8(s) : 255); all_a |= a; if (target == 4) out[z++] = a; } } else { int bpp = info.bpp; for (i=0; i < (int) s->img_x; ++i) { stbi__uint32 v = (bpp == 16 ? (stbi__uint32) stbi__get16le(s) : stbi__get32le(s)); int a; out[z++] = STBI__BYTECAST(stbi__shiftsigned(v & mr, rshift, rcount)); out[z++] = STBI__BYTECAST(stbi__shiftsigned(v & mg, gshift, gcount)); out[z++] = STBI__BYTECAST(stbi__shiftsigned(v & mb, bshift, bcount)); a = (ma ? stbi__shiftsigned(v & ma, ashift, acount) : 255); all_a |= a; if (target == 4) out[z++] = STBI__BYTECAST(a); } } stbi__skip(s, pad); } } // if alpha channel is all 0s, replace with all 255s if (target == 4 && all_a == 0) for (i=4*s->img_x*s->img_y-1; i >= 0; i -= 4) out[i] = 255; if (flip_vertically) { stbi_uc t; for (j=0; j < (int) s->img_y>>1; ++j) { stbi_uc *p1 = out + j *s->img_x*target; stbi_uc *p2 = out + (s->img_y-1-j)*s->img_x*target; for (i=0; i < (int) s->img_x*target; ++i) { t = p1[i], p1[i] = p2[i], p2[i] = t; } } } if (req_comp && req_comp != target) { out = stbi__convert_format(out, target, req_comp, s->img_x, s->img_y); if (out == NULL) return out; // stbi__convert_format frees input on failure } *x = s->img_x; *y = s->img_y; if (comp) *comp = s->img_n; return out; } #endif // Targa Truevision - TGA // by Jonathan Dummer #ifndef STBI_NO_TGA // returns STBI_rgb or whatever, 0 on error static int stbi__tga_get_comp(int bits_per_pixel, int is_grey, int* is_rgb16) { // only RGB or RGBA (incl. 16bit) or grey allowed if(is_rgb16) *is_rgb16 = 0; switch(bits_per_pixel) { case 8: return STBI_grey; case 16: if(is_grey) return STBI_grey_alpha; // else: fall-through case 15: if(is_rgb16) *is_rgb16 = 1; return STBI_rgb; case 24: // fall-through case 32: return bits_per_pixel/8; default: return 0; } } static int stbi__tga_info(stbi__context *s, int *x, int *y, int *comp) { int tga_w, tga_h, tga_comp, tga_image_type, tga_bits_per_pixel, tga_colormap_bpp; int sz, tga_colormap_type; stbi__get8(s); // discard Offset tga_colormap_type = stbi__get8(s); // colormap type if( tga_colormap_type > 1 ) { stbi__rewind(s); return 0; // only RGB or indexed allowed } tga_image_type = stbi__get8(s); // image type if ( tga_colormap_type == 1 ) { // colormapped (paletted) image if (tga_image_type != 1 && tga_image_type != 9) { stbi__rewind(s); return 0; } stbi__skip(s,4); // skip index of first colormap entry and number of entries sz = stbi__get8(s); // check bits per palette color entry if ( (sz != 8) && (sz != 15) && (sz != 16) && (sz != 24) && (sz != 32) ) { stbi__rewind(s); return 0; } stbi__skip(s,4); // skip image x and y origin tga_colormap_bpp = sz; } else { // "normal" image w/o colormap - only RGB or grey allowed, +/- RLE if ( (tga_image_type != 2) && (tga_image_type != 3) && (tga_image_type != 10) && (tga_image_type != 11) ) { stbi__rewind(s); return 0; // only RGB or grey allowed, +/- RLE } stbi__skip(s,9); // skip colormap specification and image x/y origin tga_colormap_bpp = 0; } tga_w = stbi__get16le(s); if( tga_w < 1 ) { stbi__rewind(s); return 0; // test width } tga_h = stbi__get16le(s); if( tga_h < 1 ) { stbi__rewind(s); return 0; // test height } tga_bits_per_pixel = stbi__get8(s); // bits per pixel stbi__get8(s); // ignore alpha bits if (tga_colormap_bpp != 0) { if((tga_bits_per_pixel != 8) && (tga_bits_per_pixel != 16)) { // when using a colormap, tga_bits_per_pixel is the size of the indexes // I don't think anything but 8 or 16bit indexes makes sense stbi__rewind(s); return 0; } tga_comp = stbi__tga_get_comp(tga_colormap_bpp, 0, NULL); } else { tga_comp = stbi__tga_get_comp(tga_bits_per_pixel, (tga_image_type == 3) || (tga_image_type == 11), NULL); } if(!tga_comp) { stbi__rewind(s); return 0; } if (x) *x = tga_w; if (y) *y = tga_h; if (comp) *comp = tga_comp; return 1; // seems to have passed everything } static int stbi__tga_test(stbi__context *s) { int res = 0; int sz, tga_color_type; stbi__get8(s); // discard Offset tga_color_type = stbi__get8(s); // color type if ( tga_color_type > 1 ) goto errorEnd; // only RGB or indexed allowed sz = stbi__get8(s); // image type if ( tga_color_type == 1 ) { // colormapped (paletted) image if (sz != 1 && sz != 9) goto errorEnd; // colortype 1 demands image type 1 or 9 stbi__skip(s,4); // skip index of first colormap entry and number of entries sz = stbi__get8(s); // check bits per palette color entry if ( (sz != 8) && (sz != 15) && (sz != 16) && (sz != 24) && (sz != 32) ) goto errorEnd; stbi__skip(s,4); // skip image x and y origin } else { // "normal" image w/o colormap if ( (sz != 2) && (sz != 3) && (sz != 10) && (sz != 11) ) goto errorEnd; // only RGB or grey allowed, +/- RLE stbi__skip(s,9); // skip colormap specification and image x/y origin } if ( stbi__get16le(s) < 1 ) goto errorEnd; // test width if ( stbi__get16le(s) < 1 ) goto errorEnd; // test height sz = stbi__get8(s); // bits per pixel if ( (tga_color_type == 1) && (sz != 8) && (sz != 16) ) goto errorEnd; // for colormapped images, bpp is size of an index if ( (sz != 8) && (sz != 15) && (sz != 16) && (sz != 24) && (sz != 32) ) goto errorEnd; res = 1; // if we got this far, everything's good and we can return 1 instead of 0 errorEnd: stbi__rewind(s); return res; } // read 16bit value and convert to 24bit RGB static void stbi__tga_read_rgb16(stbi__context *s, stbi_uc* out) { stbi__uint16 px = (stbi__uint16)stbi__get16le(s); stbi__uint16 fiveBitMask = 31; // we have 3 channels with 5bits each int r = (px >> 10) & fiveBitMask; int g = (px >> 5) & fiveBitMask; int b = px & fiveBitMask; // Note that this saves the data in RGB(A) order, so it doesn't need to be swapped later out[0] = (stbi_uc)((r * 255)/31); out[1] = (stbi_uc)((g * 255)/31); out[2] = (stbi_uc)((b * 255)/31); // some people claim that the most significant bit might be used for alpha // (possibly if an alpha-bit is set in the "image descriptor byte") // but that only made 16bit test images completely translucent.. // so let's treat all 15 and 16bit TGAs as RGB with no alpha. } static void *stbi__tga_load(stbi__context *s, int *x, int *y, int *comp, int req_comp, stbi__result_info *ri) { // read in the TGA header stuff int tga_offset = stbi__get8(s); int tga_indexed = stbi__get8(s); int tga_image_type = stbi__get8(s); int tga_is_RLE = 0; int tga_palette_start = stbi__get16le(s); int tga_palette_len = stbi__get16le(s); int tga_palette_bits = stbi__get8(s); int tga_x_origin = stbi__get16le(s); int tga_y_origin = stbi__get16le(s); int tga_width = stbi__get16le(s); int tga_height = stbi__get16le(s); int tga_bits_per_pixel = stbi__get8(s); int tga_comp, tga_rgb16=0; int tga_inverted = stbi__get8(s); // int tga_alpha_bits = tga_inverted & 15; // the 4 lowest bits - unused (useless?) // image data unsigned char *tga_data; unsigned char *tga_palette = NULL; int i, j; unsigned char raw_data[4] = {0}; int RLE_count = 0; int RLE_repeating = 0; int read_next_pixel = 1; STBI_NOTUSED(ri); // do a tiny bit of precessing if ( tga_image_type >= 8 ) { tga_image_type -= 8; tga_is_RLE = 1; } tga_inverted = 1 - ((tga_inverted >> 5) & 1); // If I'm paletted, then I'll use the number of bits from the palette if ( tga_indexed ) tga_comp = stbi__tga_get_comp(tga_palette_bits, 0, &tga_rgb16); else tga_comp = stbi__tga_get_comp(tga_bits_per_pixel, (tga_image_type == 3), &tga_rgb16); if(!tga_comp) // shouldn't really happen, stbi__tga_test() should have ensured basic consistency return stbi__errpuc("bad format", "Can't find out TGA pixelformat"); // tga info *x = tga_width; *y = tga_height; if (comp) *comp = tga_comp; if (!stbi__mad3sizes_valid(tga_width, tga_height, tga_comp, 0)) return stbi__errpuc("too large", "Corrupt TGA"); tga_data = (unsigned char*)stbi__malloc_mad3(tga_width, tga_height, tga_comp, 0); if (!tga_data) return stbi__errpuc("outofmem", "Out of memory"); // skip to the data's starting position (offset usually = 0) stbi__skip(s, tga_offset ); if ( !tga_indexed && !tga_is_RLE && !tga_rgb16 ) { for (i=0; i < tga_height; ++i) { int row = tga_inverted ? tga_height -i - 1 : i; stbi_uc *tga_row = tga_data + row*tga_width*tga_comp; stbi__getn(s, tga_row, tga_width * tga_comp); } } else { // do I need to load a palette? if ( tga_indexed) { // any data to skip? (offset usually = 0) stbi__skip(s, tga_palette_start ); // load the palette tga_palette = (unsigned char*)stbi__malloc_mad2(tga_palette_len, tga_comp, 0); if (!tga_palette) { STBI_FREE(tga_data); return stbi__errpuc("outofmem", "Out of memory"); } if (tga_rgb16) { stbi_uc *pal_entry = tga_palette; STBI_ASSERT(tga_comp == STBI_rgb); for (i=0; i < tga_palette_len; ++i) { stbi__tga_read_rgb16(s, pal_entry); pal_entry += tga_comp; } } else if (!stbi__getn(s, tga_palette, tga_palette_len * tga_comp)) { STBI_FREE(tga_data); STBI_FREE(tga_palette); return stbi__errpuc("bad palette", "Corrupt TGA"); } } // load the data for (i=0; i < tga_width * tga_height; ++i) { // if I'm in RLE mode, do I need to get a RLE stbi__pngchunk? if ( tga_is_RLE ) { if ( RLE_count == 0 ) { // yep, get the next byte as a RLE command int RLE_cmd = stbi__get8(s); RLE_count = 1 + (RLE_cmd & 127); RLE_repeating = RLE_cmd >> 7; read_next_pixel = 1; } else if ( !RLE_repeating ) { read_next_pixel = 1; } } else { read_next_pixel = 1; } // OK, if I need to read a pixel, do it now if ( read_next_pixel ) { // load however much data we did have if ( tga_indexed ) { // read in index, then perform the lookup int pal_idx = (tga_bits_per_pixel == 8) ? stbi__get8(s) : stbi__get16le(s); if ( pal_idx >= tga_palette_len ) { // invalid index pal_idx = 0; } pal_idx *= tga_comp; for (j = 0; j < tga_comp; ++j) { raw_data[j] = tga_palette[pal_idx+j]; } } else if(tga_rgb16) { STBI_ASSERT(tga_comp == STBI_rgb); stbi__tga_read_rgb16(s, raw_data); } else { // read in the data raw for (j = 0; j < tga_comp; ++j) { raw_data[j] = stbi__get8(s); } } // clear the reading flag for the next pixel read_next_pixel = 0; } // end of reading a pixel // copy data for (j = 0; j < tga_comp; ++j) tga_data[i*tga_comp+j] = raw_data[j]; // in case we're in RLE mode, keep counting down --RLE_count; } // do I need to invert the image? if ( tga_inverted ) { for (j = 0; j*2 < tga_height; ++j) { int index1 = j * tga_width * tga_comp; int index2 = (tga_height - 1 - j) * tga_width * tga_comp; for (i = tga_width * tga_comp; i > 0; --i) { unsigned char temp = tga_data[index1]; tga_data[index1] = tga_data[index2]; tga_data[index2] = temp; ++index1; ++index2; } } } // clear my palette, if I had one if ( tga_palette != NULL ) { STBI_FREE( tga_palette ); } } // swap RGB - if the source data was RGB16, it already is in the right order if (tga_comp >= 3 && !tga_rgb16) { unsigned char* tga_pixel = tga_data; for (i=0; i < tga_width * tga_height; ++i) { unsigned char temp = tga_pixel[0]; tga_pixel[0] = tga_pixel[2]; tga_pixel[2] = temp; tga_pixel += tga_comp; } } // convert to target component count if (req_comp && req_comp != tga_comp) tga_data = stbi__convert_format(tga_data, tga_comp, req_comp, tga_width, tga_height); // the things I do to get rid of an error message, and yet keep // Microsoft's C compilers happy... [8^( tga_palette_start = tga_palette_len = tga_palette_bits = tga_x_origin = tga_y_origin = 0; // OK, done return tga_data; } #endif // ************************************************************************************************* // Photoshop PSD loader -- PD by Thatcher Ulrich, integration by Nicolas Schulz, tweaked by STB #ifndef STBI_NO_PSD static int stbi__psd_test(stbi__context *s) { int r = (stbi__get32be(s) == 0x38425053); stbi__rewind(s); return r; } static int stbi__psd_decode_rle(stbi__context *s, stbi_uc *p, int pixelCount) { int count, nleft, len; count = 0; while ((nleft = pixelCount - count) > 0) { len = stbi__get8(s); if (len == 128) { // No-op. } else if (len < 128) { // Copy next len+1 bytes literally. len++; if (len > nleft) return 0; // corrupt data count += len; while (len) { *p = stbi__get8(s); p += 4; len--; } } else if (len > 128) { stbi_uc val; // Next -len+1 bytes in the dest are replicated from next source byte. // (Interpret len as a negative 8-bit int.) len = 257 - len; if (len > nleft) return 0; // corrupt data val = stbi__get8(s); count += len; while (len) { *p = val; p += 4; len--; } } } return 1; } static void *stbi__psd_load(stbi__context *s, int *x, int *y, int *comp, int req_comp, stbi__result_info *ri, int bpc) { int pixelCount; int channelCount, compression; int channel, i; int bitdepth; int w,h; stbi_uc *out; STBI_NOTUSED(ri); // Check identifier if (stbi__get32be(s) != 0x38425053) // "8BPS" return stbi__errpuc("not PSD", "Corrupt PSD image"); // Check file type version. if (stbi__get16be(s) != 1) return stbi__errpuc("wrong version", "Unsupported version of PSD image"); // Skip 6 reserved bytes. stbi__skip(s, 6 ); // Read the number of channels (R, G, B, A, etc). channelCount = stbi__get16be(s); if (channelCount < 0 || channelCount > 16) return stbi__errpuc("wrong channel count", "Unsupported number of channels in PSD image"); // Read the rows and columns of the image. h = stbi__get32be(s); w = stbi__get32be(s); // Make sure the depth is 8 bits. bitdepth = stbi__get16be(s); if (bitdepth != 8 && bitdepth != 16) return stbi__errpuc("unsupported bit depth", "PSD bit depth is not 8 or 16 bit"); // Make sure the color mode is RGB. // Valid options are: // 0: Bitmap // 1: Grayscale // 2: Indexed color // 3: RGB color // 4: CMYK color // 7: Multichannel // 8: Duotone // 9: Lab color if (stbi__get16be(s) != 3) return stbi__errpuc("wrong color format", "PSD is not in RGB color format"); // Skip the Mode Data. (It's the palette for indexed color; other info for other modes.) stbi__skip(s,stbi__get32be(s) ); // Skip the image resources. (resolution, pen tool paths, etc) stbi__skip(s, stbi__get32be(s) ); // Skip the reserved data. stbi__skip(s, stbi__get32be(s) ); // Find out if the data is compressed. // Known values: // 0: no compression // 1: RLE compressed compression = stbi__get16be(s); if (compression > 1) return stbi__errpuc("bad compression", "PSD has an unknown compression format"); // Check size if (!stbi__mad3sizes_valid(4, w, h, 0)) return stbi__errpuc("too large", "Corrupt PSD"); // Create the destination image. if (!compression && bitdepth == 16 && bpc == 16) { out = (stbi_uc *) stbi__malloc_mad3(8, w, h, 0); ri->bits_per_channel = 16; } else out = (stbi_uc *) stbi__malloc(4 * w*h); if (!out) return stbi__errpuc("outofmem", "Out of memory"); pixelCount = w*h; // Initialize the data to zero. //memset( out, 0, pixelCount * 4 ); // Finally, the image data. if (compression) { // RLE as used by .PSD and .TIFF // Loop until you get the number of unpacked bytes you are expecting: // Read the next source byte into n. // If n is between 0 and 127 inclusive, copy the next n+1 bytes literally. // Else if n is between -127 and -1 inclusive, copy the next byte -n+1 times. // Else if n is 128, noop. // Endloop // The RLE-compressed data is preceeded by a 2-byte data count for each row in the data, // which we're going to just skip. stbi__skip(s, h * channelCount * 2 ); // Read the RLE data by channel. for (channel = 0; channel < 4; channel++) { stbi_uc *p; p = out+channel; if (channel >= channelCount) { // Fill this channel with default data. for (i = 0; i < pixelCount; i++, p += 4) *p = (channel == 3 ? 255 : 0); } else { // Read the RLE data. if (!stbi__psd_decode_rle(s, p, pixelCount)) { STBI_FREE(out); return stbi__errpuc("corrupt", "bad RLE data"); } } } } else { // We're at the raw image data. It's each channel in order (Red, Green, Blue, Alpha, ...) // where each channel consists of an 8-bit (or 16-bit) value for each pixel in the image. // Read the data by channel. for (channel = 0; channel < 4; channel++) { if (channel >= channelCount) { // Fill this channel with default data. if (bitdepth == 16 && bpc == 16) { stbi__uint16 *q = ((stbi__uint16 *) out) + channel; stbi__uint16 val = channel == 3 ? 65535 : 0; for (i = 0; i < pixelCount; i++, q += 4) *q = val; } else { stbi_uc *p = out+channel; stbi_uc val = channel == 3 ? 255 : 0; for (i = 0; i < pixelCount; i++, p += 4) *p = val; } } else { if (ri->bits_per_channel == 16) { // output bpc stbi__uint16 *q = ((stbi__uint16 *) out) + channel; for (i = 0; i < pixelCount; i++, q += 4) *q = (stbi__uint16) stbi__get16be(s); } else { stbi_uc *p = out+channel; if (bitdepth == 16) { // input bpc for (i = 0; i < pixelCount; i++, p += 4) *p = (stbi_uc) (stbi__get16be(s) >> 8); } else { for (i = 0; i < pixelCount; i++, p += 4) *p = stbi__get8(s); } } } } } // remove weird white matte from PSD if (channelCount >= 4) { if (ri->bits_per_channel == 16) { for (i=0; i < w*h; ++i) { stbi__uint16 *pixel = (stbi__uint16 *) out + 4*i; if (pixel[3] != 0 && pixel[3] != 65535) { float a = pixel[3] / 65535.0f; float ra = 1.0f / a; float inv_a = 65535.0f * (1 - ra); pixel[0] = (stbi__uint16) (pixel[0]*ra + inv_a); pixel[1] = (stbi__uint16) (pixel[1]*ra + inv_a); pixel[2] = (stbi__uint16) (pixel[2]*ra + inv_a); } } } else { for (i=0; i < w*h; ++i) { unsigned char *pixel = out + 4*i; if (pixel[3] != 0 && pixel[3] != 255) { float a = pixel[3] / 255.0f; float ra = 1.0f / a; float inv_a = 255.0f * (1 - ra); pixel[0] = (unsigned char) (pixel[0]*ra + inv_a); pixel[1] = (unsigned char) (pixel[1]*ra + inv_a); pixel[2] = (unsigned char) (pixel[2]*ra + inv_a); } } } } // convert to desired output format if (req_comp && req_comp != 4) { if (ri->bits_per_channel == 16) out = (stbi_uc *) stbi__convert_format16((stbi__uint16 *) out, 4, req_comp, w, h); else out = stbi__convert_format(out, 4, req_comp, w, h); if (out == NULL) return out; // stbi__convert_format frees input on failure } if (comp) *comp = 4; *y = h; *x = w; return out; } #endif // ************************************************************************************************* // Softimage PIC loader // by Tom Seddon // // See http://softimage.wiki.softimage.com/index.php/INFO:_PIC_file_format // See http://ozviz.wasp.uwa.edu.au/~pbourke/dataformats/softimagepic/ #ifndef STBI_NO_PIC static int stbi__pic_is4(stbi__context *s,const char *str) { int i; for (i=0; i<4; ++i) if (stbi__get8(s) != (stbi_uc)str[i]) return 0; return 1; } static int stbi__pic_test_core(stbi__context *s) { int i; if (!stbi__pic_is4(s,"\x53\x80\xF6\x34")) return 0; for(i=0;i<84;++i) stbi__get8(s); if (!stbi__pic_is4(s,"PICT")) return 0; return 1; } typedef struct { stbi_uc size,type,channel; } stbi__pic_packet; static stbi_uc *stbi__readval(stbi__context *s, int channel, stbi_uc *dest) { int mask=0x80, i; for (i=0; i<4; ++i, mask>>=1) { if (channel & mask) { if (stbi__at_eof(s)) return stbi__errpuc("bad file","PIC file too short"); dest[i]=stbi__get8(s); } } return dest; } static void stbi__copyval(int channel,stbi_uc *dest,const stbi_uc *src) { int mask=0x80,i; for (i=0;i<4; ++i, mask>>=1) if (channel&mask) dest[i]=src[i]; } static stbi_uc *stbi__pic_load_core(stbi__context *s,int width,int height,int *comp, stbi_uc *result) { int act_comp=0,num_packets=0,y,chained; stbi__pic_packet packets[10]; // this will (should...) cater for even some bizarre stuff like having data // for the same channel in multiple packets. do { stbi__pic_packet *packet; if (num_packets==sizeof(packets)/sizeof(packets[0])) return stbi__errpuc("bad format","too many packets"); packet = &packets[num_packets++]; chained = stbi__get8(s); packet->size = stbi__get8(s); packet->type = stbi__get8(s); packet->channel = stbi__get8(s); act_comp |= packet->channel; if (stbi__at_eof(s)) return stbi__errpuc("bad file","file too short (reading packets)"); if (packet->size != 8) return stbi__errpuc("bad format","packet isn't 8bpp"); } while (chained); *comp = (act_comp & 0x10 ? 4 : 3); // has alpha channel? for(y=0; ytype) { default: return stbi__errpuc("bad format","packet has bad compression type"); case 0: {//uncompressed int x; for(x=0;xchannel,dest)) return 0; break; } case 1://Pure RLE { int left=width, i; while (left>0) { stbi_uc count,value[4]; count=stbi__get8(s); if (stbi__at_eof(s)) return stbi__errpuc("bad file","file too short (pure read count)"); if (count > left) count = (stbi_uc) left; if (!stbi__readval(s,packet->channel,value)) return 0; for(i=0; ichannel,dest,value); left -= count; } } break; case 2: {//Mixed RLE int left=width; while (left>0) { int count = stbi__get8(s), i; if (stbi__at_eof(s)) return stbi__errpuc("bad file","file too short (mixed read count)"); if (count >= 128) { // Repeated stbi_uc value[4]; if (count==128) count = stbi__get16be(s); else count -= 127; if (count > left) return stbi__errpuc("bad file","scanline overrun"); if (!stbi__readval(s,packet->channel,value)) return 0; for(i=0;ichannel,dest,value); } else { // Raw ++count; if (count>left) return stbi__errpuc("bad file","scanline overrun"); for(i=0;ichannel,dest)) return 0; } left-=count; } break; } } } } return result; } static void *stbi__pic_load(stbi__context *s,int *px,int *py,int *comp,int req_comp, stbi__result_info *ri) { stbi_uc *result; int i, x,y, internal_comp; STBI_NOTUSED(ri); if (!comp) comp = &internal_comp; for (i=0; i<92; ++i) stbi__get8(s); x = stbi__get16be(s); y = stbi__get16be(s); if (stbi__at_eof(s)) return stbi__errpuc("bad file","file too short (pic header)"); if (!stbi__mad3sizes_valid(x, y, 4, 0)) return stbi__errpuc("too large", "PIC image too large to decode"); stbi__get32be(s); //skip `ratio' stbi__get16be(s); //skip `fields' stbi__get16be(s); //skip `pad' // intermediate buffer is RGBA result = (stbi_uc *) stbi__malloc_mad3(x, y, 4, 0); memset(result, 0xff, x*y*4); if (!stbi__pic_load_core(s,x,y,comp, result)) { STBI_FREE(result); result=0; } *px = x; *py = y; if (req_comp == 0) req_comp = *comp; result=stbi__convert_format(result,4,req_comp,x,y); return result; } static int stbi__pic_test(stbi__context *s) { int r = stbi__pic_test_core(s); stbi__rewind(s); return r; } #endif // ************************************************************************************************* // GIF loader -- public domain by Jean-Marc Lienher -- simplified/shrunk by stb #ifndef STBI_NO_GIF typedef struct { stbi__int16 prefix; stbi_uc first; stbi_uc suffix; } stbi__gif_lzw; typedef struct { int w,h; stbi_uc *out, *old_out; // output buffer (always 4 components) int flags, bgindex, ratio, transparent, eflags, delay; stbi_uc pal[256][4]; stbi_uc lpal[256][4]; stbi__gif_lzw codes[4096]; stbi_uc *color_table; int parse, step; int lflags; int start_x, start_y; int max_x, max_y; int cur_x, cur_y; int line_size; } stbi__gif; static int stbi__gif_test_raw(stbi__context *s) { int sz; if (stbi__get8(s) != 'G' || stbi__get8(s) != 'I' || stbi__get8(s) != 'F' || stbi__get8(s) != '8') return 0; sz = stbi__get8(s); if (sz != '9' && sz != '7') return 0; if (stbi__get8(s) != 'a') return 0; return 1; } static int stbi__gif_test(stbi__context *s) { int r = stbi__gif_test_raw(s); stbi__rewind(s); return r; } static void stbi__gif_parse_colortable(stbi__context *s, stbi_uc pal[256][4], int num_entries, int transp) { int i; for (i=0; i < num_entries; ++i) { pal[i][2] = stbi__get8(s); pal[i][1] = stbi__get8(s); pal[i][0] = stbi__get8(s); pal[i][3] = transp == i ? 0 : 255; } } static int stbi__gif_header(stbi__context *s, stbi__gif *g, int *comp, int is_info) { stbi_uc version; if (stbi__get8(s) != 'G' || stbi__get8(s) != 'I' || stbi__get8(s) != 'F' || stbi__get8(s) != '8') return stbi__err("not GIF", "Corrupt GIF"); version = stbi__get8(s); if (version != '7' && version != '9') return stbi__err("not GIF", "Corrupt GIF"); if (stbi__get8(s) != 'a') return stbi__err("not GIF", "Corrupt GIF"); stbi__g_failure_reason = ""; g->w = stbi__get16le(s); g->h = stbi__get16le(s); g->flags = stbi__get8(s); g->bgindex = stbi__get8(s); g->ratio = stbi__get8(s); g->transparent = -1; if (comp != 0) *comp = 4; // can't actually tell whether it's 3 or 4 until we parse the comments if (is_info) return 1; if (g->flags & 0x80) stbi__gif_parse_colortable(s,g->pal, 2 << (g->flags & 7), -1); return 1; } static int stbi__gif_info_raw(stbi__context *s, int *x, int *y, int *comp) { stbi__gif* g = (stbi__gif*) stbi__malloc(sizeof(stbi__gif)); if (!stbi__gif_header(s, g, comp, 1)) { STBI_FREE(g); stbi__rewind( s ); return 0; } if (x) *x = g->w; if (y) *y = g->h; STBI_FREE(g); return 1; } static void stbi__out_gif_code(stbi__gif *g, stbi__uint16 code) { stbi_uc *p, *c; // recurse to decode the prefixes, since the linked-list is backwards, // and working backwards through an interleaved image would be nasty if (g->codes[code].prefix >= 0) stbi__out_gif_code(g, g->codes[code].prefix); if (g->cur_y >= g->max_y) return; p = &g->out[g->cur_x + g->cur_y]; c = &g->color_table[g->codes[code].suffix * 4]; if (c[3] >= 128) { p[0] = c[2]; p[1] = c[1]; p[2] = c[0]; p[3] = c[3]; } g->cur_x += 4; if (g->cur_x >= g->max_x) { g->cur_x = g->start_x; g->cur_y += g->step; while (g->cur_y >= g->max_y && g->parse > 0) { g->step = (1 << g->parse) * g->line_size; g->cur_y = g->start_y + (g->step >> 1); --g->parse; } } } static stbi_uc *stbi__process_gif_raster(stbi__context *s, stbi__gif *g) { stbi_uc lzw_cs; stbi__int32 len, init_code; stbi__uint32 first; stbi__int32 codesize, codemask, avail, oldcode, bits, valid_bits, clear; stbi__gif_lzw *p; lzw_cs = stbi__get8(s); if (lzw_cs > 12) return NULL; clear = 1 << lzw_cs; first = 1; codesize = lzw_cs + 1; codemask = (1 << codesize) - 1; bits = 0; valid_bits = 0; for (init_code = 0; init_code < clear; init_code++) { g->codes[init_code].prefix = -1; g->codes[init_code].first = (stbi_uc) init_code; g->codes[init_code].suffix = (stbi_uc) init_code; } // support no starting clear code avail = clear+2; oldcode = -1; len = 0; for(;;) { if (valid_bits < codesize) { if (len == 0) { len = stbi__get8(s); // start new block if (len == 0) return g->out; } --len; bits |= (stbi__int32) stbi__get8(s) << valid_bits; valid_bits += 8; } else { stbi__int32 code = bits & codemask; bits >>= codesize; valid_bits -= codesize; // @OPTIMIZE: is there some way we can accelerate the non-clear path? if (code == clear) { // clear code codesize = lzw_cs + 1; codemask = (1 << codesize) - 1; avail = clear + 2; oldcode = -1; first = 0; } else if (code == clear + 1) { // end of stream code stbi__skip(s, len); while ((len = stbi__get8(s)) > 0) stbi__skip(s,len); return g->out; } else if (code <= avail) { if (first) return stbi__errpuc("no clear code", "Corrupt GIF"); if (oldcode >= 0) { p = &g->codes[avail++]; if (avail > 4096) return stbi__errpuc("too many codes", "Corrupt GIF"); p->prefix = (stbi__int16) oldcode; p->first = g->codes[oldcode].first; p->suffix = (code == avail) ? p->first : g->codes[code].first; } else if (code == avail) return stbi__errpuc("illegal code in raster", "Corrupt GIF"); stbi__out_gif_code(g, (stbi__uint16) code); if ((avail & codemask) == 0 && avail <= 0x0FFF) { codesize++; codemask = (1 << codesize) - 1; } oldcode = code; } else { return stbi__errpuc("illegal code in raster", "Corrupt GIF"); } } } } static void stbi__fill_gif_background(stbi__gif *g, int x0, int y0, int x1, int y1) { int x, y; stbi_uc *c = g->pal[g->bgindex]; for (y = y0; y < y1; y += 4 * g->w) { for (x = x0; x < x1; x += 4) { stbi_uc *p = &g->out[y + x]; p[0] = c[2]; p[1] = c[1]; p[2] = c[0]; p[3] = 0; } } } // this function is designed to support animated gifs, although stb_image doesn't support it static stbi_uc *stbi__gif_load_next(stbi__context *s, stbi__gif *g, int *comp, int req_comp) { int i; stbi_uc *prev_out = 0; if (g->out == 0 && !stbi__gif_header(s, g, comp,0)) return 0; // stbi__g_failure_reason set by stbi__gif_header if (!stbi__mad3sizes_valid(g->w, g->h, 4, 0)) return stbi__errpuc("too large", "GIF too large"); prev_out = g->out; g->out = (stbi_uc *) stbi__malloc_mad3(4, g->w, g->h, 0); if (g->out == 0) return stbi__errpuc("outofmem", "Out of memory"); switch ((g->eflags & 0x1C) >> 2) { case 0: // unspecified (also always used on 1st frame) stbi__fill_gif_background(g, 0, 0, 4 * g->w, 4 * g->w * g->h); break; case 1: // do not dispose if (prev_out) memcpy(g->out, prev_out, 4 * g->w * g->h); g->old_out = prev_out; break; case 2: // dispose to background if (prev_out) memcpy(g->out, prev_out, 4 * g->w * g->h); stbi__fill_gif_background(g, g->start_x, g->start_y, g->max_x, g->max_y); break; case 3: // dispose to previous if (g->old_out) { for (i = g->start_y; i < g->max_y; i += 4 * g->w) memcpy(&g->out[i + g->start_x], &g->old_out[i + g->start_x], g->max_x - g->start_x); } break; } for (;;) { switch (stbi__get8(s)) { case 0x2C: /* Image Descriptor */ { int prev_trans = -1; stbi__int32 x, y, w, h; stbi_uc *o; x = stbi__get16le(s); y = stbi__get16le(s); w = stbi__get16le(s); h = stbi__get16le(s); if (((x + w) > (g->w)) || ((y + h) > (g->h))) return stbi__errpuc("bad Image Descriptor", "Corrupt GIF"); g->line_size = g->w * 4; g->start_x = x * 4; g->start_y = y * g->line_size; g->max_x = g->start_x + w * 4; g->max_y = g->start_y + h * g->line_size; g->cur_x = g->start_x; g->cur_y = g->start_y; g->lflags = stbi__get8(s); if (g->lflags & 0x40) { g->step = 8 * g->line_size; // first interlaced spacing g->parse = 3; } else { g->step = g->line_size; g->parse = 0; } if (g->lflags & 0x80) { stbi__gif_parse_colortable(s,g->lpal, 2 << (g->lflags & 7), g->eflags & 0x01 ? g->transparent : -1); g->color_table = (stbi_uc *) g->lpal; } else if (g->flags & 0x80) { if (g->transparent >= 0 && (g->eflags & 0x01)) { prev_trans = g->pal[g->transparent][3]; g->pal[g->transparent][3] = 0; } g->color_table = (stbi_uc *) g->pal; } else return stbi__errpuc("missing color table", "Corrupt GIF"); o = stbi__process_gif_raster(s, g); if (o == NULL) return NULL; if (prev_trans != -1) g->pal[g->transparent][3] = (stbi_uc) prev_trans; return o; } case 0x21: // Comment Extension. { int len; if (stbi__get8(s) == 0xF9) { // Graphic Control Extension. len = stbi__get8(s); if (len == 4) { g->eflags = stbi__get8(s); g->delay = stbi__get16le(s); g->transparent = stbi__get8(s); } else { stbi__skip(s, len); break; } } while ((len = stbi__get8(s)) != 0) stbi__skip(s, len); break; } case 0x3B: // gif stream termination code return (stbi_uc *) s; // using '1' causes warning on some compilers default: return stbi__errpuc("unknown code", "Corrupt GIF"); } } STBI_NOTUSED(req_comp); } static void *stbi__gif_load(stbi__context *s, int *x, int *y, int *comp, int req_comp, stbi__result_info *ri) { stbi_uc *u = 0; stbi__gif* g = (stbi__gif*) stbi__malloc(sizeof(stbi__gif)); memset(g, 0, sizeof(*g)); STBI_NOTUSED(ri); u = stbi__gif_load_next(s, g, comp, req_comp); if (u == (stbi_uc *) s) u = 0; // end of animated gif marker if (u) { *x = g->w; *y = g->h; if (req_comp && req_comp != 4) u = stbi__convert_format(u, 4, req_comp, g->w, g->h); } else if (g->out) STBI_FREE(g->out); STBI_FREE(g); return u; } static int stbi__gif_info(stbi__context *s, int *x, int *y, int *comp) { return stbi__gif_info_raw(s,x,y,comp); } #endif // ************************************************************************************************* // Radiance RGBE HDR loader // originally by Nicolas Schulz #ifndef STBI_NO_HDR static int stbi__hdr_test_core(stbi__context *s, const char *signature) { int i; for (i=0; signature[i]; ++i) if (stbi__get8(s) != signature[i]) return 0; stbi__rewind(s); return 1; } static int stbi__hdr_test(stbi__context* s) { int r = stbi__hdr_test_core(s, "#?RADIANCE\n"); stbi__rewind(s); if(!r) { r = stbi__hdr_test_core(s, "#?RGBE\n"); stbi__rewind(s); } return r; } #define STBI__HDR_BUFLEN 1024 static char *stbi__hdr_gettoken(stbi__context *z, char *buffer) { int len=0; char c = '\0'; c = (char) stbi__get8(z); while (!stbi__at_eof(z) && c != '\n') { buffer[len++] = c; if (len == STBI__HDR_BUFLEN-1) { // flush to end of line while (!stbi__at_eof(z) && stbi__get8(z) != '\n') ; break; } c = (char) stbi__get8(z); } buffer[len] = 0; return buffer; } static void stbi__hdr_convert(float *output, stbi_uc *input, int req_comp) { if ( input[3] != 0 ) { float f1; // Exponent f1 = (float) ldexp(1.0f, input[3] - (int)(128 + 8)); if (req_comp <= 2) output[0] = (input[0] + input[1] + input[2]) * f1 / 3; else { output[0] = input[0] * f1; output[1] = input[1] * f1; output[2] = input[2] * f1; } if (req_comp == 2) output[1] = 1; if (req_comp == 4) output[3] = 1; } else { switch (req_comp) { case 4: output[3] = 1; /* fallthrough */ case 3: output[0] = output[1] = output[2] = 0; break; case 2: output[1] = 1; /* fallthrough */ case 1: output[0] = 0; break; } } } static float *stbi__hdr_load(stbi__context *s, int *x, int *y, int *comp, int req_comp, stbi__result_info *ri) { char buffer[STBI__HDR_BUFLEN]; char *token; int valid = 0; int width, height; stbi_uc *scanline; float *hdr_data; int len; unsigned char count, value; int i, j, k, c1,c2, z; const char *headerToken; STBI_NOTUSED(ri); // Check identifier headerToken = stbi__hdr_gettoken(s,buffer); if (strcmp(headerToken, "#?RADIANCE") != 0 && strcmp(headerToken, "#?RGBE") != 0) return stbi__errpf("not HDR", "Corrupt HDR image"); // Parse header for(;;) { token = stbi__hdr_gettoken(s,buffer); if (token[0] == 0) break; if (strcmp(token, "FORMAT=32-bit_rle_rgbe") == 0) valid = 1; } if (!valid) return stbi__errpf("unsupported format", "Unsupported HDR format"); // Parse width and height // can't use sscanf() if we're not using stdio! token = stbi__hdr_gettoken(s,buffer); if (strncmp(token, "-Y ", 3)) return stbi__errpf("unsupported data layout", "Unsupported HDR format"); token += 3; height = (int) strtol(token, &token, 10); while (*token == ' ') ++token; if (strncmp(token, "+X ", 3)) return stbi__errpf("unsupported data layout", "Unsupported HDR format"); token += 3; width = (int) strtol(token, NULL, 10); *x = width; *y = height; if (comp) *comp = 3; if (req_comp == 0) req_comp = 3; if (!stbi__mad4sizes_valid(width, height, req_comp, sizeof(float), 0)) return stbi__errpf("too large", "HDR image is too large"); // Read data hdr_data = (float *) stbi__malloc_mad4(width, height, req_comp, sizeof(float), 0); if (!hdr_data) return stbi__errpf("outofmem", "Out of memory"); // Load image data // image data is stored as some number of sca if ( width < 8 || width >= 32768) { // Read flat data for (j=0; j < height; ++j) { for (i=0; i < width; ++i) { stbi_uc rgbe[4]; main_decode_loop: stbi__getn(s, rgbe, 4); stbi__hdr_convert(hdr_data + j * width * req_comp + i * req_comp, rgbe, req_comp); } } } else { // Read RLE-encoded data scanline = NULL; for (j = 0; j < height; ++j) { c1 = stbi__get8(s); c2 = stbi__get8(s); len = stbi__get8(s); if (c1 != 2 || c2 != 2 || (len & 0x80)) { // not run-length encoded, so we have to actually use THIS data as a decoded // pixel (note this can't be a valid pixel--one of RGB must be >= 128) stbi_uc rgbe[4]; rgbe[0] = (stbi_uc) c1; rgbe[1] = (stbi_uc) c2; rgbe[2] = (stbi_uc) len; rgbe[3] = (stbi_uc) stbi__get8(s); stbi__hdr_convert(hdr_data, rgbe, req_comp); i = 1; j = 0; STBI_FREE(scanline); goto main_decode_loop; // yes, this makes no sense } len <<= 8; len |= stbi__get8(s); if (len != width) { STBI_FREE(hdr_data); STBI_FREE(scanline); return stbi__errpf("invalid decoded scanline length", "corrupt HDR"); } if (scanline == NULL) { scanline = (stbi_uc *) stbi__malloc_mad2(width, 4, 0); if (!scanline) { STBI_FREE(hdr_data); return stbi__errpf("outofmem", "Out of memory"); } } for (k = 0; k < 4; ++k) { int nleft; i = 0; while ((nleft = width - i) > 0) { count = stbi__get8(s); if (count > 128) { // Run value = stbi__get8(s); count -= 128; if (count > nleft) { STBI_FREE(hdr_data); STBI_FREE(scanline); return stbi__errpf("corrupt", "bad RLE data in HDR"); } for (z = 0; z < count; ++z) scanline[i++ * 4 + k] = value; } else { // Dump if (count > nleft) { STBI_FREE(hdr_data); STBI_FREE(scanline); return stbi__errpf("corrupt", "bad RLE data in HDR"); } for (z = 0; z < count; ++z) scanline[i++ * 4 + k] = stbi__get8(s); } } } for (i=0; i < width; ++i) stbi__hdr_convert(hdr_data+(j*width + i)*req_comp, scanline + i*4, req_comp); } if (scanline) STBI_FREE(scanline); } return hdr_data; } static int stbi__hdr_info(stbi__context *s, int *x, int *y, int *comp) { char buffer[STBI__HDR_BUFLEN]; char *token; int valid = 0; int dummy; if (!x) x = &dummy; if (!y) y = &dummy; if (!comp) comp = &dummy; if (stbi__hdr_test(s) == 0) { stbi__rewind( s ); return 0; } for(;;) { token = stbi__hdr_gettoken(s,buffer); if (token[0] == 0) break; if (strcmp(token, "FORMAT=32-bit_rle_rgbe") == 0) valid = 1; } if (!valid) { stbi__rewind( s ); return 0; } token = stbi__hdr_gettoken(s,buffer); if (strncmp(token, "-Y ", 3)) { stbi__rewind( s ); return 0; } token += 3; *y = (int) strtol(token, &token, 10); while (*token == ' ') ++token; if (strncmp(token, "+X ", 3)) { stbi__rewind( s ); return 0; } token += 3; *x = (int) strtol(token, NULL, 10); *comp = 3; return 1; } #endif // STBI_NO_HDR #ifndef STBI_NO_BMP static int stbi__bmp_info(stbi__context *s, int *x, int *y, int *comp) { void *p; stbi__bmp_data info; info.all_a = 255; p = stbi__bmp_parse_header(s, &info); stbi__rewind( s ); if (p == NULL) return 0; if (x) *x = s->img_x; if (y) *y = s->img_y; if (comp) *comp = info.ma ? 4 : 3; return 1; } #endif #ifndef STBI_NO_PSD static int stbi__psd_info(stbi__context *s, int *x, int *y, int *comp) { int channelCount, dummy; if (!x) x = &dummy; if (!y) y = &dummy; if (!comp) comp = &dummy; if (stbi__get32be(s) != 0x38425053) { stbi__rewind( s ); return 0; } if (stbi__get16be(s) != 1) { stbi__rewind( s ); return 0; } stbi__skip(s, 6); channelCount = stbi__get16be(s); if (channelCount < 0 || channelCount > 16) { stbi__rewind( s ); return 0; } *y = stbi__get32be(s); *x = stbi__get32be(s); if (stbi__get16be(s) != 8) { stbi__rewind( s ); return 0; } if (stbi__get16be(s) != 3) { stbi__rewind( s ); return 0; } *comp = 4; return 1; } #endif #ifndef STBI_NO_PIC static int stbi__pic_info(stbi__context *s, int *x, int *y, int *comp) { int act_comp=0,num_packets=0,chained,dummy; stbi__pic_packet packets[10]; if (!x) x = &dummy; if (!y) y = &dummy; if (!comp) comp = &dummy; if (!stbi__pic_is4(s,"\x53\x80\xF6\x34")) { stbi__rewind(s); return 0; } stbi__skip(s, 88); *x = stbi__get16be(s); *y = stbi__get16be(s); if (stbi__at_eof(s)) { stbi__rewind( s); return 0; } if ( (*x) != 0 && (1 << 28) / (*x) < (*y)) { stbi__rewind( s ); return 0; } stbi__skip(s, 8); do { stbi__pic_packet *packet; if (num_packets==sizeof(packets)/sizeof(packets[0])) return 0; packet = &packets[num_packets++]; chained = stbi__get8(s); packet->size = stbi__get8(s); packet->type = stbi__get8(s); packet->channel = stbi__get8(s); act_comp |= packet->channel; if (stbi__at_eof(s)) { stbi__rewind( s ); return 0; } if (packet->size != 8) { stbi__rewind( s ); return 0; } } while (chained); *comp = (act_comp & 0x10 ? 4 : 3); return 1; } #endif // ************************************************************************************************* // Portable Gray Map and Portable Pixel Map loader // by Ken Miller // // PGM: http://netpbm.sourceforge.net/doc/pgm.html // PPM: http://netpbm.sourceforge.net/doc/ppm.html // // Known limitations: // Does not support comments in the header section // Does not support ASCII image data (formats P2 and P3) // Does not support 16-bit-per-channel #ifndef STBI_NO_PNM static int stbi__pnm_test(stbi__context *s) { char p, t; p = (char) stbi__get8(s); t = (char) stbi__get8(s); if (p != 'P' || (t != '5' && t != '6')) { stbi__rewind( s ); return 0; } return 1; } static void *stbi__pnm_load(stbi__context *s, int *x, int *y, int *comp, int req_comp, stbi__result_info *ri) { stbi_uc *out; STBI_NOTUSED(ri); if (!stbi__pnm_info(s, (int *)&s->img_x, (int *)&s->img_y, (int *)&s->img_n)) return 0; *x = s->img_x; *y = s->img_y; if (comp) *comp = s->img_n; if (!stbi__mad3sizes_valid(s->img_n, s->img_x, s->img_y, 0)) return stbi__errpuc("too large", "PNM too large"); out = (stbi_uc *) stbi__malloc_mad3(s->img_n, s->img_x, s->img_y, 0); if (!out) return stbi__errpuc("outofmem", "Out of memory"); stbi__getn(s, out, s->img_n * s->img_x * s->img_y); if (req_comp && req_comp != s->img_n) { out = stbi__convert_format(out, s->img_n, req_comp, s->img_x, s->img_y); if (out == NULL) return out; // stbi__convert_format frees input on failure } return out; } static int stbi__pnm_isspace(char c) { return c == ' ' || c == '\t' || c == '\n' || c == '\v' || c == '\f' || c == '\r'; } static void stbi__pnm_skip_whitespace(stbi__context *s, char *c) { for (;;) { while (!stbi__at_eof(s) && stbi__pnm_isspace(*c)) *c = (char) stbi__get8(s); if (stbi__at_eof(s) || *c != '#') break; while (!stbi__at_eof(s) && *c != '\n' && *c != '\r' ) *c = (char) stbi__get8(s); } } static int stbi__pnm_isdigit(char c) { return c >= '0' && c <= '9'; } static int stbi__pnm_getinteger(stbi__context *s, char *c) { int value = 0; while (!stbi__at_eof(s) && stbi__pnm_isdigit(*c)) { value = value*10 + (*c - '0'); *c = (char) stbi__get8(s); } return value; } static int stbi__pnm_info(stbi__context *s, int *x, int *y, int *comp) { int maxv, dummy; char c, p, t; if (!x) x = &dummy; if (!y) y = &dummy; if (!comp) comp = &dummy; stbi__rewind(s); // Get identifier p = (char) stbi__get8(s); t = (char) stbi__get8(s); if (p != 'P' || (t != '5' && t != '6')) { stbi__rewind(s); return 0; } *comp = (t == '6') ? 3 : 1; // '5' is 1-component .pgm; '6' is 3-component .ppm c = (char) stbi__get8(s); stbi__pnm_skip_whitespace(s, &c); *x = stbi__pnm_getinteger(s, &c); // read width stbi__pnm_skip_whitespace(s, &c); *y = stbi__pnm_getinteger(s, &c); // read height stbi__pnm_skip_whitespace(s, &c); maxv = stbi__pnm_getinteger(s, &c); // read max value if (maxv > 255) return stbi__err("max value > 255", "PPM image not 8-bit"); else return 1; } #endif static int stbi__info_main(stbi__context *s, int *x, int *y, int *comp) { #ifndef STBI_NO_JPEG if (stbi__jpeg_info(s, x, y, comp)) return 1; #endif #ifndef STBI_NO_PNG if (stbi__png_info(s, x, y, comp)) return 1; #endif #ifndef STBI_NO_GIF if (stbi__gif_info(s, x, y, comp)) return 1; #endif #ifndef STBI_NO_BMP if (stbi__bmp_info(s, x, y, comp)) return 1; #endif #ifndef STBI_NO_PSD if (stbi__psd_info(s, x, y, comp)) return 1; #endif #ifndef STBI_NO_PIC if (stbi__pic_info(s, x, y, comp)) return 1; #endif #ifndef STBI_NO_PNM if (stbi__pnm_info(s, x, y, comp)) return 1; #endif #ifndef STBI_NO_HDR if (stbi__hdr_info(s, x, y, comp)) return 1; #endif // test tga last because it's a crappy test! #ifndef STBI_NO_TGA if (stbi__tga_info(s, x, y, comp)) return 1; #endif return stbi__err("unknown image type", "Image not of any known type, or corrupt"); } #ifndef STBI_NO_STDIO STBIDEF int stbi_info(char const *filename, int *x, int *y, int *comp) { FILE *f = stbi__fopen(filename, "rb"); int result; if (!f) return stbi__err("can't fopen", "Unable to open file"); result = stbi_info_from_file(f, x, y, comp); fclose(f); return result; } STBIDEF int stbi_info_from_file(FILE *f, int *x, int *y, int *comp) { int r; stbi__context s; long pos = ftell(f); stbi__start_file(&s, f); r = stbi__info_main(&s,x,y,comp); fseek(f,pos,SEEK_SET); return r; } #endif // !STBI_NO_STDIO STBIDEF int stbi_info_from_memory(stbi_uc const *buffer, int len, int *x, int *y, int *comp) { stbi__context s; stbi__start_mem(&s,buffer,len); return stbi__info_main(&s,x,y,comp); } STBIDEF int stbi_info_from_callbacks(stbi_io_callbacks const *c, void *user, int *x, int *y, int *comp) { stbi__context s; stbi__start_callbacks(&s, (stbi_io_callbacks *) c, user); return stbi__info_main(&s,x,y,comp); } #endif // STB_IMAGE_IMPLEMENTATION /* revision history: 2.16 (2017-07-23) all functions have 16-bit variants; STBI_NO_STDIO works again; compilation fixes; fix rounding in unpremultiply; optimize vertical flip; disable raw_len validation; documentation fixes 2.15 (2017-03-18) fix png-1,2,4 bug; now all Imagenet JPGs decode; warning fixes; disable run-time SSE detection on gcc; uniform handling of optional "return" values; thread-safe initialization of zlib tables 2.14 (2017-03-03) remove deprecated STBI_JPEG_OLD; fixes for Imagenet JPGs 2.13 (2016-11-29) add 16-bit API, only supported for PNG right now 2.12 (2016-04-02) fix typo in 2.11 PSD fix that caused crashes 2.11 (2016-04-02) allocate large structures on the stack remove white matting for transparent PSD fix reported channel count for PNG & BMP re-enable SSE2 in non-gcc 64-bit support RGB-formatted JPEG read 16-bit PNGs (only as 8-bit) 2.10 (2016-01-22) avoid warning introduced in 2.09 by STBI_REALLOC_SIZED 2.09 (2016-01-16) allow comments in PNM files 16-bit-per-pixel TGA (not bit-per-component) info() for TGA could break due to .hdr handling info() for BMP to shares code instead of sloppy parse can use STBI_REALLOC_SIZED if allocator doesn't support realloc code cleanup 2.08 (2015-09-13) fix to 2.07 cleanup, reading RGB PSD as RGBA 2.07 (2015-09-13) fix compiler warnings partial animated GIF support limited 16-bpc PSD support #ifdef unused functions bug with < 92 byte PIC,PNM,HDR,TGA 2.06 (2015-04-19) fix bug where PSD returns wrong '*comp' value 2.05 (2015-04-19) fix bug in progressive JPEG handling, fix warning 2.04 (2015-04-15) try to re-enable SIMD on MinGW 64-bit 2.03 (2015-04-12) extra corruption checking (mmozeiko) stbi_set_flip_vertically_on_load (nguillemot) fix NEON support; fix mingw support 2.02 (2015-01-19) fix incorrect assert, fix warning 2.01 (2015-01-17) fix various warnings; suppress SIMD on gcc 32-bit without -msse2 2.00b (2014-12-25) fix STBI_MALLOC in progressive JPEG 2.00 (2014-12-25) optimize JPG, including x86 SSE2 & NEON SIMD (ryg) progressive JPEG (stb) PGM/PPM support (Ken Miller) STBI_MALLOC,STBI_REALLOC,STBI_FREE GIF bugfix -- seemingly never worked STBI_NO_*, STBI_ONLY_* 1.48 (2014-12-14) fix incorrectly-named assert() 1.47 (2014-12-14) 1/2/4-bit PNG support, both direct and paletted (Omar Cornut & stb) optimize PNG (ryg) fix bug in interlaced PNG with user-specified channel count (stb) 1.46 (2014-08-26) fix broken tRNS chunk (colorkey-style transparency) in non-paletted PNG 1.45 (2014-08-16) fix MSVC-ARM internal compiler error by wrapping malloc 1.44 (2014-08-07) various warning fixes from Ronny Chevalier 1.43 (2014-07-15) fix MSVC-only compiler problem in code changed in 1.42 1.42 (2014-07-09) don't define _CRT_SECURE_NO_WARNINGS (affects user code) fixes to stbi__cleanup_jpeg path added STBI_ASSERT to avoid requiring assert.h 1.41 (2014-06-25) fix search&replace from 1.36 that messed up comments/error messages 1.40 (2014-06-22) fix gcc struct-initialization warning 1.39 (2014-06-15) fix to TGA optimization when req_comp != number of components in TGA; fix to GIF loading because BMP wasn't rewinding (whoops, no GIFs in my test suite) add support for BMP version 5 (more ignored fields) 1.38 (2014-06-06) suppress MSVC warnings on integer casts truncating values fix accidental rename of 'skip' field of I/O 1.37 (2014-06-04) remove duplicate typedef 1.36 (2014-06-03) convert to header file single-file library if de-iphone isn't set, load iphone images color-swapped instead of returning NULL 1.35 (2014-05-27) various warnings fix broken STBI_SIMD path fix bug where stbi_load_from_file no longer left file pointer in correct place fix broken non-easy path for 32-bit BMP (possibly never used) TGA optimization by Arseny Kapoulkine 1.34 (unknown) use STBI_NOTUSED in stbi__resample_row_generic(), fix one more leak in tga failure case 1.33 (2011-07-14) make stbi_is_hdr work in STBI_NO_HDR (as specified), minor compiler-friendly improvements 1.32 (2011-07-13) support for "info" function for all supported filetypes (SpartanJ) 1.31 (2011-06-20) a few more leak fixes, bug in PNG handling (SpartanJ) 1.30 (2011-06-11) added ability to load files via callbacks to accomidate custom input streams (Ben Wenger) removed deprecated format-specific test/load functions removed support for installable file formats (stbi_loader) -- would have been broken for IO callbacks anyway error cases in bmp and tga give messages and don't leak (Raymond Barbiero, grisha) fix inefficiency in decoding 32-bit BMP (David Woo) 1.29 (2010-08-16) various warning fixes from Aurelien Pocheville 1.28 (2010-08-01) fix bug in GIF palette transparency (SpartanJ) 1.27 (2010-08-01) cast-to-stbi_uc to fix warnings 1.26 (2010-07-24) fix bug in file buffering for PNG reported by SpartanJ 1.25 (2010-07-17) refix trans_data warning (Won Chun) 1.24 (2010-07-12) perf improvements reading from files on platforms with lock-heavy fgetc() minor perf improvements for jpeg deprecated type-specific functions so we'll get feedback if they're needed attempt to fix trans_data warning (Won Chun) 1.23 fixed bug in iPhone support 1.22 (2010-07-10) removed image *writing* support stbi_info support from Jetro Lauha GIF support from Jean-Marc Lienher iPhone PNG-extensions from James Brown warning-fixes from Nicolas Schulz and Janez Zemva (i.stbi__err. Janez (U+017D)emva) 1.21 fix use of 'stbi_uc' in header (reported by jon blow) 1.20 added support for Softimage PIC, by Tom Seddon 1.19 bug in interlaced PNG corruption check (found by ryg) 1.18 (2008-08-02) fix a threading bug (local mutable static) 1.17 support interlaced PNG 1.16 major bugfix - stbi__convert_format converted one too many pixels 1.15 initialize some fields for thread safety 1.14 fix threadsafe conversion bug header-file-only version (#define STBI_HEADER_FILE_ONLY before including) 1.13 threadsafe 1.12 const qualifiers in the API 1.11 Support installable IDCT, colorspace conversion routines 1.10 Fixes for 64-bit (don't use "unsigned long") optimized upsampling by Fabian "ryg" Giesen 1.09 Fix format-conversion for PSD code (bad global variables!) 1.08 Thatcher Ulrich's PSD code integrated by Nicolas Schulz 1.07 attempt to fix C++ warning/errors again 1.06 attempt to fix C++ warning/errors again 1.05 fix TGA loading to return correct *comp and use good luminance calc 1.04 default float alpha is 1, not 255; use 'void *' for stbi_image_free 1.03 bugfixes to STBI_NO_STDIO, STBI_NO_HDR 1.02 support for (subset of) HDR files, float interface for preferred access to them 1.01 fix bug: possible bug in handling right-side up bmps... not sure fix bug: the stbi__bmp_load() and stbi__tga_load() functions didn't work at all 1.00 interface to zlib that skips zlib header 0.99 correct handling of alpha in palette 0.98 TGA loader by lonesock; dynamically add loaders (untested) 0.97 jpeg errors on too large a file; also catch another malloc failure 0.96 fix detection of invalid v value - particleman@mollyrocket forum 0.95 during header scan, seek to markers in case of padding 0.94 STBI_NO_STDIO to disable stdio usage; rename all #defines the same 0.93 handle jpegtran output; verbose errors 0.92 read 4,8,16,24,32-bit BMP files of several formats 0.91 output 24-bit Windows 3.0 BMP files 0.90 fix a few more warnings; bump version number to approach 1.0 0.61 bugfixes due to Marc LeBlanc, Christopher Lloyd 0.60 fix compiling as c++ 0.59 fix warnings: merge Dave Moore's -Wall fixes 0.58 fix bug: zlib uncompressed mode len/nlen was wrong endian 0.57 fix bug: jpg last huffman symbol before marker was >9 bits but less than 16 available 0.56 fix bug: zlib uncompressed mode len vs. nlen 0.55 fix bug: restart_interval not initialized to 0 0.54 allow NULL for 'int *comp' 0.53 fix bug in png 3->4; speedup png decoding 0.52 png handles req_comp=3,4 directly; minor cleanup; jpeg comments 0.51 obey req_comp requests, 1-component jpegs return as 1-component, on 'test' only check type, not whether we support this variant 0.50 (2006-11-19) first released version */ /* ------------------------------------------------------------------------------ This software is available under 2 licenses -- choose whichever you prefer. ------------------------------------------------------------------------------ ALTERNATIVE A - MIT License Copyright (c) 2017 Sean Barrett 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. ------------------------------------------------------------------------------ ALTERNATIVE B - Public Domain (www.unlicense.org) This is free and unencumbered software released into the public domain. Anyone is free to copy, modify, publish, use, compile, sell, or distribute this software, either in source code form or as a compiled binary, for any purpose, commercial or non-commercial, and by any means. In jurisdictions that recognize copyright laws, the author or authors of this software dedicate any and all copyright interest in the software to the public domain. We make this dedication for the benefit of the public at large and to the detriment of our heirs and successors. We intend this dedication to be an overt act of relinquishment in perpetuity of all present and future rights to this software under copyright law. 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 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. ------------------------------------------------------------------------------ */ uTox/third_party/stb/stb/stb_herringbone_wang_tile.h0000600000175000001440000012405114003056224021765 0ustar rakusers/* stbhw - v0.6 - http://nothings.org/gamedev/herringbone Herringbone Wang Tile Generator - Sean Barrett 2014 - public domain == LICENSE ============================== This software is dual-licensed to the public domain and under the following license: you are granted a perpetual, irrevocable license to copy, modify, publish, and distribute this file as you see fit. == WHAT IT IS =========================== This library is an SDK for Herringbone Wang Tile generation: http://nothings.org/gamedev/herringbone The core design is that you use this library offline to generate a "template" of the tiles you'll create. You then edit those tiles, then load the created tile image file back into this library and use it at runtime to generate "maps". You cannot load arbitrary tile image files with this library; it is only designed to load image files made from the template it created. It stores a binary description of the tile sizes & constraints in a few pixels, and uses those to recover the rules, rather than trying to parse the tiles themselves. You *can* use this library to generate from arbitrary tile sets, but only by loading the tile set and specifying the constraints explicitly yourself. == COMPILING ============================ 1. #define STB_HERRINGBONE_WANG_TILE_IMPLEMENTATION before including this header file in *one* source file to create the implementation in that source file. 2. optionally #define STB_HBWANG_RAND() to be a random number generator. if you don't define it, it will use rand(), and you need to seed srand() yourself. 3. optionally #define STB_HBWANG_ASSERT(x), otherwise it will use assert() 4. optionally #define STB_HBWANG_STATIC to force all symbols to be static instead of public, so they are only accesible in the source file that creates the implementation 5. optionally #define STB_HBWANG_NO_REPITITION_REDUCTION to disable the code that tries to reduce having the same tile appear adjacent to itself in wang-corner-tile mode (e.g. imagine if you were doing something where 90% of things should be the same grass tile, you need to disable this system) 6. optionally define STB_HBWANG_MAX_X and STB_HBWANG_MAX_Y to be the max dimensions of the generated map in multiples of the wang tile's short side's length (e.g. if you have 20x10 wang tiles, so short_side_len=10, and you have MAX_X is 17, then the largest map you can generate is 170 pixels wide). The defaults are 100x100. This is used to define static arrays which affect memory usage. == USING ================================ To use the map generator, you need a tileset. You can download some sample tilesets from http://nothings.org/gamedev/herringbone Then see the "sample application" below. You can also use this file to generate templates for tilesets which you then hand-edit to create the data. == MEMORY MANAGEMENT ==================== The tileset loader allocates memory with malloc(). The map generator does no memory allocation, so e.g. you can load tilesets at startup and never free them and never do any further allocation. == SAMPLE APPLICATION =================== #include #include #include #define STB_IMAGE_IMPLEMENTATION #include "stb_image.h" // http://nothings.org/stb_image.c #define STB_IMAGE_WRITE_IMPLEMENTATION #include "stb_image_write.h" // http://nothings.org/stb/stb_image_write.h #define STB_HBWANG_IMPLEMENTATION #include "stb_hbwang.h" int main(int argc, char **argv) { unsigned char *data; int xs,ys, w,h; stbhw_tileset ts; if (argc != 4) { fprintf(stderr, "Usage: mapgen {tile-file} {xsize} {ysize}\n" "generates file named 'test_map.png'\n"); exit(1); } data = stbi_load(argv[1], &w, &h, NULL, 3); xs = atoi(argv[2]); ys = atoi(argv[3]); if (data == NULL) { fprintf(stderr, "Error opening or parsing '%s' as an image file\n", argv[1]); exit(1); } if (xs < 1 || xs > 1000) { fprintf(stderr, "xsize invalid or out of range\n"); exit(1); } if (ys < 1 || ys > 1000) { fprintf(stderr, "ysize invalid or out of range\n"); exit(1); } stbhw_build_tileset_from_image(&ts, data, w*3, w, h); free(data); // allocate a buffer to create the final image to data = malloc(3 * xs * ys); srand(time(NULL)); stbhw_generate_image(&ts, NULL, data, xs*3, xs, ys); stbi_write_png("test_map.png", xs, ys, 3, data, xs*3); stbhw_free_tileset(&ts); free(data); return 0; } == VERSION HISTORY =================== 0.6 2014-08-17 - fix broken map-maker 0.5 2014-07-07 - initial release */ ////////////////////////////////////////////////////////////////////////////// // // // HEADER FILE SECTION // // // #ifndef INCLUDE_STB_HWANG_H #define INCLUDE_STB_HWANG_H #ifdef STB_HBWANG_STATIC #define STBHW_EXTERN static #else #ifdef __cplusplus #define STBHW_EXTERN extern "C" #else #define STBHW_EXTERN extern #endif #endif typedef struct stbhw_tileset stbhw_tileset; // returns description of last error produced by any function (not thread-safe) STBHW_EXTERN char *stbhw_get_last_error(void); // build a tileset from an image that conforms to a template created by this // library. (you allocate storage for stbhw_tileset and function fills it out; // memory for individual tiles are malloc()ed). // returns non-zero on success, 0 on error STBHW_EXTERN int stbhw_build_tileset_from_image(stbhw_tileset *ts, unsigned char *pixels, int stride_in_bytes, int w, int h); // free a tileset built by stbhw_build_tileset_from_image STBHW_EXTERN void stbhw_free_tileset(stbhw_tileset *ts); // generate a map that is w * h pixels (3-bytes each) // returns non-zero on success, 0 on error // not thread-safe (uses a global data structure to avoid memory management) // weighting should be NULL, as non-NULL weighting is currently untested STBHW_EXTERN int stbhw_generate_image(stbhw_tileset *ts, int **weighting, unsigned char *pixels, int stride_in_bytes, int w, int h); ////////////////////////////////////// // // TILESET DATA STRUCTURE // // if you use the image-to-tileset system from this file, you // don't need to worry about these data structures. but if you // want to build/load a tileset yourself, you'll need to fill // these out. typedef struct { // the edge or vertex constraints, according to diagram below signed char a,b,c,d,e,f; // The herringbone wang tile data; it is a bitmap which is either // w=2*short_sidelen,h=short_sidelen, or w=short_sidelen,h=2*short_sidelen. // it is always RGB, stored row-major, with no padding between rows. // (allocate stbhw_tile structure to be large enough for the pixel data) unsigned char pixels[1]; } stbhw_tile; struct stbhw_tileset { int is_corner; int num_color[6]; // number of colors for each of 6 edge types or 4 corner types int short_side_len; stbhw_tile **h_tiles; stbhw_tile **v_tiles; int num_h_tiles, max_h_tiles; int num_v_tiles, max_v_tiles; }; /////////////// TEMPLATE GENERATOR ////////////////////////// // when requesting a template, you fill out this data typedef struct { int is_corner; // using corner colors or edge colors? int short_side_len; // rectangles is 2n x n, n = short_side_len int num_color[6]; // see below diagram for meaning of the index to this; // 6 values if edge (!is_corner), 4 values if is_corner // legal numbers: 1..8 if edge, 1..4 if is_corner int num_vary_x; // additional number of variations along x axis in the template int num_vary_y; // additional number of variations along y axis in the template int corner_type_color_template[4][4]; // if corner_type_color_template[s][t] is non-zero, then any // corner of type s generated as color t will get a little // corner sample markup in the template image data } stbhw_config; // computes the size needed for the template image STBHW_EXTERN void stbhw_get_template_size(stbhw_config *c, int *w, int *h); // generates a template image, assuming data is 3*w*h bytes long, RGB format STBHW_EXTERN int stbhw_make_template(stbhw_config *c, unsigned char *data, int w, int h, int stride_in_bytes); #endif//INCLUDE_STB_HWANG_H // TILE CONSTRAINT TYPES // // there are 4 "types" of corners and 6 types of edges. // you can configure the tileset to have different numbers // of colors for each type of color or edge. // // corner types: // // 0---*---1---*---2---*---3 // | | | // * * * // | | | // 1---*---2---*---3 0---*---1---*---2 // | | | // * * * // | | | // 0---*---1---*---2---*---3 // // // edge types: // // *---2---*---3---* *---0---* // | | | | // 1 4 5 1 // | | | | // *---0---*---2---* * * // | | // 4 5 // | | // *---3---* // // TILE CONSTRAINTS // // each corner/edge has a color; this shows the name // of the variable containing the color // // corner constraints: // // a---*---d // | | // * * // | | // a---*---b---*---c b e // | | | | // * * * * // | | | | // d---*---e---*---f c---*---f // // // edge constraints: // // *---a---*---b---* *---a---* // | | | | // c d b c // | | | | // *---e---*---f---* * * // | | // d e // | | // *---f---* // ////////////////////////////////////////////////////////////////////////////// // // // IMPLEMENTATION SECTION // // // #ifdef STB_HERRINGBONE_WANG_TILE_IMPLEMENTATION #include // memcpy #include // malloc #ifndef STB_HBWANG_RAND #include #define STB_HBWANG_RAND() (rand() >> 4) #endif #ifndef STB_HBWANG_ASSERT #include #define STB_HBWANG_ASSERT(x) assert(x) #endif // map size #ifndef STB_HBWANG_MAX_X #define STB_HBWANG_MAX_X 100 #endif #ifndef STB_HBWANG_MAX_Y #define STB_HBWANG_MAX_Y 100 #endif // global variables for color assignments // @MEMORY change these to just store last two/three rows // and keep them on the stack static signed char c_color[STB_HBWANG_MAX_Y+6][STB_HBWANG_MAX_X+6]; static signed char v_color[STB_HBWANG_MAX_Y+6][STB_HBWANG_MAX_X+5]; static signed char h_color[STB_HBWANG_MAX_Y+5][STB_HBWANG_MAX_X+6]; static char *stbhw_error; STBHW_EXTERN char *stbhw_get_last_error(void) { char *temp = stbhw_error; stbhw_error = 0; return temp; } ///////////////////////////////////////////////////////////// // // SHARED TEMPLATE-DESCRIPTION CODE // // Used by both template generator and tileset parser; by // using the same code, they are locked in sync and we don't // need to try to do more sophisticated parsing of edge color // markup or something. typedef void stbhw__process_rect(struct stbhw__process *p, int xpos, int ypos, int a, int b, int c, int d, int e, int f); typedef struct stbhw__process { stbhw_tileset *ts; stbhw_config *c; stbhw__process_rect *process_h_rect; stbhw__process_rect *process_v_rect; unsigned char *data; int stride,w,h; } stbhw__process; static void stbhw__process_h_row(stbhw__process *p, int xpos, int ypos, int a0, int a1, int b0, int b1, int c0, int c1, int d0, int d1, int e0, int e1, int f0, int f1, int variants) { int a,b,c,d,e,f,v; for (v=0; v < variants; ++v) for (f=f0; f <= f1; ++f) for (e=e0; e <= e1; ++e) for (d=d0; d <= d1; ++d) for (c=c0; c <= c1; ++c) for (b=b0; b <= b1; ++b) for (a=a0; a <= a1; ++a) { p->process_h_rect(p, xpos, ypos, a,b,c,d,e,f); xpos += 2*p->c->short_side_len + 3; } } static void stbhw__process_v_row(stbhw__process *p, int xpos, int ypos, int a0, int a1, int b0, int b1, int c0, int c1, int d0, int d1, int e0, int e1, int f0, int f1, int variants) { int a,b,c,d,e,f,v; for (v=0; v < variants; ++v) for (f=f0; f <= f1; ++f) for (e=e0; e <= e1; ++e) for (d=d0; d <= d1; ++d) for (c=c0; c <= c1; ++c) for (b=b0; b <= b1; ++b) for (a=a0; a <= a1; ++a) { p->process_v_rect(p, xpos, ypos, a,b,c,d,e,f); xpos += p->c->short_side_len+3; } } static void stbhw__get_template_info(stbhw_config *c, int *w, int *h, int *h_count, int *v_count) { int size_x,size_y; int horz_count,vert_count; if (c->is_corner) { int horz_w = c->num_color[1] * c->num_color[2] * c->num_color[3] * c->num_vary_x; int horz_h = c->num_color[0] * c->num_color[1] * c->num_color[2] * c->num_vary_y; int vert_w = c->num_color[0] * c->num_color[3] * c->num_color[2] * c->num_vary_y; int vert_h = c->num_color[1] * c->num_color[0] * c->num_color[3] * c->num_vary_x; int horz_x = horz_w * (2*c->short_side_len + 3); int horz_y = horz_h * ( c->short_side_len + 3); int vert_x = vert_w * ( c->short_side_len + 3); int vert_y = vert_h * (2*c->short_side_len + 3); horz_count = horz_w * horz_h; vert_count = vert_w * vert_h; size_x = horz_x > vert_x ? horz_x : vert_x; size_y = 2 + horz_y + 2 + vert_y; } else { int horz_w = c->num_color[0] * c->num_color[1] * c->num_color[2] * c->num_vary_x; int horz_h = c->num_color[3] * c->num_color[4] * c->num_color[2] * c->num_vary_y; int vert_w = c->num_color[0] * c->num_color[5] * c->num_color[1] * c->num_vary_y; int vert_h = c->num_color[3] * c->num_color[4] * c->num_color[5] * c->num_vary_x; int horz_x = horz_w * (2*c->short_side_len + 3); int horz_y = horz_h * ( c->short_side_len + 3); int vert_x = vert_w * ( c->short_side_len + 3); int vert_y = vert_h * (2*c->short_side_len + 3); horz_count = horz_w * horz_h; vert_count = vert_w * vert_h; size_x = horz_x > vert_x ? horz_x : vert_x; size_y = 2 + horz_y + 2 + vert_y; } if (w) *w = size_x; if (h) *h = size_y; if (h_count) *h_count = horz_count; if (v_count) *v_count = vert_count; } STBHW_EXTERN void stbhw_get_template_size(stbhw_config *c, int *w, int *h) { stbhw__get_template_info(c, w, h, NULL, NULL); } static int stbhw__process_template(stbhw__process *p) { int i,j,k,q, ypos; int size_x, size_y; stbhw_config *c = p->c; stbhw__get_template_info(c, &size_x, &size_y, NULL, NULL); if (p->w < size_x || p->h < size_y) { stbhw_error = "image too small for configuration"; return 0; } if (c->is_corner) { ypos = 2; for (k=0; k < c->num_color[2]; ++k) { for (j=0; j < c->num_color[1]; ++j) { for (i=0; i < c->num_color[0]; ++i) { for (q=0; q < c->num_vary_y; ++q) { stbhw__process_h_row(p, 0,ypos, 0,c->num_color[1]-1, 0,c->num_color[2]-1, 0,c->num_color[3]-1, i,i, j,j, k,k, c->num_vary_x); ypos += c->short_side_len + 3; } } } } ypos += 2; for (k=0; k < c->num_color[3]; ++k) { for (j=0; j < c->num_color[0]; ++j) { for (i=0; i < c->num_color[1]; ++i) { for (q=0; q < c->num_vary_x; ++q) { stbhw__process_v_row(p, 0,ypos, 0,c->num_color[0]-1, 0,c->num_color[3]-1, 0,c->num_color[2]-1, i,i, j,j, k,k, c->num_vary_y); ypos += (c->short_side_len*2) + 3; } } } } assert(ypos == size_y); } else { ypos = 2; for (k=0; k < c->num_color[3]; ++k) { for (j=0; j < c->num_color[4]; ++j) { for (i=0; i < c->num_color[2]; ++i) { for (q=0; q < c->num_vary_y; ++q) { stbhw__process_h_row(p, 0,ypos, 0,c->num_color[2]-1, k,k, 0,c->num_color[1]-1, j,j, 0,c->num_color[0]-1, i,i, c->num_vary_x); ypos += c->short_side_len + 3; } } } } ypos += 2; for (k=0; k < c->num_color[3]; ++k) { for (j=0; j < c->num_color[4]; ++j) { for (i=0; i < c->num_color[5]; ++i) { for (q=0; q < c->num_vary_x; ++q) { stbhw__process_v_row(p, 0,ypos, 0,c->num_color[0]-1, i,i, 0,c->num_color[1]-1, j,j, 0,c->num_color[5]-1, k,k, c->num_vary_y); ypos += (c->short_side_len*2) + 3; } } } } assert(ypos == size_y); } return 1; } ///////////////////////////////////////////////////////////// // // MAP GENERATOR // static void stbhw__draw_pixel(unsigned char *output, int stride, int x, int y, unsigned char c[3]) { memcpy(output + y*stride + x*3, c, 3); } static void stbhw__draw_h_tile(unsigned char *output, int stride, int xmax, int ymax, int x, int y, stbhw_tile *h, int sz) { int i,j; for (j=0; j < sz; ++j) if (y+j >= 0 && y+j < ymax) for (i=0; i < sz*2; ++i) if (x+i >= 0 && x+i < xmax) stbhw__draw_pixel(output,stride, x+i,y+j, &h->pixels[(j*sz*2 + i)*3]); } static void stbhw__draw_v_tile(unsigned char *output, int stride, int xmax, int ymax, int x, int y, stbhw_tile *h, int sz) { int i,j; for (j=0; j < sz*2; ++j) if (y+j >= 0 && y+j < ymax) for (i=0; i < sz; ++i) if (x+i >= 0 && x+i < xmax) stbhw__draw_pixel(output,stride, x+i,y+j, &h->pixels[(j*sz + i)*3]); } // randomly choose a tile that fits constraints for a given spot, and update the constraints static stbhw_tile * stbhw__choose_tile(stbhw_tile **list, int numlist, signed char *a, signed char *b, signed char *c, signed char *d, signed char *e, signed char *f, int **weighting) { int i,n,m = 1<<30,pass; for (pass=0; pass < 2; ++pass) { n=0; // pass #1: // count number of variants that match this partial set of constraints // pass #2: // stop on randomly selected match for (i=0; i < numlist; ++i) { stbhw_tile *h = list[i]; if ((*a < 0 || *a == h->a) && (*b < 0 || *b == h->b) && (*c < 0 || *c == h->c) && (*d < 0 || *d == h->d) && (*e < 0 || *e == h->e) && (*f < 0 || *f == h->f)) { if (weighting) n += weighting[0][i]; else n += 1; if (n > m) { // use list[i] // update constraints to reflect what we placed *a = h->a; *b = h->b; *c = h->c; *d = h->d; *e = h->e; *f = h->f; return h; } } } if (n == 0) { stbhw_error = "couldn't find tile matching constraints"; return NULL; } m = STB_HBWANG_RAND() % n; } STB_HBWANG_ASSERT(0); return NULL; } static int stbhw__match(int x, int y) { return c_color[y][x] == c_color[y+1][x+1]; } static int stbhw__weighted(int num_options, int *weights) { int k, total, choice; total = 0; for (k=0; k < num_options; ++k) total += weights[k]; choice = STB_HBWANG_RAND() % total; total = 0; for (k=0; k < num_options; ++k) { total += weights[k]; if (choice < total) break; } STB_HBWANG_ASSERT(k < num_options); return k; } static int stbhw__change_color(int old_color, int num_options, int *weights) { if (weights) { int k, total, choice; total = 0; for (k=0; k < num_options; ++k) if (k != old_color) total += weights[k]; choice = STB_HBWANG_RAND() % total; total = 0; for (k=0; k < num_options; ++k) { if (k != old_color) { total += weights[k]; if (choice < total) break; } } STB_HBWANG_ASSERT(k < num_options); return k; } else { int offset = 1+STB_HBWANG_RAND() % (num_options-1); return (old_color+offset) % num_options; } } // generate a map that is w * h pixels (3-bytes each) // returns 1 on success, 0 on error STBHW_EXTERN int stbhw_generate_image(stbhw_tileset *ts, int **weighting, unsigned char *output, int stride, int w, int h) { int sidelen = ts->short_side_len; int xmax = (w / sidelen) + 6; int ymax = (h / sidelen) + 6; if (xmax > STB_HBWANG_MAX_X+6 || ymax > STB_HBWANG_MAX_Y+6) { stbhw_error = "increase STB_HBWANG_MAX_X/Y"; return 0; } if (ts->is_corner) { int i,j, ypos; int *cc = ts->num_color; for (j=0; j < ymax; ++j) { for (i=0; i < xmax; ++i) { int p = (i-j+1)&3; // corner type if (weighting==NULL || weighting[p]==0 || cc[p] == 1) c_color[j][i] = STB_HBWANG_RAND() % cc[p]; else c_color[j][i] = stbhw__weighted(cc[p], weighting[p]); } } #ifndef STB_HBWANG_NO_REPITITION_REDUCTION // now go back through and make sure we don't have adjancent 3x2 vertices that are identical, // to avoid really obvious repetition (which happens easily with extreme weights) for (j=0; j < ymax-3; ++j) { for (i=0; i < xmax-3; ++i) { int p = (i-j+1) & 3; // corner type STB_HBWANG_ASSERT(i+3 < STB_HBWANG_MAX_X+6); STB_HBWANG_ASSERT(j+3 < STB_HBWANG_MAX_Y+6); if (stbhw__match(i,j) && stbhw__match(i,j+1) && stbhw__match(i,j+2) && stbhw__match(i+1,j) && stbhw__match(i+1,j+1) && stbhw__match(i+1,j+2)) { int p = ((i+1)-(j+1)+1) & 3; if (cc[p] > 1) c_color[j+1][i+1] = stbhw__change_color(c_color[j+1][i+1], cc[p], weighting ? weighting[p] : NULL); } if (stbhw__match(i,j) && stbhw__match(i+1,j) && stbhw__match(i+2,j) && stbhw__match(i,j+1) && stbhw__match(i+1,j+1) && stbhw__match(i+2,j+1)) { int p = ((i+2)-(j+1)+1) & 3; if (cc[p] > 1) c_color[j+1][i+2] = stbhw__change_color(c_color[j+1][i+2], cc[p], weighting ? weighting[p] : NULL); } } } #endif ypos = -1 * sidelen; for (j = -1; ypos < h; ++j) { // a general herringbone row consists of: // horizontal left block, the bottom of a previous vertical, the top of a new vertical int phase = (j & 3); // displace horizontally according to pattern if (phase == 0) { i = 0; } else { i = phase-4; } for (i;; i += 4) { int xpos = i * sidelen; if (xpos >= w) break; // horizontal left-block if (xpos + sidelen*2 >= 0 && ypos >= 0) { stbhw_tile *t = stbhw__choose_tile( ts->h_tiles, ts->num_h_tiles, &c_color[j+2][i+2], &c_color[j+2][i+3], &c_color[j+2][i+4], &c_color[j+3][i+2], &c_color[j+3][i+3], &c_color[j+3][i+4], weighting ); if (t == NULL) return 0; stbhw__draw_h_tile(output,stride,w,h, xpos, ypos, t, sidelen); } xpos += sidelen * 2; // now we're at the end of a previous vertical one xpos += sidelen; // now we're at the start of a new vertical one if (xpos < w) { stbhw_tile *t = stbhw__choose_tile( ts->v_tiles, ts->num_v_tiles, &c_color[j+2][i+5], &c_color[j+3][i+5], &c_color[j+4][i+5], &c_color[j+2][i+6], &c_color[j+3][i+6], &c_color[j+4][i+6], weighting ); if (t == NULL) return 0; stbhw__draw_v_tile(output,stride,w,h, xpos, ypos, t, sidelen); } } ypos += sidelen; } } else { // @TODO edge-color repetition reduction int i,j, ypos; memset(v_color, -1, sizeof(v_color)); memset(h_color, -1, sizeof(h_color)); ypos = -1 * sidelen; for (j = -1; ypos= w) break; // horizontal left-block if (xpos + sidelen*2 >= 0 && ypos >= 0) { stbhw_tile *t = stbhw__choose_tile( ts->h_tiles, ts->num_h_tiles, &h_color[j+2][i+2], &h_color[j+2][i+3], &v_color[j+2][i+2], &v_color[j+2][i+4], &h_color[j+3][i+2], &h_color[j+3][i+3], weighting ); if (t == NULL) return 0; stbhw__draw_h_tile(output,stride,w,h, xpos, ypos, t, sidelen); } xpos += sidelen * 2; // now we're at the end of a previous vertical one xpos += sidelen; // now we're at the start of a new vertical one if (xpos < w) { stbhw_tile *t = stbhw__choose_tile( ts->v_tiles, ts->num_v_tiles, &h_color[j+2][i+5], &v_color[j+2][i+5], &v_color[j+2][i+6], &v_color[j+3][i+5], &v_color[j+3][i+6], &h_color[j+4][i+5], weighting ); if (t == NULL) return 0; stbhw__draw_v_tile(output,stride,w,h, xpos, ypos, t, sidelen); } } ypos += sidelen; } } return 1; } static void stbhw__parse_h_rect(stbhw__process *p, int xpos, int ypos, int a, int b, int c, int d, int e, int f) { int len = p->c->short_side_len; stbhw_tile *h = (stbhw_tile *) malloc(sizeof(*h)-1 + 3 * (len*2) * len); int i,j; ++xpos; ++ypos; h->a = a, h->b = b, h->c = c, h->d = d, h->e = e, h->f = f; for (j=0; j < len; ++j) for (i=0; i < len*2; ++i) memcpy(h->pixels + j*(3*len*2) + i*3, p->data+(ypos+j)*p->stride+(xpos+i)*3, 3); STB_HBWANG_ASSERT(p->ts->num_h_tiles < p->ts->max_h_tiles); p->ts->h_tiles[p->ts->num_h_tiles++] = h; } static void stbhw__parse_v_rect(stbhw__process *p, int xpos, int ypos, int a, int b, int c, int d, int e, int f) { int len = p->c->short_side_len; stbhw_tile *h = (stbhw_tile *) malloc(sizeof(*h)-1 + 3 * (len*2) * len); int i,j; ++xpos; ++ypos; h->a = a, h->b = b, h->c = c, h->d = d, h->e = e, h->f = f; for (j=0; j < len*2; ++j) for (i=0; i < len; ++i) memcpy(h->pixels + j*(3*len) + i*3, p->data+(ypos+j)*p->stride+(xpos+i)*3, 3); STB_HBWANG_ASSERT(p->ts->num_v_tiles < p->ts->max_v_tiles); p->ts->v_tiles[p->ts->num_v_tiles++] = h; } STBHW_EXTERN int stbhw_build_tileset_from_image(stbhw_tileset *ts, unsigned char *data, int stride, int w, int h) { int i, h_count, v_count; unsigned char header[9]; stbhw_config c = { 0 }; stbhw__process p = { 0 }; // extract binary header // remove encoding that makes it more visually obvious it encodes actual data for (i=0; i < 9; ++i) header[i] = data[w*3 - 1 - i] ^ (i*55); // extract header info if (header[7] == 0xc0) { // corner-type c.is_corner = 1; for (i=0; i < 4; ++i) c.num_color[i] = header[i]; c.num_vary_x = header[4]; c.num_vary_y = header[5]; c.short_side_len = header[6]; } else { c.is_corner = 0; // edge-type for (i=0; i < 6; ++i) c.num_color[i] = header[i]; c.num_vary_x = header[6]; c.num_vary_y = header[7]; c.short_side_len = header[8]; } if (c.num_vary_x < 0 || c.num_vary_x > 64 || c.num_vary_y < 0 || c.num_vary_y > 64) return 0; if (c.short_side_len == 0) return 0; if (c.num_color[0] > 32 || c.num_color[1] > 32 || c.num_color[2] > 32 || c.num_color[3] > 32) return 0; stbhw__get_template_info(&c, NULL, NULL, &h_count, &v_count); ts->is_corner = c.is_corner; ts->short_side_len = c.short_side_len; memcpy(ts->num_color, c.num_color, sizeof(ts->num_color)); ts->max_h_tiles = h_count; ts->max_v_tiles = v_count; ts->num_h_tiles = ts->num_v_tiles = 0; ts->h_tiles = (stbhw_tile **) malloc(sizeof(*ts->h_tiles) * h_count); ts->v_tiles = (stbhw_tile **) malloc(sizeof(*ts->v_tiles) * v_count); p.ts = ts; p.data = data; p.stride = stride; p.process_h_rect = stbhw__parse_h_rect; p.process_v_rect = stbhw__parse_v_rect; p.w = w; p.h = h; p.c = &c; // load all the tiles out of the image return stbhw__process_template(&p); } STBHW_EXTERN void stbhw_free_tileset(stbhw_tileset *ts) { int i; for (i=0; i < ts->num_h_tiles; ++i) free(ts->h_tiles[i]); for (i=0; i < ts->num_v_tiles; ++i) free(ts->v_tiles[i]); free(ts->h_tiles); free(ts->v_tiles); ts->h_tiles = NULL; ts->v_tiles = NULL; ts->num_h_tiles = ts->max_h_tiles = 0; ts->num_v_tiles = ts->max_v_tiles = 0; } ////////////////////////////////////////////////////////////////////////////// // // GENERATOR // // // shared code static void stbhw__set_pixel(unsigned char *data, int stride, int xpos, int ypos, unsigned char color[3]) { memcpy(data + ypos*stride + xpos*3, color, 3); } static void stbhw__stbhw__set_pixel_whiten(unsigned char *data, int stride, int xpos, int ypos, unsigned char color[3]) { unsigned char c2[3]; int i; for (i=0; i < 3; ++i) c2[i] = (color[i]*2 + 255)/3; memcpy(data + ypos*stride + xpos*3, c2, 3); } static unsigned char stbhw__black[3] = { 0,0,0 }; // each edge set gets its own unique color variants // used http://phrogz.net/css/distinct-colors.html to generate this set, // but it's not very good and needs to be revised static unsigned char stbhw__color[7][8][3] = { { {255,51,51} , {143,143,29}, {0,199,199}, {159,119,199}, {0,149,199} , {143, 0,143}, {255,128,0}, {64,255,0}, }, { {235,255,30 }, {255,0,255}, {199,139,119}, {29,143, 57}, {143,0,71} , { 0,143,143}, {0,99,199}, {143,71,0}, }, { {0,149,199} , {143, 0,143}, {255,128,0}, {64,255,0}, {255,191,0} , {51,255,153}, {0,0,143}, {199,119,159},}, { {143,0,71} , { 0,143,143}, {0,99,199}, {143,71,0}, {255,190,153}, { 0,255,255}, {128,0,255}, {255,51,102},}, { {255,191,0} , {51,255,153}, {0,0,143}, {199,119,159}, {255,51,51} , {143,143,29}, {0,199,199}, {159,119,199},}, { {255,190,153}, { 0,255,255}, {128,0,255}, {255,51,102}, {235,255,30 }, {255,0,255}, {199,139,119}, {29,143, 57}, }, { {40,40,40 }, { 90,90,90 }, { 150,150,150 }, { 200,200,200 }, { 255,90,90 }, { 160,160,80}, { 50,150,150 }, { 200,50,200 } }, }; static void stbhw__draw_hline(unsigned char *data, int stride, int xpos, int ypos, int color, int len, int slot) { int i; int j = len * 6 / 16; int k = len * 10 / 16; for (i=0; i < len; ++i) stbhw__set_pixel(data, stride, xpos+i, ypos, stbhw__black); if (k-j < 2) { j = len/2 - 1; k = j+2; if (len & 1) ++k; } for (i=j; i < k; ++i) stbhw__stbhw__set_pixel_whiten(data, stride, xpos+i, ypos, stbhw__color[slot][color]); } static void stbhw__draw_vline(unsigned char *data, int stride, int xpos, int ypos, int color, int len, int slot) { int i; int j = len * 6 / 16; int k = len * 10 / 16; for (i=0; i < len; ++i) stbhw__set_pixel(data, stride, xpos, ypos+i, stbhw__black); if (k-j < 2) { j = len/2 - 1; k = j+2; if (len & 1) ++k; } for (i=j; i < k; ++i) stbhw__stbhw__set_pixel_whiten(data, stride, xpos, ypos+i, stbhw__color[slot][color]); } // 0--*--1--*--2--*--3 // | | | // * * * // | | | // 1--*--2--*--3 0--*--1--*--2 // | | | // * * * // | | | // 0--*--1--*--2--*--3 // // variables while enumerating (no correspondence between corners // of the types is implied by these variables) // // a-----b-----c a-----d // | | | | // | | | | // | | | | // d-----e-----f b e // | | // | | // | | // c-----f // unsigned char stbhw__corner_colors[4][4][3] = { { { 255,0,0 }, { 200,200,200 }, { 100,100,200 }, { 255,200,150 }, }, { { 0,0,255 }, { 255,255,0 }, { 100,200,100 }, { 150,255,200 }, }, { { 255,0,255 }, { 80,80,80 }, { 200,100,100 }, { 200,150,255 }, }, { { 0,255,255 }, { 0,255,0 }, { 200,120,200 }, { 255,200,200 }, }, }; int stbhw__corner_colors_to_edge_color[4][4] = { // 0 1 2 3 { 0, 1, 4, 9, }, // 0 { 2, 3, 5, 10, }, // 1 { 6, 7, 8, 11, }, // 2 { 12, 13, 14, 15, }, // 3 }; #define stbhw__c2e stbhw__corner_colors_to_edge_color static void stbhw__draw_clipped_corner(unsigned char *data, int stride, int xpos, int ypos, int w, int h, int x, int y) { static unsigned char template_color[3] = { 167,204,204 }; int i,j; for (j = -2; j <= 1; ++j) { for (i = -2; i <= 1; ++i) { if ((i == -2 || i == 1) && (j == -2 || j == 1)) continue; else { if (x+i < 1 || x+i > w) continue; if (y+j < 1 || y+j > h) continue; stbhw__set_pixel(data, stride, xpos+x+i, ypos+y+j, template_color); } } } } static void stbhw__edge_process_h_rect(stbhw__process *p, int xpos, int ypos, int a, int b, int c, int d, int e, int f) { int len = p->c->short_side_len; stbhw__draw_hline(p->data, p->stride, xpos+1 , ypos , a, len, 2); stbhw__draw_hline(p->data, p->stride, xpos+ len+1 , ypos , b, len, 3); stbhw__draw_vline(p->data, p->stride, xpos , ypos+1 , c, len, 1); stbhw__draw_vline(p->data, p->stride, xpos+2*len+1 , ypos+1 , d, len, 4); stbhw__draw_hline(p->data, p->stride, xpos+1 , ypos + len+1, e, len, 0); stbhw__draw_hline(p->data, p->stride, xpos + len+1 , ypos + len+1, f, len, 2); } static void stbhw__edge_process_v_rect(stbhw__process *p, int xpos, int ypos, int a, int b, int c, int d, int e, int f) { int len = p->c->short_side_len; stbhw__draw_hline(p->data, p->stride, xpos+1 , ypos , a, len, 0); stbhw__draw_vline(p->data, p->stride, xpos , ypos+1 , b, len, 5); stbhw__draw_vline(p->data, p->stride, xpos + len+1, ypos+1 , c, len, 1); stbhw__draw_vline(p->data, p->stride, xpos , ypos + len+1, d, len, 4); stbhw__draw_vline(p->data, p->stride, xpos + len+1, ypos + len+1, e, len, 5); stbhw__draw_hline(p->data, p->stride, xpos+1 , ypos + 2*len+1, f, len, 3); } static void stbhw__corner_process_h_rect(stbhw__process *p, int xpos, int ypos, int a, int b, int c, int d, int e, int f) { int len = p->c->short_side_len; stbhw__draw_hline(p->data, p->stride, xpos+1 , ypos , stbhw__c2e[a][b], len, 2); stbhw__draw_hline(p->data, p->stride, xpos+ len+1 , ypos , stbhw__c2e[b][c], len, 3); stbhw__draw_vline(p->data, p->stride, xpos , ypos+1 , stbhw__c2e[a][d], len, 1); stbhw__draw_vline(p->data, p->stride, xpos+2*len+1 , ypos+1 , stbhw__c2e[c][f], len, 4); stbhw__draw_hline(p->data, p->stride, xpos+1 , ypos + len+1, stbhw__c2e[d][e], len, 0); stbhw__draw_hline(p->data, p->stride, xpos + len+1 , ypos + len+1, stbhw__c2e[e][f], len, 2); if (p->c->corner_type_color_template[1][a]) stbhw__draw_clipped_corner(p->data,p->stride, xpos,ypos, len*2,len, 1,1); if (p->c->corner_type_color_template[2][b]) stbhw__draw_clipped_corner(p->data,p->stride, xpos,ypos, len*2,len, len+1,1); if (p->c->corner_type_color_template[3][c]) stbhw__draw_clipped_corner(p->data,p->stride, xpos,ypos, len*2,len, len*2+1,1); if (p->c->corner_type_color_template[0][d]) stbhw__draw_clipped_corner(p->data,p->stride, xpos,ypos, len*2,len, 1,len+1); if (p->c->corner_type_color_template[1][e]) stbhw__draw_clipped_corner(p->data,p->stride, xpos,ypos, len*2,len, len+1,len+1); if (p->c->corner_type_color_template[2][f]) stbhw__draw_clipped_corner(p->data,p->stride, xpos,ypos, len*2,len, len*2+1,len+1); stbhw__set_pixel(p->data, p->stride, xpos , ypos, stbhw__corner_colors[1][a]); stbhw__set_pixel(p->data, p->stride, xpos+len , ypos, stbhw__corner_colors[2][b]); stbhw__set_pixel(p->data, p->stride, xpos+2*len+1, ypos, stbhw__corner_colors[3][c]); stbhw__set_pixel(p->data, p->stride, xpos , ypos+len+1, stbhw__corner_colors[0][d]); stbhw__set_pixel(p->data, p->stride, xpos+len , ypos+len+1, stbhw__corner_colors[1][e]); stbhw__set_pixel(p->data, p->stride, xpos+2*len+1, ypos+len+1, stbhw__corner_colors[2][f]); } static void stbhw__corner_process_v_rect(stbhw__process *p, int xpos, int ypos, int a, int b, int c, int d, int e, int f) { int len = p->c->short_side_len; stbhw__draw_hline(p->data, p->stride, xpos+1 , ypos , stbhw__c2e[a][d], len, 0); stbhw__draw_vline(p->data, p->stride, xpos , ypos+1 , stbhw__c2e[a][b], len, 5); stbhw__draw_vline(p->data, p->stride, xpos + len+1, ypos+1 , stbhw__c2e[d][e], len, 1); stbhw__draw_vline(p->data, p->stride, xpos , ypos + len+1, stbhw__c2e[b][c], len, 4); stbhw__draw_vline(p->data, p->stride, xpos + len+1, ypos + len+1, stbhw__c2e[e][f], len, 5); stbhw__draw_hline(p->data, p->stride, xpos+1 , ypos + 2*len+1, stbhw__c2e[c][f], len, 3); if (p->c->corner_type_color_template[0][a]) stbhw__draw_clipped_corner(p->data,p->stride, xpos,ypos, len,len*2, 1,1); if (p->c->corner_type_color_template[3][b]) stbhw__draw_clipped_corner(p->data,p->stride, xpos,ypos, len,len*2, 1,len+1); if (p->c->corner_type_color_template[2][c]) stbhw__draw_clipped_corner(p->data,p->stride, xpos,ypos, len,len*2, 1,len*2+1); if (p->c->corner_type_color_template[1][d]) stbhw__draw_clipped_corner(p->data,p->stride, xpos,ypos, len,len*2, len+1,1); if (p->c->corner_type_color_template[0][e]) stbhw__draw_clipped_corner(p->data,p->stride, xpos,ypos, len,len*2, len+1,len+1); if (p->c->corner_type_color_template[3][f]) stbhw__draw_clipped_corner(p->data,p->stride, xpos,ypos, len,len*2, len+1,len*2+1); stbhw__set_pixel(p->data, p->stride, xpos , ypos , stbhw__corner_colors[0][a]); stbhw__set_pixel(p->data, p->stride, xpos , ypos+len , stbhw__corner_colors[3][b]); stbhw__set_pixel(p->data, p->stride, xpos , ypos+2*len+1, stbhw__corner_colors[2][c]); stbhw__set_pixel(p->data, p->stride, xpos+len+1, ypos , stbhw__corner_colors[1][d]); stbhw__set_pixel(p->data, p->stride, xpos+len+1, ypos+len , stbhw__corner_colors[0][e]); stbhw__set_pixel(p->data, p->stride, xpos+len+1, ypos+2*len+1, stbhw__corner_colors[3][f]); } // generates a template image, assuming data is 3*w*h bytes long, RGB format STBHW_EXTERN int stbhw_make_template(stbhw_config *c, unsigned char *data, int w, int h, int stride_in_bytes) { stbhw__process p; int i; p.data = data; p.w = w; p.h = h; p.stride = stride_in_bytes; p.ts = 0; p.c = c; if (c->is_corner) { p.process_h_rect = stbhw__corner_process_h_rect; p.process_v_rect = stbhw__corner_process_v_rect; } else { p.process_h_rect = stbhw__edge_process_h_rect; p.process_v_rect = stbhw__edge_process_v_rect; } for (i=0; i < p.h; ++i) memset(p.data + i*p.stride, 255, 3*p.w); if (!stbhw__process_template(&p)) return 0; if (c->is_corner) { // write out binary information in first line of image for (i=0; i < 4; ++i) data[w*3-1-i] = c->num_color[i]; data[w*3-1-i] = c->num_vary_x; data[w*3-2-i] = c->num_vary_y; data[w*3-3-i] = c->short_side_len; data[w*3-4-i] = 0xc0; } else { for (i=0; i < 6; ++i) data[w*3-1-i] = c->num_color[i]; data[w*3-1-i] = c->num_vary_x; data[w*3-2-i] = c->num_vary_y; data[w*3-3-i] = c->short_side_len; } // make it more obvious it encodes actual data for (i=0; i < 9; ++i) p.data[p.w*3 - 1 - i] ^= i*55; return 1; } #endif // STB_HBWANG_IMPLEMENTATION uTox/third_party/stb/stb/stb_easy_font.h0000600000175000001440000003056214003056224017424 0ustar rakusers// stb_easy_font.h - v1.0 - bitmap font for 3D rendering - public domain // Sean Barrett, Feb 2015 // // Easy-to-deploy, // reasonably compact, // extremely inefficient performance-wise, // crappy-looking, // ASCII-only, // bitmap font for use in 3D APIs. // // Intended for when you just want to get some text displaying // in a 3D app as quickly as possible. // // Doesn't use any textures, instead builds characters out of quads. // // DOCUMENTATION: // // int stb_easy_font_width(char *text) // int stb_easy_font_height(char *text) // // Takes a string and returns the horizontal size and the // vertical size (which can vary if 'text' has newlines). // // int stb_easy_font_print(float x, float y, // char *text, unsigned char color[4], // void *vertex_buffer, int vbuf_size) // // Takes a string (which can contain '\n') and fills out a // vertex buffer with renderable data to draw the string. // Output data assumes increasing x is rightwards, increasing y // is downwards. // // The vertex data is divided into quads, i.e. there are four // vertices in the vertex buffer for each quad. // // The vertices are stored in an interleaved format: // // x:float // y:float // z:float // color:uint8[4] // // You can ignore z and color if you get them from elsewhere // This format was chosen in the hopes it would make it // easier for you to reuse existing vertex-buffer-drawing code. // // If you pass in NULL for color, it becomes 255,255,255,255. // // Returns the number of quads. // // If the buffer isn't large enough, it will truncate. // Expect it to use an average of ~270 bytes per character. // // If your API doesn't draw quads, build a reusable index // list that allows you to render quads as indexed triangles. // // void stb_easy_font_spacing(float spacing) // // Use positive values to expand the space between characters, // and small negative values (no smaller than -1.5) to contract // the space between characters. // // E.g. spacing = 1 adds one "pixel" of spacing between the // characters. spacing = -1 is reasonable but feels a bit too // compact to me; -0.5 is a reasonable compromise as long as // you're scaling the font up. // // LICENSE // // See end of file for license information. // // VERSION HISTORY // // (2017-01-15) 1.0 space character takes same space as numbers; fix bad spacing of 'f' // (2016-01-22) 0.7 width() supports multiline text; add height() // (2015-09-13) 0.6 #include ; updated license // (2015-02-01) 0.5 First release // // CONTRIBUTORS // // github:vassvik -- bug report #if 0 // SAMPLE CODE: // // Here's sample code for old OpenGL; it's a lot more complicated // to make work on modern APIs, and that's your problem. // void print_string(float x, float y, char *text, float r, float g, float b) { static char buffer[99999]; // ~500 chars int num_quads; num_quads = stb_easy_font_print(x, y, text, NULL, buffer, sizeof(buffer)); glColor3f(r,g,b); glEnableClientState(GL_VERTEX_ARRAY); glVertexPointer(2, GL_FLOAT, 16, buffer); glDrawArrays(GL_QUADS, 0, num_quads*4); glDisableClientState(GL_VERTEX_ARRAY); } #endif #ifndef INCLUDE_STB_EASY_FONT_H #define INCLUDE_STB_EASY_FONT_H #include #include struct stb_easy_font_info_struct { unsigned char advance; unsigned char h_seg; unsigned char v_seg; } stb_easy_font_charinfo[96] = { { 6, 0, 0 }, { 3, 0, 0 }, { 5, 1, 1 }, { 7, 1, 4 }, { 7, 3, 7 }, { 7, 6, 12 }, { 7, 8, 19 }, { 4, 16, 21 }, { 4, 17, 22 }, { 4, 19, 23 }, { 23, 21, 24 }, { 23, 22, 31 }, { 20, 23, 34 }, { 22, 23, 36 }, { 19, 24, 36 }, { 21, 25, 36 }, { 6, 25, 39 }, { 6, 27, 43 }, { 6, 28, 45 }, { 6, 30, 49 }, { 6, 33, 53 }, { 6, 34, 57 }, { 6, 40, 58 }, { 6, 46, 59 }, { 6, 47, 62 }, { 6, 55, 64 }, { 19, 57, 68 }, { 20, 59, 68 }, { 21, 61, 69 }, { 22, 66, 69 }, { 21, 68, 69 }, { 7, 73, 69 }, { 9, 75, 74 }, { 6, 78, 81 }, { 6, 80, 85 }, { 6, 83, 90 }, { 6, 85, 91 }, { 6, 87, 95 }, { 6, 90, 96 }, { 7, 92, 97 }, { 6, 96,102 }, { 5, 97,106 }, { 6, 99,107 }, { 6,100,110 }, { 6,100,115 }, { 7,101,116 }, { 6,101,121 }, { 6,101,125 }, { 6,102,129 }, { 7,103,133 }, { 6,104,140 }, { 6,105,145 }, { 7,107,149 }, { 6,108,151 }, { 7,109,155 }, { 7,109,160 }, { 7,109,165 }, { 7,118,167 }, { 6,118,172 }, { 4,120,176 }, { 6,122,177 }, { 4,122,181 }, { 23,124,182 }, { 22,129,182 }, { 4,130,182 }, { 22,131,183 }, { 6,133,187 }, { 22,135,191 }, { 6,137,192 }, { 22,139,196 }, { 6,144,197 }, { 22,147,198 }, { 6,150,202 }, { 19,151,206 }, { 21,152,207 }, { 6,155,209 }, { 3,160,210 }, { 23,160,211 }, { 22,164,216 }, { 22,165,220 }, { 22,167,224 }, { 22,169,228 }, { 21,171,232 }, { 21,173,233 }, { 5,178,233 }, { 22,179,234 }, { 23,180,238 }, { 23,180,243 }, { 23,180,248 }, { 22,189,248 }, { 22,191,252 }, { 5,196,252 }, { 3,203,252 }, { 5,203,253 }, { 22,210,253 }, { 0,214,253 }, }; unsigned char stb_easy_font_hseg[214] = { 97,37,69,84,28,51,2,18,10,49,98,41,65,25,81,105,33,9,97,1,97,37,37,36, 81,10,98,107,3,100,3,99,58,51,4,99,58,8,73,81,10,50,98,8,73,81,4,10,50, 98,8,25,33,65,81,10,50,17,65,97,25,33,25,49,9,65,20,68,1,65,25,49,41, 11,105,13,101,76,10,50,10,50,98,11,99,10,98,11,50,99,11,50,11,99,8,57, 58,3,99,99,107,10,10,11,10,99,11,5,100,41,65,57,41,65,9,17,81,97,3,107, 9,97,1,97,33,25,9,25,41,100,41,26,82,42,98,27,83,42,98,26,51,82,8,41, 35,8,10,26,82,114,42,1,114,8,9,73,57,81,41,97,18,8,8,25,26,26,82,26,82, 26,82,41,25,33,82,26,49,73,35,90,17,81,41,65,57,41,65,25,81,90,114,20, 84,73,57,41,49,25,33,65,81,9,97,1,97,25,33,65,81,57,33,25,41,25, }; unsigned char stb_easy_font_vseg[253] = { 4,2,8,10,15,8,15,33,8,15,8,73,82,73,57,41,82,10,82,18,66,10,21,29,1,65, 27,8,27,9,65,8,10,50,97,74,66,42,10,21,57,41,29,25,14,81,73,57,26,8,8, 26,66,3,8,8,15,19,21,90,58,26,18,66,18,105,89,28,74,17,8,73,57,26,21, 8,42,41,42,8,28,22,8,8,30,7,8,8,26,66,21,7,8,8,29,7,7,21,8,8,8,59,7,8, 8,15,29,8,8,14,7,57,43,10,82,7,7,25,42,25,15,7,25,41,15,21,105,105,29, 7,57,57,26,21,105,73,97,89,28,97,7,57,58,26,82,18,57,57,74,8,30,6,8,8, 14,3,58,90,58,11,7,74,43,74,15,2,82,2,42,75,42,10,67,57,41,10,7,2,42, 74,106,15,2,35,8,8,29,7,8,8,59,35,51,8,8,15,35,30,35,8,8,30,7,8,8,60, 36,8,45,7,7,36,8,43,8,44,21,8,8,44,35,8,8,43,23,8,8,43,35,8,8,31,21,15, 20,8,8,28,18,58,89,58,26,21,89,73,89,29,20,8,8,30,7, }; typedef struct { unsigned char c[4]; } stb_easy_font_color; static int stb_easy_font_draw_segs(float x, float y, unsigned char *segs, int num_segs, int vertical, stb_easy_font_color c, char *vbuf, int vbuf_size, int offset) { int i,j; for (i=0; i < num_segs; ++i) { int len = segs[i] & 7; x += (float) ((segs[i] >> 3) & 1); if (len && offset+64 <= vbuf_size) { float y0 = y + (float) (segs[i]>>4); for (j=0; j < 4; ++j) { * (float *) (vbuf+offset+0) = x + (j==1 || j==2 ? (vertical ? 1 : len) : 0); * (float *) (vbuf+offset+4) = y0 + ( j >= 2 ? (vertical ? len : 1) : 0); * (float *) (vbuf+offset+8) = 0.f; * (stb_easy_font_color *) (vbuf+offset+12) = c; offset += 16; } } } return offset; } float stb_easy_font_spacing_val = 0; static void stb_easy_font_spacing(float spacing) { stb_easy_font_spacing_val = spacing; } static int stb_easy_font_print(float x, float y, char *text, unsigned char color[4], void *vertex_buffer, int vbuf_size) { char *vbuf = (char *) vertex_buffer; float start_x = x; int offset = 0; stb_easy_font_color c = { 255,255,255,255 }; // use structure copying to avoid needing depending on memcpy() if (color) { c.c[0] = color[0]; c.c[1] = color[1]; c.c[2] = color[2]; c.c[3] = color[3]; } while (*text && offset < vbuf_size) { if (*text == '\n') { y += 12; x = start_x; } else { unsigned char advance = stb_easy_font_charinfo[*text-32].advance; float y_ch = advance & 16 ? y+1 : y; int h_seg, v_seg, num_h, num_v; h_seg = stb_easy_font_charinfo[*text-32 ].h_seg; v_seg = stb_easy_font_charinfo[*text-32 ].v_seg; num_h = stb_easy_font_charinfo[*text-32+1].h_seg - h_seg; num_v = stb_easy_font_charinfo[*text-32+1].v_seg - v_seg; offset = stb_easy_font_draw_segs(x, y_ch, &stb_easy_font_hseg[h_seg], num_h, 0, c, vbuf, vbuf_size, offset); offset = stb_easy_font_draw_segs(x, y_ch, &stb_easy_font_vseg[v_seg], num_v, 1, c, vbuf, vbuf_size, offset); x += advance & 15; x += stb_easy_font_spacing_val; } ++text; } return (unsigned) offset/64; } static int stb_easy_font_width(char *text) { float len = 0; float max_len = 0; while (*text) { if (*text == '\n') { if (len > max_len) max_len = len; len = 0; } else { len += stb_easy_font_charinfo[*text-32].advance & 15; len += stb_easy_font_spacing_val; } ++text; } if (len > max_len) max_len = len; return (int) ceil(max_len); } static int stb_easy_font_height(char *text) { float y = 0; int nonempty_line=0; while (*text) { if (*text == '\n') { y += 12; nonempty_line = 0; } else { nonempty_line = 1; } ++text; } return (int) ceil(y + (nonempty_line ? 12 : 0)); } #endif /* ------------------------------------------------------------------------------ This software is available under 2 licenses -- choose whichever you prefer. ------------------------------------------------------------------------------ ALTERNATIVE A - MIT License Copyright (c) 2017 Sean Barrett 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. ------------------------------------------------------------------------------ ALTERNATIVE B - Public Domain (www.unlicense.org) This is free and unencumbered software released into the public domain. Anyone is free to copy, modify, publish, use, compile, sell, or distribute this software, either in source code form or as a compiled binary, for any purpose, commercial or non-commercial, and by any means. In jurisdictions that recognize copyright laws, the author or authors of this software dedicate any and all copyright interest in the software to the public domain. We make this dedication for the benefit of the public at large and to the detriment of our heirs and successors. We intend this dedication to be an overt act of relinquishment in perpetuity of all present and future rights to this software under copyright law. 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 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. ------------------------------------------------------------------------------ */ uTox/third_party/stb/stb/stb_dxt.h0000600000175000001440000005435614003056224016243 0ustar rakusers// stb_dxt.h - v1.07 - DXT1/DXT5 compressor - public domain // original by fabian "ryg" giesen - ported to C by stb // use '#define STB_DXT_IMPLEMENTATION' before including to create the implementation // // USAGE: // call stb_compress_dxt_block() for every block (you must pad) // source should be a 4x4 block of RGBA data in row-major order; // A is ignored if you specify alpha=0; you can turn on dithering // and "high quality" using mode. // // version history: // v1.07 - bc4; allow not using libc; add STB_DXT_STATIC // v1.06 - (stb) fix to known-broken 1.05 // v1.05 - (stb) support bc5/3dc (Arvids Kokins), use extern "C" in C++ (Pavel Krajcevski) // v1.04 - (ryg) default to no rounding bias for lerped colors (as per S3TC/DX10 spec); // single color match fix (allow for inexact color interpolation); // optimal DXT5 index finder; "high quality" mode that runs multiple refinement steps. // v1.03 - (stb) endianness support // v1.02 - (stb) fix alpha encoding bug // v1.01 - (stb) fix bug converting to RGB that messed up quality, thanks ryg & cbloom // v1.00 - (stb) first release // // contributors: // Kevin Schmidt (#defines for "freestanding" compilation) // github:ppiastucki (BC4 support) // // LICENSE // // See end of file for license information. #ifndef STB_INCLUDE_STB_DXT_H #define STB_INCLUDE_STB_DXT_H // compression mode (bitflags) #define STB_DXT_NORMAL 0 #define STB_DXT_DITHER 1 // use dithering. dubious win. never use for normal maps and the like! #define STB_DXT_HIGHQUAL 2 // high quality mode, does two refinement steps instead of 1. ~30-40% slower. #ifdef __cplusplus extern "C" { #endif #ifdef STB_DXT_STATIC #define STBDDEF static #else #define STBDDEF extern #endif STBDDEF void stb_compress_dxt_block(unsigned char *dest, const unsigned char *src_rgba_four_bytes_per_pixel, int alpha, int mode); STBDDEF void stb_compress_bc4_block(unsigned char *dest, const unsigned char *src_r_one_byte_per_pixel); STBDDEF void stb_compress_bc5_block(unsigned char *dest, const unsigned char *src_rg_two_byte_per_pixel); #ifdef __cplusplus } #endif #define STB_COMPRESS_DXT_BLOCK #ifdef STB_DXT_IMPLEMENTATION // configuration options for DXT encoder. set them in the project/makefile or just define // them at the top. // STB_DXT_USE_ROUNDING_BIAS // use a rounding bias during color interpolation. this is closer to what "ideal" // interpolation would do but doesn't match the S3TC/DX10 spec. old versions (pre-1.03) // implicitly had this turned on. // // in case you're targeting a specific type of hardware (e.g. console programmers): // NVidia and Intel GPUs (as of 2010) as well as DX9 ref use DXT decoders that are closer // to STB_DXT_USE_ROUNDING_BIAS. AMD/ATI, S3 and DX10 ref are closer to rounding with no bias. // you also see "(a*5 + b*3) / 8" on some old GPU designs. // #define STB_DXT_USE_ROUNDING_BIAS #include #if !defined(STBD_ABS) || !defined(STBI_FABS) #include #endif #ifndef STBD_ABS #define STBD_ABS(i) abs(i) #endif #ifndef STBD_FABS #define STBD_FABS(x) fabs(x) #endif #ifndef STBD_MEMSET #include #define STBD_MEMSET(x) memset(x) #endif static unsigned char stb__Expand5[32]; static unsigned char stb__Expand6[64]; static unsigned char stb__OMatch5[256][2]; static unsigned char stb__OMatch6[256][2]; static unsigned char stb__QuantRBTab[256+16]; static unsigned char stb__QuantGTab[256+16]; static int stb__Mul8Bit(int a, int b) { int t = a*b + 128; return (t + (t >> 8)) >> 8; } static void stb__From16Bit(unsigned char *out, unsigned short v) { int rv = (v & 0xf800) >> 11; int gv = (v & 0x07e0) >> 5; int bv = (v & 0x001f) >> 0; out[0] = stb__Expand5[rv]; out[1] = stb__Expand6[gv]; out[2] = stb__Expand5[bv]; out[3] = 0; } static unsigned short stb__As16Bit(int r, int g, int b) { return (stb__Mul8Bit(r,31) << 11) + (stb__Mul8Bit(g,63) << 5) + stb__Mul8Bit(b,31); } // linear interpolation at 1/3 point between a and b, using desired rounding type static int stb__Lerp13(int a, int b) { #ifdef STB_DXT_USE_ROUNDING_BIAS // with rounding bias return a + stb__Mul8Bit(b-a, 0x55); #else // without rounding bias // replace "/ 3" by "* 0xaaab) >> 17" if your compiler sucks or you really need every ounce of speed. return (2*a + b) / 3; #endif } // lerp RGB color static void stb__Lerp13RGB(unsigned char *out, unsigned char *p1, unsigned char *p2) { out[0] = stb__Lerp13(p1[0], p2[0]); out[1] = stb__Lerp13(p1[1], p2[1]); out[2] = stb__Lerp13(p1[2], p2[2]); } /****************************************************************************/ // compute table to reproduce constant colors as accurately as possible static void stb__PrepareOptTable(unsigned char *Table,const unsigned char *expand,int size) { int i,mn,mx; for (i=0;i<256;i++) { int bestErr = 256; for (mn=0;mn> 4)]; ep1[0] = bp[ 0] - dp[ 0]; dp[ 4] = quant[bp[ 4] + ((7*ep1[0] + 3*ep2[2] + 5*ep2[1] + ep2[0]) >> 4)]; ep1[1] = bp[ 4] - dp[ 4]; dp[ 8] = quant[bp[ 8] + ((7*ep1[1] + 3*ep2[3] + 5*ep2[2] + ep2[1]) >> 4)]; ep1[2] = bp[ 8] - dp[ 8]; dp[12] = quant[bp[12] + ((7*ep1[2] + 5*ep2[3] + ep2[2]) >> 4)]; ep1[3] = bp[12] - dp[12]; bp += 16; dp += 16; et = ep1, ep1 = ep2, ep2 = et; // swap } } } // The color matching function static unsigned int stb__MatchColorsBlock(unsigned char *block, unsigned char *color,int dither) { unsigned int mask = 0; int dirr = color[0*4+0] - color[1*4+0]; int dirg = color[0*4+1] - color[1*4+1]; int dirb = color[0*4+2] - color[1*4+2]; int dots[16]; int stops[4]; int i; int c0Point, halfPoint, c3Point; for(i=0;i<16;i++) dots[i] = block[i*4+0]*dirr + block[i*4+1]*dirg + block[i*4+2]*dirb; for(i=0;i<4;i++) stops[i] = color[i*4+0]*dirr + color[i*4+1]*dirg + color[i*4+2]*dirb; // think of the colors as arranged on a line; project point onto that line, then choose // next color out of available ones. we compute the crossover points for "best color in top // half"/"best in bottom half" and then the same inside that subinterval. // // relying on this 1d approximation isn't always optimal in terms of euclidean distance, // but it's very close and a lot faster. // http://cbloomrants.blogspot.com/2008/12/12-08-08-dxtc-summary.html c0Point = (stops[1] + stops[3]) >> 1; halfPoint = (stops[3] + stops[2]) >> 1; c3Point = (stops[2] + stops[0]) >> 1; if(!dither) { // the version without dithering is straightforward for (i=15;i>=0;i--) { int dot = dots[i]; mask <<= 2; if(dot < halfPoint) mask |= (dot < c0Point) ? 1 : 3; else mask |= (dot < c3Point) ? 2 : 0; } } else { // with floyd-steinberg dithering int err[8],*ep1 = err,*ep2 = err+4; int *dp = dots, y; c0Point <<= 4; halfPoint <<= 4; c3Point <<= 4; for(i=0;i<8;i++) err[i] = 0; for(y=0;y<4;y++) { int dot,lmask,step; dot = (dp[0] << 4) + (3*ep2[1] + 5*ep2[0]); if(dot < halfPoint) step = (dot < c0Point) ? 1 : 3; else step = (dot < c3Point) ? 2 : 0; ep1[0] = dp[0] - stops[step]; lmask = step; dot = (dp[1] << 4) + (7*ep1[0] + 3*ep2[2] + 5*ep2[1] + ep2[0]); if(dot < halfPoint) step = (dot < c0Point) ? 1 : 3; else step = (dot < c3Point) ? 2 : 0; ep1[1] = dp[1] - stops[step]; lmask |= step<<2; dot = (dp[2] << 4) + (7*ep1[1] + 3*ep2[3] + 5*ep2[2] + ep2[1]); if(dot < halfPoint) step = (dot < c0Point) ? 1 : 3; else step = (dot < c3Point) ? 2 : 0; ep1[2] = dp[2] - stops[step]; lmask |= step<<4; dot = (dp[3] << 4) + (7*ep1[2] + 5*ep2[3] + ep2[2]); if(dot < halfPoint) step = (dot < c0Point) ? 1 : 3; else step = (dot < c3Point) ? 2 : 0; ep1[3] = dp[3] - stops[step]; lmask |= step<<6; dp += 4; mask |= lmask << (y*8); { int *et = ep1; ep1 = ep2; ep2 = et; } // swap } } return mask; } // The color optimization function. (Clever code, part 1) static void stb__OptimizeColorsBlock(unsigned char *block, unsigned short *pmax16, unsigned short *pmin16) { int mind = 0x7fffffff,maxd = -0x7fffffff; unsigned char *minp, *maxp; double magn; int v_r,v_g,v_b; static const int nIterPower = 4; float covf[6],vfr,vfg,vfb; // determine color distribution int cov[6]; int mu[3],min[3],max[3]; int ch,i,iter; for(ch=0;ch<3;ch++) { const unsigned char *bp = ((const unsigned char *) block) + ch; int muv,minv,maxv; muv = minv = maxv = bp[0]; for(i=4;i<64;i+=4) { muv += bp[i]; if (bp[i] < minv) minv = bp[i]; else if (bp[i] > maxv) maxv = bp[i]; } mu[ch] = (muv + 8) >> 4; min[ch] = minv; max[ch] = maxv; } // determine covariance matrix for (i=0;i<6;i++) cov[i] = 0; for (i=0;i<16;i++) { int r = block[i*4+0] - mu[0]; int g = block[i*4+1] - mu[1]; int b = block[i*4+2] - mu[2]; cov[0] += r*r; cov[1] += r*g; cov[2] += r*b; cov[3] += g*g; cov[4] += g*b; cov[5] += b*b; } // convert covariance matrix to float, find principal axis via power iter for(i=0;i<6;i++) covf[i] = cov[i] / 255.0f; vfr = (float) (max[0] - min[0]); vfg = (float) (max[1] - min[1]); vfb = (float) (max[2] - min[2]); for(iter=0;iter magn) magn = STBD_FABS(vfg); if (STBD_FABS(vfb) > magn) magn = STBD_FABS(vfb); if(magn < 4.0f) { // too small, default to luminance v_r = 299; // JPEG YCbCr luma coefs, scaled by 1000. v_g = 587; v_b = 114; } else { magn = 512.0 / magn; v_r = (int) (vfr * magn); v_g = (int) (vfg * magn); v_b = (int) (vfb * magn); } // Pick colors at extreme points for(i=0;i<16;i++) { int dot = block[i*4+0]*v_r + block[i*4+1]*v_g + block[i*4+2]*v_b; if (dot < mind) { mind = dot; minp = block+i*4; } if (dot > maxd) { maxd = dot; maxp = block+i*4; } } *pmax16 = stb__As16Bit(maxp[0],maxp[1],maxp[2]); *pmin16 = stb__As16Bit(minp[0],minp[1],minp[2]); } static int stb__sclamp(float y, int p0, int p1) { int x = (int) y; if (x < p0) return p0; if (x > p1) return p1; return x; } // The refinement function. (Clever code, part 2) // Tries to optimize colors to suit block contents better. // (By solving a least squares system via normal equations+Cramer's rule) static int stb__RefineBlock(unsigned char *block, unsigned short *pmax16, unsigned short *pmin16, unsigned int mask) { static const int w1Tab[4] = { 3,0,2,1 }; static const int prods[4] = { 0x090000,0x000900,0x040102,0x010402 }; // ^some magic to save a lot of multiplies in the accumulating loop... // (precomputed products of weights for least squares system, accumulated inside one 32-bit register) float frb,fg; unsigned short oldMin, oldMax, min16, max16; int i, akku = 0, xx,xy,yy; int At1_r,At1_g,At1_b; int At2_r,At2_g,At2_b; unsigned int cm = mask; oldMin = *pmin16; oldMax = *pmax16; if((mask ^ (mask<<2)) < 4) // all pixels have the same index? { // yes, linear system would be singular; solve using optimal // single-color match on average color int r = 8, g = 8, b = 8; for (i=0;i<16;++i) { r += block[i*4+0]; g += block[i*4+1]; b += block[i*4+2]; } r >>= 4; g >>= 4; b >>= 4; max16 = (stb__OMatch5[r][0]<<11) | (stb__OMatch6[g][0]<<5) | stb__OMatch5[b][0]; min16 = (stb__OMatch5[r][1]<<11) | (stb__OMatch6[g][1]<<5) | stb__OMatch5[b][1]; } else { At1_r = At1_g = At1_b = 0; At2_r = At2_g = At2_b = 0; for (i=0;i<16;++i,cm>>=2) { int step = cm&3; int w1 = w1Tab[step]; int r = block[i*4+0]; int g = block[i*4+1]; int b = block[i*4+2]; akku += prods[step]; At1_r += w1*r; At1_g += w1*g; At1_b += w1*b; At2_r += r; At2_g += g; At2_b += b; } At2_r = 3*At2_r - At1_r; At2_g = 3*At2_g - At1_g; At2_b = 3*At2_b - At1_b; // extract solutions and decide solvability xx = akku >> 16; yy = (akku >> 8) & 0xff; xy = (akku >> 0) & 0xff; frb = 3.0f * 31.0f / 255.0f / (xx*yy - xy*xy); fg = frb * 63.0f / 31.0f; // solve. max16 = stb__sclamp((At1_r*yy - At2_r*xy)*frb+0.5f,0,31) << 11; max16 |= stb__sclamp((At1_g*yy - At2_g*xy)*fg +0.5f,0,63) << 5; max16 |= stb__sclamp((At1_b*yy - At2_b*xy)*frb+0.5f,0,31) << 0; min16 = stb__sclamp((At2_r*xx - At1_r*xy)*frb+0.5f,0,31) << 11; min16 |= stb__sclamp((At2_g*xx - At1_g*xy)*fg +0.5f,0,63) << 5; min16 |= stb__sclamp((At2_b*xx - At1_b*xy)*frb+0.5f,0,31) << 0; } *pmin16 = min16; *pmax16 = max16; return oldMin != min16 || oldMax != max16; } // Color block compression static void stb__CompressColorBlock(unsigned char *dest, unsigned char *block, int mode) { unsigned int mask; int i; int dither; int refinecount; unsigned short max16, min16; unsigned char dblock[16*4],color[4*4]; dither = mode & STB_DXT_DITHER; refinecount = (mode & STB_DXT_HIGHQUAL) ? 2 : 1; // check if block is constant for (i=1;i<16;i++) if (((unsigned int *) block)[i] != ((unsigned int *) block)[0]) break; if(i == 16) { // constant color int r = block[0], g = block[1], b = block[2]; mask = 0xaaaaaaaa; max16 = (stb__OMatch5[r][0]<<11) | (stb__OMatch6[g][0]<<5) | stb__OMatch5[b][0]; min16 = (stb__OMatch5[r][1]<<11) | (stb__OMatch6[g][1]<<5) | stb__OMatch5[b][1]; } else { // first step: compute dithered version for PCA if desired if(dither) stb__DitherBlock(dblock,block); // second step: pca+map along principal axis stb__OptimizeColorsBlock(dither ? dblock : block,&max16,&min16); if (max16 != min16) { stb__EvalColors(color,max16,min16); mask = stb__MatchColorsBlock(block,color,dither); } else mask = 0; // third step: refine (multiple times if requested) for (i=0;i> 8); dest[2] = (unsigned char) (min16); dest[3] = (unsigned char) (min16 >> 8); dest[4] = (unsigned char) (mask); dest[5] = (unsigned char) (mask >> 8); dest[6] = (unsigned char) (mask >> 16); dest[7] = (unsigned char) (mask >> 24); } // Alpha block compression (this is easy for a change) static void stb__CompressAlphaBlock(unsigned char *dest,unsigned char *src, int stride) { int i,dist,bias,dist4,dist2,bits,mask; // find min/max color int mn,mx; mn = mx = src[0]; for (i=1;i<16;i++) { if (src[i*stride] < mn) mn = src[i*stride]; else if (src[i*stride] > mx) mx = src[i*stride]; } // encode them ((unsigned char *)dest)[0] = mx; ((unsigned char *)dest)[1] = mn; dest += 2; // determine bias and emit color indices // given the choice of mx/mn, these indices are optimal: // http://fgiesen.wordpress.com/2009/12/15/dxt5-alpha-block-index-determination/ dist = mx-mn; dist4 = dist*4; dist2 = dist*2; bias = (dist < 8) ? (dist - 1) : (dist/2 + 2); bias -= mn * 7; bits = 0,mask=0; for (i=0;i<16;i++) { int a = src[i*stride]*7 + bias; int ind,t; // select index. this is a "linear scale" lerp factor between 0 (val=min) and 7 (val=max). t = (a >= dist4) ? -1 : 0; ind = t & 4; a -= dist4 & t; t = (a >= dist2) ? -1 : 0; ind += t & 2; a -= dist2 & t; ind += (a >= dist); // turn linear scale into DXT index (0/1 are extremal pts) ind = -ind & 7; ind ^= (2 > ind); // write index mask |= ind << bits; if((bits += 3) >= 8) { *dest++ = mask; mask >>= 8; bits -= 8; } } } static void stb__InitDXT() { int i; for(i=0;i<32;i++) stb__Expand5[i] = (i<<3)|(i>>2); for(i=0;i<64;i++) stb__Expand6[i] = (i<<2)|(i>>4); for(i=0;i<256+16;i++) { int v = i-8 < 0 ? 0 : i-8 > 255 ? 255 : i-8; stb__QuantRBTab[i] = stb__Expand5[stb__Mul8Bit(v,31)]; stb__QuantGTab[i] = stb__Expand6[stb__Mul8Bit(v,63)]; } stb__PrepareOptTable(&stb__OMatch5[0][0],stb__Expand5,32); stb__PrepareOptTable(&stb__OMatch6[0][0],stb__Expand6,64); } void stb_compress_dxt_block(unsigned char *dest, const unsigned char *src, int alpha, int mode) { static int init=1; if (init) { stb__InitDXT(); init=0; } if (alpha) { stb__CompressAlphaBlock(dest,(unsigned char*) src+3, 4); dest += 8; } stb__CompressColorBlock(dest,(unsigned char*) src,mode); } void stb_compress_bc4_block(unsigned char *dest, const unsigned char *src) { stb__CompressAlphaBlock(dest,(unsigned char*) src, 1); } void stb_compress_bc5_block(unsigned char *dest, const unsigned char *src) { stb__CompressAlphaBlock(dest,(unsigned char*) src,2); stb__CompressAlphaBlock(dest + 8,(unsigned char*) src+1,2); } #endif // STB_DXT_IMPLEMENTATION #endif // STB_INCLUDE_STB_DXT_H /* ------------------------------------------------------------------------------ This software is available under 2 licenses -- choose whichever you prefer. ------------------------------------------------------------------------------ ALTERNATIVE A - MIT License Copyright (c) 2017 Sean Barrett 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. ------------------------------------------------------------------------------ ALTERNATIVE B - Public Domain (www.unlicense.org) This is free and unencumbered software released into the public domain. Anyone is free to copy, modify, publish, use, compile, sell, or distribute this software, either in source code form or as a compiled binary, for any purpose, commercial or non-commercial, and by any means. In jurisdictions that recognize copyright laws, the author or authors of this software dedicate any and all copyright interest in the software to the public domain. We make this dedication for the benefit of the public at large and to the detriment of our heirs and successors. We intend this dedication to be an overt act of relinquishment in perpetuity of all present and future rights to this software under copyright law. 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 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. ------------------------------------------------------------------------------ */ uTox/third_party/stb/stb/stb_divide.h0000600000175000001440000003336714003056224016707 0ustar rakusers// stb_divide.h - v0.91 - public domain - Sean Barrett, Feb 2010 // Three kinds of divide/modulus of signed integers. // // HISTORY // // v0.91 2010-02-27 Fix euclidean division by INT_MIN for non-truncating C // Check result with 64-bit math to catch such cases // v0.90 2010-02-24 First public release // // USAGE // // In *ONE* source file, put: // // #define STB_DIVIDE_IMPLEMENTATION // // #define C_INTEGER_DIVISION_TRUNCATES // see Note 1 // // #define C_INTEGER_DIVISION_FLOORS // see Note 2 // #include "stb_divide.h" // // Other source files should just include stb_divide.h // // Note 1: On platforms/compilers that you know signed C division // truncates, you can #define C_INTEGER_DIVISION_TRUNCATES. // // Note 2: On platforms/compilers that you know signed C division // floors (rounds to negative infinity), you can #define // C_INTEGER_DIVISION_FLOORS. // // You can #define STB_DIVIDE_TEST in which case the implementation // will generate a main() and compiling the result will create a // program that tests the implementation. Run it with no arguments // and any output indicates an error; run it with any argument and // it will also print the test results. Define STB_DIVIDE_TEST_64 // to a 64-bit integer type to avoid overflows in the result-checking // which give false negatives. // // ABOUT // // This file provides three different consistent divide/mod pairs // implemented on top of arbitrary C/C++ division, including correct // handling of overflow of intermediate calculations: // // trunc: a/b truncates to 0, a%b has same sign as a // floor: a/b truncates to -inf, a%b has same sign as b // eucl: a/b truncates to sign(b)*inf, a%b is non-negative // // Not necessarily optimal; I tried to keep it generally efficient, // but there may be better ways. // // Briefly, for those who are not familiar with the problem, we note // the reason these divides exist and are interesting: // // 'trunc' is easy to implement in hardware (strip the signs, // compute, reapply the signs), thus is commonly defined // by many languages (including C99) // // 'floor' is simple to define and better behaved than trunc; // for example it divides integers into fixed-size buckets // without an extra-wide bucket at 0, and for a fixed // divisor N there are only |N| possible moduli. // // 'eucl' guarantees fixed-sized buckets *and* a non-negative // modulus and defines division to be whatever is needed // to achieve that result. // // See "The Euclidean definition of the functions div and mod" // by Raymond Boute (1992), or "Division and Modulus for Computer // Scientists" by Daan Leijen (2001) // // We assume of the built-in C division: // (a) modulus is the remainder for the corresponding division // (b) a/b truncates if a and b are the same sign // // Property (a) requires (a/b)*b + (a%b)==a, and is required by C. // Property (b) seems to be true of all hardware but is *not* satisfied // by the euclidean division operator we define, so it's possibly not // always true. If any such platform turns up, we can add more cases. // (Possibly only stb_div_trunc currently relies on property (b).) // // LICENSE // // See end of file for license information. #ifndef INCLUDE_STB_DIVIDE_H #define INCLUDE_STB_DIVIDE_H #ifdef __cplusplus extern "C" { #endif extern int stb_div_trunc(int value_to_be_divided, int value_to_divide_by); extern int stb_div_floor(int value_to_be_divided, int value_to_divide_by); extern int stb_div_eucl (int value_to_be_divided, int value_to_divide_by); extern int stb_mod_trunc(int value_to_be_divided, int value_to_divide_by); extern int stb_mod_floor(int value_to_be_divided, int value_to_divide_by); extern int stb_mod_eucl (int value_to_be_divided, int value_to_divide_by); #ifdef __cplusplus } #endif #ifdef STB_DIVIDE_IMPLEMENTATION #if defined(__STDC_VERSION) && __STDC_VERSION__ >= 19901 #ifndef C_INTEGER_DIVISION_TRUNCATES #define C_INTEGER_DIVISION_TRUNCATES #endif #endif #ifndef INT_MIN #include // if you have no limits.h, #define INT_MIN yourself #endif // the following macros are designed to allow testing // other platforms by simulating them #ifndef STB_DIVIDE_TEST_FLOOR #define stb__div(a,b) ((a)/(b)) #define stb__mod(a,b) ((a)%(b)) #else // implement floor-style divide on trunc platform #ifndef C_INTEGER_DIVISION_TRUNCATES #error "floor test requires truncating division" #endif #undef C_INTEGER_DIVISION_TRUNCATES int stb__div(int v1, int v2) { int q = v1/v2, r = v1%v2; if ((r > 0 && v2 < 0) || (r < 0 && v2 > 0)) return q-1; else return q; } int stb__mod(int v1, int v2) { int r = v1%v2; if ((r > 0 && v2 < 0) || (r < 0 && v2 > 0)) return r+v2; else return r; } #endif int stb_div_trunc(int v1, int v2) { #ifdef C_INTEGER_DIVISION_TRUNCATES return v1/v2; #else if (v1 >= 0 && v2 <= 0) return -stb__div(-v1,v2); // both negative to avoid overflow if (v1 <= 0 && v2 >= 0) if (v1 != INT_MIN) return -stb__div(v1,-v2); // both negative to avoid overflow else return -stb__div(v1+v2,-v2)-1; // push v1 away from wrap point else return v1/v2; // same sign, so expect truncation #endif } int stb_div_floor(int v1, int v2) { #ifdef C_INTEGER_DIVISION_FLOORS return v1/v2; #else if (v1 >= 0 && v2 < 0) if ((-v1)+v2+1 < 0) // check if increasing v1's magnitude overflows return -stb__div(-v1+v2+1,v2); // nope, so just compute it else return -stb__div(-v1,v2) + ((-v1)%v2 ? -1 : 0); if (v1 < 0 && v2 >= 0) if (v1 != INT_MIN) if (v1-v2+1 < 0) // check if increasing v1's magnitude overflows return -stb__div(v1-v2+1,-v2); // nope, so just compute it else return -stb__div(-v1,v2) + (stb__mod(v1,-v2) ? -1 : 0); else // it must be possible to compute -(v1+v2) without overflowing return -stb__div(-(v1+v2),v2) + (stb__mod(-(v1+v2),v2) ? -2 : -1); else return v1/v2; // same sign, so expect truncation #endif } int stb_div_eucl(int v1, int v2) { int q,r; #ifdef C_INTEGER_DIVISION_TRUNCATES q = v1/v2; r = v1%v2; #else // handle every quadrant separately, since we can't rely on q and r flor if (v1 >= 0) if (v2 >= 0) return stb__div(v1,v2); else if (v2 != INT_MIN) q = -stb__div(v1,-v2), r = stb__mod(v1,-v2); else q = 0, r = v1; else if (v1 != INT_MIN) if (v2 >= 0) q = -stb__div(-v1,v2), r = -stb__mod(-v1,v2); else if (v2 != INT_MIN) q = stb__div(-v1,-v2), r = -stb__mod(-v1,-v2); else // if v2 is INT_MIN, then we can't use -v2, but we can't divide by v2 q = 1, r = v1-q*v2; else // if v1 is INT_MIN, we have to move away from overflow place if (v2 >= 0) q = -stb__div(-(v1+v2),v2)-1, r = -stb__mod(-(v1+v2),v2); else q = stb__div(-(v1-v2),-v2)+1, r = -stb__mod(-(v1-v2),-v2); #endif if (r >= 0) return q; else return q + (v2 > 0 ? -1 : 1); } int stb_mod_trunc(int v1, int v2) { #ifdef C_INTEGER_DIVISION_TRUNCATES return v1%v2; #else if (v1 >= 0) { // modulus result should always be positive int r = stb__mod(v1,v2); if (r >= 0) return r; else return r + (v2 > 0 ? v2 : -v2); } else { // modulus result should always be negative int r = stb__mod(v1,v2); if (r <= 0) return r; else return r - (v2 > 0 ? v2 : -v2); } #endif } int stb_mod_floor(int v1, int v2) { #ifdef C_INTEGER_DIVISION_FLOORS return v1%v2; #else if (v2 >= 0) { // result should always be positive int r = stb__mod(v1,v2); if (r >= 0) return r; else return r + v2; } else { // result should always be negative int r = stb__mod(v1,v2); if (r <= 0) return r; else return r + v2; } #endif } int stb_mod_eucl(int v1, int v2) { int r = stb__mod(v1,v2); if (r >= 0) return r; else return r + (v2 > 0 ? v2 : -v2); // abs() } #ifdef STB_DIVIDE_TEST #include #include #include int show=0; void stbdiv_check(int q, int r, int a, int b, char *type, int dir) { if ((dir > 0 && r < 0) || (dir < 0 && r > 0)) fprintf(stderr, "FAILED: %s(%d,%d) remainder %d in wrong direction\n", type,a,b,r); else if (b != INT_MIN) // can't compute abs(), but if b==INT_MIN all remainders are valid if (r <= -abs(b) || r >= abs(b)) fprintf(stderr, "FAILED: %s(%d,%d) remainder %d out of range\n", type,a,b,r); #ifdef STB_DIVIDE_TEST_64 { STB_DIVIDE_TEST_64 q64 = q, r64=r, a64=a, b64=b; if (q64*b64+r64 != a64) fprintf(stderr, "FAILED: %s(%d,%d) remainder %d doesn't match quotient %d\n", type,a,b,r,q); } #else if (q*b+r != a) fprintf(stderr, "FAILED: %s(%d,%d) remainder %d doesn't match quotient %d\n", type,a,b,r,q); #endif } void test(int a, int b) { int q,r; if (show) printf("(%+11d,%+d) | ", a,b); q = stb_div_trunc(a,b), r = stb_mod_trunc(a,b); if (show) printf("(%+11d,%+2d) ", q,r); stbdiv_check(q,r,a,b, "trunc",a); q = stb_div_floor(a,b), r = stb_mod_floor(a,b); if (show) printf("(%+11d,%+2d) ", q,r); stbdiv_check(q,r,a,b, "floor",b); q = stb_div_eucl (a,b), r = stb_mod_eucl (a,b); if (show) printf("(%+11d,%+2d)\n", q,r); stbdiv_check(q,r,a,b, "euclidean",1); } void testh(int a, int b) { int q,r; if (show) printf("(%08x,%08x) |\n", a,b); q = stb_div_trunc(a,b), r = stb_mod_trunc(a,b); stbdiv_check(q,r,a,b, "trunc",a); if (show) printf(" (%08x,%08x)", q,r); q = stb_div_floor(a,b), r = stb_mod_floor(a,b); stbdiv_check(q,r,a,b, "floor",b); if (show) printf(" (%08x,%08x)", q,r); q = stb_div_eucl (a,b), r = stb_mod_eucl (a,b); stbdiv_check(q,r,a,b, "euclidean",1); if (show) printf(" (%08x,%08x)\n ", q,r); } int main(int argc, char **argv) { if (argc > 1) show=1; test(8,3); test(8,-3); test(-8,3); test(-8,-3); test(1,2); test(1,-2); test(-1,2); test(-1,-2); test(8,4); test(8,-4); test(-8,4); test(-8,-4); test(INT_MAX,1); test(INT_MIN,1); test(INT_MIN+1,1); test(INT_MAX,-1); //test(INT_MIN,-1); // this traps in MSVC, so we leave it untested test(INT_MIN+1,-1); test(INT_MIN,-2); test(INT_MIN+1,2); test(INT_MIN+1,-2); test(INT_MAX,2); test(INT_MAX,-2); test(INT_MIN+1,2); test(INT_MIN+1,-2); test(INT_MIN,2); test(INT_MIN,-2); test(INT_MIN,7); test(INT_MIN,-7); test(INT_MIN+1,4); test(INT_MIN+1,-4); testh(-7, INT_MIN); testh(-1, INT_MIN); testh(1, INT_MIN); testh(7, INT_MIN); testh(INT_MAX-1, INT_MIN); testh(INT_MAX, INT_MIN); testh(INT_MIN, INT_MIN); testh(INT_MIN+1, INT_MIN); testh(INT_MAX-1, INT_MAX); testh(INT_MAX , INT_MAX); testh(INT_MIN , INT_MAX); testh(INT_MIN+1, INT_MAX); return 0; } #endif // STB_DIVIDE_TEST #endif // STB_DIVIDE_IMPLEMENTATION #endif // INCLUDE_STB_DIVIDE_H /* ------------------------------------------------------------------------------ This software is available under 2 licenses -- choose whichever you prefer. ------------------------------------------------------------------------------ ALTERNATIVE A - MIT License Copyright (c) 2017 Sean Barrett 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. ------------------------------------------------------------------------------ ALTERNATIVE B - Public Domain (www.unlicense.org) This is free and unencumbered software released into the public domain. Anyone is free to copy, modify, publish, use, compile, sell, or distribute this software, either in source code form or as a compiled binary, for any purpose, commercial or non-commercial, and by any means. In jurisdictions that recognize copyright laws, the author or authors of this software dedicate any and all copyright interest in the software to the public domain. We make this dedication for the benefit of the public at large and to the detriment of our heirs and successors. We intend this dedication to be an overt act of relinquishment in perpetuity of all present and future rights to this software under copyright law. 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 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. ------------------------------------------------------------------------------ */ uTox/third_party/stb/stb/stb_connected_components.h0000600000175000001440000011057614003056224021650 0ustar rakusers// stb_connected_components - v0.95 - public domain connected components on grids // http://github.com/nothings/stb // // Finds connected components on 2D grids for testing reachability between // two points, with fast updates when changing reachability (e.g. on one machine // it was typically 0.2ms w/ 1024x1024 grid). Each grid square must be "open" or // "closed" (traversable or untraversable), and grid squares are only connected // to their orthogonal neighbors, not diagonally. // // In one source file, create the implementation by doing something like this: // // #define STBCC_GRID_COUNT_X_LOG2 10 // #define STBCC_GRID_COUNT_Y_LOG2 10 // #define STB_CONNECTED_COMPONENTS_IMPLEMENTATION // #include "stb_connected_components.h" // // The above creates an implementation that can run on maps up to 1024x1024. // Map sizes must be a multiple of (1<<(LOG2/2)) on each axis (e.g. 32 if LOG2=10, // 16 if LOG2=8, etc.) (You can just pad your map with untraversable space.) // // MEMORY USAGE // // Uses about 6-7 bytes per grid square (e.g. 7MB for a 1024x1024 grid). // Uses a single worst-case allocation which you pass in. // // PERFORMANCE // // On a core i7-2700K at 3.5 Ghz, for a particular 1024x1024 map (map_03.png): // // Creating map : 44.85 ms // Making one square traversable: 0.27 ms (average over 29,448 calls) // Making one square untraversable: 0.23 ms (average over 30,123 calls) // Reachability query: 0.00001 ms (average over 4,000,000 calls) // // On non-degenerate maps update time is O(N^0.5), but on degenerate maps like // checkerboards or 50% random, update time is O(N^0.75) (~2ms on above machine). // // CHANGELOG // // 0.95 (2016-10-16) Bugfix if multiple clumps in one cluster connect to same clump in another // 0.94 (2016-04-17) Bugfix & optimize worst case (checkerboard & random) // 0.93 (2016-04-16) Reduce memory by 10x for 1Kx1K map; small speedup // 0.92 (2016-04-16) Compute sqrt(N) cluster size by default // 0.91 (2016-04-15) Initial release // // TODO: // - better API documentation // - more comments // - try re-integrating naive algorithm & compare performance // - more optimized batching (current approach still recomputes local clumps many times) // - function for setting a grid of squares at once (just use batching) // // LICENSE // // See end of file for license information. // // ALGORITHM // // The NxN grid map is split into sqrt(N) x sqrt(N) blocks called // "clusters". Each cluster independently computes a set of connected // components within that cluster (ignoring all connectivity out of // that cluster) using a union-find disjoint set forest. This produces a bunch // of locally connected components called "clumps". Each clump is (a) connected // within its cluster, (b) does not directly connect to any other clumps in the // cluster (though it may connect to them by paths that lead outside the cluster, // but those are ignored at this step), and (c) maintains an adjacency list of // all clumps in adjacent clusters that it _is_ connected to. Then a second // union-find disjoint set forest is used to compute connected clumps // globally, across the whole map. Reachability is then computed by // finding which clump each input point belongs to, and checking whether // those clumps are in the same "global" connected component. // // The above data structure can be updated efficiently; on a change // of a single grid square on the map, only one cluster changes its // purely-local state, so only one cluster needs its clumps fully // recomputed. Clumps in adjacent clusters need their adjacency lists // updated: first to remove all references to the old clumps in the // rebuilt cluster, then to add new references to the new clumps. Both // of these operations can use the existing "find which clump each input // point belongs to" query to compute that adjacency information rapidly. #ifndef INCLUDE_STB_CONNECTED_COMPONENTS_H #define INCLUDE_STB_CONNECTED_COMPONENTS_H #include typedef struct st_stbcc_grid stbcc_grid; #ifdef __cplusplus extern "C" { #endif ////////////////////////////////////////////////////////////////////////////////////////// // // initialization // // you allocate the grid data structure to this size (note that it will be very big!!!) extern size_t stbcc_grid_sizeof(void); // initialize the grid, value of map[] is 0 = traversable, non-0 is solid extern void stbcc_init_grid(stbcc_grid *g, unsigned char *map, int w, int h); ////////////////////////////////////////////////////////////////////////////////////////// // // main functionality // // update a grid square state, 0 = traversable, non-0 is solid // i can add a batch-update if it's needed extern void stbcc_update_grid(stbcc_grid *g, int x, int y, int solid); // query if two grid squares are reachable from each other extern int stbcc_query_grid_node_connection(stbcc_grid *g, int x1, int y1, int x2, int y2); ////////////////////////////////////////////////////////////////////////////////////////// // // bonus functions // // wrap multiple stbcc_update_grid calls in these function to compute // multiple updates more efficiently; cannot make queries inside batch extern void stbcc_update_batch_begin(stbcc_grid *g); extern void stbcc_update_batch_end(stbcc_grid *g); // query the grid data structure for whether a given square is open or not extern int stbcc_query_grid_open(stbcc_grid *g, int x, int y); // get a unique id for the connected component this is in; it's not necessarily // small, you'll need a hash table or something to remap it (or just use extern unsigned int stbcc_get_unique_id(stbcc_grid *g, int x, int y); #define STBCC_NULL_UNIQUE_ID 0xffffffff // returned for closed map squares #ifdef __cplusplus } #endif #endif // INCLUDE_STB_CONNECTED_COMPONENTS_H #ifdef STB_CONNECTED_COMPONENTS_IMPLEMENTATION #include #include // memset #if !defined(STBCC_GRID_COUNT_X_LOG2) || !defined(STBCC_GRID_COUNT_Y_LOG2) #error "You must define STBCC_GRID_COUNT_X_LOG2 and STBCC_GRID_COUNT_Y_LOG2 to define the max grid supported." #endif #define STBCC__GRID_COUNT_X (1 << STBCC_GRID_COUNT_X_LOG2) #define STBCC__GRID_COUNT_Y (1 << STBCC_GRID_COUNT_Y_LOG2) #define STBCC__MAP_STRIDE (1 << (STBCC_GRID_COUNT_X_LOG2-3)) #ifndef STBCC_CLUSTER_SIZE_X_LOG2 #define STBCC_CLUSTER_SIZE_X_LOG2 (STBCC_GRID_COUNT_X_LOG2/2) // log2(sqrt(2^N)) = 1/2 * log2(2^N)) = 1/2 * N #if STBCC_CLUSTER_SIZE_X_LOG2 > 6 #undef STBCC_CLUSTER_SIZE_X_LOG2 #define STBCC_CLUSTER_SIZE_X_LOG2 6 #endif #endif #ifndef STBCC_CLUSTER_SIZE_Y_LOG2 #define STBCC_CLUSTER_SIZE_Y_LOG2 (STBCC_GRID_COUNT_Y_LOG2/2) #if STBCC_CLUSTER_SIZE_Y_LOG2 > 6 #undef STBCC_CLUSTER_SIZE_Y_LOG2 #define STBCC_CLUSTER_SIZE_Y_LOG2 6 #endif #endif #define STBCC__CLUSTER_SIZE_X (1 << STBCC_CLUSTER_SIZE_X_LOG2) #define STBCC__CLUSTER_SIZE_Y (1 << STBCC_CLUSTER_SIZE_Y_LOG2) #define STBCC__CLUSTER_COUNT_X_LOG2 (STBCC_GRID_COUNT_X_LOG2 - STBCC_CLUSTER_SIZE_X_LOG2) #define STBCC__CLUSTER_COUNT_Y_LOG2 (STBCC_GRID_COUNT_Y_LOG2 - STBCC_CLUSTER_SIZE_Y_LOG2) #define STBCC__CLUSTER_COUNT_X (1 << STBCC__CLUSTER_COUNT_X_LOG2) #define STBCC__CLUSTER_COUNT_Y (1 << STBCC__CLUSTER_COUNT_Y_LOG2) #if STBCC__CLUSTER_SIZE_X >= STBCC__GRID_COUNT_X || STBCC__CLUSTER_SIZE_Y >= STBCC__GRID_COUNT_Y #error "STBCC_CLUSTER_SIZE_X/Y_LOG2 must be smaller than STBCC_GRID_COUNT_X/Y_LOG2" #endif // worst case # of clumps per cluster #define STBCC__MAX_CLUMPS_PER_CLUSTER_LOG2 (STBCC_CLUSTER_SIZE_X_LOG2 + STBCC_CLUSTER_SIZE_Y_LOG2-1) #define STBCC__MAX_CLUMPS_PER_CLUSTER (1 << STBCC__MAX_CLUMPS_PER_CLUSTER_LOG2) #define STBCC__MAX_CLUMPS (STBCC__MAX_CLUMPS_PER_CLUSTER * STBCC__CLUSTER_COUNT_X * STBCC__CLUSTER_COUNT_Y) #define STBCC__NULL_CLUMPID STBCC__MAX_CLUMPS_PER_CLUSTER #define STBCC__CLUSTER_X_FOR_COORD_X(x) ((x) >> STBCC_CLUSTER_SIZE_X_LOG2) #define STBCC__CLUSTER_Y_FOR_COORD_Y(y) ((y) >> STBCC_CLUSTER_SIZE_Y_LOG2) #define STBCC__MAP_BYTE_MASK(x,y) (1 << ((x) & 7)) #define STBCC__MAP_BYTE(g,x,y) ((g)->map[y][(x) >> 3]) #define STBCC__MAP_OPEN(g,x,y) (STBCC__MAP_BYTE(g,x,y) & STBCC__MAP_BYTE_MASK(x,y)) typedef unsigned short stbcc__clumpid; typedef unsigned char stbcc__verify_max_clumps[STBCC__MAX_CLUMPS_PER_CLUSTER < (1 << (8*sizeof(stbcc__clumpid))) ? 1 : -1]; #define STBCC__MAX_EXITS_PER_CLUSTER (STBCC__CLUSTER_SIZE_X + STBCC__CLUSTER_SIZE_Y) // 64 for 32x32 #define STBCC__MAX_EXITS_PER_CLUMP (STBCC__CLUSTER_SIZE_X + STBCC__CLUSTER_SIZE_Y) // 64 for 32x32 #define STBCC__MAX_EDGE_CLUMPS_PER_CLUSTER (STBCC__MAX_EXITS_PER_CLUMP) // 2^19 * 2^6 => 2^25 exits => 2^26 => 64MB for 1024x1024 // Logic for above on 4x4 grid: // // Many clumps: One clump: // + + + + // +X.X. +XX.X+ // .X.X+ .XXX // +X.X. XXX. // .X.X+ +X.XX+ // + + + + // // 8 exits either way typedef unsigned char stbcc__verify_max_exits[STBCC__MAX_EXITS_PER_CLUMP <= 256]; typedef struct { unsigned short clump_index:12; signed short cluster_dx:2; signed short cluster_dy:2; } stbcc__relative_clumpid; typedef union { struct { unsigned int clump_index:12; unsigned int cluster_x:10; unsigned int cluster_y:10; } f; unsigned int c; } stbcc__global_clumpid; // rebuilt cluster 3,4 // what changes in cluster 2,4 typedef struct { stbcc__global_clumpid global_label; // 4 unsigned char num_adjacent; // 1 unsigned char max_adjacent; // 1 unsigned char adjacent_clump_list_index; // 1 unsigned char reserved; } stbcc__clump; // 8 #define STBCC__CLUSTER_ADJACENCY_COUNT (STBCC__MAX_EXITS_PER_CLUSTER*2) typedef struct { short num_clumps; unsigned char num_edge_clumps; unsigned char rebuild_adjacency; stbcc__clump clump[STBCC__MAX_CLUMPS_PER_CLUSTER]; // 8 * 2^9 = 4KB stbcc__relative_clumpid adjacency_storage[STBCC__CLUSTER_ADJACENCY_COUNT]; // 256 bytes } stbcc__cluster; struct st_stbcc_grid { int w,h,cw,ch; int in_batched_update; //unsigned char cluster_dirty[STBCC__CLUSTER_COUNT_Y][STBCC__CLUSTER_COUNT_X]; // could bitpack, but: 1K x 1K => 1KB unsigned char map[STBCC__GRID_COUNT_Y][STBCC__MAP_STRIDE]; // 1K x 1K => 1K x 128 => 128KB stbcc__clumpid clump_for_node[STBCC__GRID_COUNT_Y][STBCC__GRID_COUNT_X]; // 1K x 1K x 2 = 2MB stbcc__cluster cluster[STBCC__CLUSTER_COUNT_Y][STBCC__CLUSTER_COUNT_X]; // 1K x 4.5KB = 4.5MB }; int stbcc_query_grid_node_connection(stbcc_grid *g, int x1, int y1, int x2, int y2) { stbcc__global_clumpid label1, label2; stbcc__clumpid c1 = g->clump_for_node[y1][x1]; stbcc__clumpid c2 = g->clump_for_node[y2][x2]; int cx1 = STBCC__CLUSTER_X_FOR_COORD_X(x1); int cy1 = STBCC__CLUSTER_Y_FOR_COORD_Y(y1); int cx2 = STBCC__CLUSTER_X_FOR_COORD_X(x2); int cy2 = STBCC__CLUSTER_Y_FOR_COORD_Y(y2); assert(!g->in_batched_update); if (c1 == STBCC__NULL_CLUMPID || c2 == STBCC__NULL_CLUMPID) return 0; label1 = g->cluster[cy1][cx1].clump[c1].global_label; label2 = g->cluster[cy2][cx2].clump[c2].global_label; if (label1.c == label2.c) return 1; return 0; } int stbcc_query_grid_open(stbcc_grid *g, int x, int y) { return STBCC__MAP_OPEN(g, x, y) != 0; } unsigned int stbcc_get_unique_id(stbcc_grid *g, int x, int y) { stbcc__clumpid c = g->clump_for_node[y][x]; int cx = STBCC__CLUSTER_X_FOR_COORD_X(x); int cy = STBCC__CLUSTER_Y_FOR_COORD_Y(y); assert(!g->in_batched_update); if (c == STBCC__NULL_CLUMPID) return STBCC_NULL_UNIQUE_ID; return g->cluster[cy][cx].clump[c].global_label.c; } typedef struct { unsigned char x,y; } stbcc__tinypoint; typedef struct { stbcc__tinypoint parent[STBCC__CLUSTER_SIZE_Y][STBCC__CLUSTER_SIZE_X]; // 32x32 => 2KB stbcc__clumpid label[STBCC__CLUSTER_SIZE_Y][STBCC__CLUSTER_SIZE_X]; } stbcc__cluster_build_info; static void stbcc__build_clumps_for_cluster(stbcc_grid *g, int cx, int cy); static void stbcc__remove_connections_to_adjacent_cluster(stbcc_grid *g, int cx, int cy, int dx, int dy); static void stbcc__add_connections_to_adjacent_cluster(stbcc_grid *g, int cx, int cy, int dx, int dy); static stbcc__global_clumpid stbcc__clump_find(stbcc_grid *g, stbcc__global_clumpid n) { stbcc__global_clumpid q; stbcc__clump *c = &g->cluster[n.f.cluster_y][n.f.cluster_x].clump[n.f.clump_index]; if (c->global_label.c == n.c) return n; q = stbcc__clump_find(g, c->global_label); c->global_label = q; return q; } typedef struct { unsigned int cluster_x; unsigned int cluster_y; unsigned int clump_index; } stbcc__unpacked_clumpid; static void stbcc__clump_union(stbcc_grid *g, stbcc__unpacked_clumpid m, int x, int y, int idx) { stbcc__clump *mc = &g->cluster[m.cluster_y][m.cluster_x].clump[m.clump_index]; stbcc__clump *nc = &g->cluster[y][x].clump[idx]; stbcc__global_clumpid mp = stbcc__clump_find(g, mc->global_label); stbcc__global_clumpid np = stbcc__clump_find(g, nc->global_label); if (mp.c == np.c) return; g->cluster[mp.f.cluster_y][mp.f.cluster_x].clump[mp.f.clump_index].global_label = np; } static void stbcc__build_connected_components_for_clumps(stbcc_grid *g) { int i,j,k,h; for (j=0; j < STBCC__CLUSTER_COUNT_Y; ++j) { for (i=0; i < STBCC__CLUSTER_COUNT_X; ++i) { stbcc__cluster *cluster = &g->cluster[j][i]; for (k=0; k < (int) cluster->num_edge_clumps; ++k) { stbcc__global_clumpid m; m.f.clump_index = k; m.f.cluster_x = i; m.f.cluster_y = j; assert((int) m.f.clump_index == k && (int) m.f.cluster_x == i && (int) m.f.cluster_y == j); cluster->clump[k].global_label = m; } } } for (j=0; j < STBCC__CLUSTER_COUNT_Y; ++j) { for (i=0; i < STBCC__CLUSTER_COUNT_X; ++i) { stbcc__cluster *cluster = &g->cluster[j][i]; for (k=0; k < (int) cluster->num_edge_clumps; ++k) { stbcc__clump *clump = &cluster->clump[k]; stbcc__unpacked_clumpid m; stbcc__relative_clumpid *adj; m.clump_index = k; m.cluster_x = i; m.cluster_y = j; adj = &cluster->adjacency_storage[clump->adjacent_clump_list_index]; for (h=0; h < clump->num_adjacent; ++h) { unsigned int clump_index = adj[h].clump_index; unsigned int x = adj[h].cluster_dx + i; unsigned int y = adj[h].cluster_dy + j; stbcc__clump_union(g, m, x, y, clump_index); } } } } for (j=0; j < STBCC__CLUSTER_COUNT_Y; ++j) { for (i=0; i < STBCC__CLUSTER_COUNT_X; ++i) { stbcc__cluster *cluster = &g->cluster[j][i]; for (k=0; k < (int) cluster->num_edge_clumps; ++k) { stbcc__global_clumpid m; m.f.clump_index = k; m.f.cluster_x = i; m.f.cluster_y = j; stbcc__clump_find(g, m); } } } } static void stbcc__build_all_connections_for_cluster(stbcc_grid *g, int cx, int cy) { // in this particular case, we are fully non-incremental. that means we // can discover the correct sizes for the arrays, but requires we build // the data into temporary data structures, or just count the sizes, so // for simplicity we do the latter stbcc__cluster *cluster = &g->cluster[cy][cx]; unsigned char connected[STBCC__MAX_EDGE_CLUMPS_PER_CLUSTER][STBCC__MAX_EDGE_CLUMPS_PER_CLUSTER/8]; // 64 x 8 => 1KB unsigned char num_adj[STBCC__MAX_CLUMPS_PER_CLUSTER] = { 0 }; int x = cx * STBCC__CLUSTER_SIZE_X; int y = cy * STBCC__CLUSTER_SIZE_Y; int step_x, step_y=0, i, j, k, n, m, dx, dy, total; int extra; g->cluster[cy][cx].rebuild_adjacency = 0; total = 0; for (m=0; m < 4; ++m) { switch (m) { case 0: dx = 1, dy = 0; step_x = 0, step_y = 1; i = STBCC__CLUSTER_SIZE_X-1; j = 0; n = STBCC__CLUSTER_SIZE_Y; break; case 1: dx = -1, dy = 0; i = 0; j = 0; step_x = 0; step_y = 1; n = STBCC__CLUSTER_SIZE_Y; break; case 2: dy = -1, dx = 0; i = 0; j = 0; step_x = 1; step_y = 0; n = STBCC__CLUSTER_SIZE_X; break; case 3: dy = 1, dx = 0; i = 0; j = STBCC__CLUSTER_SIZE_Y-1; step_x = 1; step_y = 0; n = STBCC__CLUSTER_SIZE_X; break; } if (cx+dx < 0 || cx+dx >= g->cw || cy+dy < 0 || cy+dy >= g->ch) continue; memset(connected, 0, sizeof(connected)); for (k=0; k < n; ++k) { if (STBCC__MAP_OPEN(g, x+i, y+j) && STBCC__MAP_OPEN(g, x+i+dx, y+j+dy)) { stbcc__clumpid src = g->clump_for_node[y+j][x+i]; stbcc__clumpid dest = g->clump_for_node[y+j+dy][x+i+dx]; if (0 == (connected[src][dest>>3] & (1 << (dest & 7)))) { connected[src][dest>>3] |= 1 << (dest & 7); ++num_adj[src]; ++total; } } i += step_x; j += step_y; } } assert(total <= STBCC__CLUSTER_ADJACENCY_COUNT); // decide how to apportion unused adjacency slots; only clumps that lie // on the edges of the cluster need adjacency slots, so divide them up // evenly between those clumps // we want: // extra = (STBCC__CLUSTER_ADJACENCY_COUNT - total) / cluster->num_edge_clumps; // but we efficiently approximate this without a divide, because // ignoring edge-vs-non-edge with 'num_adj[i]*2' was faster than // 'num_adj[i]+extra' with the divide if (total + (cluster->num_edge_clumps<<2) <= STBCC__CLUSTER_ADJACENCY_COUNT) extra = 4; else if (total + (cluster->num_edge_clumps<<1) <= STBCC__CLUSTER_ADJACENCY_COUNT) extra = 2; else if (total + (cluster->num_edge_clumps<<0) <= STBCC__CLUSTER_ADJACENCY_COUNT) extra = 1; else extra = 0; total = 0; for (i=0; i < (int) cluster->num_edge_clumps; ++i) { int alloc = num_adj[i]+extra; if (alloc > STBCC__MAX_EXITS_PER_CLUSTER) alloc = STBCC__MAX_EXITS_PER_CLUSTER; assert(total < 256); // must fit in byte cluster->clump[i].adjacent_clump_list_index = (unsigned char) total; cluster->clump[i].max_adjacent = alloc; cluster->clump[i].num_adjacent = 0; total += alloc; } assert(total <= STBCC__CLUSTER_ADJACENCY_COUNT); stbcc__add_connections_to_adjacent_cluster(g, cx, cy, -1, 0); stbcc__add_connections_to_adjacent_cluster(g, cx, cy, 1, 0); stbcc__add_connections_to_adjacent_cluster(g, cx, cy, 0,-1); stbcc__add_connections_to_adjacent_cluster(g, cx, cy, 0, 1); // make sure all of the above succeeded. assert(g->cluster[cy][cx].rebuild_adjacency == 0); } static void stbcc__add_connections_to_adjacent_cluster_with_rebuild(stbcc_grid *g, int cx, int cy, int dx, int dy) { if (cx >= 0 && cx < g->cw && cy >= 0 && cy < g->ch) { stbcc__add_connections_to_adjacent_cluster(g, cx, cy, dx, dy); if (g->cluster[cy][cx].rebuild_adjacency) stbcc__build_all_connections_for_cluster(g, cx, cy); } } void stbcc_update_grid(stbcc_grid *g, int x, int y, int solid) { int cx,cy; if (!solid) { if (STBCC__MAP_OPEN(g,x,y)) return; } else { if (!STBCC__MAP_OPEN(g,x,y)) return; } cx = STBCC__CLUSTER_X_FOR_COORD_X(x); cy = STBCC__CLUSTER_Y_FOR_COORD_Y(y); stbcc__remove_connections_to_adjacent_cluster(g, cx-1, cy, 1, 0); stbcc__remove_connections_to_adjacent_cluster(g, cx+1, cy, -1, 0); stbcc__remove_connections_to_adjacent_cluster(g, cx, cy-1, 0, 1); stbcc__remove_connections_to_adjacent_cluster(g, cx, cy+1, 0,-1); if (!solid) STBCC__MAP_BYTE(g,x,y) |= STBCC__MAP_BYTE_MASK(x,y); else STBCC__MAP_BYTE(g,x,y) &= ~STBCC__MAP_BYTE_MASK(x,y); stbcc__build_clumps_for_cluster(g, cx, cy); stbcc__build_all_connections_for_cluster(g, cx, cy); stbcc__add_connections_to_adjacent_cluster_with_rebuild(g, cx-1, cy, 1, 0); stbcc__add_connections_to_adjacent_cluster_with_rebuild(g, cx+1, cy, -1, 0); stbcc__add_connections_to_adjacent_cluster_with_rebuild(g, cx, cy-1, 0, 1); stbcc__add_connections_to_adjacent_cluster_with_rebuild(g, cx, cy+1, 0,-1); if (!g->in_batched_update) stbcc__build_connected_components_for_clumps(g); #if 0 else g->cluster_dirty[cy][cx] = 1; #endif } void stbcc_update_batch_begin(stbcc_grid *g) { assert(!g->in_batched_update); g->in_batched_update = 1; } void stbcc_update_batch_end(stbcc_grid *g) { assert(g->in_batched_update); g->in_batched_update = 0; stbcc__build_connected_components_for_clumps(g); // @OPTIMIZE: only do this if update was non-empty } size_t stbcc_grid_sizeof(void) { return sizeof(stbcc_grid); } void stbcc_init_grid(stbcc_grid *g, unsigned char *map, int w, int h) { int i,j,k; assert(w % STBCC__CLUSTER_SIZE_X == 0); assert(h % STBCC__CLUSTER_SIZE_Y == 0); assert(w % 8 == 0); g->w = w; g->h = h; g->cw = w >> STBCC_CLUSTER_SIZE_X_LOG2; g->ch = h >> STBCC_CLUSTER_SIZE_Y_LOG2; g->in_batched_update = 0; #if 0 for (j=0; j < STBCC__CLUSTER_COUNT_Y; ++j) for (i=0; i < STBCC__CLUSTER_COUNT_X; ++i) g->cluster_dirty[j][i] = 0; #endif for (j=0; j < h; ++j) { for (i=0; i < w; i += 8) { unsigned char c = 0; for (k=0; k < 8; ++k) if (map[j*w + (i+k)] == 0) c |= (1 << k); g->map[j][i>>3] = c; } } for (j=0; j < g->ch; ++j) for (i=0; i < g->cw; ++i) stbcc__build_clumps_for_cluster(g, i, j); for (j=0; j < g->ch; ++j) for (i=0; i < g->cw; ++i) stbcc__build_all_connections_for_cluster(g, i, j); stbcc__build_connected_components_for_clumps(g); for (j=0; j < g->h; ++j) for (i=0; i < g->w; ++i) assert(g->clump_for_node[j][i] <= STBCC__NULL_CLUMPID); } static void stbcc__add_clump_connection(stbcc_grid *g, int x1, int y1, int x2, int y2) { stbcc__cluster *cluster; stbcc__clump *clump; int cx1 = STBCC__CLUSTER_X_FOR_COORD_X(x1); int cy1 = STBCC__CLUSTER_Y_FOR_COORD_Y(y1); int cx2 = STBCC__CLUSTER_X_FOR_COORD_X(x2); int cy2 = STBCC__CLUSTER_Y_FOR_COORD_Y(y2); stbcc__clumpid c1 = g->clump_for_node[y1][x1]; stbcc__clumpid c2 = g->clump_for_node[y2][x2]; stbcc__relative_clumpid rc; assert(cx1 != cx2 || cy1 != cy2); assert(abs(cx1-cx2) + abs(cy1-cy2) == 1); // add connection to c2 in c1 rc.clump_index = c2; rc.cluster_dx = x2-x1; rc.cluster_dy = y2-y1; cluster = &g->cluster[cy1][cx1]; clump = &cluster->clump[c1]; assert(clump->num_adjacent <= clump->max_adjacent); if (clump->num_adjacent == clump->max_adjacent) g->cluster[cy1][cx1].rebuild_adjacency = 1; else { stbcc__relative_clumpid *adj = &cluster->adjacency_storage[clump->adjacent_clump_list_index]; assert(clump->num_adjacent < STBCC__MAX_EXITS_PER_CLUMP); assert(clump->adjacent_clump_list_index + clump->num_adjacent <= STBCC__CLUSTER_ADJACENCY_COUNT); adj[clump->num_adjacent++] = rc; } } static void stbcc__remove_clump_connection(stbcc_grid *g, int x1, int y1, int x2, int y2) { stbcc__cluster *cluster; stbcc__clump *clump; stbcc__relative_clumpid *adj; int i; int cx1 = STBCC__CLUSTER_X_FOR_COORD_X(x1); int cy1 = STBCC__CLUSTER_Y_FOR_COORD_Y(y1); int cx2 = STBCC__CLUSTER_X_FOR_COORD_X(x2); int cy2 = STBCC__CLUSTER_Y_FOR_COORD_Y(y2); stbcc__clumpid c1 = g->clump_for_node[y1][x1]; stbcc__clumpid c2 = g->clump_for_node[y2][x2]; stbcc__relative_clumpid rc; assert(cx1 != cx2 || cy1 != cy2); assert(abs(cx1-cx2) + abs(cy1-cy2) == 1); // add connection to c2 in c1 rc.clump_index = c2; rc.cluster_dx = x2-x1; rc.cluster_dy = y2-y1; cluster = &g->cluster[cy1][cx1]; clump = &cluster->clump[c1]; adj = &cluster->adjacency_storage[clump->adjacent_clump_list_index]; for (i=0; i < clump->num_adjacent; ++i) if (rc.clump_index == adj[i].clump_index && rc.cluster_dx == adj[i].cluster_dx && rc.cluster_dy == adj[i].cluster_dy) break; if (i < clump->num_adjacent) adj[i] = adj[--clump->num_adjacent]; else assert(0); } static void stbcc__add_connections_to_adjacent_cluster(stbcc_grid *g, int cx, int cy, int dx, int dy) { unsigned char connected[STBCC__MAX_EDGE_CLUMPS_PER_CLUSTER][STBCC__MAX_EDGE_CLUMPS_PER_CLUSTER/8] = { 0 }; int x = cx * STBCC__CLUSTER_SIZE_X; int y = cy * STBCC__CLUSTER_SIZE_Y; int step_x, step_y=0, i, j, k, n; if (cx < 0 || cx >= g->cw || cy < 0 || cy >= g->ch) return; if (cx+dx < 0 || cx+dx >= g->cw || cy+dy < 0 || cy+dy >= g->ch) return; if (g->cluster[cy][cx].rebuild_adjacency) return; assert(abs(dx) + abs(dy) == 1); if (dx == 1) { i = STBCC__CLUSTER_SIZE_X-1; j = 0; step_x = 0; step_y = 1; n = STBCC__CLUSTER_SIZE_Y; } else if (dx == -1) { i = 0; j = 0; step_x = 0; step_y = 1; n = STBCC__CLUSTER_SIZE_Y; } else if (dy == -1) { i = 0; j = 0; step_x = 1; step_y = 0; n = STBCC__CLUSTER_SIZE_X; } else if (dy == 1) { i = 0; j = STBCC__CLUSTER_SIZE_Y-1; step_x = 1; step_y = 0; n = STBCC__CLUSTER_SIZE_X; } else { assert(0); } for (k=0; k < n; ++k) { if (STBCC__MAP_OPEN(g, x+i, y+j) && STBCC__MAP_OPEN(g, x+i+dx, y+j+dy)) { stbcc__clumpid src = g->clump_for_node[y+j][x+i]; stbcc__clumpid dest = g->clump_for_node[y+j+dy][x+i+dx]; if (0 == (connected[src][dest>>3] & (1 << (dest & 7)))) { assert((dest>>3) < sizeof(connected)); connected[src][dest>>3] |= 1 << (dest & 7); stbcc__add_clump_connection(g, x+i, y+j, x+i+dx, y+j+dy); if (g->cluster[cy][cx].rebuild_adjacency) break; } } i += step_x; j += step_y; } } static void stbcc__remove_connections_to_adjacent_cluster(stbcc_grid *g, int cx, int cy, int dx, int dy) { unsigned char disconnected[STBCC__MAX_EDGE_CLUMPS_PER_CLUSTER][STBCC__MAX_EDGE_CLUMPS_PER_CLUSTER/8] = { 0 }; int x = cx * STBCC__CLUSTER_SIZE_X; int y = cy * STBCC__CLUSTER_SIZE_Y; int step_x, step_y=0, i, j, k, n; if (cx < 0 || cx >= g->cw || cy < 0 || cy >= g->ch) return; if (cx+dx < 0 || cx+dx >= g->cw || cy+dy < 0 || cy+dy >= g->ch) return; assert(abs(dx) + abs(dy) == 1); if (dx == 1) { i = STBCC__CLUSTER_SIZE_X-1; j = 0; step_x = 0; step_y = 1; n = STBCC__CLUSTER_SIZE_Y; } else if (dx == -1) { i = 0; j = 0; step_x = 0; step_y = 1; n = STBCC__CLUSTER_SIZE_Y; } else if (dy == -1) { i = 0; j = 0; step_x = 1; step_y = 0; n = STBCC__CLUSTER_SIZE_X; } else if (dy == 1) { i = 0; j = STBCC__CLUSTER_SIZE_Y-1; step_x = 1; step_y = 0; n = STBCC__CLUSTER_SIZE_X; } else { assert(0); } for (k=0; k < n; ++k) { if (STBCC__MAP_OPEN(g, x+i, y+j) && STBCC__MAP_OPEN(g, x+i+dx, y+j+dy)) { stbcc__clumpid src = g->clump_for_node[y+j][x+i]; stbcc__clumpid dest = g->clump_for_node[y+j+dy][x+i+dx]; if (0 == (disconnected[src][dest>>3] & (1 << (dest & 7)))) { disconnected[src][dest>>3] |= 1 << (dest & 7); stbcc__remove_clump_connection(g, x+i, y+j, x+i+dx, y+j+dy); } } i += step_x; j += step_y; } } static stbcc__tinypoint stbcc__incluster_find(stbcc__cluster_build_info *cbi, int x, int y) { stbcc__tinypoint p,q; p = cbi->parent[y][x]; if (p.x == x && p.y == y) return p; q = stbcc__incluster_find(cbi, p.x, p.y); cbi->parent[y][x] = q; return q; } static void stbcc__incluster_union(stbcc__cluster_build_info *cbi, int x1, int y1, int x2, int y2) { stbcc__tinypoint p = stbcc__incluster_find(cbi, x1,y1); stbcc__tinypoint q = stbcc__incluster_find(cbi, x2,y2); if (p.x == q.x && p.y == q.y) return; cbi->parent[p.y][p.x] = q; } static void stbcc__switch_root(stbcc__cluster_build_info *cbi, int x, int y, stbcc__tinypoint p) { cbi->parent[p.y][p.x].x = x; cbi->parent[p.y][p.x].y = y; cbi->parent[y][x].x = x; cbi->parent[y][x].y = y; } static void stbcc__build_clumps_for_cluster(stbcc_grid *g, int cx, int cy) { stbcc__cluster *c; stbcc__cluster_build_info cbi; int label=0; int i,j; int x = cx * STBCC__CLUSTER_SIZE_X; int y = cy * STBCC__CLUSTER_SIZE_Y; // set initial disjoint set forest state for (j=0; j < STBCC__CLUSTER_SIZE_Y; ++j) { for (i=0; i < STBCC__CLUSTER_SIZE_X; ++i) { cbi.parent[j][i].x = i; cbi.parent[j][i].y = j; } } // join all sets that are connected for (j=0; j < STBCC__CLUSTER_SIZE_Y; ++j) { // check down only if not on bottom row if (j < STBCC__CLUSTER_SIZE_Y-1) for (i=0; i < STBCC__CLUSTER_SIZE_X; ++i) if (STBCC__MAP_OPEN(g,x+i,y+j) && STBCC__MAP_OPEN(g,x+i ,y+j+1)) stbcc__incluster_union(&cbi, i,j, i,j+1); // check right for everything but rightmost column for (i=0; i < STBCC__CLUSTER_SIZE_X-1; ++i) if (STBCC__MAP_OPEN(g,x+i,y+j) && STBCC__MAP_OPEN(g,x+i+1,y+j )) stbcc__incluster_union(&cbi, i,j, i+1,j); } // label all non-empty clumps along edges so that all edge clumps are first // in list; this means in degenerate case we can skip traversing non-edge clumps. // because in the first pass we only label leaders, we swap the leader to the // edge first // first put solid labels on all the edges; these will get overwritten if they're open for (j=0; j < STBCC__CLUSTER_SIZE_Y; ++j) cbi.label[j][0] = cbi.label[j][STBCC__CLUSTER_SIZE_X-1] = STBCC__NULL_CLUMPID; for (i=0; i < STBCC__CLUSTER_SIZE_X; ++i) cbi.label[0][i] = cbi.label[STBCC__CLUSTER_SIZE_Y-1][i] = STBCC__NULL_CLUMPID; for (j=0; j < STBCC__CLUSTER_SIZE_Y; ++j) { i = 0; if (STBCC__MAP_OPEN(g, x+i, y+j)) { stbcc__tinypoint p = stbcc__incluster_find(&cbi, i,j); if (p.x == i && p.y == j) // if this is the leader, give it a label cbi.label[j][i] = label++; else if (!(p.x == 0 || p.x == STBCC__CLUSTER_SIZE_X-1 || p.y == 0 || p.y == STBCC__CLUSTER_SIZE_Y-1)) { // if leader is in interior, promote this edge node to leader and label stbcc__switch_root(&cbi, i, j, p); cbi.label[j][i] = label++; } // else if leader is on edge, do nothing (it'll get labelled when we reach it) } i = STBCC__CLUSTER_SIZE_X-1; if (STBCC__MAP_OPEN(g, x+i, y+j)) { stbcc__tinypoint p = stbcc__incluster_find(&cbi, i,j); if (p.x == i && p.y == j) cbi.label[j][i] = label++; else if (!(p.x == 0 || p.x == STBCC__CLUSTER_SIZE_X-1 || p.y == 0 || p.y == STBCC__CLUSTER_SIZE_Y-1)) { stbcc__switch_root(&cbi, i, j, p); cbi.label[j][i] = label++; } } } for (i=1; i < STBCC__CLUSTER_SIZE_Y-1; ++i) { j = 0; if (STBCC__MAP_OPEN(g, x+i, y+j)) { stbcc__tinypoint p = stbcc__incluster_find(&cbi, i,j); if (p.x == i && p.y == j) cbi.label[j][i] = label++; else if (!(p.x == 0 || p.x == STBCC__CLUSTER_SIZE_X-1 || p.y == 0 || p.y == STBCC__CLUSTER_SIZE_Y-1)) { stbcc__switch_root(&cbi, i, j, p); cbi.label[j][i] = label++; } } j = STBCC__CLUSTER_SIZE_Y-1; if (STBCC__MAP_OPEN(g, x+i, y+j)) { stbcc__tinypoint p = stbcc__incluster_find(&cbi, i,j); if (p.x == i && p.y == j) cbi.label[j][i] = label++; else if (!(p.x == 0 || p.x == STBCC__CLUSTER_SIZE_X-1 || p.y == 0 || p.y == STBCC__CLUSTER_SIZE_Y-1)) { stbcc__switch_root(&cbi, i, j, p); cbi.label[j][i] = label++; } } } c = &g->cluster[cy][cx]; c->num_edge_clumps = label; // label any internal clusters for (j=1; j < STBCC__CLUSTER_SIZE_Y-1; ++j) { for (i=1; i < STBCC__CLUSTER_SIZE_X-1; ++i) { stbcc__tinypoint p = cbi.parent[j][i]; if (p.x == i && p.y == j) if (STBCC__MAP_OPEN(g,x+i,y+j)) cbi.label[j][i] = label++; else cbi.label[j][i] = STBCC__NULL_CLUMPID; } } // label all other nodes for (j=0; j < STBCC__CLUSTER_SIZE_Y; ++j) { for (i=0; i < STBCC__CLUSTER_SIZE_X; ++i) { stbcc__tinypoint p = stbcc__incluster_find(&cbi, i,j); if (p.x != i || p.y != j) { if (STBCC__MAP_OPEN(g,x+i,y+j)) cbi.label[j][i] = cbi.label[p.y][p.x]; } if (STBCC__MAP_OPEN(g,x+i,y+j)) assert(cbi.label[j][i] != STBCC__NULL_CLUMPID); } } c->num_clumps = label; for (i=0; i < label; ++i) { c->clump[i].num_adjacent = 0; c->clump[i].max_adjacent = 0; } for (j=0; j < STBCC__CLUSTER_SIZE_Y; ++j) for (i=0; i < STBCC__CLUSTER_SIZE_X; ++i) { g->clump_for_node[y+j][x+i] = cbi.label[j][i]; // @OPTIMIZE: remove cbi.label entirely assert(g->clump_for_node[y+j][x+i] <= STBCC__NULL_CLUMPID); } // set the global label for all interior clumps since they can't have connections, // so we don't have to do this on the global pass (brings from O(N) to O(N^0.75)) for (i=(int) c->num_edge_clumps; i < (int) c->num_clumps; ++i) { stbcc__global_clumpid gc; gc.f.cluster_x = cx; gc.f.cluster_y = cy; gc.f.clump_index = i; c->clump[i].global_label = gc; } c->rebuild_adjacency = 1; // flag that it has no valid adjacency data } #endif // STB_CONNECTED_COMPONENTS_IMPLEMENTATION /* ------------------------------------------------------------------------------ This software is available under 2 licenses -- choose whichever you prefer. ------------------------------------------------------------------------------ ALTERNATIVE A - MIT License Copyright (c) 2017 Sean Barrett 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. ------------------------------------------------------------------------------ ALTERNATIVE B - Public Domain (www.unlicense.org) This is free and unencumbered software released into the public domain. Anyone is free to copy, modify, publish, use, compile, sell, or distribute this software, either in source code form or as a compiled binary, for any purpose, commercial or non-commercial, and by any means. In jurisdictions that recognize copyright laws, the author or authors of this software dedicate any and all copyright interest in the software to the public domain. We make this dedication for the benefit of the public at large and to the detriment of our heirs and successors. We intend this dedication to be an overt act of relinquishment in perpetuity of all present and future rights to this software under copyright law. 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 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. ------------------------------------------------------------------------------ */ uTox/third_party/stb/stb/stb_c_lexer.h0000600000175000001440000010532614003056224017057 0ustar rakusers// stb_c_lexer.h - v0.09 - public domain Sean Barrett 2013 // lexer for making little C-like languages with recursive-descent parsers // // This file provides both the interface and the implementation. // To instantiate the implementation, // #define STB_C_LEXER_IMPLEMENTATION // in *ONE* source file, before #including this file. // // The default configuration is fairly close to a C lexer, although // suffixes on integer constants are not handled (you can override this). // // History: // 0.09 hex floats, no-stdlib fixes // 0.08 fix bad pointer comparison // 0.07 fix mishandling of hexadecimal constants parsed by strtol // 0.06 fix missing next character after ending quote mark (Andreas Fredriksson) // 0.05 refixed get_location because github version had lost the fix // 0.04 fix octal parsing bug // 0.03 added STB_C_LEX_DISCARD_PREPROCESSOR option // refactor API to simplify (only one struct instead of two) // change literal enum names to have 'lit' at the end // 0.02 first public release // // Status: // - haven't tested compiling as C++ // - haven't tested the float parsing path // - haven't tested the non-default-config paths (e.g. non-stdlib) // - only tested default-config paths by eyeballing output of self-parse // // - haven't implemented multiline strings // - haven't implemented octal/hex character constants // - haven't implemented support for unicode CLEX_char // - need to expand error reporting so you don't just get "CLEX_parse_error" // // Contributors: // Arpad Goretity (bugfix) // Alan Hickman (hex floats) // // LICENSE // // See end of file for license information. #ifndef STB_C_LEXER_DEFINITIONS // to change the default parsing rules, copy the following lines // into your C/C++ file *before* including this, and then replace // the Y's with N's for the ones you don't want. // --BEGIN-- #define STB_C_LEX_C_DECIMAL_INTS Y // "0|[1-9][0-9]*" CLEX_intlit #define STB_C_LEX_C_HEX_INTS Y // "0x[0-9a-fA-F]+" CLEX_intlit #define STB_C_LEX_C_OCTAL_INTS Y // "[0-7]+" CLEX_intlit #define STB_C_LEX_C_DECIMAL_FLOATS Y // "[0-9]*(.[0-9]*([eE][-+]?[0-9]+)?) CLEX_floatlit #define STB_C_LEX_C99_HEX_FLOATS N // "0x{hex}+(.{hex}*)?[pP][-+]?{hex}+ CLEX_floatlit #define STB_C_LEX_C_IDENTIFIERS Y // "[_a-zA-Z][_a-zA-Z0-9]*" CLEX_id #define STB_C_LEX_C_DQ_STRINGS Y // double-quote-delimited strings with escapes CLEX_dqstring #define STB_C_LEX_C_SQ_STRINGS N // single-quote-delimited strings with escapes CLEX_ssstring #define STB_C_LEX_C_CHARS Y // single-quote-delimited character with escape CLEX_charlits #define STB_C_LEX_C_COMMENTS Y // "/* comment */" #define STB_C_LEX_CPP_COMMENTS Y // "// comment to end of line\n" #define STB_C_LEX_C_COMPARISONS Y // "==" CLEX_eq "!=" CLEX_noteq "<=" CLEX_lesseq ">=" CLEX_greatereq #define STB_C_LEX_C_LOGICAL Y // "&&" CLEX_andand "||" CLEX_oror #define STB_C_LEX_C_SHIFTS Y // "<<" CLEX_shl ">>" CLEX_shr #define STB_C_LEX_C_INCREMENTS Y // "++" CLEX_plusplus "--" CLEX_minusminus #define STB_C_LEX_C_ARROW Y // "->" CLEX_arrow #define STB_C_LEX_EQUAL_ARROW N // "=>" CLEX_eqarrow #define STB_C_LEX_C_BITWISEEQ Y // "&=" CLEX_andeq "|=" CLEX_oreq "^=" CLEX_xoreq #define STB_C_LEX_C_ARITHEQ Y // "+=" CLEX_pluseq "-=" CLEX_minuseq // "*=" CLEX_muleq "/=" CLEX_diveq "%=" CLEX_modeq // if both STB_C_LEX_SHIFTS & STB_C_LEX_ARITHEQ: // "<<=" CLEX_shleq ">>=" CLEX_shreq #define STB_C_LEX_PARSE_SUFFIXES N // letters after numbers are parsed as part of those numbers, and must be in suffix list below #define STB_C_LEX_DECIMAL_SUFFIXES "" // decimal integer suffixes e.g. "uUlL" -- these are returned as-is in string storage #define STB_C_LEX_HEX_SUFFIXES "" // e.g. "uUlL" #define STB_C_LEX_OCTAL_SUFFIXES "" // e.g. "uUlL" #define STB_C_LEX_FLOAT_SUFFIXES "" // #define STB_C_LEX_0_IS_EOF N // if Y, ends parsing at '\0'; if N, returns '\0' as token #define STB_C_LEX_INTEGERS_AS_DOUBLES N // parses integers as doubles so they can be larger than 'int', but only if STB_C_LEX_STDLIB==N #define STB_C_LEX_MULTILINE_DSTRINGS N // allow newlines in double-quoted strings #define STB_C_LEX_MULTILINE_SSTRINGS N // allow newlines in single-quoted strings #define STB_C_LEX_USE_STDLIB Y // use strtod,strtol for parsing #s; otherwise inaccurate hack #define STB_C_LEX_DOLLAR_IDENTIFIER Y // allow $ as an identifier character #define STB_C_LEX_FLOAT_NO_DECIMAL Y // allow floats that have no decimal point if they have an exponent #define STB_C_LEX_DEFINE_ALL_TOKEN_NAMES N // if Y, all CLEX_ token names are defined, even if never returned // leaving it as N should help you catch config bugs #define STB_C_LEX_DISCARD_PREPROCESSOR Y // discard C-preprocessor directives (e.g. after prepocess // still have #line, #pragma, etc) //#define STB_C_LEX_ISWHITE(str) ... // return length in bytes of whitespace characters if first char is whitespace #define STB_C_LEXER_DEFINITIONS // This line prevents the header file from replacing your definitions // --END-- #endif #ifndef INCLUDE_STB_C_LEXER_H #define INCLUDE_STB_C_LEXER_H typedef struct { // lexer variables char *input_stream; char *eof; char *parse_point; char *string_storage; int string_storage_len; // lexer parse location for error messages char *where_firstchar; char *where_lastchar; // lexer token variables long token; double real_number; long int_number; char *string; int string_len; } stb_lexer; typedef struct { int line_number; int line_offset; } stb_lex_location; #ifdef __cplusplus extern "C" { #endif extern void stb_c_lexer_init(stb_lexer *lexer, const char *input_stream, const char *input_stream_end, char *string_store, int store_length); // this function initialize the 'lexer' structure // Input: // - input_stream points to the file to parse, loaded into memory // - input_stream_end points to the end of the file, or NULL if you use 0-for-EOF // - string_store is storage the lexer can use for storing parsed strings and identifiers // - store_length is the length of that storage extern int stb_c_lexer_get_token(stb_lexer *lexer); // this function returns non-zero if a token is parsed, or 0 if at EOF // Output: // - lexer->token is the token ID, which is unicode code point for a single-char token, < 0 for a multichar or eof or error // - lexer->real_number is a double constant value for CLEX_floatlit, or CLEX_intlit if STB_C_LEX_INTEGERS_AS_DOUBLES // - lexer->int_number is an integer constant for CLEX_intlit if !STB_C_LEX_INTEGERS_AS_DOUBLES, or character for CLEX_charlit // - lexer->string is a 0-terminated string for CLEX_dqstring or CLEX_sqstring or CLEX_identifier // - lexer->string_len is the byte length of lexer->string extern void stb_c_lexer_get_location(const stb_lexer *lexer, const char *where, stb_lex_location *loc); // this inefficient function returns the line number and character offset of a // given location in the file as returned by stb_lex_token. Because it's inefficient, // you should only call it for errors, not for every token. // For error messages of invalid tokens, you typically want the location of the start // of the token (which caused the token to be invalid). For bugs involving legit // tokens, you can report the first or the range. // Output: // - loc->line_number is the line number in the file, counting from 1, of the location // - loc->line_offset is the char-offset in the line, counting from 0, of the location #ifdef __cplusplus } #endif #endif // INCLUDE_STB_C_LEXER_H #ifdef STB_C_LEXER_IMPLEMENTATION #if defined(Y) || defined(N) #error "Can only use stb_c_lexer in contexts where the preprocessor symbols 'Y' and 'N' are not defined" #endif // Hacky definitions so we can easily #if on them #define Y(x) 1 #define N(x) 0 #if STB_C_LEX_INTEGERS_AS_DOUBLES(x) typedef double stb__clex_int; #define intfield real_number #define STB__clex_int_as_double #else typedef long stb__clex_int; #define intfield int_number #endif // Convert these config options to simple conditional #defines so we can more // easily test them once we've change the meaning of Y/N #if STB_C_LEX_PARSE_SUFFIXES(x) #define STB__clex_parse_suffixes #endif #if STB_C_LEX_C_DECIMAL_INTS(x) || STB_C_LEX_C_HEX_INTS(x) || STB_C_LEX_DEFINE_ALL_TOKEN_NAMES(x) #define STB__clex_define_int #endif #if (STB_C_LEX_C_ARITHEQ(x) && STB_C_LEX_C_SHIFTS(x)) || STB_C_LEX_DEFINE_ALL_TOKEN_NAMES(x) #define STB__clex_define_shifts #endif #if STB_C_LEX_C99_HEX_FLOATS(x) #define STB__clex_hex_floats #endif #if STB_C_LEX_C_HEX_INTS(x) #define STB__clex_hex_ints #endif #if STB_C_LEX_C_DECIMAL_INTS(x) #define STB__clex_decimal_ints #endif #if STB_C_LEX_C_OCTAL_INTS(x) #define STB__clex_octal_ints #endif #if STB_C_LEX_C_DECIMAL_FLOATS(x) #define STB__clex_decimal_floats #endif #if STB_C_LEX_DISCARD_PREPROCESSOR(x) #define STB__clex_discard_preprocessor #endif #if STB_C_LEX_USE_STDLIB(x) && (!defined(STB__clex_hex_floats) || __STDC_VERSION__ >= 199901L) #define STB__CLEX_use_stdlib #include #endif // Now pick a definition of Y/N that's conducive to // defining the enum of token names. #if STB_C_LEX_DEFINE_ALL_TOKEN_NAMES(x) || defined(STB_C_LEXER_SELF_TEST) #undef N #define N(a) Y(a) #else #undef N #define N(a) #endif #undef Y #define Y(a) a, enum { CLEX_eof = 256, CLEX_parse_error, #ifdef STB__clex_define_int CLEX_intlit, #endif STB_C_LEX_C_DECIMAL_FLOATS( CLEX_floatlit ) STB_C_LEX_C_IDENTIFIERS( CLEX_id ) STB_C_LEX_C_DQ_STRINGS( CLEX_dqstring ) STB_C_LEX_C_SQ_STRINGS( CLEX_sqstring ) STB_C_LEX_C_CHARS( CLEX_charlit ) STB_C_LEX_C_COMPARISONS( CLEX_eq ) STB_C_LEX_C_COMPARISONS( CLEX_noteq ) STB_C_LEX_C_COMPARISONS( CLEX_lesseq ) STB_C_LEX_C_COMPARISONS( CLEX_greatereq ) STB_C_LEX_C_LOGICAL( CLEX_andand ) STB_C_LEX_C_LOGICAL( CLEX_oror ) STB_C_LEX_C_SHIFTS( CLEX_shl ) STB_C_LEX_C_SHIFTS( CLEX_shr ) STB_C_LEX_C_INCREMENTS( CLEX_plusplus ) STB_C_LEX_C_INCREMENTS( CLEX_minusminus ) STB_C_LEX_C_ARITHEQ( CLEX_pluseq ) STB_C_LEX_C_ARITHEQ( CLEX_minuseq ) STB_C_LEX_C_ARITHEQ( CLEX_muleq ) STB_C_LEX_C_ARITHEQ( CLEX_diveq ) STB_C_LEX_C_ARITHEQ( CLEX_modeq ) STB_C_LEX_C_BITWISEEQ( CLEX_andeq ) STB_C_LEX_C_BITWISEEQ( CLEX_oreq ) STB_C_LEX_C_BITWISEEQ( CLEX_xoreq ) STB_C_LEX_C_ARROW( CLEX_arrow ) STB_C_LEX_EQUAL_ARROW( CLEX_eqarrow ) #ifdef STB__clex_define_shifts CLEX_shleq, CLEX_shreq, #endif CLEX_first_unused_token #undef Y #define Y(a) a }; // Now for the rest of the file we'll use the basic definition where // where Y expands to its contents and N expands to nothing #undef N #define N(a) // API function void stb_c_lexer_init(stb_lexer *lexer, const char *input_stream, const char *input_stream_end, char *string_store, int store_length) { lexer->input_stream = (char *) input_stream; lexer->eof = (char *) input_stream_end; lexer->parse_point = (char *) input_stream; lexer->string_storage = string_store; lexer->string_storage_len = store_length; } // API function void stb_c_lexer_get_location(const stb_lexer *lexer, const char *where, stb_lex_location *loc) { char *p = lexer->input_stream; int line_number = 1; int char_offset = 0; while (*p && p < where) { if (*p == '\n' || *p == '\r') { p += (p[0]+p[1] == '\r'+'\n' ? 2 : 1); // skip newline line_number += 1; char_offset = 0; } else { ++p; ++char_offset; } } loc->line_number = line_number; loc->line_offset = char_offset; } // main helper function for returning a parsed token static int stb__clex_token(stb_lexer *lexer, int token, char *start, char *end) { lexer->token = token; lexer->where_firstchar = start; lexer->where_lastchar = end; lexer->parse_point = end+1; return 1; } // helper function for returning eof static int stb__clex_eof(stb_lexer *lexer) { lexer->token = CLEX_eof; return 0; } static int stb__clex_iswhite(int x) { return x == ' ' || x == '\t' || x == '\r' || x == '\n' || x == '\f'; } static const char *stb__strchr(const char *str, int ch) { for (; *str; ++str) if (*str == ch) return str; return 0; } // parse suffixes at the end of a number static int stb__clex_parse_suffixes(stb_lexer *lexer, long tokenid, char *start, char *cur, const char *suffixes) { #ifdef STB__clex_parse_suffixes lexer->string = lexer->string_storage; lexer->string_len = 0; while ((*cur >= 'a' && *cur <= 'z') || (*cur >= 'A' && *cur <= 'Z')) { if (stb__strchr(suffixes, *cur) == 0) return stb__clex_token(lexer, CLEX_parse_error, start, cur); if (lexer->string_len+1 >= lexer->string_storage_len) return stb__clex_token(lexer, CLEX_parse_error, start, cur); lexer->string[lexer->string_len++] = *cur++; } #else suffixes = suffixes; // attempt to suppress warnings #endif return stb__clex_token(lexer, tokenid, start, cur-1); } #ifndef STB__CLEX_use_stdlib static double stb__clex_pow(double base, unsigned int exponent) { double value=1; for ( ; exponent; exponent >>= 1) { if (exponent & 1) value *= base; base *= base; } return value; } static double stb__clex_parse_float(char *p, char **q) { char *s = p; double value=0; int base=10; int exponent=0; #ifdef STB__clex_hex_floats if (*p == '0') { if (p[1] == 'x' || p[1] == 'X') { base=16; p += 2; } } #endif for (;;) { if (*p >= '0' && *p <= '9') value = value*base + (*p++ - '0'); #ifdef STB__clex_hex_floats else if (base == 16 && *p >= 'a' && *p <= 'f') value = value*base + 10 + (*p++ - 'a'); else if (base == 16 && *p >= 'A' && *p <= 'F') value = value*base + 10 + (*p++ - 'A'); #endif else break; } if (*p == '.') { double pow, addend = 0; ++p; for (pow=1; ; pow*=base) { if (*p >= '0' && *p <= '9') addend = addend*base + (*p++ - '0'); #ifdef STB__clex_hex_floats else if (base == 16 && *p >= 'a' && *p <= 'f') addend = addend*base + 10 + (*p++ - 'a'); else if (base == 16 && *p >= 'A' && *p <= 'F') addend = addend*base + 10 + (*p++ - 'A'); #endif else break; } value += addend / pow; } #ifdef STB__clex_hex_floats if (base == 16) { // exponent required for hex float literal if (*p != 'p' && *p != 'P') { *q = s; return 0; } exponent = 1; } else #endif exponent = (*p == 'e' || *p == 'E'); if (exponent) { int sign = p[1] == '-'; unsigned int exponent=0; double power=1; ++p; if (*p == '-' || *p == '+') ++p; while (*p >= '0' && *p <= '9') exponent = exponent*10 + (*p++ - '0'); #ifdef STB__clex_hex_floats if (base == 16) power = stb__clex_pow(2, exponent); else #endif power = stb__clex_pow(10, exponent); if (sign) value /= power; else value *= power; } *q = p; return value; } #endif static int stb__clex_parse_char(char *p, char **q) { if (*p == '\\') { *q = p+2; // tentatively guess we'll parse two characters switch(p[1]) { case '\\': return '\\'; case '\'': return '\''; case '"': return '"'; case 't': return '\t'; case 'f': return '\f'; case 'n': return '\n'; case 'r': return '\r'; case '0': return '\0'; // @TODO ocatal constants case 'x': case 'X': return -1; // @TODO hex constants case 'u': return -1; // @TODO unicode constants } } *q = p+1; return (unsigned char) *p; } static int stb__clex_parse_string(stb_lexer *lexer, char *p, int type) { char *start = p; char delim = *p++; // grab the " or ' for later matching char *out = lexer->string_storage; char *outend = lexer->string_storage + lexer->string_storage_len; while (*p != delim) { int n; if (*p == '\\') { char *q; n = stb__clex_parse_char(p, &q); if (n < 0) return stb__clex_token(lexer, CLEX_parse_error, start, q); p = q; } else { // @OPTIMIZE: could speed this up by looping-while-not-backslash n = (unsigned char) *p++; } if (out+1 > outend) return stb__clex_token(lexer, CLEX_parse_error, start, p); // @TODO expand unicode escapes to UTF8 *out++ = (char) n; } *out = 0; lexer->string = lexer->string_storage; lexer->string_len = out - lexer->string_storage; return stb__clex_token(lexer, type, start, p); } int stb_c_lexer_get_token(stb_lexer *lexer) { char *p = lexer->parse_point; // skip whitespace and comments for (;;) { #ifdef STB_C_LEX_ISWHITE while (p != lexer->stream_end) { int n; n = STB_C_LEX_ISWHITE(p); if (n == 0) break; if (lexer->eof && lexer->eof - lexer->parse_point < n) return stb__clex_token(tok, CLEX_parse_error, p,lexer->eof-1); p += n; } #else while (p != lexer->eof && stb__clex_iswhite(*p)) ++p; #endif STB_C_LEX_CPP_COMMENTS( if (p != lexer->eof && p[0] == '/' && p[1] == '/') { while (p != lexer->eof && *p != '\r' && *p != '\n') ++p; continue; } ) STB_C_LEX_C_COMMENTS( if (p != lexer->eof && p[0] == '/' && p[1] == '*') { char *start = p; p += 2; while (p != lexer->eof && (p[0] != '*' || p[1] != '/')) ++p; if (p == lexer->eof) return stb__clex_token(lexer, CLEX_parse_error, start, p-1); p += 2; continue; } ) #ifdef STB__clex_discard_preprocessor // @TODO this discards everything after a '#', regardless // of where in the line the # is, rather than requiring it // be at the start. (because this parser doesn't otherwise // check for line breaks!) if (p != lexer->eof && p[0] == '#') { while (p != lexer->eof && *p != '\r' && *p != '\n') ++p; continue; } #endif break; } if (p == lexer->eof) return stb__clex_eof(lexer); switch (*p) { default: if ( (*p >= 'a' && *p <= 'z') || (*p >= 'A' && *p <= 'Z') || *p == '_' || (unsigned char) *p >= 128 // >= 128 is UTF8 char STB_C_LEX_DOLLAR_IDENTIFIER( || *p == '$' ) ) { int n = 0; lexer->string = lexer->string_storage; lexer->string_len = n; do { if (n+1 >= lexer->string_storage_len) return stb__clex_token(lexer, CLEX_parse_error, p, p+n); lexer->string[n] = p[n]; ++n; } while ( (p[n] >= 'a' && p[n] <= 'z') || (p[n] >= 'A' && p[n] <= 'Z') || (p[n] >= '0' && p[n] <= '9') // allow digits in middle of identifier || p[n] == '_' || (unsigned char) p[n] >= 128 STB_C_LEX_DOLLAR_IDENTIFIER( || p[n] == '$' ) ); lexer->string[n] = 0; return stb__clex_token(lexer, CLEX_id, p, p+n-1); } // check for EOF STB_C_LEX_0_IS_EOF( if (*p == 0) return stb__clex_eof(tok); ) single_char: // not an identifier, return the character as itself return stb__clex_token(lexer, *p, p, p); case '+': if (p+1 != lexer->eof) { STB_C_LEX_C_INCREMENTS(if (p[1] == '+') return stb__clex_token(lexer, CLEX_plusplus, p,p+1);) STB_C_LEX_C_ARITHEQ( if (p[1] == '=') return stb__clex_token(lexer, CLEX_pluseq , p,p+1);) } goto single_char; case '-': if (p+1 != lexer->eof) { STB_C_LEX_C_INCREMENTS(if (p[1] == '-') return stb__clex_token(lexer, CLEX_minusminus, p,p+1);) STB_C_LEX_C_ARITHEQ( if (p[1] == '=') return stb__clex_token(lexer, CLEX_minuseq , p,p+1);) STB_C_LEX_C_ARROW( if (p[1] == '>') return stb__clex_token(lexer, CLEX_arrow , p,p+1);) } goto single_char; case '&': if (p+1 != lexer->eof) { STB_C_LEX_C_LOGICAL( if (p[1] == '&') return stb__clex_token(lexer, CLEX_andand, p,p+1);) STB_C_LEX_C_BITWISEEQ(if (p[1] == '=') return stb__clex_token(lexer, CLEX_andeq , p,p+1);) } goto single_char; case '|': if (p+1 != lexer->eof) { STB_C_LEX_C_LOGICAL( if (p[1] == '|') return stb__clex_token(lexer, CLEX_oror, p,p+1);) STB_C_LEX_C_BITWISEEQ(if (p[1] == '=') return stb__clex_token(lexer, CLEX_oreq, p,p+1);) } goto single_char; case '=': if (p+1 != lexer->eof) { STB_C_LEX_C_COMPARISONS(if (p[1] == '=') return stb__clex_token(lexer, CLEX_eq, p,p+1);) STB_C_LEX_EQUAL_ARROW( if (p[1] == '>') return stb__clex_token(lexer, CLEX_eqarrow, p,p+1);) } goto single_char; case '!': STB_C_LEX_C_COMPARISONS(if (p+1 != lexer->eof && p[1] == '=') return stb__clex_token(lexer, CLEX_noteq, p,p+1);) goto single_char; case '^': STB_C_LEX_C_BITWISEEQ(if (p+1 != lexer->eof && p[1] == '=') return stb__clex_token(lexer, CLEX_xoreq, p,p+1)); goto single_char; case '%': STB_C_LEX_C_ARITHEQ(if (p+1 != lexer->eof && p[1] == '=') return stb__clex_token(lexer, CLEX_modeq, p,p+1)); goto single_char; case '*': STB_C_LEX_C_ARITHEQ(if (p+1 != lexer->eof && p[1] == '=') return stb__clex_token(lexer, CLEX_muleq, p,p+1)); goto single_char; case '/': STB_C_LEX_C_ARITHEQ(if (p+1 != lexer->eof && p[1] == '=') return stb__clex_token(lexer, CLEX_diveq, p,p+1)); goto single_char; case '<': if (p+1 != lexer->eof) { STB_C_LEX_C_COMPARISONS(if (p[1] == '=') return stb__clex_token(lexer, CLEX_lesseq, p,p+1);) STB_C_LEX_C_SHIFTS( if (p[1] == '<') { STB_C_LEX_C_ARITHEQ(if (p+2 != lexer->eof && p[2] == '=') return stb__clex_token(lexer, CLEX_shleq, p,p+2);) return stb__clex_token(lexer, CLEX_shl, p,p+1); } ) } goto single_char; case '>': if (p+1 != lexer->eof) { STB_C_LEX_C_COMPARISONS(if (p[1] == '=') return stb__clex_token(lexer, CLEX_greatereq, p,p+1);) STB_C_LEX_C_SHIFTS( if (p[1] == '>') { STB_C_LEX_C_ARITHEQ(if (p+2 != lexer->eof && p[2] == '=') return stb__clex_token(lexer, CLEX_shreq, p,p+2);) return stb__clex_token(lexer, CLEX_shr, p,p+1); } ) } goto single_char; case '"': STB_C_LEX_C_DQ_STRINGS(return stb__clex_parse_string(lexer, p, CLEX_dqstring);) goto single_char; case '\'': STB_C_LEX_C_SQ_STRINGS(return stb__clex_parse_string(lexer, p, CLEX_sqstring);) STB_C_LEX_C_CHARS( { char *start = p; lexer->int_number = stb__clex_parse_char(p+1, &p); if (lexer->int_number < 0) return stb__clex_token(lexer, CLEX_parse_error, start,start); if (p == lexer->eof || *p != '\'') return stb__clex_token(lexer, CLEX_parse_error, start,p); return stb__clex_token(lexer, CLEX_charlit, start, p+1); }) goto single_char; case '0': #if defined(STB__clex_hex_ints) || defined(STB__clex_hex_floats) if (p+1 != lexer->eof) { if (p[1] == 'x' || p[1] == 'X') { char *q; #ifdef STB__clex_hex_floats for (q=p+2; q != lexer->eof && ((*q >= '0' && *q <= '9') || (*q >= 'a' && *q <= 'f') || (*q >= 'A' && *q <= 'F')); ++q); if (q != lexer->eof) { if (*q == '.' STB_C_LEX_FLOAT_NO_DECIMAL(|| *q == 'p' || *q == 'P')) { #ifdef STB__CLEX_use_stdlib lexer->real_number = strtod((char *) p, (char**) &q); #else lexer->real_number = stb__clex_parse_float(p, &q); #endif if (p == q) return stb__clex_token(lexer, CLEX_parse_error, p,q); return stb__clex_parse_suffixes(lexer, CLEX_floatlit, p,q, STB_C_LEX_FLOAT_SUFFIXES); } } #endif // STB__CLEX_hex_floats #ifdef STB__clex_hex_ints #ifdef STB__CLEX_use_stdlib lexer->int_number = strtol((char *) p, (char **) &q, 16); #else { stb__clex_int n=0; for (q=p+2; q != lexer->eof; ++q) { if (*q >= '0' && *q <= '9') n = n*16 + (*q - '0'); else if (*q >= 'a' && *q <= 'f') n = n*16 + (*q - 'a') + 10; else if (*q >= 'A' && *q <= 'F') n = n*16 + (*q - 'A') + 10; else break; } lexer->int_number = n; } #endif if (q == p+2) return stb__clex_token(lexer, CLEX_parse_error, p-2,p-1); return stb__clex_parse_suffixes(lexer, CLEX_intlit, p,q, STB_C_LEX_HEX_SUFFIXES); #endif } } #endif // defined(STB__clex_hex_ints) || defined(STB__clex_hex_floats) // can't test for octal because we might parse '0.0' as float or as '0' '.' '0', // so have to do float first /* FALL THROUGH */ case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': #ifdef STB__clex_decimal_floats { char *q = p; while (q != lexer->eof && (*q >= '0' && *q <= '9')) ++q; if (q != lexer->eof) { if (*q == '.' STB_C_LEX_FLOAT_NO_DECIMAL(|| *q == 'e' || *q == 'E')) { #ifdef STB__CLEX_use_stdlib lexer->real_number = strtod((char *) p, (char**) &q); #else lexer->real_number = stb__clex_parse_float(p, &q); #endif return stb__clex_parse_suffixes(lexer, CLEX_floatlit, p,q, STB_C_LEX_FLOAT_SUFFIXES); } } } #endif // STB__clex_decimal_floats #ifdef STB__clex_octal_ints if (p[0] == '0') { char *q = p; #ifdef STB__CLEX_use_stdlib lexer->int_number = strtol((char *) p, (char **) &q, 8); #else stb__clex_int n=0; while (q != lexer->eof) { if (*q >= '0' && *q <= '7') n = n*8 + (*q - '0'); else break; ++q; } if (q != lexer->eof && (*q == '8' || *q=='9')) return stb__clex_token(lexer, CLEX_parse_error, p, q); lexer->int_number = n; #endif return stb__clex_parse_suffixes(lexer, CLEX_intlit, p,q, STB_C_LEX_OCTAL_SUFFIXES); } #endif // STB__clex_octal_ints #ifdef STB__clex_decimal_ints { char *q = p; #ifdef STB__CLEX_use_stdlib lexer->int_number = strtol((char *) p, (char **) &q, 10); #else stb__clex_int n=0; while (q != lexer->eof) { if (*q >= '0' && *q <= '9') n = n*10 + (*q - '0'); else break; ++q; } lexer->int_number = n; #endif return stb__clex_parse_suffixes(lexer, CLEX_intlit, p,q, STB_C_LEX_OCTAL_SUFFIXES); } #endif // STB__clex_decimal_ints goto single_char; } } #endif // STB_C_LEXER_IMPLEMENTATION #ifdef STB_C_LEXER_SELF_TEST #include #include static void print_token(stb_lexer *lexer) { switch (lexer->token) { case CLEX_id : printf("_%s", lexer->string); break; case CLEX_eq : printf("=="); break; case CLEX_noteq : printf("!="); break; case CLEX_lesseq : printf("<="); break; case CLEX_greatereq : printf(">="); break; case CLEX_andand : printf("&&"); break; case CLEX_oror : printf("||"); break; case CLEX_shl : printf("<<"); break; case CLEX_shr : printf(">>"); break; case CLEX_plusplus : printf("++"); break; case CLEX_minusminus: printf("--"); break; case CLEX_arrow : printf("->"); break; case CLEX_andeq : printf("&="); break; case CLEX_oreq : printf("|="); break; case CLEX_xoreq : printf("^="); break; case CLEX_pluseq : printf("+="); break; case CLEX_minuseq : printf("-="); break; case CLEX_muleq : printf("*="); break; case CLEX_diveq : printf("/="); break; case CLEX_modeq : printf("%%="); break; case CLEX_shleq : printf("<<="); break; case CLEX_shreq : printf(">>="); break; case CLEX_eqarrow : printf("=>"); break; case CLEX_dqstring : printf("\"%s\"", lexer->string); break; case CLEX_sqstring : printf("'\"%s\"'", lexer->string); break; case CLEX_charlit : printf("'%s'", lexer->string); break; #if defined(STB__clex_int_as_double) && !defined(STB__CLEX_use_stdlib) case CLEX_intlit : printf("#%g", lexer->real_number); break; #else case CLEX_intlit : printf("#%ld", lexer->int_number); break; #endif case CLEX_floatlit : printf("%g", lexer->real_number); break; default: if (lexer->token >= 0 && lexer->token < 256) printf("%c", (int) lexer->token); else { printf("<<>>\n", lexer->token); } break; } } /* Force a test of parsing multiline comments */ /*/ comment /*/ /**/ extern /**/ void dummy(void) { double some_floats[] = { 1.0501, -10.4e12, 5E+10, #if 0 // not support in C++ or C-pre-99, so don't try to compile it 0x1.0p+24, 0xff.FP-8, 0x1p-23, #endif 4. }; printf("test %d",1); // https://github.com/nothings/stb/issues/13 } int main(int argc, char **argv) { FILE *f = fopen("stb_c_lexer.h","rb"); char *text = (char *) malloc(1 << 20); int len = f ? fread(text, 1, 1<<20, f) : -1; stb_lexer lex; if (len < 0) { fprintf(stderr, "Error opening file\n"); free(text); fclose(f); return 1; } fclose(f); stb_c_lexer_init(&lex, text, text+len, (char *) malloc(0x10000), 0x10000); while (stb_c_lexer_get_token(&lex)) { if (lex.token == CLEX_parse_error) { printf("\n<<>>\n"); break; } print_token(&lex); printf(" "); } return 0; } #endif /* ------------------------------------------------------------------------------ This software is available under 2 licenses -- choose whichever you prefer. ------------------------------------------------------------------------------ ALTERNATIVE A - MIT License Copyright (c) 2017 Sean Barrett 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. ------------------------------------------------------------------------------ ALTERNATIVE B - Public Domain (www.unlicense.org) This is free and unencumbered software released into the public domain. Anyone is free to copy, modify, publish, use, compile, sell, or distribute this software, either in source code form or as a compiled binary, for any purpose, commercial or non-commercial, and by any means. In jurisdictions that recognize copyright laws, the author or authors of this software dedicate any and all copyright interest in the software to the public domain. We make this dedication for the benefit of the public at large and to the detriment of our heirs and successors. We intend this dedication to be an overt act of relinquishment in perpetuity of all present and future rights to this software under copyright law. 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 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. ------------------------------------------------------------------------------ */ uTox/third_party/stb/stb/stb.h0000600000175000001440000160033114003056224015353 0ustar rakusers/* stb.h - v2.30 - Sean's Tool Box -- public domain -- http://nothings.org/stb.h no warranty is offered or implied; use this code at your own risk This is a single header file with a bunch of useful utilities for getting stuff done in C/C++. Documentation: http://nothings.org/stb/stb_h.html Unit tests: http://nothings.org/stb/stb.c ============================================================================ You MUST #define STB_DEFINE in EXACTLY _one_ C or C++ file that includes this header, BEFORE the include, like this: #define STB_DEFINE #include "stb.h" All other files should just #include "stb.h" without the #define. ============================================================================ Version History 2.30 MinGW fix 2.29 attempt to fix use of swprintf() 2.28 various new functionality 2.27 test _WIN32 not WIN32 in STB_THREADS 2.26 various warning & bugfixes 2.25 various warning & bugfixes 2.24 various warning & bugfixes 2.23 fix 2.22 2.22 64-bit fixes from '!='; fix stb_sdict_copy() to have preferred name 2.21 utf-8 decoder rejects "overlong" encodings; attempted 64-bit improvements 2.20 fix to hash "copy" function--reported by someone with handle "!=" 2.19 ??? 2.18 stb_readdir_subdirs_mask 2.17 stb_cfg_dir 2.16 fix stb_bgio_, add stb_bgio_stat(); begin a streaming wrapper 2.15 upgraded hash table template to allow: - aggregate keys (explicit comparison func for EMPTY and DEL keys) - "static" implementations (so they can be culled if unused) 2.14 stb_mprintf 2.13 reduce identifiable strings in STB_NO_STB_STRINGS 2.12 fix STB_ONLY -- lots of uint32s, TRUE/FALSE things had crept in 2.11 fix bug in stb_dirtree_get() which caused "c://path" sorts of stuff 2.10 STB_F(), STB_I() inline constants (also KI,KU,KF,KD) 2.09 stb_box_face_vertex_axis_side 2.08 bugfix stb_trimwhite() 2.07 colored printing in windows (why are we in 1985?) 2.06 comparison functions are now functions-that-return-functions and accept a struct-offset as a parameter (not thread-safe) 2.05 compile and pass tests under Linux (but no threads); thread cleanup 2.04 stb_cubic_bezier_1d, smoothstep, avoid dependency on registry 2.03 ? 2.02 remove integrated documentation 2.01 integrate various fixes; stb_force_uniprocessor 2.00 revised stb_dupe to use multiple hashes 1.99 stb_charcmp 1.98 stb_arr_deleten, stb_arr_insertn 1.97 fix stb_newell_normal() 1.96 stb_hash_number() 1.95 hack stb__rec_max; clean up recursion code to use new functions 1.94 stb_dirtree; rename stb_extra to stb_ptrmap 1.93 stb_sem_new() API cleanup (no blockflag-starts blocked; use 'extra') 1.92 stb_threadqueue--multi reader/writer queue, fixed size or resizeable 1.91 stb_bgio_* for reading disk asynchronously 1.90 stb_mutex uses CRITICAL_REGION; new stb_sync primitive for thread joining; workqueue supports stb_sync instead of stb_semaphore 1.89 support ';' in constant-string wildcards; stb_mutex wrapper (can implement with EnterCriticalRegion eventually) 1.88 portable threading API (only for win32 so far); worker thread queue 1.87 fix wildcard handling in stb_readdir_recursive 1.86 support ';' in wildcards 1.85 make stb_regex work with non-constant strings; beginnings of stb_introspect() 1.84 (forgot to make notes) 1.83 whoops, stb_keep_if_different wasn't deleting the temp file 1.82 bring back stb_compress from stb_file.h for cmirror 1.81 various bugfixes, STB_FASTMALLOC_INIT inits FASTMALLOC in release 1.80 stb_readdir returns utf8; write own utf8-utf16 because lib was wrong 1.79 stb_write 1.78 calloc() support for malloc wrapper, STB_FASTMALLOC 1.77 STB_FASTMALLOC 1.76 STB_STUA - Lua-like language; (stb_image, stb_csample, stb_bilinear) 1.75 alloc/free array of blocks; stb_hheap bug; a few stb_ps_ funcs; hash*getkey, hash*copy; stb_bitset; stb_strnicmp; bugfix stb_bst 1.74 stb_replaceinplace; use stdlib C function to convert utf8 to UTF-16 1.73 fix performance bug & leak in stb_ischar (C++ port lost a 'static') 1.72 remove stb_block, stb_block_manager, stb_decompress (to stb_file.h) 1.71 stb_trimwhite, stb_tokens_nested, etc. 1.70 back out 1.69 because it might problemize mixed builds; stb_filec() 1.69 (stb_file returns 'char *' in C++) 1.68 add a special 'tree root' data type for stb_bst; stb_arr_end 1.67 full C++ port. (stb_block_manager) 1.66 stb_newell_normal 1.65 stb_lex_item_wild -- allow wildcard items which MUST match entirely 1.64 stb_data 1.63 stb_log_name 1.62 stb_define_sort; C++ cleanup 1.61 stb_hash_fast -- Paul Hsieh's hash function (beats Bob Jenkins'?) 1.60 stb_delete_directory_recursive 1.59 stb_readdir_recursive 1.58 stb_bst variant with parent pointer for O(1) iteration, not O(log N) 1.57 replace LCG random with Mersenne Twister (found a public domain one) 1.56 stb_perfect_hash, stb_ischar, stb_regex 1.55 new stb_bst API allows multiple BSTs per node (e.g. secondary keys) 1.54 bugfix: stb_define_hash, stb_wildmatch, regexp 1.53 stb_define_hash; recoded stb_extra, stb_sdict use it 1.52 stb_rand_define, stb_bst, stb_reverse 1.51 fix 'stb_arr_setlen(NULL, 0)' 1.50 stb_wordwrap 1.49 minor improvements to enable the scripting language 1.48 better approach for stb_arr using stb_malloc; more invasive, clearer 1.47 stb_lex (lexes stb.h at 1.5ML/s on 3Ghz P4; 60/70% of optimal/flex) 1.46 stb_wrapper_*, STB_MALLOC_WRAPPER 1.45 lightly tested DFA acceleration of regexp searching 1.44 wildcard matching & searching; regexp matching & searching 1.43 stb_temp 1.42 allow stb_arr to use stb_malloc/realloc; note this is global 1.41 make it compile in C++; (disable stb_arr in C++) 1.40 stb_dupe tweak; stb_swap; stb_substr 1.39 stb_dupe; improve stb_file_max to be less stupid 1.38 stb_sha1_file: generate sha1 for file, even > 4GB 1.37 stb_file_max; partial support for utf8 filenames in Windows 1.36 remove STB__NO_PREFIX - poor interaction with IDE, not worth it streamline stb_arr to make it separately publishable 1.35 bugfixes for stb_sdict, stb_malloc(0), stristr 1.34 (streaming interfaces for stb_compress) 1.33 stb_alloc; bug in stb_getopt; remove stb_overflow 1.32 (stb_compress returns, smaller&faster; encode window & 64-bit len) 1.31 stb_prefix_count 1.30 (STB__NO_PREFIX - remove stb_ prefixes for personal projects) 1.29 stb_fput_varlen64, etc. 1.28 stb_sha1 1.27 ? 1.26 stb_extra 1.25 ? 1.24 stb_copyfile 1.23 stb_readdir 1.22 ? 1.21 ? 1.20 ? 1.19 ? 1.18 ? 1.17 ? 1.16 ? 1.15 stb_fixpath, stb_splitpath, stb_strchr2 1.14 stb_arr 1.13 ?stb, stb_log, stb_fatal 1.12 ?stb_hash2 1.11 miniML 1.10 stb_crc32, stb_adler32 1.09 stb_sdict 1.08 stb_bitreverse, stb_ispow2, stb_big32 stb_fopen, stb_fput_varlen, stb_fput_ranged stb_fcmp, stb_feq 1.07 (stb_encompress) 1.06 stb_compress 1.05 stb_tokens, (stb_hheap) 1.04 stb_rand 1.03 ?(s-strings) 1.02 ?stb_filelen, stb_tokens 1.01 stb_tolower 1.00 stb_hash, stb_intcmp stb_file, stb_stringfile, stb_fgets stb_prefix, stb_strlower, stb_strtok stb_image (stb_array), (stb_arena) Parenthesized items have since been removed. LICENSE See end of file for license information. CREDITS Written by Sean Barrett. Fixes: Philipp Wiesemann Robert Nix r-lyeh blackpawn github:Mojofreem Ryan Whitworth Vincent Isambart Mike Sartain Eugene Opalev Tim Sjostrand github:infatum */ #include #ifndef STB__INCLUDE_STB_H #define STB__INCLUDE_STB_H #define STB_VERSION 1 #ifdef STB_INTROSPECT #define STB_DEFINE #endif #ifdef STB_DEFINE_THREADS #ifndef STB_DEFINE #define STB_DEFINE #endif #ifndef STB_THREADS #define STB_THREADS #endif #endif #if defined(_WIN32) && !defined(__MINGW32__) #ifndef _CRT_SECURE_NO_WARNINGS #define _CRT_SECURE_NO_WARNINGS #endif #ifndef _CRT_NONSTDC_NO_DEPRECATE #define _CRT_NONSTDC_NO_DEPRECATE #endif #ifndef _CRT_NON_CONFORMING_SWPRINTFS #define _CRT_NON_CONFORMING_SWPRINTFS #endif #if !defined(_MSC_VER) || _MSC_VER > 1700 #include // _BitScanReverse #endif #endif #include // stdlib could have min/max #include // need FILE #include // stb_define_hash needs memcpy/memset #include // stb_dirtree #ifdef __MINGW32__ #include // O_RDWR #endif #ifdef STB_PERSONAL typedef int Bool; #define False 0 #define True 1 #endif #ifdef STB_MALLOC_WRAPPER_PAGED #define STB_MALLOC_WRAPPER_DEBUG #endif #ifdef STB_MALLOC_WRAPPER_DEBUG #define STB_MALLOC_WRAPPER #endif #ifdef STB_MALLOC_WRAPPER_FASTMALLOC #define STB_FASTMALLOC #define STB_MALLOC_WRAPPER #endif #ifdef STB_FASTMALLOC #ifndef _WIN32 #undef STB_FASTMALLOC #endif #endif #ifdef STB_DEFINE #include #include #include #include #include #ifndef _WIN32 #include #else #include // _mktemp #include // _rmdir #endif #include // stat()/_stat() #include // stat()/_stat() #endif #define stb_min(a,b) ((a) < (b) ? (a) : (b)) #define stb_max(a,b) ((a) > (b) ? (a) : (b)) #ifndef STB_ONLY #if !defined(__cplusplus) && !defined(min) && !defined(max) #define min(x,y) stb_min(x,y) #define max(x,y) stb_max(x,y) #endif #ifndef M_PI #define M_PI 3.14159265358979323846f #endif #ifndef TRUE #define TRUE 1 #define FALSE 0 #endif #ifndef deg2rad #define deg2rad(a) ((a)*(M_PI/180)) #endif #ifndef rad2deg #define rad2deg(a) ((a)*(180/M_PI)) #endif #ifndef swap #ifndef __cplusplus #define swap(TYPE,a,b) \ do { TYPE stb__t; stb__t = (a); (a) = (b); (b) = stb__t; } while (0) #endif #endif typedef unsigned char uint8 ; typedef signed char int8 ; typedef unsigned short uint16; typedef signed short int16; #if defined(STB_USE_LONG_FOR_32_BIT_INT) || defined(STB_LONG32) typedef unsigned long uint32; typedef signed long int32; #else typedef unsigned int uint32; typedef signed int int32; #endif typedef unsigned char uchar ; typedef unsigned short ushort; typedef unsigned int uint ; typedef unsigned long ulong ; // produce compile errors if the sizes aren't right typedef char stb__testsize16[sizeof(int16)==2]; typedef char stb__testsize32[sizeof(int32)==4]; #endif #ifndef STB_TRUE #define STB_TRUE 1 #define STB_FALSE 0 #endif // if we're STB_ONLY, can't rely on uint32 or even uint, so all the // variables we'll use herein need typenames prefixed with 'stb': typedef unsigned char stb_uchar; typedef unsigned char stb_uint8; typedef unsigned int stb_uint; typedef unsigned short stb_uint16; typedef short stb_int16; typedef signed char stb_int8; #if defined(STB_USE_LONG_FOR_32_BIT_INT) || defined(STB_LONG32) typedef unsigned long stb_uint32; typedef long stb_int32; #else typedef unsigned int stb_uint32; typedef int stb_int32; #endif typedef char stb__testsize2_16[sizeof(stb_uint16)==2 ? 1 : -1]; typedef char stb__testsize2_32[sizeof(stb_uint32)==4 ? 1 : -1]; #ifdef _MSC_VER typedef unsigned __int64 stb_uint64; typedef __int64 stb_int64; #define STB_IMM_UINT64(literalui64) (literalui64##ui64) #define STB_IMM_INT64(literali64) (literali64##i64) #else // ?? typedef unsigned long long stb_uint64; typedef long long stb_int64; #define STB_IMM_UINT64(literalui64) (literalui64##ULL) #define STB_IMM_INT64(literali64) (literali64##LL) #endif typedef char stb__testsize2_64[sizeof(stb_uint64)==8 ? 1 : -1]; // add platform-specific ways of checking for sizeof(char*) == 8, // and make those define STB_PTR64 #if defined(_WIN64) || defined(__x86_64__) || defined(__ia64__) || defined(__LP64__) #define STB_PTR64 #endif #ifdef STB_PTR64 typedef char stb__testsize2_ptr[sizeof(char *) == 8]; typedef stb_uint64 stb_uinta; typedef stb_int64 stb_inta; #else typedef char stb__testsize2_ptr[sizeof(char *) == 4]; typedef stb_uint32 stb_uinta; typedef stb_int32 stb_inta; #endif typedef char stb__testsize2_uinta[sizeof(stb_uinta)==sizeof(char*) ? 1 : -1]; // if so, we should define an int type that is the pointer size. until then, // we'll have to make do with this (which is not the same at all!) typedef union { unsigned int i; void * p; } stb_uintptr; #ifdef __cplusplus #define STB_EXTERN extern "C" #else #define STB_EXTERN extern #endif // check for well-known debug defines #if defined(DEBUG) || defined(_DEBUG) || defined(DBG) #ifndef NDEBUG #define STB_DEBUG #endif #endif #ifdef STB_DEBUG #include #endif STB_EXTERN void stb_wrapper_malloc(void *newp, int sz, char *file, int line); STB_EXTERN void stb_wrapper_free(void *oldp, char *file, int line); STB_EXTERN void stb_wrapper_realloc(void *oldp, void *newp, int sz, char *file, int line); STB_EXTERN void stb_wrapper_calloc(size_t num, size_t sz, char *file, int line); STB_EXTERN void stb_wrapper_listall(void (*func)(void *ptr, int sz, char *file, int line)); STB_EXTERN void stb_wrapper_dump(char *filename); STB_EXTERN int stb_wrapper_allocsize(void *oldp); STB_EXTERN void stb_wrapper_check(void *oldp); #ifdef STB_DEFINE // this is a special function used inside malloc wrapper // to do allocations that aren't tracked (to avoid // reentrancy). Of course if someone _else_ wraps realloc, // this breaks, but if they're doing that AND the malloc // wrapper they need to explicitly check for reentrancy. // // only define realloc_raw() and we do realloc(NULL,sz) // for malloc() and realloc(p,0) for free(). static void * stb__realloc_raw(void *p, int sz) { if (p == NULL) return malloc(sz); if (sz == 0) { free(p); return NULL; } return realloc(p,sz); } #endif #ifdef _WIN32 STB_EXTERN void * stb_smalloc(size_t sz); STB_EXTERN void stb_sfree(void *p); STB_EXTERN void * stb_srealloc(void *p, size_t sz); STB_EXTERN void * stb_scalloc(size_t n, size_t sz); STB_EXTERN char * stb_sstrdup(char *s); #endif #ifdef STB_FASTMALLOC #define malloc stb_smalloc #define free stb_sfree #define realloc stb_srealloc #define strdup stb_sstrdup #define calloc stb_scalloc #endif #ifndef STB_MALLOC_ALLCHECK #define stb__check(p) 1 #else #ifndef STB_MALLOC_WRAPPER #error STB_MALLOC_ALLCHECK requires STB_MALLOC_WRAPPER #else #define stb__check(p) stb_mcheck(p) #endif #endif #ifdef STB_MALLOC_WRAPPER STB_EXTERN void * stb__malloc(int, char *, int); STB_EXTERN void * stb__realloc(void *, int, char *, int); STB_EXTERN void * stb__calloc(size_t n, size_t s, char *, int); STB_EXTERN void stb__free(void *, char *file, int); STB_EXTERN char * stb__strdup(char *s, char *file, int); STB_EXTERN void stb_malloc_checkall(void); STB_EXTERN void stb_malloc_check_counter(int init_delay, int rep_delay); #ifndef STB_MALLOC_WRAPPER_DEBUG #define stb_mcheck(p) 1 #else STB_EXTERN int stb_mcheck(void *); #endif #ifdef STB_DEFINE #ifdef STB_MALLOC_WRAPPER_DEBUG #define STB__PAD 32 #define STB__BIAS 16 #define STB__SIG 0x51b01234 #define STB__FIXSIZE(sz) (((sz+3) & ~3) + STB__PAD) #define STB__ptr(x,y) ((char *) (x) + (y)) #else #define STB__ptr(x,y) (x) #define STB__FIXSIZE(sz) (sz) #endif #ifdef STB_MALLOC_WRAPPER_DEBUG int stb_mcheck(void *p) { unsigned int sz; if (p == NULL) return 1; p = ((char *) p) - STB__BIAS; sz = * (unsigned int *) p; assert(* (unsigned int *) STB__ptr(p,4) == STB__SIG); assert(* (unsigned int *) STB__ptr(p,8) == STB__SIG); assert(* (unsigned int *) STB__ptr(p,12) == STB__SIG); assert(* (unsigned int *) STB__ptr(p,sz-4) == STB__SIG+1); assert(* (unsigned int *) STB__ptr(p,sz-8) == STB__SIG+1); assert(* (unsigned int *) STB__ptr(p,sz-12) == STB__SIG+1); assert(* (unsigned int *) STB__ptr(p,sz-16) == STB__SIG+1); stb_wrapper_check(STB__ptr(p, STB__BIAS)); return 1; } static void stb__check2(void *p, int sz, char *file, int line) { stb_mcheck(p); } void stb_malloc_checkall(void) { stb_wrapper_listall(stb__check2); } #else void stb_malloc_checkall(void) { } #endif static int stb__malloc_wait=(1 << 30), stb__malloc_next_wait = (1 << 30), stb__malloc_iter; void stb_malloc_check_counter(int init_delay, int rep_delay) { stb__malloc_wait = init_delay; stb__malloc_next_wait = rep_delay; } void stb_mcheck_all(void) { #ifdef STB_MALLOC_WRAPPER_DEBUG ++stb__malloc_iter; if (--stb__malloc_wait <= 0) { stb_malloc_checkall(); stb__malloc_wait = stb__malloc_next_wait; } #endif } #ifdef STB_MALLOC_WRAPPER_PAGED #define STB__WINDOWS_PAGE (1 << 12) #ifndef _WINDOWS_ STB_EXTERN __declspec(dllimport) void * __stdcall VirtualAlloc(void *p, unsigned long size, unsigned long type, unsigned long protect); STB_EXTERN __declspec(dllimport) int __stdcall VirtualFree(void *p, unsigned long size, unsigned long freetype); #endif #endif static void *stb__malloc_final(int sz) { #ifdef STB_MALLOC_WRAPPER_PAGED int aligned = (sz + STB__WINDOWS_PAGE - 1) & ~(STB__WINDOWS_PAGE-1); char *p = VirtualAlloc(NULL, aligned + STB__WINDOWS_PAGE, 0x2000, 0x04); // RESERVE, READWRITE if (p == NULL) return p; VirtualAlloc(p, aligned, 0x1000, 0x04); // COMMIT, READWRITE return p; #else return malloc(sz); #endif } static void stb__free_final(void *p) { #ifdef STB_MALLOC_WRAPPER_PAGED VirtualFree(p, 0, 0x8000); // RELEASE #else free(p); #endif } int stb__malloc_failure; static void *stb__realloc_final(void *p, int sz, int old_sz) { #ifdef STB_MALLOC_WRAPPER_PAGED void *q = stb__malloc_final(sz); if (q == NULL) return ++stb__malloc_failure, q; // @TODO: deal with p being smaller! memcpy(q, p, sz < old_sz ? sz : old_sz); stb__free_final(p); return q; #else return realloc(p,sz); #endif } void stb__free(void *p, char *file, int line) { stb_mcheck_all(); if (!p) return; #ifdef STB_MALLOC_WRAPPER_DEBUG stb_mcheck(p); #endif stb_wrapper_free(p,file,line); #ifdef STB_MALLOC_WRAPPER_DEBUG p = STB__ptr(p,-STB__BIAS); * (unsigned int *) STB__ptr(p,0) = 0xdeadbeef; * (unsigned int *) STB__ptr(p,4) = 0xdeadbeef; * (unsigned int *) STB__ptr(p,8) = 0xdeadbeef; * (unsigned int *) STB__ptr(p,12) = 0xdeadbeef; #endif stb__free_final(p); } void * stb__malloc(int sz, char *file, int line) { void *p; stb_mcheck_all(); if (sz == 0) return NULL; p = stb__malloc_final(STB__FIXSIZE(sz)); if (p == NULL) p = stb__malloc_final(STB__FIXSIZE(sz)); if (p == NULL) p = stb__malloc_final(STB__FIXSIZE(sz)); if (p == NULL) { ++stb__malloc_failure; #ifdef STB_MALLOC_WRAPPER_DEBUG stb_malloc_checkall(); #endif return p; } #ifdef STB_MALLOC_WRAPPER_DEBUG * (int *) STB__ptr(p,0) = STB__FIXSIZE(sz); * (unsigned int *) STB__ptr(p,4) = STB__SIG; * (unsigned int *) STB__ptr(p,8) = STB__SIG; * (unsigned int *) STB__ptr(p,12) = STB__SIG; * (unsigned int *) STB__ptr(p,STB__FIXSIZE(sz)-4) = STB__SIG+1; * (unsigned int *) STB__ptr(p,STB__FIXSIZE(sz)-8) = STB__SIG+1; * (unsigned int *) STB__ptr(p,STB__FIXSIZE(sz)-12) = STB__SIG+1; * (unsigned int *) STB__ptr(p,STB__FIXSIZE(sz)-16) = STB__SIG+1; p = STB__ptr(p, STB__BIAS); #endif stb_wrapper_malloc(p,sz,file,line); return p; } void * stb__realloc(void *p, int sz, char *file, int line) { void *q; stb_mcheck_all(); if (p == NULL) return stb__malloc(sz,file,line); if (sz == 0 ) { stb__free(p,file,line); return NULL; } #ifdef STB_MALLOC_WRAPPER_DEBUG stb_mcheck(p); p = STB__ptr(p,-STB__BIAS); #endif #ifdef STB_MALLOC_WRAPPER_PAGED { int n = stb_wrapper_allocsize(STB__ptr(p,STB__BIAS)); if (!n) stb_wrapper_check(STB__ptr(p,STB__BIAS)); q = stb__realloc_final(p, STB__FIXSIZE(sz), STB__FIXSIZE(n)); } #else q = realloc(p, STB__FIXSIZE(sz)); #endif if (q == NULL) return ++stb__malloc_failure, q; #ifdef STB_MALLOC_WRAPPER_DEBUG * (int *) STB__ptr(q,0) = STB__FIXSIZE(sz); * (unsigned int *) STB__ptr(q,4) = STB__SIG; * (unsigned int *) STB__ptr(q,8) = STB__SIG; * (unsigned int *) STB__ptr(q,12) = STB__SIG; * (unsigned int *) STB__ptr(q,STB__FIXSIZE(sz)-4) = STB__SIG+1; * (unsigned int *) STB__ptr(q,STB__FIXSIZE(sz)-8) = STB__SIG+1; * (unsigned int *) STB__ptr(q,STB__FIXSIZE(sz)-12) = STB__SIG+1; * (unsigned int *) STB__ptr(q,STB__FIXSIZE(sz)-16) = STB__SIG+1; q = STB__ptr(q, STB__BIAS); p = STB__ptr(p, STB__BIAS); #endif stb_wrapper_realloc(p,q,sz,file,line); return q; } STB_EXTERN int stb_log2_ceil(unsigned int); static void *stb__calloc(size_t n, size_t sz, char *file, int line) { void *q; stb_mcheck_all(); if (n == 0 || sz == 0) return NULL; if (stb_log2_ceil(n) + stb_log2_ceil(sz) >= 32) return NULL; q = stb__malloc(n*sz, file, line); if (q) memset(q, 0, n*sz); return q; } char * stb__strdup(char *s, char *file, int line) { char *p; stb_mcheck_all(); p = stb__malloc(strlen(s)+1, file, line); if (!p) return p; strcpy(p, s); return p; } #endif // STB_DEFINE #ifdef STB_FASTMALLOC #undef malloc #undef realloc #undef free #undef strdup #undef calloc #endif // include everything that might define these, BEFORE making macros #include #include #include #define malloc(s) stb__malloc ( s, __FILE__, __LINE__) #define realloc(p,s) stb__realloc(p,s, __FILE__, __LINE__) #define calloc(n,s) stb__calloc (n,s, __FILE__, __LINE__) #define free(p) stb__free (p, __FILE__, __LINE__) #define strdup(p) stb__strdup (p, __FILE__, __LINE__) #endif ////////////////////////////////////////////////////////////////////////////// // // Windows pretty display // STB_EXTERN void stbprint(const char *fmt, ...); STB_EXTERN char *stb_sprintf(const char *fmt, ...); STB_EXTERN char *stb_mprintf(const char *fmt, ...); STB_EXTERN int stb_snprintf(char *s, size_t n, const char *fmt, ...); STB_EXTERN int stb_vsnprintf(char *s, size_t n, const char *fmt, va_list v); #ifdef STB_DEFINE int stb_vsnprintf(char *s, size_t n, const char *fmt, va_list v) { int res; #ifdef _WIN32 // Could use "_vsnprintf_s(s, n, _TRUNCATE, fmt, v)" ? res = _vsnprintf(s,n,fmt,v); #else res = vsnprintf(s,n,fmt,v); #endif if (n) s[n-1] = 0; // Unix returns length output would require, Windows returns negative when truncated. return (res >= (int) n || res < 0) ? -1 : res; } int stb_snprintf(char *s, size_t n, const char *fmt, ...) { int res; va_list v; va_start(v,fmt); res = stb_vsnprintf(s, n, fmt, v); va_end(v); return res; } char *stb_sprintf(const char *fmt, ...) { static char buffer[1024]; va_list v; va_start(v,fmt); stb_vsnprintf(buffer,1024,fmt,v); va_end(v); return buffer; } char *stb_mprintf(const char *fmt, ...) { static char buffer[1024]; va_list v; va_start(v,fmt); stb_vsnprintf(buffer,1024,fmt,v); va_end(v); return strdup(buffer); } #ifdef _WIN32 #ifndef _WINDOWS_ STB_EXTERN __declspec(dllimport) int __stdcall WriteConsoleA(void *, const void *, unsigned int, unsigned int *, void *); STB_EXTERN __declspec(dllimport) void * __stdcall GetStdHandle(unsigned int); STB_EXTERN __declspec(dllimport) int __stdcall SetConsoleTextAttribute(void *, unsigned short); #endif static void stb__print_one(void *handle, char *s, int len) { if (len) if (WriteConsoleA(handle, s, len, NULL,NULL)) fwrite(s, 1, len, stdout); // if it fails, maybe redirected, so do normal } static void stb__print(char *s) { void *handle = GetStdHandle((unsigned int) -11); // STD_OUTPUT_HANDLE int pad=0; // number of padding characters to add char *t = s; while (*s) { int lpad; while (*s && *s != '{') { if (pad) { if (*s == '\r' || *s == '\n') pad = 0; else if (s[0] == ' ' && s[1] == ' ') { stb__print_one(handle, t, s-t); t = s; while (pad) { stb__print_one(handle, t, 1); --pad; } } } ++s; } if (!*s) break; stb__print_one(handle, t, s-t); if (s[1] == '{') { ++s; continue; } if (s[1] == '#') { t = s+3; if (isxdigit(s[2])) if (isdigit(s[2])) SetConsoleTextAttribute(handle, s[2] - '0'); else SetConsoleTextAttribute(handle, tolower(s[2]) - 'a' + 10); else { SetConsoleTextAttribute(handle, 0x0f); t=s+2; } } else if (s[1] == '!') { SetConsoleTextAttribute(handle, 0x0c); t = s+2; } else if (s[1] == '@') { SetConsoleTextAttribute(handle, 0x09); t = s+2; } else if (s[1] == '$') { SetConsoleTextAttribute(handle, 0x0a); t = s+2; } else { SetConsoleTextAttribute(handle, 0x08); // 0,7,8,15 => shades of grey t = s+1; } lpad = (t-s); s = t; while (*s && *s != '}') ++s; if (!*s) break; stb__print_one(handle, t, s-t); if (s[1] == '}') { t = s+2; } else { pad += 1+lpad; t = s+1; } s=t; SetConsoleTextAttribute(handle, 0x07); } stb__print_one(handle, t, s-t); SetConsoleTextAttribute(handle, 0x07); } void stbprint(const char *fmt, ...) { int res; char buffer[1024]; char *tbuf = buffer; va_list v; va_start(v,fmt); res = stb_vsnprintf(buffer, sizeof(buffer), fmt, v); va_end(v); if (res < 0) { tbuf = (char *) malloc(16384); va_start(v,fmt); res = _vsnprintf(tbuf,16384, fmt, v); va_end(v); tbuf[16383] = 0; } stb__print(tbuf); if (tbuf != buffer) free(tbuf); } #else // _WIN32 void stbprint(const char *fmt, ...) { va_list v; va_start(v,fmt); vprintf(fmt,v); va_end(v); } #endif // _WIN32 #endif // STB_DEFINE ////////////////////////////////////////////////////////////////////////////// // // Windows UTF8 filename handling // // Windows stupidly treats 8-bit filenames as some dopey code page, // rather than utf-8. If we want to use utf8 filenames, we have to // convert them to WCHAR explicitly and call WCHAR versions of the // file functions. So, ok, we do. #ifdef _WIN32 #define stb__fopen(x,y) _wfopen((const wchar_t *)stb__from_utf8(x), (const wchar_t *)stb__from_utf8_alt(y)) #define stb__windows(x,y) x #else #define stb__fopen(x,y) fopen(x,y) #define stb__windows(x,y) y #endif typedef unsigned short stb__wchar; STB_EXTERN stb__wchar * stb_from_utf8(stb__wchar *buffer, char *str, int n); STB_EXTERN char * stb_to_utf8 (char *buffer, stb__wchar *str, int n); STB_EXTERN stb__wchar *stb__from_utf8(char *str); STB_EXTERN stb__wchar *stb__from_utf8_alt(char *str); STB_EXTERN char *stb__to_utf8(stb__wchar *str); #ifdef STB_DEFINE stb__wchar * stb_from_utf8(stb__wchar *buffer, char *ostr, int n) { unsigned char *str = (unsigned char *) ostr; stb_uint32 c; int i=0; --n; while (*str) { if (i >= n) return NULL; if (!(*str & 0x80)) buffer[i++] = *str++; else if ((*str & 0xe0) == 0xc0) { if (*str < 0xc2) return NULL; c = (*str++ & 0x1f) << 6; if ((*str & 0xc0) != 0x80) return NULL; buffer[i++] = c + (*str++ & 0x3f); } else if ((*str & 0xf0) == 0xe0) { if (*str == 0xe0 && (str[1] < 0xa0 || str[1] > 0xbf)) return NULL; if (*str == 0xed && str[1] > 0x9f) return NULL; // str[1] < 0x80 is checked below c = (*str++ & 0x0f) << 12; if ((*str & 0xc0) != 0x80) return NULL; c += (*str++ & 0x3f) << 6; if ((*str & 0xc0) != 0x80) return NULL; buffer[i++] = c + (*str++ & 0x3f); } else if ((*str & 0xf8) == 0xf0) { if (*str > 0xf4) return NULL; if (*str == 0xf0 && (str[1] < 0x90 || str[1] > 0xbf)) return NULL; if (*str == 0xf4 && str[1] > 0x8f) return NULL; // str[1] < 0x80 is checked below c = (*str++ & 0x07) << 18; if ((*str & 0xc0) != 0x80) return NULL; c += (*str++ & 0x3f) << 12; if ((*str & 0xc0) != 0x80) return NULL; c += (*str++ & 0x3f) << 6; if ((*str & 0xc0) != 0x80) return NULL; c += (*str++ & 0x3f); // utf-8 encodings of values used in surrogate pairs are invalid if ((c & 0xFFFFF800) == 0xD800) return NULL; if (c >= 0x10000) { c -= 0x10000; if (i + 2 > n) return NULL; buffer[i++] = 0xD800 | (0x3ff & (c >> 10)); buffer[i++] = 0xDC00 | (0x3ff & (c )); } } else return NULL; } buffer[i] = 0; return buffer; } char * stb_to_utf8(char *buffer, stb__wchar *str, int n) { int i=0; --n; while (*str) { if (*str < 0x80) { if (i+1 > n) return NULL; buffer[i++] = (char) *str++; } else if (*str < 0x800) { if (i+2 > n) return NULL; buffer[i++] = 0xc0 + (*str >> 6); buffer[i++] = 0x80 + (*str & 0x3f); str += 1; } else if (*str >= 0xd800 && *str < 0xdc00) { stb_uint32 c; if (i+4 > n) return NULL; c = ((str[0] - 0xd800) << 10) + ((str[1]) - 0xdc00) + 0x10000; buffer[i++] = 0xf0 + (c >> 18); buffer[i++] = 0x80 + ((c >> 12) & 0x3f); buffer[i++] = 0x80 + ((c >> 6) & 0x3f); buffer[i++] = 0x80 + ((c ) & 0x3f); str += 2; } else if (*str >= 0xdc00 && *str < 0xe000) { return NULL; } else { if (i+3 > n) return NULL; buffer[i++] = 0xe0 + (*str >> 12); buffer[i++] = 0x80 + ((*str >> 6) & 0x3f); buffer[i++] = 0x80 + ((*str ) & 0x3f); str += 1; } } buffer[i] = 0; return buffer; } stb__wchar *stb__from_utf8(char *str) { static stb__wchar buffer[4096]; return stb_from_utf8(buffer, str, 4096); } stb__wchar *stb__from_utf8_alt(char *str) { static stb__wchar buffer[64]; return stb_from_utf8(buffer, str, 64); } char *stb__to_utf8(stb__wchar *str) { static char buffer[4096]; return stb_to_utf8(buffer, str, 4096); } #endif ////////////////////////////////////////////////////////////////////////////// // // Miscellany // STB_EXTERN void stb_fatal(char *fmt, ...); STB_EXTERN void stb_(char *fmt, ...); STB_EXTERN void stb_append_to_file(char *file, char *fmt, ...); STB_EXTERN void stb_log(int active); STB_EXTERN void stb_log_fileline(int active); STB_EXTERN void stb_log_name(char *filename); STB_EXTERN void stb_swap(void *p, void *q, size_t sz); STB_EXTERN void *stb_copy(void *p, size_t sz); STB_EXTERN void stb_pointer_array_free(void *p, int len); STB_EXTERN void **stb_array_block_alloc(int count, int blocksize); #define stb_arrcount(x) (sizeof(x)/sizeof((x)[0])) STB_EXTERN int stb__record_fileline(char *f, int n); #ifdef STB_DEFINE static char *stb__file; static int stb__line; int stb__record_fileline(char *f, int n) { stb__file = f; stb__line = n; return 0; } void stb_fatal(char *s, ...) { va_list a; if (stb__file) fprintf(stderr, "[%s:%d] ", stb__file, stb__line); va_start(a,s); fputs("Fatal error: ", stderr); vfprintf(stderr, s, a); va_end(a); fputs("\n", stderr); #ifdef STB_DEBUG #ifdef _MSC_VER #ifndef STB_PTR64 __asm int 3; // trap to debugger! #else __debugbreak(); #endif #else __builtin_trap(); #endif #endif exit(1); } static int stb__log_active=1, stb__log_fileline=1; void stb_log(int active) { stb__log_active = active; } void stb_log_fileline(int active) { stb__log_fileline = active; } #ifdef STB_NO_STB_STRINGS char *stb__log_filename = "temp.log"; #else char *stb__log_filename = "stb.log"; #endif void stb_log_name(char *s) { stb__log_filename = s; } void stb_(char *s, ...) { if (stb__log_active) { FILE *f = fopen(stb__log_filename, "a"); if (f) { va_list a; if (stb__log_fileline && stb__file) fprintf(f, "[%s:%4d] ", stb__file, stb__line); va_start(a,s); vfprintf(f, s, a); va_end(a); fputs("\n", f); fclose(f); } } } void stb_append_to_file(char *filename, char *s, ...) { FILE *f = fopen(filename, "a"); if (f) { va_list a; va_start(a,s); vfprintf(f, s, a); va_end(a); fputs("\n", f); fclose(f); } } typedef struct { char d[4]; } stb__4; typedef struct { char d[8]; } stb__8; // optimize the small cases, though you shouldn't be calling this for those! void stb_swap(void *p, void *q, size_t sz) { char buffer[256]; if (p == q) return; if (sz == 4) { stb__4 temp = * ( stb__4 *) p; * (stb__4 *) p = * ( stb__4 *) q; * (stb__4 *) q = temp; return; } else if (sz == 8) { stb__8 temp = * ( stb__8 *) p; * (stb__8 *) p = * ( stb__8 *) q; * (stb__8 *) q = temp; return; } while (sz > sizeof(buffer)) { stb_swap(p, q, sizeof(buffer)); p = (char *) p + sizeof(buffer); q = (char *) q + sizeof(buffer); sz -= sizeof(buffer); } memcpy(buffer, p , sz); memcpy(p , q , sz); memcpy(q , buffer, sz); } void *stb_copy(void *p, size_t sz) { void *q = malloc(sz); memcpy(q, p, sz); return q; } void stb_pointer_array_free(void *q, int len) { void **p = (void **) q; int i; for (i=0; i < len; ++i) free(p[i]); } void **stb_array_block_alloc(int count, int blocksize) { int i; char *p = (char *) malloc(sizeof(void *) * count + count * blocksize); void **q; if (p == NULL) return NULL; q = (void **) p; p += sizeof(void *) * count; for (i=0; i < count; ++i) q[i] = p + i * blocksize; return q; } #endif #ifdef STB_DEBUG // tricky hack to allow recording FILE,LINE even in varargs functions #define STB__RECORD_FILE(x) (stb__record_fileline(__FILE__, __LINE__),(x)) #define stb_log STB__RECORD_FILE(stb_log) #define stb_ STB__RECORD_FILE(stb_) #ifndef STB_FATAL_CLEAN #define stb_fatal STB__RECORD_FILE(stb_fatal) #endif #define STB__DEBUG(x) x #else #define STB__DEBUG(x) #endif ////////////////////////////////////////////////////////////////////////////// // // stb_temp // #define stb_temp(block, sz) stb__temp(block, sizeof(block), (sz)) STB_EXTERN void * stb__temp(void *b, int b_sz, int want_sz); STB_EXTERN void stb_tempfree(void *block, void *ptr); #ifdef STB_DEFINE void * stb__temp(void *b, int b_sz, int want_sz) { if (b_sz >= want_sz) return b; else return malloc(want_sz); } void stb_tempfree(void *b, void *p) { if (p != b) free(p); } #endif ////////////////////////////////////////////////////////////////////////////// // // math/sampling operations // #define stb_lerp(t,a,b) ( (a) + (t) * (float) ((b)-(a)) ) #define stb_unlerp(t,a,b) ( ((t) - (a)) / (float) ((b) - (a)) ) #define stb_clamp(x,xmin,xmax) ((x) < (xmin) ? (xmin) : (x) > (xmax) ? (xmax) : (x)) STB_EXTERN void stb_newell_normal(float *normal, int num_vert, float **vert, int normalize); STB_EXTERN int stb_box_face_vertex_axis_side(int face_number, int vertex_number, int axis); STB_EXTERN void stb_linear_controller(float *curpos, float target_pos, float acc, float deacc, float dt); STB_EXTERN int stb_float_eq(float x, float y, float delta, int max_ulps); STB_EXTERN int stb_is_prime(unsigned int m); STB_EXTERN unsigned int stb_power_of_two_nearest_prime(int n); STB_EXTERN float stb_smoothstep(float t); STB_EXTERN float stb_cubic_bezier_1d(float t, float p0, float p1, float p2, float p3); STB_EXTERN double stb_linear_remap(double x, double a, double b, double c, double d); #ifdef STB_DEFINE float stb_smoothstep(float t) { return (3 - 2*t)*(t*t); } float stb_cubic_bezier_1d(float t, float p0, float p1, float p2, float p3) { float it = 1-t; return it*it*it*p0 + 3*it*it*t*p1 + 3*it*t*t*p2 + t*t*t*p3; } void stb_newell_normal(float *normal, int num_vert, float **vert, int normalize) { int i,j; float p; normal[0] = normal[1] = normal[2] = 0; for (i=num_vert-1,j=0; j < num_vert; i=j++) { float *u = vert[i]; float *v = vert[j]; normal[0] += (u[1] - v[1]) * (u[2] + v[2]); normal[1] += (u[2] - v[2]) * (u[0] + v[0]); normal[2] += (u[0] - v[0]) * (u[1] + v[1]); } if (normalize) { p = normal[0]*normal[0] + normal[1]*normal[1] + normal[2]*normal[2]; p = (float) (1.0 / sqrt(p)); normal[0] *= p; normal[1] *= p; normal[2] *= p; } } int stb_box_face_vertex_axis_side(int face_number, int vertex_number, int axis) { static int box_vertices[6][4][3] = { { { 1,1,1 }, { 1,0,1 }, { 1,0,0 }, { 1,1,0 } }, { { 0,0,0 }, { 0,0,1 }, { 0,1,1 }, { 0,1,0 } }, { { 0,0,0 }, { 0,1,0 }, { 1,1,0 }, { 1,0,0 } }, { { 0,0,0 }, { 1,0,0 }, { 1,0,1 }, { 0,0,1 } }, { { 1,1,1 }, { 0,1,1 }, { 0,0,1 }, { 1,0,1 } }, { { 1,1,1 }, { 1,1,0 }, { 0,1,0 }, { 0,1,1 } }, }; assert(face_number >= 0 && face_number < 6); assert(vertex_number >= 0 && vertex_number < 4); assert(axis >= 0 && axis < 3); return box_vertices[face_number][vertex_number][axis]; } void stb_linear_controller(float *curpos, float target_pos, float acc, float deacc, float dt) { float sign = 1, p, cp = *curpos; if (cp == target_pos) return; if (target_pos < cp) { target_pos = -target_pos; cp = -cp; sign = -1; } // first decelerate if (cp < 0) { p = cp + deacc * dt; if (p > 0) { p = 0; dt = dt - cp / deacc; if (dt < 0) dt = 0; } else { dt = 0; } cp = p; } // now accelerate p = cp + acc*dt; if (p > target_pos) p = target_pos; *curpos = p * sign; // @TODO: testing } float stb_quadratic_controller(float target_pos, float curpos, float maxvel, float maxacc, float dt, float *curvel) { return 0; // @TODO } int stb_float_eq(float x, float y, float delta, int max_ulps) { if (fabs(x-y) <= delta) return 1; if (abs(*(int *)&x - *(int *)&y) <= max_ulps) return 1; return 0; } int stb_is_prime(unsigned int m) { unsigned int i,j; if (m < 2) return 0; if (m == 2) return 1; if (!(m & 1)) return 0; if (m % 3 == 0) return (m == 3); for (i=5; (j=i*i), j <= m && j > i; i += 6) { if (m % i == 0) return 0; if (m % (i+2) == 0) return 0; } return 1; } unsigned int stb_power_of_two_nearest_prime(int n) { static signed char tab[32] = { 0,0,0,0,1,0,-1,0,1,-1,-1,3,-1,0,-1,2,1, 0,2,0,-1,-4,-1,5,-1,18,-2,15,2,-1,2,0 }; if (!tab[0]) { int i; for (i=0; i < 32; ++i) tab[i] = (1 << i) + 2*tab[i] - 1; tab[1] = 2; tab[0] = 1; } if (n >= 32) return 0xfffffffb; return tab[n]; } double stb_linear_remap(double x, double x_min, double x_max, double out_min, double out_max) { return stb_lerp(stb_unlerp(x,x_min,x_max),out_min,out_max); } #endif // create a macro so it's faster, but you can get at the function pointer #define stb_linear_remap(t,a,b,c,d) stb_lerp(stb_unlerp(t,a,b),c,d) ////////////////////////////////////////////////////////////////////////////// // // bit operations // #define stb_big32(c) (((c)[0]<<24) + (c)[1]*65536 + (c)[2]*256 + (c)[3]) #define stb_little32(c) (((c)[3]<<24) + (c)[2]*65536 + (c)[1]*256 + (c)[0]) #define stb_big16(c) ((c)[0]*256 + (c)[1]) #define stb_little16(c) ((c)[1]*256 + (c)[0]) STB_EXTERN int stb_bitcount(unsigned int a); STB_EXTERN unsigned int stb_bitreverse8(unsigned char n); STB_EXTERN unsigned int stb_bitreverse(unsigned int n); STB_EXTERN int stb_is_pow2(unsigned int n); STB_EXTERN int stb_log2_ceil(unsigned int n); STB_EXTERN int stb_log2_floor(unsigned int n); STB_EXTERN int stb_lowbit8(unsigned int n); STB_EXTERN int stb_highbit8(unsigned int n); #ifdef STB_DEFINE int stb_bitcount(unsigned int a) { a = (a & 0x55555555) + ((a >> 1) & 0x55555555); // max 2 a = (a & 0x33333333) + ((a >> 2) & 0x33333333); // max 4 a = (a + (a >> 4)) & 0x0f0f0f0f; // max 8 per 4, now 8 bits a = (a + (a >> 8)); // max 16 per 8 bits a = (a + (a >> 16)); // max 32 per 8 bits return a & 0xff; } unsigned int stb_bitreverse8(unsigned char n) { n = ((n & 0xAA) >> 1) + ((n & 0x55) << 1); n = ((n & 0xCC) >> 2) + ((n & 0x33) << 2); return (unsigned char) ((n >> 4) + (n << 4)); } unsigned int stb_bitreverse(unsigned int n) { n = ((n & 0xAAAAAAAA) >> 1) | ((n & 0x55555555) << 1); n = ((n & 0xCCCCCCCC) >> 2) | ((n & 0x33333333) << 2); n = ((n & 0xF0F0F0F0) >> 4) | ((n & 0x0F0F0F0F) << 4); n = ((n & 0xFF00FF00) >> 8) | ((n & 0x00FF00FF) << 8); return (n >> 16) | (n << 16); } int stb_is_pow2(unsigned int n) { return (n & (n-1)) == 0; } // tricky use of 4-bit table to identify 5 bit positions (note the '-1') // 3-bit table would require another tree level; 5-bit table wouldn't save one #if defined(_WIN32) && !defined(__MINGW32__) #pragma warning(push) #pragma warning(disable: 4035) // disable warning about no return value int stb_log2_floor(unsigned int n) { #if _MSC_VER > 1700 unsigned long i; _BitScanReverse(&i, n); return i != 0 ? i : -1; #else __asm { bsr eax,n jnz done mov eax,-1 } done:; #endif } #pragma warning(pop) #else int stb_log2_floor(unsigned int n) { static signed char log2_4[16] = { -1,0,1,1,2,2,2,2,3,3,3,3,3,3,3,3 }; // 2 compares if n < 16, 3 compares otherwise if (n < (1U << 14)) if (n < (1U << 4)) return 0 + log2_4[n ]; else if (n < (1U << 9)) return 5 + log2_4[n >> 5]; else return 10 + log2_4[n >> 10]; else if (n < (1U << 24)) if (n < (1U << 19)) return 15 + log2_4[n >> 15]; else return 20 + log2_4[n >> 20]; else if (n < (1U << 29)) return 25 + log2_4[n >> 25]; else return 30 + log2_4[n >> 30]; } #endif // define ceil from floor int stb_log2_ceil(unsigned int n) { if (stb_is_pow2(n)) return stb_log2_floor(n); else return 1 + stb_log2_floor(n); } int stb_highbit8(unsigned int n) { return stb_log2_ceil(n&255); } int stb_lowbit8(unsigned int n) { static signed char lowbit4[16] = { -1,0,1,0, 2,0,1,0, 3,0,1,0, 2,0,1,0 }; int k = lowbit4[n & 15]; if (k >= 0) return k; k = lowbit4[(n >> 4) & 15]; if (k >= 0) return k+4; return k; } #endif ////////////////////////////////////////////////////////////////////////////// // // qsort Compare Routines // #ifdef _WIN32 #define stb_stricmp(a,b) stricmp(a,b) #define stb_strnicmp(a,b,n) strnicmp(a,b,n) #else #define stb_stricmp(a,b) strcasecmp(a,b) #define stb_strnicmp(a,b,n) strncasecmp(a,b,n) #endif STB_EXTERN int (*stb_intcmp(int offset))(const void *a, const void *b); STB_EXTERN int (*stb_qsort_strcmp(int offset))(const void *a, const void *b); STB_EXTERN int (*stb_qsort_stricmp(int offset))(const void *a, const void *b); STB_EXTERN int (*stb_floatcmp(int offset))(const void *a, const void *b); STB_EXTERN int (*stb_doublecmp(int offset))(const void *a, const void *b); STB_EXTERN int (*stb_charcmp(int offset))(const void *a, const void *b); #ifdef STB_DEFINE static int stb__intcmpoffset, stb__charcmpoffset, stb__strcmpoffset; static int stb__floatcmpoffset, stb__doublecmpoffset; int stb__intcmp(const void *a, const void *b) { const int p = *(const int *) ((const char *) a + stb__intcmpoffset); const int q = *(const int *) ((const char *) b + stb__intcmpoffset); return p < q ? -1 : p > q; } int stb__charcmp(const void *a, const void *b) { const int p = *(const unsigned char *) ((const char *) a + stb__charcmpoffset); const int q = *(const unsigned char *) ((const char *) b + stb__charcmpoffset); return p < q ? -1 : p > q; } int stb__floatcmp(const void *a, const void *b) { const float p = *(const float *) ((const char *) a + stb__floatcmpoffset); const float q = *(const float *) ((const char *) b + stb__floatcmpoffset); return p < q ? -1 : p > q; } int stb__doublecmp(const void *a, const void *b) { const double p = *(const double *) ((const char *) a + stb__doublecmpoffset); const double q = *(const double *) ((const char *) b + stb__doublecmpoffset); return p < q ? -1 : p > q; } int stb__qsort_strcmp(const void *a, const void *b) { const char *p = *(const char **) ((const char *) a + stb__strcmpoffset); const char *q = *(const char **) ((const char *) b + stb__strcmpoffset); return strcmp(p,q); } int stb__qsort_stricmp(const void *a, const void *b) { const char *p = *(const char **) ((const char *) a + stb__strcmpoffset); const char *q = *(const char **) ((const char *) b + stb__strcmpoffset); return stb_stricmp(p,q); } int (*stb_intcmp(int offset))(const void *, const void *) { stb__intcmpoffset = offset; return &stb__intcmp; } int (*stb_charcmp(int offset))(const void *, const void *) { stb__charcmpoffset = offset; return &stb__charcmp; } int (*stb_qsort_strcmp(int offset))(const void *, const void *) { stb__strcmpoffset = offset; return &stb__qsort_strcmp; } int (*stb_qsort_stricmp(int offset))(const void *, const void *) { stb__strcmpoffset = offset; return &stb__qsort_stricmp; } int (*stb_floatcmp(int offset))(const void *, const void *) { stb__floatcmpoffset = offset; return &stb__floatcmp; } int (*stb_doublecmp(int offset))(const void *, const void *) { stb__doublecmpoffset = offset; return &stb__doublecmp; } #endif ////////////////////////////////////////////////////////////////////////////// // // Binary Search Toolkit // typedef struct { int minval, maxval, guess; int mode, step; } stb_search; STB_EXTERN int stb_search_binary(stb_search *s, int minv, int maxv, int find_smallest); STB_EXTERN int stb_search_open(stb_search *s, int minv, int find_smallest); STB_EXTERN int stb_probe(stb_search *s, int compare, int *result); // return 0 when done #ifdef STB_DEFINE enum { STB_probe_binary_smallest, STB_probe_binary_largest, STB_probe_open_smallest, STB_probe_open_largest, }; static int stb_probe_guess(stb_search *s, int *result) { switch(s->mode) { case STB_probe_binary_largest: if (s->minval == s->maxval) { *result = s->minval; return 0; } assert(s->minval < s->maxval); // if a < b, then a < p <= b s->guess = s->minval + (((unsigned) s->maxval - s->minval + 1) >> 1); break; case STB_probe_binary_smallest: if (s->minval == s->maxval) { *result = s->minval; return 0; } assert(s->minval < s->maxval); // if a < b, then a <= p < b s->guess = s->minval + (((unsigned) s->maxval - s->minval) >> 1); break; case STB_probe_open_smallest: case STB_probe_open_largest: s->guess = s->maxval; // guess the current maxval break; } *result = s->guess; return 1; } int stb_probe(stb_search *s, int compare, int *result) { switch(s->mode) { case STB_probe_open_smallest: case STB_probe_open_largest: { if (compare <= 0) { // then it lies within minval & maxval if (s->mode == STB_probe_open_smallest) s->mode = STB_probe_binary_smallest; else s->mode = STB_probe_binary_largest; } else { // otherwise, we need to probe larger s->minval = s->maxval + 1; s->maxval = s->minval + s->step; s->step += s->step; } break; } case STB_probe_binary_smallest: { // if compare < 0, then s->minval <= a < p // if compare = 0, then s->minval <= a <= p // if compare > 0, then p < a <= s->maxval if (compare <= 0) s->maxval = s->guess; else s->minval = s->guess+1; break; } case STB_probe_binary_largest: { // if compare < 0, then s->minval <= a < p // if compare = 0, then p <= a <= s->maxval // if compare > 0, then p < a <= s->maxval if (compare < 0) s->maxval = s->guess-1; else s->minval = s->guess; break; } } return stb_probe_guess(s, result); } int stb_search_binary(stb_search *s, int minv, int maxv, int find_smallest) { int r; if (maxv < minv) return minv-1; s->minval = minv; s->maxval = maxv; s->mode = find_smallest ? STB_probe_binary_smallest : STB_probe_binary_largest; stb_probe_guess(s, &r); return r; } int stb_search_open(stb_search *s, int minv, int find_smallest) { int r; s->step = 4; s->minval = minv; s->maxval = minv+s->step; s->mode = find_smallest ? STB_probe_open_smallest : STB_probe_open_largest; stb_probe_guess(s, &r); return r; } #endif ////////////////////////////////////////////////////////////////////////////// // // String Processing // #define stb_prefixi(s,t) (0==stb_strnicmp((s),(t),strlen(t))) enum stb_splitpath_flag { STB_PATH = 1, STB_FILE = 2, STB_EXT = 4, STB_PATH_FILE = STB_PATH + STB_FILE, STB_FILE_EXT = STB_FILE + STB_EXT, STB_EXT_NO_PERIOD = 8, }; STB_EXTERN char * stb_skipwhite(char *s); STB_EXTERN char * stb_trimwhite(char *s); STB_EXTERN char * stb_skipnewline(char *s); STB_EXTERN char * stb_strncpy(char *s, char *t, int n); STB_EXTERN char * stb_substr(char *t, int n); STB_EXTERN char * stb_duplower(char *s); STB_EXTERN void stb_tolower (char *s); STB_EXTERN char * stb_strchr2 (char *s, char p1, char p2); STB_EXTERN char * stb_strrchr2(char *s, char p1, char p2); STB_EXTERN char * stb_strtok(char *output, char *src, char *delimit); STB_EXTERN char * stb_strtok_keep(char *output, char *src, char *delimit); STB_EXTERN char * stb_strtok_invert(char *output, char *src, char *allowed); STB_EXTERN char * stb_dupreplace(char *s, char *find, char *replace); STB_EXTERN void stb_replaceinplace(char *s, char *find, char *replace); STB_EXTERN char * stb_splitpath(char *output, char *src, int flag); STB_EXTERN char * stb_splitpathdup(char *src, int flag); STB_EXTERN char * stb_replacedir(char *output, char *src, char *dir); STB_EXTERN char * stb_replaceext(char *output, char *src, char *ext); STB_EXTERN void stb_fixpath(char *path); STB_EXTERN char * stb_shorten_path_readable(char *path, int max_len); STB_EXTERN int stb_suffix (char *s, char *t); STB_EXTERN int stb_suffixi(char *s, char *t); STB_EXTERN int stb_prefix (char *s, char *t); STB_EXTERN char * stb_strichr(char *s, char t); STB_EXTERN char * stb_stristr(char *s, char *t); STB_EXTERN int stb_prefix_count(char *s, char *t); STB_EXTERN char * stb_plural(int n); // "s" or "" STB_EXTERN size_t stb_strscpy(char *d, const char *s, size_t n); STB_EXTERN char **stb_tokens(char *src, char *delimit, int *count); STB_EXTERN char **stb_tokens_nested(char *src, char *delimit, int *count, char *nest_in, char *nest_out); STB_EXTERN char **stb_tokens_nested_empty(char *src, char *delimit, int *count, char *nest_in, char *nest_out); STB_EXTERN char **stb_tokens_allowempty(char *src, char *delimit, int *count); STB_EXTERN char **stb_tokens_stripwhite(char *src, char *delimit, int *count); STB_EXTERN char **stb_tokens_withdelim(char *src, char *delimit, int *count); STB_EXTERN char **stb_tokens_quoted(char *src, char *delimit, int *count); // with 'quoted', allow delimiters to appear inside quotation marks, and don't // strip whitespace inside them (and we delete the quotation marks unless they // appear back to back, in which case they're considered escaped) #ifdef STB_DEFINE size_t stb_strscpy(char *d, const char *s, size_t n) { size_t len = strlen(s); if (len >= n) { if (n) d[0] = 0; return 0; } strcpy(d,s); return len + 1; } char *stb_plural(int n) { return n == 1 ? "" : "s"; } int stb_prefix(char *s, char *t) { while (*t) if (*s++ != *t++) return STB_FALSE; return STB_TRUE; } int stb_prefix_count(char *s, char *t) { int c=0; while (*t) { if (*s++ != *t++) break; ++c; } return c; } int stb_suffix(char *s, char *t) { size_t n = strlen(s); size_t m = strlen(t); if (m <= n) return 0 == strcmp(s+n-m, t); else return 0; } int stb_suffixi(char *s, char *t) { size_t n = strlen(s); size_t m = strlen(t); if (m <= n) return 0 == stb_stricmp(s+n-m, t); else return 0; } // originally I was using this table so that I could create known sentinel // values--e.g. change whitetable[0] to be true if I was scanning for whitespace, // and false if I was scanning for nonwhite. I don't appear to be using that // functionality anymore (I do for tokentable, though), so just replace it // with isspace() char *stb_skipwhite(char *s) { while (isspace((unsigned char) *s)) ++s; return s; } char *stb_skipnewline(char *s) { if (s[0] == '\r' || s[0] == '\n') { if (s[0]+s[1] == '\r' + '\n') ++s; ++s; } return s; } char *stb_trimwhite(char *s) { int i,n; s = stb_skipwhite(s); n = (int) strlen(s); for (i=n-1; i >= 0; --i) if (!isspace(s[i])) break; s[i+1] = 0; return s; } char *stb_strncpy(char *s, char *t, int n) { strncpy(s,t,n); s[n-1] = 0; return s; } char *stb_substr(char *t, int n) { char *a; int z = (int) strlen(t); if (z < n) n = z; a = (char *) malloc(n+1); strncpy(a,t,n); a[n] = 0; return a; } char *stb_duplower(char *s) { char *p = strdup(s), *q = p; while (*q) { *q = tolower(*q); ++q; } return p; } void stb_tolower(char *s) { while (*s) { *s = tolower(*s); ++s; } } char *stb_strchr2(char *s, char x, char y) { for(; *s; ++s) if (*s == x || *s == y) return s; return NULL; } char *stb_strrchr2(char *s, char x, char y) { char *r = NULL; for(; *s; ++s) if (*s == x || *s == y) r = s; return r; } char *stb_strichr(char *s, char t) { if (tolower(t) == toupper(t)) return strchr(s,t); return stb_strchr2(s, (char) tolower(t), (char) toupper(t)); } char *stb_stristr(char *s, char *t) { size_t n = strlen(t); char *z; if (n==0) return s; while ((z = stb_strichr(s, *t)) != NULL) { if (0==stb_strnicmp(z, t, n)) return z; s = z+1; } return NULL; } static char *stb_strtok_raw(char *output, char *src, char *delimit, int keep, int invert) { if (invert) { while (*src && strchr(delimit, *src) != NULL) { *output++ = *src++; } } else { while (*src && strchr(delimit, *src) == NULL) { *output++ = *src++; } } *output = 0; if (keep) return src; else return *src ? src+1 : src; } char *stb_strtok(char *output, char *src, char *delimit) { return stb_strtok_raw(output, src, delimit, 0, 0); } char *stb_strtok_keep(char *output, char *src, char *delimit) { return stb_strtok_raw(output, src, delimit, 1, 0); } char *stb_strtok_invert(char *output, char *src, char *delimit) { return stb_strtok_raw(output, src, delimit, 1,1); } static char **stb_tokens_raw(char *src_, char *delimit, int *count, int stripwhite, int allow_empty, char *start, char *end) { int nested = 0; unsigned char *src = (unsigned char *) src_; static char stb_tokentable[256]; // rely on static initializion to 0 static char stable[256],etable[256]; char *out; char **result; int num=0; unsigned char *s; s = (unsigned char *) delimit; while (*s) stb_tokentable[*s++] = 1; if (start) { s = (unsigned char *) start; while (*s) stable[*s++] = 1; s = (unsigned char *) end; if (s) while (*s) stable[*s++] = 1; s = (unsigned char *) end; if (s) while (*s) etable[*s++] = 1; } stable[0] = 1; // two passes through: the first time, counting how many s = (unsigned char *) src; while (*s) { // state: just found delimiter // skip further delimiters if (!allow_empty) { stb_tokentable[0] = 0; while (stb_tokentable[*s]) ++s; if (!*s) break; } ++num; // skip further non-delimiters stb_tokentable[0] = 1; if (stripwhite == 2) { // quoted strings while (!stb_tokentable[*s]) { if (*s != '"') ++s; else { ++s; if (*s == '"') ++s; // "" -> ", not start a string else { // begin a string while (*s) { if (s[0] == '"') { if (s[1] == '"') s += 2; // "" -> " else { ++s; break; } // terminating " } else ++s; } } } } } else while (nested || !stb_tokentable[*s]) { if (stable[*s]) { if (!*s) break; if (end ? etable[*s] : nested) --nested; else ++nested; } ++s; } if (allow_empty) { if (*s) ++s; } } // now num has the actual count... malloc our output structure // need space for all the strings: strings won't be any longer than // original input, since for every '\0' there's at least one delimiter result = (char **) malloc(sizeof(*result) * (num+1) + (s-src+1)); if (result == NULL) return result; out = (char *) (result + (num+1)); // second pass: copy out the data s = (unsigned char *) src; num = 0; nested = 0; while (*s) { char *last_nonwhite; // state: just found delimiter // skip further delimiters if (!allow_empty) { stb_tokentable[0] = 0; if (stripwhite) while (stb_tokentable[*s] || isspace(*s)) ++s; else while (stb_tokentable[*s]) ++s; } else if (stripwhite) { while (isspace(*s)) ++s; } if (!*s) break; // we're past any leading delimiters and whitespace result[num] = out; ++num; // copy non-delimiters stb_tokentable[0] = 1; last_nonwhite = out-1; if (stripwhite == 2) { while (!stb_tokentable[*s]) { if (*s != '"') { if (!isspace(*s)) last_nonwhite = out; *out++ = *s++; } else { ++s; if (*s == '"') { if (!isspace(*s)) last_nonwhite = out; *out++ = *s++; // "" -> ", not start string } else { // begin a quoted string while (*s) { if (s[0] == '"') { if (s[1] == '"') { *out++ = *s; s += 2; } else { ++s; break; } // terminating " } else *out++ = *s++; } last_nonwhite = out-1; // all in quotes counts as non-white } } } } else { while (nested || !stb_tokentable[*s]) { if (!isspace(*s)) last_nonwhite = out; if (stable[*s]) { if (!*s) break; if (end ? etable[*s] : nested) --nested; else ++nested; } *out++ = *s++; } } if (stripwhite) // rewind to last non-whitespace char out = last_nonwhite+1; *out++ = '\0'; if (*s) ++s; // skip delimiter } s = (unsigned char *) delimit; while (*s) stb_tokentable[*s++] = 0; if (start) { s = (unsigned char *) start; while (*s) stable[*s++] = 1; s = (unsigned char *) end; if (s) while (*s) stable[*s++] = 1; s = (unsigned char *) end; if (s) while (*s) etable[*s++] = 1; } if (count != NULL) *count = num; result[num] = 0; return result; } char **stb_tokens(char *src, char *delimit, int *count) { return stb_tokens_raw(src,delimit,count,0,0,0,0); } char **stb_tokens_nested(char *src, char *delimit, int *count, char *nest_in, char *nest_out) { return stb_tokens_raw(src,delimit,count,0,0,nest_in,nest_out); } char **stb_tokens_nested_empty(char *src, char *delimit, int *count, char *nest_in, char *nest_out) { return stb_tokens_raw(src,delimit,count,0,1,nest_in,nest_out); } char **stb_tokens_allowempty(char *src, char *delimit, int *count) { return stb_tokens_raw(src,delimit,count,0,1,0,0); } char **stb_tokens_stripwhite(char *src, char *delimit, int *count) { return stb_tokens_raw(src,delimit,count,1,1,0,0); } char **stb_tokens_quoted(char *src, char *delimit, int *count) { return stb_tokens_raw(src,delimit,count,2,1,0,0); } char *stb_dupreplace(char *src, char *find, char *replace) { size_t len_find = strlen(find); size_t len_replace = strlen(replace); int count = 0; char *s,*p,*q; s = strstr(src, find); if (s == NULL) return strdup(src); do { ++count; s = strstr(s + len_find, find); } while (s != NULL); p = (char *) malloc(strlen(src) + count * (len_replace - len_find) + 1); if (p == NULL) return p; q = p; s = src; for (;;) { char *t = strstr(s, find); if (t == NULL) { strcpy(q,s); assert(strlen(p) == strlen(src) + count*(len_replace-len_find)); return p; } memcpy(q, s, t-s); q += t-s; memcpy(q, replace, len_replace); q += len_replace; s = t + len_find; } } void stb_replaceinplace(char *src, char *find, char *replace) { size_t len_find = strlen(find); size_t len_replace = strlen(replace); int delta; char *s,*p,*q; delta = len_replace - len_find; assert(delta <= 0); if (delta > 0) return; p = strstr(src, find); if (p == NULL) return; s = q = p; while (*s) { memcpy(q, replace, len_replace); p += len_find; q += len_replace; s = strstr(p, find); if (s == NULL) s = p + strlen(p); memmove(q, p, s-p); q += s-p; p = s; } *q = 0; } void stb_fixpath(char *path) { for(; *path; ++path) if (*path == '\\') *path = '/'; } void stb__add_section(char *buffer, char *data, int curlen, int newlen) { if (newlen < curlen) { int z1 = newlen >> 1, z2 = newlen-z1; memcpy(buffer, data, z1-1); buffer[z1-1] = '.'; buffer[z1-0] = '.'; memcpy(buffer+z1+1, data+curlen-z2+1, z2-1); } else memcpy(buffer, data, curlen); } char * stb_shorten_path_readable(char *path, int len) { static char buffer[1024]; int n = strlen(path),n1,n2,r1,r2; char *s; if (n <= len) return path; if (len > 1024) return path; s = stb_strrchr2(path, '/', '\\'); if (s) { n1 = s - path + 1; n2 = n - n1; ++s; } else { n1 = 0; n2 = n; s = path; } // now we need to reduce r1 and r2 so that they fit in len if (n1 < len>>1) { r1 = n1; r2 = len - r1; } else if (n2 < len >> 1) { r2 = n2; r1 = len - r2; } else { r1 = n1 * len / n; r2 = n2 * len / n; if (r1 < len>>2) r1 = len>>2, r2 = len-r1; if (r2 < len>>2) r2 = len>>2, r1 = len-r2; } assert(r1 <= n1 && r2 <= n2); if (n1) stb__add_section(buffer, path, n1, r1); stb__add_section(buffer+r1, s, n2, r2); buffer[len] = 0; return buffer; } static char *stb__splitpath_raw(char *buffer, char *path, int flag) { int len=0,x,y, n = (int) strlen(path), f1,f2; char *s = stb_strrchr2(path, '/', '\\'); char *t = strrchr(path, '.'); if (s && t && t < s) t = NULL; if (s) ++s; if (flag == STB_EXT_NO_PERIOD) flag |= STB_EXT; if (!(flag & (STB_PATH | STB_FILE | STB_EXT))) return NULL; f1 = s == NULL ? 0 : s-path; // start of filename f2 = t == NULL ? n : t-path; // just past end of filename if (flag & STB_PATH) { x = 0; if (f1 == 0 && flag == STB_PATH) len=2; } else if (flag & STB_FILE) { x = f1; } else { x = f2; if (flag & STB_EXT_NO_PERIOD) if (buffer[x] == '.') ++x; } if (flag & STB_EXT) y = n; else if (flag & STB_FILE) y = f2; else y = f1; if (buffer == NULL) { buffer = (char *) malloc(y-x + len + 1); if (!buffer) return NULL; } if (len) { strcpy(buffer, "./"); return buffer; } strncpy(buffer, path+x, y-x); buffer[y-x] = 0; return buffer; } char *stb_splitpath(char *output, char *src, int flag) { return stb__splitpath_raw(output, src, flag); } char *stb_splitpathdup(char *src, int flag) { return stb__splitpath_raw(NULL, src, flag); } char *stb_replacedir(char *output, char *src, char *dir) { char buffer[4096]; stb_splitpath(buffer, src, STB_FILE | STB_EXT); if (dir) sprintf(output, "%s/%s", dir, buffer); else strcpy(output, buffer); return output; } char *stb_replaceext(char *output, char *src, char *ext) { char buffer[4096]; stb_splitpath(buffer, src, STB_PATH | STB_FILE); if (ext) sprintf(output, "%s.%s", buffer, ext[0] == '.' ? ext+1 : ext); else strcpy(output, buffer); return output; } #endif ////////////////////////////////////////////////////////////////////////////// // // stb_alloc - hierarchical allocator // // inspired by http://swapped.cc/halloc // // // When you alloc a given block through stb_alloc, you have these choices: // // 1. does it have a parent? // 2. can it have children? // 3. can it be freed directly? // 4. is it transferrable? // 5. what is its alignment? // // Here are interesting combinations of those: // // children free transfer alignment // arena Y Y N n/a // no-overhead, chunked N N N normal // string pool alloc N N N 1 // parent-ptr, chunked Y N N normal // low-overhead, unchunked N Y Y normal // general purpose alloc Y Y Y normal // // Unchunked allocations will probably return 16-aligned pointers. If // we 16-align the results, we have room for 4 pointers. For smaller // allocations that allow finer alignment, we can reduce the pointers. // // The strategy is that given a pointer, assuming it has a header (only // the no-overhead allocations have no header), we can determine the // type of the header fields, and the number of them, by stepping backwards // through memory and looking at the tags in the bottom bits. // // Implementation strategy: // chunked allocations come from the middle of chunks, and can't // be freed. thefore they do not need to be on a sibling chain. // they may need child pointers if they have children. // // chunked, with-children // void *parent; // // unchunked, no-children -- reduced storage // void *next_sibling; // void *prev_sibling_nextp; // // unchunked, general // void *first_child; // void *next_sibling; // void *prev_sibling_nextp; // void *chunks; // // so, if we code each of these fields with different bit patterns // (actually same one for next/prev/child), then we can identify which // each one is from the last field. STB_EXTERN void stb_free(void *p); STB_EXTERN void *stb_malloc_global(size_t size); STB_EXTERN void *stb_malloc(void *context, size_t size); STB_EXTERN void *stb_malloc_nofree(void *context, size_t size); STB_EXTERN void *stb_malloc_leaf(void *context, size_t size); STB_EXTERN void *stb_malloc_raw(void *context, size_t size); STB_EXTERN void *stb_realloc(void *ptr, size_t newsize); STB_EXTERN void stb_reassign(void *new_context, void *ptr); STB_EXTERN void stb_malloc_validate(void *p, void *parent); extern int stb_alloc_chunk_size ; extern int stb_alloc_count_free ; extern int stb_alloc_count_alloc; extern int stb_alloc_alignment ; #ifdef STB_DEFINE int stb_alloc_chunk_size = 65536; int stb_alloc_count_free = 0; int stb_alloc_count_alloc = 0; int stb_alloc_alignment = -16; typedef struct stb__chunk { struct stb__chunk *next; int data_left; int alloc; } stb__chunk; typedef struct { void * next; void ** prevn; } stb__nochildren; typedef struct { void ** prevn; void * child; void * next; stb__chunk *chunks; } stb__alloc; typedef struct { stb__alloc *parent; } stb__chunked; #define STB__PARENT 1 #define STB__CHUNKS 2 typedef enum { STB__nochildren = 0, STB__chunked = STB__PARENT, STB__alloc = STB__CHUNKS, STB__chunk_raw = 4, } stb__alloc_type; // these functions set the bottom bits of a pointer efficiently #define STB__DECODE(x,v) ((void *) ((char *) (x) - (v))) #define STB__ENCODE(x,v) ((void *) ((char *) (x) + (v))) #define stb__parent(z) (stb__alloc *) STB__DECODE((z)->parent, STB__PARENT) #define stb__chunks(z) (stb__chunk *) STB__DECODE((z)->chunks, STB__CHUNKS) #define stb__setparent(z,p) (z)->parent = (stb__alloc *) STB__ENCODE((p), STB__PARENT) #define stb__setchunks(z,c) (z)->chunks = (stb__chunk *) STB__ENCODE((c), STB__CHUNKS) static stb__alloc stb__alloc_global = { NULL, NULL, NULL, (stb__chunk *) STB__ENCODE(NULL, STB__CHUNKS) }; static stb__alloc_type stb__identify(void *p) { void **q = (void **) p; return (stb__alloc_type) ((stb_uinta) q[-1] & 3); } static void *** stb__prevn(void *p) { if (stb__identify(p) == STB__alloc) { stb__alloc *s = (stb__alloc *) p - 1; return &s->prevn; } else { stb__nochildren *s = (stb__nochildren *) p - 1; return &s->prevn; } } void stb_free(void *p) { if (p == NULL) return; // count frees so that unit tests can see what's happening ++stb_alloc_count_free; switch(stb__identify(p)) { case STB__chunked: // freeing a chunked-block with children does nothing; // they only get freed when the parent does // surely this is wrong, and it should free them immediately? // otherwise how are they getting put on the right chain? return; case STB__nochildren: { stb__nochildren *s = (stb__nochildren *) p - 1; // unlink from sibling chain *(s->prevn) = s->next; if (s->next) *stb__prevn(s->next) = s->prevn; free(s); return; } case STB__alloc: { stb__alloc *s = (stb__alloc *) p - 1; stb__chunk *c, *n; void *q; // unlink from sibling chain, if any *(s->prevn) = s->next; if (s->next) *stb__prevn(s->next) = s->prevn; // first free chunks c = (stb__chunk *) stb__chunks(s); while (c != NULL) { n = c->next; stb_alloc_count_free += c->alloc; free(c); c = n; } // validating stb__setchunks(s,NULL); s->prevn = NULL; s->next = NULL; // now free children while ((q = s->child) != NULL) { stb_free(q); } // now free self free(s); return; } default: assert(0); /* NOTREACHED */ } } void stb_malloc_validate(void *p, void *parent) { if (p == NULL) return; switch(stb__identify(p)) { case STB__chunked: return; case STB__nochildren: { stb__nochildren *n = (stb__nochildren *) p - 1; if (n->prevn) assert(*n->prevn == p); if (n->next) { assert(*stb__prevn(n->next) == &n->next); stb_malloc_validate(n, parent); } return; } case STB__alloc: { stb__alloc *s = (stb__alloc *) p - 1; if (s->prevn) assert(*s->prevn == p); if (s->child) { assert(*stb__prevn(s->child) == &s->child); stb_malloc_validate(s->child, p); } if (s->next) { assert(*stb__prevn(s->next) == &s->next); stb_malloc_validate(s->next, parent); } return; } default: assert(0); /* NOTREACHED */ } } static void * stb__try_chunk(stb__chunk *c, int size, int align, int pre_align) { char *memblock = (char *) (c+1), *q; stb_inta iq; int start_offset; // we going to allocate at the end of the chunk, not the start. confusing, // but it means we don't need both a 'limit' and a 'cur', just a 'cur'. // the block ends at: p + c->data_left // then we move back by size start_offset = c->data_left - size; // now we need to check the alignment of that q = memblock + start_offset; iq = (stb_inta) q; assert(sizeof(q) == sizeof(iq)); // suppose align = 2 // then we need to retreat iq far enough that (iq & (2-1)) == 0 // to get (iq & (align-1)) = 0 requires subtracting (iq & (align-1)) start_offset -= iq & (align-1); assert(((stb_uinta) (memblock+start_offset) & (align-1)) == 0); // now, if that + pre_align works, go for it! start_offset -= pre_align; if (start_offset >= 0) { c->data_left = start_offset; return memblock + start_offset; } return NULL; } static void stb__sort_chunks(stb__alloc *src) { // of the first two chunks, put the chunk with more data left in it first stb__chunk *c = stb__chunks(src), *d; if (c == NULL) return; d = c->next; if (d == NULL) return; if (c->data_left > d->data_left) return; c->next = d->next; d->next = c; stb__setchunks(src, d); } static void * stb__alloc_chunk(stb__alloc *src, int size, int align, int pre_align) { void *p; stb__chunk *c = stb__chunks(src); if (c && size <= stb_alloc_chunk_size) { p = stb__try_chunk(c, size, align, pre_align); if (p) { ++c->alloc; return p; } // try a second chunk to reduce wastage if (c->next) { p = stb__try_chunk(c->next, size, align, pre_align); if (p) { ++c->alloc; return p; } // put the bigger chunk first, since the second will get buried // the upshot of this is that, until it gets allocated from, chunk #2 // is always the largest remaining chunk. (could formalize // this with a heap!) stb__sort_chunks(src); c = stb__chunks(src); } } // allocate a new chunk { stb__chunk *n; int chunk_size = stb_alloc_chunk_size; // we're going to allocate a new chunk to put this in if (size > chunk_size) chunk_size = size; assert(sizeof(*n) + pre_align <= 16); // loop trying to allocate a large enough chunk // the loop is because the alignment may cause problems if it's big... // and we don't know what our chunk alignment is going to be while (1) { n = (stb__chunk *) malloc(16 + chunk_size); if (n == NULL) return NULL; n->data_left = chunk_size - sizeof(*n); p = stb__try_chunk(n, size, align, pre_align); if (p != NULL) { n->next = c; stb__setchunks(src, n); // if we just used up the whole block immediately, // move the following chunk up n->alloc = 1; if (size == chunk_size) stb__sort_chunks(src); return p; } free(n); chunk_size += 16+align; } } } static stb__alloc * stb__get_context(void *context) { if (context == NULL) { return &stb__alloc_global; } else { int u = stb__identify(context); // if context is chunked, grab parent if (u == STB__chunked) { stb__chunked *s = (stb__chunked *) context - 1; return stb__parent(s); } else { return (stb__alloc *) context - 1; } } } static void stb__insert_alloc(stb__alloc *src, stb__alloc *s) { s->prevn = &src->child; s->next = src->child; src->child = s+1; if (s->next) *stb__prevn(s->next) = &s->next; } static void stb__insert_nochild(stb__alloc *src, stb__nochildren *s) { s->prevn = &src->child; s->next = src->child; src->child = s+1; if (s->next) *stb__prevn(s->next) = &s->next; } static void * malloc_base(void *context, size_t size, stb__alloc_type t, int align) { void *p; stb__alloc *src = stb__get_context(context); if (align <= 0) { // compute worst-case C packed alignment // e.g. a 24-byte struct is 8-aligned int align_proposed = 1 << stb_lowbit8(size); if (align_proposed < 0) align_proposed = 4; if (align_proposed == 0) { if (size == 0) align_proposed = 1; else align_proposed = 256; } // a negative alignment means 'don't align any larger // than this'; so -16 means we align 1,2,4,8, or 16 if (align < 0) { if (align_proposed > -align) align_proposed = -align; } align = align_proposed; } assert(stb_is_pow2(align)); // don't cause misalignment when allocating nochildren if (t == STB__nochildren && align > 8) t = STB__alloc; switch (t) { case STB__alloc: { stb__alloc *s = (stb__alloc *) malloc(size + sizeof(*s)); if (s == NULL) return NULL; p = s+1; s->child = NULL; stb__insert_alloc(src, s); stb__setchunks(s,NULL); break; } case STB__nochildren: { stb__nochildren *s = (stb__nochildren *) malloc(size + sizeof(*s)); if (s == NULL) return NULL; p = s+1; stb__insert_nochild(src, s); break; } case STB__chunk_raw: { p = stb__alloc_chunk(src, size, align, 0); if (p == NULL) return NULL; break; } case STB__chunked: { stb__chunked *s; if (align < sizeof(stb_uintptr)) align = sizeof(stb_uintptr); s = (stb__chunked *) stb__alloc_chunk(src, size, align, sizeof(*s)); if (s == NULL) return NULL; stb__setparent(s, src); p = s+1; break; } default: p = NULL; assert(0); /* NOTREACHED */ } ++stb_alloc_count_alloc; return p; } void *stb_malloc_global(size_t size) { return malloc_base(NULL, size, STB__alloc, stb_alloc_alignment); } void *stb_malloc(void *context, size_t size) { return malloc_base(context, size, STB__alloc, stb_alloc_alignment); } void *stb_malloc_nofree(void *context, size_t size) { return malloc_base(context, size, STB__chunked, stb_alloc_alignment); } void *stb_malloc_leaf(void *context, size_t size) { return malloc_base(context, size, STB__nochildren, stb_alloc_alignment); } void *stb_malloc_raw(void *context, size_t size) { return malloc_base(context, size, STB__chunk_raw, stb_alloc_alignment); } char *stb_malloc_string(void *context, size_t size) { return (char *) malloc_base(context, size, STB__chunk_raw, 1); } void *stb_realloc(void *ptr, size_t newsize) { stb__alloc_type t; if (ptr == NULL) return stb_malloc(NULL, newsize); if (newsize == 0) { stb_free(ptr); return NULL; } t = stb__identify(ptr); assert(t == STB__alloc || t == STB__nochildren); if (t == STB__alloc) { stb__alloc *s = (stb__alloc *) ptr - 1; s = (stb__alloc *) realloc(s, newsize + sizeof(*s)); if (s == NULL) return NULL; ptr = s+1; // update pointers (*s->prevn) = ptr; if (s->next) *stb__prevn(s->next) = &s->next; if (s->child) *stb__prevn(s->child) = &s->child; return ptr; } else { stb__nochildren *s = (stb__nochildren *) ptr - 1; s = (stb__nochildren *) realloc(ptr, newsize + sizeof(s)); if (s == NULL) return NULL; // update pointers (*s->prevn) = s+1; if (s->next) *stb__prevn(s->next) = &s->next; return s+1; } } void *stb_realloc_c(void *context, void *ptr, size_t newsize) { if (ptr == NULL) return stb_malloc(context, newsize); if (newsize == 0) { stb_free(ptr); return NULL; } // @TODO: verify you haven't changed contexts return stb_realloc(ptr, newsize); } void stb_reassign(void *new_context, void *ptr) { stb__alloc *src = stb__get_context(new_context); stb__alloc_type t = stb__identify(ptr); assert(t == STB__alloc || t == STB__nochildren); if (t == STB__alloc) { stb__alloc *s = (stb__alloc *) ptr - 1; // unlink from old *(s->prevn) = s->next; if (s->next) *stb__prevn(s->next) = s->prevn; stb__insert_alloc(src, s); } else { stb__nochildren *s = (stb__nochildren *) ptr - 1; // unlink from old *(s->prevn) = s->next; if (s->next) *stb__prevn(s->next) = s->prevn; stb__insert_nochild(src, s); } } #endif ////////////////////////////////////////////////////////////////////////////// // // stb_arr // // An stb_arr is directly useable as a pointer (use the actual type in your // definition), but when it resizes, it returns a new pointer and you can't // use the old one, so you have to be careful to copy-in-out as necessary. // // Use a NULL pointer as a 0-length array. // // float *my_array = NULL, *temp; // // // add elements on the end one at a time // stb_arr_push(my_array, 0.0f); // stb_arr_push(my_array, 1.0f); // stb_arr_push(my_array, 2.0f); // // assert(my_array[1] == 2.0f); // // // add an uninitialized element at the end, then assign it // *stb_arr_add(my_array) = 3.0f; // // // add three uninitialized elements at the end // temp = stb_arr_addn(my_array,3); // temp[0] = 4.0f; // temp[1] = 5.0f; // temp[2] = 6.0f; // // assert(my_array[5] == 5.0f); // // // remove the last one // stb_arr_pop(my_array); // // assert(stb_arr_len(my_array) == 6); #ifdef STB_MALLOC_WRAPPER #define STB__PARAMS , char *file, int line #define STB__ARGS , file, line #else #define STB__PARAMS #define STB__ARGS #endif // calling this function allocates an empty stb_arr attached to p // (whereas NULL isn't attached to anything) STB_EXTERN void stb_arr_malloc(void **target, void *context); // call this function with a non-NULL value to have all successive // stbs that are created be attached to the associated parent. Note // that once a given stb_arr is non-empty, it stays attached to its // current parent, even if you call this function again. // it turns the previous value, so you can restore it STB_EXTERN void* stb_arr_malloc_parent(void *p); // simple functions written on top of other functions #define stb_arr_empty(a) ( stb_arr_len(a) == 0 ) #define stb_arr_add(a) ( stb_arr_addn((a),1) ) #define stb_arr_push(a,v) ( *stb_arr_add(a)=(v) ) typedef struct { int len, limit; int stb_malloc; unsigned int signature; } stb__arr; #define stb_arr_signature 0x51bada7b // ends with 0123 in decimal // access the header block stored before the data #define stb_arrhead(a) /*lint --e(826)*/ (((stb__arr *) (a)) - 1) #define stb_arrhead2(a) /*lint --e(826)*/ (((stb__arr *) (a)) - 1) #ifdef STB_DEBUG #define stb_arr_check(a) assert(!a || stb_arrhead(a)->signature == stb_arr_signature) #define stb_arr_check2(a) assert(!a || stb_arrhead2(a)->signature == stb_arr_signature) #else #define stb_arr_check(a) ((void) 0) #define stb_arr_check2(a) ((void) 0) #endif // ARRAY LENGTH // get the array length; special case if pointer is NULL #define stb_arr_len(a) (a ? stb_arrhead(a)->len : 0) #define stb_arr_len2(a) ((stb__arr *) (a) ? stb_arrhead2(a)->len : 0) #define stb_arr_lastn(a) (stb_arr_len(a)-1) // check whether a given index is valid -- tests 0 <= i < stb_arr_len(a) #define stb_arr_valid(a,i) (a ? (int) (i) < stb_arrhead(a)->len : 0) // change the array length so is is exactly N entries long, creating // uninitialized entries as needed #define stb_arr_setlen(a,n) \ (stb__arr_setlen((void **) &(a), sizeof(a[0]), (n))) // change the array length so that N is a valid index (that is, so // it is at least N entries long), creating uninitialized entries as needed #define stb_arr_makevalid(a,n) \ (stb_arr_len(a) < (n)+1 ? stb_arr_setlen(a,(n)+1),(a) : (a)) // remove the last element of the array, returning it #define stb_arr_pop(a) ((stb_arr_check(a), (a))[--stb_arrhead(a)->len]) // access the last element in the array #define stb_arr_last(a) ((stb_arr_check(a), (a))[stb_arr_len(a)-1]) // is iterator at end of list? #define stb_arr_end(a,i) ((i) >= &(a)[stb_arr_len(a)]) // (internal) change the allocated length of the array #define stb_arr__grow(a,n) (stb_arr_check(a), stb_arrhead(a)->len += (n)) // add N new unitialized elements to the end of the array #define stb_arr__addn(a,n) /*lint --e(826)*/ \ ((stb_arr_len(a)+(n) > stb_arrcurmax(a)) \ ? (stb__arr_addlen((void **) &(a),sizeof(*a),(n)),0) \ : ((stb_arr__grow(a,n), 0))) // add N new unitialized elements to the end of the array, and return // a pointer to the first new one #define stb_arr_addn(a,n) (stb_arr__addn((a),n),(a)+stb_arr_len(a)-(n)) // add N new uninitialized elements starting at index 'i' #define stb_arr_insertn(a,i,n) (stb__arr_insertn((void **) &(a), sizeof(*a), i, n)) // insert an element at i #define stb_arr_insert(a,i,v) (stb__arr_insertn((void **) &(a), sizeof(*a), i, 1), ((a)[i] = v)) // delete N elements from the middle starting at index 'i' #define stb_arr_deleten(a,i,n) (stb__arr_deleten((void **) &(a), sizeof(*a), i, n)) // delete the i'th element #define stb_arr_delete(a,i) stb_arr_deleten(a,i,1) // delete the i'th element, swapping down from the end #define stb_arr_fastdelete(a,i) \ (stb_swap(&a[i], &a[stb_arrhead(a)->len-1], sizeof(*a)), stb_arr_pop(a)) // ARRAY STORAGE // get the array maximum storage; special case if NULL #define stb_arrcurmax(a) (a ? stb_arrhead(a)->limit : 0) #define stb_arrcurmax2(a) (a ? stb_arrhead2(a)->limit : 0) // set the maxlength of the array to n in anticipation of further growth #define stb_arr_setsize(a,n) (stb_arr_check(a), stb__arr_setsize((void **) &(a),sizeof((a)[0]),n)) // make sure maxlength is large enough for at least N new allocations #define stb_arr_atleast(a,n) (stb_arr_len(a)+(n) > stb_arrcurmax(a) \ ? stb_arr_setsize((a), (n)) : 0) // make a copy of a given array (copies contents via 'memcpy'!) #define stb_arr_copy(a) stb__arr_copy(a, sizeof((a)[0])) // compute the storage needed to store all the elements of the array #define stb_arr_storage(a) (stb_arr_len(a) * sizeof((a)[0])) #define stb_arr_for(v,arr) for((v)=(arr); (v) < (arr)+stb_arr_len(arr); ++(v)) // IMPLEMENTATION STB_EXTERN void stb_arr_free_(void **p); STB_EXTERN void *stb__arr_copy_(void *p, int elem_size); STB_EXTERN void stb__arr_setsize_(void **p, int size, int limit STB__PARAMS); STB_EXTERN void stb__arr_setlen_(void **p, int size, int newlen STB__PARAMS); STB_EXTERN void stb__arr_addlen_(void **p, int size, int addlen STB__PARAMS); STB_EXTERN void stb__arr_deleten_(void **p, int size, int loc, int n STB__PARAMS); STB_EXTERN void stb__arr_insertn_(void **p, int size, int loc, int n STB__PARAMS); #define stb_arr_free(p) stb_arr_free_((void **) &(p)) #define stb__arr_copy stb__arr_copy_ #ifndef STB_MALLOC_WRAPPER #define stb__arr_setsize stb__arr_setsize_ #define stb__arr_setlen stb__arr_setlen_ #define stb__arr_addlen stb__arr_addlen_ #define stb__arr_deleten stb__arr_deleten_ #define stb__arr_insertn stb__arr_insertn_ #else #define stb__arr_addlen(p,s,n) stb__arr_addlen_(p,s,n,__FILE__,__LINE__) #define stb__arr_setlen(p,s,n) stb__arr_setlen_(p,s,n,__FILE__,__LINE__) #define stb__arr_setsize(p,s,n) stb__arr_setsize_(p,s,n,__FILE__,__LINE__) #define stb__arr_deleten(p,s,i,n) stb__arr_deleten_(p,s,i,n,__FILE__,__LINE__) #define stb__arr_insertn(p,s,i,n) stb__arr_insertn_(p,s,i,n,__FILE__,__LINE__) #endif #ifdef STB_DEFINE static void *stb__arr_context; void *stb_arr_malloc_parent(void *p) { void *q = stb__arr_context; stb__arr_context = p; return q; } void stb_arr_malloc(void **target, void *context) { stb__arr *q = (stb__arr *) stb_malloc(context, sizeof(*q)); q->len = q->limit = 0; q->stb_malloc = 1; q->signature = stb_arr_signature; *target = (void *) (q+1); } static void * stb__arr_malloc(int size) { if (stb__arr_context) return stb_malloc(stb__arr_context, size); return malloc(size); } void * stb__arr_copy_(void *p, int elem_size) { stb__arr *q; if (p == NULL) return p; q = (stb__arr *) stb__arr_malloc(sizeof(*q) + elem_size * stb_arrhead2(p)->limit); stb_arr_check2(p); memcpy(q, stb_arrhead2(p), sizeof(*q) + elem_size * stb_arrhead2(p)->len); q->stb_malloc = !!stb__arr_context; return q+1; } void stb_arr_free_(void **pp) { void *p = *pp; stb_arr_check2(p); if (p) { stb__arr *q = stb_arrhead2(p); if (q->stb_malloc) stb_free(q); else free(q); } *pp = NULL; } static void stb__arrsize_(void **pp, int size, int limit, int len STB__PARAMS) { void *p = *pp; stb__arr *a; stb_arr_check2(p); if (p == NULL) { if (len == 0 && size == 0) return; a = (stb__arr *) stb__arr_malloc(sizeof(*a) + size*limit); a->limit = limit; a->len = len; a->stb_malloc = !!stb__arr_context; a->signature = stb_arr_signature; } else { a = stb_arrhead2(p); a->len = len; if (a->limit < limit) { void *p; if (a->limit >= 4 && limit < a->limit * 2) limit = a->limit * 2; if (a->stb_malloc) p = stb_realloc(a, sizeof(*a) + limit*size); else #ifdef STB_MALLOC_WRAPPER p = stb__realloc(a, sizeof(*a) + limit*size, file, line); #else p = realloc(a, sizeof(*a) + limit*size); #endif if (p) { a = (stb__arr *) p; a->limit = limit; } else { // throw an error! } } } a->len = stb_min(a->len, a->limit); *pp = a+1; } void stb__arr_setsize_(void **pp, int size, int limit STB__PARAMS) { void *p = *pp; stb_arr_check2(p); stb__arrsize_(pp, size, limit, stb_arr_len2(p) STB__ARGS); } void stb__arr_setlen_(void **pp, int size, int newlen STB__PARAMS) { void *p = *pp; stb_arr_check2(p); if (stb_arrcurmax2(p) < newlen || p == NULL) { stb__arrsize_(pp, size, newlen, newlen STB__ARGS); } else { stb_arrhead2(p)->len = newlen; } } void stb__arr_addlen_(void **p, int size, int addlen STB__PARAMS) { stb__arr_setlen_(p, size, stb_arr_len2(*p) + addlen STB__ARGS); } void stb__arr_insertn_(void **pp, int size, int i, int n STB__PARAMS) { void *p = *pp; if (n) { int z; if (p == NULL) { stb__arr_addlen_(pp, size, n STB__ARGS); return; } z = stb_arr_len2(p); stb__arr_addlen_(&p, size, n STB__ARGS); memmove((char *) p + (i+n)*size, (char *) p + i*size, size * (z-i)); } *pp = p; } void stb__arr_deleten_(void **pp, int size, int i, int n STB__PARAMS) { void *p = *pp; if (n) { memmove((char *) p + i*size, (char *) p + (i+n)*size, size * (stb_arr_len2(p)-(i+n))); stb_arrhead2(p)->len -= n; } *pp = p; } #endif ////////////////////////////////////////////////////////////////////////////// // // Hashing // // typical use for this is to make a power-of-two hash table. // // let N = size of table (2^n) // let H = stb_hash(str) // let S = stb_rehash(H) | 1 // // then hash probe sequence P(i) for i=0..N-1 // P(i) = (H + S*i) & (N-1) // // the idea is that H has 32 bits of hash information, but the // table has only, say, 2^20 entries so only uses 20 of the bits. // then by rehashing the original H we get 2^12 different probe // sequences for a given initial probe location. (So it's optimal // for 64K tables and its optimality decreases past that.) // // ok, so I've added something that generates _two separate_ // 32-bit hashes simultaneously which should scale better to // very large tables. STB_EXTERN unsigned int stb_hash(char *str); STB_EXTERN unsigned int stb_hashptr(void *p); STB_EXTERN unsigned int stb_hashlen(char *str, int len); STB_EXTERN unsigned int stb_rehash_improved(unsigned int v); STB_EXTERN unsigned int stb_hash_fast(void *p, int len); STB_EXTERN unsigned int stb_hash2(char *str, unsigned int *hash2_ptr); STB_EXTERN unsigned int stb_hash_number(unsigned int hash); #define stb_rehash(x) ((x) + ((x) >> 6) + ((x) >> 19)) #ifdef STB_DEFINE unsigned int stb_hash(char *str) { unsigned int hash = 0; while (*str) hash = (hash << 7) + (hash >> 25) + *str++; return hash + (hash >> 16); } unsigned int stb_hashlen(char *str, int len) { unsigned int hash = 0; while (len-- > 0 && *str) hash = (hash << 7) + (hash >> 25) + *str++; return hash + (hash >> 16); } unsigned int stb_hashptr(void *p) { unsigned int x = (unsigned int) p; // typically lacking in low bits and high bits x = stb_rehash(x); x += x << 16; // pearson's shuffle x ^= x << 3; x += x >> 5; x ^= x << 2; x += x >> 15; x ^= x << 10; return stb_rehash(x); } unsigned int stb_rehash_improved(unsigned int v) { return stb_hashptr((void *)(size_t) v); } unsigned int stb_hash2(char *str, unsigned int *hash2_ptr) { unsigned int hash1 = 0x3141592c; unsigned int hash2 = 0x77f044ed; while (*str) { hash1 = (hash1 << 7) + (hash1 >> 25) + *str; hash2 = (hash2 << 11) + (hash2 >> 21) + *str; ++str; } *hash2_ptr = hash2 + (hash1 >> 16); return hash1 + (hash2 >> 16); } // Paul Hsieh hash #define stb__get16_slow(p) ((p)[0] + ((p)[1] << 8)) #if defined(_MSC_VER) #define stb__get16(p) (*((unsigned short *) (p))) #else #define stb__get16(p) stb__get16_slow(p) #endif unsigned int stb_hash_fast(void *p, int len) { unsigned char *q = (unsigned char *) p; unsigned int hash = len; if (len <= 0 || q == NULL) return 0; /* Main loop */ if (((int) q & 1) == 0) { for (;len > 3; len -= 4) { unsigned int val; hash += stb__get16(q); val = (stb__get16(q+2) << 11); hash = (hash << 16) ^ hash ^ val; q += 4; hash += hash >> 11; } } else { for (;len > 3; len -= 4) { unsigned int val; hash += stb__get16_slow(q); val = (stb__get16_slow(q+2) << 11); hash = (hash << 16) ^ hash ^ val; q += 4; hash += hash >> 11; } } /* Handle end cases */ switch (len) { case 3: hash += stb__get16_slow(q); hash ^= hash << 16; hash ^= q[2] << 18; hash += hash >> 11; break; case 2: hash += stb__get16_slow(q); hash ^= hash << 11; hash += hash >> 17; break; case 1: hash += q[0]; hash ^= hash << 10; hash += hash >> 1; break; case 0: break; } /* Force "avalanching" of final 127 bits */ hash ^= hash << 3; hash += hash >> 5; hash ^= hash << 4; hash += hash >> 17; hash ^= hash << 25; hash += hash >> 6; return hash; } unsigned int stb_hash_number(unsigned int hash) { hash ^= hash << 3; hash += hash >> 5; hash ^= hash << 4; hash += hash >> 17; hash ^= hash << 25; hash += hash >> 6; return hash; } #endif ////////////////////////////////////////////////////////////////////////////// // // Perfect hashing for ints/pointers // // This is mainly useful for making faster pointer-indexed tables // that don't change frequently. E.g. for stb_ischar(). // typedef struct { stb_uint32 addend; stb_uint multiplicand; stb_uint b_mask; stb_uint8 small_bmap[16]; stb_uint16 *large_bmap; stb_uint table_mask; stb_uint32 *table; } stb_perfect; STB_EXTERN int stb_perfect_create(stb_perfect *,unsigned int*,int n); STB_EXTERN void stb_perfect_destroy(stb_perfect *); STB_EXTERN int stb_perfect_hash(stb_perfect *, unsigned int x); extern int stb_perfect_hash_max_failures; #ifdef STB_DEFINE int stb_perfect_hash_max_failures; int stb_perfect_hash(stb_perfect *p, unsigned int x) { stb_uint m = x * p->multiplicand; stb_uint y = x >> 16; stb_uint bv = (m >> 24) + y; stb_uint av = (m + y) >> 12; if (p->table == NULL) return -1; // uninitialized table fails bv &= p->b_mask; av &= p->table_mask; if (p->large_bmap) av ^= p->large_bmap[bv]; else av ^= p->small_bmap[bv]; return p->table[av] == x ? av : -1; } static void stb__perfect_prehash(stb_perfect *p, stb_uint x, stb_uint16 *a, stb_uint16 *b) { stb_uint m = x * p->multiplicand; stb_uint y = x >> 16; stb_uint bv = (m >> 24) + y; stb_uint av = (m + y) >> 12; bv &= p->b_mask; av &= p->table_mask; *b = bv; *a = av; } static unsigned long stb__perfect_rand(void) { static unsigned long stb__rand; stb__rand = stb__rand * 2147001325 + 715136305; return 0x31415926 ^ ((stb__rand >> 16) + (stb__rand << 16)); } typedef struct { unsigned short count; unsigned short b; unsigned short map; unsigned short *entries; } stb__slot; static int stb__slot_compare(const void *p, const void *q) { stb__slot *a = (stb__slot *) p; stb__slot *b = (stb__slot *) q; return a->count > b->count ? -1 : a->count < b->count; // sort large to small } int stb_perfect_create(stb_perfect *p, unsigned int *v, int n) { unsigned int buffer1[64], buffer2[64], buffer3[64], buffer4[64], buffer5[32]; unsigned short *as = (unsigned short *) stb_temp(buffer1, sizeof(*v)*n); unsigned short *bs = (unsigned short *) stb_temp(buffer2, sizeof(*v)*n); unsigned short *entries = (unsigned short *) stb_temp(buffer4, sizeof(*entries) * n); int size = 1 << stb_log2_ceil(n), bsize=8; int failure = 0,i,j,k; assert(n <= 32768); p->large_bmap = NULL; for(;;) { stb__slot *bcount = (stb__slot *) stb_temp(buffer3, sizeof(*bcount) * bsize); unsigned short *bloc = (unsigned short *) stb_temp(buffer5, sizeof(*bloc) * bsize); unsigned short *e; int bad=0; p->addend = stb__perfect_rand(); p->multiplicand = stb__perfect_rand() | 1; p->table_mask = size-1; p->b_mask = bsize-1; p->table = (stb_uint32 *) malloc(size * sizeof(*p->table)); for (i=0; i < bsize; ++i) { bcount[i].b = i; bcount[i].count = 0; bcount[i].map = 0; } for (i=0; i < n; ++i) { stb__perfect_prehash(p, v[i], as+i, bs+i); ++bcount[bs[i]].count; } qsort(bcount, bsize, sizeof(*bcount), stb__slot_compare); e = entries; // now setup up their entries index for (i=0; i < bsize; ++i) { bcount[i].entries = e; e += bcount[i].count; bcount[i].count = 0; bloc[bcount[i].b] = i; } // now fill them out for (i=0; i < n; ++i) { int b = bs[i]; int w = bloc[b]; bcount[w].entries[bcount[w].count++] = i; } stb_tempfree(buffer5,bloc); // verify for (i=0; i < bsize; ++i) for (j=0; j < bcount[i].count; ++j) assert(bs[bcount[i].entries[j]] == bcount[i].b); memset(p->table, 0, size*sizeof(*p->table)); // check if any b has duplicate a for (i=0; i < bsize; ++i) { if (bcount[i].count > 1) { for (j=0; j < bcount[i].count; ++j) { if (p->table[as[bcount[i].entries[j]]]) bad = 1; p->table[as[bcount[i].entries[j]]] = 1; } for (j=0; j < bcount[i].count; ++j) { p->table[as[bcount[i].entries[j]]] = 0; } if (bad) break; } } if (!bad) { // go through the bs and populate the table, first fit for (i=0; i < bsize; ++i) { if (bcount[i].count) { // go through the candidate table[b] values for (j=0; j < size; ++j) { // go through the a values and see if they fit for (k=0; k < bcount[i].count; ++k) { int a = as[bcount[i].entries[k]]; if (p->table[(a^j)&p->table_mask]) { break; // fails } } // if succeeded, accept if (k == bcount[i].count) { bcount[i].map = j; for (k=0; k < bcount[i].count; ++k) { int a = as[bcount[i].entries[k]]; p->table[(a^j)&p->table_mask] = 1; } break; } } if (j == size) break; // no match for i'th entry, so break out in failure } } if (i == bsize) { // success... fill out map if (bsize <= 16 && size <= 256) { p->large_bmap = NULL; for (i=0; i < bsize; ++i) p->small_bmap[bcount[i].b] = (stb_uint8) bcount[i].map; } else { p->large_bmap = (unsigned short *) malloc(sizeof(*p->large_bmap) * bsize); for (i=0; i < bsize; ++i) p->large_bmap[bcount[i].b] = bcount[i].map; } // initialize table to v[0], so empty slots will fail for (i=0; i < size; ++i) p->table[i] = v[0]; for (i=0; i < n; ++i) if (p->large_bmap) p->table[as[i] ^ p->large_bmap[bs[i]]] = v[i]; else p->table[as[i] ^ p->small_bmap[bs[i]]] = v[i]; // and now validate that none of them collided for (i=0; i < n; ++i) assert(stb_perfect_hash(p, v[i]) >= 0); stb_tempfree(buffer3, bcount); break; } } free(p->table); p->table = NULL; stb_tempfree(buffer3, bcount); ++failure; if (failure >= 4 && bsize < size) bsize *= 2; if (failure >= 8 && (failure & 3) == 0 && size < 4*n) { size *= 2; bsize *= 2; } if (failure == 6) { // make sure the input data is unique, so we don't infinite loop unsigned int *data = (unsigned int *) stb_temp(buffer3, n * sizeof(*data)); memcpy(data, v, sizeof(*data) * n); qsort(data, n, sizeof(*data), stb_intcmp(0)); for (i=1; i < n; ++i) { if (data[i] == data[i-1]) size = 0; // size is return value, so 0 it } stb_tempfree(buffer3, data); if (!size) break; } } if (failure > stb_perfect_hash_max_failures) stb_perfect_hash_max_failures = failure; stb_tempfree(buffer1, as); stb_tempfree(buffer2, bs); stb_tempfree(buffer4, entries); return size; } void stb_perfect_destroy(stb_perfect *p) { if (p->large_bmap) free(p->large_bmap); if (p->table ) free(p->table); p->large_bmap = NULL; p->table = NULL; p->b_mask = 0; p->table_mask = 0; } #endif ////////////////////////////////////////////////////////////////////////////// // // Perfect hash clients STB_EXTERN int stb_ischar(char s, char *set); #ifdef STB_DEFINE int stb_ischar(char c, char *set) { static unsigned char bit[8] = { 1,2,4,8,16,32,64,128 }; static stb_perfect p; static unsigned char (*tables)[256]; static char ** sets = NULL; int z = stb_perfect_hash(&p, (int) set); if (z < 0) { int i,k,n,j,f; // special code that means free all existing data if (set == NULL) { stb_arr_free(sets); free(tables); tables = NULL; stb_perfect_destroy(&p); return 0; } stb_arr_push(sets, set); stb_perfect_destroy(&p); n = stb_perfect_create(&p, (unsigned int *) (char **) sets, stb_arr_len(sets)); assert(n != 0); k = (n+7) >> 3; tables = (unsigned char (*)[256]) realloc(tables, sizeof(*tables) * k); memset(tables, 0, sizeof(*tables) * k); for (i=0; i < stb_arr_len(sets); ++i) { k = stb_perfect_hash(&p, (int) sets[i]); assert(k >= 0); n = k >> 3; f = bit[k&7]; for (j=0; !j || sets[i][j]; ++j) { tables[n][(unsigned char) sets[i][j]] |= f; } } z = stb_perfect_hash(&p, (int) set); } return tables[z >> 3][(unsigned char) c] & bit[z & 7]; } #endif ////////////////////////////////////////////////////////////////////////////// // // Instantiated data structures // // This is an attempt to implement a templated data structure. // // Hash table: call stb_define_hash(TYPE,N,KEY,K1,K2,HASH,VALUE) // TYPE -- will define a structure type containing the hash table // N -- the name, will prefix functions named: // N create // N destroy // N get // N set, N add, N update, // N remove // KEY -- the type of the key. 'x == y' must be valid // K1,K2 -- keys never used by the app, used as flags in the hashtable // HASH -- a piece of code ending with 'return' that hashes key 'k' // VALUE -- the type of the value. 'x = y' must be valid // // Note that stb_define_hash_base can be used to define more sophisticated // hash tables, e.g. those that make copies of the key or use special // comparisons (e.g. strcmp). #define STB_(prefix,name) stb__##prefix##name #define STB__(prefix,name) prefix##name #define STB__use(x) x #define STB__skip(x) #define stb_declare_hash(PREFIX,TYPE,N,KEY,VALUE) \ typedef struct stb__st_##TYPE TYPE;\ PREFIX int STB__(N, init)(TYPE *h, int count);\ PREFIX int STB__(N, memory_usage)(TYPE *h);\ PREFIX TYPE * STB__(N, create)(void);\ PREFIX TYPE * STB__(N, copy)(TYPE *h);\ PREFIX void STB__(N, destroy)(TYPE *h);\ PREFIX int STB__(N,get_flag)(TYPE *a, KEY k, VALUE *v);\ PREFIX VALUE STB__(N,get)(TYPE *a, KEY k);\ PREFIX int STB__(N, set)(TYPE *a, KEY k, VALUE v);\ PREFIX int STB__(N, add)(TYPE *a, KEY k, VALUE v);\ PREFIX int STB__(N, update)(TYPE*a,KEY k,VALUE v);\ PREFIX int STB__(N, remove)(TYPE *a, KEY k, VALUE *v); #define STB_nocopy(x) (x) #define STB_nodelete(x) 0 #define STB_nofields #define STB_nonullvalue(x) #define STB_nullvalue(x) x #define STB_safecompare(x) x #define STB_nosafe(x) #define STB_noprefix #ifdef __GNUC__ #define STB__nogcc(x) #else #define STB__nogcc(x) x #endif #define stb_define_hash_base(PREFIX,TYPE,FIELDS,N,NC,LOAD_FACTOR, \ KEY,EMPTY,DEL,COPY,DISPOSE,SAFE, \ VCOMPARE,CCOMPARE,HASH, \ VALUE,HASVNULL,VNULL) \ \ typedef struct \ { \ KEY k; \ VALUE v; \ } STB_(N,_hashpair); \ \ STB__nogcc( typedef struct stb__st_##TYPE TYPE; ) \ struct stb__st_##TYPE { \ FIELDS \ STB_(N,_hashpair) *table; \ unsigned int mask; \ int count, limit; \ int deleted; \ \ int delete_threshhold; \ int grow_threshhold; \ int shrink_threshhold; \ unsigned char alloced, has_empty, has_del; \ VALUE ev; VALUE dv; \ }; \ \ static unsigned int STB_(N, hash)(KEY k) \ { \ HASH \ } \ \ PREFIX int STB__(N, init)(TYPE *h, int count) \ { \ int i; \ if (count < 4) count = 4; \ h->limit = count; \ h->count = 0; \ h->mask = count-1; \ h->deleted = 0; \ h->grow_threshhold = (int) (count * LOAD_FACTOR); \ h->has_empty = h->has_del = 0; \ h->alloced = 0; \ if (count <= 64) \ h->shrink_threshhold = 0; \ else \ h->shrink_threshhold = (int) (count * (LOAD_FACTOR/2.25)); \ h->delete_threshhold = (int) (count * (1-LOAD_FACTOR)/2); \ h->table = (STB_(N,_hashpair)*) malloc(sizeof(h->table[0]) * count); \ if (h->table == NULL) return 0; \ /* ideally this gets turned into a memset32 automatically */ \ for (i=0; i < count; ++i) \ h->table[i].k = EMPTY; \ return 1; \ } \ \ PREFIX int STB__(N, memory_usage)(TYPE *h) \ { \ return sizeof(*h) + h->limit * sizeof(h->table[0]); \ } \ \ PREFIX TYPE * STB__(N, create)(void) \ { \ TYPE *h = (TYPE *) malloc(sizeof(*h)); \ if (h) { \ if (STB__(N, init)(h, 16)) \ h->alloced = 1; \ else { free(h); h=NULL; } \ } \ return h; \ } \ \ PREFIX void STB__(N, destroy)(TYPE *a) \ { \ int i; \ for (i=0; i < a->limit; ++i) \ if (!CCOMPARE(a->table[i].k,EMPTY) && !CCOMPARE(a->table[i].k, DEL)) \ DISPOSE(a->table[i].k); \ free(a->table); \ if (a->alloced) \ free(a); \ } \ \ static void STB_(N, rehash)(TYPE *a, int count); \ \ PREFIX int STB__(N,get_flag)(TYPE *a, KEY k, VALUE *v) \ { \ unsigned int h = STB_(N, hash)(k); \ unsigned int n = h & a->mask, s; \ if (CCOMPARE(k,EMPTY)){ if (a->has_empty) *v = a->ev; return a->has_empty;}\ if (CCOMPARE(k,DEL)) { if (a->has_del ) *v = a->dv; return a->has_del; }\ if (CCOMPARE(a->table[n].k,EMPTY)) return 0; \ SAFE(if (!CCOMPARE(a->table[n].k,DEL))) \ if (VCOMPARE(a->table[n].k,k)) { *v = a->table[n].v; return 1; } \ s = stb_rehash(h) | 1; \ for(;;) { \ n = (n + s) & a->mask; \ if (CCOMPARE(a->table[n].k,EMPTY)) return 0; \ SAFE(if (CCOMPARE(a->table[n].k,DEL)) continue;) \ if (VCOMPARE(a->table[n].k,k)) \ { *v = a->table[n].v; return 1; } \ } \ } \ \ HASVNULL( \ PREFIX VALUE STB__(N,get)(TYPE *a, KEY k) \ { \ VALUE v; \ if (STB__(N,get_flag)(a,k,&v)) return v; \ else return VNULL; \ } \ ) \ \ PREFIX int STB__(N,getkey)(TYPE *a, KEY k, KEY *kout) \ { \ unsigned int h = STB_(N, hash)(k); \ unsigned int n = h & a->mask, s; \ if (CCOMPARE(k,EMPTY)||CCOMPARE(k,DEL)) return 0; \ if (CCOMPARE(a->table[n].k,EMPTY)) return 0; \ SAFE(if (!CCOMPARE(a->table[n].k,DEL))) \ if (VCOMPARE(a->table[n].k,k)) { *kout = a->table[n].k; return 1; } \ s = stb_rehash(h) | 1; \ for(;;) { \ n = (n + s) & a->mask; \ if (CCOMPARE(a->table[n].k,EMPTY)) return 0; \ SAFE(if (CCOMPARE(a->table[n].k,DEL)) continue;) \ if (VCOMPARE(a->table[n].k,k)) \ { *kout = a->table[n].k; return 1; } \ } \ } \ \ static int STB_(N,addset)(TYPE *a, KEY k, VALUE v, \ int allow_new, int allow_old, int copy) \ { \ unsigned int h = STB_(N, hash)(k); \ unsigned int n = h & a->mask; \ int b = -1; \ if (CCOMPARE(k,EMPTY)) { \ if (a->has_empty ? allow_old : allow_new) { \ n=a->has_empty; a->ev = v; a->has_empty = 1; return !n; \ } else return 0; \ } \ if (CCOMPARE(k,DEL)) { \ if (a->has_del ? allow_old : allow_new) { \ n=a->has_del; a->dv = v; a->has_del = 1; return !n; \ } else return 0; \ } \ if (!CCOMPARE(a->table[n].k, EMPTY)) { \ unsigned int s; \ if (CCOMPARE(a->table[n].k, DEL)) \ b = n; \ else if (VCOMPARE(a->table[n].k,k)) { \ if (allow_old) \ a->table[n].v = v; \ return !allow_new; \ } \ s = stb_rehash(h) | 1; \ for(;;) { \ n = (n + s) & a->mask; \ if (CCOMPARE(a->table[n].k, EMPTY)) break; \ if (CCOMPARE(a->table[n].k, DEL)) { \ if (b < 0) b = n; \ } else if (VCOMPARE(a->table[n].k,k)) { \ if (allow_old) \ a->table[n].v = v; \ return !allow_new; \ } \ } \ } \ if (!allow_new) return 0; \ if (b < 0) b = n; else --a->deleted; \ a->table[b].k = copy ? COPY(k) : k; \ a->table[b].v = v; \ ++a->count; \ if (a->count > a->grow_threshhold) \ STB_(N,rehash)(a, a->limit*2); \ return 1; \ } \ \ PREFIX int STB__(N, set)(TYPE *a, KEY k, VALUE v){return STB_(N,addset)(a,k,v,1,1,1);}\ PREFIX int STB__(N, add)(TYPE *a, KEY k, VALUE v){return STB_(N,addset)(a,k,v,1,0,1);}\ PREFIX int STB__(N, update)(TYPE*a,KEY k,VALUE v){return STB_(N,addset)(a,k,v,0,1,1);}\ \ PREFIX int STB__(N, remove)(TYPE *a, KEY k, VALUE *v) \ { \ unsigned int h = STB_(N, hash)(k); \ unsigned int n = h & a->mask, s; \ if (CCOMPARE(k,EMPTY)) { if (a->has_empty) { if(v)*v = a->ev; a->has_empty=0; return 1; } return 0; } \ if (CCOMPARE(k,DEL)) { if (a->has_del ) { if(v)*v = a->dv; a->has_del =0; return 1; } return 0; } \ if (CCOMPARE(a->table[n].k,EMPTY)) return 0; \ if (SAFE(CCOMPARE(a->table[n].k,DEL) || ) !VCOMPARE(a->table[n].k,k)) { \ s = stb_rehash(h) | 1; \ for(;;) { \ n = (n + s) & a->mask; \ if (CCOMPARE(a->table[n].k,EMPTY)) return 0; \ SAFE(if (CCOMPARE(a->table[n].k, DEL)) continue;) \ if (VCOMPARE(a->table[n].k,k)) break; \ } \ } \ DISPOSE(a->table[n].k); \ a->table[n].k = DEL; \ --a->count; \ ++a->deleted; \ if (v != NULL) \ *v = a->table[n].v; \ if (a->count < a->shrink_threshhold) \ STB_(N, rehash)(a, a->limit >> 1); \ else if (a->deleted > a->delete_threshhold) \ STB_(N, rehash)(a, a->limit); \ return 1; \ } \ \ PREFIX TYPE * STB__(NC, copy)(TYPE *a) \ { \ int i; \ TYPE *h = (TYPE *) malloc(sizeof(*h)); \ if (!h) return NULL; \ if (!STB__(N, init)(h, a->limit)) { free(h); return NULL; } \ h->count = a->count; \ h->deleted = a->deleted; \ h->alloced = 1; \ h->ev = a->ev; h->dv = a->dv; \ h->has_empty = a->has_empty; h->has_del = a->has_del; \ memcpy(h->table, a->table, h->limit * sizeof(h->table[0])); \ for (i=0; i < a->limit; ++i) \ if (!CCOMPARE(h->table[i].k,EMPTY) && !CCOMPARE(h->table[i].k,DEL)) \ h->table[i].k = COPY(h->table[i].k); \ return h; \ } \ \ static void STB_(N, rehash)(TYPE *a, int count) \ { \ int i; \ TYPE b; \ STB__(N, init)(&b, count); \ for (i=0; i < a->limit; ++i) \ if (!CCOMPARE(a->table[i].k,EMPTY) && !CCOMPARE(a->table[i].k,DEL)) \ STB_(N,addset)(&b, a->table[i].k, a->table[i].v,1,1,0); \ free(a->table); \ a->table = b.table; \ a->mask = b.mask; \ a->count = b.count; \ a->limit = b.limit; \ a->deleted = b.deleted; \ a->delete_threshhold = b.delete_threshhold; \ a->grow_threshhold = b.grow_threshhold; \ a->shrink_threshhold = b.shrink_threshhold; \ } #define STB_equal(a,b) ((a) == (b)) #define stb_define_hash(TYPE,N,KEY,EMPTY,DEL,HASH,VALUE) \ stb_define_hash_base(STB_noprefix, TYPE,STB_nofields,N,NC,0.85f, \ KEY,EMPTY,DEL,STB_nocopy,STB_nodelete,STB_nosafe, \ STB_equal,STB_equal,HASH, \ VALUE,STB_nonullvalue,0) #define stb_define_hash_vnull(TYPE,N,KEY,EMPTY,DEL,HASH,VALUE,VNULL) \ stb_define_hash_base(STB_noprefix, TYPE,STB_nofields,N,NC,0.85f, \ KEY,EMPTY,DEL,STB_nocopy,STB_nodelete,STB_nosafe, \ STB_equal,STB_equal,HASH, \ VALUE,STB_nullvalue,VNULL) ////////////////////////////////////////////////////////////////////////////// // // stb_ptrmap // // An stb_ptrmap data structure is an O(1) hash table between pointers. One // application is to let you store "extra" data associated with pointers, // which is why it was originally called stb_extra. stb_declare_hash(STB_EXTERN, stb_ptrmap, stb_ptrmap_, void *, void *) stb_declare_hash(STB_EXTERN, stb_idict, stb_idict_, stb_int32, stb_int32) STB_EXTERN void stb_ptrmap_delete(stb_ptrmap *e, void (*free_func)(void *)); STB_EXTERN stb_ptrmap *stb_ptrmap_new(void); STB_EXTERN stb_idict * stb_idict_new_size(int size); STB_EXTERN void stb_idict_remove_all(stb_idict *e); #ifdef STB_DEFINE #define STB_EMPTY ((void *) 2) #define STB_EDEL ((void *) 6) stb_define_hash_base(STB_noprefix,stb_ptrmap, STB_nofields, stb_ptrmap_,stb_ptrmap_,0.85f, void *,STB_EMPTY,STB_EDEL,STB_nocopy,STB_nodelete,STB_nosafe, STB_equal,STB_equal,return stb_hashptr(k);, void *,STB_nullvalue,NULL) stb_ptrmap *stb_ptrmap_new(void) { return stb_ptrmap_create(); } void stb_ptrmap_delete(stb_ptrmap *e, void (*free_func)(void *)) { int i; if (free_func) for (i=0; i < e->limit; ++i) if (e->table[i].k != STB_EMPTY && e->table[i].k != STB_EDEL) { if (free_func == free) free(e->table[i].v); // allow STB_MALLOC_WRAPPER to operate else free_func(e->table[i].v); } stb_ptrmap_destroy(e); } // extra fields needed for stua_dict #define STB_IEMPTY ((int) 1) #define STB_IDEL ((int) 3) stb_define_hash_base(STB_noprefix, stb_idict, short type; short gc; STB_nofields, stb_idict_,stb_idict_,0.85f, stb_int32,STB_IEMPTY,STB_IDEL,STB_nocopy,STB_nodelete,STB_nosafe, STB_equal,STB_equal, return stb_rehash_improved(k);,stb_int32,STB_nonullvalue,0) stb_idict * stb_idict_new_size(int size) { stb_idict *e = (stb_idict *) malloc(sizeof(*e)); if (e) { if (!stb_is_pow2(size)) size = 1 << stb_log2_ceil(size); stb_idict_init(e, size); e->alloced = 1; } return e; } void stb_idict_remove_all(stb_idict *e) { int n; for (n=0; n < e->limit; ++n) e->table[n].k = STB_IEMPTY; e->has_empty = e->has_del = 0; } #endif ////////////////////////////////////////////////////////////////////////////// // // stb_sparse_ptr_matrix // // An stb_ptrmap data structure is an O(1) hash table storing an arbitrary // block of data for a given pair of pointers. // // If create=0, returns typedef struct stb__st_stb_spmatrix stb_spmatrix; STB_EXTERN stb_spmatrix * stb_sparse_ptr_matrix_new(int val_size); STB_EXTERN void stb_sparse_ptr_matrix_free(stb_spmatrix *z); STB_EXTERN void * stb_sparse_ptr_matrix_get(stb_spmatrix *z, void *a, void *b, int create); #ifdef STB_DEFINE typedef struct { void *a; void *b; } stb__ptrpair; static stb__ptrpair stb__ptrpair_empty = { (void *) 1, (void *) 1 }; static stb__ptrpair stb__ptrpair_del = { (void *) 2, (void *) 2 }; #define STB__equal_ptrpair(x,y) ((x).a == (y).a && (x).b == (y).b) stb_define_hash_base(static, stb_spmatrix, int val_size; void *arena;, stb__spmatrix_,stb__spmatrix_, 0.85, stb__ptrpair, stb__ptrpair_empty, stb__ptrpair_del, STB_nocopy, STB_nodelete, STB_nosafe, STB__equal_ptrpair, STB__equal_ptrpair, return stb_rehash(stb_hashptr(k.a))+stb_hashptr(k.b);, void *, STB_nullvalue, 0) stb_spmatrix *stb_sparse_ptr_matrix_new(int val_size) { stb_spmatrix *m = stb__spmatrix_create(); if (m) m->val_size = val_size; if (m) m->arena = stb_malloc_global(1); return m; } void stb_sparse_ptr_matrix_free(stb_spmatrix *z) { if (z->arena) stb_free(z->arena); stb__spmatrix_destroy(z); } void *stb_sparse_ptr_matrix_get(stb_spmatrix *z, void *a, void *b, int create) { stb__ptrpair t = { a,b }; void *data = stb__spmatrix_get(z, t); if (!data && create) { data = stb_malloc_raw(z->arena, z->val_size); if (!data) return NULL; memset(data, 0, z->val_size); stb__spmatrix_add(z, t, data); } return data; } #endif ////////////////////////////////////////////////////////////////////////////// // // SDICT: Hash Table for Strings (symbol table) // // if "use_arena=1", then strings will be copied // into blocks and never freed until the sdict is freed; // otherwise they're malloc()ed and free()d on the fly. // (specify use_arena=1 if you never stb_sdict_remove) stb_declare_hash(STB_EXTERN, stb_sdict, stb_sdict_, char *, void *) STB_EXTERN stb_sdict * stb_sdict_new(int use_arena); STB_EXTERN stb_sdict * stb_sdict_copy(stb_sdict*); STB_EXTERN void stb_sdict_delete(stb_sdict *); STB_EXTERN void * stb_sdict_change(stb_sdict *, char *str, void *p); STB_EXTERN int stb_sdict_count(stb_sdict *d); #define stb_sdict_for(d,i,q,z) \ for(i=0; i < (d)->limit ? q=(d)->table[i].k,z=(d)->table[i].v,1 : 0; ++i) \ if (q==NULL||q==(void *) 1);else // reversed makes macro friendly #ifdef STB_DEFINE #define STB_DEL ((void *) 1) #define STB_SDEL ((char *) 1) #define stb_sdict__copy(x) \ strcpy(a->arena ? stb_malloc_string(a->arena, strlen(x)+1) \ : (char *) malloc(strlen(x)+1), x) #define stb_sdict__dispose(x) if (!a->arena) free(x) stb_define_hash_base(STB_noprefix, stb_sdict, void*arena;, stb_sdict_,stb_sdictinternal_, 0.85f, char *, NULL, STB_SDEL, stb_sdict__copy, stb_sdict__dispose, STB_safecompare, !strcmp, STB_equal, return stb_hash(k);, void *, STB_nullvalue, NULL) int stb_sdict_count(stb_sdict *a) { return a->count; } stb_sdict * stb_sdict_new(int use_arena) { stb_sdict *d = stb_sdict_create(); if (d == NULL) return NULL; d->arena = use_arena ? stb_malloc_global(1) : NULL; return d; } stb_sdict* stb_sdict_copy(stb_sdict *old) { stb_sdict *n; void *old_arena = old->arena; void *new_arena = old_arena ? stb_malloc_global(1) : NULL; old->arena = new_arena; n = stb_sdictinternal_copy(old); old->arena = old_arena; if (n) n->arena = new_arena; else if (new_arena) stb_free(new_arena); return n; } void stb_sdict_delete(stb_sdict *d) { if (d->arena) stb_free(d->arena); stb_sdict_destroy(d); } void * stb_sdict_change(stb_sdict *d, char *str, void *p) { void *q = stb_sdict_get(d, str); stb_sdict_set(d, str, p); return q; } #endif ////////////////////////////////////////////////////////////////////////////// // // Instantiated data structures // // This is an attempt to implement a templated data structure. // What you do is define a struct foo, and then include several // pointer fields to struct foo in your struct. Then you call // the instantiator, which creates the functions that implement // the data structure. This requires massive undebuggable #defines, // so we limit the cases where we do this. // // AA tree is an encoding of a 2-3 tree whereas RB trees encode a 2-3-4 tree; // much simpler code due to fewer cases. #define stb__bst_parent(x) x #define stb__bst_noparent(x) #define stb_bst_fields(N) \ *STB_(N,left), *STB_(N,right); \ unsigned char STB_(N,level) #define stb_bst_fields_parent(N) \ *STB_(N,left), *STB_(N,right), *STB_(N,parent); \ unsigned char STB_(N,level) #define STB__level(N,x) ((x) ? (x)->STB_(N,level) : 0) #define stb_bst_base(TYPE, N, TREE, M, compare, PAR) \ \ static int STB_(N,_compare)(TYPE *p, TYPE *q) \ { \ compare \ } \ \ static void STB_(N,setleft)(TYPE *q, TYPE *v) \ { \ q->STB_(N,left) = v; \ PAR(if (v) v->STB_(N,parent) = q;) \ } \ \ static void STB_(N,setright)(TYPE *q, TYPE *v) \ { \ q->STB_(N,right) = v; \ PAR(if (v) v->STB_(N,parent) = q;) \ } \ \ static TYPE *STB_(N,skew)(TYPE *q) \ { \ if (q == NULL) return q; \ if (q->STB_(N,left) \ && q->STB_(N,left)->STB_(N,level) == q->STB_(N,level)) { \ TYPE *p = q->STB_(N,left); \ STB_(N,setleft)(q, p->STB_(N,right)); \ STB_(N,setright)(p, q); \ return p; \ } \ return q; \ } \ \ static TYPE *STB_(N,split)(TYPE *p) \ { \ TYPE *q = p->STB_(N,right); \ if (q && q->STB_(N,right) \ && q->STB_(N,right)->STB_(N,level) == p->STB_(N,level)) { \ STB_(N,setright)(p, q->STB_(N,left)); \ STB_(N,setleft)(q,p); \ ++q->STB_(N,level); \ return q; \ } \ return p; \ } \ \ TYPE *STB__(N,insert)(TYPE *tree, TYPE *item) \ { \ int c; \ if (tree == NULL) { \ item->STB_(N,left) = NULL; \ item->STB_(N,right) = NULL; \ item->STB_(N,level) = 1; \ PAR(item->STB_(N,parent) = NULL;) \ return item; \ } \ c = STB_(N,_compare)(item,tree); \ if (c == 0) { \ if (item != tree) { \ STB_(N,setleft)(item, tree->STB_(N,left)); \ STB_(N,setright)(item, tree->STB_(N,right)); \ item->STB_(N,level) = tree->STB_(N,level); \ PAR(item->STB_(N,parent) = NULL;) \ } \ return item; \ } \ if (c < 0) \ STB_(N,setleft )(tree, STB__(N,insert)(tree->STB_(N,left), item)); \ else \ STB_(N,setright)(tree, STB__(N,insert)(tree->STB_(N,right), item)); \ tree = STB_(N,skew)(tree); \ tree = STB_(N,split)(tree); \ PAR(tree->STB_(N,parent) = NULL;) \ return tree; \ } \ \ TYPE *STB__(N,remove)(TYPE *tree, TYPE *item) \ { \ static TYPE *delnode, *leaf, *restore; \ if (tree == NULL) return NULL; \ leaf = tree; \ if (STB_(N,_compare)(item, tree) < 0) { \ STB_(N,setleft)(tree, STB__(N,remove)(tree->STB_(N,left), item)); \ } else { \ TYPE *r; \ delnode = tree; \ r = STB__(N,remove)(tree->STB_(N,right), item); \ /* maybe move 'leaf' up to this location */ \ if (restore == tree) { tree = leaf; leaf = restore = NULL; } \ STB_(N,setright)(tree,r); \ assert(tree->STB_(N,right) != tree); \ } \ if (tree == leaf) { \ if (delnode == item) { \ tree = tree->STB_(N,right); \ assert(leaf->STB_(N,left) == NULL); \ /* move leaf (the right sibling) up to delnode */ \ STB_(N,setleft )(leaf, item->STB_(N,left )); \ STB_(N,setright)(leaf, item->STB_(N,right)); \ leaf->STB_(N,level) = item->STB_(N,level); \ if (leaf != item) \ restore = delnode; \ } \ delnode = NULL; \ } else { \ if (STB__level(N,tree->STB_(N,left) ) < tree->STB_(N,level)-1 || \ STB__level(N,tree->STB_(N,right)) < tree->STB_(N,level)-1) { \ --tree->STB_(N,level); \ if (STB__level(N,tree->STB_(N,right)) > tree->STB_(N,level)) \ tree->STB_(N,right)->STB_(N,level) = tree->STB_(N,level); \ tree = STB_(N,skew)(tree); \ STB_(N,setright)(tree, STB_(N,skew)(tree->STB_(N,right))); \ if (tree->STB_(N,right)) \ STB_(N,setright)(tree->STB_(N,right), \ STB_(N,skew)(tree->STB_(N,right)->STB_(N,right))); \ tree = STB_(N,split)(tree); \ if (tree->STB_(N,right)) \ STB_(N,setright)(tree, STB_(N,split)(tree->STB_(N,right))); \ } \ } \ PAR(if (tree) tree->STB_(N,parent) = NULL;) \ return tree; \ } \ \ TYPE *STB__(N,last)(TYPE *tree) \ { \ if (tree) \ while (tree->STB_(N,right)) tree = tree->STB_(N,right); \ return tree; \ } \ \ TYPE *STB__(N,first)(TYPE *tree) \ { \ if (tree) \ while (tree->STB_(N,left)) tree = tree->STB_(N,left); \ return tree; \ } \ \ TYPE *STB__(N,next)(TYPE *tree, TYPE *item) \ { \ TYPE *next = NULL; \ if (item->STB_(N,right)) \ return STB__(N,first)(item->STB_(N,right)); \ PAR( \ while(item->STB_(N,parent)) { \ TYPE *up = item->STB_(N,parent); \ if (up->STB_(N,left) == item) return up; \ item = up; \ } \ return NULL; \ ) \ while (tree != item) { \ if (STB_(N,_compare)(item, tree) < 0) { \ next = tree; \ tree = tree->STB_(N,left); \ } else { \ tree = tree->STB_(N,right); \ } \ } \ return next; \ } \ \ TYPE *STB__(N,prev)(TYPE *tree, TYPE *item) \ { \ TYPE *next = NULL; \ if (item->STB_(N,left)) \ return STB__(N,last)(item->STB_(N,left)); \ PAR( \ while(item->STB_(N,parent)) { \ TYPE *up = item->STB_(N,parent); \ if (up->STB_(N,right) == item) return up; \ item = up; \ } \ return NULL; \ ) \ while (tree != item) { \ if (STB_(N,_compare)(item, tree) < 0) { \ tree = tree->STB_(N,left); \ } else { \ next = tree; \ tree = tree->STB_(N,right); \ } \ } \ return next; \ } \ \ STB__DEBUG( \ void STB__(N,_validate)(TYPE *tree, int root) \ { \ if (tree == NULL) return; \ PAR(if(root) assert(tree->STB_(N,parent) == NULL);) \ assert(STB__level(N,tree->STB_(N,left) ) == tree->STB_(N,level)-1); \ assert(STB__level(N,tree->STB_(N,right)) <= tree->STB_(N,level)); \ assert(STB__level(N,tree->STB_(N,right)) >= tree->STB_(N,level)-1); \ if (tree->STB_(N,right)) { \ assert(STB__level(N,tree->STB_(N,right)->STB_(N,right)) \ != tree->STB_(N,level)); \ PAR(assert(tree->STB_(N,right)->STB_(N,parent) == tree);) \ } \ PAR(if(tree->STB_(N,left)) assert(tree->STB_(N,left)->STB_(N,parent) == tree);) \ STB__(N,_validate)(tree->STB_(N,left) ,0); \ STB__(N,_validate)(tree->STB_(N,right),0); \ } \ ) \ \ typedef struct \ { \ TYPE *root; \ } TREE; \ \ void STB__(M,Insert)(TREE *tree, TYPE *item) \ { tree->root = STB__(N,insert)(tree->root, item); } \ void STB__(M,Remove)(TREE *tree, TYPE *item) \ { tree->root = STB__(N,remove)(tree->root, item); } \ TYPE *STB__(M,Next)(TREE *tree, TYPE *item) \ { return STB__(N,next)(tree->root, item); } \ TYPE *STB__(M,Prev)(TREE *tree, TYPE *item) \ { return STB__(N,prev)(tree->root, item); } \ TYPE *STB__(M,First)(TREE *tree) { return STB__(N,first)(tree->root); } \ TYPE *STB__(M,Last) (TREE *tree) { return STB__(N,last) (tree->root); } \ void STB__(M,Init)(TREE *tree) { tree->root = NULL; } #define stb_bst_find(N,tree,fcompare) \ { \ int c; \ while (tree != NULL) { \ fcompare \ if (c == 0) return tree; \ if (c < 0) tree = tree->STB_(N,left); \ else tree = tree->STB_(N,right); \ } \ return NULL; \ } #define stb_bst_raw(TYPE,N,TREE,M,vfield,VTYPE,compare,PAR) \ stb_bst_base(TYPE,N,TREE,M, \ VTYPE a = p->vfield; VTYPE b = q->vfield; return (compare);, PAR ) \ \ TYPE *STB__(N,find)(TYPE *tree, VTYPE a) \ stb_bst_find(N,tree,VTYPE b = tree->vfield; c = (compare);) \ TYPE *STB__(M,Find)(TREE *tree, VTYPE a) \ { return STB__(N,find)(tree->root, a); } #define stb_bst(TYPE,N,TREE,M,vfield,VTYPE,compare) \ stb_bst_raw(TYPE,N,TREE,M,vfield,VTYPE,compare,stb__bst_noparent) #define stb_bst_parent(TYPE,N,TREE,M,vfield,VTYPE,compare) \ stb_bst_raw(TYPE,N,TREE,M,vfield,VTYPE,compare,stb__bst_parent) ////////////////////////////////////////////////////////////////////////////// // // Pointer Nulling // // This lets you automatically NULL dangling pointers to "registered" // objects. Note that you have to make sure you call the appropriate // functions when you free or realloc blocks of memory that contain // pointers or pointer targets. stb.h can automatically do this for // stb_arr, or for all frees/reallocs if it's wrapping them. // #ifdef STB_NPTR STB_EXTERN void stb_nptr_set(void *address_of_pointer, void *value_to_write); STB_EXTERN void stb_nptr_didset(void *address_of_pointer); STB_EXTERN void stb_nptr_didfree(void *address_being_freed, int len); STB_EXTERN void stb_nptr_free(void *address_being_freed, int len); STB_EXTERN void stb_nptr_didrealloc(void *new_address, void *old_address, int len); STB_EXTERN void stb_nptr_recache(void); // recache all known pointers // do this after pointer sets outside your control, slow #ifdef STB_DEFINE // for fast updating on free/realloc, we need to be able to find // all the objects (pointers and targets) within a given block; // this precludes hashing // we use a three-level hierarchy of memory to minimize storage: // level 1: 65536 pointers to stb__memory_node (always uses 256 KB) // level 2: each stb__memory_node represents a 64K block of memory // with 256 stb__memory_leafs (worst case 64MB) // level 3: each stb__memory_leaf represents 256 bytes of memory // using a list of target locations and a list of pointers // (which are hopefully fairly short normally!) // this approach won't work in 64-bit, which has a much larger address // space. need to redesign #define STB__NPTR_ROOT_LOG2 16 #define STB__NPTR_ROOT_NUM (1 << STB__NPTR_ROOT_LOG2) #define STB__NPTR_ROOT_SHIFT (32 - STB__NPTR_ROOT_LOG2) #define STB__NPTR_NODE_LOG2 5 #define STB__NPTR_NODE_NUM (1 << STB__NPTR_NODE_LOG2) #define STB__NPTR_NODE_MASK (STB__NPTR_NODE_NUM-1) #define STB__NPTR_NODE_SHIFT (STB__NPTR_ROOT_SHIFT - STB__NPTR_NODE_LOG2) #define STB__NPTR_NODE_OFFSET(x) (((x) >> STB__NPTR_NODE_SHIFT) & STB__NPTR_NODE_MASK) typedef struct stb__st_nptr { void *ptr; // address of actual pointer struct stb__st_nptr *next; // next pointer with same target struct stb__st_nptr **prev; // prev pointer with same target, address of 'next' field (or first) struct stb__st_nptr *next_in_block; } stb__nptr; typedef struct stb__st_nptr_target { void *ptr; // address of target stb__nptr *first; // address of first nptr pointing to this struct stb__st_nptr_target *next_in_block; } stb__nptr_target; typedef struct { stb__nptr *pointers; stb__nptr_target *targets; } stb__memory_leaf; typedef struct { stb__memory_leaf *children[STB__NPTR_NODE_NUM]; } stb__memory_node; stb__memory_node *stb__memtab_root[STB__NPTR_ROOT_NUM]; static stb__memory_leaf *stb__nptr_find_leaf(void *mem) { stb_uint32 address = (stb_uint32) mem; stb__memory_node *z = stb__memtab_root[address >> STB__NPTR_ROOT_SHIFT]; if (z) return z->children[STB__NPTR_NODE_OFFSET(address)]; else return NULL; } static void * stb__nptr_alloc(int size) { return stb__realloc_raw(0,size); } static void stb__nptr_free(void *p) { stb__realloc_raw(p,0); } static stb__memory_leaf *stb__nptr_make_leaf(void *mem) { stb_uint32 address = (stb_uint32) mem; stb__memory_node *z = stb__memtab_root[address >> STB__NPTR_ROOT_SHIFT]; stb__memory_leaf *f; if (!z) { int i; z = (stb__memory_node *) stb__nptr_alloc(sizeof(*stb__memtab_root[0])); stb__memtab_root[address >> STB__NPTR_ROOT_SHIFT] = z; for (i=0; i < 256; ++i) z->children[i] = 0; } f = (stb__memory_leaf *) stb__nptr_alloc(sizeof(*f)); z->children[STB__NPTR_NODE_OFFSET(address)] = f; f->pointers = NULL; f->targets = NULL; return f; } static stb__nptr_target *stb__nptr_find_target(void *target, int force) { stb__memory_leaf *p = stb__nptr_find_leaf(target); if (p) { stb__nptr_target *t = p->targets; while (t) { if (t->ptr == target) return t; t = t->next_in_block; } } if (force) { stb__nptr_target *t = (stb__nptr_target*) stb__nptr_alloc(sizeof(*t)); if (!p) p = stb__nptr_make_leaf(target); t->ptr = target; t->first = NULL; t->next_in_block = p->targets; p->targets = t; return t; } else return NULL; } static stb__nptr *stb__nptr_find_pointer(void *ptr, int force) { stb__memory_leaf *p = stb__nptr_find_leaf(ptr); if (p) { stb__nptr *t = p->pointers; while (t) { if (t->ptr == ptr) return t; t = t->next_in_block; } } if (force) { stb__nptr *t = (stb__nptr *) stb__nptr_alloc(sizeof(*t)); if (!p) p = stb__nptr_make_leaf(ptr); t->ptr = ptr; t->next = NULL; t->prev = NULL; t->next_in_block = p->pointers; p->pointers = t; return t; } else return NULL; } void stb_nptr_set(void *address_of_pointer, void *value_to_write) { if (*(void **)address_of_pointer != value_to_write) { *(void **) address_of_pointer = value_to_write; stb_nptr_didset(address_of_pointer); } } void stb_nptr_didset(void *address_of_pointer) { // first unlink from old chain void *new_address; stb__nptr *p = stb__nptr_find_pointer(address_of_pointer, 1); // force building if doesn't exist if (p->prev) { // if p->prev is NULL, we just built it, or it was NULL *(p->prev) = p->next; if (p->next) p->next->prev = p->prev; } // now add to new chain new_address = *(void **)address_of_pointer; if (new_address != NULL) { stb__nptr_target *t = stb__nptr_find_target(new_address, 1); p->next = t->first; if (p->next) p->next->prev = &p->next; p->prev = &t->first; t->first = p; } else { p->prev = NULL; p->next = NULL; } } void stb__nptr_block(void *address, int len, void (*function)(stb__memory_leaf *f, int datum, void *start, void *end), int datum) { void *end_address = (void *) ((char *) address + len - 1); stb__memory_node *n; stb_uint32 start = (stb_uint32) address; stb_uint32 end = start + len - 1; int b0 = start >> STB__NPTR_ROOT_SHIFT; int b1 = end >> STB__NPTR_ROOT_SHIFT; int b=b0,i,e0,e1; e0 = STB__NPTR_NODE_OFFSET(start); if (datum <= 0) { // first block n = stb__memtab_root[b0]; if (n) { if (b0 != b1) e1 = STB__NPTR_NODE_NUM-1; else e1 = STB__NPTR_NODE_OFFSET(end); for (i=e0; i <= e1; ++i) if (n->children[i]) function(n->children[i], datum, address, end_address); } if (b1 > b0) { // blocks other than the first and last block for (b=b0+1; b < b1; ++b) { n = stb__memtab_root[b]; if (n) for (i=0; i <= STB__NPTR_NODE_NUM-1; ++i) if (n->children[i]) function(n->children[i], datum, address, end_address); } // last block n = stb__memtab_root[b1]; if (n) { e1 = STB__NPTR_NODE_OFFSET(end); for (i=0; i <= e1; ++i) if (n->children[i]) function(n->children[i], datum, address, end_address); } } } else { if (b1 > b0) { // last block n = stb__memtab_root[b1]; if (n) { e1 = STB__NPTR_NODE_OFFSET(end); for (i=e1; i >= 0; --i) if (n->children[i]) function(n->children[i], datum, address, end_address); } // blocks other than the first and last block for (b=b1-1; b > b0; --b) { n = stb__memtab_root[b]; if (n) for (i=STB__NPTR_NODE_NUM-1; i >= 0; --i) if (n->children[i]) function(n->children[i], datum, address, end_address); } } // first block n = stb__memtab_root[b0]; if (n) { if (b0 != b1) e1 = STB__NPTR_NODE_NUM-1; else e1 = STB__NPTR_NODE_OFFSET(end); for (i=e1; i >= e0; --i) if (n->children[i]) function(n->children[i], datum, address, end_address); } } } static void stb__nptr_delete_pointers(stb__memory_leaf *f, int offset, void *start, void *end) { stb__nptr **p = &f->pointers; while (*p) { stb__nptr *n = *p; if (n->ptr >= start && n->ptr <= end) { // unlink if (n->prev) { *(n->prev) = n->next; if (n->next) n->next->prev = n->prev; } *p = n->next_in_block; stb__nptr_free(n); } else p = &(n->next_in_block); } } static void stb__nptr_delete_targets(stb__memory_leaf *f, int offset, void *start, void *end) { stb__nptr_target **p = &f->targets; while (*p) { stb__nptr_target *n = *p; if (n->ptr >= start && n->ptr <= end) { // null pointers stb__nptr *z = n->first; while (z) { stb__nptr *y = z->next; z->prev = NULL; z->next = NULL; *(void **) z->ptr = NULL; z = y; } // unlink this target *p = n->next_in_block; stb__nptr_free(n); } else p = &(n->next_in_block); } } void stb_nptr_didfree(void *address_being_freed, int len) { // step one: delete all pointers in this block stb__nptr_block(address_being_freed, len, stb__nptr_delete_pointers, 0); // step two: NULL all pointers to this block; do this second to avoid NULLing deleted pointers stb__nptr_block(address_being_freed, len, stb__nptr_delete_targets, 0); } void stb_nptr_free(void *address_being_freed, int len) { free(address_being_freed); stb_nptr_didfree(address_being_freed, len); } static void stb__nptr_move_targets(stb__memory_leaf *f, int offset, void *start, void *end) { stb__nptr_target **t = &f->targets; while (*t) { stb__nptr_target *n = *t; if (n->ptr >= start && n->ptr <= end) { stb__nptr *z; stb__memory_leaf *f; // unlink n *t = n->next_in_block; // update n to new address n->ptr = (void *) ((char *) n->ptr + offset); f = stb__nptr_find_leaf(n->ptr); if (!f) f = stb__nptr_make_leaf(n->ptr); n->next_in_block = f->targets; f->targets = n; // now go through all pointers and make them point here z = n->first; while (z) { *(void**) z->ptr = n->ptr; z = z->next; } } else t = &(n->next_in_block); } } static void stb__nptr_move_pointers(stb__memory_leaf *f, int offset, void *start, void *end) { stb__nptr **p = &f->pointers; while (*p) { stb__nptr *n = *p; if (n->ptr >= start && n->ptr <= end) { // unlink *p = n->next_in_block; n->ptr = (void *) ((int) n->ptr + offset); // move to new block f = stb__nptr_find_leaf(n->ptr); if (!f) f = stb__nptr_make_leaf(n->ptr); n->next_in_block = f->pointers; f->pointers = n; } else p = &(n->next_in_block); } } void stb_nptr_realloc(void *new_address, void *old_address, int len) { if (new_address == old_address) return; // have to move the pointers first, because moving the targets // requires writing to the pointers-to-the-targets, and if some of those moved too, // we need to make sure we don't write to the old memory // step one: move all pointers within the block stb__nptr_block(old_address, len, stb__nptr_move_pointers, (char *) new_address - (char *) old_address); // step two: move all targets within the block stb__nptr_block(old_address, len, stb__nptr_move_targets, (char *) new_address - (char *) old_address); } void stb_nptr_move(void *new_address, void *old_address) { stb_nptr_realloc(new_address, old_address, 1); } void stb_nptr_recache(void) { int i,j; for (i=0; i < STB__NPTR_ROOT_NUM; ++i) if (stb__memtab_root[i]) for (j=0; j < STB__NPTR_NODE_NUM; ++j) if (stb__memtab_root[i]->children[j]) { stb__nptr *p = stb__memtab_root[i]->children[j]->pointers; while (p) { stb_nptr_didset(p->ptr); p = p->next_in_block; } } } #endif // STB_DEFINE #endif // STB_NPTR ////////////////////////////////////////////////////////////////////////////// // // File Processing // #ifdef _MSC_VER #define stb_rename(x,y) _wrename((const wchar_t *)stb__from_utf8(x), (const wchar_t *)stb__from_utf8_alt(y)) #define stb_mktemp _mktemp #else #define stb_mktemp mktemp #define stb_rename rename #endif STB_EXTERN void stb_fput_varlen64(FILE *f, stb_uint64 v); STB_EXTERN stb_uint64 stb_fget_varlen64(FILE *f); STB_EXTERN int stb_size_varlen64(stb_uint64 v); #define stb_filec (char *) stb_file #define stb_fileu (unsigned char *) stb_file STB_EXTERN void * stb_file(char *filename, size_t *length); STB_EXTERN void * stb_file_max(char *filename, size_t *length); STB_EXTERN size_t stb_filelen(FILE *f); STB_EXTERN int stb_filewrite(char *filename, void *data, size_t length); STB_EXTERN int stb_filewritestr(char *filename, char *data); STB_EXTERN char ** stb_stringfile(char *filename, int *len); STB_EXTERN char ** stb_stringfile_trimmed(char *name, int *len, char comm); STB_EXTERN char * stb_fgets(char *buffer, int buflen, FILE *f); STB_EXTERN char * stb_fgets_malloc(FILE *f); STB_EXTERN int stb_fexists(char *filename); STB_EXTERN int stb_fcmp(char *s1, char *s2); STB_EXTERN int stb_feq(char *s1, char *s2); STB_EXTERN time_t stb_ftimestamp(char *filename); STB_EXTERN int stb_fullpath(char *abs, int abs_size, char *rel); STB_EXTERN FILE * stb_fopen(char *filename, char *mode); STB_EXTERN int stb_fclose(FILE *f, int keep); enum { stb_keep_no = 0, stb_keep_yes = 1, stb_keep_if_different = 2, }; STB_EXTERN int stb_copyfile(char *src, char *dest); STB_EXTERN void stb_fput_varlen64(FILE *f, stb_uint64 v); STB_EXTERN stb_uint64 stb_fget_varlen64(FILE *f); STB_EXTERN int stb_size_varlen64(stb_uint64 v); STB_EXTERN void stb_fwrite32(FILE *f, stb_uint32 datum); STB_EXTERN void stb_fput_varlen (FILE *f, int v); STB_EXTERN void stb_fput_varlenu(FILE *f, unsigned int v); STB_EXTERN int stb_fget_varlen (FILE *f); STB_EXTERN stb_uint stb_fget_varlenu(FILE *f); STB_EXTERN void stb_fput_ranged (FILE *f, int v, int b, stb_uint n); STB_EXTERN int stb_fget_ranged (FILE *f, int b, stb_uint n); STB_EXTERN int stb_size_varlen (int v); STB_EXTERN int stb_size_varlenu(unsigned int v); STB_EXTERN int stb_size_ranged (int b, stb_uint n); STB_EXTERN int stb_fread(void *data, size_t len, size_t count, void *f); STB_EXTERN int stb_fwrite(void *data, size_t len, size_t count, void *f); #if 0 typedef struct { FILE *base_file; char *buffer; int buffer_size; int buffer_off; int buffer_left; } STBF; STB_EXTERN STBF *stb_tfopen(char *filename, char *mode); STB_EXTERN int stb_tfread(void *data, size_t len, size_t count, STBF *f); STB_EXTERN int stb_tfwrite(void *data, size_t len, size_t count, STBF *f); #endif #ifdef STB_DEFINE #if 0 STBF *stb_tfopen(char *filename, char *mode) { STBF *z; FILE *f = fopen(filename, mode); if (!f) return NULL; z = (STBF *) malloc(sizeof(*z)); if (!z) { fclose(f); return NULL; } z->base_file = f; if (!strcmp(mode, "rb") || !strcmp(mode, "wb")) { z->buffer_size = 4096; z->buffer_off = z->buffer_size; z->buffer_left = 0; z->buffer = malloc(z->buffer_size); if (!z->buffer) { free(z); fclose(f); return NULL; } } else { z->buffer = 0; z->buffer_size = 0; z->buffer_left = 0; } return z; } int stb_tfread(void *data, size_t len, size_t count, STBF *f) { int total = len*count, done=0; if (!total) return 0; if (total <= z->buffer_left) { memcpy(data, z->buffer + z->buffer_off, total); z->buffer_off += total; z->buffer_left -= total; return count; } else { char *out = (char *) data; // consume all buffered data memcpy(data, z->buffer + z->buffer_off, z->buffer_left); done = z->buffer_left; out += z->buffer_left; z->buffer_left=0; if (total-done > (z->buffer_size >> 1)) { done += fread(out } } } #endif void stb_fwrite32(FILE *f, stb_uint32 x) { fwrite(&x, 4, 1, f); } #if defined(_MSC_VER) || defined(__MINGW32__) #define stb__stat _stat #else #define stb__stat stat #endif int stb_fexists(char *filename) { struct stb__stat buf; return stb__windows( _wstat((const wchar_t *)stb__from_utf8(filename), &buf), stat(filename,&buf) ) == 0; } time_t stb_ftimestamp(char *filename) { struct stb__stat buf; if (stb__windows( _wstat((const wchar_t *)stb__from_utf8(filename), &buf), stat(filename,&buf) ) == 0) { return buf.st_mtime; } else { return 0; } } size_t stb_filelen(FILE *f) { size_t len, pos; pos = ftell(f); fseek(f, 0, SEEK_END); len = ftell(f); fseek(f, pos, SEEK_SET); return len; } void *stb_file(char *filename, size_t *length) { FILE *f = stb__fopen(filename, "rb"); char *buffer; size_t len, len2; if (!f) return NULL; len = stb_filelen(f); buffer = (char *) malloc(len+2); // nul + extra len2 = fread(buffer, 1, len, f); if (len2 == len) { if (length) *length = len; buffer[len] = 0; } else { free(buffer); buffer = NULL; } fclose(f); return buffer; } int stb_filewrite(char *filename, void *data, size_t length) { FILE *f = stb_fopen(filename, "wb"); if (f) { unsigned char *data_ptr = (unsigned char *) data; size_t remaining = length; while (remaining > 0) { size_t len2 = remaining > 65536 ? 65536 : remaining; size_t len3 = fwrite(data_ptr, 1, len2, f); if (len2 != len3) { fprintf(stderr, "Failed while writing %s\n", filename); break; } remaining -= len2; data_ptr += len2; } stb_fclose(f, stb_keep_if_different); } return f != NULL; } int stb_filewritestr(char *filename, char *data) { return stb_filewrite(filename, data, strlen(data)); } void * stb_file_max(char *filename, size_t *length) { FILE *f = stb__fopen(filename, "rb"); char *buffer; size_t len, maxlen; if (!f) return NULL; maxlen = *length; buffer = (char *) malloc(maxlen+1); len = fread(buffer, 1, maxlen, f); buffer[len] = 0; fclose(f); *length = len; return buffer; } char ** stb_stringfile(char *filename, int *plen) { FILE *f = stb__fopen(filename, "rb"); char *buffer, **list=NULL, *s; size_t len, count, i; if (!f) return NULL; len = stb_filelen(f); buffer = (char *) malloc(len+1); len = fread(buffer, 1, len, f); buffer[len] = 0; fclose(f); // two passes through: first time count lines, second time set them for (i=0; i < 2; ++i) { s = buffer; if (i == 1) list[0] = s; count = 1; while (*s) { if (*s == '\n' || *s == '\r') { // detect if both cr & lf are together int crlf = (s[0] + s[1]) == ('\n' + '\r'); if (i == 1) *s = 0; if (crlf) ++s; if (s[1]) { // it's not over yet if (i == 1) list[count] = s+1; ++count; } } ++s; } if (i == 0) { list = (char **) malloc(sizeof(*list) * (count+1) + len+1); if (!list) return NULL; list[count] = 0; // recopy the file so there's just a single allocation to free memcpy(&list[count+1], buffer, len+1); free(buffer); buffer = (char *) &list[count+1]; if (plen) *plen = count; } } return list; } char ** stb_stringfile_trimmed(char *name, int *len, char comment) { int i,n,o=0; char **s = stb_stringfile(name, &n); if (s == NULL) return NULL; for (i=0; i < n; ++i) { char *p = stb_skipwhite(s[i]); if (*p && *p != comment) s[o++] = p; } s[o] = NULL; if (len) *len = o; return s; } char * stb_fgets(char *buffer, int buflen, FILE *f) { char *p; buffer[0] = 0; p = fgets(buffer, buflen, f); if (p) { int n = strlen(p)-1; if (n >= 0) if (p[n] == '\n') p[n] = 0; } return p; } char * stb_fgets_malloc(FILE *f) { // avoid reallocing for small strings char quick_buffer[800]; quick_buffer[sizeof(quick_buffer)-2] = 0; if (!fgets(quick_buffer, sizeof(quick_buffer), f)) return NULL; if (quick_buffer[sizeof(quick_buffer)-2] == 0) { int n = strlen(quick_buffer); if (n > 0 && quick_buffer[n-1] == '\n') quick_buffer[n-1] = 0; return strdup(quick_buffer); } else { char *p; char *a = strdup(quick_buffer); int len = sizeof(quick_buffer)-1; while (!feof(f)) { if (a[len-1] == '\n') break; a = (char *) realloc(a, len*2); p = &a[len]; p[len-2] = 0; if (!fgets(p, len, f)) break; if (p[len-2] == 0) { len += strlen(p); break; } len = len + (len-1); } if (a[len-1] == '\n') a[len-1] = 0; return a; } } int stb_fullpath(char *abs, int abs_size, char *rel) { #ifdef _MSC_VER return _fullpath(abs, rel, abs_size) != NULL; #else if (rel[0] == '/' || rel[0] == '~') { if ((int) strlen(rel) >= abs_size) return 0; strcpy(abs,rel); return STB_TRUE; } else { int n; getcwd(abs, abs_size); n = strlen(abs); if (n+(int) strlen(rel)+2 <= abs_size) { abs[n] = '/'; strcpy(abs+n+1, rel); return STB_TRUE; } else { return STB_FALSE; } } #endif } static int stb_fcmp_core(FILE *f, FILE *g) { char buf1[1024],buf2[1024]; int n1,n2, res=0; while (1) { n1 = fread(buf1, 1, sizeof(buf1), f); n2 = fread(buf2, 1, sizeof(buf2), g); res = memcmp(buf1,buf2,stb_min(n1,n2)); if (res) break; if (n1 != n2) { res = n1 < n2 ? -1 : 1; break; } if (n1 == 0) break; } fclose(f); fclose(g); return res; } int stb_fcmp(char *s1, char *s2) { FILE *f = stb__fopen(s1, "rb"); FILE *g = stb__fopen(s2, "rb"); if (f == NULL || g == NULL) { if (f) fclose(f); if (g) { fclose(g); return STB_TRUE; } return f != NULL; } return stb_fcmp_core(f,g); } int stb_feq(char *s1, char *s2) { FILE *f = stb__fopen(s1, "rb"); FILE *g = stb__fopen(s2, "rb"); if (f == NULL || g == NULL) { if (f) fclose(f); if (g) fclose(g); return f == g; } // feq is faster because it shortcuts if they're different length if (stb_filelen(f) != stb_filelen(g)) { fclose(f); fclose(g); return 0; } return !stb_fcmp_core(f,g); } static stb_ptrmap *stb__files; typedef struct { char *temp_name; char *name; int errors; } stb__file_data; FILE * stb_fopen(char *filename, char *mode) { FILE *f; char name_full[4096]; char temp_full[sizeof(name_full) + 12]; int p; #ifdef _MSC_VER int j; #endif if (mode[0] != 'w' && !strchr(mode, '+')) return stb__fopen(filename, mode); // save away the full path to the file so if the program // changes the cwd everything still works right! unix has // better ways to do this, but we have to work in windows name_full[0] = '\0'; // stb_fullpath reads name_full[0] if (stb_fullpath(name_full, sizeof(name_full), filename)==0) return 0; // try to generate a temporary file in the same directory p = strlen(name_full)-1; while (p > 0 && name_full[p] != '/' && name_full[p] != '\\' && name_full[p] != ':' && name_full[p] != '~') --p; ++p; memcpy(temp_full, name_full, p); #ifdef _MSC_VER // try multiple times to make a temp file... just in // case some other process makes the name first for (j=0; j < 32; ++j) { strcpy(temp_full+p, "stmpXXXXXX"); if (stb_mktemp(temp_full) == NULL) return 0; f = fopen(temp_full, mode); if (f != NULL) break; } #else { strcpy(temp_full+p, "stmpXXXXXX"); #ifdef __MINGW32__ int fd = open(mktemp(temp_full), O_RDWR); #else int fd = mkstemp(temp_full); #endif if (fd == -1) return NULL; f = fdopen(fd, mode); if (f == NULL) { unlink(temp_full); close(fd); return NULL; } } #endif if (f != NULL) { stb__file_data *d = (stb__file_data *) malloc(sizeof(*d)); if (!d) { assert(0); /* NOTREACHED */fclose(f); return NULL; } if (stb__files == NULL) stb__files = stb_ptrmap_create(); d->temp_name = strdup(temp_full); d->name = strdup(name_full); d->errors = 0; stb_ptrmap_add(stb__files, f, d); return f; } return NULL; } int stb_fclose(FILE *f, int keep) { stb__file_data *d; int ok = STB_FALSE; if (f == NULL) return 0; if (ferror(f)) keep = stb_keep_no; fclose(f); if (stb__files && stb_ptrmap_remove(stb__files, f, (void **) &d)) { if (stb__files->count == 0) { stb_ptrmap_destroy(stb__files); stb__files = NULL; } } else return STB_TRUE; // not special if (keep == stb_keep_if_different) { // check if the files are identical if (stb_feq(d->name, d->temp_name)) { keep = stb_keep_no; ok = STB_TRUE; // report success if no change } } if (keep != stb_keep_no) { if (stb_fexists(d->name) && remove(d->name)) { // failed to delete old, so don't keep new keep = stb_keep_no; } else { if (!stb_rename(d->temp_name, d->name)) ok = STB_TRUE; else keep=stb_keep_no; } } if (keep == stb_keep_no) remove(d->temp_name); free(d->temp_name); free(d->name); free(d); return ok; } int stb_copyfile(char *src, char *dest) { char raw_buffer[1024]; char *buffer; int buf_size = 65536; FILE *f, *g; // if file already exists at destination, do nothing if (stb_feq(src, dest)) return STB_TRUE; // open file f = stb__fopen(src, "rb"); if (f == NULL) return STB_FALSE; // open file for writing g = stb__fopen(dest, "wb"); if (g == NULL) { fclose(f); return STB_FALSE; } buffer = (char *) malloc(buf_size); if (buffer == NULL) { buffer = raw_buffer; buf_size = sizeof(raw_buffer); } while (!feof(f)) { int n = fread(buffer, 1, buf_size, f); if (n != 0) fwrite(buffer, 1, n, g); } fclose(f); if (buffer != raw_buffer) free(buffer); fclose(g); return STB_TRUE; } // varlen: // v' = (v >> 31) + (v < 0 ? ~v : v)<<1; // small abs(v) => small v' // output v as big endian v'+k for v' <= k: // 1 byte : v' <= 0x00000080 ( -64 <= v < 64) 7 bits // 2 bytes: v' <= 0x00004000 (-8192 <= v < 8192) 14 bits // 3 bytes: v' <= 0x00200000 21 bits // 4 bytes: v' <= 0x10000000 28 bits // the number of most significant 1-bits in the first byte // equals the number of bytes after the first #define stb__varlen_xform(v) (v<0 ? (~v << 1)+1 : (v << 1)) int stb_size_varlen(int v) { return stb_size_varlenu(stb__varlen_xform(v)); } int stb_size_varlenu(unsigned int v) { if (v < 0x00000080) return 1; if (v < 0x00004000) return 2; if (v < 0x00200000) return 3; if (v < 0x10000000) return 4; return 5; } void stb_fput_varlen(FILE *f, int v) { stb_fput_varlenu(f, stb__varlen_xform(v)); } void stb_fput_varlenu(FILE *f, unsigned int z) { if (z >= 0x10000000) fputc(0xF0,f); if (z >= 0x00200000) fputc((z < 0x10000000 ? 0xE0 : 0)+(z>>24),f); if (z >= 0x00004000) fputc((z < 0x00200000 ? 0xC0 : 0)+(z>>16),f); if (z >= 0x00000080) fputc((z < 0x00004000 ? 0x80 : 0)+(z>> 8),f); fputc(z,f); } #define stb_fgetc(f) ((unsigned char) fgetc(f)) int stb_fget_varlen(FILE *f) { unsigned int z = stb_fget_varlenu(f); return (z & 1) ? ~(z>>1) : (z>>1); } unsigned int stb_fget_varlenu(FILE *f) { unsigned int z; unsigned char d; d = stb_fgetc(f); if (d >= 0x80) { if (d >= 0xc0) { if (d >= 0xe0) { if (d == 0xf0) z = stb_fgetc(f) << 24; else z = (d - 0xe0) << 24; z += stb_fgetc(f) << 16; } else z = (d - 0xc0) << 16; z += stb_fgetc(f) << 8; } else z = (d - 0x80) << 8; z += stb_fgetc(f); } else z = d; return z; } stb_uint64 stb_fget_varlen64(FILE *f) { stb_uint64 z; unsigned char d; d = stb_fgetc(f); if (d >= 0x80) { if (d >= 0xc0) { if (d >= 0xe0) { if (d >= 0xf0) { if (d >= 0xf8) { if (d >= 0xfc) { if (d >= 0xfe) { if (d >= 0xff) z = (stb_uint64) stb_fgetc(f) << 56; else z = (stb_uint64) (d - 0xfe) << 56; z |= (stb_uint64) stb_fgetc(f) << 48; } else z = (stb_uint64) (d - 0xfc) << 48; z |= (stb_uint64) stb_fgetc(f) << 40; } else z = (stb_uint64) (d - 0xf8) << 40; z |= (stb_uint64) stb_fgetc(f) << 32; } else z = (stb_uint64) (d - 0xf0) << 32; z |= (stb_uint) stb_fgetc(f) << 24; } else z = (stb_uint) (d - 0xe0) << 24; z |= (stb_uint) stb_fgetc(f) << 16; } else z = (stb_uint) (d - 0xc0) << 16; z |= (stb_uint) stb_fgetc(f) << 8; } else z = (stb_uint) (d - 0x80) << 8; z |= stb_fgetc(f); } else z = d; return (z & 1) ? ~(z >> 1) : (z >> 1); } int stb_size_varlen64(stb_uint64 v) { if (v < 0x00000080) return 1; if (v < 0x00004000) return 2; if (v < 0x00200000) return 3; if (v < 0x10000000) return 4; if (v < STB_IMM_UINT64(0x0000000800000000)) return 5; if (v < STB_IMM_UINT64(0x0000040000000000)) return 6; if (v < STB_IMM_UINT64(0x0002000000000000)) return 7; if (v < STB_IMM_UINT64(0x0100000000000000)) return 8; return 9; } void stb_fput_varlen64(FILE *f, stb_uint64 v) { stb_uint64 z = stb__varlen_xform(v); int first=1; if (z >= STB_IMM_UINT64(0x100000000000000)) { fputc(0xff,f); first=0; } if (z >= STB_IMM_UINT64(0x02000000000000)) fputc((first ? 0xFE : 0)+(char)(z>>56),f), first=0; if (z >= STB_IMM_UINT64(0x00040000000000)) fputc((first ? 0xFC : 0)+(char)(z>>48),f), first=0; if (z >= STB_IMM_UINT64(0x00000800000000)) fputc((first ? 0xF8 : 0)+(char)(z>>40),f), first=0; if (z >= STB_IMM_UINT64(0x00000010000000)) fputc((first ? 0xF0 : 0)+(char)(z>>32),f), first=0; if (z >= STB_IMM_UINT64(0x00000000200000)) fputc((first ? 0xE0 : 0)+(char)(z>>24),f), first=0; if (z >= STB_IMM_UINT64(0x00000000004000)) fputc((first ? 0xC0 : 0)+(char)(z>>16),f), first=0; if (z >= STB_IMM_UINT64(0x00000000000080)) fputc((first ? 0x80 : 0)+(char)(z>> 8),f), first=0; fputc((char)z,f); } void stb_fput_ranged(FILE *f, int v, int b, stb_uint n) { v -= b; if (n <= (1 << 31)) assert((stb_uint) v < n); if (n > (1 << 24)) fputc(v >> 24, f); if (n > (1 << 16)) fputc(v >> 16, f); if (n > (1 << 8)) fputc(v >> 8, f); fputc(v,f); } int stb_fget_ranged(FILE *f, int b, stb_uint n) { unsigned int v=0; if (n > (1 << 24)) v += stb_fgetc(f) << 24; if (n > (1 << 16)) v += stb_fgetc(f) << 16; if (n > (1 << 8)) v += stb_fgetc(f) << 8; v += stb_fgetc(f); return b+v; } int stb_size_ranged(int b, stb_uint n) { if (n > (1 << 24)) return 4; if (n > (1 << 16)) return 3; if (n > (1 << 8)) return 2; return 1; } void stb_fput_string(FILE *f, char *s) { int len = strlen(s); stb_fput_varlenu(f, len); fwrite(s, 1, len, f); } // inverse of the above algorithm char *stb_fget_string(FILE *f, void *p) { char *s; int len = stb_fget_varlenu(f); if (len > 4096) return NULL; s = p ? stb_malloc_string(p, len+1) : (char *) malloc(len+1); fread(s, 1, len, f); s[len] = 0; return s; } char *stb_strdup(char *str, void *pool) { int len = strlen(str); char *p = stb_malloc_string(pool, len+1); strcpy(p, str); return p; } // strip the trailing '/' or '\\' from a directory so we can refer to it // as a file for _stat() char *stb_strip_final_slash(char *t) { if (t[0]) { char *z = t + strlen(t) - 1; // *z is the last character if (*z == '\\' || *z == '/') if (z != t+2 || t[1] != ':') // but don't strip it if it's e.g. "c:/" *z = 0; if (*z == '\\') *z = '/'; // canonicalize to make sure it matches db } return t; } char *stb_strip_final_slash_regardless(char *t) { if (t[0]) { char *z = t + strlen(t) - 1; // *z is the last character if (*z == '\\' || *z == '/') *z = 0; if (*z == '\\') *z = '/'; // canonicalize to make sure it matches db } return t; } #endif ////////////////////////////////////////////////////////////////////////////// // // Options parsing // STB_EXTERN char **stb_getopt_param(int *argc, char **argv, char *param); STB_EXTERN char **stb_getopt(int *argc, char **argv); STB_EXTERN void stb_getopt_free(char **opts); #ifdef STB_DEFINE void stb_getopt_free(char **opts) { int i; char ** o2 = opts; for (i=0; i < stb_arr_len(o2); ++i) free(o2[i]); stb_arr_free(o2); } char **stb_getopt(int *argc, char **argv) { return stb_getopt_param(argc, argv, ""); } char **stb_getopt_param(int *argc, char **argv, char *param) { char ** opts=NULL; int i,j=1; for (i=1; i < *argc; ++i) { if (argv[i][0] != '-') { argv[j++] = argv[i]; } else { if (argv[i][1] == 0) { // plain - == don't parse further options ++i; while (i < *argc) argv[j++] = argv[i++]; break; } else { int k; char *q = argv[i]; // traverse options list for (k=1; q[k]; ++k) { char *s; if (strchr(param, q[k])) { // does it take a parameter? char *t = &q[k+1], z = q[k]; int len=0; if (*t == 0) { if (i == *argc-1) { // takes a parameter, but none found *argc = 0; stb_getopt_free(opts); return NULL; } t = argv[++i]; } else k += strlen(t); len = strlen(t); s = (char *) malloc(len+2); if (!s) return NULL; s[0] = z; strcpy(s+1, t); } else { // no parameter s = (char *) malloc(2); if (!s) return NULL; s[0] = q[k]; s[1] = 0; } stb_arr_push(opts, s); } } } } stb_arr_push(opts, NULL); *argc = j; return opts; } #endif ////////////////////////////////////////////////////////////////////////////// // // Portable directory reading // STB_EXTERN char **stb_readdir_files (char *dir); STB_EXTERN char **stb_readdir_files_mask(char *dir, char *wild); STB_EXTERN char **stb_readdir_subdirs(char *dir); STB_EXTERN char **stb_readdir_subdirs_mask(char *dir, char *wild); STB_EXTERN void stb_readdir_free (char **files); STB_EXTERN char **stb_readdir_recursive(char *dir, char *filespec); STB_EXTERN void stb_delete_directory_recursive(char *dir); #ifdef STB_DEFINE #ifdef _MSC_VER #include #else #include #include #endif void stb_readdir_free(char **files) { char **f2 = files; int i; for (i=0; i < stb_arr_len(f2); ++i) free(f2[i]); stb_arr_free(f2); } static int isdotdirname(char *name) { if (name[0] == '.') return (name[1] == '.') ? !name[2] : !name[1]; return 0; } STB_EXTERN int stb_wildmatchi(char *expr, char *candidate); static char **readdir_raw(char *dir, int return_subdirs, char *mask) { char **results = NULL; char buffer[4096], with_slash[4096]; size_t n; #ifdef _MSC_VER stb__wchar *ws; struct _wfinddata_t data; #ifdef _WIN64 const intptr_t none = -1; intptr_t z; #else const long none = -1; long z; #endif #else // !_MSC_VER const DIR *none = NULL; DIR *z; #endif n = stb_strscpy(buffer,dir,sizeof(buffer)); if (!n || n >= sizeof(buffer)) return NULL; stb_fixpath(buffer); n--; if (n > 0 && (buffer[n-1] != '/')) { buffer[n++] = '/'; } buffer[n] = 0; if (!stb_strscpy(with_slash,buffer,sizeof(with_slash))) return NULL; #ifdef _MSC_VER if (!stb_strscpy(buffer+n,"*.*",sizeof(buffer)-n)) return NULL; ws = stb__from_utf8(buffer); z = _wfindfirst((const wchar_t *)ws, &data); #else z = opendir(dir); #endif if (z != none) { int nonempty = STB_TRUE; #ifndef _MSC_VER struct dirent *data = readdir(z); nonempty = (data != NULL); #endif if (nonempty) { do { int is_subdir; #ifdef _MSC_VER char *name = stb__to_utf8((stb__wchar *)data.name); if (name == NULL) { fprintf(stderr, "%s to convert '%S' to %s!\n", "Unable", data.name, "utf8"); continue; } is_subdir = !!(data.attrib & _A_SUBDIR); #else char *name = data->d_name; if (!stb_strscpy(buffer+n,name,sizeof(buffer)-n)) break; // Could follow DT_LNK, but would need to check for recursive links. is_subdir = !!(data->d_type & DT_DIR); #endif if (is_subdir == return_subdirs) { if (!is_subdir || !isdotdirname(name)) { if (!mask || stb_wildmatchi(mask, name)) { char buffer[4096],*p=buffer; if ( stb_snprintf(buffer, sizeof(buffer), "%s%s", with_slash, name) < 0 ) break; if (buffer[0] == '.' && buffer[1] == '/') p = buffer+2; stb_arr_push(results, strdup(p)); } } } } #ifdef _MSC_VER while (0 == _wfindnext(z, &data)); #else while ((data = readdir(z)) != NULL); #endif } #ifdef _MSC_VER _findclose(z); #else closedir(z); #endif } return results; } char **stb_readdir_files (char *dir) { return readdir_raw(dir, 0, NULL); } char **stb_readdir_subdirs(char *dir) { return readdir_raw(dir, 1, NULL); } char **stb_readdir_files_mask(char *dir, char *wild) { return readdir_raw(dir, 0, wild); } char **stb_readdir_subdirs_mask(char *dir, char *wild) { return readdir_raw(dir, 1, wild); } int stb__rec_max=0x7fffffff; static char **stb_readdir_rec(char **sofar, char *dir, char *filespec) { char **files; char ** dirs; char **p; if (stb_arr_len(sofar) >= stb__rec_max) return sofar; files = stb_readdir_files_mask(dir, filespec); stb_arr_for(p, files) { stb_arr_push(sofar, strdup(*p)); if (stb_arr_len(sofar) >= stb__rec_max) break; } stb_readdir_free(files); if (stb_arr_len(sofar) >= stb__rec_max) return sofar; dirs = stb_readdir_subdirs(dir); stb_arr_for(p, dirs) sofar = stb_readdir_rec(sofar, *p, filespec); stb_readdir_free(dirs); return sofar; } char **stb_readdir_recursive(char *dir, char *filespec) { return stb_readdir_rec(NULL, dir, filespec); } void stb_delete_directory_recursive(char *dir) { char **list = stb_readdir_subdirs(dir); int i; for (i=0; i < stb_arr_len(list); ++i) stb_delete_directory_recursive(list[i]); stb_arr_free(list); list = stb_readdir_files(dir); for (i=0; i < stb_arr_len(list); ++i) if (!remove(list[i])) { // on windows, try again after making it writeable; don't ALWAYS // do this first since that would be slow in the normal case #ifdef _MSC_VER _chmod(list[i], _S_IWRITE); remove(list[i]); #endif } stb_arr_free(list); stb__windows(_rmdir,rmdir)(dir); } #endif ////////////////////////////////////////////////////////////////////////////// // // construct trees from filenames; useful for cmirror summaries typedef struct stb_dirtree2 stb_dirtree2; struct stb_dirtree2 { stb_dirtree2 **subdirs; // make convenient for stb_summarize_tree int num_subdir; float weight; // actual data char *fullpath; char *relpath; char **files; }; STB_EXTERN stb_dirtree2 *stb_dirtree2_from_files_relative(char *src, char **filelist, int count); STB_EXTERN stb_dirtree2 *stb_dirtree2_from_files(char **filelist, int count); STB_EXTERN int stb_dir_is_prefix(char *dir, int dirlen, char *file); #ifdef STB_DEFINE int stb_dir_is_prefix(char *dir, int dirlen, char *file) { if (dirlen == 0) return STB_TRUE; if (stb_strnicmp(dir, file, dirlen)) return STB_FALSE; if (file[dirlen] == '/' || file[dirlen] == '\\') return STB_TRUE; return STB_FALSE; } stb_dirtree2 *stb_dirtree2_from_files_relative(char *src, char **filelist, int count) { char buffer1[1024]; int i; int dlen = strlen(src), elen; stb_dirtree2 *d; char ** descendents = NULL; char ** files = NULL; char *s; if (!count) return NULL; // first find all the ones that belong here... note this is will take O(NM) with N files and M subdirs for (i=0; i < count; ++i) { if (stb_dir_is_prefix(src, dlen, filelist[i])) { stb_arr_push(descendents, filelist[i]); } } if (descendents == NULL) return NULL; elen = dlen; // skip a leading slash if (elen == 0 && (descendents[0][0] == '/' || descendents[0][0] == '\\')) ++elen; else if (elen) ++elen; // now extract all the ones that have their root here for (i=0; i < stb_arr_len(descendents);) { if (!stb_strchr2(descendents[i]+elen, '/', '\\')) { stb_arr_push(files, descendents[i]); descendents[i] = descendents[stb_arr_len(descendents)-1]; stb_arr_pop(descendents); } else ++i; } // now create a record d = (stb_dirtree2 *) malloc(sizeof(*d)); d->files = files; d->subdirs = NULL; d->fullpath = strdup(src); s = stb_strrchr2(d->fullpath, '/', '\\'); if (s) ++s; else s = d->fullpath; d->relpath = s; // now create the children qsort(descendents, stb_arr_len(descendents), sizeof(char *), stb_qsort_stricmp(0)); buffer1[0] = 0; for (i=0; i < stb_arr_len(descendents); ++i) { char buffer2[1024]; char *s = descendents[i] + elen, *t; t = stb_strchr2(s, '/', '\\'); assert(t); stb_strncpy(buffer2, descendents[i], t-descendents[i]+1); if (stb_stricmp(buffer1, buffer2)) { stb_dirtree2 *t = stb_dirtree2_from_files_relative(buffer2, descendents, stb_arr_len(descendents)); assert(t != NULL); strcpy(buffer1, buffer2); stb_arr_push(d->subdirs, t); } } d->num_subdir = stb_arr_len(d->subdirs); d->weight = 0; return d; } stb_dirtree2 *stb_dirtree2_from_files(char **filelist, int count) { return stb_dirtree2_from_files_relative("", filelist, count); } #endif ////////////////////////////////////////////////////////////////////////////// // // Checksums: CRC-32, ADLER32, SHA-1 // // CRC-32 and ADLER32 allow streaming blocks // SHA-1 requires either a complete buffer, max size 2^32 - 73 // or it can checksum directly from a file, max 2^61 #define STB_ADLER32_SEED 1 #define STB_CRC32_SEED 0 // note that we logical NOT this in the code STB_EXTERN stb_uint stb_adler32(stb_uint adler32, stb_uchar *buffer, stb_uint buflen); STB_EXTERN stb_uint stb_crc32_block(stb_uint crc32, stb_uchar *buffer, stb_uint len); STB_EXTERN stb_uint stb_crc32(unsigned char *buffer, stb_uint len); STB_EXTERN void stb_sha1( unsigned char output[20], unsigned char *buffer, unsigned int len); STB_EXTERN int stb_sha1_file(unsigned char output[20], char *file); STB_EXTERN void stb_sha1_readable(char display[27], unsigned char sha[20]); #ifdef STB_DEFINE stb_uint stb_crc32_block(stb_uint crc, unsigned char *buffer, stb_uint len) { static stb_uint crc_table[256]; stb_uint i,j,s; crc = ~crc; if (crc_table[1] == 0) for(i=0; i < 256; i++) { for (s=i, j=0; j < 8; ++j) s = (s >> 1) ^ (s & 1 ? 0xedb88320 : 0); crc_table[i] = s; } for (i=0; i < len; ++i) crc = (crc >> 8) ^ crc_table[buffer[i] ^ (crc & 0xff)]; return ~crc; } stb_uint stb_crc32(unsigned char *buffer, stb_uint len) { return stb_crc32_block(0, buffer, len); } stb_uint stb_adler32(stb_uint adler32, stb_uchar *buffer, stb_uint buflen) { const unsigned long ADLER_MOD = 65521; unsigned long s1 = adler32 & 0xffff, s2 = adler32 >> 16; unsigned long blocklen, i; blocklen = buflen % 5552; while (buflen) { for (i=0; i + 7 < blocklen; i += 8) { s1 += buffer[0], s2 += s1; s1 += buffer[1], s2 += s1; s1 += buffer[2], s2 += s1; s1 += buffer[3], s2 += s1; s1 += buffer[4], s2 += s1; s1 += buffer[5], s2 += s1; s1 += buffer[6], s2 += s1; s1 += buffer[7], s2 += s1; buffer += 8; } for (; i < blocklen; ++i) s1 += *buffer++, s2 += s1; s1 %= ADLER_MOD, s2 %= ADLER_MOD; buflen -= blocklen; blocklen = 5552; } return (s2 << 16) + s1; } static void stb__sha1(stb_uchar *chunk, stb_uint h[5]) { int i; stb_uint a,b,c,d,e; stb_uint w[80]; for (i=0; i < 16; ++i) w[i] = stb_big32(&chunk[i*4]); for (i=16; i < 80; ++i) { stb_uint t; t = w[i-3] ^ w[i-8] ^ w[i-14] ^ w[i-16]; w[i] = (t + t) | (t >> 31); } a = h[0]; b = h[1]; c = h[2]; d = h[3]; e = h[4]; #define STB__SHA1(k,f) \ { \ stb_uint temp = (a << 5) + (a >> 27) + (f) + e + (k) + w[i]; \ e = d; \ d = c; \ c = (b << 30) + (b >> 2); \ b = a; \ a = temp; \ } i=0; for (; i < 20; ++i) STB__SHA1(0x5a827999, d ^ (b & (c ^ d)) ); for (; i < 40; ++i) STB__SHA1(0x6ed9eba1, b ^ c ^ d ); for (; i < 60; ++i) STB__SHA1(0x8f1bbcdc, (b & c) + (d & (b ^ c)) ); for (; i < 80; ++i) STB__SHA1(0xca62c1d6, b ^ c ^ d ); #undef STB__SHA1 h[0] += a; h[1] += b; h[2] += c; h[3] += d; h[4] += e; } void stb_sha1(stb_uchar output[20], stb_uchar *buffer, stb_uint len) { unsigned char final_block[128]; stb_uint end_start, final_len, j; int i; stb_uint h[5]; h[0] = 0x67452301; h[1] = 0xefcdab89; h[2] = 0x98badcfe; h[3] = 0x10325476; h[4] = 0xc3d2e1f0; // we need to write padding to the last one or two // blocks, so build those first into 'final_block' // we have to write one special byte, plus the 8-byte length // compute the block where the data runs out end_start = len & ~63; // compute the earliest we can encode the length if (((len+9) & ~63) == end_start) { // it all fits in one block, so fill a second-to-last block end_start -= 64; } final_len = end_start + 128; // now we need to copy the data in assert(end_start + 128 >= len+9); assert(end_start < len || len < 64-9); j = 0; if (end_start > len) j = (stb_uint) - (int) end_start; for (; end_start + j < len; ++j) final_block[j] = buffer[end_start + j]; final_block[j++] = 0x80; while (j < 128-5) // 5 byte length, so write 4 extra padding bytes final_block[j++] = 0; // big-endian size final_block[j++] = len >> 29; final_block[j++] = len >> 21; final_block[j++] = len >> 13; final_block[j++] = len >> 5; final_block[j++] = len << 3; assert(j == 128 && end_start + j == final_len); for (j=0; j < final_len; j += 64) { // 512-bit chunks if (j+64 >= end_start+64) stb__sha1(&final_block[j - end_start], h); else stb__sha1(&buffer[j], h); } for (i=0; i < 5; ++i) { output[i*4 + 0] = h[i] >> 24; output[i*4 + 1] = h[i] >> 16; output[i*4 + 2] = h[i] >> 8; output[i*4 + 3] = h[i] >> 0; } } #ifdef _MSC_VER int stb_sha1_file(stb_uchar output[20], char *file) { int i; stb_uint64 length=0; unsigned char buffer[128]; FILE *f = stb__fopen(file, "rb"); stb_uint h[5]; if (f == NULL) return 0; // file not found h[0] = 0x67452301; h[1] = 0xefcdab89; h[2] = 0x98badcfe; h[3] = 0x10325476; h[4] = 0xc3d2e1f0; for(;;) { int n = fread(buffer, 1, 64, f); if (n == 64) { stb__sha1(buffer, h); length += n; } else { int block = 64; length += n; buffer[n++] = 0x80; // if there isn't enough room for the length, double the block if (n + 8 > 64) block = 128; // pad to end memset(buffer+n, 0, block-8-n); i = block - 8; buffer[i++] = (stb_uchar) (length >> 53); buffer[i++] = (stb_uchar) (length >> 45); buffer[i++] = (stb_uchar) (length >> 37); buffer[i++] = (stb_uchar) (length >> 29); buffer[i++] = (stb_uchar) (length >> 21); buffer[i++] = (stb_uchar) (length >> 13); buffer[i++] = (stb_uchar) (length >> 5); buffer[i++] = (stb_uchar) (length << 3); assert(i == block); stb__sha1(buffer, h); if (block == 128) stb__sha1(buffer+64, h); else assert(block == 64); break; } } fclose(f); for (i=0; i < 5; ++i) { output[i*4 + 0] = h[i] >> 24; output[i*4 + 1] = h[i] >> 16; output[i*4 + 2] = h[i] >> 8; output[i*4 + 3] = h[i] >> 0; } return 1; } #endif // _MSC_VER // client can truncate this wherever they like void stb_sha1_readable(char display[27], unsigned char sha[20]) { char encoding[65] = "0123456789abcdefghijklmnopqrstuv" "wxyzABCDEFGHIJKLMNOPQRSTUVWXYZ%$"; int num_bits = 0, acc=0; int i=0,o=0; while (o < 26) { int v; // expand the accumulator if (num_bits < 6) { assert(i != 20); acc += sha[i++] << num_bits; num_bits += 8; } v = acc & ((1 << 6) - 1); display[o++] = encoding[v]; acc >>= 6; num_bits -= 6; } assert(num_bits == 20*8 - 26*6); display[o++] = encoding[acc]; } #endif // STB_DEFINE /////////////////////////////////////////////////////////// // // simplified WINDOWS registry interface... hopefully // we'll never actually use this? #if defined(_WIN32) STB_EXTERN void * stb_reg_open(char *mode, char *where); // mode: "rHKLM" or "rHKCU" or "w.." STB_EXTERN void stb_reg_close(void *reg); STB_EXTERN int stb_reg_read(void *zreg, char *str, void *data, unsigned long len); STB_EXTERN int stb_reg_read_string(void *zreg, char *str, char *data, int len); STB_EXTERN void stb_reg_write(void *zreg, char *str, void *data, unsigned long len); STB_EXTERN void stb_reg_write_string(void *zreg, char *str, char *data); #if defined(STB_DEFINE) && !defined(STB_NO_REGISTRY) #define STB_HAS_REGISTRY #ifndef _WINDOWS_ #define HKEY void * STB_EXTERN __declspec(dllimport) long __stdcall RegCloseKey ( HKEY hKey ); STB_EXTERN __declspec(dllimport) long __stdcall RegCreateKeyExA ( HKEY hKey, const char * lpSubKey, int Reserved, char * lpClass, int dwOptions, int samDesired, void *lpSecurityAttributes, HKEY * phkResult, int * lpdwDisposition ); STB_EXTERN __declspec(dllimport) long __stdcall RegDeleteKeyA ( HKEY hKey, const char * lpSubKey ); STB_EXTERN __declspec(dllimport) long __stdcall RegQueryValueExA ( HKEY hKey, const char * lpValueName, int * lpReserved, unsigned long * lpType, unsigned char * lpData, unsigned long * lpcbData ); STB_EXTERN __declspec(dllimport) long __stdcall RegSetValueExA ( HKEY hKey, const char * lpValueName, int Reserved, int dwType, const unsigned char* lpData, int cbData ); STB_EXTERN __declspec(dllimport) long __stdcall RegOpenKeyExA ( HKEY hKey, const char * lpSubKey, int ulOptions, int samDesired, HKEY * phkResult ); #endif // _WINDOWS_ #define STB__REG_OPTION_NON_VOLATILE 0 #define STB__REG_KEY_ALL_ACCESS 0x000f003f #define STB__REG_KEY_READ 0x00020019 void *stb_reg_open(char *mode, char *where) { long res; HKEY base; HKEY zreg; if (!stb_stricmp(mode+1, "cu") || !stb_stricmp(mode+1, "hkcu")) base = (HKEY) 0x80000001; // HKCU else if (!stb_stricmp(mode+1, "lm") || !stb_stricmp(mode+1, "hklm")) base = (HKEY) 0x80000002; // HKLM else return NULL; if (mode[0] == 'r') res = RegOpenKeyExA(base, where, 0, STB__REG_KEY_READ, &zreg); else if (mode[0] == 'w') res = RegCreateKeyExA(base, where, 0, NULL, STB__REG_OPTION_NON_VOLATILE, STB__REG_KEY_ALL_ACCESS, NULL, &zreg, NULL); else return NULL; return res ? NULL : zreg; } void stb_reg_close(void *reg) { RegCloseKey((HKEY) reg); } #define STB__REG_SZ 1 #define STB__REG_BINARY 3 #define STB__REG_DWORD 4 int stb_reg_read(void *zreg, char *str, void *data, unsigned long len) { unsigned long type; unsigned long alen = len; if (0 == RegQueryValueExA((HKEY) zreg, str, 0, &type, (unsigned char *) data, &len)) if (type == STB__REG_BINARY || type == STB__REG_SZ || type == STB__REG_DWORD) { if (len < alen) *((char *) data + len) = 0; return 1; } return 0; } void stb_reg_write(void *zreg, char *str, void *data, unsigned long len) { if (zreg) RegSetValueExA((HKEY) zreg, str, 0, STB__REG_BINARY, (const unsigned char *) data, len); } int stb_reg_read_string(void *zreg, char *str, char *data, int len) { if (!stb_reg_read(zreg, str, data, len)) return 0; data[len-1] = 0; // force a 0 at the end of the string no matter what return 1; } void stb_reg_write_string(void *zreg, char *str, char *data) { if (zreg) RegSetValueExA((HKEY) zreg, str, 0, STB__REG_SZ, (const unsigned char *) data, strlen(data)+1); } #endif // STB_DEFINE #endif // _WIN32 ////////////////////////////////////////////////////////////////////////////// // // stb_cfg - This is like the registry, but the config info // is all stored in plain old files where we can // backup and restore them easily. The LOCATION of // the config files is gotten from... the registry! #ifndef STB_NO_STB_STRINGS typedef struct stb_cfg_st stb_cfg; STB_EXTERN stb_cfg * stb_cfg_open(char *config, char *mode); // mode = "r", "w" STB_EXTERN void stb_cfg_close(stb_cfg *cfg); STB_EXTERN int stb_cfg_read(stb_cfg *cfg, char *key, void *value, int len); STB_EXTERN void stb_cfg_write(stb_cfg *cfg, char *key, void *value, int len); STB_EXTERN int stb_cfg_read_string(stb_cfg *cfg, char *key, char *value, int len); STB_EXTERN void stb_cfg_write_string(stb_cfg *cfg, char *key, char *value); STB_EXTERN int stb_cfg_delete(stb_cfg *cfg, char *key); STB_EXTERN void stb_cfg_set_directory(char *dir); #ifdef STB_DEFINE typedef struct { char *key; void *value; int value_len; } stb__cfg_item; struct stb_cfg_st { stb__cfg_item *data; char *loaded_file; // this needs to be freed FILE *f; // write the data to this file on close }; static char *stb__cfg_sig = "sTbCoNfIg!\0\0"; static char stb__cfg_dir[512]; STB_EXTERN void stb_cfg_set_directory(char *dir) { strcpy(stb__cfg_dir, dir); } STB_EXTERN stb_cfg * stb_cfg_open(char *config, char *mode) { size_t len; stb_cfg *z; char file[512]; if (mode[0] != 'r' && mode[0] != 'w') return NULL; if (!stb__cfg_dir[0]) { #ifdef _WIN32 strcpy(stb__cfg_dir, "c:/stb"); #else strcpy(stb__cfg_dir, "~/.stbconfig"); #endif #ifdef STB_HAS_REGISTRY { void *reg = stb_reg_open("rHKLM", "Software\\SilverSpaceship\\stb"); if (reg) { stb_reg_read_string(reg, "config_dir", stb__cfg_dir, sizeof(stb__cfg_dir)); stb_reg_close(reg); } } #endif } sprintf(file, "%s/%s.cfg", stb__cfg_dir, config); z = (stb_cfg *) stb_malloc(0, sizeof(*z)); z->data = NULL; z->loaded_file = stb_filec(file, &len); if (z->loaded_file) { char *s = z->loaded_file; if (!memcmp(s, stb__cfg_sig, 12)) { char *s = z->loaded_file + 12; while (s < z->loaded_file + len) { stb__cfg_item a; int n = *(stb_int16 *) s; a.key = s+2; s = s+2 + n; a.value_len = *(int *) s; s += 4; a.value = s; s += a.value_len; stb_arr_push(z->data, a); } assert(s == z->loaded_file + len); } } if (mode[0] == 'w') z->f = fopen(file, "wb"); else z->f = NULL; return z; } void stb_cfg_close(stb_cfg *z) { if (z->f) { int i; // write the file out fwrite(stb__cfg_sig, 12, 1, z->f); for (i=0; i < stb_arr_len(z->data); ++i) { stb_int16 n = strlen(z->data[i].key)+1; fwrite(&n, 2, 1, z->f); fwrite(z->data[i].key, n, 1, z->f); fwrite(&z->data[i].value_len, 4, 1, z->f); fwrite(z->data[i].value, z->data[i].value_len, 1, z->f); } fclose(z->f); } stb_arr_free(z->data); stb_free(z); } int stb_cfg_read(stb_cfg *z, char *key, void *value, int len) { int i; for (i=0; i < stb_arr_len(z->data); ++i) { if (!stb_stricmp(z->data[i].key, key)) { int n = stb_min(len, z->data[i].value_len); memcpy(value, z->data[i].value, n); if (n < len) *((char *) value + n) = 0; return 1; } } return 0; } void stb_cfg_write(stb_cfg *z, char *key, void *value, int len) { int i; for (i=0; i < stb_arr_len(z->data); ++i) if (!stb_stricmp(z->data[i].key, key)) break; if (i == stb_arr_len(z->data)) { stb__cfg_item p; p.key = stb_strdup(key, z); p.value = NULL; p.value_len = 0; stb_arr_push(z->data, p); } z->data[i].value = stb_malloc(z, len); z->data[i].value_len = len; memcpy(z->data[i].value, value, len); } int stb_cfg_delete(stb_cfg *z, char *key) { int i; for (i=0; i < stb_arr_len(z->data); ++i) if (!stb_stricmp(z->data[i].key, key)) { stb_arr_fastdelete(z->data, i); return 1; } return 0; } int stb_cfg_read_string(stb_cfg *z, char *key, char *value, int len) { if (!stb_cfg_read(z, key, value, len)) return 0; value[len-1] = 0; return 1; } void stb_cfg_write_string(stb_cfg *z, char *key, char *value) { stb_cfg_write(z, key, value, strlen(value)+1); } #endif ////////////////////////////////////////////////////////////////////////////// // // stb_dirtree - load a description of a directory tree // uses a cache and stat()s the directories for changes // MUCH faster on NTFS, _wrong_ on FAT32, so should // ignore the db on FAT32 #ifdef _WIN32 typedef struct { char * path; // full path from passed-in root time_t last_modified; int num_files; int flag; } stb_dirtree_dir; typedef struct { char *name; // name relative to path int dir; // index into dirs[] array stb_int64 size; // size, max 4GB time_t last_modified; int flag; } stb_dirtree_file; typedef struct { stb_dirtree_dir *dirs; stb_dirtree_file *files; // internal use void * string_pool; // used to free data en masse } stb_dirtree; extern void stb_dirtree_free ( stb_dirtree *d ); extern stb_dirtree *stb_dirtree_get ( char *dir); extern stb_dirtree *stb_dirtree_get_dir ( char *dir, char *cache_dir); extern stb_dirtree *stb_dirtree_get_with_file ( char *dir, char *cache_file); // get a list of all the files recursively underneath 'dir' // // cache_file is used to store a copy of the directory tree to speed up // later calls. It must be unique to 'dir' and the current working // directory! Otherwise who knows what will happen (a good solution // is to put it _in_ dir, but this API doesn't force that). // // Also, it might be possible to break this if you have two different processes // do a call to stb_dirtree_get() with the same cache file at about the same // time, but I _think_ it might just work. // i needed to build an identical data structure representing the state of // a mirrored copy WITHOUT bothering to rescan it (i.e. we're mirroring to // it WITHOUT scanning it, e.g. it's over the net), so this requires access // to all of the innards. extern void stb_dirtree_db_add_dir(stb_dirtree *active, char *path, time_t last); extern void stb_dirtree_db_add_file(stb_dirtree *active, char *name, int dir, stb_int64 size, time_t last); extern void stb_dirtree_db_read(stb_dirtree *target, char *filename, char *dir); extern void stb_dirtree_db_write(stb_dirtree *target, char *filename, char *dir); #ifdef STB_DEFINE static void stb__dirtree_add_dir(char *path, time_t last, stb_dirtree *active) { stb_dirtree_dir d; d.last_modified = last; d.num_files = 0; d.path = stb_strdup(path, active->string_pool); stb_arr_push(active->dirs, d); } static void stb__dirtree_add_file(char *name, int dir, stb_int64 size, time_t last, stb_dirtree *active) { stb_dirtree_file f; f.dir = dir; f.size = size; f.last_modified = last; f.name = stb_strdup(name, active->string_pool); ++active->dirs[dir].num_files; stb_arr_push(active->files, f); } // version 02 supports > 4GB files static char stb__signature[12] = { 's', 'T', 'b', 'D', 'i', 'R', 't', 'R', 'e', 'E', '0', '2' }; static void stb__dirtree_save_db(char *filename, stb_dirtree *data, char *root) { int i, num_dirs_final=0, num_files_final; char *info = root ? root : ""; int *remap; FILE *f = fopen(filename, "wb"); if (!f) return; fwrite(stb__signature, sizeof(stb__signature), 1, f); fwrite(info, strlen(info)+1, 1, f); // need to be slightly tricky and not write out NULLed directories, nor the root // build remapping table of all dirs we'll be writing out remap = (int *) malloc(sizeof(remap[0]) * stb_arr_len(data->dirs)); for (i=0; i < stb_arr_len(data->dirs); ++i) { if (data->dirs[i].path == NULL || (root && 0==stb_stricmp(data->dirs[i].path, root))) { remap[i] = -1; } else { remap[i] = num_dirs_final++; } } fwrite(&num_dirs_final, 4, 1, f); for (i=0; i < stb_arr_len(data->dirs); ++i) { if (remap[i] >= 0) { fwrite(&data->dirs[i].last_modified, 4, 1, f); stb_fput_string(f, data->dirs[i].path); } } num_files_final = 0; for (i=0; i < stb_arr_len(data->files); ++i) if (remap[data->files[i].dir] >= 0 && data->files[i].name) ++num_files_final; fwrite(&num_files_final, 4, 1, f); for (i=0; i < stb_arr_len(data->files); ++i) { if (remap[data->files[i].dir] >= 0 && data->files[i].name) { stb_fput_ranged(f, remap[data->files[i].dir], 0, num_dirs_final); stb_fput_varlen64(f, data->files[i].size); fwrite(&data->files[i].last_modified, 4, 1, f); stb_fput_string(f, data->files[i].name); } } fclose(f); } // note: stomps any existing data, rather than appending static void stb__dirtree_load_db(char *filename, stb_dirtree *data, char *dir) { char sig[2048]; int i,n; FILE *f = fopen(filename, "rb"); if (!f) return; data->string_pool = stb_malloc(0,1); fread(sig, sizeof(stb__signature), 1, f); if (memcmp(stb__signature, sig, sizeof(stb__signature))) { fclose(f); return; } if (!fread(sig, strlen(dir)+1, 1, f)) { fclose(f); return; } if (stb_stricmp(sig,dir)) { fclose(f); return; } // we can just read them straight in, because they're guaranteed to be valid fread(&n, 4, 1, f); stb_arr_setlen(data->dirs, n); for(i=0; i < stb_arr_len(data->dirs); ++i) { fread(&data->dirs[i].last_modified, 4, 1, f); data->dirs[i].path = stb_fget_string(f, data->string_pool); if (data->dirs[i].path == NULL) goto bail; } fread(&n, 4, 1, f); stb_arr_setlen(data->files, n); for (i=0; i < stb_arr_len(data->files); ++i) { data->files[i].dir = stb_fget_ranged(f, 0, stb_arr_len(data->dirs)); data->files[i].size = stb_fget_varlen64(f); fread(&data->files[i].last_modified, 4, 1, f); data->files[i].name = stb_fget_string(f, data->string_pool); if (data->files[i].name == NULL) goto bail; } if (0) { bail: stb_arr_free(data->dirs); stb_arr_free(data->files); } fclose(f); } static int stb__dircount, stb__dircount_mask, stb__showfile; static void stb__dirtree_scandir(char *path, time_t last_time, stb_dirtree *active) { // this is dumb depth first; theoretically it might be faster // to fully traverse each directory before visiting its children, // but it's complicated and didn't seem like a gain in the test app int n; struct _wfinddatai64_t c_file; long hFile; stb__wchar full_path[1024]; int has_slash; if (stb__showfile) printf("<"); has_slash = (path[0] && path[strlen(path)-1] == '/'); // @TODO: do this concatenation without using swprintf to avoid this mess: #if defined(_MSC_VER) && _MSC_VER < 1400 if (has_slash) swprintf(full_path, L"%s*", stb__from_utf8(path)); else swprintf(full_path, L"%s/*", stb__from_utf8(path)); #else if (has_slash) swprintf(full_path, 1024, L"%s*", stb__from_utf8(path)); else swprintf(full_path, 1024, L"%s/*", stb__from_utf8(path)); #endif // it's possible this directory is already present: that means it was in the // cache, but its parent wasn't... in that case, we're done with it if (stb__showfile) printf("C[%d]", stb_arr_len(active->dirs)); for (n=0; n < stb_arr_len(active->dirs); ++n) if (0 == stb_stricmp(active->dirs[n].path, path)) { if (stb__showfile) printf("D"); return; } if (stb__showfile) printf("E"); // otherwise, we need to add it stb__dirtree_add_dir(path, last_time, active); n = stb_arr_lastn(active->dirs); if (stb__showfile) printf("["); if( (hFile = _wfindfirsti64( full_path, &c_file )) != -1L ) { do { if (stb__showfile) printf(")"); if (c_file.attrib & _A_SUBDIR) { // ignore subdirectories starting with '.', e.g. "." and ".." if (c_file.name[0] != '.') { char *new_path = (char *) full_path; char *temp = stb__to_utf8(c_file.name); if (has_slash) sprintf(new_path, "%s%s", path, temp); else sprintf(new_path, "%s/%s", path, temp); if (stb__dircount_mask) { ++stb__dircount; if (!(stb__dircount & stb__dircount_mask)) { printf("%s\r", new_path); } } stb__dirtree_scandir(new_path, c_file.time_write, active); } } else { char *temp = stb__to_utf8(c_file.name); stb__dirtree_add_file(temp, n, c_file.size, c_file.time_write, active); } if (stb__showfile) printf("("); } while( _wfindnexti64( hFile, &c_file ) == 0 ); if (stb__showfile) printf("]"); _findclose( hFile ); } if (stb__showfile) printf(">\n"); } // scan the database and see if it's all valid static int stb__dirtree_update_db(stb_dirtree *db, stb_dirtree *active) { int changes_detected = STB_FALSE; int i; int *remap; int *rescan=NULL; remap = (int *) malloc(sizeof(remap[0]) * stb_arr_len(db->dirs)); memset(remap, 0, sizeof(remap[0]) * stb_arr_len(db->dirs)); rescan = NULL; for (i=0; i < stb_arr_len(db->dirs); ++i) { struct _stat info; if (stb__dircount_mask) { ++stb__dircount; if (!(stb__dircount & stb__dircount_mask)) { printf("."); } } if (0 == _stat(db->dirs[i].path, &info)) { if (info.st_mode & _S_IFDIR) { // it's still a directory, as expected int n = abs(info.st_mtime - db->dirs[i].last_modified); if (n > 1 && n != 3600) { // the 3600 is a hack because sometimes this jumps for no apparent reason, even when no time zone or DST issues are at play // it's changed! force a rescan // we don't want to scan it until we've stat()d its // subdirs, though, so we queue it if (stb__showfile) printf("Changed: %s - %08x:%08x\n", db->dirs[i].path, db->dirs[i].last_modified, info.st_mtime); stb_arr_push(rescan, i); // update the last_mod time db->dirs[i].last_modified = info.st_mtime; // ignore existing files in this dir remap[i] = -1; changes_detected = STB_TRUE; } else { // it hasn't changed, just copy it through unchanged stb__dirtree_add_dir(db->dirs[i].path, db->dirs[i].last_modified, active); remap[i] = stb_arr_lastn(active->dirs); } } else { // this path used to refer to a directory, but now it's a file! // assume that the parent directory is going to be forced to rescan anyway goto delete_entry; } } else { delete_entry: // directory no longer exists, so don't copy it // we don't free it because it's in the string pool now db->dirs[i].path = NULL; remap[i] = -1; changes_detected = STB_TRUE; } } // at this point, we have: // // holds a list of directory indices that need to be scanned due to being out of date // holds the directory index in for each dir in , if it exists; -1 if not // directories in are not in yet // so we can go ahead and remap all the known files right now for (i=0; i < stb_arr_len(db->files); ++i) { int dir = db->files[i].dir; if (remap[dir] >= 0) { stb__dirtree_add_file(db->files[i].name, remap[dir], db->files[i].size, db->files[i].last_modified, active); } } // at this point we're done with db->files, and done with remap free(remap); // now scan those directories using the standard scan for (i=0; i < stb_arr_len(rescan); ++i) { int z = rescan[i]; stb__dirtree_scandir(db->dirs[z].path, db->dirs[z].last_modified, active); } stb_arr_free(rescan); return changes_detected; } static void stb__dirtree_free_raw(stb_dirtree *d) { stb_free(d->string_pool); stb_arr_free(d->dirs); stb_arr_free(d->files); } stb_dirtree *stb_dirtree_get_with_file(char *dir, char *cache_file) { stb_dirtree *output = (stb_dirtree *) malloc(sizeof(*output)); stb_dirtree db,active; int prev_dir_count, cache_mismatch; char *stripped_dir; // store the directory name without a trailing '/' or '\\' // load the database of last-known state on disk db.string_pool = NULL; db.files = NULL; db.dirs = NULL; stripped_dir = stb_strip_final_slash(strdup(dir)); if (cache_file != NULL) stb__dirtree_load_db(cache_file, &db, stripped_dir); else if (stb__showfile) printf("No cache file\n"); active.files = NULL; active.dirs = NULL; active.string_pool = stb_malloc(0,1); // @TODO: share string pools between both? // check all the directories in the database; make note if // anything we scanned had changed, and rescan those things cache_mismatch = stb__dirtree_update_db(&db, &active); // check the root tree prev_dir_count = stb_arr_len(active.dirs); // record how many directories we've seen stb__dirtree_scandir(stripped_dir, 0, &active); // no last_modified time available for root if (stb__dircount_mask) printf(" \r"); // done with the DB; write it back out if any changes, i.e. either // 1. any inconsistency found between cached information and actual disk // or 2. if scanning the root found any new directories--which we detect because // more than one directory got added to the active db during that scan if (cache_mismatch || stb_arr_len(active.dirs) > prev_dir_count+1) stb__dirtree_save_db(cache_file, &active, stripped_dir); free(stripped_dir); stb__dirtree_free_raw(&db); *output = active; return output; } stb_dirtree *stb_dirtree_get_dir(char *dir, char *cache_dir) { int i; stb_uint8 sha[20]; char dir_lower[1024]; char cache_file[1024],*s; if (cache_dir == NULL) return stb_dirtree_get_with_file(dir, NULL); strcpy(dir_lower, dir); stb_tolower(dir_lower); stb_sha1(sha, (unsigned char *) dir_lower, strlen(dir_lower)); strcpy(cache_file, cache_dir); s = cache_file + strlen(cache_file); if (s[-1] != '//' && s[-1] != '\\') *s++ = '/'; strcpy(s, "dirtree_"); s += strlen(s); for (i=0; i < 8; ++i) { char *hex = "0123456789abcdef"; stb_uint z = sha[i]; *s++ = hex[z >> 4]; *s++ = hex[z & 15]; } strcpy(s, ".bin"); return stb_dirtree_get_with_file(dir, cache_file); } stb_dirtree *stb_dirtree_get(char *dir) { char cache_dir[256]; strcpy(cache_dir, "c:/stb"); #ifdef STB_HAS_REGISTRY { void *reg = stb_reg_open("rHKLM", "Software\\SilverSpaceship\\stb"); if (reg) { stb_reg_read(reg, "dirtree", cache_dir, sizeof(cache_dir)); stb_reg_close(reg); } } #endif return stb_dirtree_get_dir(dir, cache_dir); } void stb_dirtree_free(stb_dirtree *d) { stb__dirtree_free_raw(d); free(d); } void stb_dirtree_db_add_dir(stb_dirtree *active, char *path, time_t last) { stb__dirtree_add_dir(path, last, active); } void stb_dirtree_db_add_file(stb_dirtree *active, char *name, int dir, stb_int64 size, time_t last) { stb__dirtree_add_file(name, dir, size, last, active); } void stb_dirtree_db_read(stb_dirtree *target, char *filename, char *dir) { char *s = stb_strip_final_slash(strdup(dir)); target->dirs = 0; target->files = 0; target->string_pool = 0; stb__dirtree_load_db(filename, target, s); free(s); } void stb_dirtree_db_write(stb_dirtree *target, char *filename, char *dir) { stb__dirtree_save_db(filename, target, 0); // don't strip out any directories } #endif // STB_DEFINE #endif // _WIN32 #endif // STB_NO_STB_STRINGS ////////////////////////////////////////////////////////////////////////////// // // STB_MALLOC_WRAPPER // // you can use the wrapper functions with your own malloc wrapper, // or define STB_MALLOC_WRAPPER project-wide to have // malloc/free/realloc/strdup all get vectored to it // this has too many very specific error messages you could google for and find in stb.h, // so don't use it if they don't want any stb.h-identifiable strings #if defined(STB_DEFINE) && !defined(STB_NO_STB_STRINGS) typedef struct { void *p; char *file; int line; int size; } stb_malloc_record; #ifndef STB_MALLOC_HISTORY_COUNT #define STB_MALLOC_HISTORY_COUNT 50 // 800 bytes #endif stb_malloc_record *stb__allocations; static int stb__alloc_size, stb__alloc_limit, stb__alloc_mask; int stb__alloc_count; stb_malloc_record stb__alloc_history[STB_MALLOC_HISTORY_COUNT]; int stb__history_pos; static int stb__hashfind(void *p) { stb_uint32 h = stb_hashptr(p); int s,n = h & stb__alloc_mask; if (stb__allocations[n].p == p) return n; s = stb_rehash(h)|1; for(;;) { if (stb__allocations[n].p == NULL) return -1; n = (n+s) & stb__alloc_mask; if (stb__allocations[n].p == p) return n; } } int stb_wrapper_allocsize(void *p) { int n = stb__hashfind(p); if (n < 0) return 0; return stb__allocations[n].size; } static int stb__historyfind(void *p) { int n = stb__history_pos; int i; for (i=0; i < STB_MALLOC_HISTORY_COUNT; ++i) { if (--n < 0) n = STB_MALLOC_HISTORY_COUNT-1; if (stb__alloc_history[n].p == p) return n; } return -1; } static void stb__add_alloc(void *p, int sz, char *file, int line); static void stb__grow_alloc(void) { int i,old_num = stb__alloc_size; stb_malloc_record *old = stb__allocations; if (stb__alloc_size == 0) stb__alloc_size = 64; else stb__alloc_size *= 2; stb__allocations = (stb_malloc_record *) stb__realloc_raw(NULL, stb__alloc_size * sizeof(stb__allocations[0])); if (stb__allocations == NULL) stb_fatal("Internal error: couldn't grow malloc wrapper table"); memset(stb__allocations, 0, stb__alloc_size * sizeof(stb__allocations[0])); stb__alloc_limit = (stb__alloc_size*3)>>2; stb__alloc_mask = stb__alloc_size-1; stb__alloc_count = 0; for (i=0; i < old_num; ++i) if (old[i].p > STB_DEL) { stb__add_alloc(old[i].p, old[i].size, old[i].file, old[i].line); assert(stb__hashfind(old[i].p) >= 0); } for (i=0; i < old_num; ++i) if (old[i].p > STB_DEL) assert(stb__hashfind(old[i].p) >= 0); stb__realloc_raw(old, 0); } static void stb__add_alloc(void *p, int sz, char *file, int line) { stb_uint32 h; int n; if (stb__alloc_count >= stb__alloc_limit) stb__grow_alloc(); h = stb_hashptr(p); n = h & stb__alloc_mask; if (stb__allocations[n].p > STB_DEL) { int s = stb_rehash(h)|1; do { n = (n+s) & stb__alloc_mask; } while (stb__allocations[n].p > STB_DEL); } assert(stb__allocations[n].p == NULL || stb__allocations[n].p == STB_DEL); stb__allocations[n].p = p; stb__allocations[n].size = sz; stb__allocations[n].line = line; stb__allocations[n].file = file; ++stb__alloc_count; } static void stb__remove_alloc(int n, char *file, int line) { stb__alloc_history[stb__history_pos] = stb__allocations[n]; stb__alloc_history[stb__history_pos].file = file; stb__alloc_history[stb__history_pos].line = line; if (++stb__history_pos == STB_MALLOC_HISTORY_COUNT) stb__history_pos = 0; stb__allocations[n].p = STB_DEL; --stb__alloc_count; } void stb_wrapper_malloc(void *p, int sz, char *file, int line) { if (!p) return; stb__add_alloc(p,sz,file,line); } void stb_wrapper_free(void *p, char *file, int line) { int n; if (p == NULL) return; n = stb__hashfind(p); if (n >= 0) stb__remove_alloc(n, file, line); else { // tried to free something we hadn't allocated! n = stb__historyfind(p); assert(0); /* NOTREACHED */ if (n >= 0) stb_fatal("Attempted to free %d-byte block %p at %s:%d previously freed/realloced at %s:%d", stb__alloc_history[n].size, p, file, line, stb__alloc_history[n].file, stb__alloc_history[n].line); else stb_fatal("Attempted to free unknown block %p at %s:%d", p, file,line); } } void stb_wrapper_check(void *p) { int n; if (p == NULL) return; n = stb__hashfind(p); if (n >= 0) return; for (n=0; n < stb__alloc_size; ++n) if (stb__allocations[n].p == p) stb_fatal("Internal error: pointer %p was allocated, but hash search failed", p); // tried to free something that wasn't allocated! n = stb__historyfind(p); if (n >= 0) stb_fatal("Checked %d-byte block %p previously freed/realloced at %s:%d", stb__alloc_history[n].size, p, stb__alloc_history[n].file, stb__alloc_history[n].line); stb_fatal("Checked unknown block %p"); } void stb_wrapper_realloc(void *p, void *q, int sz, char *file, int line) { int n; if (p == NULL) { stb_wrapper_malloc(q, sz, file, line); return; } if (q == NULL) return; // nothing happened n = stb__hashfind(p); if (n == -1) { // tried to free something we hadn't allocated! // this is weird, though, because we got past the realloc! n = stb__historyfind(p); assert(0); /* NOTREACHED */ if (n >= 0) stb_fatal("Attempted to realloc %d-byte block %p at %s:%d previously freed/realloced at %s:%d", stb__alloc_history[n].size, p, file, line, stb__alloc_history[n].file, stb__alloc_history[n].line); else stb_fatal("Attempted to realloc unknown block %p at %s:%d", p, file,line); } else { if (q == p) { stb__allocations[n].size = sz; stb__allocations[n].file = file; stb__allocations[n].line = line; } else { stb__remove_alloc(n, file, line); stb__add_alloc(q,sz,file,line); } } } void stb_wrapper_listall(void (*func)(void *ptr, int sz, char *file, int line)) { int i; for (i=0; i < stb__alloc_size; ++i) if (stb__allocations[i].p > STB_DEL) func(stb__allocations[i].p , stb__allocations[i].size, stb__allocations[i].file, stb__allocations[i].line); } void stb_wrapper_dump(char *filename) { int i; FILE *f = fopen(filename, "w"); if (!f) return; for (i=0; i < stb__alloc_size; ++i) if (stb__allocations[i].p > STB_DEL) fprintf(f, "%p %7d - %4d %s\n", stb__allocations[i].p , stb__allocations[i].size, stb__allocations[i].line, stb__allocations[i].file); } #endif // STB_DEFINE ////////////////////////////////////////////////////////////////////////////// // // stb_pointer_set // // // For data structures that support querying by key, data structure // classes always hand-wave away the issue of what to do if two entries // have the same key: basically, store a linked list of all the nodes // which have the same key (a LISP-style list). // // The thing is, it's not that trivial. If you have an O(log n) // lookup data structure, but then n/4 items have the same value, // you don't want to spend O(n) time scanning that list when // deleting an item if you already have a pointer to the item. // (You have to spend O(n) time enumerating all the items with // a given key, sure, and you can't accelerate deleting a particular // item if you only have the key, not a pointer to the item.) // // I'm going to call this data structure, whatever it turns out to // be, a "pointer set", because we don't store any associated data for // items in this data structure, we just answer the question of // whether an item is in it or not (it's effectively one bit per pointer). // Technically they don't have to be pointers; you could cast ints // to (void *) if you want, but you can't store 0 or 1 because of the // hash table. // // Since the fastest data structure we might want to add support for // identical-keys to is a hash table with O(1)-ish lookup time, // that means that the conceptual "linked list of all items with // the same indexed value" that we build needs to have the same // performance; that way when we index a table we think is arbitrary // ints, but in fact half of them are 0, we don't get screwed. // // Therefore, it needs to be a hash table, at least when it gets // large. On the other hand, when the data has totally arbitrary ints // or floats, there won't be many collisions, and we'll have tons of // 1-item bitmaps. That will be grossly inefficient as hash tables; // trade-off; the hash table is reasonably efficient per-item when // it's large, but not when it's small. So we need to do something // Judy-like and use different strategies depending on the size. // // Like Judy, we'll use the bottom bit to encode the strategy: // // bottom bits: // 00 - direct pointer // 01 - 4-item bucket (16 bytes, no length, NULLs) // 10 - N-item array // 11 - hash table typedef struct stb_ps stb_ps; STB_EXTERN int stb_ps_find (stb_ps *ps, void *value); STB_EXTERN stb_ps * stb_ps_add (stb_ps *ps, void *value); STB_EXTERN stb_ps * stb_ps_remove(stb_ps *ps, void *value); STB_EXTERN stb_ps * stb_ps_remove_any(stb_ps *ps, void **value); STB_EXTERN void stb_ps_delete(stb_ps *ps); STB_EXTERN int stb_ps_count (stb_ps *ps); STB_EXTERN stb_ps * stb_ps_copy (stb_ps *ps); STB_EXTERN int stb_ps_subset(stb_ps *bigger, stb_ps *smaller); STB_EXTERN int stb_ps_eq (stb_ps *p0, stb_ps *p1); STB_EXTERN void ** stb_ps_getlist (stb_ps *ps, int *count); STB_EXTERN int stb_ps_writelist(stb_ps *ps, void **list, int size ); // enum and fastlist don't allocate storage, but you must consume the // list before there's any chance the data structure gets screwed up; STB_EXTERN int stb_ps_enum (stb_ps *ps, void *data, int (*func)(void *value, void*data) ); STB_EXTERN void ** stb_ps_fastlist(stb_ps *ps, int *count); // result: // returns a list, *count is the length of that list, // but some entries of the list may be invalid; // test with 'stb_ps_fastlist_valid(x)' #define stb_ps_fastlist_valid(x) ((stb_uinta) (x) > 1) #ifdef STB_DEFINE enum { STB_ps_direct = 0, STB_ps_bucket = 1, STB_ps_array = 2, STB_ps_hash = 3, }; #define STB_BUCKET_SIZE 4 typedef struct { void *p[STB_BUCKET_SIZE]; } stb_ps_bucket; #define GetBucket(p) ((stb_ps_bucket *) ((char *) (p) - STB_ps_bucket)) #define EncodeBucket(p) ((stb_ps *) ((char *) (p) + STB_ps_bucket)) static void stb_bucket_free(stb_ps_bucket *b) { free(b); } static stb_ps_bucket *stb_bucket_create2(void *v0, void *v1) { stb_ps_bucket *b = (stb_ps_bucket*) malloc(sizeof(*b)); b->p[0] = v0; b->p[1] = v1; b->p[2] = NULL; b->p[3] = NULL; return b; } static stb_ps_bucket * stb_bucket_create3(void **v) { stb_ps_bucket *b = (stb_ps_bucket*) malloc(sizeof(*b)); b->p[0] = v[0]; b->p[1] = v[1]; b->p[2] = v[2]; b->p[3] = NULL; return b; } // could use stb_arr, but this will save us memory typedef struct { int count; void *p[1]; } stb_ps_array; #define GetArray(p) ((stb_ps_array *) ((char *) (p) - STB_ps_array)) #define EncodeArray(p) ((stb_ps *) ((char *) (p) + STB_ps_array)) static int stb_ps_array_max = 13; typedef struct { int size, mask; int count, count_deletes; int grow_threshhold; int shrink_threshhold; int rehash_threshhold; int any_offset; void *table[1]; } stb_ps_hash; #define GetHash(p) ((stb_ps_hash *) ((char *) (p) - STB_ps_hash)) #define EncodeHash(p) ((stb_ps *) ((char *) (p) + STB_ps_hash)) #define stb_ps_empty(v) (((stb_uint32) v) <= 1) static stb_ps_hash *stb_ps_makehash(int size, int old_size, void **old_data) { int i; stb_ps_hash *h = (stb_ps_hash *) malloc(sizeof(*h) + (size-1) * sizeof(h->table[0])); assert(stb_is_pow2(size)); h->size = size; h->mask = size-1; h->shrink_threshhold = (int) (0.3f * size); h-> grow_threshhold = (int) (0.8f * size); h->rehash_threshhold = (int) (0.9f * size); h->count = 0; h->count_deletes = 0; h->any_offset = 0; memset(h->table, 0, size * sizeof(h->table[0])); for (i=0; i < old_size; ++i) if (!stb_ps_empty(old_data[i])) stb_ps_add(EncodeHash(h), old_data[i]); return h; } void stb_ps_delete(stb_ps *ps) { switch (3 & (int) ps) { case STB_ps_direct: break; case STB_ps_bucket: stb_bucket_free(GetBucket(ps)); break; case STB_ps_array : free(GetArray(ps)); break; case STB_ps_hash : free(GetHash(ps)); break; } } stb_ps *stb_ps_copy(stb_ps *ps) { int i; // not a switch: order based on expected performance/power-law distribution switch (3 & (int) ps) { case STB_ps_direct: return ps; case STB_ps_bucket: { stb_ps_bucket *n = (stb_ps_bucket *) malloc(sizeof(*n)); *n = *GetBucket(ps); return EncodeBucket(n); } case STB_ps_array: { stb_ps_array *a = GetArray(ps); stb_ps_array *n = (stb_ps_array *) malloc(sizeof(*n) + stb_ps_array_max * sizeof(n->p[0])); n->count = a->count; for (i=0; i < a->count; ++i) n->p[i] = a->p[i]; return EncodeArray(n); } case STB_ps_hash: { stb_ps_hash *h = GetHash(ps); stb_ps_hash *n = stb_ps_makehash(h->size, h->size, h->table); return EncodeHash(n); } } assert(0); /* NOTREACHED */ return NULL; } int stb_ps_find(stb_ps *ps, void *value) { int i, code = 3 & (int) ps; assert((3 & (int) value) == STB_ps_direct); assert(stb_ps_fastlist_valid(value)); // not a switch: order based on expected performance/power-law distribution if (code == STB_ps_direct) return value == ps; if (code == STB_ps_bucket) { stb_ps_bucket *b = GetBucket(ps); assert(STB_BUCKET_SIZE == 4); if (b->p[0] == value || b->p[1] == value || b->p[2] == value || b->p[3] == value) return STB_TRUE; return STB_FALSE; } if (code == STB_ps_array) { stb_ps_array *a = GetArray(ps); for (i=0; i < a->count; ++i) if (a->p[i] == value) return STB_TRUE; return STB_FALSE; } else { stb_ps_hash *h = GetHash(ps); stb_uint32 hash = stb_hashptr(value); stb_uint32 s, n = hash & h->mask; void **t = h->table; if (t[n] == value) return STB_TRUE; if (t[n] == NULL) return STB_FALSE; s = stb_rehash(hash) | 1; do { n = (n + s) & h->mask; if (t[n] == value) return STB_TRUE; } while (t[n] != NULL); return STB_FALSE; } } stb_ps * stb_ps_add (stb_ps *ps, void *value) { #ifdef STB_DEBUG assert(!stb_ps_find(ps,value)); #endif if (value == NULL) return ps; // ignore NULL adds to avoid bad breakage assert((3 & (int) value) == STB_ps_direct); assert(stb_ps_fastlist_valid(value)); assert(value != STB_DEL); // STB_DEL is less likely switch (3 & (int) ps) { case STB_ps_direct: if (ps == NULL) return (stb_ps *) value; return EncodeBucket(stb_bucket_create2(ps,value)); case STB_ps_bucket: { stb_ps_bucket *b = GetBucket(ps); stb_ps_array *a; assert(STB_BUCKET_SIZE == 4); if (b->p[0] == NULL) { b->p[0] = value; return ps; } if (b->p[1] == NULL) { b->p[1] = value; return ps; } if (b->p[2] == NULL) { b->p[2] = value; return ps; } if (b->p[3] == NULL) { b->p[3] = value; return ps; } a = (stb_ps_array *) malloc(sizeof(*a) + 7 * sizeof(a->p[0])); // 8 slots, must be 2^k memcpy(a->p, b, sizeof(*b)); a->p[4] = value; a->count = 5; stb_bucket_free(b); return EncodeArray(a); } case STB_ps_array: { stb_ps_array *a = GetArray(ps); if (a->count == stb_ps_array_max) { // promote from array to hash stb_ps_hash *h = stb_ps_makehash(2 << stb_log2_ceil(a->count), a->count, a->p); free(a); return stb_ps_add(EncodeHash(h), value); } // do we need to resize the array? the array doubles in size when it // crosses a power-of-two if ((a->count & (a->count-1))==0) { int newsize = a->count*2; // clamp newsize to max if: // 1. it's larger than max // 2. newsize*1.5 is larger than max (to avoid extra resizing) if (newsize + a->count > stb_ps_array_max) newsize = stb_ps_array_max; a = (stb_ps_array *) realloc(a, sizeof(*a) + (newsize-1) * sizeof(a->p[0])); } a->p[a->count++] = value; return EncodeArray(a); } case STB_ps_hash: { stb_ps_hash *h = GetHash(ps); stb_uint32 hash = stb_hashptr(value); stb_uint32 n = hash & h->mask; void **t = h->table; // find first NULL or STB_DEL entry if (!stb_ps_empty(t[n])) { stb_uint32 s = stb_rehash(hash) | 1; do { n = (n + s) & h->mask; } while (!stb_ps_empty(t[n])); } if (t[n] == STB_DEL) -- h->count_deletes; t[n] = value; ++ h->count; if (h->count == h->grow_threshhold) { stb_ps_hash *h2 = stb_ps_makehash(h->size*2, h->size, t); free(h); return EncodeHash(h2); } if (h->count + h->count_deletes == h->rehash_threshhold) { stb_ps_hash *h2 = stb_ps_makehash(h->size, h->size, t); free(h); return EncodeHash(h2); } return ps; } } return NULL; /* NOTREACHED */ } stb_ps *stb_ps_remove(stb_ps *ps, void *value) { #ifdef STB_DEBUG assert(stb_ps_find(ps, value)); #endif assert((3 & (int) value) == STB_ps_direct); if (value == NULL) return ps; // ignore NULL removes to avoid bad breakage switch (3 & (int) ps) { case STB_ps_direct: return ps == value ? NULL : ps; case STB_ps_bucket: { stb_ps_bucket *b = GetBucket(ps); int count=0; assert(STB_BUCKET_SIZE == 4); if (b->p[0] == value) b->p[0] = NULL; else count += (b->p[0] != NULL); if (b->p[1] == value) b->p[1] = NULL; else count += (b->p[1] != NULL); if (b->p[2] == value) b->p[2] = NULL; else count += (b->p[2] != NULL); if (b->p[3] == value) b->p[3] = NULL; else count += (b->p[3] != NULL); if (count == 1) { // shrink bucket at size 1 value = b->p[0]; if (value == NULL) value = b->p[1]; if (value == NULL) value = b->p[2]; if (value == NULL) value = b->p[3]; assert(value != NULL); stb_bucket_free(b); return (stb_ps *) value; // return STB_ps_direct of value } return ps; } case STB_ps_array: { stb_ps_array *a = GetArray(ps); int i; for (i=0; i < a->count; ++i) { if (a->p[i] == value) { a->p[i] = a->p[--a->count]; if (a->count == 3) { // shrink to bucket! stb_ps_bucket *b = stb_bucket_create3(a->p); free(a); return EncodeBucket(b); } return ps; } } return ps; } case STB_ps_hash: { stb_ps_hash *h = GetHash(ps); stb_uint32 hash = stb_hashptr(value); stb_uint32 s, n = hash & h->mask; void **t = h->table; if (t[n] != value) { s = stb_rehash(hash) | 1; do { n = (n + s) & h->mask; } while (t[n] != value); } t[n] = STB_DEL; -- h->count; ++ h->count_deletes; // should we shrink down to an array? if (h->count < stb_ps_array_max) { int n = 1 << stb_log2_floor(stb_ps_array_max); if (h->count < n) { stb_ps_array *a = (stb_ps_array *) malloc(sizeof(*a) + (n-1) * sizeof(a->p[0])); int i,j=0; for (i=0; i < h->size; ++i) if (!stb_ps_empty(t[i])) a->p[j++] = t[i]; assert(j == h->count); a->count = j; free(h); return EncodeArray(a); } } if (h->count == h->shrink_threshhold) { stb_ps_hash *h2 = stb_ps_makehash(h->size >> 1, h->size, t); free(h); return EncodeHash(h2); } return ps; } } return ps; /* NOTREACHED */ } stb_ps *stb_ps_remove_any(stb_ps *ps, void **value) { assert(ps != NULL); switch (3 & (int) ps) { case STB_ps_direct: *value = ps; return NULL; case STB_ps_bucket: { stb_ps_bucket *b = GetBucket(ps); int count=0, slast=0, last=0; assert(STB_BUCKET_SIZE == 4); if (b->p[0]) { ++count; last = 0; } if (b->p[1]) { ++count; slast = last; last = 1; } if (b->p[2]) { ++count; slast = last; last = 2; } if (b->p[3]) { ++count; slast = last; last = 3; } *value = b->p[last]; b->p[last] = 0; if (count == 2) { void *leftover = b->p[slast]; // second to last stb_bucket_free(b); return (stb_ps *) leftover; } return ps; } case STB_ps_array: { stb_ps_array *a = GetArray(ps); *value = a->p[a->count-1]; if (a->count == 4) return stb_ps_remove(ps, *value); --a->count; return ps; } case STB_ps_hash: { stb_ps_hash *h = GetHash(ps); void **t = h->table; stb_uint32 n = h->any_offset; while (stb_ps_empty(t[n])) n = (n + 1) & h->mask; *value = t[n]; h->any_offset = (n+1) & h->mask; // check if we need to skip down to the previous type if (h->count-1 < stb_ps_array_max || h->count-1 == h->shrink_threshhold) return stb_ps_remove(ps, *value); t[n] = STB_DEL; -- h->count; ++ h->count_deletes; return ps; } } return ps; /* NOTREACHED */ } void ** stb_ps_getlist(stb_ps *ps, int *count) { int i,n=0; void **p = NULL; switch (3 & (int) ps) { case STB_ps_direct: if (ps == NULL) { *count = 0; return NULL; } p = (void **) malloc(sizeof(*p) * 1); p[0] = ps; *count = 1; return p; case STB_ps_bucket: { stb_ps_bucket *b = GetBucket(ps); p = (void **) malloc(sizeof(*p) * STB_BUCKET_SIZE); for (i=0; i < STB_BUCKET_SIZE; ++i) if (b->p[i] != NULL) p[n++] = b->p[i]; break; } case STB_ps_array: { stb_ps_array *a = GetArray(ps); p = (void **) malloc(sizeof(*p) * a->count); memcpy(p, a->p, sizeof(*p) * a->count); *count = a->count; return p; } case STB_ps_hash: { stb_ps_hash *h = GetHash(ps); p = (void **) malloc(sizeof(*p) * h->count); for (i=0; i < h->size; ++i) if (!stb_ps_empty(h->table[i])) p[n++] = h->table[i]; break; } } *count = n; return p; } int stb_ps_writelist(stb_ps *ps, void **list, int size ) { int i,n=0; switch (3 & (int) ps) { case STB_ps_direct: if (ps == NULL || size <= 0) return 0; list[0] = ps; return 1; case STB_ps_bucket: { stb_ps_bucket *b = GetBucket(ps); for (i=0; i < STB_BUCKET_SIZE; ++i) if (b->p[i] != NULL && n < size) list[n++] = b->p[i]; return n; } case STB_ps_array: { stb_ps_array *a = GetArray(ps); n = stb_min(size, a->count); memcpy(list, a->p, sizeof(*list) * n); return n; } case STB_ps_hash: { stb_ps_hash *h = GetHash(ps); if (size <= 0) return 0; for (i=0; i < h->count; ++i) { if (!stb_ps_empty(h->table[i])) { list[n++] = h->table[i]; if (n == size) break; } } return n; } } return 0; /* NOTREACHED */ } int stb_ps_enum(stb_ps *ps, void *data, int (*func)(void *value, void *data)) { int i; switch (3 & (int) ps) { case STB_ps_direct: if (ps == NULL) return STB_TRUE; return func(ps, data); case STB_ps_bucket: { stb_ps_bucket *b = GetBucket(ps); for (i=0; i < STB_BUCKET_SIZE; ++i) if (b->p[i] != NULL) if (!func(b->p[i], data)) return STB_FALSE; return STB_TRUE; } case STB_ps_array: { stb_ps_array *a = GetArray(ps); for (i=0; i < a->count; ++i) if (!func(a->p[i], data)) return STB_FALSE; return STB_TRUE; } case STB_ps_hash: { stb_ps_hash *h = GetHash(ps); for (i=0; i < h->count; ++i) if (!stb_ps_empty(h->table[i])) if (!func(h->table[i], data)) return STB_FALSE; return STB_TRUE; } } return STB_TRUE; /* NOTREACHED */ } int stb_ps_count (stb_ps *ps) { switch (3 & (int) ps) { case STB_ps_direct: return ps != NULL; case STB_ps_bucket: { stb_ps_bucket *b = GetBucket(ps); return (b->p[0] != NULL) + (b->p[1] != NULL) + (b->p[2] != NULL) + (b->p[3] != NULL); } case STB_ps_array: { stb_ps_array *a = GetArray(ps); return a->count; } case STB_ps_hash: { stb_ps_hash *h = GetHash(ps); return h->count; } } return 0; } void ** stb_ps_fastlist(stb_ps *ps, int *count) { static void *storage; switch (3 & (int) ps) { case STB_ps_direct: if (ps == NULL) { *count = 0; return NULL; } storage = ps; *count = 1; return &storage; case STB_ps_bucket: { stb_ps_bucket *b = GetBucket(ps); *count = STB_BUCKET_SIZE; return b->p; } case STB_ps_array: { stb_ps_array *a = GetArray(ps); *count = a->count; return a->p; } case STB_ps_hash: { stb_ps_hash *h = GetHash(ps); *count = h->size; return h->table; } } return NULL; /* NOTREACHED */ } int stb_ps_subset(stb_ps *bigger, stb_ps *smaller) { int i, listlen; void **list = stb_ps_fastlist(smaller, &listlen); for(i=0; i < listlen; ++i) if (stb_ps_fastlist_valid(list[i])) if (!stb_ps_find(bigger, list[i])) return 0; return 1; } int stb_ps_eq(stb_ps *p0, stb_ps *p1) { if (stb_ps_count(p0) != stb_ps_count(p1)) return 0; return stb_ps_subset(p0, p1); } #undef GetBucket #undef GetArray #undef GetHash #undef EncodeBucket #undef EncodeArray #undef EncodeHash #endif ////////////////////////////////////////////////////////////////////////////// // // Random Numbers via Meresenne Twister or LCG // STB_EXTERN unsigned long stb_srandLCG(unsigned long seed); STB_EXTERN unsigned long stb_randLCG(void); STB_EXTERN double stb_frandLCG(void); STB_EXTERN void stb_srand(unsigned long seed); STB_EXTERN unsigned long stb_rand(void); STB_EXTERN double stb_frand(void); STB_EXTERN void stb_shuffle(void *p, size_t n, size_t sz, unsigned long seed); STB_EXTERN void stb_reverse(void *p, size_t n, size_t sz); STB_EXTERN unsigned long stb_randLCG_explicit(unsigned long seed); #define stb_rand_define(x,y) \ \ unsigned long x(void) \ { \ static unsigned long stb__rand = y; \ stb__rand = stb__rand * 2147001325 + 715136305; /* BCPL */ \ return 0x31415926 ^ ((stb__rand >> 16) + (stb__rand << 16)); \ } #ifdef STB_DEFINE unsigned long stb_randLCG_explicit(unsigned long seed) { return seed * 2147001325 + 715136305; } static unsigned long stb__rand_seed=0; unsigned long stb_srandLCG(unsigned long seed) { unsigned long previous = stb__rand_seed; stb__rand_seed = seed; return previous; } unsigned long stb_randLCG(void) { stb__rand_seed = stb__rand_seed * 2147001325 + 715136305; // BCPL generator // shuffle non-random bits to the middle, and xor to decorrelate with seed return 0x31415926 ^ ((stb__rand_seed >> 16) + (stb__rand_seed << 16)); } double stb_frandLCG(void) { return stb_randLCG() / ((double) (1 << 16) * (1 << 16)); } void stb_shuffle(void *p, size_t n, size_t sz, unsigned long seed) { char *a; unsigned long old_seed; int i; if (seed) old_seed = stb_srandLCG(seed); a = (char *) p + (n-1) * sz; for (i=n; i > 1; --i) { int j = stb_randLCG() % i; stb_swap(a, (char *) p + j * sz, sz); a -= sz; } if (seed) stb_srandLCG(old_seed); } void stb_reverse(void *p, size_t n, size_t sz) { int i,j = n-1; for (i=0; i < j; ++i,--j) { stb_swap((char *) p + i * sz, (char *) p + j * sz, sz); } } // public domain Mersenne Twister by Michael Brundage #define STB__MT_LEN 624 int stb__mt_index = STB__MT_LEN*sizeof(unsigned long)+1; unsigned long stb__mt_buffer[STB__MT_LEN]; void stb_srand(unsigned long seed) { int i; unsigned long old = stb_srandLCG(seed); for (i = 0; i < STB__MT_LEN; i++) stb__mt_buffer[i] = stb_randLCG(); stb_srandLCG(old); stb__mt_index = STB__MT_LEN*sizeof(unsigned long); } #define STB__MT_IA 397 #define STB__MT_IB (STB__MT_LEN - STB__MT_IA) #define STB__UPPER_MASK 0x80000000 #define STB__LOWER_MASK 0x7FFFFFFF #define STB__MATRIX_A 0x9908B0DF #define STB__TWIST(b,i,j) ((b)[i] & STB__UPPER_MASK) | ((b)[j] & STB__LOWER_MASK) #define STB__MAGIC(s) (((s)&1)*STB__MATRIX_A) unsigned long stb_rand() { unsigned long * b = stb__mt_buffer; int idx = stb__mt_index; unsigned long s,r; int i; if (idx >= STB__MT_LEN*sizeof(unsigned long)) { if (idx > STB__MT_LEN*sizeof(unsigned long)) stb_srand(0); idx = 0; i = 0; for (; i < STB__MT_IB; i++) { s = STB__TWIST(b, i, i+1); b[i] = b[i + STB__MT_IA] ^ (s >> 1) ^ STB__MAGIC(s); } for (; i < STB__MT_LEN-1; i++) { s = STB__TWIST(b, i, i+1); b[i] = b[i - STB__MT_IB] ^ (s >> 1) ^ STB__MAGIC(s); } s = STB__TWIST(b, STB__MT_LEN-1, 0); b[STB__MT_LEN-1] = b[STB__MT_IA-1] ^ (s >> 1) ^ STB__MAGIC(s); } stb__mt_index = idx + sizeof(unsigned long); r = *(unsigned long *)((unsigned char *)b + idx); r ^= (r >> 11); r ^= (r << 7) & 0x9D2C5680; r ^= (r << 15) & 0xEFC60000; r ^= (r >> 18); return r; } double stb_frand(void) { return stb_rand() / ((double) (1 << 16) * (1 << 16)); } #endif ////////////////////////////////////////////////////////////////////////////// // // stb_dupe // // stb_dupe is a duplicate-finding system for very, very large data // structures--large enough that sorting is too slow, but not so large // that we can't keep all the data in memory. using it works as follows: // // 1. create an stb_dupe: // provide a hash function // provide an equality function // provide an estimate for the size // optionally provide a comparison function // // 2. traverse your data, 'adding' pointers to the stb_dupe // // 3. finish and ask for duplicates // // the stb_dupe will discard its intermediate data and build // a collection of sorted lists of duplicates, with non-duplicate // entries omitted entirely // // // Implementation strategy: // // while collecting the N items, we keep a hash table of approximate // size sqrt(N). (if you tell use the N up front, the hash table is // just that size exactly) // // each entry in the hash table is just an stb__arr of pointers (no need // to use stb_ps, because we don't need to delete from these) // // for step 3, for each entry in the hash table, we apply stb_dupe to it // recursively. once the size gets small enough (or doesn't decrease // significantly), we switch to either using qsort() on the comparison // function, or else we just do the icky N^2 gather typedef struct stb_dupe stb_dupe; typedef int (*stb_compare_func)(void *a, void *b); typedef int (*stb_hash_func)(void *a, unsigned int seed); STB_EXTERN void stb_dupe_free(stb_dupe *sd); STB_EXTERN stb_dupe *stb_dupe_create(stb_hash_func hash, stb_compare_func eq, int size, stb_compare_func ineq); STB_EXTERN void stb_dupe_add(stb_dupe *sd, void *item); STB_EXTERN void stb_dupe_finish(stb_dupe *sd); STB_EXTERN int stb_dupe_numsets(stb_dupe *sd); STB_EXTERN void **stb_dupe_set(stb_dupe *sd, int num); STB_EXTERN int stb_dupe_set_count(stb_dupe *sd, int num); struct stb_dupe { void ***hash_table; int hash_size; int size_log2; int population; int hash_shift; stb_hash_func hash; stb_compare_func eq; stb_compare_func ineq; void ***dupes; }; #ifdef STB_DEFINE int stb_dupe_numsets(stb_dupe *sd) { assert(sd->hash_table == NULL); return stb_arr_len(sd->dupes); } void **stb_dupe_set(stb_dupe *sd, int num) { assert(sd->hash_table == NULL); return sd->dupes[num]; } int stb_dupe_set_count(stb_dupe *sd, int num) { assert(sd->hash_table == NULL); return stb_arr_len(sd->dupes[num]); } stb_dupe *stb_dupe_create(stb_hash_func hash, stb_compare_func eq, int size, stb_compare_func ineq) { int i, hsize; stb_dupe *sd = (stb_dupe *) malloc(sizeof(*sd)); sd->size_log2 = 4; hsize = 1 << sd->size_log2; while (hsize * hsize < size) { ++sd->size_log2; hsize *= 2; } sd->hash = hash; sd->eq = eq; sd->ineq = ineq; sd->hash_shift = 0; sd->population = 0; sd->hash_size = hsize; sd->hash_table = (void ***) malloc(sizeof(*sd->hash_table) * hsize); for (i=0; i < hsize; ++i) sd->hash_table[i] = NULL; sd->dupes = NULL; return sd; } void stb_dupe_add(stb_dupe *sd, void *item) { stb_uint32 hash = sd->hash(item, sd->hash_shift); int z = hash & (sd->hash_size-1); stb_arr_push(sd->hash_table[z], item); ++sd->population; } void stb_dupe_free(stb_dupe *sd) { int i; for (i=0; i < stb_arr_len(sd->dupes); ++i) if (sd->dupes[i]) stb_arr_free(sd->dupes[i]); stb_arr_free(sd->dupes); free(sd); } static stb_compare_func stb__compare; static int stb__dupe_compare(const void *a, const void *b) { void *p = *(void **) a; void *q = *(void **) b; return stb__compare(p,q); } void stb_dupe_finish(stb_dupe *sd) { int i,j,k; assert(sd->dupes == NULL); for (i=0; i < sd->hash_size; ++i) { void ** list = sd->hash_table[i]; if (list != NULL) { int n = stb_arr_len(list); // @TODO: measure to find good numbers instead of just making them up! int thresh = (sd->ineq ? 200 : 20); // if n is large enough to be worth it, and n is smaller than // before (so we can guarantee we'll use a smaller hash table); // and there are enough hash bits left, assuming full 32-bit hash if (n > thresh && n < (sd->population >> 3) && sd->hash_shift + sd->size_log2*2 < 32) { // recursively process this row using stb_dupe, O(N log log N) stb_dupe *d = stb_dupe_create(sd->hash, sd->eq, n, sd->ineq); d->hash_shift = stb_randLCG_explicit(sd->hash_shift); for (j=0; j < n; ++j) stb_dupe_add(d, list[j]); stb_arr_free(sd->hash_table[i]); stb_dupe_finish(d); for (j=0; j < stb_arr_len(d->dupes); ++j) { stb_arr_push(sd->dupes, d->dupes[j]); d->dupes[j] = NULL; // take over ownership } stb_dupe_free(d); } else if (sd->ineq) { // process this row using qsort(), O(N log N) stb__compare = sd->ineq; qsort(list, n, sizeof(list[0]), stb__dupe_compare); // find equal subsequences of the list for (j=0; j < n-1; ) { // find a subsequence from j..k for (k=j; k < n; ++k) // only use ineq so eq can be left undefined if (sd->ineq(list[j], list[k])) break; // k is the first one not in the subsequence if (k-j > 1) { void **mylist = NULL; stb_arr_setlen(mylist, k-j); memcpy(mylist, list+j, sizeof(list[j]) * (k-j)); stb_arr_push(sd->dupes, mylist); } j = k; } stb_arr_free(sd->hash_table[i]); } else { // process this row using eq(), O(N^2) for (j=0; j < n; ++j) { if (list[j] != NULL) { void **output = NULL; for (k=j+1; k < n; ++k) { if (sd->eq(list[j], list[k])) { if (output == NULL) stb_arr_push(output, list[j]); stb_arr_push(output, list[k]); list[k] = NULL; } } list[j] = NULL; if (output) stb_arr_push(sd->dupes, output); } } stb_arr_free(sd->hash_table[i]); } } } free(sd->hash_table); sd->hash_table = NULL; } #endif ////////////////////////////////////////////////////////////////////////////// // // templatized Sort routine // // This is an attempt to implement a templated sorting algorithm. // To use it, you have to explicitly instantiate it as a _function_, // then you call that function. This allows the comparison to be inlined, // giving the sort similar performance to C++ sorts. // // It implements quicksort with three-way-median partitioning (generally // well-behaved), with a final insertion sort pass. // // When you define the compare expression, you should assume you have // elements of your array pointed to by 'a' and 'b', and perform the comparison // on those. OR you can use one or more statements; first say '0;', then // write whatever code you want, and compute the result into a variable 'c'. #define stb_declare_sort(FUNCNAME, TYPE) \ void FUNCNAME(TYPE *p, int n) #define stb_define_sort(FUNCNAME,TYPE,COMPARE) \ stb__define_sort( void, FUNCNAME,TYPE,COMPARE) #define stb_define_sort_static(FUNCNAME,TYPE,COMPARE) \ stb__define_sort(static void, FUNCNAME,TYPE,COMPARE) #define stb__define_sort(MODE, FUNCNAME, TYPE, COMPARE) \ \ static void STB_(FUNCNAME,_ins_sort)(TYPE *p, int n) \ { \ int i,j; \ for (i=1; i < n; ++i) { \ TYPE t = p[i], *a = &t; \ j = i; \ while (j > 0) { \ TYPE *b = &p[j-1]; \ int c = COMPARE; \ if (!c) break; \ p[j] = p[j-1]; \ --j; \ } \ if (i != j) \ p[j] = t; \ } \ } \ \ static void STB_(FUNCNAME,_quicksort)(TYPE *p, int n) \ { \ /* threshhold for transitioning to insertion sort */ \ while (n > 12) { \ TYPE *a,*b,t; \ int c01,c12,c,m,i,j; \ \ /* compute median of three */ \ m = n >> 1; \ a = &p[0]; \ b = &p[m]; \ c = COMPARE; \ c01 = c; \ a = &p[m]; \ b = &p[n-1]; \ c = COMPARE; \ c12 = c; \ /* if 0 >= mid >= end, or 0 < mid < end, then use mid */ \ if (c01 != c12) { \ /* otherwise, we'll need to swap something else to middle */ \ int z; \ a = &p[0]; \ b = &p[n-1]; \ c = COMPARE; \ /* 0>mid && midn => n; 0 0 */ \ /* 0n: 0>n => 0; 0 n */ \ z = (c == c12) ? 0 : n-1; \ t = p[z]; \ p[z] = p[m]; \ p[m] = t; \ } \ /* now p[m] is the median-of-three */ \ /* swap it to the beginning so it won't move around */ \ t = p[0]; \ p[0] = p[m]; \ p[m] = t; \ \ /* partition loop */ \ i=1; \ j=n-1; \ for(;;) { \ /* handling of equality is crucial here */ \ /* for sentinels & efficiency with duplicates */ \ b = &p[0]; \ for (;;++i) { \ a=&p[i]; \ c = COMPARE; \ if (!c) break; \ } \ a = &p[0]; \ for (;;--j) { \ b=&p[j]; \ c = COMPARE; \ if (!c) break; \ } \ /* make sure we haven't crossed */ \ if (i >= j) break; \ t = p[i]; \ p[i] = p[j]; \ p[j] = t; \ \ ++i; \ --j; \ } \ /* recurse on smaller side, iterate on larger */ \ if (j < (n-i)) { \ STB_(FUNCNAME,_quicksort)(p,j); \ p = p+i; \ n = n-i; \ } else { \ STB_(FUNCNAME,_quicksort)(p+i, n-i); \ n = j; \ } \ } \ } \ \ MODE FUNCNAME(TYPE *p, int n) \ { \ STB_(FUNCNAME, _quicksort)(p, n); \ STB_(FUNCNAME, _ins_sort)(p, n); \ } \ ////////////////////////////////////////////////////////////////////////////// // // stb_bitset an array of booleans indexed by integers // typedef stb_uint32 stb_bitset; STB_EXTERN stb_bitset *stb_bitset_new(int value, int len); #define stb_bitset_clearall(arr,len) (memset(arr, 0, 4 * (len))) #define stb_bitset_setall(arr,len) (memset(arr, 255, 4 * (len))) #define stb_bitset_setbit(arr,n) ((arr)[(n) >> 5] |= (1 << (n & 31))) #define stb_bitset_clearbit(arr,n) ((arr)[(n) >> 5] &= ~(1 << (n & 31))) #define stb_bitset_testbit(arr,n) ((arr)[(n) >> 5] & (1 << (n & 31))) STB_EXTERN stb_bitset *stb_bitset_union(stb_bitset *p0, stb_bitset *p1, int len); STB_EXTERN int *stb_bitset_getlist(stb_bitset *out, int start, int end); STB_EXTERN int stb_bitset_eq(stb_bitset *p0, stb_bitset *p1, int len); STB_EXTERN int stb_bitset_disjoint(stb_bitset *p0, stb_bitset *p1, int len); STB_EXTERN int stb_bitset_disjoint_0(stb_bitset *p0, stb_bitset *p1, int len); STB_EXTERN int stb_bitset_subset(stb_bitset *bigger, stb_bitset *smaller, int len); STB_EXTERN int stb_bitset_unioneq_changed(stb_bitset *p0, stb_bitset *p1, int len); #ifdef STB_DEFINE int stb_bitset_eq(stb_bitset *p0, stb_bitset *p1, int len) { int i; for (i=0; i < len; ++i) if (p0[i] != p1[i]) return 0; return 1; } int stb_bitset_disjoint(stb_bitset *p0, stb_bitset *p1, int len) { int i; for (i=0; i < len; ++i) if (p0[i] & p1[i]) return 0; return 1; } int stb_bitset_disjoint_0(stb_bitset *p0, stb_bitset *p1, int len) { int i; for (i=0; i < len; ++i) if ((p0[i] | p1[i]) != 0xffffffff) return 0; return 1; } int stb_bitset_subset(stb_bitset *bigger, stb_bitset *smaller, int len) { int i; for (i=0; i < len; ++i) if ((bigger[i] & smaller[i]) != smaller[i]) return 0; return 1; } stb_bitset *stb_bitset_union(stb_bitset *p0, stb_bitset *p1, int len) { int i; stb_bitset *d = (stb_bitset *) malloc(sizeof(*d) * len); for (i=0; i < len; ++i) d[i] = p0[i] | p1[i]; return d; } int stb_bitset_unioneq_changed(stb_bitset *p0, stb_bitset *p1, int len) { int i, changed=0; for (i=0; i < len; ++i) { stb_bitset d = p0[i] | p1[i]; if (d != p0[i]) { p0[i] = d; changed = 1; } } return changed; } stb_bitset *stb_bitset_new(int value, int len) { int i; stb_bitset *d = (stb_bitset *) malloc(sizeof(*d) * len); if (value) value = 0xffffffff; for (i=0; i < len; ++i) d[i] = value; return d; } int *stb_bitset_getlist(stb_bitset *out, int start, int end) { int *list = NULL; int i; for (i=start; i < end; ++i) if (stb_bitset_testbit(out, i)) stb_arr_push(list, i); return list; } #endif ////////////////////////////////////////////////////////////////////////////// // // stb_wordwrap quality word-wrapping for fixed-width fonts // STB_EXTERN int stb_wordwrap(int *pairs, int pair_max, int count, char *str); STB_EXTERN int *stb_wordwrapalloc(int count, char *str); #ifdef STB_DEFINE int stb_wordwrap(int *pairs, int pair_max, int count, char *str) { int n=0,i=0, start=0,nonwhite=0; if (pairs == NULL) pair_max = 0x7ffffff0; else pair_max *= 2; // parse for(;;) { int s=i; // first whitespace char; last nonwhite+1 int w; // word start // accept whitespace while (isspace(str[i])) { if (str[i] == '\n' || str[i] == '\r') { if (str[i] + str[i+1] == '\n' + '\r') ++i; if (n >= pair_max) return -1; if (pairs) pairs[n] = start, pairs[n+1] = s-start; n += 2; nonwhite=0; start = i+1; s = start; } ++i; } if (i >= start+count) { // we've gone off the end using whitespace if (nonwhite) { if (n >= pair_max) return -1; if (pairs) pairs[n] = start, pairs[n+1] = s-start; n += 2; start = s = i; nonwhite=0; } else { // output all the whitespace while (i >= start+count) { if (n >= pair_max) return -1; if (pairs) pairs[n] = start, pairs[n+1] = count; n += 2; start += count; } s = start; } } if (str[i] == 0) break; // now scan out a word and see if it fits w = i; while (str[i] && !isspace(str[i])) { ++i; } // wrapped? if (i > start + count) { // huge? if (i-s <= count) { if (n >= pair_max) return -1; if (pairs) pairs[n] = start, pairs[n+1] = s-start; n += 2; start = w; } else { // This word is longer than one line. If we wrap it onto N lines // there are leftover chars. do those chars fit on the cur line? // But if we have leading whitespace, we force it to start here. if ((w-start) + ((i-w) % count) <= count || !nonwhite) { // output a full line if (n >= pair_max) return -1; if (pairs) pairs[n] = start, pairs[n+1] = count; n += 2; start += count; w = start; } else { // output a partial line, trimming trailing whitespace if (s != start) { if (n >= pair_max) return -1; if (pairs) pairs[n] = start, pairs[n+1] = s-start; n += 2; start = w; } } // now output full lines as needed while (start + count <= i) { if (n >= pair_max) return -1; if (pairs) pairs[n] = start, pairs[n+1] = count; n += 2; start += count; } } } nonwhite=1; } if (start < i) { if (n >= pair_max) return -1; if (pairs) pairs[n] = start, pairs[n+1] = i-start; n += 2; } return n>>1; } int *stb_wordwrapalloc(int count, char *str) { int n = stb_wordwrap(NULL,0,count,str); int *z = NULL; stb_arr_setlen(z, n*2); stb_wordwrap(z, n, count, str); return z; } #endif ////////////////////////////////////////////////////////////////////////////// // // stb_match: wildcards and regexping // STB_EXTERN int stb_wildmatch (char *expr, char *candidate); STB_EXTERN int stb_wildmatchi(char *expr, char *candidate); STB_EXTERN int stb_wildfind (char *expr, char *candidate); STB_EXTERN int stb_wildfindi (char *expr, char *candidate); STB_EXTERN int stb_regex(char *regex, char *candidate); typedef struct stb_matcher stb_matcher; STB_EXTERN stb_matcher *stb_regex_matcher(char *regex); STB_EXTERN int stb_matcher_match(stb_matcher *m, char *str); STB_EXTERN int stb_matcher_find(stb_matcher *m, char *str); STB_EXTERN void stb_matcher_free(stb_matcher *f); STB_EXTERN stb_matcher *stb_lex_matcher(void); STB_EXTERN int stb_lex_item(stb_matcher *m, char *str, int result); STB_EXTERN int stb_lex_item_wild(stb_matcher *matcher, char *regex, int result); STB_EXTERN int stb_lex(stb_matcher *m, char *str, int *len); #ifdef STB_DEFINE static int stb__match_qstring(char *candidate, char *qstring, int qlen, int insensitive) { int i; if (insensitive) { for (i=0; i < qlen; ++i) if (qstring[i] == '?') { if (!candidate[i]) return 0; } else if (tolower(qstring[i]) != tolower(candidate[i])) return 0; } else { for (i=0; i < qlen; ++i) if (qstring[i] == '?') { if (!candidate[i]) return 0; } else if (qstring[i] != candidate[i]) return 0; } return 1; } static int stb__find_qstring(char *candidate, char *qstring, int qlen, int insensitive) { char c; int offset=0; while (*qstring == '?') { ++qstring; --qlen; ++candidate; if (qlen == 0) return 0; if (*candidate == 0) return -1; } c = *qstring++; --qlen; if (insensitive) c = tolower(c); while (candidate[offset]) { if (c == (insensitive ? tolower(candidate[offset]) : candidate[offset])) if (stb__match_qstring(candidate+offset+1, qstring, qlen, insensitive)) return offset; ++offset; } return -1; } int stb__wildmatch_raw2(char *expr, char *candidate, int search, int insensitive) { int where=0; int start = -1; if (!search) { // parse to first '*' if (*expr != '*') start = 0; while (*expr != '*') { if (!*expr) return *candidate == 0 ? 0 : -1; if (*expr == '?') { if (!*candidate) return -1; } else { if (insensitive) { if (tolower(*candidate) != tolower(*expr)) return -1; } else if (*candidate != *expr) return -1; } ++candidate, ++expr, ++where; } } else { // 0-length search string if (!*expr) return 0; } assert(search || *expr == '*'); if (!search) ++expr; // implicit '*' at this point while (*expr) { int o=0; // combine redundant * characters while (expr[0] == '*') ++expr; // ok, at this point, expr[-1] == '*', // and expr[0] != '*' if (!expr[0]) return start >= 0 ? start : 0; // now find next '*' o = 0; while (expr[o] != '*') { if (expr[o] == 0) break; ++o; } // if no '*', scan to end, then match at end if (expr[o] == 0 && !search) { int z; for (z=0; z < o; ++z) if (candidate[z] == 0) return -1; while (candidate[z]) ++z; // ok, now check if they match if (stb__match_qstring(candidate+z-o, expr, o, insensitive)) return start >= 0 ? start : 0; return -1; } else { // if yes '*', then do stb__find_qmatch on the intervening chars int n = stb__find_qstring(candidate, expr, o, insensitive); if (n < 0) return -1; if (start < 0) start = where + n; expr += o; candidate += n+o; } if (*expr == 0) { assert(search); return start; } assert(*expr == '*'); ++expr; } return start >= 0 ? start : 0; } int stb__wildmatch_raw(char *expr, char *candidate, int search, int insensitive) { char buffer[256]; // handle multiple search strings char *s = strchr(expr, ';'); char *last = expr; while (s) { int z; // need to allow for non-writeable strings... assume they're small if (s - last < 256) { stb_strncpy(buffer, last, s-last+1); z = stb__wildmatch_raw2(buffer, candidate, search, insensitive); } else { *s = 0; z = stb__wildmatch_raw2(last, candidate, search, insensitive); *s = ';'; } if (z >= 0) return z; last = s+1; s = strchr(last, ';'); } return stb__wildmatch_raw2(last, candidate, search, insensitive); } int stb_wildmatch(char *expr, char *candidate) { return stb__wildmatch_raw(expr, candidate, 0,0) >= 0; } int stb_wildmatchi(char *expr, char *candidate) { return stb__wildmatch_raw(expr, candidate, 0,1) >= 0; } int stb_wildfind(char *expr, char *candidate) { return stb__wildmatch_raw(expr, candidate, 1,0); } int stb_wildfindi(char *expr, char *candidate) { return stb__wildmatch_raw(expr, candidate, 1,1); } typedef struct { stb_int16 transition[256]; } stb_dfa; // an NFA node represents a state you're in; it then has // an arbitrary number of edges dangling off of it // note this isn't utf8-y typedef struct { stb_int16 match; // character/set to match stb_uint16 node; // output node to go to } stb_nfa_edge; typedef struct { stb_int16 goal; // does reaching this win the prize? stb_uint8 active; // is this in the active list stb_nfa_edge *out; stb_uint16 *eps; // list of epsilon closures } stb_nfa_node; #define STB__DFA_UNDEF -1 #define STB__DFA_GOAL -2 #define STB__DFA_END -3 #define STB__DFA_MGOAL -4 #define STB__DFA_VALID 0 #define STB__NFA_STOP_GOAL -1 // compiled regexp struct stb_matcher { stb_uint16 start_node; stb_int16 dfa_start; stb_uint32 *charset; int num_charset; int match_start; stb_nfa_node *nodes; int does_lex; // dfa matcher stb_dfa * dfa; stb_uint32 * dfa_mapping; stb_int16 * dfa_result; int num_words_per_dfa; }; static int stb__add_node(stb_matcher *matcher) { stb_nfa_node z; z.active = 0; z.eps = 0; z.goal = 0; z.out = 0; stb_arr_push(matcher->nodes, z); return stb_arr_len(matcher->nodes)-1; } static void stb__add_epsilon(stb_matcher *matcher, int from, int to) { assert(from != to); if (matcher->nodes[from].eps == NULL) stb_arr_malloc((void **) &matcher->nodes[from].eps, matcher); stb_arr_push(matcher->nodes[from].eps, to); } static void stb__add_edge(stb_matcher *matcher, int from, int to, int type) { stb_nfa_edge z = { type, to }; if (matcher->nodes[from].out == NULL) stb_arr_malloc((void **) &matcher->nodes[from].out, matcher); stb_arr_push(matcher->nodes[from].out, z); } static char *stb__reg_parse_alt(stb_matcher *m, int s, char *r, stb_uint16 *e); static char *stb__reg_parse(stb_matcher *matcher, int start, char *regex, stb_uint16 *end) { int n; int last_start = -1; stb_uint16 last_end = start; while (*regex) { switch (*regex) { case '(': last_start = last_end; regex = stb__reg_parse_alt(matcher, last_end, regex+1, &last_end); if (regex == NULL || *regex != ')') return NULL; ++regex; break; case '|': case ')': *end = last_end; return regex; case '?': if (last_start < 0) return NULL; stb__add_epsilon(matcher, last_start, last_end); ++regex; break; case '*': if (last_start < 0) return NULL; stb__add_epsilon(matcher, last_start, last_end); // fall through case '+': if (last_start < 0) return NULL; stb__add_epsilon(matcher, last_end, last_start); // prevent links back to last_end from chaining to last_start n = stb__add_node(matcher); stb__add_epsilon(matcher, last_end, n); last_end = n; ++regex; break; case '{': // not supported! // @TODO: given {n,m}, clone last_start to last_end m times, // and include epsilons from start to first m-n blocks return NULL; case '\\': ++regex; if (!*regex) return NULL; // fallthrough default: // match exactly this character n = stb__add_node(matcher); stb__add_edge(matcher, last_end, n, *regex); last_start = last_end; last_end = n; ++regex; break; case '$': n = stb__add_node(matcher); stb__add_edge(matcher, last_end, n, '\n'); last_start = last_end; last_end = n; ++regex; break; case '.': n = stb__add_node(matcher); stb__add_edge(matcher, last_end, n, -1); last_start = last_end; last_end = n; ++regex; break; case '[': { stb_uint8 flags[256]; int invert = 0,z; ++regex; if (matcher->num_charset == 0) { matcher->charset = (stb_uint *) stb_malloc(matcher, sizeof(*matcher->charset) * 256); memset(matcher->charset, 0, sizeof(*matcher->charset) * 256); } memset(flags,0,sizeof(flags)); // leading ^ is special if (*regex == '^') ++regex, invert = 1; // leading ] is special if (*regex == ']') { flags[']'] = 1; ++regex; } while (*regex != ']') { stb_uint a; if (!*regex) return NULL; a = *regex++; if (regex[0] == '-' && regex[1] != ']') { stb_uint i,b = regex[1]; regex += 2; if (b == 0) return NULL; if (a > b) return NULL; for (i=a; i <= b; ++i) flags[i] = 1; } else flags[a] = 1; } ++regex; if (invert) { int i; for (i=0; i < 256; ++i) flags[i] = 1-flags[i]; } // now check if any existing charset matches for (z=0; z < matcher->num_charset; ++z) { int i, k[2] = { 0, 1 << z}; for (i=0; i < 256; ++i) { unsigned int f = k[flags[i]]; if ((matcher->charset[i] & k[1]) != f) break; } if (i == 256) break; } if (z == matcher->num_charset) { int i; ++matcher->num_charset; if (matcher->num_charset > 32) { assert(0); /* NOTREACHED */ return NULL; // too many charsets, oops } for (i=0; i < 256; ++i) if (flags[i]) matcher->charset[i] |= (1 << z); } n = stb__add_node(matcher); stb__add_edge(matcher, last_end, n, -2 - z); last_start = last_end; last_end = n; break; } } } *end = last_end; return regex; } static char *stb__reg_parse_alt(stb_matcher *matcher, int start, char *regex, stb_uint16 *end) { stb_uint16 last_end = start; stb_uint16 main_end; int head, tail; head = stb__add_node(matcher); stb__add_epsilon(matcher, start, head); regex = stb__reg_parse(matcher, head, regex, &last_end); if (regex == NULL) return NULL; if (*regex == 0 || *regex == ')') { *end = last_end; return regex; } main_end = last_end; tail = stb__add_node(matcher); stb__add_epsilon(matcher, last_end, tail); // start alternatives from the same starting node; use epsilon // transitions to combine their endings while(*regex && *regex != ')') { assert(*regex == '|'); head = stb__add_node(matcher); stb__add_epsilon(matcher, start, head); regex = stb__reg_parse(matcher, head, regex+1, &last_end); if (regex == NULL) return NULL; stb__add_epsilon(matcher, last_end, tail); } *end = tail; return regex; } static char *stb__wild_parse(stb_matcher *matcher, int start, char *str, stb_uint16 *end) { int n; stb_uint16 last_end; last_end = stb__add_node(matcher); stb__add_epsilon(matcher, start, last_end); while (*str) { switch (*str) { // fallthrough default: // match exactly this character n = stb__add_node(matcher); if (toupper(*str) == tolower(*str)) { stb__add_edge(matcher, last_end, n, *str); } else { stb__add_edge(matcher, last_end, n, tolower(*str)); stb__add_edge(matcher, last_end, n, toupper(*str)); } last_end = n; ++str; break; case '?': n = stb__add_node(matcher); stb__add_edge(matcher, last_end, n, -1); last_end = n; ++str; break; case '*': n = stb__add_node(matcher); stb__add_edge(matcher, last_end, n, -1); stb__add_epsilon(matcher, last_end, n); stb__add_epsilon(matcher, n, last_end); last_end = n; ++str; break; } } // now require end of string to match n = stb__add_node(matcher); stb__add_edge(matcher, last_end, n, 0); last_end = n; *end = last_end; return str; } static int stb__opt(stb_matcher *m, int n) { for(;;) { stb_nfa_node *p = &m->nodes[n]; if (p->goal) return n; if (stb_arr_len(p->out)) return n; if (stb_arr_len(p->eps) != 1) return n; n = p->eps[0]; } } static void stb__optimize(stb_matcher *m) { // if the target of any edge is a node with exactly // one out-epsilon, shorten it int i,j; for (i=0; i < stb_arr_len(m->nodes); ++i) { stb_nfa_node *p = &m->nodes[i]; for (j=0; j < stb_arr_len(p->out); ++j) p->out[j].node = stb__opt(m,p->out[j].node); for (j=0; j < stb_arr_len(p->eps); ++j) p->eps[j] = stb__opt(m,p->eps[j] ); } m->start_node = stb__opt(m,m->start_node); } void stb_matcher_free(stb_matcher *f) { stb_free(f); } static stb_matcher *stb__alloc_matcher(void) { stb_matcher *matcher = (stb_matcher *) stb_malloc(0,sizeof(*matcher)); matcher->start_node = 0; stb_arr_malloc((void **) &matcher->nodes, matcher); matcher->num_charset = 0; matcher->match_start = 0; matcher->does_lex = 0; matcher->dfa_start = STB__DFA_UNDEF; stb_arr_malloc((void **) &matcher->dfa, matcher); stb_arr_malloc((void **) &matcher->dfa_mapping, matcher); stb_arr_malloc((void **) &matcher->dfa_result, matcher); stb__add_node(matcher); return matcher; } static void stb__lex_reset(stb_matcher *matcher) { // flush cached dfa data stb_arr_setlen(matcher->dfa, 0); stb_arr_setlen(matcher->dfa_mapping, 0); stb_arr_setlen(matcher->dfa_result, 0); matcher->dfa_start = STB__DFA_UNDEF; } stb_matcher *stb_regex_matcher(char *regex) { char *z; stb_uint16 end; stb_matcher *matcher = stb__alloc_matcher(); if (*regex == '^') { matcher->match_start = 1; ++regex; } z = stb__reg_parse_alt(matcher, matcher->start_node, regex, &end); if (!z || *z) { stb_free(matcher); return NULL; } ((matcher->nodes)[(int) end]).goal = STB__NFA_STOP_GOAL; return matcher; } stb_matcher *stb_lex_matcher(void) { stb_matcher *matcher = stb__alloc_matcher(); matcher->match_start = 1; matcher->does_lex = 1; return matcher; } int stb_lex_item(stb_matcher *matcher, char *regex, int result) { char *z; stb_uint16 end; z = stb__reg_parse_alt(matcher, matcher->start_node, regex, &end); if (z == NULL) return 0; stb__lex_reset(matcher); matcher->nodes[(int) end].goal = result; return 1; } int stb_lex_item_wild(stb_matcher *matcher, char *regex, int result) { char *z; stb_uint16 end; z = stb__wild_parse(matcher, matcher->start_node, regex, &end); if (z == NULL) return 0; stb__lex_reset(matcher); matcher->nodes[(int) end].goal = result; return 1; } static void stb__clear(stb_matcher *m, stb_uint16 *list) { int i; for (i=0; i < stb_arr_len(list); ++i) m->nodes[(int) list[i]].active = 0; } static int stb__clear_goalcheck(stb_matcher *m, stb_uint16 *list) { int i, t=0; for (i=0; i < stb_arr_len(list); ++i) { t += m->nodes[(int) list[i]].goal; m->nodes[(int) list[i]].active = 0; } return t; } static stb_uint16 * stb__add_if_inactive(stb_matcher *m, stb_uint16 *list, int n) { if (!m->nodes[n].active) { stb_arr_push(list, n); m->nodes[n].active = 1; } return list; } static stb_uint16 * stb__eps_closure(stb_matcher *m, stb_uint16 *list) { int i,n = stb_arr_len(list); for(i=0; i < n; ++i) { stb_uint16 *e = m->nodes[(int) list[i]].eps; if (e) { int j,k = stb_arr_len(e); for (j=0; j < k; ++j) list = stb__add_if_inactive(m, list, e[j]); n = stb_arr_len(list); } } return list; } int stb_matcher_match(stb_matcher *m, char *str) { int result = 0; int i,j,y,z; stb_uint16 *previous = NULL; stb_uint16 *current = NULL; stb_uint16 *temp; stb_arr_setsize(previous, 4); stb_arr_setsize(current, 4); previous = stb__add_if_inactive(m, previous, m->start_node); previous = stb__eps_closure(m,previous); stb__clear(m, previous); while (*str && stb_arr_len(previous)) { y = stb_arr_len(previous); for (i=0; i < y; ++i) { stb_nfa_node *n = &m->nodes[(int) previous[i]]; z = stb_arr_len(n->out); for (j=0; j < z; ++j) { if (n->out[j].match >= 0) { if (n->out[j].match == *str) current = stb__add_if_inactive(m, current, n->out[j].node); } else if (n->out[j].match == -1) { if (*str != '\n') current = stb__add_if_inactive(m, current, n->out[j].node); } else if (n->out[j].match < -1) { int z = -n->out[j].match - 2; if (m->charset[(stb_uint8) *str] & (1 << z)) current = stb__add_if_inactive(m, current, n->out[j].node); } } } stb_arr_setlen(previous, 0); temp = previous; previous = current; current = temp; previous = stb__eps_closure(m,previous); stb__clear(m, previous); ++str; } // transition to pick up a '$' at the end y = stb_arr_len(previous); for (i=0; i < y; ++i) m->nodes[(int) previous[i]].active = 1; for (i=0; i < y; ++i) { stb_nfa_node *n = &m->nodes[(int) previous[i]]; z = stb_arr_len(n->out); for (j=0; j < z; ++j) { if (n->out[j].match == '\n') current = stb__add_if_inactive(m, current, n->out[j].node); } } previous = stb__eps_closure(m,previous); stb__clear(m, previous); y = stb_arr_len(previous); for (i=0; i < y; ++i) if (m->nodes[(int) previous[i]].goal) result = 1; stb_arr_free(previous); stb_arr_free(current); return result && *str == 0; } stb_int16 stb__get_dfa_node(stb_matcher *m, stb_uint16 *list) { stb_uint16 node; stb_uint32 data[8], *state, *newstate; int i,j,n; state = (stb_uint32 *) stb_temp(data, m->num_words_per_dfa * 4); memset(state, 0, m->num_words_per_dfa*4); n = stb_arr_len(list); for (i=0; i < n; ++i) { int x = list[i]; state[x >> 5] |= 1 << (x & 31); } // @TODO use a hash table n = stb_arr_len(m->dfa_mapping); i=j=0; for(; j < n; ++i, j += m->num_words_per_dfa) { // @TODO special case for <= 32 if (!memcmp(state, m->dfa_mapping + j, m->num_words_per_dfa*4)) { node = i; goto done; } } assert(stb_arr_len(m->dfa) == i); node = i; newstate = stb_arr_addn(m->dfa_mapping, m->num_words_per_dfa); memcpy(newstate, state, m->num_words_per_dfa*4); // set all transitions to 'unknown' stb_arr_add(m->dfa); memset(m->dfa[i].transition, -1, sizeof(m->dfa[i].transition)); if (m->does_lex) { int result = -1; n = stb_arr_len(list); for (i=0; i < n; ++i) { if (m->nodes[(int) list[i]].goal > result) result = m->nodes[(int) list[i]].goal; } stb_arr_push(m->dfa_result, result); } done: stb_tempfree(data, state); return node; } static int stb__matcher_dfa(stb_matcher *m, char *str_c, int *len) { stb_uint8 *str = (stb_uint8 *) str_c; stb_int16 node,prevnode; stb_dfa *trans; int match_length = 0; stb_int16 match_result=0; if (m->dfa_start == STB__DFA_UNDEF) { stb_uint16 *list; m->num_words_per_dfa = (stb_arr_len(m->nodes)+31) >> 5; stb__optimize(m); list = stb__add_if_inactive(m, NULL, m->start_node); list = stb__eps_closure(m,list); if (m->does_lex) { m->dfa_start = stb__get_dfa_node(m,list); stb__clear(m, list); // DON'T allow start state to be a goal state! // this allows people to specify regexes that can match 0 // characters without them actually matching (also we don't // check _before_ advancing anyway if (m->dfa_start <= STB__DFA_MGOAL) m->dfa_start = -(m->dfa_start - STB__DFA_MGOAL); } else { if (stb__clear_goalcheck(m, list)) m->dfa_start = STB__DFA_GOAL; else m->dfa_start = stb__get_dfa_node(m,list); } stb_arr_free(list); } prevnode = STB__DFA_UNDEF; node = m->dfa_start; trans = m->dfa; if (m->dfa_start == STB__DFA_GOAL) return 1; for(;;) { assert(node >= STB__DFA_VALID); // fast inner DFA loop; especially if STB__DFA_VALID is 0 do { prevnode = node; node = trans[node].transition[*str++]; } while (node >= STB__DFA_VALID); assert(node >= STB__DFA_MGOAL - stb_arr_len(m->dfa)); assert(node < stb_arr_len(m->dfa)); // special case for lex: need _longest_ match, so notice goal // state without stopping if (node <= STB__DFA_MGOAL) { match_length = str - (stb_uint8 *) str_c; node = -(node - STB__DFA_MGOAL); match_result = node; continue; } // slow NFA->DFA conversion // or we hit the goal or the end of the string, but those // can only happen once per search... if (node == STB__DFA_UNDEF) { // build a list -- @TODO special case <= 32 states // heck, use a more compact data structure for <= 16 and <= 8 ?! // @TODO keep states/newstates around instead of reallocating them stb_uint16 *states = NULL; stb_uint16 *newstates = NULL; int i,j,y,z; stb_uint32 *flags = &m->dfa_mapping[prevnode * m->num_words_per_dfa]; assert(prevnode != STB__DFA_UNDEF); stb_arr_setsize(states, 4); stb_arr_setsize(newstates,4); for (j=0; j < m->num_words_per_dfa; ++j) { for (i=0; i < 32; ++i) { if (*flags & (1 << i)) stb_arr_push(states, j*32+i); } ++flags; } // states is now the states we were in in the previous node; // so now we can compute what node it transitions to on str[-1] y = stb_arr_len(states); for (i=0; i < y; ++i) { stb_nfa_node *n = &m->nodes[(int) states[i]]; z = stb_arr_len(n->out); for (j=0; j < z; ++j) { if (n->out[j].match >= 0) { if (n->out[j].match == str[-1] || (str[-1] == 0 && n->out[j].match == '\n')) newstates = stb__add_if_inactive(m, newstates, n->out[j].node); } else if (n->out[j].match == -1) { if (str[-1] != '\n' && str[-1]) newstates = stb__add_if_inactive(m, newstates, n->out[j].node); } else if (n->out[j].match < -1) { int z = -n->out[j].match - 2; if (m->charset[str[-1]] & (1 << z)) newstates = stb__add_if_inactive(m, newstates, n->out[j].node); } } } // AND add in the start state! if (!m->match_start || (str[-1] == '\n' && !m->does_lex)) newstates = stb__add_if_inactive(m, newstates, m->start_node); // AND epsilon close it newstates = stb__eps_closure(m, newstates); // if it's a goal state, then that's all there is to it if (stb__clear_goalcheck(m, newstates)) { if (m->does_lex) { match_length = str - (stb_uint8 *) str_c; node = stb__get_dfa_node(m,newstates); match_result = node; node = -node + STB__DFA_MGOAL; trans = m->dfa; // could have gotten realloc()ed } else node = STB__DFA_GOAL; } else if (str[-1] == 0 || stb_arr_len(newstates) == 0) { node = STB__DFA_END; } else { node = stb__get_dfa_node(m,newstates); trans = m->dfa; // could have gotten realloc()ed } trans[prevnode].transition[str[-1]] = node; if (node <= STB__DFA_MGOAL) node = -(node - STB__DFA_MGOAL); stb_arr_free(newstates); stb_arr_free(states); } if (node == STB__DFA_GOAL) { return 1; } if (node == STB__DFA_END) { if (m->does_lex) { if (match_result) { if (len) *len = match_length; return m->dfa_result[(int) match_result]; } } return 0; } assert(node != STB__DFA_UNDEF); } } int stb_matcher_find(stb_matcher *m, char *str) { assert(m->does_lex == 0); return stb__matcher_dfa(m, str, NULL); } int stb_lex(stb_matcher *m, char *str, int *len) { assert(m->does_lex); return stb__matcher_dfa(m, str, len); } int stb_regex(char *regex, char *str) { static stb_perfect p; static stb_matcher ** matchers; static char ** regexps; static char ** regexp_cache; static unsigned short *mapping; int z = stb_perfect_hash(&p, (int) regex); if (z >= 0) { if (strcmp(regex, regexp_cache[(int) mapping[z]])) { int i = mapping[z]; stb_matcher_free(matchers[i]); free(regexp_cache[i]); regexps[i] = regex; regexp_cache[i] = strdup(regex); matchers[i] = stb_regex_matcher(regex); } } else { int i,n; if (regex == NULL) { for (i=0; i < stb_arr_len(matchers); ++i) { stb_matcher_free(matchers[i]); free(regexp_cache[i]); } stb_arr_free(matchers); stb_arr_free(regexps); stb_arr_free(regexp_cache); stb_perfect_destroy(&p); free(mapping); mapping = NULL; return -1; } stb_arr_push(regexps, regex); stb_arr_push(regexp_cache, strdup(regex)); stb_arr_push(matchers, stb_regex_matcher(regex)); stb_perfect_destroy(&p); n = stb_perfect_create(&p, (unsigned int *) (char **) regexps, stb_arr_len(regexps)); mapping = (unsigned short *) realloc(mapping, n * sizeof(*mapping)); for (i=0; i < stb_arr_len(regexps); ++i) mapping[stb_perfect_hash(&p, (int) regexps[i])] = i; z = stb_perfect_hash(&p, (int) regex); } return stb_matcher_find(matchers[(int) mapping[z]], str); } #endif // STB_DEFINE #if 0 ////////////////////////////////////////////////////////////////////////////// // // C source-code introspection // // runtime structure typedef struct { char *name; char *type; // base type char *comment; // content of comment field int size; // size of base type int offset; // field offset int arrcount[8]; // array sizes; -1 = pointer indirection; 0 = end of list } stb_info_field; typedef struct { char *structname; int size; int num_fields; stb_info_field *fields; } stb_info_struct; extern stb_info_struct stb_introspect_output[]; // STB_EXTERN void stb_introspect_precompiled(stb_info_struct *compiled); STB_EXTERN void stb__introspect(char *path, char *file); #define stb_introspect_ship() stb__introspect(NULL, NULL, stb__introspect_output) #ifdef STB_SHIP #define stb_introspect() stb_introspect_ship() #define stb_introspect_path(p) stb_introspect_ship() #else // bootstrapping: define stb_introspect() (or 'path') the first time #define stb_introspect() stb__introspect(NULL, __FILE__, NULL) #define stb_introspect_auto() stb__introspect(NULL, __FILE__, stb__introspect_output) #define stb_introspect_path(p) stb__introspect(p, __FILE__, NULL) #define stb_introspect_path(p) stb__introspect(p, __FILE__, NULL) #endif #ifdef STB_DEFINE #ifndef STB_INTROSPECT_CPP #ifdef __cplusplus #define STB_INTROSPECT_CPP 1 #else #define STB_INTROSPECT_CPP 0 #endif #endif void stb_introspect_precompiled(stb_info_struct *compiled) { } static void stb__introspect_filename(char *buffer, char *path) { #if STB_INTROSPECT_CPP sprintf(buffer, "%s/stb_introspect.cpp", path); #else sprintf(buffer, "%s/stb_introspect.c", path); #endif } static void stb__introspect_compute(char *path, char *file) { int i; char ** include_list = NULL; char ** introspect_list = NULL; FILE *f; f = fopen(file, "w"); if (!f) return; fputs("// if you get compiler errors, change the following 0 to a 1:\n", f); fputs("#define STB_INTROSPECT_INVALID 0\n\n", f); fputs("// this will force the code to compile, and force the introspector\n", f); fputs("// to run and then exit, allowing you to recompile\n\n\n", f); fputs("#include \"stb.h\"\n\n",f ); fputs("#if STB_INTROSPECT_INVALID\n", f); fputs(" stb_info_struct stb__introspect_output[] = { (void *) 1 }\n", f); fputs("#else\n\n", f); for (i=0; i < stb_arr_len(include_list); ++i) fprintf(f, " #include \"%s\"\n", include_list[i]); fputs(" stb_info_struct stb__introspect_output[] =\n{\n", f); for (i=0; i < stb_arr_len(introspect_list); ++i) fprintf(f, " stb_introspect_%s,\n", introspect_list[i]); fputs(" };\n", f); fputs("#endif\n", f); fclose(f); } static stb_info_struct *stb__introspect_info; #ifndef STB_SHIP #endif void stb__introspect(char *path, char *file, stb_info_struct *compiled) { static int first=1; if (!first) return; first=0; stb__introspect_info = compiled; #ifndef STB_SHIP if (path || file) { int bail_flag = compiled && compiled[0].structname == (void *) 1; int needs_building = bail_flag; struct stb__stat st; char buffer[1024], buffer2[1024]; if (!path) { stb_splitpath(buffer, file, STB_PATH); path = buffer; } // bail if the source path doesn't exist if (!stb_fexists(path)) return; stb__introspect_filename(buffer2, path); // get source/include files timestamps, compare to output-file timestamp; // if mismatched, regenerate if (stb__stat(buffer2, &st)) needs_building = STB_TRUE; { // find any file that contains an introspection command and is newer // if needs_building is already true, we don't need to do this test, // but we still need these arrays, so go ahead and get them char **all[3]; all[0] = stb_readdir_files_mask(path, "*.h"); all[1] = stb_readdir_files_mask(path, "*.c"); all[2] = stb_readdir_files_mask(path, "*.cpp"); int i,j; if (needs_building) { for (j=0; j < 3; ++j) { for (i=0; i < stb_arr_len(all[j]); ++i) { struct stb__stat st2; if (!stb__stat(all[j][i], &st2)) { if (st.st_mtime < st2.st_mtime) { char *z = stb_filec(all[j][i], NULL); int found=STB_FALSE; while (y) { y = strstr(y, "//si"); if (y && isspace(y[4])) { found = STB_TRUE; break; } } needs_building = STB_TRUE; goto done; } } } } done:; } char *z = stb_filec(all[i], NULL), *y = z; int found=STB_FALSE; while (y) { y = strstr(y, "//si"); if (y && isspace(y[4])) { found = STB_TRUE; break; } } if (found) stb_arr_push(introspect_h, strdup(all[i])); free(z); } } stb_readdir_free(all); if (!needs_building) { for (i=0; i < stb_arr_len(introspect_h); ++i) { struct stb__stat st2; if (!stb__stat(introspect_h[i], &st2)) if (st.st_mtime < st2.st_mtime) needs_building = STB_TRUE; } } if (needs_building) { stb__introspect_compute(path, buffer2); } } } #endif } #endif #endif #ifdef STB_INTROSPECT // compile-time code-generator #define INTROSPECT(x) int main(int argc, char **argv) { stb__introspect(__FILE__); return 0; } #define FILE(x) void stb__introspect(char *filename) { char *file = stb_file(filename, NULL); char *s = file, *t, **p; char *out_name = "stb_introspect.c"; char *out_path; STB_ARR(char) filelist = NULL; int i,n; if (!file) stb_fatal("Couldn't open %s", filename); out_path = stb_splitpathdup(filename, STB_PATH); // search for the macros while (*s) { char buffer[256]; while (*s && !isupper(*s)) ++s; s = stb_strtok_invert(buffer, s, "ABCDEFGHIJKLMNOPQRSTUVWXYZ"); s = stb_skipwhite(s); if (*s == '(') { ++s; t = strchr(s, ')'); if (t == NULL) stb_fatal("Error parsing %s", filename); } } } #endif ////////////////////////////////////////////////////////////////////////////// // // STB-C sliding-window dictionary compression // // This uses a DEFLATE-style sliding window, but no bitwise entropy. // Everything is on byte boundaries, so you could then apply a byte-wise // entropy code, though that's nowhere near as effective. // // An STB-C stream begins with a 16-byte header: // 4 bytes: 0x57 0xBC 0x00 0x00 // 8 bytes: big-endian size of decompressed data, 64-bits // 4 bytes: big-endian size of window (how far back decompressor may need) // // The following symbols appear in the stream (these were determined ad hoc, // not by analysis): // // [dict] 00000100 yyyyyyyy yyyyyyyy yyyyyyyy xxxxxxxx xxxxxxxx // [END] 00000101 11111010 cccccccc cccccccc cccccccc cccccccc // [dict] 00000110 yyyyyyyy yyyyyyyy yyyyyyyy xxxxxxxx // [literals] 00000111 zzzzzzzz zzzzzzzz // [literals] 00001zzz zzzzzzzz // [dict] 00010yyy yyyyyyyy yyyyyyyy xxxxxxxx xxxxxxxx // [dict] 00011yyy yyyyyyyy yyyyyyyy xxxxxxxx // [literals] 001zzzzz // [dict] 01yyyyyy yyyyyyyy xxxxxxxx // [dict] 1xxxxxxx yyyyyyyy // // xxxxxxxx: match length - 1 // yyyyyyyy: backwards distance - 1 // zzzzzzzz: num literals - 1 // cccccccc: adler32 checksum of decompressed data // (all big-endian) STB_EXTERN stb_uint stb_decompress_length(stb_uchar *input); STB_EXTERN stb_uint stb_decompress(stb_uchar *out,stb_uchar *in,stb_uint len); STB_EXTERN stb_uint stb_compress (stb_uchar *out,stb_uchar *in,stb_uint len); STB_EXTERN void stb_compress_window(int z); STB_EXTERN void stb_compress_hashsize(unsigned int z); STB_EXTERN int stb_compress_tofile(char *filename, char *in, stb_uint len); STB_EXTERN int stb_compress_intofile(FILE *f, char *input, stb_uint len); STB_EXTERN char *stb_decompress_fromfile(char *filename, stb_uint *len); STB_EXTERN int stb_compress_stream_start(FILE *f); STB_EXTERN void stb_compress_stream_end(int close); STB_EXTERN void stb_write(char *data, int data_len); #ifdef STB_DEFINE stb_uint stb_decompress_length(stb_uchar *input) { return (input[8] << 24) + (input[9] << 16) + (input[10] << 8) + input[11]; } //////////////////// decompressor /////////////////////// // simple implementation that just writes whole thing into big block static unsigned char *stb__barrier; static unsigned char *stb__barrier2; static unsigned char *stb__barrier3; static unsigned char *stb__barrier4; static stb_uchar *stb__dout; static void stb__match(stb_uchar *data, stb_uint length) { // INVERSE of memmove... write each byte before copying the next... assert (stb__dout + length <= stb__barrier); if (stb__dout + length > stb__barrier) { stb__dout += length; return; } if (data < stb__barrier4) { stb__dout = stb__barrier+1; return; } while (length--) *stb__dout++ = *data++; } static void stb__lit(stb_uchar *data, stb_uint length) { assert (stb__dout + length <= stb__barrier); if (stb__dout + length > stb__barrier) { stb__dout += length; return; } if (data < stb__barrier2) { stb__dout = stb__barrier+1; return; } memcpy(stb__dout, data, length); stb__dout += length; } #define stb__in2(x) ((i[x] << 8) + i[(x)+1]) #define stb__in3(x) ((i[x] << 16) + stb__in2((x)+1)) #define stb__in4(x) ((i[x] << 24) + stb__in3((x)+1)) static stb_uchar *stb_decompress_token(stb_uchar *i) { if (*i >= 0x20) { // use fewer if's for cases that expand small if (*i >= 0x80) stb__match(stb__dout-i[1]-1, i[0] - 0x80 + 1), i += 2; else if (*i >= 0x40) stb__match(stb__dout-(stb__in2(0) - 0x4000 + 1), i[2]+1), i += 3; else /* *i >= 0x20 */ stb__lit(i+1, i[0] - 0x20 + 1), i += 1 + (i[0] - 0x20 + 1); } else { // more ifs for cases that expand large, since overhead is amortized if (*i >= 0x18) stb__match(stb__dout-(stb__in3(0) - 0x180000 + 1), i[3]+1), i += 4; else if (*i >= 0x10) stb__match(stb__dout-(stb__in3(0) - 0x100000 + 1), stb__in2(3)+1), i += 5; else if (*i >= 0x08) stb__lit(i+2, stb__in2(0) - 0x0800 + 1), i += 2 + (stb__in2(0) - 0x0800 + 1); else if (*i == 0x07) stb__lit(i+3, stb__in2(1) + 1), i += 3 + (stb__in2(1) + 1); else if (*i == 0x06) stb__match(stb__dout-(stb__in3(1)+1), i[4]+1), i += 5; else if (*i == 0x04) stb__match(stb__dout-(stb__in3(1)+1), stb__in2(4)+1), i += 6; } return i; } stb_uint stb_decompress(stb_uchar *output, stb_uchar *i, stb_uint length) { stb_uint olen; if (stb__in4(0) != 0x57bC0000) return 0; if (stb__in4(4) != 0) return 0; // error! stream is > 4GB olen = stb_decompress_length(i); stb__barrier2 = i; stb__barrier3 = i+length; stb__barrier = output + olen; stb__barrier4 = output; i += 16; stb__dout = output; while (1) { stb_uchar *old_i = i; i = stb_decompress_token(i); if (i == old_i) { if (*i == 0x05 && i[1] == 0xfa) { assert(stb__dout == output + olen); if (stb__dout != output + olen) return 0; if (stb_adler32(1, output, olen) != (stb_uint) stb__in4(2)) return 0; return olen; } else { assert(0); /* NOTREACHED */ return 0; } } assert(stb__dout <= output + olen); if (stb__dout > output + olen) return 0; } } char *stb_decompress_fromfile(char *filename, unsigned int *len) { unsigned int n; char *q; unsigned char *p; FILE *f = fopen(filename, "rb"); if (f == NULL) return NULL; fseek(f, 0, SEEK_END); n = ftell(f); fseek(f, 0, SEEK_SET); p = (unsigned char * ) malloc(n); if (p == NULL) return NULL; fread(p, 1, n, f); fclose(f); if (p == NULL) return NULL; if (p[0] != 0x57 || p[1] != 0xBc || p[2] || p[3]) { free(p); return NULL; } q = (char *) malloc(stb_decompress_length(p)+1); if (!q) { free(p); return NULL; } *len = stb_decompress((unsigned char *) q, p, n); if (*len) q[*len] = 0; free(p); return q; } #if 0 // streaming decompressor static struct { stb__uchar *in_buffer; stb__uchar *match; stb__uint pending_literals; stb__uint pending_match; } xx; static void stb__match(stb_uchar *data, stb_uint length) { // INVERSE of memmove... write each byte before copying the next... assert (stb__dout + length <= stb__barrier); if (stb__dout + length > stb__barrier) { stb__dout += length; return; } if (data < stb__barrier2) { stb__dout = stb__barrier+1; return; } while (length--) *stb__dout++ = *data++; } static void stb__lit(stb_uchar *data, stb_uint length) { assert (stb__dout + length <= stb__barrier); if (stb__dout + length > stb__barrier) { stb__dout += length; return; } if (data < stb__barrier2) { stb__dout = stb__barrier+1; return; } memcpy(stb__dout, data, length); stb__dout += length; } static void sx_match(stb_uchar *data, stb_uint length) { xx.match = data; xx.pending_match = length; } static void sx_lit(stb_uchar *data, stb_uint length) { xx.pending_lit = length; } static int stb_decompress_token_state(void) { stb__uchar *i = xx.in_buffer; if (*i >= 0x20) { // use fewer if's for cases that expand small if (*i >= 0x80) sx_match(stb__dout-i[1]-1, i[0] - 0x80 + 1), i += 2; else if (*i >= 0x40) sx_match(stb__dout-(stb__in2(0) - 0x4000 + 1), i[2]+1), i += 3; else /* *i >= 0x20 */ sx_lit(i+1, i[0] - 0x20 + 1), i += 1; } else { // more ifs for cases that expand large, since overhead is amortized if (*i >= 0x18) sx_match(stb__dout-(stb__in3(0) - 0x180000 + 1), i[3]+1), i += 4; else if (*i >= 0x10) sx_match(stb__dout-(stb__in3(0) - 0x100000 + 1), stb__in2(3)+1), i += 5; else if (*i >= 0x08) sx_lit(i+2, stb__in2(0) - 0x0800 + 1), i += 2; else if (*i == 0x07) sx_lit(i+3, stb__in2(1) + 1), i += 3; else if (*i == 0x06) sx_match(stb__dout-(stb__in3(1)+1), i[4]+1), i += 5; else if (*i == 0x04) sx_match(stb__dout-(stb__in3(1)+1), stb__in2(4)+1), i += 6; else return 0; } xx.in_buffer = i; return 1; } #endif //////////////////// compressor /////////////////////// static unsigned int stb_matchlen(stb_uchar *m1, stb_uchar *m2, stb_uint maxlen) { stb_uint i; for (i=0; i < maxlen; ++i) if (m1[i] != m2[i]) return i; return i; } // simple implementation that just takes the source data in a big block static stb_uchar *stb__out; static FILE *stb__outfile; static stb_uint stb__outbytes; static void stb__write(unsigned char v) { fputc(v, stb__outfile); ++stb__outbytes; } #define stb_out(v) (stb__out ? *stb__out++ = (stb_uchar) (v) : stb__write((stb_uchar) (v))) static void stb_out2(stb_uint v) { stb_out(v >> 8); stb_out(v); } static void stb_out3(stb_uint v) { stb_out(v >> 16); stb_out(v >> 8); stb_out(v); } static void stb_out4(stb_uint v) { stb_out(v >> 24); stb_out(v >> 16); stb_out(v >> 8 ); stb_out(v); } static void outliterals(stb_uchar *in, int numlit) { while (numlit > 65536) { outliterals(in,65536); in += 65536; numlit -= 65536; } if (numlit == 0) ; else if (numlit <= 32) stb_out (0x000020 + numlit-1); else if (numlit <= 2048) stb_out2(0x000800 + numlit-1); else /* numlit <= 65536) */ stb_out3(0x070000 + numlit-1); if (stb__out) { memcpy(stb__out,in,numlit); stb__out += numlit; } else fwrite(in, 1, numlit, stb__outfile); } static int stb__window = 0x40000; // 256K void stb_compress_window(int z) { if (z >= 0x1000000) z = 0x1000000; // limit of implementation if (z < 0x100) z = 0x100; // insanely small stb__window = z; } static int stb_not_crap(int best, int dist) { return ((best > 2 && dist <= 0x00100) || (best > 5 && dist <= 0x04000) || (best > 7 && dist <= 0x80000)); } static stb_uint stb__hashsize = 32768; void stb_compress_hashsize(unsigned int y) { unsigned int z = 1024; while (z < y) z <<= 1; stb__hashsize = z >> 2; // pass in bytes, store #pointers } // note that you can play with the hashing functions all you // want without needing to change the decompressor #define stb__hc(q,h,c) (((h) << 7) + ((h) >> 25) + q[c]) #define stb__hc2(q,h,c,d) (((h) << 14) + ((h) >> 18) + (q[c] << 7) + q[d]) #define stb__hc3(q,c,d,e) ((q[c] << 14) + (q[d] << 7) + q[e]) static stb_uint32 stb__running_adler; static int stb_compress_chunk(stb_uchar *history, stb_uchar *start, stb_uchar *end, int length, int *pending_literals, stb_uchar **chash, stb_uint mask) { int window = stb__window; stb_uint match_max; stb_uchar *lit_start = start - *pending_literals; stb_uchar *q = start; #define STB__SCRAMBLE(h) (((h) + ((h) >> 16)) & mask) // stop short of the end so we don't scan off the end doing // the hashing; this means we won't compress the last few bytes // unless they were part of something longer while (q < start+length && q+12 < end) { int m; stb_uint h1,h2,h3,h4, h; stb_uchar *t; int best = 2, dist=0; if (q+65536 > end) match_max = end-q; else match_max = 65536; #define stb__nc(b,d) ((d) <= window && ((b) > 9 || stb_not_crap(b,d))) #define STB__TRY(t,p) /* avoid retrying a match we already tried */ \ if (p ? dist != q-t : 1) \ if ((m = stb_matchlen(t, q, match_max)) > best) \ if (stb__nc(m,q-(t))) \ best = m, dist = q - (t) // rather than search for all matches, only try 4 candidate locations, // chosen based on 4 different hash functions of different lengths. // this strategy is inspired by LZO; hashing is unrolled here using the // 'hc' macro h = stb__hc3(q,0, 1, 2); h1 = STB__SCRAMBLE(h); t = chash[h1]; if (t) STB__TRY(t,0); h = stb__hc2(q,h, 3, 4); h2 = STB__SCRAMBLE(h); h = stb__hc2(q,h, 5, 6); t = chash[h2]; if (t) STB__TRY(t,1); h = stb__hc2(q,h, 7, 8); h3 = STB__SCRAMBLE(h); h = stb__hc2(q,h, 9,10); t = chash[h3]; if (t) STB__TRY(t,1); h = stb__hc2(q,h,11,12); h4 = STB__SCRAMBLE(h); t = chash[h4]; if (t) STB__TRY(t,1); // because we use a shared hash table, can only update it // _after_ we've probed all of them chash[h1] = chash[h2] = chash[h3] = chash[h4] = q; if (best > 2) assert(dist > 0); // see if our best match qualifies if (best < 3) { // fast path literals ++q; } else if (best > 2 && best <= 0x80 && dist <= 0x100) { outliterals(lit_start, q-lit_start); lit_start = (q += best); stb_out(0x80 + best-1); stb_out(dist-1); } else if (best > 5 && best <= 0x100 && dist <= 0x4000) { outliterals(lit_start, q-lit_start); lit_start = (q += best); stb_out2(0x4000 + dist-1); stb_out(best-1); } else if (best > 7 && best <= 0x100 && dist <= 0x80000) { outliterals(lit_start, q-lit_start); lit_start = (q += best); stb_out3(0x180000 + dist-1); stb_out(best-1); } else if (best > 8 && best <= 0x10000 && dist <= 0x80000) { outliterals(lit_start, q-lit_start); lit_start = (q += best); stb_out3(0x100000 + dist-1); stb_out2(best-1); } else if (best > 9 && dist <= 0x1000000) { if (best > 65536) best = 65536; outliterals(lit_start, q-lit_start); lit_start = (q += best); if (best <= 0x100) { stb_out(0x06); stb_out3(dist-1); stb_out(best-1); } else { stb_out(0x04); stb_out3(dist-1); stb_out2(best-1); } } else { // fallback literals if no match was a balanced tradeoff ++q; } } // if we didn't get all the way, add the rest to literals if (q-start < length) q = start+length; // the literals are everything from lit_start to q *pending_literals = (q - lit_start); stb__running_adler = stb_adler32(stb__running_adler, start, q - start); return q - start; } static int stb_compress_inner(stb_uchar *input, stb_uint length) { int literals = 0; stb_uint len,i; stb_uchar **chash; chash = (stb_uchar**) malloc(stb__hashsize * sizeof(stb_uchar*)); if (chash == NULL) return 0; // failure for (i=0; i < stb__hashsize; ++i) chash[i] = NULL; // stream signature stb_out(0x57); stb_out(0xbc); stb_out2(0); stb_out4(0); // 64-bit length requires 32-bit leading 0 stb_out4(length); stb_out4(stb__window); stb__running_adler = 1; len = stb_compress_chunk(input, input, input+length, length, &literals, chash, stb__hashsize-1); assert(len == length); outliterals(input+length - literals, literals); free(chash); stb_out2(0x05fa); // end opcode stb_out4(stb__running_adler); return 1; // success } stb_uint stb_compress(stb_uchar *out, stb_uchar *input, stb_uint length) { stb__out = out; stb__outfile = NULL; stb_compress_inner(input, length); return stb__out - out; } int stb_compress_tofile(char *filename, char *input, unsigned int length) { //int maxlen = length + 512 + (length >> 2); // total guess //char *buffer = (char *) malloc(maxlen); //int blen = stb_compress((stb_uchar*)buffer, (stb_uchar*)input, length); stb__out = NULL; stb__outfile = fopen(filename, "wb"); if (!stb__outfile) return 0; stb__outbytes = 0; if (!stb_compress_inner((stb_uchar*)input, length)) return 0; fclose(stb__outfile); return stb__outbytes; } int stb_compress_intofile(FILE *f, char *input, unsigned int length) { //int maxlen = length + 512 + (length >> 2); // total guess //char *buffer = (char*)malloc(maxlen); //int blen = stb_compress((stb_uchar*)buffer, (stb_uchar*)input, length); stb__out = NULL; stb__outfile = f; if (!stb__outfile) return 0; stb__outbytes = 0; if (!stb_compress_inner((stb_uchar*)input, length)) return 0; return stb__outbytes; } ////////////////////// streaming I/O version ///////////////////// static size_t stb_out_backpatch_id(void) { if (stb__out) return (size_t) stb__out; else return ftell(stb__outfile); } static void stb_out_backpatch(size_t id, stb_uint value) { stb_uchar data[4] = { value >> 24, value >> 16, value >> 8, value }; if (stb__out) { memcpy((void *) id, data, 4); } else { stb_uint where = ftell(stb__outfile); fseek(stb__outfile, id, SEEK_SET); fwrite(data, 4, 1, stb__outfile); fseek(stb__outfile, where, SEEK_SET); } } // ok, the wraparound buffer was a total failure. let's instead // use a copying-in-place buffer, which lets us share the code. // This is way less efficient but it'll do for now. static struct { stb_uchar *buffer; int size; // physical size of buffer in bytes int valid; // amount of valid data in bytes int start; // bytes of data already output int window; int fsize; int pending_literals; // bytes not-quite output but counted in start int length_id; stb_uint total_bytes; stb_uchar **chash; stb_uint hashmask; } xtb; static int stb_compress_streaming_start(void) { stb_uint i; xtb.size = stb__window * 3; xtb.buffer = (stb_uchar*)malloc(xtb.size); if (!xtb.buffer) return 0; xtb.chash = (stb_uchar**)malloc(sizeof(*xtb.chash) * stb__hashsize); if (!xtb.chash) { free(xtb.buffer); return 0; } for (i=0; i < stb__hashsize; ++i) xtb.chash[i] = NULL; xtb.hashmask = stb__hashsize-1; xtb.valid = 0; xtb.start = 0; xtb.window = stb__window; xtb.fsize = stb__window; xtb.pending_literals = 0; xtb.total_bytes = 0; // stream signature stb_out(0x57); stb_out(0xbc); stb_out2(0); stb_out4(0); // 64-bit length requires 32-bit leading 0 xtb.length_id = stb_out_backpatch_id(); stb_out4(0); // we don't know the output length yet stb_out4(stb__window); stb__running_adler = 1; return 1; } static int stb_compress_streaming_end(void) { // flush out any remaining data stb_compress_chunk(xtb.buffer, xtb.buffer+xtb.start, xtb.buffer+xtb.valid, xtb.valid-xtb.start, &xtb.pending_literals, xtb.chash, xtb.hashmask); // write out pending literals outliterals(xtb.buffer + xtb.valid - xtb.pending_literals, xtb.pending_literals); stb_out2(0x05fa); // end opcode stb_out4(stb__running_adler); stb_out_backpatch(xtb.length_id, xtb.total_bytes); free(xtb.buffer); free(xtb.chash); return 1; } void stb_write(char *data, int data_len) { stb_uint i; // @TODO: fast path for filling the buffer and doing nothing else // if (xtb.valid + data_len < xtb.size) xtb.total_bytes += data_len; while (data_len) { // fill buffer if (xtb.valid < xtb.size) { int amt = xtb.size - xtb.valid; if (data_len < amt) amt = data_len; memcpy(xtb.buffer + xtb.valid, data, amt); data_len -= amt; data += amt; xtb.valid += amt; } if (xtb.valid < xtb.size) return; // at this point, the buffer is full // if we can process some data, go for it; make sure // we leave an 'fsize's worth of data, though if (xtb.start + xtb.fsize < xtb.valid) { int amount = (xtb.valid - xtb.fsize) - xtb.start; int n; assert(amount > 0); n = stb_compress_chunk(xtb.buffer, xtb.buffer + xtb.start, xtb.buffer + xtb.valid, amount, &xtb.pending_literals, xtb.chash, xtb.hashmask); xtb.start += n; } assert(xtb.start + xtb.fsize >= xtb.valid); // at this point, our future size is too small, so we // need to flush some history. we, in fact, flush exactly // one window's worth of history { int flush = xtb.window; assert(xtb.start >= flush); assert(xtb.valid >= flush); // if 'pending literals' extends back into the shift region, // write them out if (xtb.start - xtb.pending_literals < flush) { outliterals(xtb.buffer + xtb.start - xtb.pending_literals, xtb.pending_literals); xtb.pending_literals = 0; } // now shift the window memmove(xtb.buffer, xtb.buffer + flush, xtb.valid - flush); xtb.start -= flush; xtb.valid -= flush; for (i=0; i <= xtb.hashmask; ++i) if (xtb.chash[i] < xtb.buffer + flush) xtb.chash[i] = NULL; else xtb.chash[i] -= flush; } // and now that we've made room for more data, go back to the top } } int stb_compress_stream_start(FILE *f) { stb__out = NULL; stb__outfile = f; if (f == NULL) return 0; if (!stb_compress_streaming_start()) return 0; return 1; } void stb_compress_stream_end(int close) { stb_compress_streaming_end(); if (close && stb__outfile) { fclose(stb__outfile); } } #endif // STB_DEFINE ////////////////////////////////////////////////////////////////////////////// // // File abstraction... tired of not having this... we can write // compressors to be layers over these that auto-close their children. typedef struct stbfile { int (*getbyte)(struct stbfile *); // -1 on EOF unsigned int (*getdata)(struct stbfile *, void *block, unsigned int len); int (*putbyte)(struct stbfile *, int byte); unsigned int (*putdata)(struct stbfile *, void *block, unsigned int len); unsigned int (*size)(struct stbfile *); unsigned int (*tell)(struct stbfile *); void (*backpatch)(struct stbfile *, unsigned int tell, void *block, unsigned int len); void (*close)(struct stbfile *); FILE *f; // file to fread/fwrite unsigned char *buffer; // input/output buffer unsigned char *indata, *inend; // input buffer union { int various; void *ptr; }; } stbfile; STB_EXTERN unsigned int stb_getc(stbfile *f); // read STB_EXTERN int stb_putc(stbfile *f, int ch); // write STB_EXTERN unsigned int stb_getdata(stbfile *f, void *buffer, unsigned int len); // read STB_EXTERN unsigned int stb_putdata(stbfile *f, void *buffer, unsigned int len); // write STB_EXTERN unsigned int stb_tell(stbfile *f); // read STB_EXTERN unsigned int stb_size(stbfile *f); // read/write STB_EXTERN void stb_backpatch(stbfile *f, unsigned int tell, void *buffer, unsigned int len); // write #ifdef STB_DEFINE unsigned int stb_getc(stbfile *f) { return f->getbyte(f); } int stb_putc(stbfile *f, int ch) { return f->putbyte(f, ch); } unsigned int stb_getdata(stbfile *f, void *buffer, unsigned int len) { return f->getdata(f, buffer, len); } unsigned int stb_putdata(stbfile *f, void *buffer, unsigned int len) { return f->putdata(f, buffer, len); } void stb_close(stbfile *f) { f->close(f); free(f); } unsigned int stb_tell(stbfile *f) { return f->tell(f); } unsigned int stb_size(stbfile *f) { return f->size(f); } void stb_backpatch(stbfile *f, unsigned int tell, void *buffer, unsigned int len) { f->backpatch(f,tell,buffer,len); } // FILE * implementation static int stb__fgetbyte(stbfile *f) { return fgetc(f->f); } static int stb__fputbyte(stbfile *f, int ch) { return fputc(ch, f->f)==0; } static unsigned int stb__fgetdata(stbfile *f, void *buffer, unsigned int len) { return fread(buffer,1,len,f->f); } static unsigned int stb__fputdata(stbfile *f, void *buffer, unsigned int len) { return fwrite(buffer,1,len,f->f); } static unsigned int stb__fsize(stbfile *f) { return stb_filelen(f->f); } static unsigned int stb__ftell(stbfile *f) { return ftell(f->f); } static void stb__fbackpatch(stbfile *f, unsigned int where, void *buffer, unsigned int len) { fseek(f->f, where, SEEK_SET); fwrite(buffer, 1, len, f->f); fseek(f->f, 0, SEEK_END); } static void stb__fclose(stbfile *f) { fclose(f->f); } stbfile *stb_openf(FILE *f) { stbfile m = { stb__fgetbyte, stb__fgetdata, stb__fputbyte, stb__fputdata, stb__fsize, stb__ftell, stb__fbackpatch, stb__fclose, 0,0,0, }; stbfile *z = (stbfile *) malloc(sizeof(*z)); if (z) { *z = m; z->f = f; } return z; } static int stb__nogetbyte(stbfile *f) { assert(0); return -1; } static unsigned int stb__nogetdata(stbfile *f, void *buffer, unsigned int len) { assert(0); return 0; } static int stb__noputbyte(stbfile *f, int ch) { assert(0); return 0; } static unsigned int stb__noputdata(stbfile *f, void *buffer, unsigned int len) { assert(0); return 0; } static void stb__nobackpatch(stbfile *f, unsigned int where, void *buffer, unsigned int len) { assert(0); } static int stb__bgetbyte(stbfile *s) { if (s->indata < s->inend) return *s->indata++; else return -1; } static unsigned int stb__bgetdata(stbfile *s, void *buffer, unsigned int len) { if (s->indata + len > s->inend) len = s->inend - s->indata; memcpy(buffer, s->indata, len); s->indata += len; return len; } static unsigned int stb__bsize(stbfile *s) { return s->inend - s->buffer; } static unsigned int stb__btell(stbfile *s) { return s->indata - s->buffer; } static void stb__bclose(stbfile *s) { if (s->various) free(s->buffer); } stbfile *stb_open_inbuffer(void *buffer, unsigned int len) { stbfile m = { stb__bgetbyte, stb__bgetdata, stb__noputbyte, stb__noputdata, stb__bsize, stb__btell, stb__nobackpatch, stb__bclose }; stbfile *z = (stbfile *) malloc(sizeof(*z)); if (z) { *z = m; z->buffer = (unsigned char *) buffer; z->indata = z->buffer; z->inend = z->indata + len; } return z; } stbfile *stb_open_inbuffer_free(void *buffer, unsigned int len) { stbfile *z = stb_open_inbuffer(buffer, len); if (z) z->various = 1; // free return z; } #ifndef STB_VERSION // if we've been cut-and-pasted elsewhere, you get a limited // version of stb_open, without the 'k' flag and utf8 support static void stb__fclose2(stbfile *f) { fclose(f->f); } stbfile *stb_open(char *filename, char *mode) { FILE *f = fopen(filename, mode); stbfile *s; if (f == NULL) return NULL; s = stb_openf(f); if (s) s->close = stb__fclose2; return s; } #else // the full version depends on some code in stb.h; this // also includes the memory buffer output format implemented with stb_arr static void stb__fclose2(stbfile *f) { stb_fclose(f->f, f->various); } stbfile *stb_open(char *filename, char *mode) { FILE *f = stb_fopen(filename, mode[0] == 'k' ? mode+1 : mode); stbfile *s; if (f == NULL) return NULL; s = stb_openf(f); if (s) { s->close = stb__fclose2; s->various = mode[0] == 'k' ? stb_keep_if_different : stb_keep_yes; } return s; } static int stb__aputbyte(stbfile *f, int ch) { stb_arr_push(f->buffer, ch); return 1; } static unsigned int stb__aputdata(stbfile *f, void *data, unsigned int len) { memcpy(stb_arr_addn(f->buffer, (int) len), data, len); return len; } static unsigned int stb__asize(stbfile *f) { return stb_arr_len(f->buffer); } static void stb__abackpatch(stbfile *f, unsigned int where, void *data, unsigned int len) { memcpy(f->buffer+where, data, len); } static void stb__aclose(stbfile *f) { *(unsigned char **) f->ptr = f->buffer; } stbfile *stb_open_outbuffer(unsigned char **update_on_close) { stbfile m = { stb__nogetbyte, stb__nogetdata, stb__aputbyte, stb__aputdata, stb__asize, stb__asize, stb__abackpatch, stb__aclose }; stbfile *z = (stbfile *) malloc(sizeof(*z)); if (z) { z->ptr = update_on_close; *z = m; } return z; } #endif #endif ////////////////////////////////////////////////////////////////////////////// // // Arithmetic coder... based on cbloom's notes on the subject, should be // less code than a huffman code. typedef struct { unsigned int range_low; unsigned int range_high; unsigned int code, range; // decode int buffered_u8; int pending_ffs; stbfile *output; } stb_arith; STB_EXTERN void stb_arith_init_encode(stb_arith *a, stbfile *out); STB_EXTERN void stb_arith_init_decode(stb_arith *a, stbfile *in); STB_EXTERN stbfile *stb_arith_encode_close(stb_arith *a); STB_EXTERN stbfile *stb_arith_decode_close(stb_arith *a); STB_EXTERN void stb_arith_encode(stb_arith *a, unsigned int totalfreq, unsigned int freq, unsigned int cumfreq); STB_EXTERN void stb_arith_encode_log2(stb_arith *a, unsigned int totalfreq2, unsigned int freq, unsigned int cumfreq); STB_EXTERN unsigned int stb_arith_decode_value(stb_arith *a, unsigned int totalfreq); STB_EXTERN void stb_arith_decode_advance(stb_arith *a, unsigned int totalfreq, unsigned int freq, unsigned int cumfreq); STB_EXTERN unsigned int stb_arith_decode_value_log2(stb_arith *a, unsigned int totalfreq2); STB_EXTERN void stb_arith_decode_advance_log2(stb_arith *a, unsigned int totalfreq2, unsigned int freq, unsigned int cumfreq); STB_EXTERN void stb_arith_encode_byte(stb_arith *a, int byte); STB_EXTERN int stb_arith_decode_byte(stb_arith *a); // this is a memory-inefficient way of doing things, but it's // fast(?) and simple typedef struct { unsigned short cumfreq; unsigned short samples; } stb_arith_symstate_item; typedef struct { int num_sym; unsigned int pow2; int countdown; stb_arith_symstate_item data[1]; } stb_arith_symstate; #ifdef STB_DEFINE void stb_arith_init_encode(stb_arith *a, stbfile *out) { a->range_low = 0; a->range_high = 0xffffffff; a->pending_ffs = -1; // means no buffered character currently, to speed up normal case a->output = out; } static void stb__arith_carry(stb_arith *a) { int i; assert(a->pending_ffs != -1); // can't carry with no data stb_putc(a->output, a->buffered_u8); for (i=0; i < a->pending_ffs; ++i) stb_putc(a->output, 0); } static void stb__arith_putbyte(stb_arith *a, int byte) { if (a->pending_ffs) { if (a->pending_ffs == -1) { // means no buffered data; encoded for fast path efficiency if (byte == 0xff) stb_putc(a->output, byte); // just write it immediately else { a->buffered_u8 = byte; a->pending_ffs = 0; } } else if (byte == 0xff) { ++a->pending_ffs; } else { int i; stb_putc(a->output, a->buffered_u8); for (i=0; i < a->pending_ffs; ++i) stb_putc(a->output, 0xff); } } else if (byte == 0xff) { ++a->pending_ffs; } else { // fast path stb_putc(a->output, a->buffered_u8); a->buffered_u8 = byte; } } static void stb__arith_flush(stb_arith *a) { if (a->pending_ffs >= 0) { int i; stb_putc(a->output, a->buffered_u8); for (i=0; i < a->pending_ffs; ++i) stb_putc(a->output, 0xff); } } static void stb__renorm_encoder(stb_arith *a) { stb__arith_putbyte(a, a->range_low >> 24); a->range_low <<= 8; a->range_high = (a->range_high << 8) | 0xff; } static void stb__renorm_decoder(stb_arith *a) { int c = stb_getc(a->output); a->code = (a->code << 8) + (c >= 0 ? c : 0); // if EOF, insert 0 } void stb_arith_encode(stb_arith *a, unsigned int totalfreq, unsigned int freq, unsigned int cumfreq) { unsigned int range = a->range_high - a->range_low; unsigned int old = a->range_low; range /= totalfreq; a->range_low += range * cumfreq; a->range_high = a->range_low + range*freq; if (a->range_low < old) stb__arith_carry(a); while (a->range_high - a->range_low < 0x1000000) stb__renorm_encoder(a); } void stb_arith_encode_log2(stb_arith *a, unsigned int totalfreq2, unsigned int freq, unsigned int cumfreq) { unsigned int range = a->range_high - a->range_low; unsigned int old = a->range_low; range >>= totalfreq2; a->range_low += range * cumfreq; a->range_high = a->range_low + range*freq; if (a->range_low < old) stb__arith_carry(a); while (a->range_high - a->range_low < 0x1000000) stb__renorm_encoder(a); } unsigned int stb_arith_decode_value(stb_arith *a, unsigned int totalfreq) { unsigned int freqsize = a->range / totalfreq; unsigned int z = a->code / freqsize; return z >= totalfreq ? totalfreq-1 : z; } void stb_arith_decode_advance(stb_arith *a, unsigned int totalfreq, unsigned int freq, unsigned int cumfreq) { unsigned int freqsize = a->range / totalfreq; // @OPTIMIZE, share with above divide somehow? a->code -= freqsize * cumfreq; a->range = freqsize * freq; while (a->range < 0x1000000) stb__renorm_decoder(a); } unsigned int stb_arith_decode_value_log2(stb_arith *a, unsigned int totalfreq2) { unsigned int freqsize = a->range >> totalfreq2; unsigned int z = a->code / freqsize; return z >= (1U<range >> totalfreq2; a->code -= freqsize * cumfreq; a->range = freqsize * freq; while (a->range < 0x1000000) stb__renorm_decoder(a); } stbfile *stb_arith_encode_close(stb_arith *a) { // put exactly as many bytes as we'll read, so we can turn on/off arithmetic coding in a stream stb__arith_putbyte(a, a->range_low >> 24); stb__arith_putbyte(a, a->range_low >> 16); stb__arith_putbyte(a, a->range_low >> 8); stb__arith_putbyte(a, a->range_low >> 0); stb__arith_flush(a); return a->output; } stbfile *stb_arith_decode_close(stb_arith *a) { return a->output; } // this is a simple power-of-two based model -- using // power of two means we need one divide per decode, // not two. #define POW2_LIMIT 12 stb_arith_symstate *stb_arith_state_create(int num_sym) { stb_arith_symstate *s = (stb_arith_symstate *) malloc(sizeof(*s) + (num_sym-1) * sizeof(s->data[0])); if (s) { int i, cf, cf_next, next; int start_freq, extra; s->num_sym = num_sym; s->pow2 = 4; while (s->pow2 < 15 && (1 << s->pow2) < 3*num_sym) { ++s->pow2; } start_freq = (1 << s->pow2) / num_sym; assert(start_freq >= 1); extra = (1 << s->pow2) % num_sym; // now set up the initial stats if (s->pow2 < POW2_LIMIT) next = 0; else next = 1; cf = cf_next = 0; for (i=0; i < extra; ++i) { s->data[i].cumfreq = cf; s->data[i].samples = next; cf += start_freq+1; cf_next += next; } for (; i < num_sym; ++i) { s->data[i].cumfreq = cf; s->data[i].samples = next; cf += start_freq; cf_next += next; } assert(cf == (1 << s->pow2)); // now, how long should we go until we have 2 << s->pow2 samples? s->countdown = (2 << s->pow2) - cf - cf_next; } return s; } static void stb_arith_state_rescale(stb_arith_symstate *s) { if (s->pow2 < POW2_LIMIT) { int pcf, cf, cf_next, next, i; ++s->pow2; if (s->pow2 < POW2_LIMIT) next = 0; else next = 1; cf = cf_next = 0; pcf = 0; for (i=0; i < s->num_sym; ++i) { int sample = s->data[i].cumfreq - pcf + s->data[i].samples; s->data[i].cumfreq = cf; cf += sample; s->data[i].samples = next; cf_next += next; } assert(cf == (1 << s->pow2)); s->countdown = (2 << s->pow2) - cf - cf_next; } else { int pcf, cf, cf_next, i; cf = cf_next = 0; pcf = 0; for (i=0; i < s->num_sym; ++i) { int sample = (s->data[i].cumfreq - pcf + s->data[i].samples) >> 1; s->data[i].cumfreq = cf; cf += sample; s->data[i].samples = 1; cf_next += 1; } assert(cf == (1 << s->pow2)); // this isn't necessarily true, due to rounding down! s->countdown = (2 << s->pow2) - cf - cf_next; } } void stb_arith_encode_byte(stb_arith *a, int byte) { } int stb_arith_decode_byte(stb_arith *a) { return -1; } #endif ////////////////////////////////////////////////////////////////////////////// // // Threads // #ifndef _WIN32 #ifdef STB_THREADS #error "threads not implemented except for Windows" #endif #endif // call this function to free any global variables for memory testing STB_EXTERN void stb_thread_cleanup(void); typedef void * (*stb_thread_func)(void *); // do not rely on these types, this is an implementation detail. // compare against STB_THREAD_NULL and ST_SEMAPHORE_NULL typedef void *stb_thread; typedef void *stb_semaphore; typedef void *stb_mutex; typedef struct stb__sync *stb_sync; #define STB_SEMAPHORE_NULL NULL #define STB_THREAD_NULL NULL #define STB_MUTEX_NULL NULL #define STB_SYNC_NULL NULL // get the number of processors (limited to those in the affinity mask for this process). STB_EXTERN int stb_processor_count(void); // force to run on a single core -- needed for RDTSC to work, e.g. for iprof STB_EXTERN void stb_force_uniprocessor(void); // stb_work functions: queue up work to be done by some worker threads // set number of threads to serve the queue; you can change this on the fly, // but if you decrease it, it won't decrease until things currently on the // queue are finished STB_EXTERN void stb_work_numthreads(int n); // set maximum number of units in the queue; you can only set this BEFORE running any work functions STB_EXTERN int stb_work_maxunits(int n); // enqueue some work to be done (can do this from any thread, or even from a piece of work); // return value of f is stored in *return_code if non-NULL STB_EXTERN int stb_work(stb_thread_func f, void *d, volatile void **return_code); // as above, but stb_sync_reach is called on 'rel' after work is complete STB_EXTERN int stb_work_reach(stb_thread_func f, void *d, volatile void **return_code, stb_sync rel); // necessary to call this when using volatile to order writes/reads STB_EXTERN void stb_barrier(void); // support for independent queues with their own threads typedef struct stb__workqueue stb_workqueue; STB_EXTERN stb_workqueue*stb_workq_new(int numthreads, int max_units); STB_EXTERN stb_workqueue*stb_workq_new_flags(int numthreads, int max_units, int no_add_mutex, int no_remove_mutex); STB_EXTERN void stb_workq_delete(stb_workqueue *q); STB_EXTERN void stb_workq_numthreads(stb_workqueue *q, int n); STB_EXTERN int stb_workq(stb_workqueue *q, stb_thread_func f, void *d, volatile void **return_code); STB_EXTERN int stb_workq_reach(stb_workqueue *q, stb_thread_func f, void *d, volatile void **return_code, stb_sync rel); STB_EXTERN int stb_workq_length(stb_workqueue *q); STB_EXTERN stb_thread stb_create_thread (stb_thread_func f, void *d); STB_EXTERN stb_thread stb_create_thread2(stb_thread_func f, void *d, volatile void **return_code, stb_semaphore rel); STB_EXTERN void stb_destroy_thread(stb_thread t); STB_EXTERN stb_semaphore stb_sem_new(int max_val); STB_EXTERN stb_semaphore stb_sem_new_extra(int max_val, int start_val); STB_EXTERN void stb_sem_delete (stb_semaphore s); STB_EXTERN void stb_sem_waitfor(stb_semaphore s); STB_EXTERN void stb_sem_release(stb_semaphore s); STB_EXTERN stb_mutex stb_mutex_new(void); STB_EXTERN void stb_mutex_delete(stb_mutex m); STB_EXTERN void stb_mutex_begin(stb_mutex m); STB_EXTERN void stb_mutex_end(stb_mutex m); STB_EXTERN stb_sync stb_sync_new(void); STB_EXTERN void stb_sync_delete(stb_sync s); STB_EXTERN int stb_sync_set_target(stb_sync s, int count); STB_EXTERN void stb_sync_reach_and_wait(stb_sync s); // wait for 'target' reachers STB_EXTERN int stb_sync_reach(stb_sync s); typedef struct stb__threadqueue stb_threadqueue; #define STB_THREADQ_DYNAMIC 0 STB_EXTERN stb_threadqueue *stb_threadq_new(int item_size, int num_items, int many_add, int many_remove); STB_EXTERN void stb_threadq_delete(stb_threadqueue *tq); STB_EXTERN int stb_threadq_get(stb_threadqueue *tq, void *output); STB_EXTERN void stb_threadq_get_block(stb_threadqueue *tq, void *output); STB_EXTERN int stb_threadq_add(stb_threadqueue *tq, void *input); // can return FALSE if STB_THREADQ_DYNAMIC and attempt to grow fails STB_EXTERN int stb_threadq_add_block(stb_threadqueue *tq, void *input); #ifdef STB_THREADS #ifdef STB_DEFINE typedef struct { stb_thread_func f; void *d; volatile void **return_val; stb_semaphore sem; } stb__thread; // this is initialized along all possible paths to create threads, therefore // it's always initialized before any other threads are create, therefore // it's free of races AS LONG AS you only create threads through stb_* static stb_mutex stb__threadmutex, stb__workmutex; static void stb__threadmutex_init(void) { if (stb__threadmutex == STB_SEMAPHORE_NULL) { stb__threadmutex = stb_mutex_new(); stb__workmutex = stb_mutex_new(); } } #ifdef STB_THREAD_TEST volatile float stb__t1=1, stb__t2; static void stb__wait(int n) { float z = 0; int i; for (i=0; i < n; ++i) z += 1 / (stb__t1+i); stb__t2 = z; } #else #define stb__wait(x) #endif #ifdef _WIN32 // avoid including windows.h -- note that our definitions aren't // exactly the same (we don't define the security descriptor struct) // so if you want to include windows.h, make sure you do it first. #include #ifndef _WINDOWS_ // check windows.h guard #define STB__IMPORT STB_EXTERN __declspec(dllimport) #define STB__DW unsigned long STB__IMPORT int __stdcall TerminateThread(void *, STB__DW); STB__IMPORT void * __stdcall CreateSemaphoreA(void *sec, long,long,char*); STB__IMPORT int __stdcall CloseHandle(void *); STB__IMPORT STB__DW __stdcall WaitForSingleObject(void *, STB__DW); STB__IMPORT int __stdcall ReleaseSemaphore(void *, long, long *); STB__IMPORT void __stdcall Sleep(STB__DW); #endif // necessary to call this when using volatile to order writes/reads void stb_barrier(void) { #ifdef MemoryBarrier MemoryBarrier(); #else long temp; __asm xchg temp,eax; #endif } static void stb__thread_run(void *t) { void *res; stb__thread info = * (stb__thread *) t; free(t); res = info.f(info.d); if (info.return_val) *info.return_val = res; if (info.sem != STB_SEMAPHORE_NULL) stb_sem_release(info.sem); } static stb_thread stb_create_thread_raw(stb_thread_func f, void *d, volatile void **return_code, stb_semaphore rel) { #ifdef _MT #if defined(STB_FASTMALLOC) && !defined(STB_FASTMALLOC_ITS_OKAY_I_ONLY_MALLOC_IN_ONE_THREAD) stb_fatal("Error! Cannot use STB_FASTMALLOC with threads.\n"); return STB_THREAD_NULL; #else unsigned long id; stb__thread *data = (stb__thread *) malloc(sizeof(*data)); if (!data) return NULL; stb__threadmutex_init(); data->f = f; data->d = d; data->return_val = return_code; data->sem = rel; id = _beginthread(stb__thread_run, 0, data); if (id == -1) return NULL; return (void *) id; #endif #else #ifdef STB_NO_STB_STRINGS stb_fatal("Invalid compilation"); #else stb_fatal("Must compile mult-threaded to use stb_thread/stb_work."); #endif return NULL; #endif } // trivial win32 wrappers void stb_destroy_thread(stb_thread t) { TerminateThread(t,0); } stb_semaphore stb_sem_new(int maxv) {return CreateSemaphoreA(NULL,0,maxv,NULL); } stb_semaphore stb_sem_new_extra(int maxv,int start){return CreateSemaphoreA(NULL,start,maxv,NULL); } void stb_sem_delete(stb_semaphore s) { if (s != NULL) CloseHandle(s); } void stb_sem_waitfor(stb_semaphore s) { WaitForSingleObject(s, 0xffffffff); } // INFINITE void stb_sem_release(stb_semaphore s) { ReleaseSemaphore(s,1,NULL); } static void stb__thread_sleep(int ms) { Sleep(ms); } #ifndef _WINDOWS_ STB__IMPORT int __stdcall GetProcessAffinityMask(void *, STB__DW *, STB__DW *); STB__IMPORT void * __stdcall GetCurrentProcess(void); STB__IMPORT int __stdcall SetProcessAffinityMask(void *, STB__DW); #endif int stb_processor_count(void) { unsigned long proc,sys; GetProcessAffinityMask(GetCurrentProcess(), &proc, &sys); return stb_bitcount(proc); } void stb_force_uniprocessor(void) { unsigned long proc,sys; GetProcessAffinityMask(GetCurrentProcess(), &proc, &sys); if (stb_bitcount(proc) > 1) { int z; for (z=0; z < 32; ++z) if (proc & (1 << z)) break; if (z < 32) { proc = 1 << z; SetProcessAffinityMask(GetCurrentProcess(), proc); } } } #ifdef _WINDOWS_ #define STB_MUTEX_NATIVE void *stb_mutex_new(void) { CRITICAL_SECTION *p = (CRITICAL_SECTION *) malloc(sizeof(*p)); if (p) #if _WIN32_WINNT >= 0x0500 InitializeCriticalSectionAndSpinCount(p, 500); #else InitializeCriticalSection(p); #endif return p; } void stb_mutex_delete(void *p) { if (p) { DeleteCriticalSection((CRITICAL_SECTION *) p); free(p); } } void stb_mutex_begin(void *p) { stb__wait(500); if (p) EnterCriticalSection((CRITICAL_SECTION *) p); } void stb_mutex_end(void *p) { if (p) LeaveCriticalSection((CRITICAL_SECTION *) p); stb__wait(500); } #endif // _WINDOWS_ #if 0 // for future reference, // InterlockedCompareExchange for x86: int cas64_mp(void * dest, void * xcmp, void * xxchg) { __asm { mov esi, [xxchg] ; exchange mov ebx, [esi + 0] mov ecx, [esi + 4] mov esi, [xcmp] ; comparand mov eax, [esi + 0] mov edx, [esi + 4] mov edi, [dest] ; destination lock cmpxchg8b [edi] jz yyyy; mov [esi + 0], eax; mov [esi + 4], edx; yyyy: xor eax, eax; setz al; }; inline unsigned __int64 _InterlockedCompareExchange64(volatile unsigned __int64 *dest ,unsigned __int64 exchange ,unsigned __int64 comperand) { //value returned in eax::edx __asm { lea esi,comperand; lea edi,exchange; mov eax,[esi]; mov edx,4[esi]; mov ebx,[edi]; mov ecx,4[edi]; mov esi,dest; lock CMPXCHG8B [esi]; } #endif // #if 0 #endif // _WIN32 stb_thread stb_create_thread2(stb_thread_func f, void *d, volatile void **return_code, stb_semaphore rel) { return stb_create_thread_raw(f,d,return_code,rel); } stb_thread stb_create_thread(stb_thread_func f, void *d) { return stb_create_thread2(f,d,NULL,STB_SEMAPHORE_NULL); } // mutex implemented by wrapping semaphore #ifndef STB_MUTEX_NATIVE stb_mutex stb_mutex_new(void) { return stb_sem_new_extra(1,1); } void stb_mutex_delete(stb_mutex m) { stb_sem_delete (m); } void stb_mutex_begin(stb_mutex m) { stb__wait(500); if (m) stb_sem_waitfor(m); } void stb_mutex_end(stb_mutex m) { if (m) stb_sem_release(m); stb__wait(500); } #endif // thread merge operation struct stb__sync { int target; // target number of threads to hit it int sofar; // total threads that hit it int waiting; // total threads waiting stb_mutex start; // mutex to prevent starting again before finishing previous stb_mutex mutex; // mutex while tweaking state stb_semaphore release; // semaphore wake up waiting threads // we have to wake them up one at a time, rather than using a single release // call, because win32 semaphores don't let you dynamically change the max count! }; stb_sync stb_sync_new(void) { stb_sync s = (stb_sync) malloc(sizeof(*s)); if (!s) return s; s->target = s->sofar = s->waiting = 0; s->mutex = stb_mutex_new(); s->start = stb_mutex_new(); s->release = stb_sem_new(1); if (s->mutex == STB_MUTEX_NULL || s->release == STB_SEMAPHORE_NULL || s->start == STB_MUTEX_NULL) { stb_mutex_delete(s->mutex); stb_mutex_delete(s->mutex); stb_sem_delete(s->release); free(s); return NULL; } return s; } void stb_sync_delete(stb_sync s) { if (s->waiting) { // it's bad to delete while there are threads waiting! // shall we wait for them to reach, or just bail? just bail assert(0); } stb_mutex_delete(s->mutex); stb_mutex_delete(s->release); free(s); } int stb_sync_set_target(stb_sync s, int count) { // don't allow setting a target until the last one is fully released; // note that this can lead to inefficient pipelining, and maybe we'd // be better off ping-ponging between two internal syncs? // I tried seeing how often this happened using TryEnterCriticalSection // and could _never_ get it to happen in imv(stb), even with more threads // than processors. So who knows! stb_mutex_begin(s->start); // this mutex is pointless, since it's not valid for threads // to call reach() before anyone calls set_target() anyway stb_mutex_begin(s->mutex); assert(s->target == 0); // enforced by start mutex s->target = count; s->sofar = 0; s->waiting = 0; stb_mutex_end(s->mutex); return STB_TRUE; } void stb__sync_release(stb_sync s) { if (s->waiting) stb_sem_release(s->release); else { s->target = 0; stb_mutex_end(s->start); } } int stb_sync_reach(stb_sync s) { int n; stb_mutex_begin(s->mutex); assert(s->sofar < s->target); n = ++s->sofar; // record this value to avoid possible race if we did 'return s->sofar'; if (s->sofar == s->target) stb__sync_release(s); stb_mutex_end(s->mutex); return n; } void stb_sync_reach_and_wait(stb_sync s) { stb_mutex_begin(s->mutex); assert(s->sofar < s->target); ++s->sofar; if (s->sofar == s->target) { stb__sync_release(s); stb_mutex_end(s->mutex); } else { ++s->waiting; // we're waiting, so one more waiter stb_mutex_end(s->mutex); // release the mutex to other threads stb_sem_waitfor(s->release); // wait for merge completion stb_mutex_begin(s->mutex); // on merge completion, grab the mutex --s->waiting; // we're done waiting stb__sync_release(s); // restart the next waiter stb_mutex_end(s->mutex); // and now we're done // this ends the same as the first case, but it's a lot // clearer to understand without sharing the code } } struct stb__threadqueue { stb_mutex add, remove; stb_semaphore nonempty, nonfull; int head_blockers; // number of threads blocking--used to know whether to release(avail) int tail_blockers; int head, tail, array_size, growable; int item_size; char *data; }; static int stb__tq_wrap(volatile stb_threadqueue *z, int p) { if (p == z->array_size) return p - z->array_size; else return p; } int stb__threadq_get_raw(stb_threadqueue *tq2, void *output, int block) { volatile stb_threadqueue *tq = (volatile stb_threadqueue *) tq2; if (tq->head == tq->tail && !block) return 0; stb_mutex_begin(tq->remove); while (tq->head == tq->tail) { if (!block) { stb_mutex_end(tq->remove); return 0; } ++tq->head_blockers; stb_mutex_end(tq->remove); stb_sem_waitfor(tq->nonempty); stb_mutex_begin(tq->remove); --tq->head_blockers; } memcpy(output, tq->data + tq->head*tq->item_size, tq->item_size); stb_barrier(); tq->head = stb__tq_wrap(tq, tq->head+1); stb_sem_release(tq->nonfull); if (tq->head_blockers) // can't check if actually non-empty due to race? stb_sem_release(tq->nonempty); // if there are other blockers, wake one stb_mutex_end(tq->remove); return STB_TRUE; } int stb__threadq_grow(volatile stb_threadqueue *tq) { int n; char *p; assert(tq->remove != STB_MUTEX_NULL); // must have this to allow growth! stb_mutex_begin(tq->remove); n = tq->array_size * 2; p = (char *) realloc(tq->data, n * tq->item_size); if (p == NULL) { stb_mutex_end(tq->remove); stb_mutex_end(tq->add); return STB_FALSE; } if (tq->tail < tq->head) { memcpy(p + tq->array_size * tq->item_size, p, tq->tail * tq->item_size); tq->tail += tq->array_size; } tq->data = p; tq->array_size = n; stb_mutex_end(tq->remove); return STB_TRUE; } int stb__threadq_add_raw(stb_threadqueue *tq2, void *input, int block) { int tail,pos; volatile stb_threadqueue *tq = (volatile stb_threadqueue *) tq2; stb_mutex_begin(tq->add); for(;;) { pos = tq->tail; tail = stb__tq_wrap(tq, pos+1); if (tail != tq->head) break; // full if (tq->growable) { if (!stb__threadq_grow(tq)) { stb_mutex_end(tq->add); return STB_FALSE; // out of memory } } else if (!block) { stb_mutex_end(tq->add); return STB_FALSE; } else { ++tq->tail_blockers; stb_mutex_end(tq->add); stb_sem_waitfor(tq->nonfull); stb_mutex_begin(tq->add); --tq->tail_blockers; } } memcpy(tq->data + tq->item_size * pos, input, tq->item_size); stb_barrier(); tq->tail = tail; stb_sem_release(tq->nonempty); if (tq->tail_blockers) // can't check if actually non-full due to race? stb_sem_release(tq->nonfull); stb_mutex_end(tq->add); return STB_TRUE; } int stb_threadq_length(stb_threadqueue *tq2) { int a,b,n; volatile stb_threadqueue *tq = (volatile stb_threadqueue *) tq2; stb_mutex_begin(tq->add); a = tq->head; b = tq->tail; n = tq->array_size; stb_mutex_end(tq->add); if (a > b) b += n; return b-a; } int stb_threadq_get(stb_threadqueue *tq, void *output) { return stb__threadq_get_raw(tq, output, STB_FALSE); } void stb_threadq_get_block(stb_threadqueue *tq, void *output) { stb__threadq_get_raw(tq, output, STB_TRUE); } int stb_threadq_add(stb_threadqueue *tq, void *input) { return stb__threadq_add_raw(tq, input, STB_FALSE); } int stb_threadq_add_block(stb_threadqueue *tq, void *input) { return stb__threadq_add_raw(tq, input, STB_TRUE); } void stb_threadq_delete(stb_threadqueue *tq) { if (tq) { free(tq->data); stb_mutex_delete(tq->add); stb_mutex_delete(tq->remove); stb_sem_delete(tq->nonempty); stb_sem_delete(tq->nonfull); free(tq); } } #define STB_THREADQUEUE_DYNAMIC 0 stb_threadqueue *stb_threadq_new(int item_size, int num_items, int many_add, int many_remove) { int error=0; stb_threadqueue *tq = (stb_threadqueue *) malloc(sizeof(*tq)); if (tq == NULL) return NULL; if (num_items == STB_THREADQUEUE_DYNAMIC) { tq->growable = STB_TRUE; num_items = 32; } else tq->growable = STB_FALSE; tq->item_size = item_size; tq->array_size = num_items+1; tq->add = tq->remove = STB_MUTEX_NULL; tq->nonempty = tq->nonfull = STB_SEMAPHORE_NULL; tq->data = NULL; if (many_add) { tq->add = stb_mutex_new(); if (tq->add == STB_MUTEX_NULL) goto error; } if (many_remove || tq->growable) { tq->remove = stb_mutex_new(); if (tq->remove == STB_MUTEX_NULL) goto error; } tq->nonempty = stb_sem_new(1); if (tq->nonempty == STB_SEMAPHORE_NULL) goto error; tq->nonfull = stb_sem_new(1); if (tq->nonfull == STB_SEMAPHORE_NULL) goto error; tq->data = (char *) malloc(tq->item_size * tq->array_size); if (tq->data == NULL) goto error; tq->head = tq->tail = 0; tq->head_blockers = tq->tail_blockers = 0; return tq; error: stb_threadq_delete(tq); return NULL; } typedef struct { stb_thread_func f; void *d; volatile void **retval; stb_sync sync; } stb__workinfo; //static volatile stb__workinfo *stb__work; struct stb__workqueue { int numthreads; stb_threadqueue *tq; }; static stb_workqueue *stb__work_global; static void *stb__thread_workloop(void *p) { volatile stb_workqueue *q = (volatile stb_workqueue *) p; for(;;) { void *z; stb__workinfo w; stb_threadq_get_block(q->tq, &w); if (w.f == NULL) // null work is a signal to end the thread return NULL; z = w.f(w.d); if (w.retval) { stb_barrier(); *w.retval = z; } if (w.sync != STB_SYNC_NULL) stb_sync_reach(w.sync); } } stb_workqueue *stb_workq_new(int num_threads, int max_units) { return stb_workq_new_flags(num_threads, max_units, 0,0); } stb_workqueue *stb_workq_new_flags(int numthreads, int max_units, int no_add_mutex, int no_remove_mutex) { stb_workqueue *q = (stb_workqueue *) malloc(sizeof(*q)); if (q == NULL) return NULL; q->tq = stb_threadq_new(sizeof(stb__workinfo), max_units, !no_add_mutex, !no_remove_mutex); if (q->tq == NULL) { free(q); return NULL; } q->numthreads = 0; stb_workq_numthreads(q, numthreads); return q; } void stb_workq_delete(stb_workqueue *q) { while (stb_workq_length(q) != 0) stb__thread_sleep(1); stb_threadq_delete(q->tq); free(q); } static int stb__work_maxitems = STB_THREADQUEUE_DYNAMIC; static void stb_work_init(int num_threads) { if (stb__work_global == NULL) { stb__threadmutex_init(); stb_mutex_begin(stb__workmutex); stb_barrier(); if (*(stb_workqueue * volatile *) &stb__work_global == NULL) stb__work_global = stb_workq_new(num_threads, stb__work_maxitems); stb_mutex_end(stb__workmutex); } } static int stb__work_raw(stb_workqueue *q, stb_thread_func f, void *d, volatile void **return_code, stb_sync rel) { stb__workinfo w; if (q == NULL) { stb_work_init(1); q = stb__work_global; } w.f = f; w.d = d; w.retval = return_code; w.sync = rel; return stb_threadq_add(q->tq, &w); } int stb_workq_length(stb_workqueue *q) { return stb_threadq_length(q->tq); } int stb_workq(stb_workqueue *q, stb_thread_func f, void *d, volatile void **return_code) { if (f == NULL) return 0; return stb_workq_reach(q, f, d, return_code, NULL); } int stb_workq_reach(stb_workqueue *q, stb_thread_func f, void *d, volatile void **return_code, stb_sync rel) { if (f == NULL) return 0; return stb__work_raw(q, f, d, return_code, rel); } static void stb__workq_numthreads(stb_workqueue *q, int n) { while (q->numthreads < n) { stb_create_thread(stb__thread_workloop, q); ++q->numthreads; } while (q->numthreads > n) { stb__work_raw(q, NULL, NULL, NULL, NULL); --q->numthreads; } } void stb_workq_numthreads(stb_workqueue *q, int n) { stb_mutex_begin(stb__threadmutex); stb__workq_numthreads(q,n); stb_mutex_end(stb__threadmutex); } int stb_work_maxunits(int n) { if (stb__work_global == NULL) { stb__work_maxitems = n; stb_work_init(1); } return stb__work_maxitems; } int stb_work(stb_thread_func f, void *d, volatile void **return_code) { return stb_workq(stb__work_global, f,d,return_code); } int stb_work_reach(stb_thread_func f, void *d, volatile void **return_code, stb_sync rel) { return stb_workq_reach(stb__work_global, f,d,return_code,rel); } void stb_work_numthreads(int n) { if (stb__work_global == NULL) stb_work_init(n); else stb_workq_numthreads(stb__work_global, n); } #endif // STB_DEFINE ////////////////////////////////////////////////////////////////////////////// // // Background disk I/O // // #define STB_BGIO_READ_ALL (-1) STB_EXTERN int stb_bgio_read (char *filename, int offset, int len, stb_uchar **result, int *olen); STB_EXTERN int stb_bgio_readf (FILE *f , int offset, int len, stb_uchar **result, int *olen); STB_EXTERN int stb_bgio_read_to (char *filename, int offset, int len, stb_uchar *buffer, int *olen); STB_EXTERN int stb_bgio_readf_to(FILE *f , int offset, int len, stb_uchar *buffer, int *olen); typedef struct { int have_data; int is_valid; int is_dir; time_t filetime; stb_int64 filesize; } stb_bgstat; STB_EXTERN int stb_bgio_stat (char *filename, stb_bgstat *result); #ifdef STB_DEFINE static stb_workqueue *stb__diskio; static stb_mutex stb__diskio_mutex; void stb_thread_cleanup(void) { if (stb__work_global) stb_workq_delete(stb__work_global); stb__work_global = NULL; if (stb__threadmutex) stb_mutex_delete(stb__threadmutex); stb__threadmutex = NULL; if (stb__workmutex) stb_mutex_delete(stb__workmutex); stb__workmutex = NULL; if (stb__diskio) stb_workq_delete(stb__diskio); stb__diskio = NULL; if (stb__diskio_mutex)stb_mutex_delete(stb__diskio_mutex);stb__diskio_mutex= NULL; } typedef struct { char *filename; FILE *f; int offset; int len; stb_bgstat *stat_out; stb_uchar *output; stb_uchar **result; int *len_output; int *flag; } stb__disk_command; #define STB__MAX_DISK_COMMAND 100 static stb__disk_command stb__dc_queue[STB__MAX_DISK_COMMAND]; static int stb__dc_offset; void stb__io_init(void) { if (!stb__diskio) { stb__threadmutex_init(); stb_mutex_begin(stb__threadmutex); stb_barrier(); if (*(stb_thread * volatile *) &stb__diskio == NULL) { stb__diskio_mutex = stb_mutex_new(); // use many threads so OS can try to schedule seeks stb__diskio = stb_workq_new_flags(16,STB__MAX_DISK_COMMAND,STB_FALSE,STB_FALSE); } stb_mutex_end(stb__threadmutex); } } static void * stb__io_error(stb__disk_command *dc) { if (dc->len_output) *dc->len_output = 0; if (dc->result) *dc->result = NULL; if (dc->flag) *dc->flag = -1; return NULL; } static void * stb__io_task(void *p) { stb__disk_command *dc = (stb__disk_command *) p; int len; FILE *f; stb_uchar *buf; if (dc->stat_out) { struct _stati64 s; if (!_stati64(dc->filename, &s)) { dc->stat_out->filesize = s.st_size; dc->stat_out->filetime = s.st_mtime; dc->stat_out->is_dir = s.st_mode & _S_IFDIR; dc->stat_out->is_valid = (s.st_mode & _S_IFREG) || dc->stat_out->is_dir; } else dc->stat_out->is_valid = 0; stb_barrier(); dc->stat_out->have_data = 1; free(dc->filename); return 0; } if (dc->f) { #ifdef WIN32 f = _fdopen(_dup(_fileno(dc->f)), "rb"); #else f = fdopen(dup(fileno(dc->f)), "rb"); #endif if (!f) return stb__io_error(dc); } else { f = fopen(dc->filename, "rb"); free(dc->filename); if (!f) return stb__io_error(dc); } len = dc->len; if (len < 0) { fseek(f, 0, SEEK_END); len = ftell(f) - dc->offset; } if (fseek(f, dc->offset, SEEK_SET)) { fclose(f); return stb__io_error(dc); } if (dc->output) buf = dc->output; else { buf = (stb_uchar *) malloc(len); if (buf == NULL) { fclose(f); return stb__io_error(dc); } } len = fread(buf, 1, len, f); fclose(f); if (dc->len_output) *dc->len_output = len; if (dc->result) *dc->result = buf; if (dc->flag) *dc->flag = 1; return NULL; } int stb__io_add(char *fname, FILE *f, int off, int len, stb_uchar *out, stb_uchar **result, int *olen, int *flag, stb_bgstat *stat) { int res; stb__io_init(); // do memory allocation outside of mutex if (fname) fname = strdup(fname); stb_mutex_begin(stb__diskio_mutex); { stb__disk_command *dc = &stb__dc_queue[stb__dc_offset]; dc->filename = fname; dc->f = f; dc->offset = off; dc->len = len; dc->output = out; dc->result = result; dc->len_output = olen; dc->flag = flag; dc->stat_out = stat; res = stb_workq(stb__diskio, stb__io_task, dc, NULL); if (res) stb__dc_offset = (stb__dc_offset + 1 == STB__MAX_DISK_COMMAND ? 0 : stb__dc_offset+1); } stb_mutex_end(stb__diskio_mutex); return res; } int stb_bgio_read(char *filename, int offset, int len, stb_uchar **result, int *olen) { return stb__io_add(filename,NULL,offset,len,NULL,result,olen,NULL,NULL); } int stb_bgio_readf(FILE *f, int offset, int len, stb_uchar **result, int *olen) { return stb__io_add(NULL,f,offset,len,NULL,result,olen,NULL,NULL); } int stb_bgio_read_to(char *filename, int offset, int len, stb_uchar *buffer, int *olen) { return stb__io_add(filename,NULL,offset,len,buffer,NULL,olen,NULL,NULL); } int stb_bgio_readf_to(FILE *f, int offset, int len, stb_uchar *buffer, int *olen) { return stb__io_add(NULL,f,offset,len,buffer,NULL,olen,NULL,NULL); } STB_EXTERN int stb_bgio_stat (char *filename, stb_bgstat *result) { result->have_data = 0; return stb__io_add(filename,NULL,0,0,0,NULL,0,NULL, result); } #endif #endif ////////////////////////////////////////////////////////////////////////////// // // Fast malloc implementation // // This is a clone of TCMalloc, but without the thread support. // 1. large objects are allocated directly, page-aligned // 2. small objects are allocated in homogeonous heaps, 0 overhead // // We keep an allocation table for pages a la TCMalloc. This would // require 4MB for the entire address space, but we only allocate // the parts that are in use. The overhead from using homogenous heaps // everywhere is 3MB. (That is, if you allocate 1 object of each size, // you'll use 3MB.) #if defined(STB_DEFINE) && (defined(_WIN32) || defined(STB_FASTMALLOC)) #ifdef _WIN32 #ifndef _WINDOWS_ #ifndef STB__IMPORT #define STB__IMPORT STB_EXTERN __declspec(dllimport) #define STB__DW unsigned long #endif STB__IMPORT void * __stdcall VirtualAlloc(void *p, unsigned long size, unsigned long type, unsigned long protect); STB__IMPORT int __stdcall VirtualFree(void *p, unsigned long size, unsigned long freetype); #endif #define stb__alloc_pages_raw(x) (stb_uint32) VirtualAlloc(NULL, (x), 0x3000, 0x04) #define stb__dealloc_pages_raw(p) VirtualFree((void *) p, 0, 0x8000) #else #error "Platform not currently supported" #endif typedef struct stb__span { int start, len; struct stb__span *next, *prev; void *first_free; unsigned short list; // 1..256 free; 257..511 sizeclass; 0=large block short allocations; // # outstanding allocations for sizeclass } stb__span; // 24 static stb__span **stb__span_for_page; static int stb__firstpage, stb__lastpage; static void stb__update_page_range(int first, int last) { stb__span **sfp; int i, f,l; if (first >= stb__firstpage && last <= stb__lastpage) return; if (stb__span_for_page == NULL) { f = first; l = f+stb_max(last-f, 16384); l = stb_min(l, 1<<20); } else if (last > stb__lastpage) { f = stb__firstpage; l = f + (stb__lastpage - f) * 2; l = stb_clamp(last, l,1<<20); } else { l = stb__lastpage; f = l - (l - stb__firstpage) * 2; f = stb_clamp(f, 0,first); } sfp = (stb__span **) stb__alloc_pages_raw(sizeof(void *) * (l-f)); for (i=f; i < stb__firstpage; ++i) sfp[i - f] = NULL; for ( ; i < stb__lastpage ; ++i) sfp[i - f] = stb__span_for_page[i - stb__firstpage]; for ( ; i < l ; ++i) sfp[i - f] = NULL; if (stb__span_for_page) stb__dealloc_pages_raw(stb__span_for_page); stb__firstpage = f; stb__lastpage = l; stb__span_for_page = sfp; } static stb__span *stb__span_free=NULL; static stb__span *stb__span_first, *stb__span_end; static stb__span *stb__span_alloc(void) { stb__span *s = stb__span_free; if (s) stb__span_free = s->next; else { if (!stb__span_first) { stb__span_first = (stb__span *) stb__alloc_pages_raw(65536); if (stb__span_first == NULL) return NULL; stb__span_end = stb__span_first + (65536 / sizeof(stb__span)); } s = stb__span_first++; if (stb__span_first == stb__span_end) stb__span_first = NULL; } return s; } static stb__span *stb__spanlist[512]; static void stb__spanlist_unlink(stb__span *s) { if (s->prev) s->prev->next = s->next; else { int n = s->list; assert(stb__spanlist[n] == s); stb__spanlist[n] = s->next; } if (s->next) s->next->prev = s->prev; s->next = s->prev = NULL; s->list = 0; } static void stb__spanlist_add(int n, stb__span *s) { s->list = n; s->next = stb__spanlist[n]; s->prev = NULL; stb__spanlist[n] = s; if (s->next) s->next->prev = s; } #define stb__page_shift 12 #define stb__page_size (1 << stb__page_shift) #define stb__page_number(x) ((x) >> stb__page_shift) #define stb__page_address(x) ((x) << stb__page_shift) static void stb__set_span_for_page(stb__span *s) { int i; for (i=0; i < s->len; ++i) stb__span_for_page[s->start + i - stb__firstpage] = s; } static stb__span *stb__coalesce(stb__span *a, stb__span *b) { assert(a->start + a->len == b->start); if (a->list) stb__spanlist_unlink(a); if (b->list) stb__spanlist_unlink(b); a->len += b->len; b->len = 0; b->next = stb__span_free; stb__span_free = b; stb__set_span_for_page(a); return a; } static void stb__free_span(stb__span *s) { stb__span *n = NULL; if (s->start > stb__firstpage) { n = stb__span_for_page[s->start-1 - stb__firstpage]; if (n && n->allocations == -2 && n->start + n->len == s->start) s = stb__coalesce(n,s); } if (s->start + s->len < stb__lastpage) { n = stb__span_for_page[s->start + s->len - stb__firstpage]; if (n && n->allocations == -2 && s->start + s->len == n->start) s = stb__coalesce(s,n); } s->allocations = -2; stb__spanlist_add(s->len > 256 ? 256 : s->len, s); } static stb__span *stb__alloc_pages(int num) { stb__span *s = stb__span_alloc(); int p; if (!s) return NULL; p = stb__alloc_pages_raw(num << stb__page_shift); if (p == 0) { s->next = stb__span_free; stb__span_free = s; return 0; } assert(stb__page_address(stb__page_number(p)) == p); p = stb__page_number(p); stb__update_page_range(p, p+num); s->start = p; s->len = num; s->next = NULL; s->prev = NULL; stb__set_span_for_page(s); return s; } static stb__span *stb__alloc_span(int pagecount) { int i; stb__span *p = NULL; for(i=pagecount; i < 256; ++i) if (stb__spanlist[i]) { p = stb__spanlist[i]; break; } if (!p) { p = stb__spanlist[256]; while (p && p->len < pagecount) p = p->next; } if (!p) { p = stb__alloc_pages(pagecount < 16 ? 16 : pagecount); if (p == NULL) return 0; } else stb__spanlist_unlink(p); if (p->len > pagecount) { stb__span *q = stb__span_alloc(); if (q) { q->start = p->start + pagecount; q->len = p->len - pagecount; p->len = pagecount; for (i=0; i < q->len; ++i) stb__span_for_page[q->start+i - stb__firstpage] = q; stb__spanlist_add(q->len > 256 ? 256 : q->len, q); } } return p; } #define STB__MAX_SMALL_SIZE 32768 #define STB__MAX_SIZE_CLASSES 256 static unsigned char stb__class_base[32]; static unsigned char stb__class_shift[32]; static unsigned char stb__pages_for_class[STB__MAX_SIZE_CLASSES]; static int stb__size_for_class[STB__MAX_SIZE_CLASSES]; stb__span *stb__get_nonempty_sizeclass(int c) { int s = c + 256, i, size, tsize; // remap to span-list index char *z; void *q; stb__span *p = stb__spanlist[s]; if (p) { if (p->first_free) return p; // fast path: it's in the first one in list for (p=p->next; p; p=p->next) if (p->first_free) { // move to front for future queries stb__spanlist_unlink(p); stb__spanlist_add(s, p); return p; } } // no non-empty ones, so allocate a new one p = stb__alloc_span(stb__pages_for_class[c]); if (!p) return NULL; // create the free list up front size = stb__size_for_class[c]; tsize = stb__pages_for_class[c] << stb__page_shift; i = 0; z = (char *) stb__page_address(p->start); q = NULL; while (i + size <= tsize) { * (void **) z = q; q = z; z += size; i += size; } p->first_free = q; p->allocations = 0; stb__spanlist_add(s,p); return p; } static int stb__sizeclass(size_t sz) { int z = stb_log2_floor(sz); // -1 below to group e.g. 13,14,15,16 correctly return stb__class_base[z] + ((sz-1) >> stb__class_shift[z]); } static void stb__init_sizeclass(void) { int i, size, overhead; int align_shift = 2; // allow 4-byte and 12-byte blocks as well, vs. TCMalloc int next_class = 1; int last_log = 0; for (i = 0; i < align_shift; i++) { stb__class_base [i] = next_class; stb__class_shift[i] = align_shift; } for (size = 1 << align_shift; size <= STB__MAX_SMALL_SIZE; size += 1 << align_shift) { i = stb_log2_floor(size); if (i > last_log) { if (size == 16) ++align_shift; // switch from 4-byte to 8-byte alignment else if (size >= 128 && align_shift < 8) ++align_shift; stb__class_base[i] = next_class - ((size-1) >> align_shift); stb__class_shift[i] = align_shift; last_log = i; } stb__size_for_class[next_class++] = size; } for (i=1; i <= STB__MAX_SMALL_SIZE; ++i) assert(i <= stb__size_for_class[stb__sizeclass(i)]); overhead = 0; for (i = 1; i < next_class; i++) { int s = stb__size_for_class[i]; size = stb__page_size; while (size % s > size >> 3) size += stb__page_size; stb__pages_for_class[i] = (unsigned char) (size >> stb__page_shift); overhead += size; } assert(overhead < (4 << 20)); // make sure it's under 4MB of overhead } #ifdef STB_DEBUG #define stb__smemset(a,b,c) memset((void *) a, b, c) #elif defined(STB_FASTMALLOC_INIT) #define stb__smemset(a,b,c) memset((void *) a, b, c) #else #define stb__smemset(a,b,c) #endif void *stb_smalloc(size_t sz) { stb__span *s; if (sz == 0) return NULL; if (stb__size_for_class[1] == 0) stb__init_sizeclass(); if (sz > STB__MAX_SMALL_SIZE) { s = stb__alloc_span((sz + stb__page_size - 1) >> stb__page_shift); if (s == NULL) return NULL; s->list = 0; s->next = s->prev = NULL; s->allocations = -32767; stb__smemset(stb__page_address(s->start), 0xcd, (sz+3)&~3); return (void *) stb__page_address(s->start); } else { void *p; int c = stb__sizeclass(sz); s = stb__spanlist[256+c]; if (!s || !s->first_free) s = stb__get_nonempty_sizeclass(c); if (s == NULL) return NULL; p = s->first_free; s->first_free = * (void **) p; ++s->allocations; stb__smemset(p,0xcd, sz); return p; } } int stb_ssize(void *p) { stb__span *s; if (p == NULL) return 0; s = stb__span_for_page[stb__page_number((stb_uint) p) - stb__firstpage]; if (s->list >= 256) { return stb__size_for_class[s->list - 256]; } else { assert(s->list == 0); return s->len << stb__page_shift; } } void stb_sfree(void *p) { stb__span *s; if (p == NULL) return; s = stb__span_for_page[stb__page_number((stb_uint) p) - stb__firstpage]; if (s->list >= 256) { stb__smemset(p, 0xfe, stb__size_for_class[s->list-256]); * (void **) p = s->first_free; s->first_free = p; if (--s->allocations == 0) { stb__spanlist_unlink(s); stb__free_span(s); } } else { assert(s->list == 0); stb__smemset(p, 0xfe, stb_ssize(p)); stb__free_span(s); } } void *stb_srealloc(void *p, size_t sz) { size_t cur_size; if (p == NULL) return stb_smalloc(sz); if (sz == 0) { stb_sfree(p); return NULL; } cur_size = stb_ssize(p); if (sz > cur_size || sz <= (cur_size >> 1)) { void *q; if (sz > cur_size && sz < (cur_size << 1)) sz = cur_size << 1; q = stb_smalloc(sz); if (q == NULL) return NULL; memcpy(q, p, sz < cur_size ? sz : cur_size); stb_sfree(p); return q; } return p; } void *stb_scalloc(size_t n, size_t sz) { void *p; if (n == 0 || sz == 0) return NULL; if (stb_log2_ceil(n) + stb_log2_ceil(n) >= 32) return NULL; p = stb_smalloc(n*sz); if (p) memset(p, 0, n*sz); return p; } char *stb_sstrdup(char *s) { int n = strlen(s); char *p = (char *) stb_smalloc(n+1); if (p) strcpy(p,s); return p; } #endif // STB_DEFINE ////////////////////////////////////////////////////////////////////////////// // // Source code constants // // This is a trivial system to let you specify constants in source code, // then while running you can change the constants. // // Note that you can't wrap the #defines, because we need to know their // names. So we provide a pre-wrapped version without 'STB_' for convenience; // to request it, #define STB_CONVENIENT_H, yielding: // KI -- integer // KU -- unsigned integer // KF -- float // KD -- double // KS -- string constant // // Defaults to functioning in debug build, not in release builds. // To force on, define STB_ALWAYS_H #ifdef STB_CONVENIENT_H #define KI(x) STB_I(x) #define KU(x) STB_UI(x) #define KF(x) STB_F(x) #define KD(x) STB_D(x) #define KS(x) STB_S(x) #endif STB_EXTERN void stb_source_path(char *str); #ifdef STB_DEFINE char *stb__source_path; void stb_source_path(char *path) { stb__source_path = path; } char *stb__get_sourcefile_path(char *file) { static char filebuf[512]; if (stb__source_path) { sprintf(filebuf, "%s/%s", stb__source_path, file); if (stb_fexists(filebuf)) return filebuf; } if (stb_fexists(file)) return file; sprintf(filebuf, "../%s", file); if (!stb_fexists(filebuf)) return filebuf; return file; } #endif #define STB_F(x) ((float) STB_H(x)) #define STB_UI(x) ((unsigned int) STB_I(x)) #if !defined(STB_DEBUG) && !defined(STB_ALWAYS_H) #define STB_D(x) ((double) (x)) #define STB_I(x) ((int) (x)) #define STB_S(x) ((char *) (x)) #else #define STB_D(x) stb__double_constant(__FILE__, __LINE__-1, (x)) #define STB_I(x) stb__int_constant(__FILE__, __LINE__-1, (x)) #define STB_S(x) stb__string_constant(__FILE__, __LINE__-1, (x)) STB_EXTERN double stb__double_constant(char *file, int line, double x); STB_EXTERN int stb__int_constant(char *file, int line, int x); STB_EXTERN char * stb__string_constant(char *file, int line, char *str); #ifdef STB_DEFINE enum { STB__CTYPE_int, STB__CTYPE_uint, STB__CTYPE_float, STB__CTYPE_double, STB__CTYPE_string, }; typedef struct { int line; int type; union { int ival; double dval; char *sval; }; } stb__Entry; typedef struct { stb__Entry *entries; char *filename; time_t timestamp; char **file_data; int file_len; unsigned short *line_index; } stb__FileEntry; static void stb__constant_parse(stb__FileEntry *f, int i) { char *s; int n; if (!stb_arr_valid(f->entries, i)) return; n = f->entries[i].line; if (n >= f->file_len) return; s = f->file_data[n]; switch (f->entries[i].type) { case STB__CTYPE_float: while (*s) { if (!strncmp(s, "STB_D(", 6)) { s+=6; goto matched_float; } if (!strncmp(s, "STB_F(", 6)) { s+=6; goto matched_float; } if (!strncmp(s, "KD(", 3)) { s+=3; goto matched_float; } if (!strncmp(s, "KF(", 3)) { s+=3; goto matched_float; } ++s; } break; matched_float: f->entries[i].dval = strtod(s, NULL); break; case STB__CTYPE_int: while (*s) { if (!strncmp(s, "STB_I(", 6)) { s+=6; goto matched_int; } if (!strncmp(s, "STB_UI(", 7)) { s+=7; goto matched_int; } if (!strncmp(s, "KI(", 3)) { s+=3; goto matched_int; } if (!strncmp(s, "KU(", 3)) { s+=3; goto matched_int; } ++s; } break; matched_int: { int neg=0; s = stb_skipwhite(s); while (*s == '-') { neg = !neg; s = stb_skipwhite(s+1); } // handle '- - 5', pointlessly if (s[0] == '0' && tolower(s[1]) == 'x') f->entries[i].ival = strtol(s, NULL, 16); else if (s[0] == '0') f->entries[i].ival = strtol(s, NULL, 8); else f->entries[i].ival = strtol(s, NULL, 10); if (neg) f->entries[i].ival = -f->entries[i].ival; break; } case STB__CTYPE_string: // @TODO break; } } static stb_sdict *stb__constant_file_hash; stb__Entry *stb__constant_get_entry(char *filename, int line, int type) { int i; stb__FileEntry *f; if (stb__constant_file_hash == NULL) stb__constant_file_hash = stb_sdict_new(STB_TRUE); f = (stb__FileEntry*) stb_sdict_get(stb__constant_file_hash, filename); if (f == NULL) { char *s = stb__get_sourcefile_path(filename); if (s == NULL || !stb_fexists(s)) return 0; f = (stb__FileEntry *) malloc(sizeof(*f)); f->timestamp = stb_ftimestamp(s); f->file_data = stb_stringfile(s, &f->file_len); f->filename = strdup(s); // cache the full path f->entries = NULL; f->line_index = 0; stb_arr_setlen(f->line_index, f->file_len); memset(f->line_index, 0xff, stb_arr_storage(f->line_index)); } else { time_t t = stb_ftimestamp(f->filename); if (f->timestamp != t) { f->timestamp = t; free(f->file_data); f->file_data = stb_stringfile(f->filename, &f->file_len); stb_arr_setlen(f->line_index, f->file_len); for (i=0; i < stb_arr_len(f->entries); ++i) stb__constant_parse(f, i); } } if (line >= f->file_len) return 0; if (f->line_index[line] >= stb_arr_len(f->entries)) { // need a new entry int n = stb_arr_len(f->entries); stb__Entry e; e.line = line; if (line < f->file_len) f->line_index[line] = n; e.type = type; stb_arr_push(f->entries, e); stb__constant_parse(f, n); } return f->entries + f->line_index[line]; } double stb__double_constant(char *file, int line, double x) { stb__Entry *e = stb__constant_get_entry(file, line, STB__CTYPE_float); if (!e) return x; return e->dval; } int stb__int_constant(char *file, int line, int x) { stb__Entry *e = stb__constant_get_entry(file, line, STB__CTYPE_int); if (!e) return x; return e->ival; } char * stb__string_constant(char *file, int line, char *x) { stb__Entry *e = stb__constant_get_entry(file, line, STB__CTYPE_string); if (!e) return x; return e->sval; } #endif // STB_DEFINE #endif // !STB_DEBUG && !STB_ALWAYS_H #ifdef STB_STUA ////////////////////////////////////////////////////////////////////////// // // stua: little scripting language // // define STB_STUA to compile it // // see http://nothings.org/stb/stb_stua.html for documentation // // basic parsing model: // // lexical analysis // use stb_lex() to parse tokens; keywords get their own tokens // // parsing: // recursive descent parser. too much of a hassle to make an unambiguous // LR(1) grammar, and one-pass generation is clumsier (recursive descent // makes it easier to e.g. compile nested functions). on the other hand, // dictionary syntax required hackery to get extra lookahead. // // codegen: // output into an evaluation tree, using array indices as 'pointers' // // run: // traverse the tree; support for 'break/continue/return' is tricky // // garbage collection: // stu__mark and sweep; explicit stack with non-stu__compile_global_scope roots typedef stb_int32 stua_obj; typedef stb_idict stua_dict; STB_EXTERN void stua_run_script(char *s); STB_EXTERN void stua_uninit(void); extern stua_obj stua_globals; STB_EXTERN double stua_number(stua_obj z); STB_EXTERN stua_obj stua_getnil(void); STB_EXTERN stua_obj stua_getfalse(void); STB_EXTERN stua_obj stua_gettrue(void); STB_EXTERN stua_obj stua_string(char *z); STB_EXTERN stua_obj stua_make_number(double d); STB_EXTERN stua_obj stua_box(int type, void *data, int size); enum { STUA_op_negate=129, STUA_op_shl, STUA_op_ge, STUA_op_shr, STUA_op_le, STUA_op_shru, STUA_op_last }; #define STUA_NO_VALUE 2 // equivalent to a tagged NULL STB_EXTERN stua_obj (*stua_overload)(int op, stua_obj a, stua_obj b, stua_obj c); STB_EXTERN stua_obj stua_error(char *err, ...); STB_EXTERN stua_obj stua_pushroot(stua_obj o); STB_EXTERN void stua_poproot ( void ); #ifdef STB_DEFINE // INTERPRETER // 31-bit floating point implementation // force the (1 << 30) bit (2nd highest bit) to be zero by re-biasing the exponent; // then shift and set the bottom bit static stua_obj stu__floatp(float *f) { unsigned int n = *(unsigned int *) f; unsigned int e = n & (0xff << 23); assert(sizeof(int) == 4 && sizeof(float) == 4); if (!e) // zero? n = n; // no change else if (e < (64 << 23)) // underflow of the packed encoding? n = (n & 0x80000000); // signed 0 else if (e > (190 << 23)) // overflow of the encoding? (or INF or NAN) n = (n & 0x80000000) + (127 << 23); // new INF encoding else n -= 0x20000000; // now we need to shuffle the bits so that the spare bit is at the bottom assert((n & 0x40000000) == 0); return (n & 0x80000000) + (n << 1) + 1; } static unsigned char stu__getfloat_addend[256]; static float stu__getfloat(stua_obj v) { unsigned int n; unsigned int e = ((unsigned int) v) >> 24; n = (int) v >> 1; // preserve high bit n += stu__getfloat_addend[e] << 24; return *(float *) &n; } stua_obj stua_float(float f) { return stu__floatp(&f); } static void stu__float_init(void) { int i; stu__getfloat_addend[0] = 0; // do nothing to biased exponent of 0 for (i=1; i < 127; ++i) stu__getfloat_addend[i] = 32; // undo the -0x20000000 stu__getfloat_addend[127] = 64; // convert packed INF to INF (0x3f -> 0x7f) for (i=0; i < 128; ++i) // for signed floats, remove the bit we just shifted down stu__getfloat_addend[128+i] = stu__getfloat_addend[i] - 64; } // Tagged data type implementation // TAGS: #define stu__int_tag 0 // of 2 bits // 00 int #define stu__float_tag 1 // of 1 bit // 01 float #define stu__ptr_tag 2 // of 2 bits // 10 boxed // 11 float #define stu__tag(x) ((x) & 3) #define stu__number(x) (stu__tag(x) != stu__ptr_tag) #define stu__isint(x) (stu__tag(x) == stu__int_tag) #define stu__int(x) ((x) >> 2) #define stu__float(x) (stu__getfloat(x)) #define stu__makeint(v) ((v)*4+stu__int_tag) // boxed data, and tag support for boxed data enum { STU___float = 1, STU___int = 2, STU___number = 3, STU___string = 4, STU___function = 5, STU___dict = 6, STU___boolean = 7, STU___error = 8, }; // boxed data #define STU__BOX short type, stua_gc typedef struct stu__box { STU__BOX; } stu__box; stu__box stu__nil = { 0, 1 }; stu__box stu__true = { STU___boolean, 1, }; stu__box stu__false = { STU___boolean, 1, }; #define stu__makeptr(v) ((stua_obj) (v) + stu__ptr_tag) #define stua_nil stu__makeptr(&stu__nil) #define stua_true stu__makeptr(&stu__true) #define stua_false stu__makeptr(&stu__false) stua_obj stua_getnil(void) { return stua_nil; } stua_obj stua_getfalse(void) { return stua_false; } stua_obj stua_gettrue(void) { return stua_true; } #define stu__ptr(x) ((stu__box *) ((x) - stu__ptr_tag)) #define stu__checkt(t,x) ((t) == STU___float ? ((x) & 1) == stu__float_tag : \ (t) == STU___int ? stu__isint(x) : \ (t) == STU___number ? stu__number(x) : \ stu__tag(x) == stu__ptr_tag && stu__ptr(x)->type == (t)) typedef struct { STU__BOX; void *ptr; } stu__wrapper; // implementation of a 'function' or function + closure typedef struct stu__func { STU__BOX; stua_obj closure_source; // 0 - regular function; 4 - C function // if closure, pointer to source function union { stua_obj closure_data; // partial-application data void *store; // pointer to free that holds 'code' stua_obj (*func)(stua_dict *context); } f; // closure ends here short *code; int num_param; stua_obj *param; // list of parameter strings } stu__func; // apply this to 'short *code' to get at data #define stu__const(f) ((stua_obj *) (f)) static void stu__free_func(stu__func *f) { if (f->closure_source == 0) free(f->f.store); if ((stb_uint) f->closure_source <= 4) free(f->param); free(f); } #define stu__pd(x) ((stua_dict *) stu__ptr(x)) #define stu__pw(x) ((stu__wrapper *) stu__ptr(x)) #define stu__pf(x) ((stu__func *) stu__ptr(x)) // garbage-collection static stu__box ** stu__gc_ptrlist; static stua_obj * stu__gc_root_stack; stua_obj stua_pushroot(stua_obj o) { stb_arr_push(stu__gc_root_stack, o); return o; } void stua_poproot ( void ) { stb_arr_pop(stu__gc_root_stack); } static stb_sdict *stu__strings; static void stu__mark(stua_obj z) { int i; stu__box *p = stu__ptr(z); if (p->stua_gc == 1) return; // already marked assert(p->stua_gc == 0); p->stua_gc = 1; switch(p->type) { case STU___function: { stu__func *f = (stu__func *) p; if ((stb_uint) f->closure_source <= 4) { if (f->closure_source == 0) { for (i=1; i <= f->code[0]; ++i) if (!stu__number(((stua_obj *) f->code)[-i])) stu__mark(((stua_obj *) f->code)[-i]); } for (i=0; i < f->num_param; ++i) stu__mark(f->param[i]); } else { stu__mark(f->closure_source); stu__mark(f->f.closure_data); } break; } case STU___dict: { stua_dict *e = (stua_dict *) p; for (i=0; i < e->limit; ++i) if (e->table[i].k != STB_IEMPTY && e->table[i].k != STB_IDEL) { if (!stu__number(e->table[i].k)) stu__mark((int) e->table[i].k); if (!stu__number(e->table[i].v)) stu__mark((int) e->table[i].v); } break; } } } static int stu__num_allocs, stu__size_allocs; static stua_obj stu__flow_val = stua_nil; // used for break & return static void stua_gc(int force) { int i; if (!force && stu__num_allocs == 0 && stu__size_allocs == 0) return; stu__num_allocs = stu__size_allocs = 0; //printf("[gc]\n"); // clear marks for (i=0; i < stb_arr_len(stu__gc_ptrlist); ++i) stu__gc_ptrlist[i]->stua_gc = 0; // stu__mark everything reachable stu__nil.stua_gc = stu__true.stua_gc = stu__false.stua_gc = 1; stu__mark(stua_globals); if (!stu__number(stu__flow_val)) stu__mark(stu__flow_val); for (i=0; i < stb_arr_len(stu__gc_root_stack); ++i) if (!stu__number(stu__gc_root_stack[i])) stu__mark(stu__gc_root_stack[i]); // sweep unreachables for (i=0; i < stb_arr_len(stu__gc_ptrlist);) { stu__box *z = stu__gc_ptrlist[i]; if (!z->stua_gc) { switch (z->type) { case STU___dict: stb_idict_destroy((stua_dict *) z); break; case STU___error: free(((stu__wrapper *) z)->ptr); break; case STU___string: stb_sdict_remove(stu__strings, (char*) ((stu__wrapper *) z)->ptr, NULL); free(z); break; case STU___function: stu__free_func((stu__func *) z); break; } // swap in the last item over this, and repeat z = stb_arr_pop(stu__gc_ptrlist); stu__gc_ptrlist[i] = z; } else ++i; } } static void stu__consider_gc(stua_obj x) { if (stu__size_allocs < 100000) return; if (stu__num_allocs < 10 && stu__size_allocs < 1000000) return; stb_arr_push(stu__gc_root_stack, x); stua_gc(0); stb_arr_pop(stu__gc_root_stack); } static stua_obj stu__makeobj(int type, void *data, int size, int safe_to_gc) { stua_obj x = stu__makeptr(data); ((stu__box *) data)->type = type; stb_arr_push(stu__gc_ptrlist, (stu__box *) data); stu__num_allocs += 1; stu__size_allocs += size; if (safe_to_gc) stu__consider_gc(x); return x; } stua_obj stua_box(int type, void *data, int size) { stu__wrapper *p = (stu__wrapper *) malloc(sizeof(*p)); p->ptr = data; return stu__makeobj(type, p, size, 0); } // a stu string can be directly compared for equality, because // they go into a hash table stua_obj stua_string(char *z) { stu__wrapper *b = (stu__wrapper *) stb_sdict_get(stu__strings, z); if (b == NULL) { int o = stua_box(STU___string, NULL, strlen(z) + sizeof(*b)); b = stu__pw(o); stb_sdict_add(stu__strings, z, b); stb_sdict_getkey(stu__strings, z, (char **) &b->ptr); } return stu__makeptr(b); } // stb_obj dictionary is just an stb_idict static void stu__set(stua_dict *d, stua_obj k, stua_obj v) { if (stb_idict_set(d, k, v)) stu__size_allocs += 8; } static stua_obj stu__get(stua_dict *d, stua_obj k, stua_obj res) { stb_idict_get_flag(d, k, &res); return res; } static stua_obj make_string(char *z, int len) { stua_obj s; char temp[256], *q = (char *) stb_temp(temp, len+1), *p = q; while (len > 0) { if (*z == '\\') { if (z[1] == 'n') *p = '\n'; else if (z[1] == 'r') *p = '\r'; else if (z[1] == 't') *p = '\t'; else *p = z[1]; p += 1; z += 2; len -= 2; } else { *p++ = *z++; len -= 1; } } *p = 0; s = stua_string(q); stb_tempfree(temp, q); return s; } enum token_names { T__none=128, ST_shl = STUA_op_shl, ST_ge = STUA_op_ge, ST_shr = STUA_op_shr, ST_le = STUA_op_le, ST_shru = STUA_op_shru, STU__negate = STUA_op_negate, ST__reset_numbering = STUA_op_last, ST_white, ST_id, ST_float, ST_decimal, ST_hex, ST_char,ST_string, ST_number, // make sure the keywords come _AFTER_ ST_id, so stb_lex prefer them ST_if, ST_while, ST_for, ST_eq, ST_nil, ST_then, ST_do, ST_in, ST_ne, ST_true, ST_else, ST_break, ST_let, ST_and, ST_false, ST_elseif, ST_continue, ST_into, ST_or, ST_repeat, ST_end, ST_as, ST_return, ST_var, ST_func, ST_catch, ST__frame, ST__max_terminals, STU__defaultparm, STU__seq, }; static stua_dict * stu__globaldict; stua_obj stua_globals; static enum { FLOW_normal, FLOW_continue, FLOW_break, FLOW_return, FLOW_error, } stu__flow; stua_obj stua_error(char *z, ...) { stua_obj a; char temp[4096], *x; va_list v; va_start(v,z); vsprintf(temp, z, v); va_end(v); x = strdup(temp); a = stua_box(STU___error, x, strlen(x)); stu__flow = FLOW_error; stu__flow_val = a; return stua_nil; } double stua_number(stua_obj z) { return stu__tag(z) == stu__int_tag ? stu__int(z) : stu__float(z); } stua_obj stua_make_number(double d) { double e = floor(d); if (e == d && e < (1 << 29) && e >= -(1 << 29)) return stu__makeint((int) e); else return stua_float((float) d); } stua_obj (*stua_overload)(int op, stua_obj a, stua_obj b, stua_obj c) = NULL; static stua_obj stu__op(int op, stua_obj a, stua_obj b, stua_obj c) { stua_obj r = STUA_NO_VALUE; if (op == '+') { if (stu__checkt(STU___string, a) && stu__checkt(STU___string, b)) { ;// @TODO: string concatenation } else if (stu__checkt(STU___function, a) && stu__checkt(STU___dict, b)) { stu__func *f = (stu__func *) malloc(12); assert(offsetof(stu__func, code)==12); f->closure_source = a; f->f.closure_data = b; return stu__makeobj(STU___function, f, 16, 1); } } if (stua_overload) r = stua_overload(op,a,b,c); if (stu__flow != FLOW_error && r == STUA_NO_VALUE) stua_error("Typecheck for operator %d", op), r=stua_nil; return r; } #define STU__EVAL2(a,b) \ a = stu__eval(stu__f[n+1]); if (stu__flow) break; stua_pushroot(a); \ b = stu__eval(stu__f[n+2]); stua_poproot(); if (stu__flow) break; #define STU__FB(op) \ STU__EVAL2(a,b) \ if (stu__tag(a) == stu__int_tag && stu__tag(b) == stu__int_tag) \ return ((a) op (b)); \ if (stu__number(a) && stu__number(b)) \ return stua_make_number(stua_number(a) op stua_number(b)); \ return stu__op(stu__f[n], a,b, stua_nil) #define STU__F(op) \ STU__EVAL2(a,b) \ if (stu__number(a) && stu__number(b)) \ return stua_make_number(stua_number(a) op stua_number(b)); \ return stu__op(stu__f[n], a,b, stua_nil) #define STU__I(op) \ STU__EVAL2(a,b) \ if (stu__tag(a) == stu__int_tag && stu__tag(b) == stu__int_tag) \ return stu__makeint(stu__int(a) op stu__int(b)); \ return stu__op(stu__f[n], a,b, stua_nil) #define STU__C(op) \ STU__EVAL2(a,b) \ if (stu__number(a) && stu__number(b)) \ return (stua_number(a) op stua_number(b)) ? stua_true : stua_false; \ return stu__op(stu__f[n], a,b, stua_nil) #define STU__CE(op) \ STU__EVAL2(a,b) \ return (a op b) ? stua_true : stua_false static short *stu__f; static stua_obj stu__f_obj; static stua_dict *stu__c; static stua_obj stu__funceval(stua_obj fo, stua_obj co); static int stu__cond(stua_obj x) { if (stu__flow) return 0; if (!stu__checkt(STU___boolean, x)) x = stu__op('!', x, stua_nil, stua_nil); if (x == stua_true ) return 1; if (x == stua_false) return 0; stu__flow = FLOW_error; return 0; } // had to manually eliminate tailcall recursion for debugging complex stuff #define TAILCALL(x) n = (x); goto top; static stua_obj stu__eval(int n) { top: if (stu__flow >= FLOW_return) return stua_nil; // is this needed? if (n < 0) return stu__const(stu__f)[n]; assert(n != 0 && n != 1); switch (stu__f[n]) { stua_obj a,b,c; case ST_catch: a = stu__eval(stu__f[n+1]); if (stu__flow == FLOW_error) { a=stu__flow_val; stu__flow = FLOW_normal; } return a; case ST_var: b = stu__eval(stu__f[n+2]); if (stu__flow) break; stu__set(stu__c, stu__const(stu__f)[stu__f[n+1]], b); return b; case STU__seq: stu__eval(stu__f[n+1]); if (stu__flow) break; TAILCALL(stu__f[n+2]); case ST_if: if (!stu__cond(stu__eval(stu__f[n+1]))) return stua_nil; TAILCALL(stu__f[n+2]); case ST_else: a = stu__cond(stu__eval(stu__f[n+1])); TAILCALL(stu__f[n + 2 + !a]); #define STU__HANDLE_BREAK \ if (stu__flow >= FLOW_break) { \ if (stu__flow == FLOW_break) { \ a = stu__flow_val; \ stu__flow = FLOW_normal; \ stu__flow_val = stua_nil; \ return a; \ } \ return stua_nil; \ } case ST_as: stu__eval(stu__f[n+3]); STU__HANDLE_BREAK // fallthrough! case ST_while: a = stua_nil; stua_pushroot(a); while (stu__cond(stu__eval(stu__f[n+1]))) { stua_poproot(); a = stu__eval(stu__f[n+2]); STU__HANDLE_BREAK stu__flow = FLOW_normal; // clear 'continue' flag stua_pushroot(a); if (stu__f[n+3]) stu__eval(stu__f[n+3]); STU__HANDLE_BREAK stu__flow = FLOW_normal; // clear 'continue' flag } stua_poproot(); return a; case ST_break: stu__flow = FLOW_break; stu__flow_val = stu__eval(stu__f[n+1]); break; case ST_continue:stu__flow = FLOW_continue; break; case ST_return: stu__flow = FLOW_return; stu__flow_val = stu__eval(stu__f[n+1]); break; case ST__frame: return stu__f_obj; case '[': STU__EVAL2(a,b); if (stu__checkt(STU___dict, a)) return stu__get(stu__pd(a), b, stua_nil); return stu__op(stu__f[n], a, b, stua_nil); case '=': a = stu__eval(stu__f[n+2]); if (stu__flow) break; n = stu__f[n+1]; if (stu__f[n] == ST_id) { if (!stb_idict_update(stu__c, stu__const(stu__f)[stu__f[n+1]], a)) if (!stb_idict_update(stu__globaldict, stu__const(stu__f)[stu__f[n+1]], a)) return stua_error("Assignment to undefined variable"); } else if (stu__f[n] == '[') { stua_pushroot(a); b = stu__eval(stu__f[n+1]); if (stu__flow) { stua_poproot(); break; } stua_pushroot(b); c = stu__eval(stu__f[n+2]); stua_poproot(); stua_poproot(); if (stu__flow) break; if (!stu__checkt(STU___dict, b)) return stua_nil; stu__set(stu__pd(b), c, a); } else { return stu__op(stu__f[n], stu__eval(n), a, stua_nil); } return a; case STU__defaultparm: a = stu__eval(stu__f[n+2]); stu__flow = FLOW_normal; if (stb_idict_add(stu__c, stu__const(stu__f)[stu__f[n+1]], a)) stu__size_allocs += 8; return stua_nil; case ST_id: a = stu__get(stu__c, stu__const(stu__f)[stu__f[n+1]], STUA_NO_VALUE); // try local variable return a != STUA_NO_VALUE // else try stu__compile_global_scope variable ? a : stu__get(stu__globaldict, stu__const(stu__f)[stu__f[n+1]], stua_nil); case STU__negate:a = stu__eval(stu__f[n+1]); if (stu__flow) break; return stu__isint(a) ? -a : stu__op(stu__f[n], a, stua_nil, stua_nil); case '~': a = stu__eval(stu__f[n+1]); if (stu__flow) break; return stu__isint(a) ? (~a)&~3 : stu__op(stu__f[n], a, stua_nil, stua_nil); case '!': a = stu__eval(stu__f[n+1]); if (stu__flow) break; a = stu__cond(a); if (stu__flow) break; return a ? stua_true : stua_false; case ST_eq: STU__CE(==); case ST_le: STU__C(<=); case '<': STU__C(<); case ST_ne: STU__CE(!=); case ST_ge: STU__C(>=); case '>': STU__C(>); case '+' : STU__FB(+); case '*': STU__F(*); case '&': STU__I(&); case ST_shl: STU__I(<<); case '-' : STU__FB(-); case '/': STU__F(/); case '|': STU__I(|); case ST_shr: STU__I(>>); case '%': STU__I(%); case '^': STU__I(^); case ST_shru: STU__EVAL2(a,b); if (stu__tag(a) == stu__int_tag && stu__tag(b) == stu__int_tag) return stu__makeint((unsigned) stu__int(a) >> stu__int(b)); return stu__op(stu__f[n], a,b, stua_nil); case ST_and: a = stu__eval(stu__f[n+1]); b = stu__cond(a); if (stu__flow) break; return a ? stu__eval(stu__f[n+2]) : a; case ST_or : a = stu__eval(stu__f[n+1]); b = stu__cond(a); if (stu__flow) break; return a ? b : stu__eval(stu__f[n+2]); case'(':case':': STU__EVAL2(a,b); if (!stu__checkt(STU___function, a)) return stu__op(stu__f[n], a,b, stua_nil); if (!stu__checkt(STU___dict, b)) return stua_nil; if (stu__f[n] == ':') b = stu__makeobj(STU___dict, stb_idict_copy(stu__pd(b)), stb_idict_memory_usage(stu__pd(b)), 0); a = stu__funceval(a,b); return a; case '{' : { stua_dict *d; d = stb_idict_new_size(stu__f[n+1] > 40 ? 64 : 16); if (d == NULL) return stua_nil; // breakpoint fodder c = stu__makeobj(STU___dict, d, 32, 1); stua_pushroot(c); a = stu__f[n+1]; for (b=0; b < a; ++b) { stua_obj x = stua_pushroot(stu__eval(stu__f[n+2 + b*2 + 0])); stua_obj y = stu__eval(stu__f[n+2 + b*2 + 1]); stua_poproot(); if (stu__flow) { stua_poproot(); return stua_nil; } stu__set(d, x, y); } stua_poproot(); return c; } default: if (stu__f[n] < 0) return stu__const(stu__f)[stu__f[n]]; assert(0); /* NOTREACHED */ // internal error! } return stua_nil; } int stb__stua_nesting; static stua_obj stu__funceval(stua_obj fo, stua_obj co) { stu__func *f = stu__pf(fo); stua_dict *context = stu__pd(co); int i,j; stua_obj p; short *tf = stu__f; // save previous function stua_dict *tc = stu__c; if (stu__flow == FLOW_error) return stua_nil; assert(stu__flow == FLOW_normal); stua_pushroot(fo); stua_pushroot(co); stu__consider_gc(stua_nil); while ((stb_uint) f->closure_source > 4) { // add data from closure to context stua_dict *e = (stua_dict *) stu__pd(f->f.closure_data); for (i=0; i < e->limit; ++i) if (e->table[i].k != STB_IEMPTY && e->table[i].k != STB_IDEL) if (stb_idict_add(context, e->table[i].k, e->table[i].v)) stu__size_allocs += 8; // use add so if it's already defined, we don't override it; that way // explicit parameters win over applied ones, and most recent applications // win over previous ones f = stu__pf(f->closure_source); } for (j=0, i=0; i < f->num_param; ++i) // if it doesn't already exist, add it from the numbered parameters if (stb_idict_add(context, f->param[i], stu__get(context, stu__int(j), stua_nil))) ++j; // @TODO: if (stu__get(context, stu__int(f->num_param+1)) != STUA_NO_VALUE) // error: too many parameters // @TODO: ditto too few parameters if (f->closure_source == 4) p = f->f.func(context); else { stu__f = f->code, stu__c = context; stu__f_obj = co; ++stb__stua_nesting; if (stu__f[1]) p = stu__eval(stu__f[1]); else p = stua_nil; --stb__stua_nesting; stu__f = tf, stu__c = tc; // restore previous function if (stu__flow == FLOW_return) { stu__flow = FLOW_normal; p = stu__flow_val; stu__flow_val = stua_nil; } } stua_poproot(); stua_poproot(); return p; } // Parser static int stu__tok; static stua_obj stu__tokval; static char *stu__curbuf, *stu__bufstart; static stb_matcher *stu__lex_matcher; static unsigned char stu__prec[ST__max_terminals], stu__end[ST__max_terminals]; static void stu__nexttoken(void) { int len; retry: stu__tok = stb_lex(stu__lex_matcher, stu__curbuf, &len); if (stu__tok == 0) return; switch(stu__tok) { case ST_white : stu__curbuf += len; goto retry; case T__none : stu__tok = *stu__curbuf; break; case ST_string: stu__tokval = make_string(stu__curbuf+1, len-2); break; case ST_id : stu__tokval = make_string(stu__curbuf, len); break; case ST_hex : stu__tokval = stu__makeint(strtol(stu__curbuf+2,NULL,16)); stu__tok = ST_number; break; case ST_decimal: stu__tokval = stu__makeint(strtol(stu__curbuf ,NULL,10)); stu__tok = ST_number; break; case ST_float : stu__tokval = stua_float((float) atof(stu__curbuf)) ; stu__tok = ST_number; break; case ST_char : stu__tokval = stu__curbuf[2] == '\\' ? stu__curbuf[3] : stu__curbuf[2]; if (stu__curbuf[3] == 't') stu__tokval = '\t'; if (stu__curbuf[3] == 'n') stu__tokval = '\n'; if (stu__curbuf[3] == 'r') stu__tokval = '\r'; stu__tokval = stu__makeint(stu__tokval); stu__tok = ST_number; break; } stu__curbuf += len; } static struct { int stu__tok; char *regex; } stu__lexemes[] = { ST_white , "([ \t\n\r]|/\\*(.|\n)*\\*/|//[^\r\n]*([\r\n]|$))+", ST_id , "[_a-zA-Z][_a-zA-Z0-9]*", ST_hex , "0x[0-9a-fA-F]+", ST_decimal, "[0-9]+[0-9]*", ST_float , "[0-9]+\\.?[0-9]*([eE][-+]?[0-9]+)?", ST_float , "\\.[0-9]+([eE][-+]?[0-9]+)?", ST_char , "c'(\\\\.|[^\\'])'", ST_string , "\"(\\\\.|[^\\\"\n\r])*\"", ST_string , "\'(\\\\.|[^\\\'\n\r])*\'", #define stua_key4(a,b,c,d) ST_##a, #a, ST_##b, #b, ST_##c, #c, ST_##d, #d, stua_key4(if,then,else,elseif) stua_key4(while,do,for,in) stua_key4(func,var,let,break) stua_key4(nil,true,false,end) stua_key4(return,continue,as,repeat) stua_key4(_frame,catch,catch,catch) ST_shl, "<<", ST_and, "&&", ST_eq, "==", ST_ge, ">=", ST_shr, ">>", ST_or , "||", ST_ne, "!=", ST_le, "<=", ST_shru,">>>", ST_into, "=>", T__none, ".", }; typedef struct { stua_obj *data; // constants being compiled short *code; // code being compiled stua_dict *locals; short *non_local_refs; } stu__comp_func; static stu__comp_func stu__pfunc; static stu__comp_func *func_stack = NULL; static void stu__push_func_comp(void) { stb_arr_push(func_stack, stu__pfunc); stu__pfunc.data = NULL; stu__pfunc.code = NULL; stu__pfunc.locals = stb_idict_new_size(16); stu__pfunc.non_local_refs = NULL; stb_arr_push(stu__pfunc.code, 0); // number of data items stb_arr_push(stu__pfunc.code, 1); // starting execution address } static void stu__pop_func_comp(void) { stb_arr_free(stu__pfunc.code); stb_arr_free(stu__pfunc.data); stb_idict_destroy(stu__pfunc.locals); stb_arr_free(stu__pfunc.non_local_refs); stu__pfunc = stb_arr_pop(func_stack); } // if an id is a reference to an outer lexical scope, this // function returns the "name" of it, and updates the stack // structures to make sure the names are propogated in. static int stu__nonlocal_id(stua_obj var_obj) { stua_obj dummy, var = var_obj; int i, n = stb_arr_len(func_stack), j,k; if (stb_idict_get_flag(stu__pfunc.locals, var, &dummy)) return 0; for (i=n-1; i > 1; --i) { if (stb_idict_get_flag(func_stack[i].locals, var, &dummy)) break; } if (i <= 1) return 0; // stu__compile_global_scope j = i; // need to access variable from j'th frame for (i=0; i < stb_arr_len(stu__pfunc.non_local_refs); ++i) if (stu__pfunc.non_local_refs[i] == j) return j-n; stb_arr_push(stu__pfunc.non_local_refs, j-n); // now make sure all the parents propogate it down for (k=n-1; k > 1; --k) { if (j-k >= 0) return j-n; // comes direct from this parent for(i=0; i < stb_arr_len(func_stack[k].non_local_refs); ++i) if (func_stack[k].non_local_refs[i] == j-k) return j-n; stb_arr_push(func_stack[k].non_local_refs, j-k); } assert (k != 1); return j-n; } static int stu__off(void) { return stb_arr_len(stu__pfunc.code); } static void stu__cc(int a) { assert(a >= -2000 && a < 5000); stb_arr_push(stu__pfunc.code, a); } static int stu__cc1(int a) { stu__cc(a); return stu__off()-1; } static int stu__cc2(int a, int b) { stu__cc(a); stu__cc(b); return stu__off()-2; } static int stu__cc3(int a, int b, int c) { if (a == '=') assert(c != 0); stu__cc(a); stu__cc(b); stu__cc(c); return stu__off()-3; } static int stu__cc4(int a, int b, int c, int d) { stu__cc(a); stu__cc(b); stu__cc(c); stu__cc(d); return stu__off()-4; } static int stu__cdv(stua_obj p) { int i; assert(p != STUA_NO_VALUE); for (i=0; i < stb_arr_len(stu__pfunc.data); ++i) if (stu__pfunc.data[i] == p) break; if (i == stb_arr_len(stu__pfunc.data)) stb_arr_push(stu__pfunc.data, p); return ~i; } static int stu__cdt(void) { int z = stu__cdv(stu__tokval); stu__nexttoken(); return z; } static int stu__seq(int a, int b) { return !a ? b : !b ? a : stu__cc3(STU__seq, a,b); } static char stu__comp_err_str[1024]; static int stu__comp_err_line; static int stu__err(char *str, ...) { va_list v; char *s = stu__bufstart; stu__comp_err_line = 1; while (s < stu__curbuf) { if (s[0] == '\n' || s[0] == '\r') { if (s[0]+s[1] == '\n' + '\r') ++s; ++stu__comp_err_line; } ++s; } va_start(v, str); vsprintf(stu__comp_err_str, str, v); va_end(v); return 0; } static int stu__accept(int p) { if (stu__tok != p) return 0; stu__nexttoken(); return 1; } static int stu__demand(int p) { if (stu__accept(p)) return 1; return stu__err("Didn't find expected stu__tok"); } static int stu__demandv(int p, stua_obj *val) { if (stu__tok == p || p==0) { *val = stu__tokval; stu__nexttoken(); return 1; } else return 0; } static int stu__expr(int p); int stu__nexpr(int p) { stu__nexttoken(); return stu__expr(p); } static int stu__statements(int once, int as); static int stu__parse_if(void) // parse both ST_if and ST_elseif { int b,c,a; a = stu__nexpr(1); if (!a) return 0; if (!stu__demand(ST_then)) return stu__err("expecting THEN"); b = stu__statements(0,0); if (!b) return 0; if (b == 1) b = -1; if (stu__tok == ST_elseif) { return stu__parse_if(); } else if (stu__accept(ST_else)) { c = stu__statements(0,0); if (!c) return 0; if (!stu__demand(ST_end)) return stu__err("expecting END after else clause"); return stu__cc4(ST_else, a, b, c); } else { if (!stu__demand(ST_end)) return stu__err("expecting END in if statement"); return stu__cc3(ST_if, a, b); } } int stu__varinit(int z, int in_globals) { int a,b; stu__nexttoken(); while (stu__demandv(ST_id, &b)) { if (!stb_idict_add(stu__pfunc.locals, b, 1)) if (!in_globals) return stu__err("Redefined variable %s.", stu__pw(b)->ptr); if (stu__accept('=')) { a = stu__expr(1); if (!a) return 0; } else a = stu__cdv(stua_nil); z = stu__seq(z, stu__cc3(ST_var, stu__cdv(b), a)); if (!stu__accept(',')) break; } return z; } static int stu__compile_unary(int z, int outparm, int require_inparm) { int op = stu__tok, a, b; stu__nexttoken(); if (outparm) { if (require_inparm || (stu__tok && stu__tok != ST_end && stu__tok != ST_else && stu__tok != ST_elseif && stu__tok !=';')) { a = stu__expr(1); if (!a) return 0; } else a = stu__cdv(stua_nil); b = stu__cc2(op, a); } else b = stu__cc1(op); return stu__seq(z,b); } static int stu__assign(void) { int z; stu__accept(ST_let); z = stu__expr(1); if (!z) return 0; if (stu__accept('=')) { int y,p = (z >= 0 ? stu__pfunc.code[z] : 0); if (z < 0 || (p != ST_id && p != '[')) return stu__err("Invalid lvalue in assignment"); y = stu__assign(); if (!y) return 0; z = stu__cc3('=', z, y); } return z; } static int stu__statements(int once, int stop_while) { int a,b, c, z=0; for(;;) { switch (stu__tok) { case ST_if : a = stu__parse_if(); if (!a) return 0; z = stu__seq(z, a); break; case ST_while : if (stop_while) return (z ? z:1); a = stu__nexpr(1); if (!a) return 0; if (stu__accept(ST_as)) c = stu__statements(0,0); else c = 0; if (!stu__demand(ST_do)) return stu__err("expecting DO"); b = stu__statements(0,0); if (!b) return 0; if (!stu__demand(ST_end)) return stu__err("expecting END"); if (b == 1) b = -1; z = stu__seq(z, stu__cc4(ST_while, a, b, c)); break; case ST_repeat : stu__nexttoken(); c = stu__statements(0,1); if (!c) return 0; if (!stu__demand(ST_while)) return stu__err("expecting WHILE"); a = stu__expr(1); if (!a) return 0; if (!stu__demand(ST_do)) return stu__err("expecting DO"); b = stu__statements(0,0); if (!b) return 0; if (!stu__demand(ST_end)) return stu__err("expecting END"); if (b == 1) b = -1; z = stu__seq(z, stu__cc4(ST_as, a, b, c)); break; case ST_catch : a = stu__nexpr(1); if (!a) return 0; z = stu__seq(z, stu__cc2(ST_catch, a)); break; case ST_var : z = stu__varinit(z,0); break; case ST_return : z = stu__compile_unary(z,1,1); break; case ST_continue:z = stu__compile_unary(z,0,0); break; case ST_break : z = stu__compile_unary(z,1,0); break; case ST_into : if (z == 0 && !once) return stu__err("=> cannot be first statement in block"); a = stu__nexpr(99); b = (a >= 0? stu__pfunc.code[a] : 0); if (a < 0 || (b != ST_id && b != '[')) return stu__err("Invalid lvalue on right side of =>"); z = stu__cc3('=', a, z); break; default : if (stu__end[stu__tok]) return once ? 0 : (z ? z:1); a = stu__assign(); if (!a) return 0; stu__accept(';'); if (stu__tok && !stu__end[stu__tok]) { if (a < 0) return stu__err("Constant has no effect"); if (stu__pfunc.code[a] != '(' && stu__pfunc.code[a] != '=') return stu__err("Expression has no effect"); } z = stu__seq(z, a); break; } if (!z) return 0; stu__accept(';'); if (once && stu__tok != ST_into) return z; } } static int stu__postexpr(int z, int p); static int stu__dictdef(int end, int *count) { int z,n=0,i,flags=0; short *dict=NULL; stu__nexttoken(); while (stu__tok != end) { if (stu__tok == ST_id) { stua_obj id = stu__tokval; stu__nexttoken(); if (stu__tok == '=') { flags |= 1; stb_arr_push(dict, stu__cdv(id)); z = stu__nexpr(1); if (!z) return 0; } else { z = stu__cc2(ST_id, stu__cdv(id)); z = stu__postexpr(z,1); if (!z) return 0; flags |= 2; stb_arr_push(dict, stu__cdv(stu__makeint(n++))); } } else { z = stu__expr(1); if (!z) return 0; flags |= 2; stb_arr_push(dict, stu__cdv(stu__makeint(n++))); } if (end != ')' && flags == 3) { z=stu__err("can't mix initialized and uninitialized defs"); goto done;} stb_arr_push(dict, z); if (!stu__accept(',')) break; } if (!stu__demand(end)) return stu__err(end == ')' ? "Expecting ) at end of function call" : "Expecting } at end of dictionary definition"); z = stu__cc2('{', stb_arr_len(dict)/2); for (i=0; i < stb_arr_len(dict); ++i) stu__cc(dict[i]); if (count) *count = n; done: stb_arr_free(dict); return z; } static int stu__comp_id(void) { int z,d; d = stu__nonlocal_id(stu__tokval); if (d == 0) return z = stu__cc2(ST_id, stu__cdt()); // access a non-local frame by naming it with the appropriate int assert(d < 0); z = stu__cdv(d); // relative frame # is the 'variable' in our local frame z = stu__cc2(ST_id, z); // now access that dictionary return stu__cc3('[', z, stu__cdt()); // now access the variable from that dir } static stua_obj stu__funcdef(stua_obj *id, stua_obj *func); static int stu__expr(int p) { int z; // unary switch (stu__tok) { case ST_number: z = stu__cdt(); break; case ST_string: z = stu__cdt(); break; // @TODO - string concatenation like C case ST_id : z = stu__comp_id(); break; case ST__frame: z = stu__cc1(ST__frame); stu__nexttoken(); break; case ST_func : z = stu__funcdef(NULL,NULL); break; case ST_if : z = stu__parse_if(); break; case ST_nil : z = stu__cdv(stua_nil); stu__nexttoken(); break; case ST_true : z = stu__cdv(stua_true); stu__nexttoken(); break; case ST_false : z = stu__cdv(stua_false); stu__nexttoken(); break; case '-' : z = stu__nexpr(99); if (z) z=stu__cc2(STU__negate,z); else return z; break; case '!' : z = stu__nexpr(99); if (z) z=stu__cc2('!',z); else return z; break; case '~' : z = stu__nexpr(99); if (z) z=stu__cc2('~',z); else return z; break; case '{' : z = stu__dictdef('}', NULL); break; default : return stu__err("Unexpected token"); case '(' : stu__nexttoken(); z = stu__statements(0,0); if (!stu__demand(')')) return stu__err("Expecting )"); } return stu__postexpr(z,p); } static int stu__postexpr(int z, int p) { int q; // postfix while (stu__tok == '(' || stu__tok == '[' || stu__tok == '.') { if (stu__accept('.')) { // MUST be followed by a plain identifier! use [] for other stuff if (stu__tok != ST_id) return stu__err("Must follow . with plain name; try [] instead"); z = stu__cc3('[', z, stu__cdv(stu__tokval)); stu__nexttoken(); } else if (stu__accept('[')) { while (stu__tok != ']') { int r = stu__expr(1); if (!r) return 0; z = stu__cc3('[', z, r); if (!stu__accept(',')) break; } if (!stu__demand(']')) return stu__err("Expecting ]"); } else { int n, p = stu__dictdef(')', &n); if (!p) return 0; #if 0 // this is incorrect! if (z > 0 && stu__pfunc.code[z] == ST_id) { stua_obj q = stu__get(stu__globaldict, stu__pfunc.data[-stu__pfunc.code[z+1]-1], stua_nil); if (stu__checkt(STU___function, q)) if ((stu__pf(q))->num_param != n) return stu__err("Incorrect number of parameters"); } #endif z = stu__cc3('(', z, p); } } // binop - this implementation taken from lcc for (q=stu__prec[stu__tok]; q >= p; --q) { while (stu__prec[stu__tok] == q) { int o = stu__tok, y = stu__nexpr(p+1); if (!y) return 0; z = stu__cc3(o,z,y); } } return z; } static stua_obj stu__finish_func(stua_obj *param, int start) { int n, size; stu__func *f = (stu__func *) malloc(sizeof(*f)); f->closure_source = 0; f->num_param = stb_arr_len(param); f->param = (int *) stb_copy(param, f->num_param * sizeof(*f->param)); size = stb_arr_storage(stu__pfunc.code) + stb_arr_storage(stu__pfunc.data) + sizeof(*f) + 8; f->f.store = malloc(stb_arr_storage(stu__pfunc.code) + stb_arr_storage(stu__pfunc.data)); f->code = (short *) ((char *) f->f.store + stb_arr_storage(stu__pfunc.data)); memcpy(f->code, stu__pfunc.code, stb_arr_storage(stu__pfunc.code)); f->code[1] = start; f->code[0] = stb_arr_len(stu__pfunc.data); for (n=0; n < f->code[0]; ++n) ((stua_obj *) f->code)[-1-n] = stu__pfunc.data[n]; return stu__makeobj(STU___function, f, size, 0); } static int stu__funcdef(stua_obj *id, stua_obj *result) { int n,z=0,i,q; stua_obj *param = NULL; short *nonlocal; stua_obj v,f=stua_nil; assert(stu__tok == ST_func); stu__nexttoken(); if (id) { if (!stu__demandv(ST_id, id)) return stu__err("Expecting function name"); } else stu__accept(ST_id); if (!stu__demand('(')) return stu__err("Expecting ( for function parameter"); stu__push_func_comp(); while (stu__tok != ')') { if (!stu__demandv(ST_id, &v)) { z=stu__err("Expecting parameter name"); goto done; } stb_idict_add(stu__pfunc.locals, v, 1); if (stu__tok == '=') { n = stu__nexpr(1); if (!n) { z=0; goto done; } z = stu__seq(z, stu__cc3(STU__defaultparm, stu__cdv(v), n)); } else stb_arr_push(param, v); if (!stu__accept(',')) break; } if (!stu__demand(')')) { z=stu__err("Expecting ) at end of parameter list"); goto done; } n = stu__statements(0,0); if (!n) { z=0; goto done; } if (!stu__demand(ST_end)) { z=stu__err("Expecting END at end of function"); goto done; } if (n == 1) n = 0; n = stu__seq(z,n); f = stu__finish_func(param, n); if (result) { *result = f; z=1; stu__pop_func_comp(); } else { nonlocal = stu__pfunc.non_local_refs; stu__pfunc.non_local_refs = NULL; stu__pop_func_comp(); z = stu__cdv(f); if (nonlocal) { // build a closure with references to the needed frames short *initcode = NULL; for (i=0; i < stb_arr_len(nonlocal); ++i) { int k = nonlocal[i], p; stb_arr_push(initcode, stu__cdv(k)); if (k == -1) p = stu__cc1(ST__frame); else { p = stu__cdv(stu__makeint(k+1)); p = stu__cc2(ST_id, p); } stb_arr_push(initcode, p); } q = stu__cc2('{', stb_arr_len(nonlocal)); for (i=0; i < stb_arr_len(initcode); ++i) stu__cc(initcode[i]); z = stu__cc3('+', z, q); stb_arr_free(initcode); } stb_arr_free(nonlocal); } done: stb_arr_free(param); if (!z) stu__pop_func_comp(); return z; } static int stu__compile_global_scope(void) { stua_obj o; int z=0; stu__push_func_comp(); while (stu__tok != 0) { if (stu__tok == ST_func) { stua_obj id, f; if (!stu__funcdef(&id,&f)) goto error; stu__set(stu__globaldict, id, f); } else if (stu__tok == ST_var) { z = stu__varinit(z,1); if (!z) goto error; } else { int y = stu__statements(1,0); if (!y) goto error; z = stu__seq(z,y); } stu__accept(';'); } o = stu__finish_func(NULL, z); stu__pop_func_comp(); o = stu__funceval(o, stua_globals); // initialize stu__globaldict if (stu__flow == FLOW_error) printf("Error: %s\n", ((stu__wrapper *) stu__ptr(stu__flow_val))->ptr); return 1; error: stu__pop_func_comp(); return 0; } stua_obj stu__myprint(stua_dict *context) { stua_obj x = stu__get(context, stua_string("x"), stua_nil); if ((x & 1) == stu__float_tag) printf("%f", stu__getfloat(x)); else if (stu__tag(x) == stu__int_tag) printf("%d", stu__int(x)); else { stu__wrapper *s = stu__pw(x); if (s->type == STU___string || s->type == STU___error) printf("%s", s->ptr); else if (s->type == STU___dict) printf("{{dictionary}}"); else if (s->type == STU___function) printf("[[function]]"); else printf("[[ERROR:%s]]", s->ptr); } return x; } void stua_init(void) { if (!stu__globaldict) { int i; stua_obj s; stu__func *f; stu__prec[ST_and] = stu__prec[ST_or] = 1; stu__prec[ST_eq ] = stu__prec[ST_ne] = stu__prec[ST_le] = stu__prec[ST_ge] = stu__prec['>' ] = stu__prec['<'] = 2; stu__prec[':'] = 3; stu__prec['&'] = stu__prec['|'] = stu__prec['^'] = 4; stu__prec['+'] = stu__prec['-'] = 5; stu__prec['*'] = stu__prec['/'] = stu__prec['%'] = stu__prec[ST_shl]= stu__prec[ST_shr]= stu__prec[ST_shru]= 6; stu__end[')'] = stu__end[ST_end] = stu__end[ST_else] = 1; stu__end[ST_do] = stu__end[ST_elseif] = 1; stu__float_init(); stu__lex_matcher = stb_lex_matcher(); for (i=0; i < sizeof(stu__lexemes)/sizeof(stu__lexemes[0]); ++i) stb_lex_item(stu__lex_matcher, stu__lexemes[i].regex, stu__lexemes[i].stu__tok); stu__globaldict = stb_idict_new_size(64); stua_globals = stu__makeobj(STU___dict, stu__globaldict, 0,0); stu__strings = stb_sdict_new(0); stu__curbuf = stu__bufstart = "func _print(x) end\n" "func print()\n var x=0 while _frame[x] != nil as x=x+1 do _print(_frame[x]) end end\n"; stu__nexttoken(); if (!stu__compile_global_scope()) printf("Compile error in line %d: %s\n", stu__comp_err_line, stu__comp_err_str); s = stu__get(stu__globaldict, stua_string("_print"), stua_nil); if (stu__tag(s) == stu__ptr_tag && stu__ptr(s)->type == STU___function) { f = stu__pf(s); free(f->f.store); f->closure_source = 4; f->f.func = stu__myprint; f->code = NULL; } } } void stua_uninit(void) { if (stu__globaldict) { stb_idict_remove_all(stu__globaldict); stb_arr_setlen(stu__gc_root_stack, 0); stua_gc(1); stb_idict_destroy(stu__globaldict); stb_sdict_delete(stu__strings); stb_matcher_free(stu__lex_matcher); stb_arr_free(stu__gc_ptrlist); stb_arr_free(func_stack); stb_arr_free(stu__gc_root_stack); stu__globaldict = NULL; } } void stua_run_script(char *s) { stua_init(); stu__curbuf = stu__bufstart = s; stu__nexttoken(); stu__flow = FLOW_normal; if (!stu__compile_global_scope()) printf("Compile error in line %d: %s\n", stu__comp_err_line, stu__comp_err_str); stua_gc(1); } #endif // STB_DEFINE #endif // STB_STUA #undef STB_EXTERN #endif // STB_INCLUDE_STB_H /* ------------------------------------------------------------------------------ This software is available under 2 licenses -- choose whichever you prefer. ------------------------------------------------------------------------------ ALTERNATIVE A - MIT License Copyright (c) 2017 Sean Barrett 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. ------------------------------------------------------------------------------ ALTERNATIVE B - Public Domain (www.unlicense.org) This is free and unencumbered software released into the public domain. Anyone is free to copy, modify, publish, use, compile, sell, or distribute this software, either in source code form or as a compiled binary, for any purpose, commercial or non-commercial, and by any means. In jurisdictions that recognize copyright laws, the author or authors of this software dedicate any and all copyright interest in the software to the public domain. We make this dedication for the benefit of the public at large and to the detriment of our heirs and successors. We intend this dedication to be an overt act of relinquishment in perpetuity of all present and future rights to this software under copyright law. 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 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. ------------------------------------------------------------------------------ */ uTox/third_party/stb/stb/docs/0000700000175000001440000000000014003056224015334 5ustar rakusersuTox/third_party/stb/stb/docs/why_public_domain.md0000600000175000001440000001161714003056224021362 0ustar rakusersMy collected rationales for placing these libraries in the public domain: 1. Public domain vs. viral licenses Why is this library public domain? Because more people will use it. Because it's not viral, people are not obligated to give back, so you could argue that it hurts the development of it, and then because it doesn't develop as well it's not as good, and then because it's not as good, in the long run maybe fewer people will use it. I have total respect for that opinion, but I just don't believe it myself for most software. 2. Public domain vs. attribution-required licenses The primary difference between public domain and, say, a Creative Commons commercial / non-share-alike / attribution license is solely the requirement for attribution. (Similarly the BSD license and such.) While I would *appreciate* acknowledgement and attribution, I believe that it is foolish to place a legal encumberment (i.e. a license) on the software *solely* to get attribution. In other words, I'm arguing that PD is superior to the BSD license and the Creative Commons 'Attribution' license. If the license offers anything besides attribution -- as does, e.g., CC NonCommercial-ShareAlike, or the GPL -- that's a separate discussion. 3. Other aspects of BSD-style licenses besides attribution Permissive licenses like zlib and BSD license are perfectly reasonable in their requirements, but they are very wordy and have only two benefits over public domain: legally-mandated attribution and liability-control. I do not believe these are worth the excessive verbosity and user-unfriendliness these licenses induce, especially in the single-file case where those licenses tend to be at the top of the file, the first thing you see. To the specific points, I have had no trouble receiving attribution for my libraries; liability in the face of no explicit disclaimer of liability is an open question, but one I have a lot of difficulty imagining there being any actual doubt about in court. Sometimes I explicitly note in my libraries that I make no guarantees about them being fit for purpose, but it's pretty absurd to do this; as a whole, it comes across as "here is a library to decode vorbis audio files, but it may not actually work and if you have problems it's not my fault, but also please report bugs so I can fix them"--so dumb! 4. full discussion from stb_howto.txt on what YOU should do for YOUR libs ``` EASY-TO-COMPLY LICENSE I make my libraries public domain. You don't have to. But my goal in releasing stb-style libraries is to reduce friction for potential users as much as possible. That means: a. easy to build (what this file is mostly about) b. easy to invoke (which requires good API design) c. easy to deploy (which is about licensing) I choose to place all my libraries in the public domain, abjuring copyright, rather than license the libraries. This has some benefits and some drawbacks. Any license which is "viral" to modifications causes worries for lawyers, even if their programmers aren't modifying it. Any license which requires crediting in documentation adds friction which can add up. Valve used to have a page with a list of all of these on their web site, and it was insane, and obviously nobody ever looked at it so why would you care whether your credit appeared there? Permissive licenses like zlib and BSD license are perfectly reasonable, but they are very wordy and have only two benefits over public domain: legally-mandated attribution and liability-control. I do not believe these are worth the excessive verbosity and user-unfriendliness these licenses induce, especially in the single-file case where those licenses tend to be at the top of the file, the first thing you see. (To the specific points, I have had no trouble receiving attribution for my libraries; liability in the face of no explicit disclaimer of liability is an open question.) However, public domain has frictions of its own, because public domain declarations aren't necessary recognized in the USA and some other locations. For that reason, I recommend a declaration along these lines: // This software is dual-licensed to the public domain and under the following // license: you are granted a perpetual, irrevocable license to copy, modify, // publish, and distribute this file as you see fit. I typically place this declaration at the end of the initial comment block of the file and just say 'public domain' at the top. I have had people say they couldn't use one of my libraries because it was only "public domain" and didn't have the additional fallback clause, who asked if I could dual-license it under a traditional license. My answer: they can create a derivative work by modifying one character, and then license that however they like. (Indeed, *adding* the zlib or BSD license would be such a modification!) Unfortunately, their lawyers reportedly didn't like that answer. :( ``` uTox/third_party/stb/stb/docs/stb_voxel_render_interview.md0000600000175000001440000001605314003056224023325 0ustar rakusers# An interview with STB about stb_voxel_render.h **Q:** I suppose you really like Minecraft? **A:** Not really. I mean, I do own it and play it some, and I do watch YouTube videos of other people playing it once in a while, but I'm not saying it's that great. But I do love voxels. I've been playing with voxel rendering since the mid-late 90's when we were still doing software rendering and thinking maybe polygons weren't the answer. Once GPUs came along that kind of died off, at least until Minecraft brought it back to attention. **Q:** Do you expect people will make a lot of Minecraft clones with this? **A:** I hope not! For one thing, it's a terrible idea for the developer. Remember before Minecraft was on the Xbox 360, there were a ton of "indie" clones (some maybe making decent money even), but then the real Minecraft came out and just crushed them (as far as I know). It's just not something you really want to compete with. The reason I made this library is because I'd like to see more games with Minecraft's *art style*, not necessary its *gameplay*. I can understand the urge to clone the gameplay. When you have a world made of voxels/blocks, there are a few things that become incredibly easy to do that would otherwise be very hard (at least for an indie) to do in 3D. One thing is that procedural generation becomes much easier. Another is that destructible environments are easy. Another is that you have a world where your average user can build stuff that they find satisfactory. Minecraft is at a sort of local maximum, a sweet spot, where it leverages all of those easy-to-dos. And so I'm sure it's hard to look at the space of 'games using voxels' and move away from that local maximum, to give up some of that. But I think that's what people should do. **Q:** So what else can people do with stb_voxel_render? **A:** All of those benefits I mentioned above are still valid even if you stay away from the sweet spot. You can make a 3D roguelike without player-creation/destruction that uses procedural generation. You could make a shooter with pre-designed maps but destructible environments. And I'm sure there are other possible benefits to using voxels/blocks. Hopefully this will make it easier for people to explore the space. The library has a pretty wide range of features to allow people to come up with some distinctive looks. For example, the art style of Continue?9876543210 was one of the inspirations for trying to make the multitexturing capabilities flexible. I'm terrible at art, so this isn't really something I can come up with myself, but I tried to put in flexible technology that could be used multiple ways. One thing I did intentionally was try to make it possible to make nicer looking ground terrain, using the half-height slopes and "weird slopes". There are Minecraft mods with drivable cars and they just go up these blocky slopes and, like, what? So I wanted you to be able to make smoother terrain, either just for the look, or for vehicles etc. Also, you can spatially cross-fade between two ground textures for that classic bad dirt/grass transition that has shipped in plenty of professional games. Of course, you could just use a separate non-voxel ground renderer for all of this. But this way, you can seamlessly integrate everything else with it. E.g. in your authoring tool (or procedural generation) you can make smooth ground and then cut a sharp-edged hole in it for a building's basement or whatever. Another thing you can do is work at a very different scale. In Minecraft, a person is just under 2 blocks tall. In Ace of Spades, a person is just under 3 blocks tall. Why not 4 or 6? Well, partly because you just need a lot more voxels; if a meter is 2 voxels in Mineraft and 4 voxels in your game, and you draw the same number of voxels due to hardware limits, then your game has half the view distance of Minecraft. Since stb_voxel_render is designed to keep the meshes small and render efficiently, you can push the view distance out further than Minecraft--or use a similar view distance and a higher voxel resolution. You could also stop making infinite worlds and work at entirely different scales; where Minecraft is 1 voxel per meter, you could have 20 voxels per meter and make a small arena that's 50 meters wide and 5 meters tall. Back when the voxel game Voxatron was announced, the weekend after the trailer came out I wrote my own little GPU-accelerated version of the engine and thought that was pretty cool. I've been tempted many times to extract that and release it as a library, but I don't want to steal Voxatron's thunder so I've avoided it. You could use this engine to do the same kind of thing, although it won't be as efficient as an engine dedicated to that style of thing would be. **Q:** What one thing would you really like to see somebody do? **A:** Before Unity, 3D has seemed deeply problematic in the indie space. Software like GameMaker has tried to support 3D but it seems like little of note has been done with it. Minecraft has shown that people can build worlds with the Minecraft toolset far more easily than we've ever seen from those other tools. Obviously people have done great things with Unity, but those people are much closer to professional developers; typically they still need real 3D modelling and all of that stuff. So what I'd really like to see is someone build some kind of voxel-game-construction-set. Start with stb_voxel_render, maybe expose all the flexibility of stb_voxel_render (so people can do different things). Thrown in lua or something else for scripting, make some kind of editor that feels at least as good as Minecraft and Infinifactory, and see where that gets you. **Q:** Why'd you make this library? **A:** Mainly as a way of releasing this technology I've been working on since 2011 and seemed unlikely to ever ship myself. In 2011 I was playing the voxel shooter Ace of Spades. One of the maps that we played on was a partial port of Broville (which is the first Minecraft map in stb_voxel_render release trailer). I'd made a bunch of procedural level generators for the game, and I started trying to make a city generator inspired by Broville. But I realized it would be a lot of work, and of very little value (most of my maps didn't get much play because people preferred to play on maps where they could charge straight at the enemies and shoot them as fast as possible). So I wrote my own voxel engine and started working on a procedural city game. But I got bogged down after I finally got the road generator working and never got anywhere with building generation or gameplay. stb_voxel_render is actually a complete rewrite from scratch, but it's based a lot on what I learned from that previous work. **Q:** About the release video... how long did that take to edit? **A:** About seven or eight hours. I had the first version done in maybe six or seven hours, but then I realized I'd left out one clip, and when I went back to add it I also gussied up a couple other moments in the video. But there was something basically identical to it that was done in around six. **Q:** Ok, that's it. Thanks, me. **A:** Thanks *me!* uTox/third_party/stb/stb/docs/stb_howto.txt0000600000175000001440000001573214003056224020117 0ustar rakusersLessons learned about how to make a header-file library V1.0 September 2013 Sean Barrett Things to do in an stb-style header-file library, and rationales: 1. #define LIBRARYNAME_IMPLEMENTATION Use a symbol like the above to control creating the implementation. (I used a far-less-clear name in my first header-file library; it became clear that was a mistake once I had multiple libraries.) Include a "header-file" section with header-file guards and declarations for all the functions, but only guard the implementation with LIBRARYNAME_IMPLEMENTATION, not the header-file guard. That way, if client's header file X includes your header file for declarations, they can still include header file X in the source file that creates the implementation; if you guard the implementation too, then the first include (before the #define) creates the declarations, and the second one (after the #define) does nothing. 2. AVOID DEPENDENCIES Don't rely on anything other than the C standard libraries. (If you're creating a library specifically to leverage/wrap some other library, then obviously you can rely on that library. But if that library is public domain, you might be better off directly embedding the source, to reduce dependencies for your clients. But of course now you have to update whenever that library updates.) If you use stdlib, consider wrapping all stdlib calls in macros, and then conditionally define those macros to the stdlib function, allowing the user to replace them. For functions with side effects, like memory allocations, consider letting the user pass in a context and pass that in to the macros. (The stdlib versions will ignore the parameter.) Otherwise, users may have to use global or thread-local variables to achieve the same effect. 3. AVOID MALLOC You can't always do this, but when you can, embedded developers will appreciate it. I almost never bother avoiding, as it's too much work (and in some cases is pretty infeasible; see http://nothings.org/gamedev/font_rendering_malloc.txt ). But it's definitely something one of the things I've gotten the most pushback on from potential users. 4. ALLOW STATIC IMPLEMENTATION Have a #define which makes function declarations and function definitions static. This makes the implementation private to the source file that creates it. This allows people to use your library multiple times in their project without collision. (This is only necessary if your library has configuration macros or global state, or if your library has multiple versions that are not backwards compatible. I've run into both of those cases.) 5. MAKE ACCESSIBLE FROM C Making your code accessible from C instead of C++ (i.e. either coding in C, or using extern "C") makes it more straightforward to be used in C and in other languages, which often only have support for C bindings, not C++. (One of the earliest results I found in googling for stb_image was a Haskell wrapper.) Otherwise, people have to wrap it in another set of function calls, and the whole point here is to make it convenient for people to use, isn't it? (See below.) I prefer to code entirely in C, so the source file that instantiates the implementation can be C itself, for those crazy people out there who are programming in C. But it's probably not a big hardship for a C programmer to create a single C++ source file to instantiate your library. 6. NAMESPACE PRIVATE FUNCTIONS Try to avoid having names in your source code that will cause conflicts with identical names in client code. You can do this either by namespacing in C++, or prefixing with your library name in C. In C, generally, I use the same prefix for API functions and private symbols, such as "stbtt_" for stb_truetype; but private functions (and static globals) use a second underscore as in "stbtt__" to further minimize the chance of additional collisions in the unlikely but not impossible event that users write wrapper functions that have names of the form "stbtt_". (Consider the user that has used "stbtt_foo" *successfully*, and then upgrades to a new version of your library which has a new private function named either "stbtt_foo" or "stbtt__foo".) Note that the double-underscore is reserved for use by the compiler, but (1) there is nothing reserved for "middleware", i.e. libraries desiring to avoid conflicts with user symbols have no other good options, and (2) in practice no compilers use double-underscore in the middle rather than the beginning/end. (Unfortunately, there is at least one videogame-console compiler that will warn about double-underscores by default.) 7. EASY-TO-COMPLY LICENSE I make my libraries public domain. You don't have to. But my goal in releasing stb-style libraries is to reduce friction for potential users as much as possible. That means: a. easy to build (what this file is mostly about) b. easy to invoke (which requires good API design) c. easy to deploy (which is about licensing) I choose to place all my libraries in the public domain, abjuring copyright, rather than license the libraries. This has some benefits and some drawbacks. Any license which is "viral" to modifications causes worries for lawyers, even if their programmers aren't modifying it. Any license which requires crediting in documentation adds friction which can add up. Valve used to have a page with a list of all of these on their web site, and it was insane, and obviously nobody ever looked at it so why would you care whether your credit appeared there? Permissive licenses like zlib and BSD license are perfectly reasonable, but they are very wordy and have only two benefits over public domain: legally-mandated attribution and liability-control. I do not believe these are worth the excessive verbosity and user-unfriendliness these licenses induce, especially in the single-file case where those licenses tend to be at the top of the file, the first thing you see. (To the specific points, I have had no trouble receiving attribution for my libraries; liability in the face of no explicit disclaimer of liability is an open question.) However, public domain has frictions of its own, because public domain declarations aren't necessary recognized in the USA and some other locations. For that reason, I recommend a declaration along these lines: // This software is dual-licensed to the public domain and under the following // license: you are granted a perpetual, irrevocable license to copy, modify, // publish, and distribute this file as you see fit. I typically place this declaration at the end of the initial comment block of the file and just say 'public domain' at the top. I have had people say they couldn't use one of my libraries because it was only "public domain" and didn't have the additional fallback clause, who asked if I could dual-license it under a traditional license. My answer: they can create a derivative work by modifying one character, and then license that however they like. (Indeed, *adding* the zlib or BSD license would be such a modification!) Unfortunately, their lawyers reportedly didn't like that answer. :( uTox/third_party/stb/stb/docs/other_libs.md0000600000175000001440000000006514003056224020013 0ustar rakusersMoved to https://github.com/nothings/single_file_libsuTox/third_party/stb/stb/deprecated/0000700000175000001440000000000014003056224016504 5ustar rakusersuTox/third_party/stb/stb/deprecated/stretchy_buffer.txt0000600000175000001440000000215114003056224022444 0ustar rakusers// stretchy buffer // init: NULL // free: sbfree() // push_back: sbpush() // size: sbcount() // #define sbfree(a) ((a) ? free(stb__sbraw(a)),0 : 0) #define sbpush(a,v) (stb__sbmaybegrow(a,1), (a)[stb__sbn(a)++] = (v)) #define sbcount(a) ((a) ? stb__sbn(a) : 0) #define sbadd(a,n) (stb__sbmaybegrow(a,n), stb__sbn(a)+=(n), &(a)[stb__sbn(a)-(n)]) #define sblast(a) ((a)[stb__sbn(a)-1]) #include #define stb__sbraw(a) ((int *) (a) - 2) #define stb__sbm(a) stb__sbraw(a)[0] #define stb__sbn(a) stb__sbraw(a)[1] #define stb__sbneedgrow(a,n) ((a)==0 || stb__sbn(a)+n >= stb__sbm(a)) #define stb__sbmaybegrow(a,n) (stb__sbneedgrow(a,(n)) ? stb__sbgrow(a,n) : 0) #define stb__sbgrow(a,n) stb__sbgrowf((void **) &(a), (n), sizeof(*(a))) static void stb__sbgrowf(void **arr, int increment, int itemsize) { int m = *arr ? 2*stb__sbm(*arr)+increment : increment+1; void *p = realloc(*arr ? stb__sbraw(*arr) : 0, itemsize * m + sizeof(int)*2); assert(p); if (p) { if (!*arr) ((int *) p)[1] = 0; *arr = (void *) ((int *) p + 2); stb__sbm(*arr) = m; } } uTox/third_party/stb/stb/deprecated/stb_image.c0000600000175000001440000044275714003056224020627 0ustar rakusers/* stb_image - v1.35 - public domain JPEG/PNG reader - http://nothings.org/stb_image.c when you control the images you're loading no warranty implied; use at your own risk QUICK NOTES: Primarily of interest to game developers and other people who can avoid problematic images and only need the trivial interface JPEG baseline (no JPEG progressive) PNG 8-bit-per-channel only TGA (not sure what subset, if a subset) BMP non-1bpp, non-RLE PSD (composited view only, no extra channels) GIF (*comp always reports as 4-channel) HDR (radiance rgbE format) PIC (Softimage PIC) - decode from memory or through FILE (define STBI_NO_STDIO to remove code) - decode from arbitrary I/O callbacks - overridable dequantizing-IDCT, YCbCr-to-RGB conversion (define STBI_SIMD) Latest revisions: 1.35 (2014-05-27) warnings, bugfixes, TGA optimization, etc 1.34 (unknown ) warning fix 1.33 (2011-07-14) minor fixes suggested by Dave Moore 1.32 (2011-07-13) info support for all filetypes (SpartanJ) 1.31 (2011-06-19) a few more leak fixes, bug in PNG handling (SpartanJ) 1.30 (2011-06-11) added ability to load files via io callbacks (Ben Wenger) 1.29 (2010-08-16) various warning fixes from Aurelien Pocheville 1.28 (2010-08-01) fix bug in GIF palette transparency (SpartanJ) See end of file for full revision history. TODO: stbi_info support for BMP,PSD,HDR,PIC ============================ Contributors ========================= Image formats Bug fixes & warning fixes Sean Barrett (jpeg, png, bmp) Marc LeBlanc Nicolas Schulz (hdr, psd) Christpher Lloyd Jonathan Dummer (tga) Dave Moore Jean-Marc Lienher (gif) Won Chun Tom Seddon (pic) the Horde3D community Thatcher Ulrich (psd) Janez Zemva Jonathan Blow Laurent Gomila Extensions, features Aruelien Pocheville Jetro Lauha (stbi_info) Ryamond Barbiero James "moose2000" Brown (iPhone PNG) David Woo Ben "Disch" Wenger (io callbacks) Roy Eltham Martin "SpartanJ" Golini Luke Graham Thomas Ruf John Bartholomew Optimizations & bugfixes Ken Hamada Fabian "ryg" Giesen Cort Stratton Arseny Kapoulkine Blazej Dariusz Roszkowski Thibault Reuille If your name should be here but Paul Du Bois isn't let Sean know. Guillaume George */ #ifndef STBI_INCLUDE_STB_IMAGE_H #define STBI_INCLUDE_STB_IMAGE_H // To get a header file for this, either cut and paste the header, // or create stb_image.h, #define STBI_HEADER_FILE_ONLY, and // then include stb_image.c from it. //// begin header file //////////////////////////////////////////////////// // // Limitations: // - no jpeg progressive support // - non-HDR formats support 8-bit samples only (jpeg, png) // - no delayed line count (jpeg) -- IJG doesn't support either // - no 1-bit BMP // - GIF always returns *comp=4 // // Basic usage (see HDR discussion below): // int x,y,n; // unsigned char *data = stbi_load(filename, &x, &y, &n, 0); // // ... process data if not NULL ... // // ... x = width, y = height, n = # 8-bit components per pixel ... // // ... replace '0' with '1'..'4' to force that many components per pixel // // ... but 'n' will always be the number that it would have been if you said 0 // stbi_image_free(data) // // Standard parameters: // int *x -- outputs image width in pixels // int *y -- outputs image height in pixels // int *comp -- outputs # of image components in image file // int req_comp -- if non-zero, # of image components requested in result // // The return value from an image loader is an 'unsigned char *' which points // to the pixel data. The pixel data consists of *y scanlines of *x pixels, // with each pixel consisting of N interleaved 8-bit components; the first // pixel pointed to is top-left-most in the image. There is no padding between // image scanlines or between pixels, regardless of format. The number of // components N is 'req_comp' if req_comp is non-zero, or *comp otherwise. // If req_comp is non-zero, *comp has the number of components that _would_ // have been output otherwise. E.g. if you set req_comp to 4, you will always // get RGBA output, but you can check *comp to easily see if it's opaque. // // An output image with N components has the following components interleaved // in this order in each pixel: // // N=#comp components // 1 grey // 2 grey, alpha // 3 red, green, blue // 4 red, green, blue, alpha // // If image loading fails for any reason, the return value will be NULL, // and *x, *y, *comp will be unchanged. The function stbi_failure_reason() // can be queried for an extremely brief, end-user unfriendly explanation // of why the load failed. Define STBI_NO_FAILURE_STRINGS to avoid // compiling these strings at all, and STBI_FAILURE_USERMSG to get slightly // more user-friendly ones. // // Paletted PNG, BMP, GIF, and PIC images are automatically depalettized. // // =========================================================================== // // iPhone PNG support: // // By default we convert iphone-formatted PNGs back to RGB; nominally they // would silently load as BGR, except the existing code should have just // failed on such iPhone PNGs. But you can disable this conversion by // by calling stbi_convert_iphone_png_to_rgb(0), in which case // you will always just get the native iphone "format" through. // // Call stbi_set_unpremultiply_on_load(1) as well to force a divide per // pixel to remove any premultiplied alpha *only* if the image file explicitly // says there's premultiplied data (currently only happens in iPhone images, // and only if iPhone convert-to-rgb processing is on). // // =========================================================================== // // HDR image support (disable by defining STBI_NO_HDR) // // stb_image now supports loading HDR images in general, and currently // the Radiance .HDR file format, although the support is provided // generically. You can still load any file through the existing interface; // if you attempt to load an HDR file, it will be automatically remapped to // LDR, assuming gamma 2.2 and an arbitrary scale factor defaulting to 1; // both of these constants can be reconfigured through this interface: // // stbi_hdr_to_ldr_gamma(2.2f); // stbi_hdr_to_ldr_scale(1.0f); // // (note, do not use _inverse_ constants; stbi_image will invert them // appropriately). // // Additionally, there is a new, parallel interface for loading files as // (linear) floats to preserve the full dynamic range: // // float *data = stbi_loadf(filename, &x, &y, &n, 0); // // If you load LDR images through this interface, those images will // be promoted to floating point values, run through the inverse of // constants corresponding to the above: // // stbi_ldr_to_hdr_scale(1.0f); // stbi_ldr_to_hdr_gamma(2.2f); // // Finally, given a filename (or an open file or memory block--see header // file for details) containing image data, you can query for the "most // appropriate" interface to use (that is, whether the image is HDR or // not), using: // // stbi_is_hdr(char *filename); // // =========================================================================== // // I/O callbacks // // I/O callbacks allow you to read from arbitrary sources, like packaged // files or some other source. Data read from callbacks are processed // through a small internal buffer (currently 128 bytes) to try to reduce // overhead. // // The three functions you must define are "read" (reads some bytes of data), // "skip" (skips some bytes of data), "eof" (reports if the stream is at the end). #ifndef STBI_NO_STDIO #if defined(_MSC_VER) && _MSC_VER >= 1400 #define _CRT_SECURE_NO_WARNINGS // suppress warnings about fopen() #pragma warning(push) #pragma warning(disable:4996) // suppress even more warnings about fopen() #endif #include #endif // STBI_NO_STDIO #define STBI_VERSION 1 enum { STBI_default = 0, // only used for req_comp STBI_grey = 1, STBI_grey_alpha = 2, STBI_rgb = 3, STBI_rgb_alpha = 4 }; typedef unsigned char stbi_uc; #ifdef __cplusplus extern "C" { #endif ////////////////////////////////////////////////////////////////////////////// // // PRIMARY API - works on images of any type // // // load image by filename, open file, or memory buffer // extern stbi_uc *stbi_load_from_memory(stbi_uc const *buffer, int len, int *x, int *y, int *comp, int req_comp); #ifndef STBI_NO_STDIO extern stbi_uc *stbi_load (char const *filename, int *x, int *y, int *comp, int req_comp); extern stbi_uc *stbi_load_from_file (FILE *f, int *x, int *y, int *comp, int req_comp); // for stbi_load_from_file, file pointer is left pointing immediately after image #endif typedef struct { int (*read) (void *user,char *data,int size); // fill 'data' with 'size' bytes. return number of bytes actually read void (*skip) (void *user,int n); // skip the next 'n' bytes, or 'unget' the last -n bytes if negative int (*eof) (void *user); // returns nonzero if we are at end of file/data } stbi_io_callbacks; extern stbi_uc *stbi_load_from_callbacks (stbi_io_callbacks const *clbk, void *user, int *x, int *y, int *comp, int req_comp); #ifndef STBI_NO_HDR extern float *stbi_loadf_from_memory(stbi_uc const *buffer, int len, int *x, int *y, int *comp, int req_comp); #ifndef STBI_NO_STDIO extern float *stbi_loadf (char const *filename, int *x, int *y, int *comp, int req_comp); extern float *stbi_loadf_from_file (FILE *f, int *x, int *y, int *comp, int req_comp); #endif extern float *stbi_loadf_from_callbacks (stbi_io_callbacks const *clbk, void *user, int *x, int *y, int *comp, int req_comp); extern void stbi_hdr_to_ldr_gamma(float gamma); extern void stbi_hdr_to_ldr_scale(float scale); extern void stbi_ldr_to_hdr_gamma(float gamma); extern void stbi_ldr_to_hdr_scale(float scale); #endif // STBI_NO_HDR // stbi_is_hdr is always defined extern int stbi_is_hdr_from_callbacks(stbi_io_callbacks const *clbk, void *user); extern int stbi_is_hdr_from_memory(stbi_uc const *buffer, int len); #ifndef STBI_NO_STDIO extern int stbi_is_hdr (char const *filename); extern int stbi_is_hdr_from_file(FILE *f); #endif // STBI_NO_STDIO // get a VERY brief reason for failure // NOT THREADSAFE extern const char *stbi_failure_reason (void); // free the loaded image -- this is just free() extern void stbi_image_free (void *retval_from_stbi_load); // get image dimensions & components without fully decoding extern int stbi_info_from_memory(stbi_uc const *buffer, int len, int *x, int *y, int *comp); extern int stbi_info_from_callbacks(stbi_io_callbacks const *clbk, void *user, int *x, int *y, int *comp); #ifndef STBI_NO_STDIO extern int stbi_info (char const *filename, int *x, int *y, int *comp); extern int stbi_info_from_file (FILE *f, int *x, int *y, int *comp); #endif // for image formats that explicitly notate that they have premultiplied alpha, // we just return the colors as stored in the file. set this flag to force // unpremultiplication. results are undefined if the unpremultiply overflow. extern void stbi_set_unpremultiply_on_load(int flag_true_if_should_unpremultiply); // indicate whether we should process iphone images back to canonical format, // or just pass them through "as-is" extern void stbi_convert_iphone_png_to_rgb(int flag_true_if_should_convert); // ZLIB client - used by PNG, available for other purposes extern char *stbi_zlib_decode_malloc_guesssize(const char *buffer, int len, int initial_size, int *outlen); extern char *stbi_zlib_decode_malloc_guesssize_headerflag(const char *buffer, int len, int initial_size, int *outlen, int parse_header); extern char *stbi_zlib_decode_malloc(const char *buffer, int len, int *outlen); extern int stbi_zlib_decode_buffer(char *obuffer, int olen, const char *ibuffer, int ilen); extern char *stbi_zlib_decode_noheader_malloc(const char *buffer, int len, int *outlen); extern int stbi_zlib_decode_noheader_buffer(char *obuffer, int olen, const char *ibuffer, int ilen); // define faster low-level operations (typically SIMD support) #ifdef STBI_SIMD typedef void (*stbi_idct_8x8)(stbi_uc *out, int out_stride, short data[64], unsigned short *dequantize); // compute an integer IDCT on "input" // input[x] = data[x] * dequantize[x] // write results to 'out': 64 samples, each run of 8 spaced by 'out_stride' // CLAMP results to 0..255 typedef void (*stbi_YCbCr_to_RGB_run)(stbi_uc *output, stbi_uc const *y, stbi_uc const *cb, stbi_uc const *cr, int count, int step); // compute a conversion from YCbCr to RGB // 'count' pixels // write pixels to 'output'; each pixel is 'step' bytes (either 3 or 4; if 4, write '255' as 4th), order R,G,B // y: Y input channel // cb: Cb input channel; scale/biased to be 0..255 // cr: Cr input channel; scale/biased to be 0..255 extern void stbi_install_idct(stbi_idct_8x8 func); extern void stbi_install_YCbCr_to_RGB(stbi_YCbCr_to_RGB_run func); #endif // STBI_SIMD #ifdef __cplusplus } #endif // // //// end header file ///////////////////////////////////////////////////// #endif // STBI_INCLUDE_STB_IMAGE_H #ifndef STBI_HEADER_FILE_ONLY #ifndef STBI_NO_HDR #include // ldexp #include // strcmp, strtok #endif #ifndef STBI_NO_STDIO #include #endif #include #include #include #include #include // ptrdiff_t on osx #ifndef _MSC_VER #ifdef __cplusplus #define stbi_inline inline #else #define stbi_inline #endif #else #define stbi_inline __forceinline #endif #ifdef _MSC_VER typedef unsigned char stbi__uint8; typedef unsigned short stbi__uint16; typedef signed short stbi__int16; typedef unsigned int stbi__uint32; typedef signed int stbi__int32; #else #include typedef uint8_t stbi__uint8; typedef uint16_t stbi__uint16; typedef int16_t stbi__int16; typedef uint32_t stbi__uint32; typedef int32_t stbi__int32; #endif // should produce compiler error if size is wrong typedef unsigned char validate_uint32[sizeof(stbi__uint32)==4 ? 1 : -1]; #ifdef _MSC_VER #define STBI_NOTUSED(v) (void)(v) #else #define STBI_NOTUSED(v) (void)sizeof(v) #endif #ifdef _MSC_VER #define STBI_HAS_LROTL #endif #ifdef STBI_HAS_LROTL #define stbi_lrot(x,y) _lrotl(x,y) #else #define stbi_lrot(x,y) (((x) << (y)) | ((x) >> (32 - (y)))) #endif /////////////////////////////////////////////// // // stbi struct and start_xxx functions // stbi structure is our basic context used by all images, so it // contains all the IO context, plus some basic image information typedef struct { stbi__uint32 img_x, img_y; int img_n, img_out_n; stbi_io_callbacks io; void *io_user_data; int read_from_callbacks; int buflen; stbi__uint8 buffer_start[128]; stbi__uint8 *img_buffer, *img_buffer_end; stbi__uint8 *img_buffer_original; } stbi; static void refill_buffer(stbi *s); // initialize a memory-decode context static void start_mem(stbi *s, stbi__uint8 const *buffer, int len) { s->io.read = NULL; s->read_from_callbacks = 0; s->img_buffer = s->img_buffer_original = (stbi__uint8 *) buffer; s->img_buffer_end = (stbi__uint8 *) buffer+len; } // initialize a callback-based context static void start_callbacks(stbi *s, stbi_io_callbacks *c, void *user) { s->io = *c; s->io_user_data = user; s->buflen = sizeof(s->buffer_start); s->read_from_callbacks = 1; s->img_buffer_original = s->buffer_start; refill_buffer(s); } #ifndef STBI_NO_STDIO static int stdio_read(void *user, char *data, int size) { return (int) fread(data,1,size,(FILE*) user); } static void stdio_skip(void *user, int n) { fseek((FILE*) user, n, SEEK_CUR); } static int stdio_eof(void *user) { return feof((FILE*) user); } static stbi_io_callbacks stbi_stdio_callbacks = { stdio_read, stdio_skip, stdio_eof, }; static void start_file(stbi *s, FILE *f) { start_callbacks(s, &stbi_stdio_callbacks, (void *) f); } //static void stop_file(stbi *s) { } #endif // !STBI_NO_STDIO static void stbi_rewind(stbi *s) { // conceptually rewind SHOULD rewind to the beginning of the stream, // but we just rewind to the beginning of the initial buffer, because // we only use it after doing 'test', which only ever looks at at most 92 bytes s->img_buffer = s->img_buffer_original; } static int stbi_jpeg_test(stbi *s); static stbi_uc *stbi_jpeg_load(stbi *s, int *x, int *y, int *comp, int req_comp); static int stbi_jpeg_info(stbi *s, int *x, int *y, int *comp); static int stbi_png_test(stbi *s); static stbi_uc *stbi_png_load(stbi *s, int *x, int *y, int *comp, int req_comp); static int stbi_png_info(stbi *s, int *x, int *y, int *comp); static int stbi_bmp_test(stbi *s); static stbi_uc *stbi_bmp_load(stbi *s, int *x, int *y, int *comp, int req_comp); static int stbi_tga_test(stbi *s); static stbi_uc *stbi_tga_load(stbi *s, int *x, int *y, int *comp, int req_comp); static int stbi_tga_info(stbi *s, int *x, int *y, int *comp); static int stbi_psd_test(stbi *s); static stbi_uc *stbi_psd_load(stbi *s, int *x, int *y, int *comp, int req_comp); #ifndef STBI_NO_HDR static int stbi_hdr_test(stbi *s); static float *stbi_hdr_load(stbi *s, int *x, int *y, int *comp, int req_comp); #endif static int stbi_pic_test(stbi *s); static stbi_uc *stbi_pic_load(stbi *s, int *x, int *y, int *comp, int req_comp); static int stbi_gif_test(stbi *s); static stbi_uc *stbi_gif_load(stbi *s, int *x, int *y, int *comp, int req_comp); static int stbi_gif_info(stbi *s, int *x, int *y, int *comp); // this is not threadsafe static const char *failure_reason; const char *stbi_failure_reason(void) { return failure_reason; } static int e(const char *str) { failure_reason = str; return 0; } // e - error // epf - error returning pointer to float // epuc - error returning pointer to unsigned char #ifdef STBI_NO_FAILURE_STRINGS #define e(x,y) 0 #elif defined(STBI_FAILURE_USERMSG) #define e(x,y) e(y) #else #define e(x,y) e(x) #endif #define epf(x,y) ((float *) (e(x,y)?NULL:NULL)) #define epuc(x,y) ((unsigned char *) (e(x,y)?NULL:NULL)) void stbi_image_free(void *retval_from_stbi_load) { free(retval_from_stbi_load); } #ifndef STBI_NO_HDR static float *ldr_to_hdr(stbi_uc *data, int x, int y, int comp); static stbi_uc *hdr_to_ldr(float *data, int x, int y, int comp); #endif static unsigned char *stbi_load_main(stbi *s, int *x, int *y, int *comp, int req_comp) { if (stbi_jpeg_test(s)) return stbi_jpeg_load(s,x,y,comp,req_comp); if (stbi_png_test(s)) return stbi_png_load(s,x,y,comp,req_comp); if (stbi_bmp_test(s)) return stbi_bmp_load(s,x,y,comp,req_comp); if (stbi_gif_test(s)) return stbi_gif_load(s,x,y,comp,req_comp); if (stbi_psd_test(s)) return stbi_psd_load(s,x,y,comp,req_comp); if (stbi_pic_test(s)) return stbi_pic_load(s,x,y,comp,req_comp); #ifndef STBI_NO_HDR if (stbi_hdr_test(s)) { float *hdr = stbi_hdr_load(s, x,y,comp,req_comp); return hdr_to_ldr(hdr, *x, *y, req_comp ? req_comp : *comp); } #endif // test tga last because it's a crappy test! if (stbi_tga_test(s)) return stbi_tga_load(s,x,y,comp,req_comp); return epuc("unknown image type", "Image not of any known type, or corrupt"); } #ifndef STBI_NO_STDIO unsigned char *stbi_load(char const *filename, int *x, int *y, int *comp, int req_comp) { FILE *f = fopen(filename, "rb"); unsigned char *result; if (!f) return epuc("can't fopen", "Unable to open file"); result = stbi_load_from_file(f,x,y,comp,req_comp); fclose(f); return result; } unsigned char *stbi_load_from_file(FILE *f, int *x, int *y, int *comp, int req_comp) { unsigned char *result; stbi s; start_file(&s,f); result = stbi_load_main(&s,x,y,comp,req_comp); if (result) { // need to 'unget' all the characters in the IO buffer fseek(f, - (int) (s.img_buffer_end - s.img_buffer), SEEK_CUR); } return result; } #endif //!STBI_NO_STDIO unsigned char *stbi_load_from_memory(stbi_uc const *buffer, int len, int *x, int *y, int *comp, int req_comp) { stbi s; start_mem(&s,buffer,len); return stbi_load_main(&s,x,y,comp,req_comp); } unsigned char *stbi_load_from_callbacks(stbi_io_callbacks const *clbk, void *user, int *x, int *y, int *comp, int req_comp) { stbi s; start_callbacks(&s, (stbi_io_callbacks *) clbk, user); return stbi_load_main(&s,x,y,comp,req_comp); } #ifndef STBI_NO_HDR float *stbi_loadf_main(stbi *s, int *x, int *y, int *comp, int req_comp) { unsigned char *data; #ifndef STBI_NO_HDR if (stbi_hdr_test(s)) return stbi_hdr_load(s,x,y,comp,req_comp); #endif data = stbi_load_main(s, x, y, comp, req_comp); if (data) return ldr_to_hdr(data, *x, *y, req_comp ? req_comp : *comp); return epf("unknown image type", "Image not of any known type, or corrupt"); } float *stbi_loadf_from_memory(stbi_uc const *buffer, int len, int *x, int *y, int *comp, int req_comp) { stbi s; start_mem(&s,buffer,len); return stbi_loadf_main(&s,x,y,comp,req_comp); } float *stbi_loadf_from_callbacks(stbi_io_callbacks const *clbk, void *user, int *x, int *y, int *comp, int req_comp) { stbi s; start_callbacks(&s, (stbi_io_callbacks *) clbk, user); return stbi_loadf_main(&s,x,y,comp,req_comp); } #ifndef STBI_NO_STDIO float *stbi_loadf(char const *filename, int *x, int *y, int *comp, int req_comp) { FILE *f = fopen(filename, "rb"); float *result; if (!f) return epf("can't fopen", "Unable to open file"); result = stbi_loadf_from_file(f,x,y,comp,req_comp); fclose(f); return result; } float *stbi_loadf_from_file(FILE *f, int *x, int *y, int *comp, int req_comp) { stbi s; start_file(&s,f); return stbi_loadf_main(&s,x,y,comp,req_comp); } #endif // !STBI_NO_STDIO #endif // !STBI_NO_HDR // these is-hdr-or-not is defined independent of whether STBI_NO_HDR is // defined, for API simplicity; if STBI_NO_HDR is defined, it always // reports false! int stbi_is_hdr_from_memory(stbi_uc const *buffer, int len) { #ifndef STBI_NO_HDR stbi s; start_mem(&s,buffer,len); return stbi_hdr_test(&s); #else STBI_NOTUSED(buffer); STBI_NOTUSED(len); return 0; #endif } #ifndef STBI_NO_STDIO extern int stbi_is_hdr (char const *filename) { FILE *f = fopen(filename, "rb"); int result=0; if (f) { result = stbi_is_hdr_from_file(f); fclose(f); } return result; } extern int stbi_is_hdr_from_file(FILE *f) { #ifndef STBI_NO_HDR stbi s; start_file(&s,f); return stbi_hdr_test(&s); #else return 0; #endif } #endif // !STBI_NO_STDIO extern int stbi_is_hdr_from_callbacks(stbi_io_callbacks const *clbk, void *user) { #ifndef STBI_NO_HDR stbi s; start_callbacks(&s, (stbi_io_callbacks *) clbk, user); return stbi_hdr_test(&s); #else return 0; #endif } #ifndef STBI_NO_HDR static float h2l_gamma_i=1.0f/2.2f, h2l_scale_i=1.0f; static float l2h_gamma=2.2f, l2h_scale=1.0f; void stbi_hdr_to_ldr_gamma(float gamma) { h2l_gamma_i = 1/gamma; } void stbi_hdr_to_ldr_scale(float scale) { h2l_scale_i = 1/scale; } void stbi_ldr_to_hdr_gamma(float gamma) { l2h_gamma = gamma; } void stbi_ldr_to_hdr_scale(float scale) { l2h_scale = scale; } #endif ////////////////////////////////////////////////////////////////////////////// // // Common code used by all image loaders // enum { SCAN_load=0, SCAN_type, SCAN_header }; static void refill_buffer(stbi *s) { int n = (s->io.read)(s->io_user_data,(char*)s->buffer_start,s->buflen); if (n == 0) { // at end of file, treat same as if from memory, but need to handle case // where s->img_buffer isn't pointing to safe memory, e.g. 0-byte file s->read_from_callbacks = 0; s->img_buffer = s->buffer_start; s->img_buffer_end = s->buffer_start+1; *s->img_buffer = 0; } else { s->img_buffer = s->buffer_start; s->img_buffer_end = s->buffer_start + n; } } stbi_inline static int get8(stbi *s) { if (s->img_buffer < s->img_buffer_end) return *s->img_buffer++; if (s->read_from_callbacks) { refill_buffer(s); return *s->img_buffer++; } return 0; } stbi_inline static int at_eof(stbi *s) { if (s->io.read) { if (!(s->io.eof)(s->io_user_data)) return 0; // if feof() is true, check if buffer = end // special case: we've only got the special 0 character at the end if (s->read_from_callbacks == 0) return 1; } return s->img_buffer >= s->img_buffer_end; } stbi_inline static stbi__uint8 get8u(stbi *s) { return (stbi__uint8) get8(s); } static void skip(stbi *s, int n) { if (s->io.read) { int blen = (int) (s->img_buffer_end - s->img_buffer); if (blen < n) { s->img_buffer = s->img_buffer_end; (s->io.skip)(s->io_user_data, n - blen); return; } } s->img_buffer += n; } static int getn(stbi *s, stbi_uc *buffer, int n) { if (s->io.read) { int blen = (int) (s->img_buffer_end - s->img_buffer); if (blen < n) { int res, count; memcpy(buffer, s->img_buffer, blen); count = (s->io.read)(s->io_user_data, (char*) buffer + blen, n - blen); res = (count == (n-blen)); s->img_buffer = s->img_buffer_end; return res; } } if (s->img_buffer+n <= s->img_buffer_end) { memcpy(buffer, s->img_buffer, n); s->img_buffer += n; return 1; } else return 0; } static int get16(stbi *s) { int z = get8(s); return (z << 8) + get8(s); } static stbi__uint32 get32(stbi *s) { stbi__uint32 z = get16(s); return (z << 16) + get16(s); } static int get16le(stbi *s) { int z = get8(s); return z + (get8(s) << 8); } static stbi__uint32 get32le(stbi *s) { stbi__uint32 z = get16le(s); return z + (get16le(s) << 16); } ////////////////////////////////////////////////////////////////////////////// // // generic converter from built-in img_n to req_comp // individual types do this automatically as much as possible (e.g. jpeg // does all cases internally since it needs to colorspace convert anyway, // and it never has alpha, so very few cases ). png can automatically // interleave an alpha=255 channel, but falls back to this for other cases // // assume data buffer is malloced, so malloc a new one and free that one // only failure mode is malloc failing static stbi__uint8 compute_y(int r, int g, int b) { return (stbi__uint8) (((r*77) + (g*150) + (29*b)) >> 8); } static unsigned char *convert_format(unsigned char *data, int img_n, int req_comp, unsigned int x, unsigned int y) { int i,j; unsigned char *good; if (req_comp == img_n) return data; assert(req_comp >= 1 && req_comp <= 4); good = (unsigned char *) malloc(req_comp * x * y); if (good == NULL) { free(data); return epuc("outofmem", "Out of memory"); } for (j=0; j < (int) y; ++j) { unsigned char *src = data + j * x * img_n ; unsigned char *dest = good + j * x * req_comp; #define COMBO(a,b) ((a)*8+(b)) #define CASE(a,b) case COMBO(a,b): for(i=x-1; i >= 0; --i, src += a, dest += b) // convert source image with img_n components to one with req_comp components; // avoid switch per pixel, so use switch per scanline and massive macros switch (COMBO(img_n, req_comp)) { CASE(1,2) dest[0]=src[0], dest[1]=255; break; CASE(1,3) dest[0]=dest[1]=dest[2]=src[0]; break; CASE(1,4) dest[0]=dest[1]=dest[2]=src[0], dest[3]=255; break; CASE(2,1) dest[0]=src[0]; break; CASE(2,3) dest[0]=dest[1]=dest[2]=src[0]; break; CASE(2,4) dest[0]=dest[1]=dest[2]=src[0], dest[3]=src[1]; break; CASE(3,4) dest[0]=src[0],dest[1]=src[1],dest[2]=src[2],dest[3]=255; break; CASE(3,1) dest[0]=compute_y(src[0],src[1],src[2]); break; CASE(3,2) dest[0]=compute_y(src[0],src[1],src[2]), dest[1] = 255; break; CASE(4,1) dest[0]=compute_y(src[0],src[1],src[2]); break; CASE(4,2) dest[0]=compute_y(src[0],src[1],src[2]), dest[1] = src[3]; break; CASE(4,3) dest[0]=src[0],dest[1]=src[1],dest[2]=src[2]; break; default: assert(0); } #undef CASE } free(data); return good; } #ifndef STBI_NO_HDR static float *ldr_to_hdr(stbi_uc *data, int x, int y, int comp) { int i,k,n; float *output = (float *) malloc(x * y * comp * sizeof(float)); if (output == NULL) { free(data); return epf("outofmem", "Out of memory"); } // compute number of non-alpha components if (comp & 1) n = comp; else n = comp-1; for (i=0; i < x*y; ++i) { for (k=0; k < n; ++k) { output[i*comp + k] = (float) pow(data[i*comp+k]/255.0f, l2h_gamma) * l2h_scale; } if (k < comp) output[i*comp + k] = data[i*comp+k]/255.0f; } free(data); return output; } #define float2int(x) ((int) (x)) static stbi_uc *hdr_to_ldr(float *data, int x, int y, int comp) { int i,k,n; stbi_uc *output = (stbi_uc *) malloc(x * y * comp); if (output == NULL) { free(data); return epuc("outofmem", "Out of memory"); } // compute number of non-alpha components if (comp & 1) n = comp; else n = comp-1; for (i=0; i < x*y; ++i) { for (k=0; k < n; ++k) { float z = (float) pow(data[i*comp+k]*h2l_scale_i, h2l_gamma_i) * 255 + 0.5f; if (z < 0) z = 0; if (z > 255) z = 255; output[i*comp + k] = (stbi__uint8) float2int(z); } if (k < comp) { float z = data[i*comp+k] * 255 + 0.5f; if (z < 0) z = 0; if (z > 255) z = 255; output[i*comp + k] = (stbi__uint8) float2int(z); } } free(data); return output; } #endif ////////////////////////////////////////////////////////////////////////////// // // "baseline" JPEG/JFIF decoder (not actually fully baseline implementation) // // simple implementation // - channel subsampling of at most 2 in each dimension // - doesn't support delayed output of y-dimension // - simple interface (only one output format: 8-bit interleaved RGB) // - doesn't try to recover corrupt jpegs // - doesn't allow partial loading, loading multiple at once // - still fast on x86 (copying globals into locals doesn't help x86) // - allocates lots of intermediate memory (full size of all components) // - non-interleaved case requires this anyway // - allows good upsampling (see next) // high-quality // - upsampled channels are bilinearly interpolated, even across blocks // - quality integer IDCT derived from IJG's 'slow' // performance // - fast huffman; reasonable integer IDCT // - uses a lot of intermediate memory, could cache poorly // - load http://nothings.org/remote/anemones.jpg 3 times on 2.8Ghz P4 // stb_jpeg: 1.34 seconds (MSVC6, default release build) // stb_jpeg: 1.06 seconds (MSVC6, processor = Pentium Pro) // IJL11.dll: 1.08 seconds (compiled by intel) // IJG 1998: 0.98 seconds (MSVC6, makefile provided by IJG) // IJG 1998: 0.95 seconds (MSVC6, makefile + proc=PPro) // huffman decoding acceleration #define FAST_BITS 9 // larger handles more cases; smaller stomps less cache typedef struct { stbi__uint8 fast[1 << FAST_BITS]; // weirdly, repacking this into AoS is a 10% speed loss, instead of a win stbi__uint16 code[256]; stbi__uint8 values[256]; stbi__uint8 size[257]; unsigned int maxcode[18]; int delta[17]; // old 'firstsymbol' - old 'firstcode' } huffman; typedef struct { #ifdef STBI_SIMD unsigned short dequant2[4][64]; #endif stbi *s; huffman huff_dc[4]; huffman huff_ac[4]; stbi__uint8 dequant[4][64]; // sizes for components, interleaved MCUs int img_h_max, img_v_max; int img_mcu_x, img_mcu_y; int img_mcu_w, img_mcu_h; // definition of jpeg image component struct { int id; int h,v; int tq; int hd,ha; int dc_pred; int x,y,w2,h2; stbi__uint8 *data; void *raw_data; stbi__uint8 *linebuf; } img_comp[4]; stbi__uint32 code_buffer; // jpeg entropy-coded buffer int code_bits; // number of valid bits unsigned char marker; // marker seen while filling entropy buffer int nomore; // flag if we saw a marker so must stop int scan_n, order[4]; int restart_interval, todo; } jpeg; static int build_huffman(huffman *h, int *count) { int i,j,k=0,code; // build size list for each symbol (from JPEG spec) for (i=0; i < 16; ++i) for (j=0; j < count[i]; ++j) h->size[k++] = (stbi__uint8) (i+1); h->size[k] = 0; // compute actual symbols (from jpeg spec) code = 0; k = 0; for(j=1; j <= 16; ++j) { // compute delta to add to code to compute symbol id h->delta[j] = k - code; if (h->size[k] == j) { while (h->size[k] == j) h->code[k++] = (stbi__uint16) (code++); if (code-1 >= (1 << j)) return e("bad code lengths","Corrupt JPEG"); } // compute largest code + 1 for this size, preshifted as needed later h->maxcode[j] = code << (16-j); code <<= 1; } h->maxcode[j] = 0xffffffff; // build non-spec acceleration table; 255 is flag for not-accelerated memset(h->fast, 255, 1 << FAST_BITS); for (i=0; i < k; ++i) { int s = h->size[i]; if (s <= FAST_BITS) { int c = h->code[i] << (FAST_BITS-s); int m = 1 << (FAST_BITS-s); for (j=0; j < m; ++j) { h->fast[c+j] = (stbi__uint8) i; } } } return 1; } static void grow_buffer_unsafe(jpeg *j) { do { int b = j->nomore ? 0 : get8(j->s); if (b == 0xff) { int c = get8(j->s); if (c != 0) { j->marker = (unsigned char) c; j->nomore = 1; return; } } j->code_buffer |= b << (24 - j->code_bits); j->code_bits += 8; } while (j->code_bits <= 24); } // (1 << n) - 1 static stbi__uint32 bmask[17]={0,1,3,7,15,31,63,127,255,511,1023,2047,4095,8191,16383,32767,65535}; // decode a jpeg huffman value from the bitstream stbi_inline static int decode(jpeg *j, huffman *h) { unsigned int temp; int c,k; if (j->code_bits < 16) grow_buffer_unsafe(j); // look at the top FAST_BITS and determine what symbol ID it is, // if the code is <= FAST_BITS c = (j->code_buffer >> (32 - FAST_BITS)) & ((1 << FAST_BITS)-1); k = h->fast[c]; if (k < 255) { int s = h->size[k]; if (s > j->code_bits) return -1; j->code_buffer <<= s; j->code_bits -= s; return h->values[k]; } // naive test is to shift the code_buffer down so k bits are // valid, then test against maxcode. To speed this up, we've // preshifted maxcode left so that it has (16-k) 0s at the // end; in other words, regardless of the number of bits, it // wants to be compared against something shifted to have 16; // that way we don't need to shift inside the loop. temp = j->code_buffer >> 16; for (k=FAST_BITS+1 ; ; ++k) if (temp < h->maxcode[k]) break; if (k == 17) { // error! code not found j->code_bits -= 16; return -1; } if (k > j->code_bits) return -1; // convert the huffman code to the symbol id c = ((j->code_buffer >> (32 - k)) & bmask[k]) + h->delta[k]; assert((((j->code_buffer) >> (32 - h->size[c])) & bmask[h->size[c]]) == h->code[c]); // convert the id to a symbol j->code_bits -= k; j->code_buffer <<= k; return h->values[c]; } // combined JPEG 'receive' and JPEG 'extend', since baseline // always extends everything it receives. stbi_inline static int extend_receive(jpeg *j, int n) { unsigned int m = 1 << (n-1); unsigned int k; if (j->code_bits < n) grow_buffer_unsafe(j); #if 1 k = stbi_lrot(j->code_buffer, n); j->code_buffer = k & ~bmask[n]; k &= bmask[n]; j->code_bits -= n; #else k = (j->code_buffer >> (32 - n)) & bmask[n]; j->code_bits -= n; j->code_buffer <<= n; #endif // the following test is probably a random branch that won't // predict well. I tried to table accelerate it but failed. // maybe it's compiling as a conditional move? if (k < m) return (-1 << n) + k + 1; else return k; } // given a value that's at position X in the zigzag stream, // where does it appear in the 8x8 matrix coded as row-major? static stbi__uint8 dezigzag[64+15] = { 0, 1, 8, 16, 9, 2, 3, 10, 17, 24, 32, 25, 18, 11, 4, 5, 12, 19, 26, 33, 40, 48, 41, 34, 27, 20, 13, 6, 7, 14, 21, 28, 35, 42, 49, 56, 57, 50, 43, 36, 29, 22, 15, 23, 30, 37, 44, 51, 58, 59, 52, 45, 38, 31, 39, 46, 53, 60, 61, 54, 47, 55, 62, 63, // let corrupt input sample past end 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63 }; // decode one 64-entry block-- static int decode_block(jpeg *j, short data[64], huffman *hdc, huffman *hac, int b) { int diff,dc,k; int t = decode(j, hdc); if (t < 0) return e("bad huffman code","Corrupt JPEG"); // 0 all the ac values now so we can do it 32-bits at a time memset(data,0,64*sizeof(data[0])); diff = t ? extend_receive(j, t) : 0; dc = j->img_comp[b].dc_pred + diff; j->img_comp[b].dc_pred = dc; data[0] = (short) dc; // decode AC components, see JPEG spec k = 1; do { int r,s; int rs = decode(j, hac); if (rs < 0) return e("bad huffman code","Corrupt JPEG"); s = rs & 15; r = rs >> 4; if (s == 0) { if (rs != 0xf0) break; // end block k += 16; } else { k += r; // decode into unzigzag'd location data[dezigzag[k++]] = (short) extend_receive(j,s); } } while (k < 64); return 1; } // take a -128..127 value and clamp it and convert to 0..255 stbi_inline static stbi__uint8 clamp(int x) { // trick to use a single test to catch both cases if ((unsigned int) x > 255) { if (x < 0) return 0; if (x > 255) return 255; } return (stbi__uint8) x; } #define f2f(x) (int) (((x) * 4096 + 0.5)) #define fsh(x) ((x) << 12) // derived from jidctint -- DCT_ISLOW #define IDCT_1D(s0,s1,s2,s3,s4,s5,s6,s7) \ int t0,t1,t2,t3,p1,p2,p3,p4,p5,x0,x1,x2,x3; \ p2 = s2; \ p3 = s6; \ p1 = (p2+p3) * f2f(0.5411961f); \ t2 = p1 + p3*f2f(-1.847759065f); \ t3 = p1 + p2*f2f( 0.765366865f); \ p2 = s0; \ p3 = s4; \ t0 = fsh(p2+p3); \ t1 = fsh(p2-p3); \ x0 = t0+t3; \ x3 = t0-t3; \ x1 = t1+t2; \ x2 = t1-t2; \ t0 = s7; \ t1 = s5; \ t2 = s3; \ t3 = s1; \ p3 = t0+t2; \ p4 = t1+t3; \ p1 = t0+t3; \ p2 = t1+t2; \ p5 = (p3+p4)*f2f( 1.175875602f); \ t0 = t0*f2f( 0.298631336f); \ t1 = t1*f2f( 2.053119869f); \ t2 = t2*f2f( 3.072711026f); \ t3 = t3*f2f( 1.501321110f); \ p1 = p5 + p1*f2f(-0.899976223f); \ p2 = p5 + p2*f2f(-2.562915447f); \ p3 = p3*f2f(-1.961570560f); \ p4 = p4*f2f(-0.390180644f); \ t3 += p1+p4; \ t2 += p2+p3; \ t1 += p2+p4; \ t0 += p1+p3; #ifdef STBI_SIMD typedef unsigned short stbi_dequantize_t; #else typedef stbi__uint8 stbi_dequantize_t; #endif // .344 seconds on 3*anemones.jpg static void idct_block(stbi__uint8 *out, int out_stride, short data[64], stbi_dequantize_t *dequantize) { int i,val[64],*v=val; stbi_dequantize_t *dq = dequantize; stbi__uint8 *o; short *d = data; // columns for (i=0; i < 8; ++i,++d,++dq, ++v) { // if all zeroes, shortcut -- this avoids dequantizing 0s and IDCTing if (d[ 8]==0 && d[16]==0 && d[24]==0 && d[32]==0 && d[40]==0 && d[48]==0 && d[56]==0) { // no shortcut 0 seconds // (1|2|3|4|5|6|7)==0 0 seconds // all separate -0.047 seconds // 1 && 2|3 && 4|5 && 6|7: -0.047 seconds int dcterm = d[0] * dq[0] << 2; v[0] = v[8] = v[16] = v[24] = v[32] = v[40] = v[48] = v[56] = dcterm; } else { IDCT_1D(d[ 0]*dq[ 0],d[ 8]*dq[ 8],d[16]*dq[16],d[24]*dq[24], d[32]*dq[32],d[40]*dq[40],d[48]*dq[48],d[56]*dq[56]) // constants scaled things up by 1<<12; let's bring them back // down, but keep 2 extra bits of precision x0 += 512; x1 += 512; x2 += 512; x3 += 512; v[ 0] = (x0+t3) >> 10; v[56] = (x0-t3) >> 10; v[ 8] = (x1+t2) >> 10; v[48] = (x1-t2) >> 10; v[16] = (x2+t1) >> 10; v[40] = (x2-t1) >> 10; v[24] = (x3+t0) >> 10; v[32] = (x3-t0) >> 10; } } for (i=0, v=val, o=out; i < 8; ++i,v+=8,o+=out_stride) { // no fast case since the first 1D IDCT spread components out IDCT_1D(v[0],v[1],v[2],v[3],v[4],v[5],v[6],v[7]) // constants scaled things up by 1<<12, plus we had 1<<2 from first // loop, plus horizontal and vertical each scale by sqrt(8) so together // we've got an extra 1<<3, so 1<<17 total we need to remove. // so we want to round that, which means adding 0.5 * 1<<17, // aka 65536. Also, we'll end up with -128 to 127 that we want // to encode as 0..255 by adding 128, so we'll add that before the shift x0 += 65536 + (128<<17); x1 += 65536 + (128<<17); x2 += 65536 + (128<<17); x3 += 65536 + (128<<17); // tried computing the shifts into temps, or'ing the temps to see // if any were out of range, but that was slower o[0] = clamp((x0+t3) >> 17); o[7] = clamp((x0-t3) >> 17); o[1] = clamp((x1+t2) >> 17); o[6] = clamp((x1-t2) >> 17); o[2] = clamp((x2+t1) >> 17); o[5] = clamp((x2-t1) >> 17); o[3] = clamp((x3+t0) >> 17); o[4] = clamp((x3-t0) >> 17); } } #ifdef STBI_SIMD static stbi_idct_8x8 stbi_idct_installed = idct_block; void stbi_install_idct(stbi_idct_8x8 func) { stbi_idct_installed = func; } #endif #define MARKER_none 0xff // if there's a pending marker from the entropy stream, return that // otherwise, fetch from the stream and get a marker. if there's no // marker, return 0xff, which is never a valid marker value static stbi__uint8 get_marker(jpeg *j) { stbi__uint8 x; if (j->marker != MARKER_none) { x = j->marker; j->marker = MARKER_none; return x; } x = get8u(j->s); if (x != 0xff) return MARKER_none; while (x == 0xff) x = get8u(j->s); return x; } // in each scan, we'll have scan_n components, and the order // of the components is specified by order[] #define RESTART(x) ((x) >= 0xd0 && (x) <= 0xd7) // after a restart interval, reset the entropy decoder and // the dc prediction static void reset(jpeg *j) { j->code_bits = 0; j->code_buffer = 0; j->nomore = 0; j->img_comp[0].dc_pred = j->img_comp[1].dc_pred = j->img_comp[2].dc_pred = 0; j->marker = MARKER_none; j->todo = j->restart_interval ? j->restart_interval : 0x7fffffff; // no more than 1<<31 MCUs if no restart_interal? that's plenty safe, // since we don't even allow 1<<30 pixels } static int parse_entropy_coded_data(jpeg *z) { reset(z); if (z->scan_n == 1) { int i,j; #ifdef STBI_SIMD __declspec(align(16)) #endif short data[64]; int n = z->order[0]; // non-interleaved data, we just need to process one block at a time, // in trivial scanline order // number of blocks to do just depends on how many actual "pixels" this // component has, independent of interleaved MCU blocking and such int w = (z->img_comp[n].x+7) >> 3; int h = (z->img_comp[n].y+7) >> 3; for (j=0; j < h; ++j) { for (i=0; i < w; ++i) { if (!decode_block(z, data, z->huff_dc+z->img_comp[n].hd, z->huff_ac+z->img_comp[n].ha, n)) return 0; #ifdef STBI_SIMD stbi_idct_installed(z->img_comp[n].data+z->img_comp[n].w2*j*8+i*8, z->img_comp[n].w2, data, z->dequant2[z->img_comp[n].tq]); #else idct_block(z->img_comp[n].data+z->img_comp[n].w2*j*8+i*8, z->img_comp[n].w2, data, z->dequant[z->img_comp[n].tq]); #endif // every data block is an MCU, so countdown the restart interval if (--z->todo <= 0) { if (z->code_bits < 24) grow_buffer_unsafe(z); // if it's NOT a restart, then just bail, so we get corrupt data // rather than no data if (!RESTART(z->marker)) return 1; reset(z); } } } } else { // interleaved! int i,j,k,x,y; short data[64]; for (j=0; j < z->img_mcu_y; ++j) { for (i=0; i < z->img_mcu_x; ++i) { // scan an interleaved mcu... process scan_n components in order for (k=0; k < z->scan_n; ++k) { int n = z->order[k]; // scan out an mcu's worth of this component; that's just determined // by the basic H and V specified for the component for (y=0; y < z->img_comp[n].v; ++y) { for (x=0; x < z->img_comp[n].h; ++x) { int x2 = (i*z->img_comp[n].h + x)*8; int y2 = (j*z->img_comp[n].v + y)*8; if (!decode_block(z, data, z->huff_dc+z->img_comp[n].hd, z->huff_ac+z->img_comp[n].ha, n)) return 0; #ifdef STBI_SIMD stbi_idct_installed(z->img_comp[n].data+z->img_comp[n].w2*y2+x2, z->img_comp[n].w2, data, z->dequant2[z->img_comp[n].tq]); #else idct_block(z->img_comp[n].data+z->img_comp[n].w2*y2+x2, z->img_comp[n].w2, data, z->dequant[z->img_comp[n].tq]); #endif } } } // after all interleaved components, that's an interleaved MCU, // so now count down the restart interval if (--z->todo <= 0) { if (z->code_bits < 24) grow_buffer_unsafe(z); // if it's NOT a restart, then just bail, so we get corrupt data // rather than no data if (!RESTART(z->marker)) return 1; reset(z); } } } } return 1; } static int process_marker(jpeg *z, int m) { int L; switch (m) { case MARKER_none: // no marker found return e("expected marker","Corrupt JPEG"); case 0xC2: // SOF - progressive return e("progressive jpeg","JPEG format not supported (progressive)"); case 0xDD: // DRI - specify restart interval if (get16(z->s) != 4) return e("bad DRI len","Corrupt JPEG"); z->restart_interval = get16(z->s); return 1; case 0xDB: // DQT - define quantization table L = get16(z->s)-2; while (L > 0) { int q = get8(z->s); int p = q >> 4; int t = q & 15,i; if (p != 0) return e("bad DQT type","Corrupt JPEG"); if (t > 3) return e("bad DQT table","Corrupt JPEG"); for (i=0; i < 64; ++i) z->dequant[t][dezigzag[i]] = get8u(z->s); #ifdef STBI_SIMD for (i=0; i < 64; ++i) z->dequant2[t][i] = z->dequant[t][i]; #endif L -= 65; } return L==0; case 0xC4: // DHT - define huffman table L = get16(z->s)-2; while (L > 0) { stbi__uint8 *v; int sizes[16],i,n=0; int q = get8(z->s); int tc = q >> 4; int th = q & 15; if (tc > 1 || th > 3) return e("bad DHT header","Corrupt JPEG"); for (i=0; i < 16; ++i) { sizes[i] = get8(z->s); n += sizes[i]; } L -= 17; if (tc == 0) { if (!build_huffman(z->huff_dc+th, sizes)) return 0; v = z->huff_dc[th].values; } else { if (!build_huffman(z->huff_ac+th, sizes)) return 0; v = z->huff_ac[th].values; } for (i=0; i < n; ++i) v[i] = get8u(z->s); L -= n; } return L==0; } // check for comment block or APP blocks if ((m >= 0xE0 && m <= 0xEF) || m == 0xFE) { skip(z->s, get16(z->s)-2); return 1; } return 0; } // after we see SOS static int process_scan_header(jpeg *z) { int i; int Ls = get16(z->s); z->scan_n = get8(z->s); if (z->scan_n < 1 || z->scan_n > 4 || z->scan_n > (int) z->s->img_n) return e("bad SOS component count","Corrupt JPEG"); if (Ls != 6+2*z->scan_n) return e("bad SOS len","Corrupt JPEG"); for (i=0; i < z->scan_n; ++i) { int id = get8(z->s), which; int q = get8(z->s); for (which = 0; which < z->s->img_n; ++which) if (z->img_comp[which].id == id) break; if (which == z->s->img_n) return 0; z->img_comp[which].hd = q >> 4; if (z->img_comp[which].hd > 3) return e("bad DC huff","Corrupt JPEG"); z->img_comp[which].ha = q & 15; if (z->img_comp[which].ha > 3) return e("bad AC huff","Corrupt JPEG"); z->order[i] = which; } if (get8(z->s) != 0) return e("bad SOS","Corrupt JPEG"); get8(z->s); // should be 63, but might be 0 if (get8(z->s) != 0) return e("bad SOS","Corrupt JPEG"); return 1; } static int process_frame_header(jpeg *z, int scan) { stbi *s = z->s; int Lf,p,i,q, h_max=1,v_max=1,c; Lf = get16(s); if (Lf < 11) return e("bad SOF len","Corrupt JPEG"); // JPEG p = get8(s); if (p != 8) return e("only 8-bit","JPEG format not supported: 8-bit only"); // JPEG baseline s->img_y = get16(s); if (s->img_y == 0) return e("no header height", "JPEG format not supported: delayed height"); // Legal, but we don't handle it--but neither does IJG s->img_x = get16(s); if (s->img_x == 0) return e("0 width","Corrupt JPEG"); // JPEG requires c = get8(s); if (c != 3 && c != 1) return e("bad component count","Corrupt JPEG"); // JFIF requires s->img_n = c; for (i=0; i < c; ++i) { z->img_comp[i].data = NULL; z->img_comp[i].linebuf = NULL; } if (Lf != 8+3*s->img_n) return e("bad SOF len","Corrupt JPEG"); for (i=0; i < s->img_n; ++i) { z->img_comp[i].id = get8(s); if (z->img_comp[i].id != i+1) // JFIF requires if (z->img_comp[i].id != i) // some version of jpegtran outputs non-JFIF-compliant files! return e("bad component ID","Corrupt JPEG"); q = get8(s); z->img_comp[i].h = (q >> 4); if (!z->img_comp[i].h || z->img_comp[i].h > 4) return e("bad H","Corrupt JPEG"); z->img_comp[i].v = q & 15; if (!z->img_comp[i].v || z->img_comp[i].v > 4) return e("bad V","Corrupt JPEG"); z->img_comp[i].tq = get8(s); if (z->img_comp[i].tq > 3) return e("bad TQ","Corrupt JPEG"); } if (scan != SCAN_load) return 1; if ((1 << 30) / s->img_x / s->img_n < s->img_y) return e("too large", "Image too large to decode"); for (i=0; i < s->img_n; ++i) { if (z->img_comp[i].h > h_max) h_max = z->img_comp[i].h; if (z->img_comp[i].v > v_max) v_max = z->img_comp[i].v; } // compute interleaved mcu info z->img_h_max = h_max; z->img_v_max = v_max; z->img_mcu_w = h_max * 8; z->img_mcu_h = v_max * 8; z->img_mcu_x = (s->img_x + z->img_mcu_w-1) / z->img_mcu_w; z->img_mcu_y = (s->img_y + z->img_mcu_h-1) / z->img_mcu_h; for (i=0; i < s->img_n; ++i) { // number of effective pixels (e.g. for non-interleaved MCU) z->img_comp[i].x = (s->img_x * z->img_comp[i].h + h_max-1) / h_max; z->img_comp[i].y = (s->img_y * z->img_comp[i].v + v_max-1) / v_max; // to simplify generation, we'll allocate enough memory to decode // the bogus oversized data from using interleaved MCUs and their // big blocks (e.g. a 16x16 iMCU on an image of width 33); we won't // discard the extra data until colorspace conversion z->img_comp[i].w2 = z->img_mcu_x * z->img_comp[i].h * 8; z->img_comp[i].h2 = z->img_mcu_y * z->img_comp[i].v * 8; z->img_comp[i].raw_data = malloc(z->img_comp[i].w2 * z->img_comp[i].h2+15); if (z->img_comp[i].raw_data == NULL) { for(--i; i >= 0; --i) { free(z->img_comp[i].raw_data); z->img_comp[i].data = NULL; } return e("outofmem", "Out of memory"); } // align blocks for installable-idct using mmx/sse z->img_comp[i].data = (stbi__uint8*) (((size_t) z->img_comp[i].raw_data + 15) & ~15); z->img_comp[i].linebuf = NULL; } return 1; } // use comparisons since in some cases we handle more than one case (e.g. SOF) #define DNL(x) ((x) == 0xdc) #define SOI(x) ((x) == 0xd8) #define EOI(x) ((x) == 0xd9) #define SOF(x) ((x) == 0xc0 || (x) == 0xc1) #define SOS(x) ((x) == 0xda) static int decode_jpeg_header(jpeg *z, int scan) { int m; z->marker = MARKER_none; // initialize cached marker to empty m = get_marker(z); if (!SOI(m)) return e("no SOI","Corrupt JPEG"); if (scan == SCAN_type) return 1; m = get_marker(z); while (!SOF(m)) { if (!process_marker(z,m)) return 0; m = get_marker(z); while (m == MARKER_none) { // some files have extra padding after their blocks, so ok, we'll scan if (at_eof(z->s)) return e("no SOF", "Corrupt JPEG"); m = get_marker(z); } } if (!process_frame_header(z, scan)) return 0; return 1; } static int decode_jpeg_image(jpeg *j) { int m; j->restart_interval = 0; if (!decode_jpeg_header(j, SCAN_load)) return 0; m = get_marker(j); while (!EOI(m)) { if (SOS(m)) { if (!process_scan_header(j)) return 0; if (!parse_entropy_coded_data(j)) return 0; if (j->marker == MARKER_none ) { // handle 0s at the end of image data from IP Kamera 9060 while (!at_eof(j->s)) { int x = get8(j->s); if (x == 255) { j->marker = get8u(j->s); break; } else if (x != 0) { return 0; } } // if we reach eof without hitting a marker, get_marker() below will fail and we'll eventually return 0 } } else { if (!process_marker(j, m)) return 0; } m = get_marker(j); } return 1; } // static jfif-centered resampling (across block boundaries) typedef stbi__uint8 *(*resample_row_func)(stbi__uint8 *out, stbi__uint8 *in0, stbi__uint8 *in1, int w, int hs); #define div4(x) ((stbi__uint8) ((x) >> 2)) static stbi__uint8 *resample_row_1(stbi__uint8 *out, stbi__uint8 *in_near, stbi__uint8 *in_far, int w, int hs) { STBI_NOTUSED(out); STBI_NOTUSED(in_far); STBI_NOTUSED(w); STBI_NOTUSED(hs); return in_near; } static stbi__uint8* resample_row_v_2(stbi__uint8 *out, stbi__uint8 *in_near, stbi__uint8 *in_far, int w, int hs) { // need to generate two samples vertically for every one in input int i; STBI_NOTUSED(hs); for (i=0; i < w; ++i) out[i] = div4(3*in_near[i] + in_far[i] + 2); return out; } static stbi__uint8* resample_row_h_2(stbi__uint8 *out, stbi__uint8 *in_near, stbi__uint8 *in_far, int w, int hs) { // need to generate two samples horizontally for every one in input int i; stbi__uint8 *input = in_near; if (w == 1) { // if only one sample, can't do any interpolation out[0] = out[1] = input[0]; return out; } out[0] = input[0]; out[1] = div4(input[0]*3 + input[1] + 2); for (i=1; i < w-1; ++i) { int n = 3*input[i]+2; out[i*2+0] = div4(n+input[i-1]); out[i*2+1] = div4(n+input[i+1]); } out[i*2+0] = div4(input[w-2]*3 + input[w-1] + 2); out[i*2+1] = input[w-1]; STBI_NOTUSED(in_far); STBI_NOTUSED(hs); return out; } #define div16(x) ((stbi__uint8) ((x) >> 4)) static stbi__uint8 *resample_row_hv_2(stbi__uint8 *out, stbi__uint8 *in_near, stbi__uint8 *in_far, int w, int hs) { // need to generate 2x2 samples for every one in input int i,t0,t1; if (w == 1) { out[0] = out[1] = div4(3*in_near[0] + in_far[0] + 2); return out; } t1 = 3*in_near[0] + in_far[0]; out[0] = div4(t1+2); for (i=1; i < w; ++i) { t0 = t1; t1 = 3*in_near[i]+in_far[i]; out[i*2-1] = div16(3*t0 + t1 + 8); out[i*2 ] = div16(3*t1 + t0 + 8); } out[w*2-1] = div4(t1+2); STBI_NOTUSED(hs); return out; } static stbi__uint8 *resample_row_generic(stbi__uint8 *out, stbi__uint8 *in_near, stbi__uint8 *in_far, int w, int hs) { // resample with nearest-neighbor int i,j; STBI_NOTUSED(in_far); for (i=0; i < w; ++i) for (j=0; j < hs; ++j) out[i*hs+j] = in_near[i]; return out; } #define float2fixed(x) ((int) ((x) * 65536 + 0.5)) // 0.38 seconds on 3*anemones.jpg (0.25 with processor = Pro) // VC6 without processor=Pro is generating multiple LEAs per multiply! static void YCbCr_to_RGB_row(stbi__uint8 *out, const stbi__uint8 *y, const stbi__uint8 *pcb, const stbi__uint8 *pcr, int count, int step) { int i; for (i=0; i < count; ++i) { int y_fixed = (y[i] << 16) + 32768; // rounding int r,g,b; int cr = pcr[i] - 128; int cb = pcb[i] - 128; r = y_fixed + cr*float2fixed(1.40200f); g = y_fixed - cr*float2fixed(0.71414f) - cb*float2fixed(0.34414f); b = y_fixed + cb*float2fixed(1.77200f); r >>= 16; g >>= 16; b >>= 16; if ((unsigned) r > 255) { if (r < 0) r = 0; else r = 255; } if ((unsigned) g > 255) { if (g < 0) g = 0; else g = 255; } if ((unsigned) b > 255) { if (b < 0) b = 0; else b = 255; } out[0] = (stbi__uint8)r; out[1] = (stbi__uint8)g; out[2] = (stbi__uint8)b; out[3] = 255; out += step; } } #ifdef STBI_SIMD static stbi_YCbCr_to_RGB_run stbi_YCbCr_installed = YCbCr_to_RGB_row; void stbi_install_YCbCr_to_RGB(stbi_YCbCr_to_RGB_run func) { stbi_YCbCr_installed = func; } #endif // clean up the temporary component buffers static void cleanup_jpeg(jpeg *j) { int i; for (i=0; i < j->s->img_n; ++i) { if (j->img_comp[i].data) { free(j->img_comp[i].raw_data); j->img_comp[i].data = NULL; } if (j->img_comp[i].linebuf) { free(j->img_comp[i].linebuf); j->img_comp[i].linebuf = NULL; } } } typedef struct { resample_row_func resample; stbi__uint8 *line0,*line1; int hs,vs; // expansion factor in each axis int w_lores; // horizontal pixels pre-expansion int ystep; // how far through vertical expansion we are int ypos; // which pre-expansion row we're on } stbi_resample; static stbi__uint8 *load_jpeg_image(jpeg *z, int *out_x, int *out_y, int *comp, int req_comp) { int n, decode_n; // validate req_comp if (req_comp < 0 || req_comp > 4) return epuc("bad req_comp", "Internal error"); z->s->img_n = 0; // load a jpeg image from whichever source if (!decode_jpeg_image(z)) { cleanup_jpeg(z); return NULL; } // determine actual number of components to generate n = req_comp ? req_comp : z->s->img_n; if (z->s->img_n == 3 && n < 3) decode_n = 1; else decode_n = z->s->img_n; // resample and color-convert { int k; unsigned int i,j; stbi__uint8 *output; stbi__uint8 *coutput[4]; stbi_resample res_comp[4]; for (k=0; k < decode_n; ++k) { stbi_resample *r = &res_comp[k]; // allocate line buffer big enough for upsampling off the edges // with upsample factor of 4 z->img_comp[k].linebuf = (stbi__uint8 *) malloc(z->s->img_x + 3); if (!z->img_comp[k].linebuf) { cleanup_jpeg(z); return epuc("outofmem", "Out of memory"); } r->hs = z->img_h_max / z->img_comp[k].h; r->vs = z->img_v_max / z->img_comp[k].v; r->ystep = r->vs >> 1; r->w_lores = (z->s->img_x + r->hs-1) / r->hs; r->ypos = 0; r->line0 = r->line1 = z->img_comp[k].data; if (r->hs == 1 && r->vs == 1) r->resample = resample_row_1; else if (r->hs == 1 && r->vs == 2) r->resample = resample_row_v_2; else if (r->hs == 2 && r->vs == 1) r->resample = resample_row_h_2; else if (r->hs == 2 && r->vs == 2) r->resample = resample_row_hv_2; else r->resample = resample_row_generic; } // can't error after this so, this is safe output = (stbi__uint8 *) malloc(n * z->s->img_x * z->s->img_y + 1); if (!output) { cleanup_jpeg(z); return epuc("outofmem", "Out of memory"); } // now go ahead and resample for (j=0; j < z->s->img_y; ++j) { stbi__uint8 *out = output + n * z->s->img_x * j; for (k=0; k < decode_n; ++k) { stbi_resample *r = &res_comp[k]; int y_bot = r->ystep >= (r->vs >> 1); coutput[k] = r->resample(z->img_comp[k].linebuf, y_bot ? r->line1 : r->line0, y_bot ? r->line0 : r->line1, r->w_lores, r->hs); if (++r->ystep >= r->vs) { r->ystep = 0; r->line0 = r->line1; if (++r->ypos < z->img_comp[k].y) r->line1 += z->img_comp[k].w2; } } if (n >= 3) { stbi__uint8 *y = coutput[0]; if (z->s->img_n == 3) { #ifdef STBI_SIMD stbi_YCbCr_installed(out, y, coutput[1], coutput[2], z->s->img_x, n); #else YCbCr_to_RGB_row(out, y, coutput[1], coutput[2], z->s->img_x, n); #endif } else for (i=0; i < z->s->img_x; ++i) { out[0] = out[1] = out[2] = y[i]; out[3] = 255; // not used if n==3 out += n; } } else { stbi__uint8 *y = coutput[0]; if (n == 1) for (i=0; i < z->s->img_x; ++i) out[i] = y[i]; else for (i=0; i < z->s->img_x; ++i) *out++ = y[i], *out++ = 255; } } cleanup_jpeg(z); *out_x = z->s->img_x; *out_y = z->s->img_y; if (comp) *comp = z->s->img_n; // report original components, not output return output; } } static unsigned char *stbi_jpeg_load(stbi *s, int *x, int *y, int *comp, int req_comp) { jpeg j; j.s = s; return load_jpeg_image(&j, x,y,comp,req_comp); } static int stbi_jpeg_test(stbi *s) { int r; jpeg j; j.s = s; r = decode_jpeg_header(&j, SCAN_type); stbi_rewind(s); return r; } static int stbi_jpeg_info_raw(jpeg *j, int *x, int *y, int *comp) { if (!decode_jpeg_header(j, SCAN_header)) { stbi_rewind( j->s ); return 0; } if (x) *x = j->s->img_x; if (y) *y = j->s->img_y; if (comp) *comp = j->s->img_n; return 1; } static int stbi_jpeg_info(stbi *s, int *x, int *y, int *comp) { jpeg j; j.s = s; return stbi_jpeg_info_raw(&j, x, y, comp); } // public domain zlib decode v0.2 Sean Barrett 2006-11-18 // simple implementation // - all input must be provided in an upfront buffer // - all output is written to a single output buffer (can malloc/realloc) // performance // - fast huffman // fast-way is faster to check than jpeg huffman, but slow way is slower #define ZFAST_BITS 9 // accelerate all cases in default tables #define ZFAST_MASK ((1 << ZFAST_BITS) - 1) // zlib-style huffman encoding // (jpegs packs from left, zlib from right, so can't share code) typedef struct { stbi__uint16 fast[1 << ZFAST_BITS]; stbi__uint16 firstcode[16]; int maxcode[17]; stbi__uint16 firstsymbol[16]; stbi__uint8 size[288]; stbi__uint16 value[288]; } zhuffman; stbi_inline static int bitreverse16(int n) { n = ((n & 0xAAAA) >> 1) | ((n & 0x5555) << 1); n = ((n & 0xCCCC) >> 2) | ((n & 0x3333) << 2); n = ((n & 0xF0F0) >> 4) | ((n & 0x0F0F) << 4); n = ((n & 0xFF00) >> 8) | ((n & 0x00FF) << 8); return n; } stbi_inline static int bit_reverse(int v, int bits) { assert(bits <= 16); // to bit reverse n bits, reverse 16 and shift // e.g. 11 bits, bit reverse and shift away 5 return bitreverse16(v) >> (16-bits); } static int zbuild_huffman(zhuffman *z, stbi__uint8 *sizelist, int num) { int i,k=0; int code, next_code[16], sizes[17]; // DEFLATE spec for generating codes memset(sizes, 0, sizeof(sizes)); memset(z->fast, 255, sizeof(z->fast)); for (i=0; i < num; ++i) ++sizes[sizelist[i]]; sizes[0] = 0; for (i=1; i < 16; ++i) assert(sizes[i] <= (1 << i)); code = 0; for (i=1; i < 16; ++i) { next_code[i] = code; z->firstcode[i] = (stbi__uint16) code; z->firstsymbol[i] = (stbi__uint16) k; code = (code + sizes[i]); if (sizes[i]) if (code-1 >= (1 << i)) return e("bad codelengths","Corrupt JPEG"); z->maxcode[i] = code << (16-i); // preshift for inner loop code <<= 1; k += sizes[i]; } z->maxcode[16] = 0x10000; // sentinel for (i=0; i < num; ++i) { int s = sizelist[i]; if (s) { int c = next_code[s] - z->firstcode[s] + z->firstsymbol[s]; z->size[c] = (stbi__uint8)s; z->value[c] = (stbi__uint16)i; if (s <= ZFAST_BITS) { int k = bit_reverse(next_code[s],s); while (k < (1 << ZFAST_BITS)) { z->fast[k] = (stbi__uint16) c; k += (1 << s); } } ++next_code[s]; } } return 1; } // zlib-from-memory implementation for PNG reading // because PNG allows splitting the zlib stream arbitrarily, // and it's annoying structurally to have PNG call ZLIB call PNG, // we require PNG read all the IDATs and combine them into a single // memory buffer typedef struct { stbi__uint8 *zbuffer, *zbuffer_end; int num_bits; stbi__uint32 code_buffer; char *zout; char *zout_start; char *zout_end; int z_expandable; zhuffman z_length, z_distance; } zbuf; stbi_inline static int zget8(zbuf *z) { if (z->zbuffer >= z->zbuffer_end) return 0; return *z->zbuffer++; } static void fill_bits(zbuf *z) { do { assert(z->code_buffer < (1U << z->num_bits)); z->code_buffer |= zget8(z) << z->num_bits; z->num_bits += 8; } while (z->num_bits <= 24); } stbi_inline static unsigned int zreceive(zbuf *z, int n) { unsigned int k; if (z->num_bits < n) fill_bits(z); k = z->code_buffer & ((1 << n) - 1); z->code_buffer >>= n; z->num_bits -= n; return k; } stbi_inline static int zhuffman_decode(zbuf *a, zhuffman *z) { int b,s,k; if (a->num_bits < 16) fill_bits(a); b = z->fast[a->code_buffer & ZFAST_MASK]; if (b < 0xffff) { s = z->size[b]; a->code_buffer >>= s; a->num_bits -= s; return z->value[b]; } // not resolved by fast table, so compute it the slow way // use jpeg approach, which requires MSbits at top k = bit_reverse(a->code_buffer, 16); for (s=ZFAST_BITS+1; ; ++s) if (k < z->maxcode[s]) break; if (s == 16) return -1; // invalid code! // code size is s, so: b = (k >> (16-s)) - z->firstcode[s] + z->firstsymbol[s]; assert(z->size[b] == s); a->code_buffer >>= s; a->num_bits -= s; return z->value[b]; } static int expand(zbuf *z, int n) // need to make room for n bytes { char *q; int cur, limit; if (!z->z_expandable) return e("output buffer limit","Corrupt PNG"); cur = (int) (z->zout - z->zout_start); limit = (int) (z->zout_end - z->zout_start); while (cur + n > limit) limit *= 2; q = (char *) realloc(z->zout_start, limit); if (q == NULL) return e("outofmem", "Out of memory"); z->zout_start = q; z->zout = q + cur; z->zout_end = q + limit; return 1; } static int length_base[31] = { 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,0,0 }; static int length_extra[31]= { 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,0,0 }; static int dist_base[32] = { 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,0,0}; static int dist_extra[32] = { 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}; static int parse_huffman_block(zbuf *a) { for(;;) { int z = zhuffman_decode(a, &a->z_length); if (z < 256) { if (z < 0) return e("bad huffman code","Corrupt PNG"); // error in huffman codes if (a->zout >= a->zout_end) if (!expand(a, 1)) return 0; *a->zout++ = (char) z; } else { stbi__uint8 *p; int len,dist; if (z == 256) return 1; z -= 257; len = length_base[z]; if (length_extra[z]) len += zreceive(a, length_extra[z]); z = zhuffman_decode(a, &a->z_distance); if (z < 0) return e("bad huffman code","Corrupt PNG"); dist = dist_base[z]; if (dist_extra[z]) dist += zreceive(a, dist_extra[z]); if (a->zout - a->zout_start < dist) return e("bad dist","Corrupt PNG"); if (a->zout + len > a->zout_end) if (!expand(a, len)) return 0; p = (stbi__uint8 *) (a->zout - dist); while (len--) *a->zout++ = *p++; } } } static int compute_huffman_codes(zbuf *a) { static stbi__uint8 length_dezigzag[19] = { 16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15 }; zhuffman z_codelength; stbi__uint8 lencodes[286+32+137];//padding for maximum single op stbi__uint8 codelength_sizes[19]; int i,n; int hlit = zreceive(a,5) + 257; int hdist = zreceive(a,5) + 1; int hclen = zreceive(a,4) + 4; memset(codelength_sizes, 0, sizeof(codelength_sizes)); for (i=0; i < hclen; ++i) { int s = zreceive(a,3); codelength_sizes[length_dezigzag[i]] = (stbi__uint8) s; } if (!zbuild_huffman(&z_codelength, codelength_sizes, 19)) return 0; n = 0; while (n < hlit + hdist) { int c = zhuffman_decode(a, &z_codelength); assert(c >= 0 && c < 19); if (c < 16) lencodes[n++] = (stbi__uint8) c; else if (c == 16) { c = zreceive(a,2)+3; memset(lencodes+n, lencodes[n-1], c); n += c; } else if (c == 17) { c = zreceive(a,3)+3; memset(lencodes+n, 0, c); n += c; } else { assert(c == 18); c = zreceive(a,7)+11; memset(lencodes+n, 0, c); n += c; } } if (n != hlit+hdist) return e("bad codelengths","Corrupt PNG"); if (!zbuild_huffman(&a->z_length, lencodes, hlit)) return 0; if (!zbuild_huffman(&a->z_distance, lencodes+hlit, hdist)) return 0; return 1; } static int parse_uncompressed_block(zbuf *a) { stbi__uint8 header[4]; int len,nlen,k; if (a->num_bits & 7) zreceive(a, a->num_bits & 7); // discard // drain the bit-packed data into header k = 0; while (a->num_bits > 0) { header[k++] = (stbi__uint8) (a->code_buffer & 255); // wtf this warns? a->code_buffer >>= 8; a->num_bits -= 8; } assert(a->num_bits == 0); // now fill header the normal way while (k < 4) header[k++] = (stbi__uint8) zget8(a); len = header[1] * 256 + header[0]; nlen = header[3] * 256 + header[2]; if (nlen != (len ^ 0xffff)) return e("zlib corrupt","Corrupt PNG"); if (a->zbuffer + len > a->zbuffer_end) return e("read past buffer","Corrupt PNG"); if (a->zout + len > a->zout_end) if (!expand(a, len)) return 0; memcpy(a->zout, a->zbuffer, len); a->zbuffer += len; a->zout += len; return 1; } static int parse_zlib_header(zbuf *a) { int cmf = zget8(a); int cm = cmf & 15; /* int cinfo = cmf >> 4; */ int flg = zget8(a); if ((cmf*256+flg) % 31 != 0) return e("bad zlib header","Corrupt PNG"); // zlib spec if (flg & 32) return e("no preset dict","Corrupt PNG"); // preset dictionary not allowed in png if (cm != 8) return e("bad compression","Corrupt PNG"); // DEFLATE required for png // window = 1 << (8 + cinfo)... but who cares, we fully buffer output return 1; } // @TODO: should statically initialize these for optimal thread safety static stbi__uint8 default_length[288], default_distance[32]; static void init_defaults(void) { int i; // use <= to match clearly with spec for (i=0; i <= 143; ++i) default_length[i] = 8; for ( ; i <= 255; ++i) default_length[i] = 9; for ( ; i <= 279; ++i) default_length[i] = 7; for ( ; i <= 287; ++i) default_length[i] = 8; for (i=0; i <= 31; ++i) default_distance[i] = 5; } int stbi_png_partial; // a quick hack to only allow decoding some of a PNG... I should implement real streaming support instead static int parse_zlib(zbuf *a, int parse_header) { int final, type; if (parse_header) if (!parse_zlib_header(a)) return 0; a->num_bits = 0; a->code_buffer = 0; do { final = zreceive(a,1); type = zreceive(a,2); if (type == 0) { if (!parse_uncompressed_block(a)) return 0; } else if (type == 3) { return 0; } else { if (type == 1) { // use fixed code lengths if (!default_distance[31]) init_defaults(); if (!zbuild_huffman(&a->z_length , default_length , 288)) return 0; if (!zbuild_huffman(&a->z_distance, default_distance, 32)) return 0; } else { if (!compute_huffman_codes(a)) return 0; } if (!parse_huffman_block(a)) return 0; } if (stbi_png_partial && a->zout - a->zout_start > 65536) break; } while (!final); return 1; } static int do_zlib(zbuf *a, char *obuf, int olen, int exp, int parse_header) { a->zout_start = obuf; a->zout = obuf; a->zout_end = obuf + olen; a->z_expandable = exp; return parse_zlib(a, parse_header); } char *stbi_zlib_decode_malloc_guesssize(const char *buffer, int len, int initial_size, int *outlen) { zbuf a; char *p = (char *) malloc(initial_size); if (p == NULL) return NULL; a.zbuffer = (stbi__uint8 *) buffer; a.zbuffer_end = (stbi__uint8 *) buffer + len; if (do_zlib(&a, p, initial_size, 1, 1)) { if (outlen) *outlen = (int) (a.zout - a.zout_start); return a.zout_start; } else { free(a.zout_start); return NULL; } } char *stbi_zlib_decode_malloc(char const *buffer, int len, int *outlen) { return stbi_zlib_decode_malloc_guesssize(buffer, len, 16384, outlen); } char *stbi_zlib_decode_malloc_guesssize_headerflag(const char *buffer, int len, int initial_size, int *outlen, int parse_header) { zbuf a; char *p = (char *) malloc(initial_size); if (p == NULL) return NULL; a.zbuffer = (stbi__uint8 *) buffer; a.zbuffer_end = (stbi__uint8 *) buffer + len; if (do_zlib(&a, p, initial_size, 1, parse_header)) { if (outlen) *outlen = (int) (a.zout - a.zout_start); return a.zout_start; } else { free(a.zout_start); return NULL; } } int stbi_zlib_decode_buffer(char *obuffer, int olen, char const *ibuffer, int ilen) { zbuf a; a.zbuffer = (stbi__uint8 *) ibuffer; a.zbuffer_end = (stbi__uint8 *) ibuffer + ilen; if (do_zlib(&a, obuffer, olen, 0, 1)) return (int) (a.zout - a.zout_start); else return -1; } char *stbi_zlib_decode_noheader_malloc(char const *buffer, int len, int *outlen) { zbuf a; char *p = (char *) malloc(16384); if (p == NULL) return NULL; a.zbuffer = (stbi__uint8 *) buffer; a.zbuffer_end = (stbi__uint8 *) buffer+len; if (do_zlib(&a, p, 16384, 1, 0)) { if (outlen) *outlen = (int) (a.zout - a.zout_start); return a.zout_start; } else { free(a.zout_start); return NULL; } } int stbi_zlib_decode_noheader_buffer(char *obuffer, int olen, const char *ibuffer, int ilen) { zbuf a; a.zbuffer = (stbi__uint8 *) ibuffer; a.zbuffer_end = (stbi__uint8 *) ibuffer + ilen; if (do_zlib(&a, obuffer, olen, 0, 0)) return (int) (a.zout - a.zout_start); else return -1; } // public domain "baseline" PNG decoder v0.10 Sean Barrett 2006-11-18 // simple implementation // - only 8-bit samples // - no CRC checking // - allocates lots of intermediate memory // - avoids problem of streaming data between subsystems // - avoids explicit window management // performance // - uses stb_zlib, a PD zlib implementation with fast huffman decoding typedef struct { stbi__uint32 length; stbi__uint32 type; } chunk; #define PNG_TYPE(a,b,c,d) (((a) << 24) + ((b) << 16) + ((c) << 8) + (d)) static chunk get_chunk_header(stbi *s) { chunk c; c.length = get32(s); c.type = get32(s); return c; } static int check_png_header(stbi *s) { static stbi__uint8 png_sig[8] = { 137,80,78,71,13,10,26,10 }; int i; for (i=0; i < 8; ++i) if (get8u(s) != png_sig[i]) return e("bad png sig","Not a PNG"); return 1; } typedef struct { stbi *s; stbi__uint8 *idata, *expanded, *out; } png; enum { F_none=0, F_sub=1, F_up=2, F_avg=3, F_paeth=4, F_avg_first, F_paeth_first }; static stbi__uint8 first_row_filter[5] = { F_none, F_sub, F_none, F_avg_first, F_paeth_first }; static int paeth(int a, int b, int c) { int p = a + b - c; int pa = abs(p-a); int pb = abs(p-b); int pc = abs(p-c); if (pa <= pb && pa <= pc) return a; if (pb <= pc) return b; return c; } // create the png data from post-deflated data static int create_png_image_raw(png *a, stbi__uint8 *raw, stbi__uint32 raw_len, int out_n, stbi__uint32 x, stbi__uint32 y) { stbi *s = a->s; stbi__uint32 i,j,stride = x*out_n; int k; int img_n = s->img_n; // copy it into a local for later assert(out_n == s->img_n || out_n == s->img_n+1); if (stbi_png_partial) y = 1; a->out = (stbi__uint8 *) malloc(x * y * out_n); if (!a->out) return e("outofmem", "Out of memory"); if (!stbi_png_partial) { if (s->img_x == x && s->img_y == y) { if (raw_len != (img_n * x + 1) * y) return e("not enough pixels","Corrupt PNG"); } else { // interlaced: if (raw_len < (img_n * x + 1) * y) return e("not enough pixels","Corrupt PNG"); } } for (j=0; j < y; ++j) { stbi__uint8 *cur = a->out + stride*j; stbi__uint8 *prior = cur - stride; int filter = *raw++; if (filter > 4) return e("invalid filter","Corrupt PNG"); // if first row, use special filter that doesn't sample previous row if (j == 0) filter = first_row_filter[filter]; // handle first pixel explicitly for (k=0; k < img_n; ++k) { switch (filter) { case F_none : cur[k] = raw[k]; break; case F_sub : cur[k] = raw[k]; break; case F_up : cur[k] = raw[k] + prior[k]; break; case F_avg : cur[k] = raw[k] + (prior[k]>>1); break; case F_paeth : cur[k] = (stbi__uint8) (raw[k] + paeth(0,prior[k],0)); break; case F_avg_first : cur[k] = raw[k]; break; case F_paeth_first: cur[k] = raw[k]; break; } } if (img_n != out_n) cur[img_n] = 255; raw += img_n; cur += out_n; prior += out_n; // this is a little gross, so that we don't switch per-pixel or per-component if (img_n == out_n) { #define CASE(f) \ case f: \ for (i=x-1; i >= 1; --i, raw+=img_n,cur+=img_n,prior+=img_n) \ for (k=0; k < img_n; ++k) switch (filter) { CASE(F_none) cur[k] = raw[k]; break; CASE(F_sub) cur[k] = raw[k] + cur[k-img_n]; break; CASE(F_up) cur[k] = raw[k] + prior[k]; break; CASE(F_avg) cur[k] = raw[k] + ((prior[k] + cur[k-img_n])>>1); break; CASE(F_paeth) cur[k] = (stbi__uint8) (raw[k] + paeth(cur[k-img_n],prior[k],prior[k-img_n])); break; CASE(F_avg_first) cur[k] = raw[k] + (cur[k-img_n] >> 1); break; CASE(F_paeth_first) cur[k] = (stbi__uint8) (raw[k] + paeth(cur[k-img_n],0,0)); break; } #undef CASE } else { assert(img_n+1 == out_n); #define CASE(f) \ case f: \ for (i=x-1; i >= 1; --i, cur[img_n]=255,raw+=img_n,cur+=out_n,prior+=out_n) \ for (k=0; k < img_n; ++k) switch (filter) { CASE(F_none) cur[k] = raw[k]; break; CASE(F_sub) cur[k] = raw[k] + cur[k-out_n]; break; CASE(F_up) cur[k] = raw[k] + prior[k]; break; CASE(F_avg) cur[k] = raw[k] + ((prior[k] + cur[k-out_n])>>1); break; CASE(F_paeth) cur[k] = (stbi__uint8) (raw[k] + paeth(cur[k-out_n],prior[k],prior[k-out_n])); break; CASE(F_avg_first) cur[k] = raw[k] + (cur[k-out_n] >> 1); break; CASE(F_paeth_first) cur[k] = (stbi__uint8) (raw[k] + paeth(cur[k-out_n],0,0)); break; } #undef CASE } } return 1; } static int create_png_image(png *a, stbi__uint8 *raw, stbi__uint32 raw_len, int out_n, int interlaced) { stbi__uint8 *final; int p; int save; if (!interlaced) return create_png_image_raw(a, raw, raw_len, out_n, a->s->img_x, a->s->img_y); save = stbi_png_partial; stbi_png_partial = 0; // de-interlacing final = (stbi__uint8 *) malloc(a->s->img_x * a->s->img_y * out_n); for (p=0; p < 7; ++p) { int xorig[] = { 0,4,0,2,0,1,0 }; int yorig[] = { 0,0,4,0,2,0,1 }; int xspc[] = { 8,8,4,4,2,2,1 }; int yspc[] = { 8,8,8,4,4,2,2 }; int i,j,x,y; // pass1_x[4] = 0, pass1_x[5] = 1, pass1_x[12] = 1 x = (a->s->img_x - xorig[p] + xspc[p]-1) / xspc[p]; y = (a->s->img_y - yorig[p] + yspc[p]-1) / yspc[p]; if (x && y) { if (!create_png_image_raw(a, raw, raw_len, out_n, x, y)) { free(final); return 0; } for (j=0; j < y; ++j) for (i=0; i < x; ++i) memcpy(final + (j*yspc[p]+yorig[p])*a->s->img_x*out_n + (i*xspc[p]+xorig[p])*out_n, a->out + (j*x+i)*out_n, out_n); free(a->out); raw += (x*out_n+1)*y; raw_len -= (x*out_n+1)*y; } } a->out = final; stbi_png_partial = save; return 1; } static int compute_transparency(png *z, stbi__uint8 tc[3], int out_n) { stbi *s = z->s; stbi__uint32 i, pixel_count = s->img_x * s->img_y; stbi__uint8 *p = z->out; // compute color-based transparency, assuming we've // already got 255 as the alpha value in the output assert(out_n == 2 || out_n == 4); if (out_n == 2) { for (i=0; i < pixel_count; ++i) { p[1] = (p[0] == tc[0] ? 0 : 255); p += 2; } } else { for (i=0; i < pixel_count; ++i) { if (p[0] == tc[0] && p[1] == tc[1] && p[2] == tc[2]) p[3] = 0; p += 4; } } return 1; } static int expand_palette(png *a, stbi__uint8 *palette, int len, int pal_img_n) { stbi__uint32 i, pixel_count = a->s->img_x * a->s->img_y; stbi__uint8 *p, *temp_out, *orig = a->out; p = (stbi__uint8 *) malloc(pixel_count * pal_img_n); if (p == NULL) return e("outofmem", "Out of memory"); // between here and free(out) below, exitting would leak temp_out = p; if (pal_img_n == 3) { for (i=0; i < pixel_count; ++i) { int n = orig[i]*4; p[0] = palette[n ]; p[1] = palette[n+1]; p[2] = palette[n+2]; p += 3; } } else { for (i=0; i < pixel_count; ++i) { int n = orig[i]*4; p[0] = palette[n ]; p[1] = palette[n+1]; p[2] = palette[n+2]; p[3] = palette[n+3]; p += 4; } } free(a->out); a->out = temp_out; STBI_NOTUSED(len); return 1; } static int stbi_unpremultiply_on_load = 0; static int stbi_de_iphone_flag = 0; void stbi_set_unpremultiply_on_load(int flag_true_if_should_unpremultiply) { stbi_unpremultiply_on_load = flag_true_if_should_unpremultiply; } void stbi_convert_iphone_png_to_rgb(int flag_true_if_should_convert) { stbi_de_iphone_flag = flag_true_if_should_convert; } static void stbi_de_iphone(png *z) { stbi *s = z->s; stbi__uint32 i, pixel_count = s->img_x * s->img_y; stbi__uint8 *p = z->out; if (s->img_out_n == 3) { // convert bgr to rgb for (i=0; i < pixel_count; ++i) { stbi__uint8 t = p[0]; p[0] = p[2]; p[2] = t; p += 3; } } else { assert(s->img_out_n == 4); if (stbi_unpremultiply_on_load) { // convert bgr to rgb and unpremultiply for (i=0; i < pixel_count; ++i) { stbi__uint8 a = p[3]; stbi__uint8 t = p[0]; if (a) { p[0] = p[2] * 255 / a; p[1] = p[1] * 255 / a; p[2] = t * 255 / a; } else { p[0] = p[2]; p[2] = t; } p += 4; } } else { // convert bgr to rgb for (i=0; i < pixel_count; ++i) { stbi__uint8 t = p[0]; p[0] = p[2]; p[2] = t; p += 4; } } } } static int parse_png_file(png *z, int scan, int req_comp) { stbi__uint8 palette[1024], pal_img_n=0; stbi__uint8 has_trans=0, tc[3]; stbi__uint32 ioff=0, idata_limit=0, i, pal_len=0; int first=1,k,interlace=0, iphone=0; stbi *s = z->s; z->expanded = NULL; z->idata = NULL; z->out = NULL; if (!check_png_header(s)) return 0; if (scan == SCAN_type) return 1; for (;;) { chunk c = get_chunk_header(s); switch (c.type) { case PNG_TYPE('C','g','B','I'): iphone = stbi_de_iphone_flag; skip(s, c.length); break; case PNG_TYPE('I','H','D','R'): { int depth,color,comp,filter; if (!first) return e("multiple IHDR","Corrupt PNG"); first = 0; if (c.length != 13) return e("bad IHDR len","Corrupt PNG"); s->img_x = get32(s); if (s->img_x > (1 << 24)) return e("too large","Very large image (corrupt?)"); s->img_y = get32(s); if (s->img_y > (1 << 24)) return e("too large","Very large image (corrupt?)"); depth = get8(s); if (depth != 8) return e("8bit only","PNG not supported: 8-bit only"); color = get8(s); if (color > 6) return e("bad ctype","Corrupt PNG"); if (color == 3) pal_img_n = 3; else if (color & 1) return e("bad ctype","Corrupt PNG"); comp = get8(s); if (comp) return e("bad comp method","Corrupt PNG"); filter= get8(s); if (filter) return e("bad filter method","Corrupt PNG"); interlace = get8(s); if (interlace>1) return e("bad interlace method","Corrupt PNG"); if (!s->img_x || !s->img_y) return e("0-pixel image","Corrupt PNG"); if (!pal_img_n) { s->img_n = (color & 2 ? 3 : 1) + (color & 4 ? 1 : 0); if ((1 << 30) / s->img_x / s->img_n < s->img_y) return e("too large", "Image too large to decode"); if (scan == SCAN_header) return 1; } else { // if paletted, then pal_n is our final components, and // img_n is # components to decompress/filter. s->img_n = 1; if ((1 << 30) / s->img_x / 4 < s->img_y) return e("too large","Corrupt PNG"); // if SCAN_header, have to scan to see if we have a tRNS } break; } case PNG_TYPE('P','L','T','E'): { if (first) return e("first not IHDR", "Corrupt PNG"); if (c.length > 256*3) return e("invalid PLTE","Corrupt PNG"); pal_len = c.length / 3; if (pal_len * 3 != c.length) return e("invalid PLTE","Corrupt PNG"); for (i=0; i < pal_len; ++i) { palette[i*4+0] = get8u(s); palette[i*4+1] = get8u(s); palette[i*4+2] = get8u(s); palette[i*4+3] = 255; } break; } case PNG_TYPE('t','R','N','S'): { if (first) return e("first not IHDR", "Corrupt PNG"); if (z->idata) return e("tRNS after IDAT","Corrupt PNG"); if (pal_img_n) { if (scan == SCAN_header) { s->img_n = 4; return 1; } if (pal_len == 0) return e("tRNS before PLTE","Corrupt PNG"); if (c.length > pal_len) return e("bad tRNS len","Corrupt PNG"); pal_img_n = 4; for (i=0; i < c.length; ++i) palette[i*4+3] = get8u(s); } else { if (!(s->img_n & 1)) return e("tRNS with alpha","Corrupt PNG"); if (c.length != (stbi__uint32) s->img_n*2) return e("bad tRNS len","Corrupt PNG"); has_trans = 1; for (k=0; k < s->img_n; ++k) tc[k] = (stbi__uint8) get16(s); // non 8-bit images will be larger } break; } case PNG_TYPE('I','D','A','T'): { if (first) return e("first not IHDR", "Corrupt PNG"); if (pal_img_n && !pal_len) return e("no PLTE","Corrupt PNG"); if (scan == SCAN_header) { s->img_n = pal_img_n; return 1; } if (ioff + c.length > idata_limit) { stbi__uint8 *p; if (idata_limit == 0) idata_limit = c.length > 4096 ? c.length : 4096; while (ioff + c.length > idata_limit) idata_limit *= 2; p = (stbi__uint8 *) realloc(z->idata, idata_limit); if (p == NULL) return e("outofmem", "Out of memory"); z->idata = p; } if (!getn(s, z->idata+ioff,c.length)) return e("outofdata","Corrupt PNG"); ioff += c.length; break; } case PNG_TYPE('I','E','N','D'): { stbi__uint32 raw_len; if (first) return e("first not IHDR", "Corrupt PNG"); if (scan != SCAN_load) return 1; if (z->idata == NULL) return e("no IDAT","Corrupt PNG"); z->expanded = (stbi__uint8 *) stbi_zlib_decode_malloc_guesssize_headerflag((char *) z->idata, ioff, 16384, (int *) &raw_len, !iphone); if (z->expanded == NULL) return 0; // zlib should set error free(z->idata); z->idata = NULL; if ((req_comp == s->img_n+1 && req_comp != 3 && !pal_img_n) || has_trans) s->img_out_n = s->img_n+1; else s->img_out_n = s->img_n; if (!create_png_image(z, z->expanded, raw_len, s->img_out_n, interlace)) return 0; if (has_trans) if (!compute_transparency(z, tc, s->img_out_n)) return 0; if (iphone && s->img_out_n > 2) stbi_de_iphone(z); if (pal_img_n) { // pal_img_n == 3 or 4 s->img_n = pal_img_n; // record the actual colors we had s->img_out_n = pal_img_n; if (req_comp >= 3) s->img_out_n = req_comp; if (!expand_palette(z, palette, pal_len, s->img_out_n)) return 0; } free(z->expanded); z->expanded = NULL; return 1; } default: // if critical, fail if (first) return e("first not IHDR", "Corrupt PNG"); if ((c.type & (1 << 29)) == 0) { #ifndef STBI_NO_FAILURE_STRINGS // not threadsafe static char invalid_chunk[] = "XXXX chunk not known"; invalid_chunk[0] = (stbi__uint8) (c.type >> 24); invalid_chunk[1] = (stbi__uint8) (c.type >> 16); invalid_chunk[2] = (stbi__uint8) (c.type >> 8); invalid_chunk[3] = (stbi__uint8) (c.type >> 0); #endif return e(invalid_chunk, "PNG not supported: unknown chunk type"); } skip(s, c.length); break; } // end of chunk, read and skip CRC get32(s); } } static unsigned char *do_png(png *p, int *x, int *y, int *n, int req_comp) { unsigned char *result=NULL; if (req_comp < 0 || req_comp > 4) return epuc("bad req_comp", "Internal error"); if (parse_png_file(p, SCAN_load, req_comp)) { result = p->out; p->out = NULL; if (req_comp && req_comp != p->s->img_out_n) { result = convert_format(result, p->s->img_out_n, req_comp, p->s->img_x, p->s->img_y); p->s->img_out_n = req_comp; if (result == NULL) return result; } *x = p->s->img_x; *y = p->s->img_y; if (n) *n = p->s->img_n; } free(p->out); p->out = NULL; free(p->expanded); p->expanded = NULL; free(p->idata); p->idata = NULL; return result; } static unsigned char *stbi_png_load(stbi *s, int *x, int *y, int *comp, int req_comp) { png p; p.s = s; return do_png(&p, x,y,comp,req_comp); } static int stbi_png_test(stbi *s) { int r; r = check_png_header(s); stbi_rewind(s); return r; } static int stbi_png_info_raw(png *p, int *x, int *y, int *comp) { if (!parse_png_file(p, SCAN_header, 0)) { stbi_rewind( p->s ); return 0; } if (x) *x = p->s->img_x; if (y) *y = p->s->img_y; if (comp) *comp = p->s->img_n; return 1; } static int stbi_png_info(stbi *s, int *x, int *y, int *comp) { png p; p.s = s; return stbi_png_info_raw(&p, x, y, comp); } // Microsoft/Windows BMP image static int bmp_test(stbi *s) { int sz; if (get8(s) != 'B') return 0; if (get8(s) != 'M') return 0; get32le(s); // discard filesize get16le(s); // discard reserved get16le(s); // discard reserved get32le(s); // discard data offset sz = get32le(s); if (sz == 12 || sz == 40 || sz == 56 || sz == 108) return 1; return 0; } static int stbi_bmp_test(stbi *s) { int r = bmp_test(s); stbi_rewind(s); return r; } // returns 0..31 for the highest set bit static int high_bit(unsigned int z) { int n=0; if (z == 0) return -1; if (z >= 0x10000) n += 16, z >>= 16; if (z >= 0x00100) n += 8, z >>= 8; if (z >= 0x00010) n += 4, z >>= 4; if (z >= 0x00004) n += 2, z >>= 2; if (z >= 0x00002) n += 1, z >>= 1; return n; } static int bitcount(unsigned int a) { a = (a & 0x55555555) + ((a >> 1) & 0x55555555); // max 2 a = (a & 0x33333333) + ((a >> 2) & 0x33333333); // max 4 a = (a + (a >> 4)) & 0x0f0f0f0f; // max 8 per 4, now 8 bits a = (a + (a >> 8)); // max 16 per 8 bits a = (a + (a >> 16)); // max 32 per 8 bits return a & 0xff; } static int shiftsigned(int v, int shift, int bits) { int result; int z=0; if (shift < 0) v <<= -shift; else v >>= shift; result = v; z = bits; while (z < 8) { result += v >> z; z += bits; } return result; } static stbi_uc *bmp_load(stbi *s, int *x, int *y, int *comp, int req_comp) { stbi__uint8 *out; unsigned int mr=0,mg=0,mb=0,ma=0, fake_a=0; stbi_uc pal[256][4]; int psize=0,i,j,compress=0,width; int bpp, flip_vertically, pad, target, offset, hsz; if (get8(s) != 'B' || get8(s) != 'M') return epuc("not BMP", "Corrupt BMP"); get32le(s); // discard filesize get16le(s); // discard reserved get16le(s); // discard reserved offset = get32le(s); hsz = get32le(s); if (hsz != 12 && hsz != 40 && hsz != 56 && hsz != 108) return epuc("unknown BMP", "BMP type not supported: unknown"); if (hsz == 12) { s->img_x = get16le(s); s->img_y = get16le(s); } else { s->img_x = get32le(s); s->img_y = get32le(s); } if (get16le(s) != 1) return epuc("bad BMP", "bad BMP"); bpp = get16le(s); if (bpp == 1) return epuc("monochrome", "BMP type not supported: 1-bit"); flip_vertically = ((int) s->img_y) > 0; s->img_y = abs((int) s->img_y); if (hsz == 12) { if (bpp < 24) psize = (offset - 14 - 24) / 3; } else { compress = get32le(s); if (compress == 1 || compress == 2) return epuc("BMP RLE", "BMP type not supported: RLE"); get32le(s); // discard sizeof get32le(s); // discard hres get32le(s); // discard vres get32le(s); // discard colorsused get32le(s); // discard max important if (hsz == 40 || hsz == 56) { if (hsz == 56) { get32le(s); get32le(s); get32le(s); get32le(s); } if (bpp == 16 || bpp == 32) { mr = mg = mb = 0; if (compress == 0) { if (bpp == 32) { mr = 0xffu << 16; mg = 0xffu << 8; mb = 0xffu << 0; ma = 0xffu << 24; fake_a = 1; // @TODO: check for cases like alpha value is all 0 and switch it to 255 STBI_NOTUSED(fake_a); } else { mr = 31u << 10; mg = 31u << 5; mb = 31u << 0; } } else if (compress == 3) { mr = get32le(s); mg = get32le(s); mb = get32le(s); // not documented, but generated by photoshop and handled by mspaint if (mr == mg && mg == mb) { // ?!?!? return epuc("bad BMP", "bad BMP"); } } else return epuc("bad BMP", "bad BMP"); } } else { assert(hsz == 108); mr = get32le(s); mg = get32le(s); mb = get32le(s); ma = get32le(s); get32le(s); // discard color space for (i=0; i < 12; ++i) get32le(s); // discard color space parameters } if (bpp < 16) psize = (offset - 14 - hsz) >> 2; } s->img_n = ma ? 4 : 3; if (req_comp && req_comp >= 3) // we can directly decode 3 or 4 target = req_comp; else target = s->img_n; // if they want monochrome, we'll post-convert out = (stbi_uc *) malloc(target * s->img_x * s->img_y); if (!out) return epuc("outofmem", "Out of memory"); if (bpp < 16) { int z=0; if (psize == 0 || psize > 256) { free(out); return epuc("invalid", "Corrupt BMP"); } for (i=0; i < psize; ++i) { pal[i][2] = get8u(s); pal[i][1] = get8u(s); pal[i][0] = get8u(s); if (hsz != 12) get8(s); pal[i][3] = 255; } skip(s, offset - 14 - hsz - psize * (hsz == 12 ? 3 : 4)); if (bpp == 4) width = (s->img_x + 1) >> 1; else if (bpp == 8) width = s->img_x; else { free(out); return epuc("bad bpp", "Corrupt BMP"); } pad = (-width)&3; for (j=0; j < (int) s->img_y; ++j) { for (i=0; i < (int) s->img_x; i += 2) { int v=get8(s),v2=0; if (bpp == 4) { v2 = v & 15; v >>= 4; } out[z++] = pal[v][0]; out[z++] = pal[v][1]; out[z++] = pal[v][2]; if (target == 4) out[z++] = 255; if (i+1 == (int) s->img_x) break; v = (bpp == 8) ? get8(s) : v2; out[z++] = pal[v][0]; out[z++] = pal[v][1]; out[z++] = pal[v][2]; if (target == 4) out[z++] = 255; } skip(s, pad); } } else { int rshift=0,gshift=0,bshift=0,ashift=0,rcount=0,gcount=0,bcount=0,acount=0; int z = 0; int easy=0; skip(s, offset - 14 - hsz); if (bpp == 24) width = 3 * s->img_x; else if (bpp == 16) width = 2*s->img_x; else /* bpp = 32 and pad = 0 */ width=0; pad = (-width) & 3; if (bpp == 24) { easy = 1; } else if (bpp == 32) { if (mb == 0xff && mg == 0xff00 && mr == 0x00ff0000 && ma == 0xff000000) easy = 2; } if (!easy) { if (!mr || !mg || !mb) { free(out); return epuc("bad masks", "Corrupt BMP"); } // right shift amt to put high bit in position #7 rshift = high_bit(mr)-7; rcount = bitcount(mr); gshift = high_bit(mg)-7; gcount = bitcount(mg); bshift = high_bit(mb)-7; bcount = bitcount(mb); ashift = high_bit(ma)-7; acount = bitcount(ma); } for (j=0; j < (int) s->img_y; ++j) { if (easy) { for (i=0; i < (int) s->img_x; ++i) { int a; out[z+2] = get8u(s); out[z+1] = get8u(s); out[z+0] = get8u(s); z += 3; a = (easy == 2 ? get8(s) : 255); if (target == 4) out[z++] = (stbi__uint8) a; } } else { for (i=0; i < (int) s->img_x; ++i) { stbi__uint32 v = (stbi__uint32) (bpp == 16 ? get16le(s) : get32le(s)); int a; out[z++] = (stbi__uint8) shiftsigned(v & mr, rshift, rcount); out[z++] = (stbi__uint8) shiftsigned(v & mg, gshift, gcount); out[z++] = (stbi__uint8) shiftsigned(v & mb, bshift, bcount); a = (ma ? shiftsigned(v & ma, ashift, acount) : 255); if (target == 4) out[z++] = (stbi__uint8) a; } } skip(s, pad); } } if (flip_vertically) { stbi_uc t; for (j=0; j < (int) s->img_y>>1; ++j) { stbi_uc *p1 = out + j *s->img_x*target; stbi_uc *p2 = out + (s->img_y-1-j)*s->img_x*target; for (i=0; i < (int) s->img_x*target; ++i) { t = p1[i], p1[i] = p2[i], p2[i] = t; } } } if (req_comp && req_comp != target) { out = convert_format(out, target, req_comp, s->img_x, s->img_y); if (out == NULL) return out; // convert_format frees input on failure } *x = s->img_x; *y = s->img_y; if (comp) *comp = s->img_n; return out; } static stbi_uc *stbi_bmp_load(stbi *s,int *x, int *y, int *comp, int req_comp) { return bmp_load(s, x,y,comp,req_comp); } // Targa Truevision - TGA // by Jonathan Dummer static int tga_info(stbi *s, int *x, int *y, int *comp) { int tga_w, tga_h, tga_comp; int sz; get8u(s); // discard Offset sz = get8u(s); // color type if( sz > 1 ) { stbi_rewind(s); return 0; // only RGB or indexed allowed } sz = get8u(s); // image type // only RGB or grey allowed, +/- RLE if ((sz != 1) && (sz != 2) && (sz != 3) && (sz != 9) && (sz != 10) && (sz != 11)) return 0; skip(s,9); tga_w = get16le(s); if( tga_w < 1 ) { stbi_rewind(s); return 0; // test width } tga_h = get16le(s); if( tga_h < 1 ) { stbi_rewind(s); return 0; // test height } sz = get8(s); // bits per pixel // only RGB or RGBA or grey allowed if ((sz != 8) && (sz != 16) && (sz != 24) && (sz != 32)) { stbi_rewind(s); return 0; } tga_comp = sz; if (x) *x = tga_w; if (y) *y = tga_h; if (comp) *comp = tga_comp / 8; return 1; // seems to have passed everything } int stbi_tga_info(stbi *s, int *x, int *y, int *comp) { return tga_info(s, x, y, comp); } static int tga_test(stbi *s) { int sz; get8u(s); // discard Offset sz = get8u(s); // color type if ( sz > 1 ) return 0; // only RGB or indexed allowed sz = get8u(s); // image type if ( (sz != 1) && (sz != 2) && (sz != 3) && (sz != 9) && (sz != 10) && (sz != 11) ) return 0; // only RGB or grey allowed, +/- RLE get16(s); // discard palette start get16(s); // discard palette length get8(s); // discard bits per palette color entry get16(s); // discard x origin get16(s); // discard y origin if ( get16(s) < 1 ) return 0; // test width if ( get16(s) < 1 ) return 0; // test height sz = get8(s); // bits per pixel if ( (sz != 8) && (sz != 16) && (sz != 24) && (sz != 32) ) return 0; // only RGB or RGBA or grey allowed return 1; // seems to have passed everything } static int stbi_tga_test(stbi *s) { int res = tga_test(s); stbi_rewind(s); return res; } static stbi_uc *tga_load(stbi *s, int *x, int *y, int *comp, int req_comp) { // read in the TGA header stuff int tga_offset = get8u(s); int tga_indexed = get8u(s); int tga_image_type = get8u(s); int tga_is_RLE = 0; int tga_palette_start = get16le(s); int tga_palette_len = get16le(s); int tga_palette_bits = get8u(s); int tga_x_origin = get16le(s); int tga_y_origin = get16le(s); int tga_width = get16le(s); int tga_height = get16le(s); int tga_bits_per_pixel = get8u(s); int tga_comp = tga_bits_per_pixel / 8; int tga_inverted = get8u(s); // image data unsigned char *tga_data; unsigned char *tga_palette = NULL; int i, j; unsigned char raw_data[4]; int RLE_count = 0; int RLE_repeating = 0; int read_next_pixel = 1; // do a tiny bit of precessing if ( tga_image_type >= 8 ) { tga_image_type -= 8; tga_is_RLE = 1; } /* int tga_alpha_bits = tga_inverted & 15; */ tga_inverted = 1 - ((tga_inverted >> 5) & 1); // error check if ( //(tga_indexed) || (tga_width < 1) || (tga_height < 1) || (tga_image_type < 1) || (tga_image_type > 3) || ((tga_bits_per_pixel != 8) && (tga_bits_per_pixel != 16) && (tga_bits_per_pixel != 24) && (tga_bits_per_pixel != 32)) ) { return NULL; // we don't report this as a bad TGA because we don't even know if it's TGA } // If I'm paletted, then I'll use the number of bits from the palette if ( tga_indexed ) { tga_comp = tga_palette_bits / 8; } // tga info *x = tga_width; *y = tga_height; if (comp) *comp = tga_comp; tga_data = (unsigned char*)malloc( tga_width * tga_height * req_comp ); if (!tga_data) return epuc("outofmem", "Out of memory"); // skip to the data's starting position (offset usually = 0) skip(s, tga_offset ); if ( !tga_indexed && !tga_is_RLE) { for (i=0; i < tga_height; ++i) { int y = tga_inverted ? tga_height -i - 1 : i; stbi__uint8 *tga_row = tga_data + y*tga_width*tga_comp; getn(s, tga_row, tga_width * tga_comp); } } else { // do I need to load a palette? if ( tga_indexed) { // any data to skip? (offset usually = 0) skip(s, tga_palette_start ); // load the palette tga_palette = (unsigned char*)malloc( tga_palette_len * tga_palette_bits / 8 ); if (!tga_palette) { free(tga_data); return epuc("outofmem", "Out of memory"); } if (!getn(s, tga_palette, tga_palette_len * tga_palette_bits / 8 )) { free(tga_data); free(tga_palette); return epuc("bad palette", "Corrupt TGA"); } } // load the data for (i=0; i < tga_width * tga_height; ++i) { // if I'm in RLE mode, do I need to get a RLE chunk? if ( tga_is_RLE ) { if ( RLE_count == 0 ) { // yep, get the next byte as a RLE command int RLE_cmd = get8u(s); RLE_count = 1 + (RLE_cmd & 127); RLE_repeating = RLE_cmd >> 7; read_next_pixel = 1; } else if ( !RLE_repeating ) { read_next_pixel = 1; } } else { read_next_pixel = 1; } // OK, if I need to read a pixel, do it now if ( read_next_pixel ) { // load however much data we did have if ( tga_indexed ) { // read in 1 byte, then perform the lookup int pal_idx = get8u(s); if ( pal_idx >= tga_palette_len ) { // invalid index pal_idx = 0; } pal_idx *= tga_bits_per_pixel / 8; for (j = 0; j*8 < tga_bits_per_pixel; ++j) { raw_data[j] = tga_palette[pal_idx+j]; } } else { // read in the data raw for (j = 0; j*8 < tga_bits_per_pixel; ++j) { raw_data[j] = get8u(s); } } // clear the reading flag for the next pixel read_next_pixel = 0; } // end of reading a pixel // copy data for (j = 0; j < tga_comp; ++j) tga_data[i*tga_comp+j] = raw_data[j]; // in case we're in RLE mode, keep counting down --RLE_count; } // do I need to invert the image? if ( tga_inverted ) { for (j = 0; j*2 < tga_height; ++j) { int index1 = j * tga_width * req_comp; int index2 = (tga_height - 1 - j) * tga_width * req_comp; for (i = tga_width * req_comp; i > 0; --i) { unsigned char temp = tga_data[index1]; tga_data[index1] = tga_data[index2]; tga_data[index2] = temp; ++index1; ++index2; } } } // clear my palette, if I had one if ( tga_palette != NULL ) { free( tga_palette ); } } // swap RGB if (tga_comp >= 3) { unsigned char* tga_pixel = tga_data; for (i=0; i < tga_width * tga_height; ++i) { unsigned char temp = tga_pixel[0]; tga_pixel[0] = tga_pixel[2]; tga_pixel[2] = temp; tga_pixel += tga_comp; } } // convert to target component count if (req_comp && req_comp != tga_comp) tga_data = convert_format(tga_data, tga_comp, req_comp, tga_width, tga_height); // the things I do to get rid of an error message, and yet keep // Microsoft's C compilers happy... [8^( tga_palette_start = tga_palette_len = tga_palette_bits = tga_x_origin = tga_y_origin = 0; // OK, done return tga_data; } static stbi_uc *stbi_tga_load(stbi *s, int *x, int *y, int *comp, int req_comp) { return tga_load(s,x,y,comp,req_comp); } // ************************************************************************************************* // Photoshop PSD loader -- PD by Thatcher Ulrich, integration by Nicolas Schulz, tweaked by STB static int psd_test(stbi *s) { if (get32(s) != 0x38425053) return 0; // "8BPS" else return 1; } static int stbi_psd_test(stbi *s) { int r = psd_test(s); stbi_rewind(s); return r; } static stbi_uc *psd_load(stbi *s, int *x, int *y, int *comp, int req_comp) { int pixelCount; int channelCount, compression; int channel, i, count, len; int w,h; stbi__uint8 *out; // Check identifier if (get32(s) != 0x38425053) // "8BPS" return epuc("not PSD", "Corrupt PSD image"); // Check file type version. if (get16(s) != 1) return epuc("wrong version", "Unsupported version of PSD image"); // Skip 6 reserved bytes. skip(s, 6 ); // Read the number of channels (R, G, B, A, etc). channelCount = get16(s); if (channelCount < 0 || channelCount > 16) return epuc("wrong channel count", "Unsupported number of channels in PSD image"); // Read the rows and columns of the image. h = get32(s); w = get32(s); // Make sure the depth is 8 bits. if (get16(s) != 8) return epuc("unsupported bit depth", "PSD bit depth is not 8 bit"); // Make sure the color mode is RGB. // Valid options are: // 0: Bitmap // 1: Grayscale // 2: Indexed color // 3: RGB color // 4: CMYK color // 7: Multichannel // 8: Duotone // 9: Lab color if (get16(s) != 3) return epuc("wrong color format", "PSD is not in RGB color format"); // Skip the Mode Data. (It's the palette for indexed color; other info for other modes.) skip(s,get32(s) ); // Skip the image resources. (resolution, pen tool paths, etc) skip(s, get32(s) ); // Skip the reserved data. skip(s, get32(s) ); // Find out if the data is compressed. // Known values: // 0: no compression // 1: RLE compressed compression = get16(s); if (compression > 1) return epuc("bad compression", "PSD has an unknown compression format"); // Create the destination image. out = (stbi_uc *) malloc(4 * w*h); if (!out) return epuc("outofmem", "Out of memory"); pixelCount = w*h; // Initialize the data to zero. //memset( out, 0, pixelCount * 4 ); // Finally, the image data. if (compression) { // RLE as used by .PSD and .TIFF // Loop until you get the number of unpacked bytes you are expecting: // Read the next source byte into n. // If n is between 0 and 127 inclusive, copy the next n+1 bytes literally. // Else if n is between -127 and -1 inclusive, copy the next byte -n+1 times. // Else if n is 128, noop. // Endloop // The RLE-compressed data is preceeded by a 2-byte data count for each row in the data, // which we're going to just skip. skip(s, h * channelCount * 2 ); // Read the RLE data by channel. for (channel = 0; channel < 4; channel++) { stbi__uint8 *p; p = out+channel; if (channel >= channelCount) { // Fill this channel with default data. for (i = 0; i < pixelCount; i++) *p = (channel == 3 ? 255 : 0), p += 4; } else { // Read the RLE data. count = 0; while (count < pixelCount) { len = get8(s); if (len == 128) { // No-op. } else if (len < 128) { // Copy next len+1 bytes literally. len++; count += len; while (len) { *p = get8u(s); p += 4; len--; } } else if (len > 128) { stbi__uint8 val; // Next -len+1 bytes in the dest are replicated from next source byte. // (Interpret len as a negative 8-bit int.) len ^= 0x0FF; len += 2; val = get8u(s); count += len; while (len) { *p = val; p += 4; len--; } } } } } } else { // We're at the raw image data. It's each channel in order (Red, Green, Blue, Alpha, ...) // where each channel consists of an 8-bit value for each pixel in the image. // Read the data by channel. for (channel = 0; channel < 4; channel++) { stbi__uint8 *p; p = out + channel; if (channel > channelCount) { // Fill this channel with default data. for (i = 0; i < pixelCount; i++) *p = channel == 3 ? 255 : 0, p += 4; } else { // Read the data. for (i = 0; i < pixelCount; i++) *p = get8u(s), p += 4; } } } if (req_comp && req_comp != 4) { out = convert_format(out, 4, req_comp, w, h); if (out == NULL) return out; // convert_format frees input on failure } if (comp) *comp = channelCount; *y = h; *x = w; return out; } static stbi_uc *stbi_psd_load(stbi *s, int *x, int *y, int *comp, int req_comp) { return psd_load(s,x,y,comp,req_comp); } // ************************************************************************************************* // Softimage PIC loader // by Tom Seddon // // See http://softimage.wiki.softimage.com/index.php/INFO:_PIC_file_format // See http://ozviz.wasp.uwa.edu.au/~pbourke/dataformats/softimagepic/ static int pic_is4(stbi *s,const char *str) { int i; for (i=0; i<4; ++i) if (get8(s) != (stbi_uc)str[i]) return 0; return 1; } static int pic_test(stbi *s) { int i; if (!pic_is4(s,"\x53\x80\xF6\x34")) return 0; for(i=0;i<84;++i) get8(s); if (!pic_is4(s,"PICT")) return 0; return 1; } typedef struct { stbi_uc size,type,channel; } pic_packet_t; static stbi_uc *pic_readval(stbi *s, int channel, stbi_uc *dest) { int mask=0x80, i; for (i=0; i<4; ++i, mask>>=1) { if (channel & mask) { if (at_eof(s)) return epuc("bad file","PIC file too short"); dest[i]=get8u(s); } } return dest; } static void pic_copyval(int channel,stbi_uc *dest,const stbi_uc *src) { int mask=0x80,i; for (i=0;i<4; ++i, mask>>=1) if (channel&mask) dest[i]=src[i]; } static stbi_uc *pic_load2(stbi *s,int width,int height,int *comp, stbi_uc *result) { int act_comp=0,num_packets=0,y,chained; pic_packet_t packets[10]; // this will (should...) cater for even some bizarre stuff like having data // for the same channel in multiple packets. do { pic_packet_t *packet; if (num_packets==sizeof(packets)/sizeof(packets[0])) return epuc("bad format","too many packets"); packet = &packets[num_packets++]; chained = get8(s); packet->size = get8u(s); packet->type = get8u(s); packet->channel = get8u(s); act_comp |= packet->channel; if (at_eof(s)) return epuc("bad file","file too short (reading packets)"); if (packet->size != 8) return epuc("bad format","packet isn't 8bpp"); } while (chained); *comp = (act_comp & 0x10 ? 4 : 3); // has alpha channel? for(y=0; ytype) { default: return epuc("bad format","packet has bad compression type"); case 0: {//uncompressed int x; for(x=0;xchannel,dest)) return 0; break; } case 1://Pure RLE { int left=width, i; while (left>0) { stbi_uc count,value[4]; count=get8u(s); if (at_eof(s)) return epuc("bad file","file too short (pure read count)"); if (count > left) count = (stbi__uint8) left; if (!pic_readval(s,packet->channel,value)) return 0; for(i=0; ichannel,dest,value); left -= count; } } break; case 2: {//Mixed RLE int left=width; while (left>0) { int count = get8(s), i; if (at_eof(s)) return epuc("bad file","file too short (mixed read count)"); if (count >= 128) { // Repeated stbi_uc value[4]; int i; if (count==128) count = get16(s); else count -= 127; if (count > left) return epuc("bad file","scanline overrun"); if (!pic_readval(s,packet->channel,value)) return 0; for(i=0;ichannel,dest,value); } else { // Raw ++count; if (count>left) return epuc("bad file","scanline overrun"); for(i=0;ichannel,dest)) return 0; } left-=count; } break; } } } } return result; } static stbi_uc *pic_load(stbi *s,int *px,int *py,int *comp,int req_comp) { stbi_uc *result; int i, x,y; for (i=0; i<92; ++i) get8(s); x = get16(s); y = get16(s); if (at_eof(s)) return epuc("bad file","file too short (pic header)"); if ((1 << 28) / x < y) return epuc("too large", "Image too large to decode"); get32(s); //skip `ratio' get16(s); //skip `fields' get16(s); //skip `pad' // intermediate buffer is RGBA result = (stbi_uc *) malloc(x*y*4); memset(result, 0xff, x*y*4); if (!pic_load2(s,x,y,comp, result)) { free(result); result=0; } *px = x; *py = y; if (req_comp == 0) req_comp = *comp; result=convert_format(result,4,req_comp,x,y); return result; } static int stbi_pic_test(stbi *s) { int r = pic_test(s); stbi_rewind(s); return r; } static stbi_uc *stbi_pic_load(stbi *s, int *x, int *y, int *comp, int req_comp) { return pic_load(s,x,y,comp,req_comp); } // ************************************************************************************************* // GIF loader -- public domain by Jean-Marc Lienher -- simplified/shrunk by stb typedef struct stbi_gif_lzw_struct { stbi__int16 prefix; stbi__uint8 first; stbi__uint8 suffix; } stbi_gif_lzw; typedef struct stbi_gif_struct { int w,h; stbi_uc *out; // output buffer (always 4 components) int flags, bgindex, ratio, transparent, eflags; stbi__uint8 pal[256][4]; stbi__uint8 lpal[256][4]; stbi_gif_lzw codes[4096]; stbi__uint8 *color_table; int parse, step; int lflags; int start_x, start_y; int max_x, max_y; int cur_x, cur_y; int line_size; } stbi_gif; static int gif_test(stbi *s) { int sz; if (get8(s) != 'G' || get8(s) != 'I' || get8(s) != 'F' || get8(s) != '8') return 0; sz = get8(s); if (sz != '9' && sz != '7') return 0; if (get8(s) != 'a') return 0; return 1; } static int stbi_gif_test(stbi *s) { int r = gif_test(s); stbi_rewind(s); return r; } static void stbi_gif_parse_colortable(stbi *s, stbi__uint8 pal[256][4], int num_entries, int transp) { int i; for (i=0; i < num_entries; ++i) { pal[i][2] = get8u(s); pal[i][1] = get8u(s); pal[i][0] = get8u(s); pal[i][3] = transp ? 0 : 255; } } static int stbi_gif_header(stbi *s, stbi_gif *g, int *comp, int is_info) { stbi__uint8 version; if (get8(s) != 'G' || get8(s) != 'I' || get8(s) != 'F' || get8(s) != '8') return e("not GIF", "Corrupt GIF"); version = get8u(s); if (version != '7' && version != '9') return e("not GIF", "Corrupt GIF"); if (get8(s) != 'a') return e("not GIF", "Corrupt GIF"); failure_reason = ""; g->w = get16le(s); g->h = get16le(s); g->flags = get8(s); g->bgindex = get8(s); g->ratio = get8(s); g->transparent = -1; if (comp != 0) *comp = 4; // can't actually tell whether it's 3 or 4 until we parse the comments if (is_info) return 1; if (g->flags & 0x80) stbi_gif_parse_colortable(s,g->pal, 2 << (g->flags & 7), -1); return 1; } static int stbi_gif_info_raw(stbi *s, int *x, int *y, int *comp) { stbi_gif g; if (!stbi_gif_header(s, &g, comp, 1)) { stbi_rewind( s ); return 0; } if (x) *x = g.w; if (y) *y = g.h; return 1; } static void stbi_out_gif_code(stbi_gif *g, stbi__uint16 code) { stbi__uint8 *p, *c; // recurse to decode the prefixes, since the linked-list is backwards, // and working backwards through an interleaved image would be nasty if (g->codes[code].prefix >= 0) stbi_out_gif_code(g, g->codes[code].prefix); if (g->cur_y >= g->max_y) return; p = &g->out[g->cur_x + g->cur_y]; c = &g->color_table[g->codes[code].suffix * 4]; if (c[3] >= 128) { p[0] = c[2]; p[1] = c[1]; p[2] = c[0]; p[3] = c[3]; } g->cur_x += 4; if (g->cur_x >= g->max_x) { g->cur_x = g->start_x; g->cur_y += g->step; while (g->cur_y >= g->max_y && g->parse > 0) { g->step = (1 << g->parse) * g->line_size; g->cur_y = g->start_y + (g->step >> 1); --g->parse; } } } static stbi__uint8 *stbi_process_gif_raster(stbi *s, stbi_gif *g) { stbi__uint8 lzw_cs; stbi__int32 len, code; stbi__uint32 first; stbi__int32 codesize, codemask, avail, oldcode, bits, valid_bits, clear; stbi_gif_lzw *p; lzw_cs = get8u(s); clear = 1 << lzw_cs; first = 1; codesize = lzw_cs + 1; codemask = (1 << codesize) - 1; bits = 0; valid_bits = 0; for (code = 0; code < clear; code++) { g->codes[code].prefix = -1; g->codes[code].first = (stbi__uint8) code; g->codes[code].suffix = (stbi__uint8) code; } // support no starting clear code avail = clear+2; oldcode = -1; len = 0; for(;;) { if (valid_bits < codesize) { if (len == 0) { len = get8(s); // start new block if (len == 0) return g->out; } --len; bits |= (stbi__int32) get8(s) << valid_bits; valid_bits += 8; } else { stbi__int32 code = bits & codemask; bits >>= codesize; valid_bits -= codesize; // @OPTIMIZE: is there some way we can accelerate the non-clear path? if (code == clear) { // clear code codesize = lzw_cs + 1; codemask = (1 << codesize) - 1; avail = clear + 2; oldcode = -1; first = 0; } else if (code == clear + 1) { // end of stream code skip(s, len); while ((len = get8(s)) > 0) skip(s,len); return g->out; } else if (code <= avail) { if (first) return epuc("no clear code", "Corrupt GIF"); if (oldcode >= 0) { p = &g->codes[avail++]; if (avail > 4096) return epuc("too many codes", "Corrupt GIF"); p->prefix = (stbi__int16) oldcode; p->first = g->codes[oldcode].first; p->suffix = (code == avail) ? p->first : g->codes[code].first; } else if (code == avail) return epuc("illegal code in raster", "Corrupt GIF"); stbi_out_gif_code(g, (stbi__uint16) code); if ((avail & codemask) == 0 && avail <= 0x0FFF) { codesize++; codemask = (1 << codesize) - 1; } oldcode = code; } else { return epuc("illegal code in raster", "Corrupt GIF"); } } } } static void stbi_fill_gif_background(stbi_gif *g) { int i; stbi__uint8 *c = g->pal[g->bgindex]; // @OPTIMIZE: write a dword at a time for (i = 0; i < g->w * g->h * 4; i += 4) { stbi__uint8 *p = &g->out[i]; p[0] = c[2]; p[1] = c[1]; p[2] = c[0]; p[3] = c[3]; } } // this function is designed to support animated gifs, although stb_image doesn't support it static stbi__uint8 *stbi_gif_load_next(stbi *s, stbi_gif *g, int *comp, int req_comp) { int i; stbi__uint8 *old_out = 0; if (g->out == 0) { if (!stbi_gif_header(s, g, comp,0)) return 0; // failure_reason set by stbi_gif_header g->out = (stbi__uint8 *) malloc(4 * g->w * g->h); if (g->out == 0) return epuc("outofmem", "Out of memory"); stbi_fill_gif_background(g); } else { // animated-gif-only path if (((g->eflags & 0x1C) >> 2) == 3) { old_out = g->out; g->out = (stbi__uint8 *) malloc(4 * g->w * g->h); if (g->out == 0) return epuc("outofmem", "Out of memory"); memcpy(g->out, old_out, g->w*g->h*4); } } for (;;) { switch (get8(s)) { case 0x2C: /* Image Descriptor */ { stbi__int32 x, y, w, h; stbi__uint8 *o; x = get16le(s); y = get16le(s); w = get16le(s); h = get16le(s); if (((x + w) > (g->w)) || ((y + h) > (g->h))) return epuc("bad Image Descriptor", "Corrupt GIF"); g->line_size = g->w * 4; g->start_x = x * 4; g->start_y = y * g->line_size; g->max_x = g->start_x + w * 4; g->max_y = g->start_y + h * g->line_size; g->cur_x = g->start_x; g->cur_y = g->start_y; g->lflags = get8(s); if (g->lflags & 0x40) { g->step = 8 * g->line_size; // first interlaced spacing g->parse = 3; } else { g->step = g->line_size; g->parse = 0; } if (g->lflags & 0x80) { stbi_gif_parse_colortable(s,g->lpal, 2 << (g->lflags & 7), g->eflags & 0x01 ? g->transparent : -1); g->color_table = (stbi__uint8 *) g->lpal; } else if (g->flags & 0x80) { for (i=0; i < 256; ++i) // @OPTIMIZE: reset only the previous transparent g->pal[i][3] = 255; if (g->transparent >= 0 && (g->eflags & 0x01)) g->pal[g->transparent][3] = 0; g->color_table = (stbi__uint8 *) g->pal; } else return epuc("missing color table", "Corrupt GIF"); o = stbi_process_gif_raster(s, g); if (o == NULL) return NULL; if (req_comp && req_comp != 4) o = convert_format(o, 4, req_comp, g->w, g->h); return o; } case 0x21: // Comment Extension. { int len; if (get8(s) == 0xF9) { // Graphic Control Extension. len = get8(s); if (len == 4) { g->eflags = get8(s); get16le(s); // delay g->transparent = get8(s); } else { skip(s, len); break; } } while ((len = get8(s)) != 0) skip(s, len); break; } case 0x3B: // gif stream termination code return (stbi__uint8 *) 1; default: return epuc("unknown code", "Corrupt GIF"); } } } static stbi_uc *stbi_gif_load(stbi *s, int *x, int *y, int *comp, int req_comp) { stbi__uint8 *u = 0; stbi_gif g={0}; u = stbi_gif_load_next(s, &g, comp, req_comp); if (u == (void *) 1) u = 0; // end of animated gif marker if (u) { *x = g.w; *y = g.h; } return u; } static int stbi_gif_info(stbi *s, int *x, int *y, int *comp) { return stbi_gif_info_raw(s,x,y,comp); } // ************************************************************************************************* // Radiance RGBE HDR loader // originally by Nicolas Schulz #ifndef STBI_NO_HDR static int hdr_test(stbi *s) { const char *signature = "#?RADIANCE\n"; int i; for (i=0; signature[i]; ++i) if (get8(s) != signature[i]) return 0; return 1; } static int stbi_hdr_test(stbi* s) { int r = hdr_test(s); stbi_rewind(s); return r; } #define HDR_BUFLEN 1024 static char *hdr_gettoken(stbi *z, char *buffer) { int len=0; char c = '\0'; c = (char) get8(z); while (!at_eof(z) && c != '\n') { buffer[len++] = c; if (len == HDR_BUFLEN-1) { // flush to end of line while (!at_eof(z) && get8(z) != '\n') ; break; } c = (char) get8(z); } buffer[len] = 0; return buffer; } static void hdr_convert(float *output, stbi_uc *input, int req_comp) { if ( input[3] != 0 ) { float f1; // Exponent f1 = (float) ldexp(1.0f, input[3] - (int)(128 + 8)); if (req_comp <= 2) output[0] = (input[0] + input[1] + input[2]) * f1 / 3; else { output[0] = input[0] * f1; output[1] = input[1] * f1; output[2] = input[2] * f1; } if (req_comp == 2) output[1] = 1; if (req_comp == 4) output[3] = 1; } else { switch (req_comp) { case 4: output[3] = 1; /* fallthrough */ case 3: output[0] = output[1] = output[2] = 0; break; case 2: output[1] = 1; /* fallthrough */ case 1: output[0] = 0; break; } } } static float *hdr_load(stbi *s, int *x, int *y, int *comp, int req_comp) { char buffer[HDR_BUFLEN]; char *token; int valid = 0; int width, height; stbi_uc *scanline; float *hdr_data; int len; unsigned char count, value; int i, j, k, c1,c2, z; // Check identifier if (strcmp(hdr_gettoken(s,buffer), "#?RADIANCE") != 0) return epf("not HDR", "Corrupt HDR image"); // Parse header for(;;) { token = hdr_gettoken(s,buffer); if (token[0] == 0) break; if (strcmp(token, "FORMAT=32-bit_rle_rgbe") == 0) valid = 1; } if (!valid) return epf("unsupported format", "Unsupported HDR format"); // Parse width and height // can't use sscanf() if we're not using stdio! token = hdr_gettoken(s,buffer); if (strncmp(token, "-Y ", 3)) return epf("unsupported data layout", "Unsupported HDR format"); token += 3; height = (int) strtol(token, &token, 10); while (*token == ' ') ++token; if (strncmp(token, "+X ", 3)) return epf("unsupported data layout", "Unsupported HDR format"); token += 3; width = (int) strtol(token, NULL, 10); *x = width; *y = height; *comp = 3; if (req_comp == 0) req_comp = 3; // Read data hdr_data = (float *) malloc(height * width * req_comp * sizeof(float)); // Load image data // image data is stored as some number of sca if ( width < 8 || width >= 32768) { // Read flat data for (j=0; j < height; ++j) { for (i=0; i < width; ++i) { stbi_uc rgbe[4]; main_decode_loop: getn(s, rgbe, 4); hdr_convert(hdr_data + j * width * req_comp + i * req_comp, rgbe, req_comp); } } } else { // Read RLE-encoded data scanline = NULL; for (j = 0; j < height; ++j) { c1 = get8(s); c2 = get8(s); len = get8(s); if (c1 != 2 || c2 != 2 || (len & 0x80)) { // not run-length encoded, so we have to actually use THIS data as a decoded // pixel (note this can't be a valid pixel--one of RGB must be >= 128) stbi__uint8 rgbe[4]; rgbe[0] = (stbi__uint8) c1; rgbe[1] = (stbi__uint8) c2; rgbe[2] = (stbi__uint8) len; rgbe[3] = (stbi__uint8) get8u(s); hdr_convert(hdr_data, rgbe, req_comp); i = 1; j = 0; free(scanline); goto main_decode_loop; // yes, this makes no sense } len <<= 8; len |= get8(s); if (len != width) { free(hdr_data); free(scanline); return epf("invalid decoded scanline length", "corrupt HDR"); } if (scanline == NULL) scanline = (stbi_uc *) malloc(width * 4); for (k = 0; k < 4; ++k) { i = 0; while (i < width) { count = get8u(s); if (count > 128) { // Run value = get8u(s); count -= 128; for (z = 0; z < count; ++z) scanline[i++ * 4 + k] = value; } else { // Dump for (z = 0; z < count; ++z) scanline[i++ * 4 + k] = get8u(s); } } } for (i=0; i < width; ++i) hdr_convert(hdr_data+(j*width + i)*req_comp, scanline + i*4, req_comp); } free(scanline); } return hdr_data; } static float *stbi_hdr_load(stbi *s, int *x, int *y, int *comp, int req_comp) { return hdr_load(s,x,y,comp,req_comp); } static int stbi_hdr_info(stbi *s, int *x, int *y, int *comp) { char buffer[HDR_BUFLEN]; char *token; int valid = 0; if (strcmp(hdr_gettoken(s,buffer), "#?RADIANCE") != 0) { stbi_rewind( s ); return 0; } for(;;) { token = hdr_gettoken(s,buffer); if (token[0] == 0) break; if (strcmp(token, "FORMAT=32-bit_rle_rgbe") == 0) valid = 1; } if (!valid) { stbi_rewind( s ); return 0; } token = hdr_gettoken(s,buffer); if (strncmp(token, "-Y ", 3)) { stbi_rewind( s ); return 0; } token += 3; *y = (int) strtol(token, &token, 10); while (*token == ' ') ++token; if (strncmp(token, "+X ", 3)) { stbi_rewind( s ); return 0; } token += 3; *x = (int) strtol(token, NULL, 10); *comp = 3; return 1; } #endif // STBI_NO_HDR static int stbi_bmp_info(stbi *s, int *x, int *y, int *comp) { int hsz; if (get8(s) != 'B' || get8(s) != 'M') { stbi_rewind( s ); return 0; } skip(s,12); hsz = get32le(s); if (hsz != 12 && hsz != 40 && hsz != 56 && hsz != 108) { stbi_rewind( s ); return 0; } if (hsz == 12) { *x = get16le(s); *y = get16le(s); } else { *x = get32le(s); *y = get32le(s); } if (get16le(s) != 1) { stbi_rewind( s ); return 0; } *comp = get16le(s) / 8; return 1; } static int stbi_psd_info(stbi *s, int *x, int *y, int *comp) { int channelCount; if (get32(s) != 0x38425053) { stbi_rewind( s ); return 0; } if (get16(s) != 1) { stbi_rewind( s ); return 0; } skip(s, 6); channelCount = get16(s); if (channelCount < 0 || channelCount > 16) { stbi_rewind( s ); return 0; } *y = get32(s); *x = get32(s); if (get16(s) != 8) { stbi_rewind( s ); return 0; } if (get16(s) != 3) { stbi_rewind( s ); return 0; } *comp = 4; return 1; } static int stbi_pic_info(stbi *s, int *x, int *y, int *comp) { int act_comp=0,num_packets=0,chained; pic_packet_t packets[10]; skip(s, 92); *x = get16(s); *y = get16(s); if (at_eof(s)) return 0; if ( (*x) != 0 && (1 << 28) / (*x) < (*y)) { stbi_rewind( s ); return 0; } skip(s, 8); do { pic_packet_t *packet; if (num_packets==sizeof(packets)/sizeof(packets[0])) return 0; packet = &packets[num_packets++]; chained = get8(s); packet->size = get8u(s); packet->type = get8u(s); packet->channel = get8u(s); act_comp |= packet->channel; if (at_eof(s)) { stbi_rewind( s ); return 0; } if (packet->size != 8) { stbi_rewind( s ); return 0; } } while (chained); *comp = (act_comp & 0x10 ? 4 : 3); return 1; } static int stbi_info_main(stbi *s, int *x, int *y, int *comp) { if (stbi_jpeg_info(s, x, y, comp)) return 1; if (stbi_png_info(s, x, y, comp)) return 1; if (stbi_gif_info(s, x, y, comp)) return 1; if (stbi_bmp_info(s, x, y, comp)) return 1; if (stbi_psd_info(s, x, y, comp)) return 1; if (stbi_pic_info(s, x, y, comp)) return 1; #ifndef STBI_NO_HDR if (stbi_hdr_info(s, x, y, comp)) return 1; #endif // test tga last because it's a crappy test! if (stbi_tga_info(s, x, y, comp)) return 1; return e("unknown image type", "Image not of any known type, or corrupt"); } #ifndef STBI_NO_STDIO int stbi_info(char const *filename, int *x, int *y, int *comp) { FILE *f = fopen(filename, "rb"); int result; if (!f) return e("can't fopen", "Unable to open file"); result = stbi_info_from_file(f, x, y, comp); fclose(f); return result; } int stbi_info_from_file(FILE *f, int *x, int *y, int *comp) { int r; stbi s; long pos = ftell(f); start_file(&s, f); r = stbi_info_main(&s,x,y,comp); fseek(f,pos,SEEK_SET); return r; } #endif // !STBI_NO_STDIO int stbi_info_from_memory(stbi_uc const *buffer, int len, int *x, int *y, int *comp) { stbi s; start_mem(&s,buffer,len); return stbi_info_main(&s,x,y,comp); } int stbi_info_from_callbacks(stbi_io_callbacks const *c, void *user, int *x, int *y, int *comp) { stbi s; start_callbacks(&s, (stbi_io_callbacks *) c, user); return stbi_info_main(&s,x,y,comp); } #endif // STBI_HEADER_FILE_ONLY #if !defined(STBI_NO_STDIO) && defined(_MSC_VER) && _MSC_VER >= 1400 #pragma warning(pop) #endif /* revision history: 1.35 (2014-05-27) various warnings fix broken STBI_SIMD path fix bug where stbi_load_from_file no longer left file pointer in correct place fix broken non-easy path for 32-bit BMP (possibly never used) TGA optimization by Arseny Kapoulkine 1.34 (unknown) use STBI_NOTUSED in resample_row_generic(), fix one more leak in tga failure case 1.33 (2011-07-14) make stbi_is_hdr work in STBI_NO_HDR (as specified), minor compiler-friendly improvements 1.32 (2011-07-13) support for "info" function for all supported filetypes (SpartanJ) 1.31 (2011-06-20) a few more leak fixes, bug in PNG handling (SpartanJ) 1.30 (2011-06-11) added ability to load files via callbacks to accomidate custom input streams (Ben Wenger) removed deprecated format-specific test/load functions removed support for installable file formats (stbi_loader) -- would have been broken for IO callbacks anyway error cases in bmp and tga give messages and don't leak (Raymond Barbiero, grisha) fix inefficiency in decoding 32-bit BMP (David Woo) 1.29 (2010-08-16) various warning fixes from Aurelien Pocheville 1.28 (2010-08-01) fix bug in GIF palette transparency (SpartanJ) 1.27 (2010-08-01) cast-to-stbi__uint8 to fix warnings 1.26 (2010-07-24) fix bug in file buffering for PNG reported by SpartanJ 1.25 (2010-07-17) refix trans_data warning (Won Chun) 1.24 (2010-07-12) perf improvements reading from files on platforms with lock-heavy fgetc() minor perf improvements for jpeg deprecated type-specific functions so we'll get feedback if they're needed attempt to fix trans_data warning (Won Chun) 1.23 fixed bug in iPhone support 1.22 (2010-07-10) removed image *writing* support stbi_info support from Jetro Lauha GIF support from Jean-Marc Lienher iPhone PNG-extensions from James Brown warning-fixes from Nicolas Schulz and Janez Zemva (i.e. Janez (U+017D)emva) 1.21 fix use of 'stbi__uint8' in header (reported by jon blow) 1.20 added support for Softimage PIC, by Tom Seddon 1.19 bug in interlaced PNG corruption check (found by ryg) 1.18 2008-08-02 fix a threading bug (local mutable static) 1.17 support interlaced PNG 1.16 major bugfix - convert_format converted one too many pixels 1.15 initialize some fields for thread safety 1.14 fix threadsafe conversion bug header-file-only version (#define STBI_HEADER_FILE_ONLY before including) 1.13 threadsafe 1.12 const qualifiers in the API 1.11 Support installable IDCT, colorspace conversion routines 1.10 Fixes for 64-bit (don't use "unsigned long") optimized upsampling by Fabian "ryg" Giesen 1.09 Fix format-conversion for PSD code (bad global variables!) 1.08 Thatcher Ulrich's PSD code integrated by Nicolas Schulz 1.07 attempt to fix C++ warning/errors again 1.06 attempt to fix C++ warning/errors again 1.05 fix TGA loading to return correct *comp and use good luminance calc 1.04 default float alpha is 1, not 255; use 'void *' for stbi_image_free 1.03 bugfixes to STBI_NO_STDIO, STBI_NO_HDR 1.02 support for (subset of) HDR files, float interface for preferred access to them 1.01 fix bug: possible bug in handling right-side up bmps... not sure fix bug: the stbi_bmp_load() and stbi_tga_load() functions didn't work at all 1.00 interface to zlib that skips zlib header 0.99 correct handling of alpha in palette 0.98 TGA loader by lonesock; dynamically add loaders (untested) 0.97 jpeg errors on too large a file; also catch another malloc failure 0.96 fix detection of invalid v value - particleman@mollyrocket forum 0.95 during header scan, seek to markers in case of padding 0.94 STBI_NO_STDIO to disable stdio usage; rename all #defines the same 0.93 handle jpegtran output; verbose errors 0.92 read 4,8,16,24,32-bit BMP files of several formats 0.91 output 24-bit Windows 3.0 BMP files 0.90 fix a few more warnings; bump version number to approach 1.0 0.61 bugfixes due to Marc LeBlanc, Christopher Lloyd 0.60 fix compiling as c++ 0.59 fix warnings: merge Dave Moore's -Wall fixes 0.58 fix bug: zlib uncompressed mode len/nlen was wrong endian 0.57 fix bug: jpg last huffman symbol before marker was >9 bits but less than 16 available 0.56 fix bug: zlib uncompressed mode len vs. nlen 0.55 fix bug: restart_interval not initialized to 0 0.54 allow NULL for 'int *comp' 0.53 fix bug in png 3->4; speedup png decoding 0.52 png handles req_comp=3,4 directly; minor cleanup; jpeg comments 0.51 obey req_comp requests, 1-component jpegs return as 1-component, on 'test' only check type, not whether we support this variant 0.50 first released version */ uTox/third_party/stb/stb/deprecated/rrsprintf.h0000600000175000001440000010632214003056224020714 0ustar rakusers#ifndef RR_SPRINTF_H_INCLUDE #define RR_SPRINTF_H_INCLUDE /* Single file sprintf replacement. Originally written by Jeff Roberts at RAD Game Tools - 2015/10/20. Hereby placed in public domain. This is a full sprintf replacement that supports everything that the C runtime sprintfs support, including float/double, 64-bit integers, hex floats, field parameters (%*.*d stuff), length reads backs, etc. Why would you need this if sprintf already exists? Well, first off, it's *much* faster (see below). It's also much smaller than the CRT versions code-space-wise. We've also added some simple improvements that are super handy (commas in thousands, callbacks at buffer full, for example). Finally, the format strings for MSVC and GCC differ for 64-bit integers (among other small things), so this lets you use the same format strings in cross platform code. It uses the standard single file trick of being both the header file and the source itself. If you just include it normally, you just get the header file function definitions. To get the code, you include it from a C or C++ file and define RR_SPRINTF_IMPLEMENTATION first. It only uses va_args macros from the C runtime to do it's work. It does cast doubles to S64s and shifts and divides U64s, which does drag in CRT code on most platforms. It compiles to roughly 8K with float support, and 4K without. As a comparison, when using MSVC static libs, calling sprintf drags in 16K. API: ==== int rrsprintf( char * buf, char const * fmt, ... ) int rrsnprintf( char * buf, int count, char const * fmt, ... ) Convert an arg list into a buffer. rrsnprintf always returns a zero-terminated string (unlike regular snprintf). int rrvsprintf( char * buf, char const * fmt, va_list va ) int rrvsnprintf( char * buf, int count, char const * fmt, va_list va ) Convert a va_list arg list into a buffer. rrvsnprintf always returns a zero-terminated string (unlike regular snprintf). int rrvsprintfcb( RRSPRINTFCB * callback, void * user, char * buf, char const * fmt, va_list va ) typedef char * RRSPRINTFCB( char const * buf, void * user, int len ); Convert into a buffer, calling back every RR_SPRINTF_MIN chars. Your callback can then copy the chars out, print them or whatever. This function is actually the workhorse for everything else. The buffer you pass in must hold at least RR_SPRINTF_MIN characters. // you return the next buffer to use or 0 to stop converting void rrsetseparators( char comma, char period ) Set the comma and period characters to use. FLOATS/DOUBLES: =============== This code uses a internal float->ascii conversion method that uses doubles with error correction (double-doubles, for ~105 bits of precision). This conversion is round-trip perfect - that is, an atof of the values output here will give you the bit-exact double back. One difference is that our insignificant digits will be different than with MSVC or GCC (but they don't match each other either). We also don't attempt to find the minimum length matching float (pre-MSVC15 doesn't either). If you don't need float or doubles at all, define RR_SPRINTF_NOFLOAT and you'll save 4K of code space. 64-BIT INTS: ============ This library also supports 64-bit integers and you can use MSVC style or GCC style indicators (%I64d or %lld). It supports the C99 specifiers for size_t and ptr_diff_t (%jd %zd) as well. EXTRAS: ======= Like some GCCs, for integers and floats, you can use a ' (single quote) specifier and commas will be inserted on the thousands: "%'d" on 12345 would print 12,345. For integers and floats, you can use a "$" specifier and the number will be converted to float and then divided to get kilo, mega, giga or tera and then printed, so "%$d" 1024 is "1.0 k", "%$.2d" 2536000 is "2.42 m", etc. In addition to octal and hexadecimal conversions, you can print integers in binary: "%b" for 256 would print 100. PERFORMANCE vs MSVC 2008 32-/64-bit (GCC is even slower than MSVC): =================================================================== "%d" across all 32-bit ints (4.8x/4.0x faster than 32-/64-bit MSVC) "%24d" across all 32-bit ints (4.5x/4.2x faster) "%x" across all 32-bit ints (4.5x/3.8x faster) "%08x" across all 32-bit ints (4.3x/3.8x faster) "%f" across e-10 to e+10 floats (7.3x/6.0x faster) "%e" across e-10 to e+10 floats (8.1x/6.0x faster) "%g" across e-10 to e+10 floats (10.0x/7.1x faster) "%f" for values near e-300 (7.9x/6.5x faster) "%f" for values near e+300 (10.0x/9.1x faster) "%e" for values near e-300 (10.1x/7.0x faster) "%e" for values near e+300 (9.2x/6.0x faster) "%.320f" for values near e-300 (12.6x/11.2x faster) "%a" for random values (8.6x/4.3x faster) "%I64d" for 64-bits with 32-bit values (4.8x/3.4x faster) "%I64d" for 64-bits > 32-bit values (4.9x/5.5x faster) "%s%s%s" for 64 char strings (7.1x/7.3x faster) "...512 char string..." ( 35.0x/32.5x faster!) */ #ifdef RR_SPRINTF_STATIC #define RRPUBLIC_DEC static #define RRPUBLIC_DEF static #else #ifdef __cplusplus #define RRPUBLIC_DEC extern "C" #define RRPUBLIC_DEF extern "C" #else #define RRPUBLIC_DEC extern #define RRPUBLIC_DEF #endif #endif #include // for va_list() #ifndef RR_SPRINTF_MIN #define RR_SPRINTF_MIN 512 // how many characters per callback #endif typedef char * RRSPRINTFCB( char * buf, void * user, int len ); #ifndef RR_SPRINTF_DECORATE #define RR_SPRINTF_DECORATE(name) rr##name // define this before including if you want to change the names #endif #ifndef RR_SPRINTF_IMPLEMENTATION RRPUBLIC_DEF int RR_SPRINTF_DECORATE( vsprintf )( char * buf, char const * fmt, va_list va ); RRPUBLIC_DEF int RR_SPRINTF_DECORATE( vsnprintf )( char * buf, int count, char const * fmt, va_list va ); RRPUBLIC_DEF int RR_SPRINTF_DECORATE( sprintf ) ( char * buf, char const * fmt, ... ); RRPUBLIC_DEF int RR_SPRINTF_DECORATE( snprintf )( char * buf, int count, char const * fmt, ... ); RRPUBLIC_DEF int RR_SPRINTF_DECORATE( vsprintfcb )( RRSPRINTFCB * callback, void * user, char * buf, char const * fmt, va_list va ); RRPUBLIC_DEF void RR_SPRINTF_DECORATE( setseparators )( char comma, char period ); #else #include // for va_arg() #define rU32 unsigned int #define rS32 signed int #ifdef _MSC_VER #define rU64 unsigned __int64 #define rS64 signed __int64 #else #define rU64 unsigned long long #define rS64 signed long long #endif #define rU16 unsigned short #ifndef rUINTa #if defined(__ppc64__) || defined(__aarch64__) || defined(_M_X64) || defined(__x86_64__) || defined(__x86_64) #define rUINTa rU64 #else #define rUINTa rU32 #endif #endif #ifndef RR_SPRINTF_MSVC_MODE // used for MSVC2013 and earlier (MSVC2015 matches GCC) #if defined(_MSC_VER) && (_MSC_VER<1900) #define RR_SPRINTF_MSVC_MODE #endif #endif #ifdef RR_SPRINTF_NOUNALIGNED // define this before inclusion to force rrsprint to always use aligned accesses #define RR_UNALIGNED(code) #else #define RR_UNALIGNED(code) code #endif #ifndef RR_SPRINTF_NOFLOAT // internal float utility functions static rS32 rrreal_to_str( char const * * start, rU32 * len, char *out, rS32 * decimal_pos, double value, rU32 frac_digits ); static rS32 rrreal_to_parts( rS64 * bits, rS32 * expo, double value ); #define RRSPECIAL 0x7000 #endif static char RRperiod='.'; static char RRcomma=','; static char rrdiglookup[201]="00010203040506070809101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899"; RRPUBLIC_DEF void RR_SPRINTF_DECORATE( setseparators )( char pcomma, char pperiod ) { RRperiod=pperiod; RRcomma=pcomma; } RRPUBLIC_DEF int RR_SPRINTF_DECORATE( vsprintfcb )( RRSPRINTFCB * callback, void * user, char * buf, char const * fmt, va_list va ) { static char hex[]="0123456789abcdefxp"; static char hexu[]="0123456789ABCDEFXP"; char * bf; char const * f; int tlen = 0; bf = buf; f = fmt; for(;;) { rS32 fw,pr,tz; rU32 fl; #define LJ 1 #define LP 2 #define LS 4 #define LX 8 #define LZ 16 #define BI 32 #define CS 64 #define NG 128 #define KI 256 #define HW 512 // macros for the callback buffer stuff #define chk_cb_bufL(bytes) { int len = (int)(bf-buf); if ((len+(bytes))>=RR_SPRINTF_MIN) { tlen+=len; if (0==(bf=buf=callback(buf,user,len))) goto done; } } #define chk_cb_buf(bytes) { if ( callback ) { chk_cb_bufL(bytes); } } #define flush_cb() { chk_cb_bufL(RR_SPRINTF_MIN-1); } //flush if there is even one byte in the buffer #define cb_buf_clamp(cl,v) cl = v; if ( callback ) { int lg = RR_SPRINTF_MIN-(int)(bf-buf); if (cl>lg) cl=lg; } // fast copy everything up to the next % (or end of string) for(;;) { while (((rUINTa)f)&3) { schk1: if (f[0]=='%') goto scandd; schk2: if (f[0]==0) goto endfmt; chk_cb_buf(1); *bf++=f[0]; ++f; } for(;;) { rU32 v,c; v=*(rU32*)f; c=(~v)&0x80808080; if ((v-0x26262626)&c) goto schk1; if ((v-0x01010101)&c) goto schk2; if (callback) if ((RR_SPRINTF_MIN-(int)(bf-buf))<4) goto schk1; *(rU32*)bf=v; bf+=4; f+=4; } } scandd: ++f; // ok, we have a percent, read the modifiers first fw = 0; pr = -1; fl = 0; tz = 0; // flags for(;;) { switch(f[0]) { // if we have left just case '-': fl|=LJ; ++f; continue; // if we have leading plus case '+': fl|=LP; ++f; continue; // if we have leading space case ' ': fl|=LS; ++f; continue; // if we have leading 0x case '#': fl|=LX; ++f; continue; // if we have thousand commas case '\'': fl|=CS; ++f; continue; // if we have kilo marker case '$': fl|=KI; ++f; continue; // if we have leading zero case '0': fl|=LZ; ++f; goto flags_done; default: goto flags_done; } } flags_done: // get the field width if ( f[0] == '*' ) {fw = va_arg(va,rU32); ++f;} else { while (( f[0] >= '0' ) && ( f[0] <= '9' )) { fw = fw * 10 + f[0] - '0'; f++; } } // get the precision if ( f[0]=='.' ) { ++f; if ( f[0] == '*' ) {pr = va_arg(va,rU32); ++f;} else { pr = 0; while (( f[0] >= '0' ) && ( f[0] <= '9' )) { pr = pr * 10 + f[0] - '0'; f++; } } } // handle integer size overrides switch(f[0]) { // are we halfwidth? case 'h': fl|=HW; ++f; break; // are we 64-bit (unix style) case 'l': ++f; if ( f[0]=='l') { fl|=BI; ++f; } break; // are we 64-bit on intmax? (c99) case 'j': fl|=BI; ++f; break; // are we 64-bit on size_t or ptrdiff_t? (c99) case 'z': case 't': fl|=((sizeof(char*)==8)?BI:0); ++f; break; // are we 64-bit (msft style) case 'I': if ( ( f[1]=='6') && ( f[2]=='4') ) { fl|=BI; f+=3; } else if ( ( f[1]=='3') && ( f[2]=='2') ) { f+=3; } else { fl|=((sizeof(void*)==8)?BI:0); ++f; } break; default: break; } // handle each replacement switch( f[0] ) { #define NUMSZ 512 // big enough for e308 (with commas) or e-307 char num[NUMSZ]; char lead[8]; char tail[8]; char *s; char const *h; rU32 l,n,cs; rU64 n64; #ifndef RR_SPRINTF_NOFLOAT double fv; #endif rS32 dp; char const * sn; case 's': // get the string s = va_arg(va,char*); if (s==0) s = (char*)"null"; // get the length sn = s; for(;;) { if ((((rUINTa)sn)&3)==0) break; lchk: if (sn[0]==0) goto ld; ++sn; } n = 0xffffffff; if (pr>=0) { n=(rU32)(sn-s); if (n>=(rU32)pr) goto ld; n=((rU32)(pr-n))>>2; } while(n) { rU32 v=*(rU32*)sn; if ((v-0x01010101)&(~v)&0x80808080UL) goto lchk; sn+=4; --n; } goto lchk; ld: l = (rU32) ( sn - s ); // clamp to precision if ( l > (rU32)pr ) l = pr; lead[0]=0; tail[0]=0; pr = 0; dp = 0; cs = 0; // copy the string in goto scopy; case 'c': // char // get the character s = num + NUMSZ -1; *s = (char)va_arg(va,int); l = 1; lead[0]=0; tail[0]=0; pr = 0; dp = 0; cs = 0; goto scopy; case 'n': // weird write-bytes specifier { int * d = va_arg(va,int*); *d = tlen + (int)( bf - buf ); } break; #ifdef RR_SPRINTF_NOFLOAT case 'A': // float case 'a': // hex float case 'G': // float case 'g': // float case 'E': // float case 'e': // float case 'f': // float va_arg(va,double); // eat it s = (char*)"No float"; l = 8; lead[0]=0; tail[0]=0; pr = 0; dp = 0; cs = 0; goto scopy; #else case 'A': // float h=hexu; goto hexfloat; case 'a': // hex float h=hex; hexfloat: fv = va_arg(va,double); if (pr==-1) pr=6; // default is 6 // read the double into a string if ( rrreal_to_parts( (rS64*)&n64, &dp, fv ) ) fl |= NG; s = num+64; // sign lead[0]=0; if (fl&NG) { lead[0]=1; lead[1]='-'; } else if (fl&LS) { lead[0]=1; lead[1]=' '; } else if (fl&LP) { lead[0]=1; lead[1]='+'; }; if (dp==-1023) dp=(n64)?-1022:0; else n64|=(((rU64)1)<<52); n64<<=(64-56); if (pr<15) n64+=((((rU64)8)<<56)>>(pr*4)); // add leading chars #ifdef RR_SPRINTF_MSVC_MODE *s++='0';*s++='x'; #else lead[1+lead[0]]='0'; lead[2+lead[0]]='x'; lead[0]+=2; #endif *s++=h[(n64>>60)&15]; n64<<=4; if ( pr ) *s++=RRperiod; sn = s; // print the bits n = pr; if (n>13) n = 13; if (pr>(rS32)n) tz=pr-n; pr = 0; while(n--) { *s++=h[(n64>>60)&15]; n64<<=4; } // print the expo tail[1]=h[17]; if (dp<0) { tail[2]='-'; dp=-dp;} else tail[2]='+'; n = (dp>=1000)?6:((dp>=100)?5:((dp>=10)?4:3)); tail[0]=(char)n; for(;;) { tail[n]='0'+dp%10; if (n<=3) break; --n; dp/=10; } dp = (int)(s-sn); l = (int)(s-(num+64)); s = num+64; cs = 1 + (3<<24); goto scopy; case 'G': // float h=hexu; goto dosmallfloat; case 'g': // float h=hex; dosmallfloat: fv = va_arg(va,double); if (pr==-1) pr=6; else if (pr==0) pr = 1; // default is 6 // read the double into a string if ( rrreal_to_str( &sn, &l, num, &dp, fv, (pr-1)|0x80000000 ) ) fl |= NG; // clamp the precision and delete extra zeros after clamp n = pr; if ( l > (rU32)pr ) l = pr; while ((l>1)&&(pr)&&(sn[l-1]=='0')) { --pr; --l; } // should we use %e if ((dp<=-4)||(dp>(rS32)n)) { if ( pr > (rS32)l ) pr = l-1; else if ( pr ) --pr; // when using %e, there is one digit before the decimal goto doexpfromg; } // this is the insane action to get the pr to match %g sematics for %f if(dp>0) { pr=(dp<(rS32)l)?l-dp:0; } else { pr = -dp+((pr>(rS32)l)?l:pr); } goto dofloatfromg; case 'E': // float h=hexu; goto doexp; case 'e': // float h=hex; doexp: fv = va_arg(va,double); if (pr==-1) pr=6; // default is 6 // read the double into a string if ( rrreal_to_str( &sn, &l, num, &dp, fv, pr|0x80000000 ) ) fl |= NG; doexpfromg: tail[0]=0; lead[0]=0; if (fl&NG) { lead[0]=1; lead[1]='-'; } else if (fl&LS) { lead[0]=1; lead[1]=' '; } else if (fl&LP) { lead[0]=1; lead[1]='+'; }; if ( dp == RRSPECIAL ) { s=(char*)sn; cs=0; pr=0; goto scopy; } s=num+64; // handle leading chars *s++=sn[0]; if (pr) *s++=RRperiod; // handle after decimal if ((l-1)>(rU32)pr) l=pr+1; for(n=1;n=100)?5:4; #endif tail[0]=(char)n; for(;;) { tail[n]='0'+dp%10; if (n<=3) break; --n; dp/=10; } cs = 1 + (3<<24); // how many tens goto flt_lead; case 'f': // float fv = va_arg(va,double); doafloat: // do kilos if (fl&KI) {while(fl<0x4000000) { if ((fv<1024.0) && (fv>-1024.0)) break; fv/=1024.0; fl+=0x1000000; }} if (pr==-1) pr=6; // default is 6 // read the double into a string if ( rrreal_to_str( &sn, &l, num, &dp, fv, pr ) ) fl |= NG; dofloatfromg: tail[0]=0; // sign lead[0]=0; if (fl&NG) { lead[0]=1; lead[1]='-'; } else if (fl&LS) { lead[0]=1; lead[1]=' '; } else if (fl&LP) { lead[0]=1; lead[1]='+'; }; if ( dp == RRSPECIAL ) { s=(char*)sn; cs=0; pr=0; goto scopy; } s=num+64; // handle the three decimal varieties if (dp<=0) { rS32 i; // handle 0.000*000xxxx *s++='0'; if (pr) *s++=RRperiod; n=-dp; if((rS32)n>pr) n=pr; i=n; while(i) { if ((((rUINTa)s)&3)==0) break; *s++='0'; --i; } while(i>=4) { *(rU32*)s=0x30303030; s+=4; i-=4; } while(i) { *s++='0'; --i; } if ((rS32)(l+n)>pr) l=pr-n; i=l; while(i) { *s++=*sn++; --i; } tz = pr-(n+l); cs = 1 + (3<<24); // how many tens did we write (for commas below) } else { cs = (fl&CS)?((600-(rU32)dp)%3):0; if ((rU32)dp>=l) { // handle xxxx000*000.0 n=0; for(;;) { if ((fl&CS) && (++cs==4)) { cs = 0; *s++=RRcomma; } else { *s++=sn[n]; ++n; if (n>=l) break; } } if (n<(rU32)dp) { n = dp - n; if ((fl&CS)==0) { while(n) { if ((((rUINTa)s)&3)==0) break; *s++='0'; --n; } while(n>=4) { *(rU32*)s=0x30303030; s+=4; n-=4; } } while(n) { if ((fl&CS) && (++cs==4)) { cs = 0; *s++=RRcomma; } else { *s++='0'; --n; } } } cs = (int)(s-(num+64)) + (3<<24); // cs is how many tens if (pr) { *s++=RRperiod; tz=pr;} } else { // handle xxxxx.xxxx000*000 n=0; for(;;) { if ((fl&CS) && (++cs==4)) { cs = 0; *s++=RRcomma; } else { *s++=sn[n]; ++n; if (n>=(rU32)dp) break; } } cs = (int)(s-(num+64)) + (3<<24); // cs is how many tens if (pr) *s++=RRperiod; if ((l-dp)>(rU32)pr) l=pr+dp; while(n>24) { tail[2]="_kmgt"[fl>>24]; tail[0]=2; } } }; flt_lead: // get the length that we copied l = (rU32) ( s-(num+64) ); s=num+64; goto scopy; #endif case 'B': // upper binary h = hexu; goto binary; case 'b': // lower binary h = hex; binary: lead[0]=0; if (fl&LX) { lead[0]=2;lead[1]='0';lead[2]=h[0xb]; } l=(8<<4)|(1<<8); goto radixnum; case 'o': // octal h = hexu; lead[0]=0; if (fl&LX) { lead[0]=1;lead[1]='0'; } l=(3<<4)|(3<<8); goto radixnum; case 'p': // pointer fl |= (sizeof(void*)==8)?BI:0; pr = sizeof(void*)*2; fl &= ~LZ; // 'p' only prints the pointer with zeros // drop through to X case 'X': // upper binary h = hexu; goto dohexb; case 'x': // lower binary h = hex; dohexb: l=(4<<4)|(4<<8); lead[0]=0; if (fl&LX) { lead[0]=2;lead[1]='0';lead[2]=h[16]; } radixnum: // get the number if ( fl&BI ) n64 = va_arg(va,rU64); else n64 = va_arg(va,rU32); s = num + NUMSZ; dp = 0; // clear tail, and clear leading if value is zero tail[0]=0; if (n64==0) { lead[0]=0; if (pr==0) { l=0; cs = ( ((l>>4)&15)) << 24; goto scopy; } } // convert to string for(;;) { *--s = h[n64&((1<<(l>>8))-1)]; n64>>=(l>>8); if ( ! ( (n64) || ((rS32) ( (num+NUMSZ) - s ) < pr ) ) ) break; if ( fl&CS) { ++l; if ((l&15)==((l>>4)&15)) { l&=~15; *--s=RRcomma; } } }; // get the tens and the comma pos cs = (rU32) ( (num+NUMSZ) - s ) + ( ( ((l>>4)&15)) << 24 ); // get the length that we copied l = (rU32) ( (num+NUMSZ) - s ); // copy it goto scopy; case 'u': // unsigned case 'i': case 'd': // integer // get the integer and abs it if ( fl&BI ) { rS64 i64 = va_arg(va,rS64); n64 = (rU64)i64; if ((f[0]!='u') && (i64<0)) { n64=(rU64)-i64; fl|=NG; } } else { rS32 i = va_arg(va,rS32); n64 = (rU32)i; if ((f[0]!='u') && (i<0)) { n64=(rU32)-i; fl|=NG; } } #ifndef RR_SPRINTF_NOFLOAT if (fl&KI) { if (n64<1024) pr=0; else if (pr==-1) pr=1; fv=(double)(rS64)n64; goto doafloat; } #endif // convert to string s = num+NUMSZ; l=0; for(;;) { // do in 32-bit chunks (avoid lots of 64-bit divides even with constant denominators) char * o=s-8; if (n64>=100000000) { n = (rU32)( n64 % 100000000); n64 /= 100000000; } else {n = (rU32)n64; n64 = 0; } if((fl&CS)==0) { while(n) { s-=2; *(rU16*)s=*(rU16*)&rrdiglookup[(n%100)*2]; n/=100; } } while (n) { if ( ( fl&CS) && (l++==3) ) { l=0; *--s=RRcomma; --o; } else { *--s=(char)(n%10)+'0'; n/=10; } } if (n64==0) { if ((s[0]=='0') && (s!=(num+NUMSZ))) ++s; break; } while (s!=o) if ( ( fl&CS) && (l++==3) ) { l=0; *--s=RRcomma; --o; } else { *--s='0'; } } tail[0]=0; // sign lead[0]=0; if (fl&NG) { lead[0]=1; lead[1]='-'; } else if (fl&LS) { lead[0]=1; lead[1]=' '; } else if (fl&LP) { lead[0]=1; lead[1]='+'; }; // get the length that we copied l = (rU32) ( (num+NUMSZ) - s ); if ( l == 0 ) { *--s='0'; l = 1; } cs = l + (3<<24); if (pr<0) pr = 0; scopy: // get fw=leading/trailing space, pr=leading zeros if (pr<(rS32)l) pr = l; n = pr + lead[0] + tail[0] + tz; if (fw<(rS32)n) fw = n; fw -= n; pr -= l; // handle right justify and leading zeros if ( (fl&LJ)==0 ) { if (fl&LZ) // if leading zeros, everything is in pr { pr = (fw>pr)?fw:pr; fw = 0; } else { fl &= ~CS; // if no leading zeros, then no commas } } // copy the spaces and/or zeros if (fw+pr) { rS32 i; rU32 c; // copy leading spaces (or when doing %8.4d stuff) if ( (fl&LJ)==0 ) while(fw>0) { cb_buf_clamp(i,fw); fw -= i; while(i) { if ((((rUINTa)bf)&3)==0) break; *bf++=' '; --i; } while(i>=4) { *(rU32*)bf=0x20202020; bf+=4; i-=4; } while (i) {*bf++=' '; --i;} chk_cb_buf(1); } // copy leader sn=lead+1; while(lead[0]) { cb_buf_clamp(i,lead[0]); lead[0] -= (char)i; while (i) {*bf++=*sn++; --i;} chk_cb_buf(1); } // copy leading zeros c = cs >> 24; cs &= 0xffffff; cs = (fl&CS)?((rU32)(c-((pr+cs)%(c+1)))):0; while(pr>0) { cb_buf_clamp(i,pr); pr -= i; if((fl&CS)==0) { while(i) { if ((((rUINTa)bf)&3)==0) break; *bf++='0'; --i; } while(i>=4) { *(rU32*)bf=0x30303030; bf+=4; i-=4; } } while (i) { if((fl&CS) && (cs++==c)) { cs = 0; *bf++=RRcomma; } else *bf++='0'; --i; } chk_cb_buf(1); } } // copy leader if there is still one sn=lead+1; while(lead[0]) { rS32 i; cb_buf_clamp(i,lead[0]); lead[0] -= (char)i; while (i) {*bf++=*sn++; --i;} chk_cb_buf(1); } // copy the string n = l; while (n) { rS32 i; cb_buf_clamp(i,n); n-=i; RR_UNALIGNED( while(i>=4) { *(rU32*)bf=*(rU32*)s; bf+=4; s+=4; i-=4; } ) while (i) {*bf++=*s++; --i;} chk_cb_buf(1); } // copy trailing zeros while(tz) { rS32 i; cb_buf_clamp(i,tz); tz -= i; while(i) { if ((((rUINTa)bf)&3)==0) break; *bf++='0'; --i; } while(i>=4) { *(rU32*)bf=0x30303030; bf+=4; i-=4; } while (i) {*bf++='0'; --i;} chk_cb_buf(1); } // copy tail if there is one sn=tail+1; while(tail[0]) { rS32 i; cb_buf_clamp(i,tail[0]); tail[0] -= (char)i; while (i) {*bf++=*sn++; --i;} chk_cb_buf(1); } // handle the left justify if (fl&LJ) if (fw>0) { while (fw) { rS32 i; cb_buf_clamp(i,fw); fw-=i; while(i) { if ((((rUINTa)bf)&3)==0) break; *bf++=' '; --i; } while(i>=4) { *(rU32*)bf=0x20202020; bf+=4; i-=4; } while (i--) *bf++=' '; chk_cb_buf(1); } } break; default: // unknown, just copy code s = num + NUMSZ -1; *s = f[0]; l = 1; fw=pr=fl=0; lead[0]=0; tail[0]=0; pr = 0; dp = 0; cs = 0; goto scopy; } ++f; } endfmt: if (!callback) *bf = 0; else flush_cb(); done: return tlen + (int)(bf-buf); } // cleanup #undef LJ #undef LP #undef LS #undef LX #undef LZ #undef BI #undef CS #undef NG #undef KI #undef NUMSZ #undef chk_cb_bufL #undef chk_cb_buf #undef flush_cb #undef cb_buf_clamp // ============================================================================ // wrapper functions RRPUBLIC_DEF int RR_SPRINTF_DECORATE( sprintf )( char * buf, char const * fmt, ... ) { va_list va; va_start( va, fmt ); return RR_SPRINTF_DECORATE( vsprintfcb )( 0, 0, buf, fmt, va ); } typedef struct RRCCS { char * buf; int count; char tmp[ RR_SPRINTF_MIN ]; } RRCCS; static char * rrclampcallback( char * buf, void * user, int len ) { RRCCS * c = (RRCCS*)user; if ( len > c->count ) len = c->count; if (len) { if ( buf != c->buf ) { char * s, * d, * se; d = c->buf; s = buf; se = buf+len; do{ *d++ = *s++; } while (sbuf += len; c->count -= len; } if ( c->count <= 0 ) return 0; return ( c->count >= RR_SPRINTF_MIN ) ? c->buf : c->tmp; // go direct into buffer if you can } RRPUBLIC_DEF int RR_SPRINTF_DECORATE( vsnprintf )( char * buf, int count, char const * fmt, va_list va ) { RRCCS c; int l; if ( count == 0 ) return 0; c.buf = buf; c.count = count; RR_SPRINTF_DECORATE( vsprintfcb )( rrclampcallback, &c, rrclampcallback(0,&c,0), fmt, va ); // zero-terminate l = (int)( c.buf - buf ); if ( l >= count ) // should never be greater, only equal (or less) than count l = count - 1; buf[l] = 0; return l; } RRPUBLIC_DEF int RR_SPRINTF_DECORATE( snprintf )( char * buf, int count, char const * fmt, ... ) { va_list va; va_start( va, fmt ); return RR_SPRINTF_DECORATE( vsnprintf )( buf, count, fmt, va ); } RRPUBLIC_DEF int RR_SPRINTF_DECORATE( vsprintf )( char * buf, char const * fmt, va_list va ) { return RR_SPRINTF_DECORATE( vsprintfcb )( 0, 0, buf, fmt, va ); } // ======================================================================= // low level float utility functions #ifndef RR_SPRINTF_NOFLOAT // copies d to bits w/ strict aliasing (this compiles to nothing on /Ox) #define RRCOPYFP(dest,src) { int cn; for(cn=0;cn<8;cn++) ((char*)&dest)[cn]=((char*)&src)[cn]; } // get float info static rS32 rrreal_to_parts( rS64 * bits, rS32 * expo, double value ) { double d; rS64 b = 0; // load value and round at the frac_digits d = value; RRCOPYFP( b, d ); *bits = b & ((((rU64)1)<<52)-1); *expo = ((b >> 52) & 2047)-1023; return (rS32)(b >> 63); } static double const rrbot[23]={1e+000,1e+001,1e+002,1e+003,1e+004,1e+005,1e+006,1e+007,1e+008,1e+009,1e+010,1e+011,1e+012,1e+013,1e+014,1e+015,1e+016,1e+017,1e+018,1e+019,1e+020,1e+021,1e+022}; static double const rrnegbot[22]={1e-001,1e-002,1e-003,1e-004,1e-005,1e-006,1e-007,1e-008,1e-009,1e-010,1e-011,1e-012,1e-013,1e-014,1e-015,1e-016,1e-017,1e-018,1e-019,1e-020,1e-021,1e-022}; static double const rrnegboterr[22]={-5.551115123125783e-018,-2.0816681711721684e-019,-2.0816681711721686e-020,-4.7921736023859299e-021,-8.1803053914031305e-022,4.5251888174113741e-023,4.5251888174113739e-024,-2.0922560830128471e-025,-6.2281591457779853e-026,-3.6432197315497743e-027,6.0503030718060191e-028,2.0113352370744385e-029,-3.0373745563400371e-030,1.1806906454401013e-032,-7.7705399876661076e-032,2.0902213275965398e-033,-7.1542424054621921e-034,-7.1542424054621926e-035,2.4754073164739869e-036,5.4846728545790429e-037,9.2462547772103625e-038,-4.8596774326570872e-039}; static double const rrtop[13]={1e+023,1e+046,1e+069,1e+092,1e+115,1e+138,1e+161,1e+184,1e+207,1e+230,1e+253,1e+276,1e+299}; static double const rrnegtop[13]={1e-023,1e-046,1e-069,1e-092,1e-115,1e-138,1e-161,1e-184,1e-207,1e-230,1e-253,1e-276,1e-299}; static double const rrtoperr[13]={8388608,6.8601809640529717e+028,-7.253143638152921e+052,-4.3377296974619174e+075,-1.5559416129466825e+098,-3.2841562489204913e+121,-3.7745893248228135e+144,-1.7356668416969134e+167,-3.8893577551088374e+190,-9.9566444326005119e+213,6.3641293062232429e+236,-5.2069140800249813e+259,-5.2504760255204387e+282}; static double const rrnegtoperr[13]={3.9565301985100693e-040,-2.299904345391321e-063,3.6506201437945798e-086,1.1875228833981544e-109,-5.0644902316928607e-132,-6.7156837247865426e-155,-2.812077463003139e-178,-5.7778912386589953e-201,7.4997100559334532e-224,-4.6439668915134491e-247,-6.3691100762962136e-270,-9.436808465446358e-293,8.0970921678014997e-317}; #if defined(_MSC_VER) && (_MSC_VER<=1200) static rU64 const rrpot[20]={1,10,100,1000, 10000,100000,1000000,10000000, 100000000,1000000000,10000000000,100000000000, 1000000000000,10000000000000,100000000000000,1000000000000000, 10000000000000000,100000000000000000,1000000000000000000,10000000000000000000U }; #define rrtento19th ((rU64)1000000000000000000) #else static rU64 const rrpot[20]={1,10,100,1000, 10000,100000,1000000,10000000, 100000000,1000000000,10000000000ULL,100000000000ULL, 1000000000000ULL,10000000000000ULL,100000000000000ULL,1000000000000000ULL, 10000000000000000ULL,100000000000000000ULL,1000000000000000000ULL,10000000000000000000ULL }; #define rrtento19th (1000000000000000000ULL) #endif #define rrddmulthi(oh,ol,xh,yh) \ { \ double ahi=0,alo,bhi=0,blo; \ rS64 bt; \ oh = xh * yh; \ RRCOPYFP(bt,xh); bt&=((~(rU64)0)<<27); RRCOPYFP(ahi,bt); alo = xh-ahi; \ RRCOPYFP(bt,yh); bt&=((~(rU64)0)<<27); RRCOPYFP(bhi,bt); blo = yh-bhi; \ ol = ((ahi*bhi-oh)+ahi*blo+alo*bhi)+alo*blo; \ } #define rrddtoS64(ob,xh,xl) \ { \ double ahi=0,alo,vh,t;\ ob = (rS64)ph;\ vh=(double)ob;\ ahi = ( xh - vh );\ t = ( ahi - xh );\ alo = (xh-(ahi-t))-(vh+t);\ ob += (rS64)(ahi+alo+xl);\ } #define rrddrenorm(oh,ol) { double s; s=oh+ol; ol=ol-(s-oh); oh=s; } #define rrddmultlo(oh,ol,xh,xl,yh,yl) \ ol = ol + ( xh*yl + xl*yh ); \ #define rrddmultlos(oh,ol,xh,yl) \ ol = ol + ( xh*yl ); \ static void rrraise_to_power10( double *ohi, double *olo, double d, rS32 power ) // power can be -323 to +350 { double ph, pl; if ((power>=0) && (power<=22)) { rrddmulthi(ph,pl,d,rrbot[power]); } else { rS32 e,et,eb; double p2h,p2l; e=power; if (power<0) e=-e; et = (e*0x2c9)>>14;/* %23 */ if (et>13) et=13; eb = e-(et*23); ph = d; pl = 0.0; if (power<0) { if (eb) { --eb; rrddmulthi(ph,pl,d,rrnegbot[eb]); rrddmultlos(ph,pl,d,rrnegboterr[eb]); } if (et) { rrddrenorm(ph,pl); --et; rrddmulthi(p2h,p2l,ph,rrnegtop[et]); rrddmultlo(p2h,p2l,ph,pl,rrnegtop[et],rrnegtoperr[et]); ph=p2h;pl=p2l; } } else { if (eb) { e = eb; if (eb>22) eb=22; e -= eb; rrddmulthi(ph,pl,d,rrbot[eb]); if ( e ) { rrddrenorm(ph,pl); rrddmulthi(p2h,p2l,ph,rrbot[e]); rrddmultlos(p2h,p2l,rrbot[e],pl); ph=p2h;pl=p2l; } } if (et) { rrddrenorm(ph,pl); --et; rrddmulthi(p2h,p2l,ph,rrtop[et]); rrddmultlo(p2h,p2l,ph,pl,rrtop[et],rrtoperr[et]); ph=p2h;pl=p2l; } } } rrddrenorm(ph,pl); *ohi = ph; *olo = pl; } // given a float value, returns the significant bits in bits, and the position of the // decimal point in decimal_pos. +/-INF and NAN are specified by special values // returned in the decimal_pos parameter. // frac_digits is absolute normally, but if you want from first significant digits (got %g and %e), or in 0x80000000 static rS32 rrreal_to_str( char const * * start, rU32 * len, char *out, rS32 * decimal_pos, double value, rU32 frac_digits ) { double d; rS64 bits = 0; rS32 expo, e, ng, tens; d = value; RRCOPYFP(bits,d); expo = (bits >> 52) & 2047; ng = (rS32)(bits >> 63); if (ng) d=-d; if ( expo == 2047 ) // is nan or inf? { *start = (bits&((((rU64)1)<<52)-1)) ? "NaN" : "Inf"; *decimal_pos = RRSPECIAL; *len = 3; return ng; } if ( expo == 0 ) // is zero or denormal { if ((bits<<1)==0) // do zero { *decimal_pos = 1; *start = out; out[0] = '0'; *len = 1; return ng; } // find the right expo for denormals { rS64 v = ((rU64)1)<<51; while ((bits&v)==0) { --expo; v >>= 1; } } } // find the decimal exponent as well as the decimal bits of the value { double ph,pl; // log10 estimate - very specifically tweaked to hit or undershoot by no more than 1 of log10 of all expos 1..2046 tens=expo-1023; tens = (tens<0)?((tens*617)/2048):(((tens*1233)/4096)+1); // move the significant bits into position and stick them into an int rrraise_to_power10( &ph, &pl, d, 18-tens ); // get full as much precision from double-double as possible rrddtoS64( bits, ph,pl ); // check if we undershot if ( ((rU64)bits) >= rrtento19th ) ++tens; } // now do the rounding in integer land frac_digits = ( frac_digits & 0x80000000 ) ? ( (frac_digits&0x7ffffff) + 1 ) : ( tens + frac_digits ); if ( ( frac_digits < 24 ) ) { rU32 dg = 1; if ((rU64)bits >= rrpot[9] ) dg=10; while( (rU64)bits >= rrpot[dg] ) { ++dg; if (dg==20) goto noround; } if ( frac_digits < dg ) { rU64 r; // add 0.5 at the right position and round e = dg - frac_digits; if ( (rU32)e >= 24 ) goto noround; r = rrpot[e]; bits = bits + (r/2); if ( (rU64)bits >= rrpot[dg] ) ++tens; bits /= r; } noround:; } // kill long trailing runs of zeros if ( bits ) { rU32 n; for(;;) { if ( bits<=0xffffffff ) break; if (bits%1000) goto donez; bits/=1000; } n = (rU32)bits; while ((n%1000)==0) n/=1000; bits=n; donez:; } // convert to string out += 64; e = 0; for(;;) { rU32 n; char * o = out-8; // do the conversion in chunks of U32s (avoid most 64-bit divides, worth it, constant denomiators be damned) if (bits>=100000000) { n = (rU32)( bits % 100000000); bits /= 100000000; } else {n = (rU32)bits; bits = 0; } while(n) { out-=2; *(rU16*)out=*(rU16*)&rrdiglookup[(n%100)*2]; n/=100; e+=2; } if (bits==0) { if ((e) && (out[0]=='0')) { ++out; --e; } break; } while( out!=o ) { *--out ='0'; ++e; } } *decimal_pos = tens; *start = out; *len = e; return ng; } #undef rrddmulthi #undef rrddrenorm #undef rrddmultlo #undef rrddmultlos #undef RRSPECIAL #undef RRCOPYFP #endif // clean up #undef rU16 #undef rU32 #undef rS32 #undef rU64 #undef rS64 #undef RRPUBLIC_DEC #undef RRPUBLIC_DEF #undef RR_SPRINTF_DECORATE #undef RR_UNALIGNED #endif #endif uTox/third_party/stb/stb/data/0000700000175000001440000000000014003056224015315 5ustar rakusersuTox/third_party/stb/stb/data/map_03.png0000600000175000001440000002262414003056224017112 0ustar rakusersPNG  IHDRZvt_%[IDATx^Ѳ먮(q.NήVw 6z`bIDZq8t4<:9Xj+>[̼ߚz>|+C.a^$SGxQFk,4%   2ݱ6٘ $KwL@o7#-xϳ冽o<ݟBλ|\lqꈟZ^D` S I/u 3r8 Õ? {f7qa:%._<}f@pT# \G'*25Ơ pOT>R 5lV,YEi,7D׿?QO*e{2@]T2-Ñџp.a]}5/k&:Z E^_+GWkJr|'d?T^zD;G7z?p.mR*C1@NFDˬs0)H T6 ziuְxJz=eJ@x W\59E}L[w[i@wc @K'8x(;.jw;0!g8 T9e'OT+kXvٍeb * 4  @ @ @`@M9? X4zR Snv)@2> 'vot#=@S.|%@^KLyPoQc?{J%efn5㍌GfoF^g_z>b)2;!BM86\@\iLX5#?`tXWd$dlP "L 6[<`4 LhzR گ пnkO]# 6@S.9,ukc>v@]E9j,y$ ` $M?Uq~2*^=%p @ӑ>uh>-^ y}ZB P\j4*Zy>b&^$  lR_{GϯkH:i8ӭbx[9) @62PU<% Jws!֕3m2! &WˡuHor5rř\5rmU|ֵ+xg m@k"g-pgy9&(=;lQy IFm<ƨSKZu+B Y L[=sR56m }9;;  q0j Qndpjv4pƩv>4@*z[;4o sM*0#Y~2ݪE94L*f0 -Jpgȍv@Uwqum_7;Oi]̣F&0^ڋ] mHjHm948b+veR;4urT<۔ HOY`P xF II}!5c^ f@5xqB! b߫R(YOTC?TCe^tPJE@[_@@@@*[zЮ#~#ޕ}f:5.1nt8z_N|gȾn^_$A5gYw^{QD'yD|d,]/Nԇ=e5fɔLN}yq[|+.%`J|∺`ut[a[J~hS#@UV]M6`{!;#zgLڲ#ΎŪ턙iYl@;!7j@$ i~Z@vs8U awLdFj'ր(5`o*KUB(H ,@"j2mx}PLJjWGH,QxPg @.,dYmR1ag,s0H-nr}hYX5f!=c϶ߙu<~k_j<ٳLӿfi@LYJq dk4J-Ԏ;Rzv^|}O{L9. 0MտCErwEβ͊6^@ ojf5+ Yd|>O^=-[oh%``_5 B&xyjÁu_TKM]^G3Q"[ =6qBqr\%tx~ pF< v@YqD @deT=7vQ uvu#䠙=޳c€ *tF.xld;" ?gʯ>hVj`CCU Ա]C[ֵ?a8ixhK P1< 0 3@B̎\E*&_Du\>U1B  .c;PھN=4G =el\IQCv{tNm W Pw:@935'sIw`~2[\$]k0] )@@@aNb1h{Vȁ}X3܋ 1=7Q QT(d"X]no;\- 0ޫ>]'IXN]U^#D`GPV `z\ 5K7*Qtjd^^F9 P7̿"cWK6Tb8n{}p@@Fߵ# }-Lj/Ϝڅ\$K3:r j) e6 dVg33yvM662dw;c !*+m (x]}z)A%$_Ӄ@&*XsHwYf=˦2e_\w(o#7}7 *rE2l,R G6f:UCUZ "QB4o`@(l^@3Ge+Sn_[i8a ճbjC2`?5{lIܠ-V〺ݶ̍*@N|" ˤ :v=T7 $P 7^N[NܷZ:pvߊuf@WApm A¢آQ[4|\lyFt3̈́} e Z H@ޘ hdWM|x58: ء 0v'L@ zn6ȜG&!ԑ<0DK`oC0_ڪd:uӣi0vw.@d\x7@ӷyN%pW5|Me w3%!   B n=O\4UvT] _\jx50BG >CIb&TIG?ܿjpҪKvn0A3!i\dS V58w<@v{j. T]ܠ``zP ;]< <^T,g!E޿Pw~4=mZ^gdXvC"Ptr:9X!cR#6(p)ɵu؊qPߵ erq4zQ5P0< Ob@?Yw@0Z,SPݫ%}-@Nod { I @gk7/UUS =y%\\x"aeX8 l bj=My]%qP _,}o3@'Tb]M{xMxbs~KVN}KZEGJ`nQ@^jsj?td/;X xuZO?}d=tr_ZF`PhF7'O)Pv@du@Rd{ GXx{ηL͘ZkYXU={42BXUH&\( P{+?*K-4үjԍuuM9۽ih,!-@n^0[_g.cck:N5TF@U -I-T2uZ?PGڱWej @j|X{3ʀ)L]7+0[]\*]`C' @I-bWm~r(δP42o%p @8!p.U+?0 “-2*]nTk[o 7vH'7VeDpIM>עX#ͣFOnn=7Im]$-@P@@@aBʻ# wևd4 g 4mD&c6-̄t! T0P> @(fZsݲÝwݔTR}'Keg  c}Hg!m8`;#C>&T`/;rZD`&r~}4|lVr@  w;w kyf% ?Hi /U^:2uQ`u*iXg9u3mCĄ B r"N}٢ ɥʖ9uMHNv,'x /H'f_ٰtϟISvVl. z_((cb] LC @b3#ޚ߶5epVл̖mz5ɰ n#&k`c2uyQ6XT^o2~"}YٔP>| p#?N"lI_vܫ P՚s O: A!-U@^{Y{R.Wc2 wW <>q@\jewWH,?c@@ r2`m鿩/#VcRR̞EdBsM H-2PC7_ q&EP95w`qjz]kR= * A 'a@l IvĐ\=:;P!ӆ"3uܓU<I9?uY0@1 ٴ[Iֿ8!@> Vc\|H.<}`wF_w%1+6,!@ ͉oK@Qe0 eKƉuJ]#M˜2zӦ&>Ы)_K?& 7q;VdQ8ӰkۯOT<ʢU}mt ,  sfdQ &r[gr,$Ylю3m?#pI@j ckӚ:1ggok;M'.^ AW{{@  40Mp2PWNf=5arptf8mM9P ~)x@V@PPEzMrIu^#蟹jo@#;B@RPPړQcNL`V̀58|զ=TC  ^WM3jxC6w{lǩ9@<5zjQWʀy{=7|^] SLUӡ 0> 4CN _ǨH껓^U 3s X \ 6PczN}Ow8s1r@[6S'v%^PR`uI@ PȚ_9hMm q9¼J;F_w̠ b4MnhvI@Ħȕ5PA" Gت| V*1)L_ ȀM6հ< h@im9ƚ OwV0㝾??,X\]`@Z^I|Qo<&3jy78뜚]ɀ6\QǷNrmi,~qMj]5vY5G눯E`/@np8^S kXD:<^o]Vl"p V;@ H Mj0|HμY22_fFG(G-- IZJp޻^PF$ ycY}df|Bu{j̶ONԴJ} fҮf ` ZuGJŽr; uVIᳱų35]6 c_[ys76|+mŏۤ'f ^LJo|s2`v$ڳrG'\?O dѡhA7r@qZqim3l,Y:zrs.Gv,`% ͍՛FwhҰfv~}wؓ ՙTxT3i%]$"q?VIENDB`uTox/third_party/stb/stb/data/map_02.png0000600000175000001440000000625314003056224017111 0ustar rakusersPNG  IHDRZvt_ rIDATx^AnGѿ4'2LFߩAh !~G[Ơ2o 2w:p` _`0_L`@   @ T"h @Mj@Y6@\ X@( )ڹ 0- x鹧U  l?L`x(Gz&$y8T1Q2    tvP9       @gw!@    @;ʩ@@@@@@@!T@@@@@@:C @@@@@@@;;A@@@#    @d       !TN     <l@@@*     e@*B@@@@@@tvPY E   ptREI@?5s7j ZG:* ?' @'C й|SWOy7T5]Yp}G9>E! &. ~# +$V*5Y:  `08=ѹK =}*q˵X*sGveM/j7I\>OҎZ|wy Oز<5z-xwQ]'AP!";@ y4NHJG= OV*o|IMN宓Ԑi}?G=fהtbq{O+Ւ'z+?;е / lCG~/};ZzPU5Cg/ >~%'DK_@;m@ 6:Sf51eOW{ 1ݩ6 Iz@3j:2p,:@Mp8=RccYG* 堮 @/z&`8%r @Re/2$pWhBHcTgjA/)m剎'0G Pޕdo4/Z7U?{CS!1#\\L> (@0 @P@#.    6)  !T@@@@@2 !T@@`'     %W@gw!      tvP9       @gw@xOp@@@@@@: @@@@@@@7@es PpB      T@@@@@   T@@@"  @Nr7~N 6>P@0 - ߉-C#i[C+@{[00"!G0 [)A0 X@   @eK T.`h@ `@P@+$6GP`ڱ 0U ,LDΌ `*XlN  cϋ N@@Q(CN|CIENDB`uTox/third_party/stb/stb/data/map_01.png0000600000175000001440000007364114003056224017115 0ustar rakusersPNG  IHDRZvt_whIDATx^ٖp\C\,YFHJjhHɣ_LORJWsR 4{iJ/HH ϯ#! "+|$FSF[-h#v%YA~5p 0;^ɯF4f`*2[o[_=4IKC@4sćA\w@\ISvK m~ԲUa@@pAb2 ΉT,pЛm2A@ñ[>cxKA6Km5'i,0D ݥuJƺ@ߥWxM fj򭳺d6=fc݇r'(VwRq#b:v# d&m=x@@h {:PT )q{q@fńXVz]8_GcwCcav0x.%h1(}n^vݣN$0IdLJǟ_:)aXq,/4/d,-(|Afi.A8AC:UXӺ3]lv1clL4y{ĵ s4"7 u~H2غ< EHlgwXF2{tmcq? 5ߛЅE5ߦR>7ۦ;m8^?p1^?x*Tg'q[_-M_mJßV4"8QC.Kutְ ug 90 cB9nN韧J3;[`mW: UL i1VK|w먜3mPY.pinb$V)twBmcm<0q@gmctη]p 2NO2Q("߯\Ef7_}+9#xQ;걚ȼI8,_4嶓2 p3hI^Xñ?K?_d0!GO,2m(Xr+:-~>dQg+k p?j~c%l/0l  >m"36R0J3tU ¹=}@r.C 'bֈ]_ֽV:GiDxV+@ ͟%_D >cEˋGC?^e{#GBAi|ȣw[y~$è2u p[&ok R畁ϣ2CNL;DPn@TUvuԞ*H}S7 ǻ8⡶CRΑ#ugZ`'Q+ c*t/d@_&|&׶WC9R%zrh\cH{@\> 9>@lz?XDaB1LIHX,sbORJ(y|)-)1 x c#tmQxװ];ۻQb"2K6U5}f&3T[C#tuQ6zLۊm1I=t2sV<wm$X3V[^N<7fip _vG>k ]ɖܛeMM?w2 f>rİ!Pڴ&] ;O17q;ܒoUHw$ xm>㙉mװ\4 FF"NO\nB௃H%-t-3ʇ&`'E1XiX x> 8;mJWo4i +ә@:T _}"ۙim/ӁS=(e=d|rQw҆[Uy8 "\01uwJK*jr wSwkSyVwS,N  sv~Ùatg`6vDDfax `㽶LPvj/h(UŗxMLpfHVJ.c'ʇ9C CYz<`k0z;Hɶ-cdl$$|lg_;dO&Nǵ4僎qC HG0![s!7F)1aHM /FK/J_Hc+a^F"c랙Nk VfWM ȿ%e9VǠLѢs ڤx~LCQ"3nK-z*:`~aMpƇ0P*i`? Ipc?Tn?t|w@8=AnW9%q}4fvTgw,hƍ3YVȜO 0Q6_r9iC#áVऴv[2vB<{p&Ssx0TVa¹G9.qkn*-sovF݆6>kOQxQOK8YX2yU'h^˰bxjPXԞ*`̂ݕU0>]/ۤ>ܡz;X9gcAme`]KA&gOp ؋J~vpi]ѦxHyLiȵy[A8T!_A$Cؖs lJq;՛VipM|ye8^lK%y{('xZy߅YZȿ@sBϙ3f%^>Rqk$g^,b!{KtU ԭ\H:9-LN1/bIE$R0,X?DmL>Tm!7ii2I椠7gO?dľj :{>ó6^SUٞ',Ta ˵ƶa) 7x$MmSP&]*2 rv$)ٝS3$ɛ"qУH~Oq|/Zt ?^A>W5~\ϳS%%O5kE`!)!K֙K=,Ȗھ Ad+m8R6ZS]рvRJF5A<[ATv*k]V압g $~r~13Tx٩n}i0MT A2cr䑴.8kR@8oU=/>ENiu{K8hY`;2cVG{dL{dN@L)Ogt ȈT8R_Ng}?,$;1b|e "͓0 ٗX;ގZ! ͓/@B6@x$y2+Q; U0q1KتTv!*y-tvTUY=Dv?l,ߌ ,A{ ) |$k9WULx<4'C0_B^*/2)uu )&=t73TpǜyEN#ޑk"K%Ʃc҉ګ|#g7%< !#;b #3%~BLuwi>w4-gɘh`rWs&@@&& qFH B'A}#\ZGl Er«L+9A [wM$1ahA4i^Mc |D 638lK[a?K]%Q;jz38M{;GXMN!]{]Nδ-q)XAi-5RM +qOsX&?&41# g \2Sn>SZSc9`v3ӓapi8KO800R+ݚmqӐZ-Aٞ0GNbGc [ߘ%clF&>)7 MŷˆF N (NDvHRf|l4ab_Fb]&Dpz'uBv#֎@iЪzDZ'Xo2ZLTstEpr%ǗHk۰ԃ8D:2AS=shX50xc@f̹xb4Ze"UQc-F%M~L_# KGu޺s`G'$M `^{=I ?FfJ)66 YK^5wQpHr5^Oѧ_I& _cxAPYkQxг_qo]d%[Gt$ ^2% ?U+^@ddEJ1:(%Eܒ;1"l#`|!_e֩Ɉ9įY< JjJ[ G$p2`WD#<&`k+LpPl}ruFA.r8>et HVzƤpLQeq譊0`̥|x/QwLsOl^z E#+϶K0}PV̵HHB&ndKf՜5֜B!Q%,R~Aڵ)q8Otί7&#W*ǰ}U+`R#§W˻蔅dG˃7mV,@SCcX˽pԮ6bAڝ |N н T?*4Ʀxj'lӊ`,^@&~q.K9 |F7e%)@/֗Z]/u} $޹gYQ w^P5N֒x#ޱ&(vWe}2pw =.;;L9OsH+ WV]ę{G8Yް}Fr/$5uqHyOAy$'&Z}݀˙dpib$?oײ-k!ȫt{0uIVB֙&1m{nɑ2bJ RJI^yFs "ʚ?`J}|2P m\ SuX/Oחc#/H,s./45BFp>Y 7 a4j$KK0R˟@w< >|P[38HΎ :0P"A&WZ碞In=7wJ2^;AC5 nUҊ)Q:p ovf{aH`3qe$%6YFɑWz|7btX}թ>e@x9H\1~ЌRnWpg|Zy?3.tι.K7}"Yp5 ZgwSɎ]aZd@‚L>3_^䒅?@sNPa1t\m;I~gԤSAJR?wmB@ʿ,w)rB1*-oOD@z^_% FۏS;L kGZ2?)&xNU*іQ3rlw̒ǀ?Ѥm_+Lz`^|ߟ&ʓtG0_"hZiFeNQz-. XbtD  d џ*xUb~4u뉑v"Z9çcshGzw8wY"2Wo^'yjNjȸ#9ӓ\H+HON6M.@$E}2GϵE~N1ܐoy/ҿKq)LAHŸ@ݽYo$+uta:R/x ug.Go_w!S eĊ2p;[5BHV6f$稫]}eRiH[Ϸڦ2%Ve𳞆(ڏ(lFs6ߞL0[E6B z:#|k-@;=4ވ'Gd&=yAy>~L /x%p5"nɌlv{l/_ >eƯB?zL0a)y'Kp$/O `˃GmT)с8:IeW?BA-93Wǹ%X÷&@{фWָLrg&c\=p!4g0f>/׏Ȅ5C7$Z-(:q!=<78"ͥXrĈ?\AՀ^X/xI) |!Od&kZ{U g>]ťk=u#)ػ0C8&FDe*&r c `z/bk/+Q?L Ⳍ #f}j[xNaa0FʪCZy䊔{ EA1LFB $QVH1Nm*Zַ5YBLs_`|ݝȥǀ'4 0`cs 0&+5mKc)W\ބ=ܢa}&g&pyf obMXڋc*jy &kj2gC>QB'0;?paS{S#iC}Yxw&:2TYx?`Ϟw>Ί/Y80E0yInGo5L?k쇧::8%d4Zo ' :9ЙX)FHŲp6a-'t0ڑmlJj0|ey[ F#^j^9cN~i׊3nL0k3 ϬdʒV"Ksy֦ &tKHb~ vڞD 9,^Bx| !|D(@4ԷYG*:Sb)(Ts[SLX "=+D HrBIwH8Aq /OYt=D-rP۳ev@^&YNC@+'T4=Cr?74I`[cg ol'8e^^4,b `޲ʂ'J$ 29^-Ɇ91O5ugQl}Z2==yǂ$Om[ϖ6ЄաG.q N=Ob oiͳ|j!a@I/x,"|px; ]$aSf48ՐE&JI7d3eK1]ܰ ޅ䑬C>%7;5\2~aDLoPԂӨc~@yŃf7.6!%”Eߚ7?Ώzmz5\h1R`q;Ņ>$].ht7zP0%ّ /ˋL;ͭqQG8L,`,{*wU#2${bǣoZsU-]R)@'n޾uE"IO$4&j9x3%sL*;sopl4Q3/=\^>6D'??- Pjy-`Gp$~[oNNB/赽|?_]>~ ˳ͳZ(nɴjWY{L W *]X u3}ʁ-')5S &مj>.~v*@b1WZ]ře)u/$M`<3sOŶ; &%2/GOKQ ߼l5`ىA6mx,>a!8 $ *epȗ)6pӀT֛\!v=]w ɲH݆ ^K/9Lg]uCyŅ?zaM~6+^gSXFlb>tJ܍(G2(TlfSXmx΂|4 @&^ܒ)1KYq֙ <taxF3gLwg>?oVw;?|﵉OF1nd$&U~ g+ݬ >A*_p';l@\=$aېK7P\:Pr8*f b(휔N~Ǔw2E<¾9Fv&_ x.ot7X@FIHrfoY䨆~tpّ"/_"lvGu$\L}˔,h)L R^[Ob] 94xxB4K_аdZ7`yf;Rb5Pjn^t75B)IwZCČ.+mp 7NSWTꨤڧ]fFq2c*l!}YFk@m l@ K \ h2!^S*SxnisRN8@-=֙r̾r~㰤AR@փD EMA[nI3gl C=?mG~:[ݛ_iB#eGRʧd,MZ 58 Z#ip[K~L6rHiB*PbJ||?%smp͒H[U!B5TZ|V#ɲS[X@XODW_(D4~j7'yy|072>pzci?Jm9mq={Lc ;fK~/ VP<=lA!oa$SӪ|\kc]`28k)CV&ep{,@ȿ13>{ y(uzk1 [6(T~陉L6ZkW )mi\U {~ S7+8 czRK}98d!,U5,+*kֲ|0i?._B&5i H~)Bp%Y΍P6u (ނhxǣh;W..lYpPP/ [8[FcR"ں r B9jQ@7$n&:o)e4fZvpb ^n-UNgucLTgvsmdr{J( +2PYP~|pnnmĴ;C!?S+x?Zp"pP1CכV:sV ڗo^At{)WW|/u|PØ^pԄ" Ab,sHυ`ץFT ]~\ Z8 V 0OOR*L"@g\B,L#be``0,?$0Akg <54=A԰ڢ"%o0kZo;Āq6`@BXV'Qd0 >V\Cm`!rLJN=4P(8yܺ~"ꘈ>g3oU?4h_ G\ʔ`CJL 㦋JY ![0`1,+.L̺* @dKd,LEגjL#zxBz<~\ s2@Z'@M`o"F \l#?DyjKkt[Lsϫ` Df2?62o-q- S)d 7CX8| غ-z,!a!> @DԴ( ovw /ܐuӤX' 袺^ȲGM| {DѶA.}h>(7~ЋTVU;!TL%B}4.$^ T.@;_hÏ:A~r,e4O~> cڂ#88ї8I?2u\:ٛ8+c׮x$/B'5>2Hm/]j&F}r,#$ iadl~x B0 HJ\y\!(߶m\^d(P# ^;uB`5qn+fG`EJ/5hoecLr1C l$]TϢX})]TuHM0?d1i.EʭkB%Ę86z7&[I@a hTHӤ-?s ~»9{ a߅Q{ģ5a`+<5w? 1%F[#DJ&_]`om7¨xT_)Sa2֗8 zOK }(༅ boƐPluj;k"X)3k 8P8o;m—5wy`&yq+X"m[V*[GW_^^Ȏ9(:8i<8g8 =YƅOENYW23IYaΥ)VH}  P adzv š[=@{5mazs> -BDQ|2POӃ'Bcn=,^L>7lFQ/4w+ұ2-,;6uYfN{^;V1Hi|S13/k$ -U ?pyqQ(FaVDFcX_~  dwCly_p43ta2?X.2*R׷`xq~nrx}k€3V~gKJ _w"7`g#?ܭ3djJ<6,[(:谥,D"֍Zq-GUq*Xt,֋C^V @B̧[fe2Kjv߀{ǣK?qhXך`hdjYf&D>i@<^m\ +Db&^YT$= 5߸ӕ8xH?9I5haf$OV ') eܝԙ/i>+mU.97o-e<+Aԍ ؉L9iuB<( Grr$ /ڼF@2msI L!Shce8w=]ǧx0Z)62`SrYqRM}-QPdv3T gƼ|sA !,\2޲+,ٰ#+9il#}u8` 恍;b]5\~Ǔtgbp\ V^)1|ba,,ﹴLz8j@E4 m#d-FP8?= oB\h.'jxbZl@ ZN2[Xuq@-%V$uאz[8|>>Ȯ8c(*IɓB;#,;-@Ąf~<dѻp<2'G/0%B$OrIMkt ,"_FC/I&1} ^}k' TYOX،_a` ;wէѿ\]0F8 x:[qo}r(5Qާ#<Ud+W ķ/vD>1{귌!~@ft5Ve>>᎕\~ƞ7 W'y%+v}[Sa xq@\x; c} ط] l*`ooi;Io a>P!Mf}RQR{ݧ'j>^n&c߂$΁y&fyWJn+T|MYuPIwD`cFz^p8|:^{ݕw2GMr5-MXw0-ɧ9Z?LkYuzg Kրoӫ3FڶUa@+`cMIK#,,'u+I>:vA!=r{ 6,kn2"QSMan*=$7ߕ=E`"0OX8_'MoO&jN/ͅ~'#z]8,<ŵsa.ȅ.g.lp.KfmpwM'5oXEeϨ||"ͧX" M- R,Xe}Q.{M[daGӞe@5`(Gm*0 Jbr!Tb[ ATR)Qd$JX.i&-A8yw1BϮq3sڑ-Zic0N]r%h/vNM? 0 pr>s.֬~P`Y%s٘sTԀWF-s _,g^Ŕ饎X?૷ s3/9XY͝$p <6X %\P ݫJӰ$LLInvVȏ|P8y?q%n!U9 O6~oG'k{ J657Nzqư4b2=)/.|ј5 vI L{7vԃGΧm-&/KIb;bLsn^$؋swe1_i%L;)_qJB[<ܕ32* 3q8=4[osE%=y;콴0,zDοS;F4*n )VifgVɩ`}:]Ew\|o38]@R;l& O-]'0St6ٗdE&\4m ٤|OSM>~7"7'+b?3j\`#R3f\n@fig4`Jrn4)a7<];o% ӯS҅X%Ȥ g!? 6-'_ ^JH y|. 8U'\+/~d_6{{qd`|Er"#Ǘ%4v)F$,({1Z톅ýgesxvھ}ϘA:a G7>`ͥMt/T jA>?TпLs1wqAys9knZe~gz:Χ";:yP3aj+ Z@.^ 3Ee2^]\zH)SN pK!EQvߘ7=0bmp*hMf=r<}?#;k*HIp݉qGEU*bgI1,'h`8([02"٬G6ɟFА4S8[YoXtJ\L?eTzr ]ŵpuBrj| Vn*lXu绿C4I̒ /Gwf'gWrb܏5F#k$k2+DӋѺ@Rp|fsH!aY { @cO$]g͊fQ-w[}LaoNr],ߖ߬POkڌ6)h eJ jG[òJXkk═KR'1yg@~)8nGjL2eQx*9ԩaB@DmB g`nG;$9'ٸRm$o<^ceQieO1m@ >S',aNz:") |M77hoi@jp+׹|C ~ V\gN@3ĀWQ1SQ2[ĥwT5BⵋA p()t?kW^wR9:@C7͔UAlg($!oqbgK(" {=Z-7`*VE ߤpqy[;-P?>Shy`CA$*-IBj\f#A8JMo(?c9i\fk~o$yt=ވH=< Lb^\T3 0r\KMr  LˤZ\>:W$U0D"u0-`+Xc]ηδFg\$Bєj'D+O->&}@ ;mu-@, N(@z6x~ЦIAD;=L|i*@xuBA_5`;2cb~a#mKS8x߉ij :{ + &Kwroxv}\ sQI ": pWnTdV( \,.uuz]߄R:ʓ! Ok{xD޸<.Huc´ Y]_JrA~=Xqp%)`$Pۣ?VF;nyIXmz&rzpbڵglTĴMgpG O3! <)Cp+Xy$'II`, O o|,yM«.`5 O$aqbgTCOU WdžwTyJ-1:we"TƵ1êl rRoI,rC09mx#R758y1;l4(M(4;|>+0/7v9f+<|j| S,ȏia,?n>Ժ@xYEh2BZ惜~Vtwؚ;Mɵ+*;xX` mqv H{NIFx!?;NT[eԧᬲ2 ?1X௰K f>8RY. q<+ma}Z{Q01):A.SrZ}gs裝2ջZZ;݄7mL<#ǩ&!$m)HoCP15JUp`hf~zU[5:-3O8)y_MRDȬʼnU/uqS-%e&WŜ$ 9ثx oqȏKor ?z8=8x5Y'RmxgoHm2I߾XAФu=_dwN1Z8CXmװwa0w{`yecD6xq=Se;( TV.BwO+h(nXC"lW=$|!ZCx0tql^:y6  5g?Eg v+*J81X%|ϿP8(a> ^U@Wקuz;`{  Fg>DvZ }Y9{Ețs*Ӈtek] 7 t ?' Lʝ(2EBQt_ S|*_lS .ш|Z#S[^xȾ,ZPgcpDF$7% ĔB=78:;QCx|E0rܩzØ{?oXט}Km$~4 3f H㷌d&Dؿ(H1)a`Ϋ-tۺ5to-#b=v+7of>}i|\ix ɉoY~ $KEffoUZh@~J^hja>Pqhg[cggdVa(}LZi11 :/V-qVsB$A?ԤB CDwx2/ݦ{U(́ߪ27`BQ[| _M ռqշ/jM&sv$n7pkE 90Ȱ)l5Z_^sN{rl&3w+46R*؉_؋ _ٳF:mQ)AJA/[)RĤ2b DM߯G'*8M9g;RϦp##a%Ze&DN6A*O (}3ǙW6dkw_حGZ67C/8wy!9Sgmo,k`.$Wl?)}k nY^= "{\k%6)V18`̾ umI4 vcXb aRbk=~h;KzK,"eVPx=oLMafҠ{7T$ ՌL?W\ͷoӾÏMr8_@2Rj#hEA[M؝ ox~exѸ,MГiq1-H9)hp`GV%oա/0[=o&W Ŀj+|/|SOY71`*H&FX$k$OŔdm\ J?֋vkӽ3q`%P)^>hqMEP4>{Y'OT 3`ϗ[hLN߸|u5Պ ?H ?1޽)y⮷rY' CI< LZr>F>) Nݕ-Lp|GI< hϩ=䲹T`WXnI2#aC,؊܁=pJPՂ/ Iۗ9%S0#7hksg!u,Evuٗ 6؏0x(_ ELi,t͠%*eEf6x-;-=?G"C9ѶkSU˘ "YxcqltYgLa4L8l=S֒Fme&sI@-*iΒ/ʻ ϯb ~4)щ27] b/F9{Gwq,HMw,K@Z'{(y !*~OC~SoЋR~rЙit/ [BN,tj><#VŞn5%nMp^'X?zbj Rvv bՅuQ6p0[cAJ-4.LrD.ky*c=Y@n ^Ez[ivmxDpZe +G,MNJψۑQjE99zY@L~7h'x7{qtrRͪ}V``/d6kX Ķ֚:Ds)"1M8/)r`Dp*ubީ~'.R*\hk)3c&;vu%M2VX$6j[,܆P`8χf~ءR=9\U Ł $ HukCpcO^^Gth"SmWȹyexݏ4gY-=&;M3R90;LncsK3 A fݓ,ɮ`U#gp2o0mIVbC<t+^pAaێ`&fqoRJIU/# rNYow` q`Rɿʨ9w >t`A6P?eM=֪B4nL&t~|d)Q;![= Po@OL#~xܪ#z&ji C `ܫX_jYX6ϓY~oj:+{}vZ{;NTE Cp ^Z0q ue@{c87ղĜrnm[[oJ4CͤY!Hɪ 3Jv&_m_:, 蘌-񿑝NҠ0h6R_Ĕf8׬z,‚b rST8aroٓk %T:ܖ-Em.S CA)݋_GCRh2ûxW*0a]u{mM)[#w@f &QS86Y2>k;>T>xiGDXS|QBV@2$Myr!:`B9 0Pu,Խώl{ӹ׆<xH('(\XLi(xe 0M\uoBL(&)1p G2u4&]?ŦgL@^*XmUWKgS%6Dne,.4שhL8))Z ٶPhCXzF] 0I BGu4%~Xd {%)qqg ~*+km\w2Sbs;阠mO6pBO q4X눟h\N53?lQY(Xq 0CbNHBZHgB~wi 7N$,> !Mbs{Gt.N`G7" }}&ܚV2|I01dX'-kpf,r=܈}6$)QqALW#rT7im<-c^`TgѪIENDB`uTox/third_party/stb/stb/data/herringbone/0000700000175000001440000000000014003056224017617 5ustar rakusersuTox/third_party/stb/stb/data/herringbone/template_square_rooms_with_random_rects.png0000600000175000001440000001124414003056224030536 0ustar rakusersPNG  IHDRl. pHYs   OiCCPPhotoshop ICC profilexڝSgTS=BKKoR RB&*! J!QEEȠQ, !{kּ> H3Q5 B.@ $pd!s#~<<+"x M0B\t8K@zB@F&S`cbP-`'{[! eDh;VEX0fK9-0IWfH  0Q){`##xFW<+*x<$9E[-qWW.(I+6aa@.y24x6_-"bbϫp@t~,/;m%h^ uf@Wp~<5j>{-]cK'Xto(hw?G%fIq^D$.Tʳ?D*A, `6B$BB dr`)B(Ͱ*`/@4Qhp.U=pa( Aa!ڈbX#!H$ ɈQ"K5H1RT UH=r9\F;2G1Q= C7F dt1r=6Ыhڏ>C03l0.B8, c˱" VcϱwE 6wB aAHXLXNH $4 7 Q'"K&b21XH,#/{C7$C2'ITFnR#,4H#dk9, +ȅ3![ b@qS(RjJ4e2AURݨT5ZBRQ4u9̓IKhhitݕNWGw Ljg(gwLӋT071oUX**| J&*/Tު UUT^S}FU3S ԖUPSSg;goT?~YYLOCQ_ cx,!k u5&|v*=9C3J3WRf?qtN (~))4L1e\kXHQG6EYAJ'\'GgSSݧ M=:.kDwn^Loy}/TmG X $ <5qo</QC]@Caaᄑ.ȽJtq]zۯ6iܟ4)Y3sCQ? 0k߬~OCOg#/c/Wװwa>>r><72Y_7ȷOo_C#dz%gA[z|!?:eAAA!h쐭!ΑiP~aa~ 'W?pX15wCsDDDޛg1O9-J5*>.j<74?.fYXXIlK9.*6nl {/]py.,:@LN8A*%w% yg"/6шC\*NH*Mz쑼5y$3,幄'L Lݛ:v m2=:1qB!Mggfvˬen/kY- BTZ(*geWf͉9+̳ې7ᒶKW-X潬j9(xoʿܔĹdff-[n ڴ VE/(ۻCɾUUMfeI?m]Nmq#׹=TR+Gw- 6 U#pDy  :v{vg/jBFS[b[O>zG499?rCd&ˮ/~јѡ򗓿m|x31^VwwO| (hSЧc3- cHRMz%u0`:o_FIDATx]=%5NIg6!c!z,!D\h"2$4lCC0A~ժ]]Rk-x?۷oJbRʧ><Yo~_-??Cf-8rp<|h)ZJ.IL2rg`aBJHҘ3*"D,S\^y<&hN “Joԃi!OB񠯽>^3и KF]/ _/vKCjZ %w}%:B\=veX&z!XNGQU: 5N%Ul@s^qÏ0NJIcʆV)HFLC c_f667`(f0Z\Xd̔xM Kޅ [֐Vк_mWYASR"$b$Bđ A9o$Wsx04:hfH 5 *o :ز>Gd䵶8J޿UXJ0 ]'@Pk_rBg3xؚZ@Y_bhkxA߂0s^1(]v"0HJ* 0~jsj DžBYBd`k9.Cl0Z¬mc.F 4(3upЂ&8A4)[\}}5}Wu ,tdG[+wS͒k7 BaT@SUG4CUUj n9'z3궷4 '"/J Ț!E\I*3-Sh#WetƉ.DfXe^:',8F4ѮBfiE\ 160F^E"n$t*̺J3'nBl#CU 6 4N B#;Aa^31xl.\;Hu॓d% V\x$)Ɖ)+=VykBr[0{=0kSf,Mʅ8dte񶯅2A!9.d{`P؅>,:b MGL[{#6r"Xސsv&,ոj_QH{ӛKp-FwDwlb; I5n&k:q:NP#_JPlj}9h{ PF%Y^yURgIC35zY Jtlr.Akd嬉!OLZД+.n9M [B2s{64D.#Yn5rj(4ic#!Zڧ6h7$xCl;(#)lqBkyԒ!NHˡ0o58 SkbBiGsvbx5KsBn,!ݽZ%2C:C8^- g^ly\4ĉ[{E_{r c~'4K=/o'i7wcuwzy['b,e$8μ9 q.w#I8ߵ;3e9s{4Ph"w#!D.#\FB'BB?o0F% wq"2āzӾle$9rLޜ b~D S h6S.7'q60U=ɘ__ѣ+y/0ġ{#lkc:wQ,V4q{ޙ\p(xgl=6EQ-6[PƂܸ&V*hZ38r瑗@.sv[9aH:`qog0@Z/:y@p Ee$]#LIENDB`uTox/third_party/stb/stb/data/herringbone/template_simple_caves_2_wide.png0000600000175000001440000003654014003056224026135 0ustar rakusersPNG  IHDRc pHYs   OiCCPPhotoshop ICC profilexڝSgTS=BKKoR RB&*! J!QEEȠQ, !{kּ> H3Q5 B.@ $pd!s#~<<+"x M0B\t8K@zB@F&S`cbP-`'{[! eDh;VEX0fK9-0IWfH  0Q){`##xFW<+*x<$9E[-qWW.(I+6aa@.y24x6_-"bbϫp@t~,/;m%h^ uf@Wp~<5j>{-]cK'Xto(hw?G%fIq^D$.Tʳ?D*A, `6B$BB dr`)B(Ͱ*`/@4Qhp.U=pa( Aa!ڈbX#!H$ ɈQ"K5H1RT UH=r9\F;2G1Q= C7F dt1r=6Ыhڏ>C03l0.B8, c˱" VcϱwE 6wB aAHXLXNH $4 7 Q'"K&b21XH,#/{C7$C2'ITFnR#,4H#dk9, +ȅ3![ b@qS(RjJ4e2AURݨT5ZBRQ4u9̓IKhhitݕNWGw Ljg(gwLӋT071oUX**| J&*/Tު UUT^S}FU3S ԖUPSSg;goT?~YYLOCQ_ cx,!k u5&|v*=9C3J3WRf?qtN (~))4L1e\kXHQG6EYAJ'\'GgSSݧ M=:.kDwn^Loy}/TmG X $ <5qo</QC]@Caaᄑ.ȽJtq]zۯ6iܟ4)Y3sCQ? 0k߬~OCOg#/c/Wװwa>>r><72Y_7ȷOo_C#dz%gA[z|!?:eAAA!h쐭!ΑiP~aa~ 'W?pX15wCsDDDޛg1O9-J5*>.j<74?.fYXXIlK9.*6nl {/]py.,:@LN8A*%w% yg"/6шC\*NH*Mz쑼5y$3,幄'L Lݛ:v m2=:1qB!Mggfvˬen/kY- BTZ(*geWf͉9+̳ې7ᒶKW-X潬j9(xoʿܔĹdff-[n ڴ VE/(ۻCɾUUMfeI?m]Nmq#׹=TR+Gw- 6 U#pDy  :v{vg/jBFS[b[O>zG499?rCd&ˮ/~јѡ򗓿m|x31^VwwO| (hSЧc3- cHRMz%u0`:o_F2IDATx}=d9&ͯPfl_"ZYlѧ|fmV#rJ+ 20c66%qq+ >y$h%tG:|QeVJ)tIȖoRryRJ_ ])KvZR/U*C.K?QJ鿼~}|bk@MV!nכJ/W}o^*߷msw{GbNE"^.}do|Y;ꈜn݋ߨaEQ_2 Ѵ7.)Y5D{=P|}e ^k #L~tlNMl+?Smqk^J)ڏ6ģWwYC 3^2v0 vd;YV/.bUbr,쨑\!k!V<{*t ǢT ^# %8JpH#p h߻^܏gI4`gLLU ܾn,8 @D ܝ7G=qMJbiQ%plJ׾^F;!fpY"NhK C&|\2c7&' 62F2|Ѕ*o0UM|J{"_ 7P+@XS(w v4b2|w*}m!Yzy)\#BZJ?rCd_l;rfUo$gqY'wU@ά *'|sjsn) 2DұFuځ3"uՓVT^~Ci` WTǵ}qk3/gHVCla,B@a qSϫdj9WZ I4]CO~ ݄YxfF!D>9)US|نy9mH= #w=zE zk ?EŅr&RJY\>ĥ\H)TDpC~g*ȳP]Cqyf-kBeVZ*ie/F2* #fU< ՍOYiz ~3aәp^1rJQ9N6)H%A4lWm~7?)G:cl-#IE~_MgZ+]#E0[y-+ '!vgɬCEfe6P2k,Wh \Et:v#%AK ~٨j|CR>dG[5R!Š ™2>˂<:j i{1}O@}fa\+ /$k^g~{<~+76^WoxNCD"prT/H63.F5xП! o#I6b5CD#o$~ pl3 џBZ|%ٸAK3\;m_uReW/݇0g^E=tn6*\^9 >̦c؆*HRރF\ah^hPbqoo܄`$h\]X瓛xr x$"дILr<yNjq+F5+FP2)~2Q%$2 m{'/'FQy!U9"N̟%SfwY)\ח9 GEz yiנjݐ4'k-I\audv;/FG1ro-C3 @) ^X֖ˋ/n~7_E*w%rȓ7^nx5fu/ٱ8WE(ʹs [9]iPl$A- nDUZ| 8|CCd_lU*rfg+@@*B3@<H5gLr'.6\~vlTo4 >fx1T\˭mlCã\U~^e"D"{T mt'"no<{(#č&* U#NCN{ qCdH0LF kX%kmXC0|WoQgr(|bVY ) ^|ooCN |ٲ T)sUR|8lC*r!Ji0fe L8r?* w9@єiLTvly! b6^7"8 >sS>> yƪ g<uCTU&|mTqWIo < p9EU|'&\+BQvERțIz^ 5&Enշdy2SmS#S FnTaV 2:q۸bU657IN 8ZV?dQb!<Ϟ=@]h=y~wQ/(!~__!.C"1w5C FsfqUlE:%b\r؂gU%kzشez@Ϯ jZgbϻ|eTՠY5eo*\By/Y0)>*r"`Gm^lM`-hEZD%Sw*|#ZU \-\Erh8m kW4CZUBN%s$]WK!wY_7j/jJfh9'XFx`$srCA.h0zA zUho \(+9 ,Н@\zX8j2EA(2:)@Ȝ8y68%k #Z@1fNc0RI, 2j4֐|*:$/ g_3gس A?moT aA!V{7/xJW O"8!b3%'O-0  { %!)!"0ֻMɃ"CdND@Iv5"=lC\K]y}GF4Ϡ[Tvq qHD|W+w;2">Aڶ7_ )-| 1F7#S3S1 5#c(!5Oу+-~_3MB1I,Op×oY+QFqw#If _h#cTodTk홲`eF5TO>Wq3{m W~ QPdˌ7C"QЀe_}7A1ߪ,fӗ!ƒLG28QȻ(FSŀ2<@KCC1e?侁s7v7Q* i? >1ޟ3JL!b l m|gX"W%1r[EY^DZ/-#]x+)">rn[Y_U^N'!?O=7l 8Vf5D1]i0)209٦Q/:04ŏ p8YdvcRTutYc3R؆pwB>ϑɾQ:Mg+l*EN4HaXU q5s+:* H a8U{cCP LI? >yh󭚨/Cm`b'OuK&;LU'lF|qϤ#*?ѵx\_ǭD@DVzeUs"\\S٩Qz i ~PiM;Ck h4pYܑfBi,;I~k*Sp-?'CP2 _5E}"f&@MYxDp3/KN1(-P8}w]rF#:3 ܆76_!@D @8haˠ ?/^eԋ^vs8h(X_|`f ȹ!Z|(-JO>C,9[{ffA|x!J+j|91DfeFU*a_ܷ\SBd 45#od<~lHR aJǭ Wa2}<'EbQE[ S0َÿ5GxcA#Q ÷L !Nޘz\&}zaOچ^)|gCaHzCh gz%O@)Vn|"B3Jy(PYLCQA'"Sxa7H1Zo}sh*mK &!pbnQmch!Ro{EQ6gykwr&(|B #}6Jw=&d3U o0“mʘ9wئMdz宀r34R^)0HsRhbI>yWA8\~x (|EK ܿn2VbN 4_Տ#j`Y~LC<bҭ.w΀&Iм-=;cxNڻKWu'a$5XB$oâwd:7ĉAʉYM~ o8}q9Iʉi(*cW=v޻i; Ba'Zγ+0d 14 mRB4 LhFyƷ7lDoxY1z骺G"php~{\$͑ r5H"|^){Ƽag nUا4ZEn+ -6`\y|*a)g0UJ;[~قm 4/JW.|D Ɔv~G!-2fۊEK~Nڂ^/Tc5#|<^  U/$mA^=~&i1;VW1LxQ:RJ#ț7=<[^yNkz= +^L˰=*Xr@{ q.nU*/hpB<)`4sfd ?!Av]/R2YT)3JB 3}#^ +񼳽|qcD۪oQ#|6jTH\>VH]m| %(#  WP^ga b]ٞͦUKi>6 ds|6N5)-6ԼdS w/_Fkal#w![6BJ01ٚ$pS${)2Dyc;4}-K-(NDF2(L" H58CFvI3|Fk֢~N`FlnU XaH|݋MMxJ>6q]pH [1:HBrp3+ˤҨ8*u_.l *%z)q,lBacg8ږ^+Sm9ܕ7404mukd-1~H?bQ`&Ar7Fx]gO>s^K\l2Én > vg}ߞ<i bэ|LdcQxirT!fc! c.15ڐnjcbz}S}*es7-łQZmDU]eOےS!퐳ݣ#Kt~^e1 f`GC/31+aB;/X* >T2V9<=B3 WO)gE7sކUP}ΒQrҘy61 #RWR8Sp mtQ2SL,- eD Ç +jo!!xj΀{Z_j@$ﯯ|l+!!3#Šk'1HBb$n@ g(Jd3aY YW"Hmc.dFx̥$pL6F$p'kBtREjCŢ@g1< )$ 'E` 1R= 2LO4sQHlnJ *kX0k oບYD 9p6 1eMmS_7DqbגqS+oe;+~HTtK4q\'iXׯ//^ͺo1& VCii}c̯];T`y yCe Bc?~noۉ7$ i|Qs^QUV'ۛ4z0c'dKDr9f ɨ]CzY ܪse_lC %>*"7lѲ-WEHf8׍jΩ3pҝ>D!M>9эQP$0O?b..^kY1H>BѬl 6 Xzl˘6+a0OJ̶fHaFV\E6I?BEO%W|I}$,xx*r,<iX0!A>uc5Όma.{W Qm4Hy"sbߣ]ַ108~fփ0<^#Eo L4YٮZӐ*zͱO6)>M$г߽wS¦ŎIwIQ$nq؍1IVD1@^6t?c60-Gr~Jm*u61PKe;1M z+8K Ӯ̅%4]iDQ}<cґ$V\c!$ *!\G$Ռ1RʵJ&M)Ѱ,Q0eN"Hmc.dFx̥$pL6F$pg އK M/iջvGy욆C_ ̿e1A4!.:w䤤@M$!$ *U>Uc# *EaC^|gH҄7x j( $pa7F`)$X DFMS-Ƹt *eRU݋$826~C K\.u? 'pv;cF9xF!"30[ c?mY qmX6ZzHdf~ģ-* nŴLm=c2c>KSیȶvrEgm$KW7Ʋ3A-q:d'L㑸xe̗0H" 0I6ưaJפB$x*mFHp-Fqli 2K,rKzB] ȃxdt1iC^"Mb ^+Iv*տ\3J90q>W* 0tUq1`]~kT{<͵17^?n S^ Q.F*ςxxX>@8Ϭ41Qk\Oٞ1I ~hTX*X2R$X[a|3 5cyHNP/Bz*uvJCzy[J&'=ǔ_K)˗Q}Z+"]ȖP̥$pL65s9XI1+H7CFmb/dO<{$εޛ>dS~ժDOKRU.w1J[l3PR*.2ߠR^LFӋ'2þzkX s1#__ E.1r1ҾZ^7%uq|"^/?RB~z!u/~.^ /igHg?oP}IU2$BrT(mִ7w-^C\Þ Y`j3Dɬ8bt}bCEU=1!}zS쑪9Ȇn7='*&9~@(X^v46&=3EC֮}wMmmFѷlҮ~YCy&K2u6'u {h+gT7IIwS io F!zA0^! JX|zF鵏]LKǶ!߰젬 !܅qn?}#{%.1HgM/2"׵} E&p17RwYK婒?.BB}YլJU)2' ,̅_y{ӋsΌ+I{ A-"=X6{-WAcT)RirRVey_t0]<| 1$'ca D $7*o6HZ/ :uB, O3Nź'lBaBRv-Rې5#{lH|chR\*J5TA7$O"$2=*u^"e 6e$t+zKtt1IgOXOvݯě=$;}XtKxԇ 5m1^o {!M/M id/axfBEL8 o dՊL, {@fO>828f#?/LF"ˏ7p|#f,kă6" $7#Y $1O'īik7Җm :6DBlQMz%R_:;c*Tߑ5cWyf,><$kuc'f!$T/w"G6ƨ d0aE$z2!" ہ ){d#H^sAd0IvaG#q> A8ąe;cSa&uնP.$4W6z1Ss<{o3&7w-G"$bx[XH.0yɊ5>1 7WS`MI\yq]l0YWjhlA(0A*+P}D d1B X5 XLO^f㓤fw,4t6] fX&#˧C"oFļR#mIǨR 7ZLDQٹَT T])6/3v[2g1e5e6CxvR~'" oC|Gz Up~>1B`Y%I H8a*LBG Qoz "M*b`!H侑.:Rkz&UhM#wR7A 7H0&~AJ]zc0bhG"9T ݩRPP6P(85`.h;}mz{Oxm:c%n<͹U6Zm~K81l~䣴T|,䍂YK#\A !U|e*|*cbP~эj%"*$٥Ʒ?ףN|h(0?׍hո&J&#tɌwӒd1F<]l#w![t7 N.IENDB`uTox/third_party/stb/stb/data/herringbone/template_sean_dungeon.png0000600000175000001440000002402514003056224024672 0ustar rakusersPNG  IHDR$l pHYs   OiCCPPhotoshop ICC profilexڝSgTS=BKKoR RB&*! J!QEEȠQ, !{kּ> H3Q5 B.@ $pd!s#~<<+"x M0B\t8K@zB@F&S`cbP-`'{[! eDh;VEX0fK9-0IWfH  0Q){`##xFW<+*x<$9E[-qWW.(I+6aa@.y24x6_-"bbϫp@t~,/;m%h^ uf@Wp~<5j>{-]cK'Xto(hw?G%fIq^D$.Tʳ?D*A, `6B$BB dr`)B(Ͱ*`/@4Qhp.U=pa( Aa!ڈbX#!H$ ɈQ"K5H1RT UH=r9\F;2G1Q= C7F dt1r=6Ыhڏ>C03l0.B8, c˱" VcϱwE 6wB aAHXLXNH $4 7 Q'"K&b21XH,#/{C7$C2'ITFnR#,4H#dk9, +ȅ3![ b@qS(RjJ4e2AURݨT5ZBRQ4u9̓IKhhitݕNWGw Ljg(gwLӋT071oUX**| J&*/Tު UUT^S}FU3S ԖUPSSg;goT?~YYLOCQ_ cx,!k u5&|v*=9C3J3WRf?qtN (~))4L1e\kXHQG6EYAJ'\'GgSSݧ M=:.kDwn^Loy}/TmG X $ <5qo</QC]@Caaᄑ.ȽJtq]zۯ6iܟ4)Y3sCQ? 0k߬~OCOg#/c/Wװwa>>r><72Y_7ȷOo_C#dz%gA[z|!?:eAAA!h쐭!ΑiP~aa~ 'W?pX15wCsDDDޛg1O9-J5*>.j<74?.fYXXIlK9.*6nl {/]py.,:@LN8A*%w% yg"/6шC\*NH*Mz쑼5y$3,幄'L Lݛ:v m2=:1qB!Mggfvˬen/kY- BTZ(*geWf͉9+̳ې7ᒶKW-X潬j9(xoʿܔĹdff-[n ڴ VE/(ۻCɾUUMfeI?m]Nmq#׹=TR+Gw- 6 U#pDy  :v{vg/jBFS[b[O>zG499?rCd&ˮ/~јѡ򗓿m|x31^VwwO| (hSЧc3- cHRMz%u0`:o_F@IDATx]n]ɑK`&6#vbel<'pbvX(pb dd1l8L"EwC鯪\^ޮ` QS]?Um}Mh>k i)m濼ϔ/'׻3̧V̴PM`+nM@PYa4 o̊f(;]uAZ"{̰ oQV9wKI?I)޴  [:ɇ;fASrF>:z#|wɲ5-1gΕDSd#2A5ަ4}r~6?}mPE&4铰=t1;&59X|Ȏd~*+mJ?nRJnolwu59kL覯^OGK ~V$40_Z_M[=]^@S|SyUلV{^5.^dpU7KTuMm曎{a[|2ZW`{y:>?nogpa(% FLY(h Vo[{$=Lәŧ率B$cpΤSi$ .S8pө2i&GI;Khd4J%' ^MrpQ8DN&gsv-)f OV!PFRȊ2S_(`HÓULϊy E{SJO[qC&(}9_KulPPR&S(N)kuH#A)֫G]EUIKLݯ3C1Q6K0㬺Ǯ|oq걌(I}1μǝj?%8 ;BLOUgTLou VXXv,"5:`0`4R0g[{$ur#$mTAMT' $EzoۜVo1gG P5q:ϳڷ R}_noOTNNaC}Gi)Ը[y:ő{a"ۧ1}VUB4澳.bMJkQ}8Օ.j~vWW)0YFOWI Ug&IHQ%D,|$ m]53(,B8;Ǥq''IsTn(ľoקE, L"( Si)L)g$ntxiY&AA Q%k(hR X_h=$=d/&CFqVLFPPϵ3* Q4Os>{i4AA:)%g89&/G3`N}6|˟>ADWk y8 ?* ĘLE(l^[`!Q@|q-#љI?#q(֠ ;ɴ.?MnOܔ cW}A~7LrbeՁEd&UA1xMq=GIO3`aAhrH`rHA,z"jedq-Vdb[Xm=kz 5-LԚ֑ϡtϺTy\xLi AMjHAc8EH:YN/h2AN5@~n<Ț R9e"r#WԿ~4,3,l>F"1AC,R<ѼNs\=VT{2RtTׄ̓01_=BǮASMRn];˘{aJGĢUG1)6|Mn䮒b3{Jni2 k+kYV &A{w{'Ds$&j,TD^y_;.F$Al:y_: #A Rv@+Cu j-5J( Nq)/h̵k b${NY-B``0A)Lhr kSXo0AEV\ VJ9 q/ܷ]$oJU$(hAAYc$dms;&'FI`2&gQqMb2P ͻS͒䠠d]5PG[}VUsCMp#ۄY_D-Y1o+U7n e2I=M.>;.R9D %)E͏ùˣCp0HAN>O|}s\y]jHz.IA-j Aʷ ;H, }$HIG}Dg2)fX=r(/w0OZo0z\@r:Z*'ih(=HyFd:x"S C>-`SwI%nS?WK9\g;i =i HE!-+Sya2Y5V|jj{u︵0PS<ﮝu¯ߦ&$DYfmUPZLKTnˎHJ#1K M-397254 : 174jbnɕۙؔYg>FsJߑ=?}W|zoo8„W#L&Xh!(: 橥~K?9h) kO $dBq:N&'Uj-ĵSsmmU= vLaee фXtnyJr!b3-dKzn|mߌzB9SVTcD~Ӽ41'(y#:dDMAv*=B؎W陁U "SՇ 9Ù,2|"j 2}wk=g? ` &.S<=xpl1(Sr#W"+l/9R զ0DH5q8V;@vE| [߆di<:%6U|eM?U,BE!iIV ӛ=9X]dRdXt!Dѡ47_S6>#*KI^TelOqlB0rp|rT@n  :rcx@Y=7))Ls29&(;<:60ƦT3d:ܪ0>/!Z&_7%n{SpǦ\ LVn#pX| IMA߉sstz42el +mR '((CG酜=K]p$-oˁD3 cXѾeu)yp>ba(:@2SLk,?,IOk)76Nsu&7Qt0NB1"u3sDMRΥj8 a). ܔHc($jt c_|3,/lJ;r6r+ 3Pf[uINs-.AYPr"+S/1OQ[{fѿ ϪǡR,+^%BEAf `5|kANP˶aS|*n^B:)rn1Хzq(;xn (N{UN/DupHRAa61"ֱϿun,LyLm$”ͦ<0#76Ӽ2$\B?x tB<8u)WTG$\CSp `(GF ZSn),\0@16,nZu s+:6dlU~A5Қ,;mt:,FJwrۏUp \##%k\C\XȖ{OhEK[)&(SIIs\K ]!\ H$O/Z,\>:ؐ2HfBu ,ĝdq42vlWc/D1+Xp[hpУk`֙ۈ,r'BHRwJx~g^w\RqVrj,vo9 hv5M}}A `5B"OՋv2ejX09pSkzl_ajiju Ӌ=UuG32q3.?\ɏ (VZ|2UmEiv-p,dl z $zA+(FajQ^4_A7a8 :7W 6~G3VFnձI8 7l4A1Gα{QhWͮY*һ%`ו᨞Y_A7W]c)5d J5!a\`(#':Qb,GwR ˟< fX%C{]t0'  P~|i= |ܤ䄤P2㱝ᵐ->`J(eQM0Ga( ȍ&6Kjq.g1"&wx'J[ rS68 Lćk(*X([pho26эxT <ʗ}h\Ϭ,.nC!C- rq-cc EC2qSʨD S匱v:T~, JV,.rѸNqFL9۫Qr"Ar`Y77:ѫk$7ꠝ*Wq3.ۖU9kES[%TRɉh_n>:Z5 J5A:J0aza2C'TLeة;*48xjFi+J4sQ]7}!A9fh 9f//ա[t,p _R ]lUXMɒpKۆYVn[󤙆%ttwߥGHup+v6{坲|loS '(l+__m#a%˝,7$lˍ GY-ܔW}-g^<(Rg'sH0N6zs?XeM YB,7u*}llXƅd<-M=E55+'e`딝r(_bp=@NP2>~p D) tu:g8FkzkIp Jܫl%(J-پ>x ,tacRp XP Qp Iɞkl3`3Jc=(ck̤Oe"/aŵ*(y vO*%+%RX8 pʬD{؜]kEčm!KN2sDq`oٌ'nCS+OaT>mAωng S(.O1k@LpCWc6OgU )B[mPKzH0c`6މ⪮ѝM!I&ʡ4vZq5sZפ岢,uNu%E rj`'ƲTd7DnӚ 8,oXʍu:NP(|']oV r5$oN(n  `"!ƣ)ۉB- zU`UcH@#$-e3BI![:QGQ rEY;0Qnstz t)߽C,"(׈]=9r4Aπ *e:1\#Z BB!Zzt ] DpA". ]ЅY V(RpF8$Cg35V4ړ2K$'%c/ ,g;Ƕx~ޭoȿu~BQEN([[c|,x1WY1,_%в;FDp UP, żd H3Q5 B.@ $pd!s#~<<+"x M0B\t8K@zB@F&S`cbP-`'{[! eDh;VEX0fK9-0IWfH  0Q){`##xFW<+*x<$9E[-qWW.(I+6aa@.y24x6_-"bbϫp@t~,/;m%h^ uf@Wp~<5j>{-]cK'Xto(hw?G%fIq^D$.Tʳ?D*A, `6B$BB dr`)B(Ͱ*`/@4Qhp.U=pa( Aa!ڈbX#!H$ ɈQ"K5H1RT UH=r9\F;2G1Q= C7F dt1r=6Ыhڏ>C03l0.B8, c˱" VcϱwE 6wB aAHXLXNH $4 7 Q'"K&b21XH,#/{C7$C2'ITFnR#,4H#dk9, +ȅ3![ b@qS(RjJ4e2AURݨT5ZBRQ4u9̓IKhhitݕNWGw Ljg(gwLӋT071oUX**| J&*/Tު UUT^S}FU3S ԖUPSSg;goT?~YYLOCQ_ cx,!k u5&|v*=9C3J3WRf?qtN (~))4L1e\kXHQG6EYAJ'\'GgSSݧ M=:.kDwn^Loy}/TmG X $ <5qo</QC]@Caaᄑ.ȽJtq]zۯ6iܟ4)Y3sCQ? 0k߬~OCOg#/c/Wװwa>>r><72Y_7ȷOo_C#dz%gA[z|!?:eAAA!h쐭!ΑiP~aa~ 'W?pX15wCsDDDޛg1O9-J5*>.j<74?.fYXXIlK9.*6nl {/]py.,:@LN8A*%w% yg"/6шC\*NH*Mz쑼5y$3,幄'L Lݛ:v m2=:1qB!Mggfvˬen/kY- BTZ(*geWf͉9+̳ې7ᒶKW-X潬j9(xoʿܔĹdff-[n ڴ VE/(ۻCɾUUMfeI?m]Nmq#׹=TR+Gw- 6 U#pDy  :v{vg/jBFS[b[O>zG499?rCd&ˮ/~јѡ򗓿m|x31^VwwO| (hSЧc3- cHRMz%u0`:o_FIDATx]]lcIwXu*T\s )ܜ ?pQ @ (pBJv\{q|"~ g~3Ӎy{E|:O?}zi{󿟞??#@ToO?|GD㯗W_N]E?^)E_5q}@ )$W3EKʙ4'2R3qe_T'ҧ`s|YoRŜ?=Yp׏LL~VҹKY ׋|=k- VtoNkΛRI+ڣb9{lzMwMCv3fV'cd{F4[LoHת<ѹ:;[R +NjErrK*tlT,½Ⱥeuڼ[*Yy4WD<`KGsFaX  GPNe#1e =" +`>~Q/ Pe혁(duUl ^ef? {N.#K25iMO?^4VIEXgn>V3"GCL7Tow,HL+ A7A kv%dra!AV^%(t@RXdg )Fh*ڢxV0UvaQ͚^[]N2G!RVAu0jyDXqK|3C^\~>_2¸ :XdeQzOC ="%Y4H=bǮD׀*s#q}N# <2NM 1&Ln,2m?nkKu] DLJI~JZY_+zOm)#^@8 1 Tf7hgv_b /^do^<$w}ԣX2oPbFbRY뭆$>C -eUR z=Egk)rbWϤX/vp6 7jż:&W$iA&M3o"sVj+ ceebbn< =#JMGQ4Mٴd#b.ң cDŽm/e-^)L >\E]# wa|d,<NX zDV: p XO#Ԩ=BܢYu^ !)WV"fr 2F{2 y8j$1lC)Ћ#95A_ j%MI DRD7e(HSivyJ.ͺ^ V,Q .d5v|oV|ysO~zz0\\\"ً]? =rGzDy$7H%); k%%S"wN.s}*ILuӣ$٬rM w\$ =Ceeًm3Ы)N[?2MJ4Xl() s`|Q"`Sg<]G2X02G4%"3:#ʃ EYI&U7.N=ڤP9HHuEAkkHe ~zOC40&z$kC?D{&5K^#kĆ4#1ȆU^y/:Kj&,dX&kyeO3ʸy,X`:7g͛,Ahrs_c7\[{lӵ':67$Z$ԯ{WҌ&XY< "&ԙEU6z``-mXZr$ԦE C! hdeQ0t9Uv IH 8/vXDZ#@w~s:˝[7[nh,'cv#9zGtk=Rc]-7:lo!3vd,T^[ܛwrwJN$@#Pq& \&u٠rMp&typݚATJ#upYkdr*Vm%2V]5?/g\~Ibfjz傒Sj7bv+ث`/_Br,q[^'r.,L3Hj6y: G49/[_yК`fR6(mfa/+JK7͊8&%VUm_*9S^E?D[lrM2Z3oŞ͂/nj BYVf#,š z/ BZ?3~@, 8?>ʅGI:sG!`+م#CA,% ҘT3R5m&fR")|=$2&<9ZT+&3܌ś<|5|OJ?%"Q fFIT.7/9ynϯ[a4LR#ߌ93$yU.7;c`eҒ>Gl#vFS.*$O w/c˂>Y)Y1!.2j5,G/<W3I^ݱ%g>R/cE];IkĂ713U=Hkʒ L9b?%OwZOՏ3`,5܅ -3 B:ܼf6r41)/iW4#{_]$ѣ ՗_{q}v RA׵*[MRe~DK*5Yo҆-T`w-#],ʱ^Ѵ+F)ۜu"dZ~B,ε#r~%>Q}?Xb-ĩrp\¥&c5q@؈,+3.ֻ[FC9X`+sYX %+ǜE|b24+X;ԁ;>wTf/DCb>ɨjQ9+NI5 &77:壕uX!IvZ-F!Vob2r&IݲGdܼdTđ칹6VSQgūn*8މX޶J' <bT2o*\ { ˬqYE5kV ,MIt0dBL=m*kpӤoarT7[VcTKW y *:eozbLIO&[fX^;ң~G%bR~HE \P><^1}0r"/d4)ˎQ0nL+Ɛtaq0^!QZTFEZN)'YckDdL `b UQI X|جV p^˕ɘ[Rakf2-{8GJ>~#VŒf'Z[Z*q cwk 0UC(Euqq+q"M~͗2k,8r[s[5凱'Gp器lt'*nBdBZ cTN-FzTi25d{Xt!u\RR&tUk- ^6l"2I _~Gɫy$V"ƪe5/4Tb^t 6;#.yQ wf2km6iB!V>J^"@ᴱ 7(YΥ$YНmNnz!ObG``k8s<+[_ *\s&h¨aND\+p*4 %|Uj%fqsS09)T8-]+fn"febS,fp jݦrq1 *n{鵻~1SzV?uo3ITAB2vmXp7O[JBpz(E.vf2HZ(JO;9..}p#T1gY$XwC*/kC^IBp#һ) R#Y[ip%/ O‹ȊG+ ~%SŊg=EV&IRE#榨:di)b㿉0tjaz~--aFQmwY:zKҴP6t*F !6exd q֡4hI^Bӹ  Wo!1WW* }vwLFCBj?}?7]nD共b-sZHBZlCI'bOOX|#Â:2%Ȳ1^d+1@6Ob(KzfYQkl gXP%ܞLLsL(10 b oVޛ FC/VY5>vO*SC*YfF(/fRpxܼV ru;k瞲r\\U9)qA]ZQp.}MZHYSf*Y[9[5GösElbzM(0 qÁ J\Px ENb;U4d۩%"0(wM#Y?Ζ{)C='GX*6d1*|nƷWCGǐPQpϿbК1̧vn2@Jݲ*VEC%$=l_lA줛55)T D%V4IM]nܰPjn>2\Ԍa<B݃0ʺڑCWWU;։&Ӂ4w-3F^ Wc_kȱ7h2IT=ZV݀gmxY IENDB`uTox/third_party/stb/stb/data/herringbone/template_rooms_limit_connectivity.png0000600000175000001440000001676014003056224027367 0ustar rakusersPNG  IHDR  pHYs   OiCCPPhotoshop ICC profilexڝSgTS=BKKoR RB&*! J!QEEȠQ, !{kּ> H3Q5 B.@ $pd!s#~<<+"x M0B\t8K@zB@F&S`cbP-`'{[! eDh;VEX0fK9-0IWfH  0Q){`##xFW<+*x<$9E[-qWW.(I+6aa@.y24x6_-"bbϫp@t~,/;m%h^ uf@Wp~<5j>{-]cK'Xto(hw?G%fIq^D$.Tʳ?D*A, `6B$BB dr`)B(Ͱ*`/@4Qhp.U=pa( Aa!ڈbX#!H$ ɈQ"K5H1RT UH=r9\F;2G1Q= C7F dt1r=6Ыhڏ>C03l0.B8, c˱" VcϱwE 6wB aAHXLXNH $4 7 Q'"K&b21XH,#/{C7$C2'ITFnR#,4H#dk9, +ȅ3![ b@qS(RjJ4e2AURݨT5ZBRQ4u9̓IKhhitݕNWGw Ljg(gwLӋT071oUX**| J&*/Tު UUT^S}FU3S ԖUPSSg;goT?~YYLOCQ_ cx,!k u5&|v*=9C3J3WRf?qtN (~))4L1e\kXHQG6EYAJ'\'GgSSݧ M=:.kDwn^Loy}/TmG X $ <5qo</QC]@Caaᄑ.ȽJtq]zۯ6iܟ4)Y3sCQ? 0k߬~OCOg#/c/Wװwa>>r><72Y_7ȷOo_C#dz%gA[z|!?:eAAA!h쐭!ΑiP~aa~ 'W?pX15wCsDDDޛg1O9-J5*>.j<74?.fYXXIlK9.*6nl {/]py.,:@LN8A*%w% yg"/6шC\*NH*Mz쑼5y$3,幄'L Lݛ:v m2=:1qB!Mggfvˬen/kY- BTZ(*geWf͉9+̳ې7ᒶKW-X潬j9(xoʿܔĹdff-[n ڴ VE/(ۻCɾUUMfeI?m]Nmq#׹=TR+Gw- 6 U#pDy  :v{vg/jBFS[b[O>zG499?rCd&ˮ/~јѡ򗓿m|x31^VwwO| (hSЧc3- cHRMz%u0`:o_FIDATx]͋ 8M-t =(i1@^sؽHvAo` 8]䦍1̀ !9YCj?^bUꮮWիH,~w_݈+YL5z:)ʅX\FaMg<ɟ۫n"bgx8Ǹuً+PWWB'2anr&GnZ'-C+~ΧT? {R=<ѐWznʵľk&7\z]Zukʴɉ}uJru5=;e)z6y$d:N(]MK^g3Mxv;*׭pXNR?z5f5*qp@#NަwW<;cշZr'\e?{(\j/,H#bKN{.[j]ez?6jHrm횦u;ȵG@))p7#3ߠYUft|Y~uEgYw5j񫋞oͪN ~A,+\{Y-MX}wzͳ3VX}8X=O:?W(S>ox>m$d^{Ih2]iG)0رӟ[^R][ Xg玝Zk];ptm 3˅T4: hqNX}wzͳ3VX=c,Lry<jlM+X}y6^}~5WOC | [;˺W9Zr8qo›v_ٹs«F)z-} 8zR~ƫy'@=h)"CaɅoBr+kz9NUe>ܷE7tY .[ p`w->{źL^uxiY #&y^}>&lN$'ƫPs,<xW}v}:wM8ˢiW_Wrvعcߐzާeg zU IxH[ ;w\,ݪxu!Fk|MkyU>t*ON>Ѧ io>J օsʚ^Wrŋ^ n tIB#x-O_3@n3EȻ^`*;\Lx#Pcv|o:scxc/c/:#I:M'L͕jO)Q鸔Vc1Cnwc3*>U?tʟxh7AaGY.K>E:*`kt / $YUi0BW ;w_\e_sVd FCzNg{{{6v6#ӎS>9:vkuG,*Ϯ[Z4W[Ǿ~Ӑj~8w? 646nnELj"B>[g#+:[ |ڼayp:>їStrfI6]P6BPu}<K-RRzOI}FKxf:c?kCjq= V<-q/1c=vBȍ;E%R.A: Ҷ<^-MM9{jijsg;w$ɖ9et{hE}:Z7s(>/[|G% e: -;7-$Gee"[s6RFLUwr:zLLR!Dyb$a뼖hk)&4-h8QF#ɍEB:NkN2_SD6YA>hޟD'pZ &bxNR$T0G+֞;yȾ*5,-xO: +$uMt)E<=b/+8Ͱu^{ׯ_rM@V:n >L&DI&tÇYJP E'Rup"%]'RuIөgj68 G Lot 󡠙s\+Q5l!\lY1^{=,c8)R6$fjF_C{M>bʶ:4k׮cE>?"Qn R-tN]{T~qF'3j{oKd7Pg{{;䆱uxQ9paeWM-'d?B:)<l>how7 a1җs%;+DhLj`'Om|5T|H$j"[JGNn:ģiA(噰![-MVgey& Ȗw3ɖxypwlY*܊ׅ—C"A<4<y=rs򱟺j1ރD~G5&[4V,ɖ&-}?]Ȗ^QVK/KZ1ea=6AQVr=W_C>[gGQTm G<Ӡ s+? U\JPx㬫~i֢*jfl񄚏3 i"[3)˨]v:*\QrOb_1J(uprB\,;d0Pf+҇$U8>Χӕ!CnA$~xq߷w 8yY땲 h;~n tHPmxG}f67IWUޣYᮇ '\x.O.mޠ<>ѣyStWeӰvT*V_t& FLΧq$ke=Kv<)]ڡsO'!y[4-% BtHIt|p"%]'TcduNU2R^o$&BʬhC +OŊ$`R.ze#^=ּwǑ*mqyb_<HNFgX+)֡Qqmj U8eG#[:D ``%#RnIsWҧ7Ϫ\CpmC): ׫Gɖ7wC<}v-GDlyԡc~c|g%ukX `L߿$XU dKW".Q[; TO*r˼ :Iaᮞ%$z|p$!VΧӢ5dKaN}œlǝl)%[n޾4~ s ~Z]$| /FixcOnT$I#yȖ5j9;wܵqc-O窓cGeh$&ފ(sv^}I3/4dK E:8-uprB\\WyBp~wtݹe`S!wJB(Sn=urloo[df<Qkϙp^]?2wouU%^vI,-91|N'؊gpw5d˃/AG:8![u4dKN5`NOC62$)E(Zx>j!e2w‘$;Z?VY[<-q`;&[vȖْɖْs 8qotF~/tV[|$I&[tId玥+h S9҇ lGcmݺuKȣ-:{4щ`}]ZG^&Aym,YɖE/-p$[Z۲#[W2! =Fܣn~O2VI,M`?ɖ<ƳtH?QbXKIENDB`uTox/third_party/stb/stb/data/herringbone/template_rooms_and_corridors_2_wide_diagonal_bias.png0000600000175000001440000001014114003056224032353 0ustar rakusersPNG  IHDRT[ pHYs   OiCCPPhotoshop ICC profilexڝSgTS=BKKoR RB&*! J!QEEȠQ, !{kּ> H3Q5 B.@ $pd!s#~<<+"x M0B\t8K@zB@F&S`cbP-`'{[! eDh;VEX0fK9-0IWfH  0Q){`##xFW<+*x<$9E[-qWW.(I+6aa@.y24x6_-"bbϫp@t~,/;m%h^ uf@Wp~<5j>{-]cK'Xto(hw?G%fIq^D$.Tʳ?D*A, `6B$BB dr`)B(Ͱ*`/@4Qhp.U=pa( Aa!ڈbX#!H$ ɈQ"K5H1RT UH=r9\F;2G1Q= C7F dt1r=6Ыhڏ>C03l0.B8, c˱" VcϱwE 6wB aAHXLXNH $4 7 Q'"K&b21XH,#/{C7$C2'ITFnR#,4H#dk9, +ȅ3![ b@qS(RjJ4e2AURݨT5ZBRQ4u9̓IKhhitݕNWGw Ljg(gwLӋT071oUX**| J&*/Tު UUT^S}FU3S ԖUPSSg;goT?~YYLOCQ_ cx,!k u5&|v*=9C3J3WRf?qtN (~))4L1e\kXHQG6EYAJ'\'GgSSݧ M=:.kDwn^Loy}/TmG X $ <5qo</QC]@Caaᄑ.ȽJtq]zۯ6iܟ4)Y3sCQ? 0k߬~OCOg#/c/Wװwa>>r><72Y_7ȷOo_C#dz%gA[z|!?:eAAA!h쐭!ΑiP~aa~ 'W?pX15wCsDDDޛg1O9-J5*>.j<74?.fYXXIlK9.*6nl {/]py.,:@LN8A*%w% yg"/6шC\*NH*Mz쑼5y$3,幄'L Lݛ:v m2=:1qB!Mggfvˬen/kY- BTZ(*geWf͉9+̳ې7ᒶKW-X潬j9(xoʿܔĹdff-[n ڴ VE/(ۻCɾUUMfeI?m]Nmq#׹=TR+Gw- 6 U#pDy  :v{vg/jBFS[b[O>zG499?rCd&ˮ/~јѡ򗓿m|x31^VwwO| (hSЧc3- cHRMz%u0`:o_FIDATx];r1mmT%p P܀lD*&#^;@)ʹ7T.jYw3-^iɠ+?~|PJAEo>~Sۮ0+r#RnT]:ofU%bUi=b'pcYfRoݪu9^aYzo00DŽGbϿ!iwX[t? Z]a;xJqf^[_JKr~zDGu[Nԓ3T8'OcT?^qؗy;ؾpn^Ȋr-%^©wݣz9k/tmU/ۺۯ״7]< z*J>X~T7$Z+jOY 8k;JufI|=9wl߱= pT_˝k~$SO}p8hL}~5x9Nغ] /b_~}Ä3g]ü2E[CZ.luYg{ӱ}o 4gȨB)zNoN>Y8̜{~c.]:lX$`YŬ0&/itz_|uiA.ҞpQx_|ەIC0\{u;;o%h9KVr^r^}ǂte!3C~=1&~#%o_N5׀y i2-/_~)˘9@."2[k-S/Oo[EJ ۄWw`4,2{ ,+̌OCys>!(:;;bk^##We2zhbxLI]se:}'0;r`3!{ $diz>i΂$/y^n[!0}e09Tmy:#2@Cf2˙isx5Zc,T'𸽆Lո2xws g+k^ 3BZ" N!m!˻+Ie {N`H`J~တR#jWT~'Fz~>.nst E-u+G8q,jbF2P`梌S'Ӟ3`f&w,.(,W*.>H,3[16[N{d”^&,@`@Qa6szdp]g`79jA>6xR&>o[΢.{XP?X&GV?ws9X! Ȯ{ LV3" .m1KHH[IRNQ2zsw ;VbLIENDB`uTox/third_party/stb/stb/data/herringbone/template_rooms_and_corridors.png0000600000175000001440000001120014003056224026263 0ustar rakusersPNG  IHDRT\o pHYs   OiCCPPhotoshop ICC profilexڝSgTS=BKKoR RB&*! J!QEEȠQ, !{kּ> H3Q5 B.@ $pd!s#~<<+"x M0B\t8K@zB@F&S`cbP-`'{[! eDh;VEX0fK9-0IWfH  0Q){`##xFW<+*x<$9E[-qWW.(I+6aa@.y24x6_-"bbϫp@t~,/;m%h^ uf@Wp~<5j>{-]cK'Xto(hw?G%fIq^D$.Tʳ?D*A, `6B$BB dr`)B(Ͱ*`/@4Qhp.U=pa( Aa!ڈbX#!H$ ɈQ"K5H1RT UH=r9\F;2G1Q= C7F dt1r=6Ыhڏ>C03l0.B8, c˱" VcϱwE 6wB aAHXLXNH $4 7 Q'"K&b21XH,#/{C7$C2'ITFnR#,4H#dk9, +ȅ3![ b@qS(RjJ4e2AURݨT5ZBRQ4u9̓IKhhitݕNWGw Ljg(gwLӋT071oUX**| J&*/Tު UUT^S}FU3S ԖUPSSg;goT?~YYLOCQ_ cx,!k u5&|v*=9C3J3WRf?qtN (~))4L1e\kXHQG6EYAJ'\'GgSSݧ M=:.kDwn^Loy}/TmG X $ <5qo</QC]@Caaᄑ.ȽJtq]zۯ6iܟ4)Y3sCQ? 0k߬~OCOg#/c/Wװwa>>r><72Y_7ȷOo_C#dz%gA[z|!?:eAAA!h쐭!ΑiP~aa~ 'W?pX15wCsDDDޛg1O9-J5*>.j<74?.fYXXIlK9.*6nl {/]py.,:@LN8A*%w% yg"/6шC\*NH*Mz쑼5y$3,幄'L Lݛ:v m2=:1qB!Mggfvˬen/kY- BTZ(*geWf͉9+̳ې7ᒶKW-X潬j9(xoʿܔĹdff-[n ڴ VE/(ۻCɾUUMfeI?m]Nmq#׹=TR+Gw- 6 U#pDy  :v{vg/jBFS[b[O>zG499?rCd&ˮ/~јѡ򗓿m|x31^VwwO| (hSЧc3- cHRMz%u0`:o_FIDATx]6i} Rȥa7{= gd[ \aw)}-\^ğѐ#0)ÏTF)%3K?loS7unpi_ؗ/z,ؖt[j~_ggg]u [NRMU?E=!,(TTE7H&]aS>X2JX:H/]ŇR}ci> [~YI%z̋b>W/Ȯ}#|/CZ-1|Ҩspꝱe_Bk^cp]z ǎ۠@۫ m*.wDx5RX[`AKCw[nrE-lk]w`LxޠSu#沊Dž2&i^D4<R~{Sq 'lo ۋT?z}7d0Mx{&wǜK[sbMU1Y/9gOnݺc5Y ͩÈUWVˢ`ꉷǭbab@sA(|{ 'lORLN\MUZ$ϽWգtCL0x,e1+-.o/C9 OO=c.Gu(f([x )sxvf/L ܸeƾW%dȺ G}*, oEע`4q;oC<n|ݘ)=Ȑua{Q#O\{X?oNJNrODU(C:X=-2Ƽjb*Q^)tYG`Ʊc `d`/偃;2@!}˳WR.#V2쪭2RfKZ7/HLSLo+΂>B]tn~sHs2|BiyAXi!/vGf~3$:B>PD  CQ0-4D`JF`7$0A\@w&]D`Ƽ'3Z/VID`S"0g$!c\VIENDB`uTox/third_party/stb/stb/data/herringbone/template_ref2_corner_caves.png0000600000175000001440000002300114003056224025605 0ustar rakusersPNG  IHDR j pHYs   OiCCPPhotoshop ICC profilexڝSgTS=BKKoR RB&*! J!QEEȠQ, !{kּ> H3Q5 B.@ $pd!s#~<<+"x M0B\t8K@zB@F&S`cbP-`'{[! eDh;VEX0fK9-0IWfH  0Q){`##xFW<+*x<$9E[-qWW.(I+6aa@.y24x6_-"bbϫp@t~,/;m%h^ uf@Wp~<5j>{-]cK'Xto(hw?G%fIq^D$.Tʳ?D*A, `6B$BB dr`)B(Ͱ*`/@4Qhp.U=pa( Aa!ڈbX#!H$ ɈQ"K5H1RT UH=r9\F;2G1Q= C7F dt1r=6Ыhڏ>C03l0.B8, c˱" VcϱwE 6wB aAHXLXNH $4 7 Q'"K&b21XH,#/{C7$C2'ITFnR#,4H#dk9, +ȅ3![ b@qS(RjJ4e2AURݨT5ZBRQ4u9̓IKhhitݕNWGw Ljg(gwLӋT071oUX**| J&*/Tު UUT^S}FU3S ԖUPSSg;goT?~YYLOCQ_ cx,!k u5&|v*=9C3J3WRf?qtN (~))4L1e\kXHQG6EYAJ'\'GgSSݧ M=:.kDwn^Loy}/TmG X $ <5qo</QC]@Caaᄑ.ȽJtq]zۯ6iܟ4)Y3sCQ? 0k߬~OCOg#/c/Wװwa>>r><72Y_7ȷOo_C#dz%gA[z|!?:eAAA!h쐭!ΑiP~aa~ 'W?pX15wCsDDDޛg1O9-J5*>.j<74?.fYXXIlK9.*6nl {/]py.,:@LN8A*%w% yg"/6шC\*NH*Mz쑼5y$3,幄'L Lݛ:v m2=:1qB!Mggfvˬen/kY- BTZ(*geWf͉9+̳ې7ᒶKW-X潬j9(xoʿܔĹdff-[n ڴ VE/(ۻCɾUUMfeI?m]Nmq#׹=TR+Gw- 6 U#pDy  :v{vg/jBFS[b[O>zG499?rCd&ˮ/~јѡ򗓿m|x31^VwwO| (hSЧc3- cHRMz%u0`:o_F,IDATx]ndf =Ocہ1*CZ[(a`7k*'3ՐC?ln\TS9SU/ Ø.?~\LFMO~r1:~W]Ofu'ûnl6MooWzZzZeelV k3Zvje{7e_F\oιR{FbiX F^-;7S\]KFܺtg՝+dG';|@_o{zv'YظŮ^w Y/Xw0#٩x9]^[}vy;./OUj~[puvfݗ@[2/{'?L/ ߯s||EkK(zkI ûsvՆzaܭ>Tiv=4oGd<5uvv;ݭHA,{{BS/>{Ȃwr#)IIO~Z&F+fލw-wǼ?!u׼dg޵/`˿?0{\Tű=l`֧Ռ}$ku}<㵧#䡿 q2nAeٵ+dz'[!(f^^B@= >ٟR~`G&X}X`z,kpX}Yv/p>@&˞;W=jr Tk'sӪpr/@S{~H-p7n'z٩w}!i]wۓX}(7+;+Ƿ 1QӺE՗0z#WOĀJNzlndGJ`m賟$ߏG \+oINix{/TF_z-X{}{=V,Fc,Z[ISJpNzw ;57|1ޮno ߑfXV?zoBwH^}^5̼zeu/~KgF\&mʇ,axBdWE،Oorӫ50Feٵ9ݙl,K"{q W|Fo8_ەM?w ^k^fbyA*2%G#S>~`6\^gp>{J -KduG 6ۋۧ>lΛ̎ ?Ib22e`ubOyRe/3em18=4{Y>W{?:Ylt)lٳĬc.C$r˓(c;Uɫ?sqˈ  8e"ŤC͈CSDlʄ.2ߤb|:#UAKoonD]+fP<Z;|=9c DkΕ8zpn}u|x_m;?XVs]OGg / ,\(I( wꞸH1ɉ)UҴS3B=m_M_9l[6` >;`'%dཬovٞdԳND\&fO\A4ɓ(Aέ{|j~85MhX@v ՋJ,.sS^=IOQ́x-cSHQy"`MwUp1JzMj% B*]Vrzѷu)y#{$$eoI(gG!\5}dlV?> lXkӳ^=«/WZh<4zvf8R^Գ9myrź3V_̫pw`w羗>;H3 Vo{Ojװ6p7ӫź#x6;Ua&b,Fq͓h ْFY>.[cCR9'qAHwE'4NAn˟dڣ (x@p;WË+ [-*yI^7d?zq ;okq `x As ٟh~`? qvXz;A?7Vz[s a#z8X=+Y!`zOJWX cL^g)0HP^v_ Sq˓]ZμA %Ŗy's zH> bj.E!jfᢂ S yg%[o甼.G!%c3J`I.h{ó&"S"黯gŸxGvmV 3-r|FۿƓ1rwln#N's|5DzX}Ԗ $5:>!$ R˛+hAoZmnNRv6t0o϶/ƓmzpzθO +Fp4t%F [+G{sǾ D1,chpfC7{X9=Q=̀ waKLb/czX1nrH2edKͦ۞dKf-G?-e+e%)[kre(^ *+l-K(TqAH([ e`+I6Lْ #x=wO>"dxʄ 񈪦QǕxkߥ|{J0ogb27\2YNL̍_ /kC:t^.=tj4Sn7ClD0?prgR7Wr͢Z<@ [n !dVR+$@ Ԙj؈7Y-J}SNv~>>&RƄ`#ogd, Y[א-c_pmFmJff2:My ^\rDeioon/ee%Ttm9CV׈'Ō2=S< %:G-eU"|- [ 1HACr([)%Ih9-`IEJ|& ʖs۟dud]LӋii_Euk2a__y荃 St8tx(Pto:5'NަێQ !?Z' -a1l|vR&EqPI2 *mj1ky^ݮ㝓/qIE*x9Ml-Gyvw`Wm<9ew|O`siFʈ'ic.qm^ ꏔU0%0bȖDP.yHʖF;Pz'[W2U$3c{eK֩Ӕ- EJIR g^ W/V;~='2xIfDl<ϟ=&wCmpLȌ1v`N9W˺ێqsZ%w)݂ٙ`FߝFN%@6fKܷ %@nVqmr&wCr([*RF n([ B ZF9s dpVLQlRNYx38c,fq |ˇ?4w!jT>x1$J>wz 9L,Zl +p SZD#@J6mwv͊mh_ڔCEǞ#ml_^oC=MT$J0 6nW 1 )q%[kF6}E%,"dK6bDJQR#[wDdx)cOTa~׈kXƍ[F9O%a )dd /7^oOl_Vn꓍ rʖa/Wgg$W%O_B9U9Y`6ҴdˑJ~,qkLIENDB`uTox/third_party/stb/stb/data/herringbone/template_open_areas.png0000600000175000001440000001712414003056224024343 0ustar rakusersPNG  IHDR< Nir pHYs   OiCCPPhotoshop ICC profilexڝSgTS=BKKoR RB&*! J!QEEȠQ, !{kּ> H3Q5 B.@ $pd!s#~<<+"x M0B\t8K@zB@F&S`cbP-`'{[! eDh;VEX0fK9-0IWfH  0Q){`##xFW<+*x<$9E[-qWW.(I+6aa@.y24x6_-"bbϫp@t~,/;m%h^ uf@Wp~<5j>{-]cK'Xto(hw?G%fIq^D$.Tʳ?D*A, `6B$BB dr`)B(Ͱ*`/@4Qhp.U=pa( Aa!ڈbX#!H$ ɈQ"K5H1RT UH=r9\F;2G1Q= C7F dt1r=6Ыhڏ>C03l0.B8, c˱" VcϱwE 6wB aAHXLXNH $4 7 Q'"K&b21XH,#/{C7$C2'ITFnR#,4H#dk9, +ȅ3![ b@qS(RjJ4e2AURݨT5ZBRQ4u9̓IKhhitݕNWGw Ljg(gwLӋT071oUX**| J&*/Tު UUT^S}FU3S ԖUPSSg;goT?~YYLOCQ_ cx,!k u5&|v*=9C3J3WRf?qtN (~))4L1e\kXHQG6EYAJ'\'GgSSݧ M=:.kDwn^Loy}/TmG X $ <5qo</QC]@Caaᄑ.ȽJtq]zۯ6iܟ4)Y3sCQ? 0k߬~OCOg#/c/Wװwa>>r><72Y_7ȷOo_C#dz%gA[z|!?:eAAA!h쐭!ΑiP~aa~ 'W?pX15wCsDDDޛg1O9-J5*>.j<74?.fYXXIlK9.*6nl {/]py.,:@LN8A*%w% yg"/6шC\*NH*Mz쑼5y$3,幄'L Lݛ:v m2=:1qB!Mggfvˬen/kY- BTZ(*geWf͉9+̳ې7ᒶKW-X潬j9(xoʿܔĹdff-[n ڴ VE/(ۻCɾUUMfeI?m]Nmq#׹=TR+Gw- 6 U#pDy  :v{vg/jBFS[b[O>zG499?rCd&ˮ/~јѡ򗓿m|x31^VwwO| (hSЧc3- cHRMz%u0`:o_FIDATx]1^Ʈ 6 \]:9'@ܨ/ 9*Hӿ|Z.!9%wA{77;ΐ3æ:LW__( j>?N}Bog#hm+eR~Eoۮc:V~+б?kZTޱrjR7^lo_~EuMsbR TC1 +XqAUϊ8VWj,UO<9P^Vg5n-mʞ(VfJaۭЗ-+|Q)u{U]:f%޵J)- +C*DKijmrϽf2VARQXmJN9}<)rcOV) Yf!X"e4RYmb'&lF/EYE?'B ])C/baYZx2DZ, wnsAX,6 nH'V"X!X 6oI !wSJ(s&7H#7kx{&e(hp;ZP_rb*qJ҇,cY=~nDIb1mJ R9k(UbbW*zX3tC*BikU_ﶞu'={ezTG` vK Ná='em+@nBvBvW XlHlyŁeMAl22o nP3 M[z7HH|?7+. z7ifu6\˔b)3("5V^g4o^n_qqN0]e "#zYE\NJ"fKIbDnҬl#j,XA\_8FȲ-|&lP;fi3cc@j:!j)K?X,6 nݠz7DD(bXg!.83s'CyZ+ X 6>n-fPVnT6}-8T6JDqb`VڔD MDJ~^[S/4Abrژd$Оu-CT) EtB!}ǔRӬ (7 IjVgwZn<[ }b Nz7p`buB-.eU9 "f [w'qt zoPn)`ĪB q~Ʌw-"r$ҽl b5I)-$"JޱH)y =%/wäTF}.Ðό93M꺄4Ep Ώ$%qߘSES{uX#w:~YmN-%JeO'S>c({-KH9_buڛطRtvt]:{=kP:~hОnPNC'Xg}2dy)"(Ctl!!;?^{[B+nShBhL=+%irիǯ^=b6jTˏ$y},bwy3r iJ@v)9"V*8*(XE[hR2:/LsHl+k!>VC!kȞHiQC X}T8XY,,ͮU4XS Vt3rGŊ-XuR F|,/VUP+4%(RKa VRܔPJ;UŚq]xiXgxJᏚk"O:wCj(姏$>N drK0u00PܚȲKb0s+0PK `] q*nXnX p(V-X@}M o-E(])Z!jJJꑲ9Y娿+ V0`ǦXQ͉lw*1*y1S*C)}P:bUOVͩXZ%Ep R!~S==FN6JX#h?LUe'h94% JǮbRGsItJr8 X(mF>ְܰ:+M9,CukVG)r:nX5xNR dnX$F}7:!{Kqb߸p k#tE߰ n mEUpޡUU^JRVqj},ܰ*cAB5b!bp(jT A5%TSR A Z,׽)ST8h#!z΂#`xi6Q!PR[K2e|I&,',BPVX l7Q)^VX2T5*ڌ+XчRer.X *m5n@U-<ұUd(XuhPLλh"lU5ojY$=`XU^JRVqXa*b\p(X]bQ A+Z!jJJ!葲9b%B?OÞƊBi{z2O_|KI\)mCmwn݉{GJ-ּ]\jDTP,ĥ(kAXY>ZNNJh"R PV"' * _e [RؽkDmw,X%RzMu)o)!O>,Oorr\ %p㐓ѭԸobr DJrBbUޣJ@a bUE/>FR8Iy~~>,?kR_0J dBܰV%, CsxC (e{E+XՔ2PJJj(e_zsoS/8KSxW"kr=`56:'c`v VYVa(V P,(XELT@OLʸnIENDB`uTox/third_party/stb/stb/data/herringbone/template_maze_plus_2_wide.png0000600000175000001440000003152514003056224025460 0ustar rakusersPNG  IHDRf2N pHYs   OiCCPPhotoshop ICC profilexڝSgTS=BKKoR RB&*! J!QEEȠQ, !{kּ> H3Q5 B.@ $pd!s#~<<+"x M0B\t8K@zB@F&S`cbP-`'{[! eDh;VEX0fK9-0IWfH  0Q){`##xFW<+*x<$9E[-qWW.(I+6aa@.y24x6_-"bbϫp@t~,/;m%h^ uf@Wp~<5j>{-]cK'Xto(hw?G%fIq^D$.Tʳ?D*A, `6B$BB dr`)B(Ͱ*`/@4Qhp.U=pa( Aa!ڈbX#!H$ ɈQ"K5H1RT UH=r9\F;2G1Q= C7F dt1r=6Ыhڏ>C03l0.B8, c˱" VcϱwE 6wB aAHXLXNH $4 7 Q'"K&b21XH,#/{C7$C2'ITFnR#,4H#dk9, +ȅ3![ b@qS(RjJ4e2AURݨT5ZBRQ4u9̓IKhhitݕNWGw Ljg(gwLӋT071oUX**| J&*/Tު UUT^S}FU3S ԖUPSSg;goT?~YYLOCQ_ cx,!k u5&|v*=9C3J3WRf?qtN (~))4L1e\kXHQG6EYAJ'\'GgSSݧ M=:.kDwn^Loy}/TmG X $ <5qo</QC]@Caaᄑ.ȽJtq]zۯ6iܟ4)Y3sCQ? 0k߬~OCOg#/c/Wװwa>>r><72Y_7ȷOo_C#dz%gA[z|!?:eAAA!h쐭!ΑiP~aa~ 'W?pX15wCsDDDޛg1O9-J5*>.j<74?.fYXXIlK9.*6nl {/]py.,:@LN8A*%w% yg"/6шC\*NH*Mz쑼5y$3,幄'L Lݛ:v m2=:1qB!Mggfvˬen/kY- BTZ(*geWf͉9+̳ې7ᒶKW-X潬j9(xoʿܔĹdff-[n ڴ VE/(ۻCɾUUMfeI?m]Nmq#׹=TR+Gw- 6 U#pDy  :v{vg/jBFS[b[O>zG499?rCd&ˮ/~јѡ򗓿m|x31^VwwO| (hSЧc3- cHRMz%u0`:o_F(IDATx]=$Ǒ&<ZC92F9_0@ 1Dc f{"_@ȗon ~F ı)e[ʦ症ږfp׻_?~wn6_~w_=8lJ>^/w;%ޢ[Gy<^_m٦<#Q3zza_=->#Ѧ{X߾}[Js;rLfn(䴣Ii Y‘ni.v=nɛʝtʹm(~!it+q\t_*i-Ɔ "$cѵjK\~'ewf"o"h)" BRD~ȿ> {rc5 fv@kƏruRʻ?ǑZDiuNE62C|Ʋw$G|; >#|p]lCyđ!#Efӑ3ظڝ#pX^5"/?td,$)#SE"ϫyad槏_ǑZDzuNE 22.䆅ݍ ]0}=Yw'b?:[fؾ# d)wE" D^k`uLz Gޖ덌WI"R#[}rZbwCW][:1ChSI+e{?GWY2HNđR!J5WyWRNN;jH[@{ǸԽ.[obŒ#L"{\Ln?T _|}Ηlař/Ɣvn܅غ;.cH Uzُ9"o 'xL3`f-~^If.f,LD/U||˗~yE|Z9:]-ܡiw"ݖҚGnfHdQo߾E!v<բ ȅaspH}~h%y.Us|x +\EcMFf?Tb-4ZGϫj bu|FHjRᄑ+ )yDz\v;*NUtJKӳ5-ZTTÎ. ZU;\ڢ=9A"oxIA/ŠwhvWWJ 4 jO~o;li pp?qUբ4lu"NXt$Uw-rAAGP9ҭK=]SdaH̎KN poL̎Unލ;-$mE޷zK׻4[zB..iJ*sFv.{FZ>Y<{a[՗#9: GJ5(\R͕jTTs#nЧjM5==%@.N Ecw)K>5''֪#M BVS;f3ʡ#{K" CZD Kۭ6B%1WtTs! csHq{ƫj8TsospUDkHXR_ p?vn ῑ8i{)+&eG+jG"Os2NR5)9Rzs+81 Tb~+u)Us}B]324S#|iWZ4 UR͛q&WMo%kե."BZK3faE}gE4I[[7 帅98RP;NUNΔ[G$ۿL`ReY;AHH͑LJ$H8~"x-)r_a]W5zz?mŕ)UL}i9pTsAHR͕jFvm>eꆪwXsS*cANQ LÑĎE(Usf 'f{g+O#-Mi7>  ɴt|iR5 !UHAGjLߑ%ٸw"ݧq[#i|:БmM1Z*?#//8 $qG* a D%g˒4I>q %1?D:͎FTVA8d 22o@fv-hWߔ*_`DvzF͛7ԧ?>i$ݎWsqK)r$G'H悐 >$AX帶#n?駟p"eհZ!Ie?2^$Ky#QiV kP%)1RʣIB>D %ϩ-K5H D?k7_Wtp/QX5G`elj邫:M^{34m\dsUnq=a)c5qe>$N0#]ii6/,葾 z4#,ϑt !#"9onmNVw[;spxmˤ6"{6ґ H[{2wGp=ky s8˥z&% /)^ȥihʮMm(# G${#I ørim΂ӉS HpWoTz^+s^UDo6]zmxs4a'i({,Lw(M 4i,TI,` kত\[\۠FAI6"yK-3MCVJ&)mHDf[(Yΐ Yg3h|DrdzM[9񩶱}@Əfq[p:'#\2yq$Uyΰ4Ș6ɷSh KF$"Qy),dgHBv,QXl.f9almѳ6ző{y"Q!XXTs~}v}}"҇Ƞ͛7 t^j AUp`A3T [.^TbNR9YAIxG`׵aƼК7’I@2"@s<"}٤@җǰ,2F /˂ۈϾGa$h#@qw"LN9cX#8 ADCqRdD5ܵW6/tN7xv0?v$CrpҀ:j-*X{l^9/0F$:R'x汿/]a oc35]Ht !'"TL˫HĨ!\$,*,$}9/1"3vr^Vw0Q337n# *# G8I STƹ< TDH.z`i-}yD Data)HI_  dDJR~CUƛw}eհ* )Q²Ru XQwGΣ^UL6 +<+S=xyvfqǔ@߂0MD:;]iAFp{`wsP怣A HpTYaͻ 'rlrW]b9`H,߷_*ù3$d!;CB (,heK_t)=z/{#j1M*7*d1&i##Ňyz}ʆ76ۈ'UۈqXG"d!PΝ!! φgFau)e9l{$wx`"ʸTtiI)1V!%.s[1쳁k.@ᒞYwUX#BFDB=ճ,A? U|gֻؓ3z{Z+o@Z#ml^ūHgްnxm6ِ8Ft43LjMG`z?aV}AIN+"]BP*[m,"5suz"Tw$<j ^j Hpٵ;/y'7 SLACN Hp)K4A1l2RdjQqiUK_<<^ʶe[U!uV$̸ */!i dDJ}xnK)۪H"Ve!1QXC* >4DݱzBDQ9zW1&5&X4C߂~7D65>vf"՜E$A8h̹mtel"ŠYwx](YΐH Yg3h|D22/.ЎMvHz v8`vUYH.5FW8l}yzφ?y Ϡ8RH7յ"Ʉtś%$$H`Bܔ *d-\vJ\6)(" )F$pB$|$ȠʲqB'aɈD(Xv93!`4$,ePXEDJI?2"`7\-# G$3X[?|$ǃ$Rxh(,.g6$,eАP  G$CZ0QF \Ow;x̩`i,@qHpfD_Bc"xk((" ©D! rA  KAҗHRHTF2"R%) ~mU{^\V (,!A]tNZ=U^d7*ET Nx44o?rCƾ@M4\[tgvc8hVNq4 RaQ((" F* p!$*7՜uL'R6"! 7 Yΐȩ~6<6 GxuBd1&Rw4*[j%$sq$A83Di26Ej E0HH($#,YW׿-,dgHBvDNQXG U(p$H2W 3P|IIN="ũOl!u$Gz!2k^YPDcHYȱAd!ǀmhBV/q fv3ڈspDiQXGF!bN'5,C Hp*}$e65O3uHp6NzCs+WLHYmQF$I_Na(3H ; |0:H]~$Bw#đa;(Dž({ Ay, J'";hWҗHPҗ ekf6k̠`9Gûډ# E&W6dN`9aʣ"Ґ~ AH_+aAHI_ 4!;a-;IENDB`uTox/third_party/stb/stb/data/herringbone/template_maze_2_wide.png0000600000175000001440000003075014003056224024414 0ustar rakusersPNG  IHDRf2N pHYs   OiCCPPhotoshop ICC profilexڝSgTS=BKKoR RB&*! J!QEEȠQ, !{kּ> H3Q5 B.@ $pd!s#~<<+"x M0B\t8K@zB@F&S`cbP-`'{[! eDh;VEX0fK9-0IWfH  0Q){`##xFW<+*x<$9E[-qWW.(I+6aa@.y24x6_-"bbϫp@t~,/;m%h^ uf@Wp~<5j>{-]cK'Xto(hw?G%fIq^D$.Tʳ?D*A, `6B$BB dr`)B(Ͱ*`/@4Qhp.U=pa( Aa!ڈbX#!H$ ɈQ"K5H1RT UH=r9\F;2G1Q= C7F dt1r=6Ыhڏ>C03l0.B8, c˱" VcϱwE 6wB aAHXLXNH $4 7 Q'"K&b21XH,#/{C7$C2'ITFnR#,4H#dk9, +ȅ3![ b@qS(RjJ4e2AURݨT5ZBRQ4u9̓IKhhitݕNWGw Ljg(gwLӋT071oUX**| J&*/Tު UUT^S}FU3S ԖUPSSg;goT?~YYLOCQ_ cx,!k u5&|v*=9C3J3WRf?qtN (~))4L1e\kXHQG6EYAJ'\'GgSSݧ M=:.kDwn^Loy}/TmG X $ <5qo</QC]@Caaᄑ.ȽJtq]zۯ6iܟ4)Y3sCQ? 0k߬~OCOg#/c/Wװwa>>r><72Y_7ȷOo_C#dz%gA[z|!?:eAAA!h쐭!ΑiP~aa~ 'W?pX15wCsDDDޛg1O9-J5*>.j<74?.fYXXIlK9.*6nl {/]py.,:@LN8A*%w% yg"/6шC\*NH*Mz쑼5y$3,幄'L Lݛ:v m2=:1qB!Mggfvˬen/kY- BTZ(*geWf͉9+̳ې7ᒶKW-X潬j9(xoʿܔĹdff-[n ڴ VE/(ۻCɾUUMfeI?m]Nmq#׹=TR+Gw- 6 U#pDy  :v{vg/jBFS[b[O>zG499?rCd&ˮ/~јѡ򗓿m|x31^VwwO| (hSЧc3- cHRMz%u0`:o_F'IDATx]$Ǒ&yZ. se0sZ_0@\1a'C+_/3jYETuu{eOEEEUwĚxv[A?6! BRlzݿvymn?|}'?f3ooGM)ç?}~m|}p#><8F}F7O;x}=pTeG)]G}FMyr{u;sfv?ӎ'::$/uK#ψpt3wpIOyxwf\Iψ{v3 ^C#n!4%460oľ䘔U'ޙWWwfD_5̝#e$AHH_6ƌ[ /2\m,G;0=_ ;:0 ߮_(RG~1uR߿Ǒ""ps4ODEt~XybXVXdPn>#d;3}Wwن_# BG̦##H<1;GఘK5"]~XIdgpt~K g3ҏ7_Oc䱔r8RD牨s.Add?\: 1c!]0$ƞwŬEBl j;2EK : LƑSWQ}wȵ0:<)q"#9% (ŹλoAGȫEkͽ[vDŐU_n "\6R#ztJh%Tj. PJ/p<䴣ITjG(5wq/WzdCPmD/x*5㋯<5X-̝ܼmJM;q7μ״GjEH3o 'xL3af-U@^iG{$3+^KN?LKz<^z:G袌lzf%"qwh@El%Yt zOE$$SrHRzޑc\q]j]J6Kͽ#2$-EWq3~}y)"] uQ)ͥQ;e̸SԜ^^`cp?rQvBoDٕ+3D4/`o]Ï"*EaGRF5 PFIsMTHMy)rđ!#y&utD8ra9eAuKI2(R#\=x xpbcNkjBUUW__>v[\_ԗ#9Z# BTjR \*5OԼofDY0."?Yiđk3K%QDo-v?7nםq#9>V ̛ F}E(Y$:u\yJ~bx:G徨g{$ pETjvtQcK*ȘWFf9&~FH?0Vh6F/^B;G)9w< j{ khǝ:r1 b5Ǝ$ܴ\X.wH>qTwjuDT̓J#씢2dSDkfJ{($<#~\(ϫHn'#ԕ5VR3K3&q(Qgj2C<#IHI2O+6n'cg3ZcqI g"f(BUU>}â1/-GrG*5\U\ENG`ͺ %(O3څ!H]طH86Rr7c HI2RH;MFA+ҧTw#2P2hU,ҝ#ED扨s.ch\%n??61Cs 9F#BXqKΰsg/<È"t$$IU0+}]zo2]|)b"hǼ(/`"ZcP5̢/9RD._~:ODEXG4~Kbin~ ]:|FպבJavO5ЏSV`\)YT(kJ=(# BRFJ&A7~U=9G7l6 :ː_W5xxUUJUHH悐JUj^TjResӑ 8nn[tU:l8X6N'ivxFaJaYtZU?*fVW5kڹ^1v59VU>?>jP Lv)ՑJWM;< 2F߮H\x7_9Tͻz;G@W/=CDE4j9+ ءӱvN^p:VQMb"C6;rXns$jڃcTj.s$/;ƠM߼{gfgbȕWpY +Rs/]~sȎCG3 H$?Ϡ/KϠ/9RDz"/"&I;$^^4(X\SZj2 e1VFJͧ|F_r=AJa*DMt7VI2Rm_ +.-$0NH^tr=mrݺ^Y[՗#9Z# BTjR6*5WyQJ͗jt*FzuR0OFmw5̳qwR5Ef97w =ϋl6zv)c"xK}(Ri'E K\LoWM{DxN'Nt޳x,AnsR5WDH<DrY/m][DU/=v0ӎ‘[G"Q5GjA*մǹTaJDk!3?eT52eV9w|_J՜u/kF RsQ8AjyQܞ->Kmzܪ Q`E|xF* /4@9~RsA#[nD_$ ; ۟L`"82TFGԺHBI 36^Cd۲I( ;zU͟^}}OmqUJS_ZhTj. PJ?ب\E*5_9eSRA9I;w)`9ޝn*59@s"G^s pw D{OʷCHA$]2R!LlB0ȋr[>ym$eV,տJ\"U#G;.dYboM;BoE`T{ͬ;T5W\-XeP%fȷt ”+l+\5&N84Tv.̎,si~g*UsET̓ PC,n(Awky'4cks$͖O'ҿ>F6o8 $q3RaxsEٲqY84DD2 dgpYKtn6ˈț]+Q.Hdwg4iDo߾ݕ>woEcAH-w"GrbG*5# ~H qmG<< ݖO>AG˪aCA"8^ }M^p"q5ꮅ THݮ HpE EWbNu<'r+Ɣ:AIFFKJ R .};z t8rۏC8rF:bɑW~:=IEe\9 E]8 qFyB \C/ U9AIVR(iÔ .)͓:g$I_Na(3HB֩CPqlKՃ6K8 '#M!D ;Қ A3wD/$}9/1#Q.ᕾlzl^pG|JҗHdp]PLi~,f&e$AXKFJ\I@Cm>0'$}Y/ ddJ~C"7ޝUê,[T4D#' 1 ǂ!/#>){7 s76;#O$'\4&Rs>57+\jJ9 R/3#~] ΐ Yg3Q8~F՚us4apre?u`D ڽ)hNIVΑ Ws,m:޾ǑYJp̌DBM*;CB3$d! Fa)y U>3F62tbO#(;# 3Mx\[\$dzu{VS4oe$A84lMYHc)}iȺ| Bn/K(9#Ir1 KHIe%R ~PS Hpx.5g`5u{zإ SpnFY~¬8 +#:\նL'4ҸWv4w$He.^DPpD(Xv6!`4$,ePXDF Qv9eI`M Hpɽp*+"0lӭ!:{ؼ9(#.2`ІeАP  ACY"#4DHWw_R/UGHW>w"@DsP씑,3R|_&޿6)2(ԥ/o{se۲-۪2 zO_wf\x* &*%OO7ඔ4~f/˪aUR@ QwQwGΣʋlV{JXd6L(,d yhATSEcg&J x%0o.(# ‰g$wEgYN̤cZbF"d!Md!;C43$d! FɨhCC;4=)jg,}~zjpc Hp 8d/k#5e^ĎY˟,,dgHFw,(,#!K%)Ǹ;2c-sb_|## z3 %z9!^*"[yoNΉ))# Z3sАl;t җJc:Myeƈg GH\G29R6 BoǸxQɖDbvmA(}deH2&_II΀#^'b %44L6*Ќ6R#d$Br),dgHFw,([|6f.d jHLjE]!q$AX#G*J#wIm$F Je"e$A8یB>m)?v8`vUYH.5c3h_^]P8rF/=Wev3QXGJ&.u!.M\py ($q$APFd`mhBEFa 2 pn->VYnsJcf$B ˠ!`4$,"2RbuMB\! >ySۂ8 ~F0o޽eѬGy<(6ɍ]js/EHeW3C ACB2hH(X g$C0Qf \Ow;x̩`i,@qHpfD_Bc&xK((# Z2Ґ~`]`g9Рvw؅ cAҗHRH! ddJQӫ+u -l"ً߽4~jXǨG?2kҞzI❹G}1Myc) ͛!_M B^F\[tgp0cꥺJ5$+HU!CHTnU3FljJr|BBv,dgHT?A3R;!زa.=I/~ 4r-DW8 G:XYNs,htB22! 7 Yΐ~6<Ep@\9<޵܉Laex,`0AI֘T'qм j%|ڥkT2@rlPNYҗ! Y}| }k5c ۹ΈB{CIҗQXGf!bN!0z"9| $kHw 1riNI&#E/}h.r )kY1*dF<ӌL#`c< А `ܝ8 1#ye!8ՓU[J؆F\DF<njT(%]3`y<NIV^٠Mg8<)FPFSHC2(,S<#W!R$})$Q%am \5 HIENDB`uTox/third_party/stb/stb/data/herringbone/template_limited_connectivity.png0000600000175000001440000001511014003056224026445 0ustar rakusersPNG  IHDR  pHYs   OiCCPPhotoshop ICC profilexڝSgTS=BKKoR RB&*! J!QEEȠQ, !{kּ> H3Q5 B.@ $pd!s#~<<+"x M0B\t8K@zB@F&S`cbP-`'{[! eDh;VEX0fK9-0IWfH  0Q){`##xFW<+*x<$9E[-qWW.(I+6aa@.y24x6_-"bbϫp@t~,/;m%h^ uf@Wp~<5j>{-]cK'Xto(hw?G%fIq^D$.Tʳ?D*A, `6B$BB dr`)B(Ͱ*`/@4Qhp.U=pa( Aa!ڈbX#!H$ ɈQ"K5H1RT UH=r9\F;2G1Q= C7F dt1r=6Ыhڏ>C03l0.B8, c˱" VcϱwE 6wB aAHXLXNH $4 7 Q'"K&b21XH,#/{C7$C2'ITFnR#,4H#dk9, +ȅ3![ b@qS(RjJ4e2AURݨT5ZBRQ4u9̓IKhhitݕNWGw Ljg(gwLӋT071oUX**| J&*/Tު UUT^S}FU3S ԖUPSSg;goT?~YYLOCQ_ cx,!k u5&|v*=9C3J3WRf?qtN (~))4L1e\kXHQG6EYAJ'\'GgSSݧ M=:.kDwn^Loy}/TmG X $ <5qo</QC]@Caaᄑ.ȽJtq]zۯ6iܟ4)Y3sCQ? 0k߬~OCOg#/c/Wװwa>>r><72Y_7ȷOo_C#dz%gA[z|!?:eAAA!h쐭!ΑiP~aa~ 'W?pX15wCsDDDޛg1O9-J5*>.j<74?.fYXXIlK9.*6nl {/]py.,:@LN8A*%w% yg"/6шC\*NH*Mz쑼5y$3,幄'L Lݛ:v m2=:1qB!Mggfvˬen/kY- BTZ(*geWf͉9+̳ې7ᒶKW-X潬j9(xoʿܔĹdff-[n ڴ VE/(ۻCɾUUMfeI?m]Nmq#׹=TR+Gw- 6 U#pDy  :v{vg/jBFS[b[O>zG499?rCd&ˮ/~јѡ򗓿m|x31^VwwO| (hSЧc3- cHRMz%u0`:o_FsIDATx]o~H&H@>*B K0@{LUITiЀE)""0a`P RJ*|H2E0)渜ofggo}}3ơoy+tǏVY\>x> `' vf)h/ 9r50 {cHbտ<Cb鼲[esҜzS9\ὃW@V42M Uz,]5ֻ{z꥿nY>rzl WW X' E?{-G$=TU󕕕 9\Wxwp걝pWnyC+ٻj^wzF ׫^7J[ziWGR:WW]Ǖ{iJ^}G#CV, c޲yDb(bP͏;ʛ.;tFzSWo+.(MhnY$Y>գ jHj cht~Hl7huhWoxՃ)7{RмZS9}y)w]=ՃW Y' Nq1[Us7tuhS=^mk NNN'dq'ι_I(x6mz@/_`.> Fn~ex I,Nަ+ 5wn՟6:nܾeSxOt3O#D$vw/g|iRFC/7>:ݺ?K/?(2UU6&~0R͆8<;e!)')K8GtjڸP!O>i=ȫ' @2l~1= UgR蕗MkaZ^}vzj'j t[Z#7؅X?EEDk%R9AV1$lY[䙋W^OrcWo=b>|;aÆj5{NM0ϩNMZ>[eK8Paf_ C: i i:7&K^O;ؒBJ~faKR̩.3VB~8!xBʴ[ʸQҶqM~kKMsK!1>x\\[--9_k4 yVo&Y$*i+ T_JlYvbKT,VJ=?GzE}F6\$ȶ TFōʆ7*^8xZ#;_m!K p̭te%.{CyG'uY=0ܕ /T{>]q㱥 yx1^:KmȓMc[ pd!xn!899{**BLM҅&tI/TT ކRBJ{~-SX̾eP߭,gg _ iٟP/uKa\6uOM^ϸX.NN֙ohPxTz݅:w;{'f߻SyzSōo1cT6QƩMƓXMY[JcVXrzl!_8/|a<GD}ߝlhoA`zW1Xa^r6X[]Bǿ 䥜Oq0'5:b-e%H>]_WojV_ЋAlh^Hio )mx!M[a:-뙗y,nǦnI ]{%5YT? 7h9t@â^pwecͱ(N ! ^N@aHDwDEIth')NH$ڴl5-+[`vŏT[s:G2w Txmec3ĺY=+|?^p>b i/[-[ zk|gR!MJwߟ؟|g!HJC͆iÆj5N.06ɦfT @>g* R+ggYĖғRz[JObK9_ҵkա(kUY:7-ߝ-Q?x @yɝU(Ε}wJ{RsX<`DL+~hWQR%zd$w>[VܻwXe"kGu2:. y2{{N<P̫MCψ-]dҟLRJb9/۹rm?6>x9ΑU+w#o0~!jyַ $Q̶ōScϨ@r|yw5GBNK]Ly4X:SΜ/^(=t~ӬblcM6-#nimNj bͯ$T6Alimc[ZtAt0H.B<МbKަزS=*[%sV7d7*^ܨlx{jSv;G[vHHbKަsbKLؒ%o5N m -1]iIENDB`uTox/third_party/stb/stb/data/herringbone/template_limit_connectivity_fat.png0000600000175000001440000001477714003056224027010 0ustar rakusersPNG  IHDR  pHYs   OiCCPPhotoshop ICC profilexڝSgTS=BKKoR RB&*! J!QEEȠQ, !{kּ> H3Q5 B.@ $pd!s#~<<+"x M0B\t8K@zB@F&S`cbP-`'{[! eDh;VEX0fK9-0IWfH  0Q){`##xFW<+*x<$9E[-qWW.(I+6aa@.y24x6_-"bbϫp@t~,/;m%h^ uf@Wp~<5j>{-]cK'Xto(hw?G%fIq^D$.Tʳ?D*A, `6B$BB dr`)B(Ͱ*`/@4Qhp.U=pa( Aa!ڈbX#!H$ ɈQ"K5H1RT UH=r9\F;2G1Q= C7F dt1r=6Ыhڏ>C03l0.B8, c˱" VcϱwE 6wB aAHXLXNH $4 7 Q'"K&b21XH,#/{C7$C2'ITFnR#,4H#dk9, +ȅ3![ b@qS(RjJ4e2AURݨT5ZBRQ4u9̓IKhhitݕNWGw Ljg(gwLӋT071oUX**| J&*/Tު UUT^S}FU3S ԖUPSSg;goT?~YYLOCQ_ cx,!k u5&|v*=9C3J3WRf?qtN (~))4L1e\kXHQG6EYAJ'\'GgSSݧ M=:.kDwn^Loy}/TmG X $ <5qo</QC]@Caaᄑ.ȽJtq]zۯ6iܟ4)Y3sCQ? 0k߬~OCOg#/c/Wװwa>>r><72Y_7ȷOo_C#dz%gA[z|!?:eAAA!h쐭!ΑiP~aa~ 'W?pX15wCsDDDޛg1O9-J5*>.j<74?.fYXXIlK9.*6nl {/]py.,:@LN8A*%w% yg"/6шC\*NH*Mz쑼5y$3,幄'L Lݛ:v m2=:1qB!Mggfvˬen/kY- BTZ(*geWf͉9+̳ې7ᒶKW-X潬j9(xoʿܔĹdff-[n ڴ VE/(ۻCɾUUMfeI?m]Nmq#׹=TR+Gw- 6 U#pDy  :v{vg/jBFS[b[O>zG499?rCd&ˮ/~јѡ򗓿m|x31^VwwO| (hSЧc3- cHRMz%u0`:o_F*IDATx]1ܸ~\lCĺbK'EXn]hu )1b kHiǃ8@vTf_\Sp#EQJ>8zCIH) _>>|o|v]h֗<?L"9JMGqߣu.łQ=(3yGwD] v~/v~gS-~~YxKGQ\Ż*];;c˓zL\7DtUx0P>%"!Dɾ) b@8VHF/f-@xGW>.Wc\=x_\=f=6iNݧ*ŋso+ލPtwU|1Իю᛽xSGW/>R>6\w/lywh=o±".//"Z EW_7|qnffh\=]};{f[Op'ic(MUZD8:P\gxRc,(Њ'VdqpzwGc9ṕcw:!Jmoշ=?owՏ;V[}}xMލ 5Tq8OWogk*(UzOT-WŋsSeD=t}E&y((5R\=< z)7\=z p- \Ew;Uq;O흇yTF2TWnge*^w~w/ly{fF6ű\+>-;f=2y--WoȁBs[sx_lwu"ȁԶ!-טizk7>q VN As &u78zypZW"[NaSt6_vQwc*r9k/e{o;z;w/R5gUT}vk3W.[z9\مVS/U?fa}_^^RG5{ b&$ >`=Ճ` i7*^ܨlxq&C?U4;Fo:[yq ΋ /nT6qeX{>dfÇLY>;z# [̹)}5ÂU'pT&~O^gQl_a95ԍ|%-h`@x$pه Md>DtBIh-X>4;;-yI]8>KҐ&޼y>ӽ^jBSyY5'5S8;攟\Mwln01:O[z 6,')vw_󾽓;4l|ClϥĖMWeO\&Idlټ`6@~:< gݻN^,/nIM.W }$ğJ'jz7)^ܨlxq&`xVFōʆ7*^ܸ =ڛ2z\ ]P_mj7]J;KU=.vΆ|f.ԯ'ÓG. VH^Hio/BmldIUK>bjShf`a&-҅m3bL]׋6v+TT /ᅔ6&Y=ASn.2-cu| MtNjrxH#U&&mэ)T?$\*;\w-֧bKW;Tt. ld-x.Rbl6;˰%~xjl=hɠ,_E> %cS;j%d.6bc ؖs}m_s=AlXV6Q0CE= ŸR޺ Lp3Oli!& 7--DĖzl?ų?ʫ xK#Ez[^ A <ĖlV zǯ%az̃KRk/=lЩWi-ڼdbK #",2ʉ6)!16rR9/_FJ3hMg,v{xW5ЧN5+d^)n˹8= t蟍Ҟaf%/{,ms2o㽨g|∏}ދ!gZ0%6LœٲooSH|~^L[ِ'x)EB#]b̐jOʆs6$ י?pʾþz%{*NmYo?VJXbTq\A8R 66ކRBJ{,52ySIl8::bp;4svAӻ؝>!?T -^u}Qg/Zu<ϣ5@Ǟlٲr59[ؽ,T! W72!g}_6_Albe3ƦC}!uEĖғRz[JObK٬;im`F=ۆ̖bcgVY+m|xo4(I=I>]J.+xכrX[6CW,r-y)ز(ݵ.J.rCJ՟)M-qՇ; W Շ-ʋ~U$čʆg /n\n7 qj!nZfeA 2sZϘġmV3Utg#VHy}^PmVk6١>׈<h bOd[* 1-mNP @bK- l̖@l H3Q5 B.@ $pd!s#~<<+"x M0B\t8K@zB@F&S`cbP-`'{[! eDh;VEX0fK9-0IWfH  0Q){`##xFW<+*x<$9E[-qWW.(I+6aa@.y24x6_-"bbϫp@t~,/;m%h^ uf@Wp~<5j>{-]cK'Xto(hw?G%fIq^D$.Tʳ?D*A, `6B$BB dr`)B(Ͱ*`/@4Qhp.U=pa( Aa!ڈbX#!H$ ɈQ"K5H1RT UH=r9\F;2G1Q= C7F dt1r=6Ыhڏ>C03l0.B8, c˱" VcϱwE 6wB aAHXLXNH $4 7 Q'"K&b21XH,#/{C7$C2'ITFnR#,4H#dk9, +ȅ3![ b@qS(RjJ4e2AURݨT5ZBRQ4u9̓IKhhitݕNWGw Ljg(gwLӋT071oUX**| J&*/Tު UUT^S}FU3S ԖUPSSg;goT?~YYLOCQ_ cx,!k u5&|v*=9C3J3WRf?qtN (~))4L1e\kXHQG6EYAJ'\'GgSSݧ M=:.kDwn^Loy}/TmG X $ <5qo</QC]@Caaᄑ.ȽJtq]zۯ6iܟ4)Y3sCQ? 0k߬~OCOg#/c/Wװwa>>r><72Y_7ȷOo_C#dz%gA[z|!?:eAAA!h쐭!ΑiP~aa~ 'W?pX15wCsDDDޛg1O9-J5*>.j<74?.fYXXIlK9.*6nl {/]py.,:@LN8A*%w% yg"/6шC\*NH*Mz쑼5y$3,幄'L Lݛ:v m2=:1qB!Mggfvˬen/kY- BTZ(*geWf͉9+̳ې7ᒶKW-X潬j9(xoʿܔĹdff-[n ڴ VE/(ۻCɾUUMfeI?m]Nmq#׹=TR+Gw- 6 U#pDy  :v{vg/jBFS[b[O>zG499?rCd&ˮ/~јѡ򗓿m|x31^VwwO| (hSЧc3- cHRMz%u0`:o_FIDATx=@op9L &sm8^ $/KB2 `?CɡpX,=@XVWWb àdxۗ~5::+{'(aP:ga~~ZouD;g}v_Y嗻G42a2o7o&)6İ~w#g\a׻Bqx+"ٞabT̨|m}&C+åÃcZ?>ϻ+_~\#LJhoNCZ^hڕ%-QaͩUɣBa%8+&%ERvXk 6&Lbgy'7Vs *\rg80rcgr!E1&xeX0a&æ<l =0 o,;̊0q mKZÚS%֦I}Xj=Mݯ8'Z/Cvj={^)qxݞ?b2F Za2L5~|ђajGbXLq:O.K aݷϕRmH FEޛv uIWj ^:Hsd˜])u}}}^9چ{ޫZ5;Bm(Hb$&jȆ܌Lmùja,"F@xpWS7RVQѪ6I-y:$$&0%Je&j=bavN׋2MUa=ܫ}~2`0_m@ guDԿVЇ2AYG0Rr^<vvDq3|*k3;Oa2چxÚw; nݟ;rH@Yrр"OL"poZ+D~#->zy U*n\HHDjoxX1zwF;5{λ5}hE$hpf]2sݗ90Ep)LZd- ,C&t~ŋWG+F|uՇׯ_ NeB@I2=0)acrbQE:3%s'JQžI=q5.b]& OvjxT%:|nvrh;hc8пNw /) ~뉾½eh>O/ori F^J/RJÜdHYnQ: 0=1x?%-Sþ |^ Oa c adMcJ!X,F8%8C`7A[=iFk-T 0lPC:oR]=S' žva7G~A[3656br_J43Y=}qʘ^`z Lj .ZL_̕:aDwXb}rV(a 0\@"COꋫ0#r=dA Erxj|G8B'pt8{Lor #[~*kYL~Y @ ϭ !뛋Rw\G [pţcX- "YfH&yhѓ,pX[Z(ʉey^!V㙤qZm4aǿY.oX0I#SiMamdoOTB2V/2f3=m0'I1yGȉz>9Hx <~>6K\cXßt TTUr2|P*I*z 1cJւԵs3i}an3I!awC``b߄in8bfȓRrgIENDB`uTox/third_party/stb/stb/data/herringbone/template_horizontal_corridors_v2.png0000600000175000001440000001317714003056224027121 0ustar rakusersPNG  IHDR pHYs   OiCCPPhotoshop ICC profilexڝSgTS=BKKoR RB&*! J!QEEȠQ, !{kּ> H3Q5 B.@ $pd!s#~<<+"x M0B\t8K@zB@F&S`cbP-`'{[! eDh;VEX0fK9-0IWfH  0Q){`##xFW<+*x<$9E[-qWW.(I+6aa@.y24x6_-"bbϫp@t~,/;m%h^ uf@Wp~<5j>{-]cK'Xto(hw?G%fIq^D$.Tʳ?D*A, `6B$BB dr`)B(Ͱ*`/@4Qhp.U=pa( Aa!ڈbX#!H$ ɈQ"K5H1RT UH=r9\F;2G1Q= C7F dt1r=6Ыhڏ>C03l0.B8, c˱" VcϱwE 6wB aAHXLXNH $4 7 Q'"K&b21XH,#/{C7$C2'ITFnR#,4H#dk9, +ȅ3![ b@qS(RjJ4e2AURݨT5ZBRQ4u9̓IKhhitݕNWGw Ljg(gwLӋT071oUX**| J&*/Tު UUT^S}FU3S ԖUPSSg;goT?~YYLOCQ_ cx,!k u5&|v*=9C3J3WRf?qtN (~))4L1e\kXHQG6EYAJ'\'GgSSݧ M=:.kDwn^Loy}/TmG X $ <5qo</QC]@Caaᄑ.ȽJtq]zۯ6iܟ4)Y3sCQ? 0k߬~OCOg#/c/Wװwa>>r><72Y_7ȷOo_C#dz%gA[z|!?:eAAA!h쐭!ΑiP~aa~ 'W?pX15wCsDDDޛg1O9-J5*>.j<74?.fYXXIlK9.*6nl {/]py.,:@LN8A*%w% yg"/6шC\*NH*Mz쑼5y$3,幄'L Lݛ:v m2=:1qB!Mggfvˬen/kY- BTZ(*geWf͉9+̳ې7ᒶKW-X潬j9(xoʿܔĹdff-[n ڴ VE/(ۻCɾUUMfeI?m]Nmq#׹=TR+Gw- 6 U#pDy  :v{vg/jBFS[b[O>zG499?rCd&ˮ/~јѡ򗓿m|x31^VwwO| (hSЧc3- cHRMz%u0`:o_F IDATx]nGX "iBpa D" EBy5)]XOF&؀c ЈU9)`S,u<7ASssݝL)Eã}_2L,ȈQ&ytVڻ$RDYFt8X,޼yNd?/zޮEdUʚz_]_OXJԦlXqXɭ %DIkd_$ѱI# 0d/Vp\a!yqAÖlyy7(-sB.*ì|V " CZ`HXW65h^dM1t0 {YI^"azdaN~~j!)z&ln}ꊈn#9و,$ 3ô &ඥ kr%-"{EdJ4,UTAq%ޕ8 CmQ)܄ SDlksf¦w"Z,;,V & z> aݻxe賍!HvSV; ,a0{|S"$Lڄe@2tIYفs`@GiY#WKY#p :M24{st7 ,yȇ wn0 6p#o\%_uG; 4Sl¢w &YdZ-.Cm=?rqlyc/.aN0o/1PUFQC?i /ɭ^ȥ_$> ,ac%LVu fd$aȇSȇ ˆz'N68Ug o6 0& ;{rOo6f+YO/q&a;BB%RDFTw`d&ƍ3b pNbJ|` (M:%:&'zM dɥ ÄMaȇ!&KDe n#nN}yU(=q@jzEqȚi pQӡ3!eUY{4YRT^>,zBE$0 y48qfSWKL5@v::Z3L Äaȇ!&KBKu(3op}Y΂E*]$+Ģ~Y~N + T96̵U1$T"ɓ0WsvsFHaoyqQM,T"@lMwJu_!HXE0_BkIYA|g& PPEeo&|>ϿZr''UO?^^V21χy's)~jOjI#uɔ::+~tH0vMUgDzƿyɊpX_Q䇣*O>$L [rX&li 1~Wg?X{&r|IZ|Äi¼O:>&i-D,Yn=G"10 U&m"hJ;şP1ѥdC7 w?G,0p6V;(Ghi DEX&l1z谬8j ??gqDZ4^b,|FDf$b`5m{̌F?{sPJ l[:||'voSGQ9;[]vH1`tK)R,{]Hw KX,ۅvavug| C"?v:3 K 7nb?hm ,X钒t#ÆMe|Ti|?l! Tק}cZ&Hذ8Xg,n$ystۗrÍ>v IP aڎCa`}s!jdn Q_ ܦl!:6!mX\9Qe3;ɸ.JO͝pdLn6,綊!4" l=% N+IENDB`uTox/third_party/stb/stb/data/herringbone/template_horizontal_corridors_v1.png0000600000175000001440000001256314003056224027116 0ustar rakusersPNG  IHDR pHYs   OiCCPPhotoshop ICC profilexڝSgTS=BKKoR RB&*! J!QEEȠQ, !{kּ> H3Q5 B.@ $pd!s#~<<+"x M0B\t8K@zB@F&S`cbP-`'{[! eDh;VEX0fK9-0IWfH  0Q){`##xFW<+*x<$9E[-qWW.(I+6aa@.y24x6_-"bbϫp@t~,/;m%h^ uf@Wp~<5j>{-]cK'Xto(hw?G%fIq^D$.Tʳ?D*A, `6B$BB dr`)B(Ͱ*`/@4Qhp.U=pa( Aa!ڈbX#!H$ ɈQ"K5H1RT UH=r9\F;2G1Q= C7F dt1r=6Ыhڏ>C03l0.B8, c˱" VcϱwE 6wB aAHXLXNH $4 7 Q'"K&b21XH,#/{C7$C2'ITFnR#,4H#dk9, +ȅ3![ b@qS(RjJ4e2AURݨT5ZBRQ4u9̓IKhhitݕNWGw Ljg(gwLӋT071oUX**| J&*/Tު UUT^S}FU3S ԖUPSSg;goT?~YYLOCQ_ cx,!k u5&|v*=9C3J3WRf?qtN (~))4L1e\kXHQG6EYAJ'\'GgSSݧ M=:.kDwn^Loy}/TmG X $ <5qo</QC]@Caaᄑ.ȽJtq]zۯ6iܟ4)Y3sCQ? 0k߬~OCOg#/c/Wװwa>>r><72Y_7ȷOo_C#dz%gA[z|!?:eAAA!h쐭!ΑiP~aa~ 'W?pX15wCsDDDޛg1O9-J5*>.j<74?.fYXXIlK9.*6nl {/]py.,:@LN8A*%w% yg"/6шC\*NH*Mz쑼5y$3,幄'L Lݛ:v m2=:1qB!Mggfvˬen/kY- BTZ(*geWf͉9+̳ې7ᒶKW-X潬j9(xoʿܔĹdff-[n ڴ VE/(ۻCɾUUMfeI?m]Nmq#׹=TR+Gw- 6 U#pDy  :v{vg/jBFS[b[O>zG499?rCd&ˮ/~јѡ򗓿m|x31^VwwO| (hSЧc3- cHRMz%u0`:o_F IDATx]nG [ "N 0k! Ҝ ?nnTk N]9)F`Ryoo旳;XC9r W"*?W?.nJ) :WZZ޾}{UmV|~o˻7|+de ??yXtS, 7jj66N/٘rık!eY8Ӱ/iҎ,\&Q}@6F$4J-dd\c5}K8kp;8 QhKfi?VW t;'gD_\H"ETJaz&uzVL0 fJ`jl#*E*4}fS46>a 0L`٪>8%#f qX$BY`)Z 9iXx lsLϵyy9uf"ȞИ~El%"&έG>lZqXíCȇKzB$kIX}`"+$z؋1jv>l+a Z+qyij,JF%?fݞdԛ]=0E=̇qpAV|8aW#A`z74645d4Yh EzqzzhArs;FMcL 7+^"EbHf;V0m!Lh$ 9w ;}'ju<6 r+@>L|ؤzԇ0\qo0+%@XށPgdf2NߠaV4h&Yd'8DŽn}'ـ3`*34 /њaEVID>L|؄tPf:$hc@3L 3V(^d";O-;_qǼVȇa˶ake1%vk"__Hϭi=L̜E$0SiXXBkIYI|8|ش0A`LzƆVd݊_bE@6fzhImOvadh{BBHYD@Jh@| #4 %%:=&'vK ɒOF+YA|0@> 0R  f @yҮZ1af1M"_'%M%lL |aX 3n|G 2P Hl߭_g3Ld#u üW|M*OYH4Wo0F'˘HÚaoy{MMvRi^3 #05 +C`a&YdafT5L:\.UqnPT?~0Tr0>1(FF!Ɋ84L}\ST?|Q/Z9 5?wdEk~\:?."4Ca%E`b!s[I^b}jovOO:?&=P7QcXHL>mbyZ`Cyi9#|TѥdS7+w#p8mˉ 0A`#h(@Y/lz鴬8 qbFN4~Y">RLb Z@"N Jཧo=(<>n6b9,NNtv'"Rwܑ 3?g߃^]H}}7tޱ]عn}G0@1!?kë8c&CT1DCbOJ*|ٿNJON?}å6~9bD'DruWbD'vP+gBrǿ犾EwSs3MŸF5a;[bgCs!FQ ތ d8}/<.ooߣb\*b^;{X@\Ѱ0bj.mj3~<7̏s1D>[1Đ?!!-&'izzع`Ly`|Tc~0ػ*ҋuB÷s4% fP 13,g@Db#>!QbCD>n} Gt^a/U;?0qn'Z#w/k|c/_˔Y.}uįF>A10~!2>yg eg^2``(֦3OHsꅌg gB):<ۯݾߗ~(~]?'~%`& 85р$sASwa|CBc;״~/)Υk;^yrMS`aaWF;A#{qXY!M˾y1qAȽ0|eyb (G102/IENDB`uTox/third_party/stb/stb/data/herringbone/template_corner_caves.png0000600000175000001440000002217114003056224024676 0ustar rakusersPNG  IHDR j pHYs   OiCCPPhotoshop ICC profilexڝSgTS=BKKoR RB&*! J!QEEȠQ, !{kּ> H3Q5 B.@ $pd!s#~<<+"x M0B\t8K@zB@F&S`cbP-`'{[! eDh;VEX0fK9-0IWfH  0Q){`##xFW<+*x<$9E[-qWW.(I+6aa@.y24x6_-"bbϫp@t~,/;m%h^ uf@Wp~<5j>{-]cK'Xto(hw?G%fIq^D$.Tʳ?D*A, `6B$BB dr`)B(Ͱ*`/@4Qhp.U=pa( Aa!ڈbX#!H$ ɈQ"K5H1RT UH=r9\F;2G1Q= C7F dt1r=6Ыhڏ>C03l0.B8, c˱" VcϱwE 6wB aAHXLXNH $4 7 Q'"K&b21XH,#/{C7$C2'ITFnR#,4H#dk9, +ȅ3![ b@qS(RjJ4e2AURݨT5ZBRQ4u9̓IKhhitݕNWGw Ljg(gwLӋT071oUX**| J&*/Tު UUT^S}FU3S ԖUPSSg;goT?~YYLOCQ_ cx,!k u5&|v*=9C3J3WRf?qtN (~))4L1e\kXHQG6EYAJ'\'GgSSݧ M=:.kDwn^Loy}/TmG X $ <5qo</QC]@Caaᄑ.ȽJtq]zۯ6iܟ4)Y3sCQ? 0k߬~OCOg#/c/Wװwa>>r><72Y_7ȷOo_C#dz%gA[z|!?:eAAA!h쐭!ΑiP~aa~ 'W?pX15wCsDDDޛg1O9-J5*>.j<74?.fYXXIlK9.*6nl {/]py.,:@LN8A*%w% yg"/6шC\*NH*Mz쑼5y$3,幄'L Lݛ:v m2=:1qB!Mggfvˬen/kY- BTZ(*geWf͉9+̳ې7ᒶKW-X潬j9(xoʿܔĹdff-[n ڴ VE/(ۻCɾUUMfeI?m]Nmq#׹=TR+Gw- 6 U#pDy  :v{vg/jBFS[b[O>zG499?rCd&ˮ/~јѡ򗓿m|x31^VwwO| (hSЧc3- cHRMz%u0`:o_FIDATx]\n\)CJH 7z@JT$0 (F|HE<I+^.ߐOzJߥ;?//s  nn_ 2R^Z~ T$Z,[Iߕ^?=;tIv4IVЕ*.|P|ނqߋ/ج 8 ιhٞ4͎AiUq^.>6?ar|B+j((/:"!{wdAvNQ{G>{R{%UԞ;"4͕TGk7Ms/Ĭ ˇ6 }uy HSv9F~&c Ej2]t T &( L&˔k+j!t˺լ75;(;}/V+1dPdmWDgIIe<+,F6QPPϤ լd6eNE</)M}`'Zz)AL= "Y4c%{ 2[j=iSiPgj [:>ǖUybjՃ2sʣe7L' GV[_=04Y(4X}.mESQ]ζJLIdowjWߟڗo?G%"S|4_RVWz0i7q%>p@LƄk7ktL7gV%In~XyM7}/x[3]Nxfh#zV,AI#C3䬗WoRUO%x^;es.liqvW䦀GM̲ 㦃B_gx+J-.G[GMF nZg![]QG zEkW;ϛbDbhnBg'k`5v]4VMlwe~ywDRu/xwEwbz7o_ܘ ߑB4LV5V*x|>p$Z~޸Kpb^=~9͍;Du> YW9 @QSu{%t/5` ;d~㊼Sf;P;!WYt|}iڳgOs7ևmB[ٛ@Wl_e V/M۩}TSHv *pA:pÕ.:PG__ԼCN}耕nb-X}vZ\ԩ:ryôh N::tI mfrD=O%^G}`g>+`x~F]*Md߬zx ,@"XCf׌83^jq/ipsQYjY}`Kw^ӑ.쒷|:X?Z; Jd<M7gϸ2'eYZu6\`\ovz!GbC4ے8AxHxVَe:rjԯ`q$DAS~n6k}Oo%T3ˆFv:8e\YoiuJu_'u$%X=;M%<,S/x>Xh= ߑB4L߇_W0XVr~5/V>9q2ƴ)&X)nYtS7+yf;HexBYoԇhc<[n`+ZO 7C ǵLla),.͹drǵ Y`20Mx e׃KjGafTsB|(aRM>wMg E3ZoBbx2\R7ftFkmR,RK~Viڏ!+{=};I9/W?R͖ιkprCqhleY.zV99ogI cJ/V?kW^f2߸Kxdd9/ l:( G^HQ鴫ul!a(2_()0$WR#1lߪgyd&;Ĺ ?*>k[}&OL'~W:od?z9T\">u$7Nvv?2 a=t*uݳ2ɮ۸OG𾵯],P9 Gd7n{$2FN?L LQduyⳤL(ǓE{B H@(g[}/cu|5¡6*7d@~r\K z7tpw֬zA^zxZA9΁zEk3ozugCVA)4սcR׏_~|J7ܹSR}Tfl8<8E"W/*i\y,#/^gMD~uDQre&—^F"7Ozۣ-\]/?Zr(d$0-A$[*d"r.C H]ҽN_ҰlCVsadb1 z=&w34LĽo$[R4'[*J,*RiO f[r4ɖ(3o\BAfunwz|,Yq%k̳ȴ,~U֯)^"[$I8"%=c"t[Hz Dw6{P607Z"?ģ /d]Sp\d:vHI#3;l!G~yVˆSC5+`@ ^' [2l9ƶٲsϖ,'ICRSƍ;sVuj7<t_- ];tT*Lj > ۠"f#7zIbly+-ui߂}RZT_bn{gx5wqn4hqӂBo*LSM|fDt_)?ʠƸtt>hXd 5gȝ_| eA|q@9K}"E[nh:v7~5s5Fʬ@dv*ɖI xdw8"%-zMjVe!]NĐT1:þeXʭ%Ebezvs3uʰ3Q7*wW.o . +}gpa!XںFBl HgْV5$̠GJU{65G@c^H$c{@U^% *8v ϡ."Tx4֏)jM1]/3 s,{%TJf9Y[ȬO_%,Jھq?W,lj< !dVΏ@XgsR^ҀU+˼lk-><]ˇ]ǑXb"HƁDg!+ ɟFȍTNdR-@d_y/g|wOOW"d{8a!c$8BO^ ْ%dR%.'-Ye"LJDJeRRD [fQR6ԸDM }0@⩸C '%[J$16$ɾe ,%p\VC q$d n+]Y ߕKqy@ʷ>Qa .3Ȗ#ml-;l0'IxtK_$ݘ$')Jz%%d&]8F@H;~w .z5'9փ}wbA~GaZw ْ~02*l fEIÚoc͢;eKĶ'Nu%{ҞX'>lr㮝z8˺յpӱMtE:!= dXP$De$Mxݳe,#iac)t4oli ?{PƏmlYw8(2&( RWLDFys5L%5\U;h|5\++8᧗ q:ӟOIK|: [~x-9IGztóerMLP0 8ɼϺ\ #ߞ$/Օ aY߇^F#~+^C{=q[=%_(*BA,6 q[~sX,KhA]i&Mɺ7(,?)Ou9d8ddXF˜LLL;~`K#pX+c9ϖ`R)mf eϮe$D5!9+S}k=ˮ[@9UaijpXy՚ [2l9ƾólYsY#y=dnܸ `Ӗvdճ>5H +9*އv3)l{ɓWأ3)lԸy: 'm@ιHly# GL0&szpu*guznA$;zXs= ?&BzY M֑ieeJJtOQ".(:XRB&a/dD2 [Wr He袧ṳ.ȖK`G-r>5c\O]ZIȖK؈l> VlȖ0-BP'[Ja4Yy+-&g<[^+aRl(ES*'d&sgk6<4 7WMKC+ .3Ȗ#m*y*!fN;IENDB`uTox/third_party/stb/stb/data/herringbone/template_caves_tiny_corridors.png0000600000175000001440000001145014003056224026455 0ustar rakusersPNG  IHDRHs2~ pHYs   OiCCPPhotoshop ICC profilexڝSgTS=BKKoR RB&*! J!QEEȠQ, !{kּ> H3Q5 B.@ $pd!s#~<<+"x M0B\t8K@zB@F&S`cbP-`'{[! eDh;VEX0fK9-0IWfH  0Q){`##xFW<+*x<$9E[-qWW.(I+6aa@.y24x6_-"bbϫp@t~,/;m%h^ uf@Wp~<5j>{-]cK'Xto(hw?G%fIq^D$.Tʳ?D*A, `6B$BB dr`)B(Ͱ*`/@4Qhp.U=pa( Aa!ڈbX#!H$ ɈQ"K5H1RT UH=r9\F;2G1Q= C7F dt1r=6Ыhڏ>C03l0.B8, c˱" VcϱwE 6wB aAHXLXNH $4 7 Q'"K&b21XH,#/{C7$C2'ITFnR#,4H#dk9, +ȅ3![ b@qS(RjJ4e2AURݨT5ZBRQ4u9̓IKhhitݕNWGw Ljg(gwLӋT071oUX**| J&*/Tު UUT^S}FU3S ԖUPSSg;goT?~YYLOCQ_ cx,!k u5&|v*=9C3J3WRf?qtN (~))4L1e\kXHQG6EYAJ'\'GgSSݧ M=:.kDwn^Loy}/TmG X $ <5qo</QC]@Caaᄑ.ȽJtq]zۯ6iܟ4)Y3sCQ? 0k߬~OCOg#/c/Wװwa>>r><72Y_7ȷOo_C#dz%gA[z|!?:eAAA!h쐭!ΑiP~aa~ 'W?pX15wCsDDDޛg1O9-J5*>.j<74?.fYXXIlK9.*6nl {/]py.,:@LN8A*%w% yg"/6шC\*NH*Mz쑼5y$3,幄'L Lݛ:v m2=:1qB!Mggfvˬen/kY- BTZ(*geWf͉9+̳ې7ᒶKW-X潬j9(xoʿܔĹdff-[n ڴ VE/(ۻCɾUUMfeI?m]Nmq#׹=TR+Gw- 6 U#pDy  :v{vg/jBFS[b[O>zG499?rCd&ˮ/~јѡ򗓿m|x31^VwwO| (hSЧc3- cHRMz%u0`:o_FSIDATx\nGX&/ Mt#.\ 8 ~"D@@ <һujS 9[磢B ďny~ 9" ""ތ4_|iz1, i- ^z [b^5'Da1B%& ꭤ"&ڸ{^55[aƸX.V+^XZe4~?zKFϝjMe]Xly0 @Ng3?b6&ٱgnGRI*;fz R/+=1_HkskLjY)ZZXcuciJ#ה*4M2k۳c֥HSVKVc\@ٔ 2>dyBZ{vLr;(lkcf+<є2h*MIlO+\hf-ȅVKbWᐮ1)̙֞9fye6 i- L.pY&,OΎuvx& mJxҹ4@4j~lkOk'SjMGmhҎWD+ڎt&x 2CÃhȵ4KXgk*ꅏw*@2(sLw\Rg9<K9tJrysֵb0-=Z)7Q'_{beBYȑg)Gv;0%J-ʉqWNLY|ded$qyѦaY} A[>/Z )Dr$_}Fc UvU?~F+͆;b-1g%^Qma)Vt7"9FX(·h/<>Hr29/˰/*8"FWg_9N#X%T; 'Q 9R#JȡW{P5zJ{rQcX4,۳%m~Z\\ W"TpzzB \W@%V gZINx/ܗڥm.RKg*\ɱVt꟏qjb^_$gHG1}*P{*9uvu{r+ޗ6ᰘmqS{PsMd6"tvOfsNA Ar2g }IAr:N'}p R +G<^ Su'@ Vc|9S\5^m-S[Ηᦚ<,C>FI2~-^)W(''L1kp3p]W-[&+qΟ5'* 3Eo أbwfDDlq{DD;A)'RǸp9E&]&J86`~IENDB`uTox/third_party/stb/stb/data/herringbone/template_caves_limit_connectivity.png0000600000175000001440000002510214003056224027317 0ustar rakusersPNG  IHDR  pHYs   OiCCPPhotoshop ICC profilexڝSgTS=BKKoR RB&*! J!QEEȠQ, !{kּ> H3Q5 B.@ $pd!s#~<<+"x M0B\t8K@zB@F&S`cbP-`'{[! eDh;VEX0fK9-0IWfH  0Q){`##xFW<+*x<$9E[-qWW.(I+6aa@.y24x6_-"bbϫp@t~,/;m%h^ uf@Wp~<5j>{-]cK'Xto(hw?G%fIq^D$.Tʳ?D*A, `6B$BB dr`)B(Ͱ*`/@4Qhp.U=pa( Aa!ڈbX#!H$ ɈQ"K5H1RT UH=r9\F;2G1Q= C7F dt1r=6Ыhڏ>C03l0.B8, c˱" VcϱwE 6wB aAHXLXNH $4 7 Q'"K&b21XH,#/{C7$C2'ITFnR#,4H#dk9, +ȅ3![ b@qS(RjJ4e2AURݨT5ZBRQ4u9̓IKhhitݕNWGw Ljg(gwLӋT071oUX**| J&*/Tު UUT^S}FU3S ԖUPSSg;goT?~YYLOCQ_ cx,!k u5&|v*=9C3J3WRf?qtN (~))4L1e\kXHQG6EYAJ'\'GgSSݧ M=:.kDwn^Loy}/TmG X $ <5qo</QC]@Caaᄑ.ȽJtq]zۯ6iܟ4)Y3sCQ? 0k߬~OCOg#/c/Wװwa>>r><72Y_7ȷOo_C#dz%gA[z|!?:eAAA!h쐭!ΑiP~aa~ 'W?pX15wCsDDDޛg1O9-J5*>.j<74?.fYXXIlK9.*6nl {/]py.,:@LN8A*%w% yg"/6шC\*NH*Mz쑼5y$3,幄'L Lݛ:v m2=:1qB!Mggfvˬen/kY- BTZ(*geWf͉9+̳ې7ᒶKW-X潬j9(xoʿܔĹdff-[n ڴ VE/(ۻCɾUUMfeI?m]Nmq#׹=TR+Gw- 6 U#pDy  :v{vg/jBFS[b[O>zG499?rCd&ˮ/~јѡ򗓿m|x31^VwwO| (hSЧc3- cHRMz%u0`:o_FmIDATx]ϫd7v֭L6N q3!Cl<݋[2dp/lx 6,`,6dٝyC={E7v@;08!U*;}Uu#]8jF 7wr|R mjU~/tp^7(ڒY,͛77{xi4(;bQ/N~~_ڙoet#?-?'x2 ݜ^GnB'_|rfggMS:mxLm{^Rdx}LEGloRfg*|{ۍoPPEO̷D+@6TC?uОQ-;͏RjDg}Ss'9lQ[2v|녭ϻ^녭`ȡoU2V.}D i/P: q&ҍL{t@O{I)5|zq75iLvi#|^k`'v\GGh5Ǽ#MN5EV%D܄zO`WHp\ mjWE ΎU'B2+  U"Z_@>w7~iszz|4dߧV4`oV,K": c^\Cߎ ',*Yg6KRwMC{t?R%m&[Dt.MFu}h:}~ n KRq 3pM݄DyMݷa:֞lkQ"5}{NZm8F~\闼wq>͙փWwI#SRSO@dx*r"<Bs'BMjsV3?xxm|8٢ld g~FӃ9 "ۇ5`MVRWu|-A">#}{({^=; nrdVJ1Cȥ\<`4DoDض$l\`d}f3sOَC~v3w_^{E8zC*?fZǙCB9 =%O~|*dԼ=4~dEz{>Gcg椀1W'4}Nv[T.sv29_)#h[%<ńiF3ASȆ*m3`&^;Z{L dz3q&I^eѰKenMX^,n[D(hȾOi#~Xh8N^" #le%<<_?b;=$N7i@gա'N(nF냷y &3}n}3H^=ޗf;ȆigCsl'kCڣ=.6XtN gnocE䵦X/LBR؃Ymf7ڥ-ᝈ/ g]v'<x h.ӕ}vff8J>&"r[ 'BODD+)9f쳿oإϏ,WE.9 [8xToiUG S09*5NG ;9q4F8@%JHKZc)E#&1eCu ƖbX3 e~DlR&*d㙌I>.>.pfW1_'"!,8_*vt*DTH >-?-82CHQheFQ Hu "nLgKH ٞ ƥ<Ҏfp۝i\5dy,qCВC=>`MVo蝏ÔqbG)lZ ~',m|4Hq hT>Op"uXUJ?zAeH/GJ#e7hdG_)0P-7TF{;MݤME%|_8A]9Փ@ 2~9gĥI;>bXt%F3+/M%|>S?!DFԚ'x8Л 6g"2Ar/Rcd_A.7'8afp"X=O`;dV4`oW;7u" pp?u·putuW-Ѿ|uw" y(iN_h#=N@H Y~ktǒw}7:: ukiGDcNhlضzgLej_ƒëZ0l^=9' B}R[}L'5&.|.Wx0F;/tMuAk\ML{yQ@&^.ŋABłL )ZW6ڄZ^qlmEuWvѫ !.W^p ^CS[u,'dP<`PvU(V_dN+F5]]'ݠ 6(v}XXx`]wMx@%`$sx.Y]6}#F|ׯ ǒCӋ"[B(*X1-GҐz)HRqW9U ū93o4¸cqķxx64er ٫Jpc˗kO!P9Dlr}j=^^2i8)UMAxpȹ,`^^xdg U"֙ 4??n=fq^s/S7 _2g̕W#s]yP) Ab/ NiQ=ʞ-2!]y2bgN eUve;w%ZK84$Ԩf~p "SoG 0kM|[&4mhM"o[qJJ-2r!6?]Lߋxw,-LC2a xNDש RnJ}N5s!kSTv'wK0ޚUPP@tP2IJ^t"%aKpl{h0+84MΝN0juO8÷ĎdH3;,D~M;1oܸa/C$_Rn/QƠ̳gr\>,;I:oC}B %Elk9t(ҵ'TKaqùF+iU`}B6.)~_U _\M>/<&/)r 5?tNjW6S &ܽ[LkS=L L,O$`T;u7S}N=G>O71$x2y62l uVA}]x]33Ef_N ӿ+>p 9s|QuaCN?޸q>'7-‰˜6! HGY]{O~_|vc+TO_ghPw" /f69^ׅ͋x2!a-mFS$82tllkA5pk'?:]}_hMn `|тoR~cu8+CL|>3yl a@(ו@!b{#))3d6& S͏]zR;g%dfGȖL$9D~ω)$)oC8HWXiUmF^޺uA[VA?8H2R>ZB\0pwӝsD#vxsm4Mn hiKh32a]h95ͦV> FԇE_ d&e)ʖ9:wi~p%h`a<`2]8wb' Ϣ@|#>BS{ԽODji 9\W>΢lIH߿npi_T@9 c&wd8]1ך't&2ܤENd}|22F/O]:|3ʁS"DA/]ah -kO>UF#7L/.UؠRJͧ'w*}&RhĐ-e+Eg˥#C^R2$y>9H>Ef3Arۋw9X\94ehOط|T..d˖dHw9s=_F%[|0-w@21)3 /Q! A-UY{-rD ќh9Ud*J:w? űB|5#&%"UBM: +  QkGneîo>Le2>y f{*Jf7kh4wÓ8?Yp z_x&9G5dKB%zd4'P6B1{ޏǻZ3sIF5mF$-2~QC{DT!72PB$F')+f0SPg$5㝋wتQK`AT,u>}7P-Zr7^Kw>Ui<#n-CפCdK{dː.qgow![2vIV/9Շts>-C)7 )q@>@<%ӧ/rSReTp ]/p!Ԉӓ?yI8%ІGڋAlV! iF&|U= [хHB:w6f>0$4(kFݓ{ So`wlqNLuϖv}4ltӠ7[-P Ӗ YK˄?ߖ!1]ْ!9X䎙cF4>ЛMq#n'}z+q-UL-۲tI7jABf>8\{!ɋc =O#FfXP˰"{gSlcNRkk}}Xԋst)sMzqZCMٲk29>ȖLpRm!a?8yP=%1gNQV% z$VxU)9`#)|}d#ɍL483K_>U2E_E ܨ}6(xwuߪ}6z֭WEZ-q:YUi"쳵LըeT\ On綉J "[v<REt<\'d Q%FY/SAm@ZpQ  qGTde"T(](ItH$rs#[O&sG4tdK"e-ْܤW- P103'iԛ |LQp#Nox| ;yf~Wqgu>}b b b2J^JkvP=:QLp)>\\x77Ņr!lɔCxٲw֘Ho-ս{޽DmRrzyl9MEdF*"/#G/_N0-0]>;.|bQѮUobwG| @(=KnI>5|F|֍ DfψG$ g1j+> ` BeRRM^bb!~oj^)s2>5b->W>$kק_?) 5򩱶mhO% wν;LJAO\h9 [5$4osFR3Q`M8iu%z"f~=#vCKվ.XǬ!s?558Jdy22dCWsžFeu%ᾎxHb~-g}F˱+Ȑ|K-z9u#t-[=ZݜY}09ihJIn|ˇD*5B Hyħqux2E{( n{ݎ$]D$pSS"Xi~utJ>4-y!l"[-U鈔9HQ}rD2=d o *Rz:s͙ۼRLɖ(lI6h^<{XN}rU>FRG;$J/qG2פ}L0E^&u9XD^+*gwN0|Rޏ}H?=cM }C$m)?%̦ gu[&-H4$7*$TO"" DCd˂u)ɱ,sZ‚Yٞ9#2jI62L6RDt%[*8H"%Y!a-G8L0h]>cQ$. ЀpDDJ^Wg["\64tJk-="[@ qܞo8X4Wo};NْȖCvnHsheڈpIENDB`uTox/third_party/stb/stb/data/herringbone/license.txt0000600000175000001440000000031014003056224021776 0ustar rakusersAll files in this directory are in the public domain. Where a public domain declaration is not recognized, you are granted a license to freely use, modify, and redistribute them in any way you choose.uTox/third_party/stb/stb/data/easy_font_raw.png0000600000175000001440000000120514003056224020663 0ustar rakusersPNG  IHDR 9fPLTE1IDATx^햁j0 D)ogMdlTuRlɑ/IF]ۼBDݏ6{3Ѩ{<1yK8{ v`8b[ S{&@iEzXmu;JXMzYH55mWn=̪}b(`Z(,":EJ¦Ir*Lr282|>j- ;# ʢ!#VUy7+izAȒ4`Q$ 5I-7.mk1j%C%UbmjQtM*bYv,hbҲZb?8p}e8 KwbIrC@cU;Q)Yd-JfgZDW,E3 Χsy7*@̓qx.U\>rXt0ϥ\t΢j<ګEb|*W!tb2@N4IENDB`uTox/third_party/stb/stb/data/atari_8bit_font_revised.png0000600000175000001440000000335114003056224022624 0ustar rakusersPNG  IHDR u3 pHYs  iCCPPhotoshop ICC profilexc``$PPTR~!11 !/?/020|pYɕ4\PTp(%8 CzyIA c HRvA cHvH3c OIjE s~AeQfzFcJ~RBpeqIjng^r~QA~QbIj ^<#U*( >1H.-*%CC"C= o]KW0cc btY9y!K[z,٦}cg͡3#nM4}2?~ 4] cHRMz%u0`:o_FKIDATxYђ0 MlIv͔nYJ 1%!bmC"[>}ܰ{{uQν!jm^h aQFfz;&3kβqfr6>Ӡ >A`|<_ xdk?+_|g<&\ӠU!J\&;AeΞrf!_@u[5ZCqaG3w&O e9}Xi&r> LhB``J`pΒ!\̣P1Ԃ+e{Nq> ΝyR0 ?`[Y1͍^#3;@ֳ -x3wfp4n&yy^J2GlB*C9D#.n@+;}뚢|%,,H󓅮> lpbVƒ7qn }O1e)| qX5[۲&WRLwV&2Ƕ@BsYm֮qޤh/ p 54o?ᕂJ@PzF}a+4O1d +oe#ߢz;%bL u^.]D stb === single-file public domain (or MIT licensed) libraries for C/C++ Most libraries by stb, except: stb_dxt by Fabian "ryg" Giesen, stb_image_resize by Jorge L. "VinoBS" Rodriguez, and stb_sprintf by Jeff Roberts. library | lastest version | category | LoC | description --------------------- | ---- | -------- | --- | -------------------------------- **[stb_vorbis.c](stb_vorbis.c)** | 1.11 | audio | 5449 | decode ogg vorbis files from file/memory to float/16-bit signed output **[stb_image.h](stb_image.h)** | 2.16 | graphics | 7187 | image loading/decoding from file/memory: JPG, PNG, TGA, BMP, PSD, GIF, HDR, PIC **[stb_truetype.h](stb_truetype.h)** | 1.17 | graphics | 4566 | parse, decode, and rasterize characters from truetype fonts **[stb_image_write.h](stb_image_write.h)** | 1.07 | graphics | 1458 | image writing to disk: PNG, TGA, BMP **[stb_image_resize.h](stb_image_resize.h)** | 0.95 | graphics | 2627 | resize images larger/smaller with good quality **[stb_rect_pack.h](stb_rect_pack.h)** | 0.11 | graphics | 624 | simple 2D rectangle packer with decent quality **[stb_sprintf.h](stb_sprintf.h)** | 1.03 | utility | 1812 | fast sprintf, snprintf for C/C++ **[stretchy_buffer.h](stretchy_buffer.h)** | 1.02 | utility | 257 | typesafe dynamic array for C (i.e. approximation to vector<>), doesn't compile as C++ **[stb_textedit.h](stb_textedit.h)** | 1.11 | user interface | 1393 | guts of a text editor for games etc implementing them from scratch **[stb_voxel_render.h](stb_voxel_render.h)** | 0.85 | 3D graphics | 3803 | Minecraft-esque voxel rendering "engine" with many more features **[stb_dxt.h](stb_dxt.h)** | 1.07 | 3D graphics | 719 | Fabian "ryg" Giesen's real-time DXT compressor **[stb_perlin.h](stb_perlin.h)** | 0.3 | 3D graphics | 316 | revised Perlin noise (3D input, 1D output) **[stb_easy_font.h](stb_easy_font.h)** | 1.0 | 3D graphics | 303 | quick-and-dirty easy-to-deploy bitmap font for printing frame rate, etc **[stb_tilemap_editor.h](stb_tilemap_editor.h)** | 0.38 | game dev | 4172 | embeddable tilemap editor **[stb_herringbone_wa...](stb_herringbone_wang_tile.h)** | 0.6 | game dev | 1220 | herringbone Wang tile map generator **[stb_c_lexer.h](stb_c_lexer.h)** | 0.09 | parsing | 962 | simplify writing parsers for C-like languages **[stb_divide.h](stb_divide.h)** | 0.91 | math | 419 | more useful 32-bit modulus e.g. "euclidean divide" **[stb_connected_comp...](stb_connected_components.h)** | 0.95 | misc | 1045 | incrementally compute reachability on grids **[stb.h](stb.h)** | 2.30 | misc | 14328 | helper functions for C, mostly redundant in C++; basically author's personal stuff **[stb_leakcheck.h](stb_leakcheck.h)** | 0.4 | misc | 186 | quick-and-dirty malloc/free leak-checking Total libraries: 20 Total lines of C code: 52846 FAQ --- #### What's the license? These libraries are in the public domain. You can do anything you want with them. You have no legal obligation to do anything else, although I appreciate attribution. They are also licensed under the MIT open source license, if you have lawyers who are unhappy with public domain. Every source file includes an explicit dual-license for you to choose from. #### Are there other single-file public-domain/open source libraries with minimal dependencies out there? [Yes.](https://github.com/nothings/single_file_libs) #### If I wrap an stb library in a new library, does the new library have to be public domain/MIT? No, because it's public domain you can freely relicense it to whatever license your new library wants to be. #### What's the deal with SSE support in GCC-based compilers? stb_image will either use SSE2 (if you compile with -msse2) or will not use any SIMD at all, rather than trying to detect the processor at runtime and handle it correctly. As I understand it, the approved path in GCC for runtime-detection require you to use multiple source files, one for each CPU configuration. Because stb_image is a header-file library that compiles in only one source file, there's no approved way to build both an SSE-enabled and a non-SSE-enabled variation. While we've tried to work around it, we've had multiple issues over the years due to specific versions of gcc breaking what we're doing, so we've given up on it. See https://github.com/nothings/stb/issues/280 and https://github.com/nothings/stb/issues/410 for examples. #### Some of these libraries seem redundant to existing open source libraries. Are they better somehow? Generally they're only better in that they're easier to integrate, easier to use, and easier to release (single file; good API; no attribution requirement). They may be less featureful, slower, and/or use more memory. If you're already using an equivalent library, there's probably no good reason to switch. #### Can I link directly to the table of stb libraries? You can use [this URL](https://github.com/nothings/stb#stb_libs) to link directly to that list. #### Why do you list "lines of code"? It's a terrible metric. Just to give you some idea of the internal complexity of the library, to help you manage your expectations, or to let you know what you're getting into. While not all the libraries are written in the same style, they're certainly similar styles, and so comparisons between the libraries are probably still meaningful. Note though that the lines do include both the implementation, the part that corresponds to a header file, and the documentation. #### Why single-file headers? Windows doesn't have standard directories where libraries live. That makes deploying libraries in Windows a lot more painful than open source developers on Unix-derivates generally realize. (It also makes library dependencies a lot worse in Windows.) There's also a common problem in Windows where a library was built against a different version of the runtime library, which causes link conflicts and confusion. Shipping the libs as headers means you normally just compile them straight into your project without making libraries, thus sidestepping that problem. Making them a single file makes it very easy to just drop them into a project that needs them. (Of course you can still put them in a proper shared library tree if you want.) Why not two files, one a header and one an implementation? The difference between 10 files and 9 files is not a big deal, but the difference between 2 files and 1 file is a big deal. You don't need to zip or tar the files up, you don't have to remember to attach *two* files, etc. #### Why "stb"? Is this something to do with Set-Top Boxes? No, they are just the initials for my name, Sean T. Barrett. This was not chosen out of egomania, but as a moderately sane way of namespacing the filenames and source function names. #### Will you add more image types to stb_image.h? If people submit them, I generally add them, but the goal of stb_image is less for applications like image viewer apps (which need to support every type of image under the sun) and more for things like games which can choose what images to use, so I may decline to add them if they're too rare or if the size of implementation vs. apparent benefit is too low. #### Do you have any advice on how to create my own single-file library? Yes. https://github.com/nothings/stb/blob/master/docs/stb_howto.txt #### Why public domain? I prefer it over GPL, LGPL, BSD, zlib, etc. for many reasons. Some of them are listed here: https://github.com/nothings/stb/blob/master/docs/why_public_domain.md #### Why C? Primarily, because I use C, not C++. But it does also make it easier for other people to use them from other languages. #### Why not C99? stdint.h, declare-anywhere, etc. I still use MSVC 6 (1998) as my IDE because it has better human factors for me than later versions of MSVC. uTox/third_party/stb/stb/.travis.yml0000600000175000001440000000007414003056224016520 0ustar rakuserslanguage: C install: true script: - cd tests - make all uTox/third_party/stb/stb/.github/0000700000175000001440000000000014003056224015744 5ustar rakusersuTox/third_party/stb/stb/.github/PULL_REQUEST_TEMPLATE.md0000600000175000001440000000116314003056224021550 0ustar rakusers* Delete this list before clicking CREATE PULL REQUEST * Make sure you're using a special branch just for this pull request. (Sometimes people unknowingly use a default branch, then later update that branch, which updates the pull request with the other changes if it hasn't been merged yet.) * Do NOT update the version number in the file. (This just causes conflicts.) * Do add your name to the list of contributors. (Don't worry about the formatting.) I'll try to remember to add it if you don't, but I sometimes forget as it's an extra step. If you get something above wrong, don't fret it, it's not the end of the world. uTox/third_party/stb/stb/.github/CONTRIBUTING.md0000600000175000001440000000170314003056224020200 0ustar rakusersPull Requests and Issues are both welcome. # Responsiveness General priority order is: * Crashes * Bugs * Warnings * Enhancements (new features, performance improvement, etc) Pull requests get priority over Issues. Some pull requests I take as written; some I modify myself; some I will request changes before accepting them. Because I've ended up supporting a lot of libraries (20 as I write this, with more on the way), I am somewhat slow to address things. Many issues have been around for a long time. # Pull requests * Do NOT update the version number in the file. (This just causes conflicts.) * Do add your name to the list of contributors. (Don't worry about the formatting.) I'll try to remember to add it if you don't, but I sometimes forget as it's an extra step. # Specific libraries I generally do not want new file formats for stb_image because we are trying to improve its security, so increasing its attack surface is counter-productive. uTox/third_party/stb/stb/.git0000600000175000001440000000006214003056224015170 0ustar rakusersgitdir: ../../../.git/modules/third_party/stb/stb uTox/third_party/stb/CMakeLists.txt0000600000175000001440000000021314003056216016353 0ustar rakusersproject(stb LANGUAGES C) add_library(${PROJECT_NAME} STATIC stb.c ) target_include_directories(${PROJECT_NAME} SYSTEM PUBLIC . ) uTox/third_party/qrcodegen/0000700000175000001440000000000014003056216014774 5ustar rakusersuTox/third_party/qrcodegen/qrcodegen/0000700000175000001440000000000014003056224016742 5ustar rakusersuTox/third_party/qrcodegen/qrcodegen/rust/0000700000175000001440000000000014003056224017737 5ustar rakusersuTox/third_party/qrcodegen/qrcodegen/rust/src/0000700000175000001440000000000014003056224020526 5ustar rakusersuTox/third_party/qrcodegen/qrcodegen/rust/src/lib.rs0000600000175000001440000011364714003056224021660 0ustar rakusers/* * QR Code generator library (Rust) * * Copyright (c) Project Nayuki. (MIT License) * https://www.nayuki.io/page/qr-code-generator-library * * 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. */ /*---- QrCode functionality ----*/ // Represents an immutable square grid of black and white cells for a QR Code symbol, and // provides static functions to create a QR Code from user-supplied textual or binary data. // This struct covers the QR Code model 2 specification, supporting all versions (sizes) // from 1 to 40, all 4 error correction levels, and only 3 character encoding modes. pub struct QrCode { // This QR Code symbol's version number, which is always between 1 and 40 (inclusive). version: Version, // The width and height of this QR Code symbol, measured in modules. // Always equal to version × 4 + 17, in the range 21 to 177. size: i32, // The error correction level used in this QR Code symbol. errorcorrectionlevel: QrCodeEcc, // The mask pattern used in this QR Code symbol, in the range 0 to 7 (i.e. unsigned 3-bit integer). // Note that even if a constructor was called with automatic masking requested // (mask = -1), the resulting object will still have a mask value between 0 and 7. mask: Mask, // The modules of this QR Code symbol (false = white, true = black) modules: Vec, // Indicates function modules that are not subjected to masking isfunction: Vec, } impl QrCode { /*---- Public static factory functions ----*/ // Returns a QR Code symbol representing the given Unicode text string at the given error correction level. // As a conservative upper bound, this function is guaranteed to succeed for strings that have 738 or fewer Unicode // code points (not UTF-8 code units) if the low error correction level is used. The smallest possible // QR Code version is automatically chosen for the output. The ECC level of the result may be higher than // the ecl argument if it can be done without increasing the version. Returns a wrapped QrCode if successful, // or None if the data is too long to fit in any version at the given ECC level. pub fn encode_text(text: &str, ecl: QrCodeEcc) -> Option { let chrs: Vec = text.chars().collect(); let segs: Vec = QrSegment::make_segments(&chrs); QrCode::encode_segments(&segs, ecl) } // Returns a QR Code symbol representing the given binary data string at the given error correction level. // This function always encodes using the binary segment mode, not any text mode. The maximum number of // bytes allowed is 2953. The smallest possible QR Code version is automatically chosen for the output. // The ECC level of the result may be higher than the ecl argument if it can be done without increasing the version. // Returns a wrapped QrCode if successful, or None if the data is too long to fit in any version at the given ECC level. pub fn encode_binary(data: &[u8], ecl: QrCodeEcc) -> Option { let segs: Vec = vec![QrSegment::make_bytes(data)]; QrCode::encode_segments(&segs, ecl) } // Returns a QR Code symbol representing the given data segments at the given error correction // level or higher. The smallest possible QR Code version is automatically chosen for the output. // This function allows the user to create a custom sequence of segments that switches // between modes (such as alphanumeric and binary) to encode text more efficiently. // This function is considered to be lower level than simply encoding text or binary data. // Returns a wrapped QrCode if successful, or None if the data is too long to fit in any version at the given ECC level. pub fn encode_segments(segs: &[QrSegment], ecl: QrCodeEcc) -> Option { QrCode::encode_segments_advanced(segs, ecl, QrCode_MIN_VERSION, QrCode_MAX_VERSION, None, true) } // Returns a QR Code symbol representing the given data segments with the given encoding parameters. // The smallest possible QR Code version within the given range is automatically chosen for the output. // This function allows the user to create a custom sequence of segments that switches // between modes (such as alphanumeric and binary) to encode text more efficiently. // This function is considered to be lower level than simply encoding text or binary data. // Returns a wrapped QrCode if successful, or None if the data is too long to fit // in any version in the given range at the given ECC level. pub fn encode_segments_advanced(segs: &[QrSegment], mut ecl: QrCodeEcc, minversion: Version, maxversion: Version, mask: Option, boostecl: bool) -> Option { assert!(minversion.value() <= maxversion.value(), "Invalid value"); // Find the minimal version number to use let mut version = minversion; let datausedbits: usize; loop { // Number of data bits available let datacapacitybits: usize = QrCode::get_num_data_codewords(version, ecl) * 8; if let Some(n) = QrSegment::get_total_bits(segs, version) { if n <= datacapacitybits { datausedbits = n; break; // This version number is found to be suitable } } if version.value() >= maxversion.value() { // All versions in the range could not fit the given data return None; } version = Version::new(version.value() + 1); } // Increase the error correction level while the data still fits in the current version number for newecl in &[QrCodeEcc::Medium, QrCodeEcc::Quartile, QrCodeEcc::High] { if boostecl && datausedbits <= QrCode::get_num_data_codewords(version, *newecl) * 8 { ecl = *newecl; } } // Create the data bit string by concatenating all segments let datacapacitybits: usize = QrCode::get_num_data_codewords(version, ecl) * 8; let mut bb = BitBuffer(Vec::new()); for seg in segs { bb.append_bits(seg.mode.mode_bits(), 4); bb.append_bits(seg.numchars as u32, seg.mode.num_char_count_bits(version)); bb.0.extend_from_slice(&seg.data); } // Add terminator and pad up to a byte if applicable let numzerobits = std::cmp::min(4, datacapacitybits - bb.0.len()); bb.append_bits(0, numzerobits as u8); let numzerobits = bb.0.len().wrapping_neg() & 7; bb.append_bits(0, numzerobits as u8); // Pad with alternate bytes until data capacity is reached let mut padbyte: u32 = 0xEC; while bb.0.len() < datacapacitybits { bb.append_bits(padbyte, 8); padbyte ^= 0xEC ^ 0x11; } assert_eq!(bb.0.len() % 8, 0, "Assertion error"); let mut bytes = vec![0u8; bb.0.len() / 8]; for (i, bit) in bb.0.iter().enumerate() { bytes[i >> 3] |= (*bit as u8) << (7 - (i & 7)); } // Create the QR Code symbol Some(QrCode::encode_codewords(version, ecl, &bytes, mask)) } /*---- Constructors ----*/ // Creates a new QR Code symbol with the given version number, error correction level, // binary data array, and mask number. This is a cumbersome low-level constructor that // should not be invoked directly by the user. To go one level up, see the encode_segments() function. pub fn encode_codewords(ver: Version, ecl: QrCodeEcc, datacodewords: &[u8], mask: Option) -> QrCode { // Initialize fields let size: usize = (ver.value() as usize) * 4 + 17; let mut result = QrCode { version: ver, size: size as i32, mask: Mask::new(0), // Dummy value errorcorrectionlevel: ecl, modules: vec![false; size * size], // Entirely white grid isfunction: vec![false; size * size], }; // Draw function patterns, draw all codewords, do masking result.draw_function_patterns(); let allcodewords: Vec = result.append_error_correction(datacodewords); result.draw_codewords(&allcodewords); result.handle_constructor_masking(mask); result } // Returns this QR Code's version, in the range [1, 40]. pub fn version(&self) -> Version { self.version } // Returns this QR Code's size, in the range [21, 177]. pub fn size(&self) -> i32 { self.size } // Returns this QR Code's error correction level. pub fn error_correction_level(&self) -> QrCodeEcc { self.errorcorrectionlevel } // Returns this QR Code's mask, in the range [0, 7]. pub fn mask(&self) -> Mask { self.mask } // Returns the color of the module (pixel) at the given coordinates, which is either // false for white or true for black. The top left corner has the coordinates (x=0, y=0). // If the given coordinates are out of bounds, then 0 (white) is returned. pub fn get_module(&self, x: i32, y: i32) -> bool { 0 <= x && x < self.size && 0 <= y && y < self.size && self.module(x, y) } // Returns the color of the module at the given coordinates, which must be in bounds. fn module(&self, x: i32, y: i32) -> bool { self.modules[(y * self.size + x) as usize] } // Returns a mutable reference to the module's color at the given coordinates, which must be in bounds. fn module_mut(&mut self, x: i32, y: i32) -> &mut bool { &mut self.modules[(y * self.size + x) as usize] } // Based on the given number of border modules to add as padding, this returns a // string whose contents represents an SVG XML file that depicts this QR Code symbol. // Note that Unix newlines (\n) are always used, regardless of the platform. pub fn to_svg_string(&self, border: i32) -> String { assert!(border >= 0, "Border must be non-negative"); let mut result: String = String::new(); result.push_str("\n"); result.push_str("\n"); result.push_str(&format!( "\n", self.size + border * 2)); result.push_str("\t\n"); result.push_str("\t\n"); result.push_str("\n"); result } /*---- Private helper methods for constructor: Drawing function modules ----*/ fn draw_function_patterns(&mut self) { // Draw horizontal and vertical timing patterns let size: i32 = self.size; for i in 0 .. size { self.set_function_module(6, i, i % 2 == 0); self.set_function_module(i, 6, i % 2 == 0); } // Draw 3 finder patterns (all corners except bottom right; overwrites some timing modules) self.draw_finder_pattern(3, 3); self.draw_finder_pattern(size - 4, 3); self.draw_finder_pattern(3, size - 4); // Draw numerous alignment patterns let alignpatpos: Vec = QrCode::get_alignment_pattern_positions(self.version); let numalign: usize = alignpatpos.len(); for i in 0 .. numalign { for j in 0 .. numalign { if i == 0 && j == 0 || i == 0 && j == numalign - 1 || i == numalign - 1 && j == 0 { continue; // Skip the three finder corners } else { self.draw_alignment_pattern(alignpatpos[i], alignpatpos[j]); } } } // Draw configuration data self.draw_format_bits(Mask::new(0)); // Dummy mask value; overwritten later in the constructor self.draw_version(); } // Draws two copies of the format bits (with its own error correction code) // based on the given mask and this object's error correction level field. fn draw_format_bits(&mut self, mask: Mask) { // Calculate error correction code and pack bits let size: i32 = self.size; // errcorrlvl is uint2, mask is uint3 let mut data: u32 = self.errorcorrectionlevel.format_bits() << 3 | (mask.value() as u32); let mut rem: u32 = data; for _ in 0 .. 10 { rem = (rem << 1) ^ ((rem >> 9) * 0x537); } data = data << 10 | rem; data ^= 0x5412; // uint15 assert_eq!(data >> 15, 0, "Assertion error"); // Draw first copy for i in 0 .. 6 { self.set_function_module(8, i, (data >> i) & 1 != 0); } self.set_function_module(8, 7, (data >> 6) & 1 != 0); self.set_function_module(8, 8, (data >> 7) & 1 != 0); self.set_function_module(7, 8, (data >> 8) & 1 != 0); for i in 9 .. 15 { self.set_function_module(14 - i, 8, (data >> i) & 1 != 0); } // Draw second copy for i in 0 .. 8 { self.set_function_module(size - 1 - i, 8, (data >> i) & 1 != 0); } for i in 8 .. 15 { self.set_function_module(8, size - 15 + i, (data >> i) & 1 != 0); } self.set_function_module(8, size - 8, true); } // Draws two copies of the version bits (with its own error correction code), // based on this object's version field (which only has an effect for 7 <= version <= 40). fn draw_version(&mut self) { if self.version.value() < 7 { return; } // Calculate error correction code and pack bits let mut rem: u32 = self.version.value() as u32; // version is uint6, in the range [7, 40] for _ in 0 .. 12 { rem = (rem << 1) ^ ((rem >> 11) * 0x1F25); } let data: u32 = (self.version.value() as u32) << 12 | rem; // uint18 assert!(data >> 18 == 0, "Assertion error"); // Draw two copies for i in 0 .. 18 { let bit: bool = (data >> i) & 1 != 0; let a: i32 = self.size - 11 + i % 3; let b: i32 = i / 3; self.set_function_module(a, b, bit); self.set_function_module(b, a, bit); } } // Draws a 9*9 finder pattern including the border separator, with the center module at (x, y). fn draw_finder_pattern(&mut self, x: i32, y: i32) { for i in -4 .. 5 { for j in -4 .. 5 { let xx: i32 = x + j; let yy: i32 = y + i; if 0 <= xx && xx < self.size && 0 <= yy && yy < self.size { let dist: i32 = std::cmp::max(i.abs(), j.abs()); // Chebyshev/infinity norm self.set_function_module(xx, yy, dist != 2 && dist != 4); } } } } // Draws a 5*5 alignment pattern, with the center module at (x, y). fn draw_alignment_pattern(&mut self, x: i32, y: i32) { for i in -2 .. 3 { for j in -2 .. 3 { self.set_function_module(x + j, y + i, std::cmp::max(i.abs(), j.abs()) != 1); } } } // Sets the color of a module and marks it as a function module. // Only used by the constructor. Coordinates must be in range. fn set_function_module(&mut self, x: i32, y: i32, isblack: bool) { *self.module_mut(x, y) = isblack; self.isfunction[(y * self.size + x) as usize] = true; } /*---- Private helper methods for constructor: Codewords and masking ----*/ // Returns a new byte string representing the given data with the appropriate error correction // codewords appended to it, based on this object's version and error correction level. fn append_error_correction(&self, data: &[u8]) -> Vec { assert_eq!(data.len(), QrCode::get_num_data_codewords(self.version, self.errorcorrectionlevel), "Illegal argument"); // Calculate parameter numbers let numblocks: usize = QrCode::table_get(&NUM_ERROR_CORRECTION_BLOCKS, self.version, self.errorcorrectionlevel); let blockecclen: usize = QrCode::table_get(&ECC_CODEWORDS_PER_BLOCK, self.version, self.errorcorrectionlevel); let rawcodewords: usize = QrCode::get_num_raw_data_modules(self.version) / 8; let numshortblocks: usize = numblocks - rawcodewords % numblocks; let shortblocklen: usize = rawcodewords / numblocks; // Split data into blocks and append ECC to each block let mut blocks = Vec::>::with_capacity(numblocks); let rs = ReedSolomonGenerator::new(blockecclen); let mut k: usize = 0; for i in 0 .. numblocks { let mut dat = Vec::::with_capacity(shortblocklen + 1); dat.extend_from_slice(&data[k .. k + shortblocklen - blockecclen + ((i >= numshortblocks) as usize)]); k += dat.len(); let ecc: Vec = rs.get_remainder(&dat); if i < numshortblocks { dat.push(0); } dat.extend_from_slice(&ecc); blocks.push(dat); } // Interleave (not concatenate) the bytes from every block into a single sequence let mut result = Vec::::with_capacity(rawcodewords); for i in 0 .. shortblocklen + 1 { for j in 0 .. numblocks { // Skip the padding byte in short blocks if i != shortblocklen - blockecclen || j >= numshortblocks { result.push(blocks[j][i]); } } } result } // Draws the given sequence of 8-bit codewords (data and error correction) onto the entire // data area of this QR Code symbol. Function modules need to be marked off before this is called. fn draw_codewords(&mut self, data: &[u8]) { assert_eq!(data.len(), QrCode::get_num_raw_data_modules(self.version) / 8, "Illegal argument"); let mut i: usize = 0; // Bit index into the data // Do the funny zigzag scan let mut right: i32 = self.size - 1; while right >= 1 { // Index of right column in each column pair if right == 6 { right = 5; } for vert in 0 .. self.size { // Vertical counter for j in 0 .. 2 { let x: i32 = right - j; // Actual x coordinate let upward: bool = (right + 1) & 2 == 0; let y: i32 = if upward { self.size - 1 - vert } else { vert }; // Actual y coordinate if !self.isfunction[(y * self.size + x) as usize] && i < data.len() * 8 { *self.module_mut(x, y) = (data[i >> 3] >> (7 - (i & 7))) & 1 != 0; i += 1; } // If there are any remainder bits (0 to 7), they are already // set to 0/false/white when the grid of modules was initialized } } right -= 2; } assert_eq!(i, data.len() * 8, "Assertion error"); } // XORs the data modules in this QR Code with the given mask pattern. Due to XOR's mathematical // properties, calling applyMask(m) twice with the same value is equivalent to no change at all. // This means it is possible to apply a mask, undo it, and try another mask. Note that a final // well-formed QR Code symbol needs exactly one mask applied (not zero, not two, etc.). fn apply_mask(&mut self, mask: Mask) { let mask = mask.value(); for y in 0 .. self.size { for x in 0 .. self.size { let invert: bool = match mask { 0 => (x + y) % 2 == 0, 1 => y % 2 == 0, 2 => x % 3 == 0, 3 => (x + y) % 3 == 0, 4 => (x / 3 + y / 2) % 2 == 0, 5 => x * y % 2 + x * y % 3 == 0, 6 => (x * y % 2 + x * y % 3) % 2 == 0, 7 => ((x + y) % 2 + x * y % 3) % 2 == 0, _ => panic!("Assertion error"), }; *self.module_mut(x, y) ^= invert & !self.isfunction[(y * self.size + x) as usize]; } } } // A messy helper function for the constructors. This QR Code must be in an unmasked state when this // method is called. The given argument is the requested mask, which is -1 for auto or 0 to 7 for fixed. // This method applies and returns the actual mask chosen, from 0 to 7. fn handle_constructor_masking(&mut self, mut mask: Option) { if mask.is_none() { // Automatically choose best mask let mut minpenalty: i32 = std::i32::MAX; for i in 0u8 .. 8 { let newmask = Mask::new(i); self.draw_format_bits(newmask); self.apply_mask(newmask); let penalty: i32 = self.get_penalty_score(); if penalty < minpenalty { mask = Some(newmask); minpenalty = penalty; } self.apply_mask(newmask); // Undoes the mask due to XOR } } let msk: Mask = mask.unwrap(); self.draw_format_bits(msk); // Overwrite old format bits self.apply_mask(msk); // Apply the final choice of mask self.mask = msk; } // Calculates and returns the penalty score based on state of this QR Code's current modules. // This is used by the automatic mask choice algorithm to find the mask pattern that yields the lowest score. fn get_penalty_score(&self) -> i32 { let mut result: i32 = 0; let size: i32 = self.size; // Adjacent modules in row having same color for y in 0 .. size { let mut colorx: bool = false; let mut runx: i32 = 0; for x in 0 .. size { if x == 0 || self.module(x, y) != colorx { colorx = self.module(x, y); runx = 1; } else { runx += 1; if runx == 5 { result += PENALTY_N1; } else if runx > 5 { result += 1; } } } } // Adjacent modules in column having same color for x in 0 .. size { let mut colory: bool = false; let mut runy: i32 = 0; for y in 0 .. size { if y == 0 || self.module(x, y) != colory { colory = self.module(x, y); runy = 1; } else { runy += 1; if runy == 5 { result += PENALTY_N1; } else if runy > 5 { result += 1; } } } } // 2*2 blocks of modules having same color for y in 0 .. size - 1 { for x in 0 .. size - 1 { let color: bool = self.module(x, y); if color == self.module(x + 1, y) && color == self.module(x, y + 1) && color == self.module(x + 1, y + 1) { result += PENALTY_N2; } } } // Finder-like pattern in rows for y in 0 .. size { let mut bits: u32 = 0; for x in 0 .. size { bits = ((bits << 1) & 0x7FF) | (self.module(x, y) as u32); if x >= 10 && (bits == 0x05D || bits == 0x5D0) { // Needs 11 bits accumulated result += PENALTY_N3; } } } // Finder-like pattern in columns for x in 0 .. size { let mut bits: u32 = 0; for y in 0 .. size { bits = ((bits << 1) & 0x7FF) | (self.module(x, y) as u32); if y >= 10 && (bits == 0x05D || bits == 0x5D0) { // Needs 11 bits accumulated result += PENALTY_N3; } } } // Balance of black and white modules let mut black: i32 = 0; for color in &self.modules { black += *color as i32; } let total: i32 = size * size; // Find smallest k such that (45-5k)% <= dark/total <= (55+5k)% let mut k: i32 = 0; while black*20 < (9-k)*total || black*20 > (11+k)*total { result += PENALTY_N4; k += 1; } result } /*---- Private static helper functions ----*/ // Returns a set of positions of the alignment patterns in ascending order. These positions are // used on both the x and y axes. Each value in the resulting list is in the range [0, 177). // This stateless pure function could be implemented as table of 40 variable-length lists of unsigned bytes. fn get_alignment_pattern_positions(ver: Version) -> Vec { let ver = ver.value(); if ver == 1 { vec![] } else { let numalign: i32 = (ver as i32) / 7 + 2; let step: i32 = if ver != 32 { // ceil((size - 13) / (2*numAlign - 2)) * 2 ((ver as i32) * 4 + numalign * 2 + 1) / (2 * numalign - 2) * 2 } else { // C-C-C-Combo breaker! 26 }; let mut result = vec![6i32]; let mut pos: i32 = (ver as i32) * 4 + 10; for _ in 0 .. numalign - 1 { result.insert(1, pos); pos -= step; } result } } // Returns the number of data bits that can be stored in a QR Code of the given version number, after // all function modules are excluded. This includes remainder bits, so it might not be a multiple of 8. // The result is in the range [208, 29648]. This could be implemented as a 40-entry lookup table. fn get_num_raw_data_modules(ver: Version) -> usize { let ver = ver.value(); let mut result: usize = (16 * (ver as usize) + 128) * (ver as usize) + 64; if ver >= 2 { let numalign: usize = (ver as usize) / 7 + 2; result -= (25 * numalign - 10) * numalign - 55; if ver >= 7 { result -= 18 * 2; // Subtract version information } } result } // Returns the number of 8-bit data (i.e. not error correction) codewords contained in any // QR Code of the given version number and error correction level, with remainder bits discarded. // This stateless pure function could be implemented as a (40*4)-cell lookup table. fn get_num_data_codewords(ver: Version, ecl: QrCodeEcc) -> usize { QrCode::get_num_raw_data_modules(ver) / 8 - QrCode::table_get(&ECC_CODEWORDS_PER_BLOCK, ver, ecl) * QrCode::table_get(&NUM_ERROR_CORRECTION_BLOCKS, ver, ecl) } // Returns an entry from the given table based on the given values. fn table_get(table: &'static [[i8; 41]; 4], ver: Version, ecl: QrCodeEcc) -> usize { table[ecl.ordinal()][ver.value() as usize] as usize } } /*---- Public constants ----*/ pub const QrCode_MIN_VERSION: Version = Version( 1); pub const QrCode_MAX_VERSION: Version = Version(40); /*---- Private tables of constants ----*/ // For use in get_penalty_score(), when evaluating which mask is best. const PENALTY_N1: i32 = 3; const PENALTY_N2: i32 = 3; const PENALTY_N3: i32 = 40; const PENALTY_N4: i32 = 10; static ECC_CODEWORDS_PER_BLOCK: [[i8; 41]; 4] = [ // Version: (note that index 0 is for padding, and is set to an illegal value) //0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40 Error correction level [-1, 7, 10, 15, 20, 26, 18, 20, 24, 30, 18, 20, 24, 26, 30, 22, 24, 28, 30, 28, 28, 28, 28, 30, 30, 26, 28, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30], // Low [-1, 10, 16, 26, 18, 24, 16, 18, 22, 22, 26, 30, 22, 22, 24, 24, 28, 28, 26, 26, 26, 26, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28], // Medium [-1, 13, 22, 18, 26, 18, 24, 18, 22, 20, 24, 28, 26, 24, 20, 30, 24, 28, 28, 26, 30, 28, 30, 30, 30, 30, 28, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30], // Quartile [-1, 17, 28, 22, 16, 22, 28, 26, 26, 24, 28, 24, 28, 22, 24, 24, 30, 28, 28, 26, 28, 30, 24, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30], // High ]; static NUM_ERROR_CORRECTION_BLOCKS: [[i8; 41]; 4] = [ // Version: (note that index 0 is for padding, and is set to an illegal value) //0, 1, 2, 3, 4, 5, 6, 7, 8, 9,10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40 Error correction level [-1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 4, 4, 4, 4, 4, 6, 6, 6, 6, 7, 8, 8, 9, 9, 10, 12, 12, 12, 13, 14, 15, 16, 17, 18, 19, 19, 20, 21, 22, 24, 25], // Low [-1, 1, 1, 1, 2, 2, 4, 4, 4, 5, 5, 5, 8, 9, 9, 10, 10, 11, 13, 14, 16, 17, 17, 18, 20, 21, 23, 25, 26, 28, 29, 31, 33, 35, 37, 38, 40, 43, 45, 47, 49], // Medium [-1, 1, 1, 2, 2, 4, 4, 6, 6, 8, 8, 8, 10, 12, 16, 12, 17, 16, 18, 21, 20, 23, 23, 25, 27, 29, 34, 34, 35, 38, 40, 43, 45, 48, 51, 53, 56, 59, 62, 65, 68], // Quartile [-1, 1, 1, 2, 4, 4, 4, 5, 6, 8, 8, 11, 11, 16, 16, 18, 16, 19, 21, 25, 25, 25, 34, 30, 32, 35, 37, 40, 42, 45, 48, 51, 54, 57, 60, 63, 66, 70, 74, 77, 81], // High ]; /*---- QrCodeEcc functionality ----*/ // Represents the error correction level used in a QR Code symbol. Immutable. #[derive(Clone, Copy)] pub enum QrCodeEcc { Low, Medium, Quartile, High, } impl QrCodeEcc { // Returns an unsigned 2-bit integer (in the range 0 to 3). fn ordinal(&self) -> usize { match *self { QrCodeEcc::Low => 0, QrCodeEcc::Medium => 1, QrCodeEcc::Quartile => 2, QrCodeEcc::High => 3, } } // Returns an unsigned 2-bit integer (in the range 0 to 3). fn format_bits(&self) -> u32 { match *self { QrCodeEcc::Low => 1, QrCodeEcc::Medium => 0, QrCodeEcc::Quartile => 3, QrCodeEcc::High => 2, } } } /*---- ReedSolomonGenerator functionality ----*/ // Computes the Reed-Solomon error correction codewords for a sequence of data codewords // at a given degree. Objects are immutable, and the state only depends on the degree. // This class exists because each data block in a QR Code shares the same the divisor polynomial. struct ReedSolomonGenerator { // Coefficients of the divisor polynomial, stored from highest to lowest power, excluding the leading term which // is always 1. For example the polynomial x^3 + 255x^2 + 8x + 93 is stored as the uint8 array {255, 8, 93}. coefficients: Vec, } impl ReedSolomonGenerator { // Creates a Reed-Solomon ECC generator for the given degree. This could be implemented // as a lookup table over all possible parameter values, instead of as an algorithm. fn new(degree: usize) -> ReedSolomonGenerator { assert!(1 <= degree && degree <= 255, "Degree out of range"); // Start with the monomial x^0 let mut coefs = vec![0u8; degree - 1]; coefs.push(1); // Compute the product polynomial (x - r^0) * (x - r^1) * (x - r^2) * ... * (x - r^{degree-1}), // drop the highest term, and store the rest of the coefficients in order of descending powers. // Note that r = 0x02, which is a generator element of this field GF(2^8/0x11D). let mut root: u8 = 1; for _ in 0 .. degree { // Unused variable i // Multiply the current product by (x - r^i) for j in 0 .. degree { coefs[j] = ReedSolomonGenerator::multiply(coefs[j], root); if j + 1 < coefs.len() { coefs[j] ^= coefs[j + 1]; } } root = ReedSolomonGenerator::multiply(root, 0x02); } ReedSolomonGenerator { coefficients: coefs } } // Computes and returns the Reed-Solomon error correction codewords for the given sequence of data codewords. fn get_remainder(&self, data: &[u8]) -> Vec { // Compute the remainder by performing polynomial division let mut result = vec![0u8; self.coefficients.len()]; for b in data { let factor: u8 = b ^ result.remove(0); result.push(0); for (x, y) in result.iter_mut().zip(self.coefficients.iter()) { *x ^= ReedSolomonGenerator::multiply(*y, factor); } } result } // Returns the product of the two given field elements modulo GF(2^8/0x11D). The arguments and result // are unsigned 8-bit integers. This could be implemented as a lookup table of 256*256 entries of uint8. fn multiply(x: u8, y: u8) -> u8 { // Russian peasant multiplication let mut z: u8 = 0; for i in (0 .. 8).rev() { z = (z << 1) ^ ((z >> 7) * 0x1D); z ^= ((y >> i) & 1) * x; } z } } /*---- QrSegment functionality ----*/ // Represents a character string to be encoded in a QR Code symbol. // Each segment has a mode, and a sequence of characters that is already // encoded as a sequence of bits. Instances of this struct are immutable. pub struct QrSegment { // The mode indicator for this segment. mode: QrSegmentMode, // The length of this segment's unencoded data, measured in characters. numchars: usize, // The bits of this segment. data: Vec, } impl QrSegment { /*---- Static factory functions ----*/ // Returns a segment representing the given binary data encoded in byte mode. pub fn make_bytes(data: &[u8]) -> QrSegment { let mut bb = BitBuffer(Vec::with_capacity(data.len() * 8)); for b in data { bb.append_bits(*b as u32, 8); } QrSegment::new(QrSegmentMode::Byte, data.len(), bb.0) } // Returns a segment representing the given string of decimal digits encoded in numeric mode. // Panics if the string contains non-digit characters. pub fn make_numeric(text: &[char]) -> QrSegment { let mut bb = BitBuffer(Vec::with_capacity(text.len() * 3 + (text.len() + 2) / 3)); let mut accumdata: u32 = 0; let mut accumcount: u32 = 0; for c in text { assert!('0' <= *c && *c <= '9', "String contains non-numeric characters"); accumdata = accumdata * 10 + ((*c as u32) - ('0' as u32)); accumcount += 1; if accumcount == 3 { bb.append_bits(accumdata, 10); accumdata = 0; accumcount = 0; } } if accumcount > 0 { // 1 or 2 digits remaining bb.append_bits(accumdata, (accumcount as u8) * 3 + 1); } QrSegment::new(QrSegmentMode::Numeric, text.len(), bb.0) } // Returns a segment representing the given text string encoded in alphanumeric mode. // The characters allowed are: 0 to 9, A to Z (uppercase only), space, dollar, percent, asterisk, // plus, hyphen, period, slash, colon. Panics if the string contains non-encodable characters. pub fn make_alphanumeric(text: &[char]) -> QrSegment { let mut bb = BitBuffer(Vec::with_capacity(text.len() * 5 + (text.len() + 1) / 2)); let mut accumdata: u32 = 0; let mut accumcount: u32 = 0; for c in text { let i = match ALPHANUMERIC_CHARSET.iter().position(|x| *x == *c) { None => panic!("String contains unencodable characters in alphanumeric mode"), Some(j) => j, }; accumdata = accumdata * 45 + (i as u32); accumcount += 1; if accumcount == 2 { bb.append_bits(accumdata, 11); accumdata = 0; accumcount = 0; } } if accumcount > 0 { // 1 character remaining bb.append_bits(accumdata, 6); } QrSegment::new(QrSegmentMode::Alphanumeric, text.len(), bb.0) } // Returns a new mutable list of zero or more segments to represent the given Unicode text string. // The result may use various segment modes and switch modes to optimize the length of the bit stream. pub fn make_segments(text: &[char]) -> Vec { if text.is_empty() { vec![] } else if QrSegment::is_numeric(text) { vec![QrSegment::make_numeric(text)] } else if QrSegment::is_alphanumeric(text) { vec![QrSegment::make_alphanumeric(text)] } else { let s: String = text.iter().cloned().collect(); vec![QrSegment::make_bytes(s.as_bytes())] } } // Returns a segment representing an Extended Channel Interpretation // (ECI) designator with the given assignment value. pub fn make_eci(assignval: u32) -> QrSegment { let mut bb = BitBuffer(Vec::with_capacity(24)); if assignval < (1 << 7) { bb.append_bits(assignval, 8); } else if assignval < (1 << 14) { bb.append_bits(2, 2); bb.append_bits(assignval, 14); } else if assignval < 1_000_000 { bb.append_bits(6, 3); bb.append_bits(assignval, 21); } else { panic!("ECI assignment value out of range"); } QrSegment::new(QrSegmentMode::Eci, 0, bb.0) } // Creates a new QR Code data segment with the given parameters and data. pub fn new(mode: QrSegmentMode, numchars: usize, data: Vec) -> QrSegment { QrSegment { mode: mode, numchars: numchars, data: data, } } /*---- Instance field getters ----*/ // Returns the mode indicator for this segment. pub fn mode(&self) -> QrSegmentMode { self.mode } // Returns the length of this segment's unencoded data, measured in characters. pub fn num_chars(&self) -> usize { self.numchars } // Returns a view of the bits of this segment. pub fn data(&self) -> &Vec { &self.data } /*---- Other static functions ----*/ // Package-private helper function. fn get_total_bits(segs: &[QrSegment], version: Version) -> Option { let mut result: usize = 0; for seg in segs { let ccbits = seg.mode.num_char_count_bits(version); if seg.numchars >= 1 << ccbits { return None; } match result.checked_add(4 + (ccbits as usize) + seg.data.len()) { None => return None, Some(val) => result = val, } } Some(result) } // Tests whether the given string can be encoded as a segment in alphanumeric mode. fn is_alphanumeric(text: &[char]) -> bool { text.iter().all(|c| ALPHANUMERIC_CHARSET.contains(c)) } // Tests whether the given string can be encoded as a segment in numeric mode. fn is_numeric(text: &[char]) -> bool { text.iter().all(|c| '0' <= *c && *c <= '9') } } // The set of all legal characters in alphanumeric mode, // where each character value maps to the index in the string. static ALPHANUMERIC_CHARSET: [char; 45] = ['0','1','2','3','4','5','6','7','8','9', 'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z', ' ','$','%','*','+','-','.','/',':']; /*---- QrSegmentMode functionality ----*/ // The mode field of a segment. Immutable. #[derive(Clone, Copy)] pub enum QrSegmentMode { Numeric, Alphanumeric, Byte, Kanji, Eci, } impl QrSegmentMode { // Returns an unsigned 4-bit integer value (range 0 to 15) // representing the mode indicator bits for this mode object. fn mode_bits(&self) -> u32 { match *self { QrSegmentMode::Numeric => 0x1, QrSegmentMode::Alphanumeric => 0x2, QrSegmentMode::Byte => 0x4, QrSegmentMode::Kanji => 0x8, QrSegmentMode::Eci => 0x7, } } // Returns the bit width of the segment character count field // for this mode object at the given version number. pub fn num_char_count_bits(&self, ver: Version) -> u8 { let array: [u8; 3] = match *self { QrSegmentMode::Numeric => [10, 12, 14], QrSegmentMode::Alphanumeric => [ 9, 11, 13], QrSegmentMode::Byte => [ 8, 16, 16], QrSegmentMode::Kanji => [ 8, 10, 12], QrSegmentMode::Eci => [ 0, 0, 0], }; let ver = ver.value(); if 1 <= ver && ver <= 9 { array[0] } else if 10 <= ver && ver <= 26 { array[1] } else if 27 <= ver && ver <= 40 { array[2] } else { panic!("Version number out of range"); } } } /*---- Bit buffer functionality ----*/ pub struct BitBuffer(pub Vec); impl BitBuffer { // Appends the given number of low bits of the given value // to this sequence. Requires 0 <= val < 2^len. pub fn append_bits(&mut self, val: u32, len: u8) { assert!(len < 32 && (val >> len) == 0 || len == 32, "Value out of range"); for i in (0 .. len).rev() { // Append bit by bit self.0.push((val >> i) & 1 != 0); } } } /*---- Miscellaneous values ----*/ #[derive(Copy, Clone)] pub struct Version(u8); impl Version { pub fn new(ver: u8) -> Self { assert!(QrCode_MIN_VERSION.value() <= ver && ver <= QrCode_MAX_VERSION.value(), "Version number out of range"); Version(ver) } pub fn value(&self) -> u8 { self.0 } } #[derive(Copy, Clone)] pub struct Mask(u8); impl Mask { pub fn new(mask: u8) -> Self { assert!(mask <= 7, "Mask value out of range"); Mask(mask) } pub fn value(&self) -> u8 { self.0 } } uTox/third_party/qrcodegen/qrcodegen/rust/examples/0000700000175000001440000000000014003056224021555 5ustar rakusersuTox/third_party/qrcodegen/qrcodegen/rust/examples/qrcodegen-worker.rs0000600000175000001440000000746414003056224025416 0ustar rakusers/* * QR Code generator test worker (Rust) * * This program reads data and encoding parameters from standard input and writes * QR Code bitmaps to standard output. The I/O format is one integer per line. * Run with no command line arguments. The program is intended for automated * batch testing of end-to-end functionality of this QR Code generator library. * * Copyright (c) Project Nayuki. (MIT License) * https://www.nayuki.io/page/qr-code-generator-library * * 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. */ extern crate qrcodegen; use qrcodegen::Mask; use qrcodegen::QrCode; use qrcodegen::QrCodeEcc; use qrcodegen::QrSegment; use qrcodegen::Version; fn main() { loop { // Read data length or exit let length: i16 = read_int(); if length == -1 { break; } // Read data bytes let mut data = Vec::::with_capacity(length as usize); for _ in 0 .. length { let b: i16 = read_int(); assert_eq!((b as u8) as i16, b, "Byte value out of range"); data.push(b as u8); } let isascii: bool = data.iter().all(|b| *b < 128); // Read encoding parameters let errcorlvl = read_int(); let minversion = read_int(); let maxversion = read_int(); let mask = read_int(); let boostecl = read_int(); assert!(0 <= errcorlvl && errcorlvl <= 3); assert!((qrcodegen::QrCode_MIN_VERSION.value() as i16) <= minversion && minversion <= maxversion && maxversion <= (qrcodegen::QrCode_MAX_VERSION.value() as i16)); assert!(-1 <= mask && mask <= 7); assert!(boostecl >> 1 == 0); // Make segments for encoding let segs: Vec; if isascii { let chrs: Vec = std::str::from_utf8(&data).unwrap().chars().collect(); segs = QrSegment::make_segments(&chrs); } else { segs = vec![QrSegment::make_bytes(&data)]; } // Try to make QR Code symbol let msk = if mask == -1 { None } else { Some(Mask::new(mask as u8)) }; match QrCode::encode_segments_advanced(&segs, ECC_LEVELS[errcorlvl as usize], Version::new(minversion as u8), Version::new(maxversion as u8), msk, boostecl != 0) { Some(qr) => { // Print grid of modules println!("{}", qr.version().value()); for y in 0 .. qr.size() { for x in 0 .. qr.size() { println!("{}", qr.get_module(x, y) as i8); } } }, None => println!("-1"), } use std::io::Write; std::io::stdout().flush().unwrap(); } } fn read_int() -> i16 { let mut line = String::new(); std::io::stdin().read_line(&mut line).unwrap(); let mut chrs: Vec = line.chars().collect(); assert_eq!(chrs.pop().unwrap(), '\n'); let line: String = chrs.iter().cloned().collect(); match line.parse::() { Ok(x) => x, Err(_) => panic!("Invalid number"), } } static ECC_LEVELS: [QrCodeEcc; 4] = [ QrCodeEcc::Low, QrCodeEcc::Medium, QrCodeEcc::Quartile, QrCodeEcc::High, ]; uTox/third_party/qrcodegen/qrcodegen/rust/examples/qrcodegen-demo.rs0000600000175000001440000001667014003056224025030 0ustar rakusers/* * QR Code generator demo (Rust) * * Run this command-line program with no arguments. The program computes a bunch of demonstration * QR Codes and prints them to the console. Also, the SVG code for one QR Code is printed as a sample. * * Copyright (c) Project Nayuki. (MIT License) * https://www.nayuki.io/page/qr-code-generator-library * * 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. */ extern crate qrcodegen; use qrcodegen::Mask; use qrcodegen::QrCode; use qrcodegen::QrCodeEcc; use qrcodegen::QrSegment; use qrcodegen::QrCode_MAX_VERSION; use qrcodegen::QrCode_MIN_VERSION; // The main application program. fn main() { do_basic_demo(); do_variety_demo(); do_segment_demo(); do_mask_demo(); } /*---- Demo suite ----*/ // Creates a single QR Code, then prints it to the console. fn do_basic_demo() { let text: &'static str = "Hello, world!"; // User-supplied Unicode text let errcorlvl: QrCodeEcc = QrCodeEcc::Low; // Error correction level // Make and print the QR Code symbol let qr: QrCode = QrCode::encode_text(text, errcorlvl).unwrap(); print_qr(&qr); println!("{}", qr.to_svg_string(4)); } // Creates a variety of QR Codes that exercise different features of the library, and prints each one to the console. fn do_variety_demo() { // Numeric mode encoding (3.33 bits per digit) let qr = QrCode::encode_text("314159265358979323846264338327950288419716939937510", QrCodeEcc::Medium).unwrap(); print_qr(&qr); // Alphanumeric mode encoding (5.5 bits per character) let qr = QrCode::encode_text("DOLLAR-AMOUNT:$39.87 PERCENTAGE:100.00% OPERATIONS:+-*/", QrCodeEcc::High).unwrap(); print_qr(&qr); // Unicode text as UTF-8 let qr = QrCode::encode_text("こんにちwa、世界！ αβγδ", QrCodeEcc::Quartile).unwrap(); print_qr(&qr); // Moderately large QR Code using longer text (from Lewis Carroll's Alice in Wonderland) let qr = QrCode::encode_text(concat!( "Alice was beginning to get very tired of sitting by her sister on the bank, ", "and of having nothing to do: once or twice she had peeped into the book her sister was reading, ", "but it had no pictures or conversations in it, 'and what is the use of a book,' thought Alice ", "'without pictures or conversations?' So she was considering in her own mind (as well as she could, ", "for the hot day made her feel very sleepy and stupid), whether the pleasure of making a ", "daisy-chain would be worth the trouble of getting up and picking the daisies, when suddenly ", "a White Rabbit with pink eyes ran close by her."), QrCodeEcc::High).unwrap(); print_qr(&qr); } // Creates QR Codes with manually specified segments for better compactness. fn do_segment_demo() { // Illustration "silver" let silver0 = "THE SQUARE ROOT OF 2 IS 1."; let silver1 = "41421356237309504880168872420969807856967187537694807317667973799"; let qr = QrCode::encode_text(&[silver0, silver1].concat(), QrCodeEcc::Low).unwrap(); print_qr(&qr); let segs = vec![ QrSegment::make_alphanumeric(&to_chars(silver0)), QrSegment::make_numeric(&to_chars(silver1)), ]; let qr = QrCode::encode_segments(&segs, QrCodeEcc::Low).unwrap(); print_qr(&qr); // Illustration "golden" let golden0 = "Golden ratio φ = 1."; let golden1 = "6180339887498948482045868343656381177203091798057628621354486227052604628189024497072072041893911374"; let golden2 = "......"; let qr = QrCode::encode_text(&[golden0, golden1, golden2].concat(), QrCodeEcc::Low).unwrap(); print_qr(&qr); let segs = vec![ QrSegment::make_bytes(golden0.as_bytes()), QrSegment::make_numeric(&to_chars(golden1)), QrSegment::make_alphanumeric(&to_chars(golden2)), ]; let qr = QrCode::encode_segments(&segs, QrCodeEcc::Low).unwrap(); print_qr(&qr); // Illustration "Madoka": kanji, kana, Greek, Cyrillic, full-width Latin characters let madoka = "「魔法少女まどか☆マギカ」って、　ИАИ　ｄｅｓｕ　κα？"; let qr = QrCode::encode_text(madoka, QrCodeEcc::Low).unwrap(); print_qr(&qr); let kanjichars: Vec = vec![ // Kanji mode encoding (13 bits per character) 0x0035, 0x1002, 0x0FC0, 0x0AED, 0x0AD7, 0x015C, 0x0147, 0x0129, 0x0059, 0x01BD, 0x018D, 0x018A, 0x0036, 0x0141, 0x0144, 0x0001, 0x0000, 0x0249, 0x0240, 0x0249, 0x0000, 0x0104, 0x0105, 0x0113, 0x0115, 0x0000, 0x0208, 0x01FF, 0x0008, ]; let mut bb = qrcodegen::BitBuffer(Vec::new()); for c in &kanjichars { bb.append_bits(*c, 13); } let segs = vec![ QrSegment::new(qrcodegen::QrSegmentMode::Kanji, kanjichars.len(), bb.0), ]; let qr = QrCode::encode_segments(&segs, QrCodeEcc::Low).unwrap(); print_qr(&qr); } // Creates QR Codes with the same size and contents but different mask patterns. fn do_mask_demo() { // Project Nayuki URL let segs = QrSegment::make_segments(&to_chars("https://www.nayuki.io/")); let qr = QrCode::encode_segments_advanced(&segs, QrCodeEcc::High, QrCode_MIN_VERSION, QrCode_MAX_VERSION, None, true).unwrap(); // Automatic mask print_qr(&qr); let qr = QrCode::encode_segments_advanced(&segs, QrCodeEcc::High, QrCode_MIN_VERSION, QrCode_MAX_VERSION, Some(Mask::new(3)), true).unwrap(); // Force mask 3 print_qr(&qr); // Chinese text as UTF-8 let segs = QrSegment::make_segments(&to_chars("維基百科（Wikipedia，聆聽i/ˌwɪkᵻˈpiːdi.ə/）是一個自由內容、公開編輯且多語言的網路百科全書協作計畫")); let qr = QrCode::encode_segments_advanced(&segs, QrCodeEcc::Medium, QrCode_MIN_VERSION, QrCode_MAX_VERSION, Some(Mask::new(0)), true).unwrap(); // Force mask 0 print_qr(&qr); let qr = QrCode::encode_segments_advanced(&segs, QrCodeEcc::Medium, QrCode_MIN_VERSION, QrCode_MAX_VERSION, Some(Mask::new(1)), true).unwrap(); // Force mask 1 print_qr(&qr); let qr = QrCode::encode_segments_advanced(&segs, QrCodeEcc::Medium, QrCode_MIN_VERSION, QrCode_MAX_VERSION, Some(Mask::new(5)), true).unwrap(); // Force mask 5 print_qr(&qr); let qr = QrCode::encode_segments_advanced(&segs, QrCodeEcc::Medium, QrCode_MIN_VERSION, QrCode_MAX_VERSION, Some(Mask::new(7)), true).unwrap(); // Force mask 7 print_qr(&qr); } /*---- Utilities ----*/ // Prints the given QrCode object to the console. fn print_qr(qr: &QrCode) { let border: i32 = 4; for y in -border .. qr.size() + border { for x in -border .. qr.size() + border { let c: char = if qr.get_module(x, y) { '█' } else { ' ' }; print!("{0}{0}", c); } println!(); } println!(); } // Converts the given borrowed string slice to a new character vector. fn to_chars(text: &str) -> Vec { text.chars().collect() } uTox/third_party/qrcodegen/qrcodegen/rust/Readme.markdown0000600000175000001440000000440514003056224022705 0ustar rakusersQR Code generator library ========================= Introduction ------------ This project aims to be the best, clearest QR Code generator library. The primary goals are flexible options and absolute correctness. Secondary goals are compact implementation size and good documentation comments. Home page with live JavaScript demo, extensive descriptions, and competitor comparisons: https://www.nayuki.io/page/qr-code-generator-library Features -------- Core features: * Available in 6 programming languages, all with nearly equal functionality: Java, JavaScript, Python, C++, C, Rust * Significantly shorter code but more documentation comments compared to competing libraries * Supports encoding all 40 versions (sizes) and all 4 error correction levels, as per the QR Code Model 2 standard * Output formats: Raw modules/pixels of the QR symbol, SVG XML string * Encodes numeric and special-alphanumeric text in less space than general text * Open source code under the permissive MIT License Manual parameters: * User can specify minimum and maximum version numbers allowed, then library will automatically choose smallest version in the range that fits the data * User can specify mask pattern manually, otherwise library will automatically evaluate all 8 masks and select the optimal one * User can specify absolute error correction level, or allow the library to boost it if it doesn't increase the version number * User can create a list of data segments manually and add ECI segments Examples -------- extern crate qrcodegen; use qrcodegen::QrCode; use qrcodegen::QrCodeEcc; use qrcodegen::QrSegment; // Simple operation let qr0 = QrCode::encode_text("Hello, world!", QrCodeEcc::Medium).unwrap(); let svg = qr0.to_svg_string(4); // Manual operation let chrs: Vec = "3141592653589793238462643383".chars().collect(); let segs = QrSegment::make_segments(&chrs); let qr1 = QrCode::encode_segments_advanced( &segs, QrCodeEcc::High, 5, 5, Some(2), false).unwrap(); for y in 0 .. qr1.size() { for x in 0 .. qr1.size() { (... paint qr1.get_module(x, y) ...) } } More complete set of examples: https://github.com/nayuki/QR-Code-generator/blob/master/rust/examples/qrcodegen-demo.rs . uTox/third_party/qrcodegen/qrcodegen/rust/Cargo.toml0000600000175000001440000000062114003056224021670 0ustar rakusers[package] name = "qrcodegen" version = "1.2.1" authors = ["Project Nayuki"] description = "High-quality QR Code generator library" homepage = "https://www.nayuki.io/page/qr-code-generator-library" repository = "https://github.com/nayuki/QR-Code-generator" readme = "Readme.markdown" keywords = ["qr-code", "barcode", "encoder", "image"] categories = ["encoding", "multimedia::images"] license = "MIT" uTox/third_party/qrcodegen/qrcodegen/python/0000700000175000001440000000000014003056224020263 5ustar rakusersuTox/third_party/qrcodegen/qrcodegen/python/setup.py0000600000175000001440000001107014003056224021776 0ustar rakusers# # QR Code generator Distutils script (Python 2, 3) # # Copyright (c) Project Nayuki. (MIT License) # https://www.nayuki.io/page/qr-code-generator-library # # 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 setuptools setuptools.setup( name = "qrcodegen", description = "High quality QR Code generator library for Python 2 and 3", version = "1.2.0", platforms = "OS Independent", license = "MIT License", author = "Project Nayuki", author_email = "me@nayuki.io", url = "https://www.nayuki.io/page/qr-code-generator-library", classifiers = [ "Development Status :: 5 - Production/Stable", "Intended Audience :: Developers", "Intended Audience :: Information Technology", "License :: OSI Approved :: MIT License", "Operating System :: OS Independent", "Programming Language :: Python", "Programming Language :: Python :: 2", "Programming Language :: Python :: 3", "Topic :: Multimedia :: Graphics", "Topic :: Software Development :: Libraries :: Python Modules", ], long_description = """========================= QR Code generator library ========================= Introduction ------------ This project aims to be the best, clearest QR Code generator library. The primary goals are flexible options and absolute correctness. Secondary goals are compact implementation size and good documentation comments. Home page with live JavaScript demo, extensive descriptions, and competitor comparisons: https://www.nayuki.io/page/qr-code-generator-library Features -------- Core features: * Available in 6 programming languages, all with nearly equal functionality: Java, JavaScript, Python, C++, C, Rust * Significantly shorter code but more documentation comments compared to competing libraries * Supports encoding all 40 versions (sizes) and all 4 error correction levels, as per the QR Code Model 2 standard * Output formats: Raw modules/pixels of the QR symbol, SVG XML string * Encodes numeric and special-alphanumeric text in less space than general text * Open source code under the permissive MIT License Manual parameters: * User can specify minimum and maximum version numbers allowed, then library will automatically choose smallest version in the range that fits the data * User can specify mask pattern manually, otherwise library will automatically evaluate all 8 masks and select the optimal one * User can specify absolute error correction level, or allow the library to boost it if it doesn't increase the version number * User can create a list of data segments manually and add ECI segments Usage ----- Install this package by downloading the source code ZIP file from PyPI_, or by running ``pip install qrcodegen``. Examples: from qrcodegen import * # Simple operation qr0 = QrCode.encode_text("Hello, world!", QrCode.Ecc.MEDIUM) svg = qr0.to_svg_str(4) # Manual operation segs = QrSegment.make_segments("3141592653589793238462643383") qr1 = QrCode.encode_segments(segs, QrCode.Ecc.HIGH, 5, 5, 2, False) border = 4 for y in range(-border, qr1.get_size() + border): for x in range(-border, qr1.get_size() + border): color = qr1.get_module(x, y) # False for white, True for black # (... paint the module onto pixels ...) More complete set of examples: https://github.com/nayuki/QR-Code-generator/blob/master/python/qrcodegen-demo.py . API documentation is in the source file itself, with a summary comment at the top: https://github.com/nayuki/QR-Code-generator/blob/master/python/qrcodegen.py . .. _PyPI: https://pypi.python.org/pypi/qrcodegen""", py_modules = ["qrcodegen"], ) uTox/third_party/qrcodegen/qrcodegen/python/setup.cfg0000600000175000001440000000003414003056224022103 0ustar rakusers[bdist_wheel] universal = 1 uTox/third_party/qrcodegen/qrcodegen/python/qrcodegen.py0000600000175000001440000010325714003056224022616 0ustar rakusers# # QR Code generator library (Python 2, 3) # # Copyright (c) Project Nayuki. (MIT License) # https://www.nayuki.io/page/qr-code-generator-library # # 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 itertools, re, sys """ This module "qrcodegen", public members: - Class QrCode: - Function encode_text(str text, QrCode.Ecc ecl) -> QrCode - Function encode_binary(bytes data, QrCode.Ecc ecl) -> QrCode - Function encode_segments(list segs, QrCode.Ecc ecl, int minversion=1, int maxversion=40, mask=-1, boostecl=true) -> QrCode - Constants int MIN_VERSION, MAX_VERSION - Constructor QrCode(bytes datacodewords, int mask, int version, QrCode.Ecc ecl) - Method get_version() -> int - Method get_size() -> int - Method get_error_correction_level() -> QrCode.Ecc - Method get_mask() -> int - Method get_module(int x, int y) -> bool - Method to_svg_str(int border) -> str - Enum Ecc: - Constants LOW, MEDIUM, QUARTILE, HIGH - Field int ordinal - Class QrSegment: - Function make_bytes(bytes data) -> QrSegment - Function make_numeric(str digits) -> QrSegment - Function make_alphanumeric(str text) -> QrSegment - Function make_segments(str text) -> list - Function make_eci(int assignval) -> QrSegment - Constructor QrSegment(QrSegment.Mode mode, int numch, list bitdata) - Method get_mode() -> QrSegment.Mode - Method get_num_chars() -> int - Method get_bits() -> list - Constants regex NUMERIC_REGEX, ALPHANUMERIC_REGEX - Enum Mode: - Constants NUMERIC, ALPHANUMERIC, BYTE, KANJI, ECI """ # ---- QR Code symbol class ---- class QrCode(object): """Represents an immutable square grid of black or white cells for a QR Code symbol. This class covers the QR Code model 2 specification, supporting all versions (sizes) from 1 to 40, all 4 error correction levels.""" # ---- Public static factory functions ---- @staticmethod def encode_text(text, ecl): """Returns a QR Code symbol representing the specified Unicode text string at the specified error correction level. As a conservative upper bound, this function is guaranteed to succeed for strings that have 738 or fewer Unicode code points (not UTF-16 code units) if the low error correction level is used. The smallest possible QR Code version is automatically chosen for the output. The ECC level of the result may be higher than the ecl argument if it can be done without increasing the version.""" segs = QrSegment.make_segments(text) return QrCode.encode_segments(segs, ecl) @staticmethod def encode_binary(data, ecl): """Returns a QR Code symbol representing the given binary data string at the given error correction level. This function always encodes using the binary segment mode, not any text mode. The maximum number of bytes allowed is 2953. The smallest possible QR Code version is automatically chosen for the output. The ECC level of the result may be higher than the ecl argument if it can be done without increasing the version.""" if not isinstance(data, (bytes, bytearray)): raise TypeError("Byte string/list expected") return QrCode.encode_segments([QrSegment.make_bytes(data)], ecl) @staticmethod def encode_segments(segs, ecl, minversion=1, maxversion=40, mask=-1, boostecl=True): """Returns a QR Code symbol representing the given data segments with the given encoding parameters. The smallest possible QR Code version within the given range is automatically chosen for the output. This function allows the user to create a custom sequence of segments that switches between modes (such as alphanumeric and binary) to encode text more efficiently. This function is considered to be lower level than simply encoding text or binary data.""" if not (QrCode.MIN_VERSION <= minversion <= maxversion <= QrCode.MAX_VERSION) or not (-1 <= mask <= 7): raise ValueError("Invalid value") # Find the minimal version number to use for version in range(minversion, maxversion + 1): datacapacitybits = QrCode._get_num_data_codewords(version, ecl) * 8 # Number of data bits available datausedbits = QrSegment.get_total_bits(segs, version) if datausedbits is not None and datausedbits <= datacapacitybits: break # This version number is found to be suitable if version >= maxversion: # All versions in the range could not fit the given data raise ValueError("Data too long") if datausedbits is None: raise AssertionError() # Increase the error correction level while the data still fits in the current version number for newecl in (QrCode.Ecc.MEDIUM, QrCode.Ecc.QUARTILE, QrCode.Ecc.HIGH): if boostecl and datausedbits <= QrCode._get_num_data_codewords(version, newecl) * 8: ecl = newecl # Create the data bit string by concatenating all segments datacapacitybits = QrCode._get_num_data_codewords(version, ecl) * 8 bb = _BitBuffer() for seg in segs: bb.append_bits(seg.get_mode().get_mode_bits(), 4) bb.append_bits(seg.get_num_chars(), seg.get_mode().num_char_count_bits(version)) bb.extend(seg._bitdata) # Add terminator and pad up to a byte if applicable bb.append_bits(0, min(4, datacapacitybits - len(bb))) bb.append_bits(0, -len(bb) % 8) # Note: Python's modulo on negative numbers behaves better than C family languages # Pad with alternate bytes until data capacity is reached for padbyte in itertools.cycle((0xEC, 0x11)): if len(bb) >= datacapacitybits: break bb.append_bits(padbyte, 8) assert len(bb) % 8 == 0 # Create the QR Code symbol return QrCode(bb.get_bytes(), mask, version, ecl) # ---- Public constants ---- MIN_VERSION = 1 MAX_VERSION = 40 # ---- Constructor ---- def __init__(self, datacodewords, mask, version, errcorlvl): """Creates a new QR Code symbol with the given version number, error correction level, binary data array, and mask number. mask = -1 is for automatic choice, or 0 to 7 for fixed choice. This is a cumbersome low-level constructor that should not be invoked directly by the user. To go one level up, see the QrCode.encode_segments() function.""" # Check arguments and handle simple scalar fields if not (-1 <= mask <= 7): raise ValueError("Mask value out of range") if not (QrCode.MIN_VERSION <= version <= QrCode.MAX_VERSION): raise ValueError("Version value out of range") if not isinstance(errcorlvl, QrCode.Ecc): raise TypeError("QrCode.Ecc expected") self._version = version self._errcorlvl = errcorlvl self._size = version * 4 + 17 if len(datacodewords) != QrCode._get_num_data_codewords(version, errcorlvl): raise ValueError("Invalid array length") # Initialize grids of modules self._modules = [[False] * self._size for _ in range(self._size)] # The modules of the QR symbol; start with entirely white grid self._isfunction = [[False] * self._size for _ in range(self._size)] # Indicates function modules that are not subjected to masking # Draw function patterns, draw all codewords self._draw_function_patterns() allcodewords = self._append_error_correction(datacodewords) self._draw_codewords(allcodewords) # Handle masking if mask == -1: # Automatically choose best mask minpenalty = 1 << 32 for i in range(8): self._draw_format_bits(i) self._apply_mask(i) penalty = self._get_penalty_score() if penalty < minpenalty: mask = i minpenalty = penalty self._apply_mask(i) # Undoes the mask due to XOR assert 0 <= mask <= 7 self._draw_format_bits(mask) # Overwrite old format bits self._apply_mask(mask) # Apply the final choice of mask self._mask = mask # ---- Accessor methods ---- def get_version(self): """Returns this QR Code symbol's version number, which is always between 1 and 40 (inclusive).""" return self._version def get_size(self): """Returns the width and height of this QR Code symbol, measured in modules. Always equal to version * 4 + 17, in the range 21 to 177.""" return self._size def get_error_correction_level(self): """Returns the error correction level used in this QR Code symbol.""" return self._errcorlvl def get_mask(self): """Returns the mask pattern used in this QR Code symbol, in the range 0 to 7 (i.e. unsigned 3-bit integer). Note that even if a constructor was called with automatic masking requested (mask = -1), the resulting object will still have a mask value between 0 and 7.""" return self._mask def get_module(self, x, y): """Returns the color of the module (pixel) at the given coordinates, which is either False for white or True for black. The top left corner has the coordinates (x=0, y=0). If the given coordinates are out of bounds, then False (white) is returned.""" return (0 <= x < self._size) and (0 <= y < self._size) and self._modules[y][x] # ---- Public instance methods ---- def to_svg_str(self, border): """Based on the given number of border modules to add as padding, this returns a string whose contents represents an SVG XML file that depicts this QR Code symbol.""" if border < 0: raise ValueError("Border must be non-negative") parts = [] for y in range(-border, self._size + border): for x in range(-border, self._size + border): if self.get_module(x, y): parts.append("M{},{}h1v1h-1z".format(x + border, y + border)) return """ """.format(self._size + border * 2, " ".join(parts)) # ---- Private helper methods for constructor: Drawing function modules ---- def _draw_function_patterns(self): # Draw horizontal and vertical timing patterns for i in range(self._size): self._set_function_module(6, i, i % 2 == 0) self._set_function_module(i, 6, i % 2 == 0) # Draw 3 finder patterns (all corners except bottom right; overwrites some timing modules) self._draw_finder_pattern(3, 3) self._draw_finder_pattern(self._size - 4, 3) self._draw_finder_pattern(3, self._size - 4) # Draw numerous alignment patterns alignpatpos = QrCode._get_alignment_pattern_positions(self._version) numalign = len(alignpatpos) skips = ((0, 0), (0, numalign - 1), (numalign - 1, 0)) # Skip the three finder corners for i in range(numalign): for j in range(numalign): if (i, j) not in skips: self._draw_alignment_pattern(alignpatpos[i], alignpatpos[j]) # Draw configuration data self._draw_format_bits(0) # Dummy mask value; overwritten later in the constructor self._draw_version() def _draw_format_bits(self, mask): """Draws two copies of the format bits (with its own error correction code) based on the given mask and this object's error correction level field.""" # Calculate error correction code and pack bits data = self._errcorlvl.formatbits << 3 | mask # errCorrLvl is uint2, mask is uint3 rem = data for _ in range(10): rem = (rem << 1) ^ ((rem >> 9) * 0x537) data = data << 10 | rem data ^= 0x5412 # uint15 assert data >> 15 == 0 # Draw first copy for i in range(0, 6): self._set_function_module(8, i, (data >> i) & 1 != 0) self._set_function_module(8, 7, (data >> 6) & 1 != 0) self._set_function_module(8, 8, (data >> 7) & 1 != 0) self._set_function_module(7, 8, (data >> 8) & 1 != 0) for i in range(9, 15): self._set_function_module(14 - i, 8, (data >> i) & 1 != 0) # Draw second copy for i in range(0, 8): self._set_function_module(self._size - 1 - i, 8, (data >> i) & 1 != 0) for i in range(8, 15): self._set_function_module(8, self._size - 15 + i, (data >> i) & 1 != 0) self._set_function_module(8, self._size - 8, True) def _draw_version(self): """Draws two copies of the version bits (with its own error correction code), based on this object's version field (which only has an effect for 7 <= version <= 40).""" if self._version < 7: return # Calculate error correction code and pack bits rem = self._version # version is uint6, in the range [7, 40] for _ in range(12): rem = (rem << 1) ^ ((rem >> 11) * 0x1F25) data = self._version << 12 | rem # uint18 assert data >> 18 == 0 # Draw two copies for i in range(18): bit = (data >> i) & 1 != 0 a, b = self._size - 11 + i % 3, i // 3 self._set_function_module(a, b, bit) self._set_function_module(b, a, bit) def _draw_finder_pattern(self, x, y): """Draws a 9*9 finder pattern including the border separator, with the center module at (x, y).""" for i in range(-4, 5): for j in range(-4, 5): xx, yy = x + j, y + i if (0 <= xx < self._size) and (0 <= yy < self._size): # Chebyshev/infinity norm self._set_function_module(xx, yy, max(abs(i), abs(j)) not in (2, 4)) def _draw_alignment_pattern(self, x, y): """Draws a 5*5 alignment pattern, with the center module at (x, y).""" for i in range(-2, 3): for j in range(-2, 3): self._set_function_module(x + j, y + i, max(abs(i), abs(j)) != 1) def _set_function_module(self, x, y, isblack): """Sets the color of a module and marks it as a function module. Only used by the constructor. Coordinates must be in range.""" assert type(isblack) is bool self._modules[y][x] = isblack self._isfunction[y][x] = True # ---- Private helper methods for constructor: Codewords and masking ---- def _append_error_correction(self, data): """Returns a new byte string representing the given data with the appropriate error correction codewords appended to it, based on this object's version and error correction level.""" version = self._version assert len(data) == QrCode._get_num_data_codewords(version, self._errcorlvl) # Calculate parameter numbers numblocks = QrCode._NUM_ERROR_CORRECTION_BLOCKS[self._errcorlvl.ordinal][version] blockecclen = QrCode._ECC_CODEWORDS_PER_BLOCK[self._errcorlvl.ordinal][version] rawcodewords = QrCode._get_num_raw_data_modules(version) // 8 numshortblocks = numblocks - rawcodewords % numblocks shortblocklen = rawcodewords // numblocks # Split data into blocks and append ECC to each block blocks = [] rs = _ReedSolomonGenerator(blockecclen) k = 0 for i in range(numblocks): dat = data[k : k + shortblocklen - blockecclen + (0 if i < numshortblocks else 1)] k += len(dat) ecc = rs.get_remainder(dat) if i < numshortblocks: dat.append(0) dat.extend(ecc) blocks.append(dat) assert k == len(data) # Interleave (not concatenate) the bytes from every block into a single sequence result = [] for i in range(len(blocks[0])): for (j, blk) in enumerate(blocks): # Skip the padding byte in short blocks if i != shortblocklen - blockecclen or j >= numshortblocks: result.append(blk[i]) assert len(result) == rawcodewords return result def _draw_codewords(self, data): """Draws the given sequence of 8-bit codewords (data and error correction) onto the entire data area of this QR Code symbol. Function modules need to be marked off before this is called.""" assert len(data) == QrCode._get_num_raw_data_modules(self._version) // 8 i = 0 # Bit index into the data # Do the funny zigzag scan for right in range(self._size - 1, 0, -2): # Index of right column in each column pair if right <= 6: right -= 1 for vert in range(self._size): # Vertical counter for j in range(2): x = right - j # Actual x coordinate upward = (right + 1) & 2 == 0 y = (self._size - 1 - vert) if upward else vert # Actual y coordinate if not self._isfunction[y][x] and i < len(data) * 8: self._modules[y][x] = (data[i >> 3] >> (7 - (i & 7))) & 1 != 0 i += 1 # If there are any remainder bits (0 to 7), they are already # set to 0/false/white when the grid of modules was initialized assert i == len(data) * 8 def _apply_mask(self, mask): """XORs the data modules in this QR Code with the given mask pattern. Due to XOR's mathematical properties, calling applyMask(m) twice with the same value is equivalent to no change at all. This means it is possible to apply a mask, undo it, and try another mask. Note that a final well-formed QR Code symbol needs exactly one mask applied (not zero, not two, etc.).""" if not (0 <= mask <= 7): raise ValueError("Mask value out of range") masker = QrCode._MASK_PATTERNS[mask] for y in range(self._size): for x in range(self._size): self._modules[y][x] ^= (masker(x, y) == 0) and (not self._isfunction[y][x]) def _get_penalty_score(self): """Calculates and returns the penalty score based on state of this QR Code's current modules. This is used by the automatic mask choice algorithm to find the mask pattern that yields the lowest score.""" result = 0 size = self._size modules = self._modules # Adjacent modules in row having same color for y in range(size): for x in range(size): if x == 0 or modules[y][x] != colorx: colorx = modules[y][x] runx = 1 else: runx += 1 if runx == 5: result += QrCode._PENALTY_N1 elif runx > 5: result += 1 # Adjacent modules in column having same color for x in range(size): for y in range(size): if y == 0 or modules[y][x] != colory: colory = modules[y][x] runy = 1 else: runy += 1 if runy == 5: result += QrCode._PENALTY_N1 elif runy > 5: result += 1 # 2*2 blocks of modules having same color for y in range(size - 1): for x in range(size - 1): if modules[y][x] == modules[y][x + 1] == modules[y + 1][x] == modules[y + 1][x + 1]: result += QrCode._PENALTY_N2 # Finder-like pattern in rows for y in range(size): bits = 0 for x in range(size): bits = ((bits << 1) & 0x7FF) | (1 if modules[y][x] else 0) if x >= 10 and bits in (0x05D, 0x5D0): # Needs 11 bits accumulated result += QrCode._PENALTY_N3 # Finder-like pattern in columns for x in range(size): bits = 0 for y in range(size): bits = ((bits << 1) & 0x7FF) | (1 if modules[y][x] else 0) if y >= 10 and bits in (0x05D, 0x5D0): # Needs 11 bits accumulated result += QrCode._PENALTY_N3 # Balance of black and white modules black = sum((1 if cell else 0) for row in modules for cell in row) total = size**2 # Find smallest k such that (45-5k)% <= dark/total <= (55+5k)% for k in itertools.count(): if (9-k)*total <= black*20 <= (11+k)*total: break result += QrCode._PENALTY_N4 return result # ---- Private static helper functions ---- @staticmethod def _get_alignment_pattern_positions(ver): """Returns a sequence of positions of the alignment patterns in ascending order. These positions are used on both the x and y axes. Each value in the resulting sequence is in the range [0, 177). This stateless pure function could be implemented as table of 40 variable-length lists of integers.""" if not (QrCode.MIN_VERSION <= ver <= QrCode.MAX_VERSION): raise ValueError("Version number out of range") elif ver == 1: return [] else: numalign = ver // 7 + 2 if ver != 32: # ceil((size - 13) / (2*numalign - 2)) * 2 step = (ver * 4 + numalign * 2 + 1) // (2 * numalign - 2) * 2 else: # C-C-C-Combo breaker! step = 26 result = [6] pos = ver * 4 + 10 for _ in range(numalign - 1): result.insert(1, pos) pos -= step return result @staticmethod def _get_num_raw_data_modules(ver): """Returns the number of data bits that can be stored in a QR Code of the given version number, after all function modules are excluded. This includes remainder bits, so it might not be a multiple of 8. The result is in the range [208, 29648]. This could be implemented as a 40-entry lookup table.""" if not (QrCode.MIN_VERSION <= ver <= QrCode.MAX_VERSION): raise ValueError("Version number out of range") result = (16 * ver + 128) * ver + 64 if ver >= 2: numalign = ver // 7 + 2 result -= (25 * numalign - 10) * numalign - 55 if ver >= 7: result -= 18 * 2 # Subtract version information return result @staticmethod def _get_num_data_codewords(ver, ecl): """Returns the number of 8-bit data (i.e. not error correction) codewords contained in any QR Code of the given version number and error correction level, with remainder bits discarded. This stateless pure function could be implemented as a (40*4)-cell lookup table.""" if not (QrCode.MIN_VERSION <= ver <= QrCode.MAX_VERSION): raise ValueError("Version number out of range") return QrCode._get_num_raw_data_modules(ver) // 8 \ - QrCode._ECC_CODEWORDS_PER_BLOCK[ecl.ordinal][ver] \ * QrCode._NUM_ERROR_CORRECTION_BLOCKS[ecl.ordinal][ver] # ---- Private tables of constants ---- # For use in getPenaltyScore(), when evaluating which mask is best. _PENALTY_N1 = 3 _PENALTY_N2 = 3 _PENALTY_N3 = 40 _PENALTY_N4 = 10 _ECC_CODEWORDS_PER_BLOCK = ( # Version: (note that index 0 is for padding, and is set to an illegal value) # 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40 Error correction level (None, 7, 10, 15, 20, 26, 18, 20, 24, 30, 18, 20, 24, 26, 30, 22, 24, 28, 30, 28, 28, 28, 28, 30, 30, 26, 28, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30), # Low (None, 10, 16, 26, 18, 24, 16, 18, 22, 22, 26, 30, 22, 22, 24, 24, 28, 28, 26, 26, 26, 26, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28), # Medium (None, 13, 22, 18, 26, 18, 24, 18, 22, 20, 24, 28, 26, 24, 20, 30, 24, 28, 28, 26, 30, 28, 30, 30, 30, 30, 28, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30), # Quartile (None, 17, 28, 22, 16, 22, 28, 26, 26, 24, 28, 24, 28, 22, 24, 24, 30, 28, 28, 26, 28, 30, 24, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30)) # High _NUM_ERROR_CORRECTION_BLOCKS = ( # Version: (note that index 0 is for padding, and is set to an illegal value) # 0, 1, 2, 3, 4, 5, 6, 7, 8, 9,10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40 Error correction level (None, 1, 1, 1, 1, 1, 2, 2, 2, 2, 4, 4, 4, 4, 4, 6, 6, 6, 6, 7, 8, 8, 9, 9, 10, 12, 12, 12, 13, 14, 15, 16, 17, 18, 19, 19, 20, 21, 22, 24, 25), # Low (None, 1, 1, 1, 2, 2, 4, 4, 4, 5, 5, 5, 8, 9, 9, 10, 10, 11, 13, 14, 16, 17, 17, 18, 20, 21, 23, 25, 26, 28, 29, 31, 33, 35, 37, 38, 40, 43, 45, 47, 49), # Medium (None, 1, 1, 2, 2, 4, 4, 6, 6, 8, 8, 8, 10, 12, 16, 12, 17, 16, 18, 21, 20, 23, 23, 25, 27, 29, 34, 34, 35, 38, 40, 43, 45, 48, 51, 53, 56, 59, 62, 65, 68), # Quartile (None, 1, 1, 2, 4, 4, 4, 5, 6, 8, 8, 11, 11, 16, 16, 18, 16, 19, 21, 25, 25, 25, 34, 30, 32, 35, 37, 40, 42, 45, 48, 51, 54, 57, 60, 63, 66, 70, 74, 77, 81)) # High _MASK_PATTERNS = ( (lambda x, y: (x + y) % 2 ), (lambda x, y: y % 2 ), (lambda x, y: x % 3 ), (lambda x, y: (x + y) % 3 ), (lambda x, y: (x // 3 + y // 2) % 2 ), (lambda x, y: x * y % 2 + x * y % 3 ), (lambda x, y: (x * y % 2 + x * y % 3) % 2 ), (lambda x, y: ((x + y) % 2 + x * y % 3) % 2), ) # ---- Public helper enumeration ---- class Ecc(object): """Represents the error correction level used in a QR Code symbol.""" # Private constructor def __init__(self, i, fb): self.ordinal = i # (Public) In the range 0 to 3 (unsigned 2-bit integer) self.formatbits = fb # (Package-private) In the range 0 to 3 (unsigned 2-bit integer) # Public constants. Create them outside the class. Ecc.LOW = Ecc(0, 1) Ecc.MEDIUM = Ecc(1, 0) Ecc.QUARTILE = Ecc(2, 3) Ecc.HIGH = Ecc(3, 2) # ---- Data segment class ---- class QrSegment(object): """Represents a character string to be encoded in a QR Code symbol. Each segment has a mode, and a sequence of characters that is already encoded as a sequence of bits. Instances of this class are immutable. This segment class imposes no length restrictions, but QR Codes have restrictions. Even in the most favorable conditions, a QR Code can only hold 7089 characters of data. Any segment longer than this is meaningless for the purpose of generating QR Codes.""" # ---- Public static factory functions ---- @staticmethod def make_bytes(data): """Returns a segment representing the given binary data encoded in byte mode.""" py3 = sys.version_info.major >= 3 if (py3 and isinstance(data, str)) or (not py3 and isinstance(data, unicode)): raise TypeError("Byte string/list expected") if not py3 and isinstance(data, str): data = bytearray(data) bb = _BitBuffer() for b in data: bb.append_bits(b, 8) return QrSegment(QrSegment.Mode.BYTE, len(data), bb) @staticmethod def make_numeric(digits): """Returns a segment representing the given string of decimal digits encoded in numeric mode.""" if QrSegment.NUMERIC_REGEX.match(digits) is None: raise ValueError("String contains non-numeric characters") bb = _BitBuffer() for i in range(0, len(digits) - 2, 3): # Process groups of 3 bb.append_bits(int(digits[i : i + 3]), 10) rem = len(digits) % 3 if rem > 0: # 1 or 2 digits remaining bb.append_bits(int(digits[-rem : ]), rem * 3 + 1) return QrSegment(QrSegment.Mode.NUMERIC, len(digits), bb) @staticmethod def make_alphanumeric(text): """Returns a segment representing the given text string encoded in alphanumeric mode. The characters allowed are: 0 to 9, A to Z (uppercase only), space, dollar, percent, asterisk, plus, hyphen, period, slash, colon.""" if QrSegment.ALPHANUMERIC_REGEX.match(text) is None: raise ValueError("String contains unencodable characters in alphanumeric mode") bb = _BitBuffer() for i in range(0, len(text) - 1, 2): # Process groups of 2 temp = QrSegment._ALPHANUMERIC_ENCODING_TABLE[text[i]] * 45 temp += QrSegment._ALPHANUMERIC_ENCODING_TABLE[text[i + 1]] bb.append_bits(temp, 11) if len(text) % 2 > 0: # 1 character remaining bb.append_bits(QrSegment._ALPHANUMERIC_ENCODING_TABLE[text[-1]], 6) return QrSegment(QrSegment.Mode.ALPHANUMERIC, len(text), bb) @staticmethod def make_segments(text): """Returns a new mutable list of zero or more segments to represent the given Unicode text string. The result may use various segment modes and switch modes to optimize the length of the bit stream.""" if not (isinstance(text, str) or (sys.version_info.major < 3 and isinstance(text, unicode))): raise TypeError("Text string expected") # Select the most efficient segment encoding automatically if text == "": return [] elif QrSegment.NUMERIC_REGEX.match(text) is not None: return [QrSegment.make_numeric(text)] elif QrSegment.ALPHANUMERIC_REGEX.match(text) is not None: return [QrSegment.make_alphanumeric(text)] else: return [QrSegment.make_bytes(text.encode("UTF-8"))] @staticmethod def make_eci(assignval): """Returns a segment representing an Extended Channel Interpretation (ECI) designator with the given assignment value.""" bb = _BitBuffer() if 0 <= assignval < (1 << 7): bb.append_bits(assignval, 8) elif (1 << 7) <= assignval < (1 << 14): bb.append_bits(2, 2) bb.append_bits(assignval, 14) elif (1 << 14) <= assignval < 1000000: bb.append_bits(6, 3) bb.append_bits(assignval, 21) else: raise ValueError("ECI assignment value out of range") return QrSegment(QrSegment.Mode.ECI, 0, bb) # ---- Constructor ---- def __init__(self, mode, numch, bitdata): if numch < 0 or not isinstance(mode, QrSegment.Mode): raise ValueError() self._mode = mode self._numchars = numch self._bitdata = list(bitdata) # Make defensive copy # ---- Accessor methods ---- def get_mode(self): return self._mode def get_num_chars(self): return self._numchars def get_bits(self): return list(self._bitdata) # Make defensive copy # Package-private helper function. @staticmethod def get_total_bits(segs, version): if not (QrCode.MIN_VERSION <= version <= QrCode.MAX_VERSION): raise ValueError("Version number out of range") result = 0 for seg in segs: ccbits = seg.get_mode().num_char_count_bits(version) # Fail if segment length value doesn't fit in the length field's bit-width if seg.get_num_chars() >= (1 << ccbits): return None result += 4 + ccbits + len(seg._bitdata) return result # ---- Constants ---- # (Public) Can test whether a string is encodable in numeric mode (such as by using make_numeric()) NUMERIC_REGEX = re.compile(r"[0-9]*\Z") # (Public) Can test whether a string is encodable in alphanumeric mode (such as by using make_alphanumeric()) ALPHANUMERIC_REGEX = re.compile(r"[A-Z0-9 $%*+./:-]*\Z") # (Private) Dictionary of "0"->0, "A"->10, "$"->37, etc. _ALPHANUMERIC_ENCODING_TABLE = {ch: i for (i, ch) in enumerate("0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ $%*+-./:")} # ---- Public helper enumeration ---- class Mode(object): """The mode field of a segment. Immutable.""" # Private constructor def __init__(self, modebits, charcounts): self._modebits = modebits self._charcounts = charcounts # Package-private method def get_mode_bits(self): """Returns an unsigned 4-bit integer value (range 0 to 15) representing the mode indicator bits for this mode object.""" return self._modebits # Package-private method def num_char_count_bits(self, ver): """Returns the bit width of the segment character count field for this mode object at the given version number.""" if 1 <= ver <= 9: return self._charcounts[0] elif 10 <= ver <= 26: return self._charcounts[1] elif 27 <= ver <= 40: return self._charcounts[2] else: raise ValueError("Version number out of range") # Public constants. Create them outside the class. Mode.NUMERIC = Mode(0x1, (10, 12, 14)) Mode.ALPHANUMERIC = Mode(0x2, ( 9, 11, 13)) Mode.BYTE = Mode(0x4, ( 8, 16, 16)) Mode.KANJI = Mode(0x8, ( 8, 10, 12)) Mode.ECI = Mode(0x7, ( 0, 0, 0)) # ---- Private helper classes ---- class _ReedSolomonGenerator(object): """Computes the Reed-Solomon error correction codewords for a sequence of data codewords at a given degree. Objects are immutable, and the state only depends on the degree. This class exists because each data block in a QR Code shares the same the divisor polynomial.""" def __init__(self, degree): """Creates a Reed-Solomon ECC generator for the given degree. This could be implemented as a lookup table over all possible parameter values, instead of as an algorithm.""" if degree < 1 or degree > 255: raise ValueError("Degree out of range") # Start with the monomial x^0 self.coefficients = [0] * (degree - 1) + [1] # Compute the product polynomial (x - r^0) * (x - r^1) * (x - r^2) * ... * (x - r^{degree-1}), # drop the highest term, and store the rest of the coefficients in order of descending powers. # Note that r = 0x02, which is a generator element of this field GF(2^8/0x11D). root = 1 for _ in range(degree): # Unused variable i # Multiply the current product by (x - r^i) for j in range(degree): self.coefficients[j] = _ReedSolomonGenerator._multiply(self.coefficients[j], root) if j + 1 < degree: self.coefficients[j] ^= self.coefficients[j + 1] root = _ReedSolomonGenerator._multiply(root, 0x02) def get_remainder(self, data): """Computes and returns the Reed-Solomon error correction codewords for the given sequence of data codewords. The returned object is always a new byte list. This method does not alter this object's state (because it is immutable).""" # Compute the remainder by performing polynomial division result = [0] * len(self.coefficients) for b in data: factor = b ^ result.pop(0) result.append(0) for i in range(len(result)): result[i] ^= _ReedSolomonGenerator._multiply(self.coefficients[i], factor) return result @staticmethod def _multiply(x, y): """Returns the product of the two given field elements modulo GF(2^8/0x11D). The arguments and result are unsigned 8-bit integers. This could be implemented as a lookup table of 256*256 entries of uint8.""" if x >> 8 != 0 or y >> 8 != 0: raise ValueError("Byte out of range") # Russian peasant multiplication z = 0 for i in reversed(range(8)): z = (z << 1) ^ ((z >> 7) * 0x11D) z ^= ((y >> i) & 1) * x assert z >> 8 == 0 return z class _BitBuffer(list): """An appendable sequence of bits (0's and 1's).""" def get_bytes(self): """Packs this buffer's bits into bytes in big endian, padding with '0' bit values, and returns the new list.""" result = [0] * ((len(self) + 7) // 8) for (i, bit) in enumerate(self): result[i >> 3] |= bit << (7 - (i & 7)) return result def append_bits(self, val, n): """Appends the given number of low bits of the given value to this sequence. Requires 0 <= val < 2^n.""" if n < 0 or val >> n != 0: raise ValueError("Value out of range") self.extend(((val >> i) & 1) for i in reversed(range(n))) uTox/third_party/qrcodegen/qrcodegen/python/qrcodegen-worker.py0000600000175000001440000000556114003056224024124 0ustar rakusers# # QR Code generator test worker (Python 2, 3) # # This program reads data and encoding parameters from standard input and writes # QR Code bitmaps to standard output. The I/O format is one integer per line. # Run with no command line arguments. The program is intended for automated # batch testing of end-to-end functionality of this QR Code generator library. # # Copyright (c) Project Nayuki. (MIT License) # https://www.nayuki.io/page/qr-code-generator-library # # 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. # from __future__ import print_function import sys import qrcodegen py3 = sys.version_info.major >= 3 def read_int(): return int((input if py3 else raw_input)()) def main(): while True: # Read data or exit length = read_int() if length == -1: break data = [read_int() for _ in range(length)] # Read encoding parameters errcorlvl = read_int() minversion = read_int() maxversion = read_int() mask = read_int() boostecl = read_int() # Make segments for encoding if all((b < 128) for b in data): # Is ASCII segs = qrcodegen.QrSegment.make_segments("".join(chr(b) for b in data)) elif py3: segs = [qrcodegen.QrSegment.make_bytes(bytes(data))] else: segs = [qrcodegen.QrSegment.make_bytes("".join(chr(b) for b in data))] try: # Try to make QR Code symbol qr = qrcodegen.QrCode.encode_segments(segs, ECC_LEVELS[errcorlvl], minversion, maxversion, mask, boostecl != 0) # Print grid of modules print(qr.get_version()) for y in range(qr.get_size()): for x in range(qr.get_size()): print(1 if qr.get_module(x, y) else 0) except ValueError as e: if e.args[0] != "Data too long": raise print(-1) sys.stdout.flush() ECC_LEVELS = ( qrcodegen.QrCode.Ecc.LOW, qrcodegen.QrCode.Ecc.MEDIUM, qrcodegen.QrCode.Ecc.QUARTILE, qrcodegen.QrCode.Ecc.HIGH, ) if __name__ == "__main__": main() uTox/third_party/qrcodegen/qrcodegen/python/qrcodegen-demo.py0000600000175000001440000001673114003056224023540 0ustar rakusers# # QR Code generator demo (Python 2, 3) # # Run this command-line program with no arguments. The program computes a bunch of demonstration # QR Codes and prints them to the console. Also, the SVG code for one QR Code is printed as a sample. # # Copyright (c) Project Nayuki. (MIT License) # https://www.nayuki.io/page/qr-code-generator-library # # 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. # from __future__ import print_function from qrcodegen import QrCode, QrSegment def main(): """The main application program.""" do_basic_demo() do_variety_demo() do_segment_demo() do_mask_demo() # ---- Demo suite ---- def do_basic_demo(): """Creates a single QR Code, then prints it to the console.""" text = u"Hello, world!" # User-supplied Unicode text errcorlvl = QrCode.Ecc.LOW # Error correction level # Make and print the QR Code symbol qr = QrCode.encode_text(text, errcorlvl) print_qr(qr) print(qr.to_svg_str(4)) def do_variety_demo(): """Creates a variety of QR Codes that exercise different features of the library, and prints each one to the console.""" # Numeric mode encoding (3.33 bits per digit) qr = QrCode.encode_text("314159265358979323846264338327950288419716939937510", QrCode.Ecc.MEDIUM) print_qr(qr) # Alphanumeric mode encoding (5.5 bits per character) qr = QrCode.encode_text("DOLLAR-AMOUNT:$39.87 PERCENTAGE:100.00% OPERATIONS:+-*/", QrCode.Ecc.HIGH) print_qr(qr) # Unicode text as UTF-8 qr = QrCode.encode_text(u"\u3053\u3093\u306B\u3061\u0077\u0061\u3001\u4E16\u754C\uFF01\u0020\u03B1\u03B2\u03B3\u03B4", QrCode.Ecc.QUARTILE) print_qr(qr) # Moderately large QR Code using longer text (from Lewis Carroll's Alice in Wonderland) qr = QrCode.encode_text( "Alice was beginning to get very tired of sitting by her sister on the bank, " "and of having nothing to do: once or twice she had peeped into the book her sister was reading, " "but it had no pictures or conversations in it, 'and what is the use of a book,' thought Alice " "'without pictures or conversations?' So she was considering in her own mind (as well as she could, " "for the hot day made her feel very sleepy and stupid), whether the pleasure of making a " "daisy-chain would be worth the trouble of getting up and picking the daisies, when suddenly " "a White Rabbit with pink eyes ran close by her.", QrCode.Ecc.HIGH) print_qr(qr) def do_segment_demo(): """Creates QR Codes with manually specified segments for better compactness.""" # Illustration "silver" silver0 = "THE SQUARE ROOT OF 2 IS 1." silver1 = "41421356237309504880168872420969807856967187537694807317667973799" qr = QrCode.encode_text(silver0 + silver1, QrCode.Ecc.LOW) print_qr(qr) segs = [ QrSegment.make_alphanumeric(silver0), QrSegment.make_numeric(silver1)] qr = QrCode.encode_segments(segs, QrCode.Ecc.LOW) print_qr(qr) # Illustration "golden" golden0 = u"Golden ratio \u03C6 = 1." golden1 = u"6180339887498948482045868343656381177203091798057628621354486227052604628189024497072072041893911374" golden2 = u"......" qr = QrCode.encode_text(golden0 + golden1 + golden2, QrCode.Ecc.LOW) print_qr(qr) segs = [ QrSegment.make_bytes(golden0.encode("UTF-8")), QrSegment.make_numeric(golden1), QrSegment.make_alphanumeric(golden2)] qr = QrCode.encode_segments(segs, QrCode.Ecc.LOW) print_qr(qr) # Illustration "Madoka": kanji, kana, Greek, Cyrillic, full-width Latin characters madoka = u"\u300C\u9B54\u6CD5\u5C11\u5973\u307E\u3069\u304B\u2606\u30DE\u30AE\u30AB\u300D\u3063\u3066\u3001\u3000\u0418\u0410\u0418\u3000\uFF44\uFF45\uFF53\uFF55\u3000\u03BA\u03B1\uFF1F" qr = QrCode.encode_text(madoka, QrCode.Ecc.LOW) print_qr(qr) kanjiCharBits = [ # Kanji mode encoding (13 bits per character) 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, ] segs = [QrSegment(QrSegment.Mode.KANJI, len(kanjiCharBits) // 13, kanjiCharBits)] qr = QrCode.encode_segments(segs, QrCode.Ecc.LOW) print_qr(qr) def do_mask_demo(): """Creates QR Codes with the same size and contents but different mask patterns.""" # Project Nayuki URL segs = QrSegment.make_segments("https://www.nayuki.io/") print_qr(QrCode.encode_segments(segs, QrCode.Ecc.HIGH, mask=-1)) # Automatic mask print_qr(QrCode.encode_segments(segs, QrCode.Ecc.HIGH, mask=3)) # Force mask 3 # Chinese text as UTF-8 segs = QrSegment.make_segments( u"\u7DAD\u57FA\u767E\u79D1\uFF08\u0057\u0069\u006B\u0069\u0070\u0065\u0064\u0069\u0061\uFF0C" "\u8046\u807D\u0069\u002F\u02CC\u0077\u026A\u006B\u1D7B\u02C8\u0070\u0069\u02D0\u0064\u0069" "\u002E\u0259\u002F\uFF09\u662F\u4E00\u500B\u81EA\u7531\u5167\u5BB9\u3001\u516C\u958B\u7DE8" "\u8F2F\u4E14\u591A\u8A9E\u8A00\u7684\u7DB2\u8DEF\u767E\u79D1\u5168\u66F8\u5354\u4F5C\u8A08" "\u756B") print_qr(QrCode.encode_segments(segs, QrCode.Ecc.MEDIUM, mask=0)) # Force mask 0 print_qr(QrCode.encode_segments(segs, QrCode.Ecc.MEDIUM, mask=1)) # Force mask 1 print_qr(QrCode.encode_segments(segs, QrCode.Ecc.MEDIUM, mask=5)) # Force mask 5 print_qr(QrCode.encode_segments(segs, QrCode.Ecc.MEDIUM, mask=7)) # Force mask 7 # ---- Utilities ---- def print_qr(qrcode): """Prints the given QrCode object to the console.""" border = 4 for y in range(-border, qrcode.get_size() + border): for x in range(-border, qrcode.get_size() + border): print(u"\u2588 "[1 if qrcode.get_module(x,y) else 0] * 2, end="") print() print() # Run the main program if __name__ == "__main__": main() uTox/third_party/qrcodegen/qrcodegen/python/qrcodegen-batch-test.py0000600000175000001440000001044714003056224024650 0ustar rakusers# # QR Code generator batch test (Python 3) # # Runs various versions of the QR Code generator test worker as subprocesses, # feeds each one the same random input, and compares their output for equality. # # Copyright (c) Project Nayuki. (MIT License) # https://www.nayuki.io/page/qr-code-generator-library # # 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. # from __future__ import print_function import itertools, random, subprocess, sys, time if sys.version_info.major < 3: raise RuntimeError("Requires Python 3+") CHILD_PROGRAMS = [ ["python2", "../python/qrcodegen-worker.py"], # Python 2 program ["python3", "../python/qrcodegen-worker.py"], # Python 3 program ["java", "-cp", "../java", "io/nayuki/qrcodegen/QrCodeGeneratorWorker"], # Java program ["../c/qrcodegen-worker"], # C program ["../cpp/QrCodeGeneratorWorker"], # C++ program ["../rust/target/debug/examples/qrcodegen-worker"], # Rust program ] subprocs = [] def main(): # Launch workers global subprocs try: for args in CHILD_PROGRAMS: subprocs.append(subprocess.Popen(args, universal_newlines=True, stdin=subprocess.PIPE, stdout=subprocess.PIPE)) except FileNotFoundError: write_all(-1) raise # Check if any died time.sleep(0.3) if any(proc.poll() is not None for proc in subprocs): for proc in subprocs: if proc.poll() is None: print(-1, file=proc.stdin) proc.stdin.flush() sys.exit("Error: One or more workers failed to start") # Do tests for i in itertools.count(): print("Trial {}: ".format(i), end="") do_trial() print() def do_trial(): mode = random.randrange(4) if mode == 0: # Numeric length = round((2 * 7089) ** random.random()) data = [random.randrange(48, 58) for _ in range(length)] elif mode == 1: # Alphanumeric length = round((2 * 4296) ** random.random()) data = [ord(random.choice("0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ $%*+-./:")) for _ in range(length)] elif mode == 2: # ASCII length = round((2 * 2953) ** random.random()) data = [random.randrange(128) for _ in range(length)] elif mode == 3: # Byte length = round((2 * 2953) ** random.random()) data = [random.randrange(256) for _ in range(length)] else: raise AssertionError() write_all(length) for b in data: write_all(b) errcorlvl = random.randrange(4) minversion = random.randint(1, 40) maxversion = random.randint(1, 40) if minversion > maxversion: minversion, maxversion = maxversion, minversion mask = -1 if random.random() < 0.5: mask = random.randrange(8) boostecl = int(random.random() < 0.2) print("mode={} len={} ecl={} minv={} maxv={} mask={} boost={}".format(mode, length, errcorlvl, minversion, maxversion, mask, boostecl), end="") write_all(errcorlvl) write_all(minversion) write_all(maxversion) write_all(mask) write_all(boostecl) flush_all() version = read_verify() print(" version={}".format(version), end="") if version == -1: return size = version * 4 + 17 for _ in range(size**2): read_verify() def write_all(val): for proc in subprocs: print(val, file=proc.stdin) def flush_all(): for proc in subprocs: proc.stdin.flush() def read_verify(): val = subprocs[0].stdout.readline().rstrip("\r\n") for proc in subprocs[1 : ]: if proc.stdout.readline().rstrip("\r\n") != val: raise ValueError("Mismatch") return int(val) if __name__ == "__main__": main() uTox/third_party/qrcodegen/qrcodegen/javascript/0000700000175000001440000000000014003056224021110 5ustar rakusersuTox/third_party/qrcodegen/qrcodegen/javascript/qrcodegen.js0000600000175000001440000011505614003056224023427 0ustar rakusers/* * QR Code generator library (JavaScript) * * Copyright (c) Project Nayuki. (MIT License) * https://www.nayuki.io/page/qr-code-generator-library * * 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. */ "use strict"; /* * Module "qrcodegen", public members: * - Class QrCode: * - Function encodeText(str text, QrCode.Ecc ecl) -> QrCode * - Function encodeBinary(list data, QrCode.Ecc ecl) -> QrCode * - Function encodeSegments(list segs, QrCode.Ecc ecl, * int minVersion=1, int maxVersion=40, mask=-1, boostEcl=true) -> QrCode * - Constants int MIN_VERSION, MAX_VERSION * - Constructor QrCode(list datacodewords, int mask, int version, QrCode.Ecc ecl) * - Fields int version, size, mask * - Field QrCode.Ecc errorCorrectionLevel * - Method getModule(int x, int y) -> bool * - Method drawCanvas(int scale, int border, HTMLCanvasElement canvas) -> void * - Method toSvgString(int border) -> str * - Enum Ecc: * - Constants LOW, MEDIUM, QUARTILE, HIGH * - Field int ordinal * - Class QrSegment: * - Function makeBytes(list data) -> QrSegment * - Function makeNumeric(str data) -> QrSegment * - Function makeAlphanumeric(str data) -> QrSegment * - Function makeSegments(str text) -> list * - Function makeEci(int assignVal) -> QrSegment * - Constructor QrSegment(QrSegment.Mode mode, int numChars, list bitData) * - Field QrSegment.Mode mode * - Field int numChars * - Method getBits() -> list * - Constants RegExp NUMERIC_REGEX, ALPHANUMERIC_REGEX * - Enum Mode: * - Constants NUMERIC, ALPHANUMERIC, BYTE, KANJI, ECI */ var qrcodegen = new function() { /*---- QR Code symbol class ----*/ /* * A class that represents an immutable square grid of black and white cells for a QR Code symbol, * with associated static functions to create a QR Code from user-supplied textual or binary data. * This class covers the QR Code model 2 specification, supporting all versions (sizes) * from 1 to 40, all 4 error correction levels. * This constructor creates a new QR Code symbol with the given version number, error correction level, binary data array, * and mask number. mask = -1 is for automatic choice, or 0 to 7 for fixed choice. This is a cumbersome low-level constructor * that should not be invoked directly by the user. To go one level up, see the QrCode.encodeSegments() function. */ this.QrCode = function(datacodewords, mask, version, errCorLvl) { /*---- Constructor ----*/ // Check arguments and handle simple scalar fields if (mask < -1 || mask > 7) throw "Mask value out of range"; if (version < MIN_VERSION || version > MAX_VERSION) throw "Version value out of range"; var size = version * 4 + 17; // Initialize both grids to be size*size arrays of Boolean false var row = []; for (var i = 0; i < size; i++) row.push(false); var modules = []; var isFunction = []; for (var i = 0; i < size; i++) { modules.push(row.slice()); isFunction.push(row.slice()); } // Handle grid fields, draw function patterns, draw all codewords drawFunctionPatterns(); var allCodewords = appendErrorCorrection(datacodewords); drawCodewords(allCodewords); // Handle masking if (mask == -1) { // Automatically choose best mask var minPenalty = Infinity; for (var i = 0; i < 8; i++) { drawFormatBits(i); applyMask(i); var penalty = getPenaltyScore(); if (penalty < minPenalty) { mask = i; minPenalty = penalty; } applyMask(i); // Undoes the mask due to XOR } } if (mask < 0 || mask > 7) throw "Assertion error"; drawFormatBits(mask); // Overwrite old format bits applyMask(mask); // Apply the final choice of mask /*---- Read-only instance properties ----*/ // This QR Code symbol's version number, which is always between 1 and 40 (inclusive). Object.defineProperty(this, "version", {value:version}); // The width and height of this QR Code symbol, measured in modules. // Always equal to version * 4 + 17, in the range 21 to 177. Object.defineProperty(this, "size", {value:size}); // The error correction level used in this QR Code symbol. Object.defineProperty(this, "errorCorrectionLevel", {value:errCorLvl}); // The mask pattern used in this QR Code symbol, in the range 0 to 7 (i.e. unsigned 3-bit integer). // Note that even if the constructor was called with automatic masking requested // (mask = -1), the resulting object will still have a mask value between 0 and 7. Object.defineProperty(this, "mask", {value:mask}); /*---- Accessor methods ----*/ // (Public) Returns the color of the module (pixel) at the given coordinates, which is either // false for white or true for black. The top left corner has the coordinates (x=0, y=0). // If the given coordinates are out of bounds, then false (white) is returned. this.getModule = function(x, y) { return 0 <= x && x < size && 0 <= y && y < size && modules[y][x]; }; // (Package-private) Tests whether the module at the given coordinates is a function module (true) or not (false). // The top left corner has the coordinates (x=0, y=0). If the given coordinates are out of bounds, then false is returned. // The JavaScript version of this library has this method because it is impossible to access private variables of another object. this.isFunctionModule = function(x, y) { if (0 <= x && x < size && 0 <= y && y < size) return isFunction[y][x]; else return false; // Infinite border }; /*---- Public instance methods ----*/ // Draws this QR Code symbol with the given module scale and number of modules onto the given HTML canvas element. // The canvas will be resized to a width and height of (this.size + border * 2) * scale. The painted image will be purely // black and white with no transparent regions. The scale must be a positive integer, and the border must be a non-negative integer. this.drawCanvas = function(scale, border, canvas) { if (scale <= 0 || border < 0) throw "Value out of range"; var width = (size + border * 2) * scale; canvas.width = width; canvas.height = width; var ctx = canvas.getContext("2d"); for (var y = -border; y < size + border; y++) { for (var x = -border; x < size + border; x++) { ctx.fillStyle = this.getModule(x, y) ? "#000000" : "#FFFFFF"; ctx.fillRect((x + border) * scale, (y + border) * scale, scale, scale); } } }; // Based on the given number of border modules to add as padding, this returns a // string whose contents represents an SVG XML file that depicts this QR Code symbol. // Note that Unix newlines (\n) are always used, regardless of the platform. this.toSvgString = function(border) { if (border < 0) throw "Border must be non-negative"; var result = '\n'; result += '\n'; result += '\n'; result += '\t\n'; result += '\t>> 9) * 0x537); data = data << 10 | rem; data ^= 0x5412; // uint15 if (data >>> 15 != 0) throw "Assertion error"; // Draw first copy for (var i = 0; i <= 5; i++) setFunctionModule(8, i, ((data >>> i) & 1) != 0); setFunctionModule(8, 7, ((data >>> 6) & 1) != 0); setFunctionModule(8, 8, ((data >>> 7) & 1) != 0); setFunctionModule(7, 8, ((data >>> 8) & 1) != 0); for (var i = 9; i < 15; i++) setFunctionModule(14 - i, 8, ((data >>> i) & 1) != 0); // Draw second copy for (var i = 0; i <= 7; i++) setFunctionModule(size - 1 - i, 8, ((data >>> i) & 1) != 0); for (var i = 8; i < 15; i++) setFunctionModule(8, size - 15 + i, ((data >>> i) & 1) != 0); setFunctionModule(8, size - 8, true); } // Draws two copies of the version bits (with its own error correction code), // based on this object's version field (which only has an effect for 7 <= version <= 40). function drawVersion() { if (version < 7) return; // Calculate error correction code and pack bits var rem = version; // version is uint6, in the range [7, 40] for (var i = 0; i < 12; i++) rem = (rem << 1) ^ ((rem >>> 11) * 0x1F25); var data = version << 12 | rem; // uint18 if (data >>> 18 != 0) throw "Assertion error"; // Draw two copies for (var i = 0; i < 18; i++) { var bit = ((data >>> i) & 1) != 0; var a = size - 11 + i % 3, b = Math.floor(i / 3); setFunctionModule(a, b, bit); setFunctionModule(b, a, bit); } } // Draws a 9*9 finder pattern including the border separator, with the center module at (x, y). function drawFinderPattern(x, y) { for (var i = -4; i <= 4; i++) { for (var j = -4; j <= 4; j++) { var dist = Math.max(Math.abs(i), Math.abs(j)); // Chebyshev/infinity norm var xx = x + j, yy = y + i; if (0 <= xx && xx < size && 0 <= yy && yy < size) setFunctionModule(xx, yy, dist != 2 && dist != 4); } } } // Draws a 5*5 alignment pattern, with the center module at (x, y). function drawAlignmentPattern(x, y) { for (var i = -2; i <= 2; i++) { for (var j = -2; j <= 2; j++) setFunctionModule(x + j, y + i, Math.max(Math.abs(i), Math.abs(j)) != 1); } } // Sets the color of a module and marks it as a function module. // Only used by the constructor. Coordinates must be in range. function setFunctionModule(x, y, isBlack) { modules[y][x] = isBlack; isFunction[y][x] = true; } /*---- Private helper methods for constructor: Codewords and masking ----*/ // Returns a new byte string representing the given data with the appropriate error correction // codewords appended to it, based on this object's version and error correction level. function appendErrorCorrection(data) { if (data.length != QrCode.getNumDataCodewords(version, errCorLvl)) throw "Invalid argument"; // Calculate parameter numbers var numBlocks = QrCode.NUM_ERROR_CORRECTION_BLOCKS[errCorLvl.ordinal][version]; var blockEccLen = QrCode.ECC_CODEWORDS_PER_BLOCK[errCorLvl.ordinal][version]; var rawCodewords = Math.floor(QrCode.getNumRawDataModules(version) / 8); var numShortBlocks = numBlocks - rawCodewords % numBlocks; var shortBlockLen = Math.floor(rawCodewords / numBlocks); // Split data into blocks and append ECC to each block var blocks = []; var rs = new ReedSolomonGenerator(blockEccLen); for (var i = 0, k = 0; i < numBlocks; i++) { var dat = data.slice(k, k + shortBlockLen - blockEccLen + (i < numShortBlocks ? 0 : 1)); k += dat.length; var ecc = rs.getRemainder(dat); if (i < numShortBlocks) dat.push(0); ecc.forEach(function(b) { dat.push(b); }); blocks.push(dat); } // Interleave (not concatenate) the bytes from every block into a single sequence var result = []; for (var i = 0; i < blocks[0].length; i++) { for (var j = 0; j < blocks.length; j++) { // Skip the padding byte in short blocks if (i != shortBlockLen - blockEccLen || j >= numShortBlocks) result.push(blocks[j][i]); } } if (result.length != rawCodewords) throw "Assertion error"; return result; } // Draws the given sequence of 8-bit codewords (data and error correction) onto the entire // data area of this QR Code symbol. Function modules need to be marked off before this is called. function drawCodewords(data) { if (data.length != Math.floor(QrCode.getNumRawDataModules(version) / 8)) throw "Invalid argument"; var i = 0; // Bit index into the data // Do the funny zigzag scan for (var right = size - 1; right >= 1; right -= 2) { // Index of right column in each column pair if (right == 6) right = 5; for (var vert = 0; vert < size; vert++) { // Vertical counter for (var j = 0; j < 2; j++) { var x = right - j; // Actual x coordinate var upward = ((right + 1) & 2) == 0; var y = upward ? size - 1 - vert : vert; // Actual y coordinate if (!isFunction[y][x] && i < data.length * 8) { modules[y][x] = ((data[i >>> 3] >>> (7 - (i & 7))) & 1) != 0; i++; } // If there are any remainder bits (0 to 7), they are already // set to 0/false/white when the grid of modules was initialized } } } if (i != data.length * 8) throw "Assertion error"; } // XORs the data modules in this QR Code with the given mask pattern. Due to XOR's mathematical // properties, calling applyMask(m) twice with the same value is equivalent to no change at all. // This means it is possible to apply a mask, undo it, and try another mask. Note that a final // well-formed QR Code symbol needs exactly one mask applied (not zero, not two, etc.). function applyMask(mask) { if (mask < 0 || mask > 7) throw "Mask value out of range"; for (var y = 0; y < size; y++) { for (var x = 0; x < size; x++) { var invert; switch (mask) { case 0: invert = (x + y) % 2 == 0; break; case 1: invert = y % 2 == 0; break; case 2: invert = x % 3 == 0; break; case 3: invert = (x + y) % 3 == 0; break; case 4: invert = (Math.floor(x / 3) + Math.floor(y / 2)) % 2 == 0; break; case 5: invert = x * y % 2 + x * y % 3 == 0; break; case 6: invert = (x * y % 2 + x * y % 3) % 2 == 0; break; case 7: invert = ((x + y) % 2 + x * y % 3) % 2 == 0; break; default: throw "Assertion error"; } modules[y][x] ^= invert & !isFunction[y][x]; } } } // Calculates and returns the penalty score based on state of this QR Code's current modules. // This is used by the automatic mask choice algorithm to find the mask pattern that yields the lowest score. function getPenaltyScore() { var result = 0; // Adjacent modules in row having same color for (var y = 0; y < size; y++) { for (var x = 0, runX, colorX; x < size; x++) { if (x == 0 || modules[y][x] != colorX) { colorX = modules[y][x]; runX = 1; } else { runX++; if (runX == 5) result += QrCode.PENALTY_N1; else if (runX > 5) result++; } } } // Adjacent modules in column having same color for (var x = 0; x < size; x++) { for (var y = 0, runY, colorY; y < size; y++) { if (y == 0 || modules[y][x] != colorY) { colorY = modules[y][x]; runY = 1; } else { runY++; if (runY == 5) result += QrCode.PENALTY_N1; else if (runY > 5) result++; } } } // 2*2 blocks of modules having same color for (var y = 0; y < size - 1; y++) { for (var x = 0; x < size - 1; x++) { var color = modules[y][x]; if ( color == modules[y][x + 1] && color == modules[y + 1][x] && color == modules[y + 1][x + 1]) result += QrCode.PENALTY_N2; } } // Finder-like pattern in rows for (var y = 0; y < size; y++) { for (var x = 0, bits = 0; x < size; x++) { bits = ((bits << 1) & 0x7FF) | (modules[y][x] ? 1 : 0); if (x >= 10 && (bits == 0x05D || bits == 0x5D0)) // Needs 11 bits accumulated result += QrCode.PENALTY_N3; } } // Finder-like pattern in columns for (var x = 0; x < size; x++) { for (var y = 0, bits = 0; y < size; y++) { bits = ((bits << 1) & 0x7FF) | (modules[y][x] ? 1 : 0); if (y >= 10 && (bits == 0x05D || bits == 0x5D0)) // Needs 11 bits accumulated result += QrCode.PENALTY_N3; } } // Balance of black and white modules var black = 0; modules.forEach(function(row) { row.forEach(function(color) { if (color) black++; }); }); var total = size * size; // Find smallest k such that (45-5k)% <= dark/total <= (55+5k)% for (var k = 0; black*20 < (9-k)*total || black*20 > (11+k)*total; k++) result += QrCode.PENALTY_N4; return result; } }; /*---- Public static factory functions for QrCode ----*/ /* * Returns a QR Code symbol representing the specified Unicode text string at the specified error correction level. * As a conservative upper bound, this function is guaranteed to succeed for strings that have 738 or fewer * Unicode code points (not UTF-16 code units) if the low error correction level is used. The smallest possible * QR Code version is automatically chosen for the output. The ECC level of the result may be higher than the * ecl argument if it can be done without increasing the version. */ this.QrCode.encodeText = function(text, ecl) { var segs = qrcodegen.QrSegment.makeSegments(text); return this.encodeSegments(segs, ecl); }; /* * Returns a QR Code symbol representing the given binary data string at the given error correction level. * This function always encodes using the binary segment mode, not any text mode. The maximum number of * bytes allowed is 2953. The smallest possible QR Code version is automatically chosen for the output. * The ECC level of the result may be higher than the ecl argument if it can be done without increasing the version. */ this.QrCode.encodeBinary = function(data, ecl) { var seg = qrcodegen.QrSegment.makeBytes(data); return this.encodeSegments([seg], ecl); }; /* * Returns a QR Code symbol representing the given data segments with the given encoding parameters. * The smallest possible QR Code version within the given range is automatically chosen for the output. * This function allows the user to create a custom sequence of segments that switches * between modes (such as alphanumeric and binary) to encode text more efficiently. * This function is considered to be lower level than simply encoding text or binary data. */ this.QrCode.encodeSegments = function(segs, ecl, minVersion, maxVersion, mask, boostEcl) { if (minVersion == undefined) minVersion = MIN_VERSION; if (maxVersion == undefined) maxVersion = MAX_VERSION; if (mask == undefined) mask = -1; if (boostEcl == undefined) boostEcl = true; if (!(MIN_VERSION <= minVersion && minVersion <= maxVersion && maxVersion <= MAX_VERSION) || mask < -1 || mask > 7) throw "Invalid value"; // Find the minimal version number to use var version, dataUsedBits; for (version = minVersion; ; version++) { var dataCapacityBits = QrCode.getNumDataCodewords(version, ecl) * 8; // Number of data bits available dataUsedBits = qrcodegen.QrSegment.getTotalBits(segs, version); if (dataUsedBits != null && dataUsedBits <= dataCapacityBits) break; // This version number is found to be suitable if (version >= maxVersion) // All versions in the range could not fit the given data throw "Data too long"; } // Increase the error correction level while the data still fits in the current version number [this.Ecc.MEDIUM, this.Ecc.QUARTILE, this.Ecc.HIGH].forEach(function(newEcl) { if (boostEcl && dataUsedBits <= QrCode.getNumDataCodewords(version, newEcl) * 8) ecl = newEcl; }); // Create the data bit string by concatenating all segments var dataCapacityBits = QrCode.getNumDataCodewords(version, ecl) * 8; var bb = new BitBuffer(); segs.forEach(function(seg) { bb.appendBits(seg.mode.modeBits, 4); bb.appendBits(seg.numChars, seg.mode.numCharCountBits(version)); seg.getBits().forEach(function(bit) { bb.push(bit); }); }); // Add terminator and pad up to a byte if applicable bb.appendBits(0, Math.min(4, dataCapacityBits - bb.length)); bb.appendBits(0, (8 - bb.length % 8) % 8); // Pad with alternate bytes until data capacity is reached for (var padByte = 0xEC; bb.length < dataCapacityBits; padByte ^= 0xEC ^ 0x11) bb.appendBits(padByte, 8); if (bb.length % 8 != 0) throw "Assertion error"; // Create the QR Code symbol return new this(bb.getBytes(), mask, version, ecl); }; /*---- Public constants for QrCode ----*/ var MIN_VERSION = 1; var MAX_VERSION = 40; Object.defineProperty(this.QrCode, "MIN_VERSION", {value:MIN_VERSION}); Object.defineProperty(this.QrCode, "MAX_VERSION", {value:MAX_VERSION}); /*---- Private static helper functions QrCode ----*/ var QrCode = {}; // Private object to assign properties to. Not the same object as 'this.QrCode'. // Returns a sequence of positions of the alignment patterns in ascending order. These positions are // used on both the x and y axes. Each value in the resulting sequence is in the range [0, 177). // This stateless pure function could be implemented as table of 40 variable-length lists of integers. QrCode.getAlignmentPatternPositions = function(ver) { if (ver < MIN_VERSION || ver > MAX_VERSION) throw "Version number out of range"; else if (ver == 1) return []; else { var size = ver * 4 + 17; var numAlign = Math.floor(ver / 7) + 2; var step; if (ver != 32) step = Math.ceil((size - 13) / (2 * numAlign - 2)) * 2; else // C-C-C-Combo breaker! step = 26; var result = [6]; for (var i = 0, pos = size - 7; i < numAlign - 1; i++, pos -= step) result.splice(1, 0, pos); return result; } }; // Returns the number of data bits that can be stored in a QR Code of the given version number, after // all function modules are excluded. This includes remainder bits, so it might not be a multiple of 8. // The result is in the range [208, 29648]. This could be implemented as a 40-entry lookup table. QrCode.getNumRawDataModules = function(ver) { if (ver < MIN_VERSION || ver > MAX_VERSION) throw "Version number out of range"; var result = (16 * ver + 128) * ver + 64; if (ver >= 2) { var numAlign = Math.floor(ver / 7) + 2; result -= (25 * numAlign - 10) * numAlign - 55; if (ver >= 7) result -= 18 * 2; // Subtract version information } return result; }; // Returns the number of 8-bit data (i.e. not error correction) codewords contained in any // QR Code of the given version number and error correction level, with remainder bits discarded. // This stateless pure function could be implemented as a (40*4)-cell lookup table. QrCode.getNumDataCodewords = function(ver, ecl) { if (ver < MIN_VERSION || ver > MAX_VERSION) throw "Version number out of range"; return Math.floor(QrCode.getNumRawDataModules(ver) / 8) - QrCode.ECC_CODEWORDS_PER_BLOCK[ecl.ordinal][ver] * QrCode.NUM_ERROR_CORRECTION_BLOCKS[ecl.ordinal][ver]; }; /*---- Private tables of constants for QrCode ----*/ // For use in getPenaltyScore(), when evaluating which mask is best. QrCode.PENALTY_N1 = 3; QrCode.PENALTY_N2 = 3; QrCode.PENALTY_N3 = 40; QrCode.PENALTY_N4 = 10; QrCode.ECC_CODEWORDS_PER_BLOCK = [ // Version: (note that index 0 is for padding, and is set to an illegal value) // 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40 Error correction level [null, 7, 10, 15, 20, 26, 18, 20, 24, 30, 18, 20, 24, 26, 30, 22, 24, 28, 30, 28, 28, 28, 28, 30, 30, 26, 28, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30], // Low [null, 10, 16, 26, 18, 24, 16, 18, 22, 22, 26, 30, 22, 22, 24, 24, 28, 28, 26, 26, 26, 26, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28], // Medium [null, 13, 22, 18, 26, 18, 24, 18, 22, 20, 24, 28, 26, 24, 20, 30, 24, 28, 28, 26, 30, 28, 30, 30, 30, 30, 28, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30], // Quartile [null, 17, 28, 22, 16, 22, 28, 26, 26, 24, 28, 24, 28, 22, 24, 24, 30, 28, 28, 26, 28, 30, 24, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30], // High ]; QrCode.NUM_ERROR_CORRECTION_BLOCKS = [ // Version: (note that index 0 is for padding, and is set to an illegal value) // 0, 1, 2, 3, 4, 5, 6, 7, 8, 9,10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40 Error correction level [null, 1, 1, 1, 1, 1, 2, 2, 2, 2, 4, 4, 4, 4, 4, 6, 6, 6, 6, 7, 8, 8, 9, 9, 10, 12, 12, 12, 13, 14, 15, 16, 17, 18, 19, 19, 20, 21, 22, 24, 25], // Low [null, 1, 1, 1, 2, 2, 4, 4, 4, 5, 5, 5, 8, 9, 9, 10, 10, 11, 13, 14, 16, 17, 17, 18, 20, 21, 23, 25, 26, 28, 29, 31, 33, 35, 37, 38, 40, 43, 45, 47, 49], // Medium [null, 1, 1, 2, 2, 4, 4, 6, 6, 8, 8, 8, 10, 12, 16, 12, 17, 16, 18, 21, 20, 23, 23, 25, 27, 29, 34, 34, 35, 38, 40, 43, 45, 48, 51, 53, 56, 59, 62, 65, 68], // Quartile [null, 1, 1, 2, 4, 4, 4, 5, 6, 8, 8, 11, 11, 16, 16, 18, 16, 19, 21, 25, 25, 25, 34, 30, 32, 35, 37, 40, 42, 45, 48, 51, 54, 57, 60, 63, 66, 70, 74, 77, 81], // High ]; /*---- Public helper enumeration ----*/ /* * Represents the error correction level used in a QR Code symbol. */ this.QrCode.Ecc = { // Constants declared in ascending order of error protection LOW : new Ecc(0, 1), MEDIUM : new Ecc(1, 0), QUARTILE: new Ecc(2, 3), HIGH : new Ecc(3, 2), }; // Private constructor. function Ecc(ord, fb) { // (Public) In the range 0 to 3 (unsigned 2-bit integer) Object.defineProperty(this, "ordinal", {value:ord}); // (Package-private) In the range 0 to 3 (unsigned 2-bit integer) Object.defineProperty(this, "formatBits", {value:fb}); } /*---- Data segment class ----*/ /* * A public class that represents a character string to be encoded in a QR Code symbol. * Each segment has a mode, and a sequence of characters that is already encoded as * a sequence of bits. Instances of this class are immutable. * This segment class imposes no length restrictions, but QR Codes have restrictions. * Even in the most favorable conditions, a QR Code can only hold 7089 characters of data. * Any segment longer than this is meaningless for the purpose of generating QR Codes. */ this.QrSegment = function(mode, numChars, bitData) { if (numChars < 0 || !(mode instanceof Mode)) throw "Invalid argument"; bitData = bitData.slice(); // Make defensive copy // The mode indicator for this segment. Object.defineProperty(this, "mode", {value:mode}); // The length of this segment's unencoded data, measured in characters. Always zero or positive. Object.defineProperty(this, "numChars", {value:numChars}); // Returns a copy of all bits, which is an array of 0s and 1s. this.getBits = function() { return bitData.slice(); // Make defensive copy }; }; /*---- Public static factory functions for QrSegment ----*/ /* * Returns a segment representing the given binary data encoded in byte mode. */ this.QrSegment.makeBytes = function(data) { var bb = new BitBuffer(); data.forEach(function(b) { bb.appendBits(b, 8); }); return new this(this.Mode.BYTE, data.length, bb); }; /* * Returns a segment representing the given string of decimal digits encoded in numeric mode. */ this.QrSegment.makeNumeric = function(digits) { if (!this.NUMERIC_REGEX.test(digits)) throw "String contains non-numeric characters"; var bb = new BitBuffer(); var i; for (i = 0; i + 3 <= digits.length; i += 3) // Process groups of 3 bb.appendBits(parseInt(digits.substr(i, 3), 10), 10); var rem = digits.length - i; if (rem > 0) // 1 or 2 digits remaining bb.appendBits(parseInt(digits.substring(i), 10), rem * 3 + 1); return new this(this.Mode.NUMERIC, digits.length, bb); }; /* * Returns a segment representing the given text string encoded in alphanumeric mode. * The characters allowed are: 0 to 9, A to Z (uppercase only), space, * dollar, percent, asterisk, plus, hyphen, period, slash, colon. */ this.QrSegment.makeAlphanumeric = function(text) { if (!this.ALPHANUMERIC_REGEX.test(text)) throw "String contains unencodable characters in alphanumeric mode"; var bb = new BitBuffer(); var i; for (i = 0; i + 2 <= text.length; i += 2) { // Process groups of 2 var temp = QrSegment.ALPHANUMERIC_CHARSET.indexOf(text.charAt(i)) * 45; temp += QrSegment.ALPHANUMERIC_CHARSET.indexOf(text.charAt(i + 1)); bb.appendBits(temp, 11); } if (i < text.length) // 1 character remaining bb.appendBits(QrSegment.ALPHANUMERIC_CHARSET.indexOf(text.charAt(i)), 6); return new this(this.Mode.ALPHANUMERIC, text.length, bb); }; /* * Returns a new mutable list of zero or more segments to represent the given Unicode text string. * The result may use various segment modes and switch modes to optimize the length of the bit stream. */ this.QrSegment.makeSegments = function(text) { // Select the most efficient segment encoding automatically if (text == "") return []; else if (this.NUMERIC_REGEX.test(text)) return [this.makeNumeric(text)]; else if (this.ALPHANUMERIC_REGEX.test(text)) return [this.makeAlphanumeric(text)]; else return [this.makeBytes(toUtf8ByteArray(text))]; }; /* * Returns a segment representing an Extended Channel Interpretation * (ECI) designator with the given assignment value. */ this.QrSegment.makeEci = function(assignVal) { var bb = new BitBuffer(); if (0 <= assignVal && assignVal < (1 << 7)) bb.appendBits(assignVal, 8); else if ((1 << 7) <= assignVal && assignVal < (1 << 14)) { bb.appendBits(2, 2); bb.appendBits(assignVal, 14); } else if ((1 << 14) <= assignVal && assignVal < 1000000) { bb.appendBits(6, 3); bb.appendBits(assignVal, 21); } else throw "ECI assignment value out of range"; return new this(this.Mode.ECI, 0, bb); }; // Package-private helper function. this.QrSegment.getTotalBits = function(segs, version) { if (version < MIN_VERSION || version > MAX_VERSION) throw "Version number out of range"; var result = 0; for (var i = 0; i < segs.length; i++) { var seg = segs[i]; var ccbits = seg.mode.numCharCountBits(version); // Fail if segment length value doesn't fit in the length field's bit-width if (seg.numChars >= (1 << ccbits)) return null; result += 4 + ccbits + seg.getBits().length; } return result; }; /*---- Constants for QrSegment ----*/ var QrSegment = {}; // Private object to assign properties to. Not the same object as 'this.QrSegment'. // (Public) Can test whether a string is encodable in numeric mode (such as by using QrSegment.makeNumeric()). this.QrSegment.NUMERIC_REGEX = /^[0-9]*$/; // (Public) Can test whether a string is encodable in alphanumeric mode (such as by using QrSegment.makeAlphanumeric()). this.QrSegment.ALPHANUMERIC_REGEX = /^[A-Z0-9 $%*+.\/:-]*$/; // (Private) The set of all legal characters in alphanumeric mode, where each character value maps to the index in the string. QrSegment.ALPHANUMERIC_CHARSET = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ $%*+-./:"; /*---- Public helper enumeration ----*/ /* * Represents the mode field of a segment. Immutable. */ this.QrSegment.Mode = { // Constants NUMERIC : new Mode(0x1, [10, 12, 14]), ALPHANUMERIC: new Mode(0x2, [ 9, 11, 13]), BYTE : new Mode(0x4, [ 8, 16, 16]), KANJI : new Mode(0x8, [ 8, 10, 12]), ECI : new Mode(0x7, [ 0, 0, 0]), }; // Private constructor. function Mode(mode, ccbits) { // (Package-private) An unsigned 4-bit integer value (range 0 to 15) representing the mode indicator bits for this mode object. Object.defineProperty(this, "modeBits", {value:mode}); // (Package-private) Returns the bit width of the segment character count field for this mode object at the given version number. this.numCharCountBits = function(ver) { if ( 1 <= ver && ver <= 9) return ccbits[0]; else if (10 <= ver && ver <= 26) return ccbits[1]; else if (27 <= ver && ver <= 40) return ccbits[2]; else throw "Version number out of range"; }; } /*---- Private helper functions and classes ----*/ // Returns a new array of bytes representing the given string encoded in UTF-8. function toUtf8ByteArray(str) { str = encodeURI(str); var result = []; for (var i = 0; i < str.length; i++) { if (str.charAt(i) != "%") result.push(str.charCodeAt(i)); else { result.push(parseInt(str.substr(i + 1, 2), 16)); i += 2; } } return result; } /* * A private helper class that computes the Reed-Solomon error correction codewords for a sequence of * data codewords at a given degree. Objects are immutable, and the state only depends on the degree. * This class exists because each data block in a QR Code shares the same the divisor polynomial. * This constructor creates a Reed-Solomon ECC generator for the given degree. This could be implemented * as a lookup table over all possible parameter values, instead of as an algorithm. */ function ReedSolomonGenerator(degree) { if (degree < 1 || degree > 255) throw "Degree out of range"; // Coefficients of the divisor polynomial, stored from highest to lowest power, excluding the leading term which // is always 1. For example the polynomial x^3 + 255x^2 + 8x + 93 is stored as the uint8 array {255, 8, 93}. var coefficients = []; // Start with the monomial x^0 for (var i = 0; i < degree - 1; i++) coefficients.push(0); coefficients.push(1); // Compute the product polynomial (x - r^0) * (x - r^1) * (x - r^2) * ... * (x - r^{degree-1}), // drop the highest term, and store the rest of the coefficients in order of descending powers. // Note that r = 0x02, which is a generator element of this field GF(2^8/0x11D). var root = 1; for (var i = 0; i < degree; i++) { // Multiply the current product by (x - r^i) for (var j = 0; j < coefficients.length; j++) { coefficients[j] = ReedSolomonGenerator.multiply(coefficients[j], root); if (j + 1 < coefficients.length) coefficients[j] ^= coefficients[j + 1]; } root = ReedSolomonGenerator.multiply(root, 0x02); } // Computes and returns the Reed-Solomon error correction codewords for the given // sequence of data codewords. The returned object is always a new byte array. // This method does not alter this object's state (because it is immutable). this.getRemainder = function(data) { // Compute the remainder by performing polynomial division var result = coefficients.map(function() { return 0; }); data.forEach(function(b) { var factor = b ^ result.shift(); result.push(0); for (var i = 0; i < result.length; i++) result[i] ^= ReedSolomonGenerator.multiply(coefficients[i], factor); }); return result; }; } // This static function returns the product of the two given field elements modulo GF(2^8/0x11D). The arguments and // result are unsigned 8-bit integers. This could be implemented as a lookup table of 256*256 entries of uint8. ReedSolomonGenerator.multiply = function(x, y) { if (x >>> 8 != 0 || y >>> 8 != 0) throw "Byte out of range"; // Russian peasant multiplication var z = 0; for (var i = 7; i >= 0; i--) { z = (z << 1) ^ ((z >>> 7) * 0x11D); z ^= ((y >>> i) & 1) * x; } if (z >>> 8 != 0) throw "Assertion error"; return z; }; /* * A private helper class that represents an appendable sequence of bits. * This constructor creates an empty bit buffer (length 0). */ function BitBuffer() { // Packs this buffer's bits into bytes in big endian, // padding with '0' bit values, and returns the new array. this.getBytes = function() { var result = []; while (result.length * 8 < this.length) result.push(0); this.forEach(function(bit, i) { result[i >>> 3] |= bit << (7 - (i & 7)); }); return result; }; // Appends the given number of low bits of the given value // to this sequence. Requires 0 <= val < 2^len. this.appendBits = function(val, len) { if (len < 0 || len > 31 || val >>> len != 0) throw "Value out of range"; for (var i = len - 1; i >= 0; i--) // Append bit by bit this.push((val >>> i) & 1); }; } BitBuffer.prototype = Object.create(Array.prototype); }; ����������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������uTox/third_party/qrcodegen/qrcodegen/javascript/qrcodegen-js-demo.html������������������������������0000600�0001750�0000144�00000012515�14003056224�025307� 0����������������������������������������������������������������������������������������������������ustar �rak�����������������������������users������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������ QR Code generator library demo (JavaScript)

QR Code generator demo library (JavaScript)

Text string:
QR Code:
Error correction:
Output format:
Border: modules
Scale: pixels per module
Version range: Minimum = , maximum =
Mask pattern: (−1 for automatic, 0 to 7 for manual)
Boost ECC:
Statistics:
SVG XML code:

Copyright © Project Nayuki – https://www.nayuki.io/page/qr-code-generator-library

uTox/third_party/qrcodegen/qrcodegen/javascript/qrcodegen-demo.js0000600000175000001440000001366314003056224024352 0ustar rakusers/* * QR Code generator demo (JavaScript) * * Copyright (c) Project Nayuki. (MIT License) * https://www.nayuki.io/page/qr-code-generator-library * * 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. */ "use strict"; function redrawQrCode() { // Show/hide rows based on bitmap/vector image output var bitmapOutput = document.getElementById("output-format-bitmap").checked; var scaleRow = document.getElementById("scale-row"); var svgXmlRow = document.getElementById("svg-xml-row"); if (bitmapOutput) { scaleRow.style.removeProperty("display"); svgXmlRow.style.display = "none"; } else { scaleRow.style.display = "none"; svgXmlRow.style.removeProperty("display"); } var svgXml = document.getElementById("svg-xml-output"); svgXml.value = ""; // Reset output images in case of early termination var canvas = document.getElementById("qrcode-canvas"); var svg = document.getElementById("qrcode-svg"); canvas.style.display = "none"; svg.style.display = "none"; // Returns a QrCode.Ecc object based on the radio buttons in the HTML form. function getInputErrorCorrectionLevel() { if (document.getElementById("errcorlvl-medium").checked) return qrcodegen.QrCode.Ecc.MEDIUM; else if (document.getElementById("errcorlvl-quartile").checked) return qrcodegen.QrCode.Ecc.QUARTILE; else if (document.getElementById("errcorlvl-high").checked) return qrcodegen.QrCode.Ecc.HIGH; else // In case no radio button is depressed return qrcodegen.QrCode.Ecc.LOW; } // Get form inputs and compute QR Code var ecl = getInputErrorCorrectionLevel(); var text = document.getElementById("text-input").value; var segs = qrcodegen.QrSegment.makeSegments(text); var minVer = parseInt(document.getElementById("version-min-input").value, 10); var maxVer = parseInt(document.getElementById("version-max-input").value, 10); var mask = parseInt(document.getElementById("mask-input").value, 10); var boostEcc = document.getElementById("boost-ecc-input").checked; var qr = qrcodegen.QrCode.encodeSegments(segs, ecl, minVer, maxVer, mask, boostEcc); // Draw image output var border = parseInt(document.getElementById("border-input").value, 10); if (border < 0 || border > 100) return; if (bitmapOutput) { var scale = parseInt(document.getElementById("scale-input").value, 10); if (scale <= 0 || scale > 30) return; qr.drawCanvas(scale, border, canvas); canvas.style.removeProperty("display"); } else { var code = qr.toSvgString(border); svg.setAttribute("viewBox", / viewBox="([^"]*)"/.exec(code)[1]); svg.querySelector("path").setAttribute("d", / d="([^"]*)"/.exec(code)[1]); svg.style.removeProperty("display"); svgXml.value = qr.toSvgString(border); } // Returns a string to describe the given list of segments. function describeSegments(segs) { if (segs.length == 0) return "none"; else if (segs.length == 1) { var mode = segs[0].mode; var Mode = qrcodegen.QrSegment.Mode; if (mode == Mode.NUMERIC ) return "numeric"; if (mode == Mode.ALPHANUMERIC) return "alphanumeric"; if (mode == Mode.BYTE ) return "byte"; if (mode == Mode.KANJI ) return "kanji"; return "unknown"; } else return "multiple"; } // Returns the number of Unicode code points in the given UTF-16 string. function countUnicodeChars(str) { var result = 0; for (var i = 0; i < str.length; i++, result++) { var c = str.charCodeAt(i); if (c < 0xD800 || c >= 0xE000) continue; else if (0xD800 <= c && c < 0xDC00) { // High surrogate i++; var d = str.charCodeAt(i); if (0xDC00 <= d && d < 0xE000) // Low surrogate continue; } throw "Invalid UTF-16 string"; } return result; } // Show the QR Code symbol's statistics as a string var stats = "QR Code version = " + qr.version + ", "; stats += "mask pattern = " + qr.mask + ", "; stats += "character count = " + countUnicodeChars(text) + ",\n"; stats += "encoding mode = " + describeSegments(segs) + ", "; stats += "error correction = level " + "LMQH".charAt(qr.errorCorrectionLevel.ordinal) + ", "; stats += "data bits = " + qrcodegen.QrSegment.getTotalBits(segs, qr.version) + "."; var elem = document.getElementById("statistics-output"); while (elem.firstChild != null) elem.removeChild(elem.firstChild); elem.appendChild(document.createTextNode(stats)); } function handleVersionMinMax(which) { var minElem = document.getElementById("version-min-input"); var maxElem = document.getElementById("version-max-input"); var minVal = parseInt(minElem.value, 10); var maxVal = parseInt(maxElem.value, 10); minVal = Math.max(Math.min(minVal, qrcodegen.QrCode.MAX_VERSION), qrcodegen.QrCode.MIN_VERSION); maxVal = Math.max(Math.min(maxVal, qrcodegen.QrCode.MAX_VERSION), qrcodegen.QrCode.MIN_VERSION); if (which == "min" && minVal > maxVal) maxVal = minVal; else if (which == "max" && maxVal < minVal) minVal = maxVal; minElem.value = minVal.toString(); maxElem.value = maxVal.toString(); redrawQrCode(); } redrawQrCode(); uTox/third_party/qrcodegen/qrcodegen/java/0000700000175000001440000000000014003056224017663 5ustar rakusersuTox/third_party/qrcodegen/qrcodegen/java/io/0000700000175000001440000000000014003056224020272 5ustar rakusersuTox/third_party/qrcodegen/qrcodegen/java/io/nayuki/0000700000175000001440000000000014003056224021572 5ustar rakusersuTox/third_party/qrcodegen/qrcodegen/java/io/nayuki/qrcodegen/0000700000175000001440000000000014003056224023541 5ustar rakusersuTox/third_party/qrcodegen/qrcodegen/java/io/nayuki/qrcodegen/QrSegmentAdvanced.java0000600000175000001440000010342414003056224027745 0ustar rakusers/* * QR Code generator library - Optional advanced logic (Java) * * Copyright (c) Project Nayuki. (MIT License) * https://www.nayuki.io/page/qr-code-generator-library * * 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. */ package io.nayuki.qrcodegen; import static io.nayuki.qrcodegen.QrSegment.Mode.ALPHANUMERIC; import static io.nayuki.qrcodegen.QrSegment.Mode.BYTE; import static io.nayuki.qrcodegen.QrSegment.Mode.NUMERIC; import java.nio.charset.StandardCharsets; import java.util.ArrayList; import java.util.Arrays; import java.util.Base64; import java.util.List; import java.util.Objects; public final class QrSegmentAdvanced { /*---- Optimal list of segments encoder ----*/ /** * Returns a new mutable list of zero or more segments to represent the specified Unicode text string. * The resulting list optimally minimizes the total encoded bit length, subjected to the constraints given * by the specified {error correction level, minimum version number, maximum version number}, plus the additional * constraint that the segment modes {NUMERIC, ALPHANUMERIC, BYTE} can be used but KANJI cannot be used. *

This function can be viewed as a significantly more sophisticated and slower replacement * for {@link QrSegment#makeSegments(String)}, but requiring more input parameters in a way * that overlaps with {@link QrCode#encodeSegments(List,QrCode.Ecc,int,int,int,boolean)}.

* @param text the text to be encoded, which can be any Unicode string * @param ecl the error correction level to use * @param minVersion the minimum allowed version of the QR symbol (at least 1) * @param maxVersion the maximum allowed version of the QR symbol (at most 40) * @return a list of segments containing the text, minimizing the bit length with respect to the constraints * @throws NullPointerException if the data or error correction level is {@code null} * @throws IllegalArgumentException if 1 ≤ minVersion ≤ maxVersion ≤ 40 is violated, * or if the data is too long to fit in a QR Code at maxVersion at the ECL */ public static List makeSegmentsOptimally(String text, QrCode.Ecc ecl, int minVersion, int maxVersion) { // Check arguments Objects.requireNonNull(text); Objects.requireNonNull(ecl); if (!(1 <= minVersion && minVersion <= maxVersion && maxVersion <= 40)) throw new IllegalArgumentException("Invalid value"); // Iterate through version numbers, and make tentative segments List segs = null; for (int version = minVersion; version <= maxVersion; version++) { if (version == minVersion || version == 10 || version == 27) segs = makeSegmentsOptimally(text, version); // Check if the segments fit int dataCapacityBits = QrCode.getNumDataCodewords(version, ecl) * 8; int dataUsedBits = QrSegment.getTotalBits(segs, version); if (dataUsedBits != -1 && dataUsedBits <= dataCapacityBits) return segs; } throw new IllegalArgumentException("Data too long"); } // Returns a list of segments that is optimal for the given text at the given version number. private static List makeSegmentsOptimally(String text, int version) { byte[] data = text.getBytes(StandardCharsets.UTF_8); int[][] bitCosts = computeBitCosts(data, version); QrSegment.Mode[] charModes = computeCharacterModes(data, version, bitCosts); return splitIntoSegments(data, charModes); } private static int[][] computeBitCosts(byte[] data, int version) { // Segment header sizes, measured in 1/6 bits int bytesCost = (4 + BYTE .numCharCountBits(version)) * 6; int alphnumCost = (4 + ALPHANUMERIC.numCharCountBits(version)) * 6; int numberCost = (4 + NUMERIC .numCharCountBits(version)) * 6; // result[mode][len] is the number of 1/6 bits to encode the first len characters of the text, ending in the mode int[][] result = new int[3][data.length + 1]; Arrays.fill(result[1], Integer.MAX_VALUE / 2); Arrays.fill(result[2], Integer.MAX_VALUE / 2); result[0][0] = bytesCost; result[1][0] = alphnumCost; result[2][0] = numberCost; // Calculate the cost table using dynamic programming for (int i = 0; i < data.length; i++) { // Encode a character int j = i + 1; char c = (char)data[i]; result[0][j] = result[0][i] + 48; // 8 bits per byte if (isAlphanumeric(c)) result[1][j] = result[1][i] + 33; // 5.5 bits per alphanumeric char if (isNumeric(c)) result[2][j] = result[2][i] + 20; // 3.33 bits per digit // Switch modes, rounding up fractional bits result[0][j] = Math.min((Math.min(result[1][j], result[2][j]) + 5) / 6 * 6 + bytesCost , result[0][j]); result[1][j] = Math.min((Math.min(result[2][j], result[0][j]) + 5) / 6 * 6 + alphnumCost, result[1][j]); result[2][j] = Math.min((Math.min(result[0][j], result[1][j]) + 5) / 6 * 6 + numberCost , result[2][j]); } return result; } private static QrSegment.Mode[] computeCharacterModes(byte[] data, int version, int[][] bitCosts) { // Segment header sizes, measured in 1/6 bits int bytesCost = (4 + BYTE .numCharCountBits(version)) * 6; int alphnumCost = (4 + ALPHANUMERIC.numCharCountBits(version)) * 6; int numberCost = (4 + NUMERIC .numCharCountBits(version)) * 6; // Infer the mode used for last character by taking the minimum QrSegment.Mode curMode; int end = bitCosts[0].length - 1; if (bitCosts[0][end] <= Math.min(bitCosts[1][end], bitCosts[2][end])) curMode = BYTE; else if (bitCosts[1][end] <= bitCosts[2][end]) curMode = ALPHANUMERIC; else curMode = NUMERIC; // Work backwards to calculate optimal encoding mode for each character QrSegment.Mode[] result = new QrSegment.Mode[data.length]; if (data.length == 0) return result; result[data.length - 1] = curMode; for (int i = data.length - 2; i >= 0; i--) { char c = (char)data[i]; if (curMode == NUMERIC) { if (isNumeric(c)) curMode = NUMERIC; else if (isAlphanumeric(c) && (bitCosts[1][i] + 33 + 5) / 6 * 6 + numberCost == bitCosts[2][i + 1]) curMode = ALPHANUMERIC; else curMode = BYTE; } else if (curMode == ALPHANUMERIC) { if (isNumeric(c) && (bitCosts[2][i] + 20 + 5) / 6 * 6 + alphnumCost == bitCosts[1][i + 1]) curMode = NUMERIC; else if (isAlphanumeric(c)) curMode = ALPHANUMERIC; else curMode = BYTE; } else if (curMode == BYTE) { if (isNumeric(c) && (bitCosts[2][i] + 20 + 5) / 6 * 6 + bytesCost == bitCosts[0][i + 1]) curMode = NUMERIC; else if (isAlphanumeric(c) && (bitCosts[1][i] + 33 + 5) / 6 * 6 + bytesCost == bitCosts[0][i + 1]) curMode = ALPHANUMERIC; else curMode = BYTE; } else throw new AssertionError(); result[i] = curMode; } return result; } private static List splitIntoSegments(byte[] data, QrSegment.Mode[] charModes) { List result = new ArrayList<>(); if (data.length == 0) return result; // Accumulate run of modes QrSegment.Mode curMode = charModes[0]; int start = 0; for (int i = 1; i < data.length; i++) { if (charModes[i] != curMode) { if (curMode == BYTE) result.add(QrSegment.makeBytes(Arrays.copyOfRange(data, start, i))); else { String temp = new String(data, start, i - start, StandardCharsets.US_ASCII); if (curMode == NUMERIC) result.add(QrSegment.makeNumeric(temp)); else if (curMode == ALPHANUMERIC) result.add(QrSegment.makeAlphanumeric(temp)); else throw new AssertionError(); } curMode = charModes[i]; start = i; } } // Final segment if (curMode == BYTE) result.add(QrSegment.makeBytes(Arrays.copyOfRange(data, start, data.length))); else { String temp = new String(data, start, data.length - start, StandardCharsets.US_ASCII); if (curMode == NUMERIC) result.add(QrSegment.makeNumeric(temp)); else if (curMode == ALPHANUMERIC) result.add(QrSegment.makeAlphanumeric(temp)); else throw new AssertionError(); } return result; } private static boolean isAlphanumeric(char c) { return isNumeric(c) || 'A' <= c && c <= 'Z' || " $%*+./:-".indexOf(c) != -1; } private static boolean isNumeric(char c) { return '0' <= c && c <= '9'; } /*---- Kanji mode segment encoder ----*/ /** * Returns a segment representing the specified string encoded in kanji mode. *

Note that broadly speaking, the set of encodable characters are {kanji used in Japan, hiragana, katakana, * Asian punctuation, full-width ASCII}.
* In particular, non-encodable characters are {normal ASCII, half-width katakana, more extensive Chinese hanzi}. * @param text the text to be encoded, which must fall in the kanji mode subset of characters * @return a segment containing the data * @throws NullPointerException if the string is {@code null} * @throws IllegalArgumentException if the string contains non-kanji-mode characters * @see #isEncodableAsKanji(String) */ public static QrSegment makeKanjiSegment(String text) { Objects.requireNonNull(text); BitBuffer bb = new BitBuffer(); for (int i = 0; i < text.length(); i++) { int val = UNICODE_TO_QR_KANJI[text.charAt(i)]; if (val == -1) throw new IllegalArgumentException("String contains non-kanji-mode characters"); bb.appendBits(val, 13); } return new QrSegment(QrSegment.Mode.KANJI, text.length(), bb); } /** * Tests whether the specified text string can be encoded as a segment in kanji mode. *

Note that broadly speaking, the set of encodable characters are {kanji used in Japan, hiragana, katakana, * Asian punctuation, full-width ASCII}.
* In particular, non-encodable characters are {normal ASCII, half-width katakana, more extensive Chinese hanzi}. * @param text the string to test for encodability * @return {@code true} if and only if the string can be encoded in kanji mode * @throws NullPointerException if the string is {@code null} * @see #makeKanjiSegment(String) */ public static boolean isEncodableAsKanji(String text) { Objects.requireNonNull(text); for (int i = 0; i < text.length(); i++) { if (UNICODE_TO_QR_KANJI[text.charAt(i)] == -1) return false; } return true; } // Data derived from ftp://ftp.unicode.org/Public/MAPPINGS/OBSOLETE/EASTASIA/JIS/SHIFTJIS.TXT private static final String PACKED_QR_KANJI_TO_UNICODE = "MAAwATAC/wz/DjD7/xr/G/8f/wEwmzCcALT/QACo/z7/4/8/MP0w/jCdMJ4wA07dMAUwBjAHMPwgFSAQ/w8AXDAcIBb/XCAmICUgGCAZIBwgHf8I/wkwFDAV/zv/Pf9b/10wCDAJMAowCzAMMA0wDjAPMBAwEf8LIhIAsQDX//8A9/8dImD/HP8eImYiZyIeIjQmQiZA" + "ALAgMiAzIQP/5f8EAKIAo/8F/wP/Bv8K/yAApyYGJgUlyyXPJc4lxyXGJaEloCWzJbIlvSW8IDswEiGSIZAhkSGTMBP/////////////////////////////IggiCyKGIocigiKDIioiKf////////////////////8iJyIoAKwh0iHUIgAiA///////////////////" + "//////////8iICKlIxIiAiIHImEiUiJqImsiGiI9Ih0iNSIrIiz//////////////////yErIDAmbyZtJmogICAhALb//////////yXv/////////////////////////////////////////////////xD/Ef8S/xP/FP8V/xb/F/8Y/xn///////////////////8h" + "/yL/I/8k/yX/Jv8n/yj/Kf8q/yv/LP8t/y7/L/8w/zH/Mv8z/zT/Nf82/zf/OP85/zr///////////////////9B/0L/Q/9E/0X/Rv9H/0j/Sf9K/0v/TP9N/07/T/9Q/1H/Uv9T/1T/Vf9W/1f/WP9Z/1r//////////zBBMEIwQzBEMEUwRjBHMEgwSTBKMEswTDBN" + "ME4wTzBQMFEwUjBTMFQwVTBWMFcwWDBZMFowWzBcMF0wXjBfMGAwYTBiMGMwZDBlMGYwZzBoMGkwajBrMGwwbTBuMG8wcDBxMHIwczB0MHUwdjB3MHgweTB6MHswfDB9MH4wfzCAMIEwgjCDMIQwhTCGMIcwiDCJMIowizCMMI0wjjCPMJAwkTCSMJP/////////////" + "////////////////////////MKEwojCjMKQwpTCmMKcwqDCpMKowqzCsMK0wrjCvMLAwsTCyMLMwtDC1MLYwtzC4MLkwujC7MLwwvTC+ML8wwDDBMMIwwzDEMMUwxjDHMMgwyTDKMMswzDDNMM4wzzDQMNEw0jDTMNQw1TDWMNcw2DDZMNow2zDcMN0w3jDf//8w4DDh" + "MOIw4zDkMOUw5jDnMOgw6TDqMOsw7DDtMO4w7zDwMPEw8jDzMPQw9TD2/////////////////////wORA5IDkwOUA5UDlgOXA5gDmQOaA5sDnAOdA54DnwOgA6EDowOkA6UDpgOnA6gDqf////////////////////8DsQOyA7MDtAO1A7YDtwO4A7kDugO7A7wDvQO+" + "A78DwAPBA8MDxAPFA8YDxwPIA8n/////////////////////////////////////////////////////////////////////////////////////////////////////////////BBAEEQQSBBMEFAQVBAEEFgQXBBgEGQQaBBsEHAQdBB4EHwQgBCEEIgQjBCQEJQQm" + "BCcEKAQpBCoEKwQsBC0ELgQv////////////////////////////////////////BDAEMQQyBDMENAQ1BFEENgQ3BDgEOQQ6BDsEPAQ9//8EPgQ/BEAEQQRCBEMERARFBEYERwRIBEkESgRLBEwETQROBE///////////////////////////////////yUAJQIlDCUQ" + "JRglFCUcJSwlJCU0JTwlASUDJQ8lEyUbJRclIyUzJSslOyVLJSAlLyUoJTclPyUdJTAlJSU4JUL/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////" + "////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////" + "////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////" + "////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////" + "////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////" + "////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////" + "////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////" + "////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////" + "////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////" + "////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////" + "/////////////////////////////////////06cVRZaA5Y/VMBhG2MoWfaQIoR1gxx6UGCqY+FuJWXthGaCppv1aJNXJ2WhYnFbm1nQhnuY9H1ifb6bjmIWfJ+It1uJXrVjCWaXaEiVx5eNZ09O5U8KT01PnVBJVvJZN1nUWgFcCWDfYQ9hcGYTaQVwunVPdXB5+32t" + "fe+Aw4QOiGOLApBVkHpTO06VTqVX34CykMF4704AWPFuopA4ejKDKIKLnC9RQVNwVL1U4VbgWftfFZjybeuA5IUt////////lmKWcJagl/tUC1PzW4dwz3+9j8KW6FNvnVx6uk4ReJOB/G4mVhhVBGsdhRqcO1nlU6ltZnTclY9WQk6RkEuW8oNPmQxT4VW2WzBfcWYg" + "ZvNoBGw4bPNtKXRbdsh6Tpg0gvGIW4pgku1tsnWrdsqZxWCmiwGNipWyaY5TrVGG//9XElgwWURbtF72YChjqWP0bL9vFHCOcRRxWXHVcz9+AYJ2gtGFl5BgkludG1hpZbxsWnUlUflZLlllX4Bf3GK8ZfpqKmsna7Rzi3/BiVadLJ0OnsRcoWyWg3tRBFxLYbaBxmh2" + "cmFOWU/6U3hgaW4pek+X804LUxZO7k9VTz1PoU9zUqBT71YJWQ9awVu2W+F50WaHZ5xntmtMbLNwa3PCeY15vno8e4eCsYLbgwSDd4Pvg9OHZoqyVimMqI/mkE6XHoaKT8Rc6GIRcll1O4Hlgr2G/ozAlsWZE5nVTstPGonjVt5YSljKXvtf62AqYJRgYmHQYhJi0GU5" + "////////m0FmZmiwbXdwcHVMdoZ9dYKlh/mVi5aOjJ1R8VK+WRZUs1uzXRZhaGmCba94jYTLiFeKcpOnmrhtbJmohtlXo2f/hs6SDlKDVodUBF7TYuFkuWg8aDhru3NyeLp6a4maidKNa48DkO2Vo5aUl2lbZlyzaX2YTZhOY5t7IGor//9qf2i2nA1vX1JyVZ1gcGLs" + "bTtuB27RhFuJEI9EThScOVP2aRtqOpeEaCpRXHrDhLKR3JOMVludKGgigwWEMXylUgiCxXTmTn5Pg1GgW9JSClLYUudd+1WaWCpZ5luMW5hb215yXnlgo2EfYWNhvmPbZWJn0WhTaPprPmtTbFdvIm+Xb0V0sHUYduN3C3r/e6F8IX3pfzZ/8ICdgmaDnomzisyMq5CE" + "lFGVk5WRlaKWZZfTmSiCGE44VCtcuF3Mc6l2THc8XKl/640LlsGYEZhUmFhPAU8OU3FVnFZoV/pZR1sJW8RckF4MXn5fzGPuZzpl12XiZx9oy2jE////////al9eMGvFbBdsfXV/eUhbY3oAfQBfvYmPihiMtI13jsyPHZjimg6bPE6AUH1RAFmTW5xiL2KAZOxrOnKg" + "dZF5R3+ph/uKvItwY6yDypegVAlUA1WraFRqWIpweCdndZ7NU3RbooEahlCQBk4YTkVOx08RU8pUOFuuXxNgJWVR//9nPWxCbHJs43B4dAN6dnquewh9Gnz+fWZl53JbU7tcRV3oYtJi4GMZbiCGWooxjd2S+G8BeaabWk6oTqtOrE+bT6BQ0VFHevZRcVH2U1RTIVN/" + "U+tVrFiDXOFfN19KYC9gUGBtYx9lWWpLbMFywnLtd++A+IEFggiFTpD3k+GX/5lXmlpO8FHdXC1mgWltXEBm8ml1c4loUHyBUMVS5FdHXf6TJmWkayNrPXQ0eYF5vXtLfcqCuYPMiH+JX4s5j9GR0VQfkoBOXVA2U+VTOnLXc5Z36YLmjq+ZxpnImdJRd2Eahl5VsHp6" + "UHZb05BHloVOMmrbkedcUVxI////////Y5h6n2yTl3SPYXqqcYqWiHyCaBd+cGhRk2xS8lQbhauKE3+kjs2Q4VNmiIh5QU/CUL5SEVFEVVNXLXPqV4tZUV9iX4RgdWF2YWdhqWOyZDplbGZvaEJuE3Vmej18+31MfZl+S39rgw6DSobNigiKY4tmjv2YGp2PgriPzpvo" + "//9Sh2IfZINvwJaZaEFQkWsgbHpvVHp0fVCIQIojZwhO9lA5UCZQZVF8UjhSY1WnVw9YBVrMXvphsmH4YvNjcmkcailyfXKscy54FHhvfXl3DICpiYuLGYzijtKQY5N1lnqYVZoTnnhRQ1OfU7Nee18mbhtukHOEc/59Q4I3igCK+pZQTk5QC1PkVHxW+lnRW2Rd8V6r" + "XydiOGVFZ69uVnLQfMqItIChgOGD8IZOioeN6JI3lseYZ58TTpROkk8NU0hUSVQ+Wi9fjF+hYJ9op2qOdFp4gYqeiqSLd5GQTl6byU6kT3xPr1AZUBZRSVFsUp9SuVL+U5pT41QR////////VA5ViVdRV6JZfVtUW11bj13lXedd9154XoNeml63XxhgUmFMYpdi2GOn" + "ZTtmAmZDZvRnbWghaJdpy2xfbSptaW4vbp11MnaHeGx6P3zgfQV9GH1efbGAFYADgK+AsYFUgY+CKoNSiEyIYYsbjKKM/JDKkXWScXg/kvyVpJZN//+YBZmZmtidO1JbUqtT91QIWNVi92/gjGqPX565UUtSO1RKVv16QJF3nWCe0nNEbwmBcHURX/1g2pqoctuPvGtk" + "mANOylbwV2RYvlpaYGhhx2YPZgZoOWixbfd11X06gm6bQk6bT1BTyVUGXW9d5l3uZ/tsmXRzeAKKUJOWiN9XUF6nYytQtVCsUY1nAFTJWF5Zu1uwX2liTWOhaD1rc24IcH2Rx3KAeBV4JnltZY59MIPciMGPCZabUmRXKGdQf2qMoVG0V0KWKlg6aYqAtFSyXQ5X/HiV" + "nfpPXFJKVItkPmYoZxRn9XqEe1Z9IpMvaFybrXs5UxlRilI3////////W99i9mSuZOZnLWu6hamW0XaQm9ZjTJMGm6t2v2ZSTglQmFPCXHFg6GSSZWNoX3Hmc8p1I3uXfoKGlYuDjNuReJkQZaxmq2uLTtVO1E86T39SOlP4U/JV41bbWOtZy1nJWf9bUFxNXgJeK1/X" + "YB1jB2UvW1xlr2W9ZehnnWti//9re2wPc0V5SXnBfPh9GX0rgKKBAoHziZaKXoppimaKjIrujMeM3JbMmPxrb06LTzxPjVFQW1db+mFIYwFmQmshbstsu3I+dL111HjBeTqADIAzgeqElI+ebFCef18Pi1idK3r6jvhbjZbrTgNT8Vf3WTFayVukYIluf28Gdb6M6luf" + "hQB74FByZ/SCnVxhhUp+HoIOUZlcBGNojWZlnHFueT59F4AFix2OypBuhseQqlAfUvpcOmdTcHxyNZFMkciTK4LlW8JfMWD5TjtT1luIYktnMWuKculz4HougWuNo5FSmZZRElPXVGpb/2OIajl9rJcAVtpTzlRo////////W5dcMV3eT+5hAWL+bTJ5wHnLfUJ+TX/S" + "ge2CH4SQiEaJcouQjnSPL5AxkUuRbJbGkZxOwE9PUUVTQV+TYg5n1GxBbgtzY34mkc2Sg1PUWRlbv23ReV1+LnybWH5xn1H6iFOP8E/KXPtmJXeseuOCHJn/UcZfqmXsaW9riW3z//9ulm9kdv59FF3hkHWRh5gGUeZSHWJAZpFm2W4aXrZ90n9yZviFr4X3ivhSqVPZ" + "WXNej1+QYFWS5JZkULdRH1LdUyBTR1PsVOhVRlUxVhdZaFm+WjxbtVwGXA9cEVwaXoReil7gX3Bif2KEYttjjGN3ZgdmDGYtZnZnfmiiah9qNWy8bYhuCW5YcTxxJnFndcd3AXhdeQF5ZXnweuB7EXynfTmAloPWhIuFSYhdiPOKH4o8ilSKc4xhjN6RpJJmk36UGJac" + "l5hOCk4ITh5OV1GXUnBXzlg0WMxbIl44YMVk/mdhZ1ZtRHK2dXN6Y4S4i3KRuJMgVjFX9Jj+////////Yu1pDWuWce1+VIB3gnKJ5pjfh1WPsVw7TzhP4U+1VQdaIFvdW+lfw2FOYy9lsGZLaO5pm214bfF1M3W5dx95XnnmfTOB44KvhaqJqoo6jquPm5Aykd2XB066" + "TsFSA1h1WOxcC3UaXD2BTooKj8WWY5dteyWKz5gIkWJW81Oo//+QF1Q5V4JeJWOobDRwindhfIt/4IhwkEKRVJMQkxiWj3RemsRdB11pZXBnoo2olttjbmdJaRmDxZgXlsCI/m+EZHpb+E4WcCx1XWYvUcRSNlLiWdNfgWAnYhBlP2V0Zh9mdGjyaBZrY24FcnJ1H3bb" + "fL6AVljwiP2Jf4qgipOKy5AdkZKXUpdZZYl6DoEGlrteLWDcYhplpWYUZ5B383pNfE1+PoEKjKyNZI3hjl94qVIHYtljpWRCYpiKLXqDe8CKrJbqfXaCDIdJTtlRSFNDU2Bbo1wCXBZd3WImYkdksGgTaDRsyW1FbRdn029ccU5xfWXLen97rX3a////////fkp/qIF6" + "ghuCOYWmim6Mzo31kHiQd5KtkpGVg5uuUk1VhG84cTZRaHmFflWBs3zOVkxYUVyoY6pm/mb9aVpy2XWPdY55DnlWed98l30gfUSGB4o0ljuQYZ8gUOdSdVPMU+JQCVWqWO5ZT3I9W4tcZFMdYONg82NcY4NjP2O7//9kzWXpZvld42nNaf1vFXHlTol16Xb4epN8333P" + "fZyAYYNJg1iEbIS8hfuIxY1wkAGQbZOXlxyaElDPWJdhjoHThTWNCJAgT8NQdFJHU3Ngb2NJZ19uLI2zkB9P11xejMplz32aU1KIllF2Y8NbWFtrXApkDWdRkFxO1lkaWSpscIpRVT5YFVmlYPBiU2fBgjVpVZZAmcSaKE9TWAZb/oAQXLFeL1+FYCBhS2I0Zv9s8G7e" + "gM6Bf4LUiIuMuJAAkC6Wip7bm9tO41PwWSd7LJGNmEyd+W7dcCdTU1VEW4ViWGKeYtNsom/vdCKKF5Q4b8GK/oM4UeeG+FPq////////U+lPRpBUj7BZaoExXf166o+/aNqMN3L4nEhqPYqwTjlTWFYGV2ZixWOiZeZrTm3hbltwrXfteu97qn27gD2AxobLipWTW1bj" + "WMdfPmWtZpZqgGu1dTeKx1Akd+VXMF8bYGVmemxgdfR6Gn9ugfSHGJBFmbN7yXVcevl7UYTE//+QEHnpepKDNlrhd0BOLU7yW5lf4GK9Zjxn8WzohmuId4o7kU6S85nQahdwJnMqgueEV4yvTgFRRlHLVYtb9V4WXjNegV8UXzVfa1+0YfJjEWaiZx1vbnJSdTp3OoB0" + "gTmBeId2ir+K3I2FjfOSmpV3mAKc5VLFY1d29GcVbIhzzYzDk66Wc20lWJxpDmnMj/2TmnXbkBpYWmgCY7Rp+09Dbyxn2I+7hSZ9tJNUaT9vcFdqWPdbLH0scipUCpHjnbROrU9OUFxQdVJDjJ5USFgkW5peHV6VXq1e918fYIxitWM6Y9Bor2xAeId5jnoLfeCCR4oC" + "iuaORJAT////////kLiRLZHYnw5s5WRYZOJldW70doR7G5Bpk9FuulTyX7lkpI9Nj+2SRFF4WGtZKVxVXpdt+36PdRyMvI7imFtwuU8da79vsXUwlvtRTlQQWDVYV1msXGBfkmWXZ1xuIXZ7g9+M7ZAUkP2TTXgleDpSql6mVx9ZdGASUBJRWlGs//9RzVIAVRBYVFhY" + "WVdblVz2XYtgvGKVZC1ncWhDaLxo33bXbdhub22bcG9xyF9Tddh5d3tJe1R7UnzWfXFSMIRjhWmF5IoOiwSMRo4PkAOQD5QZlnaYLZowldhQzVLVVAxYAlwOYadknm0ed7N65YD0hASQU5KFXOCdB1M/X5dfs22ccnl3Y3m/e+Rr0nLsiq1oA2phUfh6gWk0XEqc9oLr" + "W8WRSXAeVnhcb2DHZWZsjIxakEGYE1RRZseSDVlIkKNRhU5NUeqFmYsOcFhjepNLaWKZtH4EdXdTV2lgjt+W42xdToxcPF8Qj+lTAozRgImGeV7/ZeVOc1Fl////////WYJcP5fuTvtZil/Nio1v4XmweWJb54RxcytxsV50X/Vje2SaccN8mE5DXvxOS1fcVqJgqW/D" + "fQ2A/YEzgb+PsomXhqRd9GKKZK2Jh2d3bOJtPnQ2eDRaRn91gq2ZrE/zXsNi3WOSZVdnb3bDckyAzIC6jymRTVANV/lakmiF//9pc3Fkcv2Mt1jyjOCWapAZh3955HfnhClPL1JlU1pizWfPbMp2fXuUfJWCNoWEj+tm3W8gcgZ+G4OrmcGeplH9e7F4cnu4gId7SGro" + "XmGAjHVRdWBRa5Jibox2epGXmupPEH9wYpx7T5WlnOlWelhZhuSWvE80UiRTSlPNU9teBmQsZZFnf2w+bE5ySHKvc+11VH5BgiyF6Yype8SRxnFpmBKY72M9Zml1anbkeNCFQ4buUypTUVQmWYNeh198YLJiSWJ5YqtlkGvUbMx1snaueJF52H3Lf3eApYirirmMu5B/" + "l16Y22oLfDhQmVw+X65nh2vYdDV3CX+O////////nztnynoXUzl1i5rtX2aBnYPxgJhfPF/FdWJ7RpA8aGdZ61qbfRB2fossT/VfamoZbDdvAnTieWiIaIpVjHle32PPdcV50oLXkyiS8oSchu2cLVTBX2xljG1ccBWMp4zTmDtlT3T2Tg1O2FfgWStaZlvMUaheA16c" + "YBZidmV3//9lp2ZubW5yNnsmgVCBmoKZi1yMoIzmjXSWHJZET65kq2tmgh6EYYVqkOhcAWlTmKiEeoVXTw9Sb1+pXkVnDXmPgXmJB4mGbfVfF2JVbLhOz3Jpm5JSBlQ7VnRYs2GkYm5xGllufIl83n0blvBlh4BeThlPdVF1WEBeY15zXwpnxE4mhT2ViZZbfHOYAVD7" + "WMF2VninUiV3pYURe4ZQT1kJckd7x33oj7qP1JBNT79SyVopXwGXrU/dgheS6lcDY1VraXUriNyPFHpCUt9Yk2FVYgpmrmvNfD+D6VAjT/hTBVRGWDFZSVudXPBc710pXpZisWNnZT5luWcL////////bNVs4XD5eDJ+K4DegrOEDITshwKJEooqjEqQppLSmP2c851s" + "Tk9OoVCNUlZXSlmoXj1f2F/ZYj9mtGcbZ9Bo0lGSfSGAqoGoiwCMjIy/kn6WMlQgmCxTF1DVU1xYqGSyZzRyZ3dmekaR5lLDbKFrhlgAXkxZVGcsf/tR4XbG//9kaXjom1Seu1fLWblmJ2eaa85U6WnZXlWBnGeVm6pn/pxSaF1Opk/jU8hiuWcrbKuPxE+tfm2ev04H" + "YWJugG8rhRNUc2cqm0Vd83uVXKxbxoccbkqE0XoUgQhZmXyNbBF3IFLZWSJxIXJfd9uXJ51haQtaf1oYUaVUDVR9Zg5234/3kpic9Fnqcl1uxVFNaMl9v33sl2KeumR4aiGDAlmEW19r23MbdvJ9soAXhJlRMmcontl27mdiUv+ZBVwkYjt8foywVU9gtn0LlYBTAU5f" + "UbZZHHI6gDaRzl8ld+JThF95fQSFrIozjo2XVmfzha6UU2EJYQhsuXZS////////iu2POFUvT1FRKlLHU8tbpV59YKBhgmPWZwln2m5nbYxzNnM3dTF5UIjVipiQSpCRkPWWxIeNWRVOiE9ZTg6KiY8/mBBQrV58WZZbuV64Y9pj+mTBZtxpSmnYbQtutnGUdSh6r3+K" + "gACESYTJiYGLIY4KkGWWfZkKYX5ikWsy//9sg210f8x//G3Af4WHuoj4Z2WDsZg8lvdtG31hhD2Rak5xU3VdUGsEb+uFzYYtiadSKVQPXGVnTmiodAZ0g3XiiM+I4ZHMluKWeF+Lc4d6y4ROY6B1ZVKJbUFunHQJdVl4a3ySloZ63J+NT7ZhbmXFhlxOhk6uUNpOIVHM" + "W+5lmWiBbbxzH3ZCd616HHzngm+K0pB8kc+WdZgYUpt90VArU5hnl23LcdB0M4HojyqWo5xXnp90YFhBbZl9L5heTuRPNk+LUbdSsV26YBxzsnk8gtOSNJa3lvaXCp6Xn2Jmpmt0UhdSo3DIiMJeyWBLYZBvI3FJfD599IBv////////hO6QI5MsVEKbb2rTcImMwo3v" + "lzJStFpBXspfBGcXaXxplG1qbw9yYnL8e+2AAYB+h0uQzlFtnpN5hICLkzKK1lAtVIyKcWtqjMSBB2DRZ6Cd8k6ZTpicEIprhcGFaGkAbn54l4FV////////////////////////////////////////////////////////////////////////////////////////" + "/////////////////////////////18MThBOFU4qTjFONk48Tj9OQk5WTlhOgk6FjGtOioISXw1Ojk6eTp9OoE6iTrBOs062Ts5OzU7ETsZOwk7XTt5O7U7fTvdPCU9aTzBPW09dT1dPR092T4hPj0+YT3tPaU9wT5FPb0+GT5ZRGE/UT99Pzk/YT9tP0U/aT9BP5E/l" + "UBpQKFAUUCpQJVAFTxxP9lAhUClQLE/+T+9QEVAGUENQR2cDUFVQUFBIUFpQVlBsUHhQgFCaUIVQtFCy////////UMlQylCzUMJQ1lDeUOVQ7VDjUO5Q+VD1UQlRAVECURZRFVEUURpRIVE6UTdRPFE7UT9RQFFSUUxRVFFievhRaVFqUW5RgFGCVthRjFGJUY9RkVGT" + "UZVRllGkUaZRolGpUapRq1GzUbFRslGwUbVRvVHFUclR21HghlVR6VHt//9R8FH1Uf5SBFILUhRSDlInUipSLlIzUjlST1JEUktSTFJeUlRSalJ0UmlSc1J/Un1SjVKUUpJScVKIUpGPqI+nUqxSrVK8UrVSwVLNUtdS3lLjUuaY7VLgUvNS9VL4UvlTBlMIdThTDVMQ" + "Uw9TFVMaUyNTL1MxUzNTOFNAU0ZTRU4XU0lTTVHWU15TaVNuWRhTe1N3U4JTllOgU6ZTpVOuU7BTtlPDfBKW2VPfZvxx7lPuU+hT7VP6VAFUPVRAVCxULVQ8VC5UNlQpVB1UTlSPVHVUjlRfVHFUd1RwVJJUe1SAVHZUhFSQVIZUx1SiVLhUpVSsVMRUyFSo////////" + "VKtUwlSkVL5UvFTYVOVU5lUPVRRU/VTuVO1U+lTiVTlVQFVjVUxVLlVcVUVVVlVXVThVM1VdVZlVgFSvVYpVn1V7VX5VmFWeVa5VfFWDValVh1WoVdpVxVXfVcRV3FXkVdRWFFX3VhZV/lX9VhtV+VZOVlBx31Y0VjZWMlY4//9Wa1ZkVi9WbFZqVoZWgFaKVqBWlFaP" + "VqVWrla2VrRWwla8VsFWw1bAVshWzlbRVtNW11buVvlXAFb/VwRXCVcIVwtXDVcTVxhXFlXHVxxXJlc3VzhXTlc7V0BXT1dpV8BXiFdhV39XiVeTV6BXs1ekV6pXsFfDV8ZX1FfSV9NYClfWV+NYC1gZWB1YclghWGJYS1hwa8BYUlg9WHlYhVi5WJ9Yq1i6WN5Yu1i4" + "WK5YxVjTWNFY11jZWNhY5VjcWORY31jvWPpY+Vj7WPxY/VkCWQpZEFkbaKZZJVksWS1ZMlk4WT560llVWVBZTllaWVhZYllgWWdZbFlp////////WXhZgVmdT15Pq1mjWbJZxlnoWdxZjVnZWdpaJVofWhFaHFoJWhpaQFpsWklaNVo2WmJaalqaWrxavlrLWsJavVrj" + "Wtda5lrpWtZa+lr7WwxbC1sWWzJa0FsqWzZbPltDW0VbQFtRW1VbWltbW2VbaVtwW3NbdVt4ZYhbeluA//9bg1umW7hbw1vHW8lb1FvQW+Rb5lviW95b5VvrW/Bb9lvzXAVcB1wIXA1cE1wgXCJcKFw4XDlcQVxGXE5cU1xQXE9bcVxsXG5OYlx2XHlcjFyRXJRZm1yr" + "XLtctly8XLdcxVy+XMdc2VzpXP1c+lztXYxc6l0LXRVdF11cXR9dG10RXRRdIl0aXRldGF1MXVJdTl1LXWxdc112XYddhF2CXaJdnV2sXa5dvV2QXbddvF3JXc1d013SXdZd213rXfJd9V4LXhpeGV4RXhteNl43XkReQ15AXk5eV15UXl9eYl5kXkdedV52XnqevF5/" + "XqBewV7CXshe0F7P////////XtZe417dXtpe217iXuFe6F7pXuxe8V7zXvBe9F74Xv5fA18JX11fXF8LXxFfFl8pXy1fOF9BX0hfTF9OXy9fUV9WX1dfWV9hX21fc193X4Nfgl9/X4pfiF+RX4dfnl+ZX5hfoF+oX61fvF/WX/tf5F/4X/Ff3WCzX/9gIWBg//9gGWAQ" + "YClgDmAxYBtgFWArYCZgD2A6YFpgQWBqYHdgX2BKYEZgTWBjYENgZGBCYGxga2BZYIFgjWDnYINgmmCEYJtglmCXYJJgp2CLYOFguGDgYNNgtF/wYL1gxmC1YNhhTWEVYQZg9mD3YQBg9GD6YQNhIWD7YPFhDWEOYUdhPmEoYSdhSmE/YTxhLGE0YT1hQmFEYXNhd2FY" + "YVlhWmFrYXRhb2FlYXFhX2FdYVNhdWGZYZZhh2GsYZRhmmGKYZFhq2GuYcxhymHJYfdhyGHDYcZhumHLf3lhzWHmYeNh9mH6YfRh/2H9Yfxh/mIAYghiCWINYgxiFGIb////////Yh5iIWIqYi5iMGIyYjNiQWJOYl5iY2JbYmBiaGJ8YoJiiWJ+YpJik2KWYtRig2KU" + "Ytdi0WK7Ys9i/2LGZNRiyGLcYsxiymLCYsdim2LJYwxi7mLxYydjAmMIYu9i9WNQYz5jTWQcY09jlmOOY4Bjq2N2Y6Njj2OJY59jtWNr//9jaWO+Y+ljwGPGY+NjyWPSY/ZjxGQWZDRkBmQTZCZkNmUdZBdkKGQPZGdkb2R2ZE5lKmSVZJNkpWSpZIhkvGTaZNJkxWTH" + "ZLtk2GTCZPFk54IJZOBk4WKsZONk72UsZPZk9GTyZPplAGT9ZRhlHGUFZSRlI2UrZTRlNWU3ZTZlOHVLZUhlVmVVZU1lWGVeZV1lcmV4ZYJlg4uKZZtln2WrZbdlw2XGZcFlxGXMZdJl22XZZeBl4WXxZ3JmCmYDZftnc2Y1ZjZmNGYcZk9mRGZJZkFmXmZdZmRmZ2Zo" + "Zl9mYmZwZoNmiGaOZolmhGaYZp1mwWa5Zslmvma8////////ZsRmuGbWZtpm4GY/ZuZm6WbwZvVm92cPZxZnHmcmZyeXOGcuZz9nNmdBZzhnN2dGZ15nYGdZZ2NnZGeJZ3BnqWd8Z2pnjGeLZ6ZnoWeFZ7dn72e0Z+xns2fpZ7hn5GfeZ91n4mfuZ7lnzmfGZ+dqnGge" + "aEZoKWhAaE1oMmhO//9os2graFloY2h3aH9on2iPaK1olGidaJtog2quaLlodGi1aKBoumkPaI1ofmkBaMppCGjYaSJpJmjhaQxozWjUaOdo1Wk2aRJpBGjXaONpJWj5aOBo72koaSppGmkjaSFoxml5aXdpXGl4aWtpVGl+aW5pOWl0aT1pWWkwaWFpXmldaYFpammy" + "aa5p0Gm/acFp02m+ac5b6GnKad1pu2nDaadqLmmRaaBpnGmVabRp3mnoagJqG2n/awpp+WnyaedqBWmxah5p7WoUaetqCmoSasFqI2oTakRqDGpyajZqeGpHamJqWWpmakhqOGoiapBqjWqgaoRqomqj////////apeGF2q7asNqwmq4arNqrGreatFq32qqatpq6mr7" + "awWGFmr6axJrFpsxax9rOGs3dtxrOZjua0drQ2tJa1BrWWtUa1trX2tha3hreWt/a4BrhGuDa41rmGuVa55rpGuqa6trr2uya7Frs2u3a7xrxmvLa9Nr32vsa+tr82vv//+evmwIbBNsFGwbbCRsI2xebFVsYmxqbIJsjWyabIFsm2x+bGhsc2ySbJBsxGzxbNNsvWzX" + "bMVs3WyubLFsvmy6bNts72zZbOptH4hNbTZtK209bThtGW01bTNtEm0MbWNtk21kbVpteW1ZbY5tlW/kbYVt+W4VbgpttW3HbeZtuG3Gbext3m3Mbeht0m3Fbfpt2W3kbdVt6m3ubi1ubm4ubhlucm5fbj5uI25rbitudm5Nbh9uQ246bk5uJG7/bh1uOG6CbqpumG7J" + "brdu0269bq9uxG6ybtRu1W6PbqVuwm6fb0FvEXBMbuxu+G7+bz9u8m8xbu9vMm7M////////bz5vE273b4Zvem94b4FvgG9vb1tv829tb4JvfG9Yb45vkW/Cb2Zvs2+jb6FvpG+5b8Zvqm/fb9Vv7G/Ub9hv8W/ub9twCXALb/pwEXABcA9v/nAbcBpvdHAdcBhwH3Aw" + "cD5wMnBRcGNwmXCScK9w8XCscLhws3CucN9wy3Dd//9w2XEJcP1xHHEZcWVxVXGIcWZxYnFMcVZxbHGPcftxhHGVcahxrHHXcblxvnHScclx1HHOceBx7HHncfVx/HH5cf9yDXIQchtyKHItcixyMHIycjtyPHI/ckByRnJLclhydHJ+coJygXKHcpJylnKicqdyuXKy" + "csNyxnLEcs5y0nLicuBy4XL5cvdQD3MXcwpzHHMWcx1zNHMvcylzJXM+c05zT57Yc1dzanNoc3BzeHN1c3tzenPIc7NzznO7c8Bz5XPuc950onQFdG90JXP4dDJ0OnRVdD90X3RZdEF0XHRpdHB0Y3RqdHZ0fnSLdJ50p3TKdM901HPx////////dOB043TndOl07nTy" + "dPB08XT4dPd1BHUDdQV1DHUOdQ11FXUTdR51JnUsdTx1RHVNdUp1SXVbdUZ1WnVpdWR1Z3VrdW11eHV2dYZ1h3V0dYp1iXWCdZR1mnWddaV1o3XCdbN1w3W1db11uHW8dbF1zXXKddJ12XXjdd51/nX///91/HYBdfB1+nXydfN2C3YNdgl2H3YndiB2IXYidiR2NHYw" + "djt2R3ZIdkZ2XHZYdmF2YnZodml2anZndmx2cHZydnZ2eHZ8doB2g3aIdot2jnaWdpN2mXaadrB2tHa4drl2unbCds121nbSdt524Xbldud26oYvdvt3CHcHdwR3KXckdx53JXcmdxt3N3c4d0d3Wndod2t3W3dld393fnd5d453i3eRd6B3nnewd7Z3uXe/d7x3vXe7" + "d8d3zXfXd9p33Hfjd+53/HgMeBJ5JnggeSp4RXiOeHR4hnh8eJp4jHijeLV4qniveNF4xnjLeNR4vni8eMV4ynjs////////eOd42nj9ePR5B3kSeRF5GXkseSt5QHlgeVd5X3laeVV5U3l6eX95inmdeaefS3mqea55s3m5ebp5yXnVeed57HnheeN6CHoNehh6GXog" + "eh95gHoxejt6Pno3ekN6V3pJemF6Ynppn516cHp5en16iHqXepV6mHqWeql6yHqw//96tnrFesR6v5CDesd6ynrNes961XrTetl62nrdeuF64nrmeu168HsCew97CnsGezN7GHsZex57NXsoezZ7UHt6ewR7TXsLe0x7RXt1e2V7dHtne3B7cXtse257nXuYe597jXuc" + "e5p7i3uSe497XXuZe8t7wXvMe897tHvGe9176XwRfBR75nvlfGB8AHwHfBN783v3fBd8DXv2fCN8J3wqfB98N3wrfD18THxDfFR8T3xAfFB8WHxffGR8VnxlfGx8dXyDfJB8pHytfKJ8q3yhfKh8s3yyfLF8rny5fL18wHzFfMJ82HzSfNx84ps7fO988nz0fPZ8+n0G" + "////////fQJ9HH0VfQp9RX1LfS59Mn0/fTV9Rn1zfVZ9Tn1yfWh9bn1PfWN9k32JfVt9j319fZt9un2ufaN9tX3Hfb19q349faJ9r33cfbh9n32wfdh93X3kfd59+33yfeF+BX4KfiN+IX4SfjF+H34Jfgt+In5GfmZ+O341fjl+Q343//9+Mn46fmd+XX5Wfl5+WX5a" + "fnl+an5pfnx+e36DfdV+fY+ufn9+iH6Jfox+kn6QfpN+lH6Wfo5+m36cfzh/On9Ff0x/TX9Of1B/UX9Vf1R/WH9ff2B/aH9pf2d/eH+Cf4Z/g3+If4d/jH+Uf55/nX+af6N/r3+yf7l/rn+2f7iLcX/Ff8Z/yn/Vf9R/4X/mf+l/83/5mNyABoAEgAuAEoAYgBmAHIAh" + "gCiAP4A7gEqARoBSgFiAWoBfgGKAaIBzgHKAcIB2gHmAfYB/gISAhoCFgJuAk4CagK1RkICsgNuA5YDZgN2AxIDagNaBCYDvgPGBG4EpgSOBL4FL////////louBRoE+gVOBUYD8gXGBboFlgWaBdIGDgYiBioGAgYKBoIGVgaSBo4FfgZOBqYGwgbWBvoG4gb2BwIHC" + "gbqByYHNgdGB2YHYgciB2oHfgeCB54H6gfuB/oIBggKCBYIHggqCDYIQghaCKYIrgjiCM4JAglmCWIJdglqCX4Jk//+CYoJogmqCa4IugnGCd4J4gn6CjYKSgquCn4K7gqyC4YLjgt+C0oL0gvOC+oOTgwOC+4L5gt6DBoLcgwmC2YM1gzSDFoMygzGDQIM5g1CDRYMv" + "gyuDF4MYg4WDmoOqg5+DooOWgyODjoOHg4qDfIO1g3ODdYOgg4mDqIP0hBOD64POg/2EA4PYhAuDwYP3hAeD4IPyhA2EIoQgg72EOIUGg/uEbYQqhDyFWoSEhHeEa4SthG6EgoRphEaELIRvhHmENYTKhGKEuYS/hJ+E2YTNhLuE2oTQhMGExoTWhKGFIYT/hPSFF4UY" + "hSyFH4UVhRSE/IVAhWOFWIVI////////hUGGAoVLhVWFgIWkhYiFkYWKhaiFbYWUhZuF6oWHhZyFd4V+hZCFyYW6hc+FuYXQhdWF3YXlhdyF+YYKhhOGC4X+hfqGBoYihhqGMIY/hk1OVYZUhl+GZ4ZxhpOGo4aphqqGi4aMhraGr4bEhsaGsIbJiCOGq4bUht6G6Ybs" + "//+G34bbhu+HEocGhwiHAIcDhvuHEYcJhw2G+YcKhzSHP4c3hzuHJYcphxqHYIdfh3iHTIdOh3SHV4doh26HWYdTh2OHaogFh6KHn4eCh6+Hy4e9h8CH0JbWh6uHxIezh8eHxoe7h++H8ofgiA+IDYf+h/aH94gOh9KIEYgWiBWIIoghiDGINog5iCeIO4hEiEKIUohZ" + "iF6IYohriIGIfoieiHWIfYi1iHKIgoiXiJKIroiZiKKIjYikiLCIv4ixiMOIxIjUiNiI2YjdiPmJAoj8iPSI6IjyiQSJDIkKiROJQ4keiSWJKokriUGJRIk7iTaJOIlMiR2JYIle////////iWaJZIltiWqJb4l0iXeJfomDiYiJiomTiZiJoYmpiaaJrImvibKJuom9" + "ib+JwInaidyJ3YnnifSJ+IoDihaKEIoMihuKHYolijaKQYpbilKKRopIinyKbYpsimKKhYqCioSKqIqhipGKpYqmipqKo4rEis2KworaiuuK84rn//+K5IrxixSK4IriiveK3orbiwyLB4saiuGLFosQixeLIIszl6uLJosriz6LKItBi0yLT4tOi0mLVotbi1qLa4tf" + "i2yLb4t0i32LgIuMi46LkouTi5aLmYuajDqMQYw/jEiMTIxOjFCMVYxijGyMeIx6jIKMiYyFjIqMjYyOjJSMfIyYYh2MrYyqjL2MsoyzjK6MtozIjMGM5IzjjNqM/Yz6jPuNBI0FjQqNB40PjQ2NEJ9OjROMzY0UjRaNZ41tjXGNc42BjZmNwo2+jbqNz43ajdaNzI3b" + "jcuN6o3rjd+N4438jgiOCY3/jh2OHo4Qjh+OQo41jjCONI5K////////jkeOSY5MjlCOSI5ZjmSOYI4qjmOOVY52jnKOfI6BjoeOhY6EjouOio6TjpGOlI6ZjqqOoY6sjrCOxo6xjr6OxY7IjsuO247jjvyO+47rjv6PCo8FjxWPEo8ZjxOPHI8fjxuPDI8mjzOPO485" + "j0WPQo8+j0yPSY9Gj06PV49c//+PYo9jj2SPnI+fj6OPrY+vj7eP2o/lj+KP6o/vkIeP9JAFj/mP+pARkBWQIZANkB6QFpALkCeQNpA1kDmP+JBPkFCQUZBSkA6QSZA+kFaQWJBekGiQb5B2lqiQcpCCkH2QgZCAkIqQiZCPkKiQr5CxkLWQ4pDkYkiQ25ECkRKRGZEy" + "kTCRSpFWkViRY5FlkWmRc5FykYuRiZGCkaKRq5GvkaqRtZG0kbqRwJHBkcmRy5HQkdaR35HhkduR/JH1kfaSHpH/khSSLJIVkhGSXpJXkkWSSZJkkkiSlZI/kkuSUJKckpaSk5KbklqSz5K5kreS6ZMPkvqTRJMu////////kxmTIpMakyOTOpM1kzuTXJNgk3yTbpNW" + "k7CTrJOtk5STuZPWk9eT6JPlk9iTw5Pdk9CTyJPklBqUFJQTlAOUB5QQlDaUK5Q1lCGUOpRBlFKURJRblGCUYpRelGqSKZRwlHWUd5R9lFqUfJR+lIGUf5WClYeVipWUlZaVmJWZ//+VoJWolaeVrZW8lbuVuZW+lcpv9pXDlc2VzJXVldSV1pXcleGV5ZXiliGWKJYu" + "li+WQpZMlk+WS5Z3llyWXpZdll+WZpZylmyWjZaYlpWWl5aqlqeWsZaylrCWtJa2lriWuZbOlsuWyZbNiU2W3JcNltWW+ZcElwaXCJcTlw6XEZcPlxaXGZcklyqXMJc5lz2XPpdEl0aXSJdCl0mXXJdgl2SXZpdoUtKXa5dxl3mXhZd8l4GXepeGl4uXj5eQl5yXqJem" + "l6OXs5e0l8OXxpfIl8uX3Jftn0+X8nrfl/aX9ZgPmAyYOJgkmCGYN5g9mEaYT5hLmGuYb5hw////////mHGYdJhzmKqYr5ixmLaYxJjDmMaY6ZjrmQOZCZkSmRSZGJkhmR2ZHpkkmSCZLJkumT2ZPplCmUmZRZlQmUuZUZlSmUyZVZmXmZiZpZmtma6ZvJnfmduZ3ZnY" + "mdGZ7ZnumfGZ8pn7mfiaAZoPmgWZ4poZmiuaN5pFmkKaQJpD//+aPppVmk2aW5pXml+aYpplmmSaaZprmmqarZqwmryawJrPmtGa05rUmt6a35rimuOa5prvmuua7pr0mvGa95r7mwabGJsamx+bIpsjmyWbJ5somymbKpsumy+bMptEm0ObT5tNm06bUZtYm3Sbk5uD" + "m5GblpuXm5+boJuom7SbwJvKm7mbxpvPm9Gb0pvjm+Kb5JvUm+GcOpvym/Gb8JwVnBScCZwTnAycBpwInBKcCpwEnC6cG5wlnCScIZwwnEecMpxGnD6cWpxgnGecdpx4nOec7JzwnQmdCJzrnQOdBp0qnSadr50jnR+dRJ0VnRKdQZ0/nT6dRp1I////////nV2dXp1k" + "nVGdUJ1ZnXKdiZ2Hnaudb516nZqdpJ2pnbKdxJ3BnbuduJ26ncadz53Cndmd0534nead7Z3vnf2eGp4bnh6edZ55nn2egZ6InouejJ6SnpWekZ6dnqWeqZ64nqqerZdhnsyezp7PntCe1J7cnt6e3Z7gnuWe6J7v//+e9J72nvee+Z77nvye/Z8Hnwh2t58VnyGfLJ8+" + "n0qfUp9Un2OfX59gn2GfZp9nn2yfap93n3Kfdp+Vn5yfoFgvaceQWXRkUdxxmf//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////" + "////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////" + "////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////" + "/////////////////////////////////////////////w=="; private static short[] UNICODE_TO_QR_KANJI = new short[65536]; static { // Unpack the Shift JIS table into a more computation-friendly form Arrays.fill(UNICODE_TO_QR_KANJI, (short)-1); byte[] bytes = Base64.getDecoder().decode(PACKED_QR_KANJI_TO_UNICODE); for (int i = 0; i < bytes.length; i += 2) { int j = ((bytes[i] & 0xFF) << 8) | (bytes[i + 1] & 0xFF); if (j == 0xFFFF) continue; if (UNICODE_TO_QR_KANJI[j] != -1) throw new AssertionError(); UNICODE_TO_QR_KANJI[j] = (short)(i / 2); } } } uTox/third_party/qrcodegen/qrcodegen/java/io/nayuki/qrcodegen/QrSegment.java0000600000175000001440000002437214003056224026323 0ustar rakusers/* * QR Code generator library (Java) * * Copyright (c) Project Nayuki. (MIT License) * https://www.nayuki.io/page/qr-code-generator-library * * 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. */ package io.nayuki.qrcodegen; import java.nio.charset.StandardCharsets; import java.util.ArrayList; import java.util.List; import java.util.Objects; import java.util.regex.Pattern; /** * Represents a character string to be encoded in a QR Code symbol. Each segment has * a mode, and a sequence of characters that is already encoded as a sequence of bits. * Instances of this class are immutable. *

This segment class imposes no length restrictions, but QR Codes have restrictions. * Even in the most favorable conditions, a QR Code can only hold 7089 characters of data. * Any segment longer than this is meaningless for the purpose of generating QR Codes.

*/ public final class QrSegment { /*---- Static factory functions ----*/ /** * Returns a segment representing the specified binary data encoded in byte mode. * @param data the binary data * @return a segment containing the data * @throws NullPointerException if the array is {@code null} */ public static QrSegment makeBytes(byte[] data) { Objects.requireNonNull(data); BitBuffer bb = new BitBuffer(); for (byte b : data) bb.appendBits(b & 0xFF, 8); return new QrSegment(Mode.BYTE, data.length, bb); } /** * Returns a segment representing the specified string of decimal digits encoded in numeric mode. * @param digits a string consisting of digits from 0 to 9 * @return a segment containing the data * @throws NullPointerException if the string is {@code null} * @throws IllegalArgumentException if the string contains non-digit characters */ public static QrSegment makeNumeric(String digits) { Objects.requireNonNull(digits); if (!NUMERIC_REGEX.matcher(digits).matches()) throw new IllegalArgumentException("String contains non-numeric characters"); BitBuffer bb = new BitBuffer(); int i; for (i = 0; i + 3 <= digits.length(); i += 3) // Process groups of 3 bb.appendBits(Integer.parseInt(digits.substring(i, i + 3)), 10); int rem = digits.length() - i; if (rem > 0) // 1 or 2 digits remaining bb.appendBits(Integer.parseInt(digits.substring(i)), rem * 3 + 1); return new QrSegment(Mode.NUMERIC, digits.length(), bb); } /** * Returns a segment representing the specified text string encoded in alphanumeric mode. * The characters allowed are: 0 to 9, A to Z (uppercase only), space, * dollar, percent, asterisk, plus, hyphen, period, slash, colon. * @param text a string of text, with only certain characters allowed * @return a segment containing the data * @throws NullPointerException if the string is {@code null} * @throws IllegalArgumentException if the string contains non-encodable characters */ public static QrSegment makeAlphanumeric(String text) { Objects.requireNonNull(text); if (!ALPHANUMERIC_REGEX.matcher(text).matches()) throw new IllegalArgumentException("String contains unencodable characters in alphanumeric mode"); BitBuffer bb = new BitBuffer(); int i; for (i = 0; i + 2 <= text.length(); i += 2) { // Process groups of 2 int temp = ALPHANUMERIC_CHARSET.indexOf(text.charAt(i)) * 45; temp += ALPHANUMERIC_CHARSET.indexOf(text.charAt(i + 1)); bb.appendBits(temp, 11); } if (i < text.length()) // 1 character remaining bb.appendBits(ALPHANUMERIC_CHARSET.indexOf(text.charAt(i)), 6); return new QrSegment(Mode.ALPHANUMERIC, text.length(), bb); } /** * Returns a new mutable list of zero or more segments to represent the specified Unicode text string. * The result may use various segment modes and switch modes to optimize the length of the bit stream. * @param text the text to be encoded, which can be any Unicode string * @return a list of segments containing the text * @throws NullPointerException if the text is {@code null} */ public static List makeSegments(String text) { Objects.requireNonNull(text); // Select the most efficient segment encoding automatically List result = new ArrayList<>(); if (text.equals("")); // Leave result empty else if (NUMERIC_REGEX.matcher(text).matches()) result.add(makeNumeric(text)); else if (ALPHANUMERIC_REGEX.matcher(text).matches()) result.add(makeAlphanumeric(text)); else result.add(makeBytes(text.getBytes(StandardCharsets.UTF_8))); return result; } /** * Returns a segment representing an Extended Channel Interpretation * (ECI) designator with the specified assignment value. * @param assignVal the ECI assignment number (see the AIM ECI specification) * @return a segment containing the data * @throws IllegalArgumentException if the value is outside the range [0, 106) */ public static QrSegment makeEci(int assignVal) { BitBuffer bb = new BitBuffer(); if (0 <= assignVal && assignVal < (1 << 7)) bb.appendBits(assignVal, 8); else if ((1 << 7) <= assignVal && assignVal < (1 << 14)) { bb.appendBits(2, 2); bb.appendBits(assignVal, 14); } else if ((1 << 14) <= assignVal && assignVal < 1000000) { bb.appendBits(6, 3); bb.appendBits(assignVal, 21); } else throw new IllegalArgumentException("ECI assignment value out of range"); return new QrSegment(Mode.ECI, 0, bb); } /*---- Instance fields ----*/ /** The mode indicator for this segment. Never {@code null}. */ public final Mode mode; /** The length of this segment's unencoded data, measured in characters. Always zero or positive. */ public final int numChars; /** The data bits of this segment. Accessed through {@link getBits()}. Not {@code null}. */ final BitBuffer data; /*---- Constructor ----*/ /** * Creates a new QR Code data segment with the specified parameters and data. * @param md the mode, which is not {@code null} * @param numCh the data length in characters, which is non-negative * @param data the data bits of this segment, which is not {@code null} * @throws NullPointerException if the mode or bit buffer is {@code null} * @throws IllegalArgumentException if the character count is negative */ public QrSegment(Mode md, int numCh, BitBuffer data) { Objects.requireNonNull(md); Objects.requireNonNull(data); if (numCh < 0) throw new IllegalArgumentException("Invalid value"); mode = md; numChars = numCh; this.data = data.clone(); // Make defensive copy } /*---- Methods ----*/ /** * Returns the data bits of this segment. * @return the data bits of this segment (not {@code null}) */ public BitBuffer getBits() { return data.clone(); // Make defensive copy } // Package-private helper function. static int getTotalBits(List segs, int version) { Objects.requireNonNull(segs); if (version < 1 || version > 40) throw new IllegalArgumentException("Version number out of range"); long result = 0; for (QrSegment seg : segs) { Objects.requireNonNull(seg); int ccbits = seg.mode.numCharCountBits(version); // Fail if segment length value doesn't fit in the length field's bit-width if (seg.numChars >= (1 << ccbits)) return -1; result += 4L + ccbits + seg.data.bitLength(); if (result > Integer.MAX_VALUE) return -1; } return (int)result; } /*---- Constants ----*/ /** Can test whether a string is encodable in numeric mode (such as by using {@link #makeNumeric(String)}). */ public static final Pattern NUMERIC_REGEX = Pattern.compile("[0-9]*"); /** Can test whether a string is encodable in alphanumeric mode (such as by using {@link #makeAlphanumeric(String)}). */ public static final Pattern ALPHANUMERIC_REGEX = Pattern.compile("[A-Z0-9 $%*+./:-]*"); /** The set of all legal characters in alphanumeric mode, where each character value maps to the index in the string. */ private static final String ALPHANUMERIC_CHARSET = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ $%*+-./:"; /*---- Public helper enumeration ----*/ /** * The mode field of a segment. Immutable. Provides methods to retrieve closely related values. */ public enum Mode { /*-- Constants --*/ NUMERIC (0x1, 10, 12, 14), ALPHANUMERIC(0x2, 9, 11, 13), BYTE (0x4, 8, 16, 16), KANJI (0x8, 8, 10, 12), ECI (0x7, 0, 0, 0); /*-- Fields --*/ /** An unsigned 4-bit integer value (range 0 to 15) representing the mode indicator bits for this mode object. */ final int modeBits; private final int[] numBitsCharCount; /*-- Constructor --*/ private Mode(int mode, int... ccbits) { this.modeBits = mode; numBitsCharCount = ccbits; } /*-- Method --*/ /** * Returns the bit width of the segment character count field for this mode object at the specified version number. * @param ver the version number, which is between 1 to 40, inclusive * @return the number of bits for the character count, which is between 8 to 16, inclusive * @throws IllegalArgumentException if the version number is out of range */ int numCharCountBits(int ver) { if ( 1 <= ver && ver <= 9) return numBitsCharCount[0]; else if (10 <= ver && ver <= 26) return numBitsCharCount[1]; else if (27 <= ver && ver <= 40) return numBitsCharCount[2]; else throw new IllegalArgumentException("Version number out of range"); } } } uTox/third_party/qrcodegen/qrcodegen/java/io/nayuki/qrcodegen/QrCodeGeneratorWorker.java0000600000175000001440000000712414003056224030630 0ustar rakusers/* * QR Code generator test worker (Java) * * This program reads data and encoding parameters from standard input and writes * QR Code bitmaps to standard output. The I/O format is one integer per line. * Run with no command line arguments. The program is intended for automated * batch testing of end-to-end functionality of this QR Code generator library. * * Copyright (c) Project Nayuki. (MIT License) * https://www.nayuki.io/page/qr-code-generator-library * * 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. */ package io.nayuki.qrcodegen; import java.nio.charset.StandardCharsets; import java.util.Arrays; import java.util.List; import java.util.Scanner; public final class QrCodeGeneratorWorker { public static void main(String[] args) { // Set up input stream and start loop try (Scanner input = new Scanner(System.in, "US-ASCII")) { input.useDelimiter("\r\n|\n|\r"); while (processCase(input)); } } private static boolean processCase(Scanner input) { // Read data length or exit int length = input.nextInt(); if (length == -1) return false; if (length > Short.MAX_VALUE) throw new RuntimeException(); // Read data bytes boolean isAscii = true; byte[] data = new byte[length]; for (int i = 0; i < data.length; i++) { int b = input.nextInt(); if (b < 0 || b > 255) throw new RuntimeException(); data[i] = (byte)b; isAscii &= b < 128; } // Read encoding parameters int errCorLvl = input.nextInt(); int minVersion = input.nextInt(); int maxVersion = input.nextInt(); int mask = input.nextInt(); int boostEcl = input.nextInt(); if (!(0 <= errCorLvl && errCorLvl <= 3) || !(-1 <= mask && mask <= 7) || (boostEcl >>> 1) != 0 || !(QrCode.MIN_VERSION <= minVersion && minVersion <= maxVersion && maxVersion <= QrCode.MAX_VERSION)) throw new RuntimeException(); // Make segments for encoding List segs; if (isAscii) segs = QrSegment.makeSegments(new String(data, StandardCharsets.US_ASCII)); else segs = Arrays.asList(QrSegment.makeBytes(data)); try { // Try to make QR Code symbol QrCode qr = QrCode.encodeSegments(segs, QrCode.Ecc.values()[errCorLvl], minVersion, maxVersion, mask, boostEcl != 0); // Print grid of modules System.out.println(qr.version); for (int y = 0; y < qr.size; y++) { for (int x = 0; x < qr.size; x++) System.out.println(qr.getModule(x, y) ? 1 : 0); } } catch (IllegalArgumentException e) { if (!e.getMessage().equals("Data too long")) throw e; System.out.println(-1); } System.out.flush(); return true; } } uTox/third_party/qrcodegen/qrcodegen/java/io/nayuki/qrcodegen/QrCodeGeneratorDemo.java0000600000175000001440000002036014003056224030240 0ustar rakusers/* * QR Code generator demo (Java) * * Run this command-line program with no arguments. The program creates/overwrites a bunch of * PNG and SVG files in the current working directory to demonstrate the creation of QR Codes. * * Copyright (c) Project Nayuki. (MIT License) * https://www.nayuki.io/page/qr-code-generator-library * * 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. */ package io.nayuki.qrcodegen; import java.awt.image.BufferedImage; import java.io.File; import java.io.FileOutputStream; import java.io.IOException; import java.io.OutputStreamWriter; import java.io.Writer; import java.nio.charset.StandardCharsets; import java.util.Arrays; import java.util.List; import javax.imageio.ImageIO; public final class QrCodeGeneratorDemo { // The main application program. public static void main(String[] args) throws IOException { doBasicDemo(); doVarietyDemo(); doSegmentDemo(); doMaskDemo(); } /*---- Demo suite ----*/ // Creates a single QR Code, then writes it to a PNG file and an SVG file. private static void doBasicDemo() throws IOException { String text = "Hello, world!"; // User-supplied Unicode text QrCode.Ecc errCorLvl = QrCode.Ecc.LOW; // Error correction level QrCode qr = QrCode.encodeText(text, errCorLvl); // Make the QR Code symbol BufferedImage img = qr.toImage(10, 4); // Convert to bitmap image File imgFile = new File("hello-world-QR.png"); // File path for output ImageIO.write(img, "png", imgFile); // Write image to file String svg = qr.toSvgString(4); // Convert to SVG XML code try (Writer out = new OutputStreamWriter( new FileOutputStream("hello-world-QR.svg"), StandardCharsets.UTF_8)) { out.write(svg); // Create/overwrite file and write SVG data } } // Creates a variety of QR Codes that exercise different features of the library, and writes each one to file. private static void doVarietyDemo() throws IOException { QrCode qr; // Numeric mode encoding (3.33 bits per digit) qr = QrCode.encodeText("314159265358979323846264338327950288419716939937510", QrCode.Ecc.MEDIUM); writePng(qr.toImage(13, 1), "pi-digits-QR.png"); // Alphanumeric mode encoding (5.5 bits per character) qr = QrCode.encodeText("DOLLAR-AMOUNT:$39.87 PERCENTAGE:100.00% OPERATIONS:+-*/", QrCode.Ecc.HIGH); writePng(qr.toImage(10, 2), "alphanumeric-QR.png"); // Unicode text as UTF-8 qr = QrCode.encodeText("こんにちwa、世界！ αβγδ", QrCode.Ecc.QUARTILE); writePng(qr.toImage(10, 3), "unicode-QR.png"); // Moderately large QR Code using longer text (from Lewis Carroll's Alice in Wonderland) qr = QrCode.encodeText( "Alice was beginning to get very tired of sitting by her sister on the bank, " + "and of having nothing to do: once or twice she had peeped into the book her sister was reading, " + "but it had no pictures or conversations in it, 'and what is the use of a book,' thought Alice " + "'without pictures or conversations?' So she was considering in her own mind (as well as she could, " + "for the hot day made her feel very sleepy and stupid), whether the pleasure of making a " + "daisy-chain would be worth the trouble of getting up and picking the daisies, when suddenly " + "a White Rabbit with pink eyes ran close by her.", QrCode.Ecc.HIGH); writePng(qr.toImage(6, 10), "alice-wonderland-QR.png"); } // Creates QR Codes with manually specified segments for better compactness. private static void doSegmentDemo() throws IOException { QrCode qr; List segs; // Illustration "silver" String silver0 = "THE SQUARE ROOT OF 2 IS 1."; String silver1 = "41421356237309504880168872420969807856967187537694807317667973799"; qr = QrCode.encodeText(silver0 + silver1, QrCode.Ecc.LOW); writePng(qr.toImage(10, 3), "sqrt2-monolithic-QR.png"); segs = Arrays.asList( QrSegment.makeAlphanumeric(silver0), QrSegment.makeNumeric(silver1)); qr = QrCode.encodeSegments(segs, QrCode.Ecc.LOW); writePng(qr.toImage(10, 3), "sqrt2-segmented-QR.png"); // Illustration "golden" String golden0 = "Golden ratio φ = 1."; String golden1 = "6180339887498948482045868343656381177203091798057628621354486227052604628189024497072072041893911374"; String golden2 = "......"; qr = QrCode.encodeText(golden0 + golden1 + golden2, QrCode.Ecc.LOW); writePng(qr.toImage(8, 5), "phi-monolithic-QR.png"); segs = Arrays.asList( QrSegment.makeBytes(golden0.getBytes(StandardCharsets.UTF_8)), QrSegment.makeNumeric(golden1), QrSegment.makeAlphanumeric(golden2)); qr = QrCode.encodeSegments(segs, QrCode.Ecc.LOW); writePng(qr.toImage(8, 5), "phi-segmented-QR.png"); // Illustration "Madoka": kanji, kana, Greek, Cyrillic, full-width Latin characters String madoka = "「魔法少女まどか☆マギカ」って、　ИАИ　ｄｅｓｕ　κα？"; qr = QrCode.encodeText(madoka, QrCode.Ecc.LOW); writePng(qr.toImage(9, 4), "madoka-utf8-QR.png"); int[] kanjiChars = { // Kanji mode encoding (13 bits per character) 0x0035, 0x1002, 0x0FC0, 0x0AED, 0x0AD7, 0x015C, 0x0147, 0x0129, 0x0059, 0x01BD, 0x018D, 0x018A, 0x0036, 0x0141, 0x0144, 0x0001, 0x0000, 0x0249, 0x0240, 0x0249, 0x0000, 0x0104, 0x0105, 0x0113, 0x0115, 0x0000, 0x0208, 0x01FF, 0x0008, }; BitBuffer bb = new BitBuffer(); for (int c : kanjiChars) bb.appendBits(c, 13); segs = Arrays.asList(new QrSegment(QrSegment.Mode.KANJI, kanjiChars.length, bb)); qr = QrCode.encodeSegments(segs, QrCode.Ecc.LOW); writePng(qr.toImage(9, 4), "madoka-kanji-QR.png"); } // Creates QR Codes with the same size and contents but different mask patterns. private static void doMaskDemo() throws IOException { QrCode qr; List segs; // Project Nayuki URL segs = QrSegment.makeSegments("https://www.nayuki.io/"); qr = QrCode.encodeSegments(segs, QrCode.Ecc.HIGH, QrCode.MIN_VERSION, QrCode.MAX_VERSION, -1, true); // Automatic mask writePng(qr.toImage(8, 6), "project-nayuki-automask-QR.png"); qr = QrCode.encodeSegments(segs, QrCode.Ecc.HIGH, QrCode.MIN_VERSION, QrCode.MAX_VERSION, 3, true); // Force mask 3 writePng(qr.toImage(8, 6), "project-nayuki-mask3-QR.png"); // Chinese text as UTF-8 segs = QrSegment.makeSegments("維基百科（Wikipedia，聆聽i/ˌwɪkᵻˈpiːdi.ə/）是一個自由內容、公開編輯且多語言的網路百科全書協作計畫"); qr = QrCode.encodeSegments(segs, QrCode.Ecc.MEDIUM, QrCode.MIN_VERSION, QrCode.MAX_VERSION, 0, true); // Force mask 0 writePng(qr.toImage(10, 3), "unicode-mask0-QR.png"); qr = QrCode.encodeSegments(segs, QrCode.Ecc.MEDIUM, QrCode.MIN_VERSION, QrCode.MAX_VERSION, 1, true); // Force mask 1 writePng(qr.toImage(10, 3), "unicode-mask1-QR.png"); qr = QrCode.encodeSegments(segs, QrCode.Ecc.MEDIUM, QrCode.MIN_VERSION, QrCode.MAX_VERSION, 5, true); // Force mask 5 writePng(qr.toImage(10, 3), "unicode-mask5-QR.png"); qr = QrCode.encodeSegments(segs, QrCode.Ecc.MEDIUM, QrCode.MIN_VERSION, QrCode.MAX_VERSION, 7, true); // Force mask 7 writePng(qr.toImage(10, 3), "unicode-mask7-QR.png"); } /*---- Utilities ----*/ // Helper function to reduce code duplication. private static void writePng(BufferedImage img, String filepath) throws IOException { ImageIO.write(img, "png", new File(filepath)); } } uTox/third_party/qrcodegen/qrcodegen/java/io/nayuki/qrcodegen/QrCode.java0000600000175000001440000010464214003056224025572 0ustar rakusers/* * QR Code generator library (Java) * * Copyright (c) Project Nayuki. (MIT License) * https://www.nayuki.io/page/qr-code-generator-library * * 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. */ package io.nayuki.qrcodegen; import java.awt.image.BufferedImage; import java.util.Arrays; import java.util.List; import java.util.Objects; /** * Represents an immutable square grid of black and white cells for a QR Code symbol, and * provides static functions to create a QR Code from user-supplied textual or binary data. *

This class covers the QR Code model 2 specification, supporting all versions (sizes) * from 1 to 40, all 4 error correction levels, and only 3 character encoding modes.

*/ public final class QrCode { /*---- Public static factory functions ----*/ /** * Returns a QR Code symbol representing the specified Unicode text string at the specified error correction level. * As a conservative upper bound, this function is guaranteed to succeed for strings that have 738 or fewer * Unicode code points (not UTF-16 code units) if the low error correction level is used. The smallest possible * QR Code version is automatically chosen for the output. The ECC level of the result may be higher than the * ecl argument if it can be done without increasing the version. * @param text the text to be encoded, which can be any Unicode string * @param ecl the error correction level to use (will be boosted) * @return a QR Code representing the text * @throws NullPointerException if the text or error correction level is {@code null} * @throws IllegalArgumentException if the text fails to fit in the largest version QR Code, which means it is too long */ public static QrCode encodeText(String text, Ecc ecl) { Objects.requireNonNull(text); Objects.requireNonNull(ecl); List segs = QrSegment.makeSegments(text); return encodeSegments(segs, ecl); } /** * Returns a QR Code symbol representing the specified binary data string at the specified error correction level. * This function always encodes using the binary segment mode, not any text mode. The maximum number of * bytes allowed is 2953. The smallest possible QR Code version is automatically chosen for the output. * The ECC level of the result may be higher than the ecl argument if it can be done without increasing the version. * @param data the binary data to encode * @param ecl the error correction level to use (will be boosted) * @return a QR Code representing the binary data * @throws NullPointerException if the data or error correction level is {@code null} * @throws IllegalArgumentException if the data fails to fit in the largest version QR Code, which means it is too long */ public static QrCode encodeBinary(byte[] data, Ecc ecl) { Objects.requireNonNull(data); Objects.requireNonNull(ecl); QrSegment seg = QrSegment.makeBytes(data); return encodeSegments(Arrays.asList(seg), ecl); } /** * Returns a QR Code symbol representing the specified data segments at the specified error correction * level or higher. The smallest possible QR Code version is automatically chosen for the output. *

This function allows the user to create a custom sequence of segments that switches * between modes (such as alphanumeric and binary) to encode text more efficiently. * This function is considered to be lower level than simply encoding text or binary data.

* @param segs the segments to encode * @param ecl the error correction level to use (will be boosted) * @return a QR Code representing the segments * @throws NullPointerException if the list of segments, a segment, or the error correction level is {@code null} * @throws IllegalArgumentException if the data is too long to fit in the largest version QR Code at the ECL */ public static QrCode encodeSegments(List segs, Ecc ecl) { return encodeSegments(segs, ecl, MIN_VERSION, MAX_VERSION, -1, true); } /** * Returns a QR Code symbol representing the specified data segments with the specified encoding parameters. * The smallest possible QR Code version within the specified range is automatically chosen for the output. *

This function allows the user to create a custom sequence of segments that switches * between modes (such as alphanumeric and binary) to encode text more efficiently. * This function is considered to be lower level than simply encoding text or binary data.

* @param segs the segments to encode * @param ecl the error correction level to use (may be boosted) * @param minVersion the minimum allowed version of the QR symbol (at least 1) * @param maxVersion the maximum allowed version of the QR symbol (at most 40) * @param mask the mask pattern to use, which is either -1 for automatic choice or from 0 to 7 for fixed choice * @param boostEcl increases the error correction level if it can be done without increasing the version number * @return a QR Code representing the segments * @throws NullPointerException if the list of segments, a segment, or the error correction level is {@code null} * @throws IllegalArgumentException if 1 ≤ minVersion ≤ maxVersion ≤ 40 is violated, or if mask * < −1 or mask > 7, or if the data is too long to fit in a QR Code at maxVersion at the ECL */ public static QrCode encodeSegments(List segs, Ecc ecl, int minVersion, int maxVersion, int mask, boolean boostEcl) { Objects.requireNonNull(segs); Objects.requireNonNull(ecl); if (!(MIN_VERSION <= minVersion && minVersion <= maxVersion && maxVersion <= MAX_VERSION) || mask < -1 || mask > 7) throw new IllegalArgumentException("Invalid value"); // Find the minimal version number to use int version, dataUsedBits; for (version = minVersion; ; version++) { int dataCapacityBits = getNumDataCodewords(version, ecl) * 8; // Number of data bits available dataUsedBits = QrSegment.getTotalBits(segs, version); if (dataUsedBits != -1 && dataUsedBits <= dataCapacityBits) break; // This version number is found to be suitable if (version >= maxVersion) // All versions in the range could not fit the given data throw new IllegalArgumentException("Data too long"); } if (dataUsedBits == -1) throw new AssertionError(); // Increase the error correction level while the data still fits in the current version number for (Ecc newEcl : Ecc.values()) { if (boostEcl && dataUsedBits <= getNumDataCodewords(version, newEcl) * 8) ecl = newEcl; } // Create the data bit string by concatenating all segments int dataCapacityBits = getNumDataCodewords(version, ecl) * 8; BitBuffer bb = new BitBuffer(); for (QrSegment seg : segs) { bb.appendBits(seg.mode.modeBits, 4); bb.appendBits(seg.numChars, seg.mode.numCharCountBits(version)); bb.appendData(seg); } // Add terminator and pad up to a byte if applicable bb.appendBits(0, Math.min(4, dataCapacityBits - bb.bitLength())); bb.appendBits(0, (8 - bb.bitLength() % 8) % 8); // Pad with alternate bytes until data capacity is reached for (int padByte = 0xEC; bb.bitLength() < dataCapacityBits; padByte ^= 0xEC ^ 0x11) bb.appendBits(padByte, 8); if (bb.bitLength() % 8 != 0) throw new AssertionError(); // Create the QR Code symbol return new QrCode(version, ecl, bb.getBytes(), mask); } /*---- Public constants ----*/ public static final int MIN_VERSION = 1; public static final int MAX_VERSION = 40; /*---- Instance fields ----*/ // Public immutable scalar parameters /** This QR Code symbol's version number, which is always between 1 and 40 (inclusive). */ public final int version; /** The width and height of this QR Code symbol, measured in modules. * Always equal to version × 4 + 17, in the range 21 to 177. */ public final int size; /** The error correction level used in this QR Code symbol. Never {@code null}. */ public final Ecc errorCorrectionLevel; /** The mask pattern used in this QR Code symbol, in the range 0 to 7 (i.e. unsigned 3-bit integer). * Note that even if a constructor was called with automatic masking requested * (mask = -1), the resulting object will still have a mask value between 0 and 7. */ public final int mask; // Private grids of modules/pixels (conceptually immutable) private boolean[][] modules; // The modules of this QR Code symbol (false = white, true = black) private boolean[][] isFunction; // Indicates function modules that are not subjected to masking /*---- Constructors ----*/ /** * Creates a new QR Code symbol with the specified version number, error correction level, binary data array, and mask number. *

This is a cumbersome low-level constructor that should not be invoked directly by the user. * To go one level up, see the {@link #encodeSegments(List,Ecc)} function.

* @param ver the version number to use, which must be in the range 1 to 40, inclusive * @param ecl the error correction level to use * @param dataCodewords the raw binary user data to encode * @param mask the mask pattern to use, which is either -1 for automatic choice or from 0 to 7 for fixed choice * @throws NullPointerException if the byte array or error correction level is {@code null} * @throws IllegalArgumentException if the version or mask value is out of range */ public QrCode(int ver, Ecc ecl, byte[] dataCodewords, int mask) { // Check arguments Objects.requireNonNull(ecl); if (ver < MIN_VERSION || ver > MAX_VERSION || mask < -1 || mask > 7) throw new IllegalArgumentException("Value out of range"); Objects.requireNonNull(dataCodewords); // Initialize fields version = ver; size = ver * 4 + 17; errorCorrectionLevel = ecl; modules = new boolean[size][size]; // Entirely white grid isFunction = new boolean[size][size]; // Draw function patterns, draw all codewords, do masking drawFunctionPatterns(); byte[] allCodewords = appendErrorCorrection(dataCodewords); drawCodewords(allCodewords); this.mask = handleConstructorMasking(mask); } /*---- Public instance methods ----*/ /** * Returns the color of the module (pixel) at the specified coordinates, which is either * false for white or true for black. The top left corner has the coordinates (x=0, y=0). * If the specified coordinates are out of bounds, then false (white) is returned. * @param x the x coordinate, where 0 is the left edge and size−1 is the right edge * @param y the y coordinate, where 0 is the top edge and size−1 is the bottom edge * @return the module's color, which is either false (white) or true (black) */ public boolean getModule(int x, int y) { return 0 <= x && x < size && 0 <= y && y < size && modules[y][x]; } /** * Returns a new image object representing this QR Code, with the specified module scale and number * of border modules. For example, the arguments scale=10, border=4 means to pad the QR Code symbol * with 4 white border modules on all four edges, then use 10*10 pixels to represent each module. * The resulting image only contains the hex colors 000000 and FFFFFF. * @param scale the module scale factor, which must be positive * @param border the number of border modules to add, which must be non-negative * @return an image representing this QR Code, with padding and scaling * @throws IllegalArgumentException if the scale or border is out of range */ public BufferedImage toImage(int scale, int border) { if (scale <= 0 || border < 0) throw new IllegalArgumentException("Value out of range"); BufferedImage result = new BufferedImage((size + border * 2) * scale, (size + border * 2) * scale, BufferedImage.TYPE_INT_RGB); for (int y = 0; y < result.getHeight(); y++) { for (int x = 0; x < result.getWidth(); x++) { boolean val = getModule(x / scale - border, y / scale - border); result.setRGB(x, y, val ? 0x000000 : 0xFFFFFF); } } return result; } /** * Based on the specified number of border modules to add as padding, this returns a * string whose contents represents an SVG XML file that depicts this QR Code symbol. * Note that Unix newlines (\n) are always used, regardless of the platform. * @param border the number of border modules to add, which must be non-negative * @return a string representing this QR Code as an SVG document */ public String toSvgString(int border) { if (border < 0) throw new IllegalArgumentException("Border must be non-negative"); StringBuilder sb = new StringBuilder(); sb.append("\n"); sb.append("\n"); sb.append(String.format( "\n", size + border * 2)); sb.append("\t\n"); sb.append("\t\n"); sb.append("\n"); return sb.toString(); } /*---- Private helper methods for constructor: Drawing function modules ----*/ private void drawFunctionPatterns() { // Draw horizontal and vertical timing patterns for (int i = 0; i < size; i++) { setFunctionModule(6, i, i % 2 == 0); setFunctionModule(i, 6, i % 2 == 0); } // Draw 3 finder patterns (all corners except bottom right; overwrites some timing modules) drawFinderPattern(3, 3); drawFinderPattern(size - 4, 3); drawFinderPattern(3, size - 4); // Draw numerous alignment patterns int[] alignPatPos = getAlignmentPatternPositions(version); int numAlign = alignPatPos.length; for (int i = 0; i < numAlign; i++) { for (int j = 0; j < numAlign; j++) { if (i == 0 && j == 0 || i == 0 && j == numAlign - 1 || i == numAlign - 1 && j == 0) continue; // Skip the three finder corners else drawAlignmentPattern(alignPatPos[i], alignPatPos[j]); } } // Draw configuration data drawFormatBits(0); // Dummy mask value; overwritten later in the constructor drawVersion(); } // Draws two copies of the format bits (with its own error correction code) // based on the given mask and this object's error correction level field. private void drawFormatBits(int mask) { // Calculate error correction code and pack bits int data = errorCorrectionLevel.formatBits << 3 | mask; // errCorrLvl is uint2, mask is uint3 int rem = data; for (int i = 0; i < 10; i++) rem = (rem << 1) ^ ((rem >>> 9) * 0x537); data = data << 10 | rem; data ^= 0x5412; // uint15 if (data >>> 15 != 0) throw new AssertionError(); // Draw first copy for (int i = 0; i <= 5; i++) setFunctionModule(8, i, ((data >>> i) & 1) != 0); setFunctionModule(8, 7, ((data >>> 6) & 1) != 0); setFunctionModule(8, 8, ((data >>> 7) & 1) != 0); setFunctionModule(7, 8, ((data >>> 8) & 1) != 0); for (int i = 9; i < 15; i++) setFunctionModule(14 - i, 8, ((data >>> i) & 1) != 0); // Draw second copy for (int i = 0; i <= 7; i++) setFunctionModule(size - 1 - i, 8, ((data >>> i) & 1) != 0); for (int i = 8; i < 15; i++) setFunctionModule(8, size - 15 + i, ((data >>> i) & 1) != 0); setFunctionModule(8, size - 8, true); } // Draws two copies of the version bits (with its own error correction code), // based on this object's version field (which only has an effect for 7 <= version <= 40). private void drawVersion() { if (version < 7) return; // Calculate error correction code and pack bits int rem = version; // version is uint6, in the range [7, 40] for (int i = 0; i < 12; i++) rem = (rem << 1) ^ ((rem >>> 11) * 0x1F25); int data = version << 12 | rem; // uint18 if (data >>> 18 != 0) throw new AssertionError(); // Draw two copies for (int i = 0; i < 18; i++) { boolean bit = ((data >>> i) & 1) != 0; int a = size - 11 + i % 3, b = i / 3; setFunctionModule(a, b, bit); setFunctionModule(b, a, bit); } } // Draws a 9*9 finder pattern including the border separator, with the center module at (x, y). private void drawFinderPattern(int x, int y) { for (int i = -4; i <= 4; i++) { for (int j = -4; j <= 4; j++) { int dist = Math.max(Math.abs(i), Math.abs(j)); // Chebyshev/infinity norm int xx = x + j, yy = y + i; if (0 <= xx && xx < size && 0 <= yy && yy < size) setFunctionModule(xx, yy, dist != 2 && dist != 4); } } } // Draws a 5*5 alignment pattern, with the center module at (x, y). private void drawAlignmentPattern(int x, int y) { for (int i = -2; i <= 2; i++) { for (int j = -2; j <= 2; j++) setFunctionModule(x + j, y + i, Math.max(Math.abs(i), Math.abs(j)) != 1); } } // Sets the color of a module and marks it as a function module. // Only used by the constructor. Coordinates must be in range. private void setFunctionModule(int x, int y, boolean isBlack) { modules[y][x] = isBlack; isFunction[y][x] = true; } /*---- Private helper methods for constructor: Codewords and masking ----*/ // Returns a new byte string representing the given data with the appropriate error correction // codewords appended to it, based on this object's version and error correction level. private byte[] appendErrorCorrection(byte[] data) { if (data.length != getNumDataCodewords(version, errorCorrectionLevel)) throw new IllegalArgumentException(); // Calculate parameter numbers int numBlocks = NUM_ERROR_CORRECTION_BLOCKS[errorCorrectionLevel.ordinal()][version]; int blockEccLen = ECC_CODEWORDS_PER_BLOCK[errorCorrectionLevel.ordinal()][version]; int rawCodewords = getNumRawDataModules(version) / 8; int numShortBlocks = numBlocks - rawCodewords % numBlocks; int shortBlockLen = rawCodewords / numBlocks; // Split data into blocks and append ECC to each block byte[][] blocks = new byte[numBlocks][]; ReedSolomonGenerator rs = new ReedSolomonGenerator(blockEccLen); for (int i = 0, k = 0; i < numBlocks; i++) { byte[] dat = Arrays.copyOfRange(data, k, k + shortBlockLen - blockEccLen + (i < numShortBlocks ? 0 : 1)); byte[] block = Arrays.copyOf(dat, shortBlockLen + 1); k += dat.length; byte[] ecc = rs.getRemainder(dat); System.arraycopy(ecc, 0, block, block.length - blockEccLen, ecc.length); blocks[i] = block; } // Interleave (not concatenate) the bytes from every block into a single sequence byte[] result = new byte[rawCodewords]; for (int i = 0, k = 0; i < blocks[0].length; i++) { for (int j = 0; j < blocks.length; j++) { // Skip the padding byte in short blocks if (i != shortBlockLen - blockEccLen || j >= numShortBlocks) { result[k] = blocks[j][i]; k++; } } } return result; } // Draws the given sequence of 8-bit codewords (data and error correction) onto the entire // data area of this QR Code symbol. Function modules need to be marked off before this is called. private void drawCodewords(byte[] data) { Objects.requireNonNull(data); if (data.length != getNumRawDataModules(version) / 8) throw new IllegalArgumentException(); int i = 0; // Bit index into the data // Do the funny zigzag scan for (int right = size - 1; right >= 1; right -= 2) { // Index of right column in each column pair if (right == 6) right = 5; for (int vert = 0; vert < size; vert++) { // Vertical counter for (int j = 0; j < 2; j++) { int x = right - j; // Actual x coordinate boolean upward = ((right + 1) & 2) == 0; int y = upward ? size - 1 - vert : vert; // Actual y coordinate if (!isFunction[y][x] && i < data.length * 8) { modules[y][x] = ((data[i >>> 3] >>> (7 - (i & 7))) & 1) != 0; i++; } // If there are any remainder bits (0 to 7), they are already // set to 0/false/white when the grid of modules was initialized } } } if (i != data.length * 8) throw new AssertionError(); } // XORs the data modules in this QR Code with the given mask pattern. Due to XOR's mathematical // properties, calling applyMask(m) twice with the same value is equivalent to no change at all. // This means it is possible to apply a mask, undo it, and try another mask. Note that a final // well-formed QR Code symbol needs exactly one mask applied (not zero, not two, etc.). private void applyMask(int mask) { if (mask < 0 || mask > 7) throw new IllegalArgumentException("Mask value out of range"); for (int y = 0; y < size; y++) { for (int x = 0; x < size; x++) { boolean invert; switch (mask) { case 0: invert = (x + y) % 2 == 0; break; case 1: invert = y % 2 == 0; break; case 2: invert = x % 3 == 0; break; case 3: invert = (x + y) % 3 == 0; break; case 4: invert = (x / 3 + y / 2) % 2 == 0; break; case 5: invert = x * y % 2 + x * y % 3 == 0; break; case 6: invert = (x * y % 2 + x * y % 3) % 2 == 0; break; case 7: invert = ((x + y) % 2 + x * y % 3) % 2 == 0; break; default: throw new AssertionError(); } modules[y][x] ^= invert & !isFunction[y][x]; } } } // A messy helper function for the constructors. This QR Code must be in an unmasked state when this // method is called. The given argument is the requested mask, which is -1 for auto or 0 to 7 for fixed. // This method applies and returns the actual mask chosen, from 0 to 7. private int handleConstructorMasking(int mask) { if (mask == -1) { // Automatically choose best mask int minPenalty = Integer.MAX_VALUE; for (int i = 0; i < 8; i++) { drawFormatBits(i); applyMask(i); int penalty = getPenaltyScore(); if (penalty < minPenalty) { mask = i; minPenalty = penalty; } applyMask(i); // Undoes the mask due to XOR } } if (mask < 0 || mask > 7) throw new AssertionError(); drawFormatBits(mask); // Overwrite old format bits applyMask(mask); // Apply the final choice of mask return mask; // The caller shall assign this value to the final-declared field } // Calculates and returns the penalty score based on state of this QR Code's current modules. // This is used by the automatic mask choice algorithm to find the mask pattern that yields the lowest score. private int getPenaltyScore() { int result = 0; // Adjacent modules in row having same color for (int y = 0; y < size; y++) { boolean colorX = false; for (int x = 0, runX = 0; x < size; x++) { if (x == 0 || modules[y][x] != colorX) { colorX = modules[y][x]; runX = 1; } else { runX++; if (runX == 5) result += PENALTY_N1; else if (runX > 5) result++; } } } // Adjacent modules in column having same color for (int x = 0; x < size; x++) { boolean colorY = false; for (int y = 0, runY = 0; y < size; y++) { if (y == 0 || modules[y][x] != colorY) { colorY = modules[y][x]; runY = 1; } else { runY++; if (runY == 5) result += PENALTY_N1; else if (runY > 5) result++; } } } // 2*2 blocks of modules having same color for (int y = 0; y < size - 1; y++) { for (int x = 0; x < size - 1; x++) { boolean color = modules[y][x]; if ( color == modules[y][x + 1] && color == modules[y + 1][x] && color == modules[y + 1][x + 1]) result += PENALTY_N2; } } // Finder-like pattern in rows for (int y = 0; y < size; y++) { for (int x = 0, bits = 0; x < size; x++) { bits = ((bits << 1) & 0x7FF) | (modules[y][x] ? 1 : 0); if (x >= 10 && (bits == 0x05D || bits == 0x5D0)) // Needs 11 bits accumulated result += PENALTY_N3; } } // Finder-like pattern in columns for (int x = 0; x < size; x++) { for (int y = 0, bits = 0; y < size; y++) { bits = ((bits << 1) & 0x7FF) | (modules[y][x] ? 1 : 0); if (y >= 10 && (bits == 0x05D || bits == 0x5D0)) // Needs 11 bits accumulated result += PENALTY_N3; } } // Balance of black and white modules int black = 0; for (boolean[] row : modules) { for (boolean color : row) { if (color) black++; } } int total = size * size; // Find smallest k such that (45-5k)% <= dark/total <= (55+5k)% for (int k = 0; black*20 < (9-k)*total || black*20 > (11+k)*total; k++) result += PENALTY_N4; return result; } /*---- Private static helper functions ----*/ // Returns a set of positions of the alignment patterns in ascending order. These positions are // used on both the x and y axes. Each value in the resulting array is in the range [0, 177). // This stateless pure function could be implemented as table of 40 variable-length lists of unsigned bytes. private static int[] getAlignmentPatternPositions(int ver) { if (ver < MIN_VERSION || ver > MAX_VERSION) throw new IllegalArgumentException("Version number out of range"); else if (ver == 1) return new int[]{}; else { int numAlign = ver / 7 + 2; int step; if (ver != 32) { // ceil((size - 13) / (2*numAlign - 2)) * 2 step = (ver * 4 + numAlign * 2 + 1) / (2 * numAlign - 2) * 2; } else // C-C-C-Combo breaker! step = 26; int[] result = new int[numAlign]; result[0] = 6; for (int i = result.length - 1, pos = ver * 4 + 10; i >= 1; i--, pos -= step) result[i] = pos; return result; } } // Returns the number of data bits that can be stored in a QR Code of the given version number, after // all function modules are excluded. This includes remainder bits, so it might not be a multiple of 8. // The result is in the range [208, 29648]. This could be implemented as a 40-entry lookup table. private static int getNumRawDataModules(int ver) { if (ver < MIN_VERSION || ver > MAX_VERSION) throw new IllegalArgumentException("Version number out of range"); int size = ver * 4 + 17; int result = size * size; // Number of modules in the whole QR symbol square result -= 64 * 3; // Subtract the three finders with separators result -= 15 * 2 + 1; // Subtract the format information and black module result -= (size - 16) * 2; // Subtract the timing patterns // The five lines above are equivalent to: int result = (16 * ver + 128) * ver + 64; if (ver >= 2) { int numAlign = ver / 7 + 2; result -= (numAlign - 1) * (numAlign - 1) * 25; // Subtract alignment patterns not overlapping with timing patterns result -= (numAlign - 2) * 2 * 20; // Subtract alignment patterns that overlap with timing patterns // The two lines above are equivalent to: result -= (25 * numAlign - 10) * numAlign - 55; if (ver >= 7) result -= 18 * 2; // Subtract version information } return result; } // Returns the number of 8-bit data (i.e. not error correction) codewords contained in any // QR Code of the given version number and error correction level, with remainder bits discarded. // This stateless pure function could be implemented as a (40*4)-cell lookup table. static int getNumDataCodewords(int ver, Ecc ecl) { if (ver < MIN_VERSION || ver > MAX_VERSION) throw new IllegalArgumentException("Version number out of range"); return getNumRawDataModules(ver) / 8 - ECC_CODEWORDS_PER_BLOCK[ecl.ordinal()][ver] * NUM_ERROR_CORRECTION_BLOCKS[ecl.ordinal()][ver]; } /*---- Private tables of constants ----*/ // For use in getPenaltyScore(), when evaluating which mask is best. private static final int PENALTY_N1 = 3; private static final int PENALTY_N2 = 3; private static final int PENALTY_N3 = 40; private static final int PENALTY_N4 = 10; private static final byte[][] ECC_CODEWORDS_PER_BLOCK = { // Version: (note that index 0 is for padding, and is set to an illegal value) //0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40 Error correction level {-1, 7, 10, 15, 20, 26, 18, 20, 24, 30, 18, 20, 24, 26, 30, 22, 24, 28, 30, 28, 28, 28, 28, 30, 30, 26, 28, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30}, // Low {-1, 10, 16, 26, 18, 24, 16, 18, 22, 22, 26, 30, 22, 22, 24, 24, 28, 28, 26, 26, 26, 26, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28}, // Medium {-1, 13, 22, 18, 26, 18, 24, 18, 22, 20, 24, 28, 26, 24, 20, 30, 24, 28, 28, 26, 30, 28, 30, 30, 30, 30, 28, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30}, // Quartile {-1, 17, 28, 22, 16, 22, 28, 26, 26, 24, 28, 24, 28, 22, 24, 24, 30, 28, 28, 26, 28, 30, 24, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30}, // High }; private static final byte[][] NUM_ERROR_CORRECTION_BLOCKS = { // Version: (note that index 0 is for padding, and is set to an illegal value) //0, 1, 2, 3, 4, 5, 6, 7, 8, 9,10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40 Error correction level {-1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 4, 4, 4, 4, 4, 6, 6, 6, 6, 7, 8, 8, 9, 9, 10, 12, 12, 12, 13, 14, 15, 16, 17, 18, 19, 19, 20, 21, 22, 24, 25}, // Low {-1, 1, 1, 1, 2, 2, 4, 4, 4, 5, 5, 5, 8, 9, 9, 10, 10, 11, 13, 14, 16, 17, 17, 18, 20, 21, 23, 25, 26, 28, 29, 31, 33, 35, 37, 38, 40, 43, 45, 47, 49}, // Medium {-1, 1, 1, 2, 2, 4, 4, 6, 6, 8, 8, 8, 10, 12, 16, 12, 17, 16, 18, 21, 20, 23, 23, 25, 27, 29, 34, 34, 35, 38, 40, 43, 45, 48, 51, 53, 56, 59, 62, 65, 68}, // Quartile {-1, 1, 1, 2, 4, 4, 4, 5, 6, 8, 8, 11, 11, 16, 16, 18, 16, 19, 21, 25, 25, 25, 34, 30, 32, 35, 37, 40, 42, 45, 48, 51, 54, 57, 60, 63, 66, 70, 74, 77, 81}, // High }; /*---- Public helper enumeration ----*/ /** * Represents the error correction level used in a QR Code symbol. */ public enum Ecc { // These enum constants must be declared in ascending order of error protection, // for the sake of the implicit ordinal() method and values() function. LOW(1), MEDIUM(0), QUARTILE(3), HIGH(2); // In the range 0 to 3 (unsigned 2-bit integer). final int formatBits; // Constructor. private Ecc(int fb) { formatBits = fb; } } /*---- Private helper class ----*/ /** * Computes the Reed-Solomon error correction codewords for a sequence of data codewords * at a given degree. Objects are immutable, and the state only depends on the degree. * This class exists because each data block in a QR Code shares the same the divisor polynomial. */ private static final class ReedSolomonGenerator { /*-- Immutable field --*/ // Coefficients of the divisor polynomial, stored from highest to lowest power, excluding the leading term which // is always 1. For example the polynomial x^3 + 255x^2 + 8x + 93 is stored as the uint8 array {255, 8, 93}. private final byte[] coefficients; /*-- Constructor --*/ /** * Creates a Reed-Solomon ECC generator for the specified degree. This could be implemented * as a lookup table over all possible parameter values, instead of as an algorithm. * @param degree the divisor polynomial degree, which must be between 1 and 255 * @throws IllegalArgumentException if degree < 1 or degree > 255 */ public ReedSolomonGenerator(int degree) { if (degree < 1 || degree > 255) throw new IllegalArgumentException("Degree out of range"); // Start with the monomial x^0 coefficients = new byte[degree]; coefficients[degree - 1] = 1; // Compute the product polynomial (x - r^0) * (x - r^1) * (x - r^2) * ... * (x - r^{degree-1}), // drop the highest term, and store the rest of the coefficients in order of descending powers. // Note that r = 0x02, which is a generator element of this field GF(2^8/0x11D). int root = 1; for (int i = 0; i < degree; i++) { // Multiply the current product by (x - r^i) for (int j = 0; j < coefficients.length; j++) { coefficients[j] = (byte)multiply(coefficients[j] & 0xFF, root); if (j + 1 < coefficients.length) coefficients[j] ^= coefficients[j + 1]; } root = multiply(root, 0x02); } } /*-- Method --*/ /** * Computes and returns the Reed-Solomon error correction codewords for the specified * sequence of data codewords. The returned object is always a new byte array. * This method does not alter this object's state (because it is immutable). * @param data the sequence of data codewords * @return the Reed-Solomon error correction codewords * @throws NullPointerException if the data is {@code null} */ public byte[] getRemainder(byte[] data) { Objects.requireNonNull(data); // Compute the remainder by performing polynomial division byte[] result = new byte[coefficients.length]; for (byte b : data) { int factor = (b ^ result[0]) & 0xFF; System.arraycopy(result, 1, result, 0, result.length - 1); result[result.length - 1] = 0; for (int i = 0; i < result.length; i++) result[i] ^= multiply(coefficients[i] & 0xFF, factor); } return result; } /*-- Static function --*/ // Returns the product of the two given field elements modulo GF(2^8/0x11D). The arguments and result // are unsigned 8-bit integers. This could be implemented as a lookup table of 256*256 entries of uint8. private static int multiply(int x, int y) { if (x >>> 8 != 0 || y >>> 8 != 0) throw new IllegalArgumentException("Byte out of range"); // Russian peasant multiplication int z = 0; for (int i = 7; i >= 0; i--) { z = (z << 1) ^ ((z >>> 7) * 0x11D); z ^= ((y >>> i) & 1) * x; } if (z >>> 8 != 0) throw new AssertionError(); return z; } } } uTox/third_party/qrcodegen/qrcodegen/java/io/nayuki/qrcodegen/BitBuffer.java0000600000175000001440000000754014003056224026264 0ustar rakusers/* * QR Code generator library (Java) * * Copyright (c) Project Nayuki. (MIT License) * https://www.nayuki.io/page/qr-code-generator-library * * 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. */ package io.nayuki.qrcodegen; import java.util.BitSet; import java.util.Objects; /** * An appendable sequence of bits (0's and 1's). */ public final class BitBuffer implements Cloneable { /*---- Fields ----*/ private BitSet data; private int bitLength; /*---- Constructor ----*/ /** * Constructs an empty bit buffer (length 0). */ public BitBuffer() { data = new BitSet(); bitLength = 0; } /*---- Methods ----*/ /** * Returns the length of this sequence, which is a non-negative value. * @return the length of this sequence */ public int bitLength() { return bitLength; } /** * Returns the bit at the specified index, yielding 0 or 1. * @param index the index to get the bit at * @return the bit at the specified index * @throws IndexOutOfBoundsException if index < 0 or index ≥ bitLength */ public int getBit(int index) { if (index < 0 || index >= bitLength) throw new IndexOutOfBoundsException(); return data.get(index) ? 1 : 0; } /** * Packs this buffer's bits into bytes in big endian, * padding with '0' bit values, and returns the new array. * @return this sequence as a new array of bytes (not {@code null}) */ public byte[] getBytes() { byte[] result = new byte[(bitLength + 7) / 8]; for (int i = 0; i < bitLength; i++) result[i >>> 3] |= data.get(i) ? 1 << (7 - (i & 7)) : 0; return result; } /** * Appends the specified number of low bits of the specified value * to this sequence. Requires 0 ≤ val < 2len. * @param val the value to append * @param len the number of low bits in the value to take */ public void appendBits(int val, int len) { if (len < 0 || len > 31 || val >>> len != 0) throw new IllegalArgumentException("Value out of range"); for (int i = len - 1; i >= 0; i--, bitLength++) // Append bit by bit data.set(bitLength, ((val >>> i) & 1) != 0); } /** * Appends the bit data of the specified segment to this bit buffer. * @param seg the segment whose data to append (not {@code null}) * @throws NullPointerException if the segment is {@code null} */ public void appendData(QrSegment seg) { Objects.requireNonNull(seg); BitBuffer bb = seg.data; for (int i = 0; i < bb.bitLength; i++, bitLength++) // Append bit by bit data.set(bitLength, bb.data.get(i)); } /** * Returns a copy of this bit buffer object. * @return a copy of this bit buffer object */ public BitBuffer clone() { try { BitBuffer result = (BitBuffer)super.clone(); result.data = (BitSet)result.data.clone(); return result; } catch (CloneNotSupportedException e) { throw new AssertionError(e); } } } uTox/third_party/qrcodegen/qrcodegen/cpp/0000700000175000001440000000000014003056224017524 5ustar rakusersuTox/third_party/qrcodegen/qrcodegen/cpp/QrSegment.hpp0000600000175000001440000001247314003056224022153 0ustar rakusers/* * QR Code generator library (C++) * * Copyright (c) Project Nayuki. (MIT License) * https://www.nayuki.io/page/qr-code-generator-library * * 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. */ #pragma once #include #include #include "BitBuffer.hpp" namespace qrcodegen { /* * Represents a character string to be encoded in a QR Code symbol. Each segment has * a mode, and a sequence of characters that is already encoded as a sequence of bits. * Instances of this class are immutable. * This segment class imposes no length restrictions, but QR Codes have restrictions. * Even in the most favorable conditions, a QR Code can only hold 7089 characters of data. * Any segment longer than this is meaningless for the purpose of generating QR Codes. */ class QrSegment final { /*---- Public helper enumeration ----*/ /* * The mode field of a segment. Immutable. Provides methods to retrieve closely related values. */ public: class Mode final { /*-- Constants --*/ public: static const Mode NUMERIC; public: static const Mode ALPHANUMERIC; public: static const Mode BYTE; public: static const Mode KANJI; public: static const Mode ECI; /*-- Fields --*/ private: int modeBits; private: int numBitsCharCount[3]; /*-- Constructor --*/ private: Mode(int mode, int cc0, int cc1, int cc2); /*-- Methods --*/ /* * (Package-private) Returns the mode indicator bits, which is an unsigned 4-bit value (range 0 to 15). */ public: int getModeBits() const; /* * (Package-private) Returns the bit width of the segment character count field for this mode object at the given version number. */ public: int numCharCountBits(int ver) const; }; /*---- Public static factory functions ----*/ /* * Returns a segment representing the given binary data encoded in byte mode. */ public: static QrSegment makeBytes(const std::vector &data); /* * Returns a segment representing the given string of decimal digits encoded in numeric mode. */ public: static QrSegment makeNumeric(const char *digits); /* * Returns a segment representing the given text string encoded in alphanumeric mode. * The characters allowed are: 0 to 9, A to Z (uppercase only), space, * dollar, percent, asterisk, plus, hyphen, period, slash, colon. */ public: static QrSegment makeAlphanumeric(const char *text); /* * Returns a list of zero or more segments to represent the given text string. * The result may use various segment modes and switch modes to optimize the length of the bit stream. */ public: static std::vector makeSegments(const char *text); /* * Returns a segment representing an Extended Channel Interpretation * (ECI) designator with the given assignment value. */ public: static QrSegment makeEci(long assignVal); /*---- Public static helper functions ----*/ /* * Tests whether the given string can be encoded as a segment in alphanumeric mode. */ public: static bool isAlphanumeric(const char *text); /* * Tests whether the given string can be encoded as a segment in numeric mode. */ public: static bool isNumeric(const char *text); /*---- Instance fields ----*/ /* The mode indicator for this segment. */ private: Mode mode; /* The length of this segment's unencoded data, measured in characters. Always zero or positive. */ private: int numChars; /* The data bits of this segment. */ private: std::vector data; /*---- Constructor ----*/ /* * Creates a new QR Code data segment with the given parameters and data. */ public: QrSegment(Mode md, int numCh, const std::vector &dt); /* * Creates a new QR Code data segment with the given parameters and data. */ public: QrSegment(Mode md, int numCh, std::vector &&dt); /*---- Methods ----*/ public: Mode getMode() const; public: int getNumChars() const; public: const std::vector &getData() const; // Package-private helper function. public: static int getTotalBits(const std::vector &segs, int version); /*---- Private constant ----*/ /* The set of all legal characters in alphanumeric mode, where each character value maps to the index in the string. */ private: static const char *ALPHANUMERIC_CHARSET; }; } uTox/third_party/qrcodegen/qrcodegen/cpp/QrSegment.cpp0000600000175000001440000001431014003056224022136 0ustar rakusers/* * QR Code generator library (C++) * * Copyright (c) Project Nayuki. (MIT License) * https://www.nayuki.io/page/qr-code-generator-library * * 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. */ #include #include #include #include "QrSegment.hpp" using std::uint8_t; using std::vector; namespace qrcodegen { QrSegment::Mode::Mode(int mode, int cc0, int cc1, int cc2) : modeBits(mode) { numBitsCharCount[0] = cc0; numBitsCharCount[1] = cc1; numBitsCharCount[2] = cc2; } int QrSegment::Mode::getModeBits() const { return modeBits; } int QrSegment::Mode::numCharCountBits(int ver) const { if ( 1 <= ver && ver <= 9) return numBitsCharCount[0]; else if (10 <= ver && ver <= 26) return numBitsCharCount[1]; else if (27 <= ver && ver <= 40) return numBitsCharCount[2]; else throw "Version number out of range"; } const QrSegment::Mode QrSegment::Mode::NUMERIC (0x1, 10, 12, 14); const QrSegment::Mode QrSegment::Mode::ALPHANUMERIC(0x2, 9, 11, 13); const QrSegment::Mode QrSegment::Mode::BYTE (0x4, 8, 16, 16); const QrSegment::Mode QrSegment::Mode::KANJI (0x8, 8, 10, 12); const QrSegment::Mode QrSegment::Mode::ECI (0x7, 0, 0, 0); QrSegment QrSegment::makeBytes(const vector &data) { if (data.size() > INT_MAX) throw "Data too long"; BitBuffer bb; for (uint8_t b : data) bb.appendBits(b, 8); return QrSegment(Mode::BYTE, static_cast(data.size()), std::move(bb)); } QrSegment QrSegment::makeNumeric(const char *digits) { BitBuffer bb; int accumData = 0; int accumCount = 0; int charCount = 0; for (; *digits != '\0'; digits++, charCount++) { char c = *digits; if (c < '0' || c > '9') throw "String contains non-numeric characters"; accumData = accumData * 10 + (c - '0'); accumCount++; if (accumCount == 3) { bb.appendBits(accumData, 10); accumData = 0; accumCount = 0; } } if (accumCount > 0) // 1 or 2 digits remaining bb.appendBits(accumData, accumCount * 3 + 1); return QrSegment(Mode::NUMERIC, charCount, std::move(bb)); } QrSegment QrSegment::makeAlphanumeric(const char *text) { BitBuffer bb; int accumData = 0; int accumCount = 0; int charCount = 0; for (; *text != '\0'; text++, charCount++) { const char *temp = std::strchr(ALPHANUMERIC_CHARSET, *text); if (temp == nullptr) throw "String contains unencodable characters in alphanumeric mode"; accumData = accumData * 45 + (temp - ALPHANUMERIC_CHARSET); accumCount++; if (accumCount == 2) { bb.appendBits(accumData, 11); accumData = 0; accumCount = 0; } } if (accumCount > 0) // 1 character remaining bb.appendBits(accumData, 6); return QrSegment(Mode::ALPHANUMERIC, charCount, std::move(bb)); } vector QrSegment::makeSegments(const char *text) { // Select the most efficient segment encoding automatically vector result; if (*text == '\0'); // Leave result empty else if (isNumeric(text)) result.push_back(makeNumeric(text)); else if (isAlphanumeric(text)) result.push_back(makeAlphanumeric(text)); else { vector bytes; for (; *text != '\0'; text++) bytes.push_back(static_cast(*text)); result.push_back(makeBytes(bytes)); } return result; } QrSegment QrSegment::makeEci(long assignVal) { BitBuffer bb; if (0 <= assignVal && assignVal < (1 << 7)) bb.appendBits(assignVal, 8); else if ((1 << 7) <= assignVal && assignVal < (1 << 14)) { bb.appendBits(2, 2); bb.appendBits(assignVal, 14); } else if ((1 << 14) <= assignVal && assignVal < 1000000L) { bb.appendBits(6, 3); bb.appendBits(assignVal, 21); } else throw "ECI assignment value out of range"; return QrSegment(Mode::ECI, 0, std::move(bb)); } QrSegment::QrSegment(Mode md, int numCh, const std::vector &dt) : mode(md), numChars(numCh), data(dt) { if (numCh < 0) throw "Invalid value"; } QrSegment::QrSegment(Mode md, int numCh, std::vector &&dt) : mode(md), numChars(numCh), data(std::move(dt)) { if (numCh < 0) throw "Invalid value"; } int QrSegment::getTotalBits(const vector &segs, int version) { if (version < 1 || version > 40) throw "Version number out of range"; int result = 0; for (const QrSegment &seg : segs) { int ccbits = seg.mode.numCharCountBits(version); // Fail if segment length value doesn't fit in the length field's bit-width if (seg.numChars >= (1L << ccbits)) return -1; if (4 + ccbits > INT_MAX - result) return -1; result += 4 + ccbits; if (seg.data.size() > static_cast(INT_MAX - result)) return -1; result += static_cast(seg.data.size()); } return result; } bool QrSegment::isAlphanumeric(const char *text) { for (; *text != '\0'; text++) { if (std::strchr(ALPHANUMERIC_CHARSET, *text) == nullptr) return false; } return true; } bool QrSegment::isNumeric(const char *text) { for (; *text != '\0'; text++) { char c = *text; if (c < '0' || c > '9') return false; } return true; } QrSegment::Mode QrSegment::getMode() const { return mode; } int QrSegment::getNumChars() const { return numChars; } const std::vector &QrSegment::getData() const { return data; } const char *QrSegment::ALPHANUMERIC_CHARSET = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ $%*+-./:"; } uTox/third_party/qrcodegen/qrcodegen/cpp/QrCodeGeneratorWorker.cpp0000600000175000001440000000636114003056224024456 0ustar rakusers/* * QR Code generator test worker (C++) * * This program reads data and encoding parameters from standard input and writes * QR Code bitmaps to standard output. The I/O format is one integer per line. * Run with no command line arguments. The program is intended for automated * batch testing of end-to-end functionality of this QR Code generator library. * * Copyright (c) Project Nayuki. (MIT License) * https://www.nayuki.io/page/qr-code-generator-library * * 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. */ #include #include #include #include #include #include "QrCode.hpp" using qrcodegen::QrCode; using qrcodegen::QrSegment; static const QrCode::Ecc *(ECC_LEVELS[]) = { &QrCode::Ecc::LOW, &QrCode::Ecc::MEDIUM, &QrCode::Ecc::QUARTILE, &QrCode::Ecc::HIGH, }; int main() { while (true) { // Read data length or exit int length; std::cin >> length; if (length == -1) break; // Read data bytes bool isAscii = true; std::vector data; for (int i = 0; i < length; i++) { int b; std::cin >> b; data.push_back((uint8_t)b); isAscii &= 0 < b && b < 128; } // Read encoding parameters int errCorLvl, minVersion, maxVersion, mask, boostEcl; std::cin >> errCorLvl; std::cin >> minVersion; std::cin >> maxVersion; std::cin >> mask; std::cin >> boostEcl; // Make list of segments std::vector segs; if (isAscii) { std::vector text(data.cbegin(), data.cend()); text.push_back('\0'); segs = QrSegment::makeSegments(text.data()); } else segs.push_back(QrSegment::makeBytes(data)); try { // Try to make QR Code symbol const QrCode qr = QrCode::encodeSegments(segs, *ECC_LEVELS[errCorLvl], minVersion, maxVersion, mask, boostEcl == 1); // Print grid of modules std::cout << qr.getVersion() << std::endl; for (int y = 0; y < qr.getSize(); y++) { for (int x = 0; x < qr.getSize(); x++) std::cout << (qr.getModule(x, y) ? 1 : 0) << std::endl; } } catch (const char *msg) { if (strcmp(msg, "Data too long") != 0) { std::cerr << msg << std::endl; return EXIT_FAILURE; } std::cout << -1 << std::endl; } std::cout << std::flush; } return EXIT_SUCCESS; } uTox/third_party/qrcodegen/qrcodegen/cpp/QrCodeGeneratorDemo.cpp0000600000175000001440000002017714003056224024072 0ustar rakusers/* * QR Code generator demo (C++) * * Run this command-line program with no arguments. The program computes a bunch of demonstration * QR Codes and prints them to the console. Also, the SVG code for one QR Code is printed as a sample. * * Copyright (c) Project Nayuki. (MIT License) * https://www.nayuki.io/page/qr-code-generator-library * * 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. */ #include #include #include #include #include #include #include "BitBuffer.hpp" #include "QrCode.hpp" using std::uint8_t; using qrcodegen::QrCode; using qrcodegen::QrSegment; // Function prototypes static void doBasicDemo(); static void doVarietyDemo(); static void doSegmentDemo(); static void doMaskDemo(); static void printQr(const QrCode &qr); // The main application program. int main() { doBasicDemo(); doVarietyDemo(); doSegmentDemo(); doMaskDemo(); return EXIT_SUCCESS; } /*---- Demo suite ----*/ // Creates a single QR Code, then prints it to the console. static void doBasicDemo() { const char *text = "Hello, world!"; // User-supplied text const QrCode::Ecc errCorLvl = QrCode::Ecc::LOW; // Error correction level // Make and print the QR Code symbol const QrCode qr = QrCode::encodeText(text, errCorLvl); printQr(qr); std::cout << qr.toSvgString(4) << std::endl; } // Creates a variety of QR Codes that exercise different features of the library, and prints each one to the console. static void doVarietyDemo() { // Numeric mode encoding (3.33 bits per digit) const QrCode qr1 = QrCode::encodeText("314159265358979323846264338327950288419716939937510", QrCode::Ecc::MEDIUM); printQr(qr1); // Alphanumeric mode encoding (5.5 bits per character) const QrCode qr2 = QrCode::encodeText("DOLLAR-AMOUNT:$39.87 PERCENTAGE:100.00% OPERATIONS:+-*/", QrCode::Ecc::HIGH); printQr(qr2); // Unicode text as UTF-8 const QrCode qr3 = QrCode::encodeText("\xE3\x81\x93\xE3\x82\x93\xE3\x81\xAB\xE3\x81\xA1wa\xE3\x80\x81\xE4\xB8\x96\xE7\x95\x8C\xEF\xBC\x81\x20\xCE\xB1\xCE\xB2\xCE\xB3\xCE\xB4", QrCode::Ecc::QUARTILE); printQr(qr3); // Moderately large QR Code using longer text (from Lewis Carroll's Alice in Wonderland) const QrCode qr4 = QrCode::encodeText( "Alice was beginning to get very tired of sitting by her sister on the bank, " "and of having nothing to do: once or twice she had peeped into the book her sister was reading, " "but it had no pictures or conversations in it, 'and what is the use of a book,' thought Alice " "'without pictures or conversations?' So she was considering in her own mind (as well as she could, " "for the hot day made her feel very sleepy and stupid), whether the pleasure of making a " "daisy-chain would be worth the trouble of getting up and picking the daisies, when suddenly " "a White Rabbit with pink eyes ran close by her.", QrCode::Ecc::HIGH); printQr(qr4); } // Creates QR Codes with manually specified segments for better compactness. static void doSegmentDemo() { // Illustration "silver" const char *silver0 = "THE SQUARE ROOT OF 2 IS 1."; const char *silver1 = "41421356237309504880168872420969807856967187537694807317667973799"; const QrCode qr0 = QrCode::encodeText( (std::string(silver0) + silver1).c_str(), QrCode::Ecc::LOW); printQr(qr0); const QrCode qr1 = QrCode::encodeSegments( {QrSegment::makeAlphanumeric(silver0), QrSegment::makeNumeric(silver1)}, QrCode::Ecc::LOW); printQr(qr1); // Illustration "golden" const char *golden0 = "Golden ratio \xCF\x86 = 1."; const char *golden1 = "6180339887498948482045868343656381177203091798057628621354486227052604628189024497072072041893911374"; const char *golden2 = "......"; const QrCode qr2 = QrCode::encodeText( (std::string(golden0) + golden1 + golden2).c_str(), QrCode::Ecc::LOW); printQr(qr2); std::vector bytes(golden0, golden0 + std::strlen(golden0)); const QrCode qr3 = QrCode::encodeSegments( {QrSegment::makeBytes(bytes), QrSegment::makeNumeric(golden1), QrSegment::makeAlphanumeric(golden2)}, QrCode::Ecc::LOW); printQr(qr3); // Illustration "Madoka": kanji, kana, Greek, Cyrillic, full-width Latin characters const char *madoka = // Encoded in UTF-8 "\xE3\x80\x8C\xE9\xAD\x94\xE6\xB3\x95\xE5" "\xB0\x91\xE5\xA5\xB3\xE3\x81\xBE\xE3\x81" "\xA9\xE3\x81\x8B\xE2\x98\x86\xE3\x83\x9E" "\xE3\x82\xAE\xE3\x82\xAB\xE3\x80\x8D\xE3" "\x81\xA3\xE3\x81\xA6\xE3\x80\x81\xE3\x80" "\x80\xD0\x98\xD0\x90\xD0\x98\xE3\x80\x80" "\xEF\xBD\x84\xEF\xBD\x85\xEF\xBD\x93\xEF" "\xBD\x95\xE3\x80\x80\xCE\xBA\xCE\xB1\xEF" "\xBC\x9F"; const QrCode qr4 = QrCode::encodeText(madoka, QrCode::Ecc::LOW); printQr(qr4); const std::vector kanjiChars{ // Kanji mode encoding (13 bits per character) 0x0035, 0x1002, 0x0FC0, 0x0AED, 0x0AD7, 0x015C, 0x0147, 0x0129, 0x0059, 0x01BD, 0x018D, 0x018A, 0x0036, 0x0141, 0x0144, 0x0001, 0x0000, 0x0249, 0x0240, 0x0249, 0x0000, 0x0104, 0x0105, 0x0113, 0x0115, 0x0000, 0x0208, 0x01FF, 0x0008, }; qrcodegen::BitBuffer bb; for (int c : kanjiChars) bb.appendBits(c, 13); const QrCode qr5 = QrCode::encodeSegments( {QrSegment(QrSegment::Mode::KANJI, kanjiChars.size(), bb)}, QrCode::Ecc::LOW); printQr(qr5); } // Creates QR Codes with the same size and contents but different mask patterns. static void doMaskDemo() { // Project Nayuki URL std::vector segs0 = QrSegment::makeSegments("https://www.nayuki.io/"); printQr(QrCode::encodeSegments(segs0, QrCode::Ecc::HIGH, QrCode::MIN_VERSION, QrCode::MAX_VERSION, -1, true)); // Automatic mask printQr(QrCode::encodeSegments(segs0, QrCode::Ecc::HIGH, QrCode::MIN_VERSION, QrCode::MAX_VERSION, 3, true)); // Force mask 3 // Chinese text as UTF-8 std::vector segs1 = QrSegment::makeSegments( "\xE7\xB6\xAD\xE5\x9F\xBA\xE7\x99\xBE\xE7\xA7\x91\xEF\xBC\x88\x57\x69\x6B\x69\x70" "\x65\x64\x69\x61\xEF\xBC\x8C\xE8\x81\x86\xE8\x81\xBD\x69\x2F\xCB\x8C\x77\xC9\xAA" "\x6B\xE1\xB5\xBB\xCB\x88\x70\x69\xCB\x90\x64\x69\x2E\xC9\x99\x2F\xEF\xBC\x89\xE6" "\x98\xAF\xE4\xB8\x80\xE5\x80\x8B\xE8\x87\xAA\xE7\x94\xB1\xE5\x85\xA7\xE5\xAE\xB9" "\xE3\x80\x81\xE5\x85\xAC\xE9\x96\x8B\xE7\xB7\xA8\xE8\xBC\xAF\xE4\xB8\x94\xE5\xA4" "\x9A\xE8\xAA\x9E\xE8\xA8\x80\xE7\x9A\x84\xE7\xB6\xB2\xE8\xB7\xAF\xE7\x99\xBE\xE7" "\xA7\x91\xE5\x85\xA8\xE6\x9B\xB8\xE5\x8D\x94\xE4\xBD\x9C\xE8\xA8\x88\xE7\x95\xAB"); printQr(QrCode::encodeSegments(segs1, QrCode::Ecc::MEDIUM, QrCode::MIN_VERSION, QrCode::MAX_VERSION, 0, true)); // Force mask 0 printQr(QrCode::encodeSegments(segs1, QrCode::Ecc::MEDIUM, QrCode::MIN_VERSION, QrCode::MAX_VERSION, 1, true)); // Force mask 1 printQr(QrCode::encodeSegments(segs1, QrCode::Ecc::MEDIUM, QrCode::MIN_VERSION, QrCode::MAX_VERSION, 5, true)); // Force mask 5 printQr(QrCode::encodeSegments(segs1, QrCode::Ecc::MEDIUM, QrCode::MIN_VERSION, QrCode::MAX_VERSION, 7, true)); // Force mask 7 } /*---- Utilities ----*/ // Prints the given QR Code to the console. static void printQr(const QrCode &qr) { int border = 4; for (int y = -border; y < qr.getSize() + border; y++) { for (int x = -border; x < qr.getSize() + border; x++) { std::cout << (qr.getModule(x, y) ? "##" : " "); } std::cout << std::endl; } std::cout << std::endl; } uTox/third_party/qrcodegen/qrcodegen/cpp/QrCode.hpp0000600000175000001440000003045514003056224021423 0ustar rakusers/* * QR Code generator library (C++) * * Copyright (c) Project Nayuki. (MIT License) * https://www.nayuki.io/page/qr-code-generator-library * * 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. */ #pragma once #include #include #include #include "QrSegment.hpp" namespace qrcodegen { /* * Represents an immutable square grid of black and white cells for a QR Code symbol, and * provides static functions to create a QR Code from user-supplied textual or binary data. * This class covers the QR Code model 2 specification, supporting all versions (sizes) * from 1 to 40, all 4 error correction levels, and only 3 character encoding modes. */ class QrCode final { /*---- Public helper enumeration ----*/ /* * Represents the error correction level used in a QR Code symbol. */ public: class Ecc final { // Constants declared in ascending order of error protection. public: const static Ecc LOW, MEDIUM, QUARTILE, HIGH; // Fields. private: int ordinal; private: int formatBits; // Constructor. private: Ecc(int ord, int fb); // (Public) Returns a value in the range 0 to 3 (unsigned 2-bit integer). public: int getOrdinal() const; // (Package-private) Returns a value in the range 0 to 3 (unsigned 2-bit integer). public: int getFormatBits() const; }; /*---- Public static factory functions ----*/ /* * Returns a QR Code symbol representing the specified Unicode text string at the specified error correction level. * As a conservative upper bound, this function is guaranteed to succeed for strings that have 2953 or fewer * UTF-8 code units (not Unicode code points) if the low error correction level is used. The smallest possible * QR Code version is automatically chosen for the output. The ECC level of the result may be higher than * the ecl argument if it can be done without increasing the version. */ public: static QrCode encodeText(const char *text, Ecc ecl); /* * Returns a QR Code symbol representing the given binary data string at the given error correction level. * This function always encodes using the binary segment mode, not any text mode. The maximum number of * bytes allowed is 2953. The smallest possible QR Code version is automatically chosen for the output. * The ECC level of the result may be higher than the ecl argument if it can be done without increasing the version. */ public: static QrCode encodeBinary(const std::vector &data, Ecc ecl); /* * Returns a QR Code symbol representing the given data segments with the given encoding parameters. * The smallest possible QR Code version within the given range is automatically chosen for the output. * This function allows the user to create a custom sequence of segments that switches * between modes (such as alphanumeric and binary) to encode text more efficiently. * This function is considered to be lower level than simply encoding text or binary data. */ public: static QrCode encodeSegments(const std::vector &segs, Ecc ecl, int minVersion=1, int maxVersion=40, int mask=-1, bool boostEcl=true); // All optional parameters /*---- Public constants ----*/ public: static constexpr int MIN_VERSION = 1; public: static constexpr int MAX_VERSION = 40; /*---- Instance fields ----*/ // Immutable scalar parameters /* This QR Code symbol's version number, which is always between 1 and 40 (inclusive). */ private: int version; /* The width and height of this QR Code symbol, measured in modules. * Always equal to version × 4 + 17, in the range 21 to 177. */ private: int size; /* The error correction level used in this QR Code symbol. */ private: Ecc errorCorrectionLevel; /* The mask pattern used in this QR Code symbol, in the range 0 to 7 (i.e. unsigned 3-bit integer). * Note that even if a constructor was called with automatic masking requested * (mask = -1), the resulting object will still have a mask value between 0 and 7. */ private: int mask; // Private grids of modules/pixels (conceptually immutable) private: std::vector > modules; // The modules of this QR Code symbol (false = white, true = black) private: std::vector > isFunction; // Indicates function modules that are not subjected to masking /*---- Constructors ----*/ /* * Creates a new QR Code symbol with the given version number, error correction level, binary data array, * and mask number. This is a cumbersome low-level constructor that should not be invoked directly by the user. * To go one level up, see the encodeSegments() function. */ public: QrCode(int ver, Ecc ecl, const std::vector &dataCodewords, int mask); /*---- Public instance methods ----*/ public: int getVersion() const; public: int getSize() const; public: Ecc getErrorCorrectionLevel() const; public: int getMask() const; /* * Returns the color of the module (pixel) at the given coordinates, which is either * false for white or true for black. The top left corner has the coordinates (x=0, y=0). * If the given coordinates are out of bounds, then false (white) is returned. */ public: bool getModule(int x, int y) const; /* * Based on the given number of border modules to add as padding, this returns a * string whose contents represents an SVG XML file that depicts this QR Code symbol. * Note that Unix newlines (\n) are always used, regardless of the platform. */ public: std::string toSvgString(int border) const; /*---- Private helper methods for constructor: Drawing function modules ----*/ private: void drawFunctionPatterns(); // Draws two copies of the format bits (with its own error correction code) // based on the given mask and this object's error correction level field. private: void drawFormatBits(int mask); // Draws two copies of the version bits (with its own error correction code), // based on this object's version field (which only has an effect for 7 <= version <= 40). private: void drawVersion(); // Draws a 9*9 finder pattern including the border separator, with the center module at (x, y). private: void drawFinderPattern(int x, int y); // Draws a 5*5 alignment pattern, with the center module at (x, y). private: void drawAlignmentPattern(int x, int y); // Sets the color of a module and marks it as a function module. // Only used by the constructor. Coordinates must be in range. private: void setFunctionModule(int x, int y, bool isBlack); // Returns the color of the module at the given coordinates, which must be in range. private: bool module(int x, int y) const; /*---- Private helper methods for constructor: Codewords and masking ----*/ // Returns a new byte string representing the given data with the appropriate error correction // codewords appended to it, based on this object's version and error correction level. private: std::vector appendErrorCorrection(const std::vector &data) const; // Draws the given sequence of 8-bit codewords (data and error correction) onto the entire // data area of this QR Code symbol. Function modules need to be marked off before this is called. private: void drawCodewords(const std::vector &data); // XORs the data modules in this QR Code with the given mask pattern. Due to XOR's mathematical // properties, calling applyMask(m) twice with the same value is equivalent to no change at all. // This means it is possible to apply a mask, undo it, and try another mask. Note that a final // well-formed QR Code symbol needs exactly one mask applied (not zero, not two, etc.). private: void applyMask(int mask); // A messy helper function for the constructors. This QR Code must be in an unmasked state when this // method is called. The given argument is the requested mask, which is -1 for auto or 0 to 7 for fixed. // This method applies and returns the actual mask chosen, from 0 to 7. private: int handleConstructorMasking(int mask); // Calculates and returns the penalty score based on state of this QR Code's current modules. // This is used by the automatic mask choice algorithm to find the mask pattern that yields the lowest score. private: long getPenaltyScore() const; /*---- Private static helper functions ----*/ // Returns a set of positions of the alignment patterns in ascending order. These positions are // used on both the x and y axes. Each value in the resulting array is in the range [0, 177). // This stateless pure function could be implemented as table of 40 variable-length lists of unsigned bytes. private: static std::vector getAlignmentPatternPositions(int ver); // Returns the number of data bits that can be stored in a QR Code of the given version number, after // all function modules are excluded. This includes remainder bits, so it might not be a multiple of 8. // The result is in the range [208, 29648]. This could be implemented as a 40-entry lookup table. private: static int getNumRawDataModules(int ver); // Returns the number of 8-bit data (i.e. not error correction) codewords contained in any // QR Code of the given version number and error correction level, with remainder bits discarded. // This stateless pure function could be implemented as a (40*4)-cell lookup table. private: static int getNumDataCodewords(int ver, Ecc ecl); /*---- Private tables of constants ----*/ // For use in getPenaltyScore(), when evaluating which mask is best. private: static const int PENALTY_N1; private: static const int PENALTY_N2; private: static const int PENALTY_N3; private: static const int PENALTY_N4; private: static const std::int8_t ECC_CODEWORDS_PER_BLOCK[4][41]; private: static const std::int8_t NUM_ERROR_CORRECTION_BLOCKS[4][41]; /*---- Private helper class ----*/ /* * Computes the Reed-Solomon error correction codewords for a sequence of data codewords * at a given degree. Objects are immutable, and the state only depends on the degree. * This class exists because each data block in a QR Code shares the same the divisor polynomial. */ private: class ReedSolomonGenerator final { /*-- Immutable field --*/ // Coefficients of the divisor polynomial, stored from highest to lowest power, excluding the leading term which // is always 1. For example the polynomial x^3 + 255x^2 + 8x + 93 is stored as the uint8 array {255, 8, 93}. private: std::vector coefficients; /*-- Constructor --*/ /* * Creates a Reed-Solomon ECC generator for the given degree. This could be implemented * as a lookup table over all possible parameter values, instead of as an algorithm. */ public: ReedSolomonGenerator(int degree); /*-- Method --*/ /* * Computes and returns the Reed-Solomon error correction codewords for the given * sequence of data codewords. The returned object is always a new byte array. * This method does not alter this object's state (because it is immutable). */ public: std::vector getRemainder(const std::vector &data) const; /*-- Static function --*/ // Returns the product of the two given field elements modulo GF(2^8/0x11D). // All inputs are valid. This could be implemented as a 256*256 lookup table. private: static std::uint8_t multiply(std::uint8_t x, std::uint8_t y); }; }; } uTox/third_party/qrcodegen/qrcodegen/cpp/QrCode.cpp0000600000175000001440000005015114003056224021411 0ustar rakusers/* * QR Code generator library (C++) * * Copyright (c) Project Nayuki. (MIT License) * https://www.nayuki.io/page/qr-code-generator-library * * 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. */ #include #include #include #include #include #include #include "BitBuffer.hpp" #include "QrCode.hpp" using std::int8_t; using std::uint8_t; using std::size_t; using std::vector; namespace qrcodegen { QrCode::Ecc::Ecc(int ord, int fb) : ordinal(ord), formatBits(fb) {} int QrCode::Ecc::getOrdinal() const { return ordinal; } int QrCode::Ecc::getFormatBits() const { return formatBits; } const QrCode::Ecc QrCode::Ecc::LOW (0, 1); const QrCode::Ecc QrCode::Ecc::MEDIUM (1, 0); const QrCode::Ecc QrCode::Ecc::QUARTILE(2, 3); const QrCode::Ecc QrCode::Ecc::HIGH (3, 2); QrCode QrCode::encodeText(const char *text, Ecc ecl) { vector segs(QrSegment::makeSegments(text)); return encodeSegments(segs, ecl); } QrCode QrCode::encodeBinary(const vector &data, Ecc ecl) { vector segs{QrSegment::makeBytes(data)}; return encodeSegments(segs, ecl); } QrCode QrCode::encodeSegments(const vector &segs, Ecc ecl, int minVersion, int maxVersion, int mask, bool boostEcl) { if (!(MIN_VERSION <= minVersion && minVersion <= maxVersion && maxVersion <= MAX_VERSION) || mask < -1 || mask > 7) throw "Invalid value"; // Find the minimal version number to use int version, dataUsedBits; for (version = minVersion; ; version++) { int dataCapacityBits = getNumDataCodewords(version, ecl) * 8; // Number of data bits available dataUsedBits = QrSegment::getTotalBits(segs, version); if (dataUsedBits != -1 && dataUsedBits <= dataCapacityBits) break; // This version number is found to be suitable if (version >= maxVersion) // All versions in the range could not fit the given data throw "Data too long"; } if (dataUsedBits == -1) throw "Assertion error"; // Increase the error correction level while the data still fits in the current version number for (Ecc newEcl : vector{Ecc::MEDIUM, Ecc::QUARTILE, Ecc::HIGH}) { if (boostEcl && dataUsedBits <= getNumDataCodewords(version, newEcl) * 8) ecl = newEcl; } // Create the data bit string by concatenating all segments size_t dataCapacityBits = getNumDataCodewords(version, ecl) * 8; BitBuffer bb; for (const QrSegment &seg : segs) { bb.appendBits(seg.getMode().getModeBits(), 4); bb.appendBits(seg.getNumChars(), seg.getMode().numCharCountBits(version)); bb.insert(bb.end(), seg.getData().begin(), seg.getData().end()); } // Add terminator and pad up to a byte if applicable bb.appendBits(0, std::min(4, dataCapacityBits - bb.size())); bb.appendBits(0, (8 - bb.size() % 8) % 8); // Pad with alternate bytes until data capacity is reached for (uint8_t padByte = 0xEC; bb.size() < dataCapacityBits; padByte ^= 0xEC ^ 0x11) bb.appendBits(padByte, 8); if (bb.size() % 8 != 0) throw "Assertion error"; // Create the QR Code symbol return QrCode(version, ecl, bb.getBytes(), mask); } QrCode::QrCode(int ver, Ecc ecl, const vector &dataCodewords, int mask) : // Initialize fields version(ver), size(MIN_VERSION <= ver && ver <= MAX_VERSION ? ver * 4 + 17 : -1), // Avoid signed overflow undefined behavior errorCorrectionLevel(ecl), modules(size, vector(size)), // Entirely white grid isFunction(size, vector(size)) { // Check arguments if (ver < MIN_VERSION || ver > MAX_VERSION || mask < -1 || mask > 7) throw "Value out of range"; // Draw function patterns, draw all codewords, do masking drawFunctionPatterns(); const vector allCodewords(appendErrorCorrection(dataCodewords)); drawCodewords(allCodewords); this->mask = handleConstructorMasking(mask); } int QrCode::getVersion() const { return version; } int QrCode::getSize() const { return size; } QrCode::Ecc QrCode::getErrorCorrectionLevel() const { return errorCorrectionLevel; } int QrCode::getMask() const { return mask; } bool QrCode::getModule(int x, int y) const { return 0 <= x && x < size && 0 <= y && y < size && module(x, y); } std::string QrCode::toSvgString(int border) const { if (border < 0) throw "Border must be non-negative"; std::ostringstream sb; sb << "\n"; sb << "\n"; sb << "\n"; sb << "\t\n"; sb << "\t\n"; sb << "\n"; return sb.str(); } void QrCode::drawFunctionPatterns() { // Draw horizontal and vertical timing patterns for (int i = 0; i < size; i++) { setFunctionModule(6, i, i % 2 == 0); setFunctionModule(i, 6, i % 2 == 0); } // Draw 3 finder patterns (all corners except bottom right; overwrites some timing modules) drawFinderPattern(3, 3); drawFinderPattern(size - 4, 3); drawFinderPattern(3, size - 4); // Draw numerous alignment patterns const vector alignPatPos(getAlignmentPatternPositions(version)); int numAlign = alignPatPos.size(); for (int i = 0; i < numAlign; i++) { for (int j = 0; j < numAlign; j++) { if ((i == 0 && j == 0) || (i == 0 && j == numAlign - 1) || (i == numAlign - 1 && j == 0)) continue; // Skip the three finder corners else drawAlignmentPattern(alignPatPos.at(i), alignPatPos.at(j)); } } // Draw configuration data drawFormatBits(0); // Dummy mask value; overwritten later in the constructor drawVersion(); } void QrCode::drawFormatBits(int mask) { // Calculate error correction code and pack bits int data = errorCorrectionLevel.getFormatBits() << 3 | mask; // errCorrLvl is uint2, mask is uint3 int rem = data; for (int i = 0; i < 10; i++) rem = (rem << 1) ^ ((rem >> 9) * 0x537); data = data << 10 | rem; data ^= 0x5412; // uint15 if (data >> 15 != 0) throw "Assertion error"; // Draw first copy for (int i = 0; i <= 5; i++) setFunctionModule(8, i, ((data >> i) & 1) != 0); setFunctionModule(8, 7, ((data >> 6) & 1) != 0); setFunctionModule(8, 8, ((data >> 7) & 1) != 0); setFunctionModule(7, 8, ((data >> 8) & 1) != 0); for (int i = 9; i < 15; i++) setFunctionModule(14 - i, 8, ((data >> i) & 1) != 0); // Draw second copy for (int i = 0; i <= 7; i++) setFunctionModule(size - 1 - i, 8, ((data >> i) & 1) != 0); for (int i = 8; i < 15; i++) setFunctionModule(8, size - 15 + i, ((data >> i) & 1) != 0); setFunctionModule(8, size - 8, true); } void QrCode::drawVersion() { if (version < 7) return; // Calculate error correction code and pack bits int rem = version; // version is uint6, in the range [7, 40] for (int i = 0; i < 12; i++) rem = (rem << 1) ^ ((rem >> 11) * 0x1F25); long data = (long)version << 12 | rem; // uint18 if (data >> 18 != 0) throw "Assertion error"; // Draw two copies for (int i = 0; i < 18; i++) { bool bit = ((data >> i) & 1) != 0; int a = size - 11 + i % 3, b = i / 3; setFunctionModule(a, b, bit); setFunctionModule(b, a, bit); } } void QrCode::drawFinderPattern(int x, int y) { for (int i = -4; i <= 4; i++) { for (int j = -4; j <= 4; j++) { int dist = std::max(std::abs(i), std::abs(j)); // Chebyshev/infinity norm int xx = x + j, yy = y + i; if (0 <= xx && xx < size && 0 <= yy && yy < size) setFunctionModule(xx, yy, dist != 2 && dist != 4); } } } void QrCode::drawAlignmentPattern(int x, int y) { for (int i = -2; i <= 2; i++) { for (int j = -2; j <= 2; j++) setFunctionModule(x + j, y + i, std::max(std::abs(i), std::abs(j)) != 1); } } void QrCode::setFunctionModule(int x, int y, bool isBlack) { modules.at(y).at(x) = isBlack; isFunction.at(y).at(x) = true; } bool QrCode::module(int x, int y) const { return modules.at(y).at(x); } vector QrCode::appendErrorCorrection(const vector &data) const { if (data.size() != static_cast(getNumDataCodewords(version, errorCorrectionLevel))) throw "Invalid argument"; // Calculate parameter numbers int numBlocks = NUM_ERROR_CORRECTION_BLOCKS[errorCorrectionLevel.getOrdinal()][version]; int blockEccLen = ECC_CODEWORDS_PER_BLOCK[errorCorrectionLevel.getOrdinal()][version]; int rawCodewords = getNumRawDataModules(version) / 8; int numShortBlocks = numBlocks - rawCodewords % numBlocks; int shortBlockLen = rawCodewords / numBlocks; // Split data into blocks and append ECC to each block vector > blocks; const ReedSolomonGenerator rs(blockEccLen); for (int i = 0, k = 0; i < numBlocks; i++) { vector dat(data.cbegin() + k, data.cbegin() + (k + shortBlockLen - blockEccLen + (i < numShortBlocks ? 0 : 1))); k += dat.size(); const vector ecc(rs.getRemainder(dat)); if (i < numShortBlocks) dat.push_back(0); dat.insert(dat.end(), ecc.cbegin(), ecc.cend()); blocks.push_back(std::move(dat)); } // Interleave (not concatenate) the bytes from every block into a single sequence vector result; for (int i = 0; static_cast(i) < blocks.at(0).size(); i++) { for (int j = 0; static_cast(j) < blocks.size(); j++) { // Skip the padding byte in short blocks if (i != shortBlockLen - blockEccLen || j >= numShortBlocks) result.push_back(blocks.at(j).at(i)); } } if (result.size() != static_cast(rawCodewords)) throw "Assertion error"; return result; } void QrCode::drawCodewords(const vector &data) { if (data.size() != static_cast(getNumRawDataModules(version) / 8)) throw "Invalid argument"; size_t i = 0; // Bit index into the data // Do the funny zigzag scan for (int right = size - 1; right >= 1; right -= 2) { // Index of right column in each column pair if (right == 6) right = 5; for (int vert = 0; vert < size; vert++) { // Vertical counter for (int j = 0; j < 2; j++) { int x = right - j; // Actual x coordinate bool upward = ((right + 1) & 2) == 0; int y = upward ? size - 1 - vert : vert; // Actual y coordinate if (!isFunction.at(y).at(x) && i < data.size() * 8) { modules.at(y).at(x) = ((data.at(i >> 3) >> (7 - (i & 7))) & 1) != 0; i++; } // If there are any remainder bits (0 to 7), they are already // set to 0/false/white when the grid of modules was initialized } } } if (static_cast(i) != data.size() * 8) throw "Assertion error"; } void QrCode::applyMask(int mask) { if (mask < 0 || mask > 7) throw "Mask value out of range"; for (int y = 0; y < size; y++) { for (int x = 0; x < size; x++) { bool invert; switch (mask) { case 0: invert = (x + y) % 2 == 0; break; case 1: invert = y % 2 == 0; break; case 2: invert = x % 3 == 0; break; case 3: invert = (x + y) % 3 == 0; break; case 4: invert = (x / 3 + y / 2) % 2 == 0; break; case 5: invert = x * y % 2 + x * y % 3 == 0; break; case 6: invert = (x * y % 2 + x * y % 3) % 2 == 0; break; case 7: invert = ((x + y) % 2 + x * y % 3) % 2 == 0; break; default: throw "Assertion error"; } modules.at(y).at(x) = modules.at(y).at(x) ^ (invert & !isFunction.at(y).at(x)); } } } int QrCode::handleConstructorMasking(int mask) { if (mask == -1) { // Automatically choose best mask long minPenalty = LONG_MAX; for (int i = 0; i < 8; i++) { drawFormatBits(i); applyMask(i); long penalty = getPenaltyScore(); if (penalty < minPenalty) { mask = i; minPenalty = penalty; } applyMask(i); // Undoes the mask due to XOR } } if (mask < 0 || mask > 7) throw "Assertion error"; drawFormatBits(mask); // Overwrite old format bits applyMask(mask); // Apply the final choice of mask return mask; // The caller shall assign this value to the final-declared field } long QrCode::getPenaltyScore() const { long result = 0; // Adjacent modules in row having same color for (int y = 0; y < size; y++) { bool colorX; for (int x = 0, runX; x < size; x++) { if (x == 0 || module(x, y) != colorX) { colorX = module(x, y); runX = 1; } else { runX++; if (runX == 5) result += PENALTY_N1; else if (runX > 5) result++; } } } // Adjacent modules in column having same color for (int x = 0; x < size; x++) { bool colorY; for (int y = 0, runY; y < size; y++) { if (y == 0 || module(x, y) != colorY) { colorY = module(x, y); runY = 1; } else { runY++; if (runY == 5) result += PENALTY_N1; else if (runY > 5) result++; } } } // 2*2 blocks of modules having same color for (int y = 0; y < size - 1; y++) { for (int x = 0; x < size - 1; x++) { bool color = module(x, y); if ( color == module(x + 1, y) && color == module(x, y + 1) && color == module(x + 1, y + 1)) result += PENALTY_N2; } } // Finder-like pattern in rows for (int y = 0; y < size; y++) { for (int x = 0, bits = 0; x < size; x++) { bits = ((bits << 1) & 0x7FF) | (module(x, y) ? 1 : 0); if (x >= 10 && (bits == 0x05D || bits == 0x5D0)) // Needs 11 bits accumulated result += PENALTY_N3; } } // Finder-like pattern in columns for (int x = 0; x < size; x++) { for (int y = 0, bits = 0; y < size; y++) { bits = ((bits << 1) & 0x7FF) | (module(x, y) ? 1 : 0); if (y >= 10 && (bits == 0x05D || bits == 0x5D0)) // Needs 11 bits accumulated result += PENALTY_N3; } } // Balance of black and white modules int black = 0; for (const vector &row : modules) { for (bool color : row) { if (color) black++; } } int total = size * size; // Find smallest k such that (45-5k)% <= dark/total <= (55+5k)% for (int k = 0; black*20L < (9L-k)*total || black*20L > (11L+k)*total; k++) result += PENALTY_N4; return result; } vector QrCode::getAlignmentPatternPositions(int ver) { if (ver < MIN_VERSION || ver > MAX_VERSION) throw "Version number out of range"; else if (ver == 1) return vector(); else { int numAlign = ver / 7 + 2; int step; if (ver != 32) { // ceil((size - 13) / (2*numAlign - 2)) * 2 step = (ver * 4 + numAlign * 2 + 1) / (2 * numAlign - 2) * 2; } else // C-C-C-Combo breaker! step = 26; vector result; for (int i = 0, pos = ver * 4 + 10; i < numAlign - 1; i++, pos -= step) result.insert(result.begin(), pos); result.insert(result.begin(), 6); return result; } } int QrCode::getNumRawDataModules(int ver) { if (ver < MIN_VERSION || ver > MAX_VERSION) throw "Version number out of range"; int result = (16 * ver + 128) * ver + 64; if (ver >= 2) { int numAlign = ver / 7 + 2; result -= (25 * numAlign - 10) * numAlign - 55; if (ver >= 7) result -= 18 * 2; // Subtract version information } return result; } int QrCode::getNumDataCodewords(int ver, Ecc ecl) { if (ver < MIN_VERSION || ver > MAX_VERSION) throw "Version number out of range"; return getNumRawDataModules(ver) / 8 - ECC_CODEWORDS_PER_BLOCK[ecl.getOrdinal()][ver] * NUM_ERROR_CORRECTION_BLOCKS[ecl.getOrdinal()][ver]; } /*---- Tables of constants ----*/ const int QrCode::PENALTY_N1 = 3; const int QrCode::PENALTY_N2 = 3; const int QrCode::PENALTY_N3 = 40; const int QrCode::PENALTY_N4 = 10; const int8_t QrCode::ECC_CODEWORDS_PER_BLOCK[4][41] = { // Version: (note that index 0 is for padding, and is set to an illegal value) //0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40 Error correction level {-1, 7, 10, 15, 20, 26, 18, 20, 24, 30, 18, 20, 24, 26, 30, 22, 24, 28, 30, 28, 28, 28, 28, 30, 30, 26, 28, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30}, // Low {-1, 10, 16, 26, 18, 24, 16, 18, 22, 22, 26, 30, 22, 22, 24, 24, 28, 28, 26, 26, 26, 26, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28}, // Medium {-1, 13, 22, 18, 26, 18, 24, 18, 22, 20, 24, 28, 26, 24, 20, 30, 24, 28, 28, 26, 30, 28, 30, 30, 30, 30, 28, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30}, // Quartile {-1, 17, 28, 22, 16, 22, 28, 26, 26, 24, 28, 24, 28, 22, 24, 24, 30, 28, 28, 26, 28, 30, 24, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30}, // High }; const int8_t QrCode::NUM_ERROR_CORRECTION_BLOCKS[4][41] = { // Version: (note that index 0 is for padding, and is set to an illegal value) //0, 1, 2, 3, 4, 5, 6, 7, 8, 9,10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40 Error correction level {-1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 4, 4, 4, 4, 4, 6, 6, 6, 6, 7, 8, 8, 9, 9, 10, 12, 12, 12, 13, 14, 15, 16, 17, 18, 19, 19, 20, 21, 22, 24, 25}, // Low {-1, 1, 1, 1, 2, 2, 4, 4, 4, 5, 5, 5, 8, 9, 9, 10, 10, 11, 13, 14, 16, 17, 17, 18, 20, 21, 23, 25, 26, 28, 29, 31, 33, 35, 37, 38, 40, 43, 45, 47, 49}, // Medium {-1, 1, 1, 2, 2, 4, 4, 6, 6, 8, 8, 8, 10, 12, 16, 12, 17, 16, 18, 21, 20, 23, 23, 25, 27, 29, 34, 34, 35, 38, 40, 43, 45, 48, 51, 53, 56, 59, 62, 65, 68}, // Quartile {-1, 1, 1, 2, 4, 4, 4, 5, 6, 8, 8, 11, 11, 16, 16, 18, 16, 19, 21, 25, 25, 25, 34, 30, 32, 35, 37, 40, 42, 45, 48, 51, 54, 57, 60, 63, 66, 70, 74, 77, 81}, // High }; QrCode::ReedSolomonGenerator::ReedSolomonGenerator(int degree) : coefficients() { if (degree < 1 || degree > 255) throw "Degree out of range"; // Start with the monomial x^0 coefficients.resize(degree); coefficients.at(degree - 1) = 1; // Compute the product polynomial (x - r^0) * (x - r^1) * (x - r^2) * ... * (x - r^{degree-1}), // drop the highest term, and store the rest of the coefficients in order of descending powers. // Note that r = 0x02, which is a generator element of this field GF(2^8/0x11D). uint8_t root = 1; for (int i = 0; i < degree; i++) { // Multiply the current product by (x - r^i) for (size_t j = 0; j < coefficients.size(); j++) { coefficients.at(j) = multiply(coefficients.at(j), root); if (j + 1 < coefficients.size()) coefficients.at(j) ^= coefficients.at(j + 1); } root = multiply(root, 0x02); } } vector QrCode::ReedSolomonGenerator::getRemainder(const vector &data) const { // Compute the remainder by performing polynomial division vector result(coefficients.size()); for (uint8_t b : data) { uint8_t factor = b ^ result.at(0); result.erase(result.begin()); result.push_back(0); for (size_t j = 0; j < result.size(); j++) result.at(j) ^= multiply(coefficients.at(j), factor); } return result; } uint8_t QrCode::ReedSolomonGenerator::multiply(uint8_t x, uint8_t y) { // Russian peasant multiplication int z = 0; for (int i = 7; i >= 0; i--) { z = (z << 1) ^ ((z >> 7) * 0x11D); z ^= ((y >> i) & 1) * x; } if (z >> 8 != 0) throw "Assertion error"; return static_cast(z); } } uTox/third_party/qrcodegen/qrcodegen/cpp/Makefile0000600000175000001440000000412314003056224021166 0ustar rakusers# # Makefile for QR Code generator (C++) # # Copyright (c) Project Nayuki. (MIT License) # https://www.nayuki.io/page/qr-code-generator-library # # 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. # # ---- Configuration options ---- # External/implicit variables: # - CXX: The C++ compiler, such as g++ or clang++. # - CXXFLAGS: Any extra user-specified compiler flags (can be blank). # Mandatory compiler flags CXXFLAGS += -std=c++11 # Diagnostics. Adding '-fsanitize=address' is helpful for most versions of Clang and newer versions of GCC. CXXFLAGS += -Wall -fsanitize=undefined # Optimization level CXXFLAGS += -O1 # ---- Controlling make ---- # Clear default suffix rules .SUFFIXES: # Don't delete object files .SECONDARY: # Stuff concerning goals .DEFAULT_GOAL = all .PHONY: all clean # ---- Targets to build ---- LIBSRC = BitBuffer QrCode QrSegment MAINS = QrCodeGeneratorDemo QrCodeGeneratorWorker # Build all binaries all: $(MAINS) # Delete build output clean: rm -f -- $(MAINS) # Executable files %: %.cpp $(LIBSRC:=.cpp) $(LIBSRC:=.hpp) $(CXX) $(CXXFLAGS) -o $@ $< $(LIBSRC:=.cpp) uTox/third_party/qrcodegen/qrcodegen/cpp/BitBuffer.hpp0000600000175000001440000000354714003056224022120 0ustar rakusers/* * QR Code generator library (C++) * * Copyright (c) Project Nayuki. (MIT License) * https://www.nayuki.io/page/qr-code-generator-library * * 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. */ #pragma once #include #include namespace qrcodegen { /* * An appendable sequence of bits (0's and 1's). */ class BitBuffer final : public std::vector { /*---- Constructor ----*/ // Creates an empty bit buffer (length 0). public: BitBuffer(); /*---- Methods ----*/ // Packs this buffer's bits into bytes in big endian, // padding with '0' bit values, and returns the new vector. public: std::vector getBytes() const; // Appends the given number of low bits of the given value // to this sequence. Requires 0 <= val < 2^len. public: void appendBits(std::uint32_t val, int len); }; } uTox/third_party/qrcodegen/qrcodegen/cpp/BitBuffer.cpp0000600000175000001440000000344314003056224022106 0ustar rakusers/* * QR Code generator library (C++) * * Copyright (c) Project Nayuki. (MIT License) * https://www.nayuki.io/page/qr-code-generator-library * * 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. */ #include "BitBuffer.hpp" namespace qrcodegen { BitBuffer::BitBuffer() : std::vector() {} std::vector BitBuffer::getBytes() const { std::vector result(size() / 8 + (size() % 8 == 0 ? 0 : 1)); for (std::size_t i = 0; i < size(); i++) result[i >> 3] |= (*this)[i] ? 1 << (7 - (i & 7)) : 0; return result; } void BitBuffer::appendBits(std::uint32_t val, int len) { if (len < 0 || len > 31 || val >> len != 0) throw "Value out of range"; for (int i = len - 1; i >= 0; i--) // Append bit by bit this->push_back(((val >> i) & 1) != 0); } } uTox/third_party/qrcodegen/qrcodegen/c/0000700000175000001440000000000014003056224017164 5ustar rakusersuTox/third_party/qrcodegen/qrcodegen/c/qrcodegen.h0000600000175000001440000002644314003056224021317 0ustar rakusers/* * QR Code generator library (C) * * Copyright (c) Project Nayuki. (MIT License) * https://www.nayuki.io/page/qr-code-generator-library * * 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. */ #pragma once #include #include #include /*---- Enum and struct types----*/ /* * The error correction level used in a QR Code symbol. */ enum qrcodegen_Ecc { qrcodegen_Ecc_LOW = 0, qrcodegen_Ecc_MEDIUM, qrcodegen_Ecc_QUARTILE, qrcodegen_Ecc_HIGH, }; /* * The mask pattern used in a QR Code symbol. */ enum qrcodegen_Mask { // A special value to tell the QR Code encoder to // automatically select an appropriate mask pattern qrcodegen_Mask_AUTO = -1, // The eight actual mask patterns qrcodegen_Mask_0 = 0, qrcodegen_Mask_1, qrcodegen_Mask_2, qrcodegen_Mask_3, qrcodegen_Mask_4, qrcodegen_Mask_5, qrcodegen_Mask_6, qrcodegen_Mask_7, }; /* * The mode field of a segment. */ enum qrcodegen_Mode { qrcodegen_Mode_NUMERIC, qrcodegen_Mode_ALPHANUMERIC, qrcodegen_Mode_BYTE, qrcodegen_Mode_KANJI, qrcodegen_Mode_ECI, }; /* * A segment of user/application data that a QR Code symbol can convey. * Each segment has a mode, a character count, and character/general data that is * already encoded as a sequence of bits. The maximum allowed bit length is 32767, * because even the largest QR Code (version 40) has only 31329 modules. */ struct qrcodegen_Segment { // The mode indicator for this segment. enum qrcodegen_Mode mode; // The length of this segment's unencoded data. Always in the range [0, 32767]. // For numeric, alphanumeric, and kanji modes, this measures in Unicode code points. // For byte mode, this measures in bytes (raw binary data, text in UTF-8, or other encodings). // For ECI mode, this is always zero. int numChars; // The data bits of this segment, packed in bitwise big endian. // Can be null if the bit length is zero. uint8_t *data; // The number of valid data bits used in the buffer. Requires // 0 <= bitLength <= 32767, and bitLength <= (capacity of data array) * 8. int bitLength; }; /*---- Macro constants and functions ----*/ // The minimum and maximum defined QR Code version numbers for Model 2. #define qrcodegen_VERSION_MIN 1 #define qrcodegen_VERSION_MAX 40 // Calculates the number of bytes needed to store any QR Code up to and including the given version number, // as a compile-time constant. For example, 'uint8_t buffer[qrcodegen_BUFFER_LEN_FOR_VERSION(25)];' // can store any single QR Code from version 1 to 25, inclusive. // Requires qrcodegen_VERSION_MIN <= n <= qrcodegen_VERSION_MAX. #define qrcodegen_BUFFER_LEN_FOR_VERSION(n) ((((n) * 4 + 17) * ((n) * 4 + 17) + 7) / 8 + 1) // The worst-case number of bytes needed to store one QR Code, up to and including // version 40. This value equals 3918, which is just under 4 kilobytes. // Use this more convenient value to avoid calculating tighter memory bounds for buffers. #define qrcodegen_BUFFER_LEN_MAX qrcodegen_BUFFER_LEN_FOR_VERSION(qrcodegen_VERSION_MAX) /*---- Functions to generate QR Codes ----*/ /* * Encodes the given text string to a QR Code symbol, returning true if encoding succeeded. * If the data is too long to fit in any version in the given range * at the given ECC level, then false is returned. * - The input text must be encoded in UTF-8 and contain no NULs. * - The variables ecl and mask must correspond to enum constant values. * - Requires 1 <= minVersion <= maxVersion <= 40. * - The arrays tempBuffer and qrcode must each have a length * of at least qrcodegen_BUFFER_LEN_FOR_VERSION(maxVersion). * - After the function returns, tempBuffer contains no useful data. * - If successful, the resulting QR Code may use numeric, * alphanumeric, or byte mode to encode the text. * - In the most optimistic case, a QR Code at version 40 with low ECC * can hold any UTF-8 string up to 2953 bytes, or any alphanumeric string * up to 4296 characters, or any digit string up to 7089 characters. * These numbers represent the hard upper limit of the QR Code standard. * - Please consult the QR Code specification for information on * data capacities per version, ECC level, and text encoding mode. */ bool qrcodegen_encodeText(const char *text, uint8_t tempBuffer[], uint8_t qrcode[], enum qrcodegen_Ecc ecl, int minVersion, int maxVersion, enum qrcodegen_Mask mask, bool boostEcl); /* * Encodes the given binary data to a QR Code symbol, returning true if encoding succeeded. * If the data is too long to fit in any version in the given range * at the given ECC level, then false is returned. * - The input array range dataAndTemp[0 : dataLen] should normally be * valid UTF-8 text, but is not required by the QR Code standard. * - The variables ecl and mask must correspond to enum constant values. * - Requires 1 <= minVersion <= maxVersion <= 40. * - The arrays dataAndTemp and qrcode must each have a length * of at least qrcodegen_BUFFER_LEN_FOR_VERSION(maxVersion). * - After the function returns, the contents of dataAndTemp may have changed, * and does not represent useful data anymore. * - If successful, the resulting QR Code will use byte mode to encode the data. * - In the most optimistic case, a QR Code at version 40 with low ECC can hold any byte * sequence up to length 2953. This is the hard upper limit of the QR Code standard. * - Please consult the QR Code specification for information on * data capacities per version, ECC level, and text encoding mode. */ bool qrcodegen_encodeBinary(uint8_t dataAndTemp[], size_t dataLen, uint8_t qrcode[], enum qrcodegen_Ecc ecl, int minVersion, int maxVersion, enum qrcodegen_Mask mask, bool boostEcl); /* * Tests whether the given string can be encoded as a segment in alphanumeric mode. */ bool qrcodegen_isAlphanumeric(const char *text); /* * Tests whether the given string can be encoded as a segment in numeric mode. */ bool qrcodegen_isNumeric(const char *text); /* * Returns the number of bytes (uint8_t) needed for the data buffer of a segment * containing the given number of characters using the given mode. Notes: * - Returns SIZE_MAX on failure, i.e. numChars > INT16_MAX or * the number of needed bits exceeds INT16_MAX (i.e. 32767). * - Otherwise, all valid results are in the range [0, ceil(INT16_MAX / 8)], i.e. at most 4096. * - It is okay for the user to allocate more bytes for the buffer than needed. * - For byte mode, numChars measures the number of bytes, not Unicode code points. * - For ECI mode, numChars must be 0, and the worst-case number of bytes is returned. * An actual ECI segment can have shorter data. For non-ECI modes, the result is exact. */ size_t qrcodegen_calcSegmentBufferSize(enum qrcodegen_Mode mode, size_t numChars); /* * Returns a segment representing the given binary data encoded in byte mode. */ struct qrcodegen_Segment qrcodegen_makeBytes(const uint8_t data[], size_t len, uint8_t buf[]); /* * Returns a segment representing the given string of decimal digits encoded in numeric mode. */ struct qrcodegen_Segment qrcodegen_makeNumeric(const char *digits, uint8_t buf[]); /* * Returns a segment representing the given text string encoded in alphanumeric mode. * The characters allowed are: 0 to 9, A to Z (uppercase only), space, * dollar, percent, asterisk, plus, hyphen, period, slash, colon. */ struct qrcodegen_Segment qrcodegen_makeAlphanumeric(const char *text, uint8_t buf[]); /* * Returns a segment representing an Extended Channel Interpretation * (ECI) designator with the given assignment value. */ struct qrcodegen_Segment qrcodegen_makeEci(long assignVal, uint8_t buf[]); /* * Renders a QR Code symbol representing the given data segments at the given error correction * level or higher. The smallest possible QR Code version is automatically chosen for the output. * Returns true if QR Code creation succeeded, or false if the data is too long to fit in any version. * This function allows the user to create a custom sequence of segments that switches * between modes (such as alphanumeric and binary) to encode text more efficiently. * This function is considered to be lower level than simply encoding text or binary data. * To save memory, the segments' data buffers can alias/overlap tempBuffer, and will * result in them being clobbered, but the QR Code output will still be correct. * But the qrcode array must not overlap tempBuffer or any segment's data buffer. */ bool qrcodegen_encodeSegments(const struct qrcodegen_Segment segs[], size_t len, enum qrcodegen_Ecc ecl, uint8_t tempBuffer[], uint8_t qrcode[]); /* * Renders a QR Code symbol representing the given data segments with the given encoding parameters. * Returns true if QR Code creation succeeded, or false if the data is too long to fit in the range of versions. * The smallest possible QR Code version within the given range is automatically chosen for the output. * This function allows the user to create a custom sequence of segments that switches * between modes (such as alphanumeric and binary) to encode text more efficiently. * This function is considered to be lower level than simply encoding text or binary data. * To save memory, the segments' data buffers can alias/overlap tempBuffer, and will * result in them being clobbered, but the QR Code output will still be correct. * But the qrcode array must not overlap tempBuffer or any segment's data buffer. */ bool qrcodegen_encodeSegmentsAdvanced(const struct qrcodegen_Segment segs[], size_t len, enum qrcodegen_Ecc ecl, int minVersion, int maxVersion, int mask, bool boostEcl, uint8_t tempBuffer[], uint8_t qrcode[]); /*---- Functions to extract raw data from QR Codes ----*/ /* * Returns the side length of the given QR Code, assuming that encoding succeeded. * The result is in the range [21, 177]. Note that the length of the array buffer * is related to the side length - every 'uint8_t qrcode[]' must have length at least * qrcodegen_BUFFER_LEN_FOR_VERSION(version), which equals ceil(size^2 / 8 + 1). */ int qrcodegen_getSize(const uint8_t qrcode[]); /* * Returns the color of the module (pixel) at the given coordinates, which is either * false for white or true for black. The top left corner has the coordinates (x=0, y=0). * If the given coordinates are out of bounds, then false (white) is returned. */ bool qrcodegen_getModule(const uint8_t qrcode[], int x, int y); uTox/third_party/qrcodegen/qrcodegen/c/qrcodegen.c0000600000175000001440000011570514003056224021312 0ustar rakusers/* * QR Code generator library (C) * * Copyright (c) Project Nayuki. (MIT License) * https://www.nayuki.io/page/qr-code-generator-library * * 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. */ #include #include #include #include #include "qrcodegen.h" #ifndef QRCODEGEN_TEST #define testable static // Keep functions private #else // Expose private functions #ifndef __cplusplus #define testable #else // Needed for const variables because they are treated as implicitly 'static' in C++ #define testable extern #endif #endif /*---- Forward declarations for private functions ----*/ // Regarding all public and private functions defined in this source file: // - They require all pointer/array arguments to be not null. // - They only read input scalar/array arguments, write to output pointer/array // arguments, and return scalar values; they are "pure" functions. // - They don't read mutable global variables or write to any global variables. // - They don't perform I/O, read the clock, print to console, etc. // - They allocate a small and constant amount of stack memory. // - They don't allocate or free any memory on the heap. // - They don't recurse or mutually recurse. All the code // could be inlined into the top-level public functions. // - They run in at most quadratic time with respect to input arguments. // Most functions run in linear time, and some in constant time. // There are no unbounded loops or non-obvious termination conditions. // - They are completely thread-safe if the caller does not give the // same writable buffer to concurrent calls to these functions. testable void appendBitsToBuffer(unsigned int val, int numBits, uint8_t buffer[], int *bitLen); testable void appendErrorCorrection(uint8_t data[], int version, enum qrcodegen_Ecc ecl, uint8_t result[]); testable int getNumDataCodewords(int version, enum qrcodegen_Ecc ecl); testable int getNumRawDataModules(int version); testable void calcReedSolomonGenerator(int degree, uint8_t result[]); testable void calcReedSolomonRemainder(const uint8_t data[], int dataLen, const uint8_t generator[], int degree, uint8_t result[]); testable uint8_t finiteFieldMultiply(uint8_t x, uint8_t y); testable void initializeFunctionModules(int version, uint8_t qrcode[]); static void drawWhiteFunctionModules(uint8_t qrcode[], int version); static void drawFormatBits(enum qrcodegen_Ecc ecl, enum qrcodegen_Mask mask, uint8_t qrcode[]); testable int getAlignmentPatternPositions(int version, uint8_t result[7]); static void fillRectangle(int left, int top, int width, int height, uint8_t qrcode[]); static void drawCodewords(const uint8_t data[], int dataLen, uint8_t qrcode[]); static void applyMask(const uint8_t functionModules[], uint8_t qrcode[], enum qrcodegen_Mask mask); static long getPenaltyScore(const uint8_t qrcode[]); testable bool getModule(const uint8_t qrcode[], int x, int y); testable void setModule(uint8_t qrcode[], int x, int y, bool isBlack); testable void setModuleBounded(uint8_t qrcode[], int x, int y, bool isBlack); testable int calcSegmentBitLength(enum qrcodegen_Mode mode, size_t numChars); testable int getTotalBits(const struct qrcodegen_Segment segs[], size_t len, int version); static int numCharCountBits(enum qrcodegen_Mode mode, int version); /*---- Private tables of constants ----*/ // For checking text and encoding segments. static const char *ALPHANUMERIC_CHARSET = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ $%*+-./:"; // For generating error correction codes. testable const int8_t ECC_CODEWORDS_PER_BLOCK[4][41] = { // Version: (note that index 0 is for padding, and is set to an illegal value) //0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40 Error correction level {-1, 7, 10, 15, 20, 26, 18, 20, 24, 30, 18, 20, 24, 26, 30, 22, 24, 28, 30, 28, 28, 28, 28, 30, 30, 26, 28, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30}, // Low {-1, 10, 16, 26, 18, 24, 16, 18, 22, 22, 26, 30, 22, 22, 24, 24, 28, 28, 26, 26, 26, 26, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28}, // Medium {-1, 13, 22, 18, 26, 18, 24, 18, 22, 20, 24, 28, 26, 24, 20, 30, 24, 28, 28, 26, 30, 28, 30, 30, 30, 30, 28, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30}, // Quartile {-1, 17, 28, 22, 16, 22, 28, 26, 26, 24, 28, 24, 28, 22, 24, 24, 30, 28, 28, 26, 28, 30, 24, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30}, // High }; // For generating error correction codes. testable const int8_t NUM_ERROR_CORRECTION_BLOCKS[4][41] = { // Version: (note that index 0 is for padding, and is set to an illegal value) //0, 1, 2, 3, 4, 5, 6, 7, 8, 9,10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40 Error correction level {-1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 4, 4, 4, 4, 4, 6, 6, 6, 6, 7, 8, 8, 9, 9, 10, 12, 12, 12, 13, 14, 15, 16, 17, 18, 19, 19, 20, 21, 22, 24, 25}, // Low {-1, 1, 1, 1, 2, 2, 4, 4, 4, 5, 5, 5, 8, 9, 9, 10, 10, 11, 13, 14, 16, 17, 17, 18, 20, 21, 23, 25, 26, 28, 29, 31, 33, 35, 37, 38, 40, 43, 45, 47, 49}, // Medium {-1, 1, 1, 2, 2, 4, 4, 6, 6, 8, 8, 8, 10, 12, 16, 12, 17, 16, 18, 21, 20, 23, 23, 25, 27, 29, 34, 34, 35, 38, 40, 43, 45, 48, 51, 53, 56, 59, 62, 65, 68}, // Quartile {-1, 1, 1, 2, 4, 4, 4, 5, 6, 8, 8, 11, 11, 16, 16, 18, 16, 19, 21, 25, 25, 25, 34, 30, 32, 35, 37, 40, 42, 45, 48, 51, 54, 57, 60, 63, 66, 70, 74, 77, 81}, // High }; // For automatic mask pattern selection. static const int PENALTY_N1 = 3; static const int PENALTY_N2 = 3; static const int PENALTY_N3 = 40; static const int PENALTY_N4 = 10; /*---- High-level QR Code encoding functions ----*/ // Public function - see documentation comment in header file. bool qrcodegen_encodeText(const char *text, uint8_t tempBuffer[], uint8_t qrcode[], enum qrcodegen_Ecc ecl, int minVersion, int maxVersion, enum qrcodegen_Mask mask, bool boostEcl) { size_t textLen = strlen(text); if (textLen == 0) return qrcodegen_encodeSegmentsAdvanced(NULL, 0, ecl, minVersion, maxVersion, mask, boostEcl, tempBuffer, qrcode); size_t bufLen = qrcodegen_BUFFER_LEN_FOR_VERSION(maxVersion); struct qrcodegen_Segment seg; if (qrcodegen_isNumeric(text)) { if (qrcodegen_calcSegmentBufferSize(qrcodegen_Mode_NUMERIC, textLen) > bufLen) goto fail; seg = qrcodegen_makeNumeric(text, tempBuffer); } else if (qrcodegen_isAlphanumeric(text)) { if (qrcodegen_calcSegmentBufferSize(qrcodegen_Mode_ALPHANUMERIC, textLen) > bufLen) goto fail; seg = qrcodegen_makeAlphanumeric(text, tempBuffer); } else { if (textLen > bufLen) goto fail; for (size_t i = 0; i < textLen; i++) tempBuffer[i] = (uint8_t)text[i]; seg.mode = qrcodegen_Mode_BYTE; seg.bitLength = calcSegmentBitLength(seg.mode, textLen); if (seg.bitLength == -1) goto fail; seg.numChars = (int)textLen; seg.data = tempBuffer; } return qrcodegen_encodeSegmentsAdvanced(&seg, 1, ecl, minVersion, maxVersion, mask, boostEcl, tempBuffer, qrcode); fail: qrcode[0] = 0; // Set size to invalid value for safety return false; } // Public function - see documentation comment in header file. bool qrcodegen_encodeBinary(uint8_t dataAndTemp[], size_t dataLen, uint8_t qrcode[], enum qrcodegen_Ecc ecl, int minVersion, int maxVersion, enum qrcodegen_Mask mask, bool boostEcl) { struct qrcodegen_Segment seg; seg.mode = qrcodegen_Mode_BYTE; seg.bitLength = calcSegmentBitLength(seg.mode, dataLen); if (seg.bitLength == -1) { qrcode[0] = 0; // Set size to invalid value for safety return false; } seg.numChars = (int)dataLen; seg.data = dataAndTemp; return qrcodegen_encodeSegmentsAdvanced(&seg, 1, ecl, minVersion, maxVersion, mask, boostEcl, dataAndTemp, qrcode); } // Appends the given sequence of bits to the given byte-based bit buffer, increasing the bit length. testable void appendBitsToBuffer(unsigned int val, int numBits, uint8_t buffer[], int *bitLen) { assert(0 <= numBits && numBits <= 16 && (unsigned long)val >> numBits == 0); for (int i = numBits - 1; i >= 0; i--, (*bitLen)++) buffer[*bitLen >> 3] |= ((val >> i) & 1) << (7 - (*bitLen & 7)); } /*---- Error correction code generation functions ----*/ // Appends error correction bytes to each block of the given data array, then interleaves bytes // from the blocks and stores them in the result array. data[0 : rawCodewords - totalEcc] contains // the input data. data[rawCodewords - totalEcc : rawCodewords] is used as a temporary work area // and will be clobbered by this function. The final answer is stored in result[0 : rawCodewords]. testable void appendErrorCorrection(uint8_t data[], int version, enum qrcodegen_Ecc ecl, uint8_t result[]) { // Calculate parameter numbers assert(0 <= (int)ecl && (int)ecl < 4 && qrcodegen_VERSION_MIN <= version && version <= qrcodegen_VERSION_MAX); int numBlocks = NUM_ERROR_CORRECTION_BLOCKS[(int)ecl][version]; int blockEccLen = ECC_CODEWORDS_PER_BLOCK[(int)ecl][version]; int rawCodewords = getNumRawDataModules(version) / 8; int dataLen = rawCodewords - blockEccLen * numBlocks; int numShortBlocks = numBlocks - rawCodewords % numBlocks; int shortBlockDataLen = rawCodewords / numBlocks - blockEccLen; // Split data into blocks and append ECC after all data uint8_t generator[30]; calcReedSolomonGenerator(blockEccLen, generator); for (int i = 0, j = dataLen, k = 0; i < numBlocks; i++) { int blockLen = shortBlockDataLen; if (i >= numShortBlocks) blockLen++; calcReedSolomonRemainder(&data[k], blockLen, generator, blockEccLen, &data[j]); j += blockEccLen; k += blockLen; } // Interleave (not concatenate) the bytes from every block into a single sequence for (int i = 0, k = 0; i < numBlocks; i++) { for (int j = 0, l = i; j < shortBlockDataLen; j++, k++, l += numBlocks) result[l] = data[k]; if (i >= numShortBlocks) k++; } for (int i = numShortBlocks, k = (numShortBlocks + 1) * shortBlockDataLen, l = numBlocks * shortBlockDataLen; i < numBlocks; i++, k += shortBlockDataLen + 1, l++) result[l] = data[k]; for (int i = 0, k = dataLen; i < numBlocks; i++) { for (int j = 0, l = dataLen + i; j < blockEccLen; j++, k++, l += numBlocks) result[l] = data[k]; } } // Returns the number of 8-bit codewords that can be used for storing data (not ECC), // for the given version number and error correction level. The result is in the range [9, 2956]. testable int getNumDataCodewords(int version, enum qrcodegen_Ecc ecl) { int v = version, e = (int)ecl; assert(0 <= e && e < 4 && qrcodegen_VERSION_MIN <= v && v <= qrcodegen_VERSION_MAX); return getNumRawDataModules(v) / 8 - ECC_CODEWORDS_PER_BLOCK[e][v] * NUM_ERROR_CORRECTION_BLOCKS[e][v]; } // Returns the number of data bits that can be stored in a QR Code of the given version number, after // all function modules are excluded. This includes remainder bits, so it might not be a multiple of 8. // The result is in the range [208, 29648]. This could be implemented as a 40-entry lookup table. testable int getNumRawDataModules(int version) { assert(qrcodegen_VERSION_MIN <= version && version <= qrcodegen_VERSION_MAX); int result = (16 * version + 128) * version + 64; if (version >= 2) { int numAlign = version / 7 + 2; result -= (25 * numAlign - 10) * numAlign - 55; if (version >= 7) result -= 18 * 2; // Subtract version information } return result; } /*---- Reed-Solomon ECC generator functions ----*/ // Calculates the Reed-Solomon generator polynomial of the given degree, storing in result[0 : degree]. testable void calcReedSolomonGenerator(int degree, uint8_t result[]) { // Start with the monomial x^0 assert(1 <= degree && degree <= 30); memset(result, 0, degree * sizeof(result[0])); result[degree - 1] = 1; // Compute the product polynomial (x - r^0) * (x - r^1) * (x - r^2) * ... * (x - r^{degree-1}), // drop the highest term, and store the rest of the coefficients in order of descending powers. // Note that r = 0x02, which is a generator element of this field GF(2^8/0x11D). uint8_t root = 1; for (int i = 0; i < degree; i++) { // Multiply the current product by (x - r^i) for (int j = 0; j < degree; j++) { result[j] = finiteFieldMultiply(result[j], root); if (j + 1 < degree) result[j] ^= result[j + 1]; } root = finiteFieldMultiply(root, 0x02); } } // Calculates the remainder of the polynomial data[0 : dataLen] when divided by the generator[0 : degree], where all // polynomials are in big endian and the generator has an implicit leading 1 term, storing the result in result[0 : degree]. testable void calcReedSolomonRemainder(const uint8_t data[], int dataLen, const uint8_t generator[], int degree, uint8_t result[]) { // Perform polynomial division assert(1 <= degree && degree <= 30); memset(result, 0, degree * sizeof(result[0])); for (int i = 0; i < dataLen; i++) { uint8_t factor = data[i] ^ result[0]; memmove(&result[0], &result[1], (degree - 1) * sizeof(result[0])); result[degree - 1] = 0; for (int j = 0; j < degree; j++) result[j] ^= finiteFieldMultiply(generator[j], factor); } } // Returns the product of the two given field elements modulo GF(2^8/0x11D). // All inputs are valid. This could be implemented as a 256*256 lookup table. testable uint8_t finiteFieldMultiply(uint8_t x, uint8_t y) { // Russian peasant multiplication uint8_t z = 0; for (int i = 7; i >= 0; i--) { z = (z << 1) ^ ((z >> 7) * 0x11D); z ^= ((y >> i) & 1) * x; } return z; } /*---- Drawing function modules ----*/ // Clears the given QR Code grid with white modules for the given // version's size, then marks every function module as black. testable void initializeFunctionModules(int version, uint8_t qrcode[]) { // Initialize QR Code int qrsize = version * 4 + 17; memset(qrcode, 0, ((qrsize * qrsize + 7) / 8 + 1) * sizeof(qrcode[0])); qrcode[0] = (uint8_t)qrsize; // Fill horizontal and vertical timing patterns fillRectangle(6, 0, 1, qrsize, qrcode); fillRectangle(0, 6, qrsize, 1, qrcode); // Fill 3 finder patterns (all corners except bottom right) and format bits fillRectangle(0, 0, 9, 9, qrcode); fillRectangle(qrsize - 8, 0, 8, 9, qrcode); fillRectangle(0, qrsize - 8, 9, 8, qrcode); // Fill numerous alignment patterns uint8_t alignPatPos[7] = {0}; int numAlign = getAlignmentPatternPositions(version, alignPatPos); for (int i = 0; i < numAlign; i++) { for (int j = 0; j < numAlign; j++) { if ((i == 0 && j == 0) || (i == 0 && j == numAlign - 1) || (i == numAlign - 1 && j == 0)) continue; // Skip the three finder corners else fillRectangle(alignPatPos[i] - 2, alignPatPos[j] - 2, 5, 5, qrcode); } } // Fill version blocks if (version >= 7) { fillRectangle(qrsize - 11, 0, 3, 6, qrcode); fillRectangle(0, qrsize - 11, 6, 3, qrcode); } } // Draws white function modules and possibly some black modules onto the given QR Code, without changing // non-function modules. This does not draw the format bits. This requires all function modules to be previously // marked black (namely by initializeFunctionModules()), because this may skip redrawing black function modules. static void drawWhiteFunctionModules(uint8_t qrcode[], int version) { // Draw horizontal and vertical timing patterns int qrsize = qrcodegen_getSize(qrcode); for (int i = 7; i < qrsize - 7; i += 2) { setModule(qrcode, 6, i, false); setModule(qrcode, i, 6, false); } // Draw 3 finder patterns (all corners except bottom right; overwrites some timing modules) for (int i = -4; i <= 4; i++) { for (int j = -4; j <= 4; j++) { int dist = abs(i); if (abs(j) > dist) dist = abs(j); if (dist == 2 || dist == 4) { setModuleBounded(qrcode, 3 + j, 3 + i, false); setModuleBounded(qrcode, qrsize - 4 + j, 3 + i, false); setModuleBounded(qrcode, 3 + j, qrsize - 4 + i, false); } } } // Draw numerous alignment patterns uint8_t alignPatPos[7] = {0}; int numAlign = getAlignmentPatternPositions(version, alignPatPos); for (int i = 0; i < numAlign; i++) { for (int j = 0; j < numAlign; j++) { if ((i == 0 && j == 0) || (i == 0 && j == numAlign - 1) || (i == numAlign - 1 && j == 0)) continue; // Skip the three finder corners else { for (int k = -1; k <= 1; k++) { for (int l = -1; l <= 1; l++) setModule(qrcode, alignPatPos[i] + l, alignPatPos[j] + k, k == 0 && l == 0); } } } } // Draw version blocks if (version >= 7) { // Calculate error correction code and pack bits int rem = version; // version is uint6, in the range [7, 40] for (int i = 0; i < 12; i++) rem = (rem << 1) ^ ((rem >> 11) * 0x1F25); long data = (long)version << 12 | rem; // uint18 assert(data >> 18 == 0); // Draw two copies for (int i = 0; i < 6; i++) { for (int j = 0; j < 3; j++) { int k = qrsize - 11 + j; setModule(qrcode, k, i, (data & 1) != 0); setModule(qrcode, i, k, (data & 1) != 0); data >>= 1; } } } } // Draws two copies of the format bits (with its own error correction code) based // on the given mask and error correction level. This always draws all modules of // the format bits, unlike drawWhiteFunctionModules() which might skip black modules. static void drawFormatBits(enum qrcodegen_Ecc ecl, enum qrcodegen_Mask mask, uint8_t qrcode[]) { // Calculate error correction code and pack bits assert(0 <= (int)mask && (int)mask <= 7); int data = -1; // Dummy value switch (ecl) { case qrcodegen_Ecc_LOW : data = 1; break; case qrcodegen_Ecc_MEDIUM : data = 0; break; case qrcodegen_Ecc_QUARTILE: data = 3; break; case qrcodegen_Ecc_HIGH : data = 2; break; default: assert(false); } data = data << 3 | (int)mask; // ecl-derived value is uint2, mask is uint3 int rem = data; for (int i = 0; i < 10; i++) rem = (rem << 1) ^ ((rem >> 9) * 0x537); data = data << 10 | rem; data ^= 0x5412; // uint15 assert(data >> 15 == 0); // Draw first copy for (int i = 0; i <= 5; i++) setModule(qrcode, 8, i, ((data >> i) & 1) != 0); setModule(qrcode, 8, 7, ((data >> 6) & 1) != 0); setModule(qrcode, 8, 8, ((data >> 7) & 1) != 0); setModule(qrcode, 7, 8, ((data >> 8) & 1) != 0); for (int i = 9; i < 15; i++) setModule(qrcode, 14 - i, 8, ((data >> i) & 1) != 0); // Draw second copy int qrsize = qrcodegen_getSize(qrcode); for (int i = 0; i <= 7; i++) setModule(qrcode, qrsize - 1 - i, 8, ((data >> i) & 1) != 0); for (int i = 8; i < 15; i++) setModule(qrcode, 8, qrsize - 15 + i, ((data >> i) & 1) != 0); setModule(qrcode, 8, qrsize - 8, true); } // Calculates the positions of alignment patterns in ascending order for the given version number, // storing them to the given array and returning an array length in the range [0, 7]. testable int getAlignmentPatternPositions(int version, uint8_t result[7]) { if (version == 1) return 0; int numAlign = version / 7 + 2; int step; if (version != 32) { // ceil((size - 13) / (2*numAlign - 2)) * 2 step = (version * 4 + numAlign * 2 + 1) / (2 * numAlign - 2) * 2; } else // C-C-C-Combo breaker! step = 26; for (int i = numAlign - 1, pos = version * 4 + 10; i >= 1; i--, pos -= step) result[i] = pos; result[0] = 6; return numAlign; } // Sets every pixel in the range [left : left + width] * [top : top + height] to black. static void fillRectangle(int left, int top, int width, int height, uint8_t qrcode[]) { for (int dy = 0; dy < height; dy++) { for (int dx = 0; dx < width; dx++) setModule(qrcode, left + dx, top + dy, true); } } /*---- Drawing data modules and masking ----*/ // Draws the raw codewords (including data and ECC) onto the given QR Code. This requires the initial state of // the QR Code to be black at function modules and white at codeword modules (including unused remainder bits). static void drawCodewords(const uint8_t data[], int dataLen, uint8_t qrcode[]) { int qrsize = qrcodegen_getSize(qrcode); int i = 0; // Bit index into the data // Do the funny zigzag scan for (int right = qrsize - 1; right >= 1; right -= 2) { // Index of right column in each column pair if (right == 6) right = 5; for (int vert = 0; vert < qrsize; vert++) { // Vertical counter for (int j = 0; j < 2; j++) { int x = right - j; // Actual x coordinate bool upward = ((right + 1) & 2) == 0; int y = upward ? qrsize - 1 - vert : vert; // Actual y coordinate if (!getModule(qrcode, x, y) && i < dataLen * 8) { bool black = ((data[i >> 3] >> (7 - (i & 7))) & 1) != 0; setModule(qrcode, x, y, black); i++; } // If there are any remainder bits (0 to 7), they are already // set to 0/false/white when the grid of modules was initialized } } } assert(i == dataLen * 8); } // XORs the data modules in this QR Code with the given mask pattern. Due to XOR's mathematical // properties, calling applyMask(..., m) twice with the same value is equivalent to no change at all. // This means it is possible to apply a mask, undo it, and try another mask. Note that a final // well-formed QR Code symbol needs exactly one mask applied (not zero, not two, etc.). static void applyMask(const uint8_t functionModules[], uint8_t qrcode[], enum qrcodegen_Mask mask) { assert(0 <= (int)mask && (int)mask <= 7); // Disallows qrcodegen_Mask_AUTO int qrsize = qrcodegen_getSize(qrcode); for (int y = 0; y < qrsize; y++) { for (int x = 0; x < qrsize; x++) { if (getModule(functionModules, x, y)) continue; bool invert = false; // Dummy value switch ((int)mask) { case 0: invert = (x + y) % 2 == 0; break; case 1: invert = y % 2 == 0; break; case 2: invert = x % 3 == 0; break; case 3: invert = (x + y) % 3 == 0; break; case 4: invert = (x / 3 + y / 2) % 2 == 0; break; case 5: invert = x * y % 2 + x * y % 3 == 0; break; case 6: invert = (x * y % 2 + x * y % 3) % 2 == 0; break; case 7: invert = ((x + y) % 2 + x * y % 3) % 2 == 0; break; default: assert(false); } bool val = getModule(qrcode, x, y); setModule(qrcode, x, y, val ^ invert); } } } // Calculates and returns the penalty score based on state of the given QR Code's current modules. // This is used by the automatic mask choice algorithm to find the mask pattern that yields the lowest score. static long getPenaltyScore(const uint8_t qrcode[]) { int qrsize = qrcodegen_getSize(qrcode); long result = 0; // Adjacent modules in row having same color for (int y = 0; y < qrsize; y++) { bool colorX; for (int x = 0, runX; x < qrsize; x++) { if (x == 0 || getModule(qrcode, x, y) != colorX) { colorX = getModule(qrcode, x, y); runX = 1; } else { runX++; if (runX == 5) result += PENALTY_N1; else if (runX > 5) result++; } } } // Adjacent modules in column having same color for (int x = 0; x < qrsize; x++) { bool colorY; for (int y = 0, runY; y < qrsize; y++) { if (y == 0 || getModule(qrcode, x, y) != colorY) { colorY = getModule(qrcode, x, y); runY = 1; } else { runY++; if (runY == 5) result += PENALTY_N1; else if (runY > 5) result++; } } } // 2*2 blocks of modules having same color for (int y = 0; y < qrsize - 1; y++) { for (int x = 0; x < qrsize - 1; x++) { bool color = getModule(qrcode, x, y); if ( color == getModule(qrcode, x + 1, y) && color == getModule(qrcode, x, y + 1) && color == getModule(qrcode, x + 1, y + 1)) result += PENALTY_N2; } } // Finder-like pattern in rows for (int y = 0; y < qrsize; y++) { for (int x = 0, bits = 0; x < qrsize; x++) { bits = ((bits << 1) & 0x7FF) | (getModule(qrcode, x, y) ? 1 : 0); if (x >= 10 && (bits == 0x05D || bits == 0x5D0)) // Needs 11 bits accumulated result += PENALTY_N3; } } // Finder-like pattern in columns for (int x = 0; x < qrsize; x++) { for (int y = 0, bits = 0; y < qrsize; y++) { bits = ((bits << 1) & 0x7FF) | (getModule(qrcode, x, y) ? 1 : 0); if (y >= 10 && (bits == 0x05D || bits == 0x5D0)) // Needs 11 bits accumulated result += PENALTY_N3; } } // Balance of black and white modules int black = 0; for (int y = 0; y < qrsize; y++) { for (int x = 0; x < qrsize; x++) { if (getModule(qrcode, x, y)) black++; } } int total = qrsize * qrsize; // Find smallest k such that (45-5k)% <= dark/total <= (55+5k)% for (int k = 0; black*20L < (9L-k)*total || black*20L > (11L+k)*total; k++) result += PENALTY_N4; return result; } /*---- Basic QR Code information ----*/ // Public function - see documentation comment in header file. int qrcodegen_getSize(const uint8_t qrcode[]) { assert(qrcode != NULL); int result = qrcode[0]; assert((qrcodegen_VERSION_MIN * 4 + 17) <= result && result <= (qrcodegen_VERSION_MAX * 4 + 17)); return result; } // Public function - see documentation comment in header file. bool qrcodegen_getModule(const uint8_t qrcode[], int x, int y) { assert(qrcode != NULL); int qrsize = qrcode[0]; return (0 <= x && x < qrsize && 0 <= y && y < qrsize) && getModule(qrcode, x, y); } // Gets the module at the given coordinates, which must be in bounds. testable bool getModule(const uint8_t qrcode[], int x, int y) { int qrsize = qrcode[0]; assert(21 <= qrsize && qrsize <= 177 && 0 <= x && x < qrsize && 0 <= y && y < qrsize); int index = y * qrsize + x; int bitIndex = index & 7; int byteIndex = (index >> 3) + 1; return ((qrcode[byteIndex] >> bitIndex) & 1) != 0; } // Sets the module at the given coordinates, which must be in bounds. testable void setModule(uint8_t qrcode[], int x, int y, bool isBlack) { int qrsize = qrcode[0]; assert(21 <= qrsize && qrsize <= 177 && 0 <= x && x < qrsize && 0 <= y && y < qrsize); int index = y * qrsize + x; int bitIndex = index & 7; int byteIndex = (index >> 3) + 1; if (isBlack) qrcode[byteIndex] |= 1 << bitIndex; else qrcode[byteIndex] &= (1 << bitIndex) ^ 0xFF; } // Sets the module at the given coordinates, doing nothing if out of bounds. testable void setModuleBounded(uint8_t qrcode[], int x, int y, bool isBlack) { int qrsize = qrcode[0]; if (0 <= x && x < qrsize && 0 <= y && y < qrsize) setModule(qrcode, x, y, isBlack); } /*---- Segment handling ----*/ // Public function - see documentation comment in header file. bool qrcodegen_isAlphanumeric(const char *text) { assert(text != NULL); for (; *text != '\0'; text++) { if (strchr(ALPHANUMERIC_CHARSET, *text) == NULL) return false; } return true; } // Public function - see documentation comment in header file. bool qrcodegen_isNumeric(const char *text) { assert(text != NULL); for (; *text != '\0'; text++) { if (*text < '0' || *text > '9') return false; } return true; } // Public function - see documentation comment in header file. size_t qrcodegen_calcSegmentBufferSize(enum qrcodegen_Mode mode, size_t numChars) { int temp = calcSegmentBitLength(mode, numChars); if (temp == -1) return SIZE_MAX; assert(0 <= temp && temp <= INT16_MAX); return ((size_t)temp + 7) / 8; } // Returns the number of data bits needed to represent a segment // containing the given number of characters using the given mode. Notes: // - Returns -1 on failure, i.e. numChars > INT16_MAX or // the number of needed bits exceeds INT16_MAX (i.e. 32767). // - Otherwise, all valid results are in the range [0, INT16_MAX]. // - For byte mode, numChars measures the number of bytes, not Unicode code points. // - For ECI mode, numChars must be 0, and the worst-case number of bits is returned. // An actual ECI segment can have shorter data. For non-ECI modes, the result is exact. testable int calcSegmentBitLength(enum qrcodegen_Mode mode, size_t numChars) { const int LIMIT = INT16_MAX; // Can be configured as high as INT_MAX if (numChars > (unsigned int)LIMIT) return -1; int n = (int)numChars; int result = -2; if (mode == qrcodegen_Mode_NUMERIC) { // n * 3 + ceil(n / 3) if (n > LIMIT / 3) goto overflow; result = n * 3; int temp = n / 3 + (n % 3 == 0 ? 0 : 1); if (temp > LIMIT - result) goto overflow; result += temp; } else if (mode == qrcodegen_Mode_ALPHANUMERIC) { // n * 5 + ceil(n / 2) if (n > LIMIT / 5) goto overflow; result = n * 5; int temp = n / 2 + n % 2; if (temp > LIMIT - result) goto overflow; result += temp; } else if (mode == qrcodegen_Mode_BYTE) { if (n > LIMIT / 8) goto overflow; result = n * 8; } else if (mode == qrcodegen_Mode_KANJI) { if (n > LIMIT / 13) goto overflow; result = n * 13; } else if (mode == qrcodegen_Mode_ECI && numChars == 0) result = 3 * 8; assert(0 <= result && result <= LIMIT); return result; overflow: return -1; } // Public function - see documentation comment in header file. struct qrcodegen_Segment qrcodegen_makeBytes(const uint8_t data[], size_t len, uint8_t buf[]) { assert(data != NULL || len == 0); struct qrcodegen_Segment result; result.mode = qrcodegen_Mode_BYTE; result.bitLength = calcSegmentBitLength(result.mode, len); assert(result.bitLength != -1); result.numChars = (int)len; if (len > 0) memcpy(buf, data, len * sizeof(buf[0])); result.data = buf; return result; } // Public function - see documentation comment in header file. struct qrcodegen_Segment qrcodegen_makeNumeric(const char *digits, uint8_t buf[]) { assert(digits != NULL); struct qrcodegen_Segment result; size_t len = strlen(digits); result.mode = qrcodegen_Mode_NUMERIC; int bitLen = calcSegmentBitLength(result.mode, len); assert(bitLen != -1); result.numChars = (int)len; if (bitLen > 0) memset(buf, 0, ((size_t)bitLen + 7) / 8 * sizeof(buf[0])); result.bitLength = 0; unsigned int accumData = 0; int accumCount = 0; for (; *digits != '\0'; digits++) { char c = *digits; assert('0' <= c && c <= '9'); accumData = accumData * 10 + (c - '0'); accumCount++; if (accumCount == 3) { appendBitsToBuffer(accumData, 10, buf, &result.bitLength); accumData = 0; accumCount = 0; } } if (accumCount > 0) // 1 or 2 digits remaining appendBitsToBuffer(accumData, accumCount * 3 + 1, buf, &result.bitLength); assert(result.bitLength == bitLen); result.data = buf; return result; } // Public function - see documentation comment in header file. struct qrcodegen_Segment qrcodegen_makeAlphanumeric(const char *text, uint8_t buf[]) { assert(text != NULL); struct qrcodegen_Segment result; size_t len = strlen(text); result.mode = qrcodegen_Mode_ALPHANUMERIC; int bitLen = calcSegmentBitLength(result.mode, len); assert(bitLen != -1); result.numChars = (int)len; if (bitLen > 0) memset(buf, 0, ((size_t)bitLen + 7) / 8 * sizeof(buf[0])); result.bitLength = 0; unsigned int accumData = 0; int accumCount = 0; for (; *text != '\0'; text++) { const char *temp = strchr(ALPHANUMERIC_CHARSET, *text); assert(temp != NULL); accumData = accumData * 45 + (temp - ALPHANUMERIC_CHARSET); accumCount++; if (accumCount == 2) { appendBitsToBuffer(accumData, 11, buf, &result.bitLength); accumData = 0; accumCount = 0; } } if (accumCount > 0) // 1 character remaining appendBitsToBuffer(accumData, 6, buf, &result.bitLength); assert(result.bitLength == bitLen); result.data = buf; return result; } // Public function - see documentation comment in header file. struct qrcodegen_Segment qrcodegen_makeEci(long assignVal, uint8_t buf[]) { struct qrcodegen_Segment result; result.mode = qrcodegen_Mode_ECI; result.numChars = 0; result.bitLength = 0; if (0 <= assignVal && assignVal < (1 << 7)) { memset(buf, 0, 1 * sizeof(buf[0])); appendBitsToBuffer(assignVal, 8, buf, &result.bitLength); } else if ((1 << 7) <= assignVal && assignVal < (1 << 14)) { memset(buf, 0, 2 * sizeof(buf[0])); appendBitsToBuffer(2, 2, buf, &result.bitLength); appendBitsToBuffer(assignVal, 14, buf, &result.bitLength); } else if ((1 << 14) <= assignVal && assignVal < 1000000L) { memset(buf, 0, 3 * sizeof(buf[0])); appendBitsToBuffer(6, 3, buf, &result.bitLength); appendBitsToBuffer(assignVal >> 10, 11, buf, &result.bitLength); appendBitsToBuffer(assignVal & 0x3FF, 10, buf, &result.bitLength); } else assert(false); result.data = buf; return result; } // Public function - see documentation comment in header file. bool qrcodegen_encodeSegments(const struct qrcodegen_Segment segs[], size_t len, enum qrcodegen_Ecc ecl, uint8_t tempBuffer[], uint8_t qrcode[]) { return qrcodegen_encodeSegmentsAdvanced(segs, len, ecl, qrcodegen_VERSION_MIN, qrcodegen_VERSION_MAX, -1, true, tempBuffer, qrcode); } // Public function - see documentation comment in header file. bool qrcodegen_encodeSegmentsAdvanced(const struct qrcodegen_Segment segs[], size_t len, enum qrcodegen_Ecc ecl, int minVersion, int maxVersion, int mask, bool boostEcl, uint8_t tempBuffer[], uint8_t qrcode[]) { assert(segs != NULL || len == 0); assert(qrcodegen_VERSION_MIN <= minVersion && minVersion <= maxVersion && maxVersion <= qrcodegen_VERSION_MAX); assert(0 <= (int)ecl && (int)ecl <= 3 && -1 <= (int)mask && (int)mask <= 7); // Find the minimal version number to use int version, dataUsedBits; for (version = minVersion; ; version++) { int dataCapacityBits = getNumDataCodewords(version, ecl) * 8; // Number of data bits available dataUsedBits = getTotalBits(segs, len, version); if (dataUsedBits != -1 && dataUsedBits <= dataCapacityBits) break; // This version number is found to be suitable if (version >= maxVersion) { // All versions in the range could not fit the given data qrcode[0] = 0; // Set size to invalid value for safety return false; } } assert(dataUsedBits != -1); // Increase the error correction level while the data still fits in the current version number for (int i = (int)qrcodegen_Ecc_MEDIUM; i <= (int)qrcodegen_Ecc_HIGH; i++) { if (boostEcl && dataUsedBits <= getNumDataCodewords(version, (enum qrcodegen_Ecc)i) * 8) ecl = (enum qrcodegen_Ecc)i; } // Create the data bit string by concatenating all segments int dataCapacityBits = getNumDataCodewords(version, ecl) * 8; memset(qrcode, 0, qrcodegen_BUFFER_LEN_FOR_VERSION(version) * sizeof(qrcode[0])); int bitLen = 0; for (size_t i = 0; i < len; i++) { const struct qrcodegen_Segment *seg = &segs[i]; unsigned int modeBits = 0; // Dummy value switch (seg->mode) { case qrcodegen_Mode_NUMERIC : modeBits = 0x1; break; case qrcodegen_Mode_ALPHANUMERIC: modeBits = 0x2; break; case qrcodegen_Mode_BYTE : modeBits = 0x4; break; case qrcodegen_Mode_KANJI : modeBits = 0x8; break; case qrcodegen_Mode_ECI : modeBits = 0x7; break; default: assert(false); } appendBitsToBuffer(modeBits, 4, qrcode, &bitLen); appendBitsToBuffer(seg->numChars, numCharCountBits(seg->mode, version), qrcode, &bitLen); for (int j = 0; j < seg->bitLength; j++) appendBitsToBuffer((seg->data[j >> 3] >> (7 - (j & 7))) & 1, 1, qrcode, &bitLen); } // Add terminator and pad up to a byte if applicable int terminatorBits = dataCapacityBits - bitLen; if (terminatorBits > 4) terminatorBits = 4; appendBitsToBuffer(0, terminatorBits, qrcode, &bitLen); appendBitsToBuffer(0, (8 - bitLen % 8) % 8, qrcode, &bitLen); // Pad with alternate bytes until data capacity is reached for (uint8_t padByte = 0xEC; bitLen < dataCapacityBits; padByte ^= 0xEC ^ 0x11) appendBitsToBuffer(padByte, 8, qrcode, &bitLen); assert(bitLen % 8 == 0); // Draw function and data codeword modules appendErrorCorrection(qrcode, version, ecl, tempBuffer); initializeFunctionModules(version, qrcode); drawCodewords(tempBuffer, getNumRawDataModules(version) / 8, qrcode); drawWhiteFunctionModules(qrcode, version); initializeFunctionModules(version, tempBuffer); // Handle masking if (mask == qrcodegen_Mask_AUTO) { // Automatically choose best mask long minPenalty = LONG_MAX; for (int i = 0; i < 8; i++) { drawFormatBits(ecl, (enum qrcodegen_Mask)i, qrcode); applyMask(tempBuffer, qrcode, (enum qrcodegen_Mask)i); long penalty = getPenaltyScore(qrcode); if (penalty < minPenalty) { mask = (enum qrcodegen_Mask)i; minPenalty = penalty; } applyMask(tempBuffer, qrcode, (enum qrcodegen_Mask)i); // Undoes the mask due to XOR } } assert(0 <= (int)mask && (int)mask <= 7); drawFormatBits(ecl, mask, qrcode); applyMask(tempBuffer, qrcode, mask); return true; } // Returns the number of bits needed to encode the given list of segments at the given version. // The result is in the range [0, 32767] if successful. Otherwise, -1 is returned if any segment // has more characters than allowed by that segment's mode's character count field at the version, // or if the actual answer exceeds INT16_MAX. testable int getTotalBits(const struct qrcodegen_Segment segs[], size_t len, int version) { assert(segs != NULL || len == 0); assert(qrcodegen_VERSION_MIN <= version && version <= qrcodegen_VERSION_MAX); int result = 0; for (size_t i = 0; i < len; i++) { int numChars = segs[i].numChars; int bitLength = segs[i].bitLength; assert(0 <= numChars && numChars <= INT16_MAX); assert(0 <= bitLength && bitLength <= INT16_MAX); int ccbits = numCharCountBits(segs[i].mode, version); assert(0 <= ccbits && ccbits <= 16); // Fail if segment length value doesn't fit in the length field's bit-width if (numChars >= (1L << ccbits)) return -1; long temp = 4L + ccbits + bitLength; if (temp > INT16_MAX - result) return -1; result += temp; } assert(0 <= result && result <= INT16_MAX); return result; } // Returns the bit width of the segment character count field for the // given mode at the given version number. The result is in the range [0, 16]. static int numCharCountBits(enum qrcodegen_Mode mode, int version) { assert(qrcodegen_VERSION_MIN <= version && version <= qrcodegen_VERSION_MAX); int i = -1; // Dummy value if ( 1 <= version && version <= 9) i = 0; else if (10 <= version && version <= 26) i = 1; else if (27 <= version && version <= 40) i = 2; else assert(false); switch (mode) { case qrcodegen_Mode_NUMERIC : { static const int temp[] = {10, 12, 14}; return temp[i]; } case qrcodegen_Mode_ALPHANUMERIC: { static const int temp[] = { 9, 11, 13}; return temp[i]; } case qrcodegen_Mode_BYTE : { static const int temp[] = { 8, 16, 16}; return temp[i]; } case qrcodegen_Mode_KANJI : { static const int temp[] = { 8, 10, 12}; return temp[i]; } case qrcodegen_Mode_ECI : return 0; default: assert(false); } return -1; // Dummy value } uTox/third_party/qrcodegen/qrcodegen/c/qrcodegen-worker.c0000600000175000001440000000747714003056224022627 0ustar rakusers/* * QR Code generator test worker (C) * * This program reads data and encoding parameters from standard input and writes * QR Code bitmaps to standard output. The I/O format is one integer per line. * Run with no command line arguments. The program is intended for automated * batch testing of end-to-end functionality of this QR Code generator library. * * Copyright (c) Project Nayuki. (MIT License) * https://www.nayuki.io/page/qr-code-generator-library * * 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. */ #include #include #include #include #include #include #include "qrcodegen.h" #ifndef __cplusplus #define MALLOC(num, type) malloc((num) * sizeof(type)) #else #define MALLOC(num, type) static_cast(malloc((num) * sizeof(type))) #endif int main(void) { while (true) { // Read data length or exit int length; if (scanf("%d", &length) != 1) return EXIT_FAILURE; if (length == -1) break; // Read data bytes bool isAscii = true; uint8_t *data = MALLOC(length, uint8_t); if (data == NULL) { perror("malloc"); return EXIT_FAILURE; } for (int i = 0; i < length; i++) { int b; if (scanf("%d", &b) != 1) return EXIT_FAILURE; data[i] = (uint8_t)b; isAscii &= 0 < b && b < 128; } // Read encoding parameters int errCorLvl, minVersion, maxVersion, mask, boostEcl; if (scanf("%d %d %d %d %d", &errCorLvl, &minVersion, &maxVersion, &mask, &boostEcl) != 5) return EXIT_FAILURE; // Allocate memory for QR Code int bufferLen = qrcodegen_BUFFER_LEN_FOR_VERSION(maxVersion); uint8_t *qrcode = MALLOC(bufferLen, uint8_t); uint8_t *tempBuffer = MALLOC(bufferLen, uint8_t); if (qrcode == NULL || tempBuffer == NULL) { perror("malloc"); return EXIT_FAILURE; } // Try to make QR Code symbol bool ok; if (isAscii) { char *text = MALLOC(length + 1, char); for (int i = 0; i < length; i++) text[i] = (char)data[i]; text[length] = '\0'; ok = qrcodegen_encodeText(text, tempBuffer, qrcode, (enum qrcodegen_Ecc)errCorLvl, minVersion, maxVersion, (enum qrcodegen_Mask)mask, boostEcl == 1); free(text); } else if (length <= bufferLen) { memcpy(tempBuffer, data, length * sizeof(data[0])); ok = qrcodegen_encodeBinary(tempBuffer, (size_t)length, qrcode, (enum qrcodegen_Ecc)errCorLvl, minVersion, maxVersion, (enum qrcodegen_Mask)mask, boostEcl == 1); } else ok = false; free(data); free(tempBuffer); if (ok) { // Print grid of modules int size = qrcodegen_getSize(qrcode); printf("%d\n", (size - 17) / 4); for (int y = 0; y < size; y++) { for (int x = 0; x < size; x++) printf("%d\n", qrcodegen_getModule(qrcode, x, y) ? 1 : 0); } } else printf("-1\n"); free(qrcode); fflush(stdout); } return EXIT_SUCCESS; } uTox/third_party/qrcodegen/qrcodegen/c/qrcodegen-test.c0000600000175000001440000007056114003056224022267 0ustar rakusers/* * QR Code generator test suite (C) * * When compiling this program, the library qrcodegen.c needs QRCODEGEN_TEST * to be defined. Run this command line program with no arguments. * * Copyright (c) Project Nayuki. (MIT License) * https://www.nayuki.io/page/qr-code-generator-library * * 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. */ #include #include #include #include #include #include #include #include #include #include "qrcodegen.h" #define ARRAY_LENGTH(name) (sizeof(name) / sizeof(name[0])) #ifndef __cplusplus #define MALLOC(num, type) malloc((num) * sizeof(type)) #else #define MALLOC(num, type) static_cast(malloc((num) * sizeof(type))) #endif // Global variables static int numTestCases = 0; // Prototypes of private functions under test extern const int8_t ECC_CODEWORDS_PER_BLOCK[4][41]; extern const int8_t NUM_ERROR_CORRECTION_BLOCKS[4][41]; void appendBitsToBuffer(unsigned int val, int numBits, uint8_t buffer[], int *bitLen); void appendErrorCorrection(uint8_t data[], int version, enum qrcodegen_Ecc ecl, uint8_t result[]); int getNumDataCodewords(int version, enum qrcodegen_Ecc ecl); int getNumRawDataModules(int version); void calcReedSolomonGenerator(int degree, uint8_t result[]); void calcReedSolomonRemainder(const uint8_t data[], int dataLen, const uint8_t generator[], int degree, uint8_t result[]); uint8_t finiteFieldMultiply(uint8_t x, uint8_t y); void initializeFunctionModules(int version, uint8_t qrcode[]); int getAlignmentPatternPositions(int version, uint8_t result[7]); bool getModule(const uint8_t qrcode[], int x, int y); void setModule(uint8_t qrcode[], int x, int y, bool isBlack); void setModuleBounded(uint8_t qrcode[], int x, int y, bool isBlack); int calcSegmentBitLength(enum qrcodegen_Mode mode, size_t numChars); int getTotalBits(const struct qrcodegen_Segment segs[], size_t len, int version); /*---- Test cases ----*/ static void testAppendBitsToBuffer(void) { { uint8_t buf[1] = {0}; int bitLen = 0; appendBitsToBuffer(0, 0, buf, &bitLen); assert(bitLen == 0); assert(buf[0] == 0); appendBitsToBuffer(1, 1, buf, &bitLen); assert(bitLen == 1); assert(buf[0] == 0x80); appendBitsToBuffer(0, 1, buf, &bitLen); assert(bitLen == 2); assert(buf[0] == 0x80); appendBitsToBuffer(5, 3, buf, &bitLen); assert(bitLen == 5); assert(buf[0] == 0xA8); appendBitsToBuffer(6, 3, buf, &bitLen); assert(bitLen == 8); assert(buf[0] == 0xAE); numTestCases++; } { uint8_t buf[6] = {0}; int bitLen = 0; appendBitsToBuffer(16942, 16, buf, &bitLen); assert(bitLen == 16); assert(buf[0] == 0x42 && buf[1] == 0x2E && buf[2] == 0x00 && buf[3] == 0x00 && buf[4] == 0x00 && buf[5] == 0x00); appendBitsToBuffer(10, 7, buf, &bitLen); assert(bitLen == 23); assert(buf[0] == 0x42 && buf[1] == 0x2E && buf[2] == 0x14 && buf[3] == 0x00 && buf[4] == 0x00 && buf[5] == 0x00); appendBitsToBuffer(15, 4, buf, &bitLen); assert(bitLen == 27); assert(buf[0] == 0x42 && buf[1] == 0x2E && buf[2] == 0x15 && buf[3] == 0xE0 && buf[4] == 0x00 && buf[5] == 0x00); appendBitsToBuffer(26664, 15, buf, &bitLen); assert(bitLen == 42); assert(buf[0] == 0x42 && buf[1] == 0x2E && buf[2] == 0x15 && buf[3] == 0xFA && buf[4] == 0x0A && buf[5] == 0x00); numTestCases++; } } // Ported from the Java version of the code. static uint8_t *appendErrorCorrectionReference(const uint8_t *data, int version, enum qrcodegen_Ecc ecl) { // Calculate parameter numbers int numBlocks = NUM_ERROR_CORRECTION_BLOCKS[(int)ecl][version]; int blockEccLen = ECC_CODEWORDS_PER_BLOCK[(int)ecl][version]; int rawCodewords = getNumRawDataModules(version) / 8; int numShortBlocks = numBlocks - rawCodewords % numBlocks; int shortBlockLen = rawCodewords / numBlocks; // Split data into blocks and append ECC to each block uint8_t **blocks = MALLOC(numBlocks, uint8_t*); uint8_t *generator = MALLOC(blockEccLen, uint8_t); calcReedSolomonGenerator(blockEccLen, generator); for (int i = 0, k = 0; i < numBlocks; i++) { uint8_t *block = MALLOC(shortBlockLen + 1, uint8_t); int blockDataLen = shortBlockLen - blockEccLen + (i < numShortBlocks ? 0 : 1); memcpy(block, &data[k], blockDataLen * sizeof(uint8_t)); calcReedSolomonRemainder(&data[k], blockDataLen, generator, blockEccLen, &block[shortBlockLen + 1 - blockEccLen]); k += blockDataLen; blocks[i] = block; } free(generator); // Interleave (not concatenate) the bytes from every block into a single sequence uint8_t *result = MALLOC(rawCodewords, uint8_t); for (int i = 0, k = 0; i < shortBlockLen + 1; i++) { for (int j = 0; j < numBlocks; j++) { // Skip the padding byte in short blocks if (i != shortBlockLen - blockEccLen || j >= numShortBlocks) { result[k] = blocks[j][i]; k++; } } } for (int i = 0; i < numBlocks; i++) free(blocks[i]); free(blocks); return result; } static void testAppendErrorCorrection(void) { for (int version = 1; version <= 40; version++) { for (int ecl = 0; ecl < 4; ecl++) { int dataLen = getNumDataCodewords(version, (enum qrcodegen_Ecc)ecl); uint8_t *pureData = MALLOC(dataLen, uint8_t); for (int i = 0; i < dataLen; i++) pureData[i] = rand() % 256; uint8_t *expectOutput = appendErrorCorrectionReference(pureData, version, (enum qrcodegen_Ecc)ecl); int dataAndEccLen = getNumRawDataModules(version) / 8; uint8_t *paddedData = MALLOC(dataAndEccLen, uint8_t); memcpy(paddedData, pureData, dataLen * sizeof(uint8_t)); uint8_t *actualOutput = MALLOC(dataAndEccLen, uint8_t); appendErrorCorrection(paddedData, version, (enum qrcodegen_Ecc)ecl, actualOutput); assert(memcmp(actualOutput, expectOutput, dataAndEccLen * sizeof(uint8_t)) == 0); free(pureData); free(expectOutput); free(paddedData); free(actualOutput); numTestCases++; } } } static void testGetNumDataCodewords(void) { const int cases[][3] = { { 3, 1, 44}, { 3, 2, 34}, { 3, 3, 26}, { 6, 0, 136}, { 7, 0, 156}, { 9, 0, 232}, { 9, 1, 182}, {12, 3, 158}, {15, 0, 523}, {16, 2, 325}, {19, 3, 341}, {21, 0, 932}, {22, 0, 1006}, {22, 1, 782}, {22, 3, 442}, {24, 0, 1174}, {24, 3, 514}, {28, 0, 1531}, {30, 3, 745}, {32, 3, 845}, {33, 0, 2071}, {33, 3, 901}, {35, 0, 2306}, {35, 1, 1812}, {35, 2, 1286}, {36, 3, 1054}, {37, 3, 1096}, {39, 1, 2216}, {40, 1, 2334}, }; for (size_t i = 0; i < ARRAY_LENGTH(cases); i++) { const int *tc = cases[i]; assert(getNumDataCodewords(tc[0], (enum qrcodegen_Ecc)tc[1]) == tc[2]); numTestCases++; } } static void testGetNumRawDataModules(void) { const int cases[][2] = { { 1, 208}, { 2, 359}, { 3, 567}, { 6, 1383}, { 7, 1568}, {12, 3728}, {15, 5243}, {18, 7211}, {22, 10068}, {26, 13652}, {32, 19723}, {37, 25568}, {40, 29648}, }; for (size_t i = 0; i < ARRAY_LENGTH(cases); i++) { const int *tc = cases[i]; assert(getNumRawDataModules(tc[0]) == tc[1]); numTestCases++; } } static void testCalcReedSolomonGenerator(void) { uint8_t generator[30]; calcReedSolomonGenerator(1, generator); assert(generator[0] == 0x01); numTestCases++; calcReedSolomonGenerator(2, generator); assert(generator[0] == 0x03); assert(generator[1] == 0x02); numTestCases++; calcReedSolomonGenerator(5, generator); assert(generator[0] == 0x1F); assert(generator[1] == 0xC6); assert(generator[2] == 0x3F); assert(generator[3] == 0x93); assert(generator[4] == 0x74); numTestCases++; calcReedSolomonGenerator(30, generator); assert(generator[ 0] == 0xD4); assert(generator[ 1] == 0xF6); assert(generator[ 5] == 0xC0); assert(generator[12] == 0x16); assert(generator[13] == 0xD9); assert(generator[20] == 0x12); assert(generator[27] == 0x6A); assert(generator[29] == 0x96); numTestCases++; } static void testCalcReedSolomonRemainder(void) { { uint8_t data[1]; uint8_t generator[3]; uint8_t remainder[ARRAY_LENGTH(generator)]; calcReedSolomonGenerator(ARRAY_LENGTH(generator), generator); calcReedSolomonRemainder(data, 0, generator, ARRAY_LENGTH(generator), remainder); assert(remainder[0] == 0); assert(remainder[1] == 0); assert(remainder[2] == 0); numTestCases++; } { uint8_t data[2] = {0, 1}; uint8_t generator[4]; uint8_t remainder[ARRAY_LENGTH(generator)]; calcReedSolomonGenerator(ARRAY_LENGTH(generator), generator); calcReedSolomonRemainder(data, ARRAY_LENGTH(data), generator, ARRAY_LENGTH(generator), remainder); assert(remainder[0] == generator[0]); assert(remainder[1] == generator[1]); assert(remainder[2] == generator[2]); assert(remainder[3] == generator[3]); numTestCases++; } { uint8_t data[5] = {0x03, 0x3A, 0x60, 0x12, 0xC7}; uint8_t generator[5]; uint8_t remainder[ARRAY_LENGTH(generator)]; calcReedSolomonGenerator(ARRAY_LENGTH(generator), generator); calcReedSolomonRemainder(data, ARRAY_LENGTH(data), generator, ARRAY_LENGTH(generator), remainder); assert(remainder[0] == 0xCB); assert(remainder[1] == 0x36); assert(remainder[2] == 0x16); assert(remainder[3] == 0xFA); assert(remainder[4] == 0x9D); numTestCases++; } { uint8_t data[43] = { 0x38, 0x71, 0xDB, 0xF9, 0xD7, 0x28, 0xF6, 0x8E, 0xFE, 0x5E, 0xE6, 0x7D, 0x7D, 0xB2, 0xA5, 0x58, 0xBC, 0x28, 0x23, 0x53, 0x14, 0xD5, 0x61, 0xC0, 0x20, 0x6C, 0xDE, 0xDE, 0xFC, 0x79, 0xB0, 0x8B, 0x78, 0x6B, 0x49, 0xD0, 0x1A, 0xAD, 0xF3, 0xEF, 0x52, 0x7D, 0x9A, }; uint8_t generator[30]; uint8_t remainder[ARRAY_LENGTH(generator)]; calcReedSolomonGenerator(ARRAY_LENGTH(generator), generator); calcReedSolomonRemainder(data, ARRAY_LENGTH(data), generator, ARRAY_LENGTH(generator), remainder); assert(remainder[ 0] == 0xCE); assert(remainder[ 1] == 0xF0); assert(remainder[ 2] == 0x31); assert(remainder[ 3] == 0xDE); assert(remainder[ 8] == 0xE1); assert(remainder[12] == 0xCA); assert(remainder[17] == 0xE3); assert(remainder[19] == 0x85); assert(remainder[20] == 0x50); assert(remainder[24] == 0xBE); assert(remainder[29] == 0xB3); numTestCases++; } } static void testFiniteFieldMultiply(void) { const uint8_t cases[][3] = { {0x00, 0x00, 0x00}, {0x01, 0x01, 0x01}, {0x02, 0x02, 0x04}, {0x00, 0x6E, 0x00}, {0xB2, 0xDD, 0xE6}, {0x41, 0x11, 0x25}, {0xB0, 0x1F, 0x11}, {0x05, 0x75, 0xBC}, {0x52, 0xB5, 0xAE}, {0xA8, 0x20, 0xA4}, {0x0E, 0x44, 0x9F}, {0xD4, 0x13, 0xA0}, {0x31, 0x10, 0x37}, {0x6C, 0x58, 0xCB}, {0xB6, 0x75, 0x3E}, {0xFF, 0xFF, 0xE2}, }; for (size_t i = 0; i < ARRAY_LENGTH(cases); i++) { const uint8_t *tc = cases[i]; assert(finiteFieldMultiply(tc[0], tc[1]) == tc[2]); numTestCases++; } } static void testInitializeFunctionModulesEtc(void) { for (int ver = 1; ver <= 40; ver++) { uint8_t *qrcode = MALLOC(qrcodegen_BUFFER_LEN_FOR_VERSION(ver), uint8_t); assert(qrcode != NULL); initializeFunctionModules(ver, qrcode); int size = qrcodegen_getSize(qrcode); if (ver == 1) assert(size == 21); else if (ver == 40) assert(size == 177); else assert(size == ver * 4 + 17); bool hasWhite = false; bool hasBlack = false; for (int y = 0; y < size; y++) { for (int x = 0; x < size; x++) { bool color = qrcodegen_getModule(qrcode, x, y); if (color) hasBlack = true; else hasWhite = true; } } assert(hasWhite && hasBlack); free(qrcode); numTestCases++; } } static void testGetAlignmentPatternPositions(void) { const int cases[][9] = { { 1, 0, -1, -1, -1, -1, -1, -1, -1}, { 2, 2, 6, 18, -1, -1, -1, -1, -1}, { 3, 2, 6, 22, -1, -1, -1, -1, -1}, { 6, 2, 6, 34, -1, -1, -1, -1, -1}, { 7, 3, 6, 22, 38, -1, -1, -1, -1}, { 8, 3, 6, 24, 42, -1, -1, -1, -1}, {16, 4, 6, 26, 50, 74, -1, -1, -1}, {25, 5, 6, 32, 58, 84, 110, -1, -1}, {32, 6, 6, 34, 60, 86, 112, 138, -1}, {33, 6, 6, 30, 58, 86, 114, 142, -1}, {39, 7, 6, 26, 54, 82, 110, 138, 166}, {40, 7, 6, 30, 58, 86, 114, 142, 170}, }; for (size_t i = 0; i < ARRAY_LENGTH(cases); i++) { const int *tc = cases[i]; uint8_t pos[7]; int num = getAlignmentPatternPositions(tc[0], pos); assert(num == tc[1]); for (int j = 0; j < num; j++) assert(pos[j] == tc[2 + j]); numTestCases++; } } static void testGetSetModule(void) { uint8_t qrcode[qrcodegen_BUFFER_LEN_FOR_VERSION(23)]; initializeFunctionModules(23, qrcode); int size = qrcodegen_getSize(qrcode); for (int y = 0; y < size; y++) { // Clear all to white for (int x = 0; x < size; x++) setModule(qrcode, x, y, false); } for (int y = 0; y < size; y++) { // Check all white for (int x = 0; x < size; x++) assert(qrcodegen_getModule(qrcode, x, y) == false); } for (int y = 0; y < size; y++) { // Set all to black for (int x = 0; x < size; x++) setModule(qrcode, x, y, true); } for (int y = 0; y < size; y++) { // Check all black for (int x = 0; x < size; x++) assert(qrcodegen_getModule(qrcode, x, y) == true); } // Set some out of bounds modules to white setModuleBounded(qrcode, -1, -1, false); setModuleBounded(qrcode, -1, 0, false); setModuleBounded(qrcode, 0, -1, false); setModuleBounded(qrcode, size, 5, false); setModuleBounded(qrcode, 72, size, false); setModuleBounded(qrcode, size, size, false); for (int y = 0; y < size; y++) { // Check all black for (int x = 0; x < size; x++) assert(qrcodegen_getModule(qrcode, x, y) == true); } // Set some modules to white setModule(qrcode, 3, 8, false); setModule(qrcode, 61, 49, false); for (int y = 0; y < size; y++) { // Check most black for (int x = 0; x < size; x++) { bool white = (x == 3 && y == 8) || (x == 61 && y == 49); assert(qrcodegen_getModule(qrcode, x, y) != white); } } numTestCases++; } static void testGetSetModuleRandomly(void) { uint8_t qrcode[qrcodegen_BUFFER_LEN_FOR_VERSION(1)]; initializeFunctionModules(1, qrcode); int size = qrcodegen_getSize(qrcode); bool modules[21][21]; for (int y = 0; y < size; y++) { for (int x = 0; x < size; x++) modules[y][x] = qrcodegen_getModule(qrcode, x, y); } long trials = 100000; for (long i = 0; i < trials; i++) { int x = rand() % (size * 2) - size / 2; int y = rand() % (size * 2) - size / 2; bool isInBounds = 0 <= x && x < size && 0 <= y && y < size; bool oldColor = isInBounds && modules[y][x]; if (isInBounds) assert(getModule(qrcode, x, y) == oldColor); assert(qrcodegen_getModule(qrcode, x, y) == oldColor); bool newColor = rand() % 2 == 0; if (isInBounds) modules[y][x] = newColor; if (isInBounds && rand() % 2 == 0) setModule(qrcode, x, y, newColor); else setModuleBounded(qrcode, x, y, newColor); } numTestCases++; } static void testIsAlphanumeric(void) { struct TestCase { bool answer; const char *text; }; const struct TestCase cases[] = { {true, ""}, {true, "0"}, {true, "A"}, {false, "a"}, {true, " "}, {true, "."}, {true, "*"}, {false, ","}, {false, "|"}, {false, "@"}, {true, "XYZ"}, {false, "XYZ!"}, {true, "79068"}, {true, "+123 ABC$"}, {false, "\x01"}, {false, "\x7F"}, {false, "\x80"}, {false, "\xC0"}, {false, "\xFF"}, }; for (size_t i = 0; i < ARRAY_LENGTH(cases); i++) { assert(qrcodegen_isAlphanumeric(cases[i].text) == cases[i].answer); numTestCases++; } } static void testIsNumeric(void) { struct TestCase { bool answer; const char *text; }; const struct TestCase cases[] = { {true, ""}, {true, "0"}, {false, "A"}, {false, "a"}, {false, " "}, {false, "."}, {false, "*"}, {false, ","}, {false, "|"}, {false, "@"}, {false, "XYZ"}, {false, "XYZ!"}, {true, "79068"}, {false, "+123 ABC$"}, {false, "\x01"}, {false, "\x7F"}, {false, "\x80"}, {false, "\xC0"}, {false, "\xFF"}, }; for (size_t i = 0; i < ARRAY_LENGTH(cases); i++) { assert(qrcodegen_isNumeric(cases[i].text) == cases[i].answer); numTestCases++; } } static void testCalcSegmentBufferSize(void) { { const size_t cases[][2] = { {0, 0}, {1, 1}, {2, 1}, {3, 2}, {4, 2}, {5, 3}, {6, 3}, {1472, 614}, {2097, 874}, {5326, 2220}, {9828, 4095}, {9829, 4096}, {9830, 4096}, {9831, SIZE_MAX}, {9832, SIZE_MAX}, {12000, SIZE_MAX}, {28453, SIZE_MAX}, {55555, SIZE_MAX}, {SIZE_MAX / 6, SIZE_MAX}, {SIZE_MAX / 4, SIZE_MAX}, {SIZE_MAX / 2, SIZE_MAX}, {SIZE_MAX / 1, SIZE_MAX}, }; for (size_t i = 0; i < ARRAY_LENGTH(cases); i++) { assert(qrcodegen_calcSegmentBufferSize(qrcodegen_Mode_NUMERIC, cases[i][0]) == cases[i][1]); numTestCases++; } } { const size_t cases[][2] = { {0, 0}, {1, 1}, {2, 2}, {3, 3}, {4, 3}, {5, 4}, {6, 5}, {1472, 1012}, {2097, 1442}, {5326, 3662}, {5955, 4095}, {5956, 4095}, {5957, 4096}, {5958, SIZE_MAX}, {5959, SIZE_MAX}, {12000, SIZE_MAX}, {28453, SIZE_MAX}, {55555, SIZE_MAX}, {SIZE_MAX / 10, SIZE_MAX}, {SIZE_MAX / 8, SIZE_MAX}, {SIZE_MAX / 5, SIZE_MAX}, {SIZE_MAX / 2, SIZE_MAX}, {SIZE_MAX / 1, SIZE_MAX}, }; for (size_t i = 0; i < ARRAY_LENGTH(cases); i++) { assert(qrcodegen_calcSegmentBufferSize(qrcodegen_Mode_ALPHANUMERIC, cases[i][0]) == cases[i][1]); numTestCases++; } } { const size_t cases[][2] = { {0, 0}, {1, 1}, {2, 2}, {3, 3}, {1472, 1472}, {2097, 2097}, {4094, 4094}, {4095, 4095}, {4096, SIZE_MAX}, {4097, SIZE_MAX}, {5957, SIZE_MAX}, {12000, SIZE_MAX}, {28453, SIZE_MAX}, {55555, SIZE_MAX}, {SIZE_MAX / 16 + 1, SIZE_MAX}, {SIZE_MAX / 14, SIZE_MAX}, {SIZE_MAX / 9, SIZE_MAX}, {SIZE_MAX / 7, SIZE_MAX}, {SIZE_MAX / 4, SIZE_MAX}, {SIZE_MAX / 3, SIZE_MAX}, {SIZE_MAX / 2, SIZE_MAX}, {SIZE_MAX / 1, SIZE_MAX}, }; for (size_t i = 0; i < ARRAY_LENGTH(cases); i++) { assert(qrcodegen_calcSegmentBufferSize(qrcodegen_Mode_BYTE, cases[i][0]) == cases[i][1]); numTestCases++; } } { const size_t cases[][2] = { {0, 0}, {1, 2}, {2, 4}, {3, 5}, {1472, 2392}, {2097, 3408}, {2519, 4094}, {2520, 4095}, {2521, SIZE_MAX}, {5957, SIZE_MAX}, {2522, SIZE_MAX}, {12000, SIZE_MAX}, {28453, SIZE_MAX}, {55555, SIZE_MAX}, {SIZE_MAX / 13 + 1, SIZE_MAX}, {SIZE_MAX / 12, SIZE_MAX}, {SIZE_MAX / 9, SIZE_MAX}, {SIZE_MAX / 4, SIZE_MAX}, {SIZE_MAX / 3, SIZE_MAX}, {SIZE_MAX / 2, SIZE_MAX}, {SIZE_MAX / 1, SIZE_MAX}, }; for (size_t i = 0; i < ARRAY_LENGTH(cases); i++) { assert(qrcodegen_calcSegmentBufferSize(qrcodegen_Mode_KANJI, cases[i][0]) == cases[i][1]); numTestCases++; } } { assert(qrcodegen_calcSegmentBufferSize(qrcodegen_Mode_ECI, 0) == 3); numTestCases++; } } static void testCalcSegmentBitLength(void) { { const int cases[][2] = { {0, 0}, {1, 4}, {2, 7}, {3, 10}, {4, 14}, {5, 17}, {6, 20}, {1472, 4907}, {2097, 6990}, {5326, 17754}, {9828, 32760}, {9829, 32764}, {9830, 32767}, {9831, -1}, {9832, -1}, {12000, -1}, {28453, -1}, {INT_MAX / 3, -1}, {INT_MAX / 2, -1}, {INT_MAX / 1, -1}, }; for (size_t i = 0; i < ARRAY_LENGTH(cases); i++) { assert(calcSegmentBitLength(qrcodegen_Mode_NUMERIC, cases[i][0]) == cases[i][1]); numTestCases++; } } { const int cases[][2] = { {0, 0}, {1, 6}, {2, 11}, {3, 17}, {4, 22}, {5, 28}, {6, 33}, {1472, 8096}, {2097, 11534}, {5326, 29293}, {5955, 32753}, {5956, 32758}, {5957, 32764}, {5958, -1}, {5959, -1}, {12000, -1}, {28453, -1}, {INT_MAX / 5, -1}, {INT_MAX / 4, -1}, {INT_MAX / 3, -1}, {INT_MAX / 2, -1}, {INT_MAX / 1, -1}, }; for (size_t i = 0; i < ARRAY_LENGTH(cases); i++) { assert(calcSegmentBitLength(qrcodegen_Mode_ALPHANUMERIC, cases[i][0]) == cases[i][1]); numTestCases++; } } { const int cases[][2] = { {0, 0}, {1, 8}, {2, 16}, {3, 24}, {1472, 11776}, {2097, 16776}, {4094, 32752}, {4095, 32760}, {4096, -1}, {4097, -1}, {5957, -1}, {12000, -1}, {28453, -1}, {INT_MAX / 8 + 1, -1}, {INT_MAX / 7, -1}, {INT_MAX / 6, -1}, {INT_MAX / 5, -1}, {INT_MAX / 4, -1}, {INT_MAX / 3, -1}, {INT_MAX / 2, -1}, {INT_MAX / 1, -1}, }; for (size_t i = 0; i < ARRAY_LENGTH(cases); i++) { assert(calcSegmentBitLength(qrcodegen_Mode_BYTE, cases[i][0]) == cases[i][1]); numTestCases++; } } { const int cases[][2] = { {0, 0}, {1, 13}, {2, 26}, {3, 39}, {1472, 19136}, {2097, 27261}, {2519, 32747}, {2520, 32760}, {2521, -1}, {5957, -1}, {2522, -1}, {12000, -1}, {28453, -1}, {INT_MAX / 13 + 1, -1}, {INT_MAX / 12, -1}, {INT_MAX / 9, -1}, {INT_MAX / 4, -1}, {INT_MAX / 3, -1}, {INT_MAX / 2, -1}, {INT_MAX / 1, -1}, }; for (size_t i = 0; i < ARRAY_LENGTH(cases); i++) { assert(calcSegmentBitLength(qrcodegen_Mode_KANJI, cases[i][0]) == cases[i][1]); numTestCases++; } } { assert(calcSegmentBitLength(qrcodegen_Mode_ECI, 0) == 24); numTestCases++; } } static void testMakeBytes(void) { { struct qrcodegen_Segment seg = qrcodegen_makeBytes(NULL, 0, NULL); assert(seg.mode == qrcodegen_Mode_BYTE); assert(seg.numChars == 0); assert(seg.bitLength == 0); numTestCases++; } { const uint8_t data[] = {0x00}; uint8_t buf[1]; struct qrcodegen_Segment seg = qrcodegen_makeBytes(data, 1, buf); assert(seg.numChars == 1); assert(seg.bitLength == 8); assert(seg.data[0] == 0x00); numTestCases++; } { const uint8_t data[] = {0xEF, 0xBB, 0xBF}; uint8_t buf[3]; struct qrcodegen_Segment seg = qrcodegen_makeBytes(data, 3, buf); assert(seg.numChars == 3); assert(seg.bitLength == 24); assert(seg.data[0] == 0xEF); assert(seg.data[1] == 0xBB); assert(seg.data[2] == 0xBF); numTestCases++; } } static void testMakeNumeric(void) { { struct qrcodegen_Segment seg = qrcodegen_makeNumeric("", NULL); assert(seg.mode == qrcodegen_Mode_NUMERIC); assert(seg.numChars == 0); assert(seg.bitLength == 0); numTestCases++; } { uint8_t buf[1]; struct qrcodegen_Segment seg = qrcodegen_makeNumeric("9", buf); assert(seg.numChars == 1); assert(seg.bitLength == 4); assert(seg.data[0] == 0x90); numTestCases++; } { uint8_t buf[1]; struct qrcodegen_Segment seg = qrcodegen_makeNumeric("81", buf); assert(seg.numChars == 2); assert(seg.bitLength == 7); assert(seg.data[0] == 0xA2); numTestCases++; } { uint8_t buf[2]; struct qrcodegen_Segment seg = qrcodegen_makeNumeric("673", buf); assert(seg.numChars == 3); assert(seg.bitLength == 10); assert(seg.data[0] == 0xA8); assert(seg.data[1] == 0x40); numTestCases++; } { uint8_t buf[5]; struct qrcodegen_Segment seg = qrcodegen_makeNumeric("3141592653", buf); assert(seg.numChars == 10); assert(seg.bitLength == 34); assert(seg.data[0] == 0x4E); assert(seg.data[1] == 0x89); assert(seg.data[2] == 0xF4); assert(seg.data[3] == 0x24); assert(seg.data[4] == 0xC0); numTestCases++; } } static void testMakeAlphanumeric(void) { { struct qrcodegen_Segment seg = qrcodegen_makeAlphanumeric("", NULL); assert(seg.mode == qrcodegen_Mode_ALPHANUMERIC); assert(seg.numChars == 0); assert(seg.bitLength == 0); numTestCases++; } { uint8_t buf[1]; struct qrcodegen_Segment seg = qrcodegen_makeAlphanumeric("A", buf); assert(seg.numChars == 1); assert(seg.bitLength == 6); assert(seg.data[0] == 0x28); numTestCases++; } { uint8_t buf[2]; struct qrcodegen_Segment seg = qrcodegen_makeAlphanumeric("%:", buf); assert(seg.numChars == 2); assert(seg.bitLength == 11); assert(seg.data[0] == 0xDB); assert(seg.data[1] == 0x40); numTestCases++; } { uint8_t buf[3]; struct qrcodegen_Segment seg = qrcodegen_makeAlphanumeric("Q R", buf); assert(seg.numChars == 3); assert(seg.bitLength == 17); assert(seg.data[0] == 0x96); assert(seg.data[1] == 0xCD); assert(seg.data[2] == 0x80); numTestCases++; } } static void testMakeEci(void) { { uint8_t buf[1]; struct qrcodegen_Segment seg = qrcodegen_makeEci(127, buf); assert(seg.mode == qrcodegen_Mode_ECI); assert(seg.numChars == 0); assert(seg.bitLength == 8); assert(seg.data[0] == 0x7F); numTestCases++; } { uint8_t buf[2]; struct qrcodegen_Segment seg = qrcodegen_makeEci(10345, buf); assert(seg.numChars == 0); assert(seg.bitLength == 16); assert(seg.data[0] == 0xA8); assert(seg.data[1] == 0x69); numTestCases++; } { uint8_t buf[3]; struct qrcodegen_Segment seg = qrcodegen_makeEci(999999, buf); assert(seg.numChars == 0); assert(seg.bitLength == 24); assert(seg.data[0] == 0xCF); assert(seg.data[1] == 0x42); assert(seg.data[2] == 0x3F); numTestCases++; } } static void testGetTotalBits(void) { { assert(getTotalBits(NULL, 0, 1) == 0); numTestCases++; assert(getTotalBits(NULL, 0, 40) == 0); numTestCases++; } { struct qrcodegen_Segment segs[] = { {qrcodegen_Mode_BYTE, 3, NULL, 24}, }; assert(getTotalBits(segs, ARRAY_LENGTH(segs), 2) == 36); numTestCases++; assert(getTotalBits(segs, ARRAY_LENGTH(segs), 10) == 44); numTestCases++; assert(getTotalBits(segs, ARRAY_LENGTH(segs), 39) == 44); numTestCases++; } { struct qrcodegen_Segment segs[] = { {qrcodegen_Mode_ECI, 0, NULL, 8}, {qrcodegen_Mode_NUMERIC, 7, NULL, 24}, {qrcodegen_Mode_ALPHANUMERIC, 1, NULL, 6}, {qrcodegen_Mode_KANJI, 4, NULL, 52}, }; assert(getTotalBits(segs, ARRAY_LENGTH(segs), 9) == 133); numTestCases++; assert(getTotalBits(segs, ARRAY_LENGTH(segs), 21) == 139); numTestCases++; assert(getTotalBits(segs, ARRAY_LENGTH(segs), 27) == 145); numTestCases++; } { struct qrcodegen_Segment segs[] = { {qrcodegen_Mode_BYTE, 4093, NULL, 32744}, }; assert(getTotalBits(segs, ARRAY_LENGTH(segs), 1) == -1); numTestCases++; assert(getTotalBits(segs, ARRAY_LENGTH(segs), 10) == 32764); numTestCases++; assert(getTotalBits(segs, ARRAY_LENGTH(segs), 27) == 32764); numTestCases++; } { struct qrcodegen_Segment segs[] = { {qrcodegen_Mode_NUMERIC, 2047, NULL, 6824}, {qrcodegen_Mode_NUMERIC, 2047, NULL, 6824}, {qrcodegen_Mode_NUMERIC, 2047, NULL, 6824}, {qrcodegen_Mode_NUMERIC, 2047, NULL, 6824}, {qrcodegen_Mode_NUMERIC, 1617, NULL, 5390}, }; assert(getTotalBits(segs, ARRAY_LENGTH(segs), 1) == -1); numTestCases++; assert(getTotalBits(segs, ARRAY_LENGTH(segs), 10) == 32766); numTestCases++; assert(getTotalBits(segs, ARRAY_LENGTH(segs), 27) == -1); numTestCases++; } { struct qrcodegen_Segment segs[] = { {qrcodegen_Mode_KANJI, 255, NULL, 3315}, {qrcodegen_Mode_KANJI, 255, NULL, 3315}, {qrcodegen_Mode_KANJI, 255, NULL, 3315}, {qrcodegen_Mode_KANJI, 255, NULL, 3315}, {qrcodegen_Mode_KANJI, 255, NULL, 3315}, {qrcodegen_Mode_KANJI, 255, NULL, 3315}, {qrcodegen_Mode_KANJI, 255, NULL, 3315}, {qrcodegen_Mode_KANJI, 255, NULL, 3315}, {qrcodegen_Mode_KANJI, 255, NULL, 3315}, {qrcodegen_Mode_ALPHANUMERIC, 511, NULL, 2811}, }; assert(getTotalBits(segs, ARRAY_LENGTH(segs), 9) == 32767); numTestCases++; assert(getTotalBits(segs, ARRAY_LENGTH(segs), 26) == -1); numTestCases++; assert(getTotalBits(segs, ARRAY_LENGTH(segs), 40) == -1); numTestCases++; } } /*---- Main runner ----*/ int main(void) { srand(time(NULL)); testAppendBitsToBuffer(); testAppendErrorCorrection(); testGetNumDataCodewords(); testGetNumRawDataModules(); testCalcReedSolomonGenerator(); testCalcReedSolomonRemainder(); testFiniteFieldMultiply(); testInitializeFunctionModulesEtc(); testGetAlignmentPatternPositions(); testGetSetModule(); testGetSetModuleRandomly(); testIsAlphanumeric(); testIsNumeric(); testCalcSegmentBufferSize(); testCalcSegmentBitLength(); testMakeBytes(); testMakeNumeric(); testMakeAlphanumeric(); testMakeEci(); testGetTotalBits(); printf("All %d test cases passed\n", numTestCases); return EXIT_SUCCESS; } uTox/third_party/qrcodegen/qrcodegen/c/qrcodegen-demo.c0000600000175000001440000002762514003056224022237 0ustar rakusers/* * QR Code generator demo (C) * * Run this command-line program with no arguments. The program * computes a demonstration QR Codes and print it to the console. * * Copyright (c) Project Nayuki. (MIT License) * https://www.nayuki.io/page/qr-code-generator-library * * 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. */ #include #include #include #include #include #include "qrcodegen.h" // Function prototypes static void doBasicDemo(void); static void doVarietyDemo(void); static void doSegmentDemo(void); static void doMaskDemo(void); static void printQr(const uint8_t qrcode[]); // The main application program. int main(void) { doBasicDemo(); doVarietyDemo(); doSegmentDemo(); doMaskDemo(); return EXIT_SUCCESS; } /*---- Demo suite ----*/ // Creates a single QR Code, then prints it to the console. static void doBasicDemo(void) { const char *text = "Hello, world!"; // User-supplied text enum qrcodegen_Ecc errCorLvl = qrcodegen_Ecc_LOW; // Error correction level // Make and print the QR Code symbol uint8_t qrcode[qrcodegen_BUFFER_LEN_MAX]; uint8_t tempBuffer[qrcodegen_BUFFER_LEN_MAX]; bool ok = qrcodegen_encodeText(text, tempBuffer, qrcode, errCorLvl, qrcodegen_VERSION_MIN, qrcodegen_VERSION_MAX, qrcodegen_Mask_AUTO, true); if (ok) printQr(qrcode); } // Creates a variety of QR Codes that exercise different features of the library, and prints each one to the console. static void doVarietyDemo(void) { { // Numeric mode encoding (3.33 bits per digit) uint8_t qrcode[qrcodegen_BUFFER_LEN_MAX]; uint8_t tempBuffer[qrcodegen_BUFFER_LEN_MAX]; bool ok = qrcodegen_encodeText("314159265358979323846264338327950288419716939937510", tempBuffer, qrcode, qrcodegen_Ecc_MEDIUM, qrcodegen_VERSION_MIN, qrcodegen_VERSION_MAX, qrcodegen_Mask_AUTO, true); if (ok) printQr(qrcode); } { // Alphanumeric mode encoding (5.5 bits per character) uint8_t qrcode[qrcodegen_BUFFER_LEN_MAX]; uint8_t tempBuffer[qrcodegen_BUFFER_LEN_MAX]; bool ok = qrcodegen_encodeText("DOLLAR-AMOUNT:$39.87 PERCENTAGE:100.00% OPERATIONS:+-*/", tempBuffer, qrcode, qrcodegen_Ecc_HIGH, qrcodegen_VERSION_MIN, qrcodegen_VERSION_MAX, qrcodegen_Mask_AUTO, true); if (ok) printQr(qrcode); } { // Unicode text as UTF-8 const char *text = "\xE3\x81\x93\xE3\x82\x93\xE3\x81\xAB\xE3\x81\xA1wa\xE3\x80\x81\xE4\xB8\x96\xE7\x95\x8C\xEF\xBC\x81\x20\xCE\xB1\xCE\xB2\xCE\xB3\xCE\xB4"; uint8_t qrcode[qrcodegen_BUFFER_LEN_MAX]; uint8_t tempBuffer[qrcodegen_BUFFER_LEN_MAX]; bool ok = qrcodegen_encodeText(text, tempBuffer, qrcode, qrcodegen_Ecc_QUARTILE, qrcodegen_VERSION_MIN, qrcodegen_VERSION_MAX, qrcodegen_Mask_AUTO, true); if (ok) printQr(qrcode); } { // Moderately large QR Code using longer text (from Lewis Carroll's Alice in Wonderland) const char *text = "Alice was beginning to get very tired of sitting by her sister on the bank, " "and of having nothing to do: once or twice she had peeped into the book her sister was reading, " "but it had no pictures or conversations in it, 'and what is the use of a book,' thought Alice " "'without pictures or conversations?' So she was considering in her own mind (as well as she could, " "for the hot day made her feel very sleepy and stupid), whether the pleasure of making a " "daisy-chain would be worth the trouble of getting up and picking the daisies, when suddenly " "a White Rabbit with pink eyes ran close by her."; uint8_t qrcode[qrcodegen_BUFFER_LEN_MAX]; uint8_t tempBuffer[qrcodegen_BUFFER_LEN_MAX]; bool ok = qrcodegen_encodeText(text, tempBuffer, qrcode, qrcodegen_Ecc_HIGH, qrcodegen_VERSION_MIN, qrcodegen_VERSION_MAX, qrcodegen_Mask_AUTO, true); if (ok) printQr(qrcode); } } // Creates QR Codes with manually specified segments for better compactness. static void doSegmentDemo(void) { { // Illustration "silver" const char *silver0 = "THE SQUARE ROOT OF 2 IS 1."; const char *silver1 = "41421356237309504880168872420969807856967187537694807317667973799"; uint8_t qrcode[qrcodegen_BUFFER_LEN_MAX]; uint8_t tempBuffer[qrcodegen_BUFFER_LEN_MAX]; bool ok; { char *concat = calloc(strlen(silver0) + strlen(silver1) + 1, sizeof(char)); strcat(concat, silver0); strcat(concat, silver1); ok = qrcodegen_encodeText(concat, tempBuffer, qrcode, qrcodegen_Ecc_LOW, qrcodegen_VERSION_MIN, qrcodegen_VERSION_MAX, qrcodegen_Mask_AUTO, true); if (ok) printQr(qrcode); free(concat); } { uint8_t *segBuf0 = malloc(qrcodegen_calcSegmentBufferSize(qrcodegen_Mode_ALPHANUMERIC, strlen(silver0)) * sizeof(uint8_t)); uint8_t *segBuf1 = malloc(qrcodegen_calcSegmentBufferSize(qrcodegen_Mode_NUMERIC, strlen(silver1)) * sizeof(uint8_t)); struct qrcodegen_Segment segs[] = { qrcodegen_makeAlphanumeric(silver0, segBuf0), qrcodegen_makeNumeric(silver1, segBuf1), }; ok = qrcodegen_encodeSegments(segs, sizeof(segs) / sizeof(segs[0]), qrcodegen_Ecc_LOW, tempBuffer, qrcode); free(segBuf0); free(segBuf1); if (ok) printQr(qrcode); } } { // Illustration "golden" const char *golden0 = "Golden ratio \xCF\x86 = 1."; const char *golden1 = "6180339887498948482045868343656381177203091798057628621354486227052604628189024497072072041893911374"; const char *golden2 = "......"; uint8_t qrcode[qrcodegen_BUFFER_LEN_MAX]; uint8_t tempBuffer[qrcodegen_BUFFER_LEN_MAX]; bool ok; { char *concat = calloc(strlen(golden0) + strlen(golden1) + strlen(golden2) + 1, sizeof(char)); strcat(concat, golden0); strcat(concat, golden1); strcat(concat, golden2); ok = qrcodegen_encodeText(concat, tempBuffer, qrcode, qrcodegen_Ecc_LOW, qrcodegen_VERSION_MIN, qrcodegen_VERSION_MAX, qrcodegen_Mask_AUTO, true); if (ok) printQr(qrcode); free(concat); } { uint8_t *bytes = malloc(strlen(golden0) * sizeof(uint8_t)); for (size_t i = 0, len = strlen(golden0); i < len; i++) bytes[i] = (uint8_t)golden0[i]; uint8_t *segBuf0 = malloc(qrcodegen_calcSegmentBufferSize(qrcodegen_Mode_BYTE, strlen(golden0)) * sizeof(uint8_t)); uint8_t *segBuf1 = malloc(qrcodegen_calcSegmentBufferSize(qrcodegen_Mode_NUMERIC, strlen(golden1)) * sizeof(uint8_t)); uint8_t *segBuf2 = malloc(qrcodegen_calcSegmentBufferSize(qrcodegen_Mode_ALPHANUMERIC, strlen(golden2)) * sizeof(uint8_t)); struct qrcodegen_Segment segs[] = { qrcodegen_makeBytes(bytes, strlen(golden0), segBuf0), qrcodegen_makeNumeric(golden1, segBuf1), qrcodegen_makeAlphanumeric(golden2, segBuf2), }; free(bytes); ok = qrcodegen_encodeSegments(segs, sizeof(segs) / sizeof(segs[0]), qrcodegen_Ecc_LOW, tempBuffer, qrcode); free(segBuf0); free(segBuf1); free(segBuf2); if (ok) printQr(qrcode); } } { // Illustration "Madoka": kanji, kana, Greek, Cyrillic, full-width Latin characters uint8_t qrcode[qrcodegen_BUFFER_LEN_MAX]; uint8_t tempBuffer[qrcodegen_BUFFER_LEN_MAX]; bool ok; { const char *madoka = // Encoded in UTF-8 "\xE3\x80\x8C\xE9\xAD\x94\xE6\xB3\x95\xE5" "\xB0\x91\xE5\xA5\xB3\xE3\x81\xBE\xE3\x81" "\xA9\xE3\x81\x8B\xE2\x98\x86\xE3\x83\x9E" "\xE3\x82\xAE\xE3\x82\xAB\xE3\x80\x8D\xE3" "\x81\xA3\xE3\x81\xA6\xE3\x80\x81\xE3\x80" "\x80\xD0\x98\xD0\x90\xD0\x98\xE3\x80\x80" "\xEF\xBD\x84\xEF\xBD\x85\xEF\xBD\x93\xEF" "\xBD\x95\xE3\x80\x80\xCE\xBA\xCE\xB1\xEF" "\xBC\x9F"; ok = qrcodegen_encodeText(madoka, tempBuffer, qrcode, qrcodegen_Ecc_LOW, qrcodegen_VERSION_MIN, qrcodegen_VERSION_MAX, qrcodegen_Mask_AUTO, true); if (ok) printQr(qrcode); } { const int kanjiChars[] = { // Kanji mode encoding (13 bits per character) 0x0035, 0x1002, 0x0FC0, 0x0AED, 0x0AD7, 0x015C, 0x0147, 0x0129, 0x0059, 0x01BD, 0x018D, 0x018A, 0x0036, 0x0141, 0x0144, 0x0001, 0x0000, 0x0249, 0x0240, 0x0249, 0x0000, 0x0104, 0x0105, 0x0113, 0x0115, 0x0000, 0x0208, 0x01FF, 0x0008, }; size_t len = sizeof(kanjiChars) / sizeof(kanjiChars[0]); uint8_t *segBuf = calloc(qrcodegen_calcSegmentBufferSize(qrcodegen_Mode_KANJI, len), sizeof(uint8_t)); struct qrcodegen_Segment seg; seg.mode = qrcodegen_Mode_KANJI; seg.numChars = len; seg.bitLength = 0; for (size_t i = 0; i < len; i++) { for (int j = 12; j >= 0; j--, seg.bitLength++) segBuf[seg.bitLength >> 3] |= ((kanjiChars[i] >> j) & 1) << (7 - (seg.bitLength & 7)); } seg.data = segBuf; ok = qrcodegen_encodeSegments(&seg, 1, qrcodegen_Ecc_LOW, tempBuffer, qrcode); free(segBuf); if (ok) printQr(qrcode); } } } // Creates QR Codes with the same size and contents but different mask patterns. static void doMaskDemo(void) { { // Project Nayuki URL uint8_t qrcode[qrcodegen_BUFFER_LEN_MAX]; uint8_t tempBuffer[qrcodegen_BUFFER_LEN_MAX]; bool ok; ok = qrcodegen_encodeText("https://www.nayuki.io/", tempBuffer, qrcode, qrcodegen_Ecc_HIGH, qrcodegen_VERSION_MIN, qrcodegen_VERSION_MAX, qrcodegen_Mask_AUTO, true); if (ok) printQr(qrcode); ok = qrcodegen_encodeText("https://www.nayuki.io/", tempBuffer, qrcode, qrcodegen_Ecc_HIGH, qrcodegen_VERSION_MIN, qrcodegen_VERSION_MAX, qrcodegen_Mask_3, true); if (ok) printQr(qrcode); } { // Chinese text as UTF-8 const char *text = "\xE7\xB6\xAD\xE5\x9F\xBA\xE7\x99\xBE\xE7\xA7\x91\xEF\xBC\x88\x57\x69\x6B\x69\x70" "\x65\x64\x69\x61\xEF\xBC\x8C\xE8\x81\x86\xE8\x81\xBD\x69\x2F\xCB\x8C\x77\xC9\xAA" "\x6B\xE1\xB5\xBB\xCB\x88\x70\x69\xCB\x90\x64\x69\x2E\xC9\x99\x2F\xEF\xBC\x89\xE6" "\x98\xAF\xE4\xB8\x80\xE5\x80\x8B\xE8\x87\xAA\xE7\x94\xB1\xE5\x85\xA7\xE5\xAE\xB9" "\xE3\x80\x81\xE5\x85\xAC\xE9\x96\x8B\xE7\xB7\xA8\xE8\xBC\xAF\xE4\xB8\x94\xE5\xA4" "\x9A\xE8\xAA\x9E\xE8\xA8\x80\xE7\x9A\x84\xE7\xB6\xB2\xE8\xB7\xAF\xE7\x99\xBE\xE7" "\xA7\x91\xE5\x85\xA8\xE6\x9B\xB8\xE5\x8D\x94\xE4\xBD\x9C\xE8\xA8\x88\xE7\x95\xAB"; uint8_t qrcode[qrcodegen_BUFFER_LEN_MAX]; uint8_t tempBuffer[qrcodegen_BUFFER_LEN_MAX]; bool ok; ok = qrcodegen_encodeText(text, tempBuffer, qrcode, qrcodegen_Ecc_MEDIUM, qrcodegen_VERSION_MIN, qrcodegen_VERSION_MAX, qrcodegen_Mask_0, true); if (ok) printQr(qrcode); ok = qrcodegen_encodeText(text, tempBuffer, qrcode, qrcodegen_Ecc_MEDIUM, qrcodegen_VERSION_MIN, qrcodegen_VERSION_MAX, qrcodegen_Mask_1, true); if (ok) printQr(qrcode); ok = qrcodegen_encodeText(text, tempBuffer, qrcode, qrcodegen_Ecc_MEDIUM, qrcodegen_VERSION_MIN, qrcodegen_VERSION_MAX, qrcodegen_Mask_5, true); if (ok) printQr(qrcode); ok = qrcodegen_encodeText(text, tempBuffer, qrcode, qrcodegen_Ecc_MEDIUM, qrcodegen_VERSION_MIN, qrcodegen_VERSION_MAX, qrcodegen_Mask_7, true); if (ok) printQr(qrcode); } } /*---- Utilities ----*/ // Prints the given QR Code to the console. static void printQr(const uint8_t qrcode[]) { int size = qrcodegen_getSize(qrcode); int border = 4; for (int y = -border; y < size + border; y++) { for (int x = -border; x < size + border; x++) { fputs((qrcodegen_getModule(qrcode, x, y) ? "##" : " "), stdout); } fputs("\n", stdout); } fputs("\n", stdout); } uTox/third_party/qrcodegen/qrcodegen/c/Makefile0000600000175000001440000000446514003056224020637 0ustar rakusers# # Makefile for QR Code generator (C) # # Copyright (c) Project Nayuki. (MIT License) # https://www.nayuki.io/page/qr-code-generator-library # # 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. # # ---- Configuration options ---- # External/implicit variables: # - CC: The C compiler, such as gcc or clang. # - CFLAGS: Any extra user-specified compiler flags (can be blank). # Mandatory compiler flags CFLAGS += -std=c99 # Diagnostics. Adding '-fsanitize=address' is helpful for most versions of Clang and newer versions of GCC. CFLAGS += -Wall -fsanitize=undefined # Optimization level CFLAGS += -O1 # ---- Controlling make ---- # Clear default suffix rules .SUFFIXES: # Don't delete object files .SECONDARY: # Stuff concerning goals .DEFAULT_GOAL = all .PHONY: all clean # ---- Targets to build ---- LIBSRC = qrcodegen LIBFILE = libqrcodegen.so MAINS = qrcodegen-demo qrcodegen-test qrcodegen-worker # Build all binaries all: $(LIBFILE) $(MAINS) # Delete build output clean: rm -f -- $(LIBFILE) $(MAINS) # Shared library $(LIBFILE): $(LIBSRC:=.c) $(LIBSRC:=.h) $(CC) $(CFLAGS) -fPIC -shared -o $@ $(LIBSRC:=.c) # Executable files %: %.c $(LIBFILE) $(CC) $(CFLAGS) -o $@ $^ # Special executable qrcodegen-test: qrcodegen-test.c $(LIBSRC:=.c) $(LIBSRC:=.h) $(CC) $(CFLAGS) -DQRCODEGEN_TEST -o $@ $< $(LIBSRC:=.c) uTox/third_party/qrcodegen/qrcodegen/Readme.markdown0000600000175000001440000001611014003056224021704 0ustar rakusersQR Code generator library ========================= Introduction ------------ This project aims to be the best, clearest QR Code generator library in multiple languages. The primary goals are flexible options and absolute correctness. Secondary goals are compact implementation size and good documentation comments. Home page with live JavaScript demo, extensive descriptions, and competitor comparisons: [https://www.nayuki.io/page/qr-code-generator-library](https://www.nayuki.io/page/qr-code-generator-library) Features -------- Core features: * Available in 6 programming languages, all with nearly equal functionality: Java, JavaScript, Python, C++, C, Rust * Significantly shorter code but more documentation comments compared to competing libraries * Supports encoding all 40 versions (sizes) and all 4 error correction levels, as per the QR Code Model 2 standard * Output formats: Raw modules/pixels of the QR symbol (all languages), SVG XML string (all languages except C), `BufferedImage` raster bitmap (Java only), HTML5 canvas (JavaScript only) * Encodes numeric and special-alphanumeric text in less space than general text * Open source code under the permissive MIT License Manual parameters: * User can specify minimum and maximum version numbers allowed, then library will automatically choose smallest version in the range that fits the data * User can specify mask pattern manually, otherwise library will automatically evaluate all 8 masks and select the optimal one * User can specify absolute error correction level, or allow the library to boost it if it doesn't increase the version number * User can create a list of data segments manually and add ECI segments (all languages except C) Optional advanced features (Java only): * Encodes Japanese Unicode text in kanji mode to save a lot of space compared to UTF-8 bytes * Computes optimal segment mode switching for text with mixed numeric/alphanumeric/general parts Examples -------- Java language: import java.awt.image.BufferedImage; import java.io.File; import javax.imageio.ImageIO; import io.nayuki.qrcodegen.*; // Simple operation QrCode qr0 = QrCode.encodeText("Hello, world!", QrCode.Ecc.MEDIUM); BufferedImage img = qr0.toImage(4, 10); ImageIO.write(img, "png", new File("qr-code.png")); // Manual operation List segs = QrSegment.makeSegments("3141592653589793238462643383"); QrCode qr1 = QrCode.encodeSegments(segs, QrCode.Ecc.HIGH, 5, 5, 2, false); for (int y = 0; y < qr1.size; y++) { for (int x = 0; x < qr1.size; x++) { (... paint qr1.getModule(x, y) ...) } } JavaScript language: // Name abbreviated for the sake of these examples here var QRC = qrcodegen.QrCode; // Simple operation var qr0 = QRC.encodeText("Hello, world!", QRC.Ecc.MEDIUM); var svg = qr0.toSvgString(4); // Manual operation var segs = qrcodegen.QrSegment.makeSegments("3141592653589793238462643383"); var qr1 = QRC.encodeSegments(segs, QRC.Ecc.HIGH, 5, 5, 2, false); for (var y = 0; y < qr1.size; y++) { for (var x = 0; x < qr1.size; x++) { (... paint qr1.getModule(x, y) ...) } } Python language: from qrcodegen import * # Simple operation qr0 = QrCode.encode_text("Hello, world!", QrCode.Ecc.MEDIUM) svg = qr0.to_svg_str(4) # Manual operation segs = QrSegment.make_segments("3141592653589793238462643383") qr1 = QrCode.encode_segments(segs, QrCode.Ecc.HIGH, 5, 5, 2, False) for y in range(qr1.get_size()): for x in range(qr1.get_size()): (... paint qr1.get_module(x, y) ...) C++ language: #include #include #include "QrCode.hpp" using namespace qrcodegen; // Simple operation QrCode qr0 = QrCode::encodeText("Hello, world!", QrCode::Ecc::MEDIUM); std::string svg = qr0.toSvgString(4); // Manual operation std::vector segs = QrSegment::makeSegments("3141592653589793238462643383"); QrCode qr1 = QrCode::encodeSegments( segs, QrCode::Ecc::HIGH, 5, 5, 2, false); for (int y = 0; y < qr1.size; y++) { for (int x = 0; x < qr1.size; x++) { (... paint qr1.getModule(x, y) ...) } } C language: #include #include #include "qrcodegen.h" // Text data uint8_t qr0[qrcodegen_BUFFER_LEN_MAX]; uint8_t tempBuffer[qrcodegen_BUFFER_LEN_MAX]; bool ok = qrcodegen_encodeText("Hello, world!", tempBuffer, qr0, qrcodegen_Ecc_MEDIUM, qrcodegen_VERSION_MIN, qrcodegen_VERSION_MAX, qrcodegen_Mask_AUTO, true); if (!ok) return; int size = qrcodegen_getSize(qr0); for (int y = 0; y < size; y++) { for (int x = 0; x < size; x++) { (... paint qrcodegen_getModule(qr0, x, y) ...) } } // Binary data uint8_t dataAndTemp[qrcodegen_BUFFER_LEN_FOR_VERSION(7)] = {0xE3, 0x81, 0x82}; uint8_t qr1[qrcodegen_BUFFER_LEN_FOR_VERSION(7)]; ok = qrcodegen_encodeBinary(dataAndTemp, 3, qr1, qrcodegen_Ecc_HIGH, 2, 7, qrcodegen_Mask_4, false); Rust language: extern crate qrcodegen; use qrcodegen::QrCode; use qrcodegen::QrCodeEcc; use qrcodegen::QrSegment; // Simple operation let qr0 = QrCode::encode_text("Hello, world!", QrCodeEcc::Medium).unwrap(); let svg = qr0.to_svg_string(4); // Manual operation let chrs: Vec = "3141592653589793238462643383".chars().collect(); let segs = QrSegment::make_segments(&chrs); let qr1 = QrCode::encode_segments_advanced( &segs, QrCodeEcc::High, 5, 5, Some(2), false).unwrap(); for y in 0 .. qr1.size() { for x in 0 .. qr1.size() { (... paint qr1.get_module(x, y) ...) } } More information about QR Code technology and this library's design can be found on the project home page. License ------- Copyright © 2017 Project Nayuki. (MIT License) [https://www.nayuki.io/page/qr-code-generator-library](https://www.nayuki.io/page/qr-code-generator-library) 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. uTox/third_party/qrcodegen/qrcodegen/.git0000600000175000001440000000007614003056222017531 0ustar rakusersgitdir: ../../../.git/modules/third_party/qrcodegen/qrcodegen uTox/third_party/qrcodegen/CMakeLists.txt0000600000175000001440000000025514003056216017540 0ustar rakusersproject(qrcodegen LANGUAGES C) add_library(${PROJECT_NAME} STATIC qrcodegen/c/qrcodegen.c ) target_include_directories(${PROJECT_NAME} SYSTEM PUBLIC qrcodegen/c ) uTox/third_party/minini/0000700000175000001440000000000014003056216014310 5ustar rakusersuTox/third_party/minini/minini/0000700000175000001440000000000014003056224015572 5ustar rakusersuTox/third_party/minini/minini/doc/0000700000175000001440000000000014003056224016337 5ustar rakusersuTox/third_party/minini/minini/doc/minIni.pdf0000600000175000001440000042700114003056224020263 0ustar rakusers%PDF-1.5 % 23 0 obj <> stream x[K7 W * 4zK{9R%qf쵳[A(>̈ iEp'w' 2%qJ9L2 ŏwJH iSd_',ml,Hr]ǒhZh6%Y/%lڇQ.yd9;PjNdg+<N}*R%Lш S(Oi$O2y'p ∆ճ1AQEaoMl 8vPZZju"86#:ߐy+W9q(ua" `0gvzVFw郚DęvS 2%"%3YZ]t>٦(yd dR$T}(:“LH:=l++GK~ml_00#H>a-'IuQx2OQ{qעΩ1ׯH/խtEKͩ-7dmL.o/0j^r9xn+2ja !Nl Ibfkp?`ۥoo"[q e=3o԰"و/%r~eFzУ?b2VG< s?55L?@B7iQ;t(o}fj pTxL7v[^y4v#[3_V7xexCW"^ A~D[_B5ݿH endstream endobj 27 0 obj <> stream xW=6 +<,J6d(pvH^I7p2EɇS?J/q-/6 i0Nߏ!]?ϿN,! 8,r bݙUϴg/VP-U5*e !*y7g-R@wX>$yiӧ7?k6W7x7^_Yo {E,-EDOh$|OwǶcB!⮞E6=>@ IyT_a^\N=&}rR>:+">G?V(d.k͌] =3Ooc7asKѾr6g" =y #b%ij`z,]VEVQoS0#N}݄Em)||ʆ`K=Af|Nb Al扮y&ӽ&3V^D ,r^/nbeȶWt\V'[#zeg4lܝݖ,{z?Yn,ȹ7Q2B唒M.-n aQZåb'TM;$T-Pޙ#,jDm(IogTݶd_Y0c3R\|rAtJe׾tw|',r|/bUN?5 qb5czfA,<L#.GUK$0M0q5!btWY;Qagu%˄}%va=", iiwJ(-6;,K;f'(ƭg0wTi@Z)ߞJsJh+ǀ; 8U:gd&_ܗi3 dӍ'3ey ~>AhZ.V0N@􏎧@1g! .|y#Rna8qb d*CB׏:Lڶ V됸N^&,p͊thB6ˣW=P8pJkyas/})e+8Jqk+\z,6L>֑:~A/me > stream xڽ,I+i4kx`LN[GDdQU=i7UշMɛW7m?nqN~o jܴN(=1ƴ_?*B&ӖG"t O]ɌJu^[ 6vf3]7N o*y纶n I:n2Z )gDdɄOw` lRҪry~7"Y︢US^:ʂFuvmMtC&}2pYwՕϊYeƁ,T&';=S{8+s]ﻔ% ^O̴' ՛->]C7]>iO&Y4 2T&cW/Q_Kb;LT3 UBjr  HaIRu\"*I<#;Fro28Ԃ"g2I1ULG]#eա,\ (Sy.vАz|B&D?LL/>i]C%f.;_?\|)*-cVKc5JѿɕBAFX_hmAǾDYKִ8V<%YעXX\nrIgI改 BڪuB1{ad.1箃k>~ZI@gZ8cU,i\t] .R(mtjqEWuX9k T[QSp bM"X4;^h-3TWq6&+?Tvr" Ϫ,m4Cm&ˏ7Bjٝ‹@L/qd\N8; k rQ;iLmfwkC9 r?a19sL~45~p5jk5btζϴO#shV8}3FUn AOx*+J4QdLX2\>Ƭe2efyĔS9_^ۢ9WŪo|Q_d<nڰXi'1P!EΉg(4&'O 0%v0<+bQiщ>x~*!Pju-w55oíB-f aOG$r܌+-5Zp u`b.?U%+JE n-ԡ+֐T,AT,>Ќ)P_K_fb+-C>u$qZ\g[| X/ruEF Nl#ldEX ŦM[msg*iI.?)0T4p*J'az~tTcM,O\ETmէ Qcc3'܄BkS'qCrRvJ\ ޜDa;'"ɒEqy+~~ '%`I{$7ಯUКC $6l{,ÜiG6nw]xap9ћomx'@a]eŘqr'eǩʣ*gՍyou>x-u9Љoٞf&*$ze{]74ʾ IUCY!fbgLf浮߬\vͲ1(ThP(} 5Zu~rΆ͟#E8eZh31ʉ+F}s]X59ijyqХ*Sd1NprUiV&ϻ<{+5EZ[haU"hjE…INƙA9Ӻ AV#ee]V(Bf(/. k; 8bh_ۚSјBΉQm4H ;R/0LKb/Zj>hH8+bhGb$A =~SsܡCf:_$DVL0[8ѓTGOÕ|{x#8x;ʟG5u8p-hOV א<0Rhf;oLp!cI0ٴ+kێlÙ1Oqy_pi tտ9OH뺡/ vKa{-o8K9n5@lɢ6|蓌/LߕU=֣Z/ڪRS?U$"n==nV)U#o`tjQ{[ϦR6s_vǻOMbh7b&)13f.Դ3qo Զλ,,w[ +u՜IivC^)'6(~/.w2yKI;0S`򳤺2^DKVg#T0"kj([M ~4GRYq7t̕[s"|g=2©B/Eeǯ ] endstream endobj 39 0 obj <> stream xڽYɎ#7 +HVC$@n-%s\RT-4 TEqy\zEY]Breud,br5/Z~72mvL^q=JB|7_OX8ÛýwE~MRO\$W"o.l}m#t)isCj/8pM$gImߓ;I/dYP.ݧzT5݅6Ǡ6ȡ:*zb1XtHB~V$FWX+DKxfp,+\?<_M麎"lTG9l7t4VaT9:TJ oףx$e+P Nf\СE Y^SЋ' VO|gm}f%<9^$&0 vZFvب֋+ةF za }ED <;BYbsաKGV0VD+y#'E+t%V_X~8H*JmeqO/,' >&X%]>u lpm!#P'iκrjNM{}~! [j~™kVӷ\]e;gɮ\ty%$2"=N+7vl2ֆ> ujY. h5E% Ss 8ҩ [Rw $M)=6vMsϾH~NeimGG?ڽ+՝R\xGadU!Le uv䛡դv/8I6ͬM&퍉ܵ;mqjk[t 7/-d3D1ck\Nrq of7.LCq*z=u?M0-X=L&| eDk]JN<Ϧ4wyF!R"92씷}^0gX?7- endstream endobj 45 0 obj <> stream xڽɎd9W4E* 8TeOrapK̚)i#|E_T/\BrO?|OᒏbC8ʷF_|R6*OXF[)Wu}h痿Hl Kι@ҡ@D_tYb|]k^aRPvAyG }{%/Pwypt|?o皂zs3mHcv ~Nc +-™xz~tRlT0(zXI9I<\XR!aNb7 Ʒފ+??NwOL;i|o[< |H ۸.е6ގ8[2cT\6 9t.uѽBF>HB9pFg„3[t{+8y/I,Љ-+D:pIR^:/*7v 9t*9)]a߭:9ܫm=d`5: gf$9[F.opm1Ɣ1B(ke0*FT2RQ.UV_; vꯀ @=\;Dp& Tp, dz 7b%L8g/#,(*Ib79lAT!0V#_FKȶg|PLLt3[DapE6P?P^>ÉM)SY]]afs;TUZ>O5 U8 #|al' M rLj_)/"-Ya08fv:)ossWeX9(qOuCNjcqlrbE Q#=(jPo__˯˟MKW!2VxmqեqnξW2[o ,^ʇckHs5ɿ %i' CoسV-ɾ[ߏFe#A~:٨j]=,}lL%|Ϧǫ<ڮWiJA ^}X&hC4n#[L?6Fy+ME(vnC78!b1TK2;/;߭2v$[WfڠXY>/VYIfeWВ-ٚR(KL8B#dsWHȒIf<XL=kxзn=/qX!ѭ:D&!?KDiq&sl01 #ϥ2f"uJ}eN}V)2Uf>H!?v=)Hu8?1f[xو06i0B+JG 't[.-A3l}dvn`1jԚ{xOe"Nqz^]Q -i|$X0S0ٜ]@\pk ?_9oѯ@Y:p Co #/ezc^kagRg^f>% b\i /#gR[7_95-XTY,a@y@TRc7GW w^Ԃ[bn)[w7!piuN|V9KMxzr"hZ]$ q2#KJm=$O쫍Y|2G^K&)"xu^={j+ã+zjS산iq1k$x Ùl, ''c&$#?og@V$oƐq;ڣʟ dd7ȰVBZH?-$[H}8bֶv<(?Gre ;&[wү_oMn\rGQ=bj2ƥC&6etn1QK3{KdFeTn`S&32: 31|2GgnX71v%#$l*zeg2j̴څjBaD8!6%:RiCݛ,߉A <"F'׹םmecUd;̻ ,kh )>R>lAΦܩB ԦuF\9dlRbmn?o/Гn%kbSŘB4e*G~k}w#Fevz ل9︓V@&V{T\}&>aNl憖62j8vA:$lQ-;vF(Av/Sx1Zgy{skltےp\=ğݬ%+N.J-\:~1OIyGuZ !V$dgd&;fsJ33':7sߺ^j.7ڡYm3IDIƖ %ގ %E' 1vM€z|oKލg|%Wap {|-= iąKI"WPNh$ނXҚz?;v*Vm8:HvHÇ1SwS1UCMٔ n :DQb:L샷&Kle1rA/Ⱦ e ʂf,/-nzW[@-NvzM[<9k/~{*Ls}hZ*s+h$%m^Vb hOtaˣfxE/ֻ80<ڶ31m{!ӎ3tzɌIG3B~m>t8d=d&yCҡPAoel^b20:wZO1@إNROH vmnYۆ)56iN {c@F<=/ιJjM]MesEBJػXϵ]JGlXӗ#C$\k̦<k0Ω?9οS[vFkuecUEZl #2,m;jgKtKu糣`V*P;B4f̪N8|#:-d0"} %W\ck1e+Z.=}v> stream x[Kl9 +j !T ;`}f1l$v8sEѨ5sN/?_Eū t×.qN_/Wi6sQr7!J!Mx/I \[ݦt"¼rҧ~B@&GH/Ĉߢo|\]!tic*m cL#7*c*" 60͌& VupbUaT$1F`;ӈH=i!l*IdEb.?zDv:- EHd-3ruBXE4IV QS74*H,{m%wq Gbz^stltjpr|s)EFЁV-O@ A{m_Iwt=_T:>iuYoS\ۖpڜ|V@}hi}wǺyOD +p &8wVl4AL"@g̴E+ڀ_I}EJ1ޚQU(CBD4]]d9CփiАÎP,1_~d`b <% We7Lw r_ B-#m Y4,NC@/}qʠ oFT@}YHXkq-&b:?6CY lh ɈL#^M*j (ncؔLC|#&[~Ao3%5m%5`g;-vJ>,m12:#+/}RC1%:xl;0:A{tX:'dp1&ڙđ\VL:$@.kpN`23Js;ù2QNeЗdQl!^T?IqݼO[t'YμV4e!ne oKn#Ι-ܹEB`g;HUtt^\7rҜloȉgn(5/hn@Fʵ|Cv@bgGB8䭲e>=X"ugIR=G,yĸ`Ufxfs9a55=g uQm,-·p^<^=*{vNsTR[`[ ۖɱ t82(#(OXfXi ?S΅@ Je$_뭂dbF(!"nƛuSWiN=u".гܸ5%&%1b"'RH1&s@byc1+z7fC!(?@bUgy:󐔓g{m;f0ƇukR4>@=4)! x7h[SB<;r;vֶTOdA:,c $޴a؎w 6l1k6'7+{$w^^&SNMY5k63:++C)qs3w %қzbb/ Wjpn6|9H?ՙ++p+ruszQcx]%OLbKa j/__VBsc\{WϹL0+gdtspB=#1V$Z,izZXB*1xFkBD{80Q6j~yYVٛa^yPYgIrqAљ\gI6H3>tΊs^Y ZB [pqG'QˊKCW+11fcgyqpF:qq:ERMIn2V]{uwd! O W;6{Ig$+lݐE,9. CZ9wT@/(U9񤧇(i\^L]CnC;+{Z=njc}mPħ,8'"Wb߫}g[1i~=IYG\w҂"4yT -|Mtnج` Dn@E^vreX0y nշUZfh!?MGMbxpmE|=<kWt>g#]^YP˴p/ i چ)[66ngp:nOh2?}Ԕk+8aL{n5I-7'uMY۴'۴P9CZ6)۴mZ2`FsV<8z?x+a`7Ffuf؋yi6,;s$?Fð=t͑ٛcAza2k7C'>7. `~㓳Vtl2Cfhfjt_nCd}k[EXƏ,_Lq2^a^)u_VqW}wp~.{pר[c(u:y,"9e6?PKEX sk&R:7 $<P?:$ endstream endobj 56 0 obj <> stream x[I, W1 ИĀoN]3K[ IQRUu??4K|4/\DW f>-߽.[^^?ܚ*J*B{>[|a[mM-?UmZeF/cI־iV\1&}lCOdXߺ7 z4u4[/7G$zLD*ٜ(FTZƠ\Jhg Jzn[d44]ᣀ{_{O˭DOԫDNH!'*0§cLUEUB!2,JKBw HS٢  YVz/ڻUCbջl%"$ֿuQA^Fv'fjG:lgTj>+ (PJkZ7l7?ﭓUOI|'=qm)?̤`od~HFԏ<-2R q'TzHt0(=]\׫GHM\ 6 G싱WPCS4 䁢mD)+2Qeލ&m$i#Ҫn@Ey|1i! +z+ٴIT>1PoTZ:ɬ ʠW=yٯJBv IxoeU&G1Ci~W#j܋ ,6KٿhE@ rB3 Tu©aa7ӌ1&sNֈIT6ڏ$AZVpN<~?H~܍REBrIK"d&P8:LeGhǚVXZ.su6S[[:h&Gm\Vard&PZB뎩}eV]"$WYEl!=uf(f(v[^E=iznju{USDJB9YeOo&|?roVyFׯ v\bq=s-/Z]'b  }[G^-QF*)G$CQP?9i1pп]4l9S_ f3yt@yR`z&&Иۄ`N|*@^sya|7,ڃ3,gɽcjCne?T ,+\$"EtD:ԁ aD@LV߷NELvae` _ =bpq\a$+9-3@ x4b7XFYEɗ_ax+֒5+ɛ ŻW\3Yc᠝,,g9ƍʌyՏب8,C=Q"g'AHC+Gcpifu[,8DIzkNPC N n?lyh:(z #0}~ݝ%ƌe'=k`Ml$CN.V[G=XIj8֯kI *NŚ JwOK֚bUԵ>mKW#$Z2R0 M+>a)\!Os,cЌc9˼-ҒgxVexZeGMM`uFa ,Q,92:#f<8wNk~s/2A.e+ }՞ S9ys7k؛#$'\CCx8-sΤx0 *dsh^|9lHweg)(L2.ٴDAUZvb&\ܐz̚s{lH`v=0TD 'W;i/[TF8 8a+hC 26nV8^ \BNI4T:ZeƑ=Fn{젣XW>enTE<焴_}Fwkk_ ۠3B^GpY':S .NQ/OhуU0J 7Y@ wywGk 0#Ţ&ljP{A,TH4Uk^,!fdXvCEZ)(]6rx3ofpHW}9Rj !B{ןݖ}xsËc)EBA1^Emخ3;]Μ^ގΪ:?n:Ma[1ID@]`]wn<~H(2A]PlyKeIx+],Da(#Z*8J1VOK̯Cy1gL tK3.mCQ(X[נZu: x qk;K& CQW3`NXG‹1jUzǏftz*6PxBx}QYέf#;HwJIm> stream xڽ\9$ +& v0xۀ3ٛ 89w$utOxSd}<[_/"sr.qN_<.ol&\M !»_&6AMh7-}zc>ҟ6p۽MoR #!oj. ˋ[6 P=a&ҿUsjD F"8:Ͷn] e764Pt4NV-vٍiM{eR+́饰x'2>|p"?{:U˟G2Uw|*:ye?)d ?h=ha~~pVdWܻM$7W>_+.98U&Y ;ଲֻ/Fbj@vxu eRdў4烉v9k4JT)Yve8eNGBYɐ f;vnd,C#2>Q z[}^-w!`.62D [*q7AGٍpL9eĮAAұ]"4H*WIY= 4&UolB˰BR<95Uw h?^'Ti9JI^ᝈX6Imv}'INn.`~A)+7_rݡaΌ EWخ3Sݘҥ n߰PaԻ`cKBiՌ?j#4 zË~6vU{{yh3.Ii {^M\!:>vkIu&^bsջZDd.^?7*%\N~VG^v'6v5aG ~b;CKsg4K PϺ{|@ 9mA 8拑!E%BOsJ:d5snLF<^à6Cdw*wp]s: kw"zF ~'xa1uĮE#X̲wq S][ŤzQwalwDjy =ז 30ńzh ن:#;+raeg8{X7>DMؕM{lt46<AR wRrxq zM8CvΑYj6$ > 0Lpӹe(f=14V}>|*-R4DAQY?Sa;X넁&Oy%+_/I73h`.\Zߗ_~)Oc7S/&Q "OI% O baO^t,aq7t$qUh2>eN 21EuG[fs0Z|ͿP%#!`"\˗lȦtav97U2"pތr@)zR%NJp=o wmۄ~(vKE;8XǪT+еɰa0&: ضڱ,Lis`QK´}&]'&2u\'"?\axS :X#;$*AYJ)2|θr8 xw\p :#ۓwbWkkBk~.R(E %4]_Ɗ[]S?D(:],Qk OMu(, 99ė /dNgCx]k{rb)fm\t}fu3BJqR`4kL#kF40aM]qvuvpO@V˶lpVYpglJ%G|jSU |"QhN LayOxú+yoe3NF;W̹;*5T!ltz7xwcď"(?LĺئW 2[_ղs>Yĩs|ߧOgL<뽤^ڮb6"!)Ǝv /1.+25g)H;#`;g+t_lucס\b3!pjOu# R:ZujvC P~n1r(Rѭ q&ҧtShˊ8LkvYp7 *TeCt"c+PBͰj@=VZln_Dsie5+*O]yo$彪ੴa.i] ]k4}﫦.dxqPMKcMLC`6fcX1Ê 1>f !ieg"V!)dWv)wW]wYTJ+ۥd$[fdN hĺal]t!:%xwbaT_giq˒rymbB֯C526K1}|^AB 3H [BB1UHH <BBA>45ZзdweP C7T &;ߩB#غJ]3h)ƾ!e3/n2*"pDQlaK]Ls/SI,"<)c66{ KfHK:UgDGnuiU-›׌{NzlKqc11q>VƊ3zh͵75ҎgE,@Ӭ~_( endstream endobj 71 0 obj <> stream xɎ$;WT}Z}@$nꜮwa G8hFʲط\~]"?x`/䖸F/EJ(J|7!r!o&}>O[TyU^Bchmw_b#&_OxP,-iV<\%e=.abVZo_eh_}4,_z3]Ou\XE۔%rFPIAR4be#*2IBilw{ڷrv 7ua3Xa&x4, KDw֛tL'M,2QQ)S*6Jqu"ܺ>rG) :r~3/o_4(N=(A&Aѱ,"vݥ,70po(dDd@g\8 &m$J"!"/"nrux(<0p2Χ/^/ n ʦ>F⮙lm5:NLWRE9ź wULIp ŸkjrpWۇR1_$Hii` !@.6--s ';|t}*؄!T"m{Hq.X^$`7h5; <y:!slJbfiQ DHzH" /?!Eҫh[u\ַH(v*)śeUHMV,^^NӓF\pU Sv6yFZ5+:M;I#tӝ q{wYޭ^>ki}҉=;Q/)YVx4$oZd>)$ 2 K!nCW(Ԋ@?{W쩫-ND>" ( Q[1195]\S*ÓުY]TJՎsF\͢HUVJЖڤ:߂IzE\`RK5%0B@HM={n,)T@]d|o[18B8#mPmduTuxZo$}JBK 5e)w=~P=YѤʞO%8hзE4)b!e[/5!Hѥin` =I_[ jo0ׄ B ƺgMDWW&huۍt&(6k*zj"Le1&64S2&ΊuKTIm­CrL"< O vXÈ:% l4gU.1z@ldmbbaRm1TJ?1*NsҢ8_&⥍93kxi͘}dhVa  M5zK3&އʳ"!Syhɓ8&9r3KpMR-*uwcIȯm"mQPEcoފyV0 $[N.VޘaNFQlG<,jx\+ƜՂjgl;0⛶ꕕPg-3v_v0=NNvQ(ID{f&N4`0ġ[΋(mucPA]o{7>TSS n#ZS wB㞜2~q}$^P1Ҵ&l]>qxy 9tРR-&Głr^q@lD6] a8gzmH!E f#M2̳k}D5^ ,OCM*ڜ[hsn xSg}S%^֓"_tv4+Bm5Oӑ*u]'[ ʑ.RƺG1O2)c>u +ŭNǃ8JϲEYkэTC.hхXZԔvfZ]Y0Qka7p#fV[!jdiq%4'k~ퟑgi۳s[\GvP"SsLf`]7rudV3z]nا{à 0b9Ɣ'iD*ZguZ_(5qa^ѫV*r:M9x&8$UJö$(w% *~I== )]Y'}}w{rLQr_k59#kE==40- c/ӱ )wOcAyt4?4dz-6% ?h:k8KNJLպ2|tVO`kmT{}Ę̌(SN]*CovG J> F 9z$N6R)91]f/ZAĶJLj&T_ʩ>S />ؙl,B".[dck^I e4[n.Dfa!(1xv~|^WYecenyḚ4E' :ynZ:Uzz]K6NJUk1i8'TҷŸ΅Lŀ6StBuo qGGDTK hTET`8h#W+KVawsc$M: T{*E?)+uN"쓝(1ͅ<**2;Q؝ ٔY_9i>.{~c".O[Ji#抭K$592wN\=/8 endstream endobj 76 0 obj <> stream xZ9$ +*hY4:X`׀_f8W3ω7$RTW1WՔxGV/Z"Z^|ǟDfyXn h%[޾.zܔ.ϰ m`J.++|q3*sltOl,|~zE;2;ejlp߇VC0p?hr˯Nv/@,L6ԜW}ߌ)^k]'p֭:>o밯'(S~pHC:Gnm8'[ƩzY;{|P;|x bJg B>xgKMvJyPlgDUQU;(t@:&2V˸]X#UhX;~hػ}4lG'L# BS?W`!A%WwCC?[.ў%QWUV8'y}xLj0aݛaj/E ,̶O$ Reߏ׮W_9x ̞S0QkZo Zf}J7Aw(P[`#vdΨG$9[0GMi#7c0yh 21W&%ʬJA죩 lAv:ti^Ty_U7FfY,aN{ 1h&Ҁi6>'V*v)vNYt 9TԾ[K%g,iA}Z+.}-%?,(=oM)Ri'R;}$c}=;U)ws  a->he`2A0e(l[ƊHyBl0qxs ⯸ 0`{p@kdXoF--!]FŇi}$9Ѱwb=kG}߂UQc*[cfQz c %]7fistnJXwȄk g/yjSo _j_;$u$^ c"xHvyApm7^muye|by$ ;VD$~4lrжﺂG^\fy|?1eD?uPV9xk"o],`El^nz pf3/BG6Ye2F,vitڽ`mc&c$pr;lZsBT W~??Kz GOQ &0V'r=͜ZOԌ,]+Cz=f;vD(ܦ_̉o+y1" ‹ުWa,vr85 ZB(7N}hB0cǼQx$h&ѷHY)Þ/,gk&ntО]!4zpTeɨjade6#c[fZ6(sd#NZ˓A8vX'r;߯\;ѝ%%\NRO&ˬqU<f_{ QCwL"클"ؐ4 ;׍Ti굷>v;(}NP @Bwl,_8`-n; _~[ endstream endobj 88 0 obj <> stream xZI WqBm@2rķdgw.arQ$jzն3*I(llrܜڬiӻ`u v6%wiw$܅0_?~v릵۝l6 b}i^iğ4\?<ߴT/#G|ȿa>Ï ~!n;Qs-~k,m  y陰;W O?о[EOCN @?e,V||hߔ4/ROݶYqz,wt" 'da-Ed2nF"rIJM'v2xR}UgtP8m*0f!9:4"K[|] :yÊۨfA(z"L'GeK\Q$TIaV襸{Yܪx[xg_tH^/z0d7p({$5{ NhI)Hi95(}o fvF3diTGo,^mn 6~Rd>iɓ2[= ߓ||Ml'=Q&hs\'~sNٍ}Wi\.I7#6tSkۄ}7DC0ﶃ(_G-Rҝs/}hy6 Y龸lνTNNF0ڀ">Cp'0n)C3p^n],4DŖ͈3_/n~г3"?;'5sd^3n<{ iDHf",GEv,)V#wz |cHd٪ nzFv6d}g6vZ< ^xEjo;^>9R  w̦|+wO_al$"4xmtL\X~xF܄#@[lP/޴;O]2`p\rFuTK(UٺPz= աef28ڕm@pW*f`˛O M] |X <imJ_8juG𙗕H>YT"L'V>͚tuHF~p渁TX 0* 0Gv]`*+鉲"|+]mMTn!+?QD PkkvH"? BLs!9*"U~%đ:Y+gDYwּEz[d4b]|r VUjh.w,5pXrF&˴[֛,C_`a+"-Z|H-W7UF| _5ai7uCn~Ov9Tܨ3ٿ2NnxzK۔p?Z^Yz<*JprL 8D}꓊rbo*c.9{]vZ`M\P;ꂰMoTi]ems[A2K5.0kaeh}(uS5գ,(;˂h CBAτ}vޡY |UV(X0Utx. ʴ%N;JJu]څ>]\Ѭ̗OEnBu 798<{&1쒏0n?e:& endstream endobj 92 0 obj <> stream xZn,7Wr /Hdwg lƋd=HzTu۸`hU%QutH~؜ܬir ,X=]LoR0aן8:~Ep/<6HKf\\s#?6-1I253Z}-Pأj \Nj.*7U|4CQbd%aDc B\Y5`{4HZ^kuτցڥ ÷2J'9ryU7]"x&_qi֎_1.3+@2_β^P^^YxTVV~/j @cwݯI~7:kfh $ZEW v+\cл(d|yl$0$aɸ;=qK^`Ųُhea7Lz*SZ~d-~M=մ4V.IS|qlW$hK>Kd(y-z}f40%n1= 3)g> ymd DIGry@ r3TiҎ+)OvJkuNh!f|x(G`pnD9W)*@yM+fd.tK.ID9gg $xb(oG7tRnz:YRPՁrXHQ'K[<PO] ׬1vVz<]Y5Y8: -,RDe GrPch@QZdĈe!Q ҟ>jiq-d:oy|-*]=g@4N=:]a,3*LC0wGT<zg nӑNޓ 8}}7/Eu$@8P,IA?6m U\3C2ߥe1=".NRdiM uwU1DTdhTi|oIx3KB4۹U{ZS®'Yu0z.\**S/r~H΄-,s2uɺS+Δ+ȦE9!G,yܨ$JH 9uiSę\eZװ:tdhfPxp^J0cXer= 5^>=ZB*W킷$_r>еG G/ѵ2%{p) #}Ei~,Ig̓Zs-+?I,4臁]V [ҵb= [OmĝH!r$ |WbõTso3.kez\r/zyzO}{g$Kꪛ`?A5Z?R~yw.3e#ZƳWʭMi*5g7QdG؅TIh~;?]ÿJmZ̶1)|zA!>gzΖuP;%-ʮ5h,7EںMӢ X6ǚV!7ܧ<-&5r !AHKbEĠAH؆1 c@ZmDdd!A&i}2 \~P endstream endobj 100 0 obj <> stream xZI5+}Fs@"HsCdC.L "Ruu]_-"z>,?>,%`(aPL;s#?~Y~zX>.L|Z4Zâ`Z~[ގqD.^>rp%||*$2I $qcV󓄯QpZgv^/!B Uʂ6MrYTX?$*yEK}7̏OMz*]c,XpJ>YFe M,aB_Vtf5n.EZcMP|湪*Ͷ,\,΅efϟl#zzI@BD5jA-$dкNW8cyv=}-=tbOwŎe"il&rRdE\'cr%~a~Xnª Hy#K[Qw>p;9+ c4{lB ѻ%\:vE1+߿zۆy\p]3tflS4i'ˑÜ-Wqn/FCs=#w܂gtFD0o`J!HX<' nlՑ4x3}$|bK- LQ?8y AN| BFѕBK j/筕X*ʓVp ;DEvEXk\ƒGi٬u{GښiiB__۱u.Tp/;*+F7^Y1a3ݙCvdžҦ%H PhWѧjC]HÐ-!H}i]XCۦEsC NbrXuDmd<2/4[ ȅjbP=G .ٕƨK'r9(sΩE̡XE}$QPtrܲĢY#B6ة&2@nI[ae}LqbP䳕>,tրX'W qB!s_?s)\mQe5~VRRfKodM9?͔wU66h`; K5ۚ0Cy_iG꘮P]_qK PM\ `C'9RY#-)Z99c⛓5W9ld|U%#>=ux =u%͒= &NqH$$2!JC:[%c>k(z P h+}+ިӥDdNʒﺲ9(}:r}iفmyC̶bEaghq],[V\oOs]֎^LBEvN9cFug#q+ Ym:.J|fn| n/Zb=jg"elTaŹ6<_I^Zh2u2,U巪sC %-+~胫7uw)Y{2IG/1JzIto7njϓ{ӌu^Qܗi9uWԼD'NV_41$ 5I@Mk/plh=E{|R\ wzuBq 2egpq2',q *US<)U\xZ endstream endobj 104 0 obj <> stream xZK5+4 {Cv{wr!pߧ(螙%DNr\ϯf?8U/凇♷jy,'^`,9>Ip٧>l]%3z܈7a03&PWfyh͌O-/&n(aQяYak2l moWdaf<ύt끼p$d҅YV|$'ɋ0\y&$>P/S*~.5 `\e_uU}Qd;Hi+;)+J-"-URe\IkEE .Of*h ]oSǓN1k54pqL7hL. ͍͠ 1R1Q/ܢ] mfD#U=JmtnZJ!Gp1<#ϑXѼmA\OG3oitWYErNOfdLXnm@63ww@q+\P%O"2ە1pze4q'En5<6Uyg&#[(#&s-LSJD'֠XPpV;E1+߾yݨPFs4f-hA}d5{\2$S:S> L1y_n+YZ4V$T0459itZfݍʌaf1t{eGG=XS59sk\&7O!ӏӧұ1+Izy&{JV]3P;@# 6vSLP4ZlP^3}koSVB:T^8ҙE%IJQ-CҔվQghGfx#吔.%OIv-r>)03 2_FxiCƜxr[a.86<#?ɥ@/BT|cflsG& nEy]}+L޿<];݈u:"K6 +B20ו:I\qOWĞ_[~QR=M=[Pڋ~#%|U D (woGڍOu2f#:ܥCiS{n-Qj%AB͇qeZFe*e<ݧm._$ d,GNZ0-@O%Az"Ќ\8κEJDс0jq?z|JL>]8$?\+"݈NhSn4x{$T8j ]ɎbͮǾ>ͮˣ+oSѯڼkKe4/ K7/y-Gh=ձ5Lܠt6lOAf'ж3|ҴW&./eV JQ~7| endstream endobj 114 0 obj <> stream xn,1WLhCV@00`p&ܧubrwU̒xmlb?9Y۟_[`)ܤ`l/ĹrnD_/1릔d&l?ǯ_cq_TFŏ?OL;o4JK<|L?Ȇ.8fm8crBHuX'In]fzH,Ш"N# : EZ Ȍ,Hp D=ݩ#& } u;\A ΤByQg2ԓ:R,H;ӠHL=5H"zM\SzRwt L2rD ,sL r"oxLvOkdsWTE,|Eœ)GkX!_4d5x}kqL­i `Cx+bCIbgaW Zp[v%%LjLzJ|0GX]QPAeq"FҵI@;6 `Md+P>;oI Tԧ9ɢv' .z7P#jqqI x5"P dD"oVu = WBv0.GH/tj~ ˩_hwXtuJaoSP:, J|+) v5*;xRFL4^y0OQKrFEo#]˒شwMl)cCJ 1SZ'So; |`s1hИBҙhB/O1xF)]Y44>;M.ykJy08m%G%{W뻳Z5m 5%47P܏`?PD")KƑP)|_B⾛x#Pчe<}䌑KgIeHH*AѤIvN)wZ> YV#$ %v-^ _J |@ YZS𢪋=:YRAE/|I5Ї h}>AiI$Fz$&%=%XH90:kћFm֧ZmuGĹ l!|9)>5asے/T*ro"W4 A" $MCJ/_ZCw3<\T2މz)RJ}eNv˹*\ځR  q7rR x:sJOrK}MW9ce [IgZuH2]E][WٷV[A҆&},Cy,xy-d://sy(.:{8{gUU7 zCH^TvX{*MKU^ؗ!)Xk*P߹ugF{s[<"+LD0Q=&ѻ}a_;fn]i5QgskJԇXCʩV3*Ů'C0h#zx9}pKVU/4fz`y2z9I%+\dzEBPQb>H:2<ˏU#ޭt-'/SJ0`v" $7J<\9a6 \gwmFStT5&xđÝ=S^ӵfv勈%]t+3~YXIP& |:nL3N;ŸeSer;"L̑I|~ҝŧüa|~A20~9XZɝ,3޺|S5rMFZٴ #w~w0> ?B@;y=7R =";?ڟ|O'?ǚX,z6~uqr6 ؞[gKre0IEX|[ӦZ1aHILX.hrYʳG /t 9|Lbtc"4ẦQu > stream xZ;6 +T&)̥Hw.)dyUT e[{@#F4<ƶ76nϼU(řLsrn.k>yxTO{>)iq}G=GJ̙֩ ODH/YBш4=tIhS2 9-wq* s 3F!8Ӆ'h.!++I\5IQxU $hkX[| Lzf-M3mBTY~_\_撶qa9 z݌D$@7ga#e22gm{~xrJD@0Ӄ"F G#e0՝}?Qw _1-.rOٳ2I\ J%Ʀ qnSA J/pg&ښ l I.(,)S)z9|99견CwMz.ЂImOhќ-0L*DӀ'kգ𗴤31bܬJ?f%Fk? D,ӛ򬇵3u>л#A?<-Z-EqGpc~*wl^ڕ]9^M-R:QxUΣhFZ4fܤ '}F({4u k׏R/)nz􆵝(8>ݪ3b[?X+󬾻r6>`7oF[.ըq>\i':<ӭF-pEVj71MlrKO[UaaYU v:ڇWi&WzruTw(m;˾$%hLN!Jק eO5Ҕ%/ܴոWm^Oq endstream endobj 126 0 obj <> stream xZ;6+T^ +|S "!%)d]\r8|J^⠳3<9u٠&1,__~e}8Q1ё3!T\Nr&Z]/fҏD">ĩ3GF3YKg(XϠh[EpbVyag\-*@L 3eO2\Nrፈߌ}rhN5=5x#Dqbq;~$Y +izzx`/" 8p#"8raVh| K ^Q'Sՙ][cs7pK9Oȓx /M8UbDմ\Ι6lEL&/8q*M\s"4eg `8/$ڃ 2G5(,̨ gdnI^6tżsFfψX8| ,#Ub LokBYnN!@g.tŻG6)YG5T݌߰`@+cR4Uy*Zklp_ Q$O8$IV.pQ|" !1\EI PUg+<CeZ,ay)pVTfm90r:̘_)tj2%) =>|u t$#?Iמtt4R+Uړ T=Ԝ(4>NW( \ `CP'ZLLTQr;cR3CV')O!8mkBTOa/PY^k ҈P6H1H,27ꊖzMEoG̜M>1JH9r5L)Xȓ-|tOPHurjtgG$mS̓gh[Tkkhz Ψwa5Qwv0fZjh s뒷^?,z﷐CV38Tl' YN3= *8(uקu01]žz;:~džw^ye2ǪxJȵye}M滺Ԭ}focg蹽hGے7b{~܎7n> stream x[K6W"@z-l:5r/9H%[l (r̓ϓK+ʈJ>WV+[[T}4z˜hSgƤtw=jCBj}aݹ~>J Sq&j<0Zn"~> فZV_~qsWV)߭ `{8XcHtKv- ."8..u+H9*s&v~lF_ZX[Gؚs%[S@Tƣj8,y-$Bt"Mqz @t- wNPv<8G~E纩u]T^+D#YIԛG3a]\ءlIXI=f`L-8LTMY;u47PR+F&.N@/x`̀"a$@x0iG0~yitb.|נ`1^/&C=6ғ<=YVH< Gn[<]M,w>m("zLS6!{C,%4v ^T\\$O譼GMBnp,F_3=M3/dOю嶦u rF &c C?# 5>?"4#:5 щ $Ob谢+ ˕c1ԟ[.kZt֒Y/eF!uN]$aۺI+avbG1a:%LS\.s}[-*sE^ϭ25o/0.sю,^R(ֶ=^eMX^E~:ƽ50U){C釟ᾅ,&_lwaغ'kLEO綸hY_}iκeJ8eT#D96W.k=#rP(qwU?w}zN 0r^՚5 /J1JxJ%yRWJ1>\'DjUiDNFT*0W5P,떉FM.P`/߫h']Z]F:Tr){c| ԩ2sM6ac&#ʧh_r 0 0Sh,Z}0* endstream endobj 132 0 obj <> stream xڭW01[ ""k[VeQ, Ґy ޙ`~9}9$[N+Iaa8{>:}J*iɍ '93&(0㤄 +k9K\Η.X:wє$$w5|y6͸' mdAқq&Jd#u2<'ѯahC>ysň״ADXOrMG5*w8H,iaraG8PM;ެüɰ`v)/L ~LUrQtDZX谳)ǕWOfֆwn Jso<8fTTTl C<ָK]x0Н> stream xڭ;kȑWftlvu1pŇgq 2)QKJ;Գٔ4 2zuuuY,dnQo_E,3,liHҤqcW/_ǩ ݓ+YCP<[p[%0~5fa[b7SK-n[/'naлLÀ/z'9] `@b,]&?UfAj˴tgfPvtYG3-mYX2!"}3.?tqv2^݊f{{',teBU\0ܞϘlH̹ML&̤>e(D%^yްLd4ZfQl`NH9Og2d4p4Vؤ\%"X{>Q޵~%u,lM6 ͹\ܿL,ˉʉsSpp]l\JU:MS^7[tl&uQp(,r~|7,!!8-u@iE)F1Hթxf%?T~ 1(vw60e{Eu81dY,Z)^WNEgcom 64QSUǐ[mcCSÀqInv4CU5Æf C{Bf6Z7ݮ1vM_z0hvdH<\w {~0]*H:uu/@/j+8eAG76?f꣺RQ΅Wlk"%H~Ol-0l=ws`q{@nWGm0 b<{^PCb ER}W)H3aZlde:V>"q\JCC%9)%EF%d/XpJM';Ys3[]p0p݈}Iؓںa#㋈NYE @h[H;9s*G^aٷ.ks%4gj_Vڍv$F<{J8/'ws2dEL+R(g:nx8qɩF`Baa6㨿\Um';b^rM J2 k0!9bk@"b6ObMںy-c#RyjY3U+P56ߪka&Ю^{K00‡Ђg-:CW-98זM-œIX+[lx UQ$U50Ԛ&s^ )-Y)Nfq^Og$ H)He)D_QrV%T+4&Tob܄;fA xlS5 -C1;lshZ$&]zqZpO-Hl͈Qd4"Y Ɏ ܍?t #wf[QWab`lc|- i@mCYe@)̰fk[ VIph%~٠_q{̴N#da2?v ޔ{c/2-_sz_k,.{ĔOEQ$. FN6\ΪQD'7i}G{{*CRm  N,~S689Y_XnB{'u sXj)|g xXBl~5YÚ|Ӭ` ![ Ѝ!O`^* n\rX Ɇ3Q"X mٮ‰7ږoz3bqwXK oUq4-u+BBp{Vg ƣVc[H~ /~Bcs\$1aNy(~>>8ns|͖{Ha.x XH@XfI2z!kՙh:|Z~MBF V_|{2J,Qй&0n}mDN N66#2Qg}[g7h& yH 7jq74E%:rnDōM:]WrNe|"< V`^A텒 4ǻh%uH2.ީoc\_; o- 7|I z k}~xR$[*Y #E,7Ւ8Fg4p:f M:BY]b\ Pj#3IRBY#-Rk%=^―}%cW5{ >͍t7F~'d?h;L`9xeΒ)^Nι^j+-}u,+j^CF6 =_@Q6Xa9 {~}a `*Џ-Y?>?>jI W]Y#/|큏1zt#h?N؄7rЪ3Ka ԏ:Y'n*X#M׉[̴eSaL[ʷ$Z_h&G)2M\C$rh at/#L=JVBI%<B oZF~%#}:oASpx%O֬rblOռdp:mM8 gm,#>ܣj45u;,u5 /^SϟJJ̬WGꏓU4ѿ7glMO'xגoȁ@-BbVWyxQI<'5<0 Oq#*$.Bp`F7kP5eb6uB ]YP<"]js֫e͌`]E >\dc wU;t! endstream endobj 139 0 obj <> stream xڍZ[oF~_!,wRE'q6M宭 @#iPTy6ál#Erg|3Y0`4gvpZhAga ٶ/$|_lJMqL2 ½;K/v&Ԧ7[>4Ue2KW. Wz?_DqGōU5K=]瑱Tyxnoo~n[/~WB=碕fu/SV?n+Jd<;Q)7v폅&ky򆮟8GaVlHM(py*$Vޮ92*E(z+^H0kHе*“n!sGa5 Ք<`n:9}rZecy3|@-2"_]!E1O01C|+Utlj%)7UՠRX^{ EF젾7;;GF]}뮖|d)GqX! " [L'"ڝ}Ӟxiy,xS$ }%gSՠvp?HmZ:hx!ΛVmtG<W/ \'I@$#/OGժxjy F 4'\8,qRAEU}gt~,5i5‘W¢`gJ5YTH}ZC_?t#`c'vRe)(4>u@ |Ot)ʒ7ȒɩjY3c|ب_ ]DS:<b#`o-߲Tu9x%2yذ9@k6+N 4|.( hkX;QpEf:NDM9a?G.!~`8$X+cZ^cLkHk:O S N0t tʷLZc&|b)%V =]-q [IF1LCwprEv&-ggVG(u$GBE t2/"'ul8f-"98H:!Tqtϙ?bqhuJT tt A)a0t(JϪZq-';{&Yg,&|G嵬=N11c[neۧ,1Nuqؤ> x$iޒq0~8&_Nw'kQ(_[-yyB\ Ja~QLBPhl"?cea\E'v8H.EC."j!twPއ"iF[„6NLB[L rL!F>x+5\L% ͇{YCoWILw~vXo߭7fnPo?b栓7+{P=j 2{d5nr}@Zt͒WX)X5=4 X KPל銌\,&g xq`M ] T*RꩨCm,DfI4.9sœkҍo<'T'#{^rw hJdQ~#7y]؝\/ݵDPz+nxK7RpEr磦tՙ!s )>}凑dTZaq$Σ%c]rhs#dn$ǹha#$R az'3 +|0˷P38Rj!)g^8΄P]̓.,?7}5CE(]F{]bmF b(_M|> stream xڭ$-Wth#`v0ӻyG#*J%3CjYIQ|qOܜYo߾w{ ,XuqS0nR0an߾sεL<<~% ?--&n>? ǂvfϛ?oS(2+- Hӟ 1Q dzE Kxn&+2]7: ѯ3&vtL5>ti}+ "/oF&"dus ȤHYK8CQpS+!wŻ)}gQ2HVniEwH;IP7ݥG{Wy+:wn#biW{ˈe2" D71pPL=n;g w 4#yWyqd6 RkC>fq u!BNV@UY7DPE 35 TRD\ĐD[@Z gH(\`ΚL!kZ2Q,p3h Evs6vV᧢rK/C Ŏ$d+;4(?W䅆!8sfuexAW&c-ݬJ[~CYT+:S't``vz~S^q+!ʀ| DBɝZk1vK#H<G 5{H@aL`O/8.ס3c'tn/&wtL^Z{ZX"?)ۤsviUC+=g^H~1c.ff@$ CF$>E1( Ǜ0o$I׌{hQ.tSIpjeFm.R E`c}= >U6vhwvq{ޡ~jE.~etLAA#DA󋙂Z 5oSyؚ`ơdΞM,hi\"{A\JE05x ޺N0cH.yogukC!:1ik2ܮX<ۇ[K`Z_3X5{;'Yֵ i6 ubsyD7C8wȯ܂T{OvٖYsoKh΂W)Ӳǽjp0UՋwߕYS;d}P+lKBQS)ߝd,٥ 8Bb94bS"y&`Jg4dܑN3ɏp2*g +M2ꨑǠ7$6,-DksZz : ι(1r㕘ҳviqNG"yz*ȁwM{4HQ앱!(4][/mu<$OIRq bbVkNm,TN?|EFr V% ~T܂uw~[66=.mnGg[?ܔSqmvV+E뢸pfR|)4+H _o>S30ɞ&,TjA"+'*4Tm2-/U!t5yGu,%bG*e,^|Pjfɨ5UqTY:*qg;j<|_X: ǂ@$,-J,|zcg D|WѻrV8niWKF+'Tu!g)BՉklǭRr")i7 xV/f 661԰=+Gvnsg2oŔgfCfӋy ;TGs%;$Ej יZ3uph8 قR4qbs7bưݤ<:"q$>f9& N6fG#U@dх!Y= qHQ4ڢˌҙ8Bں j LvZqk/4^q,2V /4xhsZjyB>}o}jl kMoU!+{b1d9G[a CwVtSk(?{* җ AHz^.HzkRiNB$Wk!%-n,|5b;6q;-j/Ȓbt:۵1.)8_|.Z7H9$l,|aX(\~w&-_@']04{2k ^ڬkmخ:Ыwc endstream endobj 252 0 obj <> stream xڝV0 "'d(.萸;ܩ_aY~A8c*-T F U}F*BtuBFZu5t]N>k_M blAk++}>p ormN7CXB4y0.PHD,iY&#|P8ryN$tc]!~Ib c+k0vBfGY .'f:a,ppJ{[_tKs0X7 rBEJϺPXapLQCNrvL(QE1c;nUqXºHM+/ƌ'0bh`YZy[Q6S[6ЊeaG-CkUœ'=4%juߗqj"K_)8.gYN>U>xadrي؃ M_MT_I n5k[KŞhZDUh!ec3 [Ȓd+ op]z6<).-:)ImKQ~ʁ'DObQj*CVW?+;dvYڤOQ6_+%F^cVh$Q9Q-mxMݱ됶SR%\8&[*[%(h|2:[؞wk>H'L%525 mrve]ۓҽU+3Pm=Ez6Bq1VUh'f#HIg~ #ùf2e6 ,wmD=6l/i2Z4TB{v v6jtcv-aKfj]&Yo3}{\< endstream endobj 11 0 obj <> stream x\ݎ&S%sqUe[BH! E"q1*a-)ySu엁Mi喼Et,آelԥ䲈/5EKe,=7< ^04󊱂gC:6 5^wY 5/Khw_ Kq ֖2q5/jWPݖ h/F_*y`Xe1YS.Vo*&hsł+Ɣyņ0Ռ($xSSK2K\Z5]b)f Zc|1:^Ib, X" ,Ѱ%bb R;&;0n4 ^znd*% dW"0lrÄ% B`B 9$j@.w<i iKR"t ܂4&,XX Ӏ0Bp@u OBr7_%R8)#24S 4*3 3%dW0Sɉ n 6DBVf X$P!iA;yx' ; <\Z]»Pἄ|bD, ȁ!|Qp|r/ wj~&!J'#S  >e992}P*{t_ ߛ(X BpF>QxmSqB+DJp')-ńH$JiJV -^(|KCB95Fi{Bpև3vG((4A&TBQa(ON{F*>D5Ґ(GiS +ѩX=i~P[Jc})vJmiKiK܅%AEnf:(Ѵ*eg%9wrDnQ{9֪ޔ#(o]\F}|f %fW+5O6CebRxufДҭ@<ᇷW?}n?jǯ^?}"}t/=|]MR%9'i)9=AM\m ftM-+!&t$\Lv`Z 'L z R< ,AΈOb5jz,0'A5F;&cu+R}'?rBhu]C'E|/#y.m̉7x_=/>|a|^>zdw#4bk h'8D'(Ӝ9ZLx$;*r8ĹZʣ=QV[(lH ?XcC5Egb0Dی&{لlHUMra?%nS^2t Qͺ Pdtb^P;utrc_J`Ghߓa@?o{crKOlaث¦90-&0$C`rhqQ84Q B9sf'u  2h!l5CtV0{8ρ96++YsEzӽY6_PpzS 5GLtnΓzn NtDL1%I(GDKI oݴ>Y41d݈3ƦP|ym+&F-!/mm+2f xYx̆&5i߾<#G"6laEr&-БE)nr=DA~2rꧣ=ԆeF~֑B[г39]R̨E&`2cӊ xj-wPҧZ4~RAy~@0˱ƦG+Ӝ#<8kj%?:jw> &;!p6-VfU I~PcNcVfux!eu~-vNzj%k+LhQ&i=dWX``"s`X06bg9D;A&g{uڼ6`XFgy1:(o8Xش @G|uv_MbMW~aCufyy#)RaQzS9r[x_?mt} ~A ~"!>_;Za^ILkecgoO׊rXxe8z 1>d1(#ln35NW}~C1M'a.s| ҼdG`Pa HJcc g@zcqlQ\[Q[Y>mF>6dG(h>EB]}xֹè9ӟ4yD2Dâ 85/I=8Ȓ2-ۜ bUZR~೅:QGHLh0`6Sy}?~A@n:Rk@\=/ᐶᘾ ?Vp!c01c M1Dq֟/_fx$>m^rmO!zcpF[~j 1:[z&ooxb=n/z|o 6$gl.[O,7Fjunk7 endstream endobj 375 0 obj <> stream x]Pn0 +|l5U Bjim*BbhD&Ѓ-=ϼN/YYNE8ډ$B6,݃үUr*ܷR^Gq}M~Ihf_Tϣǡ2,c=Ͱ9(6`?as/ԓs8> stream xڵytWٚSfL 5!M/r+M+ecla`j`iBK`KXFy'ͷwtΜ#ͻwJDYXP"z%+6_j i8_LJP$ !pbaP%#O 1?5??"S"'q)&NP% :nҬY3>}cc 9{ b3U tɶm(?y!7>\aC>4n>AmcFHc7Ƌ"gQ#,$l=e@&SR텽L@ў]58쌑zפExfldUzs2Zג#r%*ҽ \Ini=i%WU;%Dӿ7]'[aޘ(ȔbF QdmcgoL KmhD)H$y*Wuqe*ߊ}M&#aotJ+w8?(F$%"4ڀ0he8.^&>-6-Ml-{~͜2223?l1 5^VbB^pfw^Ypxv`ld#Q#6,v[Lr63R!)LWrjXex,EefC%yv1hC-:SPUZ *ۈ,e. L0}muX_b2Ųx`3 amvLz6dǥa[dPK$w=99) RhPqra#r_\4D󐐤N{`#8 r<ScõZ네LhǥKT# PO@ÜoAv"lU=nGł+͢r(HE$9P!>QT<"$Q\^e ;Γ$Iv -JLT {΃ۨ|b Gc)3ټz~=9)t>WV`Dcq; */R~fz]#.8oZ[x ab`{85Ӏo=mIL,>~IPj<WN=&-m^ig=q #z?ENJ,Lg60O^ ̅?7|sEGp$df 8FBe;iڟVALT> qp/PZ / S~)7a ={Òu뽼]`@e-EF΢ h.JUe@m'K\3(9BIwJďYy/!(٭Ձ2Y>uHepV}12Ʋ*Mb`HTKRYbVj$rZC9蔘 eU&VW H[KLJZ>L :].ZWW\?Ҙو5>z!:14#]y(DȎ"JQb(5Ik.cZG.YimU0ل(1^ŦmIfnZ?Wx #0=ב%4nopۚVWVWP* H7VT`N4 &y7Sׄ*iJvr? )t^zx@[g?#`ǦuG9h?r-M#ηRހ\ںmhi9X+i|:|_-d3%e2&y;k8|Ifbbl7X!0e-0\/Ĕ˓q^cBz0 S) (RJ j< &&#zd\h |Wdq4 >1w m7H0Yrzƭ%bѸ?j4߃ U4iiҎ3ھmrXՊfHjFK[DfkAL{^RfDMQ5aKҠ[G>xlѐc*MdFQW+}gϋ6QѦ=MB5ɘ16w7͜<1,$OhiIswl1U#xἘz k =Wo/Pm4E^tAnafY+mJsw3rxp+UQIۚwDlcaRձ;DPfG8 T:iE)e%ܾu!pӻ;ۤB6:>u܎ [B-z*鮀w 9zZƆMϙGl# Y7Ifʄ`_@:P[Y/H^Ȉ'zQ[onh xA}e@srg}2^Ma6eSC0duePT)(߽rL|jF.ToQ9t쯺'[ݶr4)*P={c, rkHj544h!YQ< (ɹI՚j9Mgץs.o=/6Pm&+`k0 v72Zoo :/=)fD]^l^z(#`aSz:xrX׳}4E}Cl}kEpK} nIa+lU;oW|&+dDc ZNQ+i2d[tJB}3I-}>]\ZJ3c lͱ3_sOSc)vSJ@;Ѥ#& X?lM `c@܏hm |B$Fm B=oߺs_l^ǑӞvJ\l*weTQyi~MO6n3lh{yqcEQJX#%5Zel|_{^7XhnJy,n$,eƃ煰+mrݧAg@QIqArAG}CcxM`{t9˳KC b?t{V=h&S6]m7wF<h'fOp-|mU>p[ Nno‚}|=ey[s'wԓy<^ G34mOG0DH?zyf]hԐUEbK RRς4۲:( DS]t퐭B iJtjlArFJyeZgYZ?wzmdRLJM:RmK+ DL-]ؕUfxʡk?Q(+>tWz>:_;MP YǯIB3O'd5IS#c '"f'CBX..\t댌fb|0^:CM!M> stream xcd`aa`ddssv44dgi2?d~1g{I |"_ Hu (!QVm``g``_PYQ`hii`d``ZXX('gT*hdX뗗%i(gd(((%*@ܮs JKR|SRb:EG_~er@tE⼼⼼+V,^Btif|];q|I<\=<ܫ.s/c endstream endobj 380 0 obj <> stream x]Pj0+渥ch{(v[cLFIDCf&=ޛjهcAq=ڐ2SrdEWםϏՅ5+(vmuۚs5 8M+ڌp*6|q'4()$U8;! 3")(-hQ#|ِUױux"*Ĭr~E#fκJ[o endstream endobj 382 0 obj <> stream x-O]OQnRX1W")K1!>4H-bb$$nB,4MDͶ|JЀ«O#6ɜ393 E xF }W'݉?O+;.~8lXc/hDzuUt^nSp1 6?Ee!$qA*NI2R5|JɘيC<߅%Uݦd *,i)Ӵ{mmd2(g:ҊiVR(~$4<"%|f*xV&xXJjκPGv 1E)UN;3={p)ڪwdצa:uà|5G#o|?m-o/2YnuP8Adkk5s3_z&s'4#qy*/ɔUn1V<ddDa%iK42! C`^I 0 PC{s9v> 7t7to'~*"-2-,ޙV1@VJG+ӭz4L>#׋5l.warVUkp:8Z 9 endstream endobj 384 0 obj <> stream xڕXXT׶>"r 3K. "1"\ X M0"̬&EP"`JQG@Q5ƒ41177댛|}rgʿ/$5#Hzϟ3e%&,$Cll͙6`F"ZT|z(HO>睾hg%ncM7wq3$DGkG)ޘ4U1}bzLXBڐXo*",&DEXPƭ SmQ8RO;6))-$&-.!|(WER*B),T1'.V StQ Kg\7ƝL|%!\Mt 5;a10f83ɼqfF11tX MfDI+0Ep:zJl)&i#P%gdeC^R\VwĄn({o񭡇C#CC#[Z7iF# ʱRO*F"RJҿ|/U(jrĪ]Ip >/n-f8o-S&7̆m$8T\k\űGIśi2fmٔ*PfS:M2ddkM GZu кR;RcԕwEr;` Nii4-I\:< SYy"Z1 5Tw=rʢ/'7k!hYD(PӟNx^v(lP: B{2&gNT 9jC e^0bIQpy|uCŹ>M=طe82U *r\ &{-%'SJ$+xdm7V]ݮW_zG\0sp p.."1IԀ [`n!)o=j/pT{j'VÙ ,~S7c X2m+.g9i&)z2.RCd)Z7/55 KuzN $@ o})`+=*Q_#aN]"ɾׯh d@=@Nf hRijMΒZl?5T2\u#7ڏP>%.5OM>p}y55 YRb LH* mL9 (ѦQyFb:ӼEdu֎g m"C6|a.,4p=Y!Ϗz쁯JşO*Ćmu) dQ[Z&#k).J)+}{؃BjIIJA%'XJȏip࿞HQ gq]Әd@TwOmhL|gH2o.aTaE/>-PӖvI\hW?sJm~,pjub  xkd\ YO]ФID[K^hm,d\c ܷ]牫9ԤklnnVtce3U7OQ9̹!5'>c [%Τw4]SbظU%&՘duQslG):K&]NdI3m]T2kQҵLZ⤎~]杪0t%u@\]Jbw^xv底&qX\,Uʁ;fOYn?LB-4 .dqE_Өm',f$NKfV&VB¯ Ӣ_6@<?S{HL5t^Fm4(iKEG[/}BWpDcTgRjrzsy;&2r98Ucp[?KlO9Y kıZY)×8h\ dEƈ^{v աmL..B뛓l9tyʺ@~脽JfȽA2+w_;?_ }h"X/ ~uͧ%]bQQNAE쎔谩<7K~A9rF4ȭiklky@Dp#w68]Ts65}XbjJ=^oE;j$q$}䗡 f1(.ȄF%]7yUԲ3,BU}pk8͡ݣyFIT,P Pfpۢ3 ݾo+bGz'ָL~_8vr!]̭ݩ0& m5FZטvTҟ"ӯW}8p E'*Md?dA49YqQo\:pD. N5>, LVq2(0{b=>ArYza򡸠#uZO=HJ$ D7ln6Sr=JZ͋K[^>w5Ѝ7 [ov_ { R!SP'Ǐ=BOfc(dii%d>RlgChb5qUS ٔRU͎l{zK"/TtO7J-DĽo .2jY]E@!pvR$3K8;& ӣN8] y"u{r#-Oxln{OAdh$GtGwTHS< Ɉ%펔(_#3e6\uJ_z@8g| PTa;l溶V/=:]Yik-g!&ϤUP>9ЍޞF`C,[÷͏jS! mjo<<+̄x_NV22#b%bYrޒI9QjؚѦfX95!^~4>0:s10t}{mT0W8LVV\nQ[E|CG2t1jKAgz UڀaEn>)_S\:z&V)눽/IQcUODL|kjnŷuw[BO0;'d{Rm{fCyh[nK8n# n/rc!J)&I=WEL-Ճ8GK9.&Tc)`&k9ysH+%%252Gǽ;kJ{[8 endstream endobj 389 0 obj <> stream x]Oo@|=ڤ]YB" jSKS}aM# $a޼2V%l4>TWYJ]T FfUSYEoX{ol쎹YwRf?%/u97Tk̞9K렡dݱ 0>GA+[OSm*P]{$IܣK{J܇YE"EDSdaӈ4OiC$tܷ(5@1\/6kw0 endstream endobj 390 0 obj <> stream x]Mo0 ;iׄJX%Ѯg c! మ*Xk;=h4UWI݈JA rs#)D-B:-hx=f혻u't]|9~Һ~_ j_$6q^C#Q}BV2T FߛLJq&ѓR@ B1meWA/T!DhkQgVu˯Batb)e[Zv 4%^0̷%eR`MH̭3tŸ cbR֖KRh)=WcUf 堔 xE#M _0m endstream endobj 391 0 obj <> stream x]Mo0 ;iѯ !(hsLTB¡~j*R*i.jMO4jQ*^q gr=R\Odar&w$)ߥSaWН/ Pue]kuJ)]*lpI yZ: M.E5uZlSgxc{UŅ̎Ia"E/P+L;N2 XF$̆/@O+:W) ٔzI4"m< )5o y CoO ׆污 kgR}=EYLF' Wj3qZVU  endstream endobj 392 0 obj <> stream x]Mo0 ;i>MVvz`:6"1~Nl s޵*s0ndWW];å+XՔf"|mYN-]s7)k%Mo]|^B[%Ջ13>6n*I|uYzm&kŢbzFlY3<@7f$H~hAƭ8r.-U}W y+|F_p2 endstream endobj 395 0 obj <> stream x} @TU9{Ν3 "PP| >,FfLb@Es\5˲R̔-su ^eetrnw+;ss=;7c!2删i%_;5bacF"R+:t|\'-h|e̪_lzχU c{D\ iX=>vn@hrok㍏ @hYBPkq]VkԺj GN1hچ.vERMнނzDkneq!uoB> ǰTn0a= ~5Υh.u v*>-Gm]r#W~"Zqu{]#V&:/;ѧ|n.~R{劁JJHMJ0Oc$>2!/FaB{Ҋ$F8\;4pGGx*3kj݊s:Q Qb%w;Q?$KŢSvݦ&ŢY|P[M|RW{E]yPýY0Wpg覻$+(߭TT)wYJu3 LCj+_)l ֡H X9 {OLg1kCsϝe {B21ܣ3 hp 4BCm 72<[n9;,c^R0ڄ6J- zd5&c5LF8Eh:>Б9Z?62tl$dG~Ĵx8Vzc͙Fd\b]\YY*m?ld/-sw9h6c=,+sp=9NL6=t4 Ya4%T ӏݼ@];GUspx纪+jUF<>}+F2_ur뺾,;\cUzb}LV]6ߗ~wV6M:Dl" ͖'-Ձ/(;sD kPXv[x.{m8t+Vl(>Q;uJ< ml8g`C%974+sa6ڶr vZQv 8Ĝ"gӊxG萌;tK? 35oMg[.nH׻;|׻;`'[vl݇6sn0׋mŵR¢C!#X=N/P3|0pnO;y\6tIvݱ8ił$g)À8[!1Wn:4uOJzu?nپη==I 2:ŁMĄ1"bе ܮFEod>aFJ1Og(tә6ѾI:Ȁ UE. Ã< Åxqičx YM L='YV0a/rXV{&!9ҙCm2< zOd?iW<'YeRm;9 R'lьv™t2^:Pz[,] 占 ْ^SV9yw> x:ip !\.D ABT"CA|fY\qm_[,wrˍrV>\c\$$r3\cnoc+:?7p r? KȊ4ΙZd}v"?g5H\hDaBDtExpJ3C>M]Ȍ=! @yMEIa>'xc |Ls:P8h8S&6 jL}S>S0^g8C jZ p?SqvuV槨 twZR ,`D#HYrnye34Z7HPHc;]'vvOzOKfe Fb :M2+:qgp 4ҩ ! .G~im,C~K,y`LգHbȇ/5n|X[=~CۻKp M;ߨ$hF3ަ:R 4nE \v2/3$ 21BXfQ xJ6s)z=(8 ވEo`)Cp EBN*:@xpr8JVAtVQ5r%#=̋ȠImp99I:9 JùaPi/s"awN=,E"txJ]?2P, l]18<):uN\RW t:n^qnqyD|D\yM;[ݟȧ _ _snEsnFx`+Dʢ^-ye5[)42%dEN}H,yM`oqx ! #z9XubNz>WqDKY毓&{RӸ} :3 BC]*Yj6nI^ݡC 㱁(SI4P?!32G_(5_BE(eh(NC2܌6V :%B\'m!&gJsi+dX@,*XEt~Щ-v]L⨋pf F&rt\n9^tH13,у&q%Klĭ \ [փٮ8/ā?x<ņZ<="$D8,zt2XNW0y}ՋQxz7 SvcOđ8 OܦޠnQ7mx.ņP4 6,q<c4<5/ԝGcf3ʼnx i?׫lt:qbxA}KHW={k?6?̆\ȢD<y Eoo1nX!·9"F>!wbgm$OMZҙ%X@ v.I( 'qH8@7@Wba\>窄FQXzxAA]&4L+4f'guG4ￅsEaHͭs~_uYbJ(G2sș \l\t2+bxF7k-hC$ceC\%DE" -=:IK1,gI=$׻ͺw]R 2-h9]!OǴ6?+3{h~A=5/˗MK?z ¶׆[1HU^?-ߐ|yOAthdʚtBw ΓL23r@e, I[(s"},zNUC'{Kי]g ȟ?&0Y5L$6)ZQ(IoL) ]5PWj8`y9_:~68FHϒ;oTW@~/<-:x\gMYM u\$Q 2 & gM'ԇٹH>R\ "$4ÏQ aXf\5_-,A !o⛄Fq ( @B8o ?xtiKȐG3(OX!BʕS?^jtYEcG\\\,וKn[vr"Aht:il^ŭ&wk g7ШDEDlj߆P1};Q!^B31r,;Oذ9ПaNک\\EN;TYTces\p%srN)]]/\/ys9K$qB)Ù,&uV l?w= Y&s8%jbKᗂgrD!\oFOf*ntGbum~&d#=oDni:ѪֵiPqfdfe( c1XgSq;bb⊔1cWǭVVǯL/-lrl`i`Q`Ayly\R_[W/]\YoDX\[i}x q/~އ:]0ӍJ=/?gʥs}L}gG_x|wZNʫmh4A:!~!Q#6Q"Yҷŋo/}vTG~ԩ.%.[/ @h3 wU;+N6hσڢ;cDYG%^-NɩG~?+zpsCG>qȉw JdxCƯdwZs; V!/33u1cI^ c#y}Գ.ٮC;{dwWw]xU"/r^7J?Vx /@t:ssͭ-9Nڹan⡡Cw J# 'qnܻk /ס-XQzBīFx@BuH$SaFlFl=Nmfcs𠍙4= [dXw:m1XKyq__w޽PQUźtu?Iyg h d-mUhXG؞|@Bd̀$'6bTկOj  Z1hAXQɻ~Uȣlx -yS_{Gwn3YH4&g^x醊 ;)w3#bjݸQ#*19 x[m{;X(Ѫ ,+EZY+sۺnlⶮբkjCM/EYtģNz9]:}Yvh|6iOorZ1PlP~bɫ,z3R̥Dh-JVag@d@`XEʍkJtFNSa5ou_ ,I+p}wpIrPh'u=%v_sh#Gi2uY82DWŀ&M/1:quBڣDXt"IbU )?:$"1'ϱ"UghFu_t[?zš)JJw8曧ơO7oi#X|iHuΨ@|j7/1&(+[N (^Qny0܈@ѵKwρ YQ.B^o5v,Bzo?Ħo`[TjZY8WidzŮ= A`y!8%SsuX]sb o_XӏI=(ɬ y)^G&%SQ-Gi4S hhAA KQR'WVWle@D$XH$Q$'M99ey})m)gSA|x1}]h#AGF58g@K:!ʁح0SeL? 2 +xK`c&a (H_LU@ ĀѱKtT%.e#y<@F͒+x P !?o7'gumrLxlICiH!$ bGPe Hdpʨred0C,͐f E&i1n6=7tM4}`hJ_s?[KQ,<ISnM٦y\h-ϗW֛l2$ fCH8vp"vi IF!*"HIrCciyPb2300HȐ krb'$N\}A>33 e!EJ\UrRiyqt~aqiyMCCqyS66'Cv[izY ff,fLu̙L˙LغwdR'}@s;ag~X c>@=㡁*F:]@iGRX$&S"{U(6 =jsÞ5oԣ؞Q2~1-꾨QVeO0}g::>sPv}(]BU1Cq7 ⷝLp=jL}כ^v?=6ZDH m^S@rsw= p^«^<{j{ M",Co 'oBoYpͣ70o,o`N'|NA>]upώV'.C{(Lݧ ZzOv?_n[V(ύu6F}c6?$$ gZn4>G1ET[[[[[[[[[[[[[[[[[[[[vWlllllllllllllllo4aJd=C v<x?sfn(ERIQ{:ۧo Na[&(.a$JJ7ߖ 7Bo7یM#LΘL ?1Z{lBv8ۃ=؃=؃=؃=؃=؃=؃=؃=؃=؃=؃~4 ```````/찧 v ,!\|H|]3Acd'c+ vOYn)]uZ ;-ÚZMpox͇u3P#̨.VE @:3V<{aw{[T_=AXdfdd)s_CUV)9 (tO)< =4RšyJ* {f4*Uy(յJ][㪮Xmmq.r/^-l73q<2fϳz_VL @WګAd׸Z`Qp17Ftn?# z$a֠Qn1mTzyj=8 @Q0y"K5? iWq铙T0( I?0Z෤8@ſW~cO:f5nء`f40] OSmkvH[s`ȠhqU)C]L{4 q)| s1}s s)?[_ غxs[:Ϻ_Ȁ\=<~?aTvZĨr W t_BghK4rI| Fd!</1-R?S]~inNMDyli>̈́<=+{ qd\\rYoOnL;u\}Yd{uZj'><+q3w]WPe':]q?35K.9 _rꑁrEhRЛLuT50'pe=<n5HG(QUXF܃Z2W׿C׬Arz/W)zA}3^8.;g| *,򿭮\VWu^u%=+}"쿯$֕+֕q]Iz$뺒O+W+]-^ϵL?$_R]R%kvIf:T*|IITXeReU&[TZIf<P'1l5n]H]#ڑoW)ڑ-jGʿvW(W|PQI{U|#|]ᇨ4\٫ }UBZjnݿS<egwQJ ~ؖLXTWSk RYQr= ? ~Hר6ܳ OKP5oE ފOmSY4Bd oe"`B äSWu7Vxw5V=Cq,H1W,htSLU7TyjFtz)9JR-3U#W|̮T_5EQF7F@.[@PX_ zBWyS_zW]F ֺ)Q\ \s =MJPm1T*u==S|U ? W:JsE:O 6JӐՕT\ @`@]n7\c5PW=ոU/Ӎ_ZUɛUTWR"O+V M)ȃ{L_P8AɅuJ)S Jh4 WojNTM6% J dbΔ)JnAiIiq^T:rgBᴩyrsJ *y@JN< 7 eܔ9(9M4vt¼)JIQ޸:>+e3) q K7`^`Ty<fB )V\ڍ̂T%J$xK9-it'^_*#zrYty9S` En}v-5P|g*Z O!%,u4i8N\/s4^裮[/{3YTc!ƫʷH|O|o,;ㄦ!0ɒ9 >ҾϿLgu[jgn^~a[ӫY-NK{o9۹΋TrNJ"_f/Zo*9D>7I/wQəVY+9}<|:)R'%ǭ$LJ'* l0ȱc D 7Q*J~wTr}8Vx[%c[M*M^ #UJ~WTJ^Rɋ*yA%TJ[IǪ$C%=/}s'-> stream xc 0 FAGz endstream endobj 399 0 obj <> stream x |0~Μ;wns$7;Knb"K,7d@Pˢ ERKDڨu]/- s͂2ɜ9sg󜹈0BȄ rWd>@pVխ% W~/q[zS>a : '7@)p)ܧ6vcSܭPބH]"vBZkַ3<jZw%{6#c'nA{pղk8oMh7)XXP&+/i[35GvI5KC#u+j⫡d2q`~_%.`:k01t#[΃abc|q &T O7Tgrl)',4c ʖG-mKJڋL|Wfdx߸pR޸ƅ=ɞdO@'@'Z?C&Qn7p‚-X HΪ\υ1~TP96ЋO?C۶=Њu8imR7_S0&6v\,bd\c5E[7s/DvOv.#C/{ھK~Pۄo_+mMjzP}X`H ڐH:$,yddYyczPᚃI${=)?Nq ~xu:|QZy9_GF #/@DX/8 (-)Fg[d{+EmMߖ1㷹\'CyCпyғ2OL:tHf홀IԞL~r^2$`Ji锂 SKKN)]D@Wfq'@ sË8sl/QsY2)›oe`=&E)A' aG:.`3|(C_\I˥LIf ˥8 =z +Ÿ WJ\V܆#ڠUU.E0h}pJBa1X04q'D;8B~{IT?v ʥT0 j2uYP#?Ζe~%1>Wj}P"$D̫?-waw\ܫNRsZL2͂/,4Z]k0Ze;Lʥ~E{eFO. 'h*MbW[-Hy 'xο>=%ـ 4|cv.=p#~iߖs_{=u/<;i>k) D)>rD[f Iz?AOɔQ3]2rp àhLZM)&`OJNϰ%@dy"*J۷ɱ^U?T?u[#>tߪپK/Ƕ?:7's=U;vndt&н q!IpHEX6N+wH8#o@v CƂZ ;oL B%F9-aiD} ,rȊɊ&+᩸Í'sST?Ƴp'V1_||؃o; wMydu Xqa0Fk1D$22pJJ QAtAf&J팹}Ozq VJ`@;O=M,&o {N/|ь`rj p-<1:'52$ds I 襨:.H#JY2ّ'Oç;?{9D̻6nعsƻZV?տ~;~8䓇dvy9k~?=7~rq*KĂ, "?L-oF|a aKv C`v FM D%D>QHLHLL'&%&: ]nJl)AΑ*E>S  RFN~Wh/@z-xZ=}w߽]ݮ>W> 4>?΁1?&&=OADT0 3Q(P .#o.:u‚,\X0u 8.ZEa.#AFT3Mp7D;,@ˤxd\1cͤS3l񦩋J@MԃbDxdwj 0pAQFi-(J,E҂^[olL(m84c:/PhFqq n+K^9X5M 6ڬ_r(595g8#=3v9x8kR_29|DYA!ނV+nR_&OmoQ/~w6ݶuۖxًou Kg==wviys^V~@#/WnݝRP?\n…+Wnݰ)\G~zI=GM_9ȡ\b1@axլs ^6Qhbp̜E1EAHV&vf")'Ś~7 ʛ+ɢV,Ț`lV/7$I^@'KH?ĥ ]p˟7 ͗hjS,#FB[;JEE1"։"ҭEqLB,8ޚqJJJ{>FE.@z!CiIHʏ@=%?id/'~)MGTuoOA}o~wnI@Ϝ#G~S':/|m(m!WT'm Ji #sN*DL*TX/v͗A OEY82K=w5^\ҋ]֤ܟ?yC58$,۾,T{UO>H%FW71k#Z(*b V$Gɨٌ9A)ǻػ{iy~f3St"jwଦ?T,#]9W`APitSת_U]@5,o&Xv}6(m!G[L۬Fe(!۹aVA&0:ЯW+9'sb54ؙu T/wzOTs'͍!sK6ڬ(` ! ŋ`\ <7 3 p ˭A\%b\hs|]Չo5՛HE< i?ǿO@@[N {# )zYUUlPx!>U}e[!wԓlԩ-ZWZ44 4C[$I$$bjcvAeN}TÚ 21QZ]d: -g!^HI2c)=M gN\>M<8͟&vFi/w 5)Alky$ !T! FE KRmilnt::mSJZŽ scm1:nws6dNeM_`VL}r0vxэzx"ǃZ]KY=Y:,]?pkNg];wgQ1x|p+389dSl.bt۵ȭH[eaP뱃"b"RF;0Ke4~>\.^n5?%|yTg75C<[WQ @mfC[L:X$#-2CiǧW%G'kLcoX{qqy|o\Ɂ+̴<=mP)7xI=>>oA͸uj憎i,EI(⾃5^Yk=u* ϹŜ~8'FCz߀gOzZd gi6Rю<,Q!<dG?.b#q-|fcSMFoA~AX:lw gϲQ]y 욚j9 h[ LDlU,  ɛ<hv{6xۻ`/=w+բ&]7 d?ݵS|}g^GOÕvoorC XR-ڂifCI[=>El\MIuTփC`Fz>;ǭ|] xw>x zY}߄wN iA{<W8Ê !tEa,V),n  hkY2tT &J^ FYeԣ(Pc2lF'϶0Q,_dt-+Hf,@9p+V,XrNV_d5ND,䢩 I6j[6iQbYA3f;+!ߵpID.䳦qTLn)ߺTl]}Tim5#(IIauXerc,tӹtɧB]O&7O\"|iyeuZr7R%+lUUUUUza.LB^Z-6՛C6ؚ&{$kncV63wYzlWI' H%f=SQ{璞Spx9.x?qY=?Y%fǨ_ !gP(Aǭq͸ ++0Sr[EcL\^ƐX7KXI"MW/?Nyѵµ~ O$QHʏc0. W$dzܙhfMwO滋*wj!w="IDyoacAk5{,6{^'"![[3miJ=56՗?MS)>]f\Rd(,%%WppXa2U+,+l+\7yŅQ I6l 4Z{+VDŽcþp\uzԋ{^k כ֛{,l :778687zݞ}q Dؓr4㎪:@vԅ>%gGÃ}'̓ Nnws ˝g6ivG W˙Y̜)9$ɰĔL#'#'I6nZ pWfi9du,ER%4;]hS[ivҵܟϙ(Od^^OFQ2X|Ϩq13Mf"Mg 3֙JTbVWXM 戹T{֊k[x2b~qFM|w3M\,!P<|~SN~`v\))f{q3 {w9ͽV.V@I- e_gB{>Ͼx^Xڵ4'LLX?wY|;K~{Ɯ=변Cy' NIѭ|Mt]OQxv_~K7r6u/~ן.};3=->>e_`Z`wp1~+%kPڸ3;gd|CMγThAΉ) 1SXCAt]8D$n ~ڿ]ݽ&!4Zeܪ&}~ ['Ѓ=IJ}TY'}3Li z>Ddzڎ ,iU 6!p{ؿo>< +][>q}~^oI_:~be(O@ x?GR)})Eҥo~Ҩ>O=@ O_B>Oݷ{B6 S._ƓW̦^m<;7w+`gt"s.s8{&,wD@NJM"h?>9^ǯs_&(2J|>z#_0a*2Mz'gxw>Bd yZL=!8~O2J< YLb촁+2@No\̥{g'$hQxfhfըs30$$bFū+qmk~ѼO?l pI$1!g@>qg$mpϯ~``bdm1ZSٝ|#)R4!P|GgV;mztd@T+>{zۿgXȎ6t;x"%ZwLz5q+.ot lge2PI(6aى0h܋n2h<Єʣ}!k-}GU[ffo }ϳ'Tf 臅P:R'r c)EMM3mQ=y*Ͷն՞:>^e$ir䔝&UêXݶ8W DxS: ;ӓ7LJ=3X 9"2it^r6HzjkضZ8jaW:n^^oU;:{;;]wgۧ<#=+?k: g"Y,G[>t@}qQ2&0D ?]\9UBk\ã^_HB)&$J"3ᓡh7<1ѓ E 6ElifsZxDDxe+<2 boٕPSќAc 37fΙt]VixW3sWFrA~=uf٦lov׽ǜ͕VkP>|Z۾qljԯb6%K׽fҾv3\M\vF*Ծ!j^=%Z\>oAuW ru5`7};C.MhbЉ {hC|9,S%9鏍Эyۅ_GX??G?VU5-fVS0%FxbYzm ~~._v}cxeXrRBgӝwPwrsZ_MĹGDQEi|H4f>5*jkԃ槚j\s3AX +SD 2u WvvT>u2>˄Tj@㌾?>τf? -xgC z lF^;<9d#7 )1j ._A}@emvpp Qgnţxl_q 渃7>~ +> |,j}&?kJkT'Tg,.}/f98fwl`}04}UtXؓ`x`;~͘.N&Pѵ.mO>Ҍ FRFrFryiyeyrKS%noKږ-e_>}R&M:|4%>8q1cϸθxxĜҌ~? Weikz熷Wl]k᫫otڕˊrG|M&ev@X a X`WFe7^wU#*v L"#NPW~ ey ˅Ġ讉[[ttcv=b,ٵGv{f<_}ypKVݶ)`ރw,&{mbܠR5@Ӭ%Ü,>(_MjsWKo룩}]}L}&I#,Lt؞½>>h8WP|S\A/w,ufÊN d3X-!h gA+(PD"E2Mp毌2y#f~B׊h8-44 L&SQ2͵̵ތZWZ~ΰ)8da—՞1<Oa5nCl6ICV6n3$#` ͇8EVt<ϹB@dd!0xMra@~AvHOD+5˽2XǼhs+BL)Ú,Z+%BPf*SqT CZn%]BGk[Yk_[vx 0ee'jnlno$.C)$qVqb{u 7R+؂`x90JE&z ^$q2$ȓD/D7گC/j [.R?7i%ne^7U9_H`=7ԟ)Uv(Wd_n'ڭZ?qt~Kk{K_ķO7~VZ'BFCƘ%x o76:f8:/G?-ӏrq һWw/,qn~z`UK~0)`^|qQcY~;e3zmc/ZS#k9%dnitXsq|ӏ5 1"Q2Jbv/J tx6agrMp(P}_Ne/MJ4*:wsvNDߔj 87\} h~gp:@SW.AI()_c1vc1vc1vc1vc1vc1vc#Nm?wZc1vc1vc1vc1vc1vBZ% mr +zKqɗ%~LJۣŐex\4KGŏ(\1^4+PZ;l졫oS[p^<಺:\Ϻ%aBBX+ce2VX+˅[_UNBdDRЃHD7=C*tVcd:o:z]in@&^7";&utz݊O^W9^#o1/i6;czCFZ# ލfu06fax5tuOk:#uHpV[ }^3*Ja&aZ}#RYar5&@m$̟WM(t*'87T5LZU-gPxlaqn`:^,mL*Clz4<4aM ߮6CF9ȤBåNtt.h^uLBѣ#$SR8G k'ީdŞDS]8<.M4-7t38 1 .4:?!R@Fh@ ]:eZYHwJ nFz+g o!<]5}nԩ:_urCu cѣ_! ̦GbvhulD96^baѹMv(a5O.^CT(fH| q. MߨE+C+:haPb|\v_c띮!=sґg` hVx.zUV>k>kx32犮WEChdbq vE% E&UK6rzͫa֭qXZ|Yâ:[5Eb;,XKL(~z_{ժU?AFv}M(L,}܎0M(WU\>:ڴš],2'SMfd,u6 DG>P$F ״Զ *4tj:aphtwtGەd /lgj6ceTZЗhՀb[d~5j*0Zb5__"I|qUɜ9 Oo.xIzV./../()--+//.,*[XRm%.SR:? +]\_X\^Շ*)-**=n g,,\T1aBYaye% eKWs`ҒrhQ ^\dT eyᜢE ŀru(a Q}b^…Y%Eh_JQ-)SXY?P)H PdQ?pQܢIh7ar. +ʊf бhv% J,d^\ZQth~)!@!7A/t8+@(/,/ /p)? 'e^/mt@/…0`s}AׅۻlʭGfJ5`RmZ@i76 VЏ5&;l~&zi:PQhc֎^wj ,WlOո6ғ};?c4G:Zu꺦Emh5<G:Vg]l7Ù"eh;}jF0ڳu\Sܖo^QNRRS-2C rv%9ښI lZҲo6 S6]& *iXRhx4lWק WA>S2 HԪF%իj"dJDdT%79D%!R"7咲6lYl#YddP%s"ub)d(̙4ٳa*4 RB J$HXGfȍ] daL7dZCL 2NXd_Ur}SEre!Ir\jN"91BcHY>+A$k ?I DX@&]dbO9Bf!!pPI4fVZARI FV]Y>&K-|L|| g#q#*H,CbTI*(r fr:Iy*Q"6߶XU%C,AެܘS }MD h."ډA Id+R >C[wc4 endstream endobj 400 0 obj <> stream xcOa`qn$ endstream endobj 403 0 obj <> stream x}y|GoUW 6%-m4ma+-sSڶd@1qlJHp$Nց rKfyyݐ09'c7p{UݒeCHϛ?~ݿԍYU:E>ϲqgZ`;e]@h.&o#JW趹GJ|3B){>֡ k{-|/˰z{\חX 'qsIS7 O@DA4'$$4芟Li`B';t@hL!^pTfN{W'&;3p>GrypU Ĭ)7[Y9b("p*wl7wl.rSHHHrGa}R!ΣTѫWLWϝhMR\oWr8. CLl OH PJ.?f"\R^n~E~]VޔZ?8jW|F3_<][vOzƇ&#}y.A1%I) EO#djΩTf)Q';_A!s6n^2E-aYA庾LT1h@C(Yp>,ϛ/n^*r= g)dWvcaG ?Q ܹWT':\`A(-/*EQ%*w?TJuN*t yfiFS@d/s?qtK3zt #kitw oaT*QFbHeps_=_'qCZ/o<Ō79t*[=m whfgxIUCdR685(9>q{tlէ=^k)2]~hN.'^fn7.F>V-ΠkQ[}U7JwNKG?S0^_h1 y BFBFA(5QSdS :}U)i/n_!v>5Vg?黦LO [Ƿ(X`zO5C~ul^XG~'MP$Yw%D.̒-ߝ:?\ 7Z̟#Kqe=sſpniԾ"m(--W>Lx,?q-o8k8xHAk;~\A>ʿ|yu` || %B Pߵt SOn{Q(ˍ>|[ ߆?=d"7#Hh:M>#}삤14аe٩( poyweaLɷa|R^?o9xݺ)o{hҕb'6˹3I=ʟپveT,Lh3Z ZA N;F 93X O밣r󥵅߽Թ[/a]ms3swl;&rjܹ|n~jߑV/42T+*#%Jgy _{*sqU[fϿ},9=CG3W<+geܨM}Y8psbzgԛV(81#y7'³v>.U/ٶ#Fg@{oٹi˯9*As¿Jkm8z{"J+< tFiĠ,b"xJr<8ͲS? |ɞ##N>=۫†x1&&(esYp-, 'hu"28cV~[U}xZ8%ZnONnʝr3~%ʚ-(e(8ʡ=D(j$4'\aJҧC!o+?~0-s@+?vk|TmqIJ8g7 +ڛ Zjҝs I%KN9sz; cݵWa@hLQ}(}nSN^~5k3H`u:XET Q\g P IsiY%>Ssʗs:]>\9%Lb:ꪲ1DW|CWrێ殮[{MaZ}\cHeuˁ jû&kT7Eiu -H'V'߼Hu`sRik̜̜|iS+,;aR:ӳIvL͝$c,>>KOoZO&ΞqWOK˛1ɛJ&Ei%3̘Q+F:-F+3JwJJvvu =,'/YM޽cN;֣8ocǒ)Kge6Ou`c''OY2=+4w+,^e`8=f|ֈonJ^RV:}c!p 5UbBzݺ~V::ϤA3'iaSq7wS"}ɣG<JI|sQn;8yu8u&qxė-WAύp ۻݮqU+>?, 㞁f`&pFhί2g̵\8S gf2COI~C6oYZB-`ˁ 7ރzN=dGem n[gr:N`k9{Mr0?Uh? o㤄E;dpe`L].~7hEM6[fyL*\2B[.wf";}Jg#k~#hh 5pA>pAcG>L \ s'K0^=paĬ Qh_:aZ9^x=şE%DɟD˹on~깝t֨w3# h )@^o9knGe+rE"W\+rE"W\+rE"W\F_MfDlhoK8Z%)9 & *k_m$8C~* 6[(v / Ps(1&*'wiiiiiiiiiiii_m(zF=ǍD3DdA?25Duh9ujd|sAI\j?Mؑ>SqhO~%SH#Z#G)Ɲ1EROP:^yQAkT|Y@znڏA9ڏMN^RqyJO@c)j?\yQ!jB(D4碙W"*LJ$dC.dQ r}6LjBX~$]5ѨzN@Xڀhm(ES|Pzu=*x;|怘0M̝93O'\nMb 5_m%ӶMlh$hI-z[ 9`L[dZ' (kSD 0~x8<IXQ, 6σI>sdu- ?ڲ52.j\jboG9*FȆ|,W59ɱƶl 5z|MR[%ac'W,(@QjZ=qI#<ؠ.9 n#١ZQd6.f达,Tjbh1`79Iիqq3F6+)V0 lW#P,*]TK1Lya!^=@ٕH`ܯF>,JstLXcSSbPl&hF赪qq1TM=9(i`V6 j.5dm EI;fVe\l,\ oHT*Ҷ1¼C.Ϡ ?!gK"CVAvVk"7сaQ7Q;'qfC#nUC)}SvpEShUA50v&Ct>NV}^-pu%p}@`xY׉LgPƚb ۮOۃD.v/Mi: P!Zj.}FeUOQ$6<<ث Pll]P#;f&4cjcѣnpTga6kIp}InkhP9S}j|!(2y3|z' @;믱/Cz_A郻>,ڔ)ԳڦCaq Ih[h/4e*V_*~UFENjݵjnp{{^ߚ~V={`3ħeMǔ}l;bVj}1d2df|P%UdEuT1(Y<~:kl ãh2$URE Q9{upZfOY]LDpޔ2)('Ji`R}Jzu)U$R\(٪-982ˡL+XoL N)CQP89jEjeMW 4) yg&A޹Vt92R区hzKhDG ӵXĽa-f:R\jLjdP &8fޯT[u墙QkCVXB.,‚~S*$P(HSj=ԃ%,U kCq\va_k`;PsOOCX ? (UѺ *YٳypڹoɆaCʻQY:('t2igR[Ig|ñ#濆5C C^dBkSiaožaoU?惠.?fW}r0 d ڄZ@5G_u v/ig4BK؏qwN[i7R1/Ibi-_E/|6QAu+:oV".l8%:Z~'P7K> x5ld7>P¾& Ab0v(o HL! ॆ6;h@CeD})T蒘̿fC~ UUk*zf m>70BG{ )5bVIPmwP=󣣭0elJ1BA ~ez;ʜoRj56DO'<>jhFيPCg]htf3@V1K~GmE4Bm +sR"ή0 D]eDtv!*$`Ƥ q') {|v增Nzzf6N3dEm?P%6z!MB[%:l 6? JvvnvU`кW4gVuQ6Vȗ bk ݞP5-QjmB%UVju,Zjꚪes7³ .X˪"PԘ*+Ū%rRYb+k̵bUh.aRY\^Wb,`]eU,TXjbKU(UkTd)XW%k%\&Tcוj꺚Z3`lrI p1WA *^Yc)-` Tb0,5P @d!ŵerb֘MZڨdTUEfPTTnVdUM Xb0kP2UAsJs V-vԘl(gWU֚o  P3ɘ.űVXC,Ԛ RKEXRSR cؓ:R]@EW MXKŸ˼AhlɭGVJi`QR7$2ƺϐYlQ*`r-٠_Z> a7Rʯ}UOK 䇇ve:l.m V^Za?$Є n^(& F}VSP.I~/TRkG6~$q=>:3_C`~&n=l19vro^; 5q@9ܔm5q drY;9k_J^%/hr~Ky-FؑHv>lzB& [{NYC1w\wLL8cL$[;c&}4r[ ۅnښ :'ܒK͝ɤ3l!dS4i( ƶFM$XL2d7V o,yOq w q֖QBki[F#K|BpȤi|4wMiBdӈD%bM&e e.^JVudr,;AdRk'5Zrc.HU<4Hy N,R &%IE q8Y(i!E Bq2)2E d)bq$1R;{H!%VE ¢dha,4 yI5dDa^H bIL sd2;/Y%yB^2ɝ5Rȍ&f$3s 3KHNNKrٓlFڅb K Pb0Av2-s0D2A̙$n2IOb ik$aj-IeI$GqSq,SٔD2M&Idb<07S_K긙dL12@tZk!dA%Z#L.I&$n E$!q0'XKb(Cqn .2NFD% #$*h\AEX',\4axf=_- endstream endobj 404 0 obj <> stream xc`L`az7F`D endstream endobj 406 0 obj <> stream x xU0|N5e;  Y tBd$@@@t   #"fdP1EETqDgp"z@s:w.ԩs˩"ҡ5|g,^kUq5*\A*KpBqe"?wA(ˠCA;q+_\"dWT= &ʢ53|B[* ?|#BypYS Bu>/ A򕼇J9 `5Ds m (Mw ;~!y]JB\BNt};v j<ظN|oGykɫx `n!h7LKt}$s;(_hW!]pw +I)=ĕf5ZoMIT m:2zmA7У54GGBy | HDƝh.]Bu6yDDZ IIq(jOw,N00bN sOx;'\}@z ;{;%SB(Mxpݨ3x{[&MըeV7R.N3Owb@!z%_fx5}}Ic74\uݷ퀇I`2* h]/sB5xNg* EFnNh==T`,Ix # ~rK9GIlW.cqc̋3-Zʬ'YieFv{c玩~!v_33Uok Z4q7zB""5LuD-M<=,a\(Ұ~ݺ;w>}v|.* Wuj[t;nӃS$<ni• ǯ|r}4~أLn:5*ׂYk-6Xz-шf |N&ZThԦM7hi l01 f?BڅKCuҡ$\*J3 S \%p%*DzBۅ'TD(@ F,6x6KR~!uF~ xCǀGo^8ԛb'x |̮s^ZW#&_B*uGP;cě.f8iz= c}`0an6 _qyFkфġ<B\ᙇ= s6v\?.\F;7 ZO5H63_ AƠa@1]HWoX1(p1$bU:F%d%d>YHUdM6Yrq.ݏskA{n{T{{4{{tϠg333g4hGq89U5ǵu?___u~ ] cdʙMxF\;I3rN_u˖۶l͛_~yw}̌cdq?Jgץ?X<ri+i9ވWLv d(AZyUبBuD@2:&4`Cm TY=u Yn_`@^{$ Gm(OzC&-Aޡ&2,k8TY?\;~N NPOP$Sj;p $:2vﵚE}usc/uttѓVږ:kXx>3&1p4uonskXmOGz#n "HmfNԓ*-Dh\AAX#pbCwqsѻJ_)wvmٽ9]e HpīagGlU۾u+?j~'5_ r˦ڃqC"S l`yѨf0PBUڲ(q? L>Kd34b"EB>ճ7{vcqʻfHX;M@VyiG׊6:HJlG՟qYai;kw\ƍsGmo%7[{+>!'AP lQk42X{<5A$ fT%д j3Wa#7xDz}xk[Hի{4XzeLmM-yn ~.$=_lY\\bZYGWMah=]D^5mo3-m6wPM>ܗ*$.zrI…"CX4HBh;>9C%?ck̝\ݽ@$8:`iT-mg9q{~(@YA 9(GH$06b6 GXy:dAp}&J' nmHN^.V/!-%@Sa #T,tFyD7$yw!etwKRdBovLZ'|  NK@?G w*#τ>|1E!y#҂}҂D1H E+:T^oj[[ ^J52b+ "MhznZܒn\7 VJy9rCQ/J>(2tM,;)f]eˎ^0=̹sxMysͩJO{)i'͛Z01FZb`:0ES 1MUmklD/i8ZV|ܹYmb:(SլP_ ="Ϸi5x5*Q ĩ Z^YqA#zi%W5dVi}QVjو[6|՜ A^B|@YbC*ѓ,z}'D\ [W_jy|xxڝ4|o׭tKN^^M\4f}'>3dio;޳݌O|%_5h] F+X7 ],9ݷ#gW}بh}jVhq$ WGjF$2Z=Vc0(C a pcҭ6Q \}{{q>cJݦAUb*E9)Vqf>NeFZMKoLe"pXl-V5p+TZ3p8/e" !p ۂHR.I߼=Nyi5Vc׏-> )WZ]u-$rdӆ]m673)}}qBZF0J}\hh1ixfI-S%+mp?͟7zV) ?wsw>]=s>_{˹m3ytw},gm'I#O{j(ڨF$ZbFq }l")R$8"GW\hPҔ F1ͩ;%/D/oG> 7>1wpo<nRb4_D7=gقNjuA<|)V3~=ŷZmÃ` O2yBc9P_ͬ ?QJ] GQB*Pa0BvD1*Y ۞K,kh^ǗەY]7OX@IYO_ȑemZYE1 ǽ G D١5N\)mLus/ #d7Ñvo# kZ}Lxc1ǁg ޔ`Ut/]Mt;wf/1_OHX\19}7<ڣ;~„*ȭO_N?nIgd\ ."ʲGb8:d!䔌eH&bXZ>x[0TN+jy!N7:X[Уi_4Z N nJPARoZGzlCT- 54_zT(Fy3FVS棡 Z37BK7jrs.{.\ȍ#8azfn\!Sgk ueFo,Յr1Gt8Ls;\9~HhG|dY+ W568W B8s.Uu=ȥb QjU(mʡ"<<j|:17@9NT9c[~xt?ǨBG|TM-Mú,m>n؇5hE}='cACFN(=7,s}=068ڎq;׮mjnim3Wu4gN8_uM|7+*=_|qk~Ɲ~ܱ} nqּs42w>/=v2ѣ:#"wȴ kkHQfY,S|˛,1m9N"*@Z6po$~휣-y/]ny^!$_JJ6)E1v?&W15ihk#1tUf+r]m~'Hbݕc;є#X{^N?x$ʗP2|_Ifo)fn* `"N&s;;}sdܸ~-o$uo͟cO(̖t~K~§ á-,6}ܻ `x(3bRp;-.Jt:+-Ax8Tj|r`SIwwo\-+ؤyI]OM)FLX>"&A7u=+inoVJہv rD, }Brf.xj y>/_rœ仇n%}o:~c5 *O}t5٨sƜl0Ӎ +|}b윞 =rrB: rTk b*V꒽}}֐5aFFFFF(jzܓ6TO̘1~Ҵ̤ )IrS/HWzqk[ijnW5/\8!9nCa7l'߰}ɂ4'Xi9ɇ9}oʚziCmͭϯݺE|?NGbZ=FuY|KR=/.u)r2bDlm}Ge/HCzij7l=+jgKHC>;TB{7Iy|0S_el?{2eS -40:6_i8mγ:/ȍ8@tݜ?obЇu'3tIKsRE@v oPuLȄMf+b9Sَxnff|,ͯ"uiKG{F;&K/"v/lKx O=xi2M.s@yk"_4dDr5an,H) fːqFD zJm_r 6m~;E/x:}>w\tӧvw,,+1dΚ8cτ0Z`qvIZ@9M ƄT/?3WJ 4|Mǥͽ(ޱORF~ozj 0 eB_~sIͯ6b؏S@͟kwcY_DGB "[!HP1<)7X3QCdDw8&j8ǹU8qq vמf{BV;:-Doi-oZx˛6-NԦō޴w+\}{M: F8#(GrB SG铸BJPOЧ35iYBl})WNJraƩ[ʭՍ4j}9)+k#$n0A;U;G+ʴ+դ_ͯ~]808r{Onz!`2.lΕ\ԡS!#Q*zěij5ZL/:-pW Mժx̫A2"Zh79TAJqj)nT* h=Qڹ,hpal#T_ UKR%)U#q｝e)HK#2eKnOw6Qq=d1yM^&7`pK5!Iul8n6莧Em4X=A۾ie[,MkaosyR6-z_pCq9Ӝi㦥S#1RȹFoySS8 O9Kߎٵ4ӳTȴbs ڃڛytr15A!#{Wqzqz|Al araԞkԉ63P'XCѠ#ͫGܟ5Za/ N[Cz"뇾A@DFW,R:F_rK&MںM3﫪;록lom۾6_mm516/Q5 #H+y2<,< hB:QOF-?M\4z+D}Ty2fF|9m묹Uښ6K[nRWowoo6UKms}뗗w:RFG[7" ֡ @{A{gE3 sh77NoΝ.{QB̜36c|F{ 1y~~O>9V,z},ށ=l.ծFDσ) Uzv ŷ((H`6:{Nr~KO W.sqMft!8^,tg­P'RUJ46%G_@erBwqZ]1epq-嬭+G'$ ;*chaL){=HmáX 0an5\kAN<:a*KjKյUNx1tIQs2uUe0j3G5Y+(@hkZ4p߰_뿠\ᢕ=/b:PɸA J Akv{TZVbZ`pJSgjembxU3 vj"r2-% ]0F0 Q 2&9:@KB\1J`NB% J={O)*=އc ԝPd=+Vi`xc`3]+k^!JAy@ g*Y@\kimav%K[~>:c_2Ȳ=ȰS✌mMFѺ~1~T[+*BL׈bWʉ0 K$Tv0L1,Pfje0szuJ͏"ER}~ۥk27dO^3f1ȪȾ]Ҧc Pу8ss)OdWl(ד{dL)Od>P\"y. S*X(5eJ_ZĴG]CS/i40yL7/?c" 6gz⁜ Ap]=u}鲛Qĩ; ,cT9}tAǻnmm'kH)fv_=\X OcNJ8(V<3LS(d s2`hL΀q)fFC=Ka|e+gY}#He2[R%S31p0ї8Fa|f_ oe:5TªN0 B?R<~"}eZCfF0Yq!oLE?s0_;CZ{Ә>e)q_Õ}W:ĵV{`؟?ځ셧CYY5"Jw˵t9JQݗ,cOZmz+S֠ K/X@Wn\Z!ְx/̄נ+TŵC%-L5JMU8Lhnm_}yrB>ȇ<%:OUq\G.J䝷;y[K.H9, oy7%F 9&9&W%DrNKDNJex'σB2["$2WO $/<ܻ̐HɑH6)dK$>L!-B#L pq4HC&25|jQH5N] IJ'>wd`7{'^wz'ɝnw$2PxLdDI26O;h$N'bQI\$%HVx (waeLf!ʝDQt[؄Fc#8!R"%!p#y t2H$j4  BVH<A H6@" _'_H xg/ϑW*0 #8wbrs*1 &31ɼ3H2 nZ'wn;7-q=5DOuk (JDE&Eq6᠃G0 Gd";o#A?;nt> endstream endobj 407 0 obj <> stream xa 1 endstream endobj 288 0 obj <> stream x[[s~_1O{rJʖIYv-dJk~ pơnZe8u+Q*pqBT\e4] }g P$H"H@@4 03q`d& sEIwHF'6" u4^PZАs5(QV4L*E4J)H(O`,.BBT<{tEi ܒ2"H#{J0'3zJ$`P_}vYO(=LomJVhN?rW1XiP>JM71cz,4' (-fP>bt@@^Z(Ʈ*q>[UZަu)_ia:j'v@1I܀x(Ypi|R΄~-/4〖$j](Μ Nv3g4PRj@VvW]h!v*_K0d}qEdq; _l槛kfm6wߍFZ/̴C^2l>j}3X Vv x,}ʌ`"<T.֛Io6gHR')9H|plEonO/?M꺇E)d"_WWJK!LgWBxq>{h{l=; :\.3MGs=fNjT`4G3ݫvyиCe|ݧYt){Ɂᚓ+4܎oNs\֋uR;DA^@})bʄma}62OvdnEjҭ,`y;^8oӮ6[*\̻<=3yRU^/W0]] \-|N`M4If[ۥѴtt-q}\>Z\6v.2e |:o;1DSeqQ6XZk!>d ?!わq|ڒ'wȓ='}y\Sc>nl9ߩ@>s0GNL <:nW9e>wR].p{{SKwζIi#)|MK*KE-l0[+V+>+M:,ho7:m[&;nqKJٯ8)~#١*oJD[̇4' ͩ9ʨ9zWMIwi UT pj\H^`,ezФm*_ NZǫu\B.sL1=`,yM(K^gzyV)=Mm8K^$v;O'yɓL/0"22=_r℥rw/ʅuNdd8+NJ6XFFFq*Nj7faz))bzqt(ݹc}ҫgM5.w J(E1, WӊCKqh)-š8RZCKٮFY}JUxsԺ|?ȣɃ鵍]}1 a}jFu=O.?黍5cgzYN_w~sw0CJ~'lM:w1#Ri!Qpb(+I  r7 =! 04^"٬QZe&ZAv-Mϊ~)uB ɶMcs?*zڻ,fnĕׁ?Q'?A~z=v :n"%%7Jw#.zyA=9< O}хF5(H`^$9b -z] \d9$0܎0"&+o!S$YPŵypIals9 };rn<ԹN}6]|Zo>MWt2JNu'~gr5CjNH ^Oz%pd}IksSu%bSd3:^4ͧL8U[1I}^۸C)%`H[IlؙE՛6q&0 EaTO2ȁeem zk *l_ߺ kD2B(x{ jP{qʸ;ՋW䅧vV8,K*vQ zDr6f6k샘H9NkG480n !=rڵOTk؁ &@1Dzq"sћ>N =T%x =z0ڱöc2!N[p/1Kj1Laئ]aZ_Icݦ~ ~a'*H2LLp:Qq"&=3NEҽo?Y_/B|#䗋eh\כɓc=ի o|wwSߦyxij/a.Nyb`_<:EHP -uvġdMr]/Ula bnQE5ZNܝiqˀmAڎSEi;zUڂbk a!LI'ҏY\=&ذ;'6RA%W`6QvƤMuE?t >l 3$uz"U~"C z%&2 34 Qp*Xxu[%\%\K])yh_k`mi;`cױĵۧf>':ۉvb͸ԔUMYեMY5㓲j]/Size 409/W[1 3 2]/Filter/FlateDecode/Length 914>> stream x-Ypw b 8-"IPPB!$KbOX JZ 7WfL%n\9o~}Ϝ>$م;q$SGD&BVf[`$V`DsxP%v43:lPJi"GcJB_q*~g3&485 vU*ru9a@%'$qf1;'*%~WU\]Jq`*A8, 9ߒTJ^y?~%9cfbʶ'~GRkȣp48qJp)#R3*gbD^7i6\f &;|NSU= *>KSqN8ss4Ay8MBC%6h m.X6Whog-Ÿ7` nMXe>[qnX;q=Xxaj x :Ǔx Oc,'F>3.^KxU[x]uq= N{cd{hO|@$쉶Ѷmd #include "minIni.h" class minIni { public: minIni(const wxString& filename) : iniFilename(filename) { } bool getbool(const wxString& Section, const wxString& Key, bool DefValue=false) const { return ini_getbool(Section.utf8_str(), Key.utf8_str(), int(DefValue), iniFilename.utf8_str()) != 0; } long getl(const wxString& Section, const wxString& Key, long DefValue=0) const { return ini_getl(Section.utf8_str(), Key.utf8_str(), DefValue, iniFilename.utf8_str()); } int geti(const wxString& Section, const wxString& Key, int DefValue=0) const { return static_cast(ini_getl(Section.utf8_str(), Key.utf8_str(), (long)DefValue, iniFilename.utf8_str())); } wxString gets(const wxString& Section, const wxString& Key, const wxString& DefValue=wxT("")) const { char buffer[INI_BUFFERSIZE]; ini_gets(Section.utf8_str(), Key.utf8_str(), DefValue.utf8_str(), buffer, INI_BUFFERSIZE, iniFilename.utf8_str()); wxString result = wxString::FromUTF8(buffer); return result; } wxString getsection(int idx) const { char buffer[INI_BUFFERSIZE]; ini_getsection(idx, buffer, INI_BUFFERSIZE, iniFilename.utf8_str()); wxString result = wxString::FromUTF8(buffer); return result; } wxString getkey(const wxString& Section, int idx) const { char buffer[INI_BUFFERSIZE]; ini_getkey(Section.utf8_str(), idx, buffer, INI_BUFFERSIZE, iniFilename.utf8_str()); wxString result = wxString::FromUTF8(buffer); return result; } #if defined INI_REAL INI_REAL getf(const wxString& Section, wxString& Key, INI_REAL DefValue=0) const { return ini_getf(Section.utf8_str(), Key.utf8_str(), DefValue, iniFilename.utf8_str()); } #endif #if ! defined INI_READONLY bool put(const wxString& Section, const wxString& Key, long Value) const { return ini_putl(Section.utf8_str(), Key.utf8_str(), Value, iniFilename.utf8_str()) != 0; } bool put(const wxString& Section, const wxString& Key, int Value) const { return ini_putl(Section.utf8_str(), Key.utf8_str(), (long)Value, iniFilename.utf8_str()) != 0; } bool put(const wxString& Section, const wxString& Key, bool Value) const { return ini_putl(Section.utf8_str(), Key.utf8_str(), (long)Value, iniFilename.utf8_str()) != 0; } bool put(const wxString& Section, const wxString& Key, const wxString& Value) const { return ini_puts(Section.utf8_str(), Key.utf8_str(), Value.utf8_str(), iniFilename.utf8_str()) != 0; } bool put(const wxString& Section, const wxString& Key, const char* Value) const { return ini_puts(Section.utf8_str(), Key.utf8_str(), Value, iniFilename.utf8_str()) != 0; } #if defined INI_REAL bool put(const wxString& Section, const wxString& Key, INI_REAL Value) const { return ini_putf(Section.utf8_str(), Key.utf8_str(), Value, iniFilename.utf8_str()) != 0; } #endif bool del(const wxString& Section, const wxString& Key) const { return ini_puts(Section.utf8_str(), Key.utf8_str(), 0, iniFilename.utf8_str()) != 0; } bool del(const wxString& Section) const { return ini_puts(Section.utf8_str(), 0, 0, iniFilename.utf8_str()) != 0; } #endif private: wxString iniFilename; }; #endif /* WXMININI_H */ uTox/third_party/minini/minini/dev/testplain.ini0000600000175000001440000000006414003056224021056 0ustar rakusersString=noot # trailing commment #comment=3 Val=1 uTox/third_party/minini/minini/dev/test2.cc0000600000175000001440000000351714003056224017730 0ustar rakusers/* gcc -o minIni.o -c minIni.c g++ -o test2.o -c test2.cc g++ -o test2 test2.o minIni.o ./test2 */ #include #include #include using namespace std ; #include "minIni.h" int main(void) { minIni ini("test.ini"); string s; /* string reading */ s = ini.gets( "first", "string" , "aap" ); assert(s == "noot"); s = ini.gets( "second", "string" , "aap" ); assert(s == "mies"); s = ini.gets( "first", "dummy" , "aap" ); assert(s == "aap"); cout << "1. String reading tests passed" << endl ; /* value reading */ long n; n = ini.getl("first", "val", -1 ); assert(n==1); n = ini.getl("second", "val", -1); assert(n==2); n = ini.getl("first", "dummy", -1); assert(n==-1); cout << "2. Value reading tests passed" << endl ; /* string writing */ bool b; b = ini.put("first", "alt", "flagged as \"correct\""); assert(b); s = ini.gets("first", "alt", "aap"); assert(s=="flagged as \"correct\""); b = ini.put("second", "alt", "correct"); assert(b); s = ini.gets("second", "alt", "aap"); assert(s=="correct"); b = ini.put("third", "alt", "correct"); assert(b); s = ini.gets("third", "alt", "aap" ); assert(s=="correct"); cout << "3. String writing tests passed" << endl; /* section/key enumeration */ cout << "4. section/key enumeration; file contents follows" << endl; string section; for (int is = 0; section = ini.getsection(is), section.length() > 0; is++) { cout << " [" << section.c_str() << "]" << endl; for (int ik = 0; s = ini.getkey(section, ik), s.length() > 0; ik++) { cout << "\t" << s.c_str() << endl; } } /* string deletion */ b = ini.del("first", "alt"); assert(b); b = ini.del("second", "alt"); assert(b); b = ini.del("third"); assert(b); cout << "5. string deletion passed " << endl; return 0; } uTox/third_party/minini/minini/dev/test.ini0000600000175000001440000000014114003056224020026 0ustar rakusers[First] String=noot # trailing commment Val=1 [Second] Val = 2 #comment=3 String = mies uTox/third_party/minini/minini/dev/test.c0000600000175000001440000000741314003056224017502 0ustar rakusers/* Simple test program * * gcc -o test test.c minIni.c */ #include #include #include #include "minIni.h" #define sizearray(a) (sizeof(a) / sizeof((a)[0])) const char inifile[] = "test.ini"; const char inifile2[] = "testplain.ini"; int Callback(const char *section, const char *key, const char *value, void *userdata) { (void)userdata; /* this parameter is not used in this example */ printf(" [%s]\t%s=%s\n", section, key, value); return 1; } int main(void) { char str[100]; long n; int s, k; char section[50]; /* string reading */ n = ini_gets("first", "string", "dummy", str, sizearray(str), inifile); assert(n==4 && strcmp(str,"noot")==0); n = ini_gets("second", "string", "dummy", str, sizearray(str), inifile); assert(n==4 && strcmp(str,"mies")==0); n = ini_gets("first", "undefined", "dummy", str, sizearray(str), inifile); assert(n==5 && strcmp(str,"dummy")==0); /* ----- */ n = ini_gets("", "string", "dummy", str, sizearray(str), inifile2); assert(n==4 && strcmp(str,"noot")==0); n = ini_gets(NULL, "string", "dummy", str, sizearray(str), inifile2); assert(n==4 && strcmp(str,"noot")==0); /* ----- */ printf("1. String reading tests passed\n"); /* value reading */ n = ini_getl("first", "val", -1, inifile); assert(n==1); n = ini_getl("second", "val", -1, inifile); assert(n==2); n = ini_getl("first", "undefined", -1, inifile); assert(n==-1); /* ----- */ n = ini_getl(NULL, "val", -1, inifile2); assert(n==1); /* ----- */ printf("2. Value reading tests passed\n"); /* string writing */ n = ini_puts("first", "alt", "flagged as \"correct\"", inifile); assert(n==1); n = ini_gets("first", "alt", "dummy", str, sizearray(str), inifile); assert(n==20 && strcmp(str,"flagged as \"correct\"")==0); /* ----- */ n = ini_puts("second", "alt", "correct", inifile); assert(n==1); n = ini_gets("second", "alt", "dummy", str, sizearray(str), inifile); assert(n==7 && strcmp(str,"correct")==0); /* ----- */ n = ini_puts("third", "test", "correct", inifile); assert(n==1); n = ini_gets("third", "test", "dummy", str, sizearray(str), inifile); assert(n==7 && strcmp(str,"correct")==0); /* ----- */ n = ini_puts("second", "alt", "overwrite", inifile); assert(n==1); n = ini_gets("second", "alt", "dummy", str, sizearray(str), inifile); assert(n==9 && strcmp(str,"overwrite")==0); /* ----- */ n = ini_puts("second", "alt", "123456789", inifile); assert(n==1); n = ini_gets("second", "alt", "dummy", str, sizearray(str), inifile); assert(n==9 && strcmp(str,"123456789")==0); /* ----- */ n = ini_puts(NULL, "alt", "correct", inifile2); assert(n==1); n = ini_gets(NULL, "alt", "dummy", str, sizearray(str), inifile2); assert(n==7 && strcmp(str,"correct")==0); /* ----- */ printf("3. String writing tests passed\n"); /* section/key enumeration */ printf("4. Section/key enumertion, file structure follows\n"); for (s = 0; ini_getsection(s, section, sizearray(section), inifile) > 0; s++) { printf(" [%s]\n", section); for (k = 0; ini_getkey(section, k, str, sizearray(str), inifile) > 0; k++) { printf("\t%s\n", str); } /* for */ } /* for */ /* browsing through the file */ printf("5. browse through all settings, file field list follows\n"); ini_browse(Callback, NULL, inifile); /* string deletion */ n = ini_puts("first", "alt", NULL, inifile); assert(n==1); n = ini_puts("second", "alt", NULL, inifile); assert(n==1); n = ini_puts("third", NULL, NULL, inifile); assert(n==1); /* ----- */ n = ini_puts(NULL, "alt", NULL, inifile2); assert(n==1); printf("6. String deletion tests passed\n"); return 0; } uTox/third_party/minini/minini/dev/minIni.h0000600000175000001440000001347014003056224017753 0ustar rakusers/* minIni - Multi-Platform INI file parser, suitable for embedded systems * * Copyright (c) CompuPhase, 2008-2017 * * Licensed under the Apache License, Version 2.0 (the "License"); you may not * use this file except in compliance with the License. You may obtain a copy * of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, WITHOUT * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the * License for the specific language governing permissions and limitations * under the License. * * Version: $Id: minIni.h 53 2015-01-18 13:35:11Z thiadmer.riemersma@gmail.com $ */ #ifndef MININI_H #define MININI_H #include "minGlue.h" #if (defined _UNICODE || defined __UNICODE__ || defined UNICODE) && !defined INI_ANSIONLY #include #define mTCHAR TCHAR #else /* force TCHAR to be "char", but only for minIni */ #define mTCHAR char #endif #if !defined INI_BUFFERSIZE #define INI_BUFFERSIZE 512 #endif #if defined __cplusplus extern "C" { #endif int ini_getbool(const mTCHAR *Section, const mTCHAR *Key, int DefValue, const mTCHAR *Filename); long ini_getl(const mTCHAR *Section, const mTCHAR *Key, long DefValue, const mTCHAR *Filename); int ini_gets(const mTCHAR *Section, const mTCHAR *Key, const mTCHAR *DefValue, mTCHAR *Buffer, int BufferSize, const mTCHAR *Filename); int ini_getsection(int idx, mTCHAR *Buffer, int BufferSize, const mTCHAR *Filename); int ini_getkey(const mTCHAR *Section, int idx, mTCHAR *Buffer, int BufferSize, const mTCHAR *Filename); #if defined INI_REAL INI_REAL ini_getf(const mTCHAR *Section, const mTCHAR *Key, INI_REAL DefValue, const mTCHAR *Filename); #endif #if !defined INI_READONLY int ini_putl(const mTCHAR *Section, const mTCHAR *Key, long Value, const mTCHAR *Filename); int ini_puts(const mTCHAR *Section, const mTCHAR *Key, const mTCHAR *Value, const mTCHAR *Filename); #if defined INI_REAL int ini_putf(const mTCHAR *Section, const mTCHAR *Key, INI_REAL Value, const mTCHAR *Filename); #endif #endif /* INI_READONLY */ #if !defined INI_NOBROWSE typedef int (*INI_CALLBACK)(const mTCHAR *Section, const mTCHAR *Key, const mTCHAR *Value, void *UserData); int ini_browse(INI_CALLBACK Callback, void *UserData, const mTCHAR *Filename); #endif /* INI_NOBROWSE */ #if defined __cplusplus } #endif #if defined __cplusplus #if defined __WXWINDOWS__ #include "wxMinIni.h" #else #include /* The C++ class in minIni.h was contributed by Steven Van Ingelgem. */ class minIni { public: minIni(const std::string& filename) : iniFilename(filename) { } bool getbool(const std::string& Section, const std::string& Key, bool DefValue=false) const { return ini_getbool(Section.c_str(), Key.c_str(), int(DefValue), iniFilename.c_str()) != 0; } long getl(const std::string& Section, const std::string& Key, long DefValue=0) const { return ini_getl(Section.c_str(), Key.c_str(), DefValue, iniFilename.c_str()); } int geti(const std::string& Section, const std::string& Key, int DefValue=0) const { return static_cast(this->getl(Section, Key, long(DefValue))); } std::string gets(const std::string& Section, const std::string& Key, const std::string& DefValue="") const { char buffer[INI_BUFFERSIZE]; ini_gets(Section.c_str(), Key.c_str(), DefValue.c_str(), buffer, INI_BUFFERSIZE, iniFilename.c_str()); return buffer; } std::string getsection(int idx) const { char buffer[INI_BUFFERSIZE]; ini_getsection(idx, buffer, INI_BUFFERSIZE, iniFilename.c_str()); return buffer; } std::string getkey(const std::string& Section, int idx) const { char buffer[INI_BUFFERSIZE]; ini_getkey(Section.c_str(), idx, buffer, INI_BUFFERSIZE, iniFilename.c_str()); return buffer; } #if defined INI_REAL INI_REAL getf(const std::string& Section, const std::string& Key, INI_REAL DefValue=0) const { return ini_getf(Section.c_str(), Key.c_str(), DefValue, iniFilename.c_str()); } #endif #if ! defined INI_READONLY bool put(const std::string& Section, const std::string& Key, long Value) const { return ini_putl(Section.c_str(), Key.c_str(), Value, iniFilename.c_str()) != 0; } bool put(const std::string& Section, const std::string& Key, int Value) const { return ini_putl(Section.c_str(), Key.c_str(), (long)Value, iniFilename.c_str()) != 0; } bool put(const std::string& Section, const std::string& Key, bool Value) const { return ini_putl(Section.c_str(), Key.c_str(), (long)Value, iniFilename.c_str()) != 0; } bool put(const std::string& Section, const std::string& Key, const std::string& Value) const { return ini_puts(Section.c_str(), Key.c_str(), Value.c_str(), iniFilename.c_str()) != 0; } bool put(const std::string& Section, const std::string& Key, const char* Value) const { return ini_puts(Section.c_str(), Key.c_str(), Value, iniFilename.c_str()) != 0; } #if defined INI_REAL bool put(const std::string& Section, const std::string& Key, INI_REAL Value) const { return ini_putf(Section.c_str(), Key.c_str(), Value, iniFilename.c_str()) != 0; } #endif bool del(const std::string& Section, const std::string& Key) const { return ini_puts(Section.c_str(), Key.c_str(), 0, iniFilename.c_str()) != 0; } bool del(const std::string& Section) const { return ini_puts(Section.c_str(), 0, 0, iniFilename.c_str()) != 0; } #endif private: std::string iniFilename; }; #endif /* __WXWINDOWS__ */ #endif /* __cplusplus */ #endif /* MININI_H */ uTox/third_party/minini/minini/dev/minIni.c0000600000175000001440000007404314003056224017751 0ustar rakusers/* minIni - Multi-Platform INI file parser, suitable for embedded systems * * These routines are in part based on the article "Multiplatform .INI Files" * by Joseph J. Graf in the March 1994 issue of Dr. Dobb's Journal. * * Copyright (c) CompuPhase, 2008-2017 * * Licensed under the Apache License, Version 2.0 (the "License"); you may not * use this file except in compliance with the License. You may obtain a copy * of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, WITHOUT * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the * License for the specific language governing permissions and limitations * under the License. * * Version: $Id: minIni.c 53 2015-01-18 13:35:11Z thiadmer.riemersma@gmail.com $ */ #if (defined _UNICODE || defined __UNICODE__ || defined UNICODE) && !defined INI_ANSIONLY # if !defined UNICODE /* for Windows */ # define UNICODE # endif # if !defined _UNICODE /* for C library */ # define _UNICODE # endif #endif #define MININI_IMPLEMENTATION #include "minIni.h" #if defined NDEBUG #define assert(e) #else #include #endif #if !defined __T || defined INI_ANSIONLY #include #include #include #define TCHAR char #define __T(s) s #define _tcscat strcat #define _tcschr strchr #define _tcscmp strcmp #define _tcscpy strcpy #define _tcsicmp stricmp #define _tcslen strlen #define _tcsncmp strncmp #define _tcsnicmp strnicmp #define _tcsrchr strrchr #define _tcstol strtol #define _tcstod strtod #define _totupper toupper #define _stprintf sprintf #define _tfgets fgets #define _tfputs fputs #define _tfopen fopen #define _tremove remove #define _trename rename #endif #if defined __linux || defined __linux__ #define __LINUX__ #elif defined FREEBSD && !defined __FreeBSD__ #define __FreeBSD__ #elif defined(_MSC_VER) #pragma warning(disable: 4996) /* for Microsoft Visual C/C++ */ #endif #if !defined strnicmp && !defined PORTABLE_STRNICMP #if defined __LINUX__ || defined __FreeBSD__ || defined __OpenBSD__ || defined __APPLE__ #define strnicmp strncasecmp #endif #endif #if !defined _totupper #define _totupper toupper #endif #if !defined INI_LINETERM #if defined __LINUX__ || defined __FreeBSD__ || defined __OpenBSD__ || defined __APPLE__ #define INI_LINETERM __T("\n") #else #define INI_LINETERM __T("\r\n") #endif #endif #if !defined INI_FILETYPE #error Missing definition for INI_FILETYPE. #endif #if !defined sizearray #define sizearray(a) (sizeof(a) / sizeof((a)[0])) #endif enum quote_option { QUOTE_NONE, QUOTE_ENQUOTE, QUOTE_DEQUOTE, }; #if defined PORTABLE_STRNICMP int strnicmp(const TCHAR *s1, const TCHAR *s2, size_t n) { while (n-- != 0 && (*s1 || *s2)) { register int c1, c2; c1 = *s1++; if ('a' <= c1 && c1 <= 'z') c1 += ('A' - 'a'); c2 = *s2++; if ('a' <= c2 && c2 <= 'z') c2 += ('A' - 'a'); if (c1 != c2) return c1 - c2; } /* while */ return 0; } #endif /* PORTABLE_STRNICMP */ static TCHAR *skipleading(const TCHAR *str) { assert(str != NULL); while ('\0' < *str && *str <= ' ') str++; return (TCHAR *)str; } static TCHAR *skiptrailing(const TCHAR *str, const TCHAR *base) { assert(str != NULL); assert(base != NULL); while (str > base && '\0' < *(str-1) && *(str-1) <= ' ') str--; return (TCHAR *)str; } static TCHAR *striptrailing(TCHAR *str) { TCHAR *ptr = skiptrailing(_tcschr(str, '\0'), str); assert(ptr != NULL); *ptr = '\0'; return str; } static TCHAR *ini_strncpy(TCHAR *dest, const TCHAR *source, size_t maxlen, enum quote_option option) { size_t d, s; assert(maxlen>0); assert(source != NULL && dest != NULL); assert((dest < source || (dest == source && option != QUOTE_ENQUOTE)) || dest > source + strlen(source)); if (option == QUOTE_ENQUOTE && maxlen < 3) option = QUOTE_NONE; /* cannot store two quotes and a terminating zero in less than 3 characters */ switch (option) { case QUOTE_NONE: for (d = 0; d < maxlen - 1 && source[d] != '\0'; d++) dest[d] = source[d]; assert(d < maxlen); dest[d] = '\0'; break; case QUOTE_ENQUOTE: d = 0; dest[d++] = '"'; for (s = 0; source[s] != '\0' && d < maxlen - 2; s++, d++) { if (source[s] == '"') { if (d >= maxlen - 3) break; /* no space to store the escape character plus the one that follows it */ dest[d++] = '\\'; } /* if */ dest[d] = source[s]; } /* for */ dest[d++] = '"'; dest[d] = '\0'; break; case QUOTE_DEQUOTE: for (d = s = 0; source[s] != '\0' && d < maxlen - 1; s++, d++) { if ((source[s] == '"' || source[s] == '\\') && source[s + 1] == '"') s++; dest[d] = source[s]; } /* for */ dest[d] = '\0'; break; default: assert(0); } /* switch */ return dest; } static TCHAR *cleanstring(TCHAR *string, enum quote_option *quotes) { int isstring; TCHAR *ep; assert(string != NULL); assert(quotes != NULL); /* Remove a trailing comment */ isstring = 0; for (ep = string; *ep != '\0' && ((*ep != ';' && *ep != '#') || isstring); ep++) { if (*ep == '"') { if (*(ep + 1) == '"') ep++; /* skip "" (both quotes) */ else isstring = !isstring; /* single quote, toggle isstring */ } else if (*ep == '\\' && *(ep + 1) == '"') { ep++; /* skip \" (both quotes */ } /* if */ } /* for */ assert(ep != NULL && (*ep == '\0' || *ep == ';' || *ep == '#')); *ep = '\0'; /* terminate at a comment */ striptrailing(string); /* Remove double quotes surrounding a value */ *quotes = QUOTE_NONE; if (*string == '"' && (ep = _tcschr(string, '\0')) != NULL && *(ep - 1) == '"') { string++; *--ep = '\0'; *quotes = QUOTE_DEQUOTE; /* this is a string, so remove escaped characters */ } /* if */ return string; } static int getkeystring(INI_FILETYPE *fp, const TCHAR *Section, const TCHAR *Key, int idxSection, int idxKey, TCHAR *Buffer, int BufferSize, INI_FILEPOS *mark) { TCHAR *sp, *ep; int len, idx; enum quote_option quotes; TCHAR LocalBuffer[INI_BUFFERSIZE]; assert(fp != NULL); /* Move through file 1 line at a time until a section is matched or EOF. If * parameter Section is NULL, only look at keys above the first section. If * idxSection is postive, copy the relevant section name. */ len = (Section != NULL) ? (int)_tcslen(Section) : 0; if (len > 0 || idxSection >= 0) { assert(idxSection >= 0 || Section != NULL); idx = -1; do { if (!ini_read(LocalBuffer, INI_BUFFERSIZE, fp)) return 0; sp = skipleading(LocalBuffer); ep = _tcsrchr(sp, ']'); } while (*sp != '[' || ep == NULL || (((int)(ep-sp-1) != len || Section == NULL || _tcsnicmp(sp+1,Section,len) != 0) && ++idx != idxSection)); if (idxSection >= 0) { if (idx == idxSection) { assert(ep != NULL); assert(*ep == ']'); *ep = '\0'; ini_strncpy(Buffer, sp + 1, BufferSize, QUOTE_NONE); return 1; } /* if */ return 0; /* no more section found */ } /* if */ } /* if */ /* Now that the section has been found, find the entry. * Stop searching upon leaving the section's area. */ assert(Key != NULL || idxKey >= 0); len = (Key != NULL) ? (int)_tcslen(Key) : 0; idx = -1; do { if (mark != NULL) ini_tell(fp, mark); /* optionally keep the mark to the start of the line */ if (!ini_read(LocalBuffer,INI_BUFFERSIZE,fp) || *(sp = skipleading(LocalBuffer)) == '[') return 0; sp = skipleading(LocalBuffer); ep = _tcschr(sp, '='); /* Parse out the equal sign */ if (ep == NULL) ep = _tcschr(sp, ':'); } while (*sp == ';' || *sp == '#' || ep == NULL || ((len == 0 || (int)(skiptrailing(ep,sp)-sp) != len || _tcsnicmp(sp,Key,len) != 0) && ++idx != idxKey)); if (idxKey >= 0) { if (idx == idxKey) { assert(ep != NULL); assert(*ep == '=' || *ep == ':'); *ep = '\0'; striptrailing(sp); ini_strncpy(Buffer, sp, BufferSize, QUOTE_NONE); return 1; } /* if */ return 0; /* no more key found (in this section) */ } /* if */ /* Copy up to BufferSize chars to buffer */ assert(ep != NULL); assert(*ep == '=' || *ep == ':'); sp = skipleading(ep + 1); sp = cleanstring(sp, "es); /* Remove a trailing comment */ ini_strncpy(Buffer, sp, BufferSize, quotes); return 1; } /** ini_gets() * \param Section the name of the section to search for * \param Key the name of the entry to find the value of * \param DefValue default string in the event of a failed read * \param Buffer a pointer to the buffer to copy into * \param BufferSize the maximum number of characters to copy * \param Filename the name and full path of the .ini file to read from * * \return the number of characters copied into the supplied buffer */ int ini_gets(const TCHAR *Section, const TCHAR *Key, const TCHAR *DefValue, TCHAR *Buffer, int BufferSize, const TCHAR *Filename) { INI_FILETYPE fp; int ok = 0; if (Buffer == NULL || BufferSize <= 0 || Key == NULL) return 0; if (ini_openread(Filename, &fp)) { ok = getkeystring(&fp, Section, Key, -1, -1, Buffer, BufferSize, NULL); (void)ini_close(&fp); } /* if */ if (!ok) ini_strncpy(Buffer, (DefValue != NULL) ? DefValue : __T(""), BufferSize, QUOTE_NONE); return (int)_tcslen(Buffer); } /** ini_getl() * \param Section the name of the section to search for * \param Key the name of the entry to find the value of * \param DefValue the default value in the event of a failed read * \param Filename the name of the .ini file to read from * * \return the value located at Key */ long ini_getl(const TCHAR *Section, const TCHAR *Key, long DefValue, const TCHAR *Filename) { TCHAR LocalBuffer[64]; int len = ini_gets(Section, Key, __T(""), LocalBuffer, sizearray(LocalBuffer), Filename); return (len == 0) ? DefValue : ((len >= 2 && _totupper((int)LocalBuffer[1]) == 'X') ? _tcstol(LocalBuffer, NULL, 16) : _tcstol(LocalBuffer, NULL, 10)); } #if defined INI_REAL /** ini_getf() * \param Section the name of the section to search for * \param Key the name of the entry to find the value of * \param DefValue the default value in the event of a failed read * \param Filename the name of the .ini file to read from * * \return the value located at Key */ INI_REAL ini_getf(const TCHAR *Section, const TCHAR *Key, INI_REAL DefValue, const TCHAR *Filename) { TCHAR LocalBuffer[64]; int len = ini_gets(Section, Key, __T(""), LocalBuffer, sizearray(LocalBuffer), Filename); return (len == 0) ? DefValue : ini_atof(LocalBuffer); } #endif /** ini_getbool() * \param Section the name of the section to search for * \param Key the name of the entry to find the value of * \param DefValue default value in the event of a failed read; it should * zero (0) or one (1). * \param Filename the name and full path of the .ini file to read from * * A true boolean is found if one of the following is matched: * - A string starting with 'y' or 'Y' * - A string starting with 't' or 'T' * - A string starting with '1' * * A false boolean is found if one of the following is matched: * - A string starting with 'n' or 'N' * - A string starting with 'f' or 'F' * - A string starting with '0' * * \return the true/false flag as interpreted at Key */ int ini_getbool(const TCHAR *Section, const TCHAR *Key, int DefValue, const TCHAR *Filename) { TCHAR LocalBuffer[2] = __T(""); int ret; ini_gets(Section, Key, __T(""), LocalBuffer, sizearray(LocalBuffer), Filename); LocalBuffer[0] = (TCHAR)_totupper((int)LocalBuffer[0]); if (LocalBuffer[0] == 'Y' || LocalBuffer[0] == '1' || LocalBuffer[0] == 'T') ret = 1; else if (LocalBuffer[0] == 'N' || LocalBuffer[0] == '0' || LocalBuffer[0] == 'F') ret = 0; else ret = DefValue; return(ret); } /** ini_getsection() * \param idx the zero-based sequence number of the section to return * \param Buffer a pointer to the buffer to copy into * \param BufferSize the maximum number of characters to copy * \param Filename the name and full path of the .ini file to read from * * \return the number of characters copied into the supplied buffer */ int ini_getsection(int idx, TCHAR *Buffer, int BufferSize, const TCHAR *Filename) { INI_FILETYPE fp; int ok = 0; if (Buffer == NULL || BufferSize <= 0 || idx < 0) return 0; if (ini_openread(Filename, &fp)) { ok = getkeystring(&fp, NULL, NULL, idx, -1, Buffer, BufferSize, NULL); (void)ini_close(&fp); } /* if */ if (!ok) *Buffer = '\0'; return (int)_tcslen(Buffer); } /** ini_getkey() * \param Section the name of the section to browse through, or NULL to * browse through the keys outside any section * \param idx the zero-based sequence number of the key to return * \param Buffer a pointer to the buffer to copy into * \param BufferSize the maximum number of characters to copy * \param Filename the name and full path of the .ini file to read from * * \return the number of characters copied into the supplied buffer */ int ini_getkey(const TCHAR *Section, int idx, TCHAR *Buffer, int BufferSize, const TCHAR *Filename) { INI_FILETYPE fp; int ok = 0; if (Buffer == NULL || BufferSize <= 0 || idx < 0) return 0; if (ini_openread(Filename, &fp)) { ok = getkeystring(&fp, Section, NULL, -1, idx, Buffer, BufferSize, NULL); (void)ini_close(&fp); } /* if */ if (!ok) *Buffer = '\0'; return (int)_tcslen(Buffer); } #if !defined INI_NOBROWSE /** ini_browse() * \param Callback a pointer to a function that will be called for every * setting in the INI file. * \param UserData arbitrary data, which the function passes on the the * \c Callback function * \param Filename the name and full path of the .ini file to read from * * \return 1 on success, 0 on failure (INI file not found) * * \note The \c Callback function must return 1 to continue * browsing through the INI file, or 0 to stop. Even when the * callback stops the browsing, this function will return 1 * (for success). */ int ini_browse(INI_CALLBACK Callback, void *UserData, const TCHAR *Filename) { TCHAR LocalBuffer[INI_BUFFERSIZE]; int lenSec, lenKey; enum quote_option quotes; INI_FILETYPE fp; if (Callback == NULL) return 0; if (!ini_openread(Filename, &fp)) return 0; LocalBuffer[0] = '\0'; /* copy an empty section in the buffer */ lenSec = (int)_tcslen(LocalBuffer) + 1; for ( ;; ) { TCHAR *sp, *ep; if (!ini_read(LocalBuffer + lenSec, INI_BUFFERSIZE - lenSec, &fp)) break; sp = skipleading(LocalBuffer + lenSec); /* ignore empty strings and comments */ if (*sp == '\0' || *sp == ';' || *sp == '#') continue; /* see whether we reached a new section */ ep = _tcsrchr(sp, ']'); if (*sp == '[' && ep != NULL) { *ep = '\0'; ini_strncpy(LocalBuffer, sp + 1, INI_BUFFERSIZE, QUOTE_NONE); lenSec = (int)_tcslen(LocalBuffer) + 1; continue; } /* if */ /* not a new section, test for a key/value pair */ ep = _tcschr(sp, '='); /* test for the equal sign or colon */ if (ep == NULL) ep = _tcschr(sp, ':'); if (ep == NULL) continue; /* invalid line, ignore */ *ep++ = '\0'; /* split the key from the value */ striptrailing(sp); ini_strncpy(LocalBuffer + lenSec, sp, INI_BUFFERSIZE - lenSec, QUOTE_NONE); lenKey = (int)_tcslen(LocalBuffer + lenSec) + 1; /* clean up the value */ sp = skipleading(ep); sp = cleanstring(sp, "es); /* Remove a trailing comment */ ini_strncpy(LocalBuffer + lenSec + lenKey, sp, INI_BUFFERSIZE - lenSec - lenKey, quotes); /* call the callback */ if (!Callback(LocalBuffer, LocalBuffer + lenSec, LocalBuffer + lenSec + lenKey, UserData)) break; } /* for */ (void)ini_close(&fp); return 1; } #endif /* INI_NOBROWSE */ #if ! defined INI_READONLY static void ini_tempname(TCHAR *dest, const TCHAR *source, int maxlength) { TCHAR *p; ini_strncpy(dest, source, maxlength, QUOTE_NONE); p = _tcsrchr(dest, '\0'); assert(p != NULL); *(p - 1) = '~'; } static enum quote_option check_enquote(const TCHAR *Value) { const TCHAR *p; /* run through the value, if it has trailing spaces, or '"', ';' or '#' * characters, enquote it */ assert(Value != NULL); for (p = Value; *p != '\0' && *p != '"' && *p != ';' && *p != '#'; p++) /* nothing */; return (*p != '\0' || (p > Value && *(p - 1) == ' ')) ? QUOTE_ENQUOTE : QUOTE_NONE; } static void writesection(TCHAR *LocalBuffer, const TCHAR *Section, INI_FILETYPE *fp) { if (Section != NULL && _tcslen(Section) > 0) { TCHAR *p; LocalBuffer[0] = '['; ini_strncpy(LocalBuffer + 1, Section, INI_BUFFERSIZE - 4, QUOTE_NONE); /* -1 for '[', -1 for ']', -2 for '\r\n' */ p = _tcsrchr(LocalBuffer, '\0'); assert(p != NULL); *p++ = ']'; _tcscpy(p, INI_LINETERM); /* copy line terminator (typically "\n") */ if (fp != NULL) (void)ini_write(LocalBuffer, fp); } /* if */ } static void writekey(TCHAR *LocalBuffer, const TCHAR *Key, const TCHAR *Value, INI_FILETYPE *fp) { TCHAR *p; enum quote_option option = check_enquote(Value); ini_strncpy(LocalBuffer, Key, INI_BUFFERSIZE - 3, QUOTE_NONE); /* -1 for '=', -2 for '\r\n' */ p = _tcsrchr(LocalBuffer, '\0'); assert(p != NULL); *p++ = '='; ini_strncpy(p, Value, INI_BUFFERSIZE - (p - LocalBuffer) - 2, option); /* -2 for '\r\n' */ p = _tcsrchr(LocalBuffer, '\0'); assert(p != NULL); _tcscpy(p, INI_LINETERM); /* copy line terminator (typically "\n") */ if (fp != NULL) (void)ini_write(LocalBuffer, fp); } static int cache_accum(const TCHAR *string, int *size, int max) { int len = (int)_tcslen(string); if (*size + len >= max) return 0; *size += len; return 1; } static int cache_flush(TCHAR *buffer, int *size, INI_FILETYPE *rfp, INI_FILETYPE *wfp, INI_FILEPOS *mark) { int terminator_len = (int)_tcslen(INI_LINETERM); int pos = 0; (void)ini_seek(rfp, mark); assert(buffer != NULL); buffer[0] = '\0'; assert(size != NULL); assert(*size <= INI_BUFFERSIZE); while (pos < *size) { (void)ini_read(buffer + pos, INI_BUFFERSIZE - pos, rfp); while (pos < *size && buffer[pos] != '\0') pos++; /* cannot use _tcslen() because buffer may not be zero-terminated */ } /* while */ if (buffer[0] != '\0') { assert(pos > 0 && pos <= INI_BUFFERSIZE); if (pos == INI_BUFFERSIZE) pos--; buffer[pos] = '\0'; /* force zero-termination (may be left unterminated in the above while loop) */ (void)ini_write(buffer, wfp); } ini_tell(rfp, mark); /* update mark */ *size = 0; /* return whether the buffer ended with a line termination */ return (pos > terminator_len) && (_tcscmp(buffer + pos - terminator_len, INI_LINETERM) == 0); } static int close_rename(INI_FILETYPE *rfp, INI_FILETYPE *wfp, const TCHAR *filename, TCHAR *buffer) { (void)ini_close(rfp); (void)ini_close(wfp); (void)ini_remove(filename); (void)ini_tempname(buffer, filename, INI_BUFFERSIZE); (void)ini_rename(buffer, filename); return 1; } /** ini_puts() * \param Section the name of the section to write the string in * \param Key the name of the entry to write, or NULL to erase all keys in the section * \param Value a pointer to the buffer the string, or NULL to erase the key * \param Filename the name and full path of the .ini file to write to * * \return 1 if successful, otherwise 0 */ int ini_puts(const TCHAR *Section, const TCHAR *Key, const TCHAR *Value, const TCHAR *Filename) { INI_FILETYPE rfp; INI_FILETYPE wfp; INI_FILEPOS mark; INI_FILEPOS head, tail; TCHAR *sp, *ep; TCHAR LocalBuffer[INI_BUFFERSIZE]; int len, match, flag, cachelen; assert(Filename != NULL); if (!ini_openread(Filename, &rfp)) { /* If the .ini file doesn't exist, make a new file */ if (Key != NULL && Value != NULL) { if (!ini_openwrite(Filename, &wfp)) return 0; writesection(LocalBuffer, Section, &wfp); writekey(LocalBuffer, Key, Value, &wfp); (void)ini_close(&wfp); } /* if */ return 1; } /* if */ /* If parameters Key and Value are valid (so this is not an "erase" request) * and the setting already exists, there are two short-cuts to avoid rewriting * the INI file. */ if (Key != NULL && Value != NULL) { ini_tell(&rfp, &mark); match = getkeystring(&rfp, Section, Key, -1, -1, LocalBuffer, sizearray(LocalBuffer), &head); if (match) { /* if the current setting is identical to the one to write, there is * nothing to do. */ if (_tcscmp(LocalBuffer,Value) == 0) { (void)ini_close(&rfp); return 1; } /* if */ /* if the new setting has the same length as the current setting, and the * glue file permits file read/write access, we can modify in place. */ #if defined ini_openrewrite /* we already have the start of the (raw) line, get the end too */ ini_tell(&rfp, &tail); /* create new buffer (without writing it to file) */ writekey(LocalBuffer, Key, Value, NULL); if (_tcslen(LocalBuffer) == (size_t)(tail - head)) { /* length matches, close the file & re-open for read/write, then * write at the correct position */ (void)ini_close(&rfp); if (!ini_openrewrite(Filename, &wfp)) return 0; (void)ini_seek(&wfp, &head); (void)ini_write(LocalBuffer, &wfp); (void)ini_close(&wfp); return 1; } /* if */ #endif } /* if */ /* key not found, or different value & length -> proceed (but rewind the * input file first) */ (void)ini_seek(&rfp, &mark); } /* if */ /* Get a temporary file name to copy to. Use the existing name, but with * the last character set to a '~'. */ ini_tempname(LocalBuffer, Filename, INI_BUFFERSIZE); if (!ini_openwrite(LocalBuffer, &wfp)) { (void)ini_close(&rfp); return 0; } /* if */ (void)ini_tell(&rfp, &mark); cachelen = 0; /* Move through the file one line at a time until a section is * matched or until EOF. Copy to temp file as it is read. */ len = (Section != NULL) ? (int)_tcslen(Section) : 0; if (len > 0) { do { if (!ini_read(LocalBuffer, INI_BUFFERSIZE, &rfp)) { /* Failed to find section, so add one to the end */ flag = cache_flush(LocalBuffer, &cachelen, &rfp, &wfp, &mark); if (Key!=NULL && Value!=NULL) { if (!flag) (void)ini_write(INI_LINETERM, &wfp); /* force a new line behind the last line of the INI file */ writesection(LocalBuffer, Section, &wfp); writekey(LocalBuffer, Key, Value, &wfp); } /* if */ return close_rename(&rfp, &wfp, Filename, LocalBuffer); /* clean up and rename */ } /* if */ /* Copy the line from source to dest, but not if this is the section that * we are looking for and this section must be removed */ sp = skipleading(LocalBuffer); ep = _tcsrchr(sp, ']'); match = (*sp == '[' && ep != NULL && (int)(ep-sp-1) == len && _tcsnicmp(sp + 1,Section,len) == 0); if (!match || Key != NULL) { if (!cache_accum(LocalBuffer, &cachelen, INI_BUFFERSIZE)) { cache_flush(LocalBuffer, &cachelen, &rfp, &wfp, &mark); (void)ini_read(LocalBuffer, INI_BUFFERSIZE, &rfp); cache_accum(LocalBuffer, &cachelen, INI_BUFFERSIZE); } /* if */ } /* if */ } while (!match); } /* if */ cache_flush(LocalBuffer, &cachelen, &rfp, &wfp, &mark); /* when deleting a section, the section head that was just found has not been * copied to the output file, but because this line was not "accumulated" in * the cache, the position in the input file was reset to the point just * before the section; this must now be skipped (again) */ if (Key == NULL) { (void)ini_read(LocalBuffer, INI_BUFFERSIZE, &rfp); (void)ini_tell(&rfp, &mark); } /* if */ /* Now that the section has been found, find the entry. Stop searching * upon leaving the section's area. Copy the file as it is read * and create an entry if one is not found. */ len = (Key != NULL) ? (int)_tcslen(Key) : 0; for( ;; ) { if (!ini_read(LocalBuffer, INI_BUFFERSIZE, &rfp)) { /* EOF without an entry so make one */ flag = cache_flush(LocalBuffer, &cachelen, &rfp, &wfp, &mark); if (Key!=NULL && Value!=NULL) { if (!flag) (void)ini_write(INI_LINETERM, &wfp); /* force a new line behind the last line of the INI file */ writekey(LocalBuffer, Key, Value, &wfp); } /* if */ return close_rename(&rfp, &wfp, Filename, LocalBuffer); /* clean up and rename */ } /* if */ sp = skipleading(LocalBuffer); ep = _tcschr(sp, '='); /* Parse out the equal sign */ if (ep == NULL) ep = _tcschr(sp, ':'); match = (ep != NULL && len > 0 && (int)(skiptrailing(ep,sp)-sp) == len && _tcsnicmp(sp,Key,len) == 0); if ((Key != NULL && match) || *sp == '[') break; /* found the key, or found a new section */ /* copy other keys in the section */ if (Key == NULL) { (void)ini_tell(&rfp, &mark); /* we are deleting the entire section, so update the read position */ } else { if (!cache_accum(LocalBuffer, &cachelen, INI_BUFFERSIZE)) { cache_flush(LocalBuffer, &cachelen, &rfp, &wfp, &mark); (void)ini_read(LocalBuffer, INI_BUFFERSIZE, &rfp); cache_accum(LocalBuffer, &cachelen, INI_BUFFERSIZE); } /* if */ } /* if */ } /* for */ /* the key was found, or we just dropped on the next section (meaning that it * wasn't found); in both cases we need to write the key, but in the latter * case, we also need to write the line starting the new section after writing * the key */ flag = (*sp == '['); cache_flush(LocalBuffer, &cachelen, &rfp, &wfp, &mark); if (Key != NULL && Value != NULL) writekey(LocalBuffer, Key, Value, &wfp); /* cache_flush() reset the "read pointer" to the start of the line with the * previous key or the new section; read it again (because writekey() destroyed * the buffer) */ (void)ini_read(LocalBuffer, INI_BUFFERSIZE, &rfp); if (flag) { /* the new section heading needs to be copied to the output file */ cache_accum(LocalBuffer, &cachelen, INI_BUFFERSIZE); } else { /* forget the old key line */ (void)ini_tell(&rfp, &mark); } /* if */ /* Copy the rest of the INI file */ while (ini_read(LocalBuffer, INI_BUFFERSIZE, &rfp)) { if (!cache_accum(LocalBuffer, &cachelen, INI_BUFFERSIZE)) { cache_flush(LocalBuffer, &cachelen, &rfp, &wfp, &mark); (void)ini_read(LocalBuffer, INI_BUFFERSIZE, &rfp); cache_accum(LocalBuffer, &cachelen, INI_BUFFERSIZE); } /* if */ } /* while */ cache_flush(LocalBuffer, &cachelen, &rfp, &wfp, &mark); return close_rename(&rfp, &wfp, Filename, LocalBuffer); /* clean up and rename */ } /* Ansi C "itoa" based on Kernighan & Ritchie's "Ansi C" book. */ #define ABS(v) ((v) < 0 ? -(v) : (v)) static void strreverse(TCHAR *str) { int i, j; for (i = 0, j = (int)_tcslen(str) - 1; i < j; i++, j--) { TCHAR t = str[i]; str[i] = str[j]; str[j] = t; } /* for */ } static void long2str(long value, TCHAR *str) { int i = 0; long sign = value; /* generate digits in reverse order */ do { int n = (int)(value % 10); /* get next lowest digit */ str[i++] = (TCHAR)(ABS(n) + '0'); /* handle case of negative digit */ } while (value /= 10); /* delete the lowest digit */ if (sign < 0) str[i++] = '-'; str[i] = '\0'; strreverse(str); } /** ini_putl() * \param Section the name of the section to write the value in * \param Key the name of the entry to write * \param Value the value to write * \param Filename the name and full path of the .ini file to write to * * \return 1 if successful, otherwise 0 */ int ini_putl(const TCHAR *Section, const TCHAR *Key, long Value, const TCHAR *Filename) { TCHAR LocalBuffer[32]; long2str(Value, LocalBuffer); return ini_puts(Section, Key, LocalBuffer, Filename); } #if defined INI_REAL /** ini_putf() * \param Section the name of the section to write the value in * \param Key the name of the entry to write * \param Value the value to write * \param Filename the name and full path of the .ini file to write to * * \return 1 if successful, otherwise 0 */ int ini_putf(const TCHAR *Section, const TCHAR *Key, INI_REAL Value, const TCHAR *Filename) { TCHAR LocalBuffer[64]; ini_ftoa(LocalBuffer, Value); return ini_puts(Section, Key, LocalBuffer, Filename); } #endif /* INI_REAL */ #endif /* !INI_READONLY */ uTox/third_party/minini/minini/dev/minGlue.h0000600000175000001440000000314114003056224020122 0ustar rakusers/* Glue functions for the minIni library, based on the C/C++ stdio library * * Or better said: this file contains macros that maps the function interface * used by minIni to the standard C/C++ file I/O functions. * * By CompuPhase, 2008-2014 * This "glue file" is in the public domain. It is distributed without * warranties or conditions of any kind, either express or implied. */ /* map required file I/O types and functions to the standard C library */ #include #define INI_FILETYPE FILE* #define ini_openread(filename,file) ((*(file) = fopen((filename),"rb")) != NULL) #define ini_openwrite(filename,file) ((*(file) = fopen((filename),"wb")) != NULL) #define ini_openrewrite(filename,file) ((*(file) = fopen((filename),"r+b")) != NULL) #define ini_close(file) (fclose(*(file)) == 0) #define ini_read(buffer,size,file) (fgets((buffer),(size),*(file)) != NULL) #define ini_write(buffer,file) (fputs((buffer),*(file)) >= 0) #define ini_rename(source,dest) (rename((source), (dest)) == 0) #define ini_remove(filename) (remove(filename) == 0) #define INI_FILEPOS long int #define ini_tell(file,pos) (*(pos) = ftell(*(file))) #define ini_seek(file,pos) (fseek(*(file), *(pos), SEEK_SET) == 0) /* for floating-point support, define additional types and functions */ #define INI_REAL float #define ini_ftoa(string,value) sprintf((string),"%f",(value)) #define ini_atof(string) (INI_REAL)strtod((string),NULL) uTox/third_party/minini/minini/dev/minGlue-stdio.h0000600000175000001440000000312214003056224021241 0ustar rakusers/* Glue functions for the minIni library, based on the C/C++ stdio library * * Or better said: this file contains macros that maps the function interface * used by minIni to the standard C/C++ file I/O functions. * * By CompuPhase, 2008-2014 * This "glue file" is in the public domain. It is distributed without * warranties or conditions of any kind, either express or implied. */ /* map required file I/O types and functions to the standard C library */ #include #define INI_FILETYPE FILE* #define ini_openread(filename,file) ((*(file) = fopen((filename),"rb")) != NULL) #define ini_openwrite(filename,file) ((*(file) = fopen((filename),"wb")) != NULL) #define ini_openrewrite(filename,file) ((*(file) = fopen((filename),"r+b")) != NULL) #define ini_close(file) (fclose(*(file)) == 0) #define ini_read(buffer,size,file) (fgets((buffer),(size),*(file)) != NULL) #define ini_write(buffer,file) (fputs((buffer),*(file)) >= 0) #define ini_rename(source,dest) (rename((source), (dest)) == 0) #define ini_remove(filename) (remove(filename) == 0) #define INI_FILEPOS long int #define ini_tell(file,pos) (*(pos) = ftell(*(file))) #define ini_seek(file,pos) (fseek(*(file), *(pos), SEEK_SET) == 0) /* for floating-point support, define additional types and functions */ #define INI_REAL float #define ini_ftoa(string,value) sprintf((string),"%f",(value)) #define ini_atof(string) (INI_REAL)strtod((string),NULL) uTox/third_party/minini/minini/dev/minGlue-mdd.h0000600000175000001440000000441214003056224020666 0ustar rakusers/* minIni glue functions for Microchip's "Memory Disk Drive" file system * library, as presented in Microchip application note AN1045. * * By CompuPhase, 2011-2014 * This "glue file" is in the public domain. It is distributed without * warranties or conditions of any kind, either express or implied. * * (The "Microchip Memory Disk Drive File System" is copyright (c) Microchip * Technology Incorporated, and licensed at its own terms.) */ #define INI_BUFFERSIZE 256 /* maximum line length, maximum path length */ #include "MDD File System\fsio.h" #include #define INI_FILETYPE FSFILE* #define ini_openread(filename,file) ((*(file) = FSfopen((filename),FS_READ)) != NULL) #define ini_openwrite(filename,file) ((*(file) = FSfopen((filename),FS_WRITE)) != NULL) #define ini_openrewrite(filename,file) ((*(file) = fopen((filename),FS_READPLUS)) != NULL) #define ini_close(file) (FSfclose(*(file)) == 0) #define ini_write(buffer,file) (FSfwrite((buffer), 1, strlen(buffer), (*file)) > 0) #define ini_remove(filename) (FSremove((filename)) == 0) #define INI_FILEPOS long int #define ini_tell(file,pos) (*(pos) = FSftell(*(file))) #define ini_seek(file,pos) (FSfseek(*(file), *(pos), SEEK_SET) == 0) /* Since the Memory Disk Drive file system library reads only blocks of files, * the function to read a text line does so by "over-reading" a block of the * of the maximum size and truncating it behind the end-of-line. */ static int ini_read(char *buffer, int size, INI_FILETYPE *file) { size_t numread = size; char *eol; if ((numread = FSfread(buffer, 1, size, *file)) == 0) return 0; /* at EOF */ if ((eol = strchr(buffer, '\n')) == NULL) eol = strchr(buffer, '\r'); if (eol != NULL) { /* terminate the buffer */ *++eol = '\0'; /* "unread" the data that was read too much */ FSfseek(*file, - (int)(numread - (size_t)(eol - buffer)), SEEK_CUR); } /* if */ return 1; } #ifndef INI_READONLY static int ini_rename(const char *source, const char *dest) { FSFILE* ftmp = FSfopen((source), FS_READ); FSrename((dest), ftmp); return FSfclose(ftmp) == 0; } #endif uTox/third_party/minini/minini/dev/minGlue-ffs.h0000600000175000001440000000242614003056224020703 0ustar rakusers/* Glue functions for the minIni library, based on the "FAT Filing System" * library by embedded-code.com * * By CompuPhase, 2008-2012 * This "glue file" is in the public domain. It is distributed without * warranties or conditions of any kind, either express or implied. * * (The "FAT Filing System" library itself is copyright embedded-code.com, and * licensed at its own terms.) */ #define INI_BUFFERSIZE 256 /* maximum line length, maximum path length */ #include #define INI_FILETYPE FFS_FILE* #define ini_openread(filename,file) ((*(file) = ffs_fopen((filename),"r")) != NULL) #define ini_openwrite(filename,file) ((*(file) = ffs_fopen((filename),"w")) != NULL) #define ini_close(file) (ffs_fclose(*(file)) == 0) #define ini_read(buffer,size,file) (ffs_fgets((buffer),(size),*(file)) != NULL) #define ini_write(buffer,file) (ffs_fputs((buffer),*(file)) >= 0) #define ini_rename(source,dest) (ffs_rename((source), (dest)) == 0) #define ini_remove(filename) (ffs_remove(filename) == 0) #define INI_FILEPOS long #define ini_tell(file,pos) (ffs_fgetpos(*(file), (pos)) == 0) #define ini_seek(file,pos) (ffs_fsetpos(*(file), (pos)) == 0) uTox/third_party/minini/minini/dev/minGlue-efsl.h0000600000175000001440000000473014003056224021056 0ustar rakusers/* Glue functions for the minIni library, based on the EFS Library, see * http://www.efsl.be/ * * By CompuPhase, 2008-2012 * This "glue file" is in the public domain. It is distributed without * warranties or conditions of any kind, either express or implied. * * (EFSL is copyright 2005-2006 Lennart Ysboodt and Michael De Nil, and * licensed under the GPL with an exception clause for static linking.) */ #define INI_BUFFERSIZE 256 /* maximum line length, maximum path length */ #define INI_LINETERM "\r\n" /* set line termination explicitly */ #include "efs.h" extern EmbeddedFileSystem g_efs; #define INI_FILETYPE EmbeddedFile #define ini_openread(filename,file) (file_fopen((file), &g_efs.myFs, (char*)(filename), 'r') == 0) #define ini_openwrite(filename,file) (file_fopen((file), &g_efs.myFs, (char*)(filename), 'w') == 0) #define ini_close(file) file_fclose(file) #define ini_read(buffer,size,file) (file_read((file), (size), (buffer)) > 0) #define ini_write(buffer,file) (file_write((file), strlen(buffer), (char*)(buffer)) > 0) #define ini_remove(filename) rmfile(&g_efs.myFs, (char*)(filename)) #define INI_FILEPOS euint32 #define ini_tell(file,pos) (*(pos) = (file)->FilePtr)) #define ini_seek(file,pos) file_setpos((file), (*pos)) #if ! defined INI_READONLY /* EFSL lacks a rename function, so instead we copy the file to the new name * and delete the old file */ static int ini_rename(char *source, const char *dest) { EmbeddedFile fr, fw; int n; if (file_fopen(&fr, &g_efs.myFs, source, 'r') != 0) return 0; if (rmfile(&g_efs.myFs, (char*)dest) != 0) return 0; if (file_fopen(&fw, &g_efs.myFs, (char*)dest, 'w') != 0) return 0; /* With some "insider knowledge", we can save some memory: the "source" * parameter holds a filename that was built from the "dest" parameter. It * was built in buffer and this buffer has the size INI_BUFFERSIZE. We can * reuse this buffer for copying the file. */ while (n=file_read(&fr, INI_BUFFERSIZE, source)) file_write(&fw, n, source); file_fclose(&fr); file_fclose(&fw); /* Now we need to delete the source file. However, we have garbled the buffer * that held the filename of the source. So we need to build it again. */ ini_tempname(source, dest, INI_BUFFERSIZE); return rmfile(&g_efs.myFs, source) == 0; } #endif uTox/third_party/minini/minini/dev/minGlue-ccs.h0000600000175000001440000000450614003056224020676 0ustar rakusers/* minIni glue functions for FAT library by CCS, Inc. (as provided with their * PIC MCU compiler) * * By CompuPhase, 2011-2012 * This "glue file" is in the public domain. It is distributed without * warranties or conditions of any kind, either express or implied. * * (The FAT library is copyright (c) 2007 Custom Computer Services, and * licensed at its own terms.) */ #define INI_BUFFERSIZE 256 /* maximum line length, maximum path length */ #ifndef FAT_PIC_C #error FAT library must be included before this module #endif #define const /* keyword not supported by CCS */ #define INI_FILETYPE FILE #define ini_openread(filename,file) (fatopen((filename), "r", (file)) == GOODEC) #define ini_openwrite(filename,file) (fatopen((filename), "w", (file)) == GOODEC) #define ini_close(file) (fatclose((file)) == 0) #define ini_read(buffer,size,file) (fatgets((buffer), (size), (file)) != NULL) #define ini_write(buffer,file) (fatputs((buffer), (file)) == GOODEC) #define ini_remove(filename) (rm_file((filename)) == 0) #define INI_FILEPOS fatpos_t #define ini_tell(file,pos) (fatgetpos((file), (pos)) == 0) #define ini_seek(file,pos) (fatsetpos((file), (pos)) == 0) #ifndef INI_READONLY /* CCS FAT library lacks a rename function, so instead we copy the file to the * new name and delete the old file */ static int ini_rename(char *source, char *dest) { FILE fr, fw; int n; if (fatopen(source, "r", &fr) != GOODEC) return 0; if (rm_file(dest) != 0) return 0; if (fatopen(dest, "w", &fw) != GOODEC) return 0; /* With some "insider knowledge", we can save some memory: the "source" * parameter holds a filename that was built from the "dest" parameter. It * was built in a local buffer with the size INI_BUFFERSIZE. We can reuse * this buffer for copying the file. */ while (n=fatread(source, 1, INI_BUFFERSIZE, &fr)) fatwrite(source, 1, n, &fw); fatclose(&fr); fatclose(&fw); /* Now we need to delete the source file. However, we have garbled the buffer * that held the filename of the source. So we need to build it again. */ ini_tempname(source, dest, INI_BUFFERSIZE); return rm_file(source) == 0; } #endif uTox/third_party/minini/minini/dev/minGlue-FatFs.h0000600000175000001440000000323314003056224021125 0ustar rakusers/* Glue functions for the minIni library, based on the FatFs and Petit-FatFs * libraries, see http://elm-chan.org/fsw/ff/00index_e.html * * By CompuPhase, 2008-2012 * This "glue file" is in the public domain. It is distributed without * warranties or conditions of any kind, either express or implied. * * (The FatFs and Petit-FatFs libraries are copyright by ChaN and licensed at * its own terms.) */ #define INI_BUFFERSIZE 256 /* maximum line length, maximum path length */ /* You must set _USE_STRFUNC to 1 or 2 in the include file ff.h (or tff.h) * to enable the "string functions" fgets() and fputs(). */ #include "ff.h" /* include tff.h for Tiny-FatFs */ #define INI_FILETYPE FIL #define ini_openread(filename,file) (f_open((file), (filename), FA_READ+FA_OPEN_EXISTING) == FR_OK) #define ini_openwrite(filename,file) (f_open((file), (filename), FA_WRITE+FA_CREATE_ALWAYS) == FR_OK) #define ini_close(file) (f_close(file) == FR_OK) #define ini_read(buffer,size,file) f_gets((buffer), (size),(file)) #define ini_write(buffer,file) f_puts((buffer), (file)) #define ini_remove(filename) (f_unlink(filename) == FR_OK) #define INI_FILEPOS DWORD #define ini_tell(file,pos) (*(pos) = f_tell((file))) #define ini_seek(file,pos) (f_lseek((file), *(pos)) == FR_OK) static int ini_rename(TCHAR *source, const TCHAR *dest) { /* Function f_rename() does not allow drive letters in the destination file */ char *drive = strchr(dest, ':'); drive = (drive == NULL) ? dest : drive + 1; return (f_rename(source, drive) == FR_OK); } uTox/third_party/minini/minini/README.md0000600000175000001440000002323314003056224017056 0ustar rakusers# minIni minIni is a portable and configurable library for reading and writing ".INI" files. At 830 lines of commented source code (version 1.2), minIni truly is a "mini" INI file parser, especially considering its features. The library does not require the file I/O functions from the standard C/C++ library, but instead lets you configure the file I/O interface to use via macros. minIni uses limited stack space and does not use dynamic memory (malloc and friends) at all. Some minor variations on standard INI files are supported too, notably minIni supports INI files that lack sections. # Acknowledgement minIni is derived from an earlier INI file parser (which I wrote) for desktop systems. In turn, that earlier parser was a re-write of the code from the article "Multiplatform .INI Files" by Joseph J. Graf in the March 1994 issue of Dr. Dobb's Journal. In other words, minIni has its roots in the work of Joseph Graf (even though the code has been almost completely re-written). # Features minIni is a programmer's library to read and write "INI" files in embedded systems. minIni takes little resources, can be configured for various kinds of file I/O libraries and provides functionality for reading, writing and deleting keys from an INI file. Although the main feature of minIni is that it is small and minimal, it has a few other features: * minIni supports reading keys that are outside a section, and it thereby supports configuration files that do not use sections (but that are otherwise compatible with INI files). * You may use a colon to separate key and value; the colon is equivalent to the equal sign. That is, the strings "Name: Value" and "Name=Value" have the same meaning. * The hash character ("#") is an alternative for the semicolon to start a comment. Trailing comments (i.e. behind a key/value pair on a line) are allowed. * Leading and trailing white space around key names and values is ignored. * When writing a value that contains a comment character (";" or "#"), that value will automatically be put between double quotes; when reading the value, these quotes are removed. When a double-quote itself appears in the setting, these characters are escaped. * Section and key enumeration are supported. * You can optionally set the line termination (for text files) that minIni will use. (This is a compile-time setting, not a run-time setting.) * Since writing speed is much lower than reading speed in Flash memory (SD/MMC cards, USB memory sticks), minIni minimizes "file writes" at the expense of double "file reads". * The memory footprint is deterministic. There is no dynamic memory allocation. ## INI file reading paradigms There are two approaches to reading settings from an INI file. One way is to call a function, such as GetProfileString() for every section and key that you need. This is especially convenient if there is a large INI file, but you only need a few settings from that file at any time —especially if the INI file can also change while your program runs. This is the approach that the Microsoft Windows API uses. The above procedure is quite inefficient, however, when you need to retrieve quite a few settings in a row from the INI file —especially if the INI file is not cached in memory (which it isn't, in minIni). A different approach to getting settings from an INI file is to call a "parsing" function and let that function call the application back with the section and key names plus the associated data. XML parsing libraries often use this approach; see for example the Expat library. minIni supports both approaches. For reading a single setting, use functions like ini_gets(). For the callback approach, implement a callback and call ini_browse(). See the minIni manual for details. # INI file syntax INI files are best known from Microsoft Windows, but they are also used with applications that run on other platforms (although their file extension is sometimes ".cfg" instead of ".ini"). INI files have a simple syntax with name/value pairs in a plain text file. The name must be unique (per section) and the value must fit on a single line. INI files are commonly separated into sections —in minIni, this is optional. A section is a name between square brackets, like "[Network]" in the example below. ``` [Network] hostname=My Computer address=dhcp dns = 192.168.1.1 ``` In the API and in this documentation, the "name" for a setting is denoted as the key for the setting. The key and the value are separated by an equal sign ("="). minIni supports the colon (":") as an alternative to the equal sign for the key/value delimiter. Leading a trailing spaces around values or key names are removed. If you need to include leading and/or trailing spaces in a value, put the value between double quotes. The ini_gets() function (from the minIni library, see the minIni manual) strips off the double quotes from the returned value. Function ini_puts() adds double quotes if the value to write contains trailing white space (or special characters). minIni ignores spaces around the "=" or ":" delimiters, but it does not ignore spaces between the brackets in a section name. In other words, it is best not to put spaces behind the opening bracket "[" or before the closing bracket "]" of a section name. Comments in the INI must start with a semicolon (";") or a hash character ("#"), and run to the end of the line. A comment can be a line of its own, or it may follow a key/value pair (the "#" character and trailing comments are extensions of minIni). For more details on the format, please see http://en.wikipedia.org/wiki/INI_file. # Adapting minIni to a file system The minIni library must be configured for a platform with the help of a so- called "glue file". This glue file contains macros (and possibly functions) that map file reading and writing functions used by the minIni library to those provided by the operating system. The glue file must be called "minGlue.h". To get you started, the minIni distribution comes with the following example glue files: * a glue file that maps to the standard C/C++ library (specifically the file I/O functions from the "stdio" package), * a glue file for Microchip's "Memory Disk Drive File System Library" (see http://www.microchip.com/), * a glue file for the FAT library provided with the CCS PIC compiler (see http://www.ccsinfo.com/) * a glue file for the EFS Library (EFSL, http://www.efsl.be/), * and a glue file for the FatFs and Petit-FatFs libraries (http://elm-chan.org/fsw/ff/00index_e.html). The minIni library does not rely on the availability of a standard C library, because embedded operating systems may have limited support for file I/O. Even on full operating systems, separating the file I/O from the INI format parsing carries advantages, because it allows you to cache the INI file and thereby enhance performance. The glue file must specify the type that identifies a file, whether it is a handle or a pointer. For the standard C/C++ file I/O library, this would be: ```C #define INI_FILETYPE FILE* ``` If you are not using the standard C/C++ file I/O library, chances are that you need a different handle or "structure" to identify the storage than the ubiquitous "FILE*" type. For example, the glue file for the FatFs library uses the following declaration: ```C #define INI_FILETYPE FIL ``` The minIni functions declare variables of this INI_FILETYPE type and pass these variables to sub-functions (including the glue interface functions) by reference. For "write support", another type that must be defined is for variables that hold the "current position" in a file. For the standard C/C++ I/O library, this is "fpos_t". Another item that needs to be configured is the buffer size. The functions in the minIni library allocate this buffer on the stack, so the buffer size is directly related to the stack usage. In addition, the buffer size determines the maximum line length that is supported in the INI file and the maximum path name length for the temporary file. For example, minGlue.h could contain the definition: ```C #define INI_BUFFERSIZE 512 ``` The above macro limits the line length of the INI files supported by minIni to 512 characters. The temporary file is only used when writing to INI files. The minIni routines copy/change the INI file to a temporary file and then rename that temporary file to the original file. This approach uses the least amount of memory. The path name of the temporary file is the same as the input file, but with the last character set to a tilde ("~"). Below is an example of a glue file (this is the one that maps to the C/C++ "stdio" library). ```C #include #define INI_FILETYPE FILE* #define ini_openread(filename,file) ((*(file) = fopen((filename),"r")) != NULL) #define ini_openwrite(filename,file) ((*(file) = fopen((filename),"w")) != NULL) #define ini_close(file) (fclose(*(file)) == 0) #define ini_read(buffer,size,file) (fgets((buffer),(size),*(file)) != NULL) #define ini_write(buffer,file) (fputs((buffer),*(file)) >= 0) #define ini_rename(source,dest) (rename((source), (dest)) == 0) #define ini_remove(filename) (remove(filename) == 0) #define INI_FILEPOS fpos_t #define ini_tell(file,pos) (fgetpos(*(file), (pos)) == 0) #define ini_seek(file,pos) (fsetpos(*(file), (pos)) == 0) ``` As you can see, a glue file is mostly a set of macros that wraps one function definition around another. The glue file may contain more settings, for support of rational numbers, to explicitly set the line termination character(s), or to disable write support (for example). See the manual that comes with the archive for the details. uTox/third_party/minini/minini/NOTICE0000600000175000001440000000102314003056224016474 0ustar rakusersminIni is a programmer's library to read and write "INI" files in embedded systems. The library takes little resources and can be configured for various kinds of file I/O libraries. The method for portable INI file management in minIni is, in part based, on the article "Multiplatform .INI Files" by Joseph J. Graf in the March 1994 issue of Dr. Dobb's Journal. The C++ class in minIni.h was contributed by Steven Van Ingelgem. The option to compile minIni as a read-only library was contributed by Luca Bassanello. uTox/third_party/minini/minini/LICENSE0000600000175000001440000002504714003056224016611 0ustar rakusers Apache License Version 2.0, January 2004 http://www.apache.org/licenses/ EXCEPTION TO THE APACHE 2.0 LICENSE As a special exception to the Apache License 2.0 (and referring to the definitions in Section 1 of this license), you may link, statically or dynamically, the "Work" to other modules to produce an executable file containing portions of the "Work", and distribute that executable file in "Object" form under the terms of your choice, without any of the additional requirements listed in Section 4 of the Apache License 2.0. This exception applies only to redistributions in "Object" form (not "Source" form) and only if no modifications have been made to the "Work". TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION 1. Definitions. "License" shall mean the terms and conditions for use, reproduction, and distribution as defined by Sections 1 through 9 of this document. "Licensor" shall mean the copyright owner or entity authorized by the copyright owner that is granting the License. "Legal Entity" shall mean the union of the acting entity and all other entities that control, are controlled by, or are under common control with that entity. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity. "You" (or "Your") shall mean an individual or Legal Entity exercising permissions granted by this License. "Source" form shall mean the preferred form for making modifications, including but not limited to software source code, documentation source, and configuration files. "Object" form shall mean any form resulting from mechanical transformation or translation of a Source form, including but not limited to compiled object code, generated documentation, and conversions to other media types. "Work" shall mean the work of authorship, whether in Source or Object form, made available under the License, as indicated by a copyright notice that is included in or attached to the work (an example is provided in the Appendix below). "Derivative Works" shall mean any work, whether in Source or Object form, that is based on (or derived from) the Work and for which the editorial revisions, annotations, elaborations, or other modifications represent, as a whole, an original work of authorship. For the purposes of this License, Derivative Works shall not include works that remain separable from, or merely link (or bind by name) to the interfaces of, the Work and Derivative Works thereof. "Contribution" shall mean any work of authorship, including the original version of the Work and any modifications or additions to that Work or Derivative Works thereof, that is intentionally submitted to Licensor for inclusion in the Work by the copyright owner or by an individual or Legal Entity authorized to submit on behalf of the copyright owner. For the purposes of this definition, "submitted" means any form of electronic, verbal, or written communication sent to the Licensor or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, the Licensor for the purpose of discussing and improving the Work, but excluding communication that is conspicuously marked or otherwise designated in writing by the copyright owner as "Not a Contribution." "Contributor" shall mean Licensor and any individual or Legal Entity on behalf of whom a Contribution has been received by Licensor and subsequently incorporated within the Work. 2. Grant of Copyright License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare Derivative Works of, publicly display, publicly perform, sublicense, and distribute the Work and such Derivative Works in Source or Object form. 3. Grant of Patent License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their Contribution(s) alone or by combination of their Contribution(s) with the Work to which such Contribution(s) was submitted. If You institute patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Work or a Contribution incorporated within the Work constitutes direct or contributory patent infringement, then any patent licenses granted to You under this License for that Work shall terminate as of the date such litigation is filed. 4. Redistribution. You may reproduce and distribute copies of the Work or Derivative Works thereof in any medium, with or without modifications, and in Source or Object form, provided that You meet the following conditions: (a) You must give any other recipients of the Work or Derivative Works a copy of this License; and (b) You must cause any modified files to carry prominent notices stating that You changed the files; and (c) You must retain, in the Source form of any Derivative Works that You distribute, all copyright, patent, trademark, and attribution notices from the Source form of the Work, excluding those notices that do not pertain to any part of the Derivative Works; and (d) If the Work includes a "NOTICE" text file as part of its distribution, then any Derivative Works that You distribute must include a readable copy of the attribution notices contained within such NOTICE file, excluding those notices that do not pertain to any part of the Derivative Works, in at least one of the following places: within a NOTICE text file distributed as part of the Derivative Works; within the Source form or documentation, if provided along with the Derivative Works; or, within a display generated by the Derivative Works, if and wherever such third-party notices normally appear. The contents of the NOTICE file are for informational purposes only and do not modify the License. You may add Your own attribution notices within Derivative Works that You distribute, alongside or as an addendum to the NOTICE text from the Work, provided that such additional attribution notices cannot be construed as modifying the License. You may add Your own copyright statement to Your modifications and may provide additional or different license terms and conditions for use, reproduction, or distribution of Your modifications, or for any such Derivative Works as a whole, provided Your use, reproduction, and distribution of the Work otherwise complies with the conditions stated in this License. 5. Submission of Contributions. Unless You explicitly state otherwise, any Contribution intentionally submitted for inclusion in the Work by You to the Licensor shall be under the terms and conditions of this License, without any additional terms or conditions. Notwithstanding the above, nothing herein shall supersede or modify the terms of any separate license agreement you may have executed with Licensor regarding such Contributions. 6. Trademarks. This License does not grant permission to use the trade names, trademarks, service marks, or product names of the Licensor, except as required for reasonable and customary use in describing the origin of the Work and reproducing the content of the NOTICE file. 7. Disclaimer of Warranty. Unless required by applicable law or agreed to in writing, Licensor provides the Work (and each Contributor provides its Contributions) on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are solely responsible for determining the appropriateness of using or redistributing the Work and assume any risks associated with Your exercise of permissions under this License. 8. Limitation of Liability. In no event and under no legal theory, whether in tort (including negligence), contract, or otherwise, unless required by applicable law (such as deliberate and grossly negligent acts) or agreed to in writing, shall any Contributor be liable to You for damages, including any direct, indirect, special, incidental, or consequential damages of any character arising as a result of this License or out of the use or inability to use the Work (including but not limited to damages for loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses), even if such Contributor has been advised of the possibility of such damages. 9. Accepting Warranty or Additional Liability. While redistributing the Work or Derivative Works thereof, You may choose to offer, and charge a fee for, acceptance of support, warranty, indemnity, or other liability obligations and/or rights consistent with this License. However, in accepting such obligations, You may act only on Your own behalf and on Your sole responsibility, not on behalf of any other Contributor, and only if You agree to indemnify, defend, and hold each Contributor harmless for any liability incurred by, or claims asserted against, such Contributor by reason of your accepting any such warranty or additional liability. uTox/third_party/minini/minini/.git0000600000175000001440000000007014003056220016351 0ustar rakusersgitdir: ../../../.git/modules/third_party/minini/minini uTox/third_party/minini/CMakeLists.txt0000600000175000001440000000024514003056216017053 0ustar rakusersproject(minini LANGUAGES C) add_library(${PROJECT_NAME} STATIC minini/dev/minIni.c ) target_include_directories(${PROJECT_NAME} SYSTEM PUBLIC minini/dev ) uTox/third_party/CMakeLists.txt0000600000175000001440000000014414003056216015566 0ustar rakusersadd_cflag("-Wno-error") add_subdirectory(minini) add_subdirectory(qrcodegen) add_subdirectory(stb) uTox/tests/0000700000175000001440000000000014003056216011636 5ustar rakusersuTox/tests/test_chrono.c0000600000175000001440000000365314003056216014342 0ustar rakusers#include "../src/chrono.c" #include "test.h" #include #include /* START_TEST (test_chrono_finished) { CHRONO_INFO info; info.ptr = 0; info.step = 5; info.interval_ms = 5; info.finished = false; chrono_start(&info); yieldcpu(30); chrono_end(&info); ck_assert_msg((intptr_t)info.ptr == 30, "Expected 30 got: %u", info.ptr); } END_TEST */ void thread_callback(void *args) { *(bool *)args = true; } START_TEST(test_chrono_target) { /* * Chrono info should be mallocated in real code. * This function can't exit until the thread exits so it is safe * to use the stack. */ CHRONO_INFO info; bool finished = false; info.ptr = 0; info.step = 5; info.interval_ms = 5; info.finished = false; info.target = (uint8_t *)30; info.callback = thread_callback; info.cb_data = &finished; chrono_start(&info); yieldcpu(30); // allow thread to run and exit while (!finished) { yieldcpu(1); } ck_assert_msg((intptr_t)info.ptr == 30, "Expected 30 got: %u", info.ptr); } END_TEST void callback(void *arg) { *(int *)arg = 10; } START_TEST(test_chrono_callback) { int arg = 0; chrono_callback(1, callback, &arg); ck_assert_msg((intptr_t)arg == 10, "Expected callback_arg to be 10 got: %d", arg); } END_TEST static Suite *suite(void) { Suite *s = suite_create("Chrono"); //MK_TEST_CASE(chrono_finished); // re-enable when the finished field of the chrono info struct is used MK_TEST_CASE(chrono_target); MK_TEST_CASE(chrono_callback) return s; } int main(int argc, char *argv[]) { srand((unsigned int) time(NULL)); Suite *run = suite(); SRunner *test_runner = srunner_create(run); int number_failed = 0; srunner_run_all(test_runner, CK_NORMAL); number_failed = srunner_ntests_failed(test_runner); srunner_free(test_runner); return number_failed; } uTox/tests/test_chatlog.c0000600000175000001440000000514514003056216014471 0ustar rakusers#include "test.h" #include #include #include #include "../src/macros.h" #include "../src/chatlog.c" #include "../src/text.c" #define MOCK_FRIEND_ID "6460FF76319AF777A999ABA2024D5D0AEB202360688ECBABFE56C9403B872D2F" void native_export_chatlog_init(uint32_t friend_number) { char* name = strdup("chatlog_export.txt"); FILE *file = fopen(name, "wb"); if (file) { utox_export_chatlog(MOCK_FRIEND_ID, file); } else { FAIL_FATAL("unable to open file for writing: %s", name); } free(name); } bool test_write_chatlog(); bool test_read_chatlog(); int main() { int result = 0; RUN_TEST(test_write_chatlog) RUN_TEST(test_read_chatlog) return result; } uint8_t* create_mock_message(size_t *length) { LOG_FILE_MSG_HEADER header; memset(&header, 0, sizeof(header)); char* author = strdup("tox user"); size_t author_length = 9; size_t msg_length = strlen("This is a test message."); char* msg = strdup("This is a test message."); header.log_version = LOGFILE_SAVE_VERSION; header.time = time(NULL); header.author_length = author_length; header.msg_length = msg_length; header.author = 1; // we are the message author header.receipt = 1; header.msg_type = 1; // MSG_TYPE_TEXT; *length = sizeof(header) + msg_length + author_length + 1; /* extra \n char */ uint8_t *data = calloc(1, *length); if (!data) { FAIL_FATAL("Can't calloc for chat logging data. size: %lu", *length); } memcpy(data, &header, sizeof(header)); memcpy(data + sizeof(header), author, author_length); memcpy(data + sizeof(header) + author_length, msg, msg_length); strcpy2(data + *length - 1, "\n"); free(author); free(msg); return data; } /** * // TODO is there an automated way to track test coverage in C? * @covers utox_save_chatlog() */ bool test_write_chatlog() { char id_str[TOX_PUBLIC_KEY_SIZE * 2] = MOCK_FRIEND_ID; size_t length1; uint8_t *data1 = create_mock_message(&length1); uint64_t disk_offset1 = utox_save_chatlog(id_str, data1, length1); LOG("disk offset 1: %lu", disk_offset1); assert(disk_offset1 == 0); size_t length2; uint8_t *data2 = create_mock_message(&length2); uint64_t disk_offset2 = utox_save_chatlog(id_str, data2, length2); LOG("disk offset 2: %lu", disk_offset2); assert(disk_offset2 == length1); free(data1); free(data2); return true; } bool test_read_chatlog() { LOG_INFO("test", "testing..."); // FAIL("not good!"); // TODO implement return true; } uTox/tests/test.h0000600000175000001440000000201714003056216012770 0ustar rakusers#include "../src/debug.h" #include "../src/settings.h" #include #include #include #include #include #include #define MK_TEST_CASE(TRGT) \ TCase *case_##TRGT = tcase_create(#TRGT); \ tcase_add_test(case_##TRGT, test_##TRGT); \ suite_add_tcase(s, case_##TRGT); // // define some testing helpers // // run a test method and print its name to create a nicely readable testing output #define RUN_TEST(t) printf("\033[01mtest: " #t "...\033[0m\n"); if (t()) { printf(" -> \033[01;32msuccess.\033[0m\n"); } else { printf(" -> \033[01;31mfail.\033[0m\n"); result = 1; } // print a message #define LOG(m, ...) printf(" " m "\n", ## __VA_ARGS__ ); // print message and return false (i.e. fail current test method) #define FAIL(m, ...) printf(" \033[31m" m "\033[0m\n", ## __VA_ARGS__ ); return false; // print message and exit unsuccessfully #define FAIL_FATAL(m, ...) printf(" \033[31m" m "\033[0m\n", ## __VA_ARGS__ ); exit(1); uTox/tests/run_tests.sh0000700000175000001440000000020214003056216014215 0ustar rakusers#!/bin/sh -e cd "@utoxTESTS_BINARY_DIR@" # remove ./tox folder before each test to have clean environment rm -rf ./tox ctest -VV uTox/tests/mock/0000700000175000001440000000000014003056216012567 5ustar rakusersuTox/tests/mock/mock_threads.c0000600000175000001440000000044614003056216015404 0ustar rakusers#include void thread(void * (*func)(void *), void *args) { pthread_t thread_temp; pthread_attr_t attr; pthread_attr_init(&attr); pthread_attr_setstacksize(&attr, 1 << 20); pthread_create(&thread_temp, &attr, func, args); pthread_attr_destroy(&attr); } uTox/tests/mock/mock_system_calls.c0000600000175000001440000000013714003056216016451 0ustar rakusers#include #include void yieldcpu(uint32_t ms) { usleep(ms * 1000); } uTox/tests/mock/mock_settings.c0000600000175000001440000000352014003056216015606 0ustar rakusers#include "branding.h" #include "settings.h" #include "../test.h" SETTINGS settings = { .utox_last_version = UTOX_VERSION_NUMBER, // .last_version // included here to match the full struct .show_splash = false, // Low level settings (network, profile, portable-mode) .disableudp = false, .enableipv6 = true, .proxyenable = false, .force_proxy = false, .proxy_port = 0, // Tox level settings .block_friend_requests = false, .save_encryption = true, // testing always in portable mode to not touch any real tox profile! .portable_mode = true, // User interface settings .close_to_tray = false, .logging_enabled = true, .audio_filtering_enabled = true, .start_in_tray = false, .auto_startup = false, .push_to_talk = false, .audio_preview = false, .video_preview = false, .no_typing_notifications = true, .use_mini_flist = false, // .inline_video // included here to match the full struct .use_long_time_msg = true, .accept_inline_images = true, // Notifications / Alerts .audible_notifications_enabled = true, .status_notifications = true, .group_notifications = 0, .verbose = LOG_LVL_ERROR, .debug_file = NULL, // .theme // included here to match the full struct // OS interface settings .window_height = 480, .window_width = 640, .window_baseline = 0, .window_maximized = 0, }; void config_load(void) { FAIL_FATAL("called a mocked function, this should not happen: %s", __FUNCTION__); } void config_save(void) { FAIL_FATAL("called a mocked function, this should not happen: %s", __FUNCTION__); } uTox/tests/mock/mock_logging.c0000600000175000001440000000036614003056216015401 0ustar rakusers#include "../test.h" // make sure tests are logging everything int utox_verbosity() { return 100; }; void debug(const char *fmt, ...){ va_list list; va_start(list, fmt); printf(" "); vprintf(fmt, list); va_end(list); } uTox/tests/mock/mock_filesys.c0000600000175000001440000000236714003056216015434 0ustar rakusers#include "../../src/filesys.h" #include "../../src/native/filesys.h" #include "../../src/filesys.c" #include "../../src/posix/filesys.c" // TODO copied from xlib/filesys.c might be possible to keep this DRY at some point bool native_remove_file(const uint8_t *name, size_t length, bool portable_mode) { char path[UTOX_FILE_NAME_LENGTH] = { 0 }; // TODO this is duplicated in more methods, make this portable thing a common method in filesys.c if (portable_mode) { snprintf((char *)path, UTOX_FILE_NAME_LENGTH, "./tox/"); } else { snprintf((char *)path, UTOX_FILE_NAME_LENGTH, "%s/.config/tox/", getenv("HOME")); } if (strlen((const char *)path) + length >= UTOX_FILE_NAME_LENGTH) { LOG_DEBUG("Filesys", "File/directory name too long, unable to remove" ); return false; } else { snprintf((char *)path + strlen((const char *)path), UTOX_FILE_NAME_LENGTH - strlen((const char *)path), "%.*s", (int)length, (char *)name); } if (remove((const char *)path)) { LOG_ERR("NATIVE", "Unable to delete file!\n\t\t%s" , path); return false; } else { LOG_INFO("NATIVE", "File deleted!" ); LOG_DEBUG("Filesys", "\t%s" , path); } return true; } uTox/tests/CMakeLists.txt0000600000175000001440000000214014003056216014375 0ustar rakusersproject(utoxTESTS LANGUAGES C) include(CTest) set(CMAKE_MODULE_PATH ${CMAKE_MODULE_PATH} "${CMAKE_SOURCE_DIR}/cmake/") find_package(Check REQUIRED) link_directories(${CHECK_LIBRARY_DIRS}) function(make_test name) add_executable(test_${name} test_${name}.c) set_target_properties(test_${name} PROPERTIES COMPILE_FLAGS "-Wno-unused-parameter") target_link_libraries(test_${name} utox-test-mock ${CHECK_LIBRARIES}) add_test(NAME test_${name} COMMAND test_${name}) endfunction() configure_file(${utoxTESTS_SOURCE_DIR}/run_tests.sh ${uTox_BINARY_DIR}/run_tests.sh) # # generic testing defines # include_directories("../src") add_library(utox-test-mock mock/mock_filesys.c mock/mock_settings.c mock/mock_logging.c mock/mock_threads.c mock/mock_system_calls.c ) set_target_properties(utox-test-mock PROPERTIES COMPILE_FLAGS "-Wno-unused-parameter") target_link_libraries(utox-test-mock pthread) # # tests # # TODO add a cmake macro for adding tests, this will be too verbose if we add more. make_test(chatlog) make_test(chrono) uTox/src/0000700000175000001440000000000014003056216011263 5ustar rakusersuTox/src/xlib/0000700000175000001440000000000014003056216012221 5ustar rakusersuTox/src/xlib/window.h0000600000175000001440000000177014003056216013710 0ustar rakusers#ifndef XLIB_WINDOW_H #define XLIB_WINDOW_H #include "../window.h" #include "../native/window.h" #include #include #include #include #include #include #include #include #include extern Display *display; extern Screen *default_screen; extern int def_screen_num; extern Window root_window; extern Visual *default_visual; // TODO move extern UTOX_WINDOW *curr; extern int default_depth; struct native_window { struct utox_window _; // Global struct shared across all platforms Window window; GC gc; Visual *visual; Pixmap drawbuf; Picture renderpic; Picture colorpic; XRenderPictFormat *pictformat; }; extern struct native_window main_window; extern struct native_window popup_window; extern struct native_window scr_grab_window; extern struct native_window tray_pop; void window_set_focus(UTOX_WINDOW *win); #endif uTox/src/xlib/window.c0000600000175000001440000002360714003056216013706 0ustar rakusers#include "window.h" #include "main.h" #include "../branding.h" #include "../debug.h" #include "../macros.h" #include "../native/thread.h" #include "../native/time.h" #include "../ui/draw.h" #include "../layout/background.h" #include "../layout/notify.h" #include "../main.h" // MAIN_WIDTH, MAIN_HEIGHT #include #include #include #include Display *display; Screen *default_screen; int def_screen_num; Window root_window; Visual *default_visual; UTOX_WINDOW *curr; int default_depth; struct native_window main_window; struct native_window popup_window; struct native_window scr_grab_window; struct native_window tray_pop; bool native_window_init(void) { if ((display = XOpenDisplay(NULL)) == NULL) { LOG_ERR("XLIB Wind", "Cannot open display, must exit"); return false; } default_screen = DefaultScreenOfDisplay(display); def_screen_num = DefaultScreen(display); default_visual = DefaultVisual(display, def_screen_num); default_depth = DefaultDepth(display, def_screen_num); root_window = RootWindow(display, def_screen_num); return true; } static UTOX_WINDOW *native_window_create(UTOX_WINDOW *window, char *title, unsigned int class, int x, int y, int w, int h, int min_width, int min_height, void *gui_panel, bool override) { if (!window) { return NULL; } XSetWindowAttributes attrib = { .background_pixel = WhitePixel(display, def_screen_num), .border_pixel = BlackPixel(display, def_screen_num), .override_redirect = override, .event_mask = ExposureMask | ButtonPressMask | ButtonReleaseMask | EnterWindowMask | LeaveWindowMask | PointerMotionMask | StructureNotifyMask | KeyPressMask | KeyReleaseMask | FocusChangeMask | PropertyChangeMask, }; window->window = XCreateWindow(display, root_window, x, y, w, h, 0, default_depth, InputOutput, default_visual, class, &attrib); /* Generate the title XLib needs */ char *title_name = strdup(title); XTextProperty native_window_name; // Why? if (XStringListToTextProperty(&title_name, 1, &native_window_name) == 0 ) { LOG_ERR("XLIB Wind", "FATAL ERROR: Unable to alloc for a sting during window creation"); XDestroyWindow(display, window->window); return NULL; } // "Because FUCK your use of sane coding strategies" -Xlib... probably... free(title_name); /* I was getting some errors before, and made this change, but I'm not convinced * these can't be moved to the stack. I'd rather not XAlloc but it works now so * in true Linux fashion DON'T TOUCH ANYTHING THAT WORKS! */ /* Allocate memory for xlib... */ XSizeHints *size_hints = XAllocSizeHints(); XWMHints *wm_hints = XAllocWMHints(); XClassHint *class_hints = XAllocClassHint(); if (!size_hints || !wm_hints || !class_hints) { LOG_ERR("XLIB Wind", "XLIB_Windows: couldn't allocate memory."); XDestroyWindow(display, window->window); return NULL; } /* Set the Size information used by sane WMs */ size_hints->flags = PPosition | PBaseSize | PMinSize | PMaxSize | PWinGravity; size_hints->x = x; size_hints->y = y; size_hints->base_width = w; size_hints->base_height = h; size_hints->min_width = min_width ? min_width : w; size_hints->min_height = min_height ? min_height : h; size_hints->max_width = w * 100; size_hints->max_height = h * 100; size_hints->win_gravity = NorthEastGravity; /* We default to main, this could be wrong */ wm_hints->flags = StateHint | InputHint | WindowGroupHint; wm_hints->initial_state = NormalState; wm_hints->input = true; wm_hints->window_group = main_window.window; /* Allows WMs to find shared resources */ class_hints->res_name = "utox"; class_hints->res_class = "uTox"; XSetWMProperties(display, window->window, &native_window_name, NULL, NULL, 0, size_hints, wm_hints, class_hints); XFree(native_window_name.value); XFree(size_hints); XFree(wm_hints); XFree(class_hints); window->_.x = x; window->_.y = y; window->_.w = w; window->_.h = h; window->_.panel = gui_panel; return window; } void native_window_raze(UTOX_WINDOW *window) { if (window) { // do stuff } else { // don't do stuff } } UTOX_WINDOW *native_window_create_main(int x, int y, int w, int h, char **UNUSED(argv), int UNUSED(argc)) { char title[256]; snprintf(title, 256, "%s %s (version: %s)", TITLE, SUB_TITLE, VERSION); if (!native_window_create(&main_window, title, CWBackPixmap | CWBorderPixel | CWEventMask, x, y, w, h, MAIN_WIDTH, MAIN_HEIGHT, &panel_root, false)) { LOG_FATAL_ERR(EXIT_FAILURE,"XLIB Wind", "Unable to create main window."); } Atom a_pid = XInternAtom(display, "_NET_WM_PID", 0); uint pid = getpid(); XChangeProperty(display, main_window.window, a_pid, XA_CARDINAL, 32, PropModeReplace, (uint8_t *)&pid, 1); native_window_set_target(&main_window); return &main_window; } static void set_window_defaults(UTOX_WINDOW *win) { const Atom a_type = XInternAtom(display, "_NET_WM_WINDOW_TYPE", 0); const Atom a_util = XInternAtom(display, "_NET_WM_WINDOW_TYPE_UTILITY", 0); XChangeProperty(display, win->window, a_type, XA_ATOM, 32, PropModeReplace, (uint8_t *)&a_util, 1); Atom list[] = { wm_delete_window, }; XSetWMProtocols(display, win->window, list, 1); /* create the draw buffer */ win->drawbuf = XCreatePixmap(display, win->window, win->_.w, win->_.h, default_depth); /* catch WM_DELETE_WINDOW */ XSetWMProtocols(display, win->window, &wm_delete_window, 1); win->gc = XCreateGC(display, root_window, 0, 0); XWindowAttributes attr; XGetWindowAttributes(display, root_window, &attr); win->pictformat = XRenderFindVisualFormat(display, attr.visual); /* Xft draw context/color */ win->renderpic = XRenderCreatePicture(display, win->drawbuf, win->pictformat, 0, NULL); XRenderColor xrcolor = { 0,0,0,0 }; win->colorpic = XRenderCreateSolidFill(display, &xrcolor); } UTOX_WINDOW *native_window_create_video(int UNUSED(x), int UNUSED(y), int UNUSED(w), int UNUSED(h)) { return NULL; } UTOX_WINDOW *native_window_find_notify(void *window) { UTOX_WINDOW *win = &popup_window; while (win) { if (win->window == *(Window *)window) { return win; } win = win->_.next; } return NULL; } UTOX_WINDOW *native_window_create_notify(int x, int y, int w, int h, PANEL *panel) { UTOX_WINDOW *next = NULL; if (!popup_window.window) { next = &popup_window; } else { next = calloc(1, sizeof(UTOX_WINDOW)); if (!next) { LOG_FATAL_ERR(EXIT_FAILURE, "XIB Wind", "Unable to allocate data for popup window."); } } UTOX_WINDOW *win = native_window_create(next, "uTox Alert", CWBackPixmap | CWBorderPixel | CWEventMask | CWColormap | CWOverrideRedirect, x, y, w, h, w, h, &panel_notify_generic, true); if (!win) { LOG_ERR("XLIB Wind", "XLIB_WIN:\tUnable to Alloc for a notification window"); return NULL; } Atom a_pid = XInternAtom(display, "_NET_WM_PID", 0); uint pid = getpid(); XChangeProperty(display, win->window, a_pid, XA_CARDINAL, 32, PropModeReplace, (uint8_t *)&pid, 1); Atom a_type = XInternAtom(display, "_NET_WM_WINDOW_TYPE", 0); Atom a_util = XInternAtom(display, "_NET_WM_WINDOW_TYPE_UTILITY", 0); XChangeProperty(display, win->window, a_type, XA_ATOM, 32, PropModeReplace, (uint8_t *)&a_util, 1); set_window_defaults(win); XMapWindow(display, win->window); UTOX_WINDOW *head = &popup_window; while (head->_.next) { head = head->_.next; } if (win != &popup_window){ head->_.next = win; } win->_.panel = panel; return win; } UTOX_WINDOW *native_window_create_traypop(int x, int y, int w, int h, PANEL *panel) { UTOX_WINDOW *next = NULL; if (!tray_pop.window) { next = &popup_window; } // Set the real x, as caller give x/y as root mouse locations x -= w; UTOX_WINDOW *win = native_window_create(next, "uTox Tray Popup", CWBackPixmap | CWBorderPixel | CWEventMask | CWColormap | CWOverrideRedirect, x, y, w, h, w, h, &panel_notify_generic, true); if (!win) { LOG_ERR("XLIB Wind", "XLIB_WIN:\tUnable to Alloc for a tray popup"); return NULL; } set_window_defaults(win); XMapWindow(display, win->window); win->_.panel = panel; return win; } static void notify_tween_thread(void *obj) { UTOX_WINDOW *target = obj; if (!target) { return; } XEvent ev = { .xclient = { .type = ClientMessage, .display = display, .window = target->window, .message_type = XRedraw, .format = 8, .data = { .s = { 0, 0 } } } }; while (target->_.y > 2) { target->_.y -= 2; XMoveWindow(display, target->window, target->_.x, target->_.y); enddraw(0, 0, 400, 150); XSendEvent(display, target->window, 0, 0, &ev); XFlush(display); yieldcpu(1); } } static UTOX_WINDOW *focus; void window_set_focus(UTOX_WINDOW *win) { focus = win; } void native_window_tween(UTOX_WINDOW *win) { thread(notify_tween_thread, win); } void native_window_create_screen_select() { return; } bool native_window_set_target(UTOX_WINDOW *new_win) { if (new_win == curr) { return false; } curr = new_win; return true; } uTox/src/xlib/video.c0000600000175000001440000002146114003056216013501 0ustar rakusers#include "main.h" #include "screen_grab.h" #include "window.h" #include "../debug.h" #include "../macros.h" #include "../ui.h" #include "../av/video.h" #include "../native/time.h" #include "../main.h" #include #include #include #include #include #define MAX_VID_WINDOWS 32 // TODO drop this for dynamic allocation static Window video_win[MAX_VID_WINDOWS]; // TODO we should allocate this dynamically but this'll work for now static Window preview; // Video preview uint16_t find_video_windows(Window w) { if (w == preview) { return UINT16_MAX; } for (unsigned i = 0; i < MAX_VID_WINDOWS; ++i ) { if (w == video_win[i]) { return i; } } return UINT16_MAX; } void video_frame(uint16_t id, uint8_t *img_data, uint16_t width, uint16_t height, bool resize) { if (!img_data) { LOG_DEBUG("Video", "Received a null video frame. Skipping..."); return; } Window *win = &video_win[id]; if (id == UINT16_MAX) { // Preview window win = &preview; } else if (id >= MAX_VID_WINDOWS) { LOG_TRACE("Video", "Window ID too large (>=%d)", MAX_VID_WINDOWS); return; } if (!*win) { LOG_TRACE("Video", "frame for null window %u" , id); return; } if (resize) { XWindowChanges changes = {.width = width, .height = height }; XConfigureWindow(display, *win, CWWidth | CWHeight, &changes); } XWindowAttributes attrs; XGetWindowAttributes(display, *win, &attrs); XImage image = { .width = attrs.width, .height = attrs.height, .depth = 24, .bits_per_pixel = 32, .format = ZPixmap, .byte_order = LSBFirst, .bitmap_unit = 8, .bitmap_bit_order = LSBFirst, .bytes_per_line = attrs.width * 4, .red_mask = 0xFF0000, .green_mask = 0xFF00, .blue_mask = 0xFF, .data = (char *)img_data }; /* scale image if needed */ uint8_t *new_data = NULL; if (attrs.width != width && attrs.height != height){ new_data = malloc(attrs.width * attrs.height * 4); if (!new_data) { LOG_FATAL_ERR(EXIT_MALLOC, "Video", "Could not allocate memory for scaled image."); } scale_rgbx_image(img_data, width, height, new_data, attrs.width, attrs.height); image.data = (char *)new_data; } GC default_gc = DefaultGC(display, def_screen_num); Pixmap pixmap = XCreatePixmap(display, main_window.window, attrs.width, attrs.height, default_depth); XPutImage(display, pixmap, default_gc, &image, 0, 0, 0, 0, attrs.width, attrs.height); XCopyArea(display, pixmap, *win, default_gc, 0, 0, attrs.width, attrs.height, 0, 0); XFreePixmap(display, pixmap); if (new_data) { free(new_data); } } void video_begin(uint16_t id, char *name, uint16_t name_length, uint16_t width, uint16_t height) { Window *win = &video_win[id]; if (id == UINT16_MAX) { // Preview window win = &preview; } else if (id >= MAX_VID_WINDOWS) { LOG_TRACE("Video", "Window ID too large (>=%d)", MAX_VID_WINDOWS); return; } if (*win) { return; } *win = XCreateSimpleWindow(display, RootWindow(display, def_screen_num), 0, 0, width, height, 0, BlackPixel(display, def_screen_num), WhitePixel(display, def_screen_num)); // Fallback name in ISO8859-1. XStoreName(display, *win, "Video Preview"); // UTF-8 name for those WMs that can display it. XChangeProperty(display, *win, XA_NET_NAME, XA_UTF8_STRING, 8, PropModeReplace, (uint8_t *)name, name_length); XSetWMProtocols(display, *win, &wm_delete_window, 1); /* set WM_CLASS */ XClassHint hint = {.res_name = "utoxvideo", .res_class = "utoxvideo" }; XSetClassHint(display, *win, &hint); XMapWindow(display, *win); LOG_TRACE("Video", "new window %u" , id); } void video_end(uint16_t id) { Window *win = &video_win[id]; if (id == UINT16_MAX) { // Preview window win = &preview; } else if (id >= MAX_VID_WINDOWS) { LOG_TRACE("Video", "Window ID too large (>=%d)", MAX_VID_WINDOWS); return; } XDestroyWindow(display, *win); *win = None; LOG_NOTE("Video", "killed window %u" , id); } static Display *deskdisplay; static int deskscreen; XShmSegmentInfo shminfo; void initshm(void) { deskdisplay = XOpenDisplay(NULL); deskscreen = DefaultScreen(deskdisplay); LOG_TRACE("Video", "desktop: %u %u" , default_screen->width, default_screen->height); max_video_width = default_screen->width; max_video_height = default_screen->height; } uint16_t native_video_detect(void) { char dev_name[] = "/dev/videoXX", *first = NULL; uint16_t device_count = 1; /* start at 1 for the desktop input */ // Indicate that we support desktop capturing. utox_video_append_device((void *)1, 1, (void *)STR_VIDEO_IN_DESKTOP, 0); for (int i = 0; i != 64; i++) { /* TODO: magic numbers are bad mm'kay? */ snprintf(dev_name + 10, sizeof(dev_name) - 10, "%i", i); struct stat st; if (-1 == stat(dev_name, &st)) { continue; // LOG_TRACE("Video", "Cannot identify '%s': %d, %s" , dev_name, errno, strerror(errno)); // return 0; } if (!S_ISCHR(st.st_mode)) { continue; // LOG_TRACE("Video", "%s is no device" , dev_name); // return 0; } char *p = malloc(sizeof(void *) + sizeof(dev_name)), *pp = p + sizeof(void *); memcpy(p, &pp, sizeof(void *)); memcpy(p + sizeof(void *), dev_name, sizeof(dev_name)); if (!first) { first = pp; utox_video_append_device((void *)p, 0, p + sizeof(void *), 1); } else { utox_video_append_device((void *)p, 0, p + sizeof(void *), 0); } device_count++; } initshm(); return device_count; } static uint16_t video_x, video_y; bool native_video_init(void *handle) { if (isdesktop(handle)) { utox_v4l_fd = -1; GRAB_POS grab = grab_pos(); video_x = MIN(grab.dn_x, grab.up_x); video_y = MIN(grab.dn_y, grab.up_y); video_width = MAX(grab.dn_x, grab.up_x) - MIN(grab.dn_x, grab.up_x); video_height = MAX(grab.dn_y, grab.up_y) - MIN(grab.dn_y, grab.up_y); if (video_width & 1) { if (video_x & 1) { video_x--; } video_width++; } if (video_height & 1) { if (video_y & 1) { video_y--; } video_height++; } if (!(screen_image = XShmCreateImage(deskdisplay, DefaultVisual(deskdisplay, deskscreen), DefaultDepth(deskdisplay, deskscreen), ZPixmap, NULL, &shminfo, video_width, video_height))) { return false; } if ((shminfo.shmid = shmget(IPC_PRIVATE, screen_image->bytes_per_line * screen_image->height, IPC_CREAT | 0777)) < 0) { return false; } if ((shminfo.shmaddr = screen_image->data = (char *)shmat(shminfo.shmid, 0, 0)) == (char *)-1) { return false; } shminfo.readOnly = False; if (!XShmAttach(deskdisplay, &shminfo)) { return false; } return true; } return v4l_init(handle); } void native_video_close(void *handle) { if (isdesktop(handle)) { XShmDetach(deskdisplay, &shminfo); return; } v4l_close(); } bool native_video_startread(void) { if (utox_v4l_fd == -1) { return true; } return v4l_startread(); } bool native_video_endread(void) { if (utox_v4l_fd == -1) { return true; } return v4l_endread(); } int native_video_getframe(uint8_t *y, uint8_t *u, uint8_t *v, uint16_t width, uint16_t height) { if (utox_v4l_fd == -1) { static uint64_t lasttime; uint64_t t = get_time(); if (t - lasttime >= (uint64_t)1000 * 1000 * 1000 / 24) { XShmGetImage(deskdisplay, RootWindow(deskdisplay, deskscreen), screen_image, video_x, video_y, AllPlanes); if (width != video_width || height != video_height) { LOG_ERR("v4l", "width/height mismatch %u %u != %u %u", width, height, screen_image->width, screen_image->height); return 0; } bgrxtoyuv420(y, u, v, (uint8_t *)screen_image->data, screen_image->width, screen_image->height); lasttime = t; return 1; } return 0; } return v4l_getframe(y, u, v, width, height); } uTox/src/xlib/v4l.c0000600000175000001440000002255114003056216013101 0ustar rakusers#include "main.h" #include "../debug.h" #include "../macros.h" #include "../av/video.h" // video super globals #include #include #include #include #include #include #include int utox_v4l_fd = -1; #include #if defined(__linux__) || defined(__FreeBSD__) || defined(__kFreeBSD__) || defined(__DragonFly__) // FreeBSD and DragonFlyBSD will have the proper includes after installing v4l_compat #include #elif defined(__OpenBSD__) || defined(__NetBSD__) // OpenBSD and NetBSD have V4L in base #include #else #error "Unsupported platform for V4L" #endif #ifndef NO_V4LCONVERT #include #endif #define CLEAR(x) memset(&(x), 0, sizeof(x)) static int xioctl(int fh, unsigned long request, void *arg) { int r; do { r = ioctl(fh, request, arg); } while (-1 == r && EINTR == errno); return r; } struct buffer { void * start; size_t length; }; static struct buffer *buffers; static uint32_t n_buffers; #ifndef NO_V4LCONVERT static struct v4lconvert_data *v4lconvert_data; #endif static struct v4l2_format fmt, dest_fmt = { //.type = V4L2_BUF_TYPE_VIDEO_CAPTURE, .fmt = { .pix = { .pixelformat = V4L2_PIX_FMT_YUV420, //.field = V4L2_FIELD_NONE, }, }, }; bool v4l_init(char *dev_name) { utox_v4l_fd = open(dev_name, O_RDWR /* required */ | O_NONBLOCK, 0); if (-1 == utox_v4l_fd) { LOG_TRACE("v4l", "Cannot open '%s': %d, %s" , dev_name, errno, strerror(errno)); return 0; } struct v4l2_capability cap; struct v4l2_cropcap cropcap; struct v4l2_crop crop; unsigned int min; if (-1 == xioctl(utox_v4l_fd, VIDIOC_QUERYCAP, &cap)) { if (EINVAL == errno) { LOG_TRACE("v4l", "%s is no V4L2 device" , dev_name); } else { LOG_TRACE("v4l", "VIDIOC_QUERYCAP error %d, %s" , errno, strerror(errno)); } return 0; } if (!(cap.capabilities & V4L2_CAP_VIDEO_CAPTURE)) { LOG_TRACE("v4l", "%s is no video capture device" , dev_name); return 0; } if (!(cap.capabilities & V4L2_CAP_STREAMING)) { LOG_TRACE("v4l", "%s does not support streaming i/o" , dev_name); return 0; } /* Select video input, video standard and tune here. */ CLEAR(cropcap); cropcap.type = V4L2_BUF_TYPE_VIDEO_CAPTURE; if (0 == xioctl(utox_v4l_fd, VIDIOC_CROPCAP, &cropcap)) { crop.type = V4L2_BUF_TYPE_VIDEO_CAPTURE; crop.c = cropcap.defrect; /* reset to default */ if (-1 == xioctl(utox_v4l_fd, VIDIOC_S_CROP, &crop)) { switch (errno) { case EINVAL: /* Cropping not supported. */ break; default: /* Errors ignored. */ break; } } } else { /* Errors ignored. */ } #ifndef NO_V4LCONVERT v4lconvert_data = v4lconvert_create(utox_v4l_fd); #endif CLEAR(fmt); fmt.type = V4L2_BUF_TYPE_VIDEO_CAPTURE; if (-1 == xioctl(utox_v4l_fd, VIDIOC_G_FMT, &fmt)) { LOG_TRACE("v4l", "VIDIOC_S_FMT error %d, %s" , errno, strerror(errno)); return 0; } /*if (fmt.fmt.pix.pixelformat != V4L2_PIX_FMT_YUYV) { LOG_ERR("v4l", "Unsupported video format: %u %u %u %u\n", fmt.fmt.pix.width, fmt.fmt.pix.height, fmt.fmt.pix.pixelformat, fmt.fmt.pix.field); }*/ video_width = fmt.fmt.pix.width; video_height = fmt.fmt.pix.height; dest_fmt.fmt.pix.width = fmt.fmt.pix.width; dest_fmt.fmt.pix.height = fmt.fmt.pix.height; LOG_TRACE("v4l", "Video size: %u %u" , video_width, video_height); /* Buggy driver paranoia. */ min = fmt.fmt.pix.width * 2; if (fmt.fmt.pix.bytesperline < min) fmt.fmt.pix.bytesperline = min; min = fmt.fmt.pix.bytesperline * fmt.fmt.pix.height; if (fmt.fmt.pix.sizeimage < min) fmt.fmt.pix.sizeimage = min; /* part 3*/ // uint32_t buffer_size = fmt.fmt.pix.sizeimage; struct v4l2_requestbuffers req; CLEAR(req); req.count = 4; req.type = V4L2_BUF_TYPE_VIDEO_CAPTURE; req.memory = V4L2_MEMORY_MMAP; // V4L2_MEMORY_USERPTR; if (-1 == xioctl(utox_v4l_fd, VIDIOC_REQBUFS, &req)) { if (EINVAL == errno) { LOG_TRACE("v4l", "%s does not support x i/o" , dev_name); } else { LOG_TRACE("v4l", "VIDIOC_REQBUFS error %d, %s" , errno, strerror(errno)); } return 0; } if (req.count < 2) { LOG_FATAL_ERR(EXIT_MALLOC, "v4l", "Insufficient buffer memory on %s", dev_name); } buffers = calloc(req.count, sizeof(*buffers)); for (n_buffers = 0; n_buffers < req.count; ++n_buffers) { struct v4l2_buffer buf; CLEAR(buf); buf.type = V4L2_BUF_TYPE_VIDEO_CAPTURE; buf.memory = V4L2_MEMORY_MMAP; buf.index = n_buffers; if (-1 == xioctl(utox_v4l_fd, VIDIOC_QUERYBUF, &buf)) { LOG_TRACE("v4l", "VIDIOC_QUERYBUF error %d, %s" , errno, strerror(errno)); return 0; } buffers[n_buffers].length = buf.length; buffers[n_buffers].start = mmap(NULL /* start anywhere */, buf.length, PROT_READ | PROT_WRITE /* required */, MAP_SHARED /* recommended */, utox_v4l_fd, buf.m.offset); if (MAP_FAILED == buffers[n_buffers].start) { LOG_TRACE("v4l", "mmap error %d, %s" , errno, strerror(errno)); return 0; } } /*buffers = calloc(4, sizeof(*buffers)); if (!buffers) { LOG_TRACE("v4l", "Out of memory" ); return 0; } for (n_buffers = 0; n_buffers < 4; ++n_buffers) { buffers[n_buffers].length = buffer_size; buffers[n_buffers].start = malloc(buffer_size); if (!buffers[n_buffers].start) { LOG_TRACE("v4l", "Out of memory" ); return 0; } }*/ return 1; } void v4l_close(void) { size_t i; for (i = 0; i < n_buffers; ++i) { if (-1 == munmap(buffers[i].start, buffers[i].length)) { LOG_TRACE("v4l", "munmap error" ); } } close(utox_v4l_fd); } bool v4l_startread(void) { LOG_TRACE("v4l", "start webcam" ); size_t i; enum v4l2_buf_type type; for (i = 0; i < n_buffers; ++i) { struct v4l2_buffer buf; CLEAR(buf); buf.type = V4L2_BUF_TYPE_VIDEO_CAPTURE; buf.memory = V4L2_MEMORY_MMAP; // V4L2_MEMORY_USERPTR; buf.index = i; // buf.m.userptr = (unsigned long)buffers[i].start; // buf.length = buffers[i].length; if (-1 == xioctl(utox_v4l_fd, VIDIOC_QBUF, &buf)) { LOG_TRACE("v4l", "VIDIOC_QBUF error %d, %s" , errno, strerror(errno)); return 0; } } type = V4L2_BUF_TYPE_VIDEO_CAPTURE; if (-1 == xioctl(utox_v4l_fd, VIDIOC_STREAMON, &type)) { LOG_TRACE("v4l", "VIDIOC_STREAMON error %d, %s" , errno, strerror(errno)); return 0; } return 1; } bool v4l_endread(void) { LOG_TRACE("v4l", "stop webcam" ); enum v4l2_buf_type type; type = V4L2_BUF_TYPE_VIDEO_CAPTURE; if (-1 == xioctl(utox_v4l_fd, VIDIOC_STREAMOFF, &type)) { LOG_TRACE("v4l", "VIDIOC_STREAMOFF error %d, %s" , errno, strerror(errno)); return 0; } return 1; } int v4l_getframe(uint8_t *y, uint8_t *UNUSED(u), uint8_t *UNUSED(v), uint16_t width, uint16_t height) { if (width != video_width || height != video_height) { LOG_TRACE("V4L", "width/height mismatch %u %u != %u %u" , width, height, video_width, video_height); return 0; } struct v4l2_buffer buf; // unsigned int i; CLEAR(buf); buf.type = V4L2_BUF_TYPE_VIDEO_CAPTURE; buf.memory = V4L2_MEMORY_MMAP; // V4L2_MEMORY_USERPTR; if (-1 == ioctl(utox_v4l_fd, VIDIOC_DQBUF, &buf)) { switch (errno) { case EINTR: case EAGAIN: return 0; case EIO: /* Could ignore EIO, see spec. */ /* fall through */ default: LOG_TRACE("v4l", "VIDIOC_DQBUF error %d, %s" , errno, strerror(errno)); return -1; } } /*for (i = 0; i < n_buffers; ++i) if (buf.m.userptr == (unsigned long)buffers[i].start && buf.length == buffers[i].length) break; if(i >= n_buffers) { LOG_TRACE("v4l", "fatal error" ); return 0; }*/ void *data = (void *)buffers[buf.index].start; // length = buf.bytesused //(void*)buf.m.userptr /* assumes planes are continuous memory */ #ifndef NO_V4LCONVERT int result = v4lconvert_convert(v4lconvert_data, &fmt, &dest_fmt, data, buf.bytesused, y, (video_width * video_height * 3) / 2); if (result == -1) { LOG_TRACE("v4l", "v4lconvert_convert error %s" , v4lconvert_get_error_message(v4lconvert_data)); } #else if (fmt.fmt.pix.pixelformat == V4L2_PIX_FMT_YUYV) { yuv422to420(y, u, v, data, video_width, video_height); } else { } #endif if (-1 == xioctl(utox_v4l_fd, VIDIOC_QBUF, &buf)) { LOG_TRACE("v4l", "VIDIOC_QBUF error %d, %s" , errno, strerror(errno)); } #ifndef NO_V4LCONVERT return (result == -1 ? 0 : 1); #else return 1; #endif } uTox/src/xlib/tray.h0000600000175000001440000000067514003056216013363 0ustar rakusers#ifndef XLIB_TRAY_H #define XLIB_TRAY_H #include "main.h" #include "window.h" #include #include #include #include // TODO fine the correct header for these, or consider an enum #define SYSTEM_TRAY_REQUEST_DOCK 0 #define SYSTEM_TRAY_BEGIN_MESSAGE 1 #define SYSTEM_TRAY_CANCEL_MESSAGE 2 void create_tray_icon(void); void destroy_tray_icon(void); bool tray_window_event(XEvent *event); #endif uTox/src/xlib/tray.c0000600000175000001440000002637414003056216013362 0ustar rakusers#include "tray.h" #include "window.h" #include "../debug.h" #include "../macros.h" #include "../native/image.h" #include "../native/ui.h" #include "../layout/tray.h" #include #include #include // Converted to a binary and linked at build time extern uint8_t _binary_icons_utox_128x128_png_start; extern uint8_t _binary_icons_utox_128x128_png_end; static void send_message(Display *dpy, /* display */ Window w, /* sender (tray window) */ long message, /* message opcode */ long data1, /* message data 1 */ long data2, /* message data 2 */ long data3 /* message data 3 */) { XEvent ev; memset(&ev, 0, sizeof(ev)); ev.xclient.type = ClientMessage; ev.xclient.window = w; ev.xclient.message_type = XInternAtom(dpy, "_NET_SYSTEM_TRAY_OPCODE", False); ev.xclient.format = 32; ev.xclient.data.l[0] = CurrentTime; ev.xclient.data.l[1] = message; ev.xclient.data.l[2] = data1; ev.xclient.data.l[3] = data2; ev.xclient.data.l[4] = data3; XSendEvent(dpy, w, False, NoEventMask, &ev); XSync(dpy, False); } struct native_window tray_window = { ._.x = 0, ._.y = 0, ._.w = 128u, ._.h = 128u, ._.next = NULL, ._.panel = NULL, .window = 0, .gc = 0, .visual = NULL, .drawbuf = 0, .renderpic = 0, .pictformat = NULL, }; static void tray_reposition(void) { LOG_NOTE("XLib Tray", "Reposition Tray"); uint32_t null; XGetGeometry(display, tray_window.window, &root_window, &tray_window._.x, &tray_window._.y, &tray_window._.w, &tray_window._.h, &null, &null); LOG_NOTE("XLib Tray", "New geometry x %u y %u w %u h %u", tray_window._.x, tray_window._.y, tray_window._.w, tray_window._.h); LOG_INFO("XLib Tray", "Setting to square"); tray_window._.w = tray_window._.h = MIN(tray_window._.w, tray_window._.h); XResizeWindow(display, tray_window.window, tray_window._.w, tray_window._.h); XFreePixmap(display, tray_window.drawbuf); tray_window.drawbuf = XCreatePixmap(display, tray_window.window, tray_window._.w, tray_window._.h, default_depth); XRenderFreePicture(display, tray_window.renderpic); tray_window.renderpic = XRenderCreatePicture(display, tray_window.drawbuf, tray_window.pictformat, 0, NULL); // XMoveResizeWindow(display, tray_window.window, tray_window._.x, tray_window._.y, // tray_window._.w, tray_window._.h); /* TODO use xcb instead of xlib here! xcb_get_geometry_cookie_t xcb_get_geometry (xcb_connection_t *connection, xcb_drawable_t drawable ); xcb_get_geometry_reply_t *xcb_get_geometry_reply (xcb_connection_t *connection, xcb_get_geometry_cookie_t cookie, xcb_generic_error_t **error); free (geom);*/ } static void draw_tray_icon(void) { LOG_NOTE("XLib Tray", "Draw Tray"); uint16_t width, height; uint8_t *icon_data = &_binary_icons_utox_128x128_png_start; size_t icon_size = &_binary_icons_utox_128x128_png_end - &_binary_icons_utox_128x128_png_start; NATIVE_IMAGE *icon = utox_image_to_native(icon_data, icon_size, &width, &height, 0); if (NATIVE_IMAGE_IS_VALID(icon)) { /* Get tray window size */ /* Resize the image from what the system tray dock tells us to be */ double scale = (tray_window._.w > tray_window._.h) ? (double)tray_window._.h / width : (double)tray_window._.w / height; image_set_scale(icon, scale); image_set_filter(icon, FILTER_BILINEAR); /* Draw the image and copy to the window */ XSetForeground(display, tray_window.gc, 0xFFFFFF); XFillRectangle(display, tray_window.drawbuf, tray_window.gc, 0, 0, tray_window._.w, tray_window._.h); /* TODO: copy method of grabbing background for tray from tray.c:tray_update_root_bg_pmap() (stalonetray) */ XRenderComposite(display, PictOpOver, icon->rgb, icon->alpha, tray_window.renderpic, 0, 0, 0, 0, 0, 0, tray_window._.w, tray_window._.h); XCopyArea(display, tray_window.drawbuf, tray_window.window, tray_window.gc, 0, 0, tray_window._.w, tray_window._.h, 0, 0); free(icon); } else { LOG_ERR("XLIB TRAY", "Tray no workie, that not gud!"); } } static void tray_xembed(XClientMessageEvent *ev) { LOG_NOTE("XEMBED Tray", "ClientMessage on display %u", ev->display); LOG_NOTE("XEMBED Tray", "Format (%i) as long %lu %lu parent window %lu proto version %lu %lu", ev->format, ev->data.l[0], ev->data.l[1], ev->data.l[2], ev->data.l[3], ev->data.l[4]); tray_reposition(); draw_tray_icon(); } void create_tray_icon(void) { LOG_NOTE("XLib Tray", "Create Tray Icon"); LOG_NOTE("XLib Tray", "Resolution %u %u", tray_window._.w, tray_window._.h); tray_window.window = XCreateSimpleWindow(display, RootWindow(display, def_screen_num), 0, 0, tray_window._.w, tray_window._.h, 0, BlackPixel(display, def_screen_num), WhitePixel(display, def_screen_num)); XSelectInput(display, tray_window.window, ExposureMask | ButtonPressMask | ButtonReleaseMask | EnterWindowMask | LeaveWindowMask | StructureNotifyMask | FocusChangeMask | PropertyChangeMask); /* Get ready to draw a tray icon */ tray_window.gc = XCreateGC(display, root_window, 0, 0); tray_window.drawbuf = XCreatePixmap(display, tray_window.window, tray_window._.w, tray_window._.h, default_depth); XWindowAttributes attr; XGetWindowAttributes(display, root_window, &attr); // Todo, try and alloc on the stack for this XSizeHints *size_hints = XAllocSizeHints(); size_hints->flags = PSize | PBaseSize | PMinSize | PMaxSize; size_hints->base_width = tray_window._.w; size_hints->base_height = tray_window._.h; size_hints->min_width = 16; size_hints->min_height = 16; size_hints->max_width = tray_window._.w; size_hints->max_height = tray_window._.h; XSetWMNormalHints(display, tray_window.window, size_hints); XFree(size_hints); tray_window.pictformat = XRenderFindVisualFormat(display, attr.visual); tray_window.renderpic = XRenderCreatePicture(display, tray_window.drawbuf, tray_window.pictformat, 0, NULL); /* Send icon to the tray */ send_message(display, XGetSelectionOwner(display, XInternAtom(display, "_NET_SYSTEM_TRAY_S0", false)), SYSTEM_TRAY_REQUEST_DOCK, tray_window.window, 0, 0); /* Draw the tray */ draw_tray_icon(); } void destroy_tray_icon(void) { XDestroyWindow(display, tray_window.window); } bool tray_window_event(XEvent *event) { if (event->xany.window != tray_window.window) { LOG_WARN("TRAY", "in %u ours %u", event->xany.window, tray_window.window); return false; } switch (event->type) { case Expose: { LOG_NOTE("XLib Tray", "Expose"); draw_tray_icon(); return true; } case NoExpose: { LOG_INFO("XLib Tray", "NoExpose"); return true; } case ClientMessage: { XClientMessageEvent msg = event->xclient; if (msg.message_type == XInternAtom(msg.display, "_XEMBED", true)) { tray_xembed(&msg); return true; } char *name = XGetAtomName(msg.display, msg.message_type); LOG_ERR("XLib Tray", "ClientMessage send_event %u display %u atom %u -- %s", msg.send_event, msg.display, msg.message_type, name); LOG_WARN("XLib Tray", "Format (%i) as long %lu %lu %lu %lu %lu", msg.format, msg.data.l[0], msg.data.l[1], msg.data.l[2], msg.data.l[3], msg.data.l[4]); return true; } case ConfigureNotify: { LOG_NOTE("XLib Tray", "Tray configure event"); XConfigureEvent *ev = &event->xconfigure; tray_window._.x = ev->x; tray_window._.y = ev->y; if (tray_window._.w != (unsigned)ev->width || tray_window._.h != (unsigned)ev->height) { LOG_NOTE("Tray", "Tray resized w:%i h:%i\n", ev->width, ev->height); if ((unsigned)ev->width > tray_window._.w || (unsigned)ev->height > tray_window._.h) { tray_window._.w = ev->width; tray_window._.h = ev->height; XFreePixmap(ev->display, tray_window.drawbuf); tray_window.drawbuf = XCreatePixmap(ev->display, tray_window.window, tray_window._.w, tray_window._.h, 24); // TODO get default_depth from X not code XRenderFreePicture(ev->display, tray_window.renderpic); tray_window.renderpic = XRenderCreatePicture(ev->display, tray_window.drawbuf, XRenderFindStandardFormat(ev->display, PictStandardRGB24), 0, NULL); } tray_window._.w = ev->width; tray_window._.h = ev->height; draw_tray_icon(); } return true; } case ButtonPress: { LOG_INFO("XLib Tray", "ButtonPress"); // Can't ignore this if you want mup -_- SRSLY Xlib? return true; } case ButtonRelease: { LOG_INFO("XLib Tray", "ButtonRelease"); XButtonEvent *ev = &event->xbutton; switch (ev->button) { case Button1: { togglehide(); break; } case Button3: { LOG_WARN("XLib Tray", "Button 3 %i %i", ev->x_root, ev->y_root); native_window_create_traypop(ev->x_root, ev->y_root, 300, 60, &panel_tray); } } return true; } case MapNotify: { LOG_INFO("XLib Tray", "MapNotify"); return true; } case FocusIn: { LOG_INFO("XLib Tray", "FocusIn"); return true; } case FocusOut: { LOG_INFO("XLib Tray", "FocusOut"); return true; } case EnterNotify: { LOG_INFO("XLib Tray", "EnterNotify"); return true; } case LeaveNotify: { LOG_INFO("XLib Tray", "LeaveNotify"); return true; } case ReparentNotify: { LOG_WARN("XLib Tray", "ReparentNotify"); return true; } default: { LOG_ERR("XLib Tray", "Incoming tray window event (%u)", event->type); break; } } LOG_ERR("XLib tray", "Reached end of function, this is bad juju!"); return false; } uTox/src/xlib/screen_grab.h0000600000175000001440000000043414003056216014647 0ustar rakusers#ifndef XLIB_SCREEN_GRAB_H #define XLIB_SCREEN_GRAB_H #include typedef struct { int dn_x, dn_y; int up_x, up_y; } GRAB_POS; void grab_dn(int x, int y); void grab_up(int x, int y); GRAB_POS grab_pos(void); void native_screen_grab_desktop(bool video); #endif uTox/src/xlib/screen_grab.c0000600000175000001440000000106614003056216014644 0ustar rakusers#include "screen_grab.h" #include "main.h" #include "window.h" #include "../ui.h" GRAB_POS grab; void grab_dn(int x, int y) { grab.dn_x = x; grab.dn_y = y; } void grab_up(int x, int y) { grab.up_x = x; grab.up_y = y; } GRAB_POS grab_pos(void) { return grab; } void native_screen_grab_desktop(bool video) { pointergrab = 1 + video; XGrabPointer(display, main_window.window, False, Button1MotionMask | ButtonPressMask | ButtonReleaseMask, GrabModeAsync, GrabModeAsync, None, cursors[CURSOR_SELECT], CurrentTime); } uTox/src/xlib/mmenu.h0000600000175000001440000000062114003056216013514 0ustar rakusers#ifndef MMENU_H #define MMENU_H #ifdef UNITY #include "xlib/mmenu.h" extern bool unity_running; #endif /* Function which removes an entry from the messaging menu * Is called by xlib/{list,event}.c and takes in parameter a friend ID */ void mm_rm_entry(uint8_t *f_id); /* Function which sets the user status in the messaging menu * Is called by the ui */ void mm_set_status(int status); #endif uTox/src/xlib/mmenu.c0000600000175000001440000001123214003056216013507 0ustar rakusers#ifdef UNITY #include "../self.h" #include #include MessagingMenuApp * mmapp; UnityLauncherEntry *launcher; GMainLoop * mmloop; bool unity_running; char f_name_data[TOX_MAX_NAME_LENGTH] = ""; char f_id_data[TOX_PUBLIC_KEY_SIZE * 2 + 1] = ""; char f_id_data_on_minimize[TOX_PUBLIC_KEY_SIZE * 2 + 1] = ""; uint_fast32_t unread_friends = 0; // Checks if the current desktop is unity bool is_unity_running() { if (strcmp(getenv("XDG_CURRENT_DESKTOP"), "Unity") == 0) { return 1; } else { return 0; } } // Runs the main event loop void run_mmloop() { g_main_loop_run(mmloop); } // Function called once the user presses an entry in the MessagingMenu static void source_activated(MessagingMenuApp *mmapp_, const gchar *source_id, gpointer user_data) { // TODO } // Sets the user status in the Messaging Menu void mm_set_status(int status) { switch (status) { case 0: messaging_menu_app_set_status(mmapp, MESSAGING_MENU_STATUS_AVAILABLE); break; case 1: messaging_menu_app_set_status(mmapp, MESSAGING_MENU_STATUS_AWAY); break; case 2: messaging_menu_app_set_status(mmapp, MESSAGING_MENU_STATUS_BUSY); break; } } // Function called once the user changes its status in the MessagingMenu static void status_changed(MessagingMenuApp *mmapp_, gint status, gpointer user_data) { switch (status) { case MESSAGING_MENU_STATUS_AVAILABLE: self.status = 0; postmessage_toxcore(TOX_SETSTATUS, 0, 0, NULL); break; case MESSAGING_MENU_STATUS_AWAY: self.status = 1; postmessage_toxcore(TOX_SETSTATUS, 1, 0, NULL); break; case MESSAGING_MENU_STATUS_BUSY: self.status = 2; postmessage_toxcore(TOX_SETSTATUS, 2, 0, NULL); break; default: self.status = 1; postmessage_toxcore(TOX_SETSTATUS, 1, 0, NULL); break; } drawalpha(BM_ONLINE + status, SELF_STATUS_X + BM_STATUSAREA_WIDTH / 2 - BM_STATUS_WIDTH / 2, SELF_STATUS_Y + BM_STATUSAREA_HEIGHT / 2 - BM_STATUS_WIDTH / 2, BM_STATUS_WIDTH, BM_STATUS_WIDTH, status_color[status]); } // Registers the app in the Unity Messaging Menu void mm_register() { mmapp = messaging_menu_app_new("utox.desktop"); launcher = unity_launcher_entry_get_for_desktop_id("utox.desktop"); messaging_menu_app_register(mmapp); g_signal_connect(mmapp, "activate-source", G_CALLBACK(source_activated), NULL); g_signal_connect(mmapp, "status-changed", G_CALLBACK(status_changed), NULL); mmloop = g_main_loop_new(NULL, FALSE); thread(run_mmloop, NULL); } // Unregisters the app from the Unity Messaging Menu void mm_unregister() { messaging_menu_app_unregister(mmapp); g_object_unref(mmapp); g_main_loop_unref(mmloop); } // Saves the current user ID when minimized void mm_save_cid() { strcpy((char *)f_id_data_on_minimize, (char *)f_id_data); } // Checks if a user is in the Messaging Menu bool is_in_mm(uint8_t *f_id) { if (f_id == NULL) { strcpy((char *)f_id_data, (char *)f_id_data_on_minimize); } else { cid_to_string(f_id_data, f_id); f_id_data[TOX_PUBLIC_KEY_SIZE * 2] = '\0'; } if (f_id_data[0] != '\0') { if (messaging_menu_app_has_source(mmapp, (gchar *)f_id_data)) { return 1; } } return 0; } // Adds an entry to the MessagingMenu gboolean add_source() { messaging_menu_app_append_source(mmapp, (gchar *)f_id_data, NULL, (gchar *)f_name_data); messaging_menu_app_draw_attention(mmapp, (gchar *)f_id_data); unread_friends++; unity_launcher_entry_set_count(launcher, unread_friends); if (unread_friends == 1) { unity_launcher_entry_set_count_visible(launcher, TRUE); } return FALSE; } // Adds a new notification to the Messaging Menu. void mm_notify(char *f_name, uint8_t *f_id) { if (!is_in_mm(f_id)) { strncpy((char *)f_name_data, (char *)f_name, TOX_MAX_NAME_LENGTH); g_idle_add(add_source, NULL); } } // Removes a source from the MessagingMenu gboolean remove_source() { messaging_menu_app_remove_source(mmapp, (gchar *)f_id_data); unread_friends--; unity_launcher_entry_set_count(launcher, unread_friends); if (unread_friends == 0) { unity_launcher_entry_set_count_visible(launcher, FALSE); } return FALSE; } // Removes a notification from the Messaging Menu. void mm_rm_entry(uint8_t *f_id) { if (is_in_mm(f_id)) { g_idle_add(remove_source, NULL); } } #endif uTox/src/xlib/main.h0000600000175000001440000000435314003056216013325 0ustar rakusers#if defined(MAIN_H) && !defined(XLIB_MAIN_H) #error "We should never include main from different platforms." #endif #ifndef XLIB_MAIN_H #define XLIB_MAIN_H #define MAIN_H #ifdef HAVE_DBUS #include "dbus.h" #endif #include "../ui/svg.h" #include #include #include #include #include #include #include #include typedef struct native_image NATIVE_IMAGE; struct native_image { // This is really a Picture, but it is just a typedef for XID, and I didn't // want to clutter namespace with #include for it. XID rgb; XID alpha; }; extern Atom wm_protocols, wm_delete_window; extern Atom XA_CLIPBOARD, XA_NET_NAME, XA_UTF8_STRING, targets, XA_INCR; extern Atom XdndAware, XdndEnter, XdndLeave, XdndPosition, XdndStatus, XdndDrop, XdndSelection, XdndDATA, XdndActionCopy; extern Atom XA_URI_LIST, XA_PNG_IMG; extern Atom XRedraw; extern Picture bitmap[BM_ENDMARKER]; extern Cursor cursors[8]; /* Screen grab vars */ extern uint8_t pointergrab; extern bool _redraw; extern XImage *screen_image; extern int utox_v4l_fd; /* dynamically load libgtk */ extern void *libgtk; extern struct utox_clipboard { int len; char data[UINT16_MAX]; // TODO: De-hardcode this value. } clipboard; extern struct utox_primary { int len; char data[UINT16_MAX]; // TODO: De-hardcode this value. } primary; extern struct utox_pastebuf { int len, left; Atom type; char *data; } pastebuf; Picture ximage_to_picture(XImage *img, const XRenderPictFormat *format); bool doevent(XEvent *event); void togglehide(void); void pasteprimary(void); void setclipboard(void); void pastebestformat(const Atom atoms[], size_t len, Atom selection); void formaturilist(char *out, const char *in, size_t len); void pastedata(void *data, Atom type, size_t len, bool select); // Brute Force, the video window we got a close command on (xlib/video.c) uint16_t find_video_windows(Window w); // video4linux bool v4l_init(char *dev_name); void v4l_close(void); bool v4l_startread(void); bool v4l_endread(void); int v4l_getframe(uint8_t *y, uint8_t *u, uint8_t *v, uint16_t width, uint16_t height); #endif uTox/src/xlib/main.c0000600000175000001440000006750514003056216013330 0ustar rakusers#include "main.h" #include "dbus.h" #include "freetype.h" #include "gtk.h" #include "tray.h" #include "window.h" #include "../avatar.h" #include "../debug.h" #include "../filesys.h" #include "../flist.h" #include "../friend.h" #include "../macros.h" #include "../main.h" // MAIN_WIDTH, MAIN_WIDTH, parse_args, utox_init #include "../settings.h" #include "../text.h" #include "../theme.h" #include "../tox.h" #include "../utox.h" #include "../av/utox_av.h" #include "../native/image.h" #include "../native/notify.h" #include "../native/ui.h" #include "../ui/draw.h" #include "../ui/edit.h" #include "../layout/background.h" #include "../layout/friend.h" #include "../layout/group.h" #include "../layout/settings.h" #include "stb.h" #include #include #include #include #include #include Atom wm_protocols, wm_delete_window; Atom XA_CLIPBOARD, XA_NET_NAME, XA_UTF8_STRING, targets, XA_INCR; Atom XdndAware, XdndEnter, XdndLeave, XdndPosition, XdndStatus, XdndDrop, XdndSelection, XdndDATA, XdndActionCopy; Atom XA_URI_LIST, XA_PNG_IMG; Atom XRedraw; Picture bitmap[BM_ENDMARKER]; Cursor cursors[8]; uint8_t pointergrab; bool _redraw; XImage *screen_image; void *libgtk; struct utox_clipboard clipboard; struct utox_primary primary; struct utox_pastebuf pastebuf; static bool hidden = false; XIC xic = NULL; static XSizeHints *xsh = NULL; static bool shutdown = false; void setclipboard(void) { XSetSelectionOwner(display, XA_CLIPBOARD, main_window.window, CurrentTime); } void postmessage_utox(UTOX_MSG msg, uint16_t param1, uint16_t param2, void *data) { XEvent event = { .xclient = { .window = 0, .type = ClientMessage, .message_type = msg, .format = 8, .data = { .s = { param1, param2 } } } }; memcpy(&event.xclient.data.s[2], &data, sizeof(void *)); XSendEvent(display, main_window.window, False, 0, &event); XFlush(display); } static FILE * ptt_keyboard_handle; static Display *ptt_display; void init_ptt(void) { settings.push_to_talk = 1; char path[UTOX_FILE_NAME_LENGTH]; snprintf(path, UTOX_FILE_NAME_LENGTH, "%s/.config/tox/ppt-kbd", getenv("HOME")); // TODO DRY ptt_keyboard_handle = fopen((const char *)path, "r"); if (!ptt_keyboard_handle) { LOG_TRACE("XLIB", "Could not access ptt-kbd in data directory" ); ptt_display = XOpenDisplay(0); XSynchronize(ptt_display, True); } } #if defined(__linux__) || defined(__DragonFly__) || defined(__FreeBSD__) #include #endif #if defined(__linux__) || defined(__DragonFly__) || defined(__FreeBSD__) static bool linux_check_ptt(void) { /* First, we try for direct access to the keyboard. */ int ptt_key = KEY_LEFTCTRL; // TODO allow user to change this... if (ptt_keyboard_handle) { /* Nice! we have direct access to the keyboard! */ char key_map[KEY_MAX / 8 + 1]; // Create a byte array the size of the number of keys memset(key_map, 0, sizeof(key_map)); ioctl(fileno(ptt_keyboard_handle), EVIOCGKEY(sizeof(key_map)), key_map); // Fill the keymap with the current // keyboard state int keyb = key_map[ptt_key / 8]; // The key we want (and the seven others around it) int mask = 1 << (ptt_key % 8); // Put 1 in the same column as our key state if (keyb & mask) { LOG_TRACE("XLIB", "PTT key is down" ); return true; } else { LOG_TRACE("XLIB", "PTT key is up" ); return false; } } /* Okay nope, let's fallback to xinput... *pouts* * Fall back to Querying the X for the current keymap. */ ptt_key = XKeysymToKeycode(display, XK_Control_L); char keys[32] = { 0 }; /* We need our own connection, so that we don't block the main display... No idea why... */ if (ptt_display) { XQueryKeymap(ptt_display, keys); if (keys[ptt_key / 8] & (0x1 << (ptt_key % 8))) { LOG_TRACE("XLIB", "PTT key is down (according to XQueryKeymap" ); return true; } else { LOG_TRACE("XLIB", "PTT key is up (according to XQueryKeymap" ); return false; } } /* Couldn't access the keyboard directly, and XQuery failed, this is really bad! */ LOG_ERR("XLIB", "Unable to access keyboard, you need to read the manual on how to enable utox to\nhave access to your " "keyboard.\nDisable push to talk to suppress this message.\n"); return false; } #else static bool bsd_check_ptt(void) { return false; } #endif bool check_ptt_key(void) { if (!settings.push_to_talk) { // LOG_TRACE("XLIB", "PTT is disabled" ); return true; /* If push to talk is disabled, return true. */ } #if defined(__linux__) || defined(__DragonFly__) || defined(__FreeBSD__) return linux_check_ptt(); #else return bsd_check_ptt(); #endif } void exit_ptt(void) { if (ptt_keyboard_handle) { fclose(ptt_keyboard_handle); } if (ptt_display) { XCloseDisplay(ptt_display); } settings.push_to_talk = 0; } void image_set_scale(NATIVE_IMAGE *image, double scale) { uint32_t r = (uint32_t)(65536.0 / scale); /* transformation matrix to scale image */ XTransform trans = { { { r, 0, 0 }, { 0, r, 0 }, { 0, 0, 65536 } } }; XRenderSetPictureTransform(display, image->rgb, &trans); if (image->alpha) { XRenderSetPictureTransform(display, image->alpha, &trans); } } void image_set_filter(NATIVE_IMAGE *image, uint8_t filter) { const char *xfilter; switch (filter) { case FILTER_NEAREST: xfilter = FilterNearest; break; case FILTER_BILINEAR: xfilter = FilterBilinear; break; default: LOG_TRACE("XLIB", "Warning: Tried to set image to unrecognized filter(%u)." , filter); return; } XRenderSetPictureFilter(display, image->rgb, xfilter, NULL, 0); if (image->alpha) { XRenderSetPictureFilter(display, image->alpha, xfilter, NULL, 0); } } void thread(void *func(void *), void *args) { pthread_t thread_temp; pthread_attr_t attr; pthread_attr_init(&attr); pthread_attr_setstacksize(&attr, 1 << 20); pthread_create(&thread_temp, &attr, func, args); pthread_attr_destroy(&attr); } void yieldcpu(uint32_t ms) { usleep(1000 * ms); } uint64_t get_time(void) { struct timespec ts; #ifdef CLOCK_MONOTONIC_RAW clock_gettime(CLOCK_MONOTONIC_RAW, &ts); #else clock_gettime(CLOCK_MONOTONIC, &ts); #endif return ((uint64_t)ts.tv_sec * (1000 * 1000 * 1000)) + (uint64_t)ts.tv_nsec; } void openurl(char *str) { if (try_open_tox_uri(str)) { redraw(); return; } char *cmd = "xdg-open"; if (!fork()) { execlp(cmd, cmd, str, (char *)0); exit(127); } waitpid(-1, NULL, WNOHANG); /* reap last child */ } void openfilesend(void) { if (libgtk) { ugtk_openfilesend(); } } void openfileavatar(void) { if (libgtk) { ugtk_openfileavatar(); } } void setselection(char *data, uint16_t length) { if (!length) { return; } memcpy(primary.data, data, length); primary.len = length; XSetSelectionOwner(display, XA_PRIMARY, main_window.window, CurrentTime); } /** Toggles the main window to/from hidden to tray/shown. */ void togglehide(void) { if (hidden) { XMoveWindow(display, main_window.window, main_window._.x, main_window._.y); XMapWindow(display, main_window.window); redraw(); hidden = 0; } else { XWithdrawWindow(display, main_window.window, def_screen_num); hidden = 1; } } void pasteprimary(void) { Window owner = XGetSelectionOwner(display, XA_PRIMARY); if (owner) { XConvertSelection(display, XA_PRIMARY, XA_UTF8_STRING, targets, main_window.window, CurrentTime); } } void copy(int value) { int len; if (edit_active()) { len = edit_copy((char *)clipboard.data, sizeof(clipboard.data)); } else if (flist_get_sel_friend()) { len = messages_selection(&messages_friend, clipboard.data, sizeof(clipboard.data), value); } else if (flist_get_sel_group()) { len = messages_selection(&messages_group, clipboard.data, sizeof(clipboard.data), value); } else { LOG_ERR("XLIB", "Copy from Unsupported flist type."); return; } if (len) { clipboard.len = len; setclipboard(); } } int hold_x11s_hand(Display *UNUSED(d), XErrorEvent *event) { LOG_ERR("XLIB", "X11 err:\tX11 tried to kill itself, so I hit him with a shovel."); LOG_ERR("XLIB", " err:\tResource: %lu || Serial %lu", event->resourceid, event->serial); LOG_ERR("XLIB", " err:\tError code: %u || Request: %u || Minor: %u", event->error_code, event->request_code, event->minor_code); LOG_ERR("uTox", "This would be a great time to submit a bug!"); return 0; } void paste(void) { Window owner = XGetSelectionOwner(display, XA_CLIPBOARD); /* Ask owner for supported types */ if (owner) { XEvent event = { .xselectionrequest = { .type = SelectionRequest, .send_event = True, .display = display, .owner = owner, .requestor = main_window.window, .target = targets, .selection = XA_CLIPBOARD, .property = XA_ATOM, .time = CurrentTime } }; XSendEvent(display, owner, 0, NoEventMask, &event); XFlush(display); } } void pastebestformat(const Atom atoms[], size_t len, Atom selection) { XSetErrorHandler(hold_x11s_hand); const Atom supported[] = { XA_PNG_IMG, XA_URI_LIST, XA_UTF8_STRING }; size_t i, j; for (i = 0; i < len; i++) { char *name = XGetAtomName(display, atoms[i]); if (name) { LOG_TRACE("XLIB", "Supported type: %s" , name); } else { LOG_TRACE("XLIB", "Unsupported type!!: Likely a bug, please report!" ); } } for (i = 0; i < len; i++) { for (j = 0; j < COUNTOF(supported); j++) { if (atoms[i] == supported[j]) { XConvertSelection(display, selection, supported[j], targets, main_window.window, CurrentTime); return; } } } } static bool ishexdigit(char c) { c = toupper(c); return (c >= '0' && c <= '9') || (c >= 'A' && c <= 'F'); } static char hexdecode(char upper, char lower) { upper = toupper(upper); lower = toupper(lower); return (upper >= 'A' ? upper - 'A' + 10 : upper - '0') * 16 + (lower >= 'A' ? lower - 'A' + 10 : lower - '0'); } void formaturilist(char *out, const char *in, size_t len) { size_t i, removed = 0, start = 0; for (i = 0; i < len; i++) { // Replace CRLF with LF if (in[i] == '\r') { memcpy(out + start - removed, in + start, i - start); start = i + 1; removed++; } else if (in[i] == '%' && i + 2 < len && ishexdigit(in[i + 1]) && ishexdigit(in[i + 2])) { memcpy(out + start - removed, in + start, i - start); out[i - removed] = hexdecode(in[i + 1], in[i + 2]); start = i + 3; removed += 2; } } if (start != len) { memcpy(out + start - removed, in + start, len - start); } out[len - removed] = 0; // out[len - removed - 1] = '\n'; } // TODO(robinli): Go over this function and see if either len or size are removable. void pastedata(void *data, Atom type, size_t len, bool select) { size_t size = len; if (type == XA_PNG_IMG) { FRIEND *f = flist_get_sel_friend(); if (!f) { LOG_ERR("XLIB", "Can't paste data to missing friend."); return; } uint16_t width, height; NATIVE_IMAGE *native_image = utox_image_to_native(data, size, &width, &height, 0); if (NATIVE_IMAGE_IS_VALID(native_image)) { LOG_INFO("XLIB MAIN", "Pasted image: %dx%d", width, height); UTOX_IMAGE png_image = malloc(size); if (!png_image){ LOG_ERR("XLIB", "Could not allocate memory for an image"); free(native_image); return; } memcpy(png_image, data, size); friend_sendimage(f, native_image, width, height, png_image, size); } } else if (type == XA_URI_LIST) { FRIEND *f = flist_get_sel_friend(); if (!f) { LOG_ERR("XLIB", "Can't paste data to missing friend."); return; } char *path = malloc(len + 1); if (!path) { LOG_ERR("XLIB", "Could not allocate memory for path."); return; } formaturilist(path, (char *)data, len); postmessage_toxcore(TOX_FILE_SEND_NEW, f->number, 0xFFFF, path); } else if (type == XA_UTF8_STRING && edit_active()) { edit_paste(data, len, select); } } // converts an XImage to a Picture usable by XRender, uses XRenderPictFormat given by // 'format', uses the default format if it is NULL Picture ximage_to_picture(XImage *img, const XRenderPictFormat *format) { Pixmap pixmap = XCreatePixmap(display, main_window.window, img->width, img->height, img->depth); GC legc = XCreateGC(display, pixmap, 0, NULL); XPutImage(display, pixmap, legc, img, 0, 0, 0, 0, img->width, img->height); if (format == NULL) { format = XRenderFindVisualFormat(display, default_visual); } Picture picture = XRenderCreatePicture(display, pixmap, format, 0, NULL); XFreeGC(display, legc); XFreePixmap(display, pixmap); return picture; } void loadalpha(int bm, void *data, int width, int height) { if (bm < 0){ LOG_ERR("XLIB", "Can not get object from array. Index %d", bm); return; } XImage *img = XCreateImage(display, CopyFromParent, 8, ZPixmap, 0, data, width, height, 8, 0); // create picture that only holds alpha values // NOTE: the XImage made earlier should really be freed, but calling XDestroyImage on it will also // automatically free the data it's pointing to(which we don't want), so there's no easy way to destroy them // currently bitmap[bm] = ximage_to_picture(img, XRenderFindStandardFormat(display, PictStandardA8)); } /* generates an alpha bitmask based on the alpha channel in given rgba_data * returned picture will have 1 byte for each pixel, and have the same width and height as input */ static Picture generate_alpha_bitmask(const uint8_t *rgba_data, uint16_t width, uint16_t height, uint32_t rgba_size) { // we don't need to free this, that's done by XDestroyImage() uint8_t *out = malloc(rgba_size / 4); uint32_t i, j; for (i = j = 0; i < rgba_size; i += 4, j++) { out[j] = (rgba_data + i)[3] & 0xFF; // take only alpha values } // create 1-byte-per-pixel image and convert it to a Alpha-format Picture XImage *img = XCreateImage(display, CopyFromParent, 8, ZPixmap, 0, (char *)out, width, height, 8, width); Picture picture = ximage_to_picture(img, XRenderFindStandardFormat(display, PictStandardA8)); XDestroyImage(img); return picture; } /* Swaps out the PNG color order for the native color order */ static void native_color_mask(uint8_t *data, uint32_t size, uint32_t mask_red, uint32_t mask_blue, uint32_t mask_green) { uint8_t red, blue, green; uint32_t *dest; for (uint32_t i = 0; i < size; i += 4) { red = (data + i)[0] & 0xFF; green = (data + i)[1] & 0xFF; blue = (data + i)[2] & 0xFF; dest = (uint32_t*)(data + i); *dest = (red | (red << 8) | (red << 16) | (red << 24)) & mask_red; *dest |= (blue | (blue << 8) | (blue << 16) | (blue << 24)) & mask_blue; *dest |= (green | (green << 8) | (green << 16) | (green << 24)) & mask_green; } } NATIVE_IMAGE *utox_image_to_native(const UTOX_IMAGE data, size_t size, uint16_t *w, uint16_t *h, bool keep_alpha) { int width, height, bpp; uint8_t *rgba_data = stbi_load_from_memory(data, size, &width, &height, &bpp, 4); // we don't need to free this, that's done by XDestroyImage() if (rgba_data == NULL || width == 0 || height == 0) { return None; // invalid png data } uint32_t rgba_size = width * height * 4; Picture alpha = (bpp == 4 && keep_alpha) ? generate_alpha_bitmask(rgba_data, width, height, rgba_size) : None; native_color_mask(rgba_data, rgba_size, default_visual->red_mask, default_visual->blue_mask, default_visual->green_mask); XImage *img = XCreateImage(display, default_visual, default_depth, ZPixmap, 0, (char *)rgba_data, width, height, 32, width * 4); Picture rgb = ximage_to_picture(img, NULL); XDestroyImage(img); *w = width; *h = height; NATIVE_IMAGE *image = malloc(sizeof(NATIVE_IMAGE)); if (image == NULL) { LOG_ERR("utox_image_to_native", "Could not allocate memory for image." ); return NULL; } image->rgb = rgb; image->alpha = alpha; return image; } void image_free(NATIVE_IMAGE *image) { if (!image) { return; } XRenderFreePicture(display, image->rgb); if (image->alpha) { XRenderFreePicture(display, image->alpha); } free(image); } /** Sets file system permissions to something slightly safer. * * returns 0 and 1 on success and failure. */ int ch_mod(uint8_t *file) { return chmod((char *)file, S_IRUSR | S_IWUSR); } void flush_file(FILE *file) { fflush(file); int fd = fileno(file); fsync(fd); } void setscale(void) { unsigned int i; for (i = 0; i != COUNTOF(bitmap); i++) { if (bitmap[i]) { XRenderFreePicture(display, bitmap[i]); } } svg_draw(0); if (xsh) { XFree(xsh); } // TODO, fork this to a function xsh = XAllocSizeHints(); xsh->flags = PMinSize; xsh->min_width = SCALE(MAIN_WIDTH); xsh->min_height = SCALE(MAIN_HEIGHT); XSetWMNormalHints(display, main_window.window, xsh); if (settings.window_width > (uint32_t)SCALE(MAIN_WIDTH) && settings.window_height > (uint32_t)SCALE(MAIN_HEIGHT)) { /* won't get a resize event, call this manually */ ui_size(settings.window_width, settings.window_height); } } void setscale_fonts(void) { freefonts(); loadfonts(); font_small_lineheight = (font[FONT_TEXT].info[0].face->size->metrics.height + (1 << 5)) >> 6; // font_msg_lineheight = (font[FONT_MSG].info[0].face->size->metrics.height + (1 << 5)) >> 6; } void notify(char *title, uint16_t UNUSED(title_length), const char *msg, uint16_t msg_length, void *object, bool is_group) { if (have_focus) { return; } uint8_t *f_cid = NULL; if (is_group) { // GROUPCHAT *obj = object; } else { FRIEND *obj = object; if (friend_has_avatar(obj)) { f_cid = obj->id_bin; } } XWMHints hints = {.flags = 256 }; XSetWMHints(display, main_window.window, &hints); #ifdef HAVE_DBUS char *str = tohtml(msg, msg_length); dbus_notify(title, str, f_cid); free(str); #else (void)title; // I don't like this either, but this is all going away soon! (void)msg; (void)msg_length; #endif #ifdef UNITY if (unity_running) { mm_notify(obj->name, f_cid); } #else (void)f_cid; #endif } void showkeyboard(bool UNUSED(show)) {} void edit_will_deactivate(void) {} void update_tray(void) {} static void atom_init(void) { wm_protocols = XInternAtom(display, "WM_PROTOCOLS", 0); wm_delete_window = XInternAtom(display, "WM_DELETE_WINDOW", 0); XA_CLIPBOARD = XInternAtom(display, "CLIPBOARD", 0); XA_NET_NAME = XInternAtom(display, "_NET_WM_NAME", 0); XA_UTF8_STRING = XInternAtom(display, "UTF8_STRING", 1); if (XA_UTF8_STRING == None) { XA_UTF8_STRING = XA_STRING; } targets = XInternAtom(display, "TARGETS", 0); XA_INCR = XInternAtom(display, "INCR", false); XdndAware = XInternAtom(display, "XdndAware", false); XdndEnter = XInternAtom(display, "XdndEnter", false); XdndLeave = XInternAtom(display, "XdndLeave", false); XdndPosition = XInternAtom(display, "XdndPosition", false); XdndStatus = XInternAtom(display, "XdndStatus", false); XdndDrop = XInternAtom(display, "XdndDrop", false); XdndSelection = XInternAtom(display, "XdndSelection", false); XdndDATA = XInternAtom(display, "XdndDATA", false); XdndActionCopy = XInternAtom(display, "XdndActionCopy", false); XA_URI_LIST = XInternAtom(display, "text/uri-list", false); XA_PNG_IMG = XInternAtom(display, "image/png", false); XRedraw = XInternAtom(display, "XRedraw", false); } static void cursors_init(void) { cursors[CURSOR_NONE] = XCreateFontCursor(display, XC_left_ptr); cursors[CURSOR_HAND] = XCreateFontCursor(display, XC_hand2); cursors[CURSOR_TEXT] = XCreateFontCursor(display, XC_xterm); cursors[CURSOR_SELECT] = XCreateFontCursor(display, XC_crosshair); cursors[CURSOR_ZOOM_IN] = XCreateFontCursor(display, XC_target); cursors[CURSOR_ZOOM_OUT] = XCreateFontCursor(display, XC_target); } static void signal_handler(int signal) { LOG_INFO("XLIB MAIN", "Got signal: %s (%i)", strsignal(signal), signal); shutdown = true; } #include "../ui/dropdown.h" // this is for dropdown.language TODO provide API int main(int argc, char *argv[]) { if (!XInitThreads()) { LOG_FATAL_ERR(EXIT_FAILURE, "XLIB MAIN", "XInitThreads failed."); } if (!native_window_init()) { return 2; } initfonts(); #ifdef HAVE_DBUS LOG_INFO("XLIB MAIN", "Compiled with dbus support!"); #endif int8_t should_launch_at_startup; int8_t set_show_window; bool allow_root; parse_args(argc, argv, &should_launch_at_startup, &set_show_window, &allow_root); if (getuid() == 0 && !allow_root){ LOG_FATAL_ERR(EXIT_FAILURE, "XLIB MAIN", "You can't run uTox as root unless --allow-root is set."); } // We need to parse_args before calling utox_init() utox_init(); if (should_launch_at_startup == 1 || should_launch_at_startup == -1) { LOG_NOTE("XLIB", "Start on boot not supported on this OS, please use your distro suggested method!\n"); } LOG_INFO("XLIB MAIN", "Setting theme to:\t%d", settings.theme); theme_load(settings.theme); XSetErrorHandler(hold_x11s_hand); XIM xim; setlocale(LC_ALL, ""); XSetLocaleModifiers(""); if ((xim = XOpenIM(display, 0, 0, 0)) == NULL) { LOG_ERR("XLIB", "Cannot open input method"); } atom_init(); native_window_create_main(settings.window_x, settings.window_y, settings.window_width, settings.window_height, argv, argc); main_window.gc = DefaultGC(display, def_screen_num); main_window.drawbuf = XCreatePixmap(display, main_window.window, settings.window_width, settings.window_height, default_depth); /* choose available libraries for optional UI stuff */ if (!(libgtk = ugtk_load())) { // try Qt } /* catch WM_DELETE_WINDOW */ XSetWMProtocols(display, main_window.window, &wm_delete_window, 1); struct sigaction action; action.sa_handler = &signal_handler; /* catch terminating signals */ sigaction(SIGINT, &action, NULL); sigaction(SIGHUP, &action, NULL); sigaction(SIGTERM, &action, NULL); /* set drag and drog version */ Atom dndversion = 3; XChangeProperty(display, main_window.window, XdndAware, XA_ATOM, 32, PropModeReplace, (uint8_t *)&dndversion, 1); /* initialize fontconfig */ loadfonts(); setfont(FONT_TEXT); cursors_init(); ui_rescale(0); /* */ XGCValues gcval; gcval.foreground = XWhitePixel(display, 0); gcval.function = GXxor; gcval.background = XBlackPixel(display, 0); gcval.plane_mask = gcval.background ^ gcval.foreground; gcval.subwindow_mode = IncludeInferiors; /* GC for the */ scr_grab_window.gc = XCreateGC(display, RootWindow(display, def_screen_num), GCFunction | GCForeground | GCBackground | GCSubwindowMode, &gcval); XWindowAttributes attr; XGetWindowAttributes(display, root_window, &attr); main_window.pictformat = XRenderFindVisualFormat(display, attr.visual); // XRenderPictFormat *pictformat = XRenderFindStandardFormat(display, PictStandardA8); /* Xft draw context/color */ main_window.renderpic = XRenderCreatePicture(display, main_window.drawbuf, main_window.pictformat, 0, NULL); XRenderColor xrcolor = { 0,0,0,0 }; main_window.colorpic = XRenderCreateSolidFill(display, &xrcolor); if (set_show_window) { if (set_show_window == 1) { settings.start_in_tray = 0; } else if (set_show_window == -1) { settings.start_in_tray = 1; } } /* make the window visible */ if (settings.start_in_tray) { togglehide(); } else { XMapWindow(display, main_window.window); } if (xim) { if ((xic = XCreateIC(xim, XNInputStyle, XIMPreeditNothing | XIMStatusNothing, XNClientWindow, main_window.window, XNFocusWindow, main_window.window, NULL))) { XSetICFocus(xic); } else { LOG_ERR("XLIB", "Cannot open input method"); XCloseIM(xim); xim = 0; } } /* set the width/height of the drawing region */ ui_size(settings.window_width, settings.window_height); create_tray_icon(); /* Registers the app in the Unity MM */ #ifdef UNITY unity_running = is_unity_running(); if (unity_running) { mm_register(); } #endif /* draw */ native_window_set_target(&main_window); panel_draw(&panel_root, 0, 0, settings.window_width, settings.window_height); // start toxcore thread thread(toxcore_thread, NULL); /* event loop */ while (!shutdown) { XEvent event; XNextEvent(display, &event); if (!doevent(&event)) { break; } if (XPending(display)) { continue; } if (_redraw) { native_window_set_target(&main_window); panel_draw(&panel_root, 0, 0, settings.window_width, settings.window_height); _redraw = 0; } } Window root_return, child_return; int x_return, y_return; unsigned int width_return, height_return, i; XGetGeometry(display, main_window.window, &root_return, &x_return, &y_return, &width_return, &height_return, &i, &i); XTranslateCoordinates(display, main_window.window, root_return, 0, 0, &x_return, &y_return, &child_return); settings.window_x = x_return < 0 ? 0 : x_return; settings.window_y = y_return < 0 ? 0 : y_return; settings.window_width = width_return; settings.window_height = height_return; config_save(); postmessage_utoxav(UTOXAV_KILL, 0, 0, NULL); postmessage_toxcore(TOX_KILL, 0, 0, NULL); /* free client thread stuff */ if (libgtk) { } destroy_tray_icon(); FcFontSetSortDestroy(fs); freefonts(); XFreePixmap(display, main_window.drawbuf); XFreeGC(display, scr_grab_window.gc); XRenderFreePicture(display, main_window.renderpic); XRenderFreePicture(display, main_window.colorpic); if (xic) { XDestroyIC(xic); } if (xim) { XCloseIM(xim); } XDestroyWindow(display, main_window.window); XCloseDisplay(display); /* Unregisters the app from the Unity MM */ #ifdef UNITY if (unity_running) { mm_unregister(); } #endif // wait for tox_thread to exit while (tox_thread_init) { yieldcpu(1); } return 0; } /* Dummy functions used in other systems... */ void launch_at_startup(bool UNUSED(is_launch_at_startup)) {} uTox/src/xlib/keysym2ucs.h0000600000175000001440000020634514003056216014524 0ustar rakusers/* $XFree86$ * This module converts keysym values into the corresponding ISO 10646 * (UCS, Unicode) values. * * The array keysymtab[] contains pairs of X11 keysym values for graphical * characters and the corresponding Unicode value. The function * keysym2ucs() maps a keysym onto a Unicode value using a binary search, * therefore keysymtab[] must remain SORTED by keysym value. * * The keysym -> UTF-8 conversion will hopefully one day be provided * by Xlib via XmbLookupString() and should ideally not have to be * done in X applications. But we are not there yet. * * We allow to represent any UCS character in the range U-00000000 to * U-00FFFFFF by a keysym value in the range 0x01000000 to 0x01ffffff. * This admittedly does not cover the entire 31-bit space of UCS, but * it does cover all of the characters up to U-10FFFF, which can be * represented by UTF-16, and more, and it is very unlikely that higher * UCS codes will ever be assigned by ISO. So to get Unicode character * U+ABCD you can directly use keysym 0x0100abcd. * * NOTE: The comments in the table below contain the actual character * encoded in UTF-8, so for viewing and editing best use an editor in * UTF-8 mode. * * Author: Markus G. Kuhn , * University of Cambridge, April 2001 * * Special thanks to Richard Verhoeven for preparing * an initial draft of the mapping table. * * This software is in the public domain. Share and enjoy! * * AUTOMATICALLY GENERATED FILE, DO NOT EDIT !!! (unicode/convmap.pl) */ #ifndef KEYSYM2UCS_H #define KEYSYM2UCS_H #include #include struct codepair { unsigned short keysym; unsigned short ucs; } keysymtab[] = { { 0x01a1, 0x0104 }, /* Aogonek Ą LATIN CAPITAL LETTER A WITH OGONEK */ { 0x01a2, 0x02d8 }, /* breve ˘ BREVE */ { 0x01a3, 0x0141 }, /* Lstroke Ł LATIN CAPITAL LETTER L WITH STROKE */ { 0x01a5, 0x013d }, /* Lcaron Ľ LATIN CAPITAL LETTER L WITH CARON */ { 0x01a6, 0x015a }, /* Sacute Ś LATIN CAPITAL LETTER S WITH ACUTE */ { 0x01a9, 0x0160 }, /* Scaron Š LATIN CAPITAL LETTER S WITH CARON */ { 0x01aa, 0x015e }, /* Scedilla Ş LATIN CAPITAL LETTER S WITH CEDILLA */ { 0x01ab, 0x0164 }, /* Tcaron Ť LATIN CAPITAL LETTER T WITH CARON */ { 0x01ac, 0x0179 }, /* Zacute Ź LATIN CAPITAL LETTER Z WITH ACUTE */ { 0x01ae, 0x017d }, /* Zcaron Ž LATIN CAPITAL LETTER Z WITH CARON */ { 0x01af, 0x017b }, /* Zabovedot Ż LATIN CAPITAL LETTER Z WITH DOT ABOVE */ { 0x01b1, 0x0105 }, /* aogonek ą LATIN SMALL LETTER A WITH OGONEK */ { 0x01b2, 0x02db }, /* ogonek ˛ OGONEK */ { 0x01b3, 0x0142 }, /* lstroke ł LATIN SMALL LETTER L WITH STROKE */ { 0x01b5, 0x013e }, /* lcaron ľ LATIN SMALL LETTER L WITH CARON */ { 0x01b6, 0x015b }, /* sacute ś LATIN SMALL LETTER S WITH ACUTE */ { 0x01b7, 0x02c7 }, /* caron ˇ CARON */ { 0x01b9, 0x0161 }, /* scaron š LATIN SMALL LETTER S WITH CARON */ { 0x01ba, 0x015f }, /* scedilla ş LATIN SMALL LETTER S WITH CEDILLA */ { 0x01bb, 0x0165 }, /* tcaron ť LATIN SMALL LETTER T WITH CARON */ { 0x01bc, 0x017a }, /* zacute ź LATIN SMALL LETTER Z WITH ACUTE */ { 0x01bd, 0x02dd }, /* doubleacute ˝ DOUBLE ACUTE ACCENT */ { 0x01be, 0x017e }, /* zcaron ž LATIN SMALL LETTER Z WITH CARON */ { 0x01bf, 0x017c }, /* zabovedot ż LATIN SMALL LETTER Z WITH DOT ABOVE */ { 0x01c0, 0x0154 }, /* Racute Ŕ LATIN CAPITAL LETTER R WITH ACUTE */ { 0x01c3, 0x0102 }, /* Abreve Ă LATIN CAPITAL LETTER A WITH BREVE */ { 0x01c5, 0x0139 }, /* Lacute Ĺ LATIN CAPITAL LETTER L WITH ACUTE */ { 0x01c6, 0x0106 }, /* Cacute Ć LATIN CAPITAL LETTER C WITH ACUTE */ { 0x01c8, 0x010c }, /* Ccaron Č LATIN CAPITAL LETTER C WITH CARON */ { 0x01ca, 0x0118 }, /* Eogonek Ę LATIN CAPITAL LETTER E WITH OGONEK */ { 0x01cc, 0x011a }, /* Ecaron Ě LATIN CAPITAL LETTER E WITH CARON */ { 0x01cf, 0x010e }, /* Dcaron Ď LATIN CAPITAL LETTER D WITH CARON */ { 0x01d0, 0x0110 }, /* Dstroke Đ LATIN CAPITAL LETTER D WITH STROKE */ { 0x01d1, 0x0143 }, /* Nacute Ń LATIN CAPITAL LETTER N WITH ACUTE */ { 0x01d2, 0x0147 }, /* Ncaron Ň LATIN CAPITAL LETTER N WITH CARON */ { 0x01d5, 0x0150 }, /* Odoubleacute Ő LATIN CAPITAL LETTER O WITH DOUBLE ACUTE */ { 0x01d8, 0x0158 }, /* Rcaron Ř LATIN CAPITAL LETTER R WITH CARON */ { 0x01d9, 0x016e }, /* Uring Ů LATIN CAPITAL LETTER U WITH RING ABOVE */ { 0x01db, 0x0170 }, /* Udoubleacute Ű LATIN CAPITAL LETTER U WITH DOUBLE ACUTE */ { 0x01de, 0x0162 }, /* Tcedilla Ţ LATIN CAPITAL LETTER T WITH CEDILLA */ { 0x01e0, 0x0155 }, /* racute ŕ LATIN SMALL LETTER R WITH ACUTE */ { 0x01e3, 0x0103 }, /* abreve ă LATIN SMALL LETTER A WITH BREVE */ { 0x01e5, 0x013a }, /* lacute ĺ LATIN SMALL LETTER L WITH ACUTE */ { 0x01e6, 0x0107 }, /* cacute ć LATIN SMALL LETTER C WITH ACUTE */ { 0x01e8, 0x010d }, /* ccaron č LATIN SMALL LETTER C WITH CARON */ { 0x01ea, 0x0119 }, /* eogonek ę LATIN SMALL LETTER E WITH OGONEK */ { 0x01ec, 0x011b }, /* ecaron ě LATIN SMALL LETTER E WITH CARON */ { 0x01ef, 0x010f }, /* dcaron ď LATIN SMALL LETTER D WITH CARON */ { 0x01f0, 0x0111 }, /* dstroke đ LATIN SMALL LETTER D WITH STROKE */ { 0x01f1, 0x0144 }, /* nacute ń LATIN SMALL LETTER N WITH ACUTE */ { 0x01f2, 0x0148 }, /* ncaron ň LATIN SMALL LETTER N WITH CARON */ { 0x01f5, 0x0151 }, /* odoubleacute ő LATIN SMALL LETTER O WITH DOUBLE ACUTE */ { 0x01f8, 0x0159 }, /* rcaron ř LATIN SMALL LETTER R WITH CARON */ { 0x01f9, 0x016f }, /* uring ů LATIN SMALL LETTER U WITH RING ABOVE */ { 0x01fb, 0x0171 }, /* udoubleacute ű LATIN SMALL LETTER U WITH DOUBLE ACUTE */ { 0x01fe, 0x0163 }, /* tcedilla ţ LATIN SMALL LETTER T WITH CEDILLA */ { 0x01ff, 0x02d9 }, /* abovedot ˙ DOT ABOVE */ { 0x02a1, 0x0126 }, /* Hstroke Ħ LATIN CAPITAL LETTER H WITH STROKE */ { 0x02a6, 0x0124 }, /* Hcircumflex Ĥ LATIN CAPITAL LETTER H WITH CIRCUMFLEX */ { 0x02a9, 0x0130 }, /* Iabovedot İ LATIN CAPITAL LETTER I WITH DOT ABOVE */ { 0x02ab, 0x011e }, /* Gbreve Ğ LATIN CAPITAL LETTER G WITH BREVE */ { 0x02ac, 0x0134 }, /* Jcircumflex Ĵ LATIN CAPITAL LETTER J WITH CIRCUMFLEX */ { 0x02b1, 0x0127 }, /* hstroke ħ LATIN SMALL LETTER H WITH STROKE */ { 0x02b6, 0x0125 }, /* hcircumflex ĥ LATIN SMALL LETTER H WITH CIRCUMFLEX */ { 0x02b9, 0x0131 }, /* idotless ı LATIN SMALL LETTER DOTLESS I */ { 0x02bb, 0x011f }, /* gbreve ğ LATIN SMALL LETTER G WITH BREVE */ { 0x02bc, 0x0135 }, /* jcircumflex ĵ LATIN SMALL LETTER J WITH CIRCUMFLEX */ { 0x02c5, 0x010a }, /* Cabovedot Ċ LATIN CAPITAL LETTER C WITH DOT ABOVE */ { 0x02c6, 0x0108 }, /* Ccircumflex Ĉ LATIN CAPITAL LETTER C WITH CIRCUMFLEX */ { 0x02d5, 0x0120 }, /* Gabovedot Ġ LATIN CAPITAL LETTER G WITH DOT ABOVE */ { 0x02d8, 0x011c }, /* Gcircumflex Ĝ LATIN CAPITAL LETTER G WITH CIRCUMFLEX */ { 0x02dd, 0x016c }, /* Ubreve Ŭ LATIN CAPITAL LETTER U WITH BREVE */ { 0x02de, 0x015c }, /* Scircumflex Ŝ LATIN CAPITAL LETTER S WITH CIRCUMFLEX */ { 0x02e5, 0x010b }, /* cabovedot ċ LATIN SMALL LETTER C WITH DOT ABOVE */ { 0x02e6, 0x0109 }, /* ccircumflex ĉ LATIN SMALL LETTER C WITH CIRCUMFLEX */ { 0x02f5, 0x0121 }, /* gabovedot ġ LATIN SMALL LETTER G WITH DOT ABOVE */ { 0x02f8, 0x011d }, /* gcircumflex ĝ LATIN SMALL LETTER G WITH CIRCUMFLEX */ { 0x02fd, 0x016d }, /* ubreve ŭ LATIN SMALL LETTER U WITH BREVE */ { 0x02fe, 0x015d }, /* scircumflex ŝ LATIN SMALL LETTER S WITH CIRCUMFLEX */ { 0x03a2, 0x0138 }, /* kra ĸ LATIN SMALL LETTER KRA */ { 0x03a3, 0x0156 }, /* Rcedilla Ŗ LATIN CAPITAL LETTER R WITH CEDILLA */ { 0x03a5, 0x0128 }, /* Itilde Ĩ LATIN CAPITAL LETTER I WITH TILDE */ { 0x03a6, 0x013b }, /* Lcedilla Ļ LATIN CAPITAL LETTER L WITH CEDILLA */ { 0x03aa, 0x0112 }, /* Emacron Ē LATIN CAPITAL LETTER E WITH MACRON */ { 0x03ab, 0x0122 }, /* Gcedilla Ģ LATIN CAPITAL LETTER G WITH CEDILLA */ { 0x03ac, 0x0166 }, /* Tslash Ŧ LATIN CAPITAL LETTER T WITH STROKE */ { 0x03b3, 0x0157 }, /* rcedilla ŗ LATIN SMALL LETTER R WITH CEDILLA */ { 0x03b5, 0x0129 }, /* itilde ĩ LATIN SMALL LETTER I WITH TILDE */ { 0x03b6, 0x013c }, /* lcedilla ļ LATIN SMALL LETTER L WITH CEDILLA */ { 0x03ba, 0x0113 }, /* emacron ē LATIN SMALL LETTER E WITH MACRON */ { 0x03bb, 0x0123 }, /* gcedilla ģ LATIN SMALL LETTER G WITH CEDILLA */ { 0x03bc, 0x0167 }, /* tslash ŧ LATIN SMALL LETTER T WITH STROKE */ { 0x03bd, 0x014a }, /* ENG Ŋ LATIN CAPITAL LETTER ENG */ { 0x03bf, 0x014b }, /* eng ŋ LATIN SMALL LETTER ENG */ { 0x03c0, 0x0100 }, /* Amacron Ā LATIN CAPITAL LETTER A WITH MACRON */ { 0x03c7, 0x012e }, /* Iogonek Į LATIN CAPITAL LETTER I WITH OGONEK */ { 0x03cc, 0x0116 }, /* Eabovedot Ė LATIN CAPITAL LETTER E WITH DOT ABOVE */ { 0x03cf, 0x012a }, /* Imacron Ī LATIN CAPITAL LETTER I WITH MACRON */ { 0x03d1, 0x0145 }, /* Ncedilla Ņ LATIN CAPITAL LETTER N WITH CEDILLA */ { 0x03d2, 0x014c }, /* Omacron Ō LATIN CAPITAL LETTER O WITH MACRON */ { 0x03d3, 0x0136 }, /* Kcedilla Ķ LATIN CAPITAL LETTER K WITH CEDILLA */ { 0x03d9, 0x0172 }, /* Uogonek Ų LATIN CAPITAL LETTER U WITH OGONEK */ { 0x03dd, 0x0168 }, /* Utilde Ũ LATIN CAPITAL LETTER U WITH TILDE */ { 0x03de, 0x016a }, /* Umacron Ū LATIN CAPITAL LETTER U WITH MACRON */ { 0x03e0, 0x0101 }, /* amacron ā LATIN SMALL LETTER A WITH MACRON */ { 0x03e7, 0x012f }, /* iogonek į LATIN SMALL LETTER I WITH OGONEK */ { 0x03ec, 0x0117 }, /* eabovedot ė LATIN SMALL LETTER E WITH DOT ABOVE */ { 0x03ef, 0x012b }, /* imacron ī LATIN SMALL LETTER I WITH MACRON */ { 0x03f1, 0x0146 }, /* ncedilla ņ LATIN SMALL LETTER N WITH CEDILLA */ { 0x03f2, 0x014d }, /* omacron ō LATIN SMALL LETTER O WITH MACRON */ { 0x03f3, 0x0137 }, /* kcedilla ķ LATIN SMALL LETTER K WITH CEDILLA */ { 0x03f9, 0x0173 }, /* uogonek ų LATIN SMALL LETTER U WITH OGONEK */ { 0x03fd, 0x0169 }, /* utilde ũ LATIN SMALL LETTER U WITH TILDE */ { 0x03fe, 0x016b }, /* umacron ū LATIN SMALL LETTER U WITH MACRON */ { 0x047e, 0x203e }, /* overline ‾ OVERLINE */ { 0x04a1, 0x3002 }, /* kana_fullstop 。 IDEOGRAPHIC FULL STOP */ { 0x04a2, 0x300c }, /* kana_openingbracket 「 LEFT CORNER BRACKET */ { 0x04a3, 0x300d }, /* kana_closingbracket 」 RIGHT CORNER BRACKET */ { 0x04a4, 0x3001 }, /* kana_comma 、 IDEOGRAPHIC COMMA */ { 0x04a5, 0x30fb }, /* kana_conjunctive ・ KATAKANA MIDDLE DOT */ { 0x04a6, 0x30f2 }, /* kana_WO ヲ KATAKANA LETTER WO */ { 0x04a7, 0x30a1 }, /* kana_a ァ KATAKANA LETTER SMALL A */ { 0x04a8, 0x30a3 }, /* kana_i ィ KATAKANA LETTER SMALL I */ { 0x04a9, 0x30a5 }, /* kana_u ゥ KATAKANA LETTER SMALL U */ { 0x04aa, 0x30a7 }, /* kana_e ェ KATAKANA LETTER SMALL E */ { 0x04ab, 0x30a9 }, /* kana_o ォ KATAKANA LETTER SMALL O */ { 0x04ac, 0x30e3 }, /* kana_ya ャ KATAKANA LETTER SMALL YA */ { 0x04ad, 0x30e5 }, /* kana_yu ュ KATAKANA LETTER SMALL YU */ { 0x04ae, 0x30e7 }, /* kana_yo ョ KATAKANA LETTER SMALL YO */ { 0x04af, 0x30c3 }, /* kana_tsu ッ KATAKANA LETTER SMALL TU */ { 0x04b0, 0x30fc }, /* prolongedsound ー KATAKANA-HIRAGANA PROLONGED SOUND MARK */ { 0x04b1, 0x30a2 }, /* kana_A ア KATAKANA LETTER A */ { 0x04b2, 0x30a4 }, /* kana_I イ KATAKANA LETTER I */ { 0x04b3, 0x30a6 }, /* kana_U ウ KATAKANA LETTER U */ { 0x04b4, 0x30a8 }, /* kana_E エ KATAKANA LETTER E */ { 0x04b5, 0x30aa }, /* kana_O オ KATAKANA LETTER O */ { 0x04b6, 0x30ab }, /* kana_KA カ KATAKANA LETTER KA */ { 0x04b7, 0x30ad }, /* kana_KI キ KATAKANA LETTER KI */ { 0x04b8, 0x30af }, /* kana_KU ク KATAKANA LETTER KU */ { 0x04b9, 0x30b1 }, /* kana_KE ケ KATAKANA LETTER KE */ { 0x04ba, 0x30b3 }, /* kana_KO コ KATAKANA LETTER KO */ { 0x04bb, 0x30b5 }, /* kana_SA サ KATAKANA LETTER SA */ { 0x04bc, 0x30b7 }, /* kana_SHI シ KATAKANA LETTER SI */ { 0x04bd, 0x30b9 }, /* kana_SU ス KATAKANA LETTER SU */ { 0x04be, 0x30bb }, /* kana_SE セ KATAKANA LETTER SE */ { 0x04bf, 0x30bd }, /* kana_SO ソ KATAKANA LETTER SO */ { 0x04c0, 0x30bf }, /* kana_TA タ KATAKANA LETTER TA */ { 0x04c1, 0x30c1 }, /* kana_CHI チ KATAKANA LETTER TI */ { 0x04c2, 0x30c4 }, /* kana_TSU ツ KATAKANA LETTER TU */ { 0x04c3, 0x30c6 }, /* kana_TE テ KATAKANA LETTER TE */ { 0x04c4, 0x30c8 }, /* kana_TO ト KATAKANA LETTER TO */ { 0x04c5, 0x30ca }, /* kana_NA ナ KATAKANA LETTER NA */ { 0x04c6, 0x30cb }, /* kana_NI ニ KATAKANA LETTER NI */ { 0x04c7, 0x30cc }, /* kana_NU ヌ KATAKANA LETTER NU */ { 0x04c8, 0x30cd }, /* kana_NE ネ KATAKANA LETTER NE */ { 0x04c9, 0x30ce }, /* kana_NO ノ KATAKANA LETTER NO */ { 0x04ca, 0x30cf }, /* kana_HA ハ KATAKANA LETTER HA */ { 0x04cb, 0x30d2 }, /* kana_HI ヒ KATAKANA LETTER HI */ { 0x04cc, 0x30d5 }, /* kana_FU フ KATAKANA LETTER HU */ { 0x04cd, 0x30d8 }, /* kana_HE ヘ KATAKANA LETTER HE */ { 0x04ce, 0x30db }, /* kana_HO ホ KATAKANA LETTER HO */ { 0x04cf, 0x30de }, /* kana_MA マ KATAKANA LETTER MA */ { 0x04d0, 0x30df }, /* kana_MI ミ KATAKANA LETTER MI */ { 0x04d1, 0x30e0 }, /* kana_MU ム KATAKANA LETTER MU */ { 0x04d2, 0x30e1 }, /* kana_ME メ KATAKANA LETTER ME */ { 0x04d3, 0x30e2 }, /* kana_MO モ KATAKANA LETTER MO */ { 0x04d4, 0x30e4 }, /* kana_YA ヤ KATAKANA LETTER YA */ { 0x04d5, 0x30e6 }, /* kana_YU ユ KATAKANA LETTER YU */ { 0x04d6, 0x30e8 }, /* kana_YO ヨ KATAKANA LETTER YO */ { 0x04d7, 0x30e9 }, /* kana_RA ラ KATAKANA LETTER RA */ { 0x04d8, 0x30ea }, /* kana_RI リ KATAKANA LETTER RI */ { 0x04d9, 0x30eb }, /* kana_RU ル KATAKANA LETTER RU */ { 0x04da, 0x30ec }, /* kana_RE レ KATAKANA LETTER RE */ { 0x04db, 0x30ed }, /* kana_RO ロ KATAKANA LETTER RO */ { 0x04dc, 0x30ef }, /* kana_WA ワ KATAKANA LETTER WA */ { 0x04dd, 0x30f3 }, /* kana_N ン KATAKANA LETTER N */ { 0x04de, 0x309b }, /* voicedsound ゛ KATAKANA-HIRAGANA VOICED SOUND MARK */ { 0x04df, 0x309c }, /* semivoicedsound ゜ KATAKANA-HIRAGANA SEMI-VOICED SOUND MARK */ { 0x05ac, 0x060c }, /* Arabic_comma ، ARABIC COMMA */ { 0x05bb, 0x061b }, /* Arabic_semicolon ؛ ARABIC SEMICOLON */ { 0x05bf, 0x061f }, /* Arabic_question_mark ؟ ARABIC QUESTION MARK */ { 0x05c1, 0x0621 }, /* Arabic_hamza ء ARABIC LETTER HAMZA */ { 0x05c2, 0x0622 }, /* Arabic_maddaonalef آ ARABIC LETTER ALEF WITH MADDA ABOVE */ { 0x05c3, 0x0623 }, /* Arabic_hamzaonalef أ ARABIC LETTER ALEF WITH HAMZA ABOVE */ { 0x05c4, 0x0624 }, /* Arabic_hamzaonwaw ؤ ARABIC LETTER WAW WITH HAMZA ABOVE */ { 0x05c5, 0x0625 }, /* Arabic_hamzaunderalef إ ARABIC LETTER ALEF WITH HAMZA BELOW */ { 0x05c6, 0x0626 }, /* Arabic_hamzaonyeh ئ ARABIC LETTER YEH WITH HAMZA ABOVE */ { 0x05c7, 0x0627 }, /* Arabic_alef ا ARABIC LETTER ALEF */ { 0x05c8, 0x0628 }, /* Arabic_beh ب ARABIC LETTER BEH */ { 0x05c9, 0x0629 }, /* Arabic_tehmarbuta ة ARABIC LETTER TEH MARBUTA */ { 0x05ca, 0x062a }, /* Arabic_teh ت ARABIC LETTER TEH */ { 0x05cb, 0x062b }, /* Arabic_theh ث ARABIC LETTER THEH */ { 0x05cc, 0x062c }, /* Arabic_jeem ج ARABIC LETTER JEEM */ { 0x05cd, 0x062d }, /* Arabic_hah ح ARABIC LETTER HAH */ { 0x05ce, 0x062e }, /* Arabic_khah خ ARABIC LETTER KHAH */ { 0x05cf, 0x062f }, /* Arabic_dal د ARABIC LETTER DAL */ { 0x05d0, 0x0630 }, /* Arabic_thal ذ ARABIC LETTER THAL */ { 0x05d1, 0x0631 }, /* Arabic_ra ر ARABIC LETTER REH */ { 0x05d2, 0x0632 }, /* Arabic_zain ز ARABIC LETTER ZAIN */ { 0x05d3, 0x0633 }, /* Arabic_seen س ARABIC LETTER SEEN */ { 0x05d4, 0x0634 }, /* Arabic_sheen ش ARABIC LETTER SHEEN */ { 0x05d5, 0x0635 }, /* Arabic_sad ص ARABIC LETTER SAD */ { 0x05d6, 0x0636 }, /* Arabic_dad ض ARABIC LETTER DAD */ { 0x05d7, 0x0637 }, /* Arabic_tah ط ARABIC LETTER TAH */ { 0x05d8, 0x0638 }, /* Arabic_zah ظ ARABIC LETTER ZAH */ { 0x05d9, 0x0639 }, /* Arabic_ain ع ARABIC LETTER AIN */ { 0x05da, 0x063a }, /* Arabic_ghain غ ARABIC LETTER GHAIN */ { 0x05e0, 0x0640 }, /* Arabic_tatweel ـ ARABIC TATWEEL */ { 0x05e1, 0x0641 }, /* Arabic_feh ف ARABIC LETTER FEH */ { 0x05e2, 0x0642 }, /* Arabic_qaf ق ARABIC LETTER QAF */ { 0x05e3, 0x0643 }, /* Arabic_kaf ك ARABIC LETTER KAF */ { 0x05e4, 0x0644 }, /* Arabic_lam ل ARABIC LETTER LAM */ { 0x05e5, 0x0645 }, /* Arabic_meem م ARABIC LETTER MEEM */ { 0x05e6, 0x0646 }, /* Arabic_noon ن ARABIC LETTER NOON */ { 0x05e7, 0x0647 }, /* Arabic_ha ه ARABIC LETTER HEH */ { 0x05e8, 0x0648 }, /* Arabic_waw و ARABIC LETTER WAW */ { 0x05e9, 0x0649 }, /* Arabic_alefmaksura ى ARABIC LETTER ALEF MAKSURA */ { 0x05ea, 0x064a }, /* Arabic_yeh ي ARABIC LETTER YEH */ { 0x05eb, 0x064b }, /* Arabic_fathatan ً ARABIC FATHATAN */ { 0x05ec, 0x064c }, /* Arabic_dammatan ٌ ARABIC DAMMATAN */ { 0x05ed, 0x064d }, /* Arabic_kasratan ٍ ARABIC KASRATAN */ { 0x05ee, 0x064e }, /* Arabic_fatha َ ARABIC FATHA */ { 0x05ef, 0x064f }, /* Arabic_damma ُ ARABIC DAMMA */ { 0x05f0, 0x0650 }, /* Arabic_kasra ِ ARABIC KASRA */ { 0x05f1, 0x0651 }, /* Arabic_shadda ّ ARABIC SHADDA */ { 0x05f2, 0x0652 }, /* Arabic_sukun ْ ARABIC SUKUN */ { 0x06a1, 0x0452 }, /* Serbian_dje ђ CYRILLIC SMALL LETTER DJE */ { 0x06a2, 0x0453 }, /* Macedonia_gje ѓ CYRILLIC SMALL LETTER GJE */ { 0x06a3, 0x0451 }, /* Cyrillic_io ё CYRILLIC SMALL LETTER IO */ { 0x06a4, 0x0454 }, /* Ukrainian_ie є CYRILLIC SMALL LETTER UKRAINIAN IE */ { 0x06a5, 0x0455 }, /* Macedonia_dse ѕ CYRILLIC SMALL LETTER DZE */ { 0x06a6, 0x0456 }, /* Ukrainian_i і CYRILLIC SMALL LETTER BYELORUSSIAN-UKRAINIAN I */ { 0x06a7, 0x0457 }, /* Ukrainian_yi ї CYRILLIC SMALL LETTER YI */ { 0x06a8, 0x0458 }, /* Cyrillic_je ј CYRILLIC SMALL LETTER JE */ { 0x06a9, 0x0459 }, /* Cyrillic_lje љ CYRILLIC SMALL LETTER LJE */ { 0x06aa, 0x045a }, /* Cyrillic_nje њ CYRILLIC SMALL LETTER NJE */ { 0x06ab, 0x045b }, /* Serbian_tshe ћ CYRILLIC SMALL LETTER TSHE */ { 0x06ac, 0x045c }, /* Macedonia_kje ќ CYRILLIC SMALL LETTER KJE */ { 0x06ae, 0x045e }, /* Byelorussian_shortu ў CYRILLIC SMALL LETTER SHORT U */ { 0x06af, 0x045f }, /* Cyrillic_dzhe џ CYRILLIC SMALL LETTER DZHE */ { 0x06b0, 0x2116 }, /* numerosign № NUMERO SIGN */ { 0x06b1, 0x0402 }, /* Serbian_DJE Ђ CYRILLIC CAPITAL LETTER DJE */ { 0x06b2, 0x0403 }, /* Macedonia_GJE Ѓ CYRILLIC CAPITAL LETTER GJE */ { 0x06b3, 0x0401 }, /* Cyrillic_IO Ё CYRILLIC CAPITAL LETTER IO */ { 0x06b4, 0x0404 }, /* Ukrainian_IE Є CYRILLIC CAPITAL LETTER UKRAINIAN IE */ { 0x06b5, 0x0405 }, /* Macedonia_DSE Ѕ CYRILLIC CAPITAL LETTER DZE */ { 0x06b6, 0x0406 }, /* Ukrainian_I І CYRILLIC CAPITAL LETTER BYELORUSSIAN-UKRAINIAN I */ { 0x06b7, 0x0407 }, /* Ukrainian_YI Ї CYRILLIC CAPITAL LETTER YI */ { 0x06b8, 0x0408 }, /* Cyrillic_JE Ј CYRILLIC CAPITAL LETTER JE */ { 0x06b9, 0x0409 }, /* Cyrillic_LJE Љ CYRILLIC CAPITAL LETTER LJE */ { 0x06ba, 0x040a }, /* Cyrillic_NJE Њ CYRILLIC CAPITAL LETTER NJE */ { 0x06bb, 0x040b }, /* Serbian_TSHE Ћ CYRILLIC CAPITAL LETTER TSHE */ { 0x06bc, 0x040c }, /* Macedonia_KJE Ќ CYRILLIC CAPITAL LETTER KJE */ { 0x06be, 0x040e }, /* Byelorussian_SHORTU Ў CYRILLIC CAPITAL LETTER SHORT U */ { 0x06bf, 0x040f }, /* Cyrillic_DZHE Џ CYRILLIC CAPITAL LETTER DZHE */ { 0x06c0, 0x044e }, /* Cyrillic_yu ю CYRILLIC SMALL LETTER YU */ { 0x06c1, 0x0430 }, /* Cyrillic_a а CYRILLIC SMALL LETTER A */ { 0x06c2, 0x0431 }, /* Cyrillic_be б CYRILLIC SMALL LETTER BE */ { 0x06c3, 0x0446 }, /* Cyrillic_tse ц CYRILLIC SMALL LETTER TSE */ { 0x06c4, 0x0434 }, /* Cyrillic_de д CYRILLIC SMALL LETTER DE */ { 0x06c5, 0x0435 }, /* Cyrillic_ie е CYRILLIC SMALL LETTER IE */ { 0x06c6, 0x0444 }, /* Cyrillic_ef ф CYRILLIC SMALL LETTER EF */ { 0x06c7, 0x0433 }, /* Cyrillic_ghe г CYRILLIC SMALL LETTER GHE */ { 0x06c8, 0x0445 }, /* Cyrillic_ha х CYRILLIC SMALL LETTER HA */ { 0x06c9, 0x0438 }, /* Cyrillic_i и CYRILLIC SMALL LETTER I */ { 0x06ca, 0x0439 }, /* Cyrillic_shorti й CYRILLIC SMALL LETTER SHORT I */ { 0x06cb, 0x043a }, /* Cyrillic_ka к CYRILLIC SMALL LETTER KA */ { 0x06cc, 0x043b }, /* Cyrillic_el л CYRILLIC SMALL LETTER EL */ { 0x06cd, 0x043c }, /* Cyrillic_em м CYRILLIC SMALL LETTER EM */ { 0x06ce, 0x043d }, /* Cyrillic_en н CYRILLIC SMALL LETTER EN */ { 0x06cf, 0x043e }, /* Cyrillic_o о CYRILLIC SMALL LETTER O */ { 0x06d0, 0x043f }, /* Cyrillic_pe п CYRILLIC SMALL LETTER PE */ { 0x06d1, 0x044f }, /* Cyrillic_ya я CYRILLIC SMALL LETTER YA */ { 0x06d2, 0x0440 }, /* Cyrillic_er р CYRILLIC SMALL LETTER ER */ { 0x06d3, 0x0441 }, /* Cyrillic_es с CYRILLIC SMALL LETTER ES */ { 0x06d4, 0x0442 }, /* Cyrillic_te т CYRILLIC SMALL LETTER TE */ { 0x06d5, 0x0443 }, /* Cyrillic_u у CYRILLIC SMALL LETTER U */ { 0x06d6, 0x0436 }, /* Cyrillic_zhe ж CYRILLIC SMALL LETTER ZHE */ { 0x06d7, 0x0432 }, /* Cyrillic_ve в CYRILLIC SMALL LETTER VE */ { 0x06d8, 0x044c }, /* Cyrillic_softsign ь CYRILLIC SMALL LETTER SOFT SIGN */ { 0x06d9, 0x044b }, /* Cyrillic_yeru ы CYRILLIC SMALL LETTER YERU */ { 0x06da, 0x0437 }, /* Cyrillic_ze з CYRILLIC SMALL LETTER ZE */ { 0x06db, 0x0448 }, /* Cyrillic_sha ш CYRILLIC SMALL LETTER SHA */ { 0x06dc, 0x044d }, /* Cyrillic_e э CYRILLIC SMALL LETTER E */ { 0x06dd, 0x0449 }, /* Cyrillic_shcha щ CYRILLIC SMALL LETTER SHCHA */ { 0x06de, 0x0447 }, /* Cyrillic_che ч CYRILLIC SMALL LETTER CHE */ { 0x06df, 0x044a }, /* Cyrillic_hardsign ъ CYRILLIC SMALL LETTER HARD SIGN */ { 0x06e0, 0x042e }, /* Cyrillic_YU Ю CYRILLIC CAPITAL LETTER YU */ { 0x06e1, 0x0410 }, /* Cyrillic_A А CYRILLIC CAPITAL LETTER A */ { 0x06e2, 0x0411 }, /* Cyrillic_BE Б CYRILLIC CAPITAL LETTER BE */ { 0x06e3, 0x0426 }, /* Cyrillic_TSE Ц CYRILLIC CAPITAL LETTER TSE */ { 0x06e4, 0x0414 }, /* Cyrillic_DE Д CYRILLIC CAPITAL LETTER DE */ { 0x06e5, 0x0415 }, /* Cyrillic_IE Е CYRILLIC CAPITAL LETTER IE */ { 0x06e6, 0x0424 }, /* Cyrillic_EF Ф CYRILLIC CAPITAL LETTER EF */ { 0x06e7, 0x0413 }, /* Cyrillic_GHE Г CYRILLIC CAPITAL LETTER GHE */ { 0x06e8, 0x0425 }, /* Cyrillic_HA Х CYRILLIC CAPITAL LETTER HA */ { 0x06e9, 0x0418 }, /* Cyrillic_I И CYRILLIC CAPITAL LETTER I */ { 0x06ea, 0x0419 }, /* Cyrillic_SHORTI Й CYRILLIC CAPITAL LETTER SHORT I */ { 0x06eb, 0x041a }, /* Cyrillic_KA К CYRILLIC CAPITAL LETTER KA */ { 0x06ec, 0x041b }, /* Cyrillic_EL Л CYRILLIC CAPITAL LETTER EL */ { 0x06ed, 0x041c }, /* Cyrillic_EM М CYRILLIC CAPITAL LETTER EM */ { 0x06ee, 0x041d }, /* Cyrillic_EN Н CYRILLIC CAPITAL LETTER EN */ { 0x06ef, 0x041e }, /* Cyrillic_O О CYRILLIC CAPITAL LETTER O */ { 0x06f0, 0x041f }, /* Cyrillic_PE П CYRILLIC CAPITAL LETTER PE */ { 0x06f1, 0x042f }, /* Cyrillic_YA Я CYRILLIC CAPITAL LETTER YA */ { 0x06f2, 0x0420 }, /* Cyrillic_ER Р CYRILLIC CAPITAL LETTER ER */ { 0x06f3, 0x0421 }, /* Cyrillic_ES С CYRILLIC CAPITAL LETTER ES */ { 0x06f4, 0x0422 }, /* Cyrillic_TE Т CYRILLIC CAPITAL LETTER TE */ { 0x06f5, 0x0423 }, /* Cyrillic_U У CYRILLIC CAPITAL LETTER U */ { 0x06f6, 0x0416 }, /* Cyrillic_ZHE Ж CYRILLIC CAPITAL LETTER ZHE */ { 0x06f7, 0x0412 }, /* Cyrillic_VE В CYRILLIC CAPITAL LETTER VE */ { 0x06f8, 0x042c }, /* Cyrillic_SOFTSIGN Ь CYRILLIC CAPITAL LETTER SOFT SIGN */ { 0x06f9, 0x042b }, /* Cyrillic_YERU Ы CYRILLIC CAPITAL LETTER YERU */ { 0x06fa, 0x0417 }, /* Cyrillic_ZE З CYRILLIC CAPITAL LETTER ZE */ { 0x06fb, 0x0428 }, /* Cyrillic_SHA Ш CYRILLIC CAPITAL LETTER SHA */ { 0x06fc, 0x042d }, /* Cyrillic_E Э CYRILLIC CAPITAL LETTER E */ { 0x06fd, 0x0429 }, /* Cyrillic_SHCHA Щ CYRILLIC CAPITAL LETTER SHCHA */ { 0x06fe, 0x0427 }, /* Cyrillic_CHE Ч CYRILLIC CAPITAL LETTER CHE */ { 0x06ff, 0x042a }, /* Cyrillic_HARDSIGN Ъ CYRILLIC CAPITAL LETTER HARD SIGN */ { 0x07a1, 0x0386 }, /* Greek_ALPHAaccent Ά GREEK CAPITAL LETTER ALPHA WITH TONOS */ { 0x07a2, 0x0388 }, /* Greek_EPSILONaccent Έ GREEK CAPITAL LETTER EPSILON WITH TONOS */ { 0x07a3, 0x0389 }, /* Greek_ETAaccent Ή GREEK CAPITAL LETTER ETA WITH TONOS */ { 0x07a4, 0x038a }, /* Greek_IOTAaccent Ί GREEK CAPITAL LETTER IOTA WITH TONOS */ { 0x07a5, 0x03aa }, /* Greek_IOTAdiaeresis Ϊ GREEK CAPITAL LETTER IOTA WITH DIALYTIKA */ { 0x07a7, 0x038c }, /* Greek_OMICRONaccent Ό GREEK CAPITAL LETTER OMICRON WITH TONOS */ { 0x07a8, 0x038e }, /* Greek_UPSILONaccent Ύ GREEK CAPITAL LETTER UPSILON WITH TONOS */ { 0x07a9, 0x03ab }, /* Greek_UPSILONdieresis Ϋ GREEK CAPITAL LETTER UPSILON WITH DIALYTIKA */ { 0x07ab, 0x038f }, /* Greek_OMEGAaccent Ώ GREEK CAPITAL LETTER OMEGA WITH TONOS */ { 0x07ae, 0x0385 }, /* Greek_accentdieresis ΅ GREEK DIALYTIKA TONOS */ { 0x07af, 0x2015 }, /* Greek_horizbar ― HORIZONTAL BAR */ { 0x07b1, 0x03ac }, /* Greek_alphaaccent ά GREEK SMALL LETTER ALPHA WITH TONOS */ { 0x07b2, 0x03ad }, /* Greek_epsilonaccent έ GREEK SMALL LETTER EPSILON WITH TONOS */ { 0x07b3, 0x03ae }, /* Greek_etaaccent ή GREEK SMALL LETTER ETA WITH TONOS */ { 0x07b4, 0x03af }, /* Greek_iotaaccent ί GREEK SMALL LETTER IOTA WITH TONOS */ { 0x07b5, 0x03ca }, /* Greek_iotadieresis ϊ GREEK SMALL LETTER IOTA WITH DIALYTIKA */ { 0x07b6, 0x0390 }, /* Greek_iotaaccentdieresis ΐ GREEK SMALL LETTER IOTA WITH DIALYTIKA AND TONOS */ { 0x07b7, 0x03cc }, /* Greek_omicronaccent ό GREEK SMALL LETTER OMICRON WITH TONOS */ { 0x07b8, 0x03cd }, /* Greek_upsilonaccent ύ GREEK SMALL LETTER UPSILON WITH TONOS */ { 0x07b9, 0x03cb }, /* Greek_upsilondieresis ϋ GREEK SMALL LETTER UPSILON WITH DIALYTIKA */ { 0x07ba, 0x03b0 }, /* Greek_upsilonaccentdieresis ΰ GREEK SMALL LETTER UPSILON WITH DIALYTIKA AND TONOS */ { 0x07bb, 0x03ce }, /* Greek_omegaaccent ώ GREEK SMALL LETTER OMEGA WITH TONOS */ { 0x07c1, 0x0391 }, /* Greek_ALPHA Α GREEK CAPITAL LETTER ALPHA */ { 0x07c2, 0x0392 }, /* Greek_BETA Β GREEK CAPITAL LETTER BETA */ { 0x07c3, 0x0393 }, /* Greek_GAMMA Γ GREEK CAPITAL LETTER GAMMA */ { 0x07c4, 0x0394 }, /* Greek_DELTA Δ GREEK CAPITAL LETTER DELTA */ { 0x07c5, 0x0395 }, /* Greek_EPSILON Ε GREEK CAPITAL LETTER EPSILON */ { 0x07c6, 0x0396 }, /* Greek_ZETA Ζ GREEK CAPITAL LETTER ZETA */ { 0x07c7, 0x0397 }, /* Greek_ETA Η GREEK CAPITAL LETTER ETA */ { 0x07c8, 0x0398 }, /* Greek_THETA Θ GREEK CAPITAL LETTER THETA */ { 0x07c9, 0x0399 }, /* Greek_IOTA Ι GREEK CAPITAL LETTER IOTA */ { 0x07ca, 0x039a }, /* Greek_KAPPA Κ GREEK CAPITAL LETTER KAPPA */ { 0x07cb, 0x039b }, /* Greek_LAMBDA Λ GREEK CAPITAL LETTER LAMDA */ { 0x07cc, 0x039c }, /* Greek_MU Μ GREEK CAPITAL LETTER MU */ { 0x07cd, 0x039d }, /* Greek_NU Ν GREEK CAPITAL LETTER NU */ { 0x07ce, 0x039e }, /* Greek_XI Ξ GREEK CAPITAL LETTER XI */ { 0x07cf, 0x039f }, /* Greek_OMICRON Ο GREEK CAPITAL LETTER OMICRON */ { 0x07d0, 0x03a0 }, /* Greek_PI Π GREEK CAPITAL LETTER PI */ { 0x07d1, 0x03a1 }, /* Greek_RHO Ρ GREEK CAPITAL LETTER RHO */ { 0x07d2, 0x03a3 }, /* Greek_SIGMA Σ GREEK CAPITAL LETTER SIGMA */ { 0x07d4, 0x03a4 }, /* Greek_TAU Τ GREEK CAPITAL LETTER TAU */ { 0x07d5, 0x03a5 }, /* Greek_UPSILON Υ GREEK CAPITAL LETTER UPSILON */ { 0x07d6, 0x03a6 }, /* Greek_PHI Φ GREEK CAPITAL LETTER PHI */ { 0x07d7, 0x03a7 }, /* Greek_CHI Χ GREEK CAPITAL LETTER CHI */ { 0x07d8, 0x03a8 }, /* Greek_PSI Ψ GREEK CAPITAL LETTER PSI */ { 0x07d9, 0x03a9 }, /* Greek_OMEGA Ω GREEK CAPITAL LETTER OMEGA */ { 0x07e1, 0x03b1 }, /* Greek_alpha α GREEK SMALL LETTER ALPHA */ { 0x07e2, 0x03b2 }, /* Greek_beta β GREEK SMALL LETTER BETA */ { 0x07e3, 0x03b3 }, /* Greek_gamma γ GREEK SMALL LETTER GAMMA */ { 0x07e4, 0x03b4 }, /* Greek_delta δ GREEK SMALL LETTER DELTA */ { 0x07e5, 0x03b5 }, /* Greek_epsilon ε GREEK SMALL LETTER EPSILON */ { 0x07e6, 0x03b6 }, /* Greek_zeta ζ GREEK SMALL LETTER ZETA */ { 0x07e7, 0x03b7 }, /* Greek_eta η GREEK SMALL LETTER ETA */ { 0x07e8, 0x03b8 }, /* Greek_theta θ GREEK SMALL LETTER THETA */ { 0x07e9, 0x03b9 }, /* Greek_iota ι GREEK SMALL LETTER IOTA */ { 0x07ea, 0x03ba }, /* Greek_kappa κ GREEK SMALL LETTER KAPPA */ { 0x07eb, 0x03bb }, /* Greek_lambda λ GREEK SMALL LETTER LAMDA */ { 0x07ec, 0x03bc }, /* Greek_mu μ GREEK SMALL LETTER MU */ { 0x07ed, 0x03bd }, /* Greek_nu ν GREEK SMALL LETTER NU */ { 0x07ee, 0x03be }, /* Greek_xi ξ GREEK SMALL LETTER XI */ { 0x07ef, 0x03bf }, /* Greek_omicron ο GREEK SMALL LETTER OMICRON */ { 0x07f0, 0x03c0 }, /* Greek_pi π GREEK SMALL LETTER PI */ { 0x07f1, 0x03c1 }, /* Greek_rho ρ GREEK SMALL LETTER RHO */ { 0x07f2, 0x03c3 }, /* Greek_sigma σ GREEK SMALL LETTER SIGMA */ { 0x07f3, 0x03c2 }, /* Greek_finalsmallsigma ς GREEK SMALL LETTER FINAL SIGMA */ { 0x07f4, 0x03c4 }, /* Greek_tau τ GREEK SMALL LETTER TAU */ { 0x07f5, 0x03c5 }, /* Greek_upsilon υ GREEK SMALL LETTER UPSILON */ { 0x07f6, 0x03c6 }, /* Greek_phi φ GREEK SMALL LETTER PHI */ { 0x07f7, 0x03c7 }, /* Greek_chi χ GREEK SMALL LETTER CHI */ { 0x07f8, 0x03c8 }, /* Greek_psi ψ GREEK SMALL LETTER PSI */ { 0x07f9, 0x03c9 }, /* Greek_omega ω GREEK SMALL LETTER OMEGA */ { 0x08a1, 0x23b7 }, /* leftradical ⎷ ??? */ { 0x08a2, 0x250c }, /* topleftradical ┌ BOX DRAWINGS LIGHT DOWN AND RIGHT */ { 0x08a3, 0x2500 }, /* horizconnector ─ BOX DRAWINGS LIGHT HORIZONTAL */ { 0x08a4, 0x2320 }, /* topintegral ⌠ TOP HALF INTEGRAL */ { 0x08a5, 0x2321 }, /* botintegral ⌡ BOTTOM HALF INTEGRAL */ { 0x08a6, 0x2502 }, /* vertconnector │ BOX DRAWINGS LIGHT VERTICAL */ { 0x08a7, 0x23a1 }, /* topleftsqbracket ⎡ ??? */ { 0x08a8, 0x23a3 }, /* botleftsqbracket ⎣ ??? */ { 0x08a9, 0x23a4 }, /* toprightsqbracket ⎤ ??? */ { 0x08aa, 0x23a6 }, /* botrightsqbracket ⎦ ??? */ { 0x08ab, 0x239b }, /* topleftparens ⎛ ??? */ { 0x08ac, 0x239d }, /* botleftparens ⎝ ??? */ { 0x08ad, 0x239e }, /* toprightparens ⎞ ??? */ { 0x08ae, 0x23a0 }, /* botrightparens ⎠ ??? */ { 0x08af, 0x23a8 }, /* leftmiddlecurlybrace ⎨ ??? */ { 0x08b0, 0x23ac }, /* rightmiddlecurlybrace ⎬ ??? */ /* 0x08b1 topleftsummation ? ??? */ /* 0x08b2 botleftsummation ? ??? */ /* 0x08b3 topvertsummationconnector ? ??? */ /* 0x08b4 botvertsummationconnector ? ??? */ /* 0x08b5 toprightsummation ? ??? */ /* 0x08b6 botrightsummation ? ??? */ /* 0x08b7 rightmiddlesummation ? ??? */ { 0x08bc, 0x2264 }, /* lessthanequal ≤ LESS-THAN OR EQUAL TO */ { 0x08bd, 0x2260 }, /* notequal ≠ NOT EQUAL TO */ { 0x08be, 0x2265 }, /* greaterthanequal ≥ GREATER-THAN OR EQUAL TO */ { 0x08bf, 0x222b }, /* integral ∫ INTEGRAL */ { 0x08c0, 0x2234 }, /* therefore ∴ THEREFORE */ { 0x08c1, 0x221d }, /* variation ∝ PROPORTIONAL TO */ { 0x08c2, 0x221e }, /* infinity ∞ INFINITY */ { 0x08c5, 0x2207 }, /* nabla ∇ NABLA */ { 0x08c8, 0x223c }, /* approximate ∼ TILDE OPERATOR */ { 0x08c9, 0x2243 }, /* similarequal ≃ ASYMPTOTICALLY EQUAL TO */ { 0x08cd, 0x21d4 }, /* ifonlyif ⇔ LEFT RIGHT DOUBLE ARROW */ { 0x08ce, 0x21d2 }, /* implies ⇒ RIGHTWARDS DOUBLE ARROW */ { 0x08cf, 0x2261 }, /* identical ≡ IDENTICAL TO */ { 0x08d6, 0x221a }, /* radical √ SQUARE ROOT */ { 0x08da, 0x2282 }, /* includedin ⊂ SUBSET OF */ { 0x08db, 0x2283 }, /* includes ⊃ SUPERSET OF */ { 0x08dc, 0x2229 }, /* intersection ∩ INTERSECTION */ { 0x08dd, 0x222a }, /* union ∪ UNION */ { 0x08de, 0x2227 }, /* logicaland ∧ LOGICAL AND */ { 0x08df, 0x2228 }, /* logicalor ∨ LOGICAL OR */ { 0x08ef, 0x2202 }, /* partialderivative ∂ PARTIAL DIFFERENTIAL */ { 0x08f6, 0x0192 }, /* function ƒ LATIN SMALL LETTER F WITH HOOK */ { 0x08fb, 0x2190 }, /* leftarrow ← LEFTWARDS ARROW */ { 0x08fc, 0x2191 }, /* uparrow ↑ UPWARDS ARROW */ { 0x08fd, 0x2192 }, /* rightarrow → RIGHTWARDS ARROW */ { 0x08fe, 0x2193 }, /* downarrow ↓ DOWNWARDS ARROW */ /* 0x09df blank ? ??? */ { 0x09e0, 0x25c6 }, /* soliddiamond ◆ BLACK DIAMOND */ { 0x09e1, 0x2592 }, /* checkerboard ▒ MEDIUM SHADE */ { 0x09e2, 0x2409 }, /* ht ␉ SYMBOL FOR HORIZONTAL TABULATION */ { 0x09e3, 0x240c }, /* ff ␌ SYMBOL FOR FORM FEED */ { 0x09e4, 0x240d }, /* cr ␍ SYMBOL FOR CARRIAGE RETURN */ { 0x09e5, 0x240a }, /* lf ␊ SYMBOL FOR LINE FEED */ { 0x09e8, 0x2424 }, /* nl ␤ SYMBOL FOR NEWLINE */ { 0x09e9, 0x240b }, /* vt ␋ SYMBOL FOR VERTICAL TABULATION */ { 0x09ea, 0x2518 }, /* lowrightcorner ┘ BOX DRAWINGS LIGHT UP AND LEFT */ { 0x09eb, 0x2510 }, /* uprightcorner ┐ BOX DRAWINGS LIGHT DOWN AND LEFT */ { 0x09ec, 0x250c }, /* upleftcorner ┌ BOX DRAWINGS LIGHT DOWN AND RIGHT */ { 0x09ed, 0x2514 }, /* lowleftcorner └ BOX DRAWINGS LIGHT UP AND RIGHT */ { 0x09ee, 0x253c }, /* crossinglines ┼ BOX DRAWINGS LIGHT VERTICAL AND HORIZONTAL */ { 0x09ef, 0x23ba }, /* horizlinescan1 ⎺ HORIZONTAL SCAN LINE-1 (Unicode 3.2 draft) */ { 0x09f0, 0x23bb }, /* horizlinescan3 ⎻ HORIZONTAL SCAN LINE-3 (Unicode 3.2 draft) */ { 0x09f1, 0x2500 }, /* horizlinescan5 ─ BOX DRAWINGS LIGHT HORIZONTAL */ { 0x09f2, 0x23bc }, /* horizlinescan7 ⎼ HORIZONTAL SCAN LINE-7 (Unicode 3.2 draft) */ { 0x09f3, 0x23bd }, /* horizlinescan9 ⎽ HORIZONTAL SCAN LINE-9 (Unicode 3.2 draft) */ { 0x09f4, 0x251c }, /* leftt ├ BOX DRAWINGS LIGHT VERTICAL AND RIGHT */ { 0x09f5, 0x2524 }, /* rightt ┤ BOX DRAWINGS LIGHT VERTICAL AND LEFT */ { 0x09f6, 0x2534 }, /* bott ┴ BOX DRAWINGS LIGHT UP AND HORIZONTAL */ { 0x09f7, 0x252c }, /* topt ┬ BOX DRAWINGS LIGHT DOWN AND HORIZONTAL */ { 0x09f8, 0x2502 }, /* vertbar │ BOX DRAWINGS LIGHT VERTICAL */ { 0x0aa1, 0x2003 }, /* emspace   EM SPACE */ { 0x0aa2, 0x2002 }, /* enspace   EN SPACE */ { 0x0aa3, 0x2004 }, /* em3space   THREE-PER-EM SPACE */ { 0x0aa4, 0x2005 }, /* em4space   FOUR-PER-EM SPACE */ { 0x0aa5, 0x2007 }, /* digitspace   FIGURE SPACE */ { 0x0aa6, 0x2008 }, /* punctspace   PUNCTUATION SPACE */ { 0x0aa7, 0x2009 }, /* thinspace   THIN SPACE */ { 0x0aa8, 0x200a }, /* hairspace   HAIR SPACE */ { 0x0aa9, 0x2014 }, /* emdash — EM DASH */ { 0x0aaa, 0x2013 }, /* endash – EN DASH */ /* 0x0aac signifblank ? ??? */ { 0x0aae, 0x2026 }, /* ellipsis … HORIZONTAL ELLIPSIS */ { 0x0aaf, 0x2025 }, /* doubbaselinedot ‥ TWO DOT LEADER */ { 0x0ab0, 0x2153 }, /* onethird ⅓ VULGAR FRACTION ONE THIRD */ { 0x0ab1, 0x2154 }, /* twothirds ⅔ VULGAR FRACTION TWO THIRDS */ { 0x0ab2, 0x2155 }, /* onefifth ⅕ VULGAR FRACTION ONE FIFTH */ { 0x0ab3, 0x2156 }, /* twofifths ⅖ VULGAR FRACTION TWO FIFTHS */ { 0x0ab4, 0x2157 }, /* threefifths ⅗ VULGAR FRACTION THREE FIFTHS */ { 0x0ab5, 0x2158 }, /* fourfifths ⅘ VULGAR FRACTION FOUR FIFTHS */ { 0x0ab6, 0x2159 }, /* onesixth ⅙ VULGAR FRACTION ONE SIXTH */ { 0x0ab7, 0x215a }, /* fivesixths ⅚ VULGAR FRACTION FIVE SIXTHS */ { 0x0ab8, 0x2105 }, /* careof ℅ CARE OF */ { 0x0abb, 0x2012 }, /* figdash ‒ FIGURE DASH */ { 0x0abc, 0x2329 }, /* leftanglebracket 〈 LEFT-POINTING ANGLE BRACKET */ /* 0x0abd decimalpoint ? ??? */ { 0x0abe, 0x232a }, /* rightanglebracket 〉 RIGHT-POINTING ANGLE BRACKET */ /* 0x0abf marker ? ??? */ { 0x0ac3, 0x215b }, /* oneeighth ⅛ VULGAR FRACTION ONE EIGHTH */ { 0x0ac4, 0x215c }, /* threeeighths ⅜ VULGAR FRACTION THREE EIGHTHS */ { 0x0ac5, 0x215d }, /* fiveeighths ⅝ VULGAR FRACTION FIVE EIGHTHS */ { 0x0ac6, 0x215e }, /* seveneighths ⅞ VULGAR FRACTION SEVEN EIGHTHS */ { 0x0ac9, 0x2122 }, /* trademark ™ TRADE MARK SIGN */ { 0x0aca, 0x2613 }, /* signaturemark ☓ SALTIRE */ /* 0x0acb trademarkincircle ? ??? */ { 0x0acc, 0x25c1 }, /* leftopentriangle ◁ WHITE LEFT-POINTING TRIANGLE */ { 0x0acd, 0x25b7 }, /* rightopentriangle ▷ WHITE RIGHT-POINTING TRIANGLE */ { 0x0ace, 0x25cb }, /* emopencircle ○ WHITE CIRCLE */ { 0x0acf, 0x25af }, /* emopenrectangle ▯ WHITE VERTICAL RECTANGLE */ { 0x0ad0, 0x2018 }, /* leftsinglequotemark ‘ LEFT SINGLE QUOTATION MARK */ { 0x0ad1, 0x2019 }, /* rightsinglequotemark ’ RIGHT SINGLE QUOTATION MARK */ { 0x0ad2, 0x201c }, /* leftdoublequotemark “ LEFT DOUBLE QUOTATION MARK */ { 0x0ad3, 0x201d }, /* rightdoublequotemark ” RIGHT DOUBLE QUOTATION MARK */ { 0x0ad4, 0x211e }, /* prescription ℞ PRESCRIPTION TAKE */ { 0x0ad6, 0x2032 }, /* minutes ′ PRIME */ { 0x0ad7, 0x2033 }, /* seconds ″ DOUBLE PRIME */ { 0x0ad9, 0x271d }, /* latincross ✝ LATIN CROSS */ /* 0x0ada hexagram ? ??? */ { 0x0adb, 0x25ac }, /* filledrectbullet ▬ BLACK RECTANGLE */ { 0x0adc, 0x25c0 }, /* filledlefttribullet ◀ BLACK LEFT-POINTING TRIANGLE */ { 0x0add, 0x25b6 }, /* filledrighttribullet ▶ BLACK RIGHT-POINTING TRIANGLE */ { 0x0ade, 0x25cf }, /* emfilledcircle ● BLACK CIRCLE */ { 0x0adf, 0x25ae }, /* emfilledrect ▮ BLACK VERTICAL RECTANGLE */ { 0x0ae0, 0x25e6 }, /* enopencircbullet ◦ WHITE BULLET */ { 0x0ae1, 0x25ab }, /* enopensquarebullet ▫ WHITE SMALL SQUARE */ { 0x0ae2, 0x25ad }, /* openrectbullet ▭ WHITE RECTANGLE */ { 0x0ae3, 0x25b3 }, /* opentribulletup △ WHITE UP-POINTING TRIANGLE */ { 0x0ae4, 0x25bd }, /* opentribulletdown ▽ WHITE DOWN-POINTING TRIANGLE */ { 0x0ae5, 0x2606 }, /* openstar ☆ WHITE STAR */ { 0x0ae6, 0x2022 }, /* enfilledcircbullet • BULLET */ { 0x0ae7, 0x25aa }, /* enfilledsqbullet ▪ BLACK SMALL SQUARE */ { 0x0ae8, 0x25b2 }, /* filledtribulletup ▲ BLACK UP-POINTING TRIANGLE */ { 0x0ae9, 0x25bc }, /* filledtribulletdown ▼ BLACK DOWN-POINTING TRIANGLE */ { 0x0aea, 0x261c }, /* leftpointer ☜ WHITE LEFT POINTING INDEX */ { 0x0aeb, 0x261e }, /* rightpointer ☞ WHITE RIGHT POINTING INDEX */ { 0x0aec, 0x2663 }, /* club ♣ BLACK CLUB SUIT */ { 0x0aed, 0x2666 }, /* diamond ♦ BLACK DIAMOND SUIT */ { 0x0aee, 0x2665 }, /* heart ♥ BLACK HEART SUIT */ { 0x0af0, 0x2720 }, /* maltesecross ✠ MALTESE CROSS */ { 0x0af1, 0x2020 }, /* dagger † DAGGER */ { 0x0af2, 0x2021 }, /* doubledagger ‡ DOUBLE DAGGER */ { 0x0af3, 0x2713 }, /* checkmark ✓ CHECK MARK */ { 0x0af4, 0x2717 }, /* ballotcross ✗ BALLOT X */ { 0x0af5, 0x266f }, /* musicalsharp ♯ MUSIC SHARP SIGN */ { 0x0af6, 0x266d }, /* musicalflat ♭ MUSIC FLAT SIGN */ { 0x0af7, 0x2642 }, /* malesymbol ♂ MALE SIGN */ { 0x0af8, 0x2640 }, /* femalesymbol ♀ FEMALE SIGN */ { 0x0af9, 0x260e }, /* telephone ☎ BLACK TELEPHONE */ { 0x0afa, 0x2315 }, /* telephonerecorder ⌕ TELEPHONE RECORDER */ { 0x0afb, 0x2117 }, /* phonographcopyright ℗ SOUND RECORDING COPYRIGHT */ { 0x0afc, 0x2038 }, /* caret ‸ CARET */ { 0x0afd, 0x201a }, /* singlelowquotemark ‚ SINGLE LOW-9 QUOTATION MARK */ { 0x0afe, 0x201e }, /* doublelowquotemark „ DOUBLE LOW-9 QUOTATION MARK */ /* 0x0aff cursor ? ??? */ { 0x0ba3, 0x003c }, /* leftcaret < LESS-THAN SIGN */ { 0x0ba6, 0x003e }, /* rightcaret > GREATER-THAN SIGN */ { 0x0ba8, 0x2228 }, /* downcaret ∨ LOGICAL OR */ { 0x0ba9, 0x2227 }, /* upcaret ∧ LOGICAL AND */ { 0x0bc0, 0x00af }, /* overbar ¯ MACRON */ { 0x0bc2, 0x22a5 }, /* downtack ⊥ UP TACK */ { 0x0bc3, 0x2229 }, /* upshoe ∩ INTERSECTION */ { 0x0bc4, 0x230a }, /* downstile ⌊ LEFT FLOOR */ { 0x0bc6, 0x005f }, /* underbar _ LOW LINE */ { 0x0bca, 0x2218 }, /* jot ∘ RING OPERATOR */ { 0x0bcc, 0x2395 }, /* quad ⎕ APL FUNCTIONAL SYMBOL QUAD */ { 0x0bce, 0x22a4 }, /* uptack ⊤ DOWN TACK */ { 0x0bcf, 0x25cb }, /* circle ○ WHITE CIRCLE */ { 0x0bd3, 0x2308 }, /* upstile ⌈ LEFT CEILING */ { 0x0bd6, 0x222a }, /* downshoe ∪ UNION */ { 0x0bd8, 0x2283 }, /* rightshoe ⊃ SUPERSET OF */ { 0x0bda, 0x2282 }, /* leftshoe ⊂ SUBSET OF */ { 0x0bdc, 0x22a2 }, /* lefttack ⊢ RIGHT TACK */ { 0x0bfc, 0x22a3 }, /* righttack ⊣ LEFT TACK */ { 0x0cdf, 0x2017 }, /* hebrew_doublelowline ‗ DOUBLE LOW LINE */ { 0x0ce0, 0x05d0 }, /* hebrew_aleph א HEBREW LETTER ALEF */ { 0x0ce1, 0x05d1 }, /* hebrew_bet ב HEBREW LETTER BET */ { 0x0ce2, 0x05d2 }, /* hebrew_gimel ג HEBREW LETTER GIMEL */ { 0x0ce3, 0x05d3 }, /* hebrew_dalet ד HEBREW LETTER DALET */ { 0x0ce4, 0x05d4 }, /* hebrew_he ה HEBREW LETTER HE */ { 0x0ce5, 0x05d5 }, /* hebrew_waw ו HEBREW LETTER VAV */ { 0x0ce6, 0x05d6 }, /* hebrew_zain ז HEBREW LETTER ZAYIN */ { 0x0ce7, 0x05d7 }, /* hebrew_chet ח HEBREW LETTER HET */ { 0x0ce8, 0x05d8 }, /* hebrew_tet ט HEBREW LETTER TET */ { 0x0ce9, 0x05d9 }, /* hebrew_yod י HEBREW LETTER YOD */ { 0x0cea, 0x05da }, /* hebrew_finalkaph ך HEBREW LETTER FINAL KAF */ { 0x0ceb, 0x05db }, /* hebrew_kaph כ HEBREW LETTER KAF */ { 0x0cec, 0x05dc }, /* hebrew_lamed ל HEBREW LETTER LAMED */ { 0x0ced, 0x05dd }, /* hebrew_finalmem ם HEBREW LETTER FINAL MEM */ { 0x0cee, 0x05de }, /* hebrew_mem מ HEBREW LETTER MEM */ { 0x0cef, 0x05df }, /* hebrew_finalnun ן HEBREW LETTER FINAL NUN */ { 0x0cf0, 0x05e0 }, /* hebrew_nun נ HEBREW LETTER NUN */ { 0x0cf1, 0x05e1 }, /* hebrew_samech ס HEBREW LETTER SAMEKH */ { 0x0cf2, 0x05e2 }, /* hebrew_ayin ע HEBREW LETTER AYIN */ { 0x0cf3, 0x05e3 }, /* hebrew_finalpe ף HEBREW LETTER FINAL PE */ { 0x0cf4, 0x05e4 }, /* hebrew_pe פ HEBREW LETTER PE */ { 0x0cf5, 0x05e5 }, /* hebrew_finalzade ץ HEBREW LETTER FINAL TSADI */ { 0x0cf6, 0x05e6 }, /* hebrew_zade צ HEBREW LETTER TSADI */ { 0x0cf7, 0x05e7 }, /* hebrew_qoph ק HEBREW LETTER QOF */ { 0x0cf8, 0x05e8 }, /* hebrew_resh ר HEBREW LETTER RESH */ { 0x0cf9, 0x05e9 }, /* hebrew_shin ש HEBREW LETTER SHIN */ { 0x0cfa, 0x05ea }, /* hebrew_taw ת HEBREW LETTER TAV */ { 0x0da1, 0x0e01 }, /* Thai_kokai ก THAI CHARACTER KO KAI */ { 0x0da2, 0x0e02 }, /* Thai_khokhai ข THAI CHARACTER KHO KHAI */ { 0x0da3, 0x0e03 }, /* Thai_khokhuat ฃ THAI CHARACTER KHO KHUAT */ { 0x0da4, 0x0e04 }, /* Thai_khokhwai ค THAI CHARACTER KHO KHWAI */ { 0x0da5, 0x0e05 }, /* Thai_khokhon ฅ THAI CHARACTER KHO KHON */ { 0x0da6, 0x0e06 }, /* Thai_khorakhang ฆ THAI CHARACTER KHO RAKHANG */ { 0x0da7, 0x0e07 }, /* Thai_ngongu ง THAI CHARACTER NGO NGU */ { 0x0da8, 0x0e08 }, /* Thai_chochan จ THAI CHARACTER CHO CHAN */ { 0x0da9, 0x0e09 }, /* Thai_choching ฉ THAI CHARACTER CHO CHING */ { 0x0daa, 0x0e0a }, /* Thai_chochang ช THAI CHARACTER CHO CHANG */ { 0x0dab, 0x0e0b }, /* Thai_soso ซ THAI CHARACTER SO SO */ { 0x0dac, 0x0e0c }, /* Thai_chochoe ฌ THAI CHARACTER CHO CHOE */ { 0x0dad, 0x0e0d }, /* Thai_yoying ญ THAI CHARACTER YO YING */ { 0x0dae, 0x0e0e }, /* Thai_dochada ฎ THAI CHARACTER DO CHADA */ { 0x0daf, 0x0e0f }, /* Thai_topatak ฏ THAI CHARACTER TO PATAK */ { 0x0db0, 0x0e10 }, /* Thai_thothan ฐ THAI CHARACTER THO THAN */ { 0x0db1, 0x0e11 }, /* Thai_thonangmontho ฑ THAI CHARACTER THO NANGMONTHO */ { 0x0db2, 0x0e12 }, /* Thai_thophuthao ฒ THAI CHARACTER THO PHUTHAO */ { 0x0db3, 0x0e13 }, /* Thai_nonen ณ THAI CHARACTER NO NEN */ { 0x0db4, 0x0e14 }, /* Thai_dodek ด THAI CHARACTER DO DEK */ { 0x0db5, 0x0e15 }, /* Thai_totao ต THAI CHARACTER TO TAO */ { 0x0db6, 0x0e16 }, /* Thai_thothung ถ THAI CHARACTER THO THUNG */ { 0x0db7, 0x0e17 }, /* Thai_thothahan ท THAI CHARACTER THO THAHAN */ { 0x0db8, 0x0e18 }, /* Thai_thothong ธ THAI CHARACTER THO THONG */ { 0x0db9, 0x0e19 }, /* Thai_nonu น THAI CHARACTER NO NU */ { 0x0dba, 0x0e1a }, /* Thai_bobaimai บ THAI CHARACTER BO BAIMAI */ { 0x0dbb, 0x0e1b }, /* Thai_popla ป THAI CHARACTER PO PLA */ { 0x0dbc, 0x0e1c }, /* Thai_phophung ผ THAI CHARACTER PHO PHUNG */ { 0x0dbd, 0x0e1d }, /* Thai_fofa ฝ THAI CHARACTER FO FA */ { 0x0dbe, 0x0e1e }, /* Thai_phophan พ THAI CHARACTER PHO PHAN */ { 0x0dbf, 0x0e1f }, /* Thai_fofan ฟ THAI CHARACTER FO FAN */ { 0x0dc0, 0x0e20 }, /* Thai_phosamphao ภ THAI CHARACTER PHO SAMPHAO */ { 0x0dc1, 0x0e21 }, /* Thai_moma ม THAI CHARACTER MO MA */ { 0x0dc2, 0x0e22 }, /* Thai_yoyak ย THAI CHARACTER YO YAK */ { 0x0dc3, 0x0e23 }, /* Thai_rorua ร THAI CHARACTER RO RUA */ { 0x0dc4, 0x0e24 }, /* Thai_ru ฤ THAI CHARACTER RU */ { 0x0dc5, 0x0e25 }, /* Thai_loling ล THAI CHARACTER LO LING */ { 0x0dc6, 0x0e26 }, /* Thai_lu ฦ THAI CHARACTER LU */ { 0x0dc7, 0x0e27 }, /* Thai_wowaen ว THAI CHARACTER WO WAEN */ { 0x0dc8, 0x0e28 }, /* Thai_sosala ศ THAI CHARACTER SO SALA */ { 0x0dc9, 0x0e29 }, /* Thai_sorusi ษ THAI CHARACTER SO RUSI */ { 0x0dca, 0x0e2a }, /* Thai_sosua ส THAI CHARACTER SO SUA */ { 0x0dcb, 0x0e2b }, /* Thai_hohip ห THAI CHARACTER HO HIP */ { 0x0dcc, 0x0e2c }, /* Thai_lochula ฬ THAI CHARACTER LO CHULA */ { 0x0dcd, 0x0e2d }, /* Thai_oang อ THAI CHARACTER O ANG */ { 0x0dce, 0x0e2e }, /* Thai_honokhuk ฮ THAI CHARACTER HO NOKHUK */ { 0x0dcf, 0x0e2f }, /* Thai_paiyannoi ฯ THAI CHARACTER PAIYANNOI */ { 0x0dd0, 0x0e30 }, /* Thai_saraa ะ THAI CHARACTER SARA A */ { 0x0dd1, 0x0e31 }, /* Thai_maihanakat ั THAI CHARACTER MAI HAN-AKAT */ { 0x0dd2, 0x0e32 }, /* Thai_saraaa า THAI CHARACTER SARA AA */ { 0x0dd3, 0x0e33 }, /* Thai_saraam ำ THAI CHARACTER SARA AM */ { 0x0dd4, 0x0e34 }, /* Thai_sarai ิ THAI CHARACTER SARA I */ { 0x0dd5, 0x0e35 }, /* Thai_saraii ี THAI CHARACTER SARA II */ { 0x0dd6, 0x0e36 }, /* Thai_saraue ึ THAI CHARACTER SARA UE */ { 0x0dd7, 0x0e37 }, /* Thai_sarauee ื THAI CHARACTER SARA UEE */ { 0x0dd8, 0x0e38 }, /* Thai_sarau ุ THAI CHARACTER SARA U */ { 0x0dd9, 0x0e39 }, /* Thai_sarauu ู THAI CHARACTER SARA UU */ { 0x0dda, 0x0e3a }, /* Thai_phinthu ฺ THAI CHARACTER PHINTHU */ /* 0x0dde Thai_maihanakat_maitho ? ??? */ { 0x0ddf, 0x0e3f }, /* Thai_baht ฿ THAI CURRENCY SYMBOL BAHT */ { 0x0de0, 0x0e40 }, /* Thai_sarae เ THAI CHARACTER SARA E */ { 0x0de1, 0x0e41 }, /* Thai_saraae แ THAI CHARACTER SARA AE */ { 0x0de2, 0x0e42 }, /* Thai_sarao โ THAI CHARACTER SARA O */ { 0x0de3, 0x0e43 }, /* Thai_saraaimaimuan ใ THAI CHARACTER SARA AI MAIMUAN */ { 0x0de4, 0x0e44 }, /* Thai_saraaimaimalai ไ THAI CHARACTER SARA AI MAIMALAI */ { 0x0de5, 0x0e45 }, /* Thai_lakkhangyao ๅ THAI CHARACTER LAKKHANGYAO */ { 0x0de6, 0x0e46 }, /* Thai_maiyamok ๆ THAI CHARACTER MAIYAMOK */ { 0x0de7, 0x0e47 }, /* Thai_maitaikhu ็ THAI CHARACTER MAITAIKHU */ { 0x0de8, 0x0e48 }, /* Thai_maiek ่ THAI CHARACTER MAI EK */ { 0x0de9, 0x0e49 }, /* Thai_maitho ้ THAI CHARACTER MAI THO */ { 0x0dea, 0x0e4a }, /* Thai_maitri ๊ THAI CHARACTER MAI TRI */ { 0x0deb, 0x0e4b }, /* Thai_maichattawa ๋ THAI CHARACTER MAI CHATTAWA */ { 0x0dec, 0x0e4c }, /* Thai_thanthakhat ์ THAI CHARACTER THANTHAKHAT */ { 0x0ded, 0x0e4d }, /* Thai_nikhahit ํ THAI CHARACTER NIKHAHIT */ { 0x0df0, 0x0e50 }, /* Thai_leksun ๐ THAI DIGIT ZERO */ { 0x0df1, 0x0e51 }, /* Thai_leknung ๑ THAI DIGIT ONE */ { 0x0df2, 0x0e52 }, /* Thai_leksong ๒ THAI DIGIT TWO */ { 0x0df3, 0x0e53 }, /* Thai_leksam ๓ THAI DIGIT THREE */ { 0x0df4, 0x0e54 }, /* Thai_leksi ๔ THAI DIGIT FOUR */ { 0x0df5, 0x0e55 }, /* Thai_lekha ๕ THAI DIGIT FIVE */ { 0x0df6, 0x0e56 }, /* Thai_lekhok ๖ THAI DIGIT SIX */ { 0x0df7, 0x0e57 }, /* Thai_lekchet ๗ THAI DIGIT SEVEN */ { 0x0df8, 0x0e58 }, /* Thai_lekpaet ๘ THAI DIGIT EIGHT */ { 0x0df9, 0x0e59 }, /* Thai_lekkao ๙ THAI DIGIT NINE */ { 0x0ea1, 0x3131 }, /* Hangul_Kiyeog ㄱ HANGUL LETTER KIYEOK */ { 0x0ea2, 0x3132 }, /* Hangul_SsangKiyeog ㄲ HANGUL LETTER SSANGKIYEOK */ { 0x0ea3, 0x3133 }, /* Hangul_KiyeogSios ㄳ HANGUL LETTER KIYEOK-SIOS */ { 0x0ea4, 0x3134 }, /* Hangul_Nieun ㄴ HANGUL LETTER NIEUN */ { 0x0ea5, 0x3135 }, /* Hangul_NieunJieuj ㄵ HANGUL LETTER NIEUN-CIEUC */ { 0x0ea6, 0x3136 }, /* Hangul_NieunHieuh ㄶ HANGUL LETTER NIEUN-HIEUH */ { 0x0ea7, 0x3137 }, /* Hangul_Dikeud ㄷ HANGUL LETTER TIKEUT */ { 0x0ea8, 0x3138 }, /* Hangul_SsangDikeud ㄸ HANGUL LETTER SSANGTIKEUT */ { 0x0ea9, 0x3139 }, /* Hangul_Rieul ㄹ HANGUL LETTER RIEUL */ { 0x0eaa, 0x313a }, /* Hangul_RieulKiyeog ㄺ HANGUL LETTER RIEUL-KIYEOK */ { 0x0eab, 0x313b }, /* Hangul_RieulMieum ㄻ HANGUL LETTER RIEUL-MIEUM */ { 0x0eac, 0x313c }, /* Hangul_RieulPieub ㄼ HANGUL LETTER RIEUL-PIEUP */ { 0x0ead, 0x313d }, /* Hangul_RieulSios ㄽ HANGUL LETTER RIEUL-SIOS */ { 0x0eae, 0x313e }, /* Hangul_RieulTieut ㄾ HANGUL LETTER RIEUL-THIEUTH */ { 0x0eaf, 0x313f }, /* Hangul_RieulPhieuf ㄿ HANGUL LETTER RIEUL-PHIEUPH */ { 0x0eb0, 0x3140 }, /* Hangul_RieulHieuh ㅀ HANGUL LETTER RIEUL-HIEUH */ { 0x0eb1, 0x3141 }, /* Hangul_Mieum ㅁ HANGUL LETTER MIEUM */ { 0x0eb2, 0x3142 }, /* Hangul_Pieub ㅂ HANGUL LETTER PIEUP */ { 0x0eb3, 0x3143 }, /* Hangul_SsangPieub ㅃ HANGUL LETTER SSANGPIEUP */ { 0x0eb4, 0x3144 }, /* Hangul_PieubSios ㅄ HANGUL LETTER PIEUP-SIOS */ { 0x0eb5, 0x3145 }, /* Hangul_Sios ㅅ HANGUL LETTER SIOS */ { 0x0eb6, 0x3146 }, /* Hangul_SsangSios ㅆ HANGUL LETTER SSANGSIOS */ { 0x0eb7, 0x3147 }, /* Hangul_Ieung ㅇ HANGUL LETTER IEUNG */ { 0x0eb8, 0x3148 }, /* Hangul_Jieuj ㅈ HANGUL LETTER CIEUC */ { 0x0eb9, 0x3149 }, /* Hangul_SsangJieuj ㅉ HANGUL LETTER SSANGCIEUC */ { 0x0eba, 0x314a }, /* Hangul_Cieuc ㅊ HANGUL LETTER CHIEUCH */ { 0x0ebb, 0x314b }, /* Hangul_Khieuq ㅋ HANGUL LETTER KHIEUKH */ { 0x0ebc, 0x314c }, /* Hangul_Tieut ㅌ HANGUL LETTER THIEUTH */ { 0x0ebd, 0x314d }, /* Hangul_Phieuf ㅍ HANGUL LETTER PHIEUPH */ { 0x0ebe, 0x314e }, /* Hangul_Hieuh ㅎ HANGUL LETTER HIEUH */ { 0x0ebf, 0x314f }, /* Hangul_A ㅏ HANGUL LETTER A */ { 0x0ec0, 0x3150 }, /* Hangul_AE ㅐ HANGUL LETTER AE */ { 0x0ec1, 0x3151 }, /* Hangul_YA ㅑ HANGUL LETTER YA */ { 0x0ec2, 0x3152 }, /* Hangul_YAE ㅒ HANGUL LETTER YAE */ { 0x0ec3, 0x3153 }, /* Hangul_EO ㅓ HANGUL LETTER EO */ { 0x0ec4, 0x3154 }, /* Hangul_E ㅔ HANGUL LETTER E */ { 0x0ec5, 0x3155 }, /* Hangul_YEO ㅕ HANGUL LETTER YEO */ { 0x0ec6, 0x3156 }, /* Hangul_YE ㅖ HANGUL LETTER YE */ { 0x0ec7, 0x3157 }, /* Hangul_O ㅗ HANGUL LETTER O */ { 0x0ec8, 0x3158 }, /* Hangul_WA ㅘ HANGUL LETTER WA */ { 0x0ec9, 0x3159 }, /* Hangul_WAE ㅙ HANGUL LETTER WAE */ { 0x0eca, 0x315a }, /* Hangul_OE ㅚ HANGUL LETTER OE */ { 0x0ecb, 0x315b }, /* Hangul_YO ㅛ HANGUL LETTER YO */ { 0x0ecc, 0x315c }, /* Hangul_U ㅜ HANGUL LETTER U */ { 0x0ecd, 0x315d }, /* Hangul_WEO ㅝ HANGUL LETTER WEO */ { 0x0ece, 0x315e }, /* Hangul_WE ㅞ HANGUL LETTER WE */ { 0x0ecf, 0x315f }, /* Hangul_WI ㅟ HANGUL LETTER WI */ { 0x0ed0, 0x3160 }, /* Hangul_YU ㅠ HANGUL LETTER YU */ { 0x0ed1, 0x3161 }, /* Hangul_EU ㅡ HANGUL LETTER EU */ { 0x0ed2, 0x3162 }, /* Hangul_YI ㅢ HANGUL LETTER YI */ { 0x0ed3, 0x3163 }, /* Hangul_I ㅣ HANGUL LETTER I */ { 0x0ed4, 0x11a8 }, /* Hangul_J_Kiyeog ᆨ HANGUL JONGSEONG KIYEOK */ { 0x0ed5, 0x11a9 }, /* Hangul_J_SsangKiyeog ᆩ HANGUL JONGSEONG SSANGKIYEOK */ { 0x0ed6, 0x11aa }, /* Hangul_J_KiyeogSios ᆪ HANGUL JONGSEONG KIYEOK-SIOS */ { 0x0ed7, 0x11ab }, /* Hangul_J_Nieun ᆫ HANGUL JONGSEONG NIEUN */ { 0x0ed8, 0x11ac }, /* Hangul_J_NieunJieuj ᆬ HANGUL JONGSEONG NIEUN-CIEUC */ { 0x0ed9, 0x11ad }, /* Hangul_J_NieunHieuh ᆭ HANGUL JONGSEONG NIEUN-HIEUH */ { 0x0eda, 0x11ae }, /* Hangul_J_Dikeud ᆮ HANGUL JONGSEONG TIKEUT */ { 0x0edb, 0x11af }, /* Hangul_J_Rieul ᆯ HANGUL JONGSEONG RIEUL */ { 0x0edc, 0x11b0 }, /* Hangul_J_RieulKiyeog ᆰ HANGUL JONGSEONG RIEUL-KIYEOK */ { 0x0edd, 0x11b1 }, /* Hangul_J_RieulMieum ᆱ HANGUL JONGSEONG RIEUL-MIEUM */ { 0x0ede, 0x11b2 }, /* Hangul_J_RieulPieub ᆲ HANGUL JONGSEONG RIEUL-PIEUP */ { 0x0edf, 0x11b3 }, /* Hangul_J_RieulSios ᆳ HANGUL JONGSEONG RIEUL-SIOS */ { 0x0ee0, 0x11b4 }, /* Hangul_J_RieulTieut ᆴ HANGUL JONGSEONG RIEUL-THIEUTH */ { 0x0ee1, 0x11b5 }, /* Hangul_J_RieulPhieuf ᆵ HANGUL JONGSEONG RIEUL-PHIEUPH */ { 0x0ee2, 0x11b6 }, /* Hangul_J_RieulHieuh ᆶ HANGUL JONGSEONG RIEUL-HIEUH */ { 0x0ee3, 0x11b7 }, /* Hangul_J_Mieum ᆷ HANGUL JONGSEONG MIEUM */ { 0x0ee4, 0x11b8 }, /* Hangul_J_Pieub ᆸ HANGUL JONGSEONG PIEUP */ { 0x0ee5, 0x11b9 }, /* Hangul_J_PieubSios ᆹ HANGUL JONGSEONG PIEUP-SIOS */ { 0x0ee6, 0x11ba }, /* Hangul_J_Sios ᆺ HANGUL JONGSEONG SIOS */ { 0x0ee7, 0x11bb }, /* Hangul_J_SsangSios ᆻ HANGUL JONGSEONG SSANGSIOS */ { 0x0ee8, 0x11bc }, /* Hangul_J_Ieung ᆼ HANGUL JONGSEONG IEUNG */ { 0x0ee9, 0x11bd }, /* Hangul_J_Jieuj ᆽ HANGUL JONGSEONG CIEUC */ { 0x0eea, 0x11be }, /* Hangul_J_Cieuc ᆾ HANGUL JONGSEONG CHIEUCH */ { 0x0eeb, 0x11bf }, /* Hangul_J_Khieuq ᆿ HANGUL JONGSEONG KHIEUKH */ { 0x0eec, 0x11c0 }, /* Hangul_J_Tieut ᇀ HANGUL JONGSEONG THIEUTH */ { 0x0eed, 0x11c1 }, /* Hangul_J_Phieuf ᇁ HANGUL JONGSEONG PHIEUPH */ { 0x0eee, 0x11c2 }, /* Hangul_J_Hieuh ᇂ HANGUL JONGSEONG HIEUH */ { 0x0eef, 0x316d }, /* Hangul_RieulYeorinHieuh ㅭ HANGUL LETTER RIEUL-YEORINHIEUH */ { 0x0ef0, 0x3171 }, /* Hangul_SunkyeongeumMieum ㅱ HANGUL LETTER KAPYEOUNMIEUM */ { 0x0ef1, 0x3178 }, /* Hangul_SunkyeongeumPieub ㅸ HANGUL LETTER KAPYEOUNPIEUP */ { 0x0ef2, 0x317f }, /* Hangul_PanSios ㅿ HANGUL LETTER PANSIOS */ { 0x0ef3, 0x3181 }, /* Hangul_KkogjiDalrinIeung ㆁ HANGUL LETTER YESIEUNG */ { 0x0ef4, 0x3184 }, /* Hangul_SunkyeongeumPhieuf ㆄ HANGUL LETTER KAPYEOUNPHIEUPH */ { 0x0ef5, 0x3186 }, /* Hangul_YeorinHieuh ㆆ HANGUL LETTER YEORINHIEUH */ { 0x0ef6, 0x318d }, /* Hangul_AraeA ㆍ HANGUL LETTER ARAEA */ { 0x0ef7, 0x318e }, /* Hangul_AraeAE ㆎ HANGUL LETTER ARAEAE */ { 0x0ef8, 0x11eb }, /* Hangul_J_PanSios ᇫ HANGUL JONGSEONG PANSIOS */ { 0x0ef9, 0x11f0 }, /* Hangul_J_KkogjiDalrinIeung ᇰ HANGUL JONGSEONG YESIEUNG */ { 0x0efa, 0x11f9 }, /* Hangul_J_YeorinHieuh ᇹ HANGUL JONGSEONG YEORINHIEUH */ { 0x0eff, 0x20a9 }, /* Korean_Won ₩ WON SIGN */ { 0x13a4, 0x20ac }, /* Euro € EURO SIGN */ { 0x13bc, 0x0152 }, /* OE Œ LATIN CAPITAL LIGATURE OE */ { 0x13bd, 0x0153 }, /* oe œ LATIN SMALL LIGATURE OE */ { 0x13be, 0x0178 }, /* Ydiaeresis Ÿ LATIN CAPITAL LETTER Y WITH DIAERESIS */ { 0x20ac, 0x20ac }, /* EuroSign € EURO SIGN */ }; static uint32_t keysym2ucs(KeySym keysym) { int min = 0; int max = sizeof(keysymtab) / sizeof(struct codepair) - 1; int mid; /* first check for Latin-1 characters (1:1 mapping) */ if ((keysym >= 0x0020 && keysym <= 0x007e) || (keysym >= 0x00a0 && keysym <= 0x00ff)) return keysym; /* also check for directly encoded 24-bit UCS characters */ if ((keysym & 0xff000000) == 0x01000000) return keysym & 0x00ffffff; /* binary search in table */ while (max >= min) { mid = (min + max) / 2; if (keysymtab[mid].keysym < keysym) min = mid + 1; else if (keysymtab[mid].keysym > keysym) max = mid - 1; else { /* found it */ return keysymtab[mid].ucs; } } /* no matching Unicode value found */ return ~0; } #endif uTox/src/xlib/gtk.h0000600000175000001440000000126414003056216013164 0ustar rakusers#ifndef UTOX_GTK_H #define UTOX_GTK_H #include typedef struct file_transfer FILE_TRANSFER; typedef struct msg_header MSG_HEADER; typedef struct file_transfer FILE_TRANSFER; typedef struct { char *name; uint8_t *data; int data_size; } FILE_IMAGE; void ugtk_openfilesend(void); void ugtk_openfileavatar(void); void ugtk_native_select_dir_ft(uint32_t fid, FILE_TRANSFER *file); void ugtk_file_save_inline(MSG_HEADER *msg); void ugtk_save_chatlog(uint32_t friend_number); /** * @brief Save passed image to selected file. * * Takes ownership of file_image. */ void ugtk_file_save_image_png(FILE_IMAGE *file_image); void *ugtk_load(void); #endif // UTOX_GTK_H uTox/src/xlib/gtk.c0000600000175000001440000004604314003056216013163 0ustar rakusers#include "gtk.h" #include "../avatar.h" #include "../chatlog.h" #include "../debug.h" #include "../file_transfers.h" #include "../filesys.h" #include "../flist.h" #include "../friend.h" #include "../macros.h" #include "../text.h" #include "../tox.h" #include "../ui.h" #include "../utox.h" #include "../main.h" #include "../native/thread.h" #include "stb.h" #include #include #include #include #include #define LIBGTK_FILENAME "libgtk-3.so" #define LIBGTK_FILENAME_FALLBACK "libgtk-3.so.0" #define GTK_FILE_CHOOSER_ACTION_OPEN 0 #define GTK_FILE_CHOOSER_ACTION_SAVE 1 #define GTK_RESPONSE_ACCEPT -3 #define GTK_RESPONSE_CANCEL -6 typedef struct GSList GSList; struct GSList { void * data; GSList *next; }; /* Each of the following transiently segfaults we we use the pre-existing name. * So we have to clobber each of the real names with something localized */ void (*utoxGTK_free)(void *); void (*utoxGTK_slist_free)(GSList *); unsigned long (*utoxGTK_signal_connect_data)(void *, const char *, void *, void *, void *, int); void (*utoxGTK_object_unref)(void *); void (*utoxGTK_init)(int *, char ***); bool (*utoxGTK_events_pending)(void); bool (*utoxGTK_main_iteration)(void); void (*utoxGTK_widget_set_margin_left)(void *, int); void (*utoxGTK_widget_set_margin_right)(void *, int); void (*utoxGTK_widget_destroy)(void *); void *(*utoxGTK_message_dialog_new)(void *, int, int, int, const char *, ...); int (*utoxGTK_dialog_run)(void *); void *(*utoxGTK_file_chooser_dialog_new)(const char *, void *, int, const char *, ...); void (*utoxGTK_file_chooser_set_select_multiple)(void *, bool); void (*utoxGTK_file_chooser_set_current_name)(void *, const char *); char *(*utoxGTK_file_chooser_get_filename)(void *); GSList *(*utoxGTK_file_chooser_get_filenames)(void *); void (*utoxGTK_file_chooser_set_do_overwrite_confirmation)(void *, bool); void (*utoxGTK_file_chooser_set_filter)(void *, void *); char *(*utoxGTK_file_chooser_get_preview_filename)(void *); void (*utoxGTK_file_chooser_set_preview_widget)(void *, void *); void (*utoxGTK_file_chooser_set_preview_widget_active)(void *, bool); void *(*utoxGTK_file_filter_new)(void); void (*utoxGTK_file_filter_add_mime_type)(void *, const char *); void *(*utoxGTK_image_new)(void); void (*utoxGTK_image_set_from_pixbuf)(void *, void *); void *(*utoxGDK_pixbuf_new_from_file)(const char *, void **); void *(*utoxGDK_pixbuf_new_from_file_at_size)(const char *, int, int, void **); int (*utoxGDK_pixbuf_get_width)(const void *); int (*utoxGDK_pixbuf_get_height)(const void *); static bool utoxGTK_open; static void update_image_preview(void *filechooser, void *image) { #define MAX_PREVIEW_SIZE 256 char *filename = utoxGTK_file_chooser_get_preview_filename(filechooser); if (!filename) return; // load preview void *pixbuf = utoxGDK_pixbuf_new_from_file(filename, NULL); if (!pixbuf) { utoxGTK_free(filename); utoxGTK_file_chooser_set_preview_widget_active(filechooser, false); return; } // if preview too big load smaller if (utoxGDK_pixbuf_get_width(pixbuf) > MAX_PREVIEW_SIZE || utoxGDK_pixbuf_get_height(pixbuf) > MAX_PREVIEW_SIZE) { utoxGTK_object_unref(pixbuf); pixbuf = utoxGDK_pixbuf_new_from_file_at_size(filename, MAX_PREVIEW_SIZE, MAX_PREVIEW_SIZE, NULL); } utoxGTK_free(filename); if (!pixbuf) { utoxGTK_file_chooser_set_preview_widget_active(filechooser, false); return; } // pad to MAX_PREVIEW_SIZE + 3px margins int margin = (MAX_PREVIEW_SIZE + 6 - utoxGDK_pixbuf_get_width(pixbuf)) / 2; utoxGTK_widget_set_margin_left(image, margin); utoxGTK_widget_set_margin_right(image, margin); // set preview utoxGTK_image_set_from_pixbuf(image, pixbuf); utoxGTK_object_unref(pixbuf); utoxGTK_file_chooser_set_preview_widget_active(filechooser, true); } static void ugtk_opensendthread(void *args) { size_t fid = (size_t)args; void *dialog = utoxGTK_file_chooser_dialog_new((const char *)S(SEND_FILE), NULL, GTK_FILE_CHOOSER_ACTION_OPEN, "_Cancel", GTK_RESPONSE_CANCEL, "_Open", GTK_RESPONSE_ACCEPT, NULL); utoxGTK_file_chooser_set_select_multiple(dialog, true); void *preview = utoxGTK_image_new(); utoxGTK_file_chooser_set_preview_widget(dialog, preview); utoxGTK_signal_connect_data(dialog, "update-preview", update_image_preview, preview, NULL, 0); int result = utoxGTK_dialog_run(dialog); if (result == GTK_RESPONSE_ACCEPT) { GSList *list = utoxGTK_file_chooser_get_filenames(dialog), *p = list; while (p) { UTOX_MSG_FT *send = calloc(1, sizeof(UTOX_MSG_FT)); if (!send) { LOG_ERR("GTK", "GTK:\tUnabled to malloc for to send an FT msg"); while(p) { utoxGTK_free(p->data); p = p->next; } utoxGTK_slist_free(list); utoxGTK_open = false; return; } LOG_INFO("GTK", "Sending file %s" , p->data); send->file = fopen(p->data, "rb"); send->name = (uint8_t*)strdup(p->data); postmessage_toxcore(TOX_FILE_SEND_NEW, (uint32_t)fid, 0, send); utoxGTK_free(p->data); p = p->next; } utoxGTK_slist_free(list); } utoxGTK_widget_destroy(dialog); while (utoxGTK_events_pending()) { utoxGTK_main_iteration(); } utoxGTK_open = false; } static void ugtk_openavatarthread(void *UNUSED(args)) { void *dialog = utoxGTK_file_chooser_dialog_new((const char *)S(SELECT_AVATAR_TITLE), NULL, GTK_FILE_CHOOSER_ACTION_OPEN, "_Cancel", GTK_RESPONSE_CANCEL, "_Open", GTK_RESPONSE_ACCEPT, NULL); void *filter = utoxGTK_file_filter_new(); utoxGTK_file_filter_add_mime_type(filter, "image/jpeg"); utoxGTK_file_filter_add_mime_type(filter, "image/png"); utoxGTK_file_filter_add_mime_type(filter, "image/bmp"); utoxGTK_file_filter_add_mime_type(filter, "image/gif"); utoxGTK_file_chooser_set_filter(dialog, filter); void *preview = utoxGTK_image_new(); utoxGTK_file_chooser_set_preview_widget(dialog, preview); utoxGTK_signal_connect_data(dialog, "update-preview", update_image_preview, preview, NULL, 0); while (utoxGTK_dialog_run(dialog) == GTK_RESPONSE_ACCEPT) { char *filename = utoxGTK_file_chooser_get_filename(dialog); int size; int width, height, bpp; uint8_t *img = stbi_load(filename, &width, &height, &bpp, 0); uint8_t *file_data = stbi_write_png_to_mem(img, 0, width, height, bpp, &size); free(img); utoxGTK_free(filename); if (!file_data) { void *message_dialog = utoxGTK_message_dialog_new(dialog, 0, 1, 2, (const char *)S(CANT_FIND_FILE_OR_EMPTY)); utoxGTK_dialog_run(message_dialog); utoxGTK_widget_destroy(message_dialog); } else if (size > UTOX_AVATAR_MAX_DATA_LENGTH) { free(file_data); char size_str[16]; int len = sprint_humanread_bytes(size_str, sizeof(size_str), UTOX_AVATAR_MAX_DATA_LENGTH); char err_str[265] = { 0 }; snprintf((char *)err_str, 265, "%s%.*s (%ikb loaded)", S(AVATAR_TOO_LARGE_MAX_SIZE_IS), len, size_str, (size / 1024)); void *message_dialog = utoxGTK_message_dialog_new(dialog, 0, 1, 2, err_str); utoxGTK_dialog_run(message_dialog); utoxGTK_widget_destroy(message_dialog); } else { postmessage_utox(SELF_AVATAR_SET, size, 0, file_data); break; } } utoxGTK_widget_destroy(dialog); while (utoxGTK_events_pending()) { utoxGTK_main_iteration(); } utoxGTK_open = false; } void show_messagebox(const char *UNUSED(caption), uint16_t UNUSED(caption_length), const char *message, uint16_t UNUSED(message_length)) { utoxGTK_open = true; void *dialog = utoxGTK_message_dialog_new(NULL, 0, 1, 1, message); utoxGTK_dialog_run(dialog); utoxGTK_widget_destroy(dialog); while (utoxGTK_events_pending()) { utoxGTK_main_iteration(); } utoxGTK_open = false; } static void ugtk_savethread(void *args) { FILE_TRANSFER *file = args; while (1) { // TODO, save current dir, and filename and preload them to gtk dialog if save fails. /* Create a GTK save window */ void *dialog = utoxGTK_file_chooser_dialog_new((const char *)S(WHERE_TO_SAVE_FILE), NULL, GTK_FILE_CHOOSER_ACTION_SAVE, "_Cancel", GTK_RESPONSE_CANCEL, "_Open", GTK_RESPONSE_ACCEPT, NULL); /* Get incoming file name for GTK */ char buf[file->name_length + 1]; snprintf(buf, file->name_length + 1, "%.*s", (int)file->name_length, file->name); utoxGTK_file_chooser_set_current_name(dialog, buf); utoxGTK_file_chooser_set_do_overwrite_confirmation(dialog, true); /* Users can create folders when saving. */ // TODO ENABLE BELOW! // utoxGTK_file_chooser_set_create_folders(dialog, TRUE); int result = utoxGTK_dialog_run(dialog); if (result == GTK_RESPONSE_ACCEPT) { char *name = utoxGTK_file_chooser_get_filename(dialog); char *path = strdup(name); // utoxGTK_free(name) LOG_TRACE("GTK", "name: %s\npath: %s" , name, path); /* can we really write this file? */ FILE *fp = fopen(path, "w"); if (fp == NULL) { /* No, we can't display error, jump to top. */ if (errno == EACCES) { LOG_TRACE("GTK", "File write permission denied." ); void *errordialog = utoxGTK_message_dialog_new(dialog, 1, 3, 2, // parent, destroy_with_parent, // utoxGTK_error_message, utoxGTK_buttons_close "Error writing to file '%s'", name); utoxGTK_dialog_run(errordialog); utoxGTK_widget_destroy(errordialog); utoxGTK_widget_destroy(dialog); free(path); continue; } LOG_TRACE("GTK", "Unknown file write error..." ); free(path); break; } fclose(fp); /* write test passed, we're done! */ utoxGTK_widget_destroy(dialog); utoxGTK_main_iteration(); utoxGTK_widget_destroy(dialog); postmessage_utox(FILE_INCOMING_ACCEPT, file->friend_number, (file->file_number >> 16), path); break; } else if (result == GTK_RESPONSE_CANCEL) { LOG_TRACE("GTK", "Aborting in progress file..." ); } /* catch all */ utoxGTK_widget_destroy(dialog); break; } while (utoxGTK_events_pending()) { utoxGTK_main_iteration(); } utoxGTK_open = false; } static void ugtk_save_data_thread(void *args) { MSG_HEADER *msg = args; void *dialog = utoxGTK_file_chooser_dialog_new((const char *)S(SAVE_FILE), NULL, GTK_FILE_CHOOSER_ACTION_SAVE, "_Cancel", GTK_RESPONSE_CANCEL, "_Save", GTK_RESPONSE_ACCEPT, NULL); utoxGTK_file_chooser_set_current_name(dialog, msg->via.ft.name); int result = utoxGTK_dialog_run(dialog); if (result == GTK_RESPONSE_ACCEPT) { char *name = utoxGTK_file_chooser_get_filename(dialog); FILE *fp = fopen(name, "wb"); if (fp) { fwrite(msg->via.ft.data, msg->via.ft.data_size, 1, fp); fclose(fp); if (!msg->via.ft.path) { msg->via.ft.path_length = strlen(name); msg->via.ft.path = calloc(1, msg->via.ft.path_length + 1); } if (msg->via.ft.path) { snprintf((char *)msg->via.ft.path, UTOX_FILE_NAME_LENGTH, "%s", name); } msg->via.ft.inline_png = false; } } utoxGTK_widget_destroy(dialog); while (utoxGTK_events_pending()) { utoxGTK_main_iteration(); } utoxGTK_open = false; } static void ugtk_save_chatlog_thread(void *args) { size_t friend_number = (size_t)args; FRIEND *f = get_friend(friend_number); if (!f) { LOG_ERR("GTK", "Could not get friend with number: %u", friend_number); utoxGTK_open = false; return; } char name[TOX_MAX_NAME_LENGTH + sizeof ".txt"]; snprintf(name, sizeof name, "%.*s.txt", (int)f->name_length, f->name); void *dialog = utoxGTK_file_chooser_dialog_new((const char *)S(SAVE_FILE), NULL, GTK_FILE_CHOOSER_ACTION_SAVE, "_Cancel", GTK_RESPONSE_CANCEL, "_Save", GTK_RESPONSE_ACCEPT, NULL); utoxGTK_file_chooser_set_current_name(dialog, name); int result = utoxGTK_dialog_run(dialog); if (result == GTK_RESPONSE_ACCEPT) { char *file_name = utoxGTK_file_chooser_get_filename(dialog); FILE *fp = fopen(file_name, "wb"); if (fp) { utox_export_chatlog(f->id_str, fp); } } utoxGTK_widget_destroy(dialog); while (utoxGTK_events_pending()) { utoxGTK_main_iteration(); } utoxGTK_open = false; } static void ugtk_save_image_png_thread(void *args) { FILE_IMAGE *image = args; char name[TOX_MAX_NAME_LENGTH + sizeof ".png"] = { 0 }; snprintf(name, sizeof name, "%s.png", image->name); void *dialog = utoxGTK_file_chooser_dialog_new((const char *)S(SAVE_FILE), NULL, GTK_FILE_CHOOSER_ACTION_SAVE, "_Cancel", GTK_RESPONSE_CANCEL, "_Save", GTK_RESPONSE_ACCEPT, NULL); void *filter = utoxGTK_file_filter_new(); utoxGTK_file_filter_add_mime_type(filter, "image/png"); utoxGTK_file_chooser_set_filter(dialog, filter); utoxGTK_file_chooser_set_current_name(dialog, name); int result = utoxGTK_dialog_run(dialog); if (result == GTK_RESPONSE_ACCEPT) { char *file_name = utoxGTK_file_chooser_get_filename(dialog); FILE *file = fopen(file_name, "wb"); if (file) { fwrite(image->data, image->data_size, 1, file); fclose(file); } else { LOG_ERR("GTK", "Could not open file %s for write.", file_name); } free(file_name); } utoxGTK_widget_destroy(dialog); while (utoxGTK_events_pending()) { utoxGTK_main_iteration(); } utoxGTK_open = false; free(image); } void ugtk_openfilesend(void) { if (utoxGTK_open) { return; } FRIEND *f = flist_get_sel_friend(); if (!f) { LOG_ERR("GTK", "Unable to get friend from flist."); return; } utoxGTK_open = true; uint32_t number = f->number; thread(ugtk_opensendthread, (void*)(size_t)number); } void ugtk_openfileavatar(void) { if (utoxGTK_open) { return; } utoxGTK_open = true; thread(ugtk_openavatarthread, NULL); } void ugtk_native_select_dir_ft(uint32_t UNUSED(fid), FILE_TRANSFER *file) { if (utoxGTK_open) { return; } utoxGTK_open = true; thread(ugtk_savethread, file); } void ugtk_file_save_inline(MSG_HEADER *msg) { if (utoxGTK_open) { return; } utoxGTK_open = true; thread(ugtk_save_data_thread, msg); } void ugtk_file_save_image_png(FILE_IMAGE *image) { if (utoxGTK_open) { return; } utoxGTK_open = true; thread(ugtk_save_image_png_thread, image); } void ugtk_save_chatlog(uint32_t friend_number) { if (utoxGTK_open) { return; } // We just care about sending a single uint, but we don't want to overflow a buffer size_t fnum = friend_number; utoxGTK_open = true; thread(ugtk_save_chatlog_thread, (void *)fnum); // No need to create and pass a pointer for a single u32 } /* macro to link and test each of the gtk functions we need. * This is likely more specific than in it needs to be, so * when you rewrite this, aim for generic */ #define U_DLLOAD(trgt, name) \ do { \ utoxGTK_##name = dlsym(lib, #trgt "_" #name); \ if (!utoxGTK_##name) { \ LOG_ERR("GTK", "Unable to load " #name " (%s)", dlerror()); \ dlclose(lib); \ return NULL; \ } \ } while (0) #define U_DLLOAD_GDK(name) \ do { \ utoxGDK_##name = dlsym(lib, "gdk_" #name); \ if (!utoxGDK_##name) { \ LOG_ERR("GTK", "Unable to load " #name " (%s)", dlerror()); \ dlclose(lib); \ return NULL; \ } \ } while (0) void *ugtk_load(void) { // return NULL; void *lib = dlopen(LIBGTK_FILENAME, RTLD_LAZY); if (!lib) { //try again with libgtk-3.so.0 if the first one failed LOG_INFO("GTK", "Failed loading: %s. Falling back to %s", LIBGTK_FILENAME, LIBGTK_FILENAME_FALLBACK); lib = dlopen(LIBGTK_FILENAME_FALLBACK, RTLD_LAZY); } if (lib) { LOG_TRACE("GTK", "have GTK" ); U_DLLOAD(gtk, init); U_DLLOAD(gtk, main_iteration); U_DLLOAD(gtk, events_pending); U_DLLOAD(gtk, file_chooser_dialog_new); U_DLLOAD(gtk, file_filter_new); U_DLLOAD(gtk, message_dialog_new); U_DLLOAD(gtk, dialog_run); U_DLLOAD(gtk, file_chooser_get_filename); U_DLLOAD(gtk, file_chooser_get_filenames); U_DLLOAD(gtk, file_chooser_set_do_overwrite_confirmation); U_DLLOAD(gtk, file_chooser_set_select_multiple); U_DLLOAD(gtk, file_chooser_set_current_name); U_DLLOAD(gtk, file_chooser_set_filter); U_DLLOAD(gtk, file_filter_add_mime_type); U_DLLOAD(gtk, widget_destroy); U_DLLOAD(gtk, file_chooser_get_preview_filename); U_DLLOAD(gtk, file_chooser_set_preview_widget_active); U_DLLOAD(gtk, file_chooser_set_preview_widget); U_DLLOAD(gtk, image_new); U_DLLOAD(gtk, image_set_from_pixbuf); U_DLLOAD(gtk, widget_set_margin_left); U_DLLOAD(gtk, widget_set_margin_right); U_DLLOAD(g, slist_free); U_DLLOAD(g, free); U_DLLOAD(g, signal_connect_data); U_DLLOAD(g, object_unref); U_DLLOAD_GDK(pixbuf_new_from_file); U_DLLOAD_GDK(pixbuf_new_from_file_at_size); U_DLLOAD_GDK(pixbuf_get_width); U_DLLOAD_GDK(pixbuf_get_height); utoxGTK_init(NULL, NULL); return lib; } return NULL; } uTox/src/xlib/freetype.h0000600000175000001440000000201714003056216014217 0ustar rakusers#ifndef XLIB_FREETYPE_H #define XLIB_FREETYPE_H #include #include #include #include #include FT_LCD_FILTER_H #include // fontconfig.h must be before fcfreetype.h #include #define PIXELS(x) (((x) + 32) / 64) typedef struct { uint32_t ucs4; int16_t x, y; uint16_t width, height, xadvance, xxxx; Picture pic; } GLYPH; typedef struct { FT_Face face; FcCharSet *cs; } FONT_INFO; typedef struct { FcPattern *pattern; FONT_INFO *info; GLYPH * glyphs[128]; } FONT; extern FT_Library ftlib; extern FONT font[16], *sfont; extern FcCharSet *charset; extern FcFontSet *fs; extern bool ft_vert, ft_swap_blue_red; Picture loadglyphpic(uint8_t *data, int width, int height, int pitch, bool no_subpixel, bool vertical, bool swap_blue_red); GLYPH *font_getglyph(FONT *f, uint32_t ch); void initfonts(void); void loadfonts(void); void freefonts(void); #endif uTox/src/xlib/freetype.c0000600000175000001440000003561014003056216014217 0ustar rakusers#include "freetype.h" #include "main.h" #include "window.h" #include "../debug.h" #include "../macros.h" #include "../ui.h" #define UTOX_FONT_XLIB "Roboto" FT_Library ftlib; FONT font[16], *sfont; FcCharSet *charset; FcFontSet *fs; bool ft_vert, ft_swap_blue_red; static void font_info_open(FONT_INFO *i, FcPattern *pattern); Picture loadglyphpic(uint8_t *data, int width, int height, int pitch, bool no_subpixel, bool vertical, bool swap_blue_red) { if (!width || !height) { return None; } Picture picture; GC legc; Pixmap pixmap; XImage *img; if (no_subpixel) { pixmap = XCreatePixmap(display, main_window.window, width, height, 8); img = XCreateImage(display, CopyFromParent, 8, ZPixmap, 0, (char *)data, width, height, 8, 0); legc = XCreateGC(display, pixmap, 0, NULL); XPutImage(display, pixmap, legc, img, 0, 0, 0, 0, width, height); picture = XRenderCreatePicture(display, pixmap, XRenderFindStandardFormat(display, PictStandardA8), 0, NULL); } else { uint32_t *rgbx, *p, *end; rgbx = malloc(4 * width * height); if (!rgbx) { return None; } p = rgbx; int i = height; if (!vertical) { do { end = p + width; while (p != end) { *p++ = swap_blue_red ? RGB(data[2], data[1], data[0]) : RGB(data[0], data[1], data[2]); data += 3; } data += pitch - width * 3; } while (--i); } else { do { end = p + width; while (p != end) { *p++ = swap_blue_red ? RGB(data[2 * pitch], data[1 * pitch], data[0]) : RGB(data[0], data[1 * pitch], data[2 * pitch]); data += 1; } data += (pitch - width) + (pitch * 2); } while (--i); } pixmap = XCreatePixmap(display, main_window.window, width, height, default_depth); img = XCreateImage(display, CopyFromParent, default_depth, ZPixmap, 0, (char *)rgbx, width, height, 32, 0); legc = XCreateGC(display, pixmap, 0, NULL); XPutImage(display, pixmap, legc, img, 0, 0, 0, 0, width, height); XRenderPictureAttributes attr = {.component_alpha = 1 }; picture = XRenderCreatePicture(display, pixmap, XRenderFindStandardFormat(display, PictStandardRGB24), CPComponentAlpha, &attr); free(rgbx); } XFreeGC(display, legc); XFreePixmap(display, pixmap); return picture; } GLYPH *font_getglyph(FONT *f, uint32_t ch) { uint32_t hash = ch % 128; GLYPH * g = f->glyphs[hash], *s = g; if (g) { while (g->ucs4 != ~0u) { if (g->ucs4 == ch) { return g; } g++; } if (!FcCharSetHasChar(charset, ch)) { return NULL; } uint32_t count = (uint32_t)(g - s); g = realloc(s, (count + 2) * sizeof(GLYPH)); if (!g) { return NULL; } f->glyphs[hash] = g; g += count; } else { if (!FcCharSetHasChar(charset, ch)) { return NULL; } g = malloc(sizeof(GLYPH) * 2); if (!g) { return NULL; } f->glyphs[hash] = g; } // return FcCharSetHasChar (pub->charset, ucs4); FONT_INFO *i = f->info; while (i->face) { if (FcCharSetHasChar(i->cs, ch)) { break; } i++; } if (!i->face) { uint32_t count = (uint32_t)(i - f->info); i = realloc(f->info, (count + 2) * sizeof(FONT_INFO)); if (!i) { return NULL; } f->info = i; i += count; i[1].face = NULL; int j; for (j = 0; j != fs->nfont; j++) { FcCharSet *cs; FcPatternGetCharSet(fs->fonts[j], FC_CHARSET, 0, &cs); if (FcCharSetHasChar(cs, ch)) { FcPattern *p = FcPatternDuplicate(fs->fonts[j]); double size; if (!FcPatternGetDouble(f->pattern, FC_PIXEL_SIZE, 0, &size)) { FcPatternAddDouble(p, FC_PIXEL_SIZE, size); } font_info_open(i, p); FcPatternDestroy(p); break; } } if (!i->face) { // something went wrong LOG_TRACE("Freetype", "???" ); return NULL; } } int lcd_filter = FC_LCD_DEFAULT; FcPatternGetInteger(f->pattern, FC_LCD_FILTER, 0, &lcd_filter); FT_Library_SetLcdFilter(ftlib, lcd_filter); int ft_flags = FT_LOAD_DEFAULT; int ft_render_flags = FT_RENDER_MODE_NORMAL; bool hinting = 1, antialias = 1, vertical_layout = 0, autohint = 0; FcPatternGetBool(f->pattern, FC_HINTING, 0, (int *)&hinting); FcPatternGetBool(f->pattern, FC_ANTIALIAS, 0, (int *)&antialias); FcPatternGetBool(f->pattern, FC_VERTICAL_LAYOUT, 0, (int *)&vertical_layout); FcPatternGetBool(f->pattern, FC_AUTOHINT, 0, (int *)&autohint); int hint_style = FC_HINT_FULL; FcPatternGetInteger(f->pattern, FC_HINT_STYLE, 0, (int *)&hint_style); // int weight; // FcPatternGetInteger(f->pattern, FC_WEIGHT, 0, (int *)&weight); int subpixel = FC_RGBA_NONE; FcPatternGetInteger(f->pattern, FC_RGBA, 0, (int *)&subpixel); bool no_subpixel = (subpixel == FC_RGBA_NONE); bool vert = ft_vert; if (no_subpixel) { ft_render_flags = FT_RENDER_MODE_NORMAL; } else { ft_render_flags |= (vert ? FT_RENDER_MODE_LCD_V : FT_RENDER_MODE_LCD); } if (antialias) { if (hint_style == FC_HINT_NONE) { ft_flags |= FT_LOAD_NO_HINTING; } else if (hint_style == FC_HINT_SLIGHT) { ft_flags |= FT_LOAD_TARGET_LIGHT; } else if (hint_style == FC_HINT_FULL && !no_subpixel) { ft_flags |= (vert ? FT_LOAD_TARGET_LCD_V : FT_LOAD_TARGET_LCD); } else { ft_flags |= FT_LOAD_TARGET_NORMAL; } } else { ft_flags |= FT_LOAD_TARGET_MONO; ft_render_flags = FT_RENDER_MODE_NORMAL; } if (vertical_layout) ft_flags |= FT_LOAD_VERTICAL_LAYOUT; if (autohint) ft_flags |= FT_LOAD_FORCE_AUTOHINT; g[1].ucs4 = ~0; FT_Load_Char(i->face, ch, ft_flags); FT_Render_Glyph(i->face->glyph, ft_render_flags); FT_GlyphSlotRec *p = i->face->glyph; g->ucs4 = ch; g->x = p->bitmap_left; g->y = PIXELS(i->face->size->metrics.ascender) - p->bitmap_top; g->height = p->bitmap.rows; g->xadvance = (p->advance.x + (1 << 5)) >> 6; if (p->bitmap.pixel_mode == FT_PIXEL_MODE_MONO) { unsigned int r, x; uint8_t * mybuf = malloc(p->bitmap.width * g->height); uint8_t * sline = p->bitmap.buffer, *dest = mybuf; g->width = p->bitmap.width; for (r = 0; r < g->height; r++, sline += p->bitmap.pitch) { for (x = 0; x < g->width; x++, dest++) { *dest = (sline[(x >> 3)] & (0x80 >> (x & 7))) * 0xff; } } free(p->bitmap.buffer); p->bitmap.buffer = mybuf; no_subpixel = 1; } else if (p->bitmap.pixel_mode == FT_PIXEL_MODE_GRAY) { g->width = p->bitmap.width; no_subpixel = 1; } else if (p->bitmap.pixel_mode == FT_PIXEL_MODE_LCD) { g->width = p->bitmap.width / 3; no_subpixel = 0; vert = 0; } else if (p->bitmap.pixel_mode == FT_PIXEL_MODE_LCD_V) { g->width = p->bitmap.width; g->height = p->bitmap.rows / 3; no_subpixel = 0; vert = 1; } else { g->width = p->bitmap.width; no_subpixel = 0; } // LOG_TRACE("Freetype", "%u %u %u %u %C" , PIXELS(i->face->size->metrics.height), g->width, g->height, p->bitmap.pitch, ch); g->pic = loadglyphpic(p->bitmap.buffer, g->width, g->height, p->bitmap.pitch, no_subpixel, vert, ft_swap_blue_red); return g; } void initfonts(void) { if (!FcInit()) { // error LOG_ERR("Freetype", "FcInit failed."); } FT_Init_FreeType(&ftlib); FcResult result; FcPattern *pat = FcPatternCreate(); FcPatternAddString(pat, FC_FAMILY, (uint8_t *)UTOX_FONT_XLIB); FcConfigSubstitute(0, pat, FcMatchPattern); FcDefaultSubstitute(pat); fs = FcFontSort(NULL, pat, 0, &charset, &result); FcPatternDestroy(pat); } /*static void default_sub(FcPattern *pattern) { //this is actually mostly useless //FcValue v; //double dpi; //FcPatternAddBool (pattern, XFT_RENDER, XftDefaultGetBool (dpy, XFT_RENDER, screen, XftDefaultHasRender (dpy))); FcPatternAddBool (pattern, FC_ANTIALIAS, True); FcPatternAddBool (pattern, FC_EMBOLDEN, False); FcPatternAddBool (pattern, FC_HINTING, True); FcPatternAddInteger (pattern, FC_HINT_STYLE, FC_HINT_FULL); FcPatternAddBool (pattern, FC_AUTOHINT, False); int subpixel = FC_RGBA_UNKNOWN; //if (XftDefaultHasRender (dpy)) { int render_order = XRenderQuerySubpixelOrder (display, screen); switch (render_order) { default: case SubPixelUnknown: subpixel = FC_RGBA_UNKNOWN; break; case SubPixelHorizontalRGB: subpixel = FC_RGBA_RGB; break; case SubPixelHorizontalBGR: subpixel = FC_RGBA_BGR; break; case SubPixelVerticalRGB: subpixel = FC_RGBA_VRGB; break; case SubPixelVerticalBGR: subpixel = FC_RGBA_VBGR; break; case SubPixelNone: subpixel = FC_RGBA_NONE; break; } } FcPatternAddInteger (pattern, FC_RGBA, subpixel); FcPatternAddInteger (pattern, FC_LCD_FILTER, FC_LCD_DEFAULT); FcPatternAddBool (pattern, FC_MINSPACE, False); //dpi = (((double) DisplayHeight (dpy, screen) * 25.4) / (double) DisplayHeightMM (dpy, screen)); //FcPatternAddDouble (pattern, FC_DPI, dpi); FcPatternAddDouble (pattern, FC_SCALE, 1.0); //FcPatternAddInteger (pattern, XFT_MAX_GLYPH_MEMORY, XftDefaultGetInteger (dpy, XFT_MAX_GLYPH_MEMORY, screen, XFT_FONT_MAX_GLYPH_MEMORY)); FcDefaultSubstitute (pattern); }*/ static void font_info_open(FONT_INFO *i, FcPattern *pattern) { uint8_t * filename; int id = 0; double size; FcMatrix *font_matrix; /*FT_Matrix matrix = { .xx = 0x10000, .xy = 0, .yx = 0, .yy = 0x10000, };*/ FcPatternGetString(pattern, FC_FILE, 0, &filename); FcPatternGetInteger(pattern, FC_INDEX, 0, &id); FcPatternGetCharSet(pattern, FC_CHARSET, 0, &i->cs); if (FcPatternGetMatrix(pattern, FC_MATRIX, 0, &font_matrix) == FcResultMatch) { LOG_TRACE("Freetype", "has a matrix" ); } FcPatternGetDouble(pattern, FC_PIXEL_SIZE, 0, &size); int ft_error = FT_New_Face(ftlib, (char *)filename, id, &i->face); if (ft_error != 0) { LOG_TRACE("Freetype", "Freetype error %u %s %i" , ft_error, filename, id); return; } ft_error = FT_Set_Char_Size(i->face, (size * 64.0 + 0.5), (size * 64.0 + 0.5), 0, 0); if (ft_error != 0) { LOG_TRACE("Freetype", "Freetype error %u %lf" , ft_error, size); return; } // LOG_TRACE("Freetype", "Loaded font %s %u %i %i" , filename, id, PIXELS(i->face->ascender), PIXELS(i->face->descender)); } static bool font_open(FONT *a_font, ...) { /* add error checks */ va_list va; FcPattern *pat; FcPattern *match; FcResult result; va_start(va, a_font); pat = FcPatternVaBuild(NULL, va); va_end(va); FcConfigSubstitute(NULL, pat, FcMatchPattern); // default_sub(pat); match = FcFontMatch(NULL, pat, &result); FcPatternDestroy(pat); a_font->info = malloc(sizeof(FONT_INFO) * 2); font_info_open(a_font->info, match); a_font->pattern = match; a_font->info[1].face = NULL; return true; } void loadfonts(void) { int render_order = XRenderQuerySubpixelOrder(display, def_screen_num); if (render_order == SubPixelHorizontalBGR || render_order == SubPixelVerticalBGR) { ft_swap_blue_red = 1; LOG_TRACE("Freetype", "ft_swap_blue_red" ); } if (render_order == SubPixelVerticalBGR || render_order == SubPixelVerticalRGB) { ft_vert = 1; LOG_TRACE("Freetype", "ft_vert" ); } font_open(&font[FONT_TEXT], FC_FAMILY, FcTypeString, UTOX_FONT_XLIB, FC_PIXEL_SIZE, FcTypeDouble, UI_FSCALE(12.0), FC_WEIGHT, FcTypeInteger, FC_WEIGHT_NORMAL, FC_SLANT, FcTypeInteger, FC_SLANT_ROMAN, NULL); font_open(&font[FONT_TITLE], FC_FAMILY, FcTypeString, UTOX_FONT_XLIB, FC_PIXEL_SIZE, FcTypeDouble, UI_FSCALE(12.0), FC_WEIGHT, FcTypeInteger, FC_WEIGHT_BOLD, NULL); font_open(&font[FONT_SELF_NAME], FC_FAMILY, FcTypeString, UTOX_FONT_XLIB, FC_PIXEL_SIZE, FcTypeDouble, UI_FSCALE(14.0), FC_WEIGHT, FcTypeInteger, FC_WEIGHT_BOLD, NULL); font_open(&font[FONT_STATUS], FC_FAMILY, FcTypeString, UTOX_FONT_XLIB, FC_PIXEL_SIZE, FcTypeDouble, UI_FSCALE(11.0), FC_WEIGHT, FcTypeInteger, FC_WEIGHT_NORMAL, FC_SLANT, FcTypeInteger, FC_SLANT_ROMAN, NULL); font_open(&font[FONT_LIST_NAME], FC_FAMILY, FcTypeString, UTOX_FONT_XLIB, FC_PIXEL_SIZE, FcTypeDouble, UI_FSCALE(12.0), FC_WEIGHT, FcTypeInteger, FC_WEIGHT_NORMAL, FC_SLANT, FcTypeInteger, FC_SLANT_ROMAN, NULL); // font_open(&font[FONT_MSG], FC_FAMILY, FcTypeString, UTOX_FONT_XLIB, FC_PIXEL_SIZE, FcTypeDouble, UI_FSCALE(11.0), // FC_WEIGHT, FcTypeInteger, FC_WEIGHT_LIGHT, NULL); // font_open(&font[FONT_MSG_NAME], FC_FAMILY, FcTypeString, UTOX_FONT_XLIB, FC_PIXEL_SIZE, FcTypeDouble, UI_FSCALE(10.0), // FC_WEIGHT, FcTypeInteger, FC_WEIGHT_LIGHT, NULL); font_open(&font[FONT_MISC], FC_FAMILY, FcTypeString, UTOX_FONT_XLIB, FC_PIXEL_SIZE, FcTypeDouble, UI_FSCALE(10.0), FC_WEIGHT, FcTypeInteger, FC_WEIGHT_NORMAL, FC_SLANT, FcTypeInteger, FC_SLANT_ROMAN, NULL); // font_open(&font[FONT_MSG_LINK], FC_FAMILY, FcTypeString, UTOX_FONT_XLIB, FC_PIXEL_SIZE, FcTypeDouble, UI_FSCALE(11.0), // FC_WEIGHT, FcTypeInteger, FC_WEIGHT_LIGHT, NULL); } void freefonts(void) { for (size_t i = 0; i < COUNTOF(font); i++) { FONT *f = &font[i]; if (f->pattern) { FcPatternDestroy(f->pattern); } if (f->info) { FONT_INFO *fi = f->info; while (fi->face) { FT_Done_Face(fi->face); fi++; } free(f->info); } for (size_t j = 0; j < COUNTOF(f->glyphs); j++) { GLYPH *g = f->glyphs[j]; if (g) { while (g->ucs4 != ~0u) { if (g->pic) { XRenderFreePicture(display, g->pic); } g++; } free(f->glyphs[j]); f->glyphs[j] = NULL; } } } } uTox/src/xlib/filesys.c0000600000175000001440000002007714003056216014053 0ustar rakusers#include "main.h" #include "gtk.h" #include "../chatlog.h" #include "../debug.h" #include "../file_transfers.h" #include "../filesys.h" #include "../friend.h" #include "../settings.h" #include "../tox.h" #include #include #include #if 0 // commented because this function is deprecated, but I'm not ready to delete all this code yet /** Takes data from µTox and saves it, just how the OS likes it saved! */ size_t native_save_data(const uint8_t *name, size_t name_length, const uint8_t *data, size_t length, bool append) { char path[UTOX_FILE_NAME_LENGTH] = { 0 }; char atomic_path[UTOX_FILE_NAME_LENGTH] = { 0 }; FILE *file; size_t offset = 0; if (settings.portable_mode) { snprintf(path, UTOX_FILE_NAME_LENGTH, "./tox/"); } else { snprintf(path, UTOX_FILE_NAME_LENGTH, "%s/.config/tox/", getenv("HOME")); } mkdir(path, 0700); snprintf(path + strlen(path), UTOX_FILE_NAME_LENGTH - strlen(path), "%s", name); if (append) { file = fopen(path, "ab"); } else { if (strlen(path) + name_length >= UTOX_FILE_NAME_LENGTH - strlen(".atomic")) { LOG_TRACE("Filesys", "Save directory name too long" ); return 0; } else { snprintf(atomic_path, UTOX_FILE_NAME_LENGTH, "%s.atomic", path); } file = fopen(atomic_path, "wb"); } if (file) { offset = ftello(file); fwrite(data, length, 1, file); fclose(file); if (append) { return offset; } if (rename(atomic_path, path)) { /* Consider backing up this file instead of overwriting it. */ LOG_TRACE("Filesys", "%sUnable to move file!" , atomic_path); return 0; } return 1; } else { LOG_TRACE("Filesys", "Unable to open %s to write save" , path); return 0; } return 0; } #endif /** Takes data from µTox and loads it up! */ uint8_t *native_load_data(const uint8_t *name, size_t name_length, size_t *out_size) { char path[UTOX_FILE_NAME_LENGTH] = { 0 }; if (settings.portable_mode) { snprintf((char *)path, UTOX_FILE_NAME_LENGTH, "./tox/"); } else { snprintf((char *)path, UTOX_FILE_NAME_LENGTH, "%s/.config/tox/", getenv("HOME")); } if (strlen(path) + name_length >= UTOX_FILE_NAME_LENGTH) { LOG_TRACE("Filesys", "Load directory name too long" ); return 0; } else { snprintf(path + strlen(path), UTOX_FILE_NAME_LENGTH - strlen(path), "%s", name); } FILE *file = fopen(path, "rb"); if (!file) { // LOG_TRACE("Filesys", "Unable to open/read %s" , path); if (out_size) { *out_size = 0; } return NULL; } fseek(file, 0, SEEK_END); size_t size = ftell(file); uint8_t *data = calloc(size + 1, 1); // needed for the ending null byte if (!data) { fclose(file); if (out_size) { *out_size = 0; } return NULL; } else { fseek(file, 0, SEEK_SET); if (fread(data, size, 1, file) != 1) { LOG_TRACE("Filesys", "Read error on %s" , path); fclose(file); free(data); if (out_size) { *out_size = 0; } return NULL; } fclose(file); } if (out_size) { *out_size = size; } return data; } void native_export_chatlog_init(uint32_t friend_number) { if (libgtk) { ugtk_save_chatlog(friend_number); } else { char name[TOX_MAX_NAME_LENGTH + sizeof(".txt")]; FRIEND *f = get_friend(friend_number); if (!f) { LOG_ERR("Filesys", "Could not get friend with number: %u", friend_number); return; } snprintf((char *)name, sizeof(name), "%.*s.txt", (int)f->name_length, f->name); FILE *file = fopen((char *)name, "wb"); if (file) { utox_export_chatlog(get_friend(friend_number)->id_str, file); } } } bool native_remove_file(const uint8_t *name, size_t length, bool portable_mode) { char path[UTOX_FILE_NAME_LENGTH] = { 0 }; if (portable_mode) { snprintf((char *)path, UTOX_FILE_NAME_LENGTH, "./tox/"); } else { snprintf((char *)path, UTOX_FILE_NAME_LENGTH, "%s/.config/tox/", getenv("HOME")); } if (strlen((const char *)path) + length >= UTOX_FILE_NAME_LENGTH) { LOG_DEBUG("Filesys", "File/directory name too long, unable to remove" ); return false; } else { snprintf((char *)path + strlen((const char *)path), UTOX_FILE_NAME_LENGTH - strlen((const char *)path), "%.*s", (int)length, (char *)name); } if (remove((const char *)path)) { LOG_ERR("NATIVE", "Unable to delete file!\n\t\t%s" , path); return false; } else { LOG_INFO("NATIVE", "File deleted!" ); LOG_DEBUG("Filesys", "\t%s" , path); } return true; } void native_select_dir_ft(uint32_t fid, uint32_t file_number, FILE_TRANSFER *file) { if (libgtk) { ugtk_native_select_dir_ft(fid, file); } else { // fall back to working dir char *path = malloc(file->name_length + 1); memcpy(path, file->name, file->name_length); path[file->name_length] = 0; postmessage_toxcore(TOX_FILE_ACCEPT, fid, file_number, path); } } void native_autoselect_dir_ft(uint32_t fid, FILE_TRANSFER *file) { if (file == NULL){ LOG_TRACE("Native", " file is null." ); return; } uint8_t *path = malloc(file->name_length + 1); if (path == NULL) { LOG_ERR("Native", "Could not allocate memory."); return; } if (settings.portable_mode) { snprintf((char *)path, UTOX_FILE_NAME_LENGTH, "./tox/Tox_Auto_Accept/"); native_create_dir(path); snprintf((char *)path, UTOX_FILE_NAME_LENGTH, "./tox/Tox_Auto_Accept/%.*s", (int)file->name_length, file->name); } else { memcpy(path, file->name, file->name_length); path[file->name_length] = 0; } LOG_NOTE("Native", "Auto Accept Directory: \"%s\"" , path); postmessage_toxcore(TOX_FILE_ACCEPT, fid, file->file_number, path); } // TODO: This function has the worst name. void file_save_inline_image_png(MSG_HEADER *msg) { if (libgtk) { ugtk_file_save_inline(msg); } else { // fall back to working dir inline.png FILE *fp = fopen("inline.png", "wb"); if (fp) { fwrite(msg->via.ft.data, 1, msg->via.ft.data_size, fp); fclose(fp); snprintf((char *)msg->via.ft.path, UTOX_FILE_NAME_LENGTH, "inline.png"); msg->via.ft.inline_png = false; } } } bool native_save_image_png(char *name, uint8_t *image, int image_size) { if (libgtk) { FILE_IMAGE *file_image = calloc(1, sizeof(FILE_IMAGE)); if (!file_image) { LOG_ERR("Native", "Could not allocate memory."); return false; } file_image->name = name; file_image->data = image; file_image->data_size = image_size; ugtk_file_save_image_png(file_image); return true; } char path[TOX_MAX_NAME_LENGTH + sizeof(".png")] = { 0 }; snprintf(path, sizeof(path), "%s.png", name); FILE *file = fopen(path, "wb"); if (!file) { LOG_ERR("Native", "Could not open file %s for write.", path); return false; } fwrite(image, image_size, 1, file); fclose(file); return true; } int file_lock(FILE *file, uint64_t start, size_t length) { struct flock fl; fl.l_type = F_WRLCK; fl.l_whence = SEEK_SET; fl.l_start = start; fl.l_len = length; int result = fcntl(fileno(file), F_SETLK, &fl); if (result == -1) { return 0; } return 1; } int file_unlock(FILE *file, uint64_t start, size_t length) { struct flock fl; fl.l_type = F_UNLCK; fl.l_whence = SEEK_SET; fl.l_start = start; fl.l_len = length; int result = fcntl(fileno(file), F_SETLK, &fl); if (result == -1) { return 0; } return 1; } uTox/src/xlib/event.c0000600000175000001440000006173614003056216013525 0ustar rakusers#include "main.h" #include "screen_grab.h" #include "tray.h" #include "window.h" #include "../debug.h" #include "../flist.h" #include "../friend.h" #include "../macros.h" #include "../notify.h" #include "../self.h" #include "../settings.h" #include "../tox.h" #include "../ui.h" #include "../utox.h" #include "../av/utox_av.h" #include "../native/clipboard.h" #include "../native/keyboard.h" #include "../native/notify.h" #include "../native/ui.h" #include "../ui/draw.h" // Needed for enddraw. This should probably be changed. #include "../ui/edit.h" #include "../ui/button.h" #include "keysym2ucs.h" #include #include #include #include "../layout/friend.h" #include "../layout/group.h" #include "../layout/settings.h" #include "../layout/sidebar.h" #include "stb.h" extern XIC xic; bool have_focus = false; static void mouse_move(XMotionEvent *event, UTOX_WINDOW *window) { if (pointergrab) { // TODO super globals are bad mm'kay? GRAB_POS grab = grab_pos(); XDrawRectangle(display, RootWindow(display, def_screen_num), scr_grab_window.gc, MIN(grab.dn_x, grab.up_x), MIN(grab.dn_y, grab.up_y), grab.dn_x < grab.up_x ? grab.up_x - grab.dn_x : grab.dn_x - grab.up_x, grab.dn_y < grab.up_y ? grab.up_y - grab.dn_y : grab.dn_y - grab.up_y); grab_up(event->x_root, event->y_root); grab = grab_pos(); XDrawRectangle(display, RootWindow(display, def_screen_num), scr_grab_window.gc, MIN(grab.dn_x, grab.up_x), MIN(grab.dn_y, grab.up_y), grab.dn_x < grab.up_x ? grab.up_x - grab.dn_x : grab.dn_x - grab.up_x, grab.dn_y < grab.up_y ? grab.up_y - grab.dn_y : grab.dn_y - grab.up_y); return; } static int mx, my; int dx, dy; dx = event->x - mx; dy = event->y - my; mx = event->x; my = event->y; cursor = CURSOR_NONE; panel_mmove(window->_.panel, 0, 0, window->_.w, window->_.h, event->x, event->y, dx, dy); XDefineCursor(display, window->window, cursors[cursor]); // uncomment this to log mouse movements. Commented because it spams too much //LOG_TRACE("XLIB", "MotionEvent: (%u %u) %u", event->x, event->y, event->state); } static void mouse_down(XButtonEvent *event, UTOX_WINDOW *window) { switch (event->button) { case Button1: { if (pointergrab) { grab_up(event->x_root, event->y_root); grab_dn(event->x_root, event->y_root); return; } // todo: better double/triple click detect static Time lastclick, lastclick2; panel_mmove(window->_.panel, 0, 0, window->_.w, window->_.h, event->x, event->y, 0, 0); panel_mdown(window->_.panel); if (event->time - lastclick < 300) { bool triclick = (event->time - lastclick2 < 600); panel_dclick(window->_.panel, triclick); if (triclick) { lastclick = 0; } } lastclick2 = lastclick; lastclick = event->time; break; } case Button2: { pasteprimary(); break; } case Button3: { if (pointergrab) { XUngrabPointer(display, CurrentTime); pointergrab = 0; break; } panel_mright(window->_.panel); break; } case Button4: { // TODO: determine precise deltas if possible panel_mwheel(window->_.panel, 0, 0, window->_.w, window->_.h, 1.0, 0); break; } case Button5: { // TODO: determine precise deltas if possible panel_mwheel(window->_.panel, 0, 0, window->_.w, window->_.h, -1.0, 0); break; } } LOG_TRACE("XLIB", "ButtonEvent: %u %u", event->state, event->button); } static void mouse_up(XButtonEvent *event, UTOX_WINDOW *window) { switch (event->button) { case Button1: { if (pointergrab) { XUngrabPointer(display, CurrentTime); GRAB_POS grab = grab_pos(); if (grab.dn_x < grab.up_x) { grab.up_x -= grab.dn_x; } else { int w = grab.dn_x - grab.up_x; grab.dn_x = grab.up_x; grab.up_x = w; } if (grab.dn_y < grab.up_y) { grab.up_y -= grab.dn_y; } else { int w = grab.dn_y - grab.up_y; grab.dn_y = grab.up_y; grab.up_y = w; } /* enforce min size */ if (grab.up_x * grab.up_y < 100) { pointergrab = 0; break; } XDrawRectangle(display, RootWindow(display, def_screen_num), scr_grab_window.gc, grab.dn_x, grab.dn_y, grab.up_x, grab.up_y); if (pointergrab == 1) { FRIEND *f = flist_get_sel_friend(); if (f && f->online) { XImage *img = XGetImage(display, RootWindow(display, def_screen_num), grab.dn_x, grab.dn_y, grab.up_x, grab.up_y, XAllPlanes(), ZPixmap); if (img) { uint8_t * temp, *p; uint32_t *pp = (void *)img->data, *end = &pp[img->width * img->height]; p = temp = malloc(img->width * img->height * 3); while (pp != end) { uint32_t i = *pp++; *p++ = i >> 16; *p++ = i >> 8; *p++ = i; } int size = -1; uint8_t *out = stbi_write_png_to_mem(temp, 0, img->width, img->height, 3, &size); free(temp); uint16_t w = img->width; uint16_t h = img->height; NATIVE_IMAGE *image = malloc(sizeof(NATIVE_IMAGE)); image->rgb = ximage_to_picture(img, NULL); image->alpha = None; friend_sendimage(f, image, w, h, (UTOX_IMAGE)out, size); } } } else { postmessage_utoxav(UTOXAV_SET_VIDEO_IN, 1, 0, NULL); } pointergrab = 0; } else { panel_mup(window->_.panel); } break; } } LOG_TRACE("XLIB", "ButtonEvent: %u %u", event->state, event->button); } // Should return false if the result of the action should close/exit the window. static bool popup_event(XEvent *event, UTOX_WINDOW *win) { switch (event->type) { case Expose: { LOG_TRACE("XLIB", "Main window expose"); native_window_set_target(win); panel_draw(win->_.panel , 0, 0, win->_.w, win->_.h); XCopyArea(display, win->drawbuf, win->window, win->gc, 0, 0, win->_.w, win->_.h, 0, 0); break; } case ClientMessage: { /* This could be noop code, I'm not convinced we need to support _NET_WM_PING but * in case we do, we already have the response ready. */ Atom ping = XInternAtom(display, "_NET_WM_PING", 0); if ((Atom)event->xclient.data.l[0] == ping) { LOG_TRACE("XLIB", "ping"); event->xany.window = root_window; XSendEvent(display, root_window, False, NoEventMask, event); } else { LOG_TRACE("XLIB", "not ping"); } break; } case MotionNotify: { mouse_move(&event->xmotion, win); break; } case ButtonPress: { mouse_down(&event->xbutton, win); break; } case ButtonRelease: { mouse_up(&event->xbutton, win); break; } case EnterNotify: { LOG_TRACE("XLIB", "set focus"); window_set_focus(win); break; } case LeaveNotify: { break; } default: { LOG_WARN("XLIB", "other event: %u", event->type); break; } } return true; } bool doevent(XEvent *event) { if (XFilterEvent(event, None)) { return true; } if (event->xany.window && event->xany.window != main_window.window) { if (native_window_find_notify(&event->xany.window)) { // TODO perhaps we should roll this into one? return popup_event(event, native_window_find_notify(&event->xany.window)); // return true; } if (tray_window_event(event)) { return true; } if (event->type == ClientMessage) { XClientMessageEvent *ev = &event->xclient; if ((Atom)event->xclient.data.l[0] == wm_delete_window) { uint32_t r = find_video_windows(ev->window); if (r == UINT32_MAX) { return true; } postmessage_utoxav(UTOXAV_STOP_VIDEO, r, (r == UINT16_MAX), NULL); } } return true; } switch (event->type) { case Expose: { enddraw(0, 0, settings.window_width, settings.window_height); break; } case FocusIn: { if (xic) { XSetICFocus(xic); } #ifdef UNITY if (unity_running) { mm_rm_entry(NULL); } #endif have_focus = true; XWMHints hints = { 0, 0, 0, 0, 0, 0, 0, 0, 0 }; XSetWMHints(display, main_window.window, &hints); break; } case FocusOut: { if (xic) { XUnsetICFocus(xic); } #ifdef UNITY if (unity_running) { mm_save_cid(); } #endif have_focus = false; break; } case ConfigureNotify: { XConfigureEvent *ev = &event->xconfigure; main_window._.x = ev->x; main_window._.y = ev->y; if (settings.window_width != (unsigned)ev->width || settings.window_height != (unsigned)ev->height) { // Resize XFreePixmap(display, main_window.drawbuf); main_window.drawbuf = XCreatePixmap(display, main_window.window, ev->width + 10, ev->height + 10, default_depth); XRenderFreePicture(display, main_window.renderpic); main_window.renderpic = XRenderCreatePicture(display, main_window.drawbuf, main_window.pictformat, 0, NULL); main_window._.w = settings.window_width = ev->width; main_window._.h = settings.window_height = ev->height; ui_size(settings.window_width, settings.window_height); redraw(); } break; } case LeaveNotify: { ui_mouseleave(); break; } case MotionNotify: { mouse_move(&event->xmotion, &main_window); break; } case ButtonPress: { mouse_down(&event->xbutton, &main_window); break; } case ButtonRelease: { mouse_up(&event->xbutton, &main_window); } case KeyRelease: { // XKeyEvent *ev = event->xkey; // KeySym sym = XLookupKeysym(ev, 0); break; } case KeyPress: { XKeyEvent *ev = &event->xkey; KeySym sym = XLookupKeysym(ev, 0); // XKeycodeToKeysym(display, ev->keycode, 0) if (pointergrab && sym == XK_Escape) { XUngrabPointer(display, CurrentTime); pointergrab = 0; break; } wchar_t buffer[16]; int len; if (xic) { len = XwcLookupString(xic, ev, buffer, sizeof(buffer), &sym, NULL); } else { len = XLookupString(ev, (char *)buffer, sizeof(buffer), &sym, NULL); } if (sym == XK_ISO_Left_Tab) { // XK_ISO_Left_Tab == Shift+Tab, but we just look at whether shift is pressed sym = XK_Tab; } else if (sym >= XK_KP_0 && sym <= XK_KP_9) { // normalize keypad and non-keypad numbers sym = sym - XK_KP_0 + XK_0; } // NOTE: Don't use keys like KEY_TAB, KEY_PAGEUP, etc. from xlib/main.h here, they're // overwritten by linux header linux/input.h, so they'll be different if (ev->state & ControlMask) { if ((sym == XK_Tab && (ev->state & ShiftMask)) || sym == XK_Page_Up) { flist_previous_tab(); redraw(); break; } else if (sym == XK_Tab || sym == XK_Page_Down) { flist_next_tab(); redraw(); break; } else if (sym == XK_Home) { flist_first_tab(); redraw(); break; } else if (sym == XK_End) { flist_last_tab(); redraw(); break; } else if (sym == 'f') { edit_setfocus(&edit_search); redraw(); break; } else if (sym == 'F') { if (button_filter_friends.on_mup) { button_filter_friends.on_mup(); redraw(); break; } } } if (ev->state & ControlMask || ev->state & Mod1Mask) { // Mod1Mask == alt if (sym >= XK_1 && sym <= XK_9) { flist_selectchat(sym - XK_1); redraw(); break; } else if (sym == XK_0) { flist_selectchat(9); redraw(); break; } } if (!edit_active()) { if (messages_char(sym)) { redraw(); break; } if (ev->state & ControlMask) { if (sym == 'c' || sym == 'C') { if (flist_get_sel_friend()) { clipboard.len = messages_selection(&messages_friend, clipboard.data, sizeof(clipboard.data), 0); } else if (flist_get_sel_group()) { clipboard.len = messages_selection(&messages_group, clipboard.data, sizeof(clipboard.data), 0); } setclipboard(); break; } } /* Focus message input field if ctrl isn't pressed, * to make sure you can still copy text from the chat log */ if (sym != XK_Control_L) { edit_setfocus(&edit_chat_msg_friend); edit_char(KEY_END, 1, 0); } } if (edit_active()) { if (sym == XK_Escape) { edit_resetfocus(); redraw(); break; } if (ev->state & ControlMask) { switch (sym) { case 'v': case 'V': paste(); return true; case 'c': case 'C': case XK_Insert: copy(0); return true; case 'x': case 'X': copy(0); edit_char(KEY_DEL, 1, 0); return true; case 'w': case 'W': /* Sent ctrl + backspace to active edit */ edit_char(KEY_BACK, 1, 4); return true; } } if (ev->state & ShiftMask) { switch (sym) { case XK_Insert: paste(); return true; case XK_Delete: copy(0); edit_char(KEY_DEL, 1, 0); return true; } } if (sym == XK_KP_Enter) { sym = XK_Return; } if (sym == XK_Return && (ev->state & ShiftMask)) { edit_char('\n', 0, 0); break; } if (sym == XK_KP_Space) { sym = XK_space; } if (sym >= XK_KP_Home && sym <= XK_KP_Begin) { sym -= 0x45; } if (sym >= XK_KP_Multiply && sym <= XK_KP_Equal) { sym -= 0xFF80; } if (!sym) { int i; for (i = 0; i < len; i++) edit_char(buffer[i], (ev->state & ControlMask) != 0, ev->state); } uint32_t key = keysym2ucs(sym); if (key != ~0u) { edit_char(key, (ev->state & ControlMask) != 0, ev->state); } else { edit_char(sym, 1, ev->state); } } break; } case SelectionNotify: { LOG_NOTE("XLib Event", "SelectionNotify" ); XSelectionEvent *ev = &event->xselection; if (ev->property == None) { break; } Atom type; int format; void *data; long unsigned int len, bytes_left; XGetWindowProperty(display, main_window.window, ev->property, 0, ~0L, True, AnyPropertyType, &type, &format, &len, &bytes_left, (unsigned char **)&data); if (!data) { break; } LOG_INFO("Event", "Type: %s" , XGetAtomName(ev->display, type)); LOG_INFO("Event", "Property: %s" , XGetAtomName(ev->display, ev->property)); if (ev->property == XA_ATOM) { pastebestformat((Atom *)data, len, ev->selection); } else if (ev->property == XdndDATA) { FRIEND *f = flist_get_sel_friend(); if (!f) { LOG_ERR("Event", "Could not get selected friend."); return false; } char *path = calloc(len + 1, 1); formaturilist(path, (char *)data, len); postmessage_toxcore(TOX_FILE_SEND_NEW, f->number, 0xFFFF, path); } else if (type == XA_INCR) { if (pastebuf.data) { /* already pasting something, give up on that */ free(pastebuf.data); pastebuf.data = NULL; } pastebuf.len = *(unsigned long *)data; pastebuf.left = pastebuf.len; pastebuf.data = malloc(pastebuf.len); /* Deleting the window property triggers incremental paste */ } else { LOG_ERR("XLib Event", "Type %s || Prop %s ", XGetAtomName(ev->display, type), XGetAtomName(ev->display, ev->property)); pastedata(data, type, len, ev->selection == XA_PRIMARY); } XFree(data); break; } case SelectionRequest: { XSelectionRequestEvent *ev = &event->xselectionrequest; XEvent resp = { .xselection = { .type = SelectionNotify, .property = ev->property, .requestor = ev->requestor, .selection = ev->selection, .target = ev->target, .time = ev->time } }; if (ev->target == XA_UTF8_STRING || ev->target == XA_STRING) { if (ev->selection == XA_PRIMARY) { XChangeProperty(display, ev->requestor, ev->property, ev->target, 8, PropModeReplace, (const unsigned char *)primary.data, primary.len); } else { XChangeProperty(display, ev->requestor, ev->property, ev->target, 8, PropModeReplace, (const unsigned char *)clipboard.data, clipboard.len); } } else if (ev->target == targets) { Atom supported[] = { XA_STRING, XA_UTF8_STRING }; XChangeProperty(display, ev->requestor, ev->property, XA_ATOM, 32, PropModeReplace, (void *)&supported, COUNTOF(supported)); } else { LOG_NOTE("XLIB selection request", " unknown request"); resp.xselection.property = None; } XSendEvent(display, ev->requestor, 0, 0, &resp); break; } case PropertyNotify: { XPropertyEvent *ev = &event->xproperty; if (ev->state == PropertyNewValue && ev->atom == targets && pastebuf.data) { LOG_TRACE("Event", "Property changed: %s" , XGetAtomName(display, ev->atom)); Atom type; int format; unsigned long int len, bytes_left; void * data; XGetWindowProperty(display, main_window.window, ev->atom, 0, ~0L, True, AnyPropertyType, &type, &format, &len, &bytes_left, (unsigned char **)&data); if (len == 0) { LOG_TRACE("Event", "Got 0 length data, pasting" ); pastedata(pastebuf.data, type, pastebuf.len, False); pastebuf.data = NULL; break; } if (pastebuf.left > 0 && (unsigned)pastebuf.left < len) { pastebuf.len += len - pastebuf.left; pastebuf.data = realloc(pastebuf.data, pastebuf.len); pastebuf.left = len; } memcpy(pastebuf.data + pastebuf.len - pastebuf.left, data, len); pastebuf.left -= len; XFree(data); } break; } case ClientMessage: { XClientMessageEvent *ev = &event->xclient; if (ev->window == 0) { void *data; memcpy(&data, &ev->data.s[2], sizeof(void *)); utox_message_dispatch(ev->message_type, ev->data.s[0], ev->data.s[1], data); break; } if (ev->message_type == wm_protocols) { if ((Atom)event->xclient.data.l[0] == wm_delete_window) { if (settings.close_to_tray) { LOG_TRACE("Event", "Closing to tray." ); togglehide(); } else { return false; } } break; } if (ev->message_type == XdndEnter) { LOG_TRACE("Event", "enter" ); } else if (ev->message_type == XdndPosition) { Window src = ev->data.l[0]; XEvent reply_event = {.xclient = {.type = ClientMessage, .display = display, .window = src, .message_type = XdndStatus, .format = 32, .data = {.l = { main_window.window, 1, 0, 0, XdndActionCopy } } } }; XSendEvent(display, src, 0, 0, &reply_event); // LOG_TRACE("Event", "position (version=%u)" , ev->data.l[1] >> 24); } else if (ev->message_type == XdndStatus) { LOG_TRACE("Event", "status" ); } else if (ev->message_type == XdndDrop) { XConvertSelection(display, XdndSelection, XA_STRING, XdndDATA, main_window.window, CurrentTime); LOG_NOTE("XLIB", "Drag was dropped"); } else if (ev->message_type == XdndLeave) { LOG_TRACE("Event", "leave" ); } else { LOG_TRACE("Event", "dragshit" ); } break; } } return true; } uTox/src/xlib/drawing.c0000600000175000001440000001405714003056216014031 0ustar rakusers#include "../ui/draw.h" #include "freetype.h" #include "main.h" #include "window.h" #include "../debug.h" #include "../text.h" #include "../ui.h" #include static uint32_t scolor; void redraw(void) { _redraw = 1; } void force_redraw(void) { XEvent ev = { .xclient = { .type = ClientMessage, .display = display, .window = curr->window, .message_type = XRedraw, .format = 8, .data = { .s = { 0, 0 } } } }; _redraw = 1; XSendEvent(display, curr->window, 0, 0, &ev); XFlush(display); } void draw_image(const NATIVE_IMAGE *image, int x, int y, uint32_t width, uint32_t height, uint32_t imgx, uint32_t imgy) { XRenderComposite(display, PictOpOver, image->rgb, image->alpha, curr->renderpic, imgx, imgy, imgx, imgy, x, y, width, height); } void draw_inline_image(uint8_t *img_data, size_t size, uint16_t w, uint16_t h, int x, int y) { if (!curr->visual) { LOG_ERR("Xlib drawing", "Could not draw inline image"); return; } const uint8_t *rgba_data = img_data; // we don't need to free this, that's done by XDestroyImage() uint8_t *out = malloc(size); uint32_t *target; for (uint32_t i = 0; i < size; i += 4) { // colors are read into red, blue and green and written into the target pointer const uint8_t red = (rgba_data + i)[0] & 0xFF; const uint8_t green = (rgba_data + i)[1] & 0xFF; const uint8_t blue = (rgba_data + i)[2] & 0xFF; target = (uint32_t *)(out + i); *target = (red | (red << 8) | (red << 16) | (red << 24)) & curr->visual->red_mask; *target |= (blue | (blue << 8) | (blue << 16) | (blue << 24)) & curr->visual->blue_mask; *target |= (green | (green << 8) | (green << 16) | (green << 24)) & curr->visual->green_mask; } XImage *img = XCreateImage(display, curr->visual, default_depth, ZPixmap, 0, (char *)out, w, h, 32, w * 4); Picture rgb = ximage_to_picture(img, NULL); // 4 bpp -> RGBA Picture alpha = None; NATIVE_IMAGE *image = malloc(sizeof(NATIVE_IMAGE)); image->rgb = rgb; image->alpha = alpha; XDestroyImage(img); draw_image(image, x, y, w, h, 0, 0); free(image); } void drawalpha(int bm, int x, int y, int width, int height, uint32_t color) { XRenderColor xrcolor = {.red = ((color >> 8) & 0xFF00) | 0x80, .green = ((color)&0xFF00) | 0x80, .blue = ((color << 8) & 0xFF00) | 0x80, .alpha = 0xFFFF }; Picture src = XRenderCreateSolidFill(display, &xrcolor); XRenderComposite(display, PictOpOver, src, bitmap[bm], curr->renderpic, 0, 0, 0, 0, x, y, width, height); XRenderFreePicture(display, src); } static int _drawtext(int x, int xmax, int y, const char *str, uint16_t length) { GLYPH * g; uint8_t len; uint32_t ch; while (length) { len = utf8_len_read(str, &ch); str += len; length -= len; g = font_getglyph(sfont, ch); if (g) { if (x + g->xadvance + SCALE(10) > xmax && length) { return -x; } if (g->pic) { XRenderComposite(display, PictOpOver, curr->colorpic, g->pic, curr->renderpic, 0, 0, 0, 0, x + g->x, y + g->y, g->width, g->height); } x += g->xadvance; } } return x; } // Needs to be included after ../ui/draw.h #include "../shared/freetype-text.c" void draw_rect_frame(int x, int y, int width, int height, uint32_t color) { XSetForeground(display, curr->gc, color); XDrawRectangle(display, curr->drawbuf, curr->gc, x, y, width - 1, height - 1); } void drawrect(int x, int y, int right, int bottom, uint32_t color) { XSetForeground(display, curr->gc, color); XFillRectangle(display, curr->drawbuf, curr->gc, x, y, right - x, bottom - y); } void draw_rect_fill(int x, int y, int width, int height, uint32_t color) { XSetForeground(display, curr->gc, color); XFillRectangle(display, curr->drawbuf, curr->gc, x, y, width, height); } void drawhline(int x, int y, int x2, uint32_t color) { XSetForeground(display, curr->gc, color); XDrawLine(display, curr->drawbuf, curr->gc, x, y, x2, y); } void drawvline(int x, int y, int y2, uint32_t color) { XSetForeground(display, curr->gc, color); XDrawLine(display, curr->drawbuf, curr->gc, x, y, x, y2); } uint32_t setcolor(uint32_t color) { XRenderColor xrcolor; xrcolor.red = ((color >> 8) & 0xFF00) | 0x80; xrcolor.green = ((color)&0xFF00) | 0x80; xrcolor.blue = ((color << 8) & 0xFF00) | 0x80; xrcolor.alpha = 0xFFFF; XRenderFreePicture(display, curr->colorpic); curr->colorpic = XRenderCreateSolidFill(display, &xrcolor); uint32_t old = scolor; scolor = color; // xftcolor.pixel = color; XSetForeground(display, curr->gc, color); return old; } static XRectangle clip[16]; static int clipk; void pushclip(int left, int top, int width, int height) { if (!clipk) { // XSetClipMask(display, curr->gc, curr->drawbuf); } XRectangle *r = &clip[clipk++]; r->x = left; r->y = top; r->width = width; r->height = height; XSetClipRectangles(display, curr->gc, 0, 0, r, 1, Unsorted); XRenderSetPictureClipRectangles(display, curr->renderpic, 0, 0, r, 1); } void popclip(void) { clipk--; if (!clipk) { XSetClipMask(display, curr->gc, None); XRenderPictureAttributes pa; pa.clip_mask = None; XRenderChangePicture(display, curr->renderpic, CPClipMask, &pa); return; } XRectangle *r = &clip[clipk - 1]; XSetClipRectangles(display, curr->gc, 0, 0, r, 1, Unsorted); XRenderSetPictureClipRectangles(display, curr->renderpic, 0, 0, r, 1); } void enddraw(int x, int y, int width, int height) { XCopyArea(display, curr->drawbuf, curr->window, curr->gc, x, y, width, height, x, y); } uTox/src/xlib/dbus.h0000600000175000001440000000026714003056216013336 0ustar rakusers/* dbus.h */ #ifndef uDBUS_H #define uDBUS_H #ifdef HAVE_DBUS #include void dbus_notify(char *title, char *content, uint8_t *cid); #endif // HAVE_DBUS #endif // uDBUS_H uTox/src/xlib/dbus.c0000600000175000001440000000776214003056216013340 0ustar rakusers#ifdef HAVE_DBUS #include "dbus.h" #include "../debug.h" #include "../macros.h" #include "../text.h" #include #include #include #define NOTIFY_OBJECT "/org/freedesktop/Notifications" #define NOTIFY_INTERFACE "org.freedesktop.Notifications" static sig_atomic_t done; static int notify_build_message(DBusMessage *notify_msg, char *title, char *content, uint8_t *UNUSED(cid)) { DBusMessageIter args[4]; char * app_name = "uTox"; uint32_t replaces_id = -1; char * app_icon = ""; int32_t timeout = 5000; dbus_bool_t m = 0; char * key = "foo"; int value = 42; /* TODO we can use dbus to show the notifying users avatar, we don't do so anymore because the directory/save * functions were changed */ dbus_message_iter_init_append(notify_msg, &args[0]); m |= dbus_message_iter_append_basic(&args[0], DBUS_TYPE_STRING, &app_name); m |= dbus_message_iter_append_basic(&args[0], DBUS_TYPE_UINT32, &replaces_id); m |= dbus_message_iter_append_basic(&args[0], DBUS_TYPE_STRING, &app_icon); m |= dbus_message_iter_append_basic(&args[0], DBUS_TYPE_STRING, &title); m |= dbus_message_iter_append_basic(&args[0], DBUS_TYPE_STRING, &content); m |= dbus_message_iter_open_container(&args[0], DBUS_TYPE_ARRAY, DBUS_TYPE_STRING_AS_STRING, &args[1]); /*for (i = 0; array[i]; i++ ) m |= dbus_message_iter_append_basic(&args[1], DBUS_TYPE_STRING, &array[i]);*/ m |= dbus_message_iter_close_container(&args[0], &args[1]); m |= dbus_message_iter_open_container(&args[0], DBUS_TYPE_ARRAY, "{sv}", &args[1]); /* usually {sv} for dictionaries */ m |= dbus_message_iter_open_container(&args[1], DBUS_TYPE_DICT_ENTRY, NULL, &args[2]); m |= dbus_message_iter_append_basic(&args[2], DBUS_TYPE_STRING, &key); m |= dbus_message_iter_open_container(&args[2], DBUS_TYPE_VARIANT, DBUS_TYPE_INT32_AS_STRING, &args[3]); m |= dbus_message_iter_append_basic(&args[3], DBUS_TYPE_INT32, &value); m |= dbus_message_iter_close_container(&args[2], &args[3]); m |= dbus_message_iter_close_container(&args[1], &args[2]); m |= dbus_message_iter_close_container(&args[0], &args[1]); m |= dbus_message_iter_append_basic(&args[0], DBUS_TYPE_INT32, &timeout); return m; } static void notify_callback(DBusPendingCall *UNUSED(pending), void *UNUSED(user_data)) { done = 1; } void dbus_notify(char *title, char *content, uint8_t *cid) { DBusMessage * msg; DBusConnection * conn; DBusError err; DBusPendingCall *pending; dbus_error_init(&err); conn = dbus_bus_get(DBUS_BUS_SESSION, &err); if (dbus_error_is_set(&err)) { LOG_ERR("Dbus", "Connection Error (%s)\n", err.message); dbus_error_free(&err); } if (!conn) { return; } msg = dbus_message_new_method_call(NULL, NOTIFY_OBJECT, NOTIFY_INTERFACE, "Notify"); if (!msg) { // fprintf(stderr, "Message Null\n"); // exit(1); return; } dbus_message_set_auto_start(msg, TRUE); dbus_message_set_destination(msg, NOTIFY_INTERFACE); /* append arguments UINT32 org.freedesktop.Notifications.Notify (STRING app_name, UINT32 replaces_id, STRING app_icon, STRING summary, STRING body, ARRAY actions, DICT hints, INT32 expire_timeout); */ if (!notify_build_message(msg, title, content, cid)) { // fprintf(stderr, "Out Of Memory!\n"); return; } dbus_error_init(&err); if (!dbus_connection_send_with_reply(conn, msg, &pending, -1)) { LOG_FATAL_ERR(EXIT_FAILURE, "Dbus", "Sending failed!"); } if (!dbus_pending_call_set_notify(pending, ¬ify_callback, NULL, NULL)) { // fprintf(stderr, "Callback failed!"); return; } while (!done) { dbus_connection_read_write_dispatch(conn, -1); } dbus_message_unref(msg); dbus_connection_unref(conn); return; } #endif uTox/src/xlib/audio.c0000600000175000001440000000040114003056216013463 0ustar rakusers#include "../macros.h" #include #include void audio_detect(void) {} bool audio_init(void *UNUSED(handle)) { return 0; } bool audio_close(void *UNUSED(handle)) { return 0; } bool audio_frame(int16_t *UNUSED(buffer)) { return 0; } uTox/src/xlib/CMakeLists.txt0000600000175000001440000001071014003056216014762 0ustar rakusersproject(utoxNATIVE LANGUAGES C) option(ENABLE_DBUS "Compile with dbus notification support" ON) if(ENABLE_DBUS) find_package(DBus REQUIRED) include_directories(${DBUS_INCLUDE_DIRS}) add_cflag("-DHAVE_DBUS=1") endif() ######################################### ## Native Icon data ######################################### add_custom_command(OUTPUT icon.o COMMAND cd ${uTox_SOURCE_DIR}/ && ld -r -b binary -o ${utoxNATIVE_BINARY_DIR}/icon.o icons/utox-128x128.png DEPENDS ../../icons/utox-128x128.png ) set_source_files_properties( icon.o PROPERTIES EXTERNAL_OBJECT true GENERATED true ) add_library(icon STATIC icon.o) set_target_properties( icon PROPERTIES LINKER_LANGUAGE C ) ######################################### ## Native Interface ######################################### add_library(utoxNATIVE STATIC audio.c $<$:dbus.c> drawing.c event.c filesys.c freetype.c gtk.c main.c $<$:mmenu.c> screen_grab.c tray.c v4l.c video.c window.c ../posix/filesys.c ) find_package(Freetype REQUIRED) include_directories(${FREETYPE_INCLUDE_DIRS}) message("Found Freetype version ${FREETYPE_VERSION_STRING}") message("Freetype include: ${FREETYPE_INCLUDE_DIRS}") message("Freetype library: ${FREETYPE_LIBRARIES}") find_package(libfontconfig REQUIRED) include_directories("${LIBFONTCONFIG_INCLUDE_DIRS}") message("FontConfig include: ${LIBFONTCONFIG_INCLUDE_DIRS}") message("FontConfig library: ${LIBFONTCONFIG_LIBRARIES}") message("X include: ${X11_INCLUDE_DIR}") message("X library: ${X11_LIBRARIES}") message("Xrender include: ${X11_Xrender_INCLUDE_PATH}") message("Xrender library: ${X11_Xrender_LIB}") find_package(libv4lconvert REQUIRED) include_directories("${LIBV4LCONVERT_INCLUDE_DIRS}") message("V4Lconvert include: ${LIBV4LCONVERT_INCLUDE_DIRS}") message("V4Lconvert library: ${LIBV4LCONVERT_LIBRARIES}") if(ENABLE_DBUS AND DBUS_LIBRARIES) message("DBus include: ${DBUS_INCLUDE_DIRS}") message("DBus library: ${DBUS_LIBRARIES}") else() set(DBUS_LIBRARIES "") endif() target_link_libraries(utoxNATIVE PUBLIC icon ${LIBV4LCONVERT_LIBRARIES} ${LIBFONTCONFIG_LIBRARIES} ${X11_LIBRARIES} ${X11_Xrender_LIB} ${FREETYPE_LIBRARIES} ${DBUS_LIBRARIES} PRIVATE stb ) if(LINUX OR NETBSD) target_link_libraries(utoxNATIVE PUBLIC resolv ) endif() if(LINUX) target_link_libraries(utoxNATIVE PUBLIC dl ) endif() include(GNUInstallDirs) install(FILES ../utox.desktop DESTINATION "${CMAKE_INSTALL_DATAROOTDIR}/applications" ) install(FILES ../../man/utox.1 DESTINATION "${CMAKE_INSTALL_MANDIR}/man1" ) install(FILES ../../icons/utox-14x14.png DESTINATION "${CMAKE_INSTALL_DATAROOTDIR}/icons/hicolor/14x14/apps" ) install(FILES ../../icons/utox-16x16.png DESTINATION "${CMAKE_INSTALL_DATAROOTDIR}/icons/hicolor/16x16/apps" ) install(FILES ../../icons/utox-22x22.png DESTINATION "${CMAKE_INSTALL_DATAROOTDIR}/icons/hicolor/22x22/apps" ) install(FILES ../../icons/utox-24x24.png DESTINATION "${CMAKE_INSTALL_DATAROOTDIR}/icons/hicolor/24x24/apps" ) install(FILES ../../icons/utox-32x32.png DESTINATION "${CMAKE_INSTALL_DATAROOTDIR}/icons/hicolor/32x32/apps" ) install(FILES ../../icons/utox-36x36.png DESTINATION "${CMAKE_INSTALL_DATAROOTDIR}/icons/hicolor/36x36/apps" ) install(FILES ../../icons/utox-48x48.png DESTINATION "${CMAKE_INSTALL_DATAROOTDIR}/icons/hicolor/48x48/apps" ) install(FILES ../../icons/utox-64x64.png DESTINATION "${CMAKE_INSTALL_DATAROOTDIR}/icons/hicolor/64x64/apps" ) install(FILES ../../icons/utox-72x72.png DESTINATION "${CMAKE_INSTALL_DATAROOTDIR}/icons/hicolor/72x72/apps" ) install(FILES ../../icons/utox-96x96.png DESTINATION "${CMAKE_INSTALL_DATAROOTDIR}/icons/hicolor/96x96/apps" ) install(FILES ../../icons/utox-128x128.png DESTINATION "${CMAKE_INSTALL_DATAROOTDIR}/icons/hicolor/128x128/apps" ) install(FILES ../../icons/utox-256x256.png DESTINATION "${CMAKE_INSTALL_DATAROOTDIR}/icons/hicolor/256x256/apps" ) install(FILES ../../icons/utox-512x512.png DESTINATION "${CMAKE_INSTALL_DATAROOTDIR}/icons/hicolor/512x512/apps" ) install(FILES ../../icons/utox.svg DESTINATION "${CMAKE_INSTALL_DATAROOTDIR}/icons/hicolor/scalable/apps" ) uTox/src/windows/0000700000175000001440000000000014003056216012755 5ustar rakusersuTox/src/windows/window.h0000600000175000001440000000051114003056216014434 0ustar rakusers#ifndef WIN_WINDOW_H #define WIN_WINDOW_H #include "../native/window.h" #include struct native_window { struct utox_window _; HWND window; HDC window_DC; HDC draw_DC; HDC mem_DC; HBITMAP draw_BM; }; extern UTOX_WINDOW main_window; extern HINSTANCE curr_instance; #endif uTox/src/windows/window.c0000600000175000001440000001036214003056216014434 0ustar rakusers#include "window.h" #include "main.h" #include "notify.h" #include "events.h" #include "../branding.h" #include "../debug.h" #include "../macros.h" #include "../ui.h" #include #include static HWND l_main; HINSTANCE curr_instance; UTOX_WINDOW main_window; void native_window_init(HINSTANCE instance) { static const wchar_t main_classname[] = L"uTox"; curr_instance = instance; black_icon = LoadIcon(curr_instance, MAKEINTRESOURCE(101)); unread_messages_icon = LoadIcon(curr_instance, MAKEINTRESOURCE(102)); WNDCLASSW main_window_class = { .style = CS_OWNDC | CS_DBLCLKS, .lpfnWndProc = WindowProc, .hInstance = instance, .hIcon = black_icon, .lpszClassName = main_classname, }; RegisterClassW(&main_window_class); } void native_window_raze(UTOX_WINDOW *UNUSED(window)) { } static bool update_DC_BM(UTOX_WINDOW *win, int w, int h) { win->window_DC = GetDC(win->window); win->draw_DC = CreateCompatibleDC(win->window_DC); win->mem_DC = CreateCompatibleDC(win->draw_DC); win->draw_BM = CreateCompatibleBitmap(win->window_DC, w, h); return true; } UTOX_WINDOW *native_window_create_main(int x, int y, int w, int h) { static const wchar_t class[] = L"uTox"; char pretitle[128]; snprintf(pretitle, 128, "%s %s (version : %s)", TITLE, SUB_TITLE, VERSION); size_t title_size = strlen(pretitle) + 1; wchar_t title[title_size]; mbstowcs(title, pretitle, title_size); main_window.window = CreateWindowExW(0, class, title, WS_OVERLAPPEDWINDOW, x, y, w, h, NULL, NULL, NULL, NULL); // We may need to do this after MW_CREATE is called update_DC_BM(&main_window, w, h); return &main_window; } HWND native_window_create_video(int x, int y, int w, int h) { LOG_DEBUG("Windows WM", "Creating video window"); wchar_t title[128]; // %S for single-byte char, non-standard behaviour swprintf(title, 128, L"%S", S(WINDOW_TITLE_VIDEO_PREVIEW)); HWND win = CreateWindowExW(0, L"uTox", title, WS_OVERLAPPEDWINDOW, x, y, w, h, NULL, NULL, curr_instance, NULL); if (!win) { LOG_ERR("Windows WM", "ERROR trying to create video window"); LOG_ERR("debug", "%u", GetLastError()); } return win; } UTOX_WINDOW *popup = NULL; UTOX_WINDOW *native_window_create_notify(int x, int y, int w, int h, PANEL *panel) { static uint16_t notification_number = 0; static wchar_t class_name[] = L"uTox Notification"; HICON notify_black_icon = LoadIcon(curr_instance, MAKEINTRESOURCE(101)); WNDCLASSW notify_window_class = { .style = CS_DBLCLKS, .lpfnWndProc = notify_msg_sys, .hInstance = curr_instance, .hIcon = notify_black_icon, .lpszClassName = class_name, .hbrBackground = (HBRUSH)GetStockObject(BLACK_BRUSH), }; RegisterClassW(¬ify_window_class); char pre[128]; snprintf(pre, 128, "uTox popup window %u", notification_number++); size_t title_size = strlen(pre) + 1; wchar_t title[title_size]; mbstowcs(title, pre, title_size); HWND window = CreateWindowExW(WS_EX_TOPMOST | WS_EX_TOOLWINDOW, class_name, title, WS_POPUP, x, y, w, h, l_main, NULL, NULL, NULL); if (!popup) { popup = calloc(1, sizeof(UTOX_WINDOW)); // FIXME leaks if (!popup) { LOG_ERR("Windows Wind", "NativeWindow:\tUnable to alloc to create window container"); return NULL; } } popup->window = window; update_DC_BM(popup, w, h); // In case we even need to raise this window to the top most z position. // SetWindowPos(window, HWND_TOPMOST, 0, 0, 0, 0, SWP_NOMOVE | SWP_NOSIZE | SWP_NOACTIVATE); ShowWindow(window, SW_SHOWNOACTIVATE); popup->_.panel = panel; return popup; } UTOX_WINDOW *native_window_find_notify(void *window) { UTOX_WINDOW *win = popup; while (win) { if (win->window == *(HWND *)window) { return win; } win = win->_.next; } return NULL; } void native_window_create_screen_select(void) { return; } void native_window_tween(UTOX_WINDOW *UNUSED(win)) { return; } uTox/src/windows/video.c0000600000175000001440000000335614003056216014240 0ustar rakusers#include "main.h" #include "../debug.h" void video_frame(uint16_t id, uint8_t *img_data, uint16_t width, uint16_t height, bool resize) { if (!img_data) { LOG_DEBUG("Windows Video", "Received a null frame. Skipping..."); return; } HWND *hwin; if (id >= UINT16_MAX) { hwin = &preview_hwnd; } else { hwin = &video_hwnd[id]; } if (!hwin || !*hwin) { LOG_ERR("Windows Video", "frame for null window [%u]", id); return; } if (resize) { RECT r = {.left = 0, .top = 0, .right = width, .bottom = height }; AdjustWindowRect(&r, WS_OVERLAPPEDWINDOW, 0); int w, h; w = r.right - r.left; h = r.bottom - r.top; if (w > GetSystemMetrics(SM_CXSCREEN)) { w = GetSystemMetrics(SM_CXSCREEN); } if (h > GetSystemMetrics(SM_CYSCREEN)) { h = GetSystemMetrics(SM_CYSCREEN); } SetWindowPos(*hwin, 0, 0, 0, w, h, SWP_NOZORDER | SWP_NOMOVE); } BITMAPINFO bmi = {.bmiHeader = { .biSize = sizeof(BITMAPINFOHEADER), .biWidth = width, .biHeight = -height, .biPlanes = 1, .biBitCount = 32, .biCompression = BI_RGB, } }; RECT r = { 0, 0, 0, 0 }; GetClientRect(*hwin, &r); HDC dc = GetDC(*hwin); if (width == r.right && height == r.bottom) { SetDIBitsToDevice(dc, 0, 0, width, height, 0, 0, 0, height, img_data, &bmi, DIB_RGB_COLORS); } else { StretchDIBits(dc, 0, 0, r.right, r.bottom, 0, 0, width, height, img_data, &bmi, DIB_RGB_COLORS, SRCCOPY); } } uTox/src/windows/utox.rc0000600000175000001440000000160014003056216014301 0ustar rakusers101 ICON "../../icons/icon.ico" 102 ICON "../../icons/icon_unread.ico" #if defined __WIN32__ || defined _WIN32 || defined __CYGWIN__ #include #endif #include "../branding.h" VS_VERSION_INFO VERSIONINFO FILEVERSION VER_MAJOR,VER_MINOR,VER_PATCH PRODUCTVERSION VER_MAJOR,VER_MINOR,VER_PATCH BEGIN BLOCK "StringFileInfo" BEGIN BLOCK "040904E4" BEGIN VALUE "CompanyName", TITLE VALUE "FileDescription", UTOX_FILE_DESCRIPTION VALUE "FileVersion", VERSION VALUE "InternalName", TITLE VALUE "LegalCopyright", UTOX_COPYRIGHT VALUE "OriginalFilename", UTOX_FILENAME_WINDOWS VALUE "ProductName", TITLE VALUE "ProductVersion", VERSION END END BLOCK "VarFileInfo" BEGIN VALUE "Translation", 0x0800, 1200 END ENDuTox/src/windows/utf8.h0000600000175000001440000000216314003056216014020 0ustar rakusers#ifndef WIN_UTF8_H #define WIN_UTF8_H #include #include #include // TODO: Maybe this should be a more generic text-util Windows header. /** Translate a char* from UTF-8 encoding to OS native; * This function could compromise the security of application. Use it properly. * * Accepts char pointer, native array pointer, length of input; * Returns: number of chars written, or 0 on failure. * */ int utf8tonative(const char *str, wchar_t *out, int length); int utf8_to_nativestr(const char *str, wchar_t *out, int length); /** * @brief Translate a null terminated OS native string to UTF-8 char*. * This function could compromise the security of application. Use it properly. * * @param str_in native array pointer. * @param str_out char pointer. * @param size of output buffer. * */ int native_to_utf8str(const wchar_t *str_in, char *str_out, uint32_t max_size); /** * Replaces all Windows-forbidden characters in the filename with underscores. * * @param filename a null-terminated string. * @return resulted filename is valid or not. */ bool sanitize_filename(uint8_t *filename); #endif uTox/src/windows/utf8.c0000600000175000001440000000430014003056216014006 0ustar rakusers#include "utf8.h" #include int utf8tonative(const char *str, wchar_t *out, int length) { return MultiByteToWideChar(CP_UTF8, 0, (char *)str, length, out, length); } /** * Caution! * * Using the MultiByteToWideChar function incorrectly can compromise the security of your application. Calling this * function can easily cause a buffer overrun because the size of the input buffer indicated by lpMultiByteStr equals * the number of bytes in the string, while the size of the output buffer indicated by lpWideCharStr equals the number * of characters. To avoid a buffer overrun, your application must specify a buffer size appropriate for the data type * the buffer receives. * For more information, see Security Considerations: International Features. */ int utf8_to_nativestr(const char *str, wchar_t *out, int length) { /* must be null terminated string ↓ */ return MultiByteToWideChar(CP_UTF8, 0, str, -1, out, length); } /** * Caution! * * Using the WideCharToMultiByte function incorrectly can compromise the security of your application. Calling this * function can easily cause a buffer overrun because the size of the input buffer indicated by lpWideCharStr equals the * number of characters in the Unicode string, while the size of the output buffer indicated by lpMultiByteStr equals * the number of bytes. To avoid a buffer overrun, your application must specify a buffer size appropriate for the data * type the buffer receives. * Data converted from UTF-16 to non-Unicode encodings is subject to data loss, because a code page might not be able to * represent every character used in the specific Unicode data. * For more information, see Security Considerations: International Features. */ int native_to_utf8str(const wchar_t *str_in, char *str_out, uint32_t max_size) { return WideCharToMultiByte(CP_UTF8, 0, str_in, -1, str_out, max_size, NULL, NULL); } // TODO, add utf8 support bool sanitize_filename(uint8_t *filename) { for (size_t i = 0; filename[i] != '\0'; ++i) { if (filename[i] < 32) { return false; } if (strchr("<>:\"/\\|?*", filename[i])) { filename[i] = '_'; } } return true; } uTox/src/windows/screen_grab.h0000600000175000001440000000025514003056216015404 0ustar rakusers#ifndef WIN_SCREENGRAB_H #define WIN_SCREENGRAB_H #include void screen_grab_init(HINSTANCE app_instance); void native_screen_grab_desktop(bool video); #endif uTox/src/windows/screen_grab.c0000600000175000001440000001453514003056216015405 0ustar rakusers#include "main.h" #include "../debug.h" #include "../flist.h" #include "../friend.h" #include "../tox.h" #include "../av/utox_av.h" #include "stb.h" #include static HWND grab_window; static HINSTANCE grab_instance; static bool desktopgrab_video = false; // creates an UTOX_NATIVE image based on given arguments // image should be freed with image_free static NATIVE_IMAGE *create_utox_image(HBITMAP bmp, bool has_alpha, uint32_t width, uint32_t height) { NATIVE_IMAGE *image = malloc(sizeof(NATIVE_IMAGE)); if (!image) { LOG_ERR("NATIVE Screengrab", "create_utox_image:\t Could not allocate memory for image."); return NULL; } image->bitmap = bmp; image->has_alpha = has_alpha; image->width = width; image->height = height; image->scaled_width = width; image->scaled_height = height; image->stretch_mode = COLORONCOLOR; return image; } static void sendbitmap(HDC mem, HBITMAP hbm, int width, int height) { if (width == 0 || height == 0) { return; } BITMAPINFO info = { .bmiHeader = { .biSize = sizeof(BITMAPINFOHEADER), .biWidth = width, .biHeight = -height, .biPlanes = 1, .biBitCount = 24, .biCompression = BI_RGB, } }; void *bits = malloc((width + 3) * height * 3); GetDIBits(mem, hbm, 0, height, bits, &info, DIB_RGB_COLORS); uint8_t pbytes = width & 3, *p = bits, *pp = bits, *end = p + width * height * 3; // uint32_t offset = 0; while (p != end) { int i; for (i = 0; i != width; i++) { uint8_t b = pp[i * 3]; p[i * 3] = pp[i * 3 + 2]; p[i * 3 + 1] = pp[i * 3 + 1]; p[i * 3 + 2] = b; } p += width * 3; pp += width * 3 + pbytes; } int size = 0; UTOX_IMAGE out = stbi_write_png_to_mem(bits, 0, width, height, 3, &size); free(bits); NATIVE_IMAGE *image = create_utox_image(hbm, 0, width, height); friend_sendimage(flist_get_sel_friend(), image, width, height, out, size); } static LRESULT CALLBACK screen_grab_sys(HWND window, UINT msg, WPARAM wParam, LPARAM lParam) { POINT p = {.x = GET_X_LPARAM(lParam), .y = GET_Y_LPARAM(lParam) }; ClientToScreen(window, &p); static bool mdown = false; switch (msg) { case WM_MOUSEMOVE: { if (!mdown) { break; } HDC dc = GetDC(window); BitBlt(dc, video_grab_x, video_grab_y, video_grab_w - video_grab_x, video_grab_h - video_grab_y, dc, video_grab_x, video_grab_y, BLACKNESS); video_grab_w = p.x; video_grab_h = p.y; BitBlt(dc, video_grab_x, video_grab_y, video_grab_w - video_grab_x, video_grab_h - video_grab_y, dc, video_grab_x, video_grab_y, WHITENESS); ReleaseDC(window, dc); return false; } case WM_LBUTTONDOWN: { mdown = true; video_grab_x = video_grab_w = p.x; video_grab_y = video_grab_h = p.y; SetCapture(window); return false; } case WM_LBUTTONUP: { mdown = false; ReleaseCapture(); if (video_grab_x < video_grab_w) { video_grab_w -= video_grab_x; } else { const int w = video_grab_x - video_grab_w; video_grab_x = video_grab_w; video_grab_w = w; } if (video_grab_y < video_grab_h) { video_grab_h -= video_grab_y; } else { const int h = video_grab_y - video_grab_h; video_grab_y = video_grab_h; video_grab_h = h; } if (desktopgrab_video) { DestroyWindow(window); postmessage_utoxav(UTOXAV_SET_VIDEO_IN, 1, 0, NULL); } else { if (flist_get_sel_friend()) { FRIEND *f = flist_get_sel_friend(); if (f->online) { DestroyWindow(window); HWND dwnd = GetDesktopWindow(); HDC ddc = GetDC(dwnd); HDC mem = CreateCompatibleDC(ddc); HBITMAP capture = CreateCompatibleBitmap(ddc, video_grab_w, video_grab_h); SelectObject(mem, capture); BitBlt(mem, 0, 0, video_grab_w, video_grab_h, ddc, video_grab_x, video_grab_y, SRCCOPY | CAPTUREBLT); sendbitmap(mem, capture, video_grab_w, video_grab_h); ReleaseDC(dwnd, ddc); DeleteDC(mem); } } } return false; } } return DefWindowProcW(window, msg, wParam, lParam); } void screen_grab_init(HINSTANCE app_instance) { HICON screengrab_black_icon = LoadIcon(app_instance, MAKEINTRESOURCE(101)); wchar_t screen_grab_class[] = L"uToxgrab"; WNDCLASSW grab_window_class = { .hInstance = app_instance, .lpfnWndProc = screen_grab_sys, .lpszClassName = screen_grab_class, .hIcon = screengrab_black_icon, .hbrBackground = (HBRUSH)GetStockObject(BLACK_BRUSH), }; RegisterClassW(&grab_window_class); grab_instance = app_instance; } void native_screen_grab_desktop(bool video) { int x = GetSystemMetrics(SM_XVIRTUALSCREEN); int y = GetSystemMetrics(SM_YVIRTUALSCREEN); int w = GetSystemMetrics(SM_CXVIRTUALSCREEN); int h = GetSystemMetrics(SM_CYVIRTUALSCREEN); LOG_TRACE("Native Screengrab", "result: %i %i %i %i" , x, y, w, h); grab_window = CreateWindowExW(WS_EX_TOOLWINDOW | WS_EX_LAYERED, L"uToxgrab", L"Tox", WS_POPUP, x, y, w, h, NULL, NULL, grab_instance, NULL); if (!grab_window) { LOG_TRACE("Native Screengrab", "CreateWindowExW() failed" ); return; } SetLayeredWindowAttributes(grab_window, 0xFFFFFF, 128, LWA_ALPHA | LWA_COLORKEY); // UpdateLayeredWindow(main_window.window, NULL, NULL, NULL, NULL, NULL, 0xFFFFFF, ULW_ALPHA | ULW_COLORKEY); ShowWindow(grab_window, SW_SHOW); SetForegroundWindow(grab_window); desktopgrab_video = video; } uTox/src/windows/os_video.c0000600000175000001440000004306114003056216014736 0ustar rakusers#include "window.h" #include "main.h" #include "../debug.h" #include "../macros.h" #include "../av/video.h" #include "../native/time.h" #include "../../langs/i18n_decls.h" #include #ifdef __CRT__NO_INLINE #undef __CRT__NO_INLINE #include #define __CRT__NO_INLINE #else #include #endif #include // amvideo.h must be included after dshow #include #include int video_grab_x, video_grab_y, video_grab_w, video_grab_h; static IGraphBuilder * pGraph; static IBaseFilter * pGrabberF; static IMediaControl * pControl; static ISampleGrabber *pGrabber; // TODO: free resources correctly (on failure, etc) static IBaseFilter *pNullF = NULL; static IPin * pPin = NULL; static IPin * pIPin; static HWND desktopwnd; static HDC desktopdc, capturedc; static HBITMAP capturebitmap; static bool capturedesktop; static void * dibits; static uint16_t video_x, video_y; void video_begin(uint16_t id, char *UNUSED(name), uint16_t UNUSED(name_length), uint16_t width, uint16_t height) { HWND *h; if (id >= UINT16_MAX) { h = &preview_hwnd; } else { h = &video_hwnd[id]; } if (*h) { // Video already started. // TODO: We should really call this function in a smarter way. return; } RECT r = { .left = 0, .right = width, .top = 0, .bottom = height }; AdjustWindowRect(&r, WS_OVERLAPPEDWINDOW, 0); width = r.right - r.left; height = r.bottom - r.top; if (width > GetSystemMetrics(SM_CXSCREEN)) { width = GetSystemMetrics(SM_CXSCREEN); } if (height > GetSystemMetrics(SM_CYSCREEN)) { height = GetSystemMetrics(SM_CYSCREEN); } *h = native_window_create_video(0, 0, width, height); if (!*h) { LOG_ERR("Win OSVideo", "Unable to create this window w%uh%u", width, height); } ShowWindow(*h, SW_SHOW); } void video_end(uint16_t id) { if (id >= UINT16_MAX) { DestroyWindow(preview_hwnd); preview_hwnd = NULL; } else { if (video_hwnd[id]) { DestroyWindow(video_hwnd[id]); } video_hwnd[id] = NULL; } } volatile bool newframe = 0; uint8_t *frame_data; HRESULT STDMETHODCALLTYPE test_SampleCB(ISampleGrabberCB *UNUSED(lpMyObj), double UNUSED(SampleTime), IMediaSample *pSample) { // you can call functions like: // REFERENCE_TIME tStart, tStop; uint8_t *sampleBuffer; pSample->lpVtbl->GetPointer(pSample, (BYTE **)&sampleBuffer); uint16_t length = pSample->lpVtbl->GetActualDataLength(pSample); /*pSample->GetTime(&tStart, &tStop); */ if (length == video_width * video_height * 3) { uint8_t *p = frame_data + video_width * video_height * 3; for (int y = 0; y != video_height; y++) { p -= video_width * 3; memcpy(p, sampleBuffer, video_width * 3); sampleBuffer += video_width * 3; } newframe = 1; } // LOG_TRACE("Video", "frame %u" , length); return S_OK; } STDMETHODIMP test_QueryInterface(ISampleGrabberCB *UNUSED(lpMyObj), REFIID UNUSED(riid), LPVOID FAR *UNUSED(lppvObj)) { return 0; } STDMETHODIMP_(ULONG) test_AddRef(ISampleGrabberCB *UNUSED(lpMyObj)) { return 1; } STDMETHODIMP_(ULONG) test_Release(ISampleGrabberCB *lpMyObj) { free(lpMyObj->lpVtbl); free(lpMyObj); return 0; } #define SafeRelease(x) \ if (*(x)) { \ (*(x))->lpVtbl->Release(*(x)); \ } HRESULT IsPinConnected(IPin *local_pPin, BOOL *pResult) { IPin * pTmp = NULL; HRESULT hr = local_pPin->lpVtbl->ConnectedTo(local_pPin, &pTmp); if (SUCCEEDED(hr)) { *pResult = TRUE; } else if (hr == VFW_E_NOT_CONNECTED) { // The pin is not connected. This is not an error for our purposes. *pResult = FALSE; hr = S_OK; } SafeRelease(&pTmp); return hr; } HRESULT IsPinDirection(IPin *local_pPin, PIN_DIRECTION dir, BOOL *pResult) { PIN_DIRECTION pinDir; HRESULT hr = local_pPin->lpVtbl->QueryDirection(local_pPin, &pinDir); if (SUCCEEDED(hr)) { *pResult = (pinDir == dir); } return hr; } HRESULT MatchPin(IPin *local_pPin, PIN_DIRECTION direction, BOOL bShouldBeConnected, BOOL *pResult) { // assert(pResult != NULL); BOOL bMatch = FALSE; BOOL bIsConnected = FALSE; HRESULT hr = IsPinConnected(local_pPin, &bIsConnected); if (SUCCEEDED(hr)) { if (bIsConnected == bShouldBeConnected) { hr = IsPinDirection(local_pPin, direction, &bMatch); } } if (SUCCEEDED(hr)) { *pResult = bMatch; } return hr; } HRESULT FindUnconnectedPin(IBaseFilter *pFilter, PIN_DIRECTION PinDir, IPin **ppPin) { IEnumPins *pEnum = NULL; IPin * local_pPin = NULL; BOOL bFound = FALSE; HRESULT hr = pFilter->lpVtbl->EnumPins(pFilter, &pEnum); if (FAILED(hr)) { goto done; } while (S_OK == pEnum->lpVtbl->Next(pEnum, 1, &local_pPin, NULL)) { hr = MatchPin(local_pPin, PinDir, FALSE, &bFound); if (FAILED(hr)) { goto done; } if (bFound) { *ppPin = local_pPin; (*ppPin)->lpVtbl->AddRef(*ppPin); break; } SafeRelease(&local_pPin); } if (!bFound) { hr = VFW_E_NOT_FOUND; } done: SafeRelease(&local_pPin); SafeRelease(&pEnum); return hr; } IPin *ConnectFilters2(IGraphBuilder *_pGraph, IPin *pOut, IBaseFilter *pDest) { IPin *pIn = NULL; // Find an input pin on the downstream filter. HRESULT hr = FindUnconnectedPin(pDest, PINDIR_INPUT, &pIn); if (SUCCEEDED(hr)) { // Try to connect them. hr = pGraph->lpVtbl->Connect(_pGraph, pOut, pIn); pIn->lpVtbl->Release(pIn); } return SUCCEEDED(hr) ? pIn : NULL; } HRESULT ConnectFilters(IGraphBuilder *_pGraph, IBaseFilter *pSrc, IBaseFilter *pDest) { IPin *pOut = NULL; // Find an output pin on the first filter. HRESULT hr = FindUnconnectedPin(pSrc, PINDIR_OUTPUT, &pOut); if (SUCCEEDED(hr)) { if (!ConnectFilters2(_pGraph, pOut, pDest)) { hr = 1; } pOut->lpVtbl->Release(pOut); } return hr; } uint16_t native_video_detect(void) { // Indicate that we support desktop capturing. utox_video_append_device((void *)1, 1, (void *)STR_VIDEO_IN_DESKTOP, 0); max_video_width = GetSystemMetrics(SM_CXVIRTUALSCREEN); max_video_height = GetSystemMetrics(SM_CYVIRTUALSCREEN); HRESULT hr; CoInitialize(NULL); IMediaEventEx *pEvent; hr = CoCreateInstance(&CLSID_FilterGraph, NULL, CLSCTX_INPROC_SERVER, &IID_IGraphBuilder, (void **)&pGraph); if (FAILED(hr)) { return 0; } hr = pGraph->lpVtbl->QueryInterface(pGraph, &IID_IMediaControl, (void **)&pControl); if (FAILED(hr)) { return 0; } hr = pGraph->lpVtbl->QueryInterface(pGraph, &IID_IMediaEventEx, (void **)&pEvent); if (FAILED(hr)) { return 0; } hr = CoCreateInstance(&CLSID_SampleGrabber, NULL, CLSCTX_INPROC_SERVER, &IID_IBaseFilter, (void **)&pGrabberF); if (FAILED(hr)) { return 0; } hr = pGraph->lpVtbl->AddFilter(pGraph, pGrabberF, L"Sample Grabber"); if (FAILED(hr)) { return 0; } hr = pGrabberF->lpVtbl->QueryInterface(pGrabberF, &IID_ISampleGrabber, (void **)&pGrabber); if (FAILED(hr)) { return 0; } AM_MEDIA_TYPE mt = { .majortype = MEDIATYPE_Video, .subtype = MEDIASUBTYPE_RGB24, }; hr = pGrabber->lpVtbl->SetMediaType(pGrabber, &mt); if (FAILED(hr)) { return 0; } ICreateDevEnum *pSysDevEnum = NULL; hr = CoCreateInstance(&CLSID_SystemDeviceEnum, NULL, CLSCTX_INPROC_SERVER, &IID_ICreateDevEnum, (void **)&pSysDevEnum); if (FAILED(hr)) { LOG_TRACE("Video", "CoCreateInstance failed()" ); return 0; } // Obtain a class enumerator for the video compressor category. IEnumMoniker *pEnumCat = NULL; hr = pSysDevEnum->lpVtbl->CreateClassEnumerator(pSysDevEnum, &CLSID_VideoInputDeviceCategory, &pEnumCat, 0); if (hr != S_OK) { pSysDevEnum->lpVtbl->Release(pSysDevEnum); LOG_TRACE("Video", "CreateClassEnumerator failed()" ); return 0; } IBaseFilter *pFilter = NULL; IMoniker * pMoniker = NULL; uint16_t device_count = 1; /* start at 1 because we support desktop grabbing */ LOG_TRACE("Video", "Windows Video Devices:" ); ULONG cFetched; while (pEnumCat->lpVtbl->Next(pEnumCat, 1, &pMoniker, &cFetched) == S_OK) { IPropertyBag *pPropBag; hr = pMoniker->lpVtbl->BindToStorage(pMoniker, 0, 0, &IID_IPropertyBag, (void **)&pPropBag); if (SUCCEEDED(hr)) { // To retrieve the filter's friendly name, do the following: VARIANT varName; VariantInit(&varName); hr = pPropBag->lpVtbl->Read(pPropBag, L"FriendlyName", &varName, 0); if (SUCCEEDED(hr)) { if (varName.vt == VT_BSTR) { LOG_TRACE("Video", "\tFriendly name: %ls" , varName.bstrVal); } else { LOG_TRACE("Video", "\tEw, got an unfriendly name" ); } // To create an instance of the filter, do the following: hr = pMoniker->lpVtbl->BindToObject(pMoniker, NULL, NULL, &IID_IBaseFilter, (void **)&pFilter); if (SUCCEEDED(hr)) { int len = wcslen(varName.bstrVal); char *data = malloc(sizeof(*pFilter) + len * 2); WideCharToMultiByte(CP_UTF8, 0, varName.bstrVal, -1, data + sizeof(*pFilter), len * 2, NULL, 0); memcpy(data, &pFilter, sizeof(pFilter)); utox_video_append_device(data, 0, data + 8, 1); device_count++; } } else { LOG_TRACE("Video", "Windows Video Code:\tcouldn't get a name for this device, this is a bug, please report!" ); } VariantClear(&varName); // Now add the filter to the graph. // Remember to release pFilter later. pPropBag->lpVtbl->Release(pPropBag); } pMoniker->lpVtbl->Release(pMoniker); } pEnumCat->lpVtbl->Release(pEnumCat); pSysDevEnum->lpVtbl->Release(pSysDevEnum); hr = CoCreateInstance(&CLSID_NullRenderer, NULL, CLSCTX_INPROC_SERVER, &IID_IBaseFilter, (void **)&pNullF); if (FAILED(hr)) { LOG_TRACE("Video", "CoCreateInstance failed" ); return 0; } hr = pGraph->lpVtbl->AddFilter(pGraph, pNullF, L"Null Filter"); if (FAILED(hr)) { LOG_TRACE("Video", "AddFilter failed" ); return 0; } hr = ConnectFilters(pGraph, pGrabberF, pNullF); if (FAILED(hr)) { LOG_TRACE("Video", "ConnectFilters (2) failed" ); return 0; } /* I think this generates and formats the call back to copy each frame from the webcam */ ISampleGrabberCB *test; test = malloc(sizeof(ISampleGrabberCB)); test->lpVtbl = malloc(sizeof(*(test->lpVtbl))); // no idea what im doing here /* Yeah, me neither... */ test->lpVtbl->QueryInterface = test_QueryInterface; test->lpVtbl->AddRef = test_AddRef; test->lpVtbl->Release = test_Release; test->lpVtbl->SampleCB = test_SampleCB; test->lpVtbl->BufferCB = 0; /* I think this sets the call back for each frame... */ hr = pGrabber->lpVtbl->SetCallback(pGrabber, test, 0); if (FAILED(hr)) { return 0; } return device_count; } bool native_video_init(void *handle) { if ((size_t)handle == 1) { video_x = video_grab_x; video_y = video_grab_y; video_width = video_grab_w; video_height = video_grab_h; if (video_width & 1) { if (video_x & 1) { video_x--; } video_width++; } if (video_width & 2) { video_width -= 2; } if (video_height & 1) { if (video_y & 1) { video_y--; } video_height++; } LOG_TRACE("Video", "size: %u %u" , video_width, video_height); desktopwnd = GetDesktopWindow(); if (!desktopwnd) { LOG_TRACE("Video", "GetDesktopWindow() failed" ); return 0; } if (!(desktopdc = GetDC(desktopwnd))) { LOG_TRACE("Video", "GetDC(desktopwnd) failed" ); return 0; } if (!(capturedc = CreateCompatibleDC(desktopdc))) { LOG_TRACE("Video", "CreateCompatibleDC(desktopdc) failed" ); return 0; } if (!(capturebitmap = CreateCompatibleBitmap(desktopdc, video_width, video_height))) { LOG_TRACE("Video", "CreateCompatibleBitmap(desktopdc) failed" ); return 0; } SelectObject(capturedc, capturebitmap); dibits = malloc(video_width * video_height * 3); capturedesktop = 1; return 1; } else { capturedesktop = 0; } HRESULT hr; IBaseFilter *pFilter = handle; hr = pGraph->lpVtbl->AddFilter(pGraph, pFilter, L"Video Capture"); if (FAILED(hr)) { LOG_TRACE("Video", "AddFilter failed" ); return 0; } IEnumPins *pEnum = NULL; /* build filter graph */ hr = pFilter->lpVtbl->EnumPins(pFilter, &pEnum); if (FAILED(hr)) { LOG_TRACE("Video", "EnumPins failed" ); return 0; } while (S_OK == pEnum->lpVtbl->Next(pEnum, 1, &pPin, NULL)) { pIPin = ConnectFilters2(pGraph, pPin, pGrabberF); SafeRelease(&pPin); if (pIPin) { break; } } if (FAILED(hr)) { LOG_TRACE("Video", "failed to connect a filter" ); return 0; } IAMStreamConfig *pConfig = NULL; AM_MEDIA_TYPE * pmt = NULL; hr = pPin->lpVtbl->QueryInterface(pPin, &IID_IAMStreamConfig, (void **)&pConfig); if (FAILED(hr)) { LOG_TRACE("Video", "Windows Video device: QueryInterface failed" ); return 0; } hr = pConfig->lpVtbl->GetFormat(pConfig, &pmt); if (FAILED(hr)) { LOG_TRACE("Video", "Windows Video device: GetFormat failed" ); return 0; } BITMAPINFOHEADER *bmiHeader; if (IsEqualGUID(&pmt->formattype, &FORMAT_VideoInfo)) { VIDEOINFOHEADER *pvi = (VIDEOINFOHEADER *)pmt->pbFormat; bmiHeader = &(pvi->bmiHeader); video_width = bmiHeader->biWidth; video_height = bmiHeader->biHeight; } else { LOG_TRACE("Video", "got bad format" ); video_width = 0; video_height = 0; } frame_data = malloc((size_t)video_width * video_height * 3); LOG_TRACE("Video", "Windows video init:\n\twidth height %u %u" , video_width, video_height); return 1; } void native_video_close(void *handle) { if ((size_t)handle == 1) { ReleaseDC(desktopwnd, desktopdc); DeleteDC(capturedc); DeleteObject(capturebitmap); free(dibits); capturedesktop = 0; return; } LOG_NOTE("Video", "Closing webcam"); IBaseFilter *pFilter = handle; if (FAILED(pGraph->lpVtbl->RemoveFilter(pGraph, pFilter))) { LOG_ERR("Video", "Failed to close webcam. (1)"); return; } if (FAILED(pGraph->lpVtbl->Disconnect(pGraph, pPin))) { LOG_ERR("Video", "Failed to close webcam. (2)"); return; } if (FAILED(pGraph->lpVtbl->Disconnect(pGraph, pIPin))) { LOG_ERR("Video", "Failed to close webcam. (3)"); return; } } int native_video_getframe(uint8_t *y, uint8_t *u, uint8_t *v, uint16_t width, uint16_t height) { if (width != video_width || height != video_height) { LOG_TRACE("Video", "width/height mismatch %u %u != %u %u" , width, height, video_width, video_height); return 0; } if (capturedesktop) { static uint64_t lasttime; uint64_t t = get_time(); if (t - lasttime >= (uint64_t)1000 * 1000 * 1000 / 24) { BITMAPINFO info = {.bmiHeader = { .biSize = sizeof(BITMAPINFOHEADER), .biWidth = video_width, .biHeight = -(int)video_height, .biPlanes = 1, .biBitCount = 24, .biCompression = BI_RGB, } }; BitBlt(capturedc, 0, 0, video_width, video_height, desktopdc, video_x, video_y, SRCCOPY | CAPTUREBLT); GetDIBits(capturedc, capturebitmap, 0, video_height, dibits, &info, DIB_RGB_COLORS); bgrtoyuv420(y, u, v, dibits, video_width, video_height); lasttime = t; return 1; } return 0; } if (newframe) { newframe = 0; bgrtoyuv420(y, u, v, frame_data, video_width, video_height); return 1; } return 0; } bool native_video_startread(void) { if (capturedesktop) { return 1; } LOG_TRACE("Video", "start webcam" ); HRESULT hr; hr = pControl->lpVtbl->Run(pControl); if (FAILED(hr)) { LOG_TRACE("Video", "Run failed" ); return 0; } return 1; } bool native_video_endread(void) { if (capturedesktop) { return 1; } LOG_TRACE("Video", "stop webcam" ); HRESULT hr; hr = pControl->lpVtbl->StopWhenReady(pControl); if (FAILED(hr)) { LOG_TRACE("Video", "Stop failed" ); return 0; } return 1; } uTox/src/windows/notify.h0000600000175000001440000000032014003056216014433 0ustar rakusers#ifndef WIN_NOTIFY_H #define WIN_NOTIFY_H #include LRESULT CALLBACK notify_msg_sys(HWND window, UINT msg, WPARAM wParam, LPARAM lParam); void native_notify_init(HINSTANCE app_instance); #endif uTox/src/windows/notify.c0000600000175000001440000001301714003056216014435 0ustar rakusers#include "notify.h" #include "main.h" #include "utf8.h" #include "window.h" #include "../debug.h" #include "../macros.h" #include "../self.h" #include "../text.h" #include "../ui.h" #include "../native/notify.h" #include "../native/window.h" #include /** * A null-terminated string that specifies a title for a balloon notification. * This title appears in a larger font immediately above the text. * It can have a maximum of 64 characters, including the terminating null character. * https://msdn.microsoft.com/en-us/library/windows/desktop/bb773352(v=vs.85).aspx */ static const uint16_t MAX_TITLE_LENGTH = 64 - 1; /** * A null-terminated string that specifies the text to display in a balloon notification. * It can have a maximum of 256 characters, including the terminating null character. * https://msdn.microsoft.com/en-us/library/windows/desktop/bb773352(v=vs.85).aspx */ static const uint16_t MAX_MSG_LENGTH = 256 - 1; bool have_focus = false; /** Creates a tray balloon popup with the message, and flashes the main window * * accepts: char *title, title length, char *msg, msg length; * returns void; */ void notify(char *title, uint16_t title_length, const char *msg, uint16_t msg_length, void *UNUSED(object), bool UNUSED(is_group)) { if (have_focus || self.status == 2) { return; } FlashWindow(main_window.window, true); flashing = true; NOTIFYICONDATAW nid = { .cbSize = sizeof(nid), .hWnd = main_window.window, .uFlags = NIF_ICON | NIF_INFO, .hIcon = unread_messages_icon, .uTimeout = 5000, .dwInfoFlags = 0, }; uint16_t title_len = safe_shrink(title, title_length, MAX_TITLE_LENGTH); utf8tonative(title, nid.szInfoTitle, title_len); uint16_t msg_len = safe_shrink(msg, msg_length, MAX_MSG_LENGTH); utf8tonative(msg, nid.szInfo, msg_len); Shell_NotifyIconW(NIM_MODIFY, &nid); } static void redraw_notify(UTOX_WINDOW *win) { LOG_TRACE("Notify", "redraw start"); native_window_set_target(win); panel_draw(win->_.panel, 0, 0, win->_.w, win->_.h); SelectObject(win->draw_DC, win->draw_BM); BitBlt(win->window_DC, win->_.x, win->_.y, win->_.w, win->_.h, win->draw_DC, win->_.x, win->_.y, SRCCOPY); LOG_TRACE("Notify", "redraw end"); } LRESULT CALLBACK notify_msg_sys(HWND window, UINT msg, WPARAM wParam, LPARAM lParam) { UTOX_WINDOW *win = native_window_find_notify(&window); static int mdown_x, mdown_y; switch (msg) { case WM_QUIT: { LOG_TRACE("Notify", "QUIT"); break; } case WM_CLOSE: { LOG_TRACE("Notify", "CLOSE"); break; } case WM_DESTROY: { LOG_TRACE("Notify", "DESTROY"); break; } case WM_GETMINMAXINFO: { LOG_TRACE("Notify", "MINMAX_INFO"); POINT min = { SCALE(200), SCALE(200) }; ((MINMAXINFO *)lParam)->ptMinTrackSize = min; break; } case WM_CREATE: { LOG_ERR("Win Notify", "NOTIFY::\tCreate"); if (win) { win->window_DC = GetDC(window); win->draw_DC = CreateCompatibleDC(win->window_DC); win->mem_DC = CreateCompatibleDC(win->draw_DC); return false; } break; } case WM_SIZE: { LOG_ERR("Win Notify", "NOTIFY::\tSize"); int w, h; w = GET_X_LPARAM(lParam); h = GET_Y_LPARAM(lParam); if (w != 0) { RECT r; GetClientRect(window, &r); w = r.right; h = r.bottom; if (win) { if (win->draw_BM) { DeleteObject(win->draw_BM); } win->draw_BM = CreateCompatibleBitmap(win->window_DC, w, h); redraw_notify(win); } } break; } case WM_ERASEBKGND: { LOG_ERR("Win Notify", "NOTIFY::\tBGND"); redraw_notify(win); return true; } case WM_PAINT: { LOG_ERR("Win Notify", "NOTIFY::\tPAINT"); PAINTSTRUCT ps; BeginPaint(window, &ps); RECT r = ps.rcPaint; BitBlt(win->window_DC, r.left, r.top, r.right - r.left, r.bottom - r.top, win->draw_DC, r.left, r.top, SRCCOPY); EndPaint(window, &ps); return false; } case WM_MOUSEMOVE: { // LOG_TRACE("Notify", "MMOVE"); return false; } case WM_LBUTTONDOWN: { mdown_x = GET_X_LPARAM(lParam); mdown_y = GET_Y_LPARAM(lParam); LOG_TRACE("Notify", "Left down %i %i", mdown_x, mdown_y); break; } case WM_LBUTTONUP: { LOG_TRACE("Notify", "Left up"); ReleaseCapture(); redraw_notify(win); break; } case WM_LBUTTONDBLCLK: { LOG_TRACE("Notify", "Dbl click, going to close"); DestroyWindow(window); break; } case WM_RBUTTONDOWN: { LOG_TRACE("Notify", "R BTN DOWN"); break; } case WM_RBUTTONUP: { LOG_TRACE("Notify", "R BTN UP"); break; } } return DefWindowProcW(window, msg, wParam, lParam); } static HINSTANCE current_instance = NULL; void native_notify_init(HINSTANCE instance) { current_instance = instance; } uTox/src/windows/main.h0000600000175000001440000000421214003056216014053 0ustar rakusers#if defined(MAIN_H) && !defined(WINDOWS_MAIN_H) #error "We should never include main from different platforms." #endif #ifndef WINDOWS_MAIN_H #define WINDOWS_MAIN_H #define MAIN_H #undef _WIN32_WINNT #define _WIN32_WINNT 0x0600 #ifndef WINVER #define WINVER 0x410 #endif #include #include #undef CLEARTYPE_QUALITY #define CLEARTYPE_QUALITY 5 #define STRSAFE_NO_DEPRECATE #include #include #define STRSAFE_NO_DEPRECATE #include #include #include #define WM_NOTIFYICON (WM_APP + 0) #define WM_TOX (WM_APP + 1) extern const CLSID CLSID_SampleGrabber; extern const CLSID CLSID_NullRenderer; enum { MENU_TEXTINPUT = 101, MENU_MESSAGES = 102, }; extern HFONT font[32]; extern HCURSOR cursors[8]; extern HICON black_icon, unread_messages_icon; extern HBRUSH hdc_brush; extern HWND video_hwnd[128]; // todo fixme extern HWND preview_hwnd; // todo fixme extern bool flashing; extern bool hidden; // internal representation of an image typedef struct native_image { HBITMAP bitmap; // 32 bit bitmap containing // red, green, blue and alpha bool has_alpha; // whether bitmap has an alpha channel // width and height in pixels of the bitmap uint32_t width, height; // width and height in pixels the image should be drawn to uint32_t scaled_width, scaled_height; // stretch mode used when stretching this image, either // COLORONCOLOR(ugly and fast), or HALFTONE(prettier and slower) int stretch_mode; } NATIVE_IMAGE; // static char save_path[280]; extern char portable_mode_save_path[MAX_PATH]; // WM_COMMAND enum { TRAY_SHOWHIDE, TRAY_EXIT, TRAY_STATUS_AVAILABLE, TRAY_STATUS_AWAY, TRAY_STATUS_BUSY, }; extern int video_grab_x, video_grab_y, video_grab_w, video_grab_h; LRESULT CALLBACK WindowProc(HWND hwnd, UINT uMsg, WPARAM wParam, LPARAM lParam); /* Included in dnd.c */ void dnd_init(HWND window); void tray_icon_init(HWND window, HICON icon); // Converts a Windows wide null-terminated string to utf8. int native_to_utf8str(const wchar_t *str_in, char *str_out, uint32_t max_size); #endif uTox/src/windows/main.c0000600000175000001440000010112114003056216014043 0ustar rakusers#include "main.h" #include "notify.h" #include "screen_grab.h" #include "utf8.h" #include "window.h" #include "../avatar.h" #include "../chatlog.h" #include "../commands.h" #include "../debug.h" #include "../file_transfers.h" #include "../filesys.h" #include "../flist.h" #include "../friend.h" #include "../macros.h" #include "../main.h" // Lots of things. :( #include "../self.h" #include "../settings.h" #include "../text.h" #include "../theme.h" #include "../tox.h" #include "../ui.h" #include "../utox.h" #include "../av/utox_av.h" #include "../native/filesys.h" #include "../native/notify.h" #include "../native/os.h" #include "../ui/draw.h" #include "../ui/edit.h" #include "../ui/svg.h" #include "../layout/background.h" // TODO do we want to remove this? #include "../layout/friend.h" #include "../layout/group.h" #include "stb.h" #include #include HFONT font[32]; HCURSOR cursors[8]; HICON black_icon, unread_messages_icon; HBRUSH hdc_brush; HWND video_hwnd[128]; // todo fixme HWND preview_hwnd; // todo fixme char portable_mode_save_path[MAX_PATH]; /** * A null-terminated string that specifies the text for a standard tooltip. * For Windows 2000 and later, szTip can have a maximum of 128 characters, * including the terminating null character. * https://msdn.microsoft.com/en-us/library/windows/desktop/bb773352(v=vs.85).aspx */ static const uint8_t MAX_TIP_LENGTH = 128 - 1; bool flashing = false; bool hidden = false; void native_export_chatlog_init(uint32_t friend_number) { FRIEND *f = get_friend(friend_number); if (!f) { LOG_ERR("Windows", "Could not get friend with number: %u", friend_number); return; } char *path = calloc(1, UTOX_FILE_NAME_LENGTH); if (!path) { LOG_ERR("Windows", "Could not allocate memory."); return; } snprintf(path, UTOX_FILE_NAME_LENGTH, "%.*s.txt", (int)f->name_length, f->name); wchar_t filepath[UTOX_FILE_NAME_LENGTH] = { 0 }; utf8_to_nativestr(path, filepath, UTOX_FILE_NAME_LENGTH * 2); OPENFILENAMEW ofn = { .lStructSize = sizeof(OPENFILENAMEW), .lpstrFilter = L".txt", .lpstrFile = filepath, .nMaxFile = UTOX_FILE_NAME_LENGTH, .Flags = OFN_EXPLORER | OFN_NOCHANGEDIR | OFN_NOREADONLYRETURN | OFN_OVERWRITEPROMPT, .lpstrDefExt = L"txt", }; if (GetSaveFileNameW(&ofn)) { path = calloc(1, UTOX_FILE_NAME_LENGTH); if (!path) { LOG_ERR("Windows", "Could not allocate memory."); return; } native_to_utf8str(filepath, path, UTOX_FILE_NAME_LENGTH); FILE *file = utox_get_file_simple(path, UTOX_FILE_OPTS_WRITE); if (file) { utox_export_chatlog(f->id_str, file); } else { LOG_ERR("Windows", "Opening file %s failed.", path); } } else { LOG_ERR("Windows", "Unable to open file and export chatlog."); } free(path); } void native_select_dir_ft(uint32_t fid, uint32_t num, FILE_TRANSFER *file) { if (!sanitize_filename(file->name)) { LOG_ERR("Windows", "Filename is invalid and could not be sanitized."); return; } wchar_t filepath[UTOX_FILE_NAME_LENGTH] = { 0 }; utf8_to_nativestr((char *)file->name, filepath, file->name_length * 2); OPENFILENAMEW ofn = { .lStructSize = sizeof(OPENFILENAMEW), .lpstrFile = filepath, .nMaxFile = UTOX_FILE_NAME_LENGTH, .Flags = OFN_EXPLORER | OFN_NOCHANGEDIR | OFN_NOREADONLYRETURN | OFN_OVERWRITEPROMPT, }; if (GetSaveFileNameW(&ofn)) { char *path = calloc(1, UTOX_FILE_NAME_LENGTH); if (!path) { LOG_ERR("Windows", "Could not allocate memory for path."); return; } native_to_utf8str(filepath, path, UTOX_FILE_NAME_LENGTH * 2); postmessage_toxcore(TOX_FILE_ACCEPT, fid, num, path); } else { LOG_ERR("Windows", "Unable to Get save file for incoming FT."); } } void native_autoselect_dir_ft(uint32_t fid, FILE_TRANSFER *file) { wchar_t *autoaccept_folder = NULL; if (settings.portable_mode) { autoaccept_folder = calloc(1, UTOX_FILE_NAME_LENGTH * sizeof(wchar_t)); utf8_to_nativestr(portable_mode_save_path, autoaccept_folder, strlen(portable_mode_save_path) * 2); } else if (SHGetKnownFolderPath((REFKNOWNFOLDERID)&FOLDERID_Downloads, KF_FLAG_CREATE, NULL, &autoaccept_folder) != S_OK) { LOG_ERR("Windows", "Unable to get auto accept file folder."); return; } wchar_t subpath[UTOX_FILE_NAME_LENGTH] = { 0 }; swprintf(subpath, UTOX_FILE_NAME_LENGTH, L"%ls%ls", autoaccept_folder, L"\\Tox_Auto_Accept"); if (settings.portable_mode) { free(autoaccept_folder); } else { CoTaskMemFree(autoaccept_folder); } CreateDirectoryW(subpath, NULL); if (!sanitize_filename(file->name)) { LOG_ERR("Windows", "Filename is invalid and could not be sanitized."); return; } wchar_t filename[UTOX_FILE_NAME_LENGTH] = { 0 }; utf8_to_nativestr((char *)file->name, filename, file->name_length * 2); wchar_t fullpath[UTOX_FILE_NAME_LENGTH] = { 0 }; swprintf(fullpath, UTOX_FILE_NAME_LENGTH, L"%ls\\%ls", subpath, filename); char *path = calloc(1, UTOX_FILE_NAME_LENGTH); if (!path) { LOG_ERR("Windows", "Could not allocate memory for path."); return; } native_to_utf8str(fullpath, path, UTOX_FILE_NAME_LENGTH); postmessage_toxcore(TOX_FILE_ACCEPT_AUTO, fid, file->file_number, path); } void launch_at_startup(bool should) { const wchar_t *run_key_path = L"Software\\Microsoft\\Windows\\CurrentVersion\\Run"; if (should) { HKEY hKey; if (RegOpenKeyW(HKEY_CURRENT_USER, run_key_path, &hKey) == ERROR_SUCCESS) { wchar_t path[UTOX_FILE_NAME_LENGTH * 2]; uint16_t path_length = GetModuleFileNameW(NULL, path + 1, UTOX_FILE_NAME_LENGTH * 2); path[0] = '\"'; path[path_length + 1] = '\"'; path[path_length + 2] = '\0'; path_length += 2; // 2 bytes per wchar_t uint16_t ret = RegSetKeyValueW(hKey, NULL, L"uTox", REG_SZ, path, path_length * 2); if (ret == ERROR_SUCCESS) { LOG_INFO("Windows", "Set uTox to run at startup."); } else { LOG_ERR("Windows", "Unable to set Registry key for startup."); } RegCloseKey(hKey); } } else { HKEY hKey; if (ERROR_SUCCESS == RegOpenKeyW(HKEY_CURRENT_USER, run_key_path, &hKey)) { uint16_t ret = RegDeleteKeyValueW(hKey, NULL, L"uTox"); if (ret == ERROR_SUCCESS) { LOG_INFO("Windows", "Set uTox to not run at startup."); } else { LOG_ERR("Windows", "Unable to delete Registry key for startup."); } RegCloseKey(hKey); } } } /** Open system file browser dialog */ void openfilesend(void) { wchar_t dir[UTOX_FILE_NAME_LENGTH]; GetCurrentDirectoryW(COUNTOF(dir), dir); wchar_t filepath[UTOX_FILE_NAME_LENGTH] = { 0 }; OPENFILENAMEW ofn = { .lStructSize = sizeof(OPENFILENAMEW), .hwndOwner = main_window.window, .lpstrFile = filepath, .nMaxFile = UTOX_FILE_NAME_LENGTH, .Flags = OFN_EXPLORER | OFN_FILEMUSTEXIST, }; if (GetOpenFileNameW(&ofn)) { FRIEND *f = flist_get_sel_friend(); if (!f) { LOG_ERR("Windows", "Unable to get friend for file send msg."); return; } UTOX_MSG_FT *msg = calloc(1, sizeof(UTOX_MSG_FT)); if (!msg) { LOG_ERR("Windows", "Unable to calloc for file send msg."); return; } char *path = calloc(1, UTOX_FILE_NAME_LENGTH); if (!path) { LOG_ERR("Windows", "Could not allocate memory for path."); return; } native_to_utf8str(filepath, path, UTOX_FILE_NAME_LENGTH); msg->file = utox_get_file_simple(path, UTOX_FILE_OPTS_READ); msg->name = (uint8_t *)path; postmessage_toxcore(TOX_FILE_SEND_NEW, f->number, 0, msg); } else { LOG_ERR("Windows", "GetOpenFileName() failed."); } SetCurrentDirectoryW(dir); } void show_messagebox(const char *caption, uint16_t caption_length, const char *message, uint16_t message_length) { wchar_t message_native[message_length]; memset(message_native, 0, message_length); utf8_to_nativestr(message, message_native, message_length * 2); wchar_t caption_native[caption_length]; memset(caption_native, 0, caption_length); utf8_to_nativestr(caption, caption_native, caption_length * 2); MessageBoxW(NULL, message ? message_native : NULL, caption ? caption_native : NULL, MB_ICONWARNING); } void openfileavatar(void) { char *filepath = calloc(1, UTOX_FILE_NAME_LENGTH); if (!filepath) { LOG_ERR("Windows", "Could not allocate memory for path."); return; } wchar_t dir[UTOX_FILE_NAME_LENGTH]; GetCurrentDirectoryW(COUNTOF(dir), dir); OPENFILENAME ofn = { .lStructSize = sizeof(OPENFILENAME), .lpstrFilter = "Supported Images\0*.GIF;*.PNG;*.JPG;*.JPEG" // TODO: add all the supported types. "All Files\0*.*\0" "GIF Files\0*.GIF\0" "PNG Files\0*.PNG\0" "JPG Files\0*.JPG;*.JPEG\0" "\0", .hwndOwner = main_window.window, .lpstrFile = filepath, .nMaxFile = UTOX_FILE_NAME_LENGTH, .Flags = OFN_EXPLORER | OFN_FILEMUSTEXIST, }; while (1) { // loop until we have a good file or the user closed the dialog if (!GetOpenFileName(&ofn)) { LOG_TRACE("Windows", "GetOpenFileName() failed when trying to grab an avatar."); break; } int width, height, bpp, size; uint8_t *file_data = stbi_load(filepath, &width, &height, &bpp, 0); uint8_t *img = stbi_write_png_to_mem(file_data, 0, width, height, bpp, &size); free(file_data); if (!img) { MessageBox(NULL, (const char *)S(CANT_FIND_FILE_OR_EMPTY), NULL, MB_ICONWARNING); continue; } if (size > UTOX_AVATAR_MAX_DATA_LENGTH) { free(img); char message[1024]; if (sizeof(message) < (unsigned)SLEN(AVATAR_TOO_LARGE_MAX_SIZE_IS) + 16) { LOG_ERR("Windows", "AVATAR_TOO_LARGE message is larger than allocated buffer(%llu bytes)\n", sizeof(message)); break; } // create message containing text that selected avatar is too large and what the max size is int len = sprintf(message, "%.*s", SLEN(AVATAR_TOO_LARGE_MAX_SIZE_IS), S(AVATAR_TOO_LARGE_MAX_SIZE_IS)); len += sprint_humanread_bytes(message + len, sizeof(message) - len, UTOX_AVATAR_MAX_DATA_LENGTH); message[len++] = '\0'; MessageBox(NULL, message, NULL, MB_ICONWARNING); continue; } postmessage_utox(SELF_AVATAR_SET, size, 0, img); break; } free(filepath); SetCurrentDirectoryW(dir); } void file_save_inline_image_png(MSG_HEADER *msg) { wchar_t filepath[UTOX_FILE_NAME_LENGTH] = { 0 }; utf8_to_nativestr((char *)msg->via.ft.name, filepath, msg->via.ft.name_length * 2); OPENFILENAMEW ofn = { .lStructSize = sizeof(OPENFILENAMEW), .hwndOwner = main_window.window, .lpstrFile = filepath, .nMaxFile = UTOX_FILE_NAME_LENGTH, .lpstrDefExt = L"png", .lpstrFilter = L"PNG Files\0*.png\0", .Flags = OFN_EXPLORER | OFN_NOCHANGEDIR | OFN_NOREADONLYRETURN | OFN_OVERWRITEPROMPT | OFN_PATHMUSTEXIST, }; if (GetSaveFileNameW(&ofn)) { char *path = calloc(1, UTOX_FILE_NAME_LENGTH); if (!path) { LOG_ERR("Windows", "Could not allocate memory for path."); return; } native_to_utf8str(filepath, path, UTOX_FILE_NAME_LENGTH); FILE *file = utox_get_file_simple(path, UTOX_FILE_OPTS_WRITE); if (file) { fwrite(msg->via.ft.data, msg->via.ft.data_size, 1, file); fclose(file); msg->via.ft.path = calloc(1, UTOX_FILE_NAME_LENGTH); if (!msg->via.ft.path) { LOG_ERR("Windows", "Could not allocate memory for path."); free(path); return; } msg->via.ft.path = (uint8_t *)strdup(path); msg->via.ft.name = basename(strdup(path)); msg->via.ft.name_length = strlen((char *)msg->via.ft.name); msg->via.ft.inline_png = false; } else { LOG_ERR("Windows", "file_save_inline_image_png:\tCouldn't open path: `%s` to save inline file.", path); } free(path); } else { LOG_ERR("Windows", "GetSaveFileName() failed"); } } bool native_save_image_png(const char *name, const uint8_t *image, const int image_size) { wchar_t filepath[UTOX_FILE_NAME_LENGTH] = { 0 }; size_t length = strlen(name); utf8_to_nativestr(name, filepath, length * 2); OPENFILENAMEW ofn = { .lStructSize = sizeof(OPENFILENAMEW), .hwndOwner = main_window.window, .lpstrFile = filepath, .nMaxFile = UTOX_FILE_NAME_LENGTH, .lpstrDefExt = L"png", .lpstrFilter = L"PNG Files\0*.png\0", .Flags = OFN_EXPLORER | OFN_NOCHANGEDIR | OFN_NOREADONLYRETURN | OFN_OVERWRITEPROMPT | OFN_PATHMUSTEXIST, }; if (GetSaveFileNameW(&ofn)) { char *path = calloc(1, UTOX_FILE_NAME_LENGTH); if (!path) { LOG_ERR("Windows", "Could not allocate memory for path."); return false; } native_to_utf8str(filepath, path, UTOX_FILE_NAME_LENGTH); FILE *file = utox_get_file_simple(path, UTOX_FILE_OPTS_WRITE); if (!file) { LOG_ERR("Windows", "Could not open file %s for write.", path); free(path); return false; } fwrite(image, image_size, 1, file); fclose(file); free(path); return true; } return false; } void postmessage_utox(UTOX_MSG msg, uint16_t param1, uint16_t param2, void *data) { PostMessage(main_window.window, WM_TOX + (msg), ((param1) << 16) | (param2), (LPARAM)data); } void init_ptt(void) { settings.push_to_talk = true; } bool check_ptt_key(void) { if (!settings.push_to_talk) { // PTT is disabled. Always send audio. return true; } if (GetAsyncKeyState(VK_LCONTROL)) { return true; } return false; } void exit_ptt(void) { settings.push_to_talk = false; } void thread(void func(void *), void *args) { _beginthread(func, 0, args); } void yieldcpu(uint32_t ms) { Sleep(ms); } uint64_t get_time(void) { return ((uint64_t)clock() * 1000 * 1000); } void setselection(char *UNUSED(data), uint16_t UNUSED(length)) { // TODO: Implement. } void copy(int value) { const uint32_t max_size = UINT16_MAX + 1; char data[max_size]; //! TODO: De-hardcode this value. memset(data, 0, sizeof(data)); int len = 0; if (edit_active()) { len = edit_copy(data, max_size - 1); data[len] = 0; } else if (flist_get_sel_friend()) { len = messages_selection(&messages_friend, data, max_size, value); } else if (flist_get_sel_group()) { len = messages_selection(&messages_group, data, max_size, value); } else { return; } HGLOBAL hMem = GlobalAlloc(GMEM_MOVEABLE, (len + 1) * 2); wchar_t *d = GlobalLock(hMem); utf8tonative(data, d, len + 1); // because data is nullterminated GlobalUnlock(hMem); OpenClipboard(main_window.window); EmptyClipboard(); SetClipboardData(CF_UNICODETEXT, hMem); CloseClipboard(); } /* TODO DRY, this exists in screen_grab.c */ static NATIVE_IMAGE *create_utox_image(HBITMAP bmp, bool has_alpha, uint32_t width, uint32_t height) { NATIVE_IMAGE *image = calloc(1, sizeof(NATIVE_IMAGE)); if (!image) { LOG_ERR("Windows", "Could not allocate memory for image."); return NULL; } image->bitmap = bmp; image->has_alpha = has_alpha; image->width = width; image->height = height; image->scaled_width = width; image->scaled_height = height; image->stretch_mode = COLORONCOLOR; return image; } /* TODO DRY, this exists in screen_grab.c */ static void sendbitmap(HDC mem, HBITMAP hbm, int width, int height) { if (width == 0 || height == 0) { return; } BITMAPINFO info = { .bmiHeader = { .biSize = sizeof(BITMAPINFOHEADER), .biWidth = width, .biHeight = -(int)height, .biPlanes = 1, .biBitCount = 24, .biCompression = BI_RGB, } }; void *bits = calloc(1, (width + 3) * height * 3); GetDIBits(mem, hbm, 0, height, bits, &info, DIB_RGB_COLORS); uint8_t pbytes = width & 3; uint8_t *p = bits; uint8_t *pp = bits; uint8_t *end = p + width * height * 3; while (p != end) { for (int i = 0; i != width; i++) { uint8_t b = pp[i * 3]; p[i * 3] = pp[i * 3 + 2]; p[i * 3 + 1] = pp[i * 3 + 1]; p[i * 3 + 2] = b; } p += width * 3; pp += width * 3 + pbytes; } int size = 0; UTOX_IMAGE out = stbi_write_png_to_mem(bits, 0, width, height, 3, &size); free(bits); NATIVE_IMAGE *image = create_utox_image(hbm, 0, width, height); friend_sendimage(flist_get_sel_friend(), image, width, height, out, size); } void paste(void) { OpenClipboard(NULL); HANDLE h = GetClipboardData(CF_UNICODETEXT); if (!h) { h = GetClipboardData(CF_BITMAP); if (h && flist_get_sel_friend()) { FRIEND *f = flist_get_sel_friend(); if (!f->online) { return; } BITMAP bm; GetObject(h, sizeof(bm), &bm); HDC tempdc = CreateCompatibleDC(NULL); SelectObject(tempdc, h); HBITMAP copy = CreateCompatibleBitmap(main_window.mem_DC, bm.bmWidth, bm.bmHeight); SelectObject(main_window.mem_DC, copy); BitBlt(main_window.mem_DC, 0, 0, bm.bmWidth, bm.bmHeight, tempdc, 0, 0, SRCCOPY); sendbitmap(main_window.mem_DC, copy, bm.bmWidth, bm.bmHeight); DeleteDC(tempdc); } } else { wchar_t *d = GlobalLock(h); char data[65536]; // TODO: De-hardcode this value. int len = WideCharToMultiByte(CP_UTF8, 0, d, -1, data, sizeof(data), NULL, NULL); if (edit_active()) { edit_paste(data, len, false); } } GlobalUnlock(h); CloseClipboard(); } NATIVE_IMAGE *utox_image_to_native(const UTOX_IMAGE data, size_t size, uint16_t *w, uint16_t *h, bool keep_alpha) { int width, height, bpp; uint8_t *rgba_data = stbi_load_from_memory(data, size, &width, &height, &bpp, 4); if (rgba_data == NULL || width == 0 || height == 0) { return NULL; // invalid image } BITMAPINFO bmi = { .bmiHeader = { .biSize = sizeof(BITMAPINFOHEADER), .biWidth = width, .biHeight = -height, .biPlanes = 1, .biBitCount = 32, .biCompression = BI_RGB, } }; // create device independent bitmap, we can write the bytes to out // to put them in the bitmap uint8_t *out; HBITMAP bmp = CreateDIBSection(main_window.mem_DC, &bmi, DIB_RGB_COLORS, (void **)&out, NULL, 0); // convert RGBA data to internal format // pre-applying the alpha if we're keeping the alpha channel, // put the result in out // NOTE: input pixels are in format RGBA, output is BGRA uint8_t *p, *end = rgba_data + width * height * 4; p = rgba_data; if (keep_alpha) { uint8_t alpha; do { alpha = p[3]; out[0] = p[2] * (alpha / 255.0); // pre-apply alpha out[1] = p[1] * (alpha / 255.0); out[2] = p[0] * (alpha / 255.0); out[3] = alpha; out += 4; p += 4; } while (p != end); } else { do { out[0] = p[2]; out[1] = p[1]; out[2] = p[0]; out[3] = 0; out += 4; p += 4; } while (p != end); } free(rgba_data); NATIVE_IMAGE *image = create_utox_image(bmp, keep_alpha, width, height); *w = width; *h = height; return image; } void image_free(NATIVE_IMAGE *image) { if (!image) { return; } DeleteObject(image->bitmap); free(image); } void flush_file(FILE *file) { fflush(file); int fd = _fileno(file); _commit(fd); } int ch_mod(uint8_t *UNUSED(file)) { /* You're probably looking for ./xlib as windows is lamesauce and wants nothing to do with sane permissions */ return true; } int file_lock(FILE *file, uint64_t start, size_t length) { OVERLAPPED lock_overlap; lock_overlap.Offset = start; lock_overlap.OffsetHigh = start + length; lock_overlap.hEvent = 0; return !LockFileEx(file, LOCKFILE_FAIL_IMMEDIATELY, 0, start, start + length, &lock_overlap); } int file_unlock(FILE *file, uint64_t start, size_t length) { OVERLAPPED lock_overlap; lock_overlap.Offset = start; lock_overlap.OffsetHigh = start + length; lock_overlap.hEvent = 0; return UnlockFileEx(file, 0, start, start + length, &lock_overlap); } void showkeyboard(bool UNUSED(show)) {} /* Added for android support. */ void edit_will_deactivate(void) {} /* Redraws the main UI window */ void redraw(void) { native_window_set_target(&main_window); SelectObject(main_window.draw_DC, main_window.draw_BM); panel_draw(&panel_root, 0, 0, settings.window_width, settings.window_height); } /** * update_tray(void) * creates a win32 NOTIFYICONDATAW struct, sets the tiptab flag, gives *hwnd, * sets struct .cbSize, and resets the tibtab to native self.name; */ void update_tray(void) { uint16_t length = self.name_length + sizeof(" : ") + self.statusmsg_length; char tip[length]; memset(tip, 0, length); length = snprintf(tip, length, "%.*s : %.*s", self.name_length, self.name, self.statusmsg_length, self.statusmsg); NOTIFYICONDATAW nid = { .uFlags = NIF_TIP, .hWnd = main_window.window, .cbSize = sizeof(nid), }; uint16_t msg_len = safe_shrink(tip, length, MAX_TIP_LENGTH); utf8_to_nativestr(tip, nid.szTip, msg_len); Shell_NotifyIconW(NIM_MODIFY, &nid); } void force_redraw(void) { redraw(); } void openurl(char *str) { if (try_open_tox_uri(str)) { redraw(); return; } wchar_t url[UTOX_FILE_NAME_LENGTH] = { 0 }; utf8tonative(str, url, UTOX_FILE_NAME_LENGTH); ShellExecuteW(NULL, L"open", url, NULL, NULL, SW_SHOW); } void freefonts() { for (size_t i = 0; i != COUNTOF(font); i++) { if (font[i]) { DeleteObject(font[i]); } } } void loadfonts() { LOGFONT lf = { .lfWeight = FW_NORMAL, //.lfCharSet = ANSI_CHARSET, .lfOutPrecision = OUT_TT_PRECIS, .lfQuality = DEFAULT_QUALITY, .lfFaceName = "DejaVu Sans", }; lf.lfHeight = (SCALE(-24) - 1) / 2; font[FONT_TEXT] = CreateFontIndirect(&lf); lf.lfHeight = (SCALE(-22) - 1) / 2; font[FONT_STATUS] = CreateFontIndirect(&lf); lf.lfHeight = (SCALE(-24) - 1) / 2; font[FONT_LIST_NAME] = CreateFontIndirect(&lf); lf.lfWeight = FW_BOLD; font[FONT_TITLE] = CreateFontIndirect(&lf); lf.lfHeight = (SCALE(-28) - 1) / 2; font[FONT_SELF_NAME] = CreateFontIndirect(&lf); lf.lfHeight = (SCALE(-20) - 1) / 2; font[FONT_MISC] = CreateFontIndirect(&lf); /*lf.lfWeight = FW_NORMAL; //FW_LIGHT <- light fonts don't antialias font[FONT_MSG_NAME] = CreateFontIndirect(&lf); lf.lfHeight = F(11); font[FONT_MSG] = CreateFontIndirect(&lf); lf.lfUnderline = 1; font[FONT_MSG_LINK] = CreateFontIndirect(&lf);*/ SelectObject(main_window.draw_DC, font[FONT_TEXT]); TEXTMETRIC tm; GetTextMetrics(main_window.draw_DC, &tm); font_small_lineheight = tm.tmHeight + tm.tmExternalLeading; // SelectObject(main_window.draw_DC, font[FONT_MSG]); // GetTextMetrics(main_window.draw_DC, &tm); // font_msg_lineheight = tm.tmHeight + tm.tmExternalLeading; } void setscale_fonts(void) { freefonts(); loadfonts(); } void setscale(void) { svg_draw(1); } /* * CommandLineToArgvA implementation since CommandLineToArgvA doesn't exist in win32 api * Limitation: nested quotation marks are not handled * Credit: http://alter.org.ua/docs/win/args */ static PCHAR *CommandLineToArgvA(PCHAR CmdLine, int *_argc) { ULONG len = strlen(CmdLine); ULONG i = ((len + 2) / 2) * sizeof(PVOID) + sizeof(PVOID); PCHAR *argv = (PCHAR *)GlobalAlloc(GMEM_FIXED, i + (len + 2) * sizeof(CHAR)); PCHAR _argv = (PCHAR)(((PUCHAR)argv) + i); ULONG argc = 0; argv[argc] = _argv; i = 0; BOOLEAN in_QM = FALSE; BOOLEAN in_TEXT = FALSE; BOOLEAN in_SPACE = TRUE; CHAR a; ULONG j = 0; while ((a = CmdLine[i])) { if (in_QM) { if (a == '\"') { in_QM = FALSE; } else { _argv[j] = a; j++; } } else { switch (a) { case '\"': in_QM = TRUE; in_TEXT = TRUE; if (in_SPACE) { argv[argc] = _argv + j; argc++; } in_SPACE = FALSE; break; case ' ': case '\t': case '\n': case '\r': if (in_TEXT) { _argv[j] = '\0'; j++; } in_TEXT = FALSE; in_SPACE = TRUE; break; default: in_TEXT = TRUE; if (in_SPACE) { argv[argc] = _argv + j; argc++; } _argv[j] = a; j++; in_SPACE = FALSE; break; } } i++; } _argv[j] = '\0'; argv[argc] = NULL; (*_argc) = argc; return argv; } void tray_icon_init(HWND parent, HICON icon) { NOTIFYICONDATA nid = { .uFlags = NIF_MESSAGE | NIF_ICON | NIF_TIP, .uCallbackMessage = WM_NOTIFYICON, .hIcon = icon, .szTip = "uTox default tooltip", .hWnd = parent, .cbSize = sizeof(nid), }; Shell_NotifyIcon(NIM_ADD, &nid); } static void tray_icon_decon(HWND parent) { NOTIFYICONDATA nid = { .hWnd = parent, .cbSize = sizeof(nid), }; Shell_NotifyIcon(NIM_DELETE, &nid); } static void cursors_init(void) { cursors[CURSOR_NONE] = LoadCursor(NULL, IDC_ARROW); cursors[CURSOR_HAND] = LoadCursor(NULL, IDC_HAND); cursors[CURSOR_TEXT] = LoadCursor(NULL, IDC_IBEAM); cursors[CURSOR_SELECT] = LoadCursor(NULL, IDC_CROSS); cursors[CURSOR_ZOOM_IN] = LoadCursor(NULL, IDC_SIZEALL); cursors[CURSOR_ZOOM_OUT] = LoadCursor(NULL, IDC_SIZEALL); } static bool win_init_mutex(HANDLE *mutex, HINSTANCE hInstance, PSTR cmd, const char *instance_id) { *mutex = CreateMutex(NULL, false, instance_id); if (!mutex) { LOG_FATAL_ERR(-4, "Win Mutex", "Unable to create windows mutex."); } if (GetLastError() == ERROR_ALREADY_EXISTS) { HWND window = FindWindow(TITLE, NULL); if (window) { COPYDATASTRUCT data = { .cbData = strlen(cmd), .lpData = cmd }; SendMessage(window, WM_COPYDATA, (WPARAM)hInstance, (LPARAM)&data); LOG_FATAL_ERR(-3, "Win Mutex", "Message sent."); } LOG_FATAL_ERR(-3, "Win Mutex", "Error getting mutex or window."); } return true; } /** client main() * * Main thread * generates settings, loads settings from save file, generates main UI, starts * tox, generates tray icon, handles client messages. Cleans up, and exits. * * also handles call from other apps. */ int WINAPI WinMain(HINSTANCE hInstance, HINSTANCE UNUSED(hPrevInstance), PSTR cmd, int nCmdShow) { pthread_mutex_init(&messages_lock, NULL); int argc; PCHAR *argv = CommandLineToArgvA(GetCommandLineA(), &argc); if (!argv) { printf("Init error -- CommandLineToArgvA failed."); return -5; } int8_t should_launch_at_startup, set_show_window; parse_args(argc, argv, &should_launch_at_startup, &set_show_window, NULL); GlobalFree(argv); char instance_id[MAX_PATH]; if (settings.portable_mode == true) { /* force the working directory if opened with portable command */ const HMODULE hModule = GetModuleHandle(NULL); GetModuleFileName(hModule, instance_id, MAX_PATH); char *utox_path = strdup(instance_id); char *utox_folder = dirname(utox_path); SetCurrentDirectory(utox_folder); strcpy(portable_mode_save_path, utox_folder); free(utox_path); sanitize_filename((uint8_t *)instance_id); } else { strcpy(instance_id, TITLE); } // We call utox_init after parse_args() utox_init(); LOG_WARN("WinMain", "Normal windows build"); #ifdef GIT_VERSION LOG_NOTE("WinMain", "uTox version %s \n", GIT_VERSION); #endif /* if opened with argument, check if uTox is already open and pass the argument to the existing process */ HANDLE utox_mutex; win_init_mutex(&utox_mutex, hInstance, cmd, instance_id); if (should_launch_at_startup == 1) { launch_at_startup(1); } else if (should_launch_at_startup == -1) { launch_at_startup(0); } cursors_init(); native_window_init(hInstance); // Needed to generate the Windows window class we use. screen_grab_init(hInstance); OleInitialize(NULL); theme_load(settings.theme); settings.window_width = MAX((uint32_t)SCALE(MAIN_WIDTH), settings.window_width); settings.window_height = MAX((uint32_t)SCALE(MAIN_HEIGHT), settings.window_height); char pretitle[128]; snprintf(pretitle, 128, "%s %s (version : %s)", TITLE, SUB_TITLE, VERSION); size_t title_size = strlen(pretitle) + 1; wchar_t title[title_size]; mbstowcs(title, pretitle, title_size); native_window_create_main(settings.window_x, settings.window_y, settings.window_width, settings.window_height); native_notify_init(hInstance); hdc_brush = GetStockObject(DC_BRUSH); tray_icon_init(main_window.window, LoadIcon(hInstance, MAKEINTRESOURCE(101))); SetBkMode(main_window.draw_DC, TRANSPARENT); dnd_init(main_window.window); // start tox thread (main_window.window needs to be set first) thread(toxcore_thread, NULL); // wait for tox_thread init while (!tox_thread_init && !settings.save_encryption) { yieldcpu(1); } if (*cmd) { const int len = strlen(cmd); do_tox_url((uint8_t *)cmd, len); } redraw(); update_tray(); /* From --set flag */ if (set_show_window) { if (set_show_window == 1) { settings.start_in_tray = false; } else if (set_show_window == -1) { settings.start_in_tray = true; } } if (settings.start_in_tray) { ShowWindow(main_window.window, SW_HIDE); hidden = true; } else { ShowWindow(main_window.window, nCmdShow); } MSG msg; while (GetMessage(&msg, NULL, 0, 0)) { TranslateMessage(&msg); DispatchMessage(&msg); } RECT wndrect = { 0 }; GetWindowRect(main_window.window, &wndrect); settings.window_x = wndrect.left < 0 ? 0 : wndrect.left; settings.window_y = wndrect.top < 0 ? 0 : wndrect.top; settings.window_width = (wndrect.right - wndrect.left); settings.window_height = (wndrect.bottom - wndrect.top); config_save(); /* kill threads */ postmessage_utoxav(UTOXAV_KILL, 0, 0, NULL); postmessage_toxcore(TOX_KILL, 0, 0, NULL); /* cleanup */ tray_icon_decon(main_window.window); // wait for tox_thread to exit while (tox_thread_init) { yieldcpu(10); } // TODO: This should be a non-zero value determined by a message's wParam. return 0; } uTox/src/windows/filesys.c0000600000175000001440000002037614003056216014611 0ustar rakusers#include "main.h" #include "utf8.h" #include "../debug.h" #include "../filesys.h" #include "../settings.h" #include #include #include #include char *native_get_filepath(const char *name) { char *path = calloc(1, UTOX_FILE_NAME_LENGTH); if (!path) { LOG_ERR("WinFilesys", "Unable to allocate memory for file path."); return NULL; } if (settings.portable_mode) { strcpy(path, portable_mode_save_path); } else { if (FAILED(SHGetFolderPath(NULL, CSIDL_APPDATA, NULL, 0, path))) { if (FAILED(SHGetFolderPath(NULL, CSIDL_LOCAL_APPDATA, NULL, 0, path))) { strcpy(path, portable_mode_save_path); } } } snprintf(path + strlen(path), UTOX_FILE_NAME_LENGTH - strlen(path), "\\Tox\\"); if (strlen(path) + strlen(name) >= UTOX_FILE_NAME_LENGTH) { LOG_ERR("WinFilesys", "Load directory name too long"); free(path); return NULL; } snprintf(path + strlen(path), UTOX_FILE_NAME_LENGTH - strlen(path), "%s", name); return path; } static FILE* get_file(wchar_t path[UTOX_FILE_NAME_LENGTH], UTOX_FILE_OPTS opts) { // assert(UTOX_FILE_NAME_LENGTH <= (32,767 wide characters) ); DWORD rw = 0; char mode[4] = { 0 }; DWORD create = OPEN_EXISTING; if (opts & UTOX_FILE_OPTS_READ) { rw |= GENERIC_READ; mode[0] = 'r'; if (opts & UTOX_FILE_OPTS_WRITE || opts & UTOX_FILE_OPTS_APPEND) { rw |= GENERIC_WRITE; create = OPEN_ALWAYS; } } else if (opts & UTOX_FILE_OPTS_APPEND) { rw |= GENERIC_WRITE; mode[0] = 'a'; create = OPEN_ALWAYS; } else if (opts & UTOX_FILE_OPTS_WRITE) { rw |= GENERIC_WRITE; mode[0] = 'w'; create = CREATE_ALWAYS; } else { LOG_ERR("WinFilesys", "get_file called with invalid opts"); return NULL; } mode[1] = 'b'; if ((opts & (UTOX_FILE_OPTS_WRITE | UTOX_FILE_OPTS_APPEND)) && (opts & UTOX_FILE_OPTS_READ)) { mode[2] = '+'; } HANDLE WINAPI winFile = CreateFileW(path, rw, FILE_SHARE_READ, NULL, create, FILE_ATTRIBUTE_NORMAL, NULL); const int handle = _open_osfhandle((intptr_t)winFile, 0); if (handle == -1) { return NULL; } return _fdopen(handle, mode); } FILE *native_get_file_simple(const char *path, UTOX_FILE_OPTS opts) { //TODO: Check for forbidden opts (only read, write and append allowed) wchar_t wide_path[UTOX_FILE_NAME_LENGTH] = { 0 }; utf8_to_nativestr(path, wide_path, UTOX_FILE_NAME_LENGTH * 2); FILE *f = get_file(wide_path, opts); if (!f) { LOG_ERR("WinFilesys", "Could not open file: %s", path); return NULL; } return f; } FILE *native_get_file(const uint8_t *name, size_t *size, UTOX_FILE_OPTS opts, bool portable_mode) { char path[UTOX_FILE_NAME_LENGTH] = { 0 }; if (portable_mode) { strcpy(path, portable_mode_save_path); } else { if (FAILED(SHGetFolderPath(NULL, CSIDL_APPDATA, NULL, 0, path))) { if (FAILED(SHGetFolderPath(NULL, CSIDL_LOCAL_APPDATA, NULL, 0, path))) { strcpy(path, portable_mode_save_path); } } } if (opts > UTOX_FILE_OPTS_DELETE) { LOG_ERR("WinFilesys", "Don't call native_get_file with UTOX_FILE_OPTS_DELETE in combination with other options."); return NULL; } else if (opts & UTOX_FILE_OPTS_WRITE && opts & UTOX_FILE_OPTS_APPEND) { LOG_ERR("WinFilesys", "Don't call native_get_file with UTOX_FILE_OPTS_WRITE in combination with UTOX_FILE_OPTS_APPEND."); return NULL; } snprintf(path + strlen(path), UTOX_FILE_NAME_LENGTH - strlen(path), "/Tox/"); if (strlen(path) + strlen((char *)name) >= UTOX_FILE_NAME_LENGTH) { LOG_ERR("WinFilesys", "Load directory name too long"); return NULL; } char *tmp_path = _strdup((char *)name); // free() doesn't work if I touch this pointer at all, so.. char *path_pointer = tmp_path; // this pointer gets to hold the original location to free. if (!tmp_path) { LOG_FATAL_ERR(EXIT_MALLOC, "WinFilesys", "Unable to allocate memory for file path."); } // Append the subfolder to the path and remove it from the name. for (char *folder_divider = strstr(tmp_path, "/"); folder_divider != NULL; folder_divider = strstr(tmp_path, "/")) { ++folder_divider; // Skip over the / we're pointing to. snprintf(path + strlen(path), strlen(tmp_path) - strlen(folder_divider), tmp_path); char *new_path = tmp_path + strlen(tmp_path) - strlen(folder_divider); tmp_path = new_path; } if (opts & UTOX_FILE_OPTS_WRITE || opts & UTOX_FILE_OPTS_MKDIR) { if (!native_create_dir((uint8_t *)path)) { LOG_ERR("WinFilesys", "Failed to create path %s.", path); } } snprintf(path + strlen(path), UTOX_FILE_NAME_LENGTH - strlen(path), "%s", tmp_path); free(path_pointer); for (size_t i = 0; path[i] != '\0'; ++i) { if (path[i] == '/') { path[i] = '\\'; } } if (opts == UTOX_FILE_OPTS_DELETE) { if (!DeleteFile(path)) { LOG_ERR("WinFilesys", "Could not delete file: %s - Error: %d" , path, GetLastError()); } return NULL; } FILE *fp = native_get_file_simple(path, opts); if (!fp) { if (opts > UTOX_FILE_OPTS_READ) { LOG_NOTE("WinFilesys", "Could not open %s for writing.", path); } return NULL; } if (size && opts & UTOX_FILE_OPTS_READ) { fseek(fp, 0, SEEK_END); *size = ftell(fp); fseek(fp, 0, SEEK_SET); } return fp; } /** Try to create a path; * * Accepts null-terminated utf8 path. * Returns: true if folder exists, false otherwise * */ bool native_create_dir(const uint8_t *filepath) { // Maybe switch this to SHCreateDirectoryExW at some point. uint8_t path[UTOX_FILE_NAME_LENGTH] = { 0 }; strcpy((char *)path, (char *)filepath); for (size_t i = 0; path[i] != '\0'; ++i) { if (path[i] == '/') { path[i] = '\\'; } } const int error = SHCreateDirectoryEx(NULL, (char *)path, NULL); switch(error) { case ERROR_SUCCESS: LOG_NOTE("WinFilesys", "Created path: `%s` - %d" , filepath, error); // fallthrough case ERROR_FILE_EXISTS: case ERROR_ALREADY_EXISTS: return true; break; case ERROR_BAD_PATHNAME: LOG_WARN("WinFilesys", "Unable to create path: `%s` - bad path name." , filepath); return false; break; case ERROR_FILENAME_EXCED_RANGE: case ERROR_PATH_NOT_FOUND: case ERROR_CANCELLED: default: LOG_ERR("WinFilesys", "Unable to create path: `%s` - error %d" , filepath, error); return false; break; } } bool native_remove_file(const uint8_t *name, size_t length, bool portable_mode) { char path[UTOX_FILE_NAME_LENGTH] = { 0 }; if (portable_mode) { strcpy(path, portable_mode_save_path); } else { bool have_path = false; have_path = SUCCEEDED(SHGetFolderPath(NULL, CSIDL_APPDATA, NULL, 0, path)); if (!have_path) { have_path = SUCCEEDED(SHGetFolderPath(NULL, CSIDL_LOCAL_APPDATA, NULL, 0, path)); } if (!have_path) { strcpy(path, portable_mode_save_path); have_path = true; } } if (strlen(path) + length >= UTOX_FILE_NAME_LENGTH) { LOG_TRACE("WinFilesys", "File/directory name too long, unable to remove" ); return false; } else { snprintf(path + strlen(path), UTOX_FILE_NAME_LENGTH - strlen(path), "\\Tox\\%.*s", (int)length, (char *)name); } if (remove(path)) { LOG_ERR("WinFilesys", "Unable to delete file!\n\t\t%s" , path); return false; } else { LOG_INFO("WinFilesys", "File deleted!" ); LOG_TRACE("WinFilesys", "\t%s" , path); } return true; } bool native_move_file(const uint8_t *current_name, const uint8_t *new_name) { if (!current_name || !new_name) { return false; } return MoveFile((char *)current_name, (char *)new_name); } uTox/src/windows/example.reg0000600000175000001440000000124414003056216015112 0ustar rakusersWindows Registry Editor Version 5.00 [HKEY_CLASSES_ROOT\tox] @="URL:Tox Protocol" "URL Protocol"="" [HKEY_CLASSES_ROOT\tox\DefaultIcon] @="C:\\winTox\\bin\\winTox.exe,101" [HKEY_CLASSES_ROOT\tox\shell] [HKEY_CLASSES_ROOT\tox\shell\open] [HKEY_CLASSES_ROOT\tox\shell\open\command] @="C:\\winTox\\bin\\winTox.exe %1" uTox/src/windows/events.h0000600000175000001440000000023214003056216014431 0ustar rakusers#ifndef WIN_EVENTS_H #define WIN_EVENTS_H #include LRESULT CALLBACK WindowProc(HWND window, UINT msg, WPARAM wParam, LPARAM lParam); #endif uTox/src/windows/events.c0000600000175000001440000003456114003056216014440 0ustar rakusers#include "events.h" #include "main.h" #include "window.h" #include "../commands.h" #include "../debug.h" #include "../flist.h" #include "../friend.h" #include "../macros.h" #include "../self.h" #include "../settings.h" #include "../theme.h" #include "../tox.h" #include "../utox.h" #include "../av/utox_av.h" #include "../native/clipboard.h" #include "../native/keyboard.h" #include "../native/notify.h" #include "../native/ui.h" #include "../ui/dropdown.h" #include "../ui/edit.h" #include "../ui/svg.h" #include "../layout/background.h" #include "../layout/notify.h" #include "../layout/settings.h" #include #include "../main.h" // main_width static TRACKMOUSEEVENT tme = { sizeof(TRACKMOUSEEVENT), TME_LEAVE, 0, 0, }; static bool mouse_tracked = false; /** Toggles the main window to/from hidden to tray/shown. */ static void togglehide(int show) { if (hidden || show) { ShowWindow(main_window.window, SW_RESTORE); SetForegroundWindow(main_window.window); redraw(); hidden = false; } else { ShowWindow(main_window.window, SW_HIDE); hidden = true; } } /** Right click context menu for the tray icon */ static void ShowContextMenu(void) { POINT pt; GetCursorPos(&pt); HMENU hMenu = CreatePopupMenu(); if (hMenu) { InsertMenu(hMenu, -1, MF_BYPOSITION, TRAY_SHOWHIDE, hidden ? "Restore" : "Hide"); InsertMenu(hMenu, -1, MF_BYPOSITION | MF_SEPARATOR, 0, NULL); InsertMenu(hMenu, -1, MF_BYPOSITION | ((self.status == TOX_USER_STATUS_NONE) ? MF_CHECKED : 0), TRAY_STATUS_AVAILABLE, "Available"); InsertMenu(hMenu, -1, MF_BYPOSITION | ((self.status == TOX_USER_STATUS_AWAY) ? MF_CHECKED : 0), TRAY_STATUS_AWAY, "Away"); InsertMenu(hMenu, -1, MF_BYPOSITION | ((self.status == TOX_USER_STATUS_BUSY) ? MF_CHECKED : 0), TRAY_STATUS_BUSY, "Busy"); InsertMenu(hMenu, -1, MF_BYPOSITION | MF_SEPARATOR, 0, NULL); InsertMenu(hMenu, -1, MF_BYPOSITION, TRAY_EXIT, "Exit"); // note: must set window to the foreground or the // menu won't disappear when it should SetForegroundWindow(main_window.window); TrackPopupMenu(hMenu, TPM_BOTTOMALIGN, pt.x, pt.y, 0, main_window.window, NULL); DestroyMenu(hMenu); } } /* TODO should this be moved to window.c? */ static void move_window(int x, int y){ LOG_TRACE("Win events", "delta x == %i\n", x); LOG_TRACE("Win events", "delta y == %i\n", y); SetWindowPos(main_window.window, 0, main_window._.x + x, main_window._.y + y, 0, 0, SWP_NOSIZE | SWP_NOZORDER | SWP_NOREDRAW); main_window._.x += x; main_window._.y += y; } #define setstatus(x) \ if (self.status != x) { \ postmessage_toxcore(TOX_SELF_SET_STATE, x, 0, NULL); \ self.status = x; \ redraw(); \ } /** Handles all callback requests from winmain(); * * handles the window functions internally, and ships off the tox calls to tox */ LRESULT CALLBACK WindowProc(HWND window, UINT msg, WPARAM wParam, LPARAM lParam) { static int mx, my; static bool mdown = false; static int mdown_x, mdown_y; static uint32_t taskbar_created; if (main_window.window && window != main_window.window) { if (msg == WM_DESTROY) { if (window == preview_hwnd) { if (settings.video_preview) { settings.video_preview = false; postmessage_utoxav(UTOXAV_STOP_VIDEO, UINT16_MAX, 0, NULL); } return false; } for (uint8_t i = 0; i < self.friend_list_count; i++) { if (video_hwnd[i] == window) { FRIEND *f = get_friend(i); postmessage_utoxav(UTOXAV_STOP_VIDEO, f->number, 0, NULL); break; } } } LOG_TRACE("WinEvent", "Uncaught event %u & %u", wParam, lParam); return DefWindowProcW(window, msg, wParam, lParam); } switch (msg) { case WM_QUIT: case WM_CLOSE: case WM_DESTROY: { if (settings.close_to_tray) { LOG_INFO("Events", "Closing to tray." ); togglehide(0); return true; } else { PostQuitMessage(0); return false; } } case WM_GETMINMAXINFO: { POINT min = { SCALE(MAIN_WIDTH), SCALE(MAIN_HEIGHT) }; ((MINMAXINFO *)lParam)->ptMinTrackSize = min; break; } case WM_CREATE: { LOG_INFO("Windows", "WM_CREATE"); taskbar_created = RegisterWindowMessage(TEXT("TaskbarCreated")); return false; } case WM_SIZE: { switch (wParam) { case SIZE_MAXIMIZED: { settings.window_maximized = true; break; } case SIZE_RESTORED: { settings.window_maximized = false; break; } } int w = GET_X_LPARAM(lParam); int h = GET_Y_LPARAM(lParam); if (w != 0) { RECT r; GetClientRect(window, &r); w = r.right; h = r.bottom; settings.window_width = w; settings.window_height = h; ui_rescale(dropdown_dpi.selected + 5); ui_size(w, h); if (main_window.draw_BM) { DeleteObject(main_window.draw_BM); } main_window.draw_BM = CreateCompatibleBitmap(main_window.window_DC, settings.window_width, settings.window_height); SelectObject(main_window.window_DC, main_window.draw_BM); redraw(); } break; } case WM_SETFOCUS: { if (flashing) { FlashWindow(main_window.window, false); flashing = false; NOTIFYICONDATAW nid = { .uFlags = NIF_ICON, .hWnd = main_window.window, .hIcon = black_icon, .cbSize = sizeof(nid), }; Shell_NotifyIconW(NIM_MODIFY, &nid); } have_focus = true; break; } case WM_KILLFOCUS: { have_focus = false; break; } case WM_ERASEBKGND: { return true; } case WM_PAINT: { PAINTSTRUCT ps; BeginPaint(window, &ps); RECT r = ps.rcPaint; BitBlt(main_window.window_DC, r.left, r.top, r.right - r.left, r.bottom - r.top, main_window.draw_DC, r.left, r.top, SRCCOPY); EndPaint(window, &ps); return false; } case WM_SYSKEYDOWN: // called instead of WM_KEYDOWN when ALT is down or F10 is pressed case WM_KEYDOWN: { bool control = (GetKeyState(VK_CONTROL) & 0x80) != 0; bool shift = (GetKeyState(VK_SHIFT) & 0x80) != 0; bool alt = (GetKeyState(VK_MENU) & 0x80) != 0; /* Be careful not to clobber alt+num symbols */ if (wParam >= VK_NUMPAD0 && wParam <= VK_NUMPAD9) { // normalize keypad and non-keypad numbers wParam = wParam - VK_NUMPAD0 + '0'; } if (control && wParam == 'C') { copy(0); return false; } if (control) { if ((wParam == VK_TAB && shift) || wParam == VK_PRIOR) { flist_previous_tab(); redraw(); return false; } else if (wParam == VK_TAB || wParam == VK_NEXT) { flist_next_tab(); redraw(); return false; } } if (control && !alt) { if (wParam >= '1' && wParam <= '9') { flist_selectchat(wParam - '1'); redraw(); return false; } else if (wParam == '0') { flist_selectchat(9); redraw(); return false; } } if (edit_active()) { if (control) { switch (wParam) { case 'V': paste(); return false; case 'X': copy(0); edit_char(KEY_DEL, 1, 0); return false; } } if (control || ((wParam < 'A' || wParam > 'Z') && wParam != VK_RETURN && wParam != VK_BACK)) { edit_char(wParam, 1, (control << 2) | shift); } } else { messages_char(wParam); redraw(); // TODO maybe if this break; } break; } case WM_CHAR: { if (edit_active()) { if (wParam == KEY_RETURN && (GetKeyState(VK_SHIFT) & 0x80)) { wParam = '\n'; } if (wParam != KEY_TAB) { edit_char(wParam, 0, 0); } } return false; } case WM_MOUSEWHEEL: { double delta = (double)GET_WHEEL_DELTA_WPARAM(wParam); mx = GET_X_LPARAM(lParam); my = GET_Y_LPARAM(lParam); panel_mwheel(&panel_root, mx, my, settings.window_width, settings.window_height, delta / (double)(WHEEL_DELTA), 1); return false; } case WM_MOUSEMOVE: { int x, y, dx, dy; x = GET_X_LPARAM(lParam); y = GET_Y_LPARAM(lParam); dx = x - mx; dy = y - my; mx = x; my = y; if (btn_move_window_down) { move_window(x - mdown_x, y - mdown_y); } cursor = 0; panel_mmove(&panel_root, 0, 0, settings.window_width, settings.window_height, x, y, dx, dy); SetCursor(cursors[cursor]); if (!mouse_tracked) { TrackMouseEvent(&tme); mouse_tracked = true; } return false; } case WM_LBUTTONDOWN: { mdown_x = GET_X_LPARAM(lParam); mdown_y = GET_Y_LPARAM(lParam); // Intentional fall through to save the original mdown location. } // fallthrough case WM_LBUTTONDBLCLK: { mdown = true; int x = GET_X_LPARAM(lParam); int y = GET_Y_LPARAM(lParam); if (x != mx || y != my) { panel_mmove(&panel_root, 0, 0, settings.window_width, settings.window_height, x, y, x - mx, y - my); mx = x; my = y; } // double redraw> panel_mdown(&panel_root); if (msg == WM_LBUTTONDBLCLK) { panel_dclick(&panel_root, 0); } SetCapture(window); break; } case WM_RBUTTONDOWN: { panel_mright(&panel_root); break; } case WM_RBUTTONUP: { break; } case WM_LBUTTONUP: { ReleaseCapture(); break; } case WM_CAPTURECHANGED: { if (mdown) { panel_mup(&panel_root); mdown = false; } break; } case WM_MOUSELEAVE: { ui_mouseleave(); mouse_tracked = false; btn_move_window_down = false; LOG_TRACE("Win events", "mouse leave\n"); break; } case WM_COMMAND: { int menu = LOWORD(wParam); //, msg = HIWORD(wParam); switch (menu) { case TRAY_SHOWHIDE: { togglehide(0); break; } case TRAY_EXIT: { PostQuitMessage(0); break; } case TRAY_STATUS_AVAILABLE: { setstatus(TOX_USER_STATUS_NONE); break; } case TRAY_STATUS_AWAY: { setstatus(TOX_USER_STATUS_AWAY); break; } case TRAY_STATUS_BUSY: { setstatus(TOX_USER_STATUS_BUSY); break; } } break; } case WM_NOTIFYICON: { int message = LOWORD(lParam); switch (message) { case WM_MOUSEMOVE: { break; } case WM_LBUTTONDOWN: { togglehide(0); break; } case WM_LBUTTONDBLCLK: { togglehide(1); break; } case WM_LBUTTONUP: { break; } case WM_RBUTTONDOWN: { break; } case WM_RBUTTONUP: case WM_CONTEXTMENU: { ShowContextMenu(); break; } } return false; } case WM_COPYDATA: { togglehide(1); SetForegroundWindow(window); COPYDATASTRUCT *data = (void *)lParam; if (data->lpData) { do_tox_url(data->lpData, data->cbData); } return false; } case WM_TOX ... WM_TOX + 128: { utox_message_dispatch(msg - WM_TOX, wParam >> 16, wParam, (void *)lParam); return false; } default: { if (msg == taskbar_created) { tray_icon_init(main_window.window, black_icon); } break; } } return DefWindowProcW(window, msg, wParam, lParam); } uTox/src/windows/drawing.c0000600000175000001440000002336514003056216014567 0ustar rakusers#include "main.h" #include "utf8.h" #include "window.h" #include "../debug.h" #include "../macros.h" #include "../native/image.h" #include "../ui/svg.h" UTOX_WINDOW *curr = NULL; void *bitmap[BM_ENDMARKER + 1]; BLENDFUNCTION blend_function = { .BlendOp = AC_SRC_OVER, .BlendFlags = 0, .SourceConstantAlpha = 0xFF, .AlphaFormat = AC_SRC_ALPHA }; void drawalpha(int bm, int x, int y, int width, int height, uint32_t color) { if (!bitmap[bm]) { return; } BITMAPINFO bmi = { .bmiHeader = { .biSize = sizeof(BITMAPINFOHEADER), .biWidth = width, .biHeight = -height, .biPlanes = 1, .biBitCount = 32, .biCompression = BI_RGB, } }; // create pointer to beginning and end of the alpha-channel-only bitmap uint8_t *alpha_pixel = bitmap[bm], *end = alpha_pixel + width * height; // create temporary bitmap we'll combine the alpha and colors on uint32_t *out_pixel; HBITMAP temp = CreateDIBSection(curr->mem_DC, &bmi, DIB_RGB_COLORS, (void **)&out_pixel, NULL, 0); SelectObject(curr->mem_DC, temp); // create pixels for the drawable bitmap based on the alpha value of // each pixel in the alpha bitmap and the color given by 'color', // the Win32 API requires we pre-apply our alpha channel as well by // doing (color * alpha / 255) for each color channel // NOTE: Input color is in the format 0BGR, output pixel is in the format BGRA while (alpha_pixel != end) { uint8_t alpha = *alpha_pixel++; *out_pixel++ = (((color & 0xFF) * alpha / 255) << 16) // red | ((((color >> 8) & 0xFF) * alpha / 255) << 8) // green | ((((color >> 16) & 0xFF) * alpha / 255) << 0) // blue | (alpha << 24); // alpha } // draw temporary bitmap on screen AlphaBlend(curr->draw_DC, x, y, width, height, curr->mem_DC, 0, 0, width, height, blend_function); // clean up DeleteObject(temp); } void image_set_filter(NATIVE_IMAGE *image, uint8_t filter) { switch (filter) { case FILTER_NEAREST: image->stretch_mode = COLORONCOLOR; break; case FILTER_BILINEAR: image->stretch_mode = HALFTONE; break; default: LOG_TRACE("Drawing", "Warning: Tried to set image to unrecognized filter(%u)." , filter); return; } } void image_set_scale(NATIVE_IMAGE *image, double img_scale) { image->scaled_width = (uint32_t)(((double)image->width * img_scale) + 0.5); image->scaled_height = (uint32_t)(((double)image->height * img_scale) + 0.5); } static bool image_is_stretched(const NATIVE_IMAGE *image) { return image->width != image->scaled_width || image->height != image->scaled_height; } // NOTE: This function is way more complicated than the XRender variant, because // the Win32 API is a lot more limited, so all scaling, clipping, and handling // transparency has to be done explicitly void draw_image(const NATIVE_IMAGE *image, int x, int y, uint32_t width, uint32_t height, uint32_t imgx, uint32_t imgy) { HDC drawdc; // device context we'll do the eventual drawing with HBITMAP tmp = NULL; // used when scaling if (!image_is_stretched(image)) { SelectObject(curr->mem_DC, image->bitmap); drawdc = curr->mem_DC; } else { // temporary device context for the scaling operation drawdc = CreateCompatibleDC(NULL); // set stretch mode from image SetStretchBltMode(drawdc, image->stretch_mode); // scaled bitmap will be drawn onto this bitmap tmp = CreateCompatibleBitmap(curr->mem_DC, image->scaled_width, image->scaled_height); SelectObject(drawdc, tmp); SelectObject(curr->mem_DC, image->bitmap); // stretch image onto temporary bitmap if (image->has_alpha) { AlphaBlend(drawdc, 0, 0, image->scaled_width, image->scaled_height, curr->mem_DC, 0, 0, image->width, image->height, blend_function); } else { StretchBlt(drawdc, 0, 0, image->scaled_width, image->scaled_height, curr->mem_DC, 0, 0, image->width, image->height, SRCCOPY); } } // clip and draw if (image->has_alpha) { AlphaBlend(curr->draw_DC, x, y, width, height, drawdc, imgx, imgy, width, height, blend_function); } else { BitBlt(curr->draw_DC, x, y, width, height, drawdc, imgx, imgy, SRCCOPY); } // clean up if (image_is_stretched(image)) { DeleteObject(tmp); DeleteDC(drawdc); } } void draw_inline_image(uint8_t *img_data, size_t UNUSED(size), uint16_t w, uint16_t h, int x, int y) { BITMAPINFO bmi = { .bmiHeader = { .biSize = sizeof(BITMAPINFOHEADER), .biWidth = w, .biHeight = -h, .biPlanes = 1, .biBitCount = 32, .biCompression = BI_RGB, } }; SetDIBitsToDevice(curr->draw_DC, x, y, w, h, 0, 0, 0, h, img_data, &bmi, DIB_RGB_COLORS); } void drawtext(int x, int y, const char *str, uint16_t length) { wchar_t out[length]; length = utf8tonative(str, out, length); TextOutW(curr->draw_DC, x, y, out, length); } int drawtext_getwidth(int x, int y, const char *str, uint16_t length) { wchar_t out[length]; length = utf8tonative(str, out, length); SIZE size; TextOutW(curr->draw_DC, x, y, out, length); GetTextExtentPoint32W(curr->draw_DC, out, length, &size); return size.cx; } void drawtextwidth(int x, int width, int y, const char *str, uint16_t length) { wchar_t out[length]; length = utf8tonative(str, out, length); RECT r = { x, y, x + width, y + 256 }; DrawTextW(curr->draw_DC, out, length, &r, DT_SINGLELINE | DT_END_ELLIPSIS | DT_NOPREFIX); } void drawtextwidth_right(int x, int width, int y, const char *str, uint16_t length) { wchar_t out[length]; length = utf8tonative(str, out, length); RECT r = { x, y, x + width, y + 256 }; DrawTextW(curr->draw_DC, out, length, &r, DT_SINGLELINE | DT_END_ELLIPSIS | DT_NOPREFIX | DT_RIGHT); } void drawtextrange(int x, int x2, int y, const char *str, uint16_t length) { wchar_t out[length]; length = utf8tonative(str, out, length); RECT r = { x, y, x2, y + 256 }; DrawTextW(curr->draw_DC, out, length, &r, DT_SINGLELINE | DT_END_ELLIPSIS | DT_NOPREFIX); } void drawtextrangecut(int x, int x2, int y, const char *str, uint16_t length) { wchar_t out[length]; length = utf8tonative(str, out, length); RECT r = { x, y, x2, y + 256 }; DrawTextW(curr->draw_DC, out, length, &r, DT_SINGLELINE | DT_NOPREFIX); } int textwidth(const char *str, uint16_t length) { wchar_t out[length]; length = utf8tonative(str, out, length); SIZE size; GetTextExtentPoint32W(curr->draw_DC, out, length, &size); return size.cx; } int textfit(const char *str, uint16_t len, int width) { wchar_t out[len]; int length = utf8tonative(str, out, len); int fit; SIZE size; GetTextExtentExPointW(curr->draw_DC, out, length, width, &fit, NULL, &size); return WideCharToMultiByte(CP_UTF8, 0, out, fit, (char *)str, len, NULL, 0); } int textfit_near(const char *str, uint16_t len, int width) { /*todo: near*/ wchar_t out[len]; int length = utf8tonative(str, out, len); int fit; SIZE size; GetTextExtentExPointW(curr->draw_DC, out, length, width, &fit, NULL, &size); return WideCharToMultiByte(CP_UTF8, 0, out, fit, (char *)str, len, NULL, 0); } void draw_rect_frame(int x, int y, int width, int height, uint32_t color) { RECT r = { x, y, x + width, y + height }; SetDCBrushColor(curr->draw_DC, color); FrameRect(curr->draw_DC, &r, hdc_brush); } void draw_rect_fill(int x, int y, int width, int height, uint32_t color) { RECT r = { x, y, x + width, y + height }; SetDCBrushColor(curr->draw_DC, color); FillRect(curr->draw_DC, &r, hdc_brush); } void drawrect(int x, int y, int right, int bottom, uint32_t color) { RECT r = { x, y, right, bottom }; SetDCBrushColor(curr->draw_DC, color); FillRect(curr->draw_DC, &r, hdc_brush); } void drawhline(int x, int y, int x2, uint32_t color) { RECT r = { x, y, x2, y + 1 }; SetDCBrushColor(curr->draw_DC, color); FillRect(curr->draw_DC, &r, hdc_brush); } void drawvline(int x, int y, int y2, uint32_t color) { RECT r = { x, y, x + 1, y2 }; SetDCBrushColor(curr->draw_DC, color); FillRect(curr->draw_DC, &r, hdc_brush); } void setfont(int id) { SelectObject(curr->draw_DC, font[id]); } uint32_t setcolor(uint32_t color) { return SetTextColor(curr->draw_DC, color); } RECT clip[16]; static int clipk; void pushclip(int left, int top, int width, int height) { int right = left + width, bottom = top + height; RECT *r = &clip[clipk++]; r->left = left; r->top = top; r->right = right; r->bottom = bottom; HRGN rgn = CreateRectRgn(left, top, right, bottom); SelectClipRgn(curr->draw_DC, rgn); DeleteObject(rgn); } void popclip(void) { clipk--; if (!clipk) { SelectClipRgn(curr->draw_DC, NULL); return; } RECT *r = &clip[clipk - 1]; HRGN rgn = CreateRectRgn(r->left, r->top, r->right, r->bottom); SelectClipRgn(curr->draw_DC, rgn); DeleteObject(rgn); } void enddraw(int x, int y, int width, int height) { SelectObject(curr->window_DC, curr->draw_BM); BitBlt(curr->window_DC, x, y, width, height, curr->draw_DC, x, y, SRCCOPY); } void loadalpha(int bm, void *data, int UNUSED(width), int UNUSED(height)) { bitmap[bm] = data; } bool native_window_set_target(UTOX_WINDOW *window) { if (curr != window) { curr = window; return true; } return false; } uTox/src/windows/dnd.c0000600000175000001440000000757114003056216013702 0ustar rakusers#include "main.h" #include "../filesys.h" #include "../file_transfers.h" #include "../flist.h" #include "../friend.h" #include "../debug.h" #include "../tox.h" #include "../macros.h" typedef struct { IDropTarget dt; LONG ref; } my_IDropTarget; ULONG __stdcall dnd_AddRef(IDropTarget *lpMyObj) { my_IDropTarget *p = (void*)lpMyObj; return InterlockedIncrement(&p->ref); } ULONG __stdcall dnd_Release(IDropTarget *lpMyObj) { my_IDropTarget *p = (void*)lpMyObj; LONG count = InterlockedDecrement(&p->ref); if (!count) { free(lpMyObj->lpVtbl); free(lpMyObj); } return count; } HRESULT __stdcall dnd_QueryInterface(IDropTarget *lpMyObj, REFIID riid, LPVOID FAR *lppvObj) { *lppvObj = NULL; // PRINT_GUID (riid); if (IsEqualIID (riid, &IID_IUnknown) || IsEqualIID (riid, &IID_IDropTarget)) { dnd_AddRef (lpMyObj); *lppvObj = lpMyObj; return S_OK; } return E_NOINTERFACE; } HRESULT __stdcall dnd_DragEnter(IDropTarget *UNUSED(lpMyObj), IDataObject *UNUSED(pDataObject), DWORD UNUSED(grfKeyState), POINTL UNUSED(pt), DWORD *pdwEffect) { *pdwEffect = DROPEFFECT_COPY; return S_OK; } HRESULT __stdcall dnd_DragOver(IDropTarget *UNUSED(lpMyObj), DWORD UNUSED(grfKeyState), POINTL UNUSED(pt), DWORD *pdwEffect) { *pdwEffect = DROPEFFECT_COPY; return S_OK; } HRESULT __stdcall dnd_DragLeave(IDropTarget *UNUSED(lpMyObj)) { return S_OK; } HRESULT __stdcall dnd_Drop(IDropTarget *UNUSED(lpMyObj), IDataObject *pDataObject, DWORD UNUSED(grfKeyState), POINTL UNUSED(pt), DWORD *pdwEffect) { *pdwEffect = DROPEFFECT_COPY; LOG_NOTE("DnD", "Dropped!" ); if (!flist_get_sel_friend()) { return S_OK; } FORMATETC format = { .cfFormat = CF_HDROP, .dwAspect = DVASPECT_CONTENT, .lindex = -1, .tymed = TYMED_HGLOBAL, }; STGMEDIUM medium; HRESULT r = pDataObject->lpVtbl->GetData(pDataObject, &format, &medium); if (r == S_OK) { HDROP h = medium.hGlobal; int count = DragQueryFile(h, ~0, NULL, 0); LOG_INFO("WINDND", "%u files dropped\n", count); for (int i = 0; i < count; i++) { LOG_NOTE("WINDND", "Sending file number %i", i); UTOX_MSG_FT *msg = calloc(1, sizeof(UTOX_MSG_FT)); if (!msg) { LOG_ERR("WINDND", "Unable to alloc for UTOX_MSG_FT"); return 0; } char *path = calloc(1, UTOX_FILE_NAME_LENGTH); if (!path) { LOG_ERR("WINDND", "Unable to alloc for UTOX_MSG_FT"); free(msg); return 0; } DragQueryFile(h, i, path, UTOX_FILE_NAME_LENGTH); msg->file = fopen(path, "rb"); if (!msg->file) { LOG_ERR("WINDND", "Unable to read file %s" , path); free(msg); free(path); return 0; } msg->name = (uint8_t *)path; postmessage_toxcore(TOX_FILE_SEND_NEW, flist_get_sel_friend()->number, 0, msg); LOG_INFO("WINDND", "File number %i sent!" , i); } ReleaseStgMedium(&medium); } else { LOG_ERR("WINDND", "itz failed! %lX", r); } return S_OK; } void dnd_init(HWND window) { my_IDropTarget *p; p = malloc(sizeof(my_IDropTarget)); p->dt.lpVtbl = malloc(sizeof(*(p->dt.lpVtbl))); p->ref = 0; p->dt.lpVtbl->QueryInterface = dnd_QueryInterface; p->dt.lpVtbl->AddRef = dnd_AddRef; p->dt.lpVtbl->Release = dnd_Release; p->dt.lpVtbl->DragEnter = dnd_DragEnter; p->dt.lpVtbl->DragLeave = dnd_DragLeave; p->dt.lpVtbl->DragOver = dnd_DragOver; p->dt.lpVtbl->Drop = dnd_Drop; CoLockObjectExternal((struct IUnknown*)p, TRUE, FALSE); RegisterDragDrop(window, (IDropTarget*)p); } uTox/src/windows/audio.c0000600000175000001440000001602114003056216014224 0ustar rakusers#include "main.h" #include "../debug.h" #include "../macros.h" #include #include #include #include #include #include // REFERENCE_TIME time units per second and per millisecond #define REFTIMES_PER_SEC 10000000 #define REFTIMES_PER_MILLISEC 10000 #define EXIT_ON_ERROR(hres) \ if (FAILED(hres)) { \ goto Exit; \ } #define SAFE_RELEASE(punk) \ if ((punk) != NULL) { \ (punk)->lpVtbl->Release(punk); \ (punk) = NULL; \ } IAudioClient * pAudioClient = NULL; IAudioCaptureClient *pCaptureClient = NULL; WAVEFORMATEX * pwfx = NULL; // const GUID IID_IMMDeviceEnumerator = {0xa95664d2, 0x9614, 0x4f35, {0xa7,0x46, 0xde,0x8d,0xb6,0x36,0x17,0xe6}}; // const CLSID CLSID_MMDeviceEnumerator = {0xbcde0395, 0xe52f, 0x467c, {0x8e,0x3d, 0xc4,0x57,0x92,0x91,0x69,0x2e}}; // const GUID IID_IAudioClient = {0x1cb9ad4c, 0xdbfa, 0x4c32, {0xb1,0x78, 0xc2,0xf5,0x68,0xa7,0x03,0xb2}}; // const GUID KSDATAFORMAT_SUBTYPE_IEEE_FLOAT = {STATIC_KSDATAFORMAT_SUBTYPE_IEEE_FLOAT}; // const GUID KSDATAFORMAT_SUBTYPE_PCM = {STATIC_KSDATAFORMAT_SUBTYPE_PCM}; const GUID IID_IAudioCaptureClient_utox = { 0xc8adbd64, 0xe71e, 0x48a0, { 0xa4, 0xde, 0x18, 0x5c, 0x39, 0x5c, 0xd3, 0x17 } }; /* note: only works when loopback is 48khz 2 channel floating*/ void audio_detect(void) { HRESULT hr; REFERENCE_TIME hnsRequestedDuration = REFTIMES_PER_SEC; // REFERENCE_TIME hnsActualDuration; UINT32 bufferFrameCount; IMMDeviceEnumerator *pEnumerator = NULL; IMMDevice * pDevice = NULL; IMMDeviceCollection *pDeviceCollection = NULL; // BOOL bDone = FALSE; UINT count; // HANDLE hEvent = NULL; CoInitialize(NULL); hr = CoCreateInstance(&CLSID_MMDeviceEnumerator, NULL, CLSCTX_ALL, &IID_IMMDeviceEnumerator, (void **)&pEnumerator); EXIT_ON_ERROR(hr) hr = pEnumerator->lpVtbl->EnumAudioEndpoints(pEnumerator, eAll, DEVICE_STATE_ACTIVE, &pDeviceCollection); EXIT_ON_ERROR(hr) hr = pDeviceCollection->lpVtbl->GetCount(pDeviceCollection, &count); EXIT_ON_ERROR(hr) LOG_TRACE("Windows", "Audio out devices %u" , count); hr = pEnumerator->lpVtbl->GetDefaultAudioEndpoint(pEnumerator, eRender, eConsole, &pDevice); EXIT_ON_ERROR(hr) hr = pDevice->lpVtbl->Activate(pDevice, &IID_IAudioClient, CLSCTX_ALL, NULL, (void **)&pAudioClient); EXIT_ON_ERROR(hr) hr = pAudioClient->lpVtbl->GetMixFormat(pAudioClient, &pwfx); EXIT_ON_ERROR(hr) LOG_INFO("Windows Audio", "default audio format: %u %u %u %lu %lu %u %u\n", WAVE_FORMAT_PCM, pwfx->wFormatTag, pwfx->nChannels, pwfx->nSamplesPerSec, pwfx->nAvgBytesPerSec, pwfx->wBitsPerSample, pwfx->nBlockAlign); if (pwfx->nSamplesPerSec != 48000 || pwfx->nChannels != 2 || pwfx->wFormatTag != WAVE_FORMAT_EXTENSIBLE) { LOG_TRACE("Windows", "Audio - unsupported format for loopback" ); goto Exit; } WAVEFORMATEXTENSIBLE *wfx = (void *)pwfx; if (memcmp(&KSDATAFORMAT_SUBTYPE_IEEE_FLOAT, &wfx->SubFormat, sizeof(wfx->SubFormat)) != 0) { goto Exit; } /* if(memcmp(&KSDATAFORMAT_SUBTYPE_PCM, &wfx->SubFormat, sizeof(wfx->SubFormat)) == 0) { printf("pcm\n"); } else { printf("unknown\n"); }*/ hr = pAudioClient->lpVtbl->Initialize(pAudioClient, AUDCLNT_SHAREMODE_SHARED, AUDCLNT_STREAMFLAGS_LOOPBACK, hnsRequestedDuration, 0, pwfx, NULL); EXIT_ON_ERROR(hr) /*AUDCLNT_STREAMFLAGS_EVENTCALLBACK hEvent = CreateEvent(NULL, FALSE, FALSE, NULL); if (hEvent == NULL) { hr = E_FAIL; goto Exit; } hr = pAudioClient->lpVtbl-> EXIT_ON_ERROR(hr)*/ // Get the size of the allocated buffer. hr = pAudioClient->lpVtbl->GetBufferSize(pAudioClient, &bufferFrameCount); EXIT_ON_ERROR(hr) hr = pAudioClient->lpVtbl->GetService(pAudioClient, &IID_IAudioCaptureClient_utox, (void **)&pCaptureClient); EXIT_ON_ERROR(hr) LOG_TRACE("Windows", "Audio frame count %u && Samples/s %lu" , bufferFrameCount, pwfx->nSamplesPerSec); // postmessage_utox(AUDIO_IN_DEVICE, STR_AUDIO_IN_DEFAULT_LOOPBACK, 0, (void*)(size_t)1); // this has no effect on my system, so I'm commenting it out, if you can't get audio, try enabling this again! return; Exit: CoTaskMemFree(pwfx); SAFE_RELEASE(pEnumerator) SAFE_RELEASE(pDevice) SAFE_RELEASE(pAudioClient) SAFE_RELEASE(pCaptureClient) LOG_ERR("Windows", "Audio_init fail: %lu" , hr); } bool audio_init(void *UNUSED(handle)) { return SUCCEEDED(pAudioClient->lpVtbl->Start(pAudioClient)); } bool audio_close(void *UNUSED(handle)) { return SUCCEEDED(pAudioClient->lpVtbl->Stop(pAudioClient)); } static void *convertsamples(int16_t *dest, float *src, uint16_t samples) { if (!src) { memset(dest, 0, samples * 2); return NULL; } for (uint16_t i = 0; i != samples; i++) { float x = *src++; const float y = *src++; x = (x + y) * INT16_MAX / 2.0; if (x > INT16_MAX) { x = INT16_MAX; } else if (x < INT16_MIN) { x = INT16_MIN; } int16_t v = lrintf(x); *dest++ = v; // x; } return src; } bool audio_frame(int16_t *buffer) { // HRESULT hr; UINT32 numFramesAvailable; UINT32 packetLength = 0; BYTE * pData; DWORD flags; pCaptureClient->lpVtbl->GetNextPacketSize(pCaptureClient, &packetLength); // hr = pCaptureClient->lpVtbl->GetNextPacketSize(pCaptureClient, &packetLength); // EXIT_ON_ERROR(hr) while (packetLength != 0) { // Get the available data in the shared buffer. pCaptureClient->lpVtbl->GetBuffer(pCaptureClient, &pData, &numFramesAvailable, &flags, NULL, NULL); // hr = pCaptureClient->lpVtbl->GetBuffer(pCaptureClient, &pData, &numFramesAvailable, &flags, NULL, NULL); // EXIT_ON_ERROR(hr) if (flags & AUDCLNT_BUFFERFLAGS_SILENT) { pData = NULL; // Tell CopyData to write silence. } if (numFramesAvailable != 480) { LOG_ERR("Windows Audio", "Incorrect number of frames available."); } static bool frame = true; convertsamples(&buffer[frame ? 0 : 480], (void *)pData, 480); frame = !frame; // Copy the available capture data to the audio sink. // printf("%u\n", numFramesAvailable); // hr = pMySink->CopyData(pData, numFramesAvailable, &bDone); // EXIT_ON_ERROR(hr) pCaptureClient->lpVtbl->ReleaseBuffer(pCaptureClient, numFramesAvailable); // hr = pCaptureClient->lpVtbl->ReleaseBuffer(pCaptureClient, numFramesAvailable); // EXIT_ON_ERROR(hr) if (frame) { return true; } pCaptureClient->lpVtbl->GetNextPacketSize(pCaptureClient, &packetLength); // hr = pCaptureClient->lpVtbl->GetNextPacketSize(pCaptureClient, &packetLength); // EXIT_ON_ERROR(hr) } return false; } uTox/src/windows/CMakeLists.txt0000600000175000001440000000127714003056216015526 0ustar rakusersproject(utoxNATIVE LANGUAGES C) ######################################### ## Native Icon data ######################################### enable_language(RC) ######################################### ## Native Interface ######################################### add_library(utoxNATIVE STATIC audio.c dnd.c drawing.c events.c filesys.c main.c notify.c os_video.c screen_grab.c utf8.c video.c window.c ) target_link_libraries(utoxNATIVE PUBLIC iphlpapi ws2_32 gdi32 msimg32 dnsapi comdlg32 winmm ole32 oleaut32 strmiids shell32 opus PRIVATE stb ) set(WINDOWS_ICON utox.rc) uTox/src/window.h0000600000175000001440000000213214003056216012743 0ustar rakusers#ifndef WINDOW_H #define WINDOW_H typedef struct native_window UTOX_WINDOW; typedef struct panel PANEL; /** window_raze() * * Cleans and frees all the data related to a created window. */ void window_raze(UTOX_WINDOW *window); /** window_create_video() * * Currently a no-op * * Creates a window struct for a popout video window. */ void window_create_video(int x, int y, int w, int h); /** window_find_notify() * * Finds the struct for a popout interactive notification, when given * the "native" type of window. Eg, HWND in Win32 or Window for XLIB */ UTOX_WINDOW *window_find_notify(void *window); /** window_create_notify() * * Create an interactive notification window and struct. */ UTOX_WINDOW *window_create_notify(int x, int y, int w, int h, PANEL *panel); /** window_tween() * * Example code to move a window off screen. * * Pointless UI fun. */ void window_tween(UTOX_WINDOW *win); /** window_create_screen_select() * * Creates the special window for selecting a portion of screen for * screen sharing or desktop images. */ void window_create_screen_select(void); #endif uTox/src/window.c0000600000175000001440000000115414003056216012741 0ustar rakusers#include "window.h" #include "native/window.h" void window_raze(UTOX_WINDOW *window) { native_window_raze(window); } void window_create_video(int x, int y, int w, int h) { native_window_create_video(x, y, w, h); } UTOX_WINDOW *window_find_notify(void *window) { return native_window_find_notify(window); } UTOX_WINDOW *window_create_notify(int x, int y, int w, int h, PANEL *panel) { return native_window_create_notify(x, y, w, h, panel); } void window_tween(UTOX_WINDOW *win) { native_window_tween(win); } void window_create_screen_select(void) { native_window_create_screen_select(); } uTox/src/utox_theme.ini0000600000175000001440000000512414003056216014151 0ustar rakusers# This is an example uTox theme. Copy it to ~/.config/tox/utox_theme.ini. # A list of keys is in theme.h, remove COLOR_ from the front. # Colours specified in hex #---- Main chat area ---- COLOR_MAIN_BACKGROUND = FFFFFF COLOR_MAIN_TEXT = 333333 COLOR_MAIN_TEXT_CHAT = 000000 COLOR_MAIN_TEXT_SUBTEXT = 414141 COLOR_MAIN_TEXT_ACTION = 4E4EC8 COLOR_MAIN_TEXT_QUOTE = 008000 COLOR_MAIN_TEXT_URL = 001FFF COLOR_MAIN_TEXT_HINT = 969696 #---- Friend list header and bottom-left buttons ---- COLOR_MENU_BACKGROUND = 1C1C1C COLOR_MENU_TEXT = FFFFFF COLOR_MENU_SUBTEXT = D1D1D1 COLOR_MENU_HOVER_BACKGROUND = 282828 COLOR_MENU_ACTIVE_BACKGROUND = 414141 COLOR_MENU_ACTIVE_TEXT = FFFFFF #---- Friend list ---- COLOR_LIST_BACKGROUND = 414141 COLOR_LIST_HOVER_BACKGROUND = 505050 COLOR_LIST_TEXT = FFFFFF COLOR_LIST_SUBTEXT = D1D1D1 #---- Groupchat user list and title ---- COLOR_GROUP_SELF = 6BC260 COLOR_GROUP_PEER = 969696 COLOR_GROUP_AUDIO = C84E4E COLOR_GROUP_MUTED = 4E4EC8 #---- Text selection ---- COLOR_SELECTION_BACKGROUND = 333333 COLOR_SELECTION_TEXT = FFFFFF #---- Inputs, dropdowns & tooltips ---- COLOR_EDGE_NORMAL = C0C0C0 COLOR_EDGE_HOVER = 969696 COLOR_EDGE_ACTIVE = 4EA6EA COLOR_ACTIVEOPTION_BKGRND = D1D1D1 COLOR_ACTIVEOPTION_TEXT = 333333 #---- Auxiliary style for inputs/dropdowns ("Search friends" bar) ---- COLOR_AUX_BACKGROUND = 313131 COLOR_AUX_EDGE_NORMAL = 313131 COLOR_AUX_EDGE_HOVER = 999999 COLOR_AUX_EDGE_ACTIVE = 1A73B7 COLOR_AUX_TEXT = FFFFFF COLOR_AUX_ACTIVEOPTION_BKGRND = 505050 COLOR_AUX_ACTIVEOPTION_TEXT = FFFFFF #---- Status circles ---- COLOR_STATUS_ONLINE = 6BC260 COLOR_STATUS_AWAY = CEBF45 COLOR_STATUS_BUSY = C84E4E #---- Buttons ---- COLOR_BTN_SUCCESS_BKGRND = 6BC260 COLOR_BTN_SUCCESS_TEXT = FFFFFF COLOR_BTN_SUCCESS_BKGRND_HOVER = 76D56A COLOR_BTN_SUCCESS_TEXT_HOVER = FFFFFF COLOR_BTN_WARNING_BKGRND = CEBF45 COLOR_BTN_WARNING_TEXT = FFFFFF COLOR_BTN_WARNING_BKGRND_HOVER = E3D24C COLOR_BTN_WARNING_TEXT_HOVER = FFFFFF COLOR_BTN_DANGER_BACKGROUND = C84E4E COLOR_BTN_DANGER_TEXT = FFFFFF COLOR_BTN_DANGER_BKGRND_HOVER = DC5656 COLOR_BTN_DANGER_TEXT_HOVER = FFFFFF COLOR_BTN_DISABLED_BKGRND = D1D1D1 COLOR_BTN_DISABLED_TEXT = FFFFFF COLOR_BTN_DISABLED_TRANSFER = 414141 COLOR_BTN_INPROGRESS_BKGRND = 4EA6EA COLOR_BTN_INPROGRESS_TEXT = FFFFFF uTox/src/utox.h0000600000175000001440000000340514003056216012437 0ustar rakusers#ifndef UTOX_H #define UTOX_H #include /* uTox client thread messages (received by the client thread) */ typedef enum utox_msg_id { /* General core and networking messages */ TOX_DONE, // 0 DHT_CONNECTED, /* OS interaction/integration messages*/ AUDIO_IN_DEVICE, AUDIO_OUT_DEVICE, /* Client/User Interface messages. */ REDRAW, TOOLTIP_SHOW, SELF_AVATAR_SET, UPDATE_TRAY, PROFILE_DID_LOAD, /* File transfer messages */ FILE_SEND_NEW, FILE_INCOMING_NEW, FILE_INCOMING_NEW_INLINE, FILE_INCOMING_NEW_INLINE_DONE, FILE_INCOMING_ACCEPT, FILE_STATUS_UPDATE, FILE_STATUS_UPDATE_DATA, FILE_STATUS_DONE, /* Friend interaction messages. */ /* Handshake */ FRIEND_ONLINE, FRIEND_NAME, FRIEND_STATUS_MESSAGE, FRIEND_STATE, FRIEND_AVATAR_SET, FRIEND_AVATAR_UNSET, /* Interactions */ FRIEND_TYPING, FRIEND_MESSAGE, FRIEND_MESSAGE_UPDATE, /* Adding and deleting */ FRIEND_INCOMING_REQUEST, FRIEND_ACCEPT_REQUEST, FRIEND_SEND_REQUEST, FRIEND_ADD_NO_REQ, FRIEND_REMOVE, /* Audio & Video calls, */ AV_CALL_INCOMING, AV_CALL_RINGING, AV_CALL_ACCEPTED, AV_CALL_DISCONNECTED, AV_VIDEO_FRAME, AV_INLINE_FRAME, AV_CLOSE_WINDOW, /* Group interactions, commented out for the new groupchats (coming soon maybe?) */ GROUP_ADD, GROUP_MESSAGE, GROUP_PEER_ADD, GROUP_PEER_DEL, GROUP_PEER_NAME, GROUP_PEER_CHANGE, GROUP_TOPIC, GROUP_AUDIO_START, GROUP_AUDIO_END, GROUP_UPDATE, } UTOX_MSG; void postmessage_utox(UTOX_MSG msg, uint16_t param1, uint16_t param2, void *data); void utox_message_dispatch(UTOX_MSG utox_msg_id, uint16_t param1, uint16_t param2, void *data); #endif uTox/src/utox.desktop0000600000175000001440000000047014003056216013660 0ustar rakusers[Desktop Entry] Version=1.0 Type=Application Name=uTox Comment=A lightweight Tox client Comment[ru]=легковесный клиент Tox Comment[de]=Ein leichtgewichtiger Tox Client TryExec=utox Exec=utox Icon=utox Categories=InstantMessaging;AudioVideo;Network; Terminal=false MimeType=x-scheme-handler/tox; uTox/src/utox.c0000600000175000001440000005314714003056216012442 0ustar rakusers#include "utox.h" #include "avatar.h" #include "commands.h" #include "debug.h" #include "file_transfers.h" #include "filesys.h" #include "flist.h" #include "friend.h" #include "groups.h" #include "settings.h" #include "tox.h" #include "av/utox_av.h" #include "av/video.h" #include "ui/dropdown.h" #include "ui/edit.h" #include "ui/tooltip.h" #include "layout/friend.h" #include "layout/settings.h" // TODO including native.h files should never be needed, refactor filesys.h to provide necessary API #include "native/filesys.h" #include "native/notify.h" #include "native/ui.h" #include "native/video.h" #include #include /** Translates status code to text then sends back to the user */ static void file_notify(FRIEND *f, MSG_HEADER *msg) { STRING *str; switch (msg->via.ft.file_status) { case FILE_TRANSFER_STATUS_NONE: { str = SPTR(TRANSFER_NEW); break; } case FILE_TRANSFER_STATUS_ACTIVE: { str = SPTR(TRANSFER_STARTED); break; } case FILE_TRANSFER_STATUS_PAUSED_BOTH: { str = SPTR(TRANSFER___); break; } case FILE_TRANSFER_STATUS_PAUSED_US: case FILE_TRANSFER_STATUS_PAUSED_THEM: { str = SPTR(TRANSFER_PAUSED); break; } case FILE_TRANSFER_STATUS_KILLED: { str = SPTR(TRANSFER_CANCELLED); break; } case FILE_TRANSFER_STATUS_COMPLETED: { str = SPTR(TRANSFER_COMPLETE); break; } case FILE_TRANSFER_STATUS_BROKEN: default: { // render unknown status as "transfer broken" str = SPTR(TRANSFER_BROKEN); break; } } friend_notify_msg(f, str->str, str->length); } static void call_notify(FRIEND *f, uint8_t status) { STRING *str; switch (status) { case UTOX_AV_INVITE: { str = SPTR(CALL_INVITED); break; } case UTOX_AV_RINGING: { str = SPTR(CALL_RINGING); break; } case UTOX_AV_STARTED: { str = SPTR(CALL_STARTED); break; } default: { // render unknown status as "call canceled" str = SPTR(CALL_CANCELLED); break; } } friend_notify_msg(f, str->str, str->length); } void utox_message_dispatch(UTOX_MSG utox_msg_id, uint16_t param1, uint16_t param2, void *data) { switch (utox_msg_id) { /* General core and networking messages */ case TOX_DONE: { /* Does nothing. */ break; } case DHT_CONNECTED: { /* param1: connection status (1 = connected, 0 = disconnected) */ tox_connected = param1; if (tox_connected) { LOG_NOTE("uTox", "Connected to DHT!" ); } else { LOG_NOTE("uTox", "Disconnected from DHT!" ); } redraw(); break; } /* OS interaction/integration messages */ case AUDIO_IN_DEVICE: { /* param1: string * param2: default device? * data: device identifier. */ if (UI_STRING_ID_INVALID == param1) { dropdown_list_add_hardcoded(&dropdown_audio_in, data, data); } else { dropdown_list_add_localized(&dropdown_audio_in, param1, data); } if (settings.audio_device_in == (uint16_t)~0 && param2) { settings.audio_device_in = (dropdown_audio_in.dropcount - 1); } if (settings.audio_device_in != 0 && (dropdown_audio_in.dropcount - 1) == settings.audio_device_in) { postmessage_utoxav(UTOXAV_SET_AUDIO_IN, 0, 0, data); dropdown_audio_in.selected = settings.audio_device_in; settings.audio_device_in = 0; } break; } case AUDIO_OUT_DEVICE: { dropdown_list_add_hardcoded(&dropdown_audio_out, data, data); if (settings.audio_device_out != 0 && (dropdown_audio_out.dropcount - 1) == settings.audio_device_out) { postmessage_utoxav(UTOXAV_SET_AUDIO_OUT, 0, 0, data); dropdown_audio_out.selected = settings.audio_device_out; settings.audio_device_out = 0; } break; } /* Client/User Interface messages. */ case REDRAW: { if (param1) { ui_rescale(ui_scale); } else { ui_set_scale(0); } redraw(); break; } case TOOLTIP_SHOW: { tooltip_show(); redraw(); break; } case SELF_AVATAR_SET: { /* param1: size of data * data: png data */ self_set_and_save_avatar(data, param1); free(data); redraw(); break; } case UPDATE_TRAY: { update_tray(); break; } case PROFILE_DID_LOAD: { if (g_select_add_friend_later) { g_select_add_friend_later = 0; flist_selectaddfriend(); } redraw(); break; } /* File transfer messages */ // data: FILE_TRANSFER *file // param1: uint32_t friend_number // param2: uint32_t file_number case FILE_SEND_NEW: { if (!data) { break; } FRIEND *f = get_friend(param1); if (!f) { LOG_ERR("uTox", "Could not get friend with number: %u", param1); return; } FILE_TRANSFER *file = data; MSG_HEADER *m = message_add_type_file(&f->msg, param2, file->incoming, file->inline_img, file->status, file->name, file->name_length, file->target_size, file->current_size); file_notify(f, m); ft_set_ui_data(file->friend_number, file->file_number, m); free(data); redraw(); break; } case FILE_INCOMING_NEW: { if (!data) { break; } FRIEND *f = get_friend(param1); if (!f) { LOG_ERR("uTox", "Could not get friend with number: %u", param1); return; } FILE_TRANSFER *file = data; if (f->ft_autoaccept) { LOG_TRACE("Toxcore", "Auto Accept enabled for this friend: sending accept to system" ); native_autoselect_dir_ft(param1, file); } MSG_HEADER *m = message_add_type_file(&f->msg, (param2 + 1) << 16, file->incoming, file->inline_img, file->status, file->name, file->name_length, file->target_size, file->current_size); file_notify(f, m); ft_set_ui_data(file->friend_number, file->file_number, m); free(data); redraw(); break; } case FILE_INCOMING_NEW_INLINE: { if (!data) { break; } FRIEND *f = get_friend(param1); if (!f) { LOG_ERR("uTox", "Could not get friend with number: %u", param1); return; } // Process image data uint16_t width, height; uint8_t *image; memcpy(&width, data, sizeof(uint16_t)); memcpy(&height, (uint8_t *)data + sizeof(uint16_t), sizeof(uint16_t)); memcpy(&image, (uint8_t *)data + sizeof(uint16_t) * 2, sizeof(uint8_t *)); // Save and store image friend_recvimage(f, (NATIVE_IMAGE *)image, width, height); redraw(); free(data); break; } case FILE_INCOMING_NEW_INLINE_DONE: { if (!data) { break; } FRIEND *f = get_friend(param1); if (!f) { LOG_ERR("uTox", "Could not get friend with number: %u", param1); return; } FILE_TRANSFER *file = data; // Add file transfer message so user can save the inline. MSG_HEADER *m = message_add_type_file(&f->msg, param2, file->incoming, file->inline_img, file->status, file->name, file->name_length, file->target_size, file->current_size); file_notify(f, m); ft_set_ui_data(file->friend_number, file->file_number, m); redraw(); break; } case FILE_INCOMING_ACCEPT: { postmessage_toxcore(TOX_FILE_ACCEPT, param1, param2 << 16, data); break; } case FILE_STATUS_UPDATE: { if (!data) { break; } FILE_TRANSFER *file = data; if (file->ui_data) { file->ui_data->via.ft.progress = file->current_size; file->ui_data->via.ft.speed = file->speed; file->ui_data->via.ft.file_status = param1; } free(data); redraw(); break; } case FILE_STATUS_UPDATE_DATA: { if (!data) { break; } FILE_TRANSFER *file = data; if (file->ui_data) { if (param1 == FILE_TRANSFER_STATUS_COMPLETED) { if (file->in_memory) { file->ui_data->via.ft.data = file->via.memory; file->ui_data->via.ft.data_size = file->current_size; } else { memcpy(file->ui_data->via.ft.path, file->path, UTOX_FILE_NAME_LENGTH); } } } file->decon_wait = false; LOG_NOTE("uTox", "FT data was saved" ); redraw(); break; } // data: MSG_HEADER *ui_data // param1: UTOX_FILE_TRANSFER_STATUS file_status // File is done, failed or broken. case FILE_STATUS_DONE: { LOG_INFO("uTox", "FT done. Updating UI."); if (!data) { LOG_INFO("uTox", "FT done but no data about it."); break; } MSG_HEADER *msg = data; msg->via.ft.file_status = param1; redraw(); break; } /* Friend interaction messages. */ /* Handshake * param1: friend id * param2: new online status(bool) */ case FRIEND_ONLINE: { FRIEND *f = get_friend(param1); if (friend_set_online(f, param2)) { redraw(); } messages_send_from_queue(&f->msg, param1); break; } case FRIEND_NAME: { FRIEND *f = get_friend(param1); friend_setname(f, data, param2); redraw(); free(data); break; } case FRIEND_STATUS_MESSAGE: { FRIEND *f = get_friend(param1); free(f->status_message); f->status_length = param2; f->status_message = data; redraw(); break; } case FRIEND_STATE: { FRIEND *f = get_friend(param1); f->status = param2; redraw(); break; } case FRIEND_AVATAR_SET: { /* param1: friend id * param2: png size * data: png data */ FRIEND *f = get_friend(param1); uint8_t *avatar = data; size_t size = param2; avatar_set(f->avatar, avatar, size); avatar_save(f->id_str, avatar, size); free(avatar); redraw(); break; } case FRIEND_AVATAR_UNSET: { FRIEND *f = get_friend(param1); avatar_unset(f->avatar); // remove avatar from disk avatar_delete(f->id_str); redraw(); break; } /* Interactions */ case FRIEND_TYPING: { FRIEND *f = get_friend(param1); friend_set_typing(f, param2); redraw(); break; } case FRIEND_MESSAGE: { // TODO implement notification //notify_new(NULL, NULL); redraw(); break; } case FRIEND_MESSAGE_UPDATE: { redraw(); break; } /* Adding and deleting */ case FRIEND_INCOMING_REQUEST: { /* data: pointer to FREQUEST structure */ flist_add_frequest(get_frequest(param1)); redraw(); break; } case FRIEND_ACCEPT_REQUEST: { /* confirmation that friend has been added to friend list (accept) */ FREQUEST *req = data; FRIEND *f = get_friend(param1); if (!f) { LOG_ERR("uTox", "Could not get friend with number: %u", param2); return; } flist_add_friend_accepted(f, req); flist_reselect_current(); redraw(); break; } case FRIEND_ADD_NO_REQ: { /* confirmation that friend has been added to friend list (add) */ if (param1) { /* friend was not added */ addfriend_status = param2; } else { /* friend was added */ edit_add_new_friend_id.length = 0; edit_add_new_friend_msg.length = 0; FRIEND *f = get_friend(param2); if (!f) { LOG_ERR("uTox", "Could not get friend with number: %u", param2); free(data); return; } flist_add_friend(f, NULL, 0); flist_selectchat(f->number); addfriend_status = ADDF_NOFREQUESTSENT; } free(data); redraw(); break; } case FRIEND_SEND_REQUEST: { /* confirmation that friend has been added to friend list (add) */ if (param1) { /* friend was not added */ addfriend_status = param2; } else { /* friend was added */ FRIEND *f = get_friend(param2); if (!f) { edit_add_new_friend_id.length = 0; edit_add_new_friend_msg.length = 0; LOG_ERR("uTox", "Could not get friend with number: %u", param2); free(data); return; } memcpy(f->id_bin, data, TOX_PUBLIC_KEY_SIZE); char *request_message = strdup(edit_add_new_friend_msg.data); if (request_message) { flist_add_friend(f, request_message, edit_add_new_friend_msg.length); free(request_message); } else { LOG_ERR("uTox", "Could not allocate memory for request message."); } flist_selectchat(f->number); addfriend_status = ADDF_SENT; edit_add_new_friend_id.length = 0; edit_add_new_friend_msg.length = 0; } free(data); redraw(); break; } case FRIEND_REMOVE: { FRIEND *f = data; // commented out in case you have multiple clients in the same data dir // and remove one as friend from the other // (it would remove his avatar locally too otherwise) // char cid[TOX_PUBLIC_KEY_SIZE * 2]; // cid_to_string(cid, f->cid); // delete_saved_avatar(friend_number); friend_free(f); break; } case AV_CALL_INCOMING: { FRIEND *f = get_friend(param1); if (!f) { LOG_ERR("uTox", "Could not get friend with number: %u", param1); return; } call_notify(f, UTOX_AV_INVITE); redraw(); break; } case AV_CALL_RINGING: { FRIEND *f = get_friend(param1); if (!f) { LOG_ERR("uTox", "Could not get friend with number: %u", param1); return; } call_notify(f, UTOX_AV_RINGING); redraw(); break; } case AV_CALL_ACCEPTED: { FRIEND *f = get_friend(param1); if (!f) { LOG_ERR("uTox", "Could not get friend with number: %u", param1); return; } call_notify(f, UTOX_AV_STARTED); redraw(); break; } case AV_CALL_DISCONNECTED: { FRIEND *f = get_friend(param1); if (!f) { LOG_ERR("uTox", "Could not get friend with number: %u", param1); return; } call_notify(f, UTOX_AV_NONE); redraw(); break; } case AV_VIDEO_FRAME: { /* param1: video handle to send frame to (friend id + 1 or 0 for preview) param2: self preview frame for pending call. data: packaged frame data */ UTOX_FRAME_PKG *frame = data; STRING *s = SPTR(WINDOW_TITLE_VIDEO_PREVIEW); // TODO: Don't try to start a new video session every frame. video_begin(param1, s->str, s->length, frame->w, frame->h); video_frame(param1, frame->img, frame->w, frame->h, 0); free(frame->img); free(data); redraw(); break; } case AV_INLINE_FRAME: { redraw(); break; } case AV_CLOSE_WINDOW: { LOG_INFO("uTox", "Closing video feed" ); video_end(param1); redraw(); break; } /* Group chat functions */ case GROUP_ADD: { /* param1: group number param2: whether its an av call or not */ GROUPCHAT *g = get_group(param1); if (!g) { return; } flist_add_group(g); flist_select_last(); redraw(); break; } case GROUP_MESSAGE: { GROUPCHAT *g = get_group(param1); if (!g) { return; } GROUPCHAT *selected = flist_get_sel_group(); if (selected != g) { g->unread_msg = true; } redraw(); // ui_drawmain(); break; } case GROUP_PEER_DEL: { GROUPCHAT *g = get_group(param1); if (!g) { return; } if (g->av_group) { g->last_recv_audio[param2] = g->last_recv_audio[g->peer_count]; g->last_recv_audio[g->peer_count] = 0; group_av_peer_remove(g, param2); g->source[param2] = g->source[g->peer_count]; } snprintf((char *)g->topic, sizeof(g->topic), "%u users in chat", g->peer_count); g->topic_length = strnlen(g->topic, sizeof(g->topic) - 1); redraw(); break; } case GROUP_PEER_ADD: case GROUP_PEER_NAME: case GROUP_PEER_CHANGE: { /* param1: group number * param2: peer number */ GROUPCHAT *g = get_group(param1); if (!g) { return; } snprintf((char *)g->topic, sizeof(g->topic), "%u users in chat", g->peer_count); g->topic_length = strnlen(g->topic, sizeof(g->topic) - 1); GROUPCHAT *selected = flist_get_sel_group(); if (selected != g) { g->unread_msg = true; } redraw(); break; } case GROUP_TOPIC: { GROUPCHAT *g = get_group(param1); if (!g) { return; } if (param2 > sizeof(g->name)) { memcpy(g->name, data, sizeof(g->name)); g->name_length = sizeof(g->name); } else { memcpy(g->name, data, param2); g->name_length = param2; } free(data); redraw(); break; } case GROUP_AUDIO_START: { /* param1: group number */ GROUPCHAT *g = get_group(param1); if (!g) { LOG_ERR("uTox", "Can't get group %u", param1); return; } if (g->av_group) { LOG_INFO("uTox", "We are in an audio group starting call."); g->active_call = true; postmessage_utoxav(UTOXAV_GROUPCALL_START, param1, 0, NULL); redraw(); } break; } case GROUP_AUDIO_END: { /* param1: group number */ GROUPCHAT *g = get_group(param1); if (!g) { LOG_ERR("uTox", "Can't get group %u", param1); return; } LOG_INFO("uTox", "We are in an audio group ending call."); g->active_call = false; postmessage_utoxav(UTOXAV_GROUPCALL_END, param1, 0, NULL); redraw(); break; } case GROUP_UPDATE: { redraw(); break; } } } uTox/src/ui_i18n.h0000600000175000001440000001403314003056216012713 0ustar rakusers#ifndef UI_I18N_H #define UI_I18N_H //"CZECH" "Čeština" #define _LANG_ID LANG_CS LANG_POSIX_LOCALE("cs_CZ") LANG_WINDOWS_ID(0x0405) #include "../langs/en.h" //fallback to English for untranslated things #include "../langs/cs.h" #undef _LANG_ID //"BULGARIAN" "Български" #define _LANG_ID LANG_BG LANG_POSIX_LOCALE("bg_BG") LANG_WINDOWS_ID(0x0402) #include "../langs/en.h" //fallback to English for untranslated things #include "../langs/bg.h" #undef _LANG_ID //"GERMAN" "Deutsch" #define _LANG_ID LANG_DE LANG_POSIX_LOCALE("de_DE") LANG_WINDOWS_ID(0x0407) LANG_PRIORITY(-1) // Ensure this lang gets chosen for unknown de locales. #include "../langs/en.h" //fallback to English for untranslated things #include "../langs/de.h" #undef _LANG_ID //"ENGLISH" "English" #define _LANG_ID LANG_EN LANG_POSIX_LOCALE("en_US") LANG_WINDOWS_ID(0x0409) LANG_PRIORITY(-1) // Ensure this lang gets chosen for unknown en locales. #include "../langs/en.h" #undef _LANG_ID //"SPANISH" "Spanish" #define _LANG_ID LANG_ES LANG_POSIX_LOCALE("es_ES") LANG_WINDOWS_ID(0x040A) LANG_PRIORITY(-1) // Ensure this lang gets chosen for unknown es locales. #include "../langs/en.h" //fallback to English for untranslated things #include "../langs/es.h" #undef _LANG_ID //"FRENCH" "Français" #define _LANG_ID LANG_FR LANG_POSIX_LOCALE("fr_FR") LANG_WINDOWS_ID(0x040C) LANG_PRIORITY(-1) // Ensure this lang gets chosen for unknown fr locales. #include "../langs/en.h" //fallback to English for untranslated things #include "../langs/fr.h" #undef _LANG_ID //"HINDI" "Hindi" #define _LANG_ID LANG_HI LANG_POSIX_LOCALE("hi_IN") LANG_WINDOWS_ID(0x0439) #include "../langs/en.h" //fallback to English for untranslated things #include "../langs/hi.h" #undef _LANG_ID //"JAPANESE" "日本語" #define _LANG_ID LANG_JA LANG_POSIX_LOCALE("ja_JP") LANG_WINDOWS_ID(0x0411) #include "../langs/en.h" //fallback to English for untranslated things #include "../langs/ja.h" #undef _LANG_ID //"ITALIAN" "Italiano" #define _LANG_ID LANG_IT LANG_POSIX_LOCALE("it_IT") LANG_WINDOWS_ID(0x0410) #include "../langs/en.h" //fallback to English for untranslated things #include "../langs/it.h" #undef _LANG_ID //"LATVIAN" "Latviešu" #define _LANG_ID LANG_LV LANG_POSIX_LOCALE("lv_LV") LANG_WINDOWS_ID(0x0426) #include "../langs/en.h" //fallback to English for untranslated things #include "../langs/lv.h" #undef _LANG_ID //"DUTCH" "Nederlands" #define _LANG_ID LANG_NL LANG_POSIX_LOCALE("nl_NL") LANG_WINDOWS_ID(0x0413) #include "../langs/en.h" //fallback to English for untranslated things #include "../langs/nl.h" #undef _LANG_ID //"NORWEGIAN" "Norsk" #define _LANG_ID LANG_NO LANG_POSIX_LOCALE("no_NO") LANG_WINDOWS_ID(0x0414) #include "../langs/en.h" //fallback to English for untranslated things #include "../langs/no.h" #undef _LANG_ID //"POLISH" "Polski" #define _LANG_ID LANG_PL LANG_POSIX_LOCALE("pl_PL") LANG_WINDOWS_ID(0x0415) #include "../langs/en.h" //fallback to English for untranslated things #include "../langs/pl.h" #undef _LANG_ID //"BRAZILIAN PORTUGUESE" "Português brasileiro" #define _LANG_ID LANG_BR LANG_POSIX_LOCALE("pt_BR") LANG_WINDOWS_ID(0x0416) #include "../langs/en.h" //fallback to English for untranslated things #include "../langs/br.h" #undef _LANG_ID //"ROMANIAN" "Română" #define _LANG_ID LANG_RO LANG_POSIX_LOCALE("ro_RO") LANG_WINDOWS_ID(0x0418) #include "../langs/en.h" //fallback to English for untranslated things #include "../langs/ro.h" #undef _LANG_ID //"RUSSIAN" "Русский" #define _LANG_ID LANG_RU LANG_POSIX_LOCALE("ru_RU") LANG_WINDOWS_ID(0x0419) #include "../langs/en.h" //fallback to English for untranslated things #include "../langs/ru.h" #undef _LANG_ID //"TURKISH" "Türk" #define _LANG_ID LANG_TR LANG_POSIX_LOCALE("tr_TR") LANG_WINDOWS_ID(0x041F) #include "../langs/en.h" //fallback to English for untranslated things #include "../langs/tr.h" #undef _LANG_ID //"UKRAINIAN" "Українська" #define _LANG_ID LANG_UK LANG_POSIX_LOCALE("uk_UA") LANG_WINDOWS_ID(0x0422) #include "../langs/en.h" //fallback to English for untranslated things #include "../langs/uk.h" #undef _LANG_ID //"SIMPLIFIED CHINESE" "简体中文" #define _LANG_ID LANG_CN LANG_POSIX_LOCALE("zh_CN") LANG_WINDOWS_ID(0x0804) LANG_PRIORITY(-1) // Ensure this lang gets chosen for unknown zh locales. #include "../langs/en.h" //fallback to English for untranslated things #include "../langs/cn.h" #undef _LANG_ID //"TRADITIONAL CHINESE" "繁體中文" #define _LANG_ID LANG_TW LANG_POSIX_LOCALE("zh_TW") LANG_WINDOWS_ID(0x0404) #include "../langs/en.h" //fallback to English for untranslated things #include "../langs/tw.h" #undef _LANG_ID //"DANISH" "Dansk" #define _LANG_ID LANG_DK LANG_POSIX_LOCALE("da_DK") LANG_WINDOWS_ID(0x0406) #include "../langs/en.h" //fallback to English for untranslated things #include "../langs/dk.h" #undef _LANG_ID //"SWEDISH" "Svenska" #define _LANG_ID LANG_SV LANG_POSIX_LOCALE("sv_SE") LANG_WINDOWS_ID(0x041d) #include "../langs/en.h" //fallback to English for untranslated things #include "../langs/sv.h" #undef _LANG_ID //"HUNGARIAN" "Magyar" #define _LANG_ID LANG_HU LANG_POSIX_LOCALE("hu_HU") LANG_WINDOWS_ID(0x040E) #include "../langs/en.h" //fallback to English for untranslated things #include "../langs/hu.h" #undef _LANG_ID //"PORTUGUESE" "Português de Portugal" #define _LANG_ID LANG_PT LANG_POSIX_LOCALE("pt_PT") LANG_WINDOWS_ID(0x0816) #include "../langs/en.h" //fallback to English for untranslated things #include "../langs/pt.h" #undef _LANG_ID //"ESPERANTO" "Esperanto" #define _LANG_ID LANG_EO LANG_POSIX_LOCALE("eo") // LANG_WINDOWS_ID(0x0000) #include "../langs/en.h" //fallback to English for untranslated things #include "../langs/eo.h" #undef _LANG_ID //"CROATIAN" "hrvatski" #define _LANG_ID LANG_HR LANG_POSIX_LOCALE("hr_HR") LANG_WINDOWS_ID(0x041A) #include "../langs/en.h" //fallback to English for untranslated things #include "../langs/hr.h" #undef _LANG_ID //"ESTONIAN" "eesti" #define _LANG_ID LANG_ET LANG_POSIX_LOCALE("et_EE") LANG_WINDOWS_ID(0x0425) #include "../langs/en.h" //fallback to English for untranslated things #include "../langs/et.h" #undef _LANG_ID #endif uTox/src/ui_i18n.c0000600000175000001440000001236714003056216012716 0ustar rakusers#include "../langs/i18n_decls.h" #include "sized_string.h" #include "macros.h" #include #include #ifdef msgid #error "msgid is already defined" #endif #ifdef msgstr #error "msgstr is already defined" #endif #ifdef LANG_POSIX_LOCALE #error "LANG_POSIX_LOCALE is already defined" #endif #ifdef LANG_WINDOWS_ID #error "LANG_WINDOWS_ID is already defined" #endif #ifdef LANG_PRIORITY #error "LANG_PRIORITY is already defined" #endif /***** Parsing localized strings *****/ #define msgid(x) curr_id = (STR_##x); #define msgstr(x) \ localized_strings[_LANG_ID][curr_id].str = (x); \ localized_strings[_LANG_ID][curr_id].length = sizeof(x) - 1; #define LANG_WINDOWS_ID(x) #define LANG_POSIX_LOCALE(x) #define LANG_PRIORITY(x) static STRING canary = STRING_INIT("BUG. PLEASE REPORT."); static void init_strings(STRING (*localized_strings)[NUM_STRS]) { for (UTOX_LANG i = 0; i < NUM_LANGS; i++) { for (UTOX_I18N_STR j = 0; j < NUM_STRS; j++) { localized_strings[i][j] = canary; } } UTOX_I18N_STR curr_id = 0; #include "ui_i18n.h" } #undef LANG_PRIORITY #undef LANG_POSIX_LOCALE #undef LANG_WINDOWS_ID #undef msgstr #undef msgid STRING *ui_gettext(UTOX_LANG lang, UTOX_I18N_STR string_id) { static STRING localized_strings[NUM_LANGS][NUM_STRS]; static int ready = 0; if (!ready) { init_strings(localized_strings); ready = 1; } if ((lang >= NUM_LANGS) || (string_id >= NUM_STRS)) { return &canary; } return &localized_strings[lang][string_id]; } /***** Parsing detection by POSIX locale *****/ #define msgid(x) #define msgstr(x) #define LANG_WINDOWS_ID(x) #define LANG_POSIX_LOCALE(x) posix_locales[_LANG_ID] = (x); #define LANG_PRIORITY(x) priorities[_LANG_ID] = (x); static void init_posix_locales(const char *UNUSED(posix_locales[]), int8_t UNUSED(priorities[])) { #include "ui_i18n.h" } #undef LANG_PRIORITY #undef LANG_POSIX_LOCALE #undef LANG_WINDOWS_ID #undef msgstr #undef msgid UTOX_LANG ui_guess_lang_by_posix_locale(const char *locale, UTOX_LANG deflt) { static const char *posix_locales[NUM_LANGS]; static int8_t priorities[NUM_LANGS]; static int ready = 0; if (!ready) { init_posix_locales(posix_locales, priorities); ready = 1; } UTOX_LANG found_lang = 0; int8_t found_prio = INT8_MAX; // Try detecting by full prefix match first. for (UTOX_LANG i = 0; i < NUM_LANGS; i++) { const char *l = posix_locales[i]; if (!l) { continue; } if (strstr(locale, l)) { if (found_prio > priorities[i]) { found_lang = i; found_prio = priorities[i]; } } } if (found_prio < INT8_MAX) { return found_lang; } // It appears we haven't found exact language_territory // match (e.g. zh_TW) for given locale. , // Try stripping territory off and search only by language part. for (UTOX_LANG i = 0; i < NUM_LANGS; i++) { const char *l = posix_locales[i]; if (!l) { continue; } char *sep = strchr(l, '_'); if (!sep) { continue; } if (!strncmp(locale, l, sep - l)) { if (found_prio > priorities[i]) { found_lang = i; found_prio = priorities[i]; } } } return found_prio < INT8_MAX ? found_lang : deflt; } /***** Parsing detection by Windows language id *****/ #define msgid(x) #define msgstr(x) #define LANG_WINDOWS_ID(x) windows_lang_ids[_LANG_ID] = (x); #define LANG_POSIX_LOCALE(x) #define LANG_PRIORITY(x) priorities[_LANG_ID] = (x); static void init_windows_lang_ids(uint16_t UNUSED(windows_lang_ids[]), int8_t UNUSED(priorities[])) { #include "ui_i18n.h" } #undef LANG_PRIORITY #undef LANG_POSIX_LOCALE #undef LANG_WINDOWS_ID #undef msgstr #undef msgid UTOX_LANG ui_guess_lang_by_windows_lang_id(uint16_t lang_id, UTOX_LANG deflt) { static uint16_t windows_lang_ids[NUM_LANGS]; static int8_t priorities[NUM_LANGS]; static int ready = 0; if (!ready) { init_windows_lang_ids(windows_lang_ids, priorities); ready = 1; } UTOX_LANG found_lang = 0; int8_t found_prio = INT8_MAX; // Try detecting by full match first, including sublanguage part. for (UTOX_LANG i = 0; i < NUM_LANGS; i++) { uint16_t l = windows_lang_ids[i]; if (!l) { continue; } if (l == lang_id) { if (found_prio > priorities[i]) { found_lang = i; found_prio = priorities[i]; } } } if (found_prio < INT8_MAX) { return found_lang; } // It appears we haven't found exact id match. // Try matching by the lower 8 bits, which contain language family part. for (UTOX_LANG i = 0; i < NUM_LANGS; i++) { uint16_t l = windows_lang_ids[i]; if (!l) { continue; } if ((l & 0xFF) == (lang_id & 0xFF)) { if (found_prio > priorities[i]) { found_lang = i; found_prio = priorities[i]; } } } return found_prio < INT8_MAX ? found_lang : deflt; } uTox/src/ui/0000700000175000001440000000000014003056216011700 5ustar rakusersuTox/src/ui/tooltip.h0000600000175000001440000000103614003056216013545 0ustar rakusers#ifndef TOOLTIP_H #define TOOLTIP_H #include typedef struct maybe_i18nal_string MAYBE_I18NAL_STRING; typedef struct tooltip { int x, y, width, height; bool visible; bool can_show; bool mouse_down; bool thread; MAYBE_I18NAL_STRING *tt_text; } TOOLTIP; // removes the tooltip, requires a redraw void tooltip_reset(void); void tooltip_draw(void); bool tooltip_mmove(void); bool tooltip_mdown(void); bool tooltip_mup(void); void tooltip_show(void); void tooltip_new(MAYBE_I18NAL_STRING *text); #endif uTox/src/ui/tooltip.c0000600000175000001440000000730614003056216013546 0ustar rakusers#include "tooltip.h" #include "draw.h" #include "../macros.h" #include "../settings.h" #include "../theme.h" #include "../ui.h" #include "../utox.h" #include "../native/thread.h" #include "../native/time.h" static TOOLTIP tooltip; #define TOOLTIP_WIDTH SCALE(24) #define TOOLTIP_HEIGHT SCALE(24) #define TOOLTIP_YOFFSET 12 static void calculate_pos_and_width(TOOLTIP *b, int *x, int *w) { *x = b->x; *w = b->width; // Increase width if needed, so that tooltip text fits. if (maybe_i18nal_string_is_valid(b->tt_text)) { const STRING *s = maybe_i18nal_string_get(b->tt_text); const int needed_w = textwidth(s->str, s->length) + SCALE(8); if (*w < needed_w) { *w = needed_w; } } // Push away from the right border to fit. if (*x + *w >= (int)settings.window_width) { *x -= *w; } // Draw only within window if (*x < 0) { *x = 0; } } volatile bool kill_thread; void tooltip_reset(void) { TOOLTIP *b = &tooltip; b->visible = false; b->can_show = false; if (b->thread) { kill_thread = true; b->thread = false; } } void tooltip_draw(void) { TOOLTIP *b = &tooltip; if (!b->visible) { return; } // Ensure that font is set before calculating position and width. setfont(FONT_TEXT); setcolor(COLOR_MAIN_TEXT); int x, w; calculate_pos_and_width(b, &x, &w); draw_rect_fill(x, b->y, w, b->height, COLOR_BKGRND_MAIN); STRING *s = maybe_i18nal_string_get(b->tt_text); drawtext(x + SCALE(4), b->y + SCALE(4), s->str, s->length); draw_rect_frame(x, b->y, w, b->height, COLOR_EDGE_NORMAL); } bool tooltip_mmove(void) { TOOLTIP *b = &tooltip; b->can_show = false; if (!b->visible) { return false; } b->visible = false; if (b->thread) { kill_thread = true; b->thread = false; } return true; } bool tooltip_mdown(void) { TOOLTIP *b = &tooltip; b->can_show = false; b->mouse_down = true; b->visible = false; if (b->thread) { kill_thread = true; b->thread = false; } return false; } bool tooltip_mup(void) { TOOLTIP *b = &tooltip; b->can_show = false; b->mouse_down = false; if (b->thread) { kill_thread = true; b->thread = false; } return false; } void tooltip_show(void) { TOOLTIP *b = &tooltip; if (!b->can_show) { return; } b->y = mouse.y + TOOLTIP_YOFFSET; b->height = TOOLTIP_HEIGHT; if (b->y + b->height >= (int)settings.window_height) { b->y -= (b->height + TOOLTIP_YOFFSET); } b->x = mouse.x; b->width = TOOLTIP_WIDTH; b->visible = true; if (b->thread) { kill_thread = true; b->thread = false; } } volatile bool reset_time; static void tooltip_thread(void *UNUSED(args)) { uint64_t last_move_time = ~0; while (1) { if (kill_thread) { break; } if (reset_time) { last_move_time = get_time() + 500 * 1000 * 1000; reset_time = 0; } if (get_time() > last_move_time) { postmessage_utox(TOOLTIP_SHOW, 0, 0, NULL); last_move_time = ~0; } yieldcpu(100); } kill_thread = false; } // This is being called every time the mouse is moving above a button void tooltip_new(MAYBE_I18NAL_STRING *text) { TOOLTIP *tip = &tooltip; tip->can_show = true; tip->tt_text = text; if (tip->visible || tip->mouse_down) { return; } if (!tip->thread && !kill_thread) { thread(tooltip_thread, NULL); tip->thread = true; } reset_time = 1; } uTox/src/ui/text.h0000600000175000001440000000230414003056216013036 0ustar rakusers#ifndef UI_TEXT_H #define UI_TEXT_H #include #include typedef struct scrollable SCROLLABLE; /** Used to draw text within a specified box, starting with the x, y, of the first line of the text. Followed by right, top, then bottom borders of the box we're allowed to draw within. If any line would be drawn OUTSIDE of the box, it is skipped. */ int utox_draw_text_multiline_within_box(int x, int y, int right, int top, int bottom, uint16_t lineheight, const char *data, uint16_t length, uint16_t h, uint16_t hlen, uint16_t mark, uint16_t marklen, bool multiline); uint16_t hittextmultiline(int mx, int right, int my, int height, uint16_t lineheight, char *str, uint16_t length, bool multiline); int text_height(int right, uint16_t lineheight, char *str, uint16_t length); uint16_t text_lineup(int width, int height, uint16_t p, uint16_t lineheight, char *str, uint16_t length, SCROLLABLE *scroll); uint16_t text_linedown(int width, int height, uint16_t p, uint16_t lineheight, char *str, uint16_t length, SCROLLABLE *scroll); #endif uTox/src/ui/text.c0000600000175000001440000003057014003056216013037 0ustar rakusers#include "text.h" #include "draw.h" #include "scrollable.h" #include "../text.h" #include "../theme.h" #include #include static void text_draw_word_hl(int x, int y, const char *str, uint16_t length, int d, int h, int hlen, uint16_t lineheight) { // Draw cursor /* multiline drawing goes word by word so str is not what you think it will be * drawing word by word could be the WORST way to go about it. (It's at least super frustrating without the * documentation). Ideally I'd like to process in one loop through, then draw in the next, but that's a fix for * another time. */ h -= d; if (h + hlen < 0 || h > length) { drawtext(x, y, str, length); return; } else if (hlen == 0) { drawtext(x, y, str, length); int w = textwidth(str, h + hlen); drawvline(x + w, y, y + lineheight, COLOR_MAIN_TEXT); return; } if (h < 0) { hlen += h; h = 0; if (hlen < 0) { hlen = 0; } } if (h + hlen > length) { hlen = length - h; } int width = drawtext_getwidth(x, y, str, h); uint32_t color = setcolor(COLOR_SELECTION_TEXT); int w = textwidth(str + h, hlen); draw_rect_fill(x + width, y, w, lineheight, COLOR_SELECTION_BACKGROUND); drawtext(x + width, y, str + h, hlen); width += w; setcolor(color); drawtext(x + width, y, str + h + hlen, length - (h + hlen)); } static void drawtextmark(int x, int y, const char *str, uint16_t length, int d, int h, int hlen, uint16_t lineheight) { h -= d; if (h + hlen < 0 || h > length || hlen == 0) { return; } if (h < 0) { hlen += h; h = 0; if (hlen < 0) { hlen = 0; } } if (h + hlen > length) { hlen = length - h; } int width = textwidth(str, h); int w = textwidth(str + h, hlen); drawhline(x + width, y + lineheight - 1, x + width + w, COLOR_MAIN_TEXT); } int utox_draw_text_multiline_within_box(int x, int y, /* x, y of the top left corner of the box */ int right, int top, int bottom, uint16_t lineheight, const char *data, uint16_t length, /* text, and length of the text*/ uint16_t h, uint16_t hlen, uint16_t mark, uint16_t marklen, bool multiline) { uint32_t c1, c2; bool greentext = 0, link = 0, draw = y + lineheight >= top; int xc = x; const char *a_mark = data, *b_mark = a_mark, *end = a_mark + length; while (1) { if (a_mark != end) { if (*a_mark == '>' && (a_mark == data || *(a_mark - 1) == '\n')) { c1 = setcolor(COLOR_MAIN_TEXT_QUOTE); greentext = 1; } if ((a_mark == data || *(a_mark - 1) == '\n' || *(a_mark - 1) == ' ') && ( (end - a_mark >= 7 && memcmp(a_mark, "http://", 7) == 0) || (end - a_mark >= 8 && memcmp(a_mark, "https://", 8) == 0) || (end - a_mark >= 4 && memcmp(a_mark, "tox:", 4) == 0)) ) { c2 = setcolor(COLOR_MAIN_TEXT_URL); link = 1; } if (a_mark == data || *(a_mark - 1) == '\n') { const char *r = a_mark; while (r != end && *r != '\n') { r++; } if (r != data && *(r - 1) == '<') { if (greentext) { setcolor(COLOR_MAIN_TEXT_RED); } else { greentext = 1; c1 = setcolor(COLOR_MAIN_TEXT_RED); } } } } if (a_mark == end || *a_mark == ' ' || *a_mark == '\n') { int count = a_mark - b_mark, w = textwidth(b_mark, count); while (x + w > right) { if (multiline && x == xc) { int fit = textfit(b_mark, count, right - x); if (draw) { text_draw_word_hl(x, y, b_mark, fit, b_mark - data, h, hlen, lineheight); drawtextmark(x, y, b_mark, fit, b_mark - data, mark, marklen, lineheight); } count -= fit; b_mark += fit; y += lineheight; draw = (y + lineheight >= top && y < bottom); } else if (!multiline) { int fit = textfit(b_mark, count, right - x); if (draw) { text_draw_word_hl(x, y, b_mark, fit, b_mark - data, h, hlen, lineheight); drawtextmark(x, y, b_mark, fit, b_mark - data, mark, marklen, lineheight); } return y + lineheight; } else { y += lineheight; draw = (y + lineheight >= top && y < bottom); int l = utf8_len(b_mark); count -= l; b_mark += l; } x = xc; w = textwidth(b_mark, count); } if (draw) { text_draw_word_hl(x, y, b_mark, count, b_mark - data, h, hlen, lineheight); drawtextmark(x, y, b_mark, count, b_mark - data, mark, marklen, lineheight); } x += w; b_mark = a_mark; if (link) { setcolor(c2); link = 0; } if (a_mark == end) { if (greentext) { setcolor(c1); // greentext = 0; This is a dead assignment. Was something meant to be done with this? } break; } if (*a_mark == '\n') { if (greentext) { setcolor(c1); greentext = 0; } y += lineheight; draw = (y + lineheight >= top && y < bottom); b_mark += utf8_len(b_mark); x = xc; } } a_mark += utf8_len(a_mark); } return y + lineheight; } uint16_t hittextmultiline(int mx, int right, int my, int height, uint16_t lineheight, char *str, uint16_t length, bool multiline) { if (my < 0) { return 0; } if (my >= height) { return length; } int x = 0; char *a = str, *b = str, *end = str + length; while (1) { if (a == end || *a == '\n' || *a == ' ') { int count = a - b, w = textwidth(b, a - b); while (x + w > right && my >= lineheight) { if (multiline && x == 0) { int fit = textfit(b, count, right); count -= fit; b += fit; my -= lineheight; height -= lineheight; } else if (!multiline) { break; } else { my -= lineheight; height -= lineheight; int l = utf8_len(b); count -= l; b += l; } if (my >= -lineheight && my < 0) { x = mx; break; } x = 0; w = textwidth(b, count); } if (a == end) { if (my >= lineheight) { return length; } break; } if ((my >= 0 && my < lineheight) && (mx < 0 || (mx >= x && mx < x + w))) { break; } x += w; b = a; if (*a == '\n') { if (my >= 0 && my < lineheight) { // x = mx; This is a dead assignment. Was something meant to be done with this? return a - str; } b += utf8_len(b); my -= lineheight; height -= lineheight; x = 0; } } a += utf8_len(a); } int fit; if (mx >= right) { fit = textfit(b, a - b, right - x); } else if (mx - x > 0) { int len = a - b; fit = textfit_near(b, len + (a != end), mx - x); } else { fit = 0; } return (b - str) + fit; } int text_height(int right, uint16_t lineheight, char *str, uint16_t length) { int x = 0, y = 0; char *a = str, *b = a, *end = a + length; while (1) { if (a == end || *a == ' ' || *a == '\n') { int count = a - b, w = textwidth(b, count); while (x + w > right) { if (x == 0) { int fit = textfit(b, count, right); count -= fit; if (fit == 0 && (count != 0 || *b == '\n')) { return 0; } b += fit; y += lineheight; } else { y += lineheight; int l = utf8_len(b); count -= l; b += l; } x = 0; w = textwidth(b, count); } x += w; b = a; if (a == end) { break; } if (*a == '\n') { y += lineheight; b += utf8_len(b); x = 0; } } a += utf8_len(a); } y += lineheight; return y; } static void textxy(int width, uint16_t pp, uint16_t lineheight, char *str, uint16_t length, int *outx, int *outy) { int x = 0, y = 0; char *a = str, *b = str, *end = str + length, *p = str + pp; while (1) { if (a == end || *a == '\n' || *a == ' ') { int count = a - b, w = textwidth(b, a - b); while (x + w > width) { if (x == 0) { int fit = textfit(b, count, width); if (p >= b && p < b + fit) { break; } count -= fit; b += fit; y += lineheight; } else { y += lineheight; int l = utf8_len(b); count -= l; b += l; } x = 0; w = textwidth(b, count); } if (p >= b && p < b + count) { w = textwidth(b, p - b); a = end; } x += w; if (a == end) { break; } b = a; if (*a == '\n') { if (p == a) { break; } b += utf8_len(b); y += lineheight; x = 0; } } a += utf8_len(a); } *outx = x; *outy = y; } uint16_t text_lineup(int width, int height, uint16_t p, uint16_t lineheight, char *str, uint16_t length, SCROLLABLE *scroll) { // lazy int x, y; textxy(width, p, lineheight, str, length, &x, &y); if (y == 0) { scroll->d = 0.0; return 0; } y -= lineheight; if (scroll->content_height > height) { double d1 = (double)y / (double)(scroll->content_height - height); double d2 = (double)(y - height + lineheight) / (double)(scroll->content_height - height); if (d1 < scroll->d) { scroll->d = d1; } else if (d2 > scroll->d) { scroll->d = d2; } } return hittextmultiline(x, width, y, INT_MAX, lineheight, str, length, 1); } uint16_t text_linedown(int width, int height, uint16_t p, uint16_t lineheight, char *str, uint16_t length, SCROLLABLE *scroll) { // lazy int x, y; textxy(width, p, lineheight, str, length, &x, &y); y += lineheight; if (scroll->content_height > height) { double d1 = (double)y / (double)(scroll->content_height - height); double d2 = (double)(y - height + lineheight) / (double)(scroll->content_height - height); if (d2 > scroll->d) { scroll->d = d2 > 1.0 ? 1.0 : d2; } else if (d1 < scroll->d) { scroll->d = d1; } } return hittextmultiline(x, width, y, INT_MAX, lineheight, str, length, 1); } uTox/src/ui/switch.h0000600000175000001440000000263714003056216013364 0ustar rakusers#ifndef SWITCH_H #define SWITCH_H #include "panel.h" #include "svg.h" #include "../ui.h" #include #include typedef struct uiswitch UISWITCH; struct uiswitch { PANEL panel; SVG_IMG style_outer; SVG_IMG style_toggle; SVG_IMG style_icon_off; SVG_IMG style_icon_on; // Width/height of the toggle and the icons. Used for centering. int toggle_w, toggle_h, icon_off_w, icon_off_h, icon_on_w, icon_on_h; // Background RGB color, when Idle/Hovered/Pressed respectively. uint32_t bg_color, // Switch normal background color sw_color, // Switch 'toggle' color hover_color, // Switch mouse over color press_color, // Switch mouse down color disabled_color; // Switch disabled bg color MAYBE_I18NAL_STRING tooltip_text; bool switch_on; bool mouseover, mousedown, disabled, nodraw; void (*onright)(void); // called when right mouse uiswitch goes down void (*on_mup)(void); void (*update)(UISWITCH *s); }; void switch_draw(UISWITCH *s, int x, int y, int width, int height); bool switch_mmove(UISWITCH *s, int x, int y, int width, int height, int mx, int my, int dx, int dy); bool switch_mdown(UISWITCH *s); bool switch_mright(UISWITCH *s); bool switch_mwheel(UISWITCH *s, int height, double d, bool smooth); bool switch_mup(UISWITCH *s); bool switch_mleave(UISWITCH *s); void switch_update(UISWITCH *s); #endif uTox/src/ui/switch.c0000600000175000001440000001002314003056216013343 0ustar rakusers#include "switch.h" #include "draw.h" #include "tooltip.h" #include "../macros.h" #include "../ui.h" #include "../theme.h" static void calculate_pos_and_width(UISWITCH *s, int *x, int *w) { int old_w = *w; // Push away from the right border to fit, // if our panel is right-adjusted. if (s->panel.x < 0) { *x -= *w - old_w; } } void switch_draw(UISWITCH *s, int x, int y, int w, int h) { // Switch is hidden if (s->nodraw) { return; } // If `update` function is defined, call it on each draw if (s->update) { s->update(s); } // Switch background color uint32_t color = s->mousedown ? s->press_color : (s->mouseover ? s->hover_color : s->bg_color); drawalpha(s->style_outer, x, y, w, h, s->disabled ? s->disabled_color : color); // SVG offsets, used for centering int tx = ((w / 2 - s->toggle_w) / 2), ty = ((h - s->toggle_h) / 2), ix0 = ((w / 2 - s->icon_off_w) / 2), iy0 = ((h - s->icon_off_h) / 2), ix1 = ((w / 2 - s->icon_on_w) / 2), iy1 = ((h - s->icon_on_h) / 2); if (s->style_toggle) { if (s->switch_on) { drawalpha(s->style_toggle, x + (w / 2) + tx, y + ty, s->toggle_w, s->toggle_h, s->sw_color); } else { drawalpha(s->style_toggle, x + tx, y + ty, s->toggle_w, s->toggle_h, s->sw_color); } } if (s->style_icon_off && !s->switch_on) { drawalpha(s->style_icon_off, x + (w / 2) + ix0, y + iy0, s->icon_off_w, s->icon_off_h, s->sw_color); } else if (s->style_icon_on && s->switch_on) { drawalpha(s->style_icon_on, x + ix1, y + iy1, s->icon_on_w, s->icon_on_h, s->sw_color); } } bool switch_mmove(UISWITCH *s, int UNUSED(x), int UNUSED(y), int width, int height, int mx, int my, int UNUSED(dx), int UNUSED(dy)) { // Ensure that font is set before calculating position and width. setfont(FONT_SELF_NAME); int real_x = 0, real_w = width; calculate_pos_and_width(s, &real_x, &real_w); bool mouseover = inrect(mx, my, real_x, 0, real_w, height); if (mouseover) { if (!s->disabled) { cursor = CURSOR_HAND; } if (maybe_i18nal_string_is_valid(&s->tooltip_text)) { tooltip_new(&s->tooltip_text); } } if (mouseover != s->mouseover) { s->mouseover = mouseover; return 1; } return 0; } bool switch_mdown(UISWITCH *s) { if (!s->mousedown && s->mouseover) { s->mousedown = 1; return 1; } return 0; } bool switch_mright(UISWITCH *s) { if (s->mouseover && s->onright) { s->onright(); return 1; } return 0; } bool switch_mwheel(UISWITCH *UNUSED(s), int UNUSED(height), double UNUSED(d), bool UNUSED(smooth)) { return 0; } bool switch_mup(UISWITCH *s) { // ignore click when switch is disabled if (s->mousedown && !s->disabled) { if (s->mouseover) { s->switch_on = !s->switch_on; s->on_mup(); } s->mousedown = 0; return 1; } s->mousedown = 0; return 0; } bool switch_mleave(UISWITCH *s) { if (s->mouseover) { s->mouseover = 0; return 1; } return 0; } static void switch_set_colors(UISWITCH *s) { if (s->switch_on) { s->bg_color = COLOR_BTN_SUCCESS_BKGRND; s->sw_color = COLOR_BTN_SUCCESS_TEXT; s->press_color = COLOR_BTN_SUCCESS_BKGRND_HOVER; s->hover_color = COLOR_BTN_SUCCESS_BKGRND_HOVER; } else { s->bg_color = COLOR_BTN_DISABLED_BKGRND; s->sw_color = COLOR_BTN_DISABLED_FORGRND; s->hover_color = COLOR_BTN_DISABLED_BKGRND_HOVER; s->press_color = COLOR_BTN_DISABLED_BKGRND_HOVER; } } static void switch_set_size(UISWITCH *s) { s->toggle_w = BM_SWITCH_TOGGLE_WIDTH; s->toggle_h = BM_SWITCH_TOGGLE_HEIGHT; s->icon_off_w = BM_FB_WIDTH; s->icon_off_h = BM_FB_HEIGHT; s->icon_on_w = BM_FB_WIDTH; s->icon_on_h = BM_FB_HEIGHT; } void switch_update(UISWITCH *s) { switch_set_colors(s); switch_set_size(s); } uTox/src/ui/svg.h0000600000175000001440000000670514003056216012662 0ustar rakusers#ifndef SVG_H #define SVG_H #include /* Scroll bar rounded corners top and bottom */ #define BM_SCROLLHALF_WIDTH SCROLL_WIDTH #define BM_SCROLLHALF_HEIGHT (SCROLL_WIDTH / 2) /* No idea */ #define BM_STATUSAREA_WIDTH SCALE(20) #define BM_STATUSAREA_HEIGHT SCALE(40) /* Text button on the add a new friend page */ #define _BM_ADD_WIDTH 18 #define BM_ADD_WIDTH SCALE(18) #define BM_STATUS_WIDTH SCALE(9) #define BM_STATUS_NOTIFY_WIDTH SCALE(14) #define BM_NMSG_WIDTH SCALE(18) /* Standard large size button */ #define _BM_LBUTTON_WIDTH 52 #define _BM_LBUTTON_HEIGHT 40 #define BM_LBUTTON_WIDTH SCALE(52) #define BM_LBUTTON_HEIGHT SCALE(40) /* Standard small size button */ #define _BM_SBUTTON_WIDTH 52 #define _BM_SBUTTON_HEIGHT 20 #define BM_SBUTTON_WIDTH SCALE(52) #define BM_SBUTTON_HEIGHT SCALE(20) #define _BM_SWITCH_WIDTH 60 #define _BM_SWITCH_HEIGHT 25 #define BM_SWITCH_WIDTH SCALE(60) #define BM_SWITCH_HEIGHT SCALE(25) #define _BM_SWITCH_TOGGLE_WIDTH 26 #define _BM_SWITCH_TOGGLE_HEIGHT 21 #define BM_SWITCH_TOGGLE_WIDTH SCALE(26) #define BM_SWITCH_TOGGLE_HEIGHT SCALE(21) /* File transfer buttons */ #define BM_FT_WIDTH SCALE(250) #define BM_FT_HEIGHT SCALE(52) #define BM_FTM_WIDTH SCALE(226) #define BM_FTB_WIDTH SCALE(26) #define BM_FTB_HEIGHT SCALE(28) #define BM_FT_CAP_WIDTH SCALE(30) /* something to do with contacts? */ #define BM_CONTACT_WIDTH SCALE(40) /* no idea */ #define _BM_LBICON_WIDTH 22 #define BM_LBICON_WIDTH SCALE(22) #define _BM_LBICON_HEIGHT 20 #define BM_LBICON_HEIGHT SCALE(20) /* small file transfer button maybe? */ #define BM_FB_WIDTH SCALE(12) #define BM_FB_HEIGHT SCALE(10) /* small button placements */ #define _BM_CHAT_BUTTON_WIDTH 40 #define BM_CHAT_BUTTON_WIDTH SCALE(40) #define _BM_CHAT_BUTTON_HEIGHT 40 #define BM_CHAT_BUTTON_HEIGHT SCALE(40) /* camera box */ #define _BM_CHAT_BUTTON_OVERLAY_WIDTH 28 #define BM_CHAT_BUTTON_OVERLAY_WIDTH SCALE(28) #define _BM_CHAT_BUTTON_OVERLAY_HEIGHT 28 #define BM_CHAT_BUTTON_OVERLAY_HEIGHT SCALE(28) /* Large chat button */ #define _BM_CHAT_SEND_WIDTH 56 #define BM_CHAT_SEND_WIDTH SCALE(56) #define _BM_CHAT_SEND_HEIGHT 40 #define BM_CHAT_SEND_HEIGHT SCALE(40) /* Chat speech bubble */ #define _BM_CHAT_SEND_OVERLAY_WIDTH 40 #define BM_CHAT_SEND_OVERLAY_WIDTH SCALE(40) #define _BM_CHAT_SEND_OVERLAY_HEIGHT 32 #define BM_CHAT_SEND_OVERLAY_HEIGHT SCALE(32) #define _BM_FILE_WIDTH 22 #define BM_FILE_WIDTH SCALE(22) #define _BM_FILE_HEIGHT 20 #define BM_FILE_HEIGHT SCALE(20) #define _BM_FILE_BIG_WIDTH 44 #define BM_FILE_BIG_WIDTH SCALE(44) #define _BM_FILE_BIG_HEIGHT 40 #define BM_FILE_BIG_HEIGHT SCALE(40) #define _BM_CI_WIDTH 20 #define BM_CI_WIDTH SCALE(20) /* SVG Bitmap names. */ typedef enum { BM_ONLINE = 1, BM_AWAY, BM_BUSY, BM_OFFLINE, BM_STATUS_NOTIFY, BM_ADD, BM_GROUPS, BM_TRANSFER, BM_SETTINGS, BM_SETTINGS_THREE_BAR, BM_LBUTTON, BM_SBUTTON, BM_SWITCH, BM_SWITCH_TOGGLE, BM_CONTACT, BM_CONTACT_MINI, BM_GROUP, BM_GROUP_MINI, BM_FILE, BM_DECLINE, BM_CALL, BM_VIDEO, BM_FT, BM_FTM, BM_FTB1, BM_FTB2, BM_FT_CAP, BM_NO, BM_PAUSE, BM_RESUME, BM_YES, BM_SCROLLHALFTOP, BM_SCROLLHALFBOT, BM_SCROLLHALFTOP_SMALL, BM_SCROLLHALFBOT_SMALL, BM_STATUSAREA, BM_CHAT_BUTTON_LEFT, BM_CHAT_BUTTON_RIGHT, BM_CHAT_BUTTON_OVERLAY_SCREENSHOT, BM_CHAT_SEND, BM_CHAT_SEND_OVERLAY, BM_ENDMARKER, } SVG_IMG; bool svg_draw(bool needmemory); #endif uTox/src/ui/svg.c0000600000175000001440000007321714003056216012657 0ustar rakusers#include "svg.h" #include "draw.h" #include "../debug.h" #include "../ui.h" #include "../macros.h" #include #include #define SQRT2 1.41421356237309504880168872420969807856967187537694807317667973799 static uint8_t pixel(double d) { if (d >= 1.0) { return 0; } else if (d <= 0.0) { return 0xFF; } else { return (1.0 - d) * 255.0; } } static uint8_t pixelmin(double d, uint8_t p) { if (d >= 1.0) { return p; } else if (d <= 0.0) { return 0; } else { uint8_t value = d * 255.0; if (value >= p) { return p; } else { return value; } } } static uint8_t pixelmax(double d, uint8_t p) { if (d >= 1.0) { return p; } else if (d <= 0.0) { return 0xFF; } else { uint8_t value = (1.0 - d) * 255.0; if (value >= p) { return value; } else { return p; } } } static void drawrectrounded(uint8_t *data, int width, int height, int radius) { double hw = (double)radius - 0.5; for (int y = 0; y != height; y++) { for (int x = 0; x != width; x++) { if ((x < radius || x >= width - radius) && (y < radius || y >= height - radius)) { double dx, dy; dx = (x < radius) ? x - hw : x + hw - width + 1.0; dy = (y < radius) ? y - hw : y + hw - height + 1.0; double d = sqrt(dx * dx + dy * dy) - hw; *data++ = pixel(d); } else { *data++ = 0xFF; } } } } static void drawrectroundedex(uint8_t *data, int width, int height, int radius, uint8_t flags) { bool left = ((flags & 1) != 0); /* 0001 */ bool right = ((flags & 2) != 0); /* 0010 */ bool top = ((flags & 4) != 0); /* 0100 */ bool bottom = ((flags & 8) != 0); /* 1000 */ double hw = (double)radius - 0.5; for (int y = 0; y != height; y++) { for (int x = 0; x != width; x++) { if (((left && x < radius) || (right && x >= width - radius)) && ((top && y < radius) || (bottom && y >= height - radius))) { double dx = (x < radius) ? x - hw : x + hw - width + 1.0; double dy = (y < radius) ? y - hw : y + hw - height + 1.0; double d = sqrt(dx * dx + dy * dy) - hw; *data++ = pixel(d); } else { *data++ = 0xFF; } } } } static void drawrectroundedsub(uint8_t *p, int width, int UNUSED(height), int sx, int sy, int sw, int sh, int radius) { double hw = (double)radius - 0.5; for (int y = sy; y != sy + sh; y++) { for (int x = sx; x != sx + sw; x++) { uint8_t *data = &p[y * width + x]; x -= sx; y -= sy; if ((x < radius || x >= sw - radius) && (y < radius || y >= sh - radius)) { double dx = (x < radius) ? x - hw : x + hw - sw + 1.0; double dy = (y < radius) ? y - hw : y + hw - sh + 1.0; double d = sqrt(dx * dx + dy * dy) - hw; *data = pixel(d); } else { *data = 0xFF; } x += sx; y += sy; } } } static void drawrectroundedneg(uint8_t *p, int width, int UNUSED(height), int sx, int sy, int sw, int sh, int radius) { double hw = (double)radius - 0.5; for (int y = sy; y != sy + sh; y++) { for (int x = sx; x != sx + sw; x++) { uint8_t *data = &p[y * width + x]; x -= sx; y -= sy; if ((x < radius || x >= sw - radius) && (y < radius || y >= sh - radius)) { double dx = (x < radius) ? x - hw : x + hw - sw + 1.0; double dy = (y < radius) ? y - hw : y + hw - sh + 1.0; double d = sqrt(dx * dx + dy * dy) - hw; *data = 0xFF - pixel(d); } else { *data = 0; } x += sx; y += sy; } } } static void drawcircle(uint8_t *data, int width) { double hw = (double)width / 2.0 - 0.5; for (int y = 0; y != width; y++) { for (int x = 0; x != width; x++) { double dx = (x - hw), dy = (y - hw); double d = sqrt(dx * dx + dy * dy) - hw + 0.5; *data++ = pixel(d); } } } static void drawnewcircle(uint8_t *data, int width, int height, double cx, double cy, double subwidth) { double hw = cx - 0.5, vw = cy - 0.5, sw = (double)subwidth / 2.0; for (int y = 0; y != height; y++) { for (int x = 0; x != width; x++) { double dx = (x - hw), dy = (y - vw); double d = sqrt(dx * dx + dy * dy) - sw; *data = pixelmax(d, *data); data++; } } } static void drawnewcircle2(uint8_t *data, int width, int height, double cx, double cy, double subwidth, uint8_t flags) { double hw = cx - 0.5, vw = cy - 0.5, sw = (double)subwidth / 2.0; bool b = (flags & 1) != 0; for (int y = 0; y != height; y++) { for (int x = 0; x != width; x++) { double dx = (x - hw), dy = (y - vw); if (b && dy > 0) { dy *= 1.25; } if (!b && dx > 0) { dx *= 1.25; } double d = sqrt(dx * dx + dy * dy) - sw; if ((b && dx < 0) || (!b && dy < 0)) { *data++ = pixel(d); } else { *data = pixelmax(d, *data); data++; } } } } static void drawhead(uint8_t *data, int width, double cx, double cy, double subwidth) { double hw = (double)cx - 0.5, vw = (double)cy - 0.5, sw = (double)subwidth / 2.0; for (int y = 0; y != width; y++) { for (int x = 0; x != width; x++) { double dx = (x - hw), dy = (y - vw); if (dy > 0) { dy *= 0.75; } double d = sqrt(dx * dx + dy * dy) - sw; *data = pixelmax(d, *data); data++; } } } static void drawsubcircle(uint8_t *data, int width, int height, double cx, double cy, double subwidth) { double hw = cx - 0.5, vw = cy - 0.5, sw = subwidth / 2.0; for (int y = 0; y != height; y++) { for (int x = 0; x != width; x++) { double dx = (x - hw), dy = (y - vw); double d = sqrt(dx * dx + dy * dy) - sw; *data = pixelmin(d, *data); data++; } } } static void drawcross(uint8_t *data, int width) { double hw = 0.5 * (double)(width - 1); double w = 0.0625 * (double)width; for (int y = 0; y != width; y++) { for (int x = 0; x != width; x++) { double dx = fabs(x - hw), dy = fabs(y - hw); double d = fmin(dx, dy) - w; *data++ = pixel(d); } } } static void drawxcross(uint8_t *data, int width, int height, int radius) { double cx = 0.5 * (double)(width - 1); double cy = 0.5 * (double)(height - 1); double w = 0.0625 * (double)radius; for (int y = 0; y != height; y++) { for (int x = 0; x != width; x++) { double dx = (double)x - cx, dy = (double)y - cy; double d1 = (SQRT2 / 2.0) * fabs(dx + dy), d2 = (SQRT2 / 2.0) * fabs(dx - dy); double d = fmin(d1, d2) - w; d = fmax(fabs(dx) + fabs(dy) - (SQRT2 / 2.0) * (double)height - w, d); *data = pixelmax(d, *data); data++; } } } static void drawline(uint8_t *data, int width, int height, double sx, double sy, double span, double radius) { double cx = sx - 0.5, cy = sy - 0.5; for (int y = 0; y != height; y++) { for (int x = 0; x != width; x++) { double dx = (double)x - cx, dy = (double)y - cy; double d = (SQRT2 / 2.0) * fabs(dx + dy) - radius; d = fmax(fabs(dx) + fabs(dy) - (SQRT2 / 2.0) * (double)span - radius, d); *data = pixelmax(d, *data); data++; } } } static void drawlinedown(uint8_t *data, int width, int height, double sx, double sy, double span, double radius) { double cx = sx - 0.5, cy = sy - 0.5; for (int y = 0; y != height; y++) { for (int x = 0; x != width; x++) { double dx = (double)x - cx, dy = (double)y - cy; double d = (SQRT2 / 2.0) * fabs(dx - dy) - radius; d = fmax(fabs(dx) + fabs(dy) - (SQRT2 / 2.0) * (double)span - radius, d); *data = pixelmax(d, *data); data++; } } } static void svgdraw_line_neg(uint8_t *data, int width, int height, double sx, double sy, double span, double radius) { double cx = sx - 0.5, cy = sy - 0.5; for (int y = 0; y != height; y++) { for (int x = 0; x != width; x++) { double dx = (double)x - cx, dy = (double)y - cy; double d = (SQRT2 / 2.0) * fabs(dx + dy) - radius; d = fmax(fabs(dx) + fabs(dy) - (SQRT2 / 2.0) * (double)span - radius, d); *data = pixelmin(d, *data); data++; } } } static void svgdraw_line_down_neg(uint8_t *data, int width, int height, double sx, double sy, double span, double radius) { double cx = sx - 0.5, cy = sy - 0.5; for (int y = 0; y != height; y++) { for (int x = 0; x != width; x++) { double dx = (double)x - cx, dy = (double)y - cy; double d = (SQRT2 / 2.0) * fabs(dx - dy) - radius; d = fmax(fabs(dx) + fabs(dy) - (SQRT2 / 2.0) * (double)span - radius, d); *data = pixelmin(d, *data); data++; } } } static void drawlinevert(uint8_t *data, int width, int height, double sx, double w) { double cx = sx + w / 2.0 - 0.5; for (int y = 0; y != height; y++) { for (int x = 0; x != width; x++) { double d = fabs((double)x - cx) - w / 2.0; *data = pixelmax(d, *data); data++; } } } static void drawtri(uint8_t *data, int width, int height, double sx, double sy, double size, uint8_t dir) { double cx = sx - 0.5, cy = sy - 0.5; for (int y = 0; y != height; y++) { for (int x = 0; x != width; x++) { double dx = (double)x - cx, dy = (double)y - cy; if (!dir) { if (dx < 0.0 && dy > 0.0) { double d = -dx + dy - size; *data = pixelmax(d, *data); } } else { if (dx > 0.0 && dy < 0.0) { double d = dx - dy - size; *data = pixelmax(d, *data); } } data++; } } } static void drawlineround(uint8_t *data, int width, int height, double sx, double sy, double span, double radius, double subwidth, uint8_t flags) { double cx = sx - 0.5, cy = sy - 0.5, sw = (double)subwidth / 2.0; for (int y = 0; y != height; y++) { for (int x = 0; x != width; x++) { double dx = (double)x - cx, dy = (double)y - cy; double d = (SQRT2 / 2.0) * fabs(dx + dy) - radius; d = fmax(fabs(dx) + fabs(dy) - (SQRT2 / 2.0) * (double)span - radius, d); double ddx, ddy, d2; if (!flags) { ddx = (double)x - cx - span * SQRT2; ddy = (double)y - cy + span * SQRT2; d2 = sqrt(ddx * ddx + ddy * ddy) - sw; d = fmin(d, d2); } ddx = (double)x - cx + span * SQRT2; ddy = (double)y - cy - span * SQRT2; d2 = sqrt(ddx * ddx + ddy * ddy) - sw; d = fmin(d, d2); *data = pixelmax(d, *data); data++; } } } static void drawlineroundempty(uint8_t *data, int width, int height, double sx, double sy, double span, double radius, double subwidth) { double cx = sx - 0.5, cy = sy - 0.5, sw = (double)subwidth / 2.0; for (int y = 0; y != height; y++) { for (int x = 0; x != width; x++) { double dx = (double)x - cx, dy = (double)y - cy; double d = (SQRT2 / 2.0) * fabs(dx + dy) - radius; d = fmax(fabs(dx) + fabs(dy) - (SQRT2 / 2.0) * (double)span - radius, d); double ddx = (double)x - cx - span * SQRT2, ddy = (double)y - cy + span * SQRT2; double d2 = sqrt(ddx * ddx + ddy * ddy) - sw; d = fmin(d, d2); ddx = (double)x - cx + span * SQRT2; ddy = (double)y - cy - span * SQRT2; d2 = sqrt(ddx * ddx + ddy * ddy) - sw; d = fmin(d, d2); *data = pixelmin(d, *data); data++; } } } static void drawgroup(uint8_t *data, int width) { double s = (double)width / BM_CONTACT_WIDTH; drawnewcircle(data, width, s * SCALE(18), s * SCALE(10), s * SCALE(18), s * SCALE(15)); drawnewcircle(data, width, s * SCALE(18), s * SCALE(30), s * SCALE(18), s * SCALE(15)); drawsubcircle(data, width, width, s * SCALE(10), s * SCALE(8), s * SCALE(9)); drawsubcircle(data, width, width, s * SCALE(30), s * SCALE(8), s * SCALE(9)); drawhead(data, width, s * SCALE(10), s * SCALE(6), s * SCALE(9)); drawhead(data, width, s * SCALE(30), s * SCALE(6), s * SCALE(9)); drawnewcircle(data, width, s * SCALE(40), s * SCALE(20), s * SCALE(40), s * SCALE(29)); drawsubcircle(data, width, width, s * SCALE(20), s * SCALE(24), s * SCALE(13)); drawsubcircle(data, width, width, s * SCALE(20), s * SCALE(16), s * SCALE(19)); drawhead(data, width, s * SCALE(20), s * SCALE(16), s * SCALE(15)); } bool svg_draw(bool needmemory) { static uint8_t *svg_data = NULL; if (svg_data) { free(svg_data); } /* Build what we expect the size to be. * This section uses unnamed shortcuts, so it really serves no purpose and makes it harder to debug, it needs to be * fixed, without shortcuts, and proper comments... TODO FIXME */ // comments behind the lines match with the comments of the code below that fills the memory int size = SCROLL_WIDTH * SCROLL_WIDTH + /* Scroll bars top bottom halves */ SCROLL_WIDTH * SCROLL_WIDTH / 2 + /* Scroll bars top bottom halves (small)*/ BM_STATUSAREA_WIDTH * BM_STATUSAREA_HEIGHT + /* status area */ /* Panel buttons */ BM_ADD_WIDTH * BM_ADD_WIDTH + /* Draw panel Button: Add */ BM_ADD_WIDTH * BM_ADD_WIDTH + /* New group bitmap */ BM_ADD_WIDTH * BM_ADD_WIDTH + /* Draw panel Button: Transfer */ BM_ADD_WIDTH * BM_ADD_WIDTH + /* Settings gear bitmap */ BM_CONTACT_WIDTH * BM_CONTACT_WIDTH + /* Contact avatar default bitmap */ BM_CONTACT_WIDTH / 2 * BM_CONTACT_WIDTH / 2 + /* Contact avatar default bitmap for mini roster */ BM_CONTACT_WIDTH * BM_CONTACT_WIDTH + /* Group heads default bitmap */ BM_CONTACT_WIDTH / 2 * BM_CONTACT_WIDTH / 2 + /* Group heads default bitmap for mini roster */ BM_FILE_WIDTH * BM_FILE_HEIGHT + /* Draw button icon overlays: file paper clip */ BM_LBICON_WIDTH * BM_LBICON_HEIGHT + /* Call button icon */ BM_LBICON_WIDTH * BM_LBICON_HEIGHT + /* Call button icon */ BM_LBICON_WIDTH * BM_LBICON_HEIGHT + /* Video start end bitmap */ BM_STATUS_WIDTH * BM_STATUS_WIDTH + /* user status: online */ BM_STATUS_WIDTH * BM_STATUS_WIDTH + /* user status: away */ BM_STATUS_WIDTH * BM_STATUS_WIDTH + /* user status: busy */ BM_STATUS_WIDTH * BM_STATUS_WIDTH + /* user status: offline */ BM_STATUS_NOTIFY_WIDTH * BM_STATUS_NOTIFY_WIDTH + /* user status: notification */ BM_LBUTTON_WIDTH * BM_LBUTTON_HEIGHT + /* Generic Large Button */ BM_SBUTTON_WIDTH * BM_SBUTTON_HEIGHT + /* Generic Small Button */ BM_SWITCH_WIDTH * BM_SWITCH_HEIGHT + /* Switch */ BM_SWITCH_TOGGLE_WIDTH * BM_SWITCH_TOGGLE_HEIGHT + /* Switch toggle */ /* File transfer */ BM_FT_CAP_WIDTH * BM_FTB_HEIGHT + BM_FT_WIDTH * BM_FT_HEIGHT + BM_FTM_WIDTH * BM_FT_HEIGHT + (BM_FTB_WIDTH * (BM_FTB_HEIGHT + SCALE(1)) + BM_FTB_WIDTH * BM_FTB_HEIGHT) + BM_FB_WIDTH * BM_FB_HEIGHT * 4 + /* Chat Buttons */ BM_CHAT_BUTTON_WIDTH * BM_CHAT_BUTTON_HEIGHT * 2 + // Chat button 1, 2 BM_CHAT_SEND_WIDTH * BM_CHAT_SEND_HEIGHT + BM_CHAT_SEND_OVERLAY_WIDTH * BM_CHAT_SEND_OVERLAY_HEIGHT + BM_CHAT_BUTTON_OVERLAY_WIDTH * BM_CHAT_BUTTON_OVERLAY_HEIGHT; svg_data = calloc(1, size); if (!svg_data) { return false; } uint8_t *p = svg_data; /* Scroll bars top bottom halves */ drawcircle(p, SCROLL_WIDTH); loadalpha(BM_SCROLLHALFTOP, p, SCROLL_WIDTH, SCROLL_WIDTH / 2); loadalpha(BM_SCROLLHALFBOT, p + SCROLL_WIDTH * SCROLL_WIDTH / 2, SCROLL_WIDTH, SCROLL_WIDTH / 2); p += SCROLL_WIDTH * SCROLL_WIDTH; /* Scroll bars top bottom halves (small)*/ drawcircle(p, SCROLL_WIDTH / 2); loadalpha(BM_SCROLLHALFTOP_SMALL, p, SCROLL_WIDTH / 2, SCROLL_WIDTH / 4); loadalpha(BM_SCROLLHALFBOT_SMALL, p + SCROLL_WIDTH / 2 * SCROLL_WIDTH / 4, SCROLL_WIDTH / 2, SCROLL_WIDTH / 4); p += SCROLL_WIDTH * SCROLL_WIDTH / 2; /* status area */ drawrectrounded(p, BM_STATUSAREA_WIDTH, BM_STATUSAREA_HEIGHT, SCALE(4)); loadalpha(BM_STATUSAREA, p, BM_STATUSAREA_WIDTH, BM_STATUSAREA_HEIGHT); p += BM_STATUSAREA_WIDTH * BM_STATUSAREA_HEIGHT; /* Draw panel Button: Add */ drawcross(p, BM_ADD_WIDTH); loadalpha(BM_ADD, p, BM_ADD_WIDTH, BM_ADD_WIDTH); p += BM_ADD_WIDTH * BM_ADD_WIDTH; /* New group bitmap */ drawgroup(p, BM_ADD_WIDTH); loadalpha(BM_GROUPS, p, BM_ADD_WIDTH, BM_ADD_WIDTH); p += BM_ADD_WIDTH * BM_ADD_WIDTH; /* Draw panel Button: Transfer */ drawline(p, BM_ADD_WIDTH, BM_ADD_WIDTH, SCALE(6), SCALE(6), SCALE(10), SCALE(1.5)); drawline(p, BM_ADD_WIDTH, BM_ADD_WIDTH, SCALE(12), SCALE(12), SCALE(10), SCALE(1.5)); drawtri(p, BM_ADD_WIDTH, BM_ADD_WIDTH, SCALE(12), 0, SCALE(8), 0); drawtri(p, BM_ADD_WIDTH, BM_ADD_WIDTH, SCALE(6), SCALE(18), SCALE(8), 1); loadalpha(BM_TRANSFER, p, BM_ADD_WIDTH, BM_ADD_WIDTH); p += BM_ADD_WIDTH * BM_ADD_WIDTH; /* Settings gear bitmap */ drawcross(p, BM_ADD_WIDTH); drawxcross(p, BM_ADD_WIDTH, BM_ADD_WIDTH, BM_ADD_WIDTH); drawnewcircle(p, BM_ADD_WIDTH, BM_ADD_WIDTH, 0.5 * BM_ADD_WIDTH, 0.5 * BM_ADD_WIDTH, SCALE(14)); drawsubcircle(p, BM_ADD_WIDTH, BM_ADD_WIDTH, 0.5 * BM_ADD_WIDTH, 0.5 * BM_ADD_WIDTH, SCALE(6)); loadalpha(BM_SETTINGS, p, BM_ADD_WIDTH, BM_ADD_WIDTH); p += BM_ADD_WIDTH * BM_ADD_WIDTH; /* Contact avatar default bitmap */ drawnewcircle(p, BM_CONTACT_WIDTH, SCALE(36), SCALE(20), SCALE(36), SCALE(28)); drawsubcircle(p, BM_CONTACT_WIDTH, BM_CONTACT_WIDTH, SCALE(20), SCALE(20), SCALE(12)); drawhead(p, BM_CONTACT_WIDTH, SCALE(20), SCALE(12), SCALE(16)); loadalpha(BM_CONTACT, p, BM_CONTACT_WIDTH, BM_CONTACT_WIDTH); p += BM_CONTACT_WIDTH * BM_CONTACT_WIDTH; /* Contact avatar default bitmap for mini roster */ drawnewcircle(p, BM_CONTACT_WIDTH / 2, SCALE(18), SCALE(10), SCALE(18), SCALE(14)); drawsubcircle(p, BM_CONTACT_WIDTH / 2, BM_CONTACT_WIDTH / 2, SCALE(10), SCALE(10), SCALE(6)); drawhead(p, BM_CONTACT_WIDTH / 2, SCALE(10), SCALE(6), SCALE(8)); loadalpha(BM_CONTACT_MINI, p, BM_CONTACT_WIDTH / 2, BM_CONTACT_WIDTH / 2); p += BM_CONTACT_WIDTH / 2 * BM_CONTACT_WIDTH / 2; /* Group heads default bitmap */ drawgroup(p, BM_CONTACT_WIDTH); loadalpha(BM_GROUP, p, BM_CONTACT_WIDTH, BM_CONTACT_WIDTH); p += BM_CONTACT_WIDTH * BM_CONTACT_WIDTH; /* Group heads default bitmap for mini roster */ drawgroup(p, BM_CONTACT_WIDTH / 2); loadalpha(BM_GROUP_MINI, p, BM_CONTACT_WIDTH / 2, BM_CONTACT_WIDTH / 2); p += BM_CONTACT_WIDTH / 2 * BM_CONTACT_WIDTH / 2; /* Draw button icon overlays. */ drawlineround(p, BM_FILE_WIDTH, BM_FILE_HEIGHT, UI_FSCALE(10), UI_FSCALE(10), UI_FSCALE(2), UI_FSCALE(8.3), UI_FSCALE(14), 0); drawlineroundempty(p, BM_FILE_WIDTH, BM_FILE_HEIGHT, UI_FSCALE(10), UI_FSCALE(10), UI_FSCALE(2), UI_FSCALE(6.5), UI_FSCALE(11)); drawsubcircle(p, BM_FILE_WIDTH, BM_FILE_HEIGHT, UI_FSCALE(11), UI_FSCALE(18), UI_FSCALE(6)); drawlineround(p, BM_FILE_WIDTH, BM_FILE_HEIGHT, UI_FSCALE(12), UI_FSCALE(12), UI_FSCALE(1), UI_FSCALE(4.5), UI_FSCALE(7.5), 1); drawlineroundempty(p, BM_FILE_WIDTH, BM_FILE_HEIGHT, UI_FSCALE(13), UI_FSCALE(11), UI_FSCALE(1.5), UI_FSCALE(3), UI_FSCALE(5.5)); loadalpha(BM_FILE, p, BM_FILE_WIDTH, BM_FILE_HEIGHT); p += BM_FILE_WIDTH * BM_FILE_HEIGHT; /* Decline call button icon */ drawnewcircle(p, BM_LBICON_WIDTH, BM_LBICON_HEIGHT, SCALE(11), SCALE(25), SCALE(38)); drawsubcircle(p, BM_LBICON_WIDTH, BM_LBICON_HEIGHT, SCALE(11), SCALE(25), SCALE(30)); drawnewcircle(p, BM_LBICON_WIDTH, BM_LBICON_HEIGHT, SCALE(3), SCALE(11), SCALE(6)); drawnewcircle(p, BM_LBICON_WIDTH, BM_LBICON_HEIGHT, SCALE(19.5), SCALE(11), SCALE(6)); loadalpha(BM_DECLINE, p, BM_LBICON_WIDTH, BM_LBICON_HEIGHT); p += BM_LBICON_WIDTH * BM_LBICON_HEIGHT; /* Call button icon */ drawnewcircle(p, BM_LBICON_WIDTH, BM_LBICON_HEIGHT, SCALE(1), 0, SCALE(38)); drawsubcircle(p, BM_LBICON_WIDTH, BM_LBICON_HEIGHT, SCALE(1), 0, SCALE(30)); drawnewcircle2(p, BM_LBICON_WIDTH, BM_LBICON_HEIGHT, SCALE(18), SCALE(4), SCALE(6), 0); drawnewcircle2(p, BM_LBICON_WIDTH, BM_LBICON_HEIGHT, SCALE(6), SCALE(16), SCALE(6), 1); loadalpha(BM_CALL, p, BM_LBICON_WIDTH, BM_LBICON_HEIGHT); p += BM_LBICON_WIDTH * BM_LBICON_HEIGHT; /* Video start end bitmap */ uint8_t *data = p; /* left triangle lens thing */ for (int y = 0; y != BM_LBICON_HEIGHT; y++) { for (int x = 0; x != SCALE(8); x++) { double d = abs(y - SCALE(9)) - 0.66 * (SCALE(8) - x); *data++ = pixel(d); } data += BM_LBICON_WIDTH - SCALE(8); } drawrectroundedsub(p, BM_LBICON_WIDTH, BM_LBICON_HEIGHT, SCALE(8), SCALE(1), SCALE(14), SCALE(14), SCALE(1)); loadalpha(BM_VIDEO, p, BM_LBICON_WIDTH, BM_LBICON_HEIGHT); p += BM_LBICON_WIDTH * BM_LBICON_HEIGHT; /* user status: online */ int s = BM_STATUS_WIDTH * BM_STATUS_WIDTH; drawcircle(p, BM_STATUS_WIDTH); loadalpha(BM_ONLINE, p, BM_STATUS_WIDTH, BM_STATUS_WIDTH); p += s; /* user status: away */ drawcircle(p, BM_STATUS_WIDTH); drawsubcircle(p, BM_STATUS_WIDTH, BM_STATUS_WIDTH / 2, 0.5 * BM_STATUS_WIDTH, 0.5 * BM_STATUS_WIDTH, SCALE(6)); loadalpha(BM_AWAY, p, BM_STATUS_WIDTH, BM_STATUS_WIDTH); p += s; /* user status: busy */ drawcircle(p, BM_STATUS_WIDTH); drawsubcircle(p, BM_STATUS_WIDTH, BM_STATUS_WIDTH / 2, 0.5 * BM_STATUS_WIDTH, 0.5 * BM_STATUS_WIDTH, SCALE(6)); loadalpha(BM_BUSY, p, BM_STATUS_WIDTH, BM_STATUS_WIDTH); p += s; /* user status: offline */ drawcircle(p, BM_STATUS_WIDTH); drawsubcircle(p, BM_STATUS_WIDTH, BM_STATUS_WIDTH, 0.5 * BM_STATUS_WIDTH, 0.5 * BM_STATUS_WIDTH, SCALE(6)); loadalpha(BM_OFFLINE, p, BM_STATUS_WIDTH, BM_STATUS_WIDTH); p += s; /* user status: notification */ drawcircle(p, BM_STATUS_NOTIFY_WIDTH); drawsubcircle(p, BM_STATUS_NOTIFY_WIDTH, BM_STATUS_NOTIFY_WIDTH, 0.5 * BM_STATUS_NOTIFY_WIDTH, 0.5 * BM_STATUS_NOTIFY_WIDTH, SCALE(10)); loadalpha(BM_STATUS_NOTIFY, p, BM_STATUS_NOTIFY_WIDTH, BM_STATUS_NOTIFY_WIDTH); p += BM_STATUS_NOTIFY_WIDTH * BM_STATUS_NOTIFY_WIDTH; /* Generic button icons */ drawrectrounded(p, BM_LBUTTON_WIDTH, BM_LBUTTON_HEIGHT, SCALE(4)); loadalpha(BM_LBUTTON, p, BM_LBUTTON_WIDTH, BM_LBUTTON_HEIGHT); p += BM_LBUTTON_WIDTH * BM_LBUTTON_HEIGHT; drawrectrounded(p, BM_SBUTTON_WIDTH, BM_SBUTTON_HEIGHT, SCALE(4)); loadalpha(BM_SBUTTON, p, BM_SBUTTON_WIDTH, BM_SBUTTON_HEIGHT); p += BM_SBUTTON_WIDTH * BM_SBUTTON_HEIGHT; /* Outer part of the switch */ drawrectrounded(p, BM_SWITCH_WIDTH, BM_SWITCH_HEIGHT, SCALE(4)); loadalpha(BM_SWITCH, p, BM_SWITCH_WIDTH, BM_SWITCH_HEIGHT); p += BM_SWITCH_WIDTH * BM_SWITCH_HEIGHT; /* Switch toggle */ drawrectrounded(p, BM_SWITCH_TOGGLE_WIDTH, BM_SWITCH_TOGGLE_HEIGHT, SCALE(4)); loadalpha(BM_SWITCH_TOGGLE, p, BM_SWITCH_TOGGLE_WIDTH, BM_SWITCH_TOGGLE_HEIGHT); p += BM_SWITCH_TOGGLE_WIDTH * BM_SWITCH_TOGGLE_HEIGHT; /* Draw file transfer buttons */ drawrectroundedex(p, BM_FT_CAP_WIDTH, BM_FTB_HEIGHT, SCALE(4), 13); loadalpha(BM_FT_CAP, p, BM_FT_CAP_WIDTH, BM_FTB_HEIGHT); p += BM_FT_CAP_WIDTH * BM_FTB_HEIGHT; drawrectrounded(p, BM_FT_WIDTH, BM_FT_HEIGHT, SCALE(4)); loadalpha(BM_FT, p, BM_FT_WIDTH, BM_FT_HEIGHT); p += BM_FT_WIDTH * BM_FT_HEIGHT; drawrectroundedex(p, BM_FTM_WIDTH, BM_FT_HEIGHT, SCALE(4), 13); loadalpha(BM_FTM, p, BM_FTM_WIDTH, BM_FT_HEIGHT); p += BM_FTM_WIDTH * BM_FT_HEIGHT; drawrectroundedex(p, BM_FTB_WIDTH, BM_FTB_HEIGHT + SCALE(1), SCALE(4), 0); loadalpha(BM_FTB1, p, BM_FTB_WIDTH, BM_FTB_HEIGHT + SCALE(1)); p += BM_FTB_WIDTH * (BM_FTB_HEIGHT + SCALE(1)); drawrectroundedex(p, BM_FTB_WIDTH, BM_FTB_HEIGHT, SCALE(4), 14); loadalpha(BM_FTB2, p, BM_FTB_WIDTH, BM_FTB_HEIGHT); p += BM_FTB_WIDTH * BM_FTB_HEIGHT; /* Used by the next few lines */ s = BM_FB_WIDTH * BM_FB_HEIGHT; drawxcross(p, BM_FB_WIDTH, BM_FB_HEIGHT, BM_FB_HEIGHT); loadalpha(BM_NO, p, BM_FB_WIDTH, BM_FB_HEIGHT); p += s; drawlinevert(p, BM_FB_WIDTH, BM_FB_HEIGHT, SCALE(1.5), SCALE(2.5)); drawlinevert(p, BM_FB_WIDTH, BM_FB_HEIGHT, SCALE(8.5), SCALE(2.5)); loadalpha(BM_PAUSE, p, BM_FB_WIDTH, BM_FB_HEIGHT); p += s; drawline(p, BM_FB_WIDTH, BM_FB_HEIGHT, SCALE(2.5), SCALE(7), SCALE(5), SCALE(1)); drawline(p, BM_FB_WIDTH, BM_FB_HEIGHT, SCALE(8), SCALE(7), SCALE(5), SCALE(1)); drawlinedown(p, BM_FB_WIDTH, BM_FB_HEIGHT, SCALE(2.5), SCALE(2.5), SCALE(5), SCALE(1)); drawlinedown(p, BM_FB_WIDTH, BM_FB_HEIGHT, SCALE(8), SCALE(2.5), SCALE(5), SCALE(1)); loadalpha(BM_RESUME, p, BM_FB_WIDTH, BM_FB_HEIGHT); p += s; drawline(p, BM_FB_WIDTH, BM_FB_HEIGHT, SCALE(8), SCALE(6), SCALE(8), SCALE(1)); drawlinedown(p, BM_FB_WIDTH, BM_FB_HEIGHT, SCALE(3), SCALE(6), SCALE(3.5), SCALE(1)); loadalpha(BM_YES, p, BM_FB_WIDTH, BM_FB_HEIGHT); p += s; /* the two small chat buttons... */ drawrectroundedex(p, BM_CHAT_BUTTON_WIDTH, BM_CHAT_BUTTON_HEIGHT, SCALE(4), 13); loadalpha(BM_CHAT_BUTTON_LEFT, p, BM_CHAT_BUTTON_WIDTH, BM_CHAT_BUTTON_HEIGHT); p += BM_CHAT_BUTTON_WIDTH * BM_CHAT_BUTTON_HEIGHT; drawrectroundedex(p, BM_CHAT_BUTTON_WIDTH, BM_CHAT_BUTTON_HEIGHT, SCALE(4), 0); loadalpha(BM_CHAT_BUTTON_RIGHT, p, BM_CHAT_BUTTON_WIDTH, BM_CHAT_BUTTON_HEIGHT); p += BM_CHAT_BUTTON_WIDTH * BM_CHAT_BUTTON_HEIGHT; /* Draw chat send button */ drawrectroundedex(p, BM_CHAT_SEND_WIDTH, BM_CHAT_SEND_HEIGHT, SCALE(8), 14); loadalpha(BM_CHAT_SEND, p, BM_CHAT_SEND_WIDTH, BM_CHAT_SEND_HEIGHT); p += BM_CHAT_SEND_WIDTH * BM_CHAT_SEND_HEIGHT; /* Draw chat send overlay */ drawnewcircle(p, BM_CHAT_SEND_OVERLAY_WIDTH, BM_CHAT_SEND_OVERLAY_HEIGHT, SCALE(20), SCALE(14), SCALE(26)); drawtri(p, BM_CHAT_SEND_OVERLAY_WIDTH, BM_CHAT_SEND_OVERLAY_HEIGHT, SCALE(30), SCALE(18), SCALE(12), 0); loadalpha(BM_CHAT_SEND_OVERLAY, p, BM_CHAT_SEND_OVERLAY_WIDTH, BM_CHAT_SEND_OVERLAY_HEIGHT); p += BM_CHAT_SEND_OVERLAY_WIDTH * BM_CHAT_SEND_OVERLAY_HEIGHT; /* screen shot button overlay */ /* Rounded frame */ drawrectroundedsub(p, BM_CHAT_BUTTON_OVERLAY_WIDTH, BM_CHAT_BUTTON_OVERLAY_HEIGHT, SCALE(1), SCALE(1), BM_CHAT_BUTTON_OVERLAY_WIDTH - (SCALE(8)), BM_CHAT_BUTTON_OVERLAY_HEIGHT - (SCALE(8)), SCALE(1)); drawrectroundedneg(p, BM_CHAT_BUTTON_OVERLAY_WIDTH, BM_CHAT_BUTTON_OVERLAY_HEIGHT, /* width, height */ SCALE(4), SCALE(4), /* start x, y */ BM_CHAT_BUTTON_OVERLAY_WIDTH - (SCALE(12)), BM_CHAT_BUTTON_OVERLAY_HEIGHT - (SCALE(12)), SCALE(1)); /* camera shutter circle */ drawnewcircle(p, BM_CHAT_BUTTON_OVERLAY_WIDTH, BM_CHAT_BUTTON_OVERLAY_HEIGHT, BM_CHAT_BUTTON_OVERLAY_WIDTH * 0.75, BM_CHAT_BUTTON_OVERLAY_HEIGHT * 0.75, SCALE(12)); drawsubcircle(p, BM_CHAT_BUTTON_OVERLAY_WIDTH, BM_CHAT_BUTTON_OVERLAY_HEIGHT, BM_CHAT_BUTTON_OVERLAY_WIDTH * 0.75, BM_CHAT_BUTTON_OVERLAY_HEIGHT * 0.75, SCALE(4)); /* shutter lines */ svgdraw_line_neg(p, BM_CHAT_BUTTON_OVERLAY_WIDTH, BM_CHAT_BUTTON_OVERLAY_HEIGHT, BM_CHAT_BUTTON_OVERLAY_WIDTH * 0.80, BM_CHAT_BUTTON_OVERLAY_HEIGHT * 0.65, SCALE(4), 0.1); svgdraw_line_neg(p, BM_CHAT_BUTTON_OVERLAY_WIDTH, BM_CHAT_BUTTON_OVERLAY_HEIGHT, BM_CHAT_BUTTON_OVERLAY_WIDTH * 0.73, BM_CHAT_BUTTON_OVERLAY_HEIGHT * 0.87, SCALE(4), 0.1); svgdraw_line_down_neg(p, BM_CHAT_BUTTON_OVERLAY_WIDTH, BM_CHAT_BUTTON_OVERLAY_HEIGHT, BM_CHAT_BUTTON_OVERLAY_WIDTH * 0.65, BM_CHAT_BUTTON_OVERLAY_HEIGHT * 0.70, SCALE(4), 0.1); svgdraw_line_down_neg(p, BM_CHAT_BUTTON_OVERLAY_WIDTH, BM_CHAT_BUTTON_OVERLAY_HEIGHT, BM_CHAT_BUTTON_OVERLAY_WIDTH * 0.85, BM_CHAT_BUTTON_OVERLAY_HEIGHT * 0.81, SCALE(4), 0.1); loadalpha(BM_CHAT_BUTTON_OVERLAY_SCREENSHOT, p, BM_CHAT_BUTTON_OVERLAY_WIDTH, BM_CHAT_BUTTON_OVERLAY_HEIGHT); p += BM_CHAT_BUTTON_OVERLAY_WIDTH * BM_CHAT_BUTTON_OVERLAY_HEIGHT; if (p - svg_data != size) { LOG_WARN("SVG", "SVG data size mismatch..."); } if (!needmemory) { free(svg_data); svg_data = NULL; } return true; } uTox/src/ui/scrollable.h0000600000175000001440000000130714003056216014176 0ustar rakusers#ifndef SCROLLABLE_H #define SCROLLABLE_H #include "panel.h" #include struct scrollable { PANEL panel; uint32_t color; int x; bool small; double d; bool left, mousedown, mouseover, mouseover2; int content_height; }; void scroll_draw(SCROLLABLE *s, int x, int y, int width, int height); int scroll_gety(SCROLLABLE *s, int height); bool scroll_mmove(SCROLLABLE *s, int x, int y, int width, int height, int mx, int my, int dx, int dy); bool scroll_mdown(SCROLLABLE *s); bool scroll_mright(SCROLLABLE *s); bool scroll_mwheel(SCROLLABLE *s, int height, double delta, bool smooth); bool scroll_mup(SCROLLABLE *s); bool scroll_mleave(SCROLLABLE *s); #endif uTox/src/ui/scrollable.c0000600000175000001440000000735414003056216014201 0ustar rakusers#include "scrollable.h" #include "draw.h" #include "svg.h" #include "../macros.h" #include "../ui.h" void scroll_draw(SCROLLABLE *s, int x, int y, int width, int height) { uint32_t c = s->content_height; uint32_t h = height, m, dy; uint32_t scroll_width = 0; if (s->small) { scroll_width = SCROLL_WIDTH / 2; } else { scroll_width = SCROLL_WIDTH; } if (h >= c) { // If h(eight) > c(ontent height), don't draw anything. return; } else { m = (h * h) / c; double d = (h - m); dy = (s->d * d) + 0.5; } y += dy; x += s->x; if (!s->left) { x += width - scroll_width; } drawalpha(s->small ? BM_SCROLLHALFTOP_SMALL : BM_SCROLLHALFTOP, x, y, scroll_width, scroll_width / 2, s->color); y += scroll_width / 2; int y2 = y + m - scroll_width; if (scroll_width > m) { y2 = y; } drawrect(x, y, x + scroll_width, y2, s->color); drawalpha(s->small ? BM_SCROLLHALFBOT_SMALL : BM_SCROLLHALFBOT, x, y2, scroll_width, scroll_width / 2, s->color); } int scroll_gety(SCROLLABLE *s, int height) { int c = s->content_height; if (c > height) { return (s->d * (double)(c - height)) + 0.5; } return 0; } bool scroll_mmove(SCROLLABLE *s, int UNUSED(px), int UNUSED(py), int width, int height, int x, int y, int UNUSED(dx), int dy) { bool draw = false; bool hit = inrect(x, y, s->left ? 0 : (width - SCROLL_WIDTH), 0, SCROLL_WIDTH, height); if (s->mouseover != hit) { s->mouseover = hit; draw = true; } s->mouseover2 = inrect(x, y, 0, 0, width, height); if (s->mousedown) { uint32_t c = s->content_height; uint32_t h = height; if (c > h) { uint32_t m = (h * h) / c; double d = (h - m); s->d = ((s->d * d) + (double)dy) / d; if (s->d < 0.0) { s->d = 0.0; } else if (s->d >= 1.0) { s->d = 1.0; } draw = true; } } return draw; } bool scroll_mdown(SCROLLABLE *s) { if (s->mouseover) { s->mousedown = 1; return true; } return false; } bool scroll_mright(SCROLLABLE *UNUSED(s)) { return false; } bool scroll_mwheel(SCROLLABLE *s, int height, double delta, bool smooth) { /* Variable which controls scroll speed. How much one scroll step * moves viewport */ double scroll_speed_multip = 5.0; if (s->mouseover2) { uint32_t content_height = s->content_height; uint32_t port_height = height; if (content_height > port_height) { /* Scrolling is relative to amount of total content in component */ if (smooth) { // this seems to be the magic equation that makes it scroll at the same speed // regardless of how big the port is compared to the content. s->d -= (delta * (32.0 * port_height / content_height) / content_height) * scroll_speed_multip; } else { uint32_t magic = (port_height * port_height) / content_height; double fred = (port_height - magic); s->d -= 16.0 * delta / fred; } if (s->d < 0.0) { s->d = 0.0; } else if (s->d >= 1.0) { s->d = 1.0; } return true; } } return false; } bool scroll_mup(SCROLLABLE *s) { if (s->mousedown) { s->mousedown = 0; return true; } return false; } bool scroll_mleave(SCROLLABLE *s) { if (s->mouseover) { s->mouseover = 0; return true; } s->mouseover2 = 0; return false; } uTox/src/ui/panel.h0000600000175000001440000000126614003056216013157 0ustar rakusers#ifndef UI_PANEL_H #define UI_PANEL_H #include typedef enum { PANEL_NONE, PANEL_MAIN, PANEL_MESSAGES, PANEL_INLINE_VIDEO, PANEL_LIST, PANEL_BUTTON, PANEL_SWITCH, PANEL_DROPDOWN, PANEL_EDIT, PANEL_SCROLLABLE, } PANEL_TYPE; typedef struct panel PANEL; typedef struct scrollable SCROLLABLE; typedef void ui_draw_cb(int x, int y, int w, int h); typedef void ui_update_cb(int width, int height, int scale); struct panel { PANEL_TYPE type; bool disabled; int x, y, width, height; SCROLLABLE *content_scroll; ui_draw_cb *drawfunc; ui_update_cb *update; void *object; PANEL **child; }; #endif // UI_PANEL_H uTox/src/ui/edit.h0000600000175000001440000000442014003056216013000 0ustar rakusers#ifndef UI_EDIT_H #define UI_EDIT_H #include "panel.h" #include "../ui.h" /* TODO replace windows functions, multiline edits, add missing edit functions (ex: double click to select word)*/ #include #include typedef struct scrollable SCROLLABLE; typedef struct edit_change { bool remove, padding; uint16_t start, length; char data[]; } EDIT_CHANGE; typedef struct edit EDIT; struct edit { PANEL panel; bool multiline, mouseover, noborder, readonly, select_completely, vcentered, password; uint16_t mouseover_char, length; uint16_t width, height; uint16_t history_cur, history_length; EDIT_CHANGE **history; SCROLLABLE *scroll; char * data; size_t data_size; MAYBE_I18NAL_STRING empty_str; UI_ELEMENT_STYLE style; void (*onenter)(EDIT *edit); void (*onchange)(EDIT *edit); void (*ontab)(EDIT *edit); void (*onshifttab)(EDIT *edit); void (*onlosefocus)(EDIT *edit); }; void edit_draw(EDIT *edit, int x, int y, int width, int height); bool edit_mmove(EDIT *edit, int x, int y, int width, int height, int mx, int my, int dx, int dy); bool edit_mdown(EDIT *edit); bool edit_dclick(EDIT *edit, bool triclick); bool edit_mright(EDIT *edit); bool edit_mwheel(EDIT *edit, int height, double d, bool smooth); bool edit_mup(EDIT *edit); bool edit_mleave(EDIT *edit); void edit_do(EDIT *edit, uint16_t start, uint16_t length, bool remove); void edit_press(void); void edit_char(uint32_t ch, bool control, uint8_t flags); int edit_selection(EDIT *edit, char *data, int len); int edit_copy(char *data, int len); void edit_paste(char *data, int len, bool select); bool edit_active(void); EDIT *edit_get_active(void); void edit_resetfocus(void); void edit_setfocus(EDIT *edit); void edit_setstr(EDIT *edit, char *str, uint16_t length); void edit_setcursorpos(EDIT *edit, uint16_t pos); uint16_t edit_getcursorpos(void); // set outloc and outlen to the mark range. // returns 1 if the mark range is valid for the current edit, // else 0. // a mark range is valid when *outlen != 0 and there is an active edit. bool edit_getmark(uint16_t *outloc, uint16_t *outlen); void edit_setmark(uint16_t loc, uint16_t len); void edit_setselectedrange(uint16_t loc, uint16_t len); #endif // UI_EDIT_H uTox/src/ui/edit.c0000600000175000001440000006572514003056216013012 0ustar rakusers#include "edit.h" #include "contextmenu.h" #include "draw.h" #include "scrollable.h" #include "text.h" #include "../debug.h" #include "../macros.h" #include "../settings.h" #include "../text.h" #include "../theme.h" #include "../ui.h" #include "../native/clipboard.h" #include "../native/keyboard.h" #include "../native/os.h" #include "../native/ui.h" #include #include #include static EDIT *active_edit; static struct { uint16_t start, length; uint16_t p1, p2; // IME mark (underline) uint16_t mark_start, mark_length; } edit_sel; static bool edit_select; static void setactive(EDIT *edit) { if (edit != active_edit) { edit_will_deactivate(); if (active_edit && active_edit->onlosefocus) { active_edit->onlosefocus(active_edit); } active_edit = edit; } } void edit_draw(EDIT *edit, int x, int y, int width, int height) { if (width - SCALE(8) - SCALE(SCROLL_WIDTH) < 0) { // why? return; } if (settings.window_baseline && y > (int)settings.window_baseline - font_small_lineheight - SCALE(8)) { y = settings.window_baseline - font_small_lineheight - SCALE(8); } edit->width = width - SCALE(8) - (edit->multiline ? SCALE(SCROLL_WIDTH) : 0); edit->height = height - SCALE(8); // load colors for this style uint32_t color_bg, color_border, color_border_h, color_border_a, color_text; switch (edit->style) { case AUXILIARY_STYLE: color_bg = COLOR_BKGRND_AUX; color_border = COLOR_AUX_EDGE_NORMAL; color_border_h = COLOR_AUX_EDGE_HOVER; color_border_a = COLOR_AUX_EDGE_ACTIVE; color_text = COLOR_AUX_TEXT; break; default: color_bg = COLOR_BKGRND_MAIN; color_border = COLOR_EDGE_NORMAL; color_border_h = COLOR_EDGE_HOVER; color_border_a = COLOR_EDGE_ACTIVE; color_text = COLOR_MAIN_TEXT; break; } if (!edit->noborder) { draw_rect_frame(x, y, width, height, (edit == active_edit) ? color_border_a : (edit->mouseover ? color_border_h : color_border)); } draw_rect_fill(x + 1, y + 1, width - SCALE(2), height - SCALE(2), color_bg); setfont(FONT_TEXT); setcolor(color_text); int yy = y; if (edit->multiline) { pushclip(x + 1, y + 1, width - 2, height - 2); SCROLLABLE *scroll = edit->scroll; scroll->content_height = text_height(width - SCALE(8) - SCALE(SCROLL_WIDTH), font_small_lineheight, edit->data, edit->length) + SCALE(8); scroll_draw(scroll, x, y, width, height); yy -= scroll_gety(scroll, height); } /* because the search field has a padding of 3.5 SCALEs */ float top_offset = 2.0; if (edit->vcentered && !edit->multiline) { top_offset = (height - font_small_lineheight) / (SCALE(4.0)); } // display an edit hint if there's no text in the field if (!edit->length && maybe_i18nal_string_is_valid(&edit->empty_str)) { STRING *empty_str_text = maybe_i18nal_string_get(&edit->empty_str); setcolor(COLOR_MAIN_TEXT_HINT); drawtext(x + SCALE(4), yy + SCALE(top_offset* 2), empty_str_text->str, empty_str_text->length); } bool is_active = (edit == active_edit); char *star = NULL; if (edit->password && edit->length) { star = malloc(edit->length); if (!star) { LOG_FATAL_ERR(EXIT_MALLOC, "UI Edit", "Unable to malloc for password field"); } /* Generate the stars for this password */ memset(star, '*', edit->length); } utox_draw_text_multiline_within_box( x + SCALE(4), yy + SCALE(top_offset * 2), x + width - SCALE(4) - (edit->multiline ? SCALE(SCROLL_WIDTH) : 0), y, y + height, font_small_lineheight, star ? star : edit->data, edit->length, is_active ? edit_sel.start : UINT16_MAX, is_active ? edit_sel.length : UINT16_MAX, is_active ? edit_sel.mark_start : 0, is_active ? edit_sel.mark_length : 0, edit->multiline); free(star); if (edit->multiline) { popclip(); } } bool edit_mmove(EDIT *edit, int px, int py, int width, int height, int x, int y, int dx, int dy) { if (settings.window_baseline && py > (int)settings.window_baseline - font_small_lineheight - SCALE(8)) { y += py - (settings.window_baseline - font_small_lineheight - SCALE(8)); py = settings.window_baseline - font_small_lineheight - SCALE(8); } bool need_redraw = 0; bool mouseover = inrect(x, y, 0, 0, width - (edit->multiline ? SCALE(SCROLL_WIDTH) : 0), height); if (mouseover) { cursor = CURSOR_TEXT; } if (mouseover != edit->mouseover) { edit->mouseover = mouseover; if (edit != active_edit) { need_redraw = 1; } } if (edit->multiline) { need_redraw |= scroll_mmove(edit->scroll, px, py, width, height, x, y, dx, dy); y += scroll_gety(edit->scroll, height); } if (edit == active_edit && edit_select) { if (edit->select_completely) { edit_setfocus(edit); need_redraw = 1; return need_redraw; } setfont(FONT_TEXT); edit_sel.p2 = hittextmultiline(x - SCALE(4), width - SCALE(8) - (edit->multiline ? SCALE(SCROLL_WIDTH) : 0), y - SCALE(4), INT_MAX, font_small_lineheight, edit->data, edit->length, edit->multiline); uint16_t start, length; if (edit_sel.p2 > edit_sel.p1) { start = edit_sel.p1; length = edit_sel.p2 - edit_sel.p1; } else { start = edit_sel.p2; length = edit_sel.p1 - edit_sel.p2; } if (start != edit_sel.start || length != edit_sel.length) { edit_sel.start = start; edit_sel.length = length; need_redraw = 1; } } else if (mouseover) { setfont(FONT_TEXT); edit->mouseover_char = hittextmultiline(x - SCALE(4), width - SCALE(8) - (edit->multiline ? SCALE(SCROLL_WIDTH) : 0), y - SCALE(4), INT_MAX, font_small_lineheight, edit->data, edit->length, edit->multiline); } return need_redraw; } bool edit_mdown(EDIT *edit) { if (edit->mouseover_char > edit->length) { edit->mouseover_char = edit->length; } if (edit->multiline) { if (scroll_mdown(edit->scroll)) { return 1; } } if (edit->mouseover) { edit_sel.start = edit_sel.p1 = edit_sel.p2 = edit->mouseover_char; edit_sel.length = 0; edit_select = 1; setactive(edit); showkeyboard(1); return 1; } else if (edit == active_edit) { edit_resetfocus(); } return 0; } bool edit_dclick(EDIT *edit, bool triclick) { if (edit != active_edit) { return false; } if (edit->mouseover_char > edit->length) { edit->mouseover_char = edit->length; } uint16_t i = edit->mouseover_char; while (i != 0 && edit->data[i - 1] != '\n' /* If it's a dclick, also set ' ' as boundary, else do nothing. */ && (!triclick ? (edit->data[i - 1] != ' ') : 1)) { i -= utf8_unlen(edit->data + i); } edit_sel.start = edit_sel.p1 = i; i = edit->mouseover_char; while (i != edit->length && edit->data[i] != '\n' /* If it's a dclick, also set ' ' as boundary, else do nothing. */ && (!triclick ? (edit->data[i] != ' ') : 1)) { i += utf8_len(edit->data + i); } edit_sel.p2 = i; edit_sel.length = i - edit_sel.start; return true; } static void contextmenu_edit_onselect(uint8_t i) { switch (i) { case 0: copy(0); edit_char(KEY_DEL, 1, 0); break; case 1: copy(0); break; case 2: paste(); break; case 3: edit_char(KEY_DEL, 1, 0); break; case 4: /* Send a ctrl + a to the active edit */ edit_char('A', 1, 4); break; } } bool edit_mright(EDIT *edit) { static UTOX_I18N_STR menu_edit[] = { STR_CUT, STR_COPY, STR_PASTE, STR_DELETE, STR_SELECTALL }; if (edit->mouseover_char > edit->length) { edit->mouseover_char = edit->length; } if (edit->mouseover) { EDIT *active = active_edit; if (active != edit) { setactive(edit); edit_sel.start = edit_sel.p1 = edit_sel.p2 = edit->mouseover_char; edit_sel.length = 0; edit_select = 1; } contextmenu_new(COUNTOF(menu_edit), menu_edit, contextmenu_edit_onselect); return true; } else if (active_edit == edit) { edit_resetfocus(); // lose focus if right mouse button is pressed somewhere else return true; // redraw } return false; } void edit_press(void) { edit_sel.start = edit_sel.p1 = edit_sel.p2 = active_edit->mouseover_char; edit_sel.length = 0; } bool edit_mwheel(EDIT *edit, int height, double d, bool smooth) { if (edit->multiline) { return scroll_mwheel(edit->scroll, height - SCALE(8), d, smooth); } return false; } bool edit_mup(EDIT *edit) { if (edit->multiline) { if (scroll_mup(edit->scroll)) { return true; } } if (edit_select && edit == active_edit) { setselection(edit->data + edit_sel.start, edit_sel.length); edit_select = 0; } return false; } bool edit_mleave(EDIT *edit) { if (edit->mouseover) { edit->mouseover = false; return true; } return false; } static void edit_redraw(void) { redraw(); } static uint16_t edit_change_do(EDIT *edit, EDIT_CHANGE *c) { uint16_t r = c->start; if (c->remove) { memmove(edit->data + c->start + c->length, edit->data + c->start, edit->length - c->start); memcpy(edit->data + c->start, c->data, c->length); edit->length += c->length; r += c->length; } else { edit->length -= c->length; memmove(edit->data + c->start, edit->data + c->start + c->length, edit->length - c->start); } c->remove = !c->remove; return r; } void edit_do(EDIT *edit, uint16_t start, uint16_t length, bool remove) { EDIT_CHANGE *new_change; if (edit->history_cur != edit->history_length) { uint16_t i = edit->history_cur; while (i != edit->history_length) { free(edit->history[i++]); } } edit->history = realloc(edit->history, (edit->history_cur + 1) * sizeof(void *)); if (!edit->history) { LOG_FATAL_ERR(EXIT_MALLOC, "UI Edit", "Unable to realloc for edit history, this should never happen!"); } new_change = calloc(1, sizeof(EDIT_CHANGE) + length); if (!new_change) { LOG_FATAL_ERR(EXIT_MALLOC, "UI Edit", "Unable to calloc for new EDIT_CHANGE, this should never happen!"); } new_change->remove = remove; new_change->start = start; new_change->length = length; memcpy(new_change->data, edit->data + start, length); edit->history[edit->history_cur] = new_change; edit->history_cur++; edit->history_length = edit->history_cur; } static uint16_t edit_undo(EDIT *edit) { uint16_t r = UINT16_MAX; if (edit->history_cur) { edit->history_cur--; r = edit_change_do(edit, edit->history[edit->history_cur]); } return r; } static uint16_t edit_redo(EDIT *edit) { uint16_t r = UINT16_MAX; if (edit->history_cur != edit->history_length) { r = edit_change_do(edit, edit->history[edit->history_cur]); edit->history_cur++; } return r; } static void edit_del(EDIT *edit) { if (edit->readonly) { return; } char *p = active_edit->data + edit_sel.start; if (edit_sel.length) { edit_do(edit, edit_sel.start, edit_sel.length, 1); memmove(p, p + edit_sel.length, active_edit->length - (edit_sel.start + edit_sel.length)); active_edit->length -= edit_sel.length; } else if (edit_sel.start < active_edit->length) { uint8_t len = utf8_len(p); edit_do(edit, edit_sel.start, len, 1); memmove(p, p + len, active_edit->length - edit_sel.start - len); active_edit->length -= len; } edit_sel.p1 = edit_sel.start; edit_sel.p2 = edit_sel.start; edit_sel.length = 0; } #define updatesel() \ if (edit_sel.p1 <= edit_sel.p2) { \ edit_sel.start = edit_sel.p1; \ edit_sel.length = edit_sel.p2 - edit_sel.p1; \ } else { \ edit_sel.start = edit_sel.p2; \ edit_sel.length = edit_sel.p1 - edit_sel.p2; \ } enum { EMOD_SHIFT = (1 << 0), EMOD_CTRL = (1 << 2), }; void edit_char(uint32_t ch, bool control, uint8_t flags) { if (!active_edit) { LOG_ERR("UI Edit", "Stopped you from crashing because no edit was active or something."); return; } EDIT *edit = active_edit; // TODO this is bad // shift: flags & 1 // control: flags & 4 if (control || (ch <= 0x1F && (!edit->multiline || ch != '\n')) || (ch >= 0x7f && ch <= 0x9F)) { bool modified = false; switch (ch) { case KEY_BACK: { if (edit->readonly) { return; } if (edit_sel.length == 0) { uint16_t p = edit_sel.start; if (p == 0) { break; } modified = true; /* same as ctrl+left */ if (flags & EMOD_CTRL) { while (p != 0 && edit->data[p - 1] == ' ') { p--; } } if (p != 0) { do { p -= utf8_unlen(&edit->data[p]); } while ((flags & EMOD_CTRL) && p != 0 && edit->data[p - 1] != ' ' && edit->data[p - 1] != '\n'); } uint16_t len = edit_sel.start - p; edit_do(edit, edit_sel.start - len, len, 1); memmove(edit->data + edit_sel.start - len, edit->data + edit_sel.start, edit->length - edit_sel.start); edit->length -= len; edit_sel.start -= len; edit_sel.p1 = edit_sel.start; edit_sel.p2 = edit_sel.start; break; } edit_del(edit); modified = true; break; } case KEY_DEL: { edit_del(edit); modified = true; break; } case KEY_LEFT: { uint16_t p = edit_sel.p2; if (p != 0) { if (flags & EMOD_CTRL) { while (p != 0 && edit->data[p - 1] == ' ') { p--; } } if (p != 0) { do { p -= utf8_unlen(&edit->data[p]); } while ((flags & EMOD_CTRL) && p != 0 && edit->data[p - 1] != ' ' && edit->data[p - 1] != '\n'); } } if (flags & EMOD_SHIFT) { edit_sel.p2 = p; updatesel(); } else { if (edit_sel.length) { p = edit_sel.start; } edit_sel.p1 = p; edit_sel.p2 = p; edit_sel.start = p; edit_sel.length = 0; } break; } case KEY_RIGHT: { uint16_t p = edit_sel.p2; if (flags & EMOD_CTRL) { while (p != edit->length && edit->data[p] == ' ') { p++; } } do { if (p == edit->length) { break; } p += utf8_len(&edit->data[p]); } while ((flags & EMOD_CTRL) && edit->data[p] != ' ' && edit->data[p] != '\n'); if (flags & EMOD_SHIFT) { edit_sel.p2 = p; updatesel(); } else { if (edit_sel.length) { p = edit_sel.start + edit_sel.length; } edit_sel.p1 = p; edit_sel.p2 = p; edit_sel.start = p; edit_sel.length = 0; } break; } case KEY_UP: { if (!edit->multiline) { break; } setfont(FONT_TEXT); edit_sel.p2 = text_lineup(edit->width, edit->height, edit_sel.p2, font_small_lineheight, edit->data, edit->length, edit->scroll); if (!(flags & EMOD_SHIFT)) { edit_sel.p1 = edit_sel.p2; } updatesel(); break; } case KEY_DOWN: { if (!edit->multiline) { break; } setfont(FONT_TEXT); edit_sel.p2 = text_linedown(edit->width, edit->height, edit_sel.p2, font_small_lineheight, edit->data, edit->length, edit->scroll); if (!(flags & EMOD_SHIFT)) { edit_sel.p1 = edit_sel.p2; } updatesel(); break; } case KEY_PAGEUP: { if (!edit->multiline) { break; } edit->scroll->d = 0.0; break; } case KEY_PAGEDOWN: { if (!edit->multiline) { break; } edit->scroll->d = 1.0; break; } case KEY_HOME: { uint16_t p = edit_sel.p2; if (p == 0 && !edit_sel.length) { break; } if (flags & EMOD_CTRL) { p = 0; } else { while (p != 0 && edit->data[p - 1] != '\n') { --p; } } if (flags & EMOD_SHIFT) { edit_sel.p2 = p; updatesel(); } else { edit_sel.p1 = p; edit_sel.p2 = p; edit_sel.start = p; edit_sel.length = 0; } break; } case KEY_END: { uint16_t p = edit_sel.p2; if (p == edit->length && !edit_sel.length) { break; } if (flags & EMOD_CTRL) { p = edit->length; } else { while (edit->data[p] != '\n' && p != edit->length) { p++; } } if (flags & EMOD_SHIFT) { edit_sel.p2 = p; updatesel(); } else { edit_sel.p1 = p; edit_sel.p2 = p; edit_sel.start = p; edit_sel.length = 0; } break; } case 'a': case 'A': { edit_sel.p1 = 0; edit_sel.p2 = active_edit->length; edit_sel.start = 0; edit_sel.length = active_edit->length; setselection(active_edit->data, active_edit->length); break; } case 'z': { uint16_t p = edit_undo(edit); if (p != UINT16_MAX) { edit_sel.p1 = p; edit_sel.p2 = p; edit_sel.start = p; edit_sel.length = 0; modified = true; } break; } case 'Z': case 'y': case 'Y': { uint16_t p = edit_redo(edit); if (p != UINT16_MAX) { edit_sel.p1 = p; edit_sel.p2 = p; edit_sel.start = p; edit_sel.length = 0; modified = false; } break; } case KEY_RETURN: { modified = true; if (edit->onenter && !(flags & EMOD_CTRL)) { edit->onenter(edit); /*dirty*/ if (edit->length == 0) { for (uint16_t i = 0; i != edit->history_length; i++) { free(edit->history[i]); } free(edit->history); edit->history = NULL; edit->history_cur = 0; edit->history_length = 0; edit_sel.p1 = 0; edit_sel.p2 = 0; edit_sel.start = 0; edit_sel.length = 0; } } break; } case KEY_TAB: { if ((flags & EMOD_SHIFT) && !(flags & EMOD_CTRL) && edit->onshifttab) { edit->onshifttab(edit); } else if (!(flags & EMOD_CTRL) && edit->ontab) { edit->ontab(edit); } break; } } edit_select = 0; if (modified && edit->onchange) { edit->onchange(edit); } edit_redraw(); } else if (!edit->readonly) { uint8_t len = unicode_to_utf8_len(ch); char *p = edit->data + edit_sel.start; if ((size_t)edit->length - edit_sel.length + len >= edit->data_size) { return; } if (edit_sel.length) { edit_do(edit, edit_sel.start, edit_sel.length, 1); } memmove(p + len, p + edit_sel.length, edit->length - (edit_sel.start + edit_sel.length)); edit->length -= edit_sel.length; unicode_to_utf8(ch, edit->data + edit_sel.start); edit->length += len; edit_do(edit, edit_sel.start, len, 0); edit_sel.start += len; edit_sel.p1 = edit_sel.start; edit_sel.p2 = edit_sel.p1; edit_sel.length = 0; if (edit->onchange) { edit->onchange(edit); } edit_redraw(); } } int edit_selection(EDIT *edit, char *data, int UNUSED(len)) { if (data) { memcpy(data, edit->data + edit_sel.start, edit_sel.length); } return edit_sel.length; } int edit_copy(char *data, int len) { return edit_selection(active_edit, data, len); } void edit_paste(char *data, int length, bool select) { if (!active_edit) { return; } if (active_edit->readonly) { return; } length = utf8_validate((uint8_t *)data, length); const int maxlen = (active_edit->data_size - 1) - active_edit->length + edit_sel.length; int newlen = 0, i = 0; while (i < length) { const uint8_t len = utf8_len(data + i); const bool not_linebreak = !active_edit->multiline || data[i] != '\n'; const bool is_multibyte = len > 1; const bool is_control_char = is_multibyte ? (uint8_t)data[i] == 0xC2 && (uint8_t)data[i + 1] <= 0x9F : data[i] <= 0x1F && not_linebreak; const bool is_delete = data[i] == 0x7F; if (is_delete || is_control_char) { // Ignore these characters } else { if (newlen + len > maxlen) { break; } if (newlen != i) { memcpy(data + newlen, data + i, len); } newlen += len; } i += len; } if (newlen == 0) { return; } char *p = active_edit->data + edit_sel.start; if (edit_sel.length) { edit_do(active_edit, edit_sel.start, edit_sel.length, 1); } memmove(p + newlen, p + edit_sel.length, active_edit->length - (edit_sel.start + edit_sel.length)); memcpy(p, data, newlen); edit_do(active_edit, edit_sel.start, newlen, 0); active_edit->length += newlen - edit_sel.length; if (select) { edit_sel.length = newlen; setselection(active_edit->data + edit_sel.start, newlen); } else { edit_sel.start = edit_sel.start + newlen; edit_sel.length = 0; } edit_sel.p1 = edit_sel.start; edit_sel.p2 = edit_sel.start + edit_sel.length; if (active_edit->onchange) { active_edit->onchange(active_edit); } edit_redraw(); } void edit_resetfocus(void) { edit_select = 0; setactive(NULL); } void edit_setfocus(EDIT *edit) { if (active_edit == edit) { return; } edit_select = 0; edit_sel.start = edit_sel.p1 = 0; edit_sel.length = edit_sel.p2 = edit->length; edit_sel.mark_start = 0; edit_sel.mark_length = 0; setactive(edit); } bool edit_active(void) { return (active_edit != NULL); } EDIT *edit_get_active(void) { return active_edit; } void edit_setstr(EDIT *edit, char *str, uint16_t length) { uint16_t maxlength; maxlength = edit->data_size - 1; if (length >= maxlength) { length = maxlength; } edit->length = length; memcpy(edit->data, str, length); if (edit->onchange) { edit->onchange(edit); } } void edit_setcursorpos(EDIT *edit, uint16_t pos) { if (pos <= edit->length) { edit_sel.p1 = pos; } else { edit_sel.p1 = edit->length; } edit_sel.p2 = edit_sel.start = edit_sel.p1; edit_sel.length = 0; } uint16_t edit_getcursorpos(void) { return edit_sel.p1 < edit_sel.p2 ? edit_sel.p1 : edit_sel.p2; } bool edit_getmark(uint16_t *outloc, uint16_t *outlen) { if (outloc) { *outloc = edit_sel.mark_start; } if (outlen) { *outlen = edit_sel.mark_length; } return (active_edit && edit_sel.mark_length) ? 1 : 0; } void edit_setmark(uint16_t loc, uint16_t len) { edit_sel.mark_start = loc; edit_sel.mark_length = len; } void edit_setselectedrange(uint16_t loc, uint16_t len) { edit_sel.start = edit_sel.p1 = loc; edit_sel.length = len; edit_sel.p2 = loc + len; } uTox/src/ui/dropdown.h0000600000175000001440000000253114003056216013710 0ustar rakusers#ifndef UI_DROPDOWN_H #define UI_DROPDOWN_H #include "panel.h" #include "../ui.h" #include // userdata of list-based dropdown consists of these records typedef struct { MAYBE_I18NAL_STRING name; void * handle; } DROP_ELEMENT; typedef struct dropdown { PANEL panel; bool mouseover, open, skip_mup; uint16_t dropcount, selected, over; void (*onselect)(uint16_t, const struct dropdown *); STRING *(*ondisplay)(uint16_t, const struct dropdown *); UI_ELEMENT_STYLE style; void *userdata; } DROPDOWN; void dropdown_drawactive(void); void dropdown_draw(DROPDOWN *b, int x, int y, int width, int height); bool dropdown_mmove(DROPDOWN *b, int x, int y, int width, int height, int mx, int my, int dx, int dy); bool dropdown_mdown(DROPDOWN *b); bool dropdown_mright(DROPDOWN *b); bool dropdown_mwheel(DROPDOWN *b, int height, double d, bool smooth); bool dropdown_mup(DROPDOWN *b); bool dropdown_mleave(DROPDOWN *b); bool dropdown_close(DROPDOWN *b); STRING *simple_dropdown_ondisplay(uint16_t, const DROPDOWN *); STRING *dropdown_list_ondisplay(uint16_t i, const DROPDOWN *dm); void dropdown_list_add_hardcoded(DROPDOWN *d, char *name, void *handle); void dropdown_list_add_localized(DROPDOWN *d, UTOX_I18N_STR string_id, void *handle); void dropdown_list_clear(DROPDOWN *); #endif // UI_DROPDOWN_H uTox/src/ui/dropdown.c0000600000175000001440000001765014003056216013713 0ustar rakusers#include "dropdown.h" #include "draw.h" #include "../macros.h" #include "../settings.h" #include "../theme.h" #include #include static DROPDOWN *active_dropdown; static int active_x, active_y, active_width, active_height; /* Show selected first, then skip selected */ #define index(d, i) (i == 0 ? d->selected : ((i > d->selected) ? i : i - 1)) // Draw background rectangles for a dropdown void dropdown_drawactive(void) { DROPDOWN *drop = active_dropdown; if (!drop) { return; } // load colors for this style uint32_t color_bg, color_border, color_aoptbg, color_aopttext, color_text; switch (drop->style) { case AUXILIARY_STYLE: color_bg = COLOR_BKGRND_AUX; color_border = COLOR_AUX_EDGE_ACTIVE; color_aoptbg = COLOR_AUX_ACTIVEOPTION_BKGRND; color_aopttext = COLOR_AUX_ACTIVEOPTION_TEXT; color_text = COLOR_AUX_TEXT; break; default: color_bg = COLOR_BKGRND_MAIN; color_border = COLOR_EDGE_ACTIVE; color_aoptbg = COLOR_ACTIVEOPTION_BKGRND; color_aopttext = COLOR_ACTIVEOPTION_TEXT; color_text = COLOR_MAIN_TEXT; break; } int x = active_x, y = active_y, w = active_width, h = active_height; int i, sign = 1; // Increase width if needed, so that all menu items fit. for (i = 0; i != drop->dropcount; i++) { STRING *e = drop->ondisplay(i, drop); int needed_w = textwidth(e->str, e->length) + SCALE(8); if (w < needed_w) { w = needed_w; } } if (y + h * drop->dropcount > (int)settings.window_height) { // y -= h * (drop->dropcount - 1); // sign = -1; } y -= h * drop->selected; draw_rect_fill(x, y, w, h * drop->dropcount, color_bg); draw_rect_frame(x, y, w, h * drop->dropcount, color_border); //if (sign == -1) { // y += h * (drop->dropcount - 1); //} for (i = 0; i != drop->dropcount; i++) { // int j = index(drop, i); int j = i; STRING *e = drop->ondisplay(j, drop); if (j == drop->over) { draw_rect_fill(x + 1, y + 1, w - 2, h - 2, color_aoptbg); setcolor(color_aopttext); } else { setcolor(color_text); } setfont(FONT_TEXT); drawtext(x + SCALE(4), y + SCALE(4), e->str, e->length); y += sign * h; } } // Draw collapsed dropdown void dropdown_draw(DROPDOWN *d, int x, int y, int width, int height) { if (!d->open) { // load colors for this style uint32_t color_bg, color_border, color_border_h, color_text; switch (d->style) { case AUXILIARY_STYLE: color_bg = COLOR_BKGRND_AUX; color_border = COLOR_AUX_EDGE_NORMAL; color_border_h = COLOR_AUX_EDGE_HOVER; color_text = COLOR_AUX_TEXT; break; default: color_bg = COLOR_BKGRND_MAIN; color_border = COLOR_EDGE_NORMAL; color_border_h = COLOR_EDGE_HOVER; color_text = COLOR_MAIN_TEXT; break; } draw_rect_frame(x, y, width, height, (d->mouseover ? color_border_h : color_border)); draw_rect_fill(x + 1, y + 1, width - 2, height - 2, color_bg); if (d->dropcount) { setfont(FONT_TEXT); setcolor(color_text); STRING *text = d->ondisplay(d->selected, d); drawtextwidth(x + SCALE(4), width - SCALE(8), y + SCALE(4), text->str, text->length); } } else { active_x = x; active_y = y; active_width = width; active_height = height; } } bool dropdown_mmove(DROPDOWN *d, int UNUSED(x), int y, int w, int h, int mx, int my, int UNUSED(dx), int UNUSED(dy)) { if (d->open) { bool mouseover; if (my > 0) { mouseover = inrect(mx, my, 0, 0, w, MIN(h * d->dropcount, (int)settings.window_height)); } else { mouseover = mx >= 0 && mx <= w && abs(my) <= h * d->selected; } if (d->mouseover != mouseover) { d->mouseover = mouseover; } if (mouseover) { d->skip_mup = true; } else { d->over = false; d->skip_mup = false; return true; } int over = my / h + d->selected; if (y + h * d->dropcount > (int)settings.window_height) { // over = my > 0 ? 0 : ((-my) / h + 1); } if (my < 0) over--; if (over < d->dropcount) { // over = index(d, over); if (over != d->over) { d->over = over; return true; } } } else { bool mouseover = inrect(mx, my, 0, 0, w, h); if (d->mouseover != mouseover) { d->mouseover = mouseover; return true; } } return false; } bool dropdown_mdown(DROPDOWN *d) { if (d->mouseover && d->dropcount) { d->open = true; active_dropdown = d; return true; } if (d->skip_mup) { return dropdown_close(d); } return false; } bool dropdown_close(DROPDOWN *d) { d->open = false; active_dropdown = NULL; return true; } bool dropdown_mright(DROPDOWN *UNUSED(d)) { return false; } bool dropdown_mwheel(DROPDOWN *UNUSED(d), int UNUSED(height), double UNUSED(dlta), bool UNUSED(smooth)) { return false; } bool dropdown_mup(DROPDOWN *d) { if (d->open) { if (!d->mouseover) { return dropdown_close(d); } if (d->skip_mup) { d->skip_mup = false; dropdown_close(d); if (d->over < d->dropcount) { d->selected = d->over; d->onselect(d->selected, d); } return true; } else { d->skip_mup = true; } return false; } return false; } bool dropdown_mleave(DROPDOWN *d) { if (d->mouseover) { d->mouseover = false; return true; } return false; } /***** list-based dropdown menu start *****/ // Appends localization-independent menu item. void dropdown_list_add_hardcoded(DROPDOWN *d, char *name, void *handle) { void *p = realloc(d->userdata, (d->dropcount + 1) * sizeof(DROP_ELEMENT)); if (!p) { return; } d->userdata = p; DROP_ELEMENT *e = &((DROP_ELEMENT *)d->userdata)[d->dropcount++]; maybe_i18nal_string_set_plain(&e->name, name, strlen((char *)name)); e->handle = handle; } // Appends localized menu item. void dropdown_list_add_localized(DROPDOWN *d, UTOX_I18N_STR string_id, void *handle) { void *p = realloc(d->userdata, (d->dropcount + 1) * sizeof(DROP_ELEMENT)); if (!p) { return; } d->userdata = p; DROP_ELEMENT *e = &((DROP_ELEMENT *)d->userdata)[d->dropcount++]; maybe_i18nal_string_set_i18nal(&e->name, string_id); e->handle = handle; } // Clears menu (removes all menu items of a list-based dropdown). void dropdown_list_clear(DROPDOWN *d) { free(d->userdata); d->userdata = NULL; d->dropcount = 0; d->over = false; d->selected = 0; } // Generic display function for list-based dropdowns, // userdata of which is an array of DROP_ELEMENTs. STRING *dropdown_list_ondisplay(uint16_t i, const DROPDOWN *dm) { DROP_ELEMENT *e = &((DROP_ELEMENT *)dm->userdata)[i]; return maybe_i18nal_string_get(&e->name); } /***** list-based dropdown menu end *****/ /***** simple localized dropdown menu start *****/ // Generic display function for simple dropdowns, // userdata of which is a simple array of UI_STRING_IDs. STRING *simple_dropdown_ondisplay(uint16_t i, const DROPDOWN *dm) { return SPTRFORLANG(settings.language, ((UTOX_I18N_STR *)dm->userdata)[i]); } /***** simple localized dropdown menu end *****/ uTox/src/ui/draw.h0000600000175000001440000000267514003056216013022 0ustar rakusers#ifndef UI_DRAW_H #define UI_DRAW_H #include extern int font_small_lineheight, font_msg_lineheight; void drawtext(int x, int y, const char *str, uint16_t length); int drawtext_getwidth(int x, int y, const char *str, uint16_t length); void drawtextwidth(int x, int width, int y, const char *str, uint16_t length); void drawtextwidth_right(int x, int width, int y, const char *str, uint16_t length); void drawtextrange(int x, int x2, int y, const char *str, uint16_t length); void drawtextrangecut(int x, int x2, int y, const char *str, uint16_t length); int textwidth(const char *str, uint16_t length); int textfit(const char *str, uint16_t length, int width); int textfit_near(const char *str, uint16_t length, int width); void drawrect(int x, int y, int right, int bottom, uint32_t color); void draw_rect_frame(int x, int y, int width, int height, uint32_t color); void draw_rect_fill(int x, int y, int width, int height, uint32_t color); void drawhline(int x, int y, int x2, uint32_t color); void drawvline(int x, int y, int y2, uint32_t color); #define drawpixel(x, y, color) drawvline(x, y, (y) + 1, color) void setfont(int id); uint32_t setcolor(uint32_t color); void pushclip(int x, int y, int width, int height); void popclip(void); void enddraw(int x, int y, int width, int height); void drawalpha(int bm, int x, int y, int width, int height, uint32_t color); void loadalpha(int bm, void *data, int width, int height); #endif uTox/src/ui/draw.c0000600000175000001440000000010314003056216012775 0ustar rakusers#include "draw.h" int font_small_lineheight, font_msg_lineheight; uTox/src/ui/contextmenu.h0000600000175000001440000000143014003056216014422 0ustar rakusers#ifndef UI_CONTEXTMENU_H #define UI_CONTEXTMENU_H #include "../ui.h" #include #include typedef struct contextmenu { int x, y, width, height; bool open; uint8_t count, over, down; void (*onselect)(uint8_t); STRING *(*ondisplay)(uint8_t, const struct contextmenu *); void *userdata; } CONTEXTMENU; void contextmenu_draw(void); bool contextmenu_mmove(int mx, int my, int dx, int dy); bool contextmenu_mdown(void); bool contextmenu_mup(void); bool contextmenu_mleave(void); void contextmenu_new(uint8_t count, UTOX_I18N_STR *menu_string_ids, void (*onselect)(uint8_t)); void contextmenu_new_ex(uint8_t count, void *userdata, void (*onselect)(uint8_t), STRING *(*ondisplay)(uint8_t, const CONTEXTMENU *)); #endif uTox/src/ui/contextmenu.c0000600000175000001440000000756614003056216014435 0ustar rakusers#include "contextmenu.h" #include "draw.h" #include "../macros.h" #include "../settings.h" #include "../theme.h" #include "../ui.h" static CONTEXTMENU context_menu; #define CONTEXT_WIDTH (SCALE(120)) #define CONTEXT_HEIGHT (SCALE(24)) static void calculate_pos_and_width(CONTEXTMENU *b, int *x, int *w) { uint8_t i; *x = b->x; *w = b->width; // Increase width if needed, so that all menu items fit. for (i = 0; i < b->count; i++) { STRING *name = b->ondisplay(i, b); int needed_w = textwidth(name->str, name->length) + SCALE(8); if (*w < needed_w) { *w = needed_w; } } // Push away from the right border to fit. if (*x + *w >= (int)settings.window_width) { *x -= *w; } } void contextmenu_draw(void) { CONTEXTMENU *b = &context_menu; if (!b->open) { return; } setfont(FONT_TEXT); int x, w, active_h; calculate_pos_and_width(b, &x, &w); draw_rect_fill(x, b->y, w, b->height, COLOR_BKGRND_MAIN); active_h = b->y + b->over * CONTEXT_HEIGHT; draw_rect_fill(x, active_h, w, CONTEXT_HEIGHT, COLOR_ACTIVEOPTION_BKGRND); int i; for (i = 0; i != b->count; i++) { // Ensure that font is set before calculating position and width. STRING *name = b->ondisplay(i, b); setcolor((active_h == b->y + i * CONTEXT_HEIGHT) ? COLOR_ACTIVEOPTION_TEXT : COLOR_MAIN_TEXT); drawtext(x + SCALE(4), b->y + SCALE(4) + i * CONTEXT_HEIGHT, name->str, name->length); } draw_rect_frame(x, b->y, w, b->height, COLOR_EDGE_ACTIVE); } bool contextmenu_mmove(int mx, int my, int UNUSED(dx), int UNUSED(dy)) { CONTEXTMENU *b = &context_menu; if (!b->open) { return 0; } cursor = CURSOR_NONE; // Ensure that font is set before calculating position and width. setfont(FONT_TEXT); setcolor(COLOR_BKGRND_MAIN); int x, w; calculate_pos_and_width(b, &x, &w); bool mouseover = inrect(mx, my, x, b->y, w, b->height); if (!mouseover) { if (b->over != 0xFF) { b->over = 0xFF; return 1; } return 0; } uint8_t over = (my - b->y) / CONTEXT_HEIGHT; if (over >= b->count) { over = 0xFF; } if (over != b->over) { b->over = over; return 1; } return 0; } bool contextmenu_mdown(void) { CONTEXTMENU *b = &context_menu; if (!b->open) { return 0; } if (b->over != 0xFF) { b->down = b->over; } else { b->open = 0; } return 1; } bool contextmenu_mup(void) { CONTEXTMENU *b = &context_menu; if (!b->open) { return 0; } if (b->over == b->down) { b->onselect(b->over); b->open = 0; return 1; } return 0; } bool contextmenu_mleave(void) { CONTEXTMENU *b = &context_menu; if (!b->open) { return 0; } if (b->over != 0xFF) { b->over = 0xFF; return 1; } return 0; } void contextmenu_new_ex(uint8_t count, void *userdata, void (*onselect)(uint8_t), STRING *(*ondisplay)(uint8_t, const CONTEXTMENU *)) { CONTEXTMENU *b = &context_menu; b->y = mouse.y; b->height = CONTEXT_HEIGHT * count; if (b->y + b->height >= (int)settings.window_height) { b->y -= b->height; } b->x = mouse.x; b->width = CONTEXT_WIDTH; b->open = true; b->count = count; b->over = 0xFF; b->onselect = onselect; b->ondisplay = ondisplay; b->userdata = userdata; } static STRING *contextmenu_localized_ondisplay(uint8_t i, const CONTEXTMENU *cm) { return SPTRFORLANG(settings.language, ((UTOX_I18N_STR *)cm->userdata)[i]); } void contextmenu_new(uint8_t count, UTOX_I18N_STR *menu_string_ids, void (*onselect)(uint8_t)) { contextmenu_new_ex(count, menu_string_ids, onselect, contextmenu_localized_ondisplay); } uTox/src/ui/button.h0000600000175000001440000000312414003056216013366 0ustar rakusers#ifndef UI_BUTTON_H #define UI_BUTTON_H #include "panel.h" #include "../ui.h" #include #include typedef struct button BUTTON; struct button { PANEL panel; /* Button bitmap id, * fill is top-left aligned * icon is centered. */ int bm_fill, bm_icon; // Width & height of bm_icon. Used for centering. int icon_w, icon_h; // Background RGB color for bm picture, when Idle/Hovered/Pressed respectively. uint32_t c1, // Button normal background color c2, // Button hover background color c3, // Button active (press) background color ct1, // Button contents (text or icon) color ct2, // Button contents (text or icon) hover color cd; MAYBE_I18NAL_STRING button_text; MAYBE_I18NAL_STRING tooltip_text; bool mouseover, mousedown, disabled, nodraw; void (*onright)(void); // called when right mouse button goes down void (*on_mdn)(void); void (*on_mup)(void); void (*update)(BUTTON *b); }; void button_draw(BUTTON *b, int x, int y, int width, int height); bool button_mmove(BUTTON *b, int x, int y, int width, int height, int mx, int my, int dx, int dy); bool button_mdown(BUTTON *b); bool button_mup(BUTTON *b); bool button_mright(BUTTON *b); bool button_mwheel(BUTTON *b, int height, double d, bool smooth); bool button_mleave(BUTTON *b); // TODO these may move void button_setcolors_success(BUTTON *b); void button_setcolors_danger(BUTTON *b); void button_setcolors_warning(BUTTON *b); void button_setcolors_disabled(BUTTON *b); #endif // UI_BUTTON_H uTox/src/ui/button.c0000600000175000001440000001204614003056216013364 0ustar rakusers#include "button.h" #include "draw.h" #include "tooltip.h" #include "../macros.h" #include "../theme.h" #include "../ui.h" static void calculate_pos_and_width(BUTTON *b, int *x, int *w) { int real_w = *w; // Increase width if needed, so that button text fits. if (maybe_i18nal_string_is_valid(&b->button_text)) { STRING *str = maybe_i18nal_string_get(&b->button_text); int min_w = textwidth(str->str, str->length); if (*w < min_w) { *w = min_w + SCALE(12); // 12 seems like a perfectly fine number, // eventually we should use logic here. } } // Push away from the right border to fit, // if our panel is right-adjusted. if (b->panel.x < 0) { *x -= *w - real_w; } } void button_draw(BUTTON *b, int x, int y, int width, int height) { // If `update` function is defined, call it on each draw if (b->update) { b->update(b); } // Button is hidden if (b->nodraw) { return; } // Ensure that font is set before calculating position and width. setfont(FONT_SELF_NAME); // Button contents color uint32_t color_text = b->mousedown ? b->ct2 : (b->mouseover ? b->ct2 : b->ct1); setcolor(color_text); int real_w = width; calculate_pos_and_width(b, &x, &width); // Button background color uint32_t color_bg = b->mousedown ? b->c3 : (b->mouseover ? b->c2 : b->c1); if (b->bm_fill) { drawalpha(b->bm_fill, x, y, real_w, height, color_bg); } else { draw_rect_fill(x, y, real_w, height, b->disabled ? b->cd : color_bg); } if (b->bm_icon) { const int icon_x = real_w / 2 - SCALE(b->icon_w) / 2; const int icon_y = height / 2 - SCALE(b->icon_h) / 2; drawalpha(b->bm_icon, x + icon_x, y + icon_y, SCALE(b->icon_w), SCALE(b->icon_h), color_text); } if (maybe_i18nal_string_is_valid(&b->button_text)) { if (b->bm_fill) { while (width > real_w) { // The text didn't fit into the original width. // Fill the rest of the new width with the image // and hope for the best. drawalpha(b->bm_fill, x + width - real_w, y, real_w, height, color_bg); width -= real_w / 2 + 1; } } STRING *s = maybe_i18nal_string_get(&b->button_text); drawtext(x + SCALE(6), y + SCALE(2), s->str, s->length); } } bool button_mmove(BUTTON *b, int UNUSED(x), int UNUSED(y), int width, int height, int mx, int my, int UNUSED(dx), int UNUSED(dy)) { // Ensure that font is set before calculating position and width. setfont(FONT_SELF_NAME); int real_x = 0, real_w = width; calculate_pos_and_width(b, &real_x, &real_w); bool mouseover = inrect(mx, my, real_x, 0, real_w, height); if (mouseover) { if (!b->disabled) { cursor = CURSOR_HAND; } if (maybe_i18nal_string_is_valid(&b->tooltip_text)) { tooltip_new(&b->tooltip_text); } } if (mouseover != b->mouseover) { b->mouseover = mouseover; return 1; } return 0; } bool button_mdown(BUTTON *b) { if (b->mouseover) { if (!b->mousedown && b->on_mdn) { b->on_mdn(); } b->mousedown = true; return 1; } return 0; } bool button_mup(BUTTON *b) { if (b->mousedown) { if (b->mouseover && b->on_mup) { b->on_mup(); } b->mousedown = 0; return 1; } return 0; } bool button_mright(BUTTON *b) { if (b->mouseover && b->onright) { b->onright(); return 1; } return 0; } bool button_mwheel(BUTTON *UNUSED(b), int UNUSED(height), double UNUSED(d), bool UNUSED(smooth)) { return 0; } bool button_mleave(BUTTON *b) { if (b->mouseover) { b->mouseover = 0; return 1; } return 0; } // Logic update functions // TODO should these live here? // TODO delete button_setcolor_* and move this setting and logic to the struct /* Quick color change functions */ void button_setcolors_success(BUTTON *b) { b->c1 = COLOR_BTN_SUCCESS_BKGRND; b->c2 = COLOR_BTN_SUCCESS_BKGRND_HOVER; b->c3 = COLOR_BTN_SUCCESS_BKGRND_HOVER; b->ct1 = COLOR_BTN_SUCCESS_TEXT; b->ct2 = COLOR_BTN_SUCCESS_TEXT_HOVER; } void button_setcolors_danger(BUTTON *b) { b->c1 = COLOR_BTN_DANGER_BACKGROUND; b->c2 = COLOR_BTN_DANGER_BKGRND_HOVER; b->c3 = COLOR_BTN_DANGER_BKGRND_HOVER; b->ct1 = COLOR_BTN_DANGER_TEXT; b->ct2 = COLOR_BTN_DANGER_TEXT_HOVER; } void button_setcolors_warning(BUTTON *b) { b->c1 = COLOR_BTN_WARNING_BKGRND; b->c2 = COLOR_BTN_WARNING_BKGRND_HOVER; b->c3 = COLOR_BTN_WARNING_BKGRND_HOVER; b->ct1 = COLOR_BTN_WARNING_TEXT; b->ct2 = COLOR_BTN_WARNING_TEXT_HOVER; } void button_setcolors_disabled(BUTTON *b) { b->c1 = COLOR_BTN_DISABLED_BKGRND; b->c2 = COLOR_BTN_DISABLED_BKGRND; b->c3 = COLOR_BTN_DISABLED_BKGRND; b->ct1 = COLOR_BTN_DISABLED_TEXT; b->ct2 = COLOR_BTN_DISABLED_TEXT; } uTox/src/ui/CMakeLists.txt0000600000175000001440000000035414003056216014444 0ustar rakusersproject(utoxUI LANGUAGES C) add_library(utoxUI STATIC button.c contextmenu.c draw.c dropdown.c edit.c scrollable.c svg.c switch.c text.c tooltip.c ) target_link_libraries(utoxUI utoxLAYOUT) uTox/src/ui.h0000600000175000001440000001454314003056216012062 0ustar rakusers#ifndef UI_H #define UI_H #include "sized_string.h" #include "../langs/i18n_decls.h" #include "settings.h" #include #include typedef struct native_image NATIVE_IMAGE; typedef struct panel PANEL; typedef struct scrollable SCROLLABLE; #define S(x) (ui_gettext(settings.language, (STR_##x))->str) #define SLEN(x) (ui_gettext(settings.language, (STR_##x))->length) #define SPTR(x) (ui_gettext(settings.language, (STR_##x))) /* if UTOX_STR_WIDTH, is giving you a bad size you've probably changed setfont() from the string you're trying to get * the size of. Either store the size before changing, or swap it -> run UTOX_STR_WIDTH() -> swap back. */ #define UTOX_STR_WIDTH(x) (textwidth((ui_gettext(settings.language, (STR_##x))->str), \ (ui_gettext(settings.language, (STR_##x))->length))) #define SPTRFORLANG(l, x) (ui_gettext((l), (x))) // TODO: Create ui_native headers or something. // This is hard to read. I know. I'm sorry. // This is to stop a circular dependency between svg.c and xlib/main.h. #if defined __WIN32__ || defined _WIN32 || defined __CYGWIN__ // Windows supplies its own RGB function. #include // TODO, don't do this #elif defined __ANDROID__ #define RGB(r, g, b) ((r) | ((g) << 8) | ((b) << 16)) #elif defined __OBJC__ // xlib and cocoa use the same format for this, but I left both cases here // in case I want to use this #ifdef construct elsewhere. #define RGB(r, g, b) (((r) << 16) | ((g) << 8) | (b)) #else #define RGB(r, g, b) (((r) << 16) | ((g) << 8) | (b)) #endif // Mouse stuff enum { CURSOR_NONE, CURSOR_TEXT, CURSOR_HAND, CURSOR_SELECT, CURSOR_ZOOM_IN, CURSOR_ZOOM_OUT, }; extern struct utox_mouse { int x, y; } mouse; extern uint8_t cursor; extern bool mdown; enum { FONT_TEXT, FONT_TITLE, FONT_SELF_NAME, FONT_STATUS, FONT_LIST_NAME, FONT_MISC, FONT_END, }; typedef enum { MAIN_STYLE, // white style, used in right side AUXILIARY_STYLE, // gray style, used on friends side } UI_ELEMENT_STYLE; typedef struct maybe_i18nal_string { STRING plain; UTOX_I18N_STR i18nal; } MAYBE_I18NAL_STRING; void maybe_i18nal_string_set_plain(MAYBE_I18NAL_STRING *, char *str, uint16_t length); void maybe_i18nal_string_set_i18nal(MAYBE_I18NAL_STRING *, UTOX_I18N_STR); STRING *maybe_i18nal_string_get(MAYBE_I18NAL_STRING *); bool maybe_i18nal_string_is_valid(MAYBE_I18NAL_STRING *); /* draws an image in the style of an avatar at within rect (x,y,targetwidth,targetheight) * this means: resize the image while keeping proportion so that the dimension(width or height) that has the smallest * rational difference to the targetdimension becomes exactly targetdimension, then * crop the image so it fits in the (x,y,targetwidth,targetheight) rect, and * set the position if a dimension is too large so it's centered on the middle * * first argument is the image to draw, width and height are the width and height of the input image */ void draw_avatar_image(NATIVE_IMAGE *image, int x, int y, uint32_t width, uint32_t height, uint32_t targetwidth, uint32_t targetheight); void ui_set_scale(uint8_t scale); void ui_rescale(uint8_t scale); void ui_size(int width, int height); void ui_mouseleave(void); void panel_draw(PANEL *p, int x, int y, int width, int height); bool panel_mmove(PANEL *p, int x, int y, int width, int height, int mx, int my, int dx, int dy); void panel_mdown(PANEL *p); bool panel_dclick(PANEL *p, bool triclick); bool panel_mright(PANEL *p); bool panel_mwheel(PANEL *p, int x, int y, int width, int height, double d, bool smooth); bool panel_mup(PANEL *p); bool panel_mleave(PANEL *p); extern char search_data[1024]; // TODO this is NOT where this belongs extern double ui_scale; #define SCALE(x) ((int)(((double)x) * (ui_scale / 10.0))) #define SCALE_DIV(x) (((int)(((double)x) * (ui_scale / 10.0))) ?: 1) #define UI_FSCALE(x) (((double)x) * (ui_scale / 10.0)) #define UI_FSCALE_DIV(x) ((((double)x) * (ui_scale / 10.0)) ?: 1) #define UN_SCALE(x) (((int)(((double)x) / (ui_scale / 10.0)))) #define drawstr(x, y, i) drawtext(x, y, S(i), SLEN(i)) #define drawstr_getwidth(x, y, str) drawtext_getwidth(x, y, (char *)str, sizeof(str) - 1) #define strwidth(x) textwidth((char *)x, sizeof(x) - 1) /* colors */ #define GRAY(x) (((x) << 16) | ((x) << 8) | (x)) #define BLACK 0 #define C_RED RGB(200, 78, 78) #define C_SCROLL GRAY(209) /* These are the new defines to help align UI elements, the new ones must use a _top/_bottom/ or _left/_right or * _width/_height postfix, and should be used to replace the originals whenever possible. * If you're able to replace an original, replace all occurrences, and delete the define. */ /* User badge */ #define SIDEBAR_PADDING 6 #define SIDEBAR_AVATAR_TOP 5 #define SIDEBAR_AVATAR_LEFT 5 #define SIDEBAR_AVATAR_WIDTH 10 #define SIDEBAR_AVATAR_HEIGHT 10 #define SIDEBAR_NAME_TOP 10 #define SIDEBAR_NAME_LEFT 50 #define SIDEBAR_NAME_WIDTH 145 #define SIDEBAR_NAME_HEIGHT 18 #define SIDEBAR_STATUSMSG_TOP 28 #define SIDEBAR_STATUSMSG_LEFT 50 #define SIDEBAR_STATUSMSG_WIDTH 145 #define SIDEBAR_STATUSMSG_HEIGHT 18 /* Sidebar buttons and settings */ #define SIDEBAR_FILTER_FRIENDS_TOP 50 #define SIDEBAR_FILTER_FRIENDS_LEFT 5 #define SIDEBAR_FILTER_FRIENDS_WIDTH 168 #define SIDEBAR_FILTER_FRIENDS_HEIGHT 16 /* Roster defines */ #define ROSTER_LEFT 16 #define ROSTER_BOTTOM -30 #define ROSTER_BOX_HEIGHT 50 #define ROSTER_AVATAR_TOP 5 #define ROSTER_AVATAR_LEFT 10 #define ROSTER_NAME_TOP 12 /* Sidebar Lower search box and setting button */ #define SIDEBAR_SEARCH_TOP -30 #define SIDEBAR_SEARCH_LEFT 0 #define SIDEBAR_SEARCH_WIDTH 199 #define SIDEBAR_SEARCH_HEIGHT 30 #define SIDEBAR_BUTTON_TOP -30 #define SIDEBAR_BUTTON_LEFT 200 #define SIDEBAR_BUTTON_WIDTH 30 #define SIDEBAR_BUTTON_HEIGHT 30 /* Main box/Chat box size settings */ #define CHAT_BOX_TOP -52 /* size of the bottom message box */ #define MAIN_TOP_FRAME_THIN 30 #define MAIN_TOP_FRAME_THICK 60 /* Global UI size settings... */ #define SCROLL_WIDTH 8 // must be divisible by 2 #define FILE_TRANSFER_BOX_HEIGHT 28 /* Main panel defines */ #define MAIN_TOP 60 /* Legacy defines, instead of using these, you should replace them with something more descriptive */ #define LIST_Y2 86 #define LIST_BUTTON_Y -26 #define MESSAGES_SPACING 4 #define MESSAGES_X 94 #define TIME_WIDTH 45 #define TIME_WIDTH_LONG 60 #define NAME_OFFSET 14 #endif uTox/src/ui.c0000600000175000001440000004211514003056216012051 0ustar rakusers#include "ui.h" #include "flist.h" #include "inline_video.h" #include "macros.h" #include "messages.h" #include "settings.h" #include "layout/background.h" #include "layout/create.h" #include "layout/friend.h" #include "layout/group.h" #include "layout/notify.h" #include "layout/settings.h" #include "layout/sidebar.h" #include "native/image.h" #include "native/ui.h" #include "ui/button.h" #include "ui/contextmenu.h" #include "ui/draw.h" #include "ui/dropdown.h" #include "ui/edit.h" #include "ui/panel.h" #include "ui/scrollable.h" #include "ui/switch.h" #include "ui/text.h" #include "ui/tooltip.h" struct utox_mouse mouse; uint8_t cursor; bool mdown; char search_data[1024]; // TODO this is NOT where this belongs double ui_scale; /* These remain for legacy reasons, PANEL_MAIN calls these by default when not given it's own function to call */ static void background_draw(PANEL *UNUSED(p), int UNUSED(x), int UNUSED(y), int UNUSED(width), int UNUSED(height)) { return; } static bool background_mmove(PANEL *UNUSED(p), int UNUSED(x), int UNUSED(y), int UNUSED(width), int UNUSED(height), int UNUSED(mx), int UNUSED(my), int UNUSED(dx), int UNUSED(dy)) { return false; } static bool background_mdown(PANEL *UNUSED(p)) { return false; } static bool background_mright(PANEL *UNUSED(p)) { return false; } static bool background_mwheel(PANEL *UNUSED(p), int UNUSED(height), double UNUSED(d), bool UNUSED(smooth)) { return false; } static bool background_mup(PANEL *UNUSED(p)) { return false; } static bool background_mleave(PANEL *UNUSED(p)) { return false; } /***** MAYBE_I18NAL_STRING helpers start *****/ void maybe_i18nal_string_set_plain(MAYBE_I18NAL_STRING *mis, char *str, uint16_t length) { mis->i18nal = UI_STRING_ID_INVALID; mis->plain.length = length; mis->plain.str = str; } void maybe_i18nal_string_set_i18nal(MAYBE_I18NAL_STRING *mis, UTOX_I18N_STR string_id) { mis->plain.str = NULL; mis->plain.length = 0; mis->i18nal = string_id; } STRING *maybe_i18nal_string_get(MAYBE_I18NAL_STRING *mis) { if (mis->plain.str) { return &mis->plain; } return SPTRFORLANG(settings.language, mis->i18nal); } bool maybe_i18nal_string_is_valid(MAYBE_I18NAL_STRING *mis) { return (mis->plain.str || ((UI_STRING_ID_INVALID != mis->i18nal) && (mis->i18nal < NUM_STRS))); } /*********************************************************************** * * * Panel layout size set functions. * * * **********************************************************************/ static void sidepanel_USERBADGE(void) { // Converting DEFINES to magic because this will be moved to layout/ // and will then get a different format/selection } static void sidepanel_FLIST(void) { scrollbar_flist.panel.y = 0; // scrollbar_flist.panel.width = 230; // TODO remove? scrollbar_flist.panel.height = -1; panel_flist.x = 0; panel_flist.y = 70; panel_flist.width = 230; // TODO remove? panel_flist.height = ROSTER_BOTTOM; button_add_new_contact.panel.disabled = true; } static void settings_PROFILE(void) { panel_settings_profile.y = 32; } static void settings_UI(void) { panel_settings_ui.y = 32; } static void settings_AV(void) { panel_settings_av.y = 32; #ifndef AUDIO_FILTERING const uint16_t start_draw_y = 30; const uint16_t preview_button_pos_y = 245; #else const uint16_t start_draw_y = 60; const uint16_t preview_button_pos_y = 275; CREATE_SWITCH(audio_filtering, 10, 40, _BM_SWITCH_WIDTH, _BM_SWITCH_HEIGHT); #endif const uint16_t draw_y_vect = 30; CREATE_DROPDOWN(audio_in, 10, (start_draw_y + draw_y_vect + 5), 24, 360); CREATE_DROPDOWN(audio_out, 10, (start_draw_y + draw_y_vect + 57), 24, 360); CREATE_EDIT(video_fps, 10, (start_draw_y + draw_y_vect + 110), 360, 24); CREATE_DROPDOWN(video, 10, (start_draw_y + draw_y_vect + 162), 24, 360); CREATE_BUTTON(callpreview, 10, (preview_button_pos_y + 35), _BM_LBUTTON_WIDTH, _BM_LBUTTON_HEIGHT); CREATE_BUTTON(videopreview, 70, (preview_button_pos_y + 35), _BM_LBUTTON_WIDTH, _BM_LBUTTON_HEIGHT); } static void settings_NOTIFY(void) { panel_settings_notifications.y = 32; } static void settings_ADV(void) { panel_settings_adv.y = 32; const int show_nospam_x = 30 + UN_SCALE(MAX(UTOX_STR_WIDTH(SHOW_UI_PASSWORD), UTOX_STR_WIDTH(HIDE_UI_PASSWORD))); CREATE_BUTTON(show_nospam, show_nospam_x, 177, _BM_SBUTTON_WIDTH, _BM_SBUTTON_HEIGHT); const int revert_nospam_x = 30 + UN_SCALE(UTOX_STR_WIDTH(RANDOMIZE_NOSPAM)); CREATE_BUTTON(revert_nospam, revert_nospam_x, 265, _BM_SBUTTON_WIDTH, _BM_SBUTTON_HEIGHT); } void ui_set_scale(uint8_t scale) { if (scale >= 5 && scale <= 25) { ui_scale = scale; } else if (scale != 0) { return ui_set_scale(10); } } void ui_rescale(uint8_t scale) { ui_set_scale(scale); flist_re_scale(); setscale_fonts(); setfont(FONT_SELF_NAME); /* DEFAULT positions */ panel_main.y = 0; scrollbar_settings.panel.y = 32; /* TODO magic numbers are bad */ scrollbar_settings.content_height = 300; /* TODO magic numbers are bad */ panel_settings_master.y = 0; panel_settings_devices.y = 32; panel_settings_adv.y = 32; scrollbar_friend.panel.y = MAIN_TOP; scrollbar_friend.panel.height = CHAT_BOX_TOP; messages_friend.y = MAIN_TOP; messages_friend.height = CHAT_BOX_TOP - 10; messages_friend.width = -SCROLL_WIDTH; scrollbar_group.panel.y = MAIN_TOP; scrollbar_group.panel.height = CHAT_BOX_TOP; messages_group.y = MAIN_TOP; messages_group.height = CHAT_BOX_TOP; messages_group.width = -SCROLL_WIDTH; setfont(FONT_SELF_NAME); sidepanel_USERBADGE(); sidepanel_FLIST(); settings_PROFILE(); settings_UI(); settings_AV(); settings_NOTIFY(); settings_ADV(); // FIXME for testing, remove CREATE_BUTTON(notify_create, 2, 2, BM_SBUTTON_WIDTH, BM_SBUTTON_HEIGHT); CREATE_BUTTON(notify_one, 0, -50, 40, 50); CREATE_BUTTON(notify_two, 200, -50, 40, 50); CREATE_BUTTON(notify_three, -40, -50, 40, 50); CREATE_BUTTON(move_notify, -40, -40, 40, 40); /* Setting pages */ uint32_t settings_x = 4; CREATE_BUTTON(settings_sub_profile, settings_x, 0, 12, 28); settings_x += 20 + UN_SCALE(UTOX_STR_WIDTH(PROFILE_BUTTON)); #ifdef ENABLE_MULTIDEVICE CREATE_BUTTON(settings_sub_devices, settings_x, 0, 12, 28); settings_x += 20 + UN_SCALE(UTOX_STR_WIDTH(DEVICES_BUTTON)); #endif CREATE_BUTTON(settings_sub_ui, settings_x, 0, 12, 28); settings_x += 20 + UN_SCALE(UTOX_STR_WIDTH(USER_INTERFACE_BUTTON)); CREATE_BUTTON(settings_sub_av, settings_x, 0, 12, 28); settings_x += 20 + UN_SCALE(UTOX_STR_WIDTH(AUDIO_VIDEO_BUTTON)); CREATE_BUTTON(settings_sub_notifications, settings_x, 0, 12, 28); settings_x += 20 + UN_SCALE(UTOX_STR_WIDTH(NOTIFICATIONS_BUTTON)); CREATE_BUTTON(settings_sub_adv, settings_x, 0, 12, 28); /* Devices */ CREATE_BUTTON(add_new_device_to_self, -10 - BM_SBUTTON_WIDTH, 28, BM_SBUTTON_WIDTH, BM_SBUTTON_HEIGHT); CREATE_EDIT(add_new_device_to_self, 10, 27, 0 - UTOX_STR_WIDTH(ADD) - BM_SBUTTON_WIDTH, 24); setfont(FONT_TEXT); CREATE_EDIT(chat_msg_group, 6, -46, -10 - BM_CHAT_SEND_WIDTH, 40); setscale(); } /* Use the preprocessor to build function prototypes for all user interactions * These are functions that are (must be) defined elsewhere. The preprocessor in this case creates the prototypes that * will then be used by panel_draw_core to call the correct function */ #define MAKE_FUNC(ret, x, ...) \ static ret (*x##func[])(void *p, ##__VA_ARGS__) = { \ (void *)background_##x, (void *)messages_##x, (void *)inline_video_##x, (void *)flist_##x, (void *)button_##x, \ (void *)switch_##x, (void *)dropdown_##x, (void *)edit_##x, (void *)scroll_##x, \ }; MAKE_FUNC(void, draw, int x, int y, int width, int height); MAKE_FUNC(bool, mmove, int x, int y, int width, int height, int mx, int my, int dx, int dy); MAKE_FUNC(bool, mdown); MAKE_FUNC(bool, mright); MAKE_FUNC(bool, mwheel, int height, double d); MAKE_FUNC(bool, mup); MAKE_FUNC(bool, mleave); #undef MAKE_FUNC /* Use the preprocessor to add code to adjust the x,y cords for panels or sub panels. * If neg value place x/y from the right/bottom of panel. * * change the relative * * if w/h <0 use parent panel width (maybe?) */ #define FIX_XY_CORDS_FOR_SUBPANELS() \ { \ int relx = (p->x < 0) ? width + SCALE(p->x) : SCALE(p->x); \ int rely = (p->y < 0) ? height + SCALE(p->y) : SCALE(p->y); \ x += relx; \ y += rely; \ width = (p->width <= 0) ? width + SCALE(p->width) - relx : SCALE(p->width); \ height = (p->height <= 0) ? height + SCALE(p->height) - rely : SCALE(p->height); \ } static void panel_update(PANEL *p, int x, int y, int width, int height) { FIX_XY_CORDS_FOR_SUBPANELS(); switch (p->type) { case PANEL_NONE: { if (p == &panel_settings_devices) { #ifdef ENABLE_MULTIDEVICE devices_update_ui(); #endif } break; } case PANEL_MESSAGES: { if (p->object) { MESSAGES *m = p->object; m->width = width; messages_updateheight(m, width); } break; } default: { break; } } PANEL **pp = p->child; if (pp) { if (p->update) { p->update(width, height, ui_scale); } PANEL *subp; while ((subp = *pp++)) { panel_update(subp, x, y, width, height); } } } void draw_avatar_image(NATIVE_IMAGE *image, int x, int y, uint32_t width, uint32_t height, uint32_t targetwidth, uint32_t targetheight) { /* get smallest of width or height */ const double scale = (width > height) ? (double)targetheight / height : (double)targetwidth / width; image_set_scale(image, scale); image_set_filter(image, FILTER_BILINEAR); /* set position to show the middle of the image in the center */ const int xpos = (int)((double)width * scale / 2 - (double)targetwidth / 2); const int ypos = (int)((double)height * scale / 2 - (double)targetheight / 2); draw_image(image, x, y, targetwidth, targetheight, xpos, ypos); image_set_scale(image, 1.0); image_set_filter(image, FILTER_NEAREST); } void ui_size(int width, int height) { panel_update(&panel_root, 0, 0, width, height); tooltip_reset(); panel_side_bar.disabled = false; panel_main.x = panel_flist.width; if (settings.magic_flist_enabled) { if (width <= panel_flist.width * 2 || height > width) { panel_side_bar.disabled = true; panel_main.x = 0; } } } void ui_mouseleave(void) { panel_mleave(&panel_root); tooltip_reset(); redraw(); } static void panel_draw_core(PANEL *p, int x, int y, int width, int height) { FIX_XY_CORDS_FOR_SUBPANELS(); if (p->content_scroll) { pushclip(x, y, width, height); y -= scroll_gety(p->content_scroll, height); } if (p->type) { drawfunc[p->type - 1](p, x, y, width, height); } else { if (p->drawfunc) { p->drawfunc(x, y, width, height); } } PANEL **pp = p->child; if (pp) { PANEL *subp; while ((subp = *pp++)) { if (!subp->disabled) { panel_draw_core(subp, x, y, width, height); } } } if (p->content_scroll) { popclip(); } } void panel_draw(PANEL *p, int x, int y, int width, int height) { FIX_XY_CORDS_FOR_SUBPANELS(); panel_draw_core(p, x, y, width, height); // popclip(); dropdown_drawactive(); contextmenu_draw(); tooltip_draw(); enddraw(x, y, width, height); } bool panel_mmove(PANEL *p, int x, int y, int width, int height, int mx, int my, int dx, int dy) { if (p == &panel_root) { mouse.x = mx; mouse.y = my; } mx -= (p->x < 0) ? width + SCALE(p->x) : SCALE(p->x); my -= (p->y < 0) ? height + SCALE(p->y) : SCALE(p->y); FIX_XY_CORDS_FOR_SUBPANELS(); int mmy = my; if (p->content_scroll) { const int scroll_y = scroll_gety(p->content_scroll, height); if (my < 0) { mmy = -1; } else if (my >= height) { mmy = 1024 * 1024 * 1024; // large value } else { mmy = my + scroll_y; } y -= scroll_y; my += scroll_y; } bool draw = p->type ? mmovefunc[p->type - 1](p, x, y, width, height, mx, mmy, dx, dy) : false; // Has to be called before children mmove if (p == &panel_root) { draw |= tooltip_mmove(); } PANEL **pp = p->child; if (pp) { PANEL *subp; while ((subp = *pp++)) { if (!subp->disabled) { draw |= panel_mmove(subp, x, y, width, height, mx, my, dx, dy); } } } if (p == &panel_root) { draw |= contextmenu_mmove(mx, my, dx, dy); if (draw) { redraw(); } } return draw; } static bool panel_mdown_sub(PANEL *p) { if (p->type && mdownfunc[p->type - 1](p)) { return true; } PANEL **pp = p->child; if (pp) { PANEL *subp; while ((subp = *pp++)) { if (!subp->disabled) { if (panel_mdown_sub(subp)) { return true; } } } } return false; } void panel_mdown(PANEL *p) { if (contextmenu_mdown() || tooltip_mdown()) { redraw(); return; } bool draw = edit_active(); PANEL **pp = p->child; if (pp) { PANEL *subp; while ((subp = *pp++)) { if (!subp->disabled) { draw |= panel_mdown_sub(subp); } } } if (draw) { redraw(); } } bool panel_dclick(PANEL *p, bool triclick) { bool draw = false; if (p->type == PANEL_EDIT) { draw = edit_dclick((EDIT *)p, triclick); } else if (p->type == PANEL_MESSAGES) { draw = messages_dclick(p, triclick); } PANEL **pp = p->child; if (pp) { PANEL *subp; while ((subp = *pp++)) { if (!subp->disabled) { draw = panel_dclick(subp, triclick); if (draw) { break; } } } } if (draw && p == &panel_root) { redraw(); } return draw; } bool panel_mright(PANEL *p) { bool draw = p->type ? mrightfunc[p->type - 1](p) : false; PANEL **pp = p->child; if (pp) { PANEL *subp; while ((subp = *pp++)) { if (!subp->disabled) { draw |= panel_mright(subp); } } } if (draw && p == &panel_root) { redraw(); } return draw; } bool panel_mwheel(PANEL *p, int x, int y, int width, int height, double d, bool smooth) { FIX_XY_CORDS_FOR_SUBPANELS(); bool draw = p->type ? mwheelfunc[p->type - 1](p, height, d) : false; PANEL **pp = p->child; if (pp) { PANEL *subp; while ((subp = *pp++)) { if (!subp->disabled) { draw |= panel_mwheel(subp, x, y, width, height, d, smooth); } } } if (draw && p == &panel_root) { redraw(); } return draw; } bool panel_mup(PANEL *p) { if (p == &panel_root && contextmenu_mup()) { tooltip_mup(); redraw(); return true; } bool draw = p->type ? mupfunc[p->type - 1](p) : false; PANEL **pp = p->child; if (pp) { PANEL *subp; while ((subp = *pp++)) { if (!subp->disabled) { draw |= panel_mup(subp); } } } if (p == &panel_root) { tooltip_mup(); if (draw) { redraw(); } } return draw; } bool panel_mleave(PANEL *p) { bool draw = p->type ? mleavefunc[p->type - 1](p) : false; PANEL **pp = p->child; if (pp) { PANEL *subp; while ((subp = *pp++)) { if (!subp->disabled) { draw |= panel_mleave(subp); } } } if (p == &panel_root) { draw |= contextmenu_mleave(); if (draw) { redraw(); } } return draw; } uTox/src/tox_callbacks.h0000600000175000001440000000031714003056216014250 0ustar rakusers#ifndef TOX_CALLBACKS_H #define TOX_CALLBACKS_H #include void utox_set_callbacks_friends(Tox *tox); void utox_set_callbacks_groups(Tox *tox); void utox_set_callbacks_mdevice(Tox *tox); #endif uTox/src/tox_callbacks.c0000600000175000001440000003635014003056216014251 0ustar rakusers#include "tox_callbacks.h" #include "avatar.h" #include "file_transfers.h" #include "friend.h" #include "groups.h" #include "debug.h" #include "macros.h" #include "settings.h" #include "text.h" #include "utox.h" #include "ui.h" #include "av/audio.h" #include "av/utox_av.h" #include #include #include static void callback_friend_request(Tox *UNUSED(tox), const uint8_t *id, const uint8_t *msg, size_t length, void *UNUSED(userdata)) { if (settings.block_friend_requests) { LOG_WARN("Tox Callbacks", "Friend request ignored."); // TODO move to friend.c return; } length = utf8_validate(msg, length); uint16_t r_number = friend_request_new(id, msg, length); postmessage_utox(FRIEND_INCOMING_REQUEST, r_number, 0, NULL); postmessage_audio(UTOXAUDIO_PLAY_NOTIFICATION, NOTIFY_TONE_FRIEND_REQUEST, 0, NULL); } static void callback_friend_message(Tox *UNUSED(tox), uint32_t friend_number, TOX_MESSAGE_TYPE type, const uint8_t *message, size_t length, void *UNUSED(userdata)) { /* send message to UI */ FRIEND *f = get_friend(friend_number); if (!f) { LOG_ERR("Tox Callbacks", "Could not get friend with number: %u", friend_number); return; } switch (type) { case TOX_MESSAGE_TYPE_NORMAL: { message_add_type_text(&f->msg, 0, (char *)message, length, 1, 0); LOG_INFO("Tox Callbacks", "Friend\t%u\t--\tStandard Message: %.*s" , friend_number, (int)length, message); break; } case TOX_MESSAGE_TYPE_ACTION: { message_add_type_action(&f->msg, 0, (char *)message, length, 1, 0); LOG_INFO("Tox Callbacks", "Friend\t%u\t--\tAction Message: %.*s" , friend_number, (int)length, message); break; } default: { LOG_ERR("Tox Callbacks", "Friend\t%u\t--\tUnsupported message type: %.*s" , friend_number, (int)length, message); break; } } friend_notify_msg(f, (char *)message, length); } static void callback_name_change(Tox *UNUSED(tox), uint32_t fid, const uint8_t *newname, size_t length, void *UNUSED(userdata)) { length = utf8_validate(newname, length); void *data = malloc(length); if (!data) { LOG_FATAL_ERR(EXIT_MALLOC, "Tox Callbacks", "Could not alloc for name change callback (%uB)", length); } memcpy(data, newname, length); postmessage_utox(FRIEND_NAME, fid, length, data); LOG_INFO("Tox Callbacks", "Friend\t%u\t--\tName:\t%.*s", fid, (int)length, newname); } static void callback_status_message(Tox *UNUSED(tox), uint32_t fid, const uint8_t *newstatus, size_t length, void *UNUSED(userdata)) { length = utf8_validate(newstatus, length); void *data = malloc(length); if (!data) { LOG_FATAL_ERR(EXIT_MALLOC, "Tox Callbacks", "Could not alloc for name change callback (%uB)", length); } memcpy(data, newstatus, length); postmessage_utox(FRIEND_STATUS_MESSAGE, fid, length, data); LOG_INFO("Tox Callbacks", "Friend\t%u\t--\tStatus Message:\t%.*s", fid, (int)length, newstatus); } static void callback_user_status(Tox *UNUSED(tox), uint32_t fid, TOX_USER_STATUS status, void *UNUSED(userdata)) { postmessage_utox(FRIEND_STATE, fid, status, NULL); LOG_INFO("Tox Callbacks", "Friend\t%u\t--\tState:\t%u", fid, status); } static void callback_typing_change(Tox *UNUSED(tox), uint32_t fid, bool is_typing, void *UNUSED(userdata)) { postmessage_utox(FRIEND_TYPING, fid, is_typing, NULL); LOG_DEBUG("Tox Callbacks", "Friend\t%u\t--\tTyping:\t%u", fid, is_typing); } static void callback_read_receipt(Tox *UNUSED(tox), uint32_t fid, uint32_t receipt, void *UNUSED(userdata)) { FRIEND *f = get_friend(fid); if (!f) { LOG_ERR("Tox Callbacks", "Could not get friend with number: %u", fid); return; } messages_clear_receipt(&f->msg, receipt); LOG_INFO("Tox Callbacks", "Friend\t%u\t--\tReceipt:\t%u", fid, receipt); } static void callback_connection_status(Tox *tox, uint32_t fid, TOX_CONNECTION status, void *UNUSED(userdata)) { FRIEND *f = get_friend(fid); if (!f) { LOG_ERR("Tox Callbacks", "Could not get friend with number: %u", fid); return; } if (f->online && !status) { ft_friend_offline(tox, fid); if (f->call_state_self || f->call_state_friend) { utox_av_local_disconnect(NULL, fid); /* TODO HACK, toxav doesn't supply a toxav_get_toxav_from_tox() yet. */ } } else if (!f->online && !!status) { ft_friend_online(tox, fid); /* resend avatar info (in case it changed) */ /* Avatars must be sent LAST or they will clobber existing file transfers! */ avatar_on_friend_online(tox, fid); friend_notify_status(f, (uint8_t *)f->status_message, f->status_length, S(STATUS_ONLINE)); } postmessage_utox(FRIEND_ONLINE, fid, !!status, NULL); if (status == TOX_CONNECTION_UDP) { LOG_INFO("Tox Callbacks", "Friend\t%u\t--\tOnline (UDP)", fid); } else if (status == TOX_CONNECTION_TCP) { LOG_INFO("Tox Callbacks", "Friend\t%u\t--\tOnline (TCP)", fid); } else { LOG_INFO("Tox Callbacks", "Friend\t%u\t--\tOffline", fid); friend_notify_status(f, NULL, 0, S(STATUS_OFFLINE)); } } void utox_set_callbacks_friends(Tox *tox) { tox_callback_friend_request(tox, callback_friend_request); tox_callback_friend_message(tox, callback_friend_message); tox_callback_friend_name(tox, callback_name_change); tox_callback_friend_status_message(tox, callback_status_message); tox_callback_friend_status(tox, callback_user_status); tox_callback_friend_typing(tox, callback_typing_change); tox_callback_friend_read_receipt(tox, callback_read_receipt); tox_callback_friend_connection_status(tox, callback_connection_status); } void callback_av_group_audio(void *tox, uint32_t groupnumber, uint32_t peernumber, const int16_t *pcm, unsigned int samples, uint8_t channels, unsigned int sample_rate, void *userdata); static void callback_group_invite(Tox *tox, uint32_t fid, TOX_CONFERENCE_TYPE type, const uint8_t *data, size_t length, void *UNUSED(userdata)) { LOG_NOTE("Tox Callbacks", "Group Invite (friend %i || type %u)", fid, type); uint32_t gid = UINT32_MAX; if (type == TOX_CONFERENCE_TYPE_TEXT) { gid = tox_conference_join(tox, fid, data, length, NULL); } else if (type == TOX_CONFERENCE_TYPE_AV) { gid = toxav_join_av_groupchat(tox, fid, data, length, callback_av_group_audio, NULL); } if (gid == UINT32_MAX) { LOG_ERR("Tox Callbacks", "Could not join group with type: %u", type); return; } GROUPCHAT *g = get_group(gid); if (!g) { g = group_create(gid, type == TOX_CONFERENCE_TYPE_AV ? true : false, NULL); if (!g) { LOG_ERR("Tox Callbacks", "Failed to create group (number: %u type: %u)", gid, type); } } else { group_init(g, gid, type == TOX_CONFERENCE_TYPE_AV ? true : false, NULL); } LOG_NOTE("Tox Callbacks", "auto join successful group number %u", gid); postmessage_utox(GROUP_ADD, gid, 0, tox); } static void callback_group_message(Tox *UNUSED(tox), uint32_t gid, uint32_t pid, TOX_MESSAGE_TYPE type, const uint8_t *message, size_t length, void *UNUSED(userdata)) { GROUPCHAT *g = get_group(gid); switch (type) { case TOX_MESSAGE_TYPE_ACTION: { LOG_TRACE("Tox Callbacks", "Group Action (%u, %u): %.*s" , gid, pid, (int)length, message); group_add_message(g, pid, message, length, MSG_TYPE_ACTION_TEXT); break; } case TOX_MESSAGE_TYPE_NORMAL: { LOG_INFO("Tox Callbacks", "Group Message (%u, %u): %.*s", gid, pid, (int)length, message); group_add_message(g, pid, message, length, MSG_TYPE_TEXT); break; } } group_notify_msg(g, (const char *)message, length); postmessage_utox(GROUP_MESSAGE, gid, pid, NULL); } static void callback_group_peer_name_change(Tox *UNUSED(tox), uint32_t gid, uint32_t pid, const uint8_t *name, size_t length, void *UNUSED(userdata)){ LOG_DEBUG("Tox Callbacks", "Group:\tPeer name change (%u, %u)" , gid, pid); GROUPCHAT *g = get_group(gid); if (!g) { LOG_ERR("Tox Callbacks", "Could not get groupchat: %u", gid); return; } if (g->peer) { if (!g->peer[pid]) { LOG_ERR("Tox Callbacks", "Tox Group:\tERROR, can't set a name, for non-existent peer!" ); return; } } else { // TODO can't happen LOG_ERR("Tox Callbacks", "Tox Group:\tERROR, can't set a name, for non-existent Group!" ); } length = utf8_validate(name, length); group_peer_name_change(g, pid, name, length); postmessage_utox(GROUP_PEER_NAME, gid, pid, NULL); } static void callback_group_peer_list_changed(Tox *tox, uint32_t gid, void *UNUSED(userdata)){ GROUPCHAT *g = get_group(gid); if (!g) { LOG_ERR("Tox Callbacks", "Could not get group: %u", gid); return; } pthread_mutex_lock(&messages_lock); /* make sure that messages has posted before we continue */ group_reset_peerlist(g); uint32_t number_peers = tox_conference_peer_count(tox, gid, NULL); g->peer = calloc(number_peers, sizeof(void *)); if (!g->peer) { LOG_FATAL_ERR(EXIT_MALLOC, "Tox Callbacks", "Group:\tToxcore is very broken, but we couldn't alloc here."); } /* I'm about to break some uTox style here, because I'm expecting * the API to change soon, and I just can't when it's this broken */ for (uint32_t i = 0; i < number_peers; ++i) { uint8_t tmp[TOX_MAX_NAME_LENGTH]; size_t len = tox_conference_peer_get_name_size(tox, gid, i, NULL); tox_conference_peer_get_name(tox, gid, i, tmp, NULL); GROUP_PEER *peer = calloc(1, sizeof(*peer) + len + 1); if (!peer) { LOG_FATAL_ERR(EXIT_MALLOC, "Group", "Toxcore is very broken, but we couldn't calloc here."); } /* name and id number (it's worthless, but it's needed */ memcpy(peer->name, tmp, len); peer->name_length = len; peer->id = i; /* get static random color */ uint8_t pkey[TOX_PUBLIC_KEY_SIZE]; tox_conference_peer_get_public_key(tox, gid, i, pkey, NULL); uint64_t pkey_to_number = 0; for (int key_i = 0; key_i < TOX_PUBLIC_KEY_SIZE; ++key_i) { pkey_to_number += pkey[key_i]; } /* uTox doesnt' really use this for too much so let's fuck with the random seed. * If you know crypto, and cringe, I know me too... you can blame @irungentoo */ srand(pkey_to_number); peer->name_color = RGB(rand(), rand(), rand()); g->peer[i] = peer; } g->peer_count = number_peers; postmessage_utox(GROUP_PEER_CHANGE, gid, 0, NULL); pthread_mutex_unlock(&messages_lock); /* make sure that messages has posted before we continue */ } static void callback_group_topic(Tox *UNUSED(tox), uint32_t gid, uint32_t pid, const uint8_t *title, size_t length, void *UNUSED(userdata)) { length = utf8_validate(title, length); if (!length) return; uint8_t *copy_title = malloc(length); if (!copy_title) return; memcpy(copy_title, title, length); postmessage_utox(GROUP_TOPIC, gid, length, copy_title); LOG_TRACE("Tox Callbacks", "Group Title (%u, %u): %.*s" , gid, pid, (int)length, title); } void callback_group_connected(Tox *UNUSED(tox), uint32_t gid, void *UNUSED(userdata)){ GROUPCHAT *g = get_group(gid); if (!g) { LOG_ERR("Tox Callbacks", "Toxcore says we're connected to a non-existent groupchat %u.", gid); return; } g->connected = true; LOG_TRACE("Tox Callbacks", "Connected to groupchat %u.", gid); } void utox_set_callbacks_groups(Tox *tox) { tox_callback_conference_invite(tox, callback_group_invite); tox_callback_conference_message(tox, callback_group_message); tox_callback_conference_peer_name(tox, callback_group_peer_name_change); tox_callback_conference_title(tox, callback_group_topic); tox_callback_conference_peer_list_changed(tox, callback_group_peer_list_changed); tox_callback_conference_connected(tox, callback_group_connected); } #ifdef ENABLE_MULTIDEVICE static void callback_friend_list_change(Tox *tox, void *user_data) { LOG_ERR("Tox Callbacks", "friend list change, updating roster"); flist_dump_contacts(); utox_friend_list_init(tox); flist_reload_contacts(); } static void callback_mdev_self_name(Tox *tox, uint32_t dev_num, const uint8_t *name, size_t length, void *UNUSED(userdata)) { LOG_TRACE("Tox Callbacks", "Name changed on remote device %u", dev_num); memcpy(self.name, name, length); self.name_length = length; edit_setstr(&edit_name, self.name, self.name_length); postmessage_utox(REDRAW, 0, 0, NULL); } typedef void tox_mdev_self_status_message_cb(Tox *tox, uint32_t device_number, const uint8_t *status_message, size_t len, void *user_data); static void callback_mdev_self_status_msg(Tox *tox, uint32_t dev_num, const uint8_t *smsg, size_t length, void *UNUSED(userdata)) { LOG_TRACE("Tox Callbacks", "Status Message changed on remote device %u", dev_num); memcpy(self.statusmsg, smsg, length); self.statusmsg_length = length; edit_setstr(&edit_status, self.statusmsg, self.statusmsg_length); postmessage_utox(REDRAW, 0, 0, NULL); } static void callback_mdev_self_state(Tox *tox, uint32_t device_number, TOX_USER_STATUS state, void *user_data) { self.status = state; } static void callback_device_sent_message(Tox *tox, uint32_t sending_device, uint32_t target_friend, TOX_MESSAGE_TYPE type, uint8_t *msg, size_t msg_length) { LOG_TRACE("Tox Callbacks", "Message sent from other device %u\n\t\t%.*s" , sending_device, (uint32_t)msg_length, msg); switch (type) { case TOX_MESSAGE_TYPE_NORMAL: { message_add_type_text(&friend[target_friend].msg, 1, msg, msg_length, 1, 0); break; } case TOX_MESSAGE_TYPE_ACTION: { message_add_type_action(&friend[target_friend].msg, 1, msg, msg_length, 1, 0); break; } default: { LOG_ERR("Tox Callbacks", "Message from Friend\t%u\t--\tof unsupported type: %.*s", target_friend, (uint32_t)msg_length, msg); } } friend_notify_msg(&friend[target_friend], msg, msg_length); postmessage_utox(FRIEND_MESSAGE_UPDATE, target_friend, 0, NULL); } void utox_set_callbacks_mdevice(Tox *tox) { tox_callback_friend_list_change(tox, callback_friend_list_change, NULL); tox_callback_mdev_self_status_message(tox, callback_mdev_self_status_msg, NULL); tox_callback_mdev_self_name(tox, callback_mdev_self_name, NULL); tox_callback_mdev_self_state(tox, callback_mdev_self_state, NULL); tox_callback_mdev_sent_message(tox, callback_device_sent_message, NULL); } #endif uTox/src/tox_bootstrap.h0000600000175000001440000002406514003056216014354 0ustar rakusers#ifndef TOX_BOOTSTRAP_H #define TOX_BOOTSTRAP_H // // IMPORTANT: This file is generated by the /tools/update-bootstrap.py script, do not edit manually. // struct bootstrap_node { char *address; bool ipv6; uint16_t port_udp; uint16_t port_tcp; uint8_t key[32]; } bootstrap_nodes[] = { /* by dvor, NL */ { "185.14.30.213", false, 443, 443, { 0x25, 0x55, 0x76, 0x3C, 0x8C, 0x46, 0x04, 0x95, 0xB1, 0x41, 0x57, 0xD2, 0x34, 0xDD, 0x56, 0xB8, 0x63, 0x00, 0xA2, 0x39, 0x55, 0x54, 0xBC, 0xAE, 0x46, 0x21, 0xAC, 0x34, 0x5B, 0x8C, 0x1B, 0x1B, } }, /* by dvor, NL */ { "2a00:1ca8:a7::e8b", true, 443, 443, { 0x25, 0x55, 0x76, 0x3C, 0x8C, 0x46, 0x04, 0x95, 0xB1, 0x41, 0x57, 0xD2, 0x34, 0xDD, 0x56, 0xB8, 0x63, 0x00, 0xA2, 0x39, 0x55, 0x54, 0xBC, 0xAE, 0x46, 0x21, 0xAC, 0x34, 0x5B, 0x8C, 0x1B, 0x1B, } }, /* by CeBe, DE */ { "136.243.141.187", false, 443, 443, { 0x6E, 0xE1, 0xFA, 0xDE, 0x9F, 0x55, 0xCC, 0x79, 0x38, 0x23, 0x4C, 0xC0, 0x7C, 0x86, 0x40, 0x81, 0xFC, 0x60, 0x6D, 0x8F, 0xE7, 0xB7, 0x51, 0xED, 0xA2, 0x17, 0xF2, 0x68, 0xF1, 0x07, 0x8A, 0x39, } }, /* by CeBe, DE */ { "2a01:4f8:212:2459::a:1337", true, 443, 443, { 0x6E, 0xE1, 0xFA, 0xDE, 0x9F, 0x55, 0xCC, 0x79, 0x38, 0x23, 0x4C, 0xC0, 0x7C, 0x86, 0x40, 0x81, 0xFC, 0x60, 0x6D, 0x8F, 0xE7, 0xB7, 0x51, 0xED, 0xA2, 0x17, 0xF2, 0x68, 0xF1, 0x07, 0x8A, 0x39, } }, /* by pucetox, DE */ { "148.251.23.146", false, 2306, 2306, { 0x7A, 0xED, 0x21, 0xF9, 0x4D, 0x82, 0xB0, 0x57, 0x74, 0xF6, 0x97, 0xB2, 0x09, 0x62, 0x8C, 0xD5, 0xA9, 0xAD, 0x17, 0xE0, 0xC0, 0x73, 0xD9, 0x32, 0x90, 0x76, 0xA4, 0xC2, 0x8E, 0xD2, 0x81, 0x47, } }, /* by pucetox, DE */ { "2a01:4f8:201:8493::2", true, 2306, 2306, { 0x7A, 0xED, 0x21, 0xF9, 0x4D, 0x82, 0xB0, 0x57, 0x74, 0xF6, 0x97, 0xB2, 0x09, 0x62, 0x8C, 0xD5, 0xA9, 0xAD, 0x17, 0xE0, 0xC0, 0x73, 0xD9, 0x32, 0x90, 0x76, 0xA4, 0xC2, 0x8E, 0xD2, 0x81, 0x47, } }, /* by Cactus, RU */ { "193.124.186.205", false, 5228, 33445, { 0x99, 0x06, 0xD6, 0x5F, 0x2A, 0x47, 0x51, 0x06, 0x8A, 0x59, 0xD3, 0x05, 0x05, 0xC5, 0xFC, 0x8A, 0xE1, 0xA9, 0x5E, 0x08, 0x43, 0xAE, 0x93, 0x72, 0xEA, 0xFA, 0x3B, 0xAB, 0x6A, 0xC1, 0x6C, 0x2C, } }, /* by Cactus, RU */ { "2a02:f680:1:1100::542a", true, 5228, 33445, { 0x99, 0x06, 0xD6, 0x5F, 0x2A, 0x47, 0x51, 0x06, 0x8A, 0x59, 0xD3, 0x05, 0x05, 0xC5, 0xFC, 0x8A, 0xE1, 0xA9, 0x5E, 0x08, 0x43, 0xAE, 0x93, 0x72, 0xEA, 0xFA, 0x3B, 0xAB, 0x6A, 0xC1, 0x6C, 0x2C, } }, /* by Manolis, DE */ { "130.133.110.14", false, 33445, 33445, { 0x46, 0x1F, 0xA3, 0x77, 0x6E, 0xF0, 0xFA, 0x65, 0x5F, 0x1A, 0x05, 0x47, 0x7D, 0xF1, 0xB3, 0xB6, 0x14, 0xF7, 0xD6, 0xB1, 0x24, 0xF7, 0xDB, 0x1D, 0xD4, 0xFE, 0x3C, 0x08, 0xB0, 0x3B, 0x64, 0x0F, } }, /* by Manolis, DE */ { "2001:6f8:1c3c:babe::14:1", true, 33445, 33445, { 0x46, 0x1F, 0xA3, 0x77, 0x6E, 0xF0, 0xFA, 0x65, 0x5F, 0x1A, 0x05, 0x47, 0x7D, 0xF1, 0xB3, 0xB6, 0x14, 0xF7, 0xD6, 0xB1, 0x24, 0xF7, 0xDB, 0x1D, 0xD4, 0xFE, 0x3C, 0x08, 0xB0, 0x3B, 0x64, 0x0F, } }, /* by fluke571, SI */ { "194.249.212.109", false, 33445, 33445, { 0x3C, 0xEE, 0x1F, 0x05, 0x40, 0x81, 0xE7, 0xA0, 0x11, 0x23, 0x48, 0x83, 0xBC, 0x4F, 0xC3, 0x9F, 0x66, 0x1A, 0x55, 0xB7, 0x36, 0x37, 0xA5, 0xAC, 0x29, 0x3D, 0xDF, 0x12, 0x51, 0xD9, 0x43, 0x2B, } }, /* by fluke571, SI */ { "2001:1470:fbfe::109", true, 33445, 33445, { 0x3C, 0xEE, 0x1F, 0x05, 0x40, 0x81, 0xE7, 0xA0, 0x11, 0x23, 0x48, 0x83, 0xBC, 0x4F, 0xC3, 0x9F, 0x66, 0x1A, 0x55, 0xB7, 0x36, 0x37, 0xA5, 0xAC, 0x29, 0x3D, 0xDF, 0x12, 0x51, 0xD9, 0x43, 0x2B, } }, /* by ru_maniac, US */ { "104.223.122.15", false, 33445, 3389, { 0x0F, 0xB9, 0x6E, 0xEB, 0xFB, 0x16, 0x50, 0xDD, 0xB5, 0x2E, 0x70, 0xCF, 0x77, 0x3D, 0xDF, 0xCA, 0xBE, 0x25, 0xA9, 0x5C, 0xC3, 0xBB, 0x50, 0xFC, 0x25, 0x10, 0x82, 0xE4, 0xB6, 0x3E, 0xF8, 0x2A, } }, /* by ru_maniac, US */ { "2607:ff48:aa81:800::35eb:1", true, 33445, 3389, { 0x0F, 0xB9, 0x6E, 0xEB, 0xFB, 0x16, 0x50, 0xDD, 0xB5, 0x2E, 0x70, 0xCF, 0x77, 0x3D, 0xDF, 0xCA, 0xBE, 0x25, 0xA9, 0x5C, 0xC3, 0xBB, 0x50, 0xFC, 0x25, 0x10, 0x82, 0xE4, 0xB6, 0x3E, 0xF8, 0x2A, } }, /* by a68366, FR */ { "51.254.84.212", false, 33445, 33445, { 0xAE, 0xC2, 0x04, 0xB9, 0xA4, 0x50, 0x14, 0x12, 0xD5, 0xF0, 0xBB, 0x67, 0xD9, 0xC8, 0x1B, 0x5D, 0xB3, 0xEE, 0x6A, 0xDA, 0x64, 0x12, 0x2D, 0x32, 0xA3, 0xE9, 0xB0, 0x93, 0xD5, 0x44, 0x32, 0x7D, } }, /* by a68366, FR */ { "2001:41d0:a:1a3b::18", true, 33445, 33445, { 0xAE, 0xC2, 0x04, 0xB9, 0xA4, 0x50, 0x14, 0x12, 0xD5, 0xF0, 0xBB, 0x67, 0xD9, 0xC8, 0x1B, 0x5D, 0xB3, 0xEE, 0x6A, 0xDA, 0x64, 0x12, 0x2D, 0x32, 0xA3, 0xE9, 0xB0, 0x93, 0xD5, 0x44, 0x32, 0x7D, } }, /* by ru_maniac, RU */ { "185.58.206.164", false, 33445, 33445, { 0x24, 0x15, 0x64, 0x72, 0x04, 0x1E, 0x5F, 0x22, 0x0D, 0x1F, 0xA1, 0x1D, 0x9D, 0xF3, 0x2F, 0x7A, 0xD6, 0x97, 0xD5, 0x98, 0x45, 0x70, 0x1C, 0xDD, 0x7B, 0xE7, 0xD1, 0x78, 0x5E, 0xB9, 0xDB, 0x39, } }, /* by ru_maniac, RU */ { "2a02:f680:1:1100::3313", true, 33445, 33445, { 0x24, 0x15, 0x64, 0x72, 0x04, 0x1E, 0x5F, 0x22, 0x0D, 0x1F, 0xA1, 0x1D, 0x9D, 0xF3, 0x2F, 0x7A, 0xD6, 0x97, 0xD5, 0x98, 0x45, 0x70, 0x1C, 0xDD, 0x7B, 0xE7, 0xD1, 0x78, 0x5E, 0xB9, 0xDB, 0x39, } }, /* by strngr, UA */ { "195.93.190.6", false, 33445, 33445, { 0xFB, 0x4C, 0xE0, 0xDD, 0xEF, 0xEE, 0xD4, 0x5F, 0x26, 0x91, 0x70, 0x53, 0xE5, 0xD2, 0x4B, 0xDD, 0xA0, 0xFA, 0x0A, 0x3D, 0x83, 0xA6, 0x72, 0xA9, 0xDA, 0x23, 0x75, 0x92, 0x8B, 0x37, 0x02, 0x3D, } }, /* by strngr, UA */ { "2a01:d0:ffff:a8a::2", true, 33445, 33445, { 0xFB, 0x4C, 0xE0, 0xDD, 0xEF, 0xEE, 0xD4, 0x5F, 0x26, 0x91, 0x70, 0x53, 0xE5, 0xD2, 0x4B, 0xDD, 0xA0, 0xFA, 0x0A, 0x3D, 0x83, 0xA6, 0x72, 0xA9, 0xDA, 0x23, 0x75, 0x92, 0x8B, 0x37, 0x02, 0x3D, } }, /* by HooinKyoma, SE */ { "95.215.44.78", false, 33445, 3389, { 0x67, 0x2D, 0xBE, 0x27, 0xB4, 0xAD, 0xB9, 0xD5, 0xFB, 0x10, 0x5A, 0x6B, 0xB6, 0x48, 0xB2, 0xF8, 0xFD, 0xB8, 0x9B, 0x33, 0x23, 0x48, 0x6A, 0x7A, 0x21, 0x96, 0x83, 0x16, 0xE0, 0x12, 0x02, 0x3C, } }, /* by HooinKyoma, SE */ { "2a02:7aa0:1619::c6fe:d0cb", true, 33445, 3389, { 0x67, 0x2D, 0xBE, 0x27, 0xB4, 0xAD, 0xB9, 0xD5, 0xFB, 0x10, 0x5A, 0x6B, 0xB6, 0x48, 0xB2, 0xF8, 0xFD, 0xB8, 0x9B, 0x33, 0x23, 0x48, 0x6A, 0x7A, 0x21, 0x96, 0x83, 0x16, 0xE0, 0x12, 0x02, 0x3C, } }, /* by LittleVulpix, FR */ { "163.172.136.118", false, 33445, 3389, { 0x2C, 0x28, 0x9F, 0x9F, 0x37, 0xC2, 0x0D, 0x09, 0xDA, 0x83, 0x56, 0x55, 0x88, 0xBF, 0x49, 0x6F, 0xAB, 0x37, 0x64, 0x85, 0x3F, 0xA3, 0x81, 0x41, 0x81, 0x7A, 0x72, 0xE3, 0xF1, 0x8A, 0xCA, 0x0B, } }, /* by LittleVulpix, FR */ { "2001:bc8:4400:2100::1c:50f", true, 33445, 3389, { 0x2C, 0x28, 0x9F, 0x9F, 0x37, 0xC2, 0x0D, 0x09, 0xDA, 0x83, 0x56, 0x55, 0x88, 0xBF, 0x49, 0x6F, 0xAB, 0x37, 0x64, 0x85, 0x3F, 0xA3, 0x81, 0x41, 0x81, 0x7A, 0x72, 0xE3, 0xF1, 0x8A, 0xCA, 0x0B, } }, /* by Yani, NL */ { "37.97.185.116", false, 33445, 33445, { 0xE5, 0x9A, 0x0E, 0x71, 0xAD, 0xA2, 0x0D, 0x35, 0xBD, 0x1B, 0x09, 0x57, 0x05, 0x9D, 0x7E, 0xF7, 0xE7, 0x79, 0x2B, 0x3D, 0x68, 0x0A, 0xE2, 0x5C, 0x6F, 0x4D, 0xBB, 0xA0, 0x91, 0x14, 0xD1, 0x65, } }, /* by linxon, RU */ { "80.87.193.193", false, 33445, 3389, { 0xB3, 0x82, 0x55, 0xEE, 0x4B, 0x05, 0x49, 0x24, 0xF6, 0xD7, 0x9A, 0x5E, 0x6E, 0x58, 0x89, 0xEC, 0x94, 0xB6, 0xAD, 0xF6, 0xFE, 0x99, 0x06, 0xF9, 0x7A, 0x3D, 0x01, 0xE3, 0xD0, 0x83, 0x22, 0x3A, } }, /* by linxon, RU */ { "2a01:230:2:6::46a8", true, 33445, 3389, { 0xB3, 0x82, 0x55, 0xEE, 0x4B, 0x05, 0x49, 0x24, 0xF6, 0xD7, 0x9A, 0x5E, 0x6E, 0x58, 0x89, 0xEC, 0x94, 0xB6, 0xAD, 0xF6, 0xFE, 0x99, 0x06, 0xF9, 0x7A, 0x3D, 0x01, 0xE3, 0xD0, 0x83, 0x22, 0x3A, } }, /* by Stranger, UA */ { "46.229.52.198", false, 33445, 33445, { 0x81, 0x3C, 0x8F, 0x41, 0x87, 0x83, 0x3E, 0xF0, 0x65, 0x5B, 0x10, 0xF7, 0x75, 0x21, 0x41, 0xA3, 0x52, 0x24, 0x84, 0x62, 0xA5, 0x67, 0x52, 0x9A, 0x38, 0xB6, 0xBB, 0xF7, 0x3E, 0x97, 0x93, 0x07, } }, /* by himura, RU */ { "85.21.144.224", false, 33445, 33445, { 0x8F, 0x73, 0x8B, 0xBC, 0x8F, 0xA9, 0x39, 0x46, 0x70, 0xBC, 0xAB, 0x14, 0x6C, 0x67, 0xA5, 0x07, 0xB9, 0x90, 0x7C, 0x8E, 0x56, 0x4E, 0x28, 0xC2, 0xB5, 0x9B, 0xEB, 0xB2, 0xFF, 0x68, 0x71, 0x1B, } }, /* by dolohow, FR */ { "37.187.122.30", false, 33445, 3389, { 0xBE, 0xB7, 0x1F, 0x97, 0xED, 0x9C, 0x99, 0xC0, 0x4B, 0x84, 0x89, 0xBB, 0x75, 0x57, 0x9E, 0xB4, 0xDC, 0x6A, 0xB6, 0xF4, 0x41, 0xB6, 0x03, 0xD6, 0x35, 0x33, 0x12, 0x2F, 0x18, 0x58, 0xB5, 0x1D, } }, /* by Busindre, US */ { "205.185.116.116", false, 33445, 33445, { 0xA1, 0x79, 0xB0, 0x97, 0x49, 0xAC, 0x82, 0x6F, 0xF0, 0x1F, 0x37, 0xA9, 0x61, 0x3F, 0x6B, 0x57, 0x11, 0x8A, 0xE0, 0x14, 0xD4, 0x19, 0x6A, 0x0E, 0x11, 0x05, 0xA9, 0x8F, 0x93, 0xA5, 0x47, 0x02, } }, /* by Busindre, US */ { "198.98.51.198", false, 33445, 3389, { 0x1D, 0x5A, 0x5F, 0x2F, 0x5D, 0x62, 0x33, 0x05, 0x8B, 0xF0, 0x25, 0x9B, 0x09, 0x62, 0x2F, 0xB4, 0x0B, 0x48, 0x2E, 0x4F, 0xA0, 0x93, 0x1E, 0xB8, 0xFD, 0x3A, 0xB8, 0xE7, 0xBF, 0x7D, 0xAF, 0x6F, } }, /* by Busindre, US */ { "2605:6400:1:fed5:22:45af:ec10:f329", true, 33445, 3389, { 0x1D, 0x5A, 0x5F, 0x2F, 0x5D, 0x62, 0x33, 0x05, 0x8B, 0xF0, 0x25, 0x9B, 0x09, 0x62, 0x2F, 0xB4, 0x0B, 0x48, 0x2E, 0x4F, 0xA0, 0x93, 0x1E, 0xB8, 0xFD, 0x3A, 0xB8, 0xE7, 0xBF, 0x7D, 0xAF, 0x6F, } }, /* by wildermesser, CA */ { "104.233.104.126", false, 33445, 33445, { 0xED, 0xEE, 0x8F, 0x2E, 0x83, 0x9A, 0x57, 0x82, 0x0D, 0xE3, 0xDA, 0x41, 0x56, 0xD8, 0x83, 0x50, 0xE5, 0x3D, 0x41, 0x61, 0x44, 0x70, 0x68, 0xA3, 0x45, 0x7E, 0xE8, 0xF5, 0x9F, 0x36, 0x24, 0x14, } }, }; #endif uTox/src/tox.h0000600000175000001440000000673014003056216012256 0ustar rakusers/* todo: proper system for posting messages to the toxcore thread, comments, better names (?), proper cleanup of a/v and * a/v thread*/ /* -proper unpause/pause file transfers, resuming file transfers + what if new file transfer with same id gets created before the main thread receives the message for the old one? >= GiB file sizes with FILE_*_PROGRESS on 32bit */ /* details about messages and their (param1, param2, data) values are in the message handlers in tox.c*/ #ifndef UTOX_TOX_H #define UTOX_TOX_H #include #include #include #include typedef uint8_t *UTOX_IMAGE; typedef struct { uint8_t msg; uint32_t param1, param2; void * data; } TOX_MSG; typedef enum UTOX_ENC_ERR { UTOX_ENC_ERR_NONE, UTOX_ENC_ERR_LENGTH, UTOX_ENC_ERR_BAD_PASS, UTOX_ENC_ERR_BAD_DATA, UTOX_ENC_ERR_UNKNOWN } UTOX_ENC_ERR; /* toxcore thread messages (sent from the client thread) */ enum { /* SHUTDOWNEVERYTHING! */ TOX_KILL, // 0 TOX_SAVE, /* Change our settings in core */ TOX_SELF_SET_NAME, TOX_SELF_SET_STATUS, TOX_SELF_SET_STATE, TOX_SELF_CHANGE_NOSPAM, TOX_SELF_NEW_DEVICE, /* Wooo pixturs */ TOX_AVATAR_SET, TOX_AVATAR_UNSET, /* Interact with contacts */ TOX_FRIEND_NEW, TOX_FRIEND_NEW_DEVICE, TOX_FRIEND_ACCEPT, TOX_FRIEND_DELETE, TOX_FRIEND_ONLINE, TOX_FRIEND_NEW_NO_REQ, /* Default actions */ TOX_SEND_MESSAGE, TOX_SEND_ACTION, /* Should we deprecate this, now that core uses a single function? */ TOX_SEND_TYPING, /* File Transfers */ TOX_FILE_ACCEPT, TOX_FILE_ACCEPT_AUTO, TOX_FILE_SEND_NEW, TOX_FILE_SEND_NEW_INLINE, TOX_FILE_SEND_NEW_SLASH, TOX_FILE_RESUME, TOX_FILE_PAUSE, TOX_FILE_CANCEL, /* Audio/Video Calls */ TOX_CALL_SEND, TOX_CALL_INCOMING, TOX_CALL_ANSWER, TOX_CALL_PAUSE_AUDIO, TOX_CALL_PAUSE_VIDEO, TOX_CALL_RESUME_AUDIO, TOX_CALL_RESUME_VIDEO, TOX_CALL_DISCONNECT, TOX_GROUP_CREATE, TOX_GROUP_JOIN, TOX_GROUP_PART, TOX_GROUP_SEND_INVITE, TOX_GROUP_SET_TOPIC, TOX_GROUP_SEND_MESSAGE, TOX_GROUP_SEND_ACTION, TOX_GROUP_AUDIO_START, TOX_GROUP_AUDIO_END, }; struct TOX_SEND_INLINE_MSG { size_t image_size; UTOX_IMAGE image; }; /* AV STATUS LIST */ enum { UTOX_AV_NONE, UTOX_AV_INVITE, UTOX_AV_RINGING, UTOX_AV_STARTED, }; typedef enum { // tox_thread is not initialized yet UTOX_TOX_THREAD_INIT_NONE = 0, // tox_thread is initialized successfully // this means a tox instance has been created UTOX_TOX_THREAD_INIT_SUCCESS = 1, // tox_thread is initialized but not successfully // this means a tox instance may have not been created UTOX_TOX_THREAD_INIT_ERROR = 2, } UTOX_TOX_THREAD_INIT; extern UTOX_TOX_THREAD_INIT tox_thread_init; /* Inter-thread communication vars. */ extern TOX_MSG tox_msg, audio_msg, toxav_msg; extern volatile bool tox_thread_msg, audio_thread_msg, video_thread_msg; extern bool tox_connected; void tox_after_load(Tox *tox); /* toxcore thread */ void *toxcore_thread(void *args); /* send a message to the toxcore thread */ void postmessage_toxcore(uint8_t msg, uint32_t param1, uint32_t param2, void *data); void tox_settingschanged(void); /* convert tox id to string * notes: dest must be (TOX_FRIEND_ADDRESS_SIZE * 2) bytes large, src must be TOX_FRIEND_ADDRESS_SIZE bytes large */ void id_to_string(char *dest, uint8_t *src); #endif uTox/src/tox.c0000600000175000001440000011715314003056216012253 0ustar rakusers#include "tox.h" #include "avatar.h" #include "file_transfers.h" #include "flist.h" #include "friend.h" #include "groups.h" #include "debug.h" #include "macros.h" #include "self.h" #include "settings.h" #include "text.h" #include "tox_bootstrap.h" #include "tox_callbacks.h" #include "utox.h" #include "av/audio.h" #include "av/utox_av.h" #include "av/video.h" #include "ui/edit.h" // FIXME the toxcore thread shouldn't be interacting directly with the UI #include "ui/switch.h" // FIXME the toxcore thread shouldn't be interacting directly with the UI #include "ui/dropdown.h" #include "layout/background.h" #include "layout/settings.h" #include "native/thread.h" #include "native/time.h" #include #include #include #include #include #include "main.h" // utox_data_save/load, DEFAULT_NAME, DEFAULT_STATUS UTOX_TOX_THREAD_INIT tox_thread_init; TOX_MSG tox_msg, audio_msg, toxav_msg; volatile bool tox_thread_msg, audio_thread_msg, video_thread_msg; bool tox_connected; static bool save_needed = true; enum { LOG_FILE_MSG_TYPE_TEXT = 0, LOG_FILE_MSG_TYPE_ACTION = 1, }; typedef struct { uint64_t time; uint16_t namelen, length; uint8_t flags; uint8_t msg_type; uint8_t zeroes[2]; } LOG_FILE_MSG_HEADER_COMPAT; static void tox_thread_message(Tox *tox, ToxAV *av, uint64_t time, uint8_t msg, uint32_t param1, uint32_t param2, void *data); void postmessage_toxcore(uint8_t msg, uint32_t param1, uint32_t param2, void *data) { while (tox_thread_msg) { yieldcpu(1); } if (!tox_thread_init) { /* Tox is not yet active, drop message (Probably a mistake) */ return; } tox_msg.msg = msg; tox_msg.param1 = param1; tox_msg.param2 = param2; tox_msg.data = data; tox_thread_msg = 1; } static int utox_encrypt_data(void *clear_text, size_t clear_length, uint8_t *cypher_data) { size_t passphrase_length = edit_profile_password.length; if (passphrase_length < 4) { return UTOX_ENC_ERR_LENGTH; } uint8_t passphrase[passphrase_length]; memcpy(passphrase, edit_profile_password.data, passphrase_length); TOX_ERR_ENCRYPTION err = 0; tox_pass_encrypt((uint8_t *)clear_text, clear_length, (uint8_t *)passphrase, passphrase_length, cypher_data, &err); if (err) { LOG_FATAL_ERR(EXIT_FAILURE, "Toxcore", "Fatal Error; unable to encrypt data!\n"); } return err; } static int utox_decrypt_data(void *cypher_data, size_t cypher_length, uint8_t *clear_text) { size_t passphrase_length = edit_profile_password.length; if (passphrase_length < 4) { return UTOX_ENC_ERR_LENGTH; } uint8_t passphrase[passphrase_length]; memcpy(passphrase, edit_profile_password.data, passphrase_length); TOX_ERR_DECRYPTION err = 0; tox_pass_decrypt((uint8_t *)cypher_data, cypher_length, (uint8_t *)passphrase, passphrase_length, clear_text, &err); switch (err) { case TOX_ERR_DECRYPTION_OK: return 0; case TOX_ERR_DECRYPTION_NULL: case TOX_ERR_DECRYPTION_INVALID_LENGTH: return UTOX_ENC_ERR_LENGTH; case TOX_ERR_DECRYPTION_BAD_FORMAT: return UTOX_ENC_ERR_BAD_DATA; case TOX_ERR_DECRYPTION_KEY_DERIVATION_FAILED: return UTOX_ENC_ERR_UNKNOWN; case TOX_ERR_DECRYPTION_FAILED: return UTOX_ENC_ERR_BAD_PASS; } return -1; } /* bootstrap to dht with bootstrap_nodes */ static void toxcore_bootstrap(Tox *tox, bool ipv6_enabled) { static unsigned int j = 0; if (j == 0) { j = rand(); } int i = 0; while (i < 4) { struct bootstrap_node *d = &bootstrap_nodes[j++ % COUNTOF(bootstrap_nodes)]; // do not add IPv6 bootstrap nodes if IPv6 is not enabled if (!ipv6_enabled && d->ipv6) { continue; } LOG_TRACE("Toxcore", "Bootstrapping with node %s udp: %d, tcp: %d", d->address, d->port_udp, d->port_tcp); tox_bootstrap(tox, d->address, d->port_udp, d->key, 0); tox_add_tcp_relay(tox, d->address, d->port_tcp, d->key, 0); i++; } } static void set_callbacks(Tox *tox) { utox_set_callbacks_friends(tox); utox_set_callbacks_groups(tox); #ifdef ENABLE_MULTIDEVICE utox_set_callbacks_mdevice(tox); #endif utox_set_callbacks_file_transfer(tox); } void tox_after_load(Tox *tox) { utox_friend_list_init(tox); init_groups(tox); #ifdef ENABLE_MULTIDEVICE // self.group_list_count = tox_self_get_(tox); self.device_list_count = tox_self_get_device_count(tox); // devices_update_list(); utox_devices_init(); devices_update_ui(); uint32_t i; for (i = 0; i < self.device_list_count; ++i) { utox_device_init(tox, i); } #endif self.name_length = tox_self_get_name_size(tox); tox_self_get_name(tox, (uint8_t *)self.name); self.statusmsg_length = tox_self_get_status_message_size(tox); tox_self_get_status_message(tox, (uint8_t *)self.statusmsg); self.status = tox_self_get_status(tox); } static void load_defaults(Tox *tox) { uint8_t *name = (uint8_t *)DEFAULT_NAME, *status = (uint8_t *)DEFAULT_STATUS; uint16_t name_len = sizeof(DEFAULT_NAME) - 1, status_len = sizeof(DEFAULT_STATUS) - 1; tox_self_set_name(tox, name, name_len, 0); tox_self_set_status_message(tox, status, status_len, 0); } static void write_save(Tox *tox) { /* Get toxsave info from tox*/ size_t clear_length = tox_get_savedata_size(tox); size_t encrypted_length = clear_length + TOX_PASS_ENCRYPTION_EXTRA_LENGTH; uint8_t *clear_data = calloc(1, clear_length); uint8_t *encrypted_data = calloc(1, encrypted_length); if (!clear_data || !encrypted_data) { LOG_FATAL_ERR(EXIT_FAILURE, "Toxcore", "Could not allocate memory for savedata.\n"); } tox_get_savedata(tox, clear_data); if (edit_profile_password.length == 0) { // user doesn't use encryption save_needed = utox_data_save_tox(clear_data, clear_length); LOG_TRACE("Toxcore", "Unencrypted save data written" ); } else { UTOX_ENC_ERR enc_err = utox_encrypt_data(clear_data, clear_length, encrypted_data); if (enc_err) { /* encryption failed, write clear text data */ save_needed = utox_data_save_tox(clear_data, clear_length); LOG_TRACE("Toxcore", "\n\n\t\tWARNING UTOX WAS UNABLE TO ENCRYPT DATA!\n\t\tDATA WRITTEN IN CLEAR TEXT!\n" ); } else { save_needed = utox_data_save_tox(encrypted_data, encrypted_length); LOG_TRACE("Toxcore", "Encrypted save data written" ); } } free(encrypted_data); free(clear_data); } void tox_settingschanged(void) { // free everything tox_connected = 0; #ifdef ENABLE_MULTIDEVICE utox_devices_decon(); #endif flist_freeall(); dropdown_list_clear(&dropdown_audio_in); dropdown_list_clear(&dropdown_audio_out); dropdown_list_clear(&dropdown_video); LOG_NOTE("Toxcore", "Restarting Toxcore"); postmessage_toxcore(TOX_KILL, 1, 0, NULL); // send the reconfig message! while (!tox_thread_init) { yieldcpu(1); } } /* 6 seconds */ #define UTOX_TYPING_NOTIFICATION_TIMEOUT (6ul * 1000 * 1000 * 1000) static struct { Tox * tox; uint16_t friendnumber; uint64_t time; bool sent_value; bool sent; } typing_state = { .tox = NULL, .friendnumber = 0, .time = 0, .sent_value = 0, }; static void utox_thread_work_for_typing_notifications(Tox *tox, uint64_t time) { if (typing_state.tox != tox) { // Guard against Tox engine restarts. return; } bool is_typing = (time < typing_state.time + UTOX_TYPING_NOTIFICATION_TIMEOUT); if (typing_state.sent_value ^ is_typing) { // Need to send an update. if (tox_self_set_typing(tox, typing_state.friendnumber, is_typing, 0)) { // Successfully sent. Mark new state. typing_state.sent_value = is_typing; LOG_TRACE("Toxcore", "Sent typing state to friend (%d): %d" , typing_state.friendnumber, typing_state.sent_value); } } } static int load_toxcore_save(struct Tox_Options *options) { settings.save_encryption = 0; size_t raw_length; uint8_t *raw_data = utox_data_load_tox(&raw_length); /* Check if we're loading a saved profile */ if (!raw_data || !raw_length) { // No save file at all, create new profile! return -2; } if (!tox_is_data_encrypted(raw_data)) { LOG_INFO("Toxcore", "Using unencrypted save file"); options->savedata_type = TOX_SAVEDATA_TYPE_TOX_SAVE; options->savedata_data = raw_data; options->savedata_length = raw_length; return 0; } size_t cleartext_length = raw_length - TOX_PASS_ENCRYPTION_EXTRA_LENGTH; uint8_t *clear_data = calloc(1, cleartext_length); settings.save_encryption = 1; LOG_INFO("Toxcore", "Using encrypted data, trying password: "); UTOX_ENC_ERR decrypt_err = utox_decrypt_data(raw_data, raw_length, clear_data); if (decrypt_err) { if (decrypt_err == UTOX_ENC_ERR_LENGTH) { LOG_WARN("Toxcore", "Password too short!\r"); } else if (decrypt_err == UTOX_ENC_ERR_BAD_PASS) { LOG_ERR("Toxcore", "Couldn't decrypt, wrong password?\r"); } else { LOG_ERR("Toxcore", "Unknown error, please file a bug report!" ); } return -1; } if (!clear_data || !cleartext_length) { return -1; } options->savedata_type = TOX_SAVEDATA_TYPE_TOX_SAVE; options->savedata_data = clear_data; options->savedata_length = cleartext_length; return 0; } static void log_callback(Tox *UNUSED(tox), TOX_LOG_LEVEL level, const char *file, uint32_t line, const char *func, const char *message, void *UNUSED(user_data)) { if (message && file && line) { LOG_NET_TRACE("Toxcore", "TOXCORE LOGGING ERROR (%u): %s" , level, message); LOG_NET_TRACE("Toxcore", " in: %s:%u" , file, line); } else if (func) { LOG_NET_TRACE("Toxcore", "TOXCORE LOGGING ERROR: %s" , func); } else { LOG_ERR("Toxcore logging", "TOXCORE LOGGING is broken!!:\tOpen an bug upstream"); } } // initialize toxcore based on current settings // returns 0 on success // returns -1 on temporary error (waiting for password encryption) // returns -2 on fatal error static int init_toxcore(Tox **tox) { tox_thread_init = UTOX_TOX_THREAD_INIT_NONE; int save_status = 0; struct Tox_Options topt; tox_options_default(&topt); // tox_options_set_start_port(&topt, 0); // tox_options_set_end_port(&topt, 0); tox_options_set_log_callback(&topt, log_callback); tox_options_set_ipv6_enabled(&topt, settings.enableipv6); tox_options_set_udp_enabled(&topt, !settings.disableudp); tox_options_set_proxy_type(&topt, TOX_PROXY_TYPE_NONE); tox_options_set_proxy_host(&topt, (char *)settings.proxy_ip); tox_options_set_proxy_port(&topt, settings.proxy_port); #ifdef ENABLE_MULTIDEVICE tox_options_set_mdev_mirror_sent(&topt, 1); #endif save_status = load_toxcore_save(&topt); // TODO tox.c shouldn't be interacting with the UI on this level if (save_status == -1) { /* Save file exist, couldn't decrypt, don't start a tox instance TODO: throw an error to the UI! */ panel_profile_password.disabled = false; panel_settings_master.disabled = true; edit_setfocus(&edit_profile_password); postmessage_utox(REDRAW, 0, 0, NULL); return -1; } else if (save_status == -2) { /* New profile! */ panel_profile_password.disabled = true; panel_settings_master.disabled = false; } else { panel_profile_password.disabled = true; if (settings.show_splash) { panel_splash_page.disabled = false; } else { panel_settings_master.disabled = false; } edit_resetfocus(); } postmessage_utox(REDRAW, 0, 0, NULL); if (settings.proxyenable) { topt.proxy_type = TOX_PROXY_TYPE_SOCKS5; } // Create main connection LOG_INFO("Toxcore", "Creating New Toxcore instance.\n" "\t\tIPv6 : %u\n" "\t\tUDP : %u\n" "\t\tProxy: %u %s %u", topt.ipv6_enabled, topt.udp_enabled, topt.proxy_type, topt.proxy_host, topt.proxy_port); TOX_ERR_NEW tox_new_err = 0; *tox = tox_new(&topt, &tox_new_err); if (*tox == NULL) { if (settings.force_proxy) { LOG_ERR("Toxcore", "\t\tError #%u, Not going to try without proxy because of user settings.", tox_new_err); return -2; } LOG_ERR("Toxcore", "\t\tError #%u, Going to try without proxy.", tox_new_err); // reset proxy options as well as GUI and settings topt.proxy_type = TOX_PROXY_TYPE_NONE; settings.proxyenable = settings.force_proxy = 0; switch_proxy.switch_on = 0; *tox = tox_new(&topt, &tox_new_err); if (*tox == NULL) { LOG_ERR("Toxcore", "\t\tError #%u, Going to try without IPv6.", tox_new_err); // reset IPv6 options as well as GUI and settings topt.ipv6_enabled = 0; switch_ipv6.switch_on = settings.enableipv6 = 0; *tox = tox_new(&topt, &tox_new_err); if (*tox == NULL) { LOG_ERR("Toxcore", "\t\tFatal Error creating a Tox instance... Error #%u", tox_new_err); return -2; } } } free((void *)topt.savedata_data); /* Give toxcore the functions to call */ set_callbacks(*tox); /* Connect to bootstrapped nodes in "tox_bootstrap.h" */ toxcore_bootstrap(*tox, settings.enableipv6); if (save_status == -2) { LOG_NOTE("Toxcore", "No save file, using defaults" ); load_defaults(*tox); } tox_after_load(*tox); return 0; } /** void toxcore_thread(void) * * Main tox function, starts a new toxcore for utox to use, and then spawns its * threads. * * Accepts and returns nothing. */ void *toxcore_thread(void *UNUSED(args)) { ToxAV *av = NULL; bool reconfig = 1; int toxcore_init_err = 0; while (reconfig) { reconfig = 0; Tox *tox = NULL; toxcore_init_err = init_toxcore(&tox); if (toxcore_init_err == -2) { // fatal failure, unable to create tox instance LOG_ERR("Toxcore", "Unable to create Tox Instance (%d)" , toxcore_init_err); // set init to true because other code is waiting for it. // but indicate error state tox_thread_init = UTOX_TOX_THREAD_INIT_ERROR; while (!reconfig) { // Waiting for a message triggering the next reconfigure // avoid trying the creation of thousands of tox instances before user changes the settings if (tox_thread_msg) { TOX_MSG *msg = &tox_msg; if (msg->msg == TOX_KILL) { reconfig = (bool) msg->param1; tox_thread_init = UTOX_TOX_THREAD_INIT_NONE; } // tox is not configured at this point ignore all other messages tox_thread_msg = 0; } else { yieldcpu(300); } } continue; } else if (toxcore_init_err) { /* Couldn't init toxcore, probably waiting for user password */ yieldcpu(300); tox_thread_init = UTOX_TOX_THREAD_INIT_NONE; // ignore all messages in this stage tox_thread_msg = 0; reconfig = 1; continue; } else { init_self(tox); TOXAV_ERR_NEW toxav_error; av = toxav_new(tox, &toxav_error); if (!av) { LOG_ERR("Toxcore", "Unable to get ToxAV (%u)" , toxav_error); } tox_thread_init = UTOX_TOX_THREAD_INIT_SUCCESS; /* init the friends list. */ flist_start(); postmessage_utox(UPDATE_TRAY, 0, 0, NULL); postmessage_utox(PROFILE_DID_LOAD, 0, 0, NULL); thread(utox_av_ctrl_thread, NULL); postmessage_utoxav(UTOXAV_NEW_TOX_INSTANCE, 0, 0, av); } bool connected = 0; uint64_t last_save = get_time(), last_connection = get_time(), time; while (1) { // Put toxcore to work tox_iterate(tox, NULL); // Check currents connection if (!!tox_self_get_connection_status(tox) != connected) { connected = !connected; postmessage_utox(DHT_CONNECTED, connected, 0, NULL); } /* Wait 10 Billion ticks then verify connection. */ time = get_time(); if (time - last_connection >= (uint64_t)10 * 1000 * 1000 * 1000) { last_connection = time; if (!connected) { toxcore_bootstrap(tox, settings.enableipv6); } // save every 1000. if (save_needed || (time - last_save >= (uint64_t)1000 * 1000 * 1000 * 1000)) { // Save tox data write_save(tox); last_save = time; } } // If there's a message, load it, and send to the tox message thread if (tox_thread_msg) { TOX_MSG *msg = &tox_msg; if (msg->msg == TOX_KILL) { reconfig = msg->param1; // reconfig if needed tox_thread_msg = 0; tox_thread_init = UTOX_TOX_THREAD_INIT_NONE; break; } tox_thread_message(tox, av, time, msg->msg, msg->param1, msg->param2, msg->data); tox_thread_msg = 0; typing_state.sent = (msg->msg == TOX_SEND_MESSAGE || msg->msg == TOX_SEND_ACTION); } if (!settings.no_typing_notifications) { // Thread active transfers and check if friend is typing utox_thread_work_for_typing_notifications(tox, time); } /* Ask toxcore how many ms to wait, then wait at the most 20ms */ uint32_t interval = tox_iteration_interval(tox); yieldcpu((interval > 20) ? 20 : interval); } /* If for anyreason, we exit, write the save, and clear the password */ write_save(tox); edit_setstr(&edit_profile_password, (char *)"", 0); postmessage_utoxav(UTOXAV_KILL, 0, 0, NULL); while (utox_av_ctrl_init) { yieldcpu(1); } LOG_TRACE("Toxcore", "tox thread ending"); tox_kill(tox); } tox_thread_init = UTOX_TOX_THREAD_INIT_NONE; free_friends(); raze_groups(); LOG_TRACE("Toxcore", "Tox thread:\tClean exit!"); return NULL; } /** General recommendations for working with threads in uTox * * There are two main threads, the tox worker thread, that interacts with Toxcore, and receives the callbacks. The other * is the 'uTox' thread that interacts with the user, (rather sends information to the GUI.) The tox thread and the uTox * thread may interact with each other, as you see fit. However the Toxcore thread has child threads that are a bit * temperamental. The ToxAV thread is a child of the Toxcore thread, and therefore will ideally only be called by the tox * thread. The ToxAV thread also has two children of its own, an audio and a video thread. Both a & v threads should * only be called by the ToxAV thread to avoid deadlocks. */ static void tox_thread_message(Tox *tox, ToxAV *av, uint64_t time, uint8_t msg, uint32_t param1, uint32_t param2, void *data) { switch (msg) { case TOX_SAVE: { save_needed = 1; break; } /* Change Self in core */ case TOX_SELF_SET_NAME: { /* param1: name length * data: name */ tox_self_set_name(tox, data, param1, 0); save_needed = 1; break; } case TOX_SELF_SET_STATUS: { /* param1: status length * data: status message */ tox_self_set_status_message(tox, data, param1, 0); save_needed = 1; break; } case TOX_SELF_SET_STATE: { /* param1: status */ tox_self_set_status(tox, param1); save_needed = 1; break; } case TOX_SELF_CHANGE_NOSPAM: { /* param1: new nospam value */ char *old_id = self.id_str; self.nospam = param1; sprintf(self.nospam_str, "%08X", self.nospam); tox_self_set_nospam(tox, self.nospam); /* update tox id */ tox_self_get_address(tox, self.id_binary); id_to_string(self.id_str, self.id_binary); LOG_TRACE("Toxcore", "Tox ID: %.*s" , (int)self.id_str_length, self.id_str); /* Update avatar */ avatar_move((uint8_t *)old_id, (uint8_t *)self.id_str); edit_setstr(&edit_nospam, self.nospam_str, sizeof(uint32_t) * 2); save_needed = true; break; } case TOX_SELF_NEW_DEVICE: { #ifdef ENABLE_MULTIDEVICE TOX_ERR_DEVICE_ADD error = 0; tox_self_add_device(tox, data + TOX_ADDRESS_SIZE, param1, data, &error); if (error) { LOG_ERR("Toxcore", "problem with adding device to self %u" , error); } else { self.device_list_count++; } #endif break; } /* Avatar status */ case TOX_AVATAR_SET: { /* param1: avatar format * param2: length of avatar data * data: raw avatar data (PNG) */ avatar_set_self(data, param2); save_needed = 1; break; } case TOX_AVATAR_UNSET: { avatar_unset_self(); save_needed = 1; break; } /* Interact with contacts */ case TOX_FRIEND_NEW: { /* param1: length of message * data: friend id + message */ uint32_t fid; TOX_ERR_FRIEND_ADD f_err; if (!param1) { STRING *default_add_msg = SPTR(DEFAULT_FRIEND_REQUEST_MESSAGE); fid = tox_friend_add(tox, data, (const uint8_t *)default_add_msg->str, default_add_msg->length, &f_err); } else { fid = tox_friend_add(tox, data, (uint8_t *)data + TOX_ADDRESS_SIZE, param1, &f_err); } if (f_err != TOX_ERR_FRIEND_ADD_OK) { uint8_t addf_error; switch (f_err) { case TOX_ERR_FRIEND_ADD_TOO_LONG: addf_error = ADDF_TOOLONG; break; case TOX_ERR_FRIEND_ADD_NO_MESSAGE: addf_error = ADDF_NOMESSAGE; break; case TOX_ERR_FRIEND_ADD_OWN_KEY: addf_error = ADDF_OWNKEY; break; case TOX_ERR_FRIEND_ADD_ALREADY_SENT: addf_error = ADDF_ALREADYSENT; break; case TOX_ERR_FRIEND_ADD_BAD_CHECKSUM: addf_error = ADDF_BADCHECKSUM; break; case TOX_ERR_FRIEND_ADD_SET_NEW_NOSPAM: addf_error = ADDF_SETNEWNOSPAM; break; case TOX_ERR_FRIEND_ADD_MALLOC: addf_error = ADDF_NOMEM; break; default: addf_error = ADDF_UNKNOWN; break; } postmessage_utox(FRIEND_SEND_REQUEST, 1, addf_error, data); } else { utox_friend_init(tox, fid); postmessage_utox(FRIEND_SEND_REQUEST, 0, fid, data); } save_needed = 1; break; } case TOX_FRIEND_NEW_DEVICE: { #ifdef ENABLE_MULTIDEVICE LOG_INFO("Toxcore", "Adding new device to peer %u" , param1); tox_friend_add_device(tox, data, param1, 0); free(data); save_needed = 1; #endif break; } case TOX_FRIEND_NEW_NO_REQ: { /* data: friend's public key */ TOX_ERR_FRIEND_ADD f_err; uint32_t fid = tox_friend_add_norequest(tox, data, &f_err); if (!f_err) { utox_friend_init(tox, fid); postmessage_utox(FRIEND_ADD_NO_REQ, 0, fid, data); } else { char hex_id[TOX_ADDRESS_SIZE * 2]; id_to_string(hex_id, data); LOG_TRACE("Toxcore", "Unable to accept friend %s, error num = %i" , hex_id, fid); free(data); } save_needed = 1; break; } case TOX_FRIEND_ACCEPT: { /* data: FREQUEST */ FREQUEST *req = data; TOX_ERR_FRIEND_ADD f_err; uint32_t fid = tox_friend_add_norequest(tox, req->bin_id, &f_err); if (!f_err) { utox_friend_init(tox, fid); postmessage_utox(FRIEND_ACCEPT_REQUEST, fid, 0, req); } else { char hex_id[TOX_ADDRESS_SIZE * 2]; id_to_string(hex_id, req->bin_id); LOG_TRACE("Toxcore", "Unable to accept friend %s, error num = %i" , hex_id, fid); } save_needed = 1; break; } case TOX_FRIEND_DELETE: { /* param1: friend # */ tox_friend_delete(tox, param1, 0); postmessage_utox(FRIEND_REMOVE, 0, 0, data); save_needed = 1; break; } case TOX_FRIEND_ONLINE: { /* Moved to the call back... */ break; } /* Default actions */ case TOX_SEND_MESSAGE: case TOX_SEND_ACTION: { /* param1: friend # * param2: message length * data: message */ MSG_HEADER *mmsg = (MSG_HEADER *)data; TOX_MESSAGE_TYPE type; if (msg == TOX_SEND_ACTION) { type = TOX_MESSAGE_TYPE_ACTION; } else { type = TOX_MESSAGE_TYPE_NORMAL; } uint8_t *next = (uint8_t *)mmsg->via.txt.msg; while (param2 > TOX_MAX_MESSAGE_LENGTH) { uint16_t len = TOX_MAX_MESSAGE_LENGTH - utf8_unlen((char *)next + TOX_MAX_MESSAGE_LENGTH); tox_friend_send_message(tox, param1, type, next, len, 0); param2 -= len; next += len; } TOX_ERR_FRIEND_SEND_MESSAGE error = 0; // Send last or only message mmsg->receipt = tox_friend_send_message(tox, param1, type, next, param2, &error); mmsg->receipt_time = 0; LOG_INFO("Toxcore", "Sending message, receipt %u" , mmsg->receipt); if (error) { LOG_ERR("Toxcore", "Error sending message... %u" , error); } break; } case TOX_SEND_TYPING: { /* param1: friend # */ // Check if user has switched to another friend window chat. // Take care not to react on obsolete data from old Tox instance. bool need_resetting = (typing_state.tox == tox) && (typing_state.friendnumber != param1) && (typing_state.sent_value); if (need_resetting) { // Tell previous friend that he's betrayed. tox_self_set_typing(tox, typing_state.friendnumber, 0, 0); // Mark that new friend doesn't know that we're typing yet. typing_state.sent_value = 0; } // Mark us as typing to this friend at the moment. // utox_thread_work_for_typing_notifications() will // send a notification if it deems necessary. typing_state.tox = tox; typing_state.friendnumber = param1; // UINT64_MAX will set the is_typing in utox_thread_work_for_typing_notifications to 0 // and send typing state 0 to friend when message is sent typing_state.time = (typing_state.sent) ? UINT64_MAX : time; // LOG_TRACE("Toxcore", "Set typing state for friend (%d): %d" , typing_state.friendnumber, typing_state.sent_value); break; } /* File transfers are so in right now. */ case TOX_FILE_SEND_NEW: case TOX_FILE_SEND_NEW_SLASH: { /* param1: friend # * param2: offset of first file name in data * data: file names */ if (param2 == 0) { // This is the new default. Where the caller sends an opened file. UTOX_MSG_FT *msg = data; ft_send_file(tox, param1, msg->file, msg->name, strlen((char*)msg->name), NULL); free(msg->name); free(msg); break; } break; } case TOX_FILE_SEND_NEW_INLINE: { /* param1: friend id data: pointer to a TOX_SEND_INLINE_MSG struct */ LOG_INFO("Toxcore", "Sending picture inline." ); struct TOX_SEND_INLINE_MSG *img = data; uint8_t name[] = "utox-inline.png"; ft_send_data(tox, param1, img->image, img->image_size, name, strlen((char *)name)); free(data); break; } case TOX_FILE_ACCEPT: case TOX_FILE_ACCEPT_AUTO: { /* param1: friend # * param2: file # * data: path to write file */ if (utox_file_start_write(param1, param2, (const char *)data)) { /* tox, friend#, file#, START_FILE */ ft_local_control(tox, param1, param2, TOX_FILE_CONTROL_RESUME); } else { ft_local_control(tox, param1, param2, TOX_FILE_CONTROL_CANCEL); } free(data); break; } case TOX_FILE_RESUME: { if (data) { param2 = ((FILE_TRANSFER*)data)->file_number; } ft_local_control(tox, param1, param2, TOX_FILE_CONTROL_RESUME); break; } case TOX_FILE_PAUSE: { if (data) { param2 = ((FILE_TRANSFER*)data)->file_number; } ft_local_control(tox, param1, param2, TOX_FILE_CONTROL_PAUSE); break; } case TOX_FILE_CANCEL: { if (data) { param2 = ((FILE_TRANSFER*)data)->file_number; } ft_local_control(tox, param1, param2, TOX_FILE_CONTROL_CANCEL); break; } /* Audio & Video */ case TOX_CALL_SEND: { /* param1: friend # */ /* Set the video bitrate, if we're starting a video call. */ int v_bitrate = 0; if (param2) { v_bitrate = UTOX_DEFAULT_BITRATE_V; LOG_TRACE("Toxcore", "Sending video call to friend %u" , param1); } else { v_bitrate = 0; LOG_TRACE("Toxcore", "Sending call to friend %u" , param1); } postmessage_utoxav(UTOXAV_OUTGOING_CALL_PENDING, param1, param2, NULL); TOXAV_ERR_CALL error = 0; toxav_call(av, param1, UTOX_DEFAULT_BITRATE_A, v_bitrate, &error); if (error) { switch (error) { case TOXAV_ERR_CALL_MALLOC: { LOG_TRACE("Toxcore", "Error making call to friend %u; Unable to malloc for this call." , param1); break; } case TOXAV_ERR_CALL_FRIEND_ALREADY_IN_CALL: { /* This shouldn't happen, but just in case toxav gets a call before uTox gets this message we * can just pretend like we're answering a call... */ LOG_TRACE("Toxcore", "Error making call to friend %u; Already in call." , param1); LOG_TRACE("Toxcore", "Forwarding and accepting call!" ); TOXAV_ERR_ANSWER ans_error = 0; toxav_answer(av, param1, UTOX_DEFAULT_BITRATE_A, v_bitrate, &ans_error); if (ans_error) { LOG_TRACE("Toxcore", "Error trying to toxav_answer error (%i)" , ans_error); } else { postmessage_utoxav(UTOXAV_OUTGOING_CALL_ACCEPTED, param1, param2, NULL); } postmessage_utox(AV_CALL_ACCEPTED, param1, 0, NULL); break; } default: { /* Un-handled errors TOXAV_ERR_CALL_SYNC, TOXAV_ERR_CALL_FRIEND_NOT_FOUND, TOXAV_ERR_CALL_FRIEND_NOT_CONNECTED, TOXAV_ERR_CALL_FRIEND_ALREADY_IN_CALL, TOXAV_ERR_CALL_INVALID_BIT_RATE,*/ LOG_TRACE("Toxcore", "Error making call to %u, error num is %i." , param1, error); break; } } } else { postmessage_utox(AV_CALL_RINGING, param1, param2, NULL); } break; } case TOX_CALL_INCOMING: { /* This is a call back, todo remove */ break; } case TOX_CALL_ANSWER: { /* param1: Friend_number # * param2: Accept Video? # */ TOXAV_ERR_ANSWER error = 0; int v_bitrate = 0; if (param2) { v_bitrate = UTOX_DEFAULT_BITRATE_V; LOG_TRACE("Toxcore", "Answering video call." ); } else { v_bitrate = 0; LOG_TRACE("Toxcore", "Answering audio call." ); } toxav_answer(av, param1, UTOX_DEFAULT_BITRATE_A, v_bitrate, &error); if (error) { LOG_TRACE("Toxcore", "Error trying to toxav_answer error (%i)" , error); } else { postmessage_utoxav(UTOXAV_INCOMING_CALL_ANSWER, param1, param2, NULL); } postmessage_utox(AV_CALL_ACCEPTED, param1, 0, NULL); break; } case TOX_CALL_PAUSE_AUDIO: { /* param1: friend # */ LOG_TRACE("Toxcore", "TODO bug, please report 001!!" ); break; } case TOX_CALL_PAUSE_VIDEO: { /* param1: friend # */ LOG_TRACE("Toxcore", "Ending video for active call!" ); utox_av_local_call_control(av, param1, TOXAV_CALL_CONTROL_HIDE_VIDEO); break; } case TOX_CALL_RESUME_AUDIO: { /* param1: friend # */ LOG_TRACE("Toxcore", "TODO bug, please report 002!!" ); break; } case TOX_CALL_RESUME_VIDEO: { /* param1: friend # */ LOG_TRACE("Toxcore", "Starting video for active call!" ); utox_av_local_call_control(av, param1, TOXAV_CALL_CONTROL_SHOW_VIDEO); get_friend(param1)->call_state_self |= TOXAV_FRIEND_CALL_STATE_SENDING_V | TOXAV_FRIEND_CALL_STATE_ACCEPTING_V; break; } case TOX_CALL_DISCONNECT: { /* param1: friend_number */ utox_av_local_disconnect(av, param1); break; } /* Groups are broken while we await the new GCs getting merged. */ /* TOX_GROUP_JOIN, TOX_GROUP_PART, // 30 TOX_GROUP_INVITE, TOX_GROUP_SET_TOPIC, TOX_GROUP_SEND_MESSAGE, TOX_GROUP_SEND_ACTION, TOX_GROUP_AUDIO_START, // 35 TOX_GROUP_AUDIO_END,*/ case TOX_GROUP_CREATE: { int g_num = -1; TOX_ERR_CONFERENCE_NEW error = 0; if (param2) { // TODO FIX THIS AFTER NEW GROUP API g_num = toxav_add_av_groupchat(tox, callback_av_group_audio, NULL); } else { g_num = tox_conference_new(tox, &error); } if (g_num == -1) { LOG_ERR("Tox", "Failed to create groupchat."); break; } GROUPCHAT *g = get_group(g_num); if (!g) { g = group_create(g_num, param2, NULL); if (!g) { LOG_ERR("Tox", "Failed creating group (number: %u type: %u)", g_num, param2); break; } } else { group_init(g, g_num, param2, NULL); } postmessage_utox(GROUP_ADD, g_num, param2, NULL); uint8_t pkey[TOX_PUBLIC_KEY_SIZE]; tox_conference_peer_get_public_key(tox, g_num, 0, pkey, NULL); uint64_t pkey_to_number = 0; for (int key_i = 0; key_i < TOX_PUBLIC_KEY_SIZE; ++key_i) { pkey_to_number += pkey[key_i]; } srand(pkey_to_number); uint32_t name_color = RGB(rand(), rand(), rand()); group_peer_add(g, 0, 1, name_color); group_peer_name_change(g, 0, (uint8_t *)self.name, self.name_length); postmessage_utox(GROUP_PEER_ADD, g_num, 0, NULL); save_needed = true; break; } case TOX_GROUP_JOIN: { break; } case TOX_GROUP_PART: { /* param1: group # */ postmessage_utoxav(UTOXAV_GROUPCALL_END, param1, param1, NULL); TOX_ERR_CONFERENCE_DELETE error = 0; tox_conference_delete(tox, param1, &error); save_needed = true; break; } case TOX_GROUP_SEND_INVITE: { /* param1: group # * param2: friend # */ TOX_ERR_CONFERENCE_INVITE error = 0; tox_conference_invite(tox, param2, param1, &error); save_needed = true; break; } case TOX_GROUP_SET_TOPIC: { /* param1: group # * param2: topic length * data: topic */ TOX_ERR_CONFERENCE_TITLE error = 0; tox_conference_set_title(tox, param1, data, param2, &error); postmessage_utox(GROUP_TOPIC, param1, param2, data); save_needed = true; break; } case TOX_GROUP_SEND_MESSAGE: case TOX_GROUP_SEND_ACTION: { /* param1: group # * param2: message length * data: message */ TOX_MESSAGE_TYPE type; type = (msg == TOX_GROUP_SEND_ACTION ? TOX_MESSAGE_TYPE_ACTION : TOX_MESSAGE_TYPE_NORMAL); TOX_ERR_CONFERENCE_SEND_MESSAGE error = 0; tox_conference_send_message(tox, param1, type, data, param2, &error); free(data); if (error) { LOG_ERR("Toxcore", "Error sending groupchat message... %u" , error); } break; } case TOX_GROUP_AUDIO_START: { // We have to take the long way around, because the UI shouldn't depend on AV LOG_INFO("Toxcore", "Staring call in groupchat %u", param1); postmessage_utox(GROUP_AUDIO_START, param1, 0, NULL); break; } case TOX_GROUP_AUDIO_END: { // We have to take the long way around, because the UI shouldn't depend on AV LOG_INFO("Toxcore", "Ending call in groupchat %u", param1); postmessage_utox(GROUP_AUDIO_END, param1, 0, NULL); break; } } // End of switch. } void id_to_string(char *dest, uint8_t *src) { to_hex(dest, src, TOX_ADDRESS_SIZE); } uTox/src/theme_tables.h0000600000175000001440000000023414003056216014071 0ustar rakusers#ifndef THEME_TABLES_H #define THEME_TABLES_H #include "theme.h" extern const char *COLOUR_NAME_TABLE[]; extern uint32_t *COLOUR_POINTER_TABLE[]; #endif uTox/src/theme_tables.c0000600000175000001440000001707314003056216014075 0ustar rakusers#include "theme_tables.h" #include /* NULL */ const char *COLOUR_NAME_TABLE[] = { "MAIN_BACKGROUND", "ALT_BACKGROUND", "MAIN_TEXT", "MAIN_CHATTEXT", "MAIN_SUBTEXT", "MAIN_ACTIONTEXT", "MAIN_QUOTETEXT", "MAIN_REDTEXT", "MAIN_URLTEXT", "MAIN_HINTTEXT", "MENU_BACKGROUND", "MENU_TEXT", "MENU_SUBTEXT", "MENU_BKGRND_HOVER", "MENU_ACTIVE_BACKGROUND", "MENU_ACTIVE_TEXT", "MSG_USER", "MSG_USER_PEND", "MSG_USER_ERROR", "MSG_CONTACT", "LIST_BACKGROUND", "LIST_BKGRND_HOVER", "LIST_TEXT", "LIST_SUBTEXT", "GROUP_SELF", "GROUP_PEER", "GROUP_AUDIO", "GROUP_MUTED", "SELECTION_BACKGROUND", "SELECTION_TEXT", "EDGE_NORMAL", "EDGE_HOVER", "EDGE_ACTIVE", "ACTIVEOPTION_BACKGROUND", "ACTIVEOPTION_TEXT", "AUX_BACKGROUND", "AUX_EDGE_NORMAL", "AUX_EDGE_HOVER", "AUX_EDGE_ACTIVE", "AUX_TEXT", "AUX_ACTIVEOPTION_BACKGROUND", "AUX_ACTIVEOPTION_TEXT", "STATUS_ONLINE", "STATUS_AWAY", "STATUS_BUSY", "BUTTON_SUCCESS_BACKGROUND", "BUTTON_SUCCESS_TEXT", "BUTTON_SUCCESS_BKGRND_HOVER", "BUTTON_SUCCESS_TEXT_HOVER", "BUTTON_WARNING_BACKGROUND", "BUTTON_WARNING_TEXT", "BUTTON_WARNING_BKGRND_HOVER", "BUTTON_WARNING_TEXT_HOVER", "BUTTON_DANGER_BACKGROUND", "BUTTON_DANGER_TEXT", "BUTTON_DANGER_BKGRND_HOVER", "BUTTON_DANGER_TEXT_HOVER", "BUTTON_DISABLED_BACKGROUND", "TRANSFER_PROGRESS_OVERLAY_PAUSED", "BUTTON_DISABLED_TEXT", "BUTTON_DISABLED_TRANSFER", "BUTTON_INPROGRESS_BACKGROUND", "TRANSFER_PROGRESS_OVERLAY_ACTIVE", "BUTTON_INPROGRESS_TEXT", NULL }; uint32_t *COLOUR_POINTER_TABLE[] = { &COLOR_BKGRND_MAIN, &COLOR_BKGRND_ALT, &COLOR_MAIN_TEXT, &COLOR_MAIN_TEXT_CHAT, &COLOR_MAIN_TEXT_SUBTEXT, &COLOR_MAIN_TEXT_ACTION, &COLOR_MAIN_TEXT_QUOTE, &COLOR_MAIN_TEXT_RED, &COLOR_MAIN_TEXT_URL, &COLOR_MAIN_TEXT_HINT, &COLOR_BKGRND_MENU, &COLOR_MENU_TEXT, &COLOR_MENU_TEXT_SUBTEXT, &COLOR_BKGRND_MENU_HOVER, &COLOR_BKGRND_MENU_ACTIVE, &COLOR_MENU_TEXT_ACTIVE, &COLOR_MSG_USER, &COLOR_MSG_USER_PEND, &COLOR_MSG_USER_ERROR, &COLOR_MSG_CONTACT, &COLOR_BKGRND_LIST, &COLOR_BKGRND_LIST_HOVER, &COLOR_LIST_TEXT, &COLOR_LIST_TEXT_SUBTEXT, &COLOR_GROUP_SELF, &COLOR_GROUP_PEER, &COLOR_GROUP_AUDIO, &COLOR_GROUP_MUTED, &COLOR_SELECTION_BACKGROUND, &COLOR_SELECTION_TEXT, &COLOR_EDGE_NORMAL, &COLOR_EDGE_HOVER, &COLOR_EDGE_ACTIVE, &COLOR_ACTIVEOPTION_BKGRND, &COLOR_ACTIVEOPTION_TEXT, &COLOR_BKGRND_AUX, &COLOR_AUX_EDGE_NORMAL, &COLOR_AUX_EDGE_HOVER, &COLOR_AUX_EDGE_ACTIVE, &COLOR_AUX_TEXT, &COLOR_AUX_ACTIVEOPTION_BKGRND, &COLOR_AUX_ACTIVEOPTION_TEXT, &COLOR_STATUS_ONLINE, &COLOR_STATUS_AWAY, &COLOR_STATUS_BUSY, &COLOR_BTN_SUCCESS_BKGRND, &COLOR_BTN_SUCCESS_TEXT, &COLOR_BTN_SUCCESS_BKGRND_HOVER, &COLOR_BTN_SUCCESS_TEXT_HOVER, &COLOR_BTN_WARNING_BKGRND, &COLOR_BTN_WARNING_TEXT, &COLOR_BTN_WARNING_BKGRND_HOVER, &COLOR_BTN_WARNING_TEXT_HOVER, &COLOR_BTN_DANGER_BACKGROUND, &COLOR_BTN_DANGER_TEXT, &COLOR_BTN_DANGER_BKGRND_HOVER, &COLOR_BTN_DANGER_TEXT_HOVER, &COLOR_BTN_DISABLED_BKGRND, &COLOR_BTN_DISABLED_FORGRND, &COLOR_BTN_DISABLED_TEXT, &COLOR_BTN_DISABLED_TRANSFER, &COLOR_BTN_INPROGRESS_BKGRND, &COLOR_BTN_INPROGRESS_FORGRND, &COLOR_BTN_INPROGRESS_TEXT, NULL }; uTox/src/theme.h0000600000175000001440000000564614003056216012553 0ustar rakusers#ifndef THEME_H #define THEME_H #include typedef enum { THEME_DEFAULT, THEME_LIGHT, THEME_DARK, THEME_HIGHCONTRAST, THEME_CUSTOM, THEME_ZENBURN, THEME_SOLARIZED_LIGHT, THEME_SOLARIZED_DARK, // TODO: THEME_XRESOURCE } THEME; /* Colors for drawing the backgrounds */ extern uint32_t COLOR_BKGRND_MAIN; extern uint32_t COLOR_BKGRND_ALT; extern uint32_t COLOR_BKGRND_AUX; extern uint32_t COLOR_BKGRND_MENU; extern uint32_t COLOR_BKGRND_MENU_HOVER; extern uint32_t COLOR_BKGRND_MENU_ACTIVE; extern uint32_t COLOR_BKGRND_LIST; extern uint32_t COLOR_BKGRND_LIST_HOVER; extern uint32_t COLOR_MAIN_TEXT; extern uint32_t COLOR_MAIN_TEXT_CHAT; extern uint32_t COLOR_MAIN_TEXT_SUBTEXT; extern uint32_t COLOR_MAIN_TEXT_ACTION; extern uint32_t COLOR_MAIN_TEXT_QUOTE; extern uint32_t COLOR_MAIN_TEXT_RED; extern uint32_t COLOR_MAIN_TEXT_URL; extern uint32_t COLOR_MAIN_TEXT_HINT; extern uint32_t COLOR_MSG_USER; extern uint32_t COLOR_MSG_USER_PEND; extern uint32_t COLOR_MSG_USER_ERROR; extern uint32_t COLOR_MSG_CONTACT; extern uint32_t COLOR_MENU_TEXT; extern uint32_t COLOR_MENU_TEXT_SUBTEXT; extern uint32_t COLOR_MENU_TEXT_ACTIVE; extern uint32_t COLOR_LIST_TEXT; extern uint32_t COLOR_LIST_TEXT_SUBTEXT; extern uint32_t COLOR_AUX_EDGE_NORMAL; extern uint32_t COLOR_AUX_EDGE_HOVER; extern uint32_t COLOR_AUX_EDGE_ACTIVE; extern uint32_t COLOR_AUX_TEXT; extern uint32_t COLOR_AUX_ACTIVEOPTION_BKGRND; extern uint32_t COLOR_AUX_ACTIVEOPTION_TEXT; extern uint32_t COLOR_GROUP_SELF; extern uint32_t COLOR_GROUP_PEER; extern uint32_t COLOR_GROUP_AUDIO; extern uint32_t COLOR_GROUP_MUTED; extern uint32_t COLOR_SELECTION_BACKGROUND; extern uint32_t COLOR_SELECTION_TEXT; extern uint32_t COLOR_EDGE_NORMAL; extern uint32_t COLOR_EDGE_ACTIVE; extern uint32_t COLOR_EDGE_HOVER; extern uint32_t COLOR_ACTIVEOPTION_BKGRND; extern uint32_t COLOR_ACTIVEOPTION_TEXT; extern uint32_t COLOR_STATUS_ONLINE; extern uint32_t COLOR_STATUS_AWAY; extern uint32_t COLOR_STATUS_BUSY; extern uint32_t COLOR_BTN_SUCCESS_BKGRND; extern uint32_t COLOR_BTN_SUCCESS_TEXT; extern uint32_t COLOR_BTN_SUCCESS_BKGRND_HOVER; extern uint32_t COLOR_BTN_SUCCESS_TEXT_HOVER; extern uint32_t COLOR_BTN_WARNING_BKGRND; extern uint32_t COLOR_BTN_WARNING_TEXT; extern uint32_t COLOR_BTN_WARNING_BKGRND_HOVER; extern uint32_t COLOR_BTN_WARNING_TEXT_HOVER; extern uint32_t COLOR_BTN_DANGER_BACKGROUND; extern uint32_t COLOR_BTN_DANGER_TEXT; extern uint32_t COLOR_BTN_DANGER_BKGRND_HOVER; extern uint32_t COLOR_BTN_DANGER_TEXT_HOVER; extern uint32_t COLOR_BTN_DISABLED_BKGRND; extern uint32_t COLOR_BTN_DISABLED_TEXT; extern uint32_t COLOR_BTN_DISABLED_BKGRND_HOVER; extern uint32_t COLOR_BTN_DISABLED_TRANSFER; extern uint32_t COLOR_BTN_INPROGRESS_BKGRND; extern uint32_t COLOR_BTN_INPROGRESS_TEXT; extern uint32_t COLOR_BTN_DISABLED_FORGRND; extern uint32_t COLOR_BTN_INPROGRESS_FORGRND; void theme_load(const THEME loadtheme); extern uint32_t status_color[4]; #endif uTox/src/theme.c0000600000175000001440000007447314003056216012552 0ustar rakusers#include "theme.h" #include "debug.h" #include "filesys.h" #include "theme_tables.h" #include "ui.h" #include #include #define COLOR_PROC(a_ulColor) RGB((a_ulColor >> 16) & 0x0000FF, (a_ulColor >> 8) & 0x0000FF, a_ulColor & 0x0000FF) /* Solarized color scheme */ #define SOLAR_BASE03 0x002b36 #define SOLAR_BASE02 0x073642 #define SOLAR_BASE01 0x586e75 #define SOLAR_BASE00 0x657b83 #define SOLAR_BASE0 0x839496 #define SOLAR_BASE1 0x93a1a1 #define SOLAR_BASE2 0xeee8d5 #define SOLAR_BASE3 0xfdf6e3 #define SOLAR_YELLOW 0xb58900 #define SOLAR_ORANGE 0xcb4b16 #define SOLAR_RED 0xdc322f #define SOLAR_MAGENTA 0xd33682 #define SOLAR_VIOLET 0x6c71c4 #define SOLAR_BLUE 0x268bd2 #define SOLAR_CYAN 0x2aa198 #define SOLAR_GREEN 0x859900 uint32_t COLOR_BKGRND_MAIN; uint32_t COLOR_BKGRND_ALT; uint32_t COLOR_BKGRND_AUX; uint32_t COLOR_BKGRND_MENU; uint32_t COLOR_BKGRND_MENU_HOVER; uint32_t COLOR_BKGRND_MENU_ACTIVE; uint32_t COLOR_BKGRND_LIST; uint32_t COLOR_BKGRND_LIST_HOVER; uint32_t COLOR_MAIN_TEXT; uint32_t COLOR_MAIN_TEXT_CHAT; uint32_t COLOR_MAIN_TEXT_SUBTEXT; uint32_t COLOR_MAIN_TEXT_ACTION; uint32_t COLOR_MAIN_TEXT_QUOTE; uint32_t COLOR_MAIN_TEXT_RED; uint32_t COLOR_MAIN_TEXT_URL; uint32_t COLOR_MAIN_TEXT_HINT; uint32_t COLOR_MSG_USER; uint32_t COLOR_MSG_USER_PEND; uint32_t COLOR_MSG_USER_ERROR; uint32_t COLOR_MSG_CONTACT; uint32_t COLOR_MENU_TEXT; uint32_t COLOR_MENU_TEXT_SUBTEXT; uint32_t COLOR_MENU_TEXT_ACTIVE; uint32_t COLOR_LIST_TEXT; uint32_t COLOR_LIST_TEXT_SUBTEXT; uint32_t COLOR_AUX_EDGE_NORMAL; uint32_t COLOR_AUX_EDGE_HOVER; uint32_t COLOR_AUX_EDGE_ACTIVE; uint32_t COLOR_AUX_TEXT; uint32_t COLOR_AUX_ACTIVEOPTION_BKGRND; uint32_t COLOR_AUX_ACTIVEOPTION_TEXT; uint32_t COLOR_GROUP_SELF; uint32_t COLOR_GROUP_PEER; uint32_t COLOR_GROUP_AUDIO; uint32_t COLOR_GROUP_MUTED; uint32_t COLOR_SELECTION_BACKGROUND; uint32_t COLOR_SELECTION_TEXT; uint32_t COLOR_EDGE_NORMAL; uint32_t COLOR_EDGE_ACTIVE; uint32_t COLOR_EDGE_HOVER; uint32_t COLOR_ACTIVEOPTION_BKGRND; uint32_t COLOR_ACTIVEOPTION_TEXT; uint32_t COLOR_STATUS_ONLINE; uint32_t COLOR_STATUS_AWAY; uint32_t COLOR_STATUS_BUSY; uint32_t COLOR_BTN_SUCCESS_BKGRND; uint32_t COLOR_BTN_SUCCESS_TEXT; uint32_t COLOR_BTN_SUCCESS_BKGRND_HOVER; uint32_t COLOR_BTN_SUCCESS_TEXT_HOVER; uint32_t COLOR_BTN_WARNING_BKGRND; uint32_t COLOR_BTN_WARNING_TEXT; uint32_t COLOR_BTN_WARNING_BKGRND_HOVER; uint32_t COLOR_BTN_WARNING_TEXT_HOVER; uint32_t COLOR_BTN_DANGER_BACKGROUND; uint32_t COLOR_BTN_DANGER_TEXT; uint32_t COLOR_BTN_DANGER_BKGRND_HOVER; uint32_t COLOR_BTN_DANGER_TEXT_HOVER; uint32_t COLOR_BTN_DISABLED_BKGRND; uint32_t COLOR_BTN_DISABLED_TEXT; uint32_t COLOR_BTN_DISABLED_BKGRND_HOVER; uint32_t COLOR_BTN_DISABLED_TRANSFER; uint32_t COLOR_BTN_INPROGRESS_BKGRND; uint32_t COLOR_BTN_INPROGRESS_TEXT; uint32_t COLOR_BTN_DISABLED_FORGRND; uint32_t COLOR_BTN_INPROGRESS_FORGRND; uint32_t status_color[4]; /** * Loads a custom theme and sets out to the size of the data * * Returns a pointer to the theme data on success, the caller needs to free this * Returns NULL on failure */ static uint8_t *utox_data_load_custom_theme(size_t *out); static void read_custom_theme(const uint8_t *data, size_t length); static uint32_t try_parse_hex_colour(char *color, bool *error); void theme_load(const THEME loadtheme) { // Update the settings dropdown UI // ==== Default theme ==== // ---- Background Colors ---- COLOR_BKGRND_MAIN = COLOR_PROC(0xffffff); COLOR_BKGRND_ALT = COLOR_PROC(0xaaaaaa); COLOR_BKGRND_AUX = COLOR_PROC(0x313131); COLOR_BKGRND_LIST = COLOR_PROC(0x414141); COLOR_BKGRND_LIST_HOVER = COLOR_PROC(0x505050); COLOR_BKGRND_MENU = COLOR_PROC(0x1c1c1c); COLOR_BKGRND_MENU_HOVER = COLOR_PROC(0x282828); COLOR_BKGRND_MENU_ACTIVE = COLOR_PROC(0x414141); /* ---- Text Colors --- */ COLOR_MAIN_TEXT = COLOR_PROC(0x333333); COLOR_MAIN_TEXT_CHAT = COLOR_PROC(0x000000); COLOR_MAIN_TEXT_SUBTEXT = COLOR_PROC(0x414141); COLOR_MAIN_TEXT_ACTION = COLOR_PROC(0x4e4ec8); COLOR_MAIN_TEXT_QUOTE = COLOR_PROC(0x008000); COLOR_MAIN_TEXT_RED = COLOR_PROC(0xFF0000); COLOR_MAIN_TEXT_URL = COLOR_PROC(0x001fff); COLOR_MAIN_TEXT_HINT = COLOR_PROC(0x969696); /* Message window colors */ COLOR_MSG_USER = COLOR_MAIN_TEXT_SUBTEXT; COLOR_MSG_USER_PEND = COLOR_MAIN_TEXT_ACTION; COLOR_MSG_USER_ERROR = COLOR_MAIN_TEXT_RED; COLOR_MSG_CONTACT = COLOR_MAIN_TEXT; //---- Friend list header and bottom-left buttons ---- COLOR_MENU_TEXT = COLOR_BKGRND_MAIN; COLOR_MENU_TEXT_SUBTEXT = COLOR_PROC(0xd1d1d1); COLOR_MENU_TEXT_ACTIVE = COLOR_BKGRND_MAIN; //---- Friend list ---- COLOR_LIST_TEXT = COLOR_MENU_TEXT; COLOR_LIST_TEXT_SUBTEXT = COLOR_MENU_TEXT_SUBTEXT; //---- Groupchat user list and title ---- COLOR_GROUP_SELF = COLOR_PROC(0x6bc260); COLOR_GROUP_PEER = COLOR_MAIN_TEXT_HINT; COLOR_GROUP_AUDIO = COLOR_PROC(0xc84e4e); COLOR_GROUP_MUTED = COLOR_MAIN_TEXT_ACTION; //---- Text selection ---- COLOR_SELECTION_BACKGROUND = COLOR_MAIN_TEXT; COLOR_SELECTION_TEXT = COLOR_BKGRND_MAIN; //---- Inputs, dropdowns & tooltips ---- COLOR_EDGE_NORMAL = COLOR_PROC(0xc0c0c0); COLOR_EDGE_HOVER = COLOR_PROC(0x969696); COLOR_EDGE_ACTIVE = COLOR_PROC(0x4ea6ea); COLOR_ACTIVEOPTION_BKGRND = COLOR_PROC(0xd1d1d1); COLOR_ACTIVEOPTION_TEXT = COLOR_MAIN_TEXT; //---- Auxiliary style for inputs/dropdowns ("Search friends" bar) ---- COLOR_AUX_EDGE_NORMAL = COLOR_BKGRND_AUX; COLOR_AUX_EDGE_HOVER = COLOR_PROC(0x999999); COLOR_AUX_EDGE_ACTIVE = COLOR_PROC(0x1A73B7); COLOR_AUX_TEXT = COLOR_LIST_TEXT; COLOR_AUX_ACTIVEOPTION_BKGRND = COLOR_BKGRND_LIST_HOVER; COLOR_AUX_ACTIVEOPTION_TEXT = COLOR_AUX_TEXT; //---- Status circles ---- COLOR_STATUS_ONLINE = COLOR_PROC(0x6bc260); COLOR_STATUS_AWAY = COLOR_PROC(0xcebf45); COLOR_STATUS_BUSY = COLOR_PROC(0xc84e4e); //---- Buttons ---- COLOR_BTN_SUCCESS_BKGRND = COLOR_STATUS_ONLINE; COLOR_BTN_SUCCESS_BKGRND_HOVER = COLOR_PROC(0x76d56a); COLOR_BTN_SUCCESS_TEXT = COLOR_BKGRND_MAIN; COLOR_BTN_SUCCESS_TEXT_HOVER = COLOR_BKGRND_MAIN; COLOR_BTN_WARNING_BKGRND = COLOR_STATUS_AWAY; COLOR_BTN_WARNING_BKGRND_HOVER = COLOR_PROC(0xe3d24c); COLOR_BTN_WARNING_TEXT = COLOR_BKGRND_MAIN; COLOR_BTN_WARNING_TEXT_HOVER = COLOR_BKGRND_MAIN; COLOR_BTN_DANGER_BACKGROUND = COLOR_STATUS_BUSY; COLOR_BTN_DANGER_BKGRND_HOVER = COLOR_PROC(0xdc5656); COLOR_BTN_DANGER_TEXT = COLOR_BKGRND_MAIN; COLOR_BTN_DANGER_TEXT_HOVER = COLOR_BKGRND_MAIN; COLOR_BTN_DISABLED_BKGRND = COLOR_PROC(0xd1d1d1); COLOR_BTN_DISABLED_BKGRND_HOVER = COLOR_BKGRND_LIST_HOVER; COLOR_BTN_DISABLED_TEXT = COLOR_BKGRND_MAIN; COLOR_BTN_DISABLED_TRANSFER = COLOR_BKGRND_LIST; COLOR_BTN_DISABLED_FORGRND = COLOR_PROC(0xb3b3b3); COLOR_BTN_INPROGRESS_BKGRND = COLOR_PROC(0x4ea6ea); COLOR_BTN_INPROGRESS_TEXT = COLOR_BKGRND_MAIN; COLOR_BTN_INPROGRESS_FORGRND = COLOR_PROC(0x76baef); switch (loadtheme) { case THEME_DARK: { COLOR_BKGRND_MAIN = COLOR_PROC(0x333333); COLOR_BKGRND_ALT = COLOR_PROC(0x151515); COLOR_BKGRND_LIST = COLOR_PROC(0x222222); COLOR_BKGRND_LIST_HOVER = COLOR_PROC(0x151515); COLOR_BKGRND_MENU = COLOR_PROC(0x171717); COLOR_BKGRND_AUX = COLOR_BKGRND_MENU; COLOR_BKGRND_MENU_HOVER = COLOR_BKGRND_LIST_HOVER; COLOR_BKGRND_MENU_ACTIVE = COLOR_BKGRND_LIST; COLOR_MAIN_TEXT = COLOR_PROC(0xdfdfdf); COLOR_MAIN_TEXT_CHAT = COLOR_PROC(0xffffff); COLOR_MAIN_TEXT_SUBTEXT = COLOR_PROC(0xbbbbbb); COLOR_MAIN_TEXT_ACTION = COLOR_PROC(0x27a9bc); COLOR_MAIN_TEXT_URL = COLOR_MAIN_TEXT_ACTION; COLOR_MAIN_TEXT_QUOTE = COLOR_PROC(0x55b317); COLOR_MSG_USER = COLOR_MAIN_TEXT_SUBTEXT; COLOR_MSG_USER_PEND = COLOR_PROC(0x66ccff); COLOR_MSG_USER_ERROR = COLOR_MAIN_TEXT_RED; COLOR_MSG_CONTACT = COLOR_MAIN_TEXT; COLOR_MENU_TEXT_ACTIVE = COLOR_MAIN_TEXT; COLOR_GROUP_MUTED = COLOR_MAIN_TEXT_URL; COLOR_SELECTION_BACKGROUND = COLOR_MAIN_TEXT; COLOR_SELECTION_TEXT = COLOR_BKGRND_MAIN; COLOR_EDGE_NORMAL = COLOR_PROC(0x555555); COLOR_EDGE_ACTIVE = COLOR_PROC(0x228888); COLOR_EDGE_HOVER = COLOR_PROC(0x999999); COLOR_ACTIVEOPTION_BKGRND = COLOR_PROC(0x228888); COLOR_ACTIVEOPTION_TEXT = COLOR_MAIN_TEXT; COLOR_AUX_EDGE_NORMAL = COLOR_BKGRND_AUX; COLOR_AUX_EDGE_ACTIVE = COLOR_EDGE_ACTIVE; COLOR_AUX_ACTIVEOPTION_BKGRND = COLOR_ACTIVEOPTION_BKGRND; COLOR_BTN_SUCCESS_BKGRND = COLOR_PROC(0x414141); COLOR_BTN_SUCCESS_TEXT = COLOR_PROC(0x33a63d); COLOR_BTN_SUCCESS_BKGRND_HOVER = COLOR_PROC(0x455147); COLOR_BTN_SUCCESS_TEXT_HOVER = COLOR_PROC(0x6eff3a); COLOR_BTN_WARNING_BKGRND = COLOR_PROC(0x414141); COLOR_BTN_WARNING_TEXT = COLOR_PROC(0xbd9e22); COLOR_BTN_WARNING_BKGRND_HOVER = COLOR_PROC(0x4c493c); COLOR_BTN_WARNING_TEXT_HOVER = COLOR_PROC(0xff8d2a); COLOR_BTN_DANGER_BACKGROUND = COLOR_PROC(0x414141); COLOR_BTN_DANGER_TEXT = COLOR_PROC(0xbd2525); COLOR_BTN_DANGER_BKGRND_HOVER = COLOR_PROC(0x513939); COLOR_BTN_DANGER_TEXT_HOVER = COLOR_PROC(0xfa2626); COLOR_BTN_DISABLED_BKGRND = COLOR_PROC(0x414141); COLOR_BTN_DISABLED_TEXT = COLOR_MAIN_TEXT; COLOR_BTN_DISABLED_TRANSFER = COLOR_BTN_DISABLED_TEXT; COLOR_BTN_DISABLED_FORGRND = COLOR_PROC(0x666666); COLOR_BTN_INPROGRESS_BKGRND = COLOR_BTN_DISABLED_BKGRND; COLOR_BTN_INPROGRESS_TEXT = COLOR_MAIN_TEXT_URL; COLOR_BTN_INPROGRESS_FORGRND = COLOR_PROC(0x2f656a); break; } case THEME_LIGHT: { COLOR_BKGRND_AUX = COLOR_PROC(0xe0e0e0); COLOR_BKGRND_LIST = COLOR_PROC(0xf0f0f0); COLOR_BKGRND_LIST_HOVER = COLOR_PROC(0xe0e0e0); COLOR_BKGRND_MENU = COLOR_BKGRND_LIST; COLOR_BKGRND_MENU_HOVER = COLOR_PROC(0xe0e0e0); COLOR_BKGRND_MENU_ACTIVE = COLOR_PROC(0x555555); COLOR_LIST_TEXT = COLOR_MAIN_TEXT; COLOR_LIST_TEXT_SUBTEXT = COLOR_MAIN_TEXT_SUBTEXT; COLOR_MENU_TEXT = COLOR_PROC(0x555555); COLOR_MENU_TEXT_ACTIVE = COLOR_PROC(0xffffff); COLOR_MENU_TEXT_SUBTEXT = COLOR_PROC(0x414141); COLOR_EDGE_NORMAL = COLOR_PROC(0xc0c0c0); COLOR_EDGE_HOVER = COLOR_PROC(0x707070); COLOR_ACTIVEOPTION_BKGRND = COLOR_PROC(0xc2e0ff); COLOR_ACTIVEOPTION_TEXT = COLOR_MAIN_TEXT; COLOR_AUX_EDGE_NORMAL = COLOR_BKGRND_AUX; COLOR_AUX_EDGE_HOVER = COLOR_PROC(0x999999); COLOR_AUX_EDGE_ACTIVE = COLOR_EDGE_ACTIVE; COLOR_AUX_TEXT = COLOR_LIST_TEXT; COLOR_AUX_ACTIVEOPTION_BKGRND = COLOR_ACTIVEOPTION_BKGRND; COLOR_AUX_ACTIVEOPTION_TEXT = COLOR_AUX_TEXT; break; } case THEME_HIGHCONTRAST: { COLOR_BKGRND_MAIN = COLOR_PROC(0xffffff); COLOR_BKGRND_AUX = COLOR_BKGRND_MAIN; COLOR_BKGRND_LIST = COLOR_PROC(0x444444); COLOR_BKGRND_LIST_HOVER = COLOR_PROC(0x000001); COLOR_BKGRND_MENU = COLOR_BKGRND_MAIN; COLOR_BKGRND_MENU_HOVER = COLOR_BKGRND_MAIN; COLOR_BKGRND_MENU_ACTIVE = COLOR_BKGRND_LIST_HOVER; COLOR_MAIN_TEXT = COLOR_PROC(0x000001); COLOR_MAIN_TEXT_CHAT = COLOR_MAIN_TEXT; COLOR_MAIN_TEXT_SUBTEXT = COLOR_MAIN_TEXT; COLOR_MAIN_TEXT_ACTION = COLOR_PROC(0x0000ff); COLOR_MAIN_TEXT_QUOTE = COLOR_PROC(0x00ff00); COLOR_MAIN_TEXT_URL = COLOR_MAIN_TEXT_ACTION; COLOR_MAIN_TEXT_HINT = COLOR_MAIN_TEXT; COLOR_MENU_TEXT = COLOR_MAIN_TEXT; COLOR_MENU_TEXT_SUBTEXT = COLOR_MAIN_TEXT; COLOR_MENU_TEXT_ACTIVE = COLOR_BKGRND_MAIN; COLOR_LIST_TEXT = COLOR_BKGRND_MAIN; COLOR_LIST_TEXT_SUBTEXT = COLOR_BKGRND_MAIN; COLOR_GROUP_SELF = COLOR_PROC(0x00ff00); COLOR_GROUP_PEER = COLOR_MAIN_TEXT_HINT; COLOR_GROUP_AUDIO = COLOR_PROC(0xff0000); COLOR_GROUP_MUTED = COLOR_MAIN_TEXT_URL; COLOR_SELECTION_BACKGROUND = COLOR_MAIN_TEXT; COLOR_SELECTION_TEXT = COLOR_BKGRND_MAIN; COLOR_EDGE_NORMAL = COLOR_MAIN_TEXT; COLOR_EDGE_ACTIVE = COLOR_MAIN_TEXT; COLOR_EDGE_HOVER = COLOR_MAIN_TEXT; COLOR_ACTIVEOPTION_BKGRND = COLOR_MAIN_TEXT; COLOR_ACTIVEOPTION_TEXT = COLOR_BKGRND_MAIN; COLOR_AUX_EDGE_NORMAL = COLOR_EDGE_NORMAL; COLOR_AUX_EDGE_HOVER = COLOR_EDGE_NORMAL; COLOR_AUX_EDGE_ACTIVE = COLOR_EDGE_ACTIVE; COLOR_AUX_TEXT = COLOR_MAIN_TEXT; COLOR_AUX_ACTIVEOPTION_BKGRND = COLOR_ACTIVEOPTION_BKGRND; COLOR_AUX_ACTIVEOPTION_TEXT = COLOR_ACTIVEOPTION_TEXT; COLOR_STATUS_ONLINE = COLOR_PROC(0x00ff00); COLOR_STATUS_AWAY = COLOR_PROC(0xffff00); COLOR_STATUS_BUSY = COLOR_PROC(0xff0000); COLOR_BTN_SUCCESS_BKGRND = COLOR_PROC(0x00ff00); COLOR_BTN_SUCCESS_TEXT = COLOR_BKGRND_MAIN; COLOR_BTN_SUCCESS_BKGRND_HOVER = COLOR_PROC(0x00ff00); COLOR_BTN_SUCCESS_TEXT_HOVER = COLOR_BKGRND_MAIN; COLOR_BTN_WARNING_BKGRND = COLOR_PROC(0xffff00); COLOR_BTN_WARNING_TEXT = COLOR_BKGRND_MAIN; COLOR_BTN_WARNING_BKGRND_HOVER = COLOR_PROC(0xffff00); COLOR_BTN_WARNING_TEXT_HOVER = COLOR_BKGRND_MAIN; COLOR_BTN_DANGER_BACKGROUND = COLOR_PROC(0xff0000); COLOR_BTN_DANGER_TEXT = COLOR_BKGRND_MAIN; COLOR_BTN_DANGER_BKGRND_HOVER = COLOR_PROC(0xff0000); COLOR_BTN_DANGER_TEXT_HOVER = COLOR_BKGRND_MAIN; COLOR_BTN_DISABLED_BKGRND = COLOR_PROC(0x444444); COLOR_BTN_DISABLED_TEXT = COLOR_MAIN_TEXT; COLOR_BTN_DISABLED_TRANSFER = COLOR_BKGRND_MAIN; COLOR_BTN_DISABLED_FORGRND = COLOR_PROC(0x000000); COLOR_BTN_INPROGRESS_TEXT = COLOR_BTN_DISABLED_TEXT; COLOR_BTN_INPROGRESS_BKGRND = COLOR_PROC(0x00ffff); break; } case THEME_ZENBURN: { COLOR_BKGRND_MAIN = COLOR_PROC(0x3f3f3f); COLOR_BKGRND_AUX = COLOR_BKGRND_MAIN; COLOR_BKGRND_LIST = COLOR_PROC(0x5f5f5f); COLOR_BKGRND_LIST_HOVER = COLOR_PROC(0x7f7f7f); COLOR_BKGRND_MENU = COLOR_BKGRND_MAIN; COLOR_BKGRND_MENU_HOVER = COLOR_PROC(0x7f9f7f); COLOR_BKGRND_MENU_ACTIVE = COLOR_BKGRND_MENU_HOVER; COLOR_MAIN_TEXT = COLOR_PROC(0xdcdccc); COLOR_MAIN_TEXT_CHAT = COLOR_MAIN_TEXT; COLOR_MAIN_TEXT_SUBTEXT = COLOR_MAIN_TEXT; COLOR_MAIN_TEXT_ACTION = COLOR_PROC(0xd0bf8f); COLOR_MAIN_TEXT_QUOTE = COLOR_PROC(0x7f9f7f); COLOR_MAIN_TEXT_RED = COLOR_PROC(0xcc9393); COLOR_MAIN_TEXT_URL = COLOR_PROC(0x6ca0a3); COLOR_MAIN_TEXT_HINT = COLOR_MAIN_TEXT; COLOR_MSG_USER = COLOR_MAIN_TEXT; COLOR_MSG_USER_PEND = COLOR_MAIN_TEXT_ACTION; COLOR_MSG_USER_ERROR = COLOR_MAIN_TEXT_RED; COLOR_MSG_CONTACT = COLOR_MAIN_TEXT; COLOR_MENU_TEXT = COLOR_MAIN_TEXT; COLOR_MENU_TEXT_SUBTEXT = COLOR_MAIN_TEXT; COLOR_MENU_TEXT_ACTIVE = COLOR_MAIN_TEXT; COLOR_LIST_TEXT = COLOR_MAIN_TEXT; COLOR_LIST_TEXT_SUBTEXT = COLOR_MAIN_TEXT; COLOR_GROUP_SELF = COLOR_MAIN_TEXT; COLOR_GROUP_PEER = COLOR_MAIN_TEXT; COLOR_GROUP_AUDIO = COLOR_MAIN_TEXT_QUOTE; COLOR_GROUP_MUTED = COLOR_MAIN_TEXT_ACTION; COLOR_SELECTION_BACKGROUND = COLOR_MAIN_TEXT_QUOTE; COLOR_SELECTION_TEXT = COLOR_MAIN_TEXT; COLOR_EDGE_NORMAL = COLOR_BKGRND_LIST; COLOR_EDGE_ACTIVE = COLOR_MAIN_TEXT; COLOR_EDGE_HOVER = COLOR_MAIN_TEXT_QUOTE; COLOR_ACTIVEOPTION_BKGRND = COLOR_MAIN_TEXT_QUOTE; COLOR_ACTIVEOPTION_TEXT = COLOR_MAIN_TEXT; COLOR_AUX_EDGE_NORMAL = COLOR_BKGRND_LIST; COLOR_AUX_EDGE_HOVER = COLOR_MAIN_TEXT_QUOTE; COLOR_AUX_EDGE_ACTIVE = COLOR_MAIN_TEXT; COLOR_AUX_TEXT = COLOR_MAIN_TEXT; COLOR_AUX_ACTIVEOPTION_BKGRND = COLOR_MAIN_TEXT_QUOTE; COLOR_AUX_ACTIVEOPTION_TEXT = COLOR_MAIN_TEXT; COLOR_STATUS_ONLINE = COLOR_MAIN_TEXT_QUOTE; COLOR_STATUS_AWAY = COLOR_MAIN_TEXT_ACTION; COLOR_STATUS_BUSY = COLOR_MAIN_TEXT_RED; COLOR_BTN_SUCCESS_BKGRND = COLOR_MAIN_TEXT_QUOTE; COLOR_BTN_SUCCESS_TEXT = COLOR_MAIN_TEXT; COLOR_BTN_SUCCESS_BKGRND_HOVER = COLOR_PROC(0xbfebbf); COLOR_BTN_SUCCESS_TEXT_HOVER = COLOR_PROC(0xffffff); COLOR_BTN_WARNING_BKGRND = COLOR_MAIN_TEXT_ACTION; COLOR_BTN_WARNING_TEXT = COLOR_BTN_SUCCESS_TEXT_HOVER; COLOR_BTN_WARNING_BKGRND_HOVER = COLOR_PROC(0xf0dfaf); COLOR_BTN_WARNING_TEXT_HOVER = COLOR_BTN_SUCCESS_TEXT_HOVER; COLOR_BTN_DANGER_BACKGROUND = COLOR_STATUS_AWAY; COLOR_BTN_DANGER_TEXT = COLOR_MAIN_TEXT; COLOR_BTN_DANGER_BKGRND_HOVER = COLOR_PROC(0xdca3a3); COLOR_BTN_DANGER_TEXT_HOVER = COLOR_BTN_SUCCESS_TEXT_HOVER; COLOR_BTN_DISABLED_BKGRND = COLOR_BKGRND_LIST; COLOR_BTN_DISABLED_TEXT = COLOR_MAIN_TEXT; COLOR_BTN_DISABLED_BKGRND_HOVER = COLOR_BKGRND_LIST_HOVER; COLOR_BTN_DISABLED_TRANSFER = COLOR_MAIN_TEXT; COLOR_BTN_DISABLED_FORGRND = COLOR_BKGRND_LIST_HOVER; COLOR_BTN_INPROGRESS_BKGRND = COLOR_PROC(0xc1c1a4); COLOR_BTN_INPROGRESS_TEXT = COLOR_BKGRND_MAIN; COLOR_BTN_INPROGRESS_FORGRND = COLOR_MAIN_TEXT; break; } case THEME_SOLARIZED_DARK: { COLOR_BKGRND_MAIN = COLOR_PROC(SOLAR_BASE03); COLOR_BKGRND_ALT = COLOR_PROC(SOLAR_BASE02); COLOR_BKGRND_AUX = COLOR_BKGRND_ALT; COLOR_BKGRND_LIST = COLOR_BKGRND_ALT; COLOR_BKGRND_LIST_HOVER = COLOR_PROC(SOLAR_BASE01); COLOR_BKGRND_MENU = COLOR_PROC(SOLAR_BASE03); COLOR_BKGRND_MENU_HOVER = COLOR_PROC(SOLAR_CYAN); COLOR_BKGRND_MENU_ACTIVE = COLOR_BKGRND_ALT; COLOR_MAIN_TEXT = COLOR_PROC(SOLAR_BASE2); COLOR_MAIN_TEXT_CHAT = COLOR_MAIN_TEXT; COLOR_MAIN_TEXT_SUBTEXT = COLOR_PROC(SOLAR_BASE1); COLOR_MAIN_TEXT_ACTION = COLOR_PROC(SOLAR_BASE3); COLOR_MAIN_TEXT_QUOTE = COLOR_MAIN_TEXT_SUBTEXT; COLOR_MAIN_TEXT_RED = COLOR_PROC(SOLAR_RED); COLOR_MAIN_TEXT_URL = COLOR_PROC(SOLAR_MAGENTA); COLOR_MAIN_TEXT_HINT = COLOR_PROC(SOLAR_VIOLET); COLOR_MSG_USER = COLOR_MAIN_TEXT_SUBTEXT; COLOR_MSG_USER_PEND = COLOR_MAIN_TEXT_ACTION; COLOR_MSG_USER_ERROR = COLOR_MAIN_TEXT_RED; COLOR_MSG_CONTACT = COLOR_MAIN_TEXT; COLOR_MENU_TEXT = COLOR_MAIN_TEXT; COLOR_MENU_TEXT_SUBTEXT = COLOR_MAIN_TEXT_SUBTEXT; COLOR_MENU_TEXT_ACTIVE = COLOR_MAIN_TEXT; COLOR_LIST_TEXT = COLOR_MAIN_TEXT; COLOR_LIST_TEXT_SUBTEXT = COLOR_MAIN_TEXT_SUBTEXT; COLOR_GROUP_SELF = COLOR_PROC(SOLAR_GREEN); COLOR_GROUP_PEER = COLOR_MAIN_TEXT_HINT; COLOR_GROUP_AUDIO = COLOR_PROC(SOLAR_RED); COLOR_GROUP_MUTED = COLOR_MAIN_TEXT_ACTION; COLOR_SELECTION_BACKGROUND = COLOR_MAIN_TEXT; COLOR_SELECTION_TEXT = COLOR_BKGRND_MAIN; COLOR_EDGE_NORMAL = COLOR_PROC(SOLAR_VIOLET); COLOR_EDGE_HOVER = COLOR_PROC(SOLAR_BLUE); COLOR_EDGE_ACTIVE = COLOR_PROC(SOLAR_ORANGE); COLOR_ACTIVEOPTION_BKGRND = COLOR_BKGRND_LIST_HOVER; COLOR_ACTIVEOPTION_TEXT = COLOR_MAIN_TEXT; COLOR_AUX_EDGE_NORMAL = COLOR_BKGRND_AUX; COLOR_AUX_EDGE_HOVER = COLOR_PROC(SOLAR_VIOLET); COLOR_AUX_EDGE_ACTIVE = COLOR_PROC(SOLAR_CYAN); COLOR_AUX_TEXT = COLOR_LIST_TEXT; COLOR_AUX_ACTIVEOPTION_BKGRND = COLOR_BKGRND_LIST_HOVER; COLOR_AUX_ACTIVEOPTION_TEXT = COLOR_AUX_TEXT; COLOR_STATUS_ONLINE = COLOR_PROC(SOLAR_GREEN); COLOR_STATUS_AWAY = COLOR_PROC(SOLAR_YELLOW); COLOR_STATUS_BUSY = COLOR_PROC(SOLAR_RED); COLOR_BTN_SUCCESS_BKGRND = COLOR_STATUS_ONLINE; COLOR_BTN_SUCCESS_TEXT = COLOR_MAIN_TEXT; COLOR_BTN_SUCCESS_BKGRND_HOVER = COLOR_PROC(SOLAR_CYAN); COLOR_BTN_SUCCESS_TEXT_HOVER = COLOR_BKGRND_MAIN; COLOR_BTN_WARNING_BKGRND = COLOR_STATUS_AWAY; COLOR_BTN_WARNING_TEXT = COLOR_MAIN_TEXT; COLOR_BTN_WARNING_BKGRND_HOVER = COLOR_PROC(SOLAR_ORANGE); COLOR_BTN_WARNING_TEXT_HOVER = COLOR_BKGRND_MAIN; COLOR_BTN_DANGER_BACKGROUND = COLOR_STATUS_BUSY; COLOR_BTN_DANGER_TEXT = COLOR_MAIN_TEXT; COLOR_BTN_DANGER_BKGRND_HOVER = COLOR_PROC(SOLAR_MAGENTA); COLOR_BTN_DANGER_TEXT_HOVER = COLOR_BKGRND_MAIN; COLOR_BTN_DISABLED_BKGRND = COLOR_PROC(SOLAR_BASE00); COLOR_BTN_DISABLED_TEXT = COLOR_BKGRND_MAIN; COLOR_BTN_DISABLED_BKGRND_HOVER = COLOR_BKGRND_LIST_HOVER; COLOR_BTN_DISABLED_TRANSFER = COLOR_BKGRND_LIST; COLOR_BTN_DISABLED_FORGRND = COLOR_PROC(SOLAR_ORANGE); COLOR_BTN_INPROGRESS_FORGRND = COLOR_PROC(SOLAR_MAGENTA); COLOR_BTN_INPROGRESS_BKGRND = COLOR_PROC(SOLAR_VIOLET); COLOR_BTN_INPROGRESS_TEXT = COLOR_BKGRND_MAIN; break; } case THEME_SOLARIZED_LIGHT: { COLOR_BKGRND_MAIN = COLOR_PROC(SOLAR_BASE3); COLOR_BKGRND_ALT = COLOR_PROC(SOLAR_BASE2); COLOR_BKGRND_AUX = COLOR_BKGRND_ALT; COLOR_BKGRND_LIST = COLOR_BKGRND_ALT; COLOR_BKGRND_LIST_HOVER = COLOR_PROC(SOLAR_BASE1); COLOR_BKGRND_MENU = COLOR_BKGRND_ALT; COLOR_BKGRND_MENU_HOVER = COLOR_PROC(SOLAR_CYAN); COLOR_BKGRND_MENU_ACTIVE = COLOR_BKGRND_ALT; COLOR_MAIN_TEXT = COLOR_PROC(SOLAR_BASE02); COLOR_MAIN_TEXT_CHAT = COLOR_MAIN_TEXT; COLOR_MAIN_TEXT_SUBTEXT = COLOR_PROC(SOLAR_BASE01); COLOR_MAIN_TEXT_ACTION = COLOR_PROC(SOLAR_BASE03); COLOR_MAIN_TEXT_QUOTE = COLOR_MAIN_TEXT_SUBTEXT; COLOR_MAIN_TEXT_RED = COLOR_PROC(SOLAR_RED); COLOR_MAIN_TEXT_URL = COLOR_PROC(SOLAR_MAGENTA); COLOR_MAIN_TEXT_HINT = COLOR_PROC(SOLAR_VIOLET); COLOR_MSG_USER = COLOR_MAIN_TEXT_SUBTEXT; COLOR_MSG_USER_PEND = COLOR_MAIN_TEXT_ACTION; COLOR_MSG_USER_ERROR = COLOR_MAIN_TEXT_RED; COLOR_MSG_CONTACT = COLOR_MAIN_TEXT; COLOR_MENU_TEXT = COLOR_MAIN_TEXT; COLOR_MENU_TEXT_SUBTEXT = COLOR_MAIN_TEXT_SUBTEXT; COLOR_MENU_TEXT_ACTIVE = COLOR_MAIN_TEXT; COLOR_LIST_TEXT = COLOR_MAIN_TEXT; COLOR_LIST_TEXT_SUBTEXT = COLOR_MAIN_TEXT_SUBTEXT; COLOR_GROUP_SELF = COLOR_PROC(SOLAR_GREEN); COLOR_GROUP_PEER = COLOR_MAIN_TEXT_HINT; COLOR_GROUP_AUDIO = COLOR_PROC(SOLAR_RED); COLOR_GROUP_MUTED = COLOR_MAIN_TEXT_ACTION; COLOR_SELECTION_BACKGROUND = COLOR_MAIN_TEXT; COLOR_SELECTION_TEXT = COLOR_BKGRND_MAIN; COLOR_EDGE_NORMAL = COLOR_PROC(SOLAR_VIOLET); COLOR_EDGE_HOVER = COLOR_PROC(SOLAR_BLUE); COLOR_EDGE_ACTIVE = COLOR_PROC(SOLAR_CYAN); COLOR_ACTIVEOPTION_BKGRND = COLOR_BKGRND_LIST_HOVER; COLOR_ACTIVEOPTION_TEXT = COLOR_MAIN_TEXT; COLOR_AUX_EDGE_NORMAL = COLOR_BKGRND_AUX; COLOR_AUX_EDGE_HOVER = COLOR_PROC(SOLAR_VIOLET); COLOR_AUX_EDGE_ACTIVE = COLOR_PROC(SOLAR_CYAN); COLOR_AUX_TEXT = COLOR_LIST_TEXT; COLOR_AUX_ACTIVEOPTION_BKGRND = COLOR_BKGRND_LIST_HOVER; COLOR_AUX_ACTIVEOPTION_TEXT = COLOR_AUX_TEXT; COLOR_STATUS_ONLINE = COLOR_PROC(SOLAR_GREEN); COLOR_STATUS_AWAY = COLOR_PROC(SOLAR_YELLOW); COLOR_STATUS_BUSY = COLOR_PROC(SOLAR_RED); COLOR_BTN_SUCCESS_BKGRND = COLOR_STATUS_ONLINE; COLOR_BTN_SUCCESS_TEXT = COLOR_MAIN_TEXT; COLOR_BTN_SUCCESS_BKGRND_HOVER = COLOR_PROC(SOLAR_CYAN); COLOR_BTN_SUCCESS_TEXT_HOVER = COLOR_BKGRND_MAIN; COLOR_BTN_WARNING_BKGRND = COLOR_STATUS_AWAY; COLOR_BTN_WARNING_TEXT = COLOR_MAIN_TEXT; COLOR_BTN_WARNING_BKGRND_HOVER = COLOR_PROC(SOLAR_ORANGE); COLOR_BTN_WARNING_TEXT_HOVER = COLOR_BKGRND_MAIN; COLOR_BTN_DANGER_BACKGROUND = COLOR_STATUS_BUSY; COLOR_BTN_DANGER_TEXT = COLOR_MAIN_TEXT; COLOR_BTN_DANGER_BKGRND_HOVER = COLOR_PROC(SOLAR_MAGENTA); COLOR_BTN_DANGER_TEXT_HOVER = COLOR_BKGRND_MAIN; COLOR_BTN_DISABLED_BKGRND = COLOR_PROC(SOLAR_BASE0); COLOR_BTN_DISABLED_TEXT = COLOR_BKGRND_MAIN; COLOR_BTN_DISABLED_BKGRND_HOVER = COLOR_BKGRND_LIST_HOVER; COLOR_BTN_DISABLED_TRANSFER = COLOR_BKGRND_LIST; COLOR_BTN_DISABLED_FORGRND = COLOR_PROC(SOLAR_ORANGE); COLOR_BTN_INPROGRESS_BKGRND = COLOR_PROC(SOLAR_VIOLET); COLOR_BTN_INPROGRESS_TEXT = COLOR_BKGRND_MAIN; COLOR_BTN_INPROGRESS_FORGRND = COLOR_PROC(SOLAR_MAGENTA); break; } case THEME_CUSTOM: { size_t size; uint8_t *themedata = utox_data_load_custom_theme(&size); if (!themedata) { return; } read_custom_theme(themedata, size); free(themedata); break; } case THEME_DEFAULT: { // Set above the switch. break; } } status_color[0] = COLOR_STATUS_ONLINE; status_color[1] = COLOR_STATUS_AWAY; status_color[2] = COLOR_STATUS_BUSY; status_color[3] = COLOR_STATUS_BUSY; } uint32_t *find_colour_pointer(char *color) { while (*color == 0 || *color == ' ' || *color == '\t') { ++color; } for (int l = strlen(color) - 1; l > 0; --l) { if (color[l] != ' ' && color[l] != '\t') { color[l + 1] = '\0'; break; } } // Skip past "COLOR_" prefix if (!strncmp(color, "COLOR_", 6)) { color += 6; } LOG_INFO("Theme", "Color: %s" , color); for (int i = 0;; ++i) { const char *s = COLOUR_NAME_TABLE[i]; if (!s) { break; } if (!strcmp(color, s)) { return COLOUR_POINTER_TABLE[i]; } } return NULL; } static uint32_t try_parse_hex_colour(char *color, bool *error) { while (*color == 0 || *color == ' ' || *color == '\t') { color++; } for (int l = strlen(color) - 1; l > 0; --l) { if (color[l] != ' ' && color[l] != '\n') { color[++l] = '\0'; if (l != 6) { *error = true; return 0; } break; } } char hex[3] = { 0 }; memcpy(hex, color, 2); unsigned char red = strtol(hex, NULL, 16); memcpy(hex, color + 2, 2); unsigned char green = strtol(hex, NULL, 16); memcpy(hex, color + 4, 2); unsigned char blue = strtol(hex, NULL, 16); return RGB(red, green, blue); } static void read_custom_theme(const uint8_t *data, size_t length) { while (length) { char *line = (char *)data; while (*line != 0) { if (*line == '#') { *line = 0; break; } ++line; --length; } char *color = strpbrk(line, "="); if (!color || color == line) { continue; } *color++ = 0; uint32_t *colorp = find_colour_pointer(line); if (!colorp) { continue; } bool err = false; const uint32_t col = try_parse_hex_colour(color, &err); if (err) { LOG_ERR("Theme", "Error: Parsing hex color failed."); continue; } else { *colorp = COLOR_PROC(col); } } } static uint8_t *utox_data_load_custom_theme(size_t *out) { FILE *fp = utox_get_file("utox_theme.ini", out, UTOX_FILE_OPTS_READ); if (fp == NULL) { LOG_ERR("Theme", "Failed to open custom theme file."); return NULL; } uint8_t *data = calloc(1, *out + 1); if (data == NULL) { LOG_ERR("Theme", "Failed to allocate memory for custom theme."); fclose(fp); return NULL; } if (fread(data, *out, 1, fp) != 1) { LOG_ERR("Theme", "Could not read custom theme from file."); fclose(fp); free(data); return NULL; } fclose(fp); return data; } uTox/src/text.h0000600000175000001440000000337214003056216012427 0ustar rakusers#ifndef TEXT_H #define TEXT_H #include #include /** convert number of bytes to human readable string * returns number of characters written * notes: dest MUST be at least size characters large */ int sprint_humanread_bytes(char *dest, unsigned int size, uint64_t bytes); /** length of a utf-8 character * returns the size of the character in bytes * returns -1 if the size of the character is greater than len or if the character is invalid */ uint8_t utf8_len(const char *data); /* read the character into ch */ uint8_t utf8_len_read(const char *data, uint32_t *ch); /* backwards length */ uint8_t utf8_unlen(char *data); /* remove invalid characters from utf8 string * returns the new length after invalid characters have been removed */ int utf8_validate(const uint8_t *data, int len); uint8_t unicode_to_utf8_len(uint32_t ch); void unicode_to_utf8(uint32_t ch, char *dst); /* compare first n bytes of s1 and s2, ignoring the case of alpha chars * match: returns 0 * no match: returns 1 * notes: n must be <= length of s1 and <= length of s2 */ bool memcmp_case(const char *s1, const char *s2, uint32_t n); /* replace html entities (<,>,&) with html */ char *tohtml(const char *str, uint16_t len); void to_hex(char *out, uint8_t *in, int size); /* returns non-zero if substring is found */ bool strstr_case(const char *a, const char *b); /** * @brief Shrink UTF-8 string down to provided length * without splitting last UTF-8 multi-bytes character. * * @param string UTF-8 string to shrink. * @param string_length Length of UTF-8 string. * @param shrink_length Desirable length of shrunk string. * @return shrunk length. */ uint16_t safe_shrink(const char *string, uint16_t string_length, uint16_t shrink_length); #endif uTox/src/text.c0000600000175000001440000001634014003056216012421 0ustar rakusers#include "text.h" #include "macros.h" #include #include #include #include #include /* returns the length of the string written to `dest` */ int sprint_humanread_bytes(char *dest, unsigned int size, uint64_t bytes) { char * str[] = { "B", "KiB", "MiB", "GiB", "TiB", "PiB", "EiB", "ZiB", "YiB" }; int max_id = COUNTOF(str) - 1; int i = 0; double f = bytes; while ((bytes >= 1024) && (i < max_id)) { bytes /= 1024; f /= 1024.0; i++; } size_t r; r = snprintf((char *)dest, size, "[%" PRIu64, bytes); if (r >= size) { // truncated r = size - 1; } else { // missing decimals r += snprintf((char *)dest + r, size - r, " %s]", str[i]); if (r >= size) { // truncated r = size - 1; } } return r; } uint8_t utf8_len(const char *data) { if (!(*data & 0x80)) { return 1; } uint8_t bytes = 1, i; for (i = 6; i != 0xFF; i--) { if (!((*data >> i) & 1)) { break; } bytes++; } // no validation, instead validate all utf8 when received return bytes; } uint8_t utf8_len_read(const char *data, uint32_t *ch) { uint8_t a = data[0]; if (!(a & 0x80)) { *ch = data[0]; return 1; } if (!(a & 0x20)) { *ch = ((data[0] & 0x1F) << 6) | (data[1] & 0x3F); return 2; } if (!(a & 0x10)) { *ch = ((data[0] & 0xF) << 12) | ((data[1] & 0x3F) << 6) | (data[2] & 0x3F); return 3; } if (!(a & 8)) { *ch = ((data[0] & 0x7) << 18) | ((data[1] & 0x3F) << 12) | ((data[2] & 0x3F) << 6) | (data[3] & 0x3F); return 4; } if (!(a & 4)) { *ch = ((data[0] & 0x3) << 24) | ((data[1] & 0x3F) << 18) | ((data[2] & 0x3F) << 12) | ((data[3] & 0x3F) << 6) | (data[4] & 0x3F); return 5; } if (!(a & 2)) { *ch = ((data[0] & 0x1) << 30) | ((data[1] & 0x3F) << 24) | ((data[2] & 0x3F) << 18) | ((data[3] & 0x3F) << 12) | ((data[4] & 0x3F) << 6) | (data[5] & 0x3F); return 6; } // never happen return 0; } uint8_t utf8_unlen(char *data) { uint8_t len = 1; if (*(data - 1) & 0x80) { do { len++; } while (!(*(data - len) & 0x40)); } return len; } /* I've had some issues with this function in the past when it's given malformed data. * irungentoo has previouslly said, it'll never fail when given a valid utf-8 string, however the * utf8 standard says that applications are required to handle and correctlly respond to malformed * strings as they have been used in the past to create security expliots. This function is known to * enter an endless state, or segv on bad strings. Either way, that's bad and needs to be fixed. * TODO(grayhatter) TODO(anyone) */ int utf8_validate(const uint8_t *data, int len) { // stops when an invalid character is reached const uint8_t *a = data, *end = data + len; while (a != end) { if (!(*a & 0x80)) { a++; continue; } uint8_t bytes = 1, i; for (i = 6; i != 0xFF; i--) { if (!((*a >> i) & 1)) { break; } bytes++; } if (bytes == 1 || bytes == 8) { break; } // Validate the utf8 if (a + bytes > end) { break; } for (i = 1; i < bytes; i++) { if (!(a[i] & 0x80) || (a[i] & 0x40)) { return a - data; } } a += bytes; } return a - data; } uint8_t unicode_to_utf8_len(uint32_t ch) { if (ch > 0x1FFFFF) { return 0; } return 4 - (ch <= 0xFFFF) - (ch <= 0x7FF) - (ch <= 0x7F); } void unicode_to_utf8(uint32_t ch, char *dst) { uint32_t HB = (uint32_t)0x80; uint32_t SB = (uint32_t)0x3F; if (ch <= 0x7F) { dst[0] = (uint8_t)ch; return; // 1; } if (ch <= 0x7FF) { dst[0] = (uint8_t)((ch >> 6) | (uint32_t)0xC0); dst[1] = (uint8_t)((ch & SB) | HB); return; // 2; } if (ch <= 0xFFFF) { dst[0] = (uint8_t)((ch >> 12) | (uint32_t)0xE0); dst[1] = (uint8_t)(((ch >> 6) & SB) | HB); dst[2] = (uint8_t)((ch & SB) | HB); return; // 3; } if (ch <= 0x1FFFFF) { dst[0] = (uint8_t)((ch >> 18) | (uint32_t)0xF0); dst[1] = (uint8_t)(((ch >> 12) & SB) | HB); dst[2] = (uint8_t)(((ch >> 6) & SB) | HB); dst[3] = (uint8_t)((ch & SB) | HB); return; // 4; } return; // 0; } bool memcmp_case(const char *s1, const char *s2, uint32_t n) { uint32_t i; for (i = 0; i < n; i++) { char c1, c2; c1 = s1[i]; c2 = s2[i]; if (c1 >= (char)'a' && c1 <= (char)'z') { c1 += ('A' - 'a'); } if (c2 >= (char)'a' && c2 <= (char)'z') { c2 += ('A' - 'a'); } if (c1 != c2) { return 1; } } return 0; } char *tohtml(const char *str, uint16_t length) { uint16_t i = 0; int len = 0; while (i != length) { switch (str[i]) { case '<': case '>': { len += 3; break; } case '&': { len += 4; break; } } i += utf8_len(str + i); } char *out = malloc(length + len + 1); i = 0; len = 0; while (i != length) { switch (str[i]) { case '<': case '>': { memcpy(out + len, str[i] == '>' ? ">" : "<", 4); len += 4; i++; break; } case '&': { memcpy(out + len, "&", 5); len += 5; i++; break; } default: { uint16_t r = utf8_len(str + i); memcpy(out + len, str + i, r); len += r; i += r; break; } } } out[len] = 0; return out; } void to_hex(char *out, uint8_t *in, int size) { while (size--) { if (*in >> 4 < 0xA) { *out++ = '0' + (*in >> 4); } else { *out++ = 'A' + (*in >> 4) - 0xA; } if ((*in & 0xf) < 0xA) { *out++ = '0' + (*in & 0xF); } else { *out++ = 'A' + (*in & 0xF) - 0xA; } in++; } } bool strstr_case(const char *a, const char *b) { const char *c = b; while (*a) { if (tolower(*a) != tolower(*c)) { c = b; } if (tolower(*a) == tolower(*c)) { c++; if (!*c) { return 1; } } a++; } return 0; } uint16_t safe_shrink(const char *string, uint16_t string_length, uint16_t shrink_length) { if (!string) { return 0; } uint16_t length = 0; while (length < string_length) { uint8_t char_length = utf8_len(&string[length]); length += char_length; if (length >= shrink_length) { length -= char_length; break; } } return length; } uTox/src/sized_string.h0000600000175000001440000000034514003056216014144 0ustar rakusers#ifndef SIZED_STRING_H #define SIZED_STRING_H #include typedef struct sized_string { char *str; uint16_t length; } STRING; #define STRING_INIT(x) \ { .str = (char *)x, .length = sizeof(x) - 1 } #endif uTox/src/shared/0000700000175000001440000000000014003056216012531 5ustar rakusersuTox/src/shared/freetype-text.c0000600000175000001440000000353114003056216015506 0ustar rakusers#include #include void drawtext(int x, int y, const char *str, uint16_t length) { _drawtext(x, INT_MAX, y, str, length); } int drawtext_getwidth(int x, int y, const char *str, uint16_t length) { return _drawtext(x, INT_MAX, y, str, length) - x; } void drawtextrange(int x, int xmax, int y, const char *str, uint16_t length) { x = _drawtext(x, xmax, y, str, length); if (x < 0) { _drawtext(-x, INT_MAX, y, (char *)"...", 3); } } void drawtextwidth(int x, int width, int y, const char *str, uint16_t length) { drawtextrange(x, x + width, y, str, length); } int textwidth(const char *str, uint16_t length) { int x = 0; while (length) { uint32_t ch; const uint8_t len = utf8_len_read(str, &ch); str += len; length -= len; const GLYPH *g = font_getglyph(sfont, ch); if (g) { x += g->xadvance; } } return x; } void drawtextwidth_right(int x, int width, int y, const char *str, uint16_t length) { const int w = textwidth(str, length); if (w <= width) { drawtext(x + width - w, y, str, length); } else { drawtextrange(x, x + width, y, str, length); } } // FIXME: The next two functions are identical. Delete one? int textfit(const char *str, uint16_t length, int width) { int x = 0; uint16_t i = 0; while (i != length) { uint32_t ch; const uint8_t len = utf8_len_read(str, &ch); str += len; const GLYPH *g = font_getglyph(sfont, ch); if (g) { x += g->xadvance; if (x > width) { return i; } } i += len; } return length; } int textfit_near(const char *str, uint16_t length, int width) { return textfit(str, length, width); } void setfont(int id) { sfont = &font[id]; } uTox/src/settings.h0000600000175000001440000000357014003056216013303 0ustar rakusers#ifndef SETTINGS_H #define SETTINGS_H #include "debug.h" #include "../langs/i18n_decls.h" #include #include #include /* House keeping for uTox save file. */ #define UTOX_SAVE_VERSION 4 #define DEFAULT_FPS 25 typedef struct utox_settings { uint8_t save_version; uint32_t last_version; uint32_t utox_last_version; bool show_splash; // Tox level settings bool block_friend_requests; bool save_encryption; // User interface settings UTOX_LANG language; bool audio_filtering_enabled; bool push_to_talk; bool audio_preview; bool video_preview; bool no_typing_notifications; bool inline_video; bool use_long_time_msg; bool accept_inline_images; // UX Settings bool logging_enabled; bool close_to_tray; bool start_in_tray; bool auto_startup; bool use_mini_flist; bool filter; bool magic_flist_enabled; // Notifications / Alerts bool audible_notifications_enabled; bool status_notifications; uint8_t group_notifications; uint16_t audio_device_out; uint16_t audio_device_in; uint8_t video_fps; LOG_LVL verbose; FILE * debug_file; uint32_t theme; uint8_t scale; // OS interface settings uint32_t window_x; uint32_t window_y; uint32_t window_height; uint32_t window_width; uint32_t window_baseline; bool window_maximized; // Low level settings (network, profile, portable-mode) bool portable_mode; bool disableudp; bool enableipv6; bool proxyenable; bool force_proxy; uint16_t proxy_port; uint8_t proxy_ip[255]; /* coincides with TOX_MAX_HOSTNAME_LENGTH from toxcore */ } SETTINGS; extern SETTINGS settings; /* * Loads settings from disk */ void config_load(void); /* * Writes settings to disk */ void config_save(void); #endif uTox/src/settings.c0000600000175000001440000004313114003056216013273 0ustar rakusers#include "settings.h" #include "debug.h" #include "flist.h" #include "groups.h" #include "tox.h" // TODO do we want to include the UI headers here? // Or would it be better to supply a callback after settings are loaded? #include "ui/edit.h" #include "ui/switch.h" #include "ui/dropdown.h" #include "layout/settings.h" #include "native/filesys.h" #include "native/keyboard.h" // UTOX_VERSION_NUMBER, MAIN_HEIGHT, MAIN_WIDTH, all save things.. #include "main.h" #include #include #include #define MATCH(x, y) (strcasecmp(x, y) == 0) #define BOOL_TO_STR(b) b ? "true" : "false" #define STR_TO_BOOL(s) (strcasecmp(s, "true") == 0) #define NAMEOF(s) strchr((const char *)(#s), '>') == NULL \ ? #s : (strchr((const char *)(#s), '>') + 1) static const char *config_file_name = "utox_save.ini"; /** * Config section names. */ typedef enum { GENERAL_SECTION, INTERFACE_SECTION, AV_SECTION, NOTIFICATIONS_SECTION, ADVANCED_SECTION, UNKNOWN_SECTION } CONFIG_SECTION; static const char *config_sections[UNKNOWN_SECTION + 1] = { "general", "interface", "av", "notifications", "advanced", NULL }; SETTINGS settings = { .last_version = UTOX_VERSION_NUMBER, .utox_last_version = UTOX_VERSION_NUMBER, .show_splash = false, // Tox level settings .block_friend_requests = false, .save_encryption = true, // User interface settings .language = LANG_EN, .audio_filtering_enabled = true, .push_to_talk = false, .audio_preview = false, .video_preview = false, .no_typing_notifications = true, .use_long_time_msg = true, .accept_inline_images = true, // UX Settings .logging_enabled = true, .close_to_tray = false, .start_in_tray = false, .auto_startup = false, .use_mini_flist = false, .magic_flist_enabled = false, // Notifications / Alerts .audible_notifications_enabled = true, .status_notifications = true, .group_notifications = GNOTIFY_ALWAYS, .audio_device_out = 0, .audio_device_in = 0, .video_fps = DEFAULT_FPS, .verbose = LOG_LVL_ERROR, .debug_file = NULL, .theme = UINT32_MAX, // OS interface settings .window_x = 0, .window_y = 0, .window_height = MAIN_HEIGHT, .window_width = MAIN_WIDTH, .window_baseline = 0, .window_maximized = false, // Low level settings (network, profile, portable-mode) .disableudp = false, .enableipv6 = true, .proxyenable = false, .force_proxy = false, .proxy_port = 0, }; static void write_config_value_int(const char *filename, const char *section, const char *key, const long value) { if (ini_putl(section, key, value, filename) != 1) { LOG_ERR("Settings", "Unable to save config value: %lu.", value); } } #define WRITE_CONFIG_VALUE_INT(SECTION, VALUE) \ write_config_value_int(config_path, config_sections[SECTION], \ NAMEOF(VALUE), VALUE) static void write_config_value_str(const char *filename, const char *section, const char *key, const char *value) { if (ini_puts(section, key, value, filename) != 1) { LOG_ERR("Settings", "Unable to save config value: %s.", value); } } #define WRITE_CONFIG_VALUE_STR(SECTION, VALUE) \ write_config_value_str(config_path, config_sections[SECTION], \ NAMEOF(VALUE), (const char *)VALUE) static void write_config_value_bool(const char *filename, const char *section, const char *key, const bool value) { if (ini_puts(section, key, BOOL_TO_STR(value), filename) != 1) { LOG_ERR("Settings", "Unable to save config value: %s.", value); } } #define WRITE_CONFIG_VALUE_BOOL(SECTION, VALUE) \ write_config_value_bool(config_path, config_sections[SECTION], \ NAMEOF(VALUE), VALUE) static CONFIG_SECTION get_section(const char *section) { if (MATCH(config_sections[GENERAL_SECTION], section)) { return GENERAL_SECTION; } else if (MATCH(config_sections[INTERFACE_SECTION], section)) { return INTERFACE_SECTION; } else if (MATCH(config_sections[AV_SECTION], section)) { return AV_SECTION; } else if (MATCH(config_sections[NOTIFICATIONS_SECTION], section)) { return NOTIFICATIONS_SECTION; } else if (MATCH(config_sections[ADVANCED_SECTION], section)) { return ADVANCED_SECTION; } else { return UNKNOWN_SECTION; } } static void parse_general_section(SETTINGS *config, const char *key, const char *value) { if (MATCH(NAMEOF(config->save_version), key)) { config->save_version = atoi(value); } else if (MATCH(NAMEOF(config->utox_last_version), key)) { config->utox_last_version = atoi(value); } } static void parse_interface_section(SETTINGS *config, const char *key, const char *value) { if (MATCH(NAMEOF(config->language), key)) { config->language = atoi(value); } else if (MATCH(NAMEOF(config->window_x), key)) { config->window_x = atoi(value); } else if (MATCH(NAMEOF(config->window_y), key)) { config->window_y = atoi(value); } else if (MATCH(NAMEOF(config->window_width), key)) { config->window_width = atoi(value); } else if (MATCH(NAMEOF(config->window_height), key)) { config->window_height = atoi(value); } else if (MATCH(NAMEOF(config->theme), key)) { // Allow users to override theme on the cmdline. if (config->theme == UINT32_MAX) { config->theme = atoi(value); } } else if (MATCH(NAMEOF(config->scale), key)) { config->scale = atoi(value); } else if (MATCH(NAMEOF(config->logging_enabled), key)) { config->logging_enabled = STR_TO_BOOL(value); } else if (MATCH(NAMEOF(config->close_to_tray), key)) { config->close_to_tray = STR_TO_BOOL(value); } else if (MATCH(NAMEOF(config->start_in_tray), key)) { config->start_in_tray = STR_TO_BOOL(value); } else if (MATCH(NAMEOF(config->auto_startup), key)) { config->auto_startup = STR_TO_BOOL(value); } else if (MATCH(NAMEOF(config->use_mini_flist), key)) { config->use_mini_flist = STR_TO_BOOL(value); } else if (MATCH(NAMEOF(config->filter), key)) { config->filter = STR_TO_BOOL(value); } else if (MATCH(NAMEOF(config->magic_flist_enabled), key)) { config->magic_flist_enabled = STR_TO_BOOL(value); } else if (MATCH(NAMEOF(config->use_long_time_msg), key)) { config->use_long_time_msg = STR_TO_BOOL(value); } } static void parse_av_section(SETTINGS *config, const char *key, const char *value) { if (MATCH(NAMEOF(config->push_to_talk), key)) { config->push_to_talk = STR_TO_BOOL(value); } else if (MATCH(NAMEOF(config->audio_filtering_enabled), key)) { config->audio_filtering_enabled = STR_TO_BOOL(value); } else if (MATCH(NAMEOF(config->audio_device_in), key)) { config->audio_device_in = atoi(value); } else if (MATCH(NAMEOF(config->audio_device_out), key)) { config->audio_device_out = atoi(value); } else if (MATCH(NAMEOF(config->video_fps), key)) { char *temp; uint16_t value_fps = strtol((char *)value, &temp, 0); if (*temp == '\0' && value_fps >= 1 && value_fps <= UINT8_MAX) { settings.video_fps = value_fps; return; } LOG_WARN("Settings", "Fps value (%s) is invalid. It must be integer in range of [1,%u].", value, UINT8_MAX); } } static void parse_notifications_section(SETTINGS *config, const char *key, const char *value) { if (MATCH(NAMEOF(config->audible_notifications_enabled), key)) { config->audible_notifications_enabled = STR_TO_BOOL(value); } else if (MATCH(NAMEOF(config->status_notifications), key)) { config->status_notifications = STR_TO_BOOL(value); } else if (MATCH(NAMEOF(config->no_typing_notifications), key)) { config->no_typing_notifications = STR_TO_BOOL(value); } else if (MATCH(NAMEOF(config->group_notifications), key)) { config->group_notifications = atoi(value); } } static void parse_advanced_section(SETTINGS *config, const char *key, const char *value) { if (MATCH(NAMEOF(config->enableipv6), key)) { config->enableipv6 = STR_TO_BOOL(value); } else if (MATCH(NAMEOF(config->disableudp), key)) { config->disableudp = STR_TO_BOOL(value); } else if (MATCH(NAMEOF(config->proxyenable), key)) { config->proxyenable = STR_TO_BOOL(value); } else if (MATCH(NAMEOF(config->proxy_port), key)) { config->proxy_port = atoi(value); } else if (MATCH(NAMEOF(config->proxy_ip), key)) { strcpy((char *)config->proxy_ip, value); } else if (MATCH(NAMEOF(config->force_proxy), key)) { config->force_proxy = STR_TO_BOOL(value); } else if (MATCH(NAMEOF(config->block_friend_requests), key)) { config->block_friend_requests = STR_TO_BOOL(value); } } static int config_parser(const char *section, const char *key, const char *value, void *config_v) { SETTINGS *config = (SETTINGS *)config_v; switch (get_section(section)) { case GENERAL_SECTION: { parse_general_section(config, key, value); break; } case INTERFACE_SECTION: { parse_interface_section(config, key, value); break; } case AV_SECTION: { parse_av_section(config, key, value); break; } case NOTIFICATIONS_SECTION: { parse_notifications_section(config, key, value); break; } case ADVANCED_SECTION: { parse_advanced_section(config, key, value); break; } case UNKNOWN_SECTION: { LOG_NOTE("Settings", "Unknown section in config file: %s", section); break; } } return 1; } static bool utox_load_config(void) { char *config_path = utox_get_filepath(config_file_name); if (!config_path) { LOG_ERR("Settings", "Unable to get %s path.", config_file_name); return false; } if (!ini_browse(config_parser, &settings, config_path)) { LOG_ERR("Settings", "Unable to parse %s.", config_file_name); free(config_path); return false; } free(config_path); return true; } static bool create_config_folder(char *config_path) { char *last_slash = strrchr(config_path, '/'); if (!last_slash) { last_slash = strrchr(config_path, '\\'); } char *save_folder = strdup(config_path); save_folder[last_slash - config_path + 1] = '\0'; if (!native_create_dir((uint8_t *)save_folder)) { LOG_ERR("Settings", "Failed to create save folder %s.", save_folder); free(save_folder); return false; } free(save_folder); return true; } static bool utox_save_config(void) { char *config_path = utox_get_filepath(config_file_name); if (!config_path) { LOG_ERR("Settings", "Unable to get %s path.", config_file_name); return false; } if (!create_config_folder(config_path)) { free(config_path); return false; } SETTINGS *config = &settings; // general WRITE_CONFIG_VALUE_INT(GENERAL_SECTION, config->save_version); WRITE_CONFIG_VALUE_INT(GENERAL_SECTION, config->utox_last_version); // interface WRITE_CONFIG_VALUE_INT(INTERFACE_SECTION, config->language); WRITE_CONFIG_VALUE_INT(INTERFACE_SECTION, config->window_x); WRITE_CONFIG_VALUE_INT(INTERFACE_SECTION, config->window_y); WRITE_CONFIG_VALUE_INT(INTERFACE_SECTION, config->window_width); WRITE_CONFIG_VALUE_INT(INTERFACE_SECTION, config->window_height); WRITE_CONFIG_VALUE_INT(INTERFACE_SECTION, config->theme); WRITE_CONFIG_VALUE_INT(INTERFACE_SECTION, config->scale); WRITE_CONFIG_VALUE_BOOL(INTERFACE_SECTION, config->logging_enabled); WRITE_CONFIG_VALUE_BOOL(INTERFACE_SECTION, config->close_to_tray); WRITE_CONFIG_VALUE_BOOL(INTERFACE_SECTION, config->start_in_tray); WRITE_CONFIG_VALUE_BOOL(INTERFACE_SECTION, config->auto_startup); WRITE_CONFIG_VALUE_BOOL(INTERFACE_SECTION, config->use_mini_flist); WRITE_CONFIG_VALUE_BOOL(INTERFACE_SECTION, config->filter); WRITE_CONFIG_VALUE_BOOL(INTERFACE_SECTION, config->magic_flist_enabled); WRITE_CONFIG_VALUE_BOOL(INTERFACE_SECTION, config->use_long_time_msg); // av WRITE_CONFIG_VALUE_BOOL(AV_SECTION, config->push_to_talk); WRITE_CONFIG_VALUE_BOOL(AV_SECTION, config->audio_filtering_enabled); WRITE_CONFIG_VALUE_INT(AV_SECTION, config->audio_device_in); WRITE_CONFIG_VALUE_INT(AV_SECTION, config->audio_device_out); WRITE_CONFIG_VALUE_INT(AV_SECTION, config->video_fps); // TODO: video_input_device // notifications WRITE_CONFIG_VALUE_BOOL(NOTIFICATIONS_SECTION, config->audible_notifications_enabled); WRITE_CONFIG_VALUE_BOOL(NOTIFICATIONS_SECTION, config->status_notifications); WRITE_CONFIG_VALUE_BOOL(NOTIFICATIONS_SECTION, config->no_typing_notifications); WRITE_CONFIG_VALUE_INT(NOTIFICATIONS_SECTION, config->group_notifications); // advanced WRITE_CONFIG_VALUE_BOOL(ADVANCED_SECTION, config->enableipv6); WRITE_CONFIG_VALUE_BOOL(ADVANCED_SECTION, config->disableudp); WRITE_CONFIG_VALUE_BOOL(ADVANCED_SECTION, config->proxyenable); WRITE_CONFIG_VALUE_INT(ADVANCED_SECTION, config->proxy_port); WRITE_CONFIG_VALUE_STR(ADVANCED_SECTION, config->proxy_ip); WRITE_CONFIG_VALUE_BOOL(ADVANCED_SECTION, config->force_proxy); WRITE_CONFIG_VALUE_BOOL(ADVANCED_SECTION, config->block_friend_requests); free(config_path); return true; } static void init_default_settings(void) { settings.enableipv6 = true; settings.disableudp = false; settings.proxyenable = false; settings.force_proxy = false; // Allow users to override theme on the cmdline. if (settings.theme == UINT32_MAX) { settings.theme = 0; } settings.audio_filtering_enabled = true; settings.audible_notifications_enabled = true; } void config_load(void) { bool config_loaded = utox_load_config(); if (!config_loaded) { LOG_ERR("Settings", "Unable to load uTox settings. Use defaults."); init_default_settings(); } /* UX Settings */ dropdown_language.selected = dropdown_language.over = settings.language; if (settings.window_width < MAIN_WIDTH) { settings.window_width = MAIN_WIDTH; } if (settings.window_height < MAIN_HEIGHT) { settings.window_height = MAIN_HEIGHT; } dropdown_theme.selected = dropdown_theme.over = settings.theme; if (settings.scale > 30) { settings.scale = 30; } else if (settings.scale < 5) { settings.scale = 10; } dropdown_dpi.selected = dropdown_dpi.over = settings.scale - 5; switch_save_chat_history.switch_on = settings.logging_enabled; switch_close_to_tray.switch_on = settings.close_to_tray; switch_start_in_tray.switch_on = settings.start_in_tray; switch_auto_startup.switch_on = settings.auto_startup; switch_mini_contacts.switch_on = settings.use_mini_flist; flist_set_filter(settings.filter); switch_magic_sidebar.switch_on = settings.magic_flist_enabled; /* Network settings */ switch_ipv6.switch_on = settings.enableipv6; switch_udp.switch_on = !settings.disableudp; switch_udp.panel.disabled = settings.force_proxy; switch_proxy.switch_on = settings.proxyenable != 0; switch_proxy_force.switch_on = settings.force_proxy; switch_proxy_force.panel.disabled = settings.proxyenable == 0; /* AV */ switch_push_to_talk.switch_on = settings.push_to_talk; switch_audio_filtering.switch_on = settings.audio_filtering_enabled; if (settings.video_fps == 0) { settings.video_fps = DEFAULT_FPS; } snprintf((char *)edit_video_fps.data, edit_video_fps.data_size, "%u", settings.video_fps); edit_video_fps.length = strnlen((char *)edit_video_fps.data, edit_video_fps.data_size - 1); /* Notifications */ switch_audible_notifications.switch_on = settings.audible_notifications_enabled; switch_status_notifications.switch_on = settings.status_notifications; switch_typing_notes.switch_on = !settings.no_typing_notifications; settings.group_notifications = dropdown_global_group_notifications.selected = dropdown_global_group_notifications.over = settings.group_notifications; /* Advanced */ edit_proxy_ip.length = strnlen((char *)settings.proxy_ip, sizeof(settings.proxy_ip)); strncpy((char *)edit_proxy_ip.data, (char *)settings.proxy_ip, edit_proxy_ip.length); if (settings.proxy_port) { snprintf((char *)edit_proxy_port.data, edit_proxy_port.data_size, "%u", settings.proxy_port); edit_proxy_port.length = strnlen((char *)edit_proxy_port.data, edit_proxy_port.data_size - 1); } ui_set_scale(settings.scale); if (settings.push_to_talk) { init_ptt(); } if (!config_loaded) { config_save(); } } void config_save(void) { settings.save_version = UTOX_SAVE_VERSION; settings.filter = !!flist_get_filter(); settings.audio_device_in = dropdown_audio_in.selected; settings.audio_device_out = dropdown_audio_out.selected; LOG_NOTE("uTox", "Saving uTox settings."); if (!utox_save_config()) { LOG_ERR("uTox", "Unable to save uTox settings."); } } uTox/src/self.h0000600000175000001440000000164514003056216012375 0ustar rakusers#ifndef SELF_H #define SELF_H #include #include "native/image.h" typedef struct avatar AVATAR; #define TOX_ADDRESS_STR_SIZE TOX_ADDRESS_SIZE * 2 extern struct utox_self { uint8_t status; char name[TOX_MAX_NAME_LENGTH]; char statusmsg[TOX_MAX_STATUS_MESSAGE_LENGTH]; size_t name_length, statusmsg_length; size_t friend_list_count; size_t friend_list_size; size_t groups_list_count; size_t groups_list_size; size_t device_list_count; size_t device_list_size; char id_str[TOX_ADDRESS_SIZE * 2]; size_t id_str_length; NATIVE_IMAGE *qr_image; int qr_image_size; uint8_t *qr_data; int qr_data_size; uint8_t id_binary[TOX_ADDRESS_SIZE]; uint32_t nospam; uint32_t old_nospam; char nospam_str[(sizeof(uint32_t) * 2) + 1]; AVATAR *avatar; uint8_t *png_data; size_t png_size; } self; void init_self(Tox *tox); #endif uTox/src/self.c0000600000175000001440000000206614003056216012366 0ustar rakusers#include "self.h" #include "avatar.h" #include "debug.h" #include "qr.h" #include "tox.h" #include "ui/edit.h" #include "layout/settings.h" #include "native/filesys.h" #include #include #include struct utox_self self; void init_self(Tox *tox) { /* Set local info for self */ edit_setstr(&edit_name, self.name, self.name_length); edit_setstr(&edit_status_msg, self.statusmsg, self.statusmsg_length); /* Get tox id, and gets the hex version for utox */ tox_self_get_address(tox, self.id_binary); id_to_string(self.id_str, self.id_binary); self.id_str_length = TOX_ADDRESS_SIZE * 2; LOG_TRACE("Self INIT", "Tox ID: %.*s" , (int)self.id_str_length, self.id_str); qr_setup(self.id_str, &self.qr_data, &self.qr_data_size, &self.qr_image, &self.qr_image_size); /* Get nospam */ self.nospam = tox_self_get_nospam(tox); self.old_nospam = self.nospam; sprintf(self.nospam_str, "%08X", self.nospam); edit_setstr(&edit_nospam, self.nospam_str, sizeof(uint32_t) * 2); avatar_init_self(); } uTox/src/screen_grab.h0000600000175000001440000000024414003056216013710 0ustar rakusers#ifndef SCREEN_GRAB_H #define SCREEN_GRAB_H #include void native_screen_grab_desktop(bool video); void utox_screen_grab_desktop(bool video); #endif uTox/src/screen_grab.c0000600000175000001440000000015714003056216013706 0ustar rakusers#include "screen_grab.h" void utox_screen_grab_desktop(bool video) { native_screen_grab_desktop(video); } uTox/src/qr.h0000600000175000001440000000026614003056216012064 0ustar rakusers#include typedef struct native_image NATIVE_IMAGE; void qr_setup(const char *id_str, uint8_t **qr_data, int *qr_data_size, NATIVE_IMAGE **qr_image, int *qr_image_size); uTox/src/qr.c0000600000175000001440000000423714003056216012061 0ustar rakusers#include "qr.h" #include "debug.h" #include "stb.h" #include "tox.h" #include "self.h" #include "native/image.h" #include #include #include #include #define QR_BORDER_SIZE 4 /* unit: QR modules */ static bool generate_qr(const char *text, uint8_t *qrcode) { uint8_t temp_buffer[qrcodegen_BUFFER_LEN_MAX]; return qrcodegen_encodeText(text, temp_buffer, qrcode, qrcodegen_Ecc_MEDIUM, qrcodegen_VERSION_MIN, qrcodegen_VERSION_MAX, qrcodegen_Mask_AUTO, true); } static void convert_qr_to_rgb(const uint8_t *qrcode, uint8_t size, uint8_t *pixels) { /* skip first border on y and x axis */ uint16_t i = ((QR_BORDER_SIZE * size) + QR_BORDER_SIZE) * 3; for (uint8_t y = 0; y < qrcodegen_getSize(qrcode); y++) { for (uint8_t x = 0; x < qrcodegen_getSize(qrcode); x++) { bool black = qrcodegen_getModule(qrcode, x, y); pixels[i] = pixels[i + 1] = pixels[i + 2] = black ? 0x00 : 0xFF; i += 3; } /* skip border until end of line and border on start of next line */ i += (QR_BORDER_SIZE * 2) * 3; } } void qr_setup(const char *id_str, uint8_t **qr_data, int *qr_data_size, NATIVE_IMAGE **qr_image, int *qr_image_size) { const uint8_t channel_number = 3; uint8_t qrcode[qrcodegen_BUFFER_LEN_MAX] = { 0 }; char tox_uri[TOX_ADDRESS_STR_SIZE + sizeof("tox:")]; snprintf(tox_uri, sizeof(tox_uri), "tox:%.*s", (unsigned int) TOX_ADDRESS_STR_SIZE, id_str); if (!generate_qr(tox_uri, qrcode)) { LOG_ERR("QR", "Unable to generate QR code from Tox URI."); return; } *qr_image_size = qrcodegen_getSize(qrcode); *qr_image_size += QR_BORDER_SIZE * 2; /* add border on both sides */ uint8_t pixels[*qr_image_size * *qr_image_size * channel_number]; memset(pixels, 0xFF, sizeof(pixels)); /* make it all white */ convert_qr_to_rgb(qrcode, *qr_image_size, pixels); *qr_data = stbi_write_png_to_mem(pixels, 0, *qr_image_size, *qr_image_size, channel_number, qr_data_size); uint16_t native_size = *qr_image_size; *qr_image = utox_image_to_native(*qr_data, *qr_data_size, &native_size, &native_size, false); } uTox/src/posix/0000700000175000001440000000000014003056216012425 5ustar rakusersuTox/src/posix/filesys.c0000600000175000001440000001232514003056216014254 0ustar rakusers#include "../filesys.h" #include "../debug.h" #include "../settings.h" #include "../native/filesys.h" #include #include #include #include #include #include bool native_create_dir_tree(const char *path) { size_t size = strlen(path); if (size < 2) { // memory bounds check return false; } char *buff = calloc(1, size); if (!buff) { LOG_ERR("Filesys", "Unable to allocate memory for buffer."); return false; } for (size_t i = 1; i < size; ++i) { // i = 1 to skip root '/' if (path[i] == '/') { memcpy(buff, path, i + 1); if (!native_create_dir((uint8_t *)buff)) { free(buff); return false; } } } free(buff); return true; } // native get "valid" file path char *native_get_filepath(const char *name) { char *path = calloc(1, UTOX_FILE_NAME_LENGTH); if (!path) { LOG_ERR("Filesys", "Unable to allocate memory for file path."); return NULL; } if (settings.portable_mode) { snprintf(path, UTOX_FILE_NAME_LENGTH, "./tox/"); } else { snprintf(path, UTOX_FILE_NAME_LENGTH, "%s/.config/tox/", getenv("HOME")); } if (strlen(path) + strlen(name) >= UTOX_FILE_NAME_LENGTH) { LOG_ERR("Filesys", "Load directory name too long" ); free(path); return NULL; } if (!native_create_dir_tree(path)) { free(path); return NULL; } // add file name snprintf(path + strlen(path), UTOX_FILE_NAME_LENGTH - strlen(path), "%s", name); return path; } bool native_create_dir(const uint8_t *filepath) { const int status = mkdir((char *)filepath, S_IRWXU); if (status == 0 || errno == EEXIST) { return true; } LOG_WARN("Filesys", "Unable to create directory %s. Error: %d", filepath, errno); return false; } // TODO: DRY. This function exists in both posix/filesys.c and in android/main.c static void opts_to_sysmode(UTOX_FILE_OPTS opts, char *mode) { if (opts & UTOX_FILE_OPTS_READ) { mode[0] = 'r'; // Reading is first, don't clobber files. } else if (opts & UTOX_FILE_OPTS_APPEND) { mode[0] = 'a'; // Then appending, again, don't clobber files. } else if (opts & UTOX_FILE_OPTS_WRITE) { mode[0] = 'w'; // Writing is the final option we'll look at. } mode[1] = 'b'; // does nothing on posix >C89, but hey, why not? if ((opts & (UTOX_FILE_OPTS_WRITE | UTOX_FILE_OPTS_APPEND)) && (opts & UTOX_FILE_OPTS_READ)) { mode[2] = '+'; } mode[3] = 0; } FILE *native_get_file_simple(const char *path, UTOX_FILE_OPTS opts) { char mode[4] = { 0 }; opts_to_sysmode(opts, mode); FILE *fp = fopen(path, mode); if (!fp && opts & UTOX_FILE_OPTS_READ && opts & UTOX_FILE_OPTS_WRITE) { LOG_WARN("POSIX", "Unable to simple open, falling back to fd" ); // read won't create a file if it doesn't already exist. If we're allowed to write, let's try // to create the file, then reopen it. int fd = open(path, O_RDWR | O_CREAT, S_IRUSR | S_IWUSR | S_IRGRP | S_IROTH); fp = fdopen(fd, mode); } return fp; } FILE *native_get_file(const uint8_t *name, size_t *size, UTOX_FILE_OPTS opts, bool portable_mode) { uint8_t path[UTOX_FILE_NAME_LENGTH] = { 0 }; if (portable_mode) { snprintf((char *)path, UTOX_FILE_NAME_LENGTH, "./tox/"); } else { snprintf((char *)path, UTOX_FILE_NAME_LENGTH, "%s/.config/tox/", getenv("HOME")); } // native_get_file should never be called with DELETE in combination with other FILE_OPTS. assert(opts <= UTOX_FILE_OPTS_DELETE); // WRITE and APPEND are mutually exclusive. WRITE will serve you a blank file. APPEND will append (duh). assert((opts & UTOX_FILE_OPTS_WRITE && opts & UTOX_FILE_OPTS_APPEND) == false); if (opts & UTOX_FILE_OPTS_WRITE || opts & UTOX_FILE_OPTS_MKDIR) { if (!native_create_dir(path)) { return NULL; } } if (strlen((char *)path) + strlen((char *)name) >= UTOX_FILE_NAME_LENGTH) { LOG_ERR("Filesys", "Load directory name too long" ); return NULL; } else { snprintf((char *)path + strlen((char *)path), UTOX_FILE_NAME_LENGTH - strlen((char *)path), "%s", name); } if (opts == UTOX_FILE_OPTS_DELETE) { LOG_DEBUG("Filesys", "removing file %s", path); remove((char *)path); return NULL; } if (opts & UTOX_FILE_OPTS_MKDIR) { // remove file name from path uint8_t push; uint8_t *p = path + strlen((char *)path); while (*--p != '/'); push = *++p; *p = 0; native_create_dir(path); *p = push; } FILE *fp = native_get_file_simple((char *)path, opts); if (fp == NULL) { LOG_TRACE("Filesys", "Could not open %s" , path); return NULL; } if (size != NULL) { fseek(fp, 0, SEEK_END); *size = ftell(fp); fseek(fp, 0, SEEK_SET); } return fp; } bool native_move_file(const uint8_t *current_name, const uint8_t *new_name) { if(!current_name || !new_name) { return false; } return rename((char *)current_name, (char *)new_name); } uTox/src/notify.h0000600000175000001440000000052514003056216012750 0ustar rakusers#ifndef NOTIFY_H #define NOTIFY_H typedef struct native_window UTOX_WINDOW; typedef enum { NOTIFY_TYPE_NONE, NOTIFY_TYPE_MSG, NOTIFY_TYPE_CALL, NOTIFY_TYPE_CALL_VIDEO, } NOTIFY_TYPE; typedef enum { TWEEN_NONE, TWEEN_UP, } NOTIFY_TWEEN; UTOX_WINDOW *notify_new(NOTIFY_TYPE type); void notify_tween(void); #endif uTox/src/notify.c0000600000175000001440000000200514003056216012736 0ustar rakusers#include "notify.h" #include "debug.h" #include "window.h" #include "layout/notify.h" #include "native/window.h" #include #include static uint16_t notification_number = 0; UTOX_WINDOW *notify_new(NOTIFY_TYPE type) { LOG_NOTE("Notifier", "Notify:\tCreating Notification #%u", notification_number); const int notify_w = 400; const int notify_h = 150; const int x = 30; const int y = 30 + (20 + notify_h) * notification_number; ++notification_number; PANEL *panel; switch (type) { case NOTIFY_TYPE_NONE: { return NULL; } case NOTIFY_TYPE_MSG: { panel = &panel_notify_generic; break; } case NOTIFY_TYPE_CALL: case NOTIFY_TYPE_CALL_VIDEO: { panel = &panel_notify_generic; // TODO create a video call panel type break; } } UTOX_WINDOW *w = window_create_notify(x, y, notify_w, notify_h, panel); native_window_set_target(w); return w; } uTox/src/native/0000700000175000001440000000000014003056216012551 5ustar rakusersuTox/src/native/xlib/0000700000175000001440000000000014003056216013507 5ustar rakusersuTox/src/native/xlib/keycodes.h0000600000175000001440000000073414003056216015474 0ustar rakusers#ifndef NATIVE_XLIB_KEYCODES_H #define NATIVE_XLIB_KEYCODES_H #define XK_MISCELLANY #include #define KEY_BACK XK_BackSpace #define KEY_RETURN XK_Return #define KEY_LEFT XK_Left #define KEY_RIGHT XK_Right #define KEY_TAB XK_Tab #define KEY_LEFT_TAB XK_ISO_Left_Tab #define KEY_DEL XK_Delete #define KEY_END XK_End #define KEY_HOME XK_Home #define KEY_UP XK_Up #define KEY_DOWN XK_Down #define KEY_PAGEUP XK_Page_Up #define KEY_PAGEDOWN XK_Page_Down #endif uTox/src/native/xlib/image.h0000600000175000001440000000027314003056216014746 0ustar rakusers#ifndef NATIVE_XLIB_IMAGE_H #define NATIVE_XLIB_IMAGE_H #include #define NATIVE_IMAGE_IS_VALID(x) (None != (x)) #define NATIVE_IMAGE_HAS_ALPHA(x) (None != (x->alpha)) #endif uTox/src/native/window.h0000600000175000001440000000305214003056216014233 0ustar rakusers#ifndef NATIVE_WINDOW_H #define NATIVE_WINDOW_H #include typedef struct native_window UTOX_WINDOW; typedef struct panel PANEL; // The following is a hollow struct with window vars common across all platforms // Each platform's window struct starts with this, then follows with their own // specific includes. struct utox_window { UTOX_WINDOW *next; int x, y; unsigned w, h; PANEL *panel; }; void native_window_raze(UTOX_WINDOW *win); UTOX_WINDOW *native_window_find_notify(void *win); UTOX_WINDOW *native_window_create_traypop(int x, int y, int w, int h, PANEL *panel); UTOX_WINDOW *native_window_create_notify(int x, int y, int w, int h, PANEL *panel); void native_window_tween(UTOX_WINDOW *win); void native_window_create_screen_select(void); /** * Sets the target of the next series of drawing commands. * * Returns true if the window was changed. * false if the window is the same. */ bool native_window_set_target(UTOX_WINDOW *new_win); // These deal with platform-specific structures #if defined __WIN32__ || defined _WIN32 || defined __CYGWIN__ #include void native_window_init(HINSTANCE instance); HWND native_window_create_video(int x, int y, int w, int h); UTOX_WINDOW *native_window_create_main(int x, int y, int w, int h); #else // Everything else. bool native_window_init(void); UTOX_WINDOW *native_window_create_video(int x, int y, int w, int h); UTOX_WINDOW *native_window_create_main(int x, int y, int w, int h, char **argv, int argc); #endif #endif // NATIVE_WINDOW_H uTox/src/native/win/0000700000175000001440000000000014003056216013346 5ustar rakusersuTox/src/native/win/keycodes.h0000600000175000001440000000061014003056216015324 0ustar rakusers#ifndef NATIVE_WIN_KEYCODES_H #define NATIVE_WIN_KEYCODES_H #include #define KEY_BACK VK_BACK #define KEY_RETURN VK_RETURN #define KEY_LEFT VK_LEFT #define KEY_RIGHT VK_RIGHT #define KEY_TAB VK_TAB #define KEY_DEL VK_DELETE #define KEY_END VK_END #define KEY_HOME VK_HOME #define KEY_UP VK_UP #define KEY_DOWN VK_DOWN #define KEY_PAGEUP VK_PRIOR #define KEY_PAGEDOWN VK_NEXT #endif uTox/src/native/win/image.h0000600000175000001440000000023714003056216014605 0ustar rakusers#ifndef NATIVE_WIN_IMAGE_H #define NATIVE_WIN_IMAGE_H #define NATIVE_IMAGE_IS_VALID(x) (NULL != (x)) #define NATIVE_IMAGE_HAS_ALPHA(x) (x->has_alpha) #endif uTox/src/native/video.h0000600000175000001440000000241014003056216014027 0ustar rakusers#ifndef NATIVE_VIDEO_H #define NATIVE_VIDEO_H #include #include void video_frame(uint16_t id, uint8_t *img_data, uint16_t width, uint16_t height, bool resize); /** * Opens the OS window for the incoming video frames * * @param id The id number of the friend * Use UINT16_MAX for the preview window * currently any value > UINT16_MAX will be treaded as the * preview window * TODO: move this window handle to the friend struct? * TODO: fix static alloc of the window handles * @param name Name for the title of the window * @param name_length length of @name in bytes * @param width starting size of the video frame * @param height starting size of the video frame */ void video_begin(uint16_t id, char *name, uint16_t name_length, uint16_t width, uint16_t height); void video_end(uint16_t id); uint16_t native_video_detect(void); bool native_video_init(void *handle); void native_video_close(void *handle); int native_video_getframe(uint8_t *y, uint8_t *u, uint8_t *v, uint16_t width, uint16_t height); bool native_video_startread(void); bool native_video_endread(void); // OS X only. void desktopgrab(bool video); #endif uTox/src/native/ui.h0000600000175000001440000000021614003056216013340 0ustar rakusers#ifndef NATIVE_UI_H #define NATIVE_UI_H void redraw(void); void force_redraw(void); void setscale(void); void setscale_fonts(void); #endif uTox/src/native/time.h0000600000175000001440000000011614003056216013660 0ustar rakusers#ifndef NATIVE_TIME_H #define NATIVE_TIME_H uint64_t get_time(void); #endif uTox/src/native/thread.h0000600000175000001440000000020114003056216014164 0ustar rakusers#ifndef NATIVE_THREAD_H #define NATIVE_THREAD_H void thread(void func(void *), void *args); void yieldcpu(uint32_t ms); #endif uTox/src/native/os.h0000600000175000001440000000073514003056216013352 0ustar rakusers#ifndef NATIVE_OS_H #define NATIVE_OS_H // OS-specific cleanup function for when edits are defocused. Commit IME state, etc. // OS X only. void edit_will_deactivate(void); // Android only. void showkeyboard(bool show); // Linux, OS X, and Windows. void openurl(char *str); // Linux only. void setselection(char *data, uint16_t length); // inserts/deletes a value into the registry to launch uTox after boot // OS X and Windows void launch_at_startup(bool should); #endif uTox/src/native/notify.h0000600000175000001440000000033614003056216014236 0ustar rakusers#ifndef NATIVE_NOTIFY_H #define NATIVE_NOTIFY_H extern bool have_focus; void update_tray(void); void notify(char *title, uint16_t title_length, const char *msg, uint16_t msg_length, void *object, bool is_group); #endif uTox/src/native/main.h0000600000175000001440000000070114003056216013646 0ustar rakusers// Uncomment when the native function cleanup is done. // #if defined(NATIVE_MAIN_H) // #error "The main function should only ever be included once." // #endif #ifndef NATIVE_MAIN_H #define NATIVE_MAIN_H #if defined __WIN32__ || defined _WIN32 || defined __CYGWIN__ #include "../windows/main.h" #elif defined __ANDROID__ #include "../android/main.h" #elif defined __OBJC__ #include "../cocoa/main.h" #else #include "../xlib/main.h" #endif #endif uTox/src/native/keyboard.h0000600000175000001440000000122414003056216014523 0ustar rakusers#ifndef NATIVE_KEYBOARD_H #define NATIVE_KEYBOARD_H // Push-to-talk // Enable push-to-talk. void init_ptt(void); // Disable push-to-talk. void exit_ptt(void); // Returns a bool indicating whether you should send audio or not. bool check_ptt_key(void); // TODO: Make it possible to rebind push-to-talk key. // Unimplemented. bool get_ptt_key(void); // Unimplemented. bool set_ptt_key(void); // Native keycodes #if defined __WIN32__ || defined _WIN32 || defined __CYGWIN__ #include "win/keycodes.h" #elif defined __ANDROID__ #include "android/keycodes.h" #elif defined __OBJC__ #include "cocoa/keycodes.h" #else #include "xlib/keycodes.h" #endif #endif uTox/src/native/image.h0000600000175000001440000000376714003056216014023 0ustar rakusers#ifndef NATIVE_IMAGE_H #define NATIVE_IMAGE_H typedef struct native_image NATIVE_IMAGE; typedef uint8_t *UTOX_IMAGE; enum { FILTER_NEAREST, // ugly and quick filtering FILTER_BILINEAR // prettier and a bit slower filtering }; /* set filtering method used when resizing given image to one of above enum */ void image_set_filter(NATIVE_IMAGE *image, uint8_t filter); /* set scale of image so that when it's drawn it will be `scale' times as large(2.0 for double size, 0.5 for half, etc.) * notes: theoretically lowest possible scale is (1.0/65536.0), highest is 65536.0, values outside of this range will * create weird issues * scaling will be rounded to pixels, so it might not be exact */ void image_set_scale(NATIVE_IMAGE *image, double scale); /* draws an utox image with or without alpha channel into the rect of (x,y,width,height) on the screen, * starting at position (imgx,imgy) of the image * WARNING: Windows can fail to show the image at all if the rect (imgx,imgy,width,height) contains even 1 pixel outside * of * the image's size AFTER SCALING, so be careful. * TODO: improve this so this function is safer to use */ void draw_image(const NATIVE_IMAGE *image, int x, int y, uint32_t width, uint32_t height, uint32_t imgx, uint32_t imgy); /* Native wrapper to ready and call draw_image */ void draw_inline_image(uint8_t *img_data, size_t size, uint16_t w, uint16_t h, int x, int y); /* converts a png to a NATIVE_IMAGE, returns a pointer to it, keeping alpha channel only if keep_alpha is 1 */ NATIVE_IMAGE *utox_image_to_native(const UTOX_IMAGE, size_t size, uint16_t *w, uint16_t *h, bool keep_alpha); /* free an image created by utox_image_to_native */ void image_free(NATIVE_IMAGE *image); // OS-dependent macros #if defined __WIN32__ || defined _WIN32 || defined __CYGWIN__ #include "win/image.h" #elif defined __ANDROID__ #include "android/image.h" #elif defined __OBJC__ // TODO: OS X uses functions instead of macros. #include "main.h" #else #include "xlib/image.h" #endif #endif uTox/src/native/filesys.h0000600000175000001440000000340514003056216014404 0ustar rakusers#ifndef NATIVE_FILESYS_H #define NATIVE_FILESYS_H // For UTOX_FILE_OPTS #include "../filesys.h" #include typedef struct file_transfer FILE_TRANSFER; FILE *native_get_file(const uint8_t *name, size_t *size, UTOX_FILE_OPTS opts, bool portable_mode); FILE *native_get_file_simple(const char *name, UTOX_FILE_OPTS opts); /** given a filename, native_remove_file will delete that file from the local config dir */ bool native_remove_file(const uint8_t *name, size_t length, bool portable_mode); bool native_move_file(const uint8_t *current_name, const uint8_t *new_name); // shows a file chooser to the user and calls utox_export_chatlog in turn // TODO not let this depend on chatlogs // TODO refactor this to be a simple filechooser which returns the file instead void native_export_chatlog_init(uint32_t friend_number); // TODO same as for chatlogs, this is mainly native because of the file selector thing typedef struct msg_header MSG_HEADER; void file_save_inline_image_png(MSG_HEADER *msg); // TODO same as for chatlogs, this is mainly native because of the file selector thing bool native_save_image_png(const char *name, const uint8_t *image, const int image_size); typedef struct file_transfer FILE_TRANSFER; void native_autoselect_dir_ft(uint32_t fid, FILE_TRANSFER *file); void native_select_dir_ft(uint32_t fid, uint32_t num, FILE_TRANSFER *file); /** * @brief Get full path of the file in the Tox profile folder. * * @param name name of the file. * @return null-terminated string, or NULL on failure. */ char *native_get_filepath(const char *name); // OS interface replacements void flush_file(FILE *file); int ch_mod(uint8_t *file); int file_lock(FILE *file, uint64_t start, size_t length); int file_unlock(FILE *file, uint64_t start, size_t length); #endif uTox/src/native/dialog.h0000600000175000001440000000063314003056216014165 0ustar rakusers#ifndef NATIVE_DIALOG_H #define NATIVE_DIALOG_H // Linux, OS X, and Windows. void openfilesend(void); // Use the file picker to select an avatar and set it as the user's. // Linux, OS X, and Windows. void openfileavatar(void); /** * @brief Show a platform-independent message box. */ void show_messagebox(const char *caption, uint16_t caption_length, const char *message, uint16_t message_length); #endif uTox/src/native/cocoa/0000700000175000001440000000000014003056216013635 5ustar rakusersuTox/src/native/cocoa/keycodes.h0000600000175000001440000000121314003056216015613 0ustar rakusers#ifndef NATIVE_COCOA_KEYCODES_H #define NATIVE_COCOA_KEYCODES_H #include #define CARBON_K(x) (x + 255) #define KEY_BACK CARBON_K(kVK_Delete) #define KEY_RETURN CARBON_K(kVK_Return) #define KEY_LEFT CARBON_K(kVK_LeftArrow) #define KEY_RIGHT CARBON_K(kVK_RightArrow) #define KEY_TAB CARBON_K(kVK_Tab) #define KEY_LEFT_TAB CARBON_K(kVK_ISO_Left_Tab) #define KEY_DEL CARBON_K(kVK_ForwardDelete) #define KEY_END CARBON_K(kVK_End) #define KEY_HOME CARBON_K(kVK_Home) #define KEY_UP CARBON_K(kVK_UpArrow) #define KEY_DOWN CARBON_K(kVK_DownArrow) #define KEY_PAGEUP CARBON_K(kVK_PageUp) #define KEY_PAGEDOWN CARBON_K(kVK_PageDown) #endif uTox/src/native/clipboard.h0000600000175000001440000000014714003056216014665 0ustar rakusers#ifndef NATIVE_CLIPBOARD_H #define NATIVE_CLIPBOARD_H void copy(int value); void paste(void); #endif uTox/src/native/audio.h0000600000175000001440000000065014003056216014026 0ustar rakusers#ifndef NATIVE_AUDIO_H #define NATIVE_AUDIO_H #include #include // Audio void audio_detect(void); bool audio_init(void *handle); bool audio_close(void *handle); bool audio_frame(int16_t *buffer); #if defined __ANDROID__ void audio_play(int32_t call_index, const int16_t *data, int length, uint8_t channels); void audio_begin(int32_t call_index); void audio_end(int32_t call_index); #endif #endif uTox/src/native/android/0000700000175000001440000000000014003056216014171 5ustar rakusersuTox/src/native/android/keycodes.h0000600000175000001440000000047014003056216016153 0ustar rakusers#ifndef NATIVE_ANDROID_KEYCODES_H #define NATIVE_ANDROID_KEYCODES_H #define KEY_BACK 1 #define KEY_RETURN 2 #define KEY_LEFT 3 #define KEY_RIGHT 4 #define KEY_TAB 7 #define KEY_DEL 8 #define KEY_END 9 #define KEY_HOME 10 #define KEY_UP 5 #define KEY_DOWN 6 #define KEY_PAGEUP 11 #define KEY_PAGEDOWN 12 #endif uTox/src/native/android/image.h0000600000175000001440000000016314003056216015426 0ustar rakusers#ifndef NATIVE_ANDROID_IMAGE_H #define NATIVE_ANDROID_IMAGE_H #define NATIVE_IMAGE_IS_VALID(x) (0 != (x)) #endif uTox/src/messages.h0000600000175000001440000001212014003056216013241 0ustar rakusers#ifndef MESSAGES_H #define MESSAGES_H #include "ui/panel.h" #include #include #include extern pthread_mutex_t messages_lock; typedef struct native_image NATIVE_IMAGE; typedef enum UTOX_MSG_TYPE { MSG_TYPE_NULL, /* MSG_TEXT must start here */ MSG_TYPE_TEXT, MSG_TYPE_ACTION_TEXT, MSG_TYPE_NOTICE, MSG_TYPE_NOTICE_DAY_CHANGE, // Separated so I can localize this later! /* MSG_TEXT should end here */ // MSG_TYPE_OTHER, // Unused, expect to separate MSG_TEXT type MSG_TYPE_IMAGE, // MSG_TYPE_IMAGE_HISTORY, MSG_TYPE_FILE, // MSG_TYPE_FILE_HISTORY, // MSG_TYPE_CALL_ACTIVE, // MSG_TYPE_CALL_HISTORY, } UTOX_MSG_TYPE; typedef struct { char *author; uint16_t author_length; uint16_t length; char *msg; } MSG_TEXT; typedef struct { char *author; uint16_t author_length; uint16_t length; char *msg; uint32_t author_id; uint32_t author_color; } MSG_GROUP; typedef struct { uint32_t w, h; bool zoom; double position; NATIVE_IMAGE *image; } MSG_IMG; typedef struct msg_file { uint8_t file_status; uint32_t file_number; char *name; size_t name_length; // Location on disk uint8_t *path; size_t path_length; // In memory pointer uint8_t *data; size_t data_size; uint32_t speed; uint64_t size, progress; bool inline_png; } MSG_FILE; /* Generic Message type */ typedef struct msg_header { UTOX_MSG_TYPE msg_type; // true, if we're the author, false, if someone else. bool our_msg; uint32_t height; time_t time; uint64_t disk_offset; uint32_t receipt; time_t receipt_time; union { MSG_TEXT txt; MSG_TEXT action; MSG_TEXT notice; MSG_TEXT notice_day; MSG_GROUP grp; MSG_IMG img; MSG_FILE ft; } via; } MSG_HEADER; // Type for indexing into MSG_DATA->data array of messages typedef struct messages { PANEL panel; // false for Friendchat, true for Groupchat. bool is_groupchat; // Tox friendnumber/groupnumber uint32_t id; int height, width; // Position and length of an URL in the message under the mouse, // if present. cursor_over_uri == UINT16_MAX if there's none. uint32_t cursor_over_uri, urllen; // Was the url pressed by the mouse. uint32_t cursor_down_uri; uint32_t cursor_over_msg, cursor_over_position, cursor_down_msg, cursor_down_position; uint32_t sel_start_msg, sel_end_msg, sel_start_position, sel_end_position; // true if we're in the middle of selection operation // (mousedown without mouseup yet). bool selecting_text; bool cursor_over_time; // Number of messages in data array. uint32_t number; // Number of extra to speedup realloc. int8_t extra; // Pointers at various message structs, at most MAX_BACKLOG_MESSAGES. MSG_HEADER **data; // Field for preserving position of text scroll double scroll; } MESSAGES; uint32_t message_add_group(MESSAGES *m, MSG_HEADER *msg); uint32_t message_add_type_text(MESSAGES *m, bool auth, const char *msgtxt, uint16_t length, bool log, bool send); uint32_t message_add_type_action(MESSAGES *m, bool auth, const char *msgtxt, uint16_t length, bool log, bool send); uint32_t message_add_type_notice(MESSAGES *m, const char *msgtxt, uint16_t length, bool log); uint32_t message_add_type_image(MESSAGES *m, bool auth, NATIVE_IMAGE *img, uint16_t width, uint16_t height, bool log); MSG_HEADER *message_add_type_file(MESSAGES *m, uint32_t file_number, bool incoming, bool image, uint8_t status, const uint8_t *name, size_t name_size, size_t target_size, size_t current_size); // Returns true if data was logged. bool message_log_to_disk(MESSAGES *m, MSG_HEADER *msg); // Returns true if data was read from log. bool messages_read_from_log(uint32_t friend_number); void messages_send_from_queue(MESSAGES *m, uint32_t friend_number); void messages_clear_receipt(MESSAGES *m, uint32_t receipt_number); /** Formats all messages from self and friends, and then call draw functions * to write them to the UI. * * accepts: messages struct *pointer, int x,y positions, int width,height */ void messages_draw(PANEL *panel, int x, int y, int width, int height); bool messages_mmove(PANEL *panel, int px, int py, int width, int height, int mx, int my, int dx, int dy); bool messages_mdown(PANEL *panel); bool messages_dclick(PANEL *panel, bool triclick); bool messages_mright(PANEL *panel); bool messages_mwheel(PANEL *panel, int height, double d, bool smooth); // Always returns false. bool messages_mup(PANEL *panel); bool messages_mleave(PANEL *m); // Relay keypress to message panel. // Returns bool indicating whether a redraw is needed or not. bool messages_char(uint32_t ch); int messages_selection(PANEL *panel, char *buffer, uint32_t len, bool names); void messages_updateheight(MESSAGES *m, int width); void messages_init(MESSAGES *m, uint32_t friend_number); void message_free(MSG_HEADER *msg); void messages_clear_all(MESSAGES *m); #endif uTox/src/messages.c0000600000175000001440000017722414003056216013255 0ustar rakusers#include "messages.h" #include "chatlog.h" #include "file_transfers.h" #include "filesys.h" #include "flist.h" #include "friend.h" #include "groups.h" #include "debug.h" #include "macros.h" #include "self.h" #include "settings.h" #include "text.h" #include "theme.h" #include "tox.h" #include "utox.h" #include "ui/contextmenu.h" #include "ui/draw.h" #include "ui/scrollable.h" #include "ui/svg.h" #include "ui/text.h" #include "layout/friend.h" #include "layout/group.h" #include "native/clipboard.h" // TODO including native .h files should never be needed, refactor filesys.h to provide necessary API #include "native/filesys.h" #include "native/image.h" #include "native/keyboard.h" #include "native/os.h" #include #include #define UTOX_MAX_BACKLOG_MESSAGES 256 pthread_mutex_t messages_lock; /** Appends a messages from self or friend to the message list; * will realloc or trim messages as needed; * * also handles auto scrolling selections with messages * * accepts: MESSAGES *pointer, MESSAGE *pointer, MSG_DATA *pointer */ static int get_time_width() { return SCALE(settings.use_long_time_msg ? TIME_WIDTH_LONG : TIME_WIDTH); } static int msgheight(MSG_HEADER *msg, int width) { switch (msg->msg_type) { case MSG_TYPE_NULL: { LOG_ERR("Messages", "Invalid message type in msgheight."); return 0; } case MSG_TYPE_TEXT: case MSG_TYPE_ACTION_TEXT: case MSG_TYPE_NOTICE: case MSG_TYPE_NOTICE_DAY_CHANGE: { int theight = text_height(abs(width - SCALE(MESSAGES_X) - get_time_width()), font_small_lineheight, msg->via.txt.msg, msg->via.txt.length); return (theight == 0) ? 0 : theight + MESSAGES_SPACING; } case MSG_TYPE_IMAGE: { uint32_t maxwidth = width - SCALE(MESSAGES_X) - get_time_width(); if (msg->via.img.zoom || msg->via.img.w <= maxwidth) { return msg->via.img.h + MESSAGES_SPACING; } return msg->via.img.h * maxwidth / msg->via.img.w + MESSAGES_SPACING; } case MSG_TYPE_FILE: { return FILE_TRANSFER_BOX_HEIGHT + MESSAGES_SPACING; } } return 0; } static int msgheight_group(MSG_HEADER *msg, int width) { switch (msg->msg_type) { case MSG_TYPE_TEXT: case MSG_TYPE_ACTION_TEXT: case MSG_TYPE_NOTICE: case MSG_TYPE_NOTICE_DAY_CHANGE: { int theight = text_height(abs(width - SCALE(MESSAGES_X) - get_time_width()), font_small_lineheight, msg->via.grp.msg, msg->via.grp.length); return (theight == 0) ? 0 : theight + MESSAGES_SPACING; } default: { LOG_TRACE("Messages", "Error, can't set this group message height" ); } } return 0; } static int message_setheight(MESSAGES *m, MSG_HEADER *msg) { if (m->width == 0) { return 0; } setfont(FONT_TEXT); if (m->is_groupchat) { msg->height = msgheight_group(msg, m->width); } else { msg->height = msgheight(msg, m->width); } return msg->height; } static void message_updateheight(MESSAGES *m, MSG_HEADER *msg) { if (m->width == 0) { return; } setfont(FONT_TEXT); m->height -= msg->height; msg->height = message_setheight(m, msg); m->height += msg->height; } static uint32_t message_add(MESSAGES *m, MSG_HEADER *msg) { pthread_mutex_lock(&messages_lock); if (m->number < UTOX_MAX_BACKLOG_MESSAGES) { if (!m->data || m->extra <= 0) { if (m->data) { m->data = realloc(m->data, (m->number + 10) * sizeof(void *)); m->extra += 10; } else { m->number = 0; m->data = calloc(20, sizeof(void *)); m->extra = 20; } if (!m->data) { LOG_FATAL_ERR(EXIT_MALLOC, "Messages", "\n\n\nFATAL ERROR TRYING TO REALLOC FOR MESSAGES.\nTHIS IS A BUG, PLEASE REPORT!\n\n\n"); } } m->data[m->number++] = msg; m->extra--; } else { m->height -= m->data[0]->height; message_free(m->data[0]); memmove(m->data, m->data + 1, (UTOX_MAX_BACKLOG_MESSAGES - 1) * sizeof(MSG_HEADER *)); m->data[UTOX_MAX_BACKLOG_MESSAGES - 1] = msg; // Scroll selection up so that it stays over the same messages. if (m->sel_start_msg != UINT32_MAX) { if (0 < m->sel_start_msg) { m->sel_start_msg--; } else { m->sel_start_position = 0; } } if (m->sel_end_msg != UINT32_MAX) { if (0 < m->sel_end_msg) { m->sel_end_msg--; } else { m->sel_end_position = 0; } } if (m->cursor_down_msg != UINT32_MAX) { if (0 < m->cursor_down_msg) { m->cursor_down_msg--; } else { m->cursor_down_position = 0; } } if (m->cursor_over_msg != UINT32_MAX) { if (0 < m->cursor_over_msg) { m->cursor_over_msg--; } else { m->cursor_over_position = 0; } } } message_updateheight(m, msg); if (m->is_groupchat) { const GROUPCHAT *groupchat = flist_get_sel_group(); if (groupchat && groupchat == get_group(m->id)) { m->panel.content_scroll->content_height = m->height; } } else { const FRIEND *friend = flist_get_sel_friend(); if (friend && friend == get_friend(m->id)) { m->panel.content_scroll->content_height = m->height; } } pthread_mutex_unlock(&messages_lock); return m->number; } static bool msg_add_day_notice(MESSAGES *m, time_t last, time_t next) { /* The tm struct is shared, we have to do it this way */ int ltime_year = 0, ltime_mon = 0, ltime_day = 0; struct tm *msg_time = localtime(&last); ltime_year = msg_time->tm_year; ltime_mon = msg_time->tm_mon; ltime_day = msg_time->tm_mday; msg_time = localtime(&next); if (ltime_year >= msg_time->tm_year && (ltime_year != msg_time->tm_year || ltime_mon >= msg_time->tm_mon) && (ltime_year != msg_time->tm_year || ltime_mon != msg_time->tm_mon || ltime_day >= msg_time->tm_mday)) { return false; } MSG_HEADER *msg = calloc(1, sizeof(MSG_HEADER)); if (!msg) { LOG_FATAL_ERR(EXIT_MALLOC, "Messages", "Couldn't allocate memory for day notice."); } time(&msg->time); msg->our_msg = 0; msg->msg_type = MSG_TYPE_NOTICE_DAY_CHANGE; msg->via.notice_day.msg = calloc(1, 256); if (!msg->via.notice_day.msg) { LOG_FATAL_ERR(EXIT_MALLOC, "Messages", "Couldn't allocate memory for day notice."); } msg->via.notice_day.length = strftime((char *)msg->via.notice_day.msg, 256, "Day has changed to %A %B %d %Y", msg_time); if (0 == msg->via.notice_day.length) { LOG_ERR("Messages", "Couldn't compose day notice message."); free(msg->via.notice_day.msg); free(msg); return false; } message_add(m, msg); return true; } /* TODO leaving this here is a little hacky, but it was the fastest way * without considering if I should expose messages_add */ uint32_t message_add_group(MESSAGES *m, MSG_HEADER *msg) { return message_add(m, msg); } /* TODO This function and message_add_type_action() are essentially pasta. */ uint32_t message_add_type_text(MESSAGES *m, bool auth, const char *msgtxt, uint16_t length, bool log, bool send) { FRIEND *f = get_friend(m->id); if (!f) { LOG_ERR("Messages", "Could not get friend with id: %u", m->id); return UINT32_MAX; } MSG_HEADER *msg = calloc(1, sizeof(MSG_HEADER)); if (!msg) { LOG_FATAL_ERR(EXIT_MALLOC, "Messages", "Could not allocate memory for a message."); } msg->via.txt.length = length; msg->via.txt.msg = calloc(1, length); if (!msg->via.txt.msg) { LOG_FATAL_ERR(EXIT_MALLOC, "Messages", "Could not allocate memory for message."); } memcpy(msg->via.txt.msg, msgtxt, length); time(&msg->time); msg->our_msg = auth; msg->msg_type = MSG_TYPE_TEXT; if (auth) { msg->via.txt.author_length = self.name_length; if (!send) { msg->receipt = 0; msg->receipt_time = 1; } } else { msg->via.txt.author_length = f->name_length; } if (m->data && m->number) { MSG_HEADER *day_msg = m->data[m->number ? m->number - 1 : 0]; msg_add_day_notice(m, day_msg->time, msg->time); } if (log) { message_log_to_disk(m, msg); } if (auth && send) { postmessage_toxcore(TOX_SEND_MESSAGE, m->id, length, msg); } return message_add(m, msg); } uint32_t message_add_type_action(MESSAGES *m, bool auth, const char *msgtxt, uint16_t length, bool log, bool send) { FRIEND *f = get_friend(m->id); if (!f) { LOG_ERR("Messages", "Could not get friend with number: %u", m->id); return UINT32_MAX; } MSG_HEADER *msg = calloc(1, sizeof(MSG_HEADER)); if (!msg) { LOG_FATAL_ERR(EXIT_MALLOC, "Messages", "Could not get the message header."); } msg->via.action.length = length; msg->via.action.msg = calloc(1, length); if (!msg->via.action.msg) { LOG_FATAL_ERR(EXIT_MALLOC, "Messages", "Could not allocate memory for message."); } memcpy(msg->via.action.msg, msgtxt, length); time(&msg->time); msg->our_msg = auth; msg->msg_type = MSG_TYPE_ACTION_TEXT; if (auth) { msg->via.txt.author_length = self.name_length; if (!send) { msg->receipt = 0; msg->receipt_time = 1; } } else { msg->via.txt.author_length = f->name_length; } if (log) { message_log_to_disk(m, msg); } if (auth && send) { postmessage_toxcore(TOX_SEND_ACTION, f->number, length, msg); } return message_add(m, msg); } uint32_t message_add_type_notice(MESSAGES *m, const char *msgtxt, uint16_t length, bool log) { MSG_HEADER *msg = calloc(1, sizeof(MSG_HEADER)); if (!msg) { LOG_FATAL_ERR(EXIT_MALLOC, "Messages", "Couldn't allocate memory for notice."); } msg->via.notice.length = length; msg->via.notice.msg = calloc(1, length); if (!msg->via.notice.msg) { LOG_FATAL_ERR(EXIT_MALLOC, "Messages", "Couldn't allocate memory for notice."); } memcpy(msg->via.notice.msg, msgtxt, length); time(&msg->time); msg->our_msg = 0; msg->msg_type = MSG_TYPE_NOTICE; msg->via.txt.author_length = self.name_length; msg->receipt_time = time(NULL); if (log) { message_log_to_disk(m, msg); } return message_add(m, msg); } uint32_t message_add_type_image(MESSAGES *m, bool auth, NATIVE_IMAGE *img, uint16_t width, uint16_t height, bool UNUSED(log)) { if (!NATIVE_IMAGE_IS_VALID(img)) { return 0; } MSG_HEADER *msg = calloc(1, sizeof(MSG_HEADER)); if (!msg) { LOG_FATAL_ERR(EXIT_MALLOC, "Messages", "Could not allocate memory for message header."); } time(&msg->time); msg->our_msg = auth; msg->msg_type = MSG_TYPE_IMAGE; msg->via.img.w = width; msg->via.img.h = height; msg->via.img.zoom = 0; msg->via.img.image = img; msg->via.img.position = 0.0; return message_add(m, msg); } /* TODO FIX THIS SECTION TO MATCH ABOVE! */ /* Called by new file transfer to add a new message to the msg list */ MSG_HEADER *message_add_type_file(MESSAGES *m, uint32_t file_number, bool incoming, bool image, uint8_t status, const uint8_t *name, size_t name_size, size_t target_size, size_t current_size) { MSG_HEADER *msg = calloc(1, sizeof(MSG_HEADER)); if (!msg) { LOG_FATAL_ERR(EXIT_MALLOC, "Messages", "Could not allocate memory for message header."); } time(&msg->time); msg->our_msg = !incoming; msg->msg_type = MSG_TYPE_FILE; msg->via.ft.file_status = status; msg->via.ft.file_number = file_number; msg->via.ft.size = target_size; msg->via.ft.progress = current_size; msg->via.ft.speed = 0; msg->via.ft.inline_png = image; msg->via.ft.name_length = name_size; msg->via.ft.name = calloc(1, name_size + 1); if (!msg->via.ft.name) { LOG_FATAL_ERR(EXIT_MALLOC, "Messages", "Could not allocate memory for the file name."); } memcpy(msg->via.ft.name, name, msg->via.ft.name_length); if (image) { msg->via.ft.path = NULL; } else { // It's a file msg->via.ft.path = calloc(1, UTOX_FILE_NAME_LENGTH); if (!msg->via.ft.path) { LOG_FATAL_ERR(EXIT_MALLOC, "Messages", "Could not allocate memory for the file path."); } } message_add(m, msg); return msg; } bool message_log_to_disk(MESSAGES *m, MSG_HEADER *msg) { if (m->is_groupchat) { /* We don't support logging groupchats yet */ return false; } if (!settings.logging_enabled) { return false; } FRIEND *f = get_friend(m->id); if (!f) { LOG_ERR("Messages", "Could not get friend with number: %u", m->id); return false; } if (f->skip_msg_logging) { return false; } LOG_FILE_MSG_HEADER header; memset(&header, 0, sizeof(header)); switch (msg->msg_type) { case MSG_TYPE_TEXT: case MSG_TYPE_ACTION_TEXT: case MSG_TYPE_NOTICE: { size_t author_length; char *author; if (msg->our_msg) { author_length = self.name_length; author = self.name; } else { author_length = f->name_length; author = f->name; } header.log_version = LOGFILE_SAVE_VERSION; header.time = msg->time; header.author_length = author_length; header.msg_length = msg->via.txt.length; header.author = msg->our_msg; header.receipt = !!msg->receipt_time; // bool only header.msg_type = msg->msg_type; size_t length = sizeof(header) + msg->via.txt.length + author_length + 1; /* extra \n char*/ uint8_t *data = calloc(1, length); if (!data) { LOG_FATAL_ERR(EXIT_MALLOC, "Messages", "Can't calloc for chat logging data. size:%lu", length); } memcpy(data, &header, sizeof(header)); memcpy(data + sizeof(header), author, author_length); memcpy(data + sizeof(header) + author_length, msg->via.txt.msg, msg->via.txt.length); strcpy2(data + length - 1, "\n"); msg->disk_offset = utox_save_chatlog(f->id_str, data, length); free(data); return true; } default: { LOG_NOTE("Messages", "uTox Logging:\tUnsupported message type %i", msg->msg_type); } } return false; } bool messages_read_from_log(uint32_t friend_number) { size_t actual_count = 0; FRIEND *f = get_friend(friend_number); if (!f) { LOG_ERR("Messages", "Could not get friend with number: %u", friend_number); return false; } MSG_HEADER **data = utox_load_chatlog(f->id_str, &actual_count, UTOX_MAX_BACKLOG_MESSAGES, 0); if (!data) { if (actual_count > 0) { LOG_ERR("Messages", "uTox Logging:\tFound chat log entries, but couldn't get any data. This is a problem."); } return false; } MSG_HEADER **p = data; MSG_HEADER *msg; time_t last = 0; while (actual_count--) { msg = *p++; if (!msg) { continue; } if (msg_add_day_notice(&f->msg, last, msg->time)) { last = msg->time; } message_add(&f->msg, msg); } free(data); return true; } void messages_send_from_queue(MESSAGES *m, uint32_t friend_number) { uint32_t start = m->number; uint8_t seek_num = 3; /* this magic number is the number of messages we'll skip looking for the first unsent */ pthread_mutex_lock(&messages_lock); int queue_count = 0; /* seek back to find first queued message * I hate this nest too, but it's readable */ while (start) { --start; if (++queue_count > 25) { break; } if (m->data[start]) { MSG_HEADER *msg = m->data[start]; if (msg->msg_type == MSG_TYPE_TEXT || msg->msg_type == MSG_TYPE_ACTION_TEXT) { if (msg->our_msg) { if (msg->receipt_time) { if (!seek_num--) { break; } } } } } } int sent_count = 0; /* start sending messages, hopefully in order */ while (start < m->number && sent_count <= 25) { if (m->data[start]) { MSG_HEADER *msg = m->data[start]; if (msg->msg_type == MSG_TYPE_TEXT || msg->msg_type == MSG_TYPE_ACTION_TEXT) { if (msg->our_msg && !msg->receipt_time) { postmessage_toxcore((msg->msg_type == MSG_TYPE_TEXT ? TOX_SEND_MESSAGE : TOX_SEND_ACTION), friend_number, msg->via.txt.length, msg); ++sent_count; } } } ++start; } pthread_mutex_unlock(&messages_lock); } void messages_clear_receipt(MESSAGES *m, uint32_t receipt_number) { pthread_mutex_lock(&messages_lock); uint32_t start = m->number; while (start--) { if (!m->data[start]) { continue; } MSG_HEADER *msg = m->data[start]; if (msg->msg_type != MSG_TYPE_TEXT && msg->msg_type != MSG_TYPE_ACTION_TEXT) { continue; } if (msg->receipt != receipt_number) { continue; } msg->receipt = -1; time(&msg->receipt_time); LOG_FILE_MSG_HEADER header; memset(&header, 0, sizeof(header)); header.log_version = LOGFILE_SAVE_VERSION; header.time = msg->time; header.author_length = msg->via.txt.author_length; header.msg_length = msg->via.txt.length; header.author = 1; header.receipt = 1; header.msg_type = msg->msg_type; size_t length = sizeof(header); uint8_t *data = calloc(1, length); if (!data) { LOG_FATAL_ERR(EXIT_MALLOC, "Messages", "Couldn't allocate memory for message."); } memcpy(data, &header, length); char *hex = get_friend(m->id)->id_str; if (msg->disk_offset) { LOG_TRACE("Messages", "Updating message -> disk_offset is %lu" , msg->disk_offset); utox_update_chatlog(hex, msg->disk_offset, data, length); } else if (msg->disk_offset == 0 && start <= 1 && receipt_number == 1) { /* This could get messy if receipt is 1, msg position is 0, and the offset is actually wrong, * But I couldn't come up with any other way to verify the rare case of a bad offset * start <= 1 to offset for the day change notification */ LOG_TRACE("Messages", "Updating first message -> disk_offset is %lu" , msg->disk_offset); utox_update_chatlog(hex, msg->disk_offset, data, length); } else { LOG_ERR("Messages", "Messages:\tUnable to update this message...\n" "\t\tmsg->disk_offset %lu && m->number %u receipt_number %u \n", msg->disk_offset, m->number, receipt_number); } free(data); postmessage_utox(FRIEND_MESSAGE_UPDATE, 0, 0, NULL); /* Used to redraw the screen */ pthread_mutex_unlock(&messages_lock); return; } LOG_ERR("Messages", "Received a receipt for a message we don't have a record of. %u", receipt_number); pthread_mutex_unlock(&messages_lock); } static void messages_draw_timestamp(int x, int y, const time_t *time) { struct tm *ltime = localtime(time); char timestr[9]; uint16_t len; if (settings.use_long_time_msg) { snprintf(timestr, sizeof(timestr), "%.2u:%.2u:%.2u", ltime->tm_hour, ltime->tm_min, ltime->tm_sec); x -= textwidth("24:60:00", sizeof "24:60:00" - 1); } else { snprintf(timestr, sizeof(timestr), "%u:%.2u", ltime->tm_hour, ltime->tm_min); x -= textwidth("24:60", sizeof "24:60" - 1); } len = strnlen(timestr, sizeof(timestr) - 1); setcolor(COLOR_MAIN_TEXT_SUBTEXT); setfont(FONT_MISC); drawtext(x - MESSAGES_SPACING, y, timestr, len); } static void messages_draw_author(int x, int y, int w, char *name, uint32_t length, uint32_t color) { setcolor(color); setfont(FONT_TEXT); drawtextwidth_right(x, w, y, name, length); } static int messages_draw_text(const char *msg, size_t length, uint32_t msg_height, uint8_t msg_type, bool author, bool receipt, uint16_t highlight_start, uint16_t highlight_end, int x, int y, int w, int UNUSED(h)) { switch (msg_type) { case MSG_TYPE_TEXT: { if (author) { if (receipt) { setcolor(COLOR_MSG_USER); } else { setcolor(COLOR_MSG_USER_PEND); } } else { setcolor(COLOR_MSG_CONTACT); } break; } case MSG_TYPE_NOTICE: case MSG_TYPE_NOTICE_DAY_CHANGE: case MSG_TYPE_ACTION_TEXT: { setcolor(COLOR_MAIN_TEXT_ACTION); break; } } setfont(FONT_TEXT); int ny = utox_draw_text_multiline_within_box(x, y, w + x, MAIN_TOP, y + msg_height, font_small_lineheight, msg, length, highlight_start, highlight_end, 0, 0, 1); if (ny < y || (uint32_t)(ny - y) + MESSAGES_SPACING != msg_height) { LOG_TRACE("Messages", "Text Draw Error:\ty %i | ny %i | mheight %u | width %i " , y, ny, msg_height, w); } return ny; } /* draws an inline image at rect (x,y,width,height) * maxwidth is maximum width the image can take in * zoom is whether the image is currently zoomed in * position is the y position along the image the player has scrolled */ static int messages_draw_image(MSG_IMG *img, int x, int y, uint32_t maxwidth) { image_set_filter(img->image, FILTER_BILINEAR); if (!img->zoom && img->w > maxwidth) { image_set_scale(img->image, (double)maxwidth / img->w); draw_image(img->image, x, y, maxwidth, img->h * maxwidth / img->w, 0, 0); image_set_scale(img->image, 1.0); } else if (img->w > maxwidth) { draw_image(img->image, x, y, maxwidth, img->h, (int)((double)(img->w - maxwidth) * img->position), 0); } else { draw_image(img->image, x, y, img->w, img->h, 0, 0); } return (img->zoom || img->w <= maxwidth) ? img->h : img->h * maxwidth / img->w; } /* Draw macros added, to reduce future line edits. */ #define DRAW_FT_RECT(color) draw_rect_fill(dx, y, d_width, FILE_TRANSFER_BOX_HEIGHT, color) #define DRAW_FT_PROG(color) draw_rect_fill(dx, y, prog_bar, FILE_TRANSFER_BOX_HEIGHT, color) #define DRAW_FT_CAP(bg, fg) \ do { \ drawalpha(BM_FT_CAP, dx - room_for_clip, y, BM_FT_CAP_WIDTH, BM_FTB_HEIGHT, bg); \ drawalpha(BM_FILE, dx - room_for_clip + SCALE(4), y + SCALE(4), BM_FILE_WIDTH, BM_FILE_HEIGHT, fg); \ } while (0) /* Always first */ #define DRAW_FT_NO_BTN() \ do { \ drawalpha(BM_FTB1, btnx, tbtn_bg_y, btn_bg_w, tbtn_bg_h, \ (mouse_left_btn ? COLOR_BTN_DANGER_BKGRND_HOVER : COLOR_BTN_SUCCESS_BKGRND)); \ drawalpha(BM_NO, btnx + ((btn_bg_w - btnw) / 2), tbtn_y, btnw, btnh, \ (mouse_left_btn ? COLOR_BTN_DANGER_TEXT_HOVER : COLOR_BTN_DANGER_TEXT)); \ } while (0) /* Always last */ #define DRAW_FT_YES_BTN() \ do { \ drawalpha(BM_FTB2, btnx + btn_bg_w + SCALE(2), tbtn_bg_y, btn_bg_w, tbtn_bg_h, \ (mouse_rght_btn ? COLOR_BTN_SUCCESS_BKGRND_HOVER : COLOR_BTN_SUCCESS_BKGRND)); \ drawalpha(BM_YES, btnx + btn_bg_w + SCALE(2) + ((btn_bg_w - btnw) / 2), tbtn_y, btnw, btnh, \ (mouse_rght_btn ? COLOR_BTN_SUCCESS_TEXT_HOVER : COLOR_BTN_SUCCESS_TEXT)); \ } while (0) #define DRAW_FT_PAUSE_BTN() \ do { \ drawalpha(BM_FTB2, btnx + btn_bg_w + SCALE(2), tbtn_bg_y, btn_bg_w, tbtn_bg_h, \ (mouse_rght_btn ? COLOR_BTN_SUCCESS_BKGRND_HOVER : COLOR_BTN_SUCCESS_BKGRND)); \ drawalpha(BM_PAUSE, btnx + btn_bg_w + SCALE(2) + ((btn_bg_w - btnw) / 2), tbtn_y, btnw, btnh, \ (mouse_rght_btn ? COLOR_BTN_SUCCESS_TEXT_HOVER : COLOR_BTN_SUCCESS_TEXT)); \ } while (0) #define DRAW_FT_RESUME_BTN() \ do { \ drawalpha(BM_FTB2, btnx + btn_bg_w + SCALE(2), tbtn_bg_y, btn_bg_w, tbtn_bg_h, \ (mouse_rght_btn ? COLOR_BTN_SUCCESS_BKGRND_HOVER : COLOR_BTN_SUCCESS_BKGRND)); \ drawalpha(BM_RESUME, btnx + btn_bg_w + SCALE(2) + ((btn_bg_w - btnw) / 2), tbtn_y, btnw, btnh, \ (mouse_rght_btn ? COLOR_BTN_SUCCESS_TEXT_HOVER : COLOR_BTN_SUCCESS_TEXT)); \ } while (0) #define DRAW_FT_TEXT_RIGHT(str, len) \ do { \ wbound -= (textwidth(str, len) + (SCALE(12))); \ drawtext(wbound, y + SCALE(8), str, len); \ } while (0) #define DRAW_FT_ALPH_RIGHT(bm, col) \ do { \ wbound -= btnw + (SCALE(12)); \ drawalpha(bm, wbound, tbtn_y, btnw, btnh, col); \ } while (0) #define DRAWSTR_FT_RIGHT(t) DRAW_FT_TEXT_RIGHT(S(t), SLEN(t)) static void messages_draw_filetransfer(MESSAGES *m, MSG_FILE *file, uint32_t i, int x, int y, int w, int UNUSED(h)) { // Used in macros. int room_for_clip = BM_FT_CAP_WIDTH + SCALE(2); int dx = x + SCALE(MESSAGES_X) + room_for_clip; int d_width = w - SCALE(MESSAGES_X) - get_time_width() - room_for_clip; /* Mouse Positions */ bool mo = (m->cursor_over_msg == i); bool mouse_over = (mo && m->cursor_over_position) ? 1 : 0; bool mouse_rght_btn = (mo && m->cursor_over_position == 2) ? 1 : 0; bool mouse_left_btn = (mo && m->cursor_over_position == 1) ? 1 : 0; /* Button Background */ int btn_bg_w = BM_FTB_WIDTH; /* Button Background heights */ int tbtn_bg_y = y; int tbtn_bg_h = BM_FTB_HEIGHT; /* Top button info */ int btnx = dx + d_width - (btn_bg_w * 2) - SCALE(2); int tbtn_y = y + SCALE(8); int btnw = BM_FB_WIDTH; int btnh = BM_FB_HEIGHT; long double file_percent = (double)file->progress / (double)file->size; if (file->progress > file->size) { file->progress = file->size; file_percent = 1.0; } char ft_text[file->name_length + 128]; size_t ft_text_length; snprintf(ft_text, sizeof(ft_text), "%.*s ", (int)file->name_length, file->name); ft_text_length = strnlen(ft_text, sizeof(ft_text) - 1); ft_text_length += sprint_humanread_bytes(ft_text + ft_text_length, sizeof(ft_text) - ft_text_length, file->size); setfont(FONT_MISC); setcolor(COLOR_BKGRND_MAIN); int wbound = dx + d_width - SCALE(6); switch (file->file_status) { case FILE_TRANSFER_STATUS_NONE: case FILE_TRANSFER_STATUS_ACTIVE: case FILE_TRANSFER_STATUS_PAUSED_US: case FILE_TRANSFER_STATUS_PAUSED_BOTH: case FILE_TRANSFER_STATUS_PAUSED_THEM: { int ftb_allowance = (BM_FTB_WIDTH * 2) + (SCALE(4)); d_width -= ftb_allowance; wbound -= ftb_allowance; break; } default: { // we'll round the corner even without buttons. d_width -= btn_bg_w; break; } } // progress rectangle uint32_t prog_bar = (file->size == 0) ? 0 : ((long double)d_width * file_percent); switch (file->file_status) { case FILE_TRANSFER_STATUS_COMPLETED: { /* If mouse over use hover color */ uint32_t text = mouse_over ? COLOR_BTN_SUCCESS_TEXT_HOVER : COLOR_BTN_SUCCESS_TEXT, background = mouse_over ? COLOR_BTN_SUCCESS_BKGRND_HOVER : COLOR_BTN_SUCCESS_BKGRND; setcolor(text); DRAW_FT_CAP(background, text); DRAW_FT_RECT(background); drawalpha(BM_FTB2, dx + d_width, tbtn_bg_y, btn_bg_w, tbtn_bg_h, background); if (file->inline_png) { DRAWSTR_FT_RIGHT(CLICKTOSAVE); } else { DRAWSTR_FT_RIGHT(CLICKTOOPEN); } DRAW_FT_ALPH_RIGHT(BM_YES, text); break; } case FILE_TRANSFER_STATUS_KILLED: { setcolor(COLOR_BTN_DANGER_TEXT); DRAW_FT_CAP(COLOR_BTN_DANGER_BACKGROUND, COLOR_BTN_DANGER_TEXT); DRAW_FT_RECT(COLOR_BTN_DANGER_BACKGROUND); drawalpha(BM_FTB2, dx + d_width, tbtn_bg_y, btn_bg_w, tbtn_bg_h, COLOR_BTN_DANGER_BACKGROUND); DRAWSTR_FT_RIGHT(TRANSFER_CANCELLED); DRAW_FT_ALPH_RIGHT(BM_NO, COLOR_BTN_DANGER_TEXT); break; } case FILE_TRANSFER_STATUS_BROKEN: { setcolor(COLOR_BTN_DANGER_TEXT); DRAW_FT_CAP(COLOR_BTN_DANGER_BACKGROUND, COLOR_BTN_DANGER_TEXT); DRAW_FT_RECT(COLOR_BTN_DANGER_BACKGROUND); drawalpha(BM_FTB2, dx + d_width, tbtn_bg_y, btn_bg_w, tbtn_bg_h, COLOR_BTN_DANGER_BACKGROUND); DRAWSTR_FT_RIGHT(TRANSFER_BROKEN); DRAW_FT_ALPH_RIGHT(BM_NO, COLOR_BTN_DANGER_TEXT); break; } case FILE_TRANSFER_STATUS_NONE: { /* ↑ used for incoming transfers */ setcolor(COLOR_BTN_DISABLED_TRANSFER); DRAW_FT_CAP(COLOR_BTN_DISABLED_BKGRND, COLOR_BTN_DISABLED_TRANSFER); DRAW_FT_RECT(COLOR_BTN_DISABLED_BKGRND); DRAW_FT_NO_BTN(); DRAW_FT_YES_BTN(); DRAW_FT_PROG(COLOR_BTN_DISABLED_FORGRND); break; } case FILE_TRANSFER_STATUS_ACTIVE: { setcolor(COLOR_BTN_INPROGRESS_TEXT); DRAW_FT_CAP(COLOR_BTN_INPROGRESS_BKGRND, COLOR_BTN_INPROGRESS_TEXT); DRAW_FT_RECT(COLOR_BTN_INPROGRESS_BKGRND); DRAW_FT_NO_BTN(); DRAW_FT_PAUSE_BTN(); char speed[32] = {0}; size_t speed_len; speed_len = sprint_humanread_bytes(speed, sizeof(speed), file->speed); snprintf(speed + speed_len, sizeof(speed) - speed_len, "/s %lus", file->speed ? (file->size - file->progress) / file->speed : 0); speed_len = strnlen(speed, sizeof(speed) - 1); DRAW_FT_TEXT_RIGHT(speed, speed_len); DRAW_FT_PROG(COLOR_BTN_INPROGRESS_FORGRND); break; } case FILE_TRANSFER_STATUS_PAUSED_US: case FILE_TRANSFER_STATUS_PAUSED_BOTH: case FILE_TRANSFER_STATUS_PAUSED_THEM: { setcolor(COLOR_BTN_DISABLED_TRANSFER); DRAW_FT_CAP(COLOR_BTN_DISABLED_BKGRND, COLOR_BTN_DISABLED_TRANSFER); DRAW_FT_RECT(COLOR_BTN_DISABLED_BKGRND); DRAW_FT_NO_BTN(); if (file->file_status == FILE_TRANSFER_STATUS_PAUSED_BOTH || file->file_status == FILE_TRANSFER_STATUS_PAUSED_US) { /* Paused by at least us */ DRAW_FT_RESUME_BTN(); } else { /* Paused only by them */ DRAW_FT_PAUSE_BTN(); } DRAW_FT_PROG(COLOR_BTN_DISABLED_FORGRND); break; } } setfont(FONT_TEXT); drawtextrange(dx + SCALE(10), wbound - SCALE(10), y + SCALE(6), ft_text, ft_text_length); } /* This is a bit hacky, and likely would benefit from being moved to a whole new section including separating * group messages/functions from friend messages and functions from inside ui.c. * * Ideally group and friend messages wouldn't even need to know about each other. */ static int messages_draw_group(MESSAGES *m, MSG_HEADER *msg, uint32_t curr_msg_i, int x, int y, int width, int height) { uint32_t h1 = UINT32_MAX, h2 = UINT32_MAX; if ((m->sel_start_msg > curr_msg_i && m->sel_end_msg > curr_msg_i) || (m->sel_start_msg < curr_msg_i && m->sel_end_msg < curr_msg_i)) { /* Out side the highlight area */ h1 = UINT32_MAX; h2 = UINT32_MAX; } else { if (m->sel_start_msg < curr_msg_i) { h1 = 0; } else { h1 = m->sel_start_position; } if (m->sel_end_msg > curr_msg_i) { h2 = msg->via.grp.length; } else { h2 = m->sel_end_position; } } /* error check */ if ((m->sel_start_msg == m->sel_end_msg && m->sel_start_position == m->sel_end_position) || h1 == h2) { h1 = UINT32_MAX; h2 = UINT32_MAX; } messages_draw_author(x, y, SCALE(MESSAGES_X - NAME_OFFSET), msg->via.grp.author, msg->via.grp.author_length, msg->via.grp.author_color); messages_draw_timestamp(x + width, y, &msg->time); return messages_draw_text(msg->via.grp.msg, msg->via.grp.length, msg->height, msg->msg_type, msg->our_msg, 1, h1, h2, x + SCALE(MESSAGES_X), y, width - get_time_width() - SCALE(MESSAGES_X), height) + MESSAGES_SPACING; } static int messages_time_change(MESSAGES *m, MSG_HEADER *msg, size_t index, int x, int y, int width, int height) { uint32_t h1 = UINT32_MAX, h2 = UINT32_MAX; if ((m->sel_start_msg > index && m->sel_end_msg > index) || (m->sel_start_msg < index && m->sel_end_msg < index)) { /* Out side the highlight area */ h1 = UINT32_MAX; h2 = UINT32_MAX; } else { if (m->sel_start_msg < index) { h1 = 0; } else { h1 = m->sel_start_position; } if (m->sel_end_msg > index) { h2 = msg->via.notice.length; } else { h2 = m->sel_end_position; } } /* error check */ if ((m->sel_start_msg == m->sel_end_msg && m->sel_start_position == m->sel_end_position) || h1 == h2) { h1 = UINT32_MAX; h2 = UINT32_MAX; } /* text.c is super broken, so we have to be hacky here */ if (h2 != msg->via.notice.length) { if (m->sel_end_msg != index) { h2 = msg->via.notice.length - h2; } else { h2 -= h1; } } return messages_draw_text(msg->via.notice.msg, msg->via.notice.length, msg->height, msg->msg_type, msg->our_msg, msg->receipt_time, h1, h2, x + SCALE(MESSAGES_X), y, width - get_time_width() - SCALE(MESSAGES_X), height); } /** Formats all messages from self and friends, and then call draw functions * to write them to the UI. * * accepts: messages struct *pointer, int x,y positions, int width,height */ void messages_draw(PANEL *panel, int x, int y, int width, int height) { if (width - SCALE(MESSAGES_X) - get_time_width() <= 0) { return; } pthread_mutex_lock(&messages_lock); MESSAGES *m = panel->object; // Do not draw author name next to every message uint8_t lastauthor = 0xFF; // Message iterator MSG_HEADER **p = m->data; uint32_t n = m->number; if (m->width != width) { m->width = width; messages_updateheight(m, width - SCALE(MESSAGES_X) + get_time_width()); y -= scroll_gety(panel->content_scroll, height); } // Go through messages for (size_t curr_msg_i = 0; curr_msg_i != n; curr_msg_i++) { MSG_HEADER *msg = *p++; /* Decide if we should even bother drawing this message. */ if (msg->height == 0) { /* Empty message */ pthread_mutex_unlock(&messages_lock); return; } else if (y + msg->height <= (unsigned)SCALE(MAIN_TOP)) { /* message is exclusively above the viewing window */ y += msg->height; continue; } else if (y >= height + SCALE(100)) { // NOTE: should not be constant 100 /* Message is exclusively below the viewing window */ break; } // Draw the names for groups or friends if (m->is_groupchat) { y = messages_draw_group(m, msg, curr_msg_i, x, y, width, height); continue; } else { bool draw_author = true; switch (msg->msg_type) { case MSG_TYPE_NULL: { // This shouldn't happen. LOG_ERR("Messages", "Invalid message type in messages_draw."); break; } case MSG_TYPE_ACTION_TEXT: { // Always draw name next to action message lastauthor = ~0; break; } case MSG_TYPE_TEXT: case MSG_TYPE_IMAGE: case MSG_TYPE_FILE: { draw_author = true; break; } case MSG_TYPE_NOTICE: case MSG_TYPE_NOTICE_DAY_CHANGE: { draw_author = false; break; } } if (draw_author) { if (msg->our_msg != lastauthor || y < SCALE(MAIN_TOP) + font_small_lineheight) { int msg_y = y; // If previous author label is invisible (i.e. above top side of the messages window) // than clear its old place by drawing a rectangle with background colour. // After that we are able to draw a new author label at the same place. if (y < SCALE(MAIN_TOP) + font_small_lineheight) { msg_y = SCALE(MAIN_TOP); // MAIN_TOP + 1 because otherwise it cuts off one pixel from TOP FRAME somehow draw_rect_fill(x, SCALE(MAIN_TOP) + 1, SCALE(MESSAGES_X), font_small_lineheight, COLOR_BKGRND_MAIN); } FRIEND *f = get_friend(m->id); if (msg->our_msg) { messages_draw_author(x, msg_y, SCALE(MESSAGES_X - NAME_OFFSET), self.name, self.name_length, COLOR_MAIN_TEXT_SUBTEXT); } else if (f->alias) { messages_draw_author(x, msg_y, SCALE(MESSAGES_X - NAME_OFFSET), f->alias, f->alias_length, COLOR_MAIN_TEXT_CHAT); } else { messages_draw_author(x, msg_y, SCALE(MESSAGES_X - NAME_OFFSET), f->name, f->name_length, COLOR_MAIN_TEXT_CHAT); } lastauthor = msg->our_msg; } } } // Draw message contents switch (msg->msg_type) { case MSG_TYPE_NULL: { LOG_ERR("Messages", "Error msg type is null"); break; } case MSG_TYPE_TEXT: case MSG_TYPE_ACTION_TEXT: case MSG_TYPE_NOTICE: { // Draw timestamps messages_draw_timestamp(x + width, y, &msg->time); y = messages_time_change(m, msg, curr_msg_i, x, y, width, height); break; } case MSG_TYPE_NOTICE_DAY_CHANGE: { y = messages_time_change(m, msg, curr_msg_i, x, y, width, height); break; } // Draw image case MSG_TYPE_IMAGE: { y += messages_draw_image(&msg->via.img, x + SCALE(MESSAGES_X), y, width - SCALE(MESSAGES_X) - get_time_width()); break; } // Draw file transfer case MSG_TYPE_FILE: { messages_draw_filetransfer(m, &msg->via.ft, curr_msg_i, x, y, width, height); y += FILE_TRANSFER_BOX_HEIGHT; break; } } y += MESSAGES_SPACING; } pthread_mutex_unlock(&messages_lock); } static bool messages_mmove_text(MESSAGES *m, int width, int mx, int my, int dy, char *message, uint32_t msg_height, uint16_t msg_length) { if (mx < width - get_time_width()) { cursor = CURSOR_TEXT; } m->cursor_over_position = hittextmultiline(mx - SCALE(MESSAGES_X), width - SCALE(MESSAGES_X) - get_time_width(), (my < 0 ? 0 : my), msg_height, font_small_lineheight, message, msg_length, 1); if (my < 0 || my >= dy || mx < SCALE(MESSAGES_X) || m->cursor_over_position == msg_length) { m->cursor_over_uri = UINT32_MAX; return 0; } bool prev_cursor_down_uri = m->cursor_down_uri; if (m->cursor_over_uri != UINT32_MAX) { m->cursor_down_uri = 0; m->cursor_over_uri = UINT32_MAX; } /* Seek back to the last word/line break */ char *str = message + m->cursor_over_position; while (str != message) { str--; if (*str == ' ' || *str == '\n') { str++; break; } } /* Check if it's a URI we handle TODO: handle moar! */ char *end = message + msg_length; while (str != end && *str != ' ' && *str != '\n') { if (str == message || *(str - 1) == '\n' || *(str - 1) == ' ') { if (m->cursor_over_uri == UINT32_MAX && end - str >= 7 && (strncmp(str, "http://", 7) == 0)) { cursor = CURSOR_HAND; m->cursor_over_uri = str - message; } else if (m->cursor_over_uri == UINT32_MAX && end - str >= 8 && (strncmp(str, "https://", 8) == 0)) { cursor = CURSOR_HAND; m->cursor_over_uri = str - message; } else if (m->cursor_over_uri == UINT32_MAX && end - str >= 4 && (strncmp(str, "tox:", 4) == 0)) { cursor = CURSOR_HAND; m->cursor_over_uri = str - message; } } str++; } if (m->cursor_over_uri != UINT32_MAX) { m->urllen = (str - message) - m->cursor_over_uri; m->cursor_down_uri = prev_cursor_down_uri; LOG_TRACE("Messages", "urllen %u" , m->urllen); } return 0; } static bool messages_mmove_image(MSG_IMG *image, uint32_t max_width, int mx, int my) { if (image->w > max_width) { mx -= SCALE(MESSAGES_X); int w = image->w > max_width ? max_width : image->w; int h = (image->zoom || image->w <= max_width) ? image->h : image->h * max_width / image->w; if (mx >= 0 && my >= 0 && mx < w && my < h) { cursor = CURSOR_ZOOM_IN + image->zoom; return 1; } } return 0; } static uint8_t messages_mmove_filetransfer(int mx, int my, int width) { mx -= SCALE(10); /* Why? */ if (mx >= 0 && mx < width && my >= 0 && my < FILE_TRANSFER_BOX_HEIGHT) { if (mx >= width - get_time_width() - (BM_FTB_WIDTH * 2) - SCALE(2) - SCROLL_WIDTH && mx <= width - get_time_width() - SCROLL_WIDTH) { if (mx >= width - get_time_width() - BM_FTB_WIDTH - SCROLL_WIDTH) { // mouse is over the right button (pause / accept) return 2; } else { // mouse is over the left button (cancel) return 1; } } return 3; } return 0; } bool messages_mmove(PANEL *panel, int UNUSED(px), int UNUSED(py), int width, int UNUSED(height), int mx, int my, int dx, int UNUSED(dy)) { MESSAGES *m = panel->object; m->cursor_over_time = inrect(mx, my, width - get_time_width(), 0, get_time_width(), m->height); if (m->cursor_down_msg < m->number) { uint32_t maxwidth = width - SCALE(MESSAGES_X) - get_time_width(); MSG_HEADER *msg = m->data[m->cursor_down_msg]; if ((msg->msg_type == MSG_TYPE_IMAGE) && (msg->via.img.w > maxwidth)) { msg->via.img.position -= (double)dx / (double)(msg->via.img.w - maxwidth); if (msg->via.img.position > 1.0) { msg->via.img.position = 1.0; } else if (msg->via.img.position < 0.0) { msg->via.img.position = 0.0; } cursor = CURSOR_ZOOM_OUT; return true; } } if (mx < 0 || my < 0 || my > m->height) { if (m->cursor_over_msg != UINT32_MAX) { m->cursor_over_msg = UINT32_MAX; return true; } return false; } setfont(FONT_TEXT); MSG_HEADER **p = m->data; uint32_t i = 0; bool need_redraw = false; while (i < m->number) { MSG_HEADER *msg = *p++; int dy = msg->height; /* dy is the wrong name here, you should change it! */ if (my >= 0 && my < dy) { m->cursor_over_msg = i; switch (msg->msg_type) { case MSG_TYPE_NULL: { LOG_ERR("Messages", "Invalid message type in messages_mmove."); return false; } case MSG_TYPE_TEXT: case MSG_TYPE_ACTION_TEXT: case MSG_TYPE_NOTICE: case MSG_TYPE_NOTICE_DAY_CHANGE: { if (m->is_groupchat) { messages_mmove_text(m, width, mx, my, dy, msg->via.grp.msg, msg->height, msg->via.grp.length); } else { messages_mmove_text(m, width, mx, my, dy, msg->via.txt.msg, msg->height, msg->via.txt.length); } if (m->cursor_down_msg != UINT32_MAX && (m->cursor_down_position != m->cursor_over_position || m->cursor_down_msg != m->cursor_over_msg)) { m->selecting_text = 1; } break; } case MSG_TYPE_IMAGE: { m->cursor_over_position = messages_mmove_image(&msg->via.img, (width - SCALE(MESSAGES_X) - get_time_width()), mx, my); break; } case MSG_TYPE_FILE: { m->cursor_over_position = messages_mmove_filetransfer(mx, my, width); if (m->cursor_over_position) { need_redraw = true; } break; } } if (i != m->cursor_over_msg && m->cursor_over_msg != UINT32_MAX && (msg->msg_type == MSG_TYPE_FILE || m->data[m->cursor_over_msg]->msg_type == MSG_TYPE_FILE)) { need_redraw = true; // Redraw file on hover-in/out. } if (m->selecting_text) { need_redraw = true; if (m->cursor_down_msg != m->cursor_over_msg || m->cursor_down_position <= m->cursor_over_position) { m->sel_start_position = m->cursor_down_position; m->sel_end_position = m->cursor_over_position; } else { m->sel_start_position = m->cursor_over_position; m->sel_end_position = m->cursor_down_position; } if (m->cursor_down_msg <= m->cursor_over_msg) { m->sel_start_msg = m->cursor_down_msg; m->sel_end_msg = m->cursor_over_msg; } else { m->sel_start_msg = m->cursor_over_msg; m->sel_end_msg = m->cursor_down_msg; m->sel_start_position = m->cursor_over_position; m->sel_end_position = m->cursor_down_position; } } return need_redraw; } my -= dy; i++; } return false; } bool messages_mdown(PANEL *panel) { MESSAGES *m = panel->object; m->cursor_down_msg = UINT32_MAX; if (m->cursor_over_msg != UINT32_MAX) { MSG_HEADER *msg = m->data[m->cursor_over_msg]; switch (msg->msg_type) { case MSG_TYPE_NULL: { LOG_ERR("Messages", "Invalid message type in messages_mdown."); return false; } case MSG_TYPE_TEXT: case MSG_TYPE_ACTION_TEXT: case MSG_TYPE_NOTICE: case MSG_TYPE_NOTICE_DAY_CHANGE: { if (m->cursor_over_uri != UINT32_MAX) { m->cursor_down_uri = m->cursor_over_uri; LOG_TRACE("Messages", "mdn dURI %u, oURI %u" , m->cursor_down_uri, m->cursor_over_uri); } m->sel_start_msg = m->sel_end_msg = m->cursor_down_msg = m->cursor_over_msg; m->sel_start_position = m->sel_end_position = m->cursor_down_position = m->cursor_over_position; break; } case MSG_TYPE_IMAGE: { if (m->cursor_over_position) { if (!msg->via.img.zoom) { msg->via.img.zoom = 1; message_updateheight(m, msg); } else { m->cursor_down_msg = m->cursor_over_msg; } } break; } case MSG_TYPE_FILE: { if (m->cursor_over_position == 0) { break; } FRIEND *f = get_friend(m->id); FILE_TRANSFER *ft; uint32_t ft_number = msg->via.ft.file_number; if (ft_number >= (1 << 16)) { ft = &f->ft_incoming[(ft_number >> 16) - 1]; // TODO, abstraction needed } else { ft = &f->ft_outgoing[ft_number]; // TODO, abstraction needed } if (msg->via.ft.file_status == FILE_TRANSFER_STATUS_COMPLETED) { if (m->cursor_over_position) { if (msg->via.ft.inline_png) { file_save_inline_image_png(msg); } else { openurl((char *)msg->via.ft.path); } } return true; } if (m->cursor_over_position == 2) { // Right button, should be accept/pause/resume if (!msg->our_msg && msg->via.ft.file_status == FILE_TRANSFER_STATUS_NONE) { native_select_dir_ft(m->id, msg->via.ft.file_number, ft); return true; } if (msg->via.ft.file_status == FILE_TRANSFER_STATUS_ACTIVE) { postmessage_toxcore(TOX_FILE_PAUSE, m->id, msg->via.ft.file_number, ft); } else { postmessage_toxcore(TOX_FILE_RESUME, m->id, msg->via.ft.file_number, ft); } } else if (m->cursor_over_position == 1) { // Should be cancel postmessage_toxcore(TOX_FILE_CANCEL, m->id, msg->via.ft.file_number, ft); } return true; } } return true; } else if (m->sel_start_msg != m->sel_end_msg || m->sel_start_position != m->sel_end_position) { m->sel_start_msg = 0; m->sel_end_msg = 0; m->sel_start_position = 0; m->sel_end_position = 0; return true; } return false; } bool messages_dclick(PANEL *panel, bool triclick) { MESSAGES *m = panel->object; if (m->cursor_over_time) { settings.use_long_time_msg = !settings.use_long_time_msg; return true; } if (m->cursor_over_msg == UINT32_MAX) { return false; } MSG_HEADER *msg = m->data[m->cursor_over_msg]; switch (msg->msg_type) { case MSG_TYPE_NULL: { LOG_ERR("Messages", "Invalid message type in messages_dclick."); return false; } case MSG_TYPE_FILE: case MSG_TYPE_NOTICE: case MSG_TYPE_NOTICE_DAY_CHANGE: { return false; } case MSG_TYPE_TEXT: case MSG_TYPE_ACTION_TEXT: { m->sel_start_msg = m->sel_end_msg = m->cursor_over_msg; uint16_t i = m->cursor_over_position; while (i != 0 && msg->via.txt.msg[i - 1] != '\n' /* If it's a dclick, also set ' ' as boundary, else do nothing. */ && (!triclick ? (msg->via.txt.msg[i - 1] != ' ') : 1)) { i -= utf8_unlen(msg->via.txt.msg + i); } m->sel_start_position = i; i = m->cursor_over_position; while (i != msg->via.txt.length && msg->via.txt.msg[i] != '\n' /* If it's a dclick, also set ' ' as boundary, else do nothing. */ && (!triclick ? (msg->via.txt.msg[i] != ' ') : 1)) { i += utf8_len(msg->via.txt.msg + i); } m->sel_end_position = i; uint32_t diff = m->sel_end_position - m->sel_start_position; setselection(msg->via.txt.msg + m->sel_start_position, diff); return true; } case MSG_TYPE_IMAGE: { if (m->cursor_over_position) { if (msg->via.img.zoom) { msg->via.img.zoom = 0; message_updateheight(m, msg); } } return true; } } return false; } static void contextmenu_messages_onselect(uint8_t i) { copy(!!i); /* if not 0 force a 1 */ } bool messages_mright(PANEL *panel) { const MESSAGES *m = panel->object; if (m->cursor_over_msg == UINT32_MAX) { return false; } const MSG_HEADER *msg = m->data[m->cursor_over_msg]; switch (msg->msg_type) { case MSG_TYPE_NULL: { LOG_ERR("Messages", "Invalid message type in messages_mdown."); return false; } case MSG_TYPE_TEXT: case MSG_TYPE_ACTION_TEXT: { static UTOX_I18N_STR menu_copy[] = { STR_COPY, STR_COPY_WITH_NAMES }; contextmenu_new(COUNTOF(menu_copy), menu_copy, contextmenu_messages_onselect); return true; } case MSG_TYPE_NOTICE: case MSG_TYPE_NOTICE_DAY_CHANGE: case MSG_TYPE_IMAGE: case MSG_TYPE_FILE: { return false; } } LOG_FATAL_ERR(EXIT_FAILURE, "Messages", "Congratulations, you've reached dead code. Please report this."); } bool messages_mwheel(PANEL *UNUSED(panel), int UNUSED(height), double UNUSED(d), bool UNUSED(smooth)) { return false; } bool messages_mup(PANEL *panel) { MESSAGES *m = panel->object; if (!m->data) { return false; } if (m->cursor_over_msg != UINT32_MAX) { MSG_HEADER *msg = m->data[m->cursor_over_msg]; if (msg->msg_type == MSG_TYPE_TEXT) { if (m->cursor_over_uri != UINT32_MAX && m->cursor_down_uri == m->cursor_over_uri && m->cursor_over_position >= m->cursor_over_uri && m->cursor_over_position <= m->cursor_over_uri + m->urllen - 1 /* - 1 Don't open on white space */ && !m->selecting_text) { LOG_TRACE("Messages", "mup dURI %u, oURI %u" , m->cursor_down_uri, m->cursor_over_uri); char url[m->urllen + 1]; memcpy(url, msg->via.txt.msg + m->cursor_over_uri, m->urllen * sizeof(char)); url[m->urllen] = 0; openurl(url); m->cursor_down_uri = 0; } } } if (m->selecting_text) { const uint32_t max_selection_size = UINT16_MAX + 1; char *sel = calloc(1, max_selection_size); if (!sel) { LOG_FATAL_ERR(EXIT_MALLOC, "Messages", "Couldn't allocate memory for selection."); } setselection(sel, messages_selection(panel, sel, max_selection_size, 0)); free(sel); m->selecting_text = 0; } m->cursor_down_msg = UINT32_MAX; return false; } bool messages_mleave(PANEL *UNUSED(m)) { return false; } int messages_selection(PANEL *panel, char *buffer, uint32_t len, bool names) { MESSAGES *m = panel->object; if (m->number == 0) { return 0; } uint32_t i = m->sel_start_msg, n = m->sel_end_msg + 1; MSG_HEADER **dp = &m->data[i]; char *p = buffer; while (i != UINT32_MAX && i != n) { const MSG_HEADER *msg = *dp++; if (names && (i != m->sel_start_msg || m->sel_start_position == 0)) { if (m->is_groupchat) { memcpy(p, msg->via.grp.author, msg->via.grp.author_length); p += msg->via.grp.author_length; len -= msg->via.grp.author_length; } else { const FRIEND *f = get_friend(m->id); if (!msg->our_msg) { if (len <= f->name_length) { break; } memcpy(p, f->name, f->name_length); p += f->name_length; len -= f->name_length; } else { if (len <= self.name_length) { break; } memcpy(p, self.name, self.name_length); p += self.name_length; len -= self.name_length; } } if (len <= 2) { break; } strcpy2(p, ": "); p += 2; len -= 2; } switch (msg->msg_type) { case MSG_TYPE_NULL: { LOG_ERR("Messages", "Invalid message type in messages_selection."); return 0; } case MSG_TYPE_TEXT: case MSG_TYPE_ACTION_TEXT: { char *data; uint16_t length; if (i == m->sel_start_msg) { if (i == m->sel_end_msg) { data = msg->via.txt.msg + m->sel_start_position; length = m->sel_end_position - m->sel_start_position; } else { data = msg->via.txt.msg + m->sel_start_position; length = msg->via.txt.length - m->sel_start_position; } } else if (i == m->sel_end_msg) { data = msg->via.txt.msg; length = m->sel_end_position; } else { data = msg->via.txt.msg; length = msg->via.txt.length; } if (len <= length) { *p = 0; return p - buffer; } memcpy(p, data, length); p += length; len -= length; break; } case MSG_TYPE_IMAGE: case MSG_TYPE_FILE: case MSG_TYPE_NOTICE: case MSG_TYPE_NOTICE_DAY_CHANGE: { // Do nothing. break; } } i++; if (i != n) { #ifdef __WIN32__ if (len <= 2) { break; } *p++ = '\r'; *p++ = '\n'; len -= 2; #else if (len <= 1) { break; } *p++ = '\n'; len--; #endif } } return p - buffer; } void messages_updateheight(MESSAGES *m, int width) { if (!m->data || !width) { return; } setfont(FONT_TEXT); uint32_t height = 0; for (uint32_t i = 0; i < m->number; ++i) { height += message_setheight(m, (void *)m->data[i]); } m->panel.content_scroll->content_height = m->height = height; } bool messages_char(uint32_t ch) { MESSAGES *m; if (flist_get_sel_friend()) { m = messages_friend.object; } else if (flist_get_sel_group()) { m = messages_group.object; } else { LOG_TRACE("Messages", "Can't type to nowhere"); return false; } switch (ch) { // TODO: probably need to fix this section :< m->panel.content scroll is likely to be wrong. case KEY_PAGEUP: { SCROLLABLE *scroll = m->panel.content_scroll; scroll->d -= 0.25; // TODO: Change to a full chat-screen height. if (scroll->d < 0.0) { scroll->d = 0.0; } return true; } case KEY_PAGEDOWN: { SCROLLABLE *scroll = m->panel.content_scroll; scroll->d += 0.25; // TODO: Change to a full chat-screen height. if (scroll->d > 1.0) { scroll->d = 1.0; } return true; } case KEY_HOME: { m->panel.content_scroll->d = 0.0; return true; } case KEY_END: { m->panel.content_scroll->d = 1.0; return true; } } return false; } void messages_init(MESSAGES *m, uint32_t friend_number) { if (m->data) { messages_clear_all(m); } pthread_mutex_lock(&messages_lock); memset(m, 0, sizeof(*m)); m->id = friend_number; m->extra = 20; m->data = calloc(20, sizeof(void *)); if (!m->data) { LOG_FATAL_ERR(EXIT_MALLOC, "Messages", "\n\n\nFATAL ERROR TRYING TO CALLOC FOR MESSAGES.\nTHIS IS A BUG, PLEASE REPORT!\n\n\n"); } pthread_mutex_unlock(&messages_lock); } void message_free(MSG_HEADER *msg) { // The group messages are free()d in groups.c (group_free(GROUPCHAT *g)) switch (msg->msg_type) { case MSG_TYPE_NULL: { LOG_ERR("Messages", "Invalid message type in message_free."); break; } case MSG_TYPE_IMAGE: { image_free(msg->via.img.image); break; } case MSG_TYPE_FILE: { free(msg->via.ft.name); free(msg->via.ft.path); free(msg->via.ft.data); break; } case MSG_TYPE_NOTICE_DAY_CHANGE: { free(msg->via.notice_day.msg); break; } case MSG_TYPE_TEXT: { free(msg->via.txt.msg); break; } case MSG_TYPE_ACTION_TEXT: { free(msg->via.action.msg); break; } case MSG_TYPE_NOTICE: { free(msg->via.notice.msg); break; } } free(msg); } void messages_clear_all(MESSAGES *m) { pthread_mutex_lock(&messages_lock); for (uint32_t i = 0; i < m->number; i++) { message_free(m->data[i]); } free(m->data); m->data = NULL; m->number = 0; m->extra = 0; m->height = 0; m->sel_start_msg = m->sel_end_msg = m->sel_start_position = m->sel_end_position = 0; pthread_mutex_unlock(&messages_lock); } uTox/src/main.h0000600000175000001440000000327514003056216012371 0ustar rakusers#ifndef UTOX_MAIN_H #define UTOX_MAIN_H /********************************************************** * Includes *********************************************************/ #include /********************************************************** * uTox Versions and header information *********************************************************/ #include "branding.h" /********************************************************** * UI and Toxcore Limits *********************************************************/ #if TOX_VERSION_IS_API_COMPATIBLE(0, 2, 0) // YAY!! #else #error "Unable to compile uTox with this Toxcore version. uTox expects v0.2.*!" #endif #define MAIN_WIDTH 750 #define MAIN_HEIGHT 500 #ifndef __OBJC__ #define volatile(x)(x) #endif /* Support for large files. */ #define _LARGEFILE_SOURCE #define _FILE_OFFSET_BITS 64 #if TOX_VERSION_MAJOR > 0 #define ENABLE_MULTIDEVICE 1 #endif enum { USER_STATUS_AVAILABLE, USER_STATUS_AWAY_IDLE, USER_STATUS_DO_NOT_DISTURB, }; /** * Takes data and the size of data and writes it to the disk * * Returns a bool indicating whether a save is needed */ bool utox_data_save_tox(uint8_t *data, size_t length); /** * Reads the tox data from the disk and sets size * * Returns a pointer to the tox data, the caller needs to free it * Returns NULL on failure */ uint8_t *utox_data_load_tox(size_t *size); /** * Parses the arguments passed to uTox */ void parse_args(int argc, char *argv[], int8_t *should_launch_at_startup, int8_t *set_show_window, bool *allow_root); /** * Initialize uTox */ void utox_init(void); /** * Free used resources */ void utox_raze(void); #endif uTox/src/main.c0000600000175000001440000002260314003056216012360 0ustar rakusers#include "main.h" #include "debug.h" #include "settings.h" #include "theme.h" #include "native/filesys.h" #include "native/main.h" #include "native/thread.h" #include "av/utox_av.h" #include #include #include /* The utox_ functions contained in src/main.c are wrappers for the platform native_ functions * if you need to localize them to a specific platform, move them from here, to each * src//main.x and change from utox_ to native_ */ bool utox_data_save_tox(uint8_t *data, size_t length) { FILE *fp = utox_get_file("tox_save.tox", NULL, UTOX_FILE_OPTS_WRITE); if (!fp) { LOG_ERR("uTox", "Can not open tox_save.tox to write to it."); return true; } if (fwrite(data, length, 1, fp) != 1) { LOG_ERR("uTox", "Unable to write Tox save to file."); fclose(fp); return true; } flush_file(fp); fclose(fp); return false; } uint8_t *utox_data_load_tox(size_t *size) { const char name[][20] = { "tox_save.tox", "tox_save.tox.atomic", "tox_save.tmp", "tox_save" }; for (uint8_t i = 0; i < 4; i++) { size_t length = 0; FILE *fp = utox_get_file(name[i], &length, UTOX_FILE_OPTS_READ); if (!fp) { continue; } uint8_t *data = calloc(1, length + 1); if (!data) { LOG_ERR("uTox", "Could not allocate memory for tox save."); fclose(fp); // Quit. We're out of memory, calloc will fail again. return NULL; } if (fread(data, length, 1, fp) != 1) { LOG_ERR("uTox", "Could not read: %s.", name[i]); fclose(fp); free(data); // Return NULL, because if a Tox save exits we don't want to fall // back to an old version, we need the user to decide what to do. return NULL; } fclose(fp); *size = length; return data; } return NULL; } bool utox_data_save_ftinfo(char hex[TOX_PUBLIC_KEY_SIZE * 2], uint8_t *data, size_t length) { char name[TOX_PUBLIC_KEY_SIZE * 2 + sizeof(".ftinfo")]; snprintf(name, sizeof(name), "%.*s.ftinfo", TOX_PUBLIC_KEY_SIZE * 2, hex); FILE *fp = utox_get_file(name, NULL, UTOX_FILE_OPTS_WRITE); if (fp == NULL) { return false; } if (fwrite(data, length, 1, fp) != 1) { LOG_ERR("uTox", "Unable to write ftinfo to file."); fclose(fp); return false; } fclose(fp); return true; } /* Shared function between all four platforms */ void parse_args(int argc, char *argv[], int8_t *should_launch_at_startup, int8_t *set_show_window, bool *allow_root ) { // set default options if (should_launch_at_startup) { *should_launch_at_startup = 0; } if (set_show_window) { *set_show_window = 0; } if (allow_root) { *allow_root = false; } static struct option long_options[] = { { "theme", required_argument, NULL, 't' }, { "portable", no_argument, NULL, 'p' }, { "set", required_argument, NULL, 's' }, { "unset", required_argument, NULL, 'u' }, { "version", no_argument, NULL, 0 }, { "silent", no_argument, NULL, 'S' }, { "verbose", no_argument, NULL, 'v' }, { "help", no_argument, NULL, 'h' }, { "debug", required_argument, NULL, 1 }, { "allow-root", no_argument, NULL, 2 }, { 0, 0, 0, 0 } }; settings.debug_file = stdout; int opt, long_index = 0; while ((opt = getopt_long(argc, argv, "t:ps:u:nvh", long_options, &long_index)) != -1) { // loop through each option; ":" after each option means an argument is required switch (opt) { case 't': { if (!strcmp(optarg, "default")) { settings.theme = THEME_DEFAULT; } else if (!strcmp(optarg, "dark")) { settings.theme = THEME_DARK; } else if (!strcmp(optarg, "light")) { settings.theme = THEME_LIGHT; } else if (!strcmp(optarg, "highcontrast")) { settings.theme = THEME_HIGHCONTRAST; } else if (!strcmp(optarg, "zenburn")) { settings.theme = THEME_ZENBURN; } else if (!strcmp(optarg, "solarized-light")) { settings.theme = THEME_SOLARIZED_LIGHT; } else if (!strcmp(optarg, "solarized-dark")) { settings.theme = THEME_SOLARIZED_DARK; } else { LOG_NORM("Please specify correct theme (please check user manual for list of correct values).\n"); exit(EXIT_FAILURE); } break; } case 'p': { LOG_INFO("uTox", "Launching uTox in portable mode: All data will be saved to the tox folder in the current " "working directory\n"); settings.portable_mode = 1; break; } case 's': { if (!strcmp(optarg, "start-on-boot")) { if (should_launch_at_startup) { *should_launch_at_startup = 1; } } else if (!strcmp(optarg, "show-window")) { if (set_show_window) { *set_show_window = 1; } } else if (!strcmp(optarg, "hide-window")) { if (set_show_window) { *set_show_window = -1; } } else { LOG_NORM("Please specify a correct set option (please check user manual for list of correct values).\n"); exit(EXIT_FAILURE); } break; } case 'u': { if (!strcmp(optarg, "start-on-boot")) { if (should_launch_at_startup) { *should_launch_at_startup = -1; } } else { LOG_NORM("Please specify a correct unset option (please check user manual for list of correct values).\n"); exit(EXIT_FAILURE); } break; } case 0: { LOG_NORM("uTox version: %s\n", VERSION); #ifdef GIT_VERSION LOG_NORM("git version %s\n", GIT_VERSION); #endif exit(EXIT_SUCCESS); } case 'S': { settings.verbose = LOG_LVL_FATAL; break; } case 'v': { settings.verbose++; break; } case 1: { settings.debug_file = fopen(optarg, "a+"); if (!settings.debug_file) { settings.debug_file = stdout; LOG_NORM("Could not open %s. Logging to stdout.\n", optarg); } break; } case 2: { if (allow_root) { *allow_root = true; } break; } case 'h': { LOG_NORM("µTox - Lightweight Tox client version %s.\n\n", VERSION); LOG_NORM("The following options are available:\n"); LOG_NORM(" -t --theme= Specify a UI theme, where can be one of default, " "dark, light, highcontrast, zenburn, solarized-light, solarized-dark.\n"); LOG_NORM(" -p --portable Launch in portable mode: All data will be saved to the tox " "folder in the current working directory.\n"); LOG_NORM(" -s --set= uTox/src/cocoa/Info.plist.in0000600000175000001440000000272014003056216014727 0ustar rakusers CFBundleDevelopmentRegion en CFBundleExecutable @EXECUTABLE_NAME@ CFBundleIconFile @APPLE_ICON@ CFBundleIdentifier io.utox.future CFBundleInfoDictionaryVersion 6.0 CFBundleName uTox CFBundleDisplayName uTox (Alpha) CFBundleSpokenName u Tox CFBundlePackageType APPL CFBundleShortVersionString @PROJECT_VERSION@ CFBundleVersion @PROJECT_VERSION@ LSMinimumSystemVersion @CMAKE_OSX_DEPLOYMENT_TARGET@ NSHumanReadableCopyright @PROJECT_COPYRIGHT@ NSMainNibFile @APPLE_MENU@ NSPrincipalClass NSApplication CFBundleURLTypes CFBundleURLName Tox CFBundleTypeRole Viewer CFBundleURLSchemes tox uTox/src/cocoa/CMakeLists.txt0000600000175000001440000000132714003056216015114 0ustar rakusersproject(utoxNATIVE LANGUAGES C) add_library(utoxNATIVE STATIC ../posix/filesys.c drawing.m grabdesktop.m interaction.m main.m MainMenu.xib video.m window.c ) target_link_libraries(utoxNATIVE PUBLIC "-framework AppKit" "-framework ApplicationServices" "-framework AVFoundation" "-framework Cocoa" "-framework CoreData" "-framework CoreFoundation" "-framework CoreGraphics" "-framework CoreMedia" "-framework CoreText" "-framework CoreVideo" "-framework Foundation" "-framework OpenAL" "-framework OpenGL" "-framework QuartzCore" -lresolv PRIVATE stb ) uTox/src/chrono.h0000600000175000001440000000127414003056216012732 0ustar rakusers#ifndef CHRONO_H #define CHRONO_H #include #include struct chrono_info { uint8_t *ptr, *target; int step; uint32_t interval_ms; bool finished; void (*callback)(void *); void *cb_data; }; typedef struct chrono_info CHRONO_INFO; extern bool chrono_thread_init; /* * Starts the chrono thread using the information from info * Returns true on success * Returns false on failure */ bool chrono_start(CHRONO_INFO *info); /* * Ends the chrono thread * Returns true on success * Returns false on failure */ bool chrono_end(CHRONO_INFO *info); /* * Sleep and then */ void chrono_callback(uint32_t ms, void func(void *), void *funcargs); #endif uTox/src/chrono.c0000600000175000001440000000223614003056216012724 0ustar rakusers#include "chrono.h" #include "debug.h" #include "macros.h" #include #include #include #include "native/thread.h" bool chrono_thread_init = false; static void chrono_thread(void *args) { LOG_INFO("Chono", "Thread starting"); CHRONO_INFO *info = args; chrono_thread_init = true; while (info->ptr != info->target) { info->ptr += info->step; yieldcpu(info->interval_ms); } chrono_thread_init = false; if (info->callback) { info->callback(info->cb_data); } LOG_INFO("Chrono", "Thread exited cleanly"); } bool chrono_start(CHRONO_INFO *info) { if (!info) { LOG_ERR("Chrono", "Chrono info structure is null."); return false; } thread(chrono_thread, info); return true; } bool chrono_end(CHRONO_INFO *info) { if (!info) { LOG_ERR("Chrono", "Chrono info is null"); return false; } (*info).finished = true; while (chrono_thread_init) { //wait for thread to die yieldcpu(1); } return true; } void chrono_callback(uint32_t ms, void func(void *), void *funcargs) { yieldcpu(ms); func(funcargs); } uTox/src/chatlog.h0000600000175000001440000000317314003056216013063 0ustar rakusers#ifndef CHATLOG_H #define CHATLOG_H #include #include #include #include #define LOGFILE_SAVE_VERSION 3 typedef struct { uint8_t log_version; time_t time; size_t author_length; size_t msg_length; uint8_t author : 1; uint8_t receipt : 1; uint8_t flags : 5; uint8_t deleted : 1; uint8_t msg_type; uint8_t zeroes[2]; } LOG_FILE_MSG_HEADER; typedef struct msg_header MSG_HEADER; /** * Saves chat log for friend with id hex * * Returns the offset on success * Returns 0 on failure */ size_t utox_save_chatlog(char hex[TOX_PUBLIC_KEY_SIZE * 2], uint8_t *data, size_t length); // This one actually does the work of reading the logfile information. MSG_HEADER **utox_load_chatlog(char hex[TOX_PUBLIC_KEY_SIZE * 2], size_t *size, uint32_t count, uint32_t skip); /** utox_update_chatlog Updates the data for this friend's history. * * When given a friend_number and offset, utox_update_chatlog will overwrite the file, with * the supplied data * length. It makes no attempt to verify the data or length, it'll just * write blindly. */ bool utox_update_chatlog(char hex[TOX_PUBLIC_KEY_SIZE * 2], size_t offset, uint8_t *data, size_t length); /** * Deletes the chat log file for the friend with id hex * * Returns bool indicating if it succeeded */ bool utox_remove_friend_chatlog(char hex[TOX_PUBLIC_KEY_SIZE * 2]); /** * Setup for exporting the chat log to plain text */ void utox_export_chatlog_init(uint32_t friend_number); /** * Export the chat log to plain text */ void utox_export_chatlog(char hex[TOX_PUBLIC_KEY_SIZE * 2], FILE *dest_file); #endif uTox/src/chatlog.c0000600000175000001440000002401314003056216013052 0ustar rakusers#include "chatlog.h" #include "filesys.h" // TODO including native.h files should never be needed, refactor filesys.h to provide necessary API #include "debug.h" #include "messages.h" #include "text.h" #include "native/filesys.h" #include #include static FILE* chatlog_get_file(char hex[TOX_PUBLIC_KEY_SIZE * 2], bool append) { char name[TOX_PUBLIC_KEY_SIZE * 2 + sizeof(".new.txt")]; snprintf(name, sizeof(name), "%.*s.new.txt", TOX_PUBLIC_KEY_SIZE * 2, hex); FILE *file; if (append) { file = utox_get_file(name, NULL, UTOX_FILE_OPTS_READ | UTOX_FILE_OPTS_WRITE | UTOX_FILE_OPTS_MKDIR); if (!file) { return NULL; } fseek(file, 0, SEEK_END); } else { file = utox_get_file(name, NULL, UTOX_FILE_OPTS_READ); } return file; } size_t utox_save_chatlog(char hex[TOX_PUBLIC_KEY_SIZE * 2], uint8_t *data, size_t length) { FILE *fp = chatlog_get_file(hex, true); if (!fp) { LOG_ERR("uTox", "Error getting a file handle for this chatlog!"); return 0; } // Seek to the beginning of the file first because grayhatter has had issues with this on Windows. // (and he really doesn't want uTox eating people's chat logs) fseeko(fp, 0, SEEK_SET); fseeko(fp, 0, SEEK_END); off_t offset = ftello(fp); fwrite(data, length, 1, fp); fclose(fp); return offset; } static size_t utox_count_chatlog(char hex[TOX_PUBLIC_KEY_SIZE * 2]) { FILE *file = chatlog_get_file(hex, false); if (!file) { return 0; } LOG_FILE_MSG_HEADER header; size_t records_count = 0; while (fread(&header, sizeof(header), 1, file) == 1) { fseeko(file, header.author_length + header.msg_length + 1, SEEK_CUR); records_count++; } if (ferror(file) || !feof(file)) { /* TODO: consider removing or truncating the log file. * If !feof() this means that the file has an incomplete record, * which would prevent it from loading forever, even though * new records will keep being appended as usual. */ LOG_ERR("Chatlog", "Log read err; trying to count history for friend %.*s", TOX_PUBLIC_KEY_SIZE * 2, hex); fclose(file); return 0; } fclose(file); return records_count; } /* TODO create fxn that will try to recover a corrupt chat history. * * In the majority of bug reports the corrupt message is often the first, so in * theory we should be able to trim the start of the chatlog up to and including * the first \n char. We may have to do so multiple times, but once we find the * first valid message everything else should "work" */ MSG_HEADER **utox_load_chatlog(char hex[TOX_PUBLIC_KEY_SIZE * 2], size_t *size, uint32_t count, uint32_t skip) { /* Because every platform is different, we have to ask them to open the file for us. * However once we have it, every platform does the same thing, this should prevent issues * from occurring on a single platform. */ size_t records_count = utox_count_chatlog(hex); if (skip >= records_count) { if (skip > 0) { LOG_ERR("Chatlog", "Error, skipped all records"); } else { LOG_INFO("Chatlog", "No log exists."); } return NULL; } FILE *file = chatlog_get_file(hex, false); if (!file) { LOG_TRACE("Chatlog", "Log read:\tUnable to access file provided."); return NULL; } if (count > (records_count - skip)) { count = records_count - skip; } MSG_HEADER **data = calloc(count + 1, sizeof(MSG_HEADER *)); MSG_HEADER **start = data; if (!data) { LOG_ERR("Chatlog", "Log read:\tCouldn't allocate memory for log entries."); fclose(file); return NULL; } size_t start_at = records_count - count - skip; size_t actual_count = 0; size_t file_offset = 0; LOG_FILE_MSG_HEADER header; while (fread(&header, sizeof(header), 1, file) == 1) { if (start_at) { fseeko(file, header.author_length, SEEK_CUR); /* Skip the recorded author */ fseeko(file, header.msg_length, SEEK_CUR); /* Skip the message */ fseeko(file, 1, SEEK_CUR); /* Skip the newline char */ start_at--; file_offset = ftello(file); continue; } if (count) { /* we have to skip the author name for now, it's left here for group chats support in the future */ fseeko(file, header.author_length, SEEK_CUR); if (header.msg_length > 1 << 16) { LOG_ERR("Chatlog", "Can't malloc that much, you'll probably have to move or delete your" " history for this peer.\n\t\tFriend number %.*s, count %u," " actual_count %lu, start at %lu, error size %lu.\n", TOX_PUBLIC_KEY_SIZE * 2, hex, count, actual_count, start_at, header.msg_length); if (size) { *size = 0; } fclose(file); return start; } MSG_HEADER *msg = calloc(1, sizeof(MSG_HEADER)); if (!msg) { LOG_ERR("Chatlog", "Unable to malloc... sorry!"); free(start); fclose(file); return NULL; } msg->our_msg = header.author; msg->receipt_time = header.receipt; msg->time = header.time; msg->msg_type = header.msg_type; msg->disk_offset = file_offset; msg->via.txt.length = header.msg_length; msg->via.txt.msg = calloc(1, msg->via.txt.length); if (!msg->via.txt.msg) { LOG_ERR("Chatlog", "Unable to malloc for via.txt.msg... sorry!"); free(start); free(msg); fclose(file); return NULL; } msg->via.txt.author_length = header.author_length; // TODO: msg->via.txt.author used to be allocated but left empty. Commented out for now. // msg->via.txt.author = calloc(1, msg->via.txt.author_length); // if (!msg->via.txt.author) { // LOG_ERR("Chatlog", "Unable to malloc for via.txt.author... sorry!"); // free(msg->via.txt.msg); // free(msg); // fclose(file); // return NULL; // } if (fread(msg->via.txt.msg, msg->via.txt.length, 1, file) != 1) { LOG_ERR("Chatlog", "Log read:\tError reading record %u of length %u at offset %lu: stopping.", count, msg->via.txt.length, msg->disk_offset); // free(msg->via.txt.author); free(msg->via.txt.msg); free(msg); break; } msg->via.txt.length = utf8_validate((uint8_t *)msg->via.txt.msg, msg->via.txt.length); *data++ = msg; --count; ++actual_count; fseeko(file, 1, SEEK_CUR); /* seek an extra \n char */ file_offset = ftello(file); } } fclose(file); if (size) { *size = actual_count; } return start; } bool utox_update_chatlog(char hex[TOX_PUBLIC_KEY_SIZE * 2], size_t offset, uint8_t *data, size_t length) { FILE *file = chatlog_get_file(hex, true); if (!file) { LOG_ERR("History", "Unable to access file provided."); return false; } if (fseeko(file, offset, SEEK_SET)) { LOG_ERR("Chatlog", "History:\tUnable to seek to position %lu in file provided.", offset); fclose(file); return false; } fwrite(data, length, 1, file); fclose(file); return true; } bool utox_remove_friend_chatlog(char hex[TOX_PUBLIC_KEY_SIZE * 2]) { char name[TOX_PUBLIC_KEY_SIZE * 2 + sizeof(".new.txt")]; snprintf(name, sizeof(name), "%.*s.new.txt", TOX_PUBLIC_KEY_SIZE * 2, hex); return utox_remove_file((uint8_t*)name, sizeof(name)); } void utox_export_chatlog_init(uint32_t friend_number) { native_export_chatlog_init(friend_number); } void utox_export_chatlog(char hex[TOX_PUBLIC_KEY_SIZE * 2], FILE *dest_file) { if (!dest_file) { return; } LOG_FILE_MSG_HEADER header; FILE *file = chatlog_get_file(hex, false); struct tm *tm_curr; struct tm_tmp { int tm_year; int tm_mon; int tm_mday; } tm_prev = { .tm_mday = 1}; while (fread(&header, sizeof(header), 1, file) == 1) { tm_curr = localtime(&header.time); if (tm_curr->tm_year > tm_prev.tm_year || (tm_curr->tm_year == tm_prev.tm_year && tm_curr->tm_mon > tm_prev.tm_mon) || (tm_curr->tm_year == tm_prev.tm_year && tm_curr->tm_mon == tm_prev.tm_mon && tm_curr->tm_mday > tm_prev.tm_mday)) { char buffer[128]; size_t len = strftime(buffer, 128, "Day has changed to %A %B %d %Y\n", tm_curr); fwrite(buffer, len, 1, dest_file); } /* Write Timestamp */ fprintf(dest_file, "[%02d:%02d]", tm_curr->tm_hour, tm_curr->tm_min); tm_prev.tm_year = tm_curr->tm_year; tm_prev.tm_mon = tm_curr->tm_mon; tm_prev.tm_mday = tm_curr->tm_mday; int c; if (header.msg_type == MSG_TYPE_NOTICE) { fseek(file, header.author_length, SEEK_CUR); } else { /* Write Author */ fwrite(" <", 2, 1, dest_file); for (size_t i = 0; i < header.author_length; ++i) { c = fgetc(file); if (c != EOF) { fputc(c, dest_file); } } fwrite(">", 1, 1, dest_file); } /* Write text */ fwrite(" ", 1, 1, dest_file); for (size_t i = 0; i < header.msg_length; ++i) { c = fgetc(file); if (c != EOF) { fputc(c, dest_file); } } c = fgetc(file); /* the newline char */ fputc(c, dest_file); } fclose(file); fclose(dest_file); } uTox/src/branding.h.in0000600000175000001440000000137214003056216013632 0ustar rakusers/** * uTox Versions and header information * * This file contains defines regarding uTox branding and version information * It is generated from branding.h.in which cmake will generate to branding.h */ #define TITLE "uTox" #define SUB_TITLE "(Alpha)" #define VERSION "@PROJECT_VERSION@" #define VER_MAJOR @PROJECT_VERSION_MAJOR@ #define VER_MINOR @PROJECT_VERSION_MINOR@ #define VER_PATCH @PROJECT_VERSION_PATCH@ #define UTOX_VERSION_NUMBER (VER_MAJOR << 16 | VER_MINOR << 8 | VER_PATCH) // Assembly info #define UTOX_FILE_DESCRIPTION "The lightweight Tox client" #define UTOX_COPYRIGHT "@PROJECT_COPYRIGHT@" #define UTOX_FILENAME_WINDOWS "uTox.exe" // Defaults #define DEFAULT_NAME "uTox User" #define DEFAULT_STATUS "Toxing on uTox, from the future!" uTox/src/branding.h0000600000175000001440000000132114003056216013217 0ustar rakusers/** * uTox Versions and header information * * This file contains defines regarding uTox branding and version information * It is generated from branding.h.in which cmake will generate to branding.h */ #define TITLE "uTox" #define SUB_TITLE "(Alpha)" #define VERSION "0.18.1" #define VER_MAJOR 0 #define VER_MINOR 18 #define VER_PATCH 1 #define UTOX_VERSION_NUMBER (VER_MAJOR << 16 | VER_MINOR << 8 | VER_PATCH) // Assembly info #define UTOX_FILE_DESCRIPTION "The lightweight Tox client" #define UTOX_COPYRIGHT "Copyleft 2021 uTox contributors. Some rights reserved." #define UTOX_FILENAME_WINDOWS "uTox.exe" // Defaults #define DEFAULT_NAME "uTox User" #define DEFAULT_STATUS "Toxing on uTox, from the future!" uTox/src/avatar.h0000600000175000001440000001000314003056216012706 0ustar rakusers#ifndef AVATAR_H #define AVATAR_H #include typedef struct native_image NATIVE_IMAGE; // TODO: remove? #define UTOX_AVATAR_MAX_DATA_LENGTH (64 * 1024) // NOTE: increasing this above 64k might cause // issues with other clients who do stupid things. #define UTOX_AVATAR_FORMAT_NONE 0 #define UTOX_AVATAR_FORMAT_PNG 1 /* data needed for each avatar in memory */ typedef struct avatar { NATIVE_IMAGE *img; /* converted avatar image to draw */ size_t size; uint16_t width, height; /* width and height of image (in pixels) */ uint8_t format; /* one of TOX_AVATAR_FORMAT */ uint8_t hash[TOX_HASH_LENGTH]; /* tox_hash for the png data of this avatar */ } AVATAR; /* Whether user's avatar is set. */ #define self_has_avatar() (self.avatar && self.avatar->format != UTOX_AVATAR_FORMAT_NONE) /* Whether friend f's avatar is set, where f is a pointer to a friend struct */ #define friend_has_avatar(f) (f) && (f->avatar->format != UTOX_AVATAR_FORMAT_NONE) /** tries to load avatar from disk for given client id string and set avatar based on saved png data * avatar is avatar to initialize. Will be unset if no file is found on disk or if file is corrupt or too large, * otherwise will be set to avatar found on disk * id is cid string of whose avatar to find(see also avatar_load in avatar.c) * if png_data_out is not NULL, the png data loaded from disk will be copied to it. * if it is not null, it should be at least UTOX_AVATAR_MAX_DATA_LENGTH bytes long * if png_size_out is not null, the size of the png data will be stored in it * * returns: true on successful loading, false on failure */ bool avatar_init(char hexid[TOX_PUBLIC_KEY_SIZE * 2], AVATAR *avatar); /** Converts png data given by data to a NATIVE_IMAGE and uses that to populate the avatar struct * avatar is pointer to an avatar struct to store result in. Remains unchanged if function fails. * data is pointer to png data to convert * size is size of data * * on success: returns true * on failure: returns false * * notes: fails if given size is larger than UTOX_AVATAR_MAX_DATA_LENGTH or data is not valid PNG data */ bool avatar_set(AVATAR *avatar, const uint8_t *data, size_t size); /* Helper function to set the user's avatar. */ bool avatar_set_self(const uint8_t *data, size_t size); /* Helper function to unset the user's avatar. */ void avatar_unset_self(void); /* Helper function to delete user's avatar file. */ void avatar_delete_self(void); /* Unsets an avatar by setting its format to UTOX_AVATAR_FORMAT_NONE and freeing its image. */ void avatar_unset(AVATAR *avatar); /** Sets own avatar based on given png data and saves it to disk if successful. * data is png data to set avatar to. * size is size of data. * * on success: returns true * on failure: returns false * * Notes: Fails if size is too large or data is not a valid png file. */ bool self_set_and_save_avatar(const uint8_t *data, uint32_t size); /* Unsets own avatar and removes it from disk */ bool avatar_remove_self(void); /** Call this every time friend_number goes online from the tox_do thread. * * on success: returns true * on failure: returns false */ bool avatar_on_friend_online(Tox *tox, uint32_t friend_number); /** Colled by incoming file transfers to change the avater. * * If size <=0, we'll unset the avatar, else we'll set and update the friend */ void utox_incoming_avatar(uint32_t friend_number, uint8_t *avatar, size_t size); /* Saves the avatar for user with hexid * * returns true on success * returns false on failure */ bool avatar_save(char hexid[TOX_PUBLIC_KEY_SIZE * 2], const uint8_t *data, size_t length); /* Deletes the avatar for user with hexid * * returns true on success * returns false on failure */ bool avatar_delete(char hexid[TOX_PUBLIC_KEY_SIZE * 2]); /* Helper function to initialize the user's avatar */ bool avatar_init_self(void); /* Moves the avatar to its new name */ bool avatar_move(const uint8_t *source, const uint8_t *dest); #endif uTox/src/avatar.c0000600000175000001440000001457414003056216012722 0ustar rakusers#include "avatar.h" #include "debug.h" #include "file_transfers.h" #include "filesys.h" #include "self.h" #include "tox.h" #include "native/image.h" #include #include /* frees the image of an avatar, does nothing if image is NULL */ static void avatar_free_image(AVATAR *avatar) { if (avatar) { image_free(avatar->img); avatar->img = NULL; avatar->size = 0; } } bool avatar_save(char hexid[TOX_PUBLIC_KEY_SIZE * 2], const uint8_t *data, size_t length) { char name[sizeof("avatars/") + TOX_PUBLIC_KEY_SIZE * 2 + sizeof(".png")] = { 0 }; FILE *fp; snprintf(name, sizeof("avatars/") + TOX_PUBLIC_KEY_SIZE * 2 + sizeof(".png"), "avatars/%.*s.png", TOX_PUBLIC_KEY_SIZE * 2, hexid); fp = utox_get_file(name, NULL, UTOX_FILE_OPTS_WRITE | UTOX_FILE_OPTS_MKDIR); if (!fp) { LOG_WARN("Avatar", "Could not save avatar for: %.*s", TOX_PUBLIC_KEY_SIZE * 2, hexid); return false; } fwrite(data, length, 1, fp); fclose(fp); return true; } static uint8_t *load_img_data(char hexid[TOX_PUBLIC_KEY_SIZE * 2], size_t *out_size) { char name[sizeof("avatars/") + TOX_PUBLIC_KEY_SIZE * 2 + sizeof(".png")] = { 0 }; snprintf(name, sizeof("avatars/") + TOX_PUBLIC_KEY_SIZE * 2 + sizeof(".png"), "avatars/%.*s.png", TOX_PUBLIC_KEY_SIZE * 2, hexid); size_t size = 0; FILE *fp = utox_get_file(name, &size, UTOX_FILE_OPTS_READ); if (fp == NULL) { LOG_TRACE("Avatar", "Could not read: %s", name); return NULL; } uint8_t *data = calloc(1, size); if (data == NULL) { LOG_ERR("Avatar", "Could not allocate memory for file of size %zu.", size); fclose(fp); return NULL; } if (fread(data, size, 1, fp) != 1) { LOG_WARN("Avatar", "Could not read from open file: %s", name); fclose(fp); free(data); return NULL; } fclose(fp); if (out_size) { *out_size = size; } return data; } bool avatar_delete(char hexid[TOX_PUBLIC_KEY_SIZE * 2]) { char name[sizeof("avatars/") + TOX_PUBLIC_KEY_SIZE * 2 + sizeof(".png")] = { 0 }; snprintf(name, sizeof(name), "avatars/%.*s.png", TOX_PUBLIC_KEY_SIZE * 2, hexid); int name_len = strnlen(name, sizeof(name) - 1); return utox_remove_file((uint8_t *)name, name_len); } static bool avatar_load(char hexid[TOX_PUBLIC_KEY_SIZE * 2], AVATAR *avatar, size_t *size_out) { size_t size = 0; uint8_t *img = load_img_data(hexid, &size); if (!img) { LOG_DEBUG("Avatar", "Unable to get saved avatar from disk for friend %.*s" , TOX_PUBLIC_KEY_SIZE * 2, hexid); return false; } if (size > UTOX_AVATAR_MAX_DATA_LENGTH) { free(img); LOG_WARN("Avatar", "Saved avatar file for friend (%.*s) too large for tox" , TOX_PUBLIC_KEY_SIZE * 2, hexid); return false; } avatar->img = utox_image_to_native(img, size, &avatar->width, &avatar->height, true); if (avatar->img) { avatar->format = UTOX_AVATAR_FORMAT_PNG; avatar->size = size; tox_hash(avatar->hash, img, size); if (size_out) { *size_out = size; } if (avatar == self.avatar) { // We need to save our avatar in PNG format so we can send it to friends! self.png_data = img; self.png_size = size; } else { free(img); } return true; } free(img); return false; } bool avatar_set(AVATAR *avatar, const uint8_t *data, size_t size) { if (avatar == NULL) { LOG_DEBUG("Avatar", "avatar is null."); return false; } if (size > UTOX_AVATAR_MAX_DATA_LENGTH) { LOG_ERR("Avatar", " avatar too large"); return false; } avatar_free_image(avatar); NATIVE_IMAGE *image = utox_image_to_native((UTOX_IMAGE)data, size, &avatar->width, &avatar->height, true); if (!NATIVE_IMAGE_IS_VALID(image)) { LOG_DEBUG("Avatar", "avatar is invalid"); return false; } avatar->img = image; avatar->format = UTOX_AVATAR_FORMAT_PNG; avatar->size = size; tox_hash(avatar->hash, data, size); return true; } /* sets self avatar, see self_set_and_save_avatar */ bool avatar_set_self(const uint8_t *data, size_t size) { return avatar_set(self.avatar, data, size); } void avatar_unset(AVATAR *avatar) { if (avatar == NULL) { LOG_TRACE("Avatar", " avatar is null" ); return; } avatar->format = UTOX_AVATAR_FORMAT_NONE; avatar_free_image(avatar); } void avatar_unset_self(void) { avatar_unset(self.avatar); } bool avatar_init(char hexid[TOX_PUBLIC_KEY_SIZE * 2], AVATAR *avatar) { avatar_unset(avatar); return avatar_load(hexid, avatar, NULL); } bool avatar_init_self(void) { self.avatar = calloc(1, sizeof(AVATAR)); if (self.avatar == NULL) { return false; } return avatar_load(self.id_str, self.avatar, NULL); } bool self_set_and_save_avatar(const uint8_t *data, uint32_t size) { if (avatar_set_self(data, size)) { avatar_save(self.id_str, data, size); return true; } return false; } void avatar_delete_self(void) { avatar_unset(self.avatar); avatar_delete(self.id_str); postmessage_toxcore(TOX_AVATAR_UNSET, 0, 0, NULL); } bool avatar_on_friend_online(Tox *tox, uint32_t friend_number) { if (!self.png_data) { uint8_t *avatar_data = load_img_data(self.id_str, &self.png_size); if (!avatar_data) { LOG_WARN("Avatar", "Unable to get out avatar data to send to friend."); self.png_data = NULL; self.png_size = 0; return false; } self.png_data = avatar_data; } ft_send_avatar(tox, friend_number); return true; } bool avatar_move(const uint8_t *source, const uint8_t *dest) { uint8_t current_name[sizeof("avatars/") + TOX_PUBLIC_KEY_SIZE * 2 + sizeof(".png")] = { 0 }; uint8_t new_name[sizeof("avatars/") + TOX_PUBLIC_KEY_SIZE * 2 + sizeof(".png")] = { 0 }; snprintf((char *)current_name, sizeof("avatars/") + TOX_PUBLIC_KEY_SIZE * 2 + sizeof(".png"), "avatars/%.*s.png", TOX_PUBLIC_KEY_SIZE * 2, source); snprintf((char *)new_name, sizeof("avatars/") + TOX_PUBLIC_KEY_SIZE * 2 + sizeof(".png"), "avatars/%.*s.png", TOX_PUBLIC_KEY_SIZE * 2, dest); return utox_move_file(current_name, new_name); } uTox/src/av/0000700000175000001440000000000014003056216011671 5ustar rakusersuTox/src/av/video.h0000600000175000001440000000464714003056216013165 0ustar rakusers#ifndef VIDEO_H #define VIDEO_H #include #include #include extern uint16_t video_width, video_height, max_video_width, max_video_height; extern bool utox_video_thread_init; #define UTOX_DEFAULT_BITRATE_V 5000 #define UTOX_MIN_BITRATE_VIDEO 512 // UTOX_DEFAULT_VID_WIDTH, HEIGHT are unused. #define UTOX_DEFAULT_VID_WIDTH 1280 #define UTOX_DEFAULT_VID_HEIGHT 720 /* Check self */ #define SELF_SEND_VIDEO(f_number) (get_friend(f_number) && (!!(get_friend(f_number)->call_state_self & TOXAV_FRIEND_CALL_STATE_SENDING_V))) #define SELF_ACCEPT_VIDEO(f_number) (get_friend(f_number) && (!!(get_friend(f_number)->call_state_self & TOXAV_FRIEND_CALL_STATE_ACCEPTING_V))) /* Check friend */ #define FRIEND_SENDING_VIDEO(f_number) (get_friend(f_number) && (!!(get_friend(f_number)->call_state_friend & TOXAV_FRIEND_CALL_STATE_SENDING_V))) #define FRIEND_ACCEPTING_VIDEO(f_number) (get_friend(f_number) && (!!(get_friend(f_number)->call_state_friend & TOXAV_FRIEND_CALL_STATE_ACCEPTING_V))) /* Check both */ #define SEND_VIDEO_FRAME(f_number) (SELF_SEND_VIDEO(f_number) && FRIEND_ACCEPTING_VIDEO(f_number)) typedef struct UTOX_AV_VIDEO_FRAME { uint16_t w, h; uint8_t *y, *u, *v; } utox_av_video_frame; typedef struct utox_frame_pkg { uint16_t w, h; size_t size; void *img; } UTOX_FRAME_PKG; void utox_video_append_device(void *device, bool localized, void *name, bool default_); bool utox_video_change_device(uint16_t i); bool utox_video_start(bool preview); bool utox_video_stop(bool preview); void utox_video_thread(void *args); void postmessage_video(uint8_t msg, uint32_t param1, uint32_t param2, void *data); // Color format conversion functions void yuv420tobgr(uint16_t width, uint16_t height, const uint8_t *y, const uint8_t *u, const uint8_t *v, unsigned int ystride, unsigned int ustride, unsigned int vstride, uint8_t *out); void yuv422to420(uint8_t *plane_y, uint8_t *plane_u, uint8_t *plane_v, uint8_t *input, uint16_t width, uint16_t height); void bgrtoyuv420(uint8_t *plane_y, uint8_t *plane_u, uint8_t *plane_v, uint8_t *rgb, uint16_t width, uint16_t height); void bgrxtoyuv420(uint8_t *plane_y, uint8_t *plane_u, uint8_t *plane_v, uint8_t *rgb, uint16_t width, uint16_t height); // TODO: Documentation. void scale_rgbx_image(uint8_t *old_rgbx, uint16_t old_width, uint16_t old_height, uint8_t *new_rgbx, uint16_t new_width, uint16_t new_height); #endif uTox/src/av/video.c0000600000175000001440000004064314003056216013154 0ustar rakusers#include "video.h" #include "utox_av.h" #include "../friend.h" #include "../debug.h" #include "../macros.h" #include "../self.h" #include "../settings.h" #include "../tox.h" #include "../utox.h" #include "../native/thread.h" #include "../native/video.h" #include #include #include #include #include bool utox_video_thread_init = false; uint16_t video_width, video_height, max_video_width, max_video_height; static void * video_device[16] = { NULL }; /* TODO; magic number */ static int16_t video_device_count = 0; static uint32_t video_device_current = 0; static bool video_active = false; static utox_av_video_frame utox_video_frame; static bool video_device_status = false; static vpx_image_t input; static pthread_mutex_t video_thread_lock; static bool video_device_init(void *handle) { // initialize video (will populate video_width and video_height) if (handle == (void *)1) { if (!native_video_init((void *)1)) { LOG_TRACE("uToxVideo", "native_video_init() failed for desktop" ); return false; } } else { if (!handle || !native_video_init(*(void **)handle)) { LOG_TRACE("uToxVideo", "native_video_init() failed webcam" ); return false; } } vpx_img_alloc(&input, VPX_IMG_FMT_I420, video_width, video_height, 1); utox_video_frame.y = input.planes[0]; utox_video_frame.u = input.planes[1]; utox_video_frame.v = input.planes[2]; utox_video_frame.w = input.d_w; utox_video_frame.h = input.d_h; LOG_NOTE("uToxVideo", "video init done!" ); video_device_status = true; return true; } static void close_video_device(void *handle) { if (handle >= (void *)2) { native_video_close(*(void **)handle); vpx_img_free(&input); } video_device_status = false; } static bool video_device_start(void) { if (video_device_status) { native_video_startread(); video_active = true; return true; } video_active = false; return false; } static bool video_device_stop(void) { if (video_device_status) { native_video_endread(); video_active = false; return true; } video_active = false; return false; } #include "../ui/dropdown.h" #include "../layout/settings.h" // TODO move? void utox_video_append_device(void *device, bool localized, void *name, bool default_) { video_device[video_device_count++] = device; if (localized) { // Device name is localized with name containing UTOX_I18N_STR. // device is device handle pointer. dropdown_list_add_localized(&dropdown_video, (UTOX_I18N_STR)name, device); } else { // Device name is a hardcoded string. // device is a pointer to a buffer, that contains device handle pointer, // followed by device name string. dropdown_list_add_hardcoded(&dropdown_video, name, *(void **)device); } /* TODO remove all default settings */ // default == true, if this device will be chosen by video detecting code. if (default_) { dropdown_video.selected = dropdown_video.over = (dropdown_video.dropcount - 1); } } bool utox_video_change_device(uint16_t device_number) { pthread_mutex_lock(&video_thread_lock); static bool _was_active = false; if (!device_number) { video_device_current = 0; if (video_active) { video_device_stop(); close_video_device(video_device[video_device_current]); if (settings.video_preview) { settings.video_preview = false; postmessage_utox(AV_CLOSE_WINDOW, 0, 0, NULL); } } LOG_TRACE("uToxVideo", "Disabled Video device (none)" ); goto mutex_unlock; } if (video_active) { _was_active = true; video_device_stop(); close_video_device(video_device[video_device_current]); } else { _was_active = false; } video_device_current = device_number; if (!video_device_init(video_device[device_number])) { goto mutex_unlock; } if (!_was_active) { /* Just grab the new frame size */ if (video_device_status) { close_video_device(video_device[video_device_current]); } goto mutex_unlock; } LOG_TRACE("uToxVideo", "Trying to restart video with new device..." ); if (!video_device_start()) { LOG_ERR("uToxVideo", "Error, unable to start new device..."); if (settings.video_preview) { settings.video_preview = false; postmessage_utox(AV_CLOSE_WINDOW, 0, 0, NULL); } goto mutex_unlock; } pthread_mutex_unlock(&video_thread_lock); return true; mutex_unlock: pthread_mutex_unlock(&video_thread_lock); return false; } bool utox_video_start(bool preview) { if (video_active) { LOG_NOTE("uToxVideo", "video already running" ); return true; } if (!video_device_current) { LOG_NOTE("uToxVideo", "Not starting device None" ); return false; } if (preview) { settings.video_preview = true; } if (video_device_init(video_device[video_device_current]) && video_device_start()) { video_active = true; LOG_NOTE("uToxVideo", "started video" ); return true; } LOG_ERR("uToxVideo", "Unable to start video."); return false; } bool utox_video_stop(bool UNUSED(preview)) { if (!video_active) { LOG_TRACE("uToxVideo", "video already stopped!" ); return false; } video_active = false; settings.video_preview = false; postmessage_utox(AV_CLOSE_WINDOW, 0, 0, NULL); video_device_stop(); close_video_device(video_device[video_device_current]); LOG_TRACE("uToxVideo", "stopped video" ); return true; } static TOX_MSG video_msg; void postmessage_video(uint8_t msg, uint32_t param1, uint32_t param2, void *data) { while (video_thread_msg) { yieldcpu(1); } video_msg.msg = msg; video_msg.param1 = param1; video_msg.param2 = param2; video_msg.data = data; video_thread_msg = true; } // Populates the video device dropdown. static void init_video_devices(void) { // Add always-present null video input device. utox_video_append_device(NULL, 1, (void *)STR_VIDEO_IN_NONE, 1); // select a video device (autodectect) video_device_current = native_video_detect(); if (video_device_current) { // open the video device to get some info e.g. frame size // close it afterwards to not block the device while it is not used if (video_device_init(video_device[video_device_current])) { close_video_device(video_device[video_device_current]); } } } void utox_video_thread(void *args) { ToxAV *av = args; pthread_mutex_init(&video_thread_lock, NULL); init_video_devices(); utox_video_thread_init = 1; while (1) { if (video_thread_msg) { if (!video_msg.msg || video_msg.msg == UTOXVIDEO_KILL) { break; } switch (video_msg.msg) { case UTOXVIDEO_NEW_AV_INSTANCE: { av = video_msg.data; init_video_devices(); break; } } video_thread_msg = false; } if (video_active) { pthread_mutex_lock(&video_thread_lock); // capturing is enabled, capture frames const int r = native_video_getframe(utox_video_frame.y, utox_video_frame.u, utox_video_frame.v, utox_video_frame.w, utox_video_frame.h); if (r == 1) { if (settings.video_preview) { /* Make a copy of the video frame for uTox to display */ UTOX_FRAME_PKG *frame = malloc(sizeof(UTOX_FRAME_PKG)); frame->w = utox_video_frame.w; frame->h = utox_video_frame.h; frame->img = malloc(utox_video_frame.w * utox_video_frame.h * 4); yuv420tobgr(utox_video_frame.w, utox_video_frame.h, utox_video_frame.y, utox_video_frame.u, utox_video_frame.v, utox_video_frame.w, (utox_video_frame.w / 2), (utox_video_frame.w / 2), frame->img); postmessage_utox(AV_VIDEO_FRAME, UINT16_MAX, 1, (void *)frame); } size_t active_video_count = 0; for (size_t i = 0; i < self.friend_list_count; i++) { if (SEND_VIDEO_FRAME(i)) { LOG_TRACE("uToxVideo", "sending video frame to friend %lu" , i); active_video_count++; TOXAV_ERR_SEND_FRAME error = 0; FRIEND *f = get_friend(i); if (!f) { LOG_ERR("uToxVideo", "Could not get friend to send him video frame %lu", i); continue; } toxav_video_send_frame(av, f->number, utox_video_frame.w, utox_video_frame.h, utox_video_frame.y, utox_video_frame.u, utox_video_frame.v, &error); // LOG_TRACE("uToxVideo", "Sent video frame to friend %u" , i); if (error) { if (error == TOXAV_ERR_SEND_FRAME_SYNC) { LOG_ERR("uToxVideo", "Vid Frame sync error: w=%u h=%u", utox_video_frame.w, utox_video_frame.h); } else if (error == TOXAV_ERR_SEND_FRAME_PAYLOAD_TYPE_DISABLED) { LOG_ERR("uToxVideo", "ToxAV disagrees with our AV state for friend %lu, self %u, friend %u", i, f->call_state_self, f->call_state_friend); } else { LOG_ERR("uToxVideo", "toxav_send_video error friend: %i error: %u", f->number, error); } } else { if (active_video_count >= UTOX_MAX_CALLS) { LOG_ERR("uToxVideo", "Trying to send video frame to too many peers. Please report this bug!"); break; } } } } } else if (r == -1) { LOG_ERR("uToxVideo", "Err... something really bad happened trying to get this frame, I'm just going " "to plots now!"); video_device_stop(); close_video_device(video_device); } pthread_mutex_unlock(&video_thread_lock); yieldcpu(1000 / settings.video_fps); /* 60fps = 16.666ms || 25 fps = 40ms || the data quality is SO much better at 25... */ continue; /* We're running video, so don't sleep for an extra 100 ms */ } yieldcpu(100); } video_device_count = 0; video_device_current = 0; video_active = false; for (uint8_t i = 0; i < 16; ++i) { video_device[i] = NULL; } video_thread_msg = 0; utox_video_thread_init = 0; LOG_TRACE("uToxVideo", "Clean thread exit!"); } void yuv420tobgr(uint16_t width, uint16_t height, const uint8_t *y, const uint8_t *u, const uint8_t *v, unsigned int ystride, unsigned int ustride, unsigned int vstride, uint8_t *out) { for (unsigned long int i = 0; i < height; ++i) { for (unsigned long int j = 0; j < width; ++j) { uint8_t *point = out + 4 * ((i * width) + j); int t_y = y[((i * ystride) + j)]; const int t_u = u[(((i / 2) * ustride) + (j / 2))]; const int t_v = v[(((i / 2) * vstride) + (j / 2))]; t_y = t_y < 16 ? 16 : t_y; const int r = (298 * (t_y - 16) + 409 * (t_v - 128) + 128) >> 8; const int g = (298 * (t_y - 16) - 100 * (t_u - 128) - 208 * (t_v - 128) + 128) >> 8; const int b = (298 * (t_y - 16) + 516 * (t_u - 128) + 128) >> 8; point[2] = r > 255 ? 255 : r < 0 ? 0 : r; point[1] = g > 255 ? 255 : g < 0 ? 0 : g; point[0] = b > 255 ? 255 : b < 0 ? 0 : b; point[3] = ~0; } } } void yuv422to420(uint8_t *plane_y, uint8_t *plane_u, uint8_t *plane_v, uint8_t *input, uint16_t width, uint16_t height) { const uint8_t *end = input + width * height * 2; while (input != end) { uint8_t *line_end = input + width * 2; while (input != line_end) { *plane_y++ = *input++; *plane_v++ = *input++; *plane_y++ = *input++; *plane_u++ = *input++; } line_end = input + width * 2; while (input != line_end) { *plane_y++ = *input++; input++; // u *plane_y++ = *input++; input++; // v } } } static uint8_t rgb_to_y(int r, int g, int b) { const int y = ((9798 * r + 19235 * g + 3736 * b) >> 15); return y > 255 ? 255 : y < 0 ? 0 : y; } static uint8_t rgb_to_u(int r, int g, int b) { const int u = ((-5538 * r + -10846 * g + 16351 * b) >> 15) + 128; return u > 255 ? 255 : u < 0 ? 0 : u; } static uint8_t rgb_to_v(int r, int g, int b) { const int v = ((16351 * r + -13697 * g + -2664 * b) >> 15) + 128; return v > 255 ? 255 : v < 0 ? 0 : v; } void bgrtoyuv420(uint8_t *plane_y, uint8_t *plane_u, uint8_t *plane_v, uint8_t *rgb, uint16_t width, uint16_t height) { uint8_t *p; uint8_t r, g, b; for (uint16_t y = 0; y != height; y += 2) { p = rgb; for (uint16_t x = 0; x != width; x++) { b = *rgb++; g = *rgb++; r = *rgb++; *plane_y++ = rgb_to_y(r, g, b); } for (uint16_t x = 0; x != width / 2; x++) { b = *rgb++; g = *rgb++; r = *rgb++; *plane_y++ = rgb_to_y(r, g, b); b = *rgb++; g = *rgb++; r = *rgb++; *plane_y++ = rgb_to_y(r, g, b); b = ((int)b + (int)*(rgb - 6) + (int)*p + (int)*(p + 3) + 2) / 4; p++; g = ((int)g + (int)*(rgb - 5) + (int)*p + (int)*(p + 3) + 2) / 4; p++; r = ((int)r + (int)*(rgb - 4) + (int)*p + (int)*(p + 3) + 2) / 4; p++; *plane_u++ = rgb_to_u(r, g, b); *plane_v++ = rgb_to_v(r, g, b); p += 3; } } } void bgrxtoyuv420(uint8_t *plane_y, uint8_t *plane_u, uint8_t *plane_v, uint8_t *rgb, uint16_t width, uint16_t height) { uint8_t *p; uint8_t r, g, b; for (uint16_t y = 0; y != height; y += 2) { p = rgb; for (uint16_t x = 0; x != width; x++) { b = *rgb++; g = *rgb++; r = *rgb++; rgb++; *plane_y++ = rgb_to_y(r, g, b); } for (uint16_t x = 0; x != width / 2; x++) { b = *rgb++; g = *rgb++; r = *rgb++; rgb++; *plane_y++ = rgb_to_y(r, g, b); b = *rgb++; g = *rgb++; r = *rgb++; rgb++; *plane_y++ = rgb_to_y(r, g, b); b = ((int)b + (int)*(rgb - 8) + (int)*p + (int)*(p + 4) + 2) / 4; p++; g = ((int)g + (int)*(rgb - 7) + (int)*p + (int)*(p + 4) + 2) / 4; p++; r = ((int)r + (int)*(rgb - 6) + (int)*p + (int)*(p + 4) + 2) / 4; p++; p++; *plane_u++ = rgb_to_u(r, g, b); *plane_v++ = rgb_to_v(r, g, b); p += 4; } } } void scale_rgbx_image(uint8_t *old_rgbx, uint16_t old_width, uint16_t old_height, uint8_t *new_rgbx, uint16_t new_width, uint16_t new_height) { for (int y = 0; y != new_height; y++) { const int y0 = y * old_height / new_height; for (int x = 0; x != new_width; x++) { const int x0 = x * old_width / new_width; const int a = x + y * new_width; const int b = x0 + y0 * old_width; new_rgbx[a * 4] = old_rgbx[b * 4]; new_rgbx[a * 4 + 1] = old_rgbx[b * 4 + 1]; new_rgbx[a * 4 + 2] = old_rgbx[b * 4 + 2]; } } } uTox/src/av/utox_av.h0000600000175000001440000000360014003056216013530 0ustar rakusers/* toxav thread messages (sent from the client thread to the audio or video thread) */ #ifndef UTOX_AV_H #define UTOX_AV_H #include // if it weren't for TOXAV_CALL_CONTROL we could move this to the .c #include extern bool utox_av_ctrl_init; #define UTOX_MAX_CALLS 16 // UTOX_MAX_VIDEO_CALLS is never used. Remove? #define UTOX_MAX_VIDEO_CALLS 32 /* utox av thread commands */ enum { UTOXAV_KILL, UTOXAV_INCOMING_CALL_PENDING, UTOXAV_INCOMING_CALL_ANSWER, UTOXAV_INCOMING_CALL_REJECT, UTOXAV_OUTGOING_CALL_PENDING, UTOXAV_OUTGOING_CALL_ACCEPTED, UTOXAV_OUTGOING_CALL_REJECTED, UTOXAV_CALL_END, UTOXAV_GROUPCALL_START, UTOXAV_GROUPCALL_END, UTOXAV_START_AUDIO, UTOXAV_STOP_AUDIO, UTOXAV_START_VIDEO, UTOXAV_STOP_VIDEO, UTOXAV_SET_AUDIO_IN, UTOXAV_SET_AUDIO_OUT, UTOXAV_SET_VIDEO_IN, UTOXAV_SET_VIDEO_OUT, UTOXAV_NEW_TOX_INSTANCE, }; enum { // kill the video thread UTOXVIDEO_KILL, UTOXVIDEO_NEW_AV_INSTANCE, /* UTOXVIDEO_RECORD_START, UTOXVIDEO_RECORD_STOP, UTOXVIDEO_SET, UTOXVIDEO_PREVIEW_START, UTOXVIDEO_PREVIEW_STOP, */ }; typedef struct groupchat GROUPCHAT; /* send a message to the toxav thread */ void postmessage_utoxav(uint8_t msg, uint32_t param1, uint32_t param2, void *data); void utox_av_ctrl_thread(void *args); void utox_av_local_disconnect(ToxAV *av, int32_t friend_number); void utox_av_local_call_control(ToxAV *av, uint32_t friend_number, TOXAV_CALL_CONTROL control); void set_av_callbacks(ToxAV *av); void callback_av_group_audio(void *tox, uint32_t groupnumber, uint32_t peernumber, const int16_t *pcm, unsigned int samples, uint8_t channels, unsigned int sample_rate, void *userdata); void group_av_peer_add(GROUPCHAT *g, int peernumber); void group_av_peer_remove(GROUPCHAT *g, int peernumber); #endif uTox/src/av/utox_av.c0000600000175000001440000005520314003056216013531 0ustar rakusers#include "utox_av.h" #include "audio.h" #include "video.h" #include "../debug.h" #include "../flist.h" #include "../friend.h" #include "../groups.h" #include "../inline_video.h" #include "../macros.h" #include "../tox.h" #include "../utox.h" #include "../ui.h" #include "../native/audio.h" #include "../native/thread.h" #include #include bool utox_av_ctrl_init = false; static bool toxav_thread_msg = 0; void postmessage_utoxav(uint8_t msg, uint32_t param1, uint32_t param2, void *data) { while (toxav_thread_msg && utox_av_ctrl_init) { /* I'm not convinced this is the best way */ yieldcpu(1); } toxav_msg.msg = msg; toxav_msg.param1 = param1; toxav_msg.param2 = param2; toxav_msg.data = data; toxav_thread_msg = 1; } void utox_av_ctrl_thread(void *UNUSED(args)) { ToxAV *av = NULL; utox_av_ctrl_init = 1; LOG_TRACE("uToxAv", "Toxav thread init" ); volatile uint32_t call_count = 0; volatile bool audio_in = 0; // volatile bool video_on = 0; while (1) { if (toxav_thread_msg) { TOX_MSG *msg = &toxav_msg; if (msg->msg == UTOXAV_KILL) { break; } else if (msg->msg == UTOXAV_NEW_TOX_INSTANCE) { if (av) { /* toxcore restart */ toxav_kill(av); postmessage_audio(UTOXAUDIO_NEW_AV_INSTANCE, 0, 0, msg->data); postmessage_video(UTOXVIDEO_NEW_AV_INSTANCE, 0, 0, msg->data); } else { thread(utox_audio_thread, msg->data); thread(utox_video_thread, msg->data); } av = msg->data; set_av_callbacks(av); } if (!utox_audio_thread_init || !utox_video_thread_init) { yieldcpu(10); } switch (msg->msg) { case UTOXAV_INCOMING_CALL_PENDING: { call_count++; postmessage_audio(UTOXAUDIO_PLAY_RINGTONE, msg->param1, msg->param2, NULL); break; } case UTOXAV_INCOMING_CALL_ANSWER: { FRIEND *f = get_friend(msg->param1); if (!f) { LOG_ERR("uToxAV", "Could not to get friend when INCOMING_CALL_ANSWER %u", msg->param1); break; } f->call_started = time(NULL); message_add_type_notice(&f->msg, S(CALL_STARTED), SLEN(CALL_STARTED), true); postmessage_audio(UTOXAUDIO_STOP_RINGTONE, msg->param1, msg->param2, NULL); postmessage_audio(UTOXAUDIO_START_FRIEND, msg->param1, msg->param2, NULL); f->call_state_self = (TOXAV_FRIEND_CALL_STATE_SENDING_A | TOXAV_FRIEND_CALL_STATE_ACCEPTING_A); if (msg->param2) { utox_video_start(0); f->call_state_self |= (TOXAV_FRIEND_CALL_STATE_SENDING_V | TOXAV_FRIEND_CALL_STATE_ACCEPTING_V); } break; } case UTOXAV_INCOMING_CALL_REJECT: { call_count--; postmessage_audio(UTOXAUDIO_STOP_RINGTONE, msg->param1, msg->param2, NULL); break; } case UTOXAV_OUTGOING_CALL_PENDING: { call_count++; postmessage_audio(UTOXAUDIO_PLAY_RINGTONE, msg->param1, msg->param2, NULL); FRIEND *f = get_friend(msg->param1); if (!f) { LOG_ERR("uToxAV", "Could not to get friend when OUTGOING_CALL_PENDING %u", msg->param1); break; } f->call_state_self = (TOXAV_FRIEND_CALL_STATE_SENDING_A | TOXAV_FRIEND_CALL_STATE_ACCEPTING_A); if (msg->param2) { utox_video_start(0); f->call_state_self |= (TOXAV_FRIEND_CALL_STATE_SENDING_V | TOXAV_FRIEND_CALL_STATE_ACCEPTING_V); } break; } case UTOXAV_OUTGOING_CALL_ACCEPTED: { FRIEND *f = get_friend(msg->param1); if (!f) { LOG_ERR("uToxAV", "Could not to get friend when OUTGOING_CALL_ACCEPTED %u", msg->param1); break; } f->call_started = time(NULL); message_add_type_notice(&f->msg, S(CALL_STARTED), SLEN(CALL_STARTED), true); postmessage_audio(UTOXAUDIO_START_FRIEND, msg->param1, msg->param2, NULL); postmessage_audio(UTOXAUDIO_STOP_RINGTONE, msg->param1, msg->param2, NULL); LOG_NOTE("uToxAV", "Call accepted by friend" ); break; } case UTOXAV_OUTGOING_CALL_REJECTED: { postmessage_audio(UTOXAUDIO_STOP_RINGTONE, msg->param1, msg->param2, NULL); break; } case UTOXAV_CALL_END: { call_count--; FRIEND *f = get_friend(msg->param1); if (f && f->call_state_self & (TOXAV_FRIEND_CALL_STATE_SENDING_V | TOXAV_FRIEND_CALL_STATE_ACCEPTING_V)) { utox_video_stop(false); } if (f && f->call_started != 0) { char notice_msg[64]; int duration = difftime(time(NULL), f->call_started); snprintf(notice_msg, sizeof(notice_msg), "%s: %02u:%02u:%02u", S(CALL_ENDED), duration / 3600, (duration / 60) % 60, duration % 60); int notice_msg_len = strnlen(notice_msg, sizeof(notice_msg) - 1); if (notice_msg_len < 64) { message_add_type_notice(&f->msg, notice_msg, notice_msg_len, true); } f->call_started = 0; } postmessage_audio(UTOXAUDIO_STOP_FRIEND, msg->param1, msg->param2, NULL); postmessage_audio(UTOXAUDIO_STOP_RINGTONE, msg->param1, msg->param2, NULL); break; } case UTOXAV_GROUPCALL_START: { call_count++; LOG_INFO("uToxAv", "Starting group call in groupchat %u", msg->param1); postmessage_audio(UTOXAUDIO_GROUPCHAT_START, msg->param1, msg->param2, NULL); break; } case UTOXAV_GROUPCALL_END: { GROUPCHAT *g = get_group(msg->param1); if (!g) { LOG_ERR("uToxAv", "Could not get group %u", msg->param1); break; } if (!call_count) { LOG_ERR("uToxAv", "Trying to end a call when no call is active."); break; } LOG_INFO("uToxAv", "Ending group call in groupchat %u", msg->param1); postmessage_audio(UTOXAUDIO_GROUPCHAT_STOP, msg->param1, msg->param2, NULL); call_count--; break; } case UTOXAV_START_AUDIO: { if (msg->param1) { /* Start audio preview */ call_count++; LOG_TRACE("uToxAV", "Starting Audio Preview" ); postmessage_audio(UTOXAUDIO_START_PREVIEW, 0, 0, NULL); } break; } case UTOXAV_STOP_AUDIO: { if (!call_count) { LOG_TRACE("uToxAV", "WARNING, trying to stop audio while already closed!\nThis is bad!" ); break; } if (msg->param1) { call_count--; LOG_TRACE("uToxAV", "Stopping Audio Preview" ); postmessage_audio(UTOXAUDIO_STOP_PREVIEW, 0, 0, NULL); } break; } case UTOXAV_START_VIDEO: { if (msg->param2) { utox_video_start(1); } else { utox_video_start(0); TOXAV_ERR_BIT_RATE_SET bitrate_err = 0; toxav_video_set_bit_rate(av, msg->param1, UTOX_DEFAULT_BITRATE_V, &bitrate_err); } break; } case UTOXAV_STOP_VIDEO: { if (msg->param2) { utox_video_stop(1); } else { utox_video_stop(0); TOXAV_ERR_BIT_RATE_SET bitrate_err = 0; toxav_video_set_bit_rate(av, msg->param1, -1, &bitrate_err); } postmessage_utox(AV_CLOSE_WINDOW, msg->param1, 0, NULL); break; } case UTOXAV_SET_AUDIO_IN: { LOG_TRACE("uToxAV", "Set audio in" ); if (audio_in) { postmessage_audio(UTOXAUDIO_CHANGE_MIC, 0, 0, NULL); } utox_audio_in_device_set(msg->data); if (msg->data != utox_audio_in_device_get()) { LOG_TRACE("uToxAV", "Error changing audio in" ); audio_in = 0; call_count = 0; break; } // TODO get a count in audio.c and allow count restore // if (audio_in) { // utox_audio_in_device_open(); // utox_audio_in_listen(); // } break; } case UTOXAV_SET_AUDIO_OUT: { LOG_TRACE("uToxAV", "Set audio out" ); postmessage_audio(UTOXAUDIO_CHANGE_SPEAKER, 0, 0, NULL); utox_audio_out_device_set(msg->data); break; } case UTOXAV_SET_VIDEO_IN: { utox_video_change_device(msg->param1); LOG_TRACE("uToxAV", "Changed video input device" ); break; } case UTOXAV_SET_VIDEO_OUT: { break; } } } toxav_thread_msg = false; if (av) { toxav_iterate(av); yieldcpu(toxav_iteration_interval(av)); } else { yieldcpu(10); } } postmessage_audio(UTOXAUDIO_KILL, 0, 0, NULL); postmessage_video(UTOXVIDEO_KILL, 0, 0, NULL); // Wait for all a/v threads to return 0 while (utox_audio_thread_init || utox_video_thread_init) { yieldcpu(1); } toxav_kill(av); utox_av_ctrl_init = false; LOG_NOTE("UTOXAV", "Clean thread exit!"); return; } static void utox_av_incoming_call(ToxAV *UNUSED(av), uint32_t friend_number, bool audio, bool video, void *UNUSED(userdata)) { LOG_TRACE("uToxAV", "A/V Invite (%u)" , friend_number); FRIEND *f = get_friend(friend_number); if (!f) { LOG_ERR("uToxAV", "Unable to get friend %u for A/V invite.", friend_number); return; } f->call_state_self = 0; f->call_state_friend = (audio << 2 | video << 3 | audio << 4 | video << 5); LOG_TRACE("uToxAV", "uTox AV:\tcall friend (%u) state for incoming call: %i" , friend_number, f->call_state_friend); postmessage_utoxav(UTOXAV_INCOMING_CALL_PENDING, friend_number, 0, NULL); postmessage_utox(AV_CALL_INCOMING, friend_number, video, NULL); } static void utox_av_remote_disconnect(ToxAV *UNUSED(av), int32_t friend_number) { LOG_TRACE("uToxAV", "Remote disconnect from friend %u" , friend_number); FRIEND *f = get_friend(friend_number); if (!f) { LOG_ERR("uToxAV", "Unable to get friend %u for remote disconnect.", friend_number); return; } postmessage_utoxav(UTOXAV_CALL_END, friend_number, 0, NULL); f->call_state_self = 0; f->call_state_friend = 0; postmessage_utox(AV_CLOSE_WINDOW, friend_number + 1, 0, NULL); postmessage_utox(AV_CALL_DISCONNECTED, friend_number, 0, NULL); } void utox_av_local_disconnect(ToxAV *av, int32_t friend_number) { TOXAV_ERR_CALL_CONTROL error = 0; if (av) { /* TODO HACK: tox_callbacks doesn't have access to toxav, so it just sets it as NULL, this is bad! */ toxav_call_control(av, friend_number, TOXAV_CALL_CONTROL_CANCEL, &error); } switch (error) { case TOXAV_ERR_CALL_CONTROL_OK: { LOG_NOTE("uToxAV", "ToxAV has disconnected!" ); break; } case TOXAV_ERR_CALL_CONTROL_SYNC: { LOG_ERR("uToxAV", "ToxAV sync error!"); break; } case TOXAV_ERR_CALL_CONTROL_FRIEND_NOT_FOUND: { LOG_ERR("uToxAV", "ToxAV friend #%i not found." , friend_number); break; } case TOXAV_ERR_CALL_CONTROL_FRIEND_NOT_IN_CALL: { LOG_ERR("uToxAV", "ToxAV no existing call for friend #%i." , friend_number); break; } case TOXAV_ERR_CALL_CONTROL_INVALID_TRANSITION: { LOG_NOTE("uToxAV", "Call already paused, or already running." ); break; } } FRIEND *f = get_friend(friend_number); if (!f) { LOG_ERR("uToxAV", "Unable to get friend %u for A/V disconnect.", friend_number); return; } f->call_state_self = 0; f->call_state_friend = 0; postmessage_utox(AV_CLOSE_WINDOW, friend_number + 1, 0, NULL); /* TODO move all of this into a static function in that file !*/ postmessage_utox(AV_CALL_DISCONNECTED, friend_number, 0, NULL); postmessage_utoxav(UTOXAV_CALL_END, friend_number, 0, NULL); } void utox_av_local_call_control(ToxAV *av, uint32_t friend_number, TOXAV_CALL_CONTROL control) { TOXAV_ERR_CALL_CONTROL err = 0; toxav_call_control(av, friend_number, control, &err); if (err) { LOG_TRACE("uToxAV", "Local call control error!" ); return; } TOXAV_ERR_BIT_RATE_SET bitrate_err = 0; FRIEND *f = get_friend(friend_number); if (!f) { LOG_ERR("uToxAV", "Unable to get friend %u for local call control.", friend_number); return; } switch (control) { case TOXAV_CALL_CONTROL_HIDE_VIDEO: { toxav_video_set_bit_rate(av, friend_number, 0, &bitrate_err); postmessage_utoxav(UTOXAV_STOP_VIDEO, friend_number, 0, NULL); f->call_state_self &= (0xFF ^ TOXAV_FRIEND_CALL_STATE_SENDING_V); break; } case TOXAV_CALL_CONTROL_SHOW_VIDEO: { toxav_video_set_bit_rate(av, friend_number, UTOX_DEFAULT_BITRATE_V, &bitrate_err); postmessage_utoxav(UTOXAV_START_VIDEO, friend_number, 0, NULL); f->call_state_self |= TOXAV_FRIEND_CALL_STATE_SENDING_V; break; } default: { LOG_ERR("uToxAV", "Unhandled local call control"); } // TODO // TOXAV_CALL_CONTROL_RESUME, // TOXAV_CALL_CONTROL_PAUSE, // TOXAV_CALL_CONTROL_CANCEL, // TOXAV_CALL_CONTROL_MUTE_AUDIO, // TOXAV_CALL_CONTROL_UNMUTE_AUDIO, } if (bitrate_err) { LOG_ERR("uToxAV", "Error setting/changing video bitrate"); } } // responds to a audio frame call back from toxav static void utox_av_incoming_frame_a(ToxAV *UNUSED(av), uint32_t friend_number, const int16_t *pcm, size_t sample_count, uint8_t channels, uint32_t sample_rate, void *UNUSED(userdata)) { // LOG_TRACE("uToxAv", "Incoming audio frame for friend %u " , friend_number); #ifdef NATIVE_ANDROID_AUDIO audio_play(friend_number, pcm, sample_count, channels); #else sourceplaybuffer(friend_number, pcm, sample_count, channels, sample_rate); #endif } static void utox_av_incoming_frame_v(ToxAV *UNUSED(toxAV), uint32_t friend_number, uint16_t width, uint16_t height, const uint8_t *y, const uint8_t *u, const uint8_t *v, int32_t ystride, int32_t ustride, int32_t vstride, void *UNUSED(user_data)) { /* copy the vpx_image */ /* 4 bits for the H*W, then a pixel for each color * size */ LOG_TRACE("uToxAV", "new video frame from friend %u" , friend_number); FRIEND *f = get_friend(friend_number); if (f == NULL) { LOG_ERR("uToxAV", "Incoming frame for a friend we don't know about! (%u)", friend_number); return; } f->video_width = width; f->video_height = height; size_t size = width * height * 4; UTOX_FRAME_PKG *frame = calloc(1, sizeof(UTOX_FRAME_PKG)); if (!frame) { LOG_ERR("uToxAV", "Can't malloc for incoming frame."); return; } frame->w = width; frame->h = height; frame->size = size; frame->img = malloc(size); if (!frame->img) { LOG_TRACE("uToxAV", "Could not allocate memory for image."); free(frame); return; } yuv420tobgr(width, height, y, u, v, ystride, ustride, vstride, frame->img); if (f->video_inline) { if (!inline_set_frame(width, height, size, frame->img)) { LOG_ERR("uToxAV", "Error setting frame for inline video."); } postmessage_utox(AV_INLINE_FRAME, friend_number, 0, NULL); free(frame->img); free(frame); } else { postmessage_utox(AV_VIDEO_FRAME, friend_number, 0, (void *)frame); } } static void utox_audio_friend_accepted(ToxAV *av, uint32_t friend_number, uint32_t state) { /* First accepted call back */ LOG_NOTE("uToxAV", "Friend accepted call" ); FRIEND *f = get_friend(friend_number); if (!f) { LOG_FATAL_ERR(EXIT_FAILURE, "uToxAV", "Unable to get friend when A/V call accepted %u", friend_number); } f->call_state_friend = state; if (SELF_SEND_VIDEO(friend_number) && !FRIEND_ACCEPTING_VIDEO(friend_number)) { utox_av_local_call_control(av, friend_number, TOXAV_CALL_CONTROL_HIDE_VIDEO); } postmessage_utoxav(UTOXAV_OUTGOING_CALL_ACCEPTED, friend_number, 0, NULL); postmessage_utox(AV_CALL_ACCEPTED, friend_number, 0, NULL); } /** respond to a Audio Video state change call back from toxav */ static void utox_callback_av_change_state(ToxAV *av, uint32_t friend_number, uint32_t state, void *UNUSED(userdata)) { FRIEND *f = get_friend(friend_number); if (!f) { LOG_ERR("uToxAV", "Unable to get friend when A/V state changed %u", friend_number); return; } if (state == 1) { // handle error LOG_ERR("uToxAV", "Change state with an error, this should never happen. Please send bug report!"); utox_av_remote_disconnect(av, friend_number); return; } else if (state == 2) { LOG_NOTE("uToxAV", "Call ended with friend_number %u." , friend_number); utox_av_remote_disconnect(av, friend_number); return; } else if (!f->call_state_friend) { utox_audio_friend_accepted(av, friend_number, state); } if (f->call_state_friend ^ (state & TOXAV_FRIEND_CALL_STATE_SENDING_A)) { if (state & TOXAV_FRIEND_CALL_STATE_SENDING_A) { LOG_INFO("uToxAV", "Friend %u is now sending audio." , friend_number); } else { LOG_INFO("uToxAV", "Friend %u is no longer sending audio." , friend_number); } } if (f->call_state_friend ^ (state & TOXAV_FRIEND_CALL_STATE_SENDING_V)) { if (state & TOXAV_FRIEND_CALL_STATE_SENDING_V) { LOG_INFO("uToxAV", "Friend %u is now sending video." , friend_number); } else { LOG_INFO("uToxAV", "Friend %u is no longer sending video." , friend_number); flist_reselect_current(); } } if (f->call_state_friend ^ (state & TOXAV_FRIEND_CALL_STATE_ACCEPTING_A)) { if (state & TOXAV_FRIEND_CALL_STATE_ACCEPTING_A) { LOG_INFO("uToxAV", "Friend %u is now accepting audio." , friend_number); } else { LOG_INFO("uToxAV", "Friend %u is no longer accepting audio." , friend_number); } } if (f->call_state_friend ^ (state & TOXAV_FRIEND_CALL_STATE_ACCEPTING_V)) { if (state & TOXAV_FRIEND_CALL_STATE_ACCEPTING_V) { LOG_INFO("uToxAV", "Friend %u is now accepting video." , friend_number); } else { LOG_INFO("uToxAV", "Friend %u is no longer accepting video." , friend_number); } } f->call_state_friend = state; } static void utox_incoming_video_rate_change(ToxAV *AV, uint32_t f_num, uint32_t v_bitrate, void *UNUSED(ud)) { /* Just accept what toxav wants the bitrate to be... */ if (v_bitrate > (uint32_t)UTOX_MIN_BITRATE_VIDEO) { TOXAV_ERR_BIT_RATE_SET error = 0; toxav_video_set_bit_rate(AV, f_num, v_bitrate, &error); if (error) { LOG_ERR("ToxAV", "Setting new Video bitrate has failed with error #%u" , error); } else { LOG_NOTE("uToxAV", "Video bitrate changed to %u" , v_bitrate); } } else { LOG_NOTE("uToxAV", "Video bitrate unchanged %u is less than %u" , v_bitrate, UTOX_MIN_BITRATE_VIDEO); } } static void utox_incoming_audio_rate_change(ToxAV *AV, uint32_t friend_number, uint32_t audio_bitrate, void *UNUSED(userdata)){ if (audio_bitrate > (uint32_t)UTOX_MIN_BITRATE_VIDEO) { TOXAV_ERR_BIT_RATE_SET error = 0; toxav_video_set_bit_rate(AV, friend_number, audio_bitrate, &error); if (error) { LOG_ERR("ToxAV", "Setting new audio bitrate has failed with error #%u" , error); } else { LOG_NOTE("uToxAV", "Audio bitrate changed to %u" , audio_bitrate); } } else { LOG_NOTE("uToxAV", "Audio bitrate unchanged %u is less than %u" , audio_bitrate, UTOX_MIN_BITRATE_AUDIO); } } void set_av_callbacks(ToxAV *av) { /* Friend update callbacks */ toxav_callback_call(av, &utox_av_incoming_call, NULL); toxav_callback_call_state(av, &utox_callback_av_change_state, NULL); /* Incoming data callbacks */ toxav_callback_audio_receive_frame(av, &utox_av_incoming_frame_a, NULL); toxav_callback_video_receive_frame(av, &utox_av_incoming_frame_v, NULL); /* Data type change callbacks. */ toxav_callback_video_bit_rate(av, &utox_incoming_video_rate_change, NULL); toxav_callback_audio_bit_rate(av, &utox_incoming_audio_rate_change, NULL); } uTox/src/av/filter_audio.h0000600000175000001440000000055214003056216014514 0ustar rakusers#ifndef FILTER_AUDIO_H #define FILTER_AUDIO_H #include #ifdef AUDIO_FILTERING #include #else #include typedef uint8_t Filter_Audio; #endif extern Filter_Audio *f_a; /* * enable/disable audio filtering according to settings * * returns resulting status of audio filtering */ bool filter_audio_check(void); #endif uTox/src/av/filter_audio.c0000600000175000001440000000142614003056216014510 0ustar rakusers#include "filter_audio.h" #include "audio.h" #include "../settings.h" #include #ifdef AUDIO_FILTERING #include #endif Filter_Audio *f_a = NULL; bool filter_audio_check(void) { #ifdef AUDIO_FILTERING if (!f_a && settings.audio_filtering_enabled) { f_a = new_filter_audio(UTOX_DEFAULT_SAMPLE_RATE_A); if (!f_a) { LOG_INFO("Filter Audio", "filter audio failed" ); return false; } LOG_INFO("Filter Audio", "filter audio on" ); } else if (f_a && !settings.audio_filtering_enabled) { kill_filter_audio(f_a); f_a = NULL; LOG_INFO("Filter Audio", "filter audio off" ); return false; } return settings.audio_filtering_enabled; #else return false; #endif } uTox/src/av/audio.h0000600000175000001440000000531114003056216013145 0ustar rakusers#ifndef AUDIO_H #define AUDIO_H #include #include #include #ifdef __APPLE__ #include #else #include #endif extern bool utox_audio_thread_init; enum { // kill the audio thread UTOXAUDIO_KILL, UTOXAUDIO_CHANGE_MIC, UTOXAUDIO_CHANGE_SPEAKER, UTOXAUDIO_START_FRIEND, UTOXAUDIO_STOP_FRIEND, UTOXAUDIO_GROUPCHAT_START, UTOXAUDIO_GROUPCHAT_STOP, UTOXAUDIO_START_PREVIEW, UTOXAUDIO_STOP_PREVIEW, UTOXAUDIO_PLAY_RINGTONE, UTOXAUDIO_STOP_RINGTONE, UTOXAUDIO_PLAY_NOTIFICATION, UTOXAUDIO_STOP_NOTIFICATION, UTOXAUDIO_NEW_AV_INSTANCE, }; enum { NOTIFY_TONE_NONE, NOTIFY_TONE_FRIEND_ONLINE, NOTIFY_TONE_FRIEND_OFFLINE, NOTIFY_TONE_FRIEND_NEW_MSG, NOTIFY_TONE_FRIEND_REQUEST, }; #define UTOX_DEFAULT_BITRATE_A 32 #define UTOX_MIN_BITRATE_AUDIO UTOX_DEFAULT_BITRATE_A //TODO: Find out what the minimum bit rate should be #define UTOX_DEFAULT_FRAME_A 20 #define UTOX_DEFAULT_SAMPLE_RATE_A 48000 #define UTOX_DEFAULT_AUDIO_CHANNELS 1 /* Check self */ #define UTOX_SENDING_AUDIO(f_number) (!!(get_friend(f_number)->call_state_self & TOXAV_FRIEND_CALL_STATE_SENDING_A)) // UTOX_ACCEPTING_AUDIO is unused. Delete? #define UTOX_ACCEPTING_AUDIO(f_number) (!!(get_friend(f_number)->call_state_self & TOXAV_FRIEND_CALL_STATE_ACCEPTING_A)) /* Check friend */ #define UTOX_AVAILABLE_AUDIO(f_number) (!!(get_friend(f_number)->call_state_friend & TOXAV_FRIEND_CALL_STATE_SENDING_A)) /* Check both */ #define UTOX_SEND_AUDIO(f_number) \ (!!(get_friend(f_number)->call_state_self & TOXAV_FRIEND_CALL_STATE_SENDING_A) \ && !!(get_friend(f_number)->call_state_friend & TOXAV_FRIEND_CALL_STATE_ACCEPTING_A)) // UTOX_ACCEPT_AUDIO is unused. Delete? #define UTOX_ACCEPT_AUDIO(f_number) \ (!!(get_friend(f_number)->call_state_self & TOXAV_FRIEND_CALL_STATE_ACCEPTING_A) \ && !!(get_friend(f_number)->call_state_friend & TOXAV_FRIEND_CALL_STATE_SENDING_A)) bool utox_audio_in_device_set(ALCdevice *new_device); bool utox_audio_out_device_set(ALCdevice *new_device); ALCdevice *utox_audio_in_device_get(void); // utox_audio_out_device_get is unused. Delete? ALCdevice *utox_audio_out_device_get(void); void utox_audio_in_device_open(void); void utox_audio_in_device_close(void); void utox_audio_in_listen(void); void utox_audio_in_ignore(void); void sourceplaybuffer(unsigned int i, const int16_t *data, int samples, uint8_t channels, unsigned int sample_rate); /* send a message to the audio thread */ void postmessage_audio(uint8_t msg, uint32_t param1, uint32_t param2, void *data); void utox_audio_thread(void *args); #endif uTox/src/av/audio.c0000600000175000001440000010102314003056216013135 0ustar rakusers#include "audio.h" #include "utox_av.h" #include "filter_audio.h" #include "../native/audio.h" #include "../native/keyboard.h" #include "../native/thread.h" #include "../native/time.h" #include "../debug.h" #include "../friend.h" #include "../groups.h" #include "../macros.h" #include "../main.h" // USER_STATUS_* #include "../self.h" #include "../settings.h" #include "../tox.h" #include "../utox.h" #include "../../langs/i18n_decls.h" #include #include #include #include #ifdef __APPLE__ #include #include #else #include #include #ifdef AUDIO_FILTERING #include #endif /* include for compatibility with older versions of OpenAL */ #ifndef ALC_ALL_DEVICES_SPECIFIER #include #endif #endif #ifdef AUDIO_FILTERING #include #endif static void utox_filter_audio_kill(Filter_Audio *filter_audio_handle) { #ifdef AUDIO_FILTERING kill_filter_audio(filter_audio_handle); #else (void)filter_audio_handle; #endif } bool utox_audio_thread_init = false; static ALCdevice *audio_out_handle, *audio_in_handle; static void * audio_out_device, *audio_in_device; static bool speakers_on, microphone_on; static int16_t speakers_count, microphone_count; /* TODO hacky fix. This source list should be a VLA with a way to link sources to friends. * NO SRSLY don't leave this like this! */ static ALuint ringtone, preview, notifytone; static ALuint RingBuffer, ToneBuffer; static bool audio_in_device_open(void) { if (!audio_in_device) { return false; } if (audio_in_device == (void *)1) { audio_in_handle = (void *)1; return true; } alGetError(); audio_in_handle = alcCaptureOpenDevice(audio_in_device, UTOX_DEFAULT_SAMPLE_RATE_A, AL_FORMAT_MONO16, (UTOX_DEFAULT_FRAME_A * UTOX_DEFAULT_SAMPLE_RATE_A * 4) / 1000); if (alGetError() == AL_NO_ERROR) { return true; } return false; } static bool audio_in_device_close(void) { if (audio_in_handle) { if (audio_in_handle == (void *)1) { audio_in_handle = NULL; microphone_on = false; return false; } if (microphone_on) { alcCaptureStop(audio_in_handle); } alcCaptureCloseDevice(audio_in_handle); } audio_in_handle = NULL; microphone_on = false; return false; } static bool audio_in_listen(void) { if (microphone_on) { microphone_count++; return true; } if (audio_in_handle) { if (audio_in_device == (void *)1) { audio_init(audio_in_handle); return true; } alcCaptureStart(audio_in_handle); } else if (audio_in_device) { /* Unable to get handle, try to open it again. */ audio_in_device_open(); if (audio_in_handle) { alcCaptureStart(audio_in_handle); } else { LOG_TRACE("uTox Audio", "Unable to listen to device!" ); } } if (audio_in_handle) { microphone_on = true; microphone_count = 1; return true; } microphone_on = false; microphone_count = 0; return false; } static bool audio_in_ignore(void) { if (!microphone_on) { return false; } if (--microphone_count > 0) { return true; } if (audio_in_handle) { if (audio_in_handle == (void *)1) { audio_close(audio_in_handle); microphone_on = false; microphone_count = 0; return false; } alcCaptureStop(audio_in_handle); } microphone_on = false; microphone_count = 0; return false; } bool utox_audio_in_device_set(ALCdevice *new_device) { if (microphone_on || microphone_count) { return false; } if (new_device) { audio_in_device = new_device; LOG_TRACE("uTox Audio", "Audio in device changed." ); return true; } audio_in_device = NULL; audio_in_handle = NULL; LOG_ERR("uTox Audio", "Audio out device set to null." ); return false; } ALCdevice *utox_audio_in_device_get(void) { if (audio_in_handle) { return audio_in_device; } return NULL; } static ALCcontext *context; static bool audio_out_device_open(void) { if (speakers_on) { speakers_count++; return true; } audio_out_handle = alcOpenDevice(audio_out_device); if (!audio_out_handle) { LOG_TRACE("uTox Audio", "alcOpenDevice() failed" ); speakers_on = false; return false; } context = alcCreateContext(audio_out_handle, NULL); if (!alcMakeContextCurrent(context)) { LOG_TRACE("uTox Audio", "alcMakeContextCurrent() failed" ); alcCloseDevice(audio_out_handle); audio_out_handle = NULL; speakers_on = false; return false; } ALint error; alGetError(); /* clear errors */ /* Create the buffers for the ringtone */ alGenSources((ALuint)1, &preview); if ((error = alGetError()) != AL_NO_ERROR) { LOG_TRACE("uTox Audio", "Error generating source with err %x" , error); speakers_on = false; speakers_count = 0; return false; } /* Create the buffers for incoming audio */ alGenSources((ALuint)1, &ringtone); if ((error = alGetError()) != AL_NO_ERROR) { LOG_TRACE("uTox Audio", "Error generating source with err %x" , error); speakers_on = false; speakers_count = 0; return false; } alGenSources((ALuint)1, ¬ifytone); if ((error = alGetError()) != AL_NO_ERROR) { LOG_TRACE("uTox Audio", "Error generating source with err %x" , error); speakers_on = false; speakers_count = 0; return false; } speakers_on = true; speakers_count = 1; return true; } static bool audio_out_device_close(void) { if (!audio_out_handle) { return false; } if (!speakers_on) { return false; } if (--speakers_count > 0) { return true; } alDeleteSources((ALuint)1, &preview); alDeleteSources((ALuint)1, &ringtone); alDeleteSources((ALuint)1, ¬ifytone); alcMakeContextCurrent(NULL); alcDestroyContext(context); alcCloseDevice(audio_out_handle); audio_out_handle = NULL; speakers_on = false; speakers_count = 0; return false; } bool utox_audio_out_device_set(ALCdevice *new_device) { if (new_device) { audio_out_device = new_device; LOG_TRACE("uTox Audio", "Audio out device changed." ); return true; } audio_out_device = NULL; audio_out_handle = NULL; LOG_TRACE("uTox Audio", "Audio in device set to null." ); return false; } ALCdevice *utox_audio_out_device_get(void) { if (audio_out_handle) { return audio_out_device; } return NULL; } void sourceplaybuffer(unsigned int f, const int16_t *data, int samples, uint8_t channels, unsigned int sample_rate) { if (!channels || channels > 2) { return; } ALuint source; if (f >= self.friend_list_size) { source = preview; } else { source = get_friend(f)->audio_dest; } ALuint bufid; ALint processed = 0, queued = 16; alGetSourcei(source, AL_BUFFERS_PROCESSED, &processed); alGetSourcei(source, AL_BUFFERS_QUEUED, &queued); alSourcei(source, AL_LOOPING, AL_FALSE); if (processed) { ALuint bufids[processed]; alSourceUnqueueBuffers(source, processed, bufids); alDeleteBuffers(processed - 1, bufids + 1); bufid = bufids[0]; } else if (queued < 16) { alGenBuffers(1, &bufid); } else { LOG_TRACE("uTox Audio", "dropped audio frame" ); return; } alBufferData(bufid, (channels == 1) ? AL_FORMAT_MONO16 : AL_FORMAT_STEREO16, data, samples * 2 * channels, sample_rate); alSourceQueueBuffers(source, 1, &bufid); // LOG_TRACE("uTox Audio", "audio frame || samples == %i channels == %u rate == %u " , samples, channels, sample_rate); ALint state; alGetSourcei(source, AL_SOURCE_STATE, &state); if (state != AL_PLAYING) { alSourcePlay(source); // LOG_TRACE("uTox Audio", "Starting source %u" , i); } } static void audio_in_init(void) { const char *audio_in_device_list; audio_in_device_list = alcGetString(NULL, ALC_CAPTURE_DEVICE_SPECIFIER); if (audio_in_device_list) { audio_in_device = (void *)audio_in_device_list; LOG_TRACE("uTox Audio", "input device list:" ); while (*audio_in_device_list) { LOG_TRACE("uTox Audio", "\t%s" , audio_in_device_list); postmessage_utox(AUDIO_IN_DEVICE, UI_STRING_ID_INVALID, 0, (void *)audio_in_device_list); audio_in_device_list += strlen(audio_in_device_list) + 1; } } postmessage_utox(AUDIO_IN_DEVICE, STR_AUDIO_IN_NONE, 0, NULL); audio_detect(); /* Get audio devices for windows */ } static void audio_out_init(void) { const char *audio_out_device_list; if (alcIsExtensionPresent(NULL, "ALC_ENUMERATE_ALL_EXT")) { audio_out_device_list = alcGetString(NULL, ALC_ALL_DEVICES_SPECIFIER); } else { audio_out_device_list = alcGetString(NULL, ALC_DEVICE_SPECIFIER); } if (audio_out_device_list) { audio_out_device = (void *)audio_out_device_list; LOG_TRACE("uTox Audio", "output device list:" ); while (*audio_out_device_list) { LOG_TRACE("uTox Audio", "\t%s" , audio_out_device_list); postmessage_utox(AUDIO_OUT_DEVICE, 0, 0, (void *)audio_out_device_list); audio_out_device_list += strlen(audio_out_device_list) + 1; } } audio_out_handle = alcOpenDevice(audio_out_device); if (!audio_out_handle) { LOG_TRACE("uTox Audio", "alcOpenDevice() failed" ); return; } int attrlist[] = { ALC_FREQUENCY, UTOX_DEFAULT_SAMPLE_RATE_A, ALC_INVALID }; context = alcCreateContext(audio_out_handle, attrlist); if (!alcMakeContextCurrent(context)) { LOG_TRACE("uTox Audio", "alcMakeContextCurrent() failed" ); alcCloseDevice(audio_out_handle); return; } // ALint error; // alGetError(); /* clear errors */ // alGenSources((ALuint)1, &ringtone); // if ((error = alGetError()) != AL_NO_ERROR) { // LOG_TRACE("uTox Audio", "Error generating source with err %x" , error); // return; // } // alGenSources((ALuint)1, &preview); // if ((error = alGetError()) != AL_NO_ERROR) { // LOG_TRACE("uTox Audio", "Error generating source with err %x" , error); // return; // } alcCloseDevice(audio_out_handle); } static bool audio_source_init(ALuint *source) { ALint error; alGetError(); alGenSources((ALuint)1, source); if ((error = alGetError()) != AL_NO_ERROR) { LOG_TRACE("uTox Audio", "Error generating source with err %x" , error); return false; } return true; } static void audio_source_raze(ALuint *source) { LOG_INFO("Audio", "Deleting source"); alDeleteSources((ALuint)1, source); } // clang-format off enum { NOTE_none, NOTE_c3_sharp, NOTE_g3, NOTE_b3, NOTE_c4, NOTE_a4, NOTE_b4, NOTE_e4, NOTE_f4, NOTE_c5, NOTE_d5, NOTE_e5, NOTE_f5, NOTE_g5, NOTE_a5, NOTE_c6_sharp, NOTE_e6, }; static struct { uint8_t note; double freq; } notes[] = { {NOTE_none, 1 }, /* Can't be 0 or openal will skip this note/time */ {NOTE_c3_sharp, 138.59 }, {NOTE_g3, 196.00 }, {NOTE_b3, 246.94 }, {NOTE_c4, 261.63 }, {NOTE_a4, 440.f }, {NOTE_b4, 493.88 }, {NOTE_e4, 329.63 }, {NOTE_f4, 349.23 }, {NOTE_c5, 523.25 }, {NOTE_d5, 587.33 }, {NOTE_e5, 659.25 }, {NOTE_f5, 698.46 }, {NOTE_g5, 783.99 }, {NOTE_a5, 880.f }, {NOTE_c6_sharp, 1108.73 }, {NOTE_e6, 1318.51 }, }; static struct melodies { /* C99 6.7.8/10 uninitialized arithmetic types are 0 this is what we want. */ uint8_t count; uint8_t volume; uint8_t fade; uint8_t notes[8]; } normal_ring[16] = { {1, 14, 1, {NOTE_f5, }}, {1, 14, 1, {NOTE_f5, }}, {1, 14, 1, {NOTE_f5, }}, {1, 14, 1, {NOTE_c6_sharp, }}, {1, 14, 0, {NOTE_c5, }}, {1, 14, 1, {NOTE_c5, }}, {0, 0, 0, {0, }}, }, friend_offline[4] = { {1, 14, 1, {NOTE_c4, }}, {1, 14, 1, {NOTE_g3, }}, {1, 14, 1, {NOTE_g3, }}, {0, 0, 0, {0, }}, }, friend_online[4] = { {1, 14, 0, {NOTE_g3, }}, {1, 14, 1, {NOTE_g3, }}, {1, 14, 1, {NOTE_a4, }}, {1, 14, 1, {NOTE_b4, }}, }, friend_new_msg[8] = { {1, 0, 0, {0, }}, /* 3/8 sec of silence for spammy friends */ {1, 0, 0, {0, }}, {1, 0, 0, {0, }}, {1, 9, 0, {NOTE_g5, }}, {1, 9, 1, {NOTE_g5, }}, {1, 12, 1, {NOTE_a4, }}, {1, 10, 1, {NOTE_a4, }}, {1, 0, 0, {0, }}, }, friend_request[8] = { {1, 9, 0, {NOTE_g5, }}, {1, 9, 1, {NOTE_g5, }}, {1, 12, 1, {NOTE_b3, }}, {1, 10, 1, {NOTE_b3, }}, {1, 9, 0, {NOTE_g5, }}, {1, 9, 1, {NOTE_g5, }}, {1, 12, 1, {NOTE_b3, }}, {1, 10, 0, {NOTE_b3, }}, }; // clang-format on typedef struct melodies MELODY; // TODO: These should be functions rather than macros that only work in a specific context. #define FADE_STEP_OUT() (1 - ((double)(index % (sample_rate / notes_per_sec)) / (sample_rate / notes_per_sec))) #define FADE_STEP_IN() (((double)(index % (sample_rate / notes_per_sec)) / (sample_rate / notes_per_sec))) // GEN_NOTE_RAW is unused. Delete? #define GEN_NOTE_RAW(x, a) ((a * base_amplitude) * (sin((tau * x) * index / sample_rate))) #define GEN_NOTE_NUM(x, a) ((a * base_amplitude) * (sin((tau * notes[x].freq) * index / sample_rate))) #define GEN_NOTE_NUM_FADE(x, a) \ ((a * base_amplitude * FADE_STEP_OUT()) * (sin((tau * notes[x].freq) * index / sample_rate))) // GEN_NOTE_NUM_FADE_IN is unused. Delete? #define GEN_NOTE_NUM_FADE_IN(x, a) \ ((a * base_amplitude * FADE_STEP_IN()) * (sin((tau * notes[x].freq) * index / sample_rate))) static void generate_melody(MELODY melody[], uint32_t seconds, uint32_t notes_per_sec, ALuint *target) { ALint error; alGetError(); /* clear errors */ alGenBuffers((ALuint)1, target); if ((error = alGetError()) != AL_NO_ERROR) { LOG_TRACE("uTox Audio", "Error generating buffer with err %i" , error); return; } const uint32_t sample_rate = 22000; const uint32_t base_amplitude = 1000; const double tau = 6.283185307179586476925286766559; const size_t buf_size = seconds * sample_rate * 2; // 16 bit (2 bytes per sample) int16_t *samples = calloc(buf_size, sizeof(int16_t)); if (!samples) { LOG_TRACE("uTox Audio", "Unable to generate ringtone buffer!" ); return; } for (uint64_t index = 0; index < buf_size; ++index) { /* index / sample rate `mod` seconds. will give you full second long notes * you can change the length each tone is played by changing notes_per_sec * but you'll need to add additional case to cover the entire span of time */ const int position = ((index / (sample_rate / notes_per_sec)) % (seconds * notes_per_sec)); for (int i = 0; i < melody[position].count; ++i) { if (melody[position].fade) { samples[index] += GEN_NOTE_NUM_FADE(melody[position].notes[i], melody[position].volume); } else { samples[index] += GEN_NOTE_NUM(melody[position].notes[i], melody[position].volume); } } } alBufferData(*target, AL_FORMAT_MONO16, samples, buf_size, sample_rate); free(samples); } static void generate_tone_call_ringtone() { generate_melody(normal_ring, 4, 4, &RingBuffer); } static void generate_tone_friend_offline() { generate_melody(friend_offline, 1, 4, &ToneBuffer); } static void generate_tone_friend_online() { generate_melody(friend_online, 1, 4, &ToneBuffer); } static void generate_tone_friend_new_msg() { generate_melody(friend_new_msg, 1, 8, &ToneBuffer); } static void generate_tone_friend_request() { generate_melody(friend_request, 1, 8, &ToneBuffer); } void postmessage_audio(uint8_t msg, uint32_t param1, uint32_t param2, void *data) { while (audio_thread_msg && utox_audio_thread_init) { yieldcpu(1); } audio_msg.msg = msg; audio_msg.param1 = param1; audio_msg.param2 = param2; audio_msg.data = data; audio_thread_msg = 1; } // TODO: This function is 300 lines long. Cut it up. void utox_audio_thread(void *args) { time_t close_device_time = 0; ToxAV *av = args; #ifdef AUDIO_FILTERING LOG_INFO("uTox Audio", "Audio Filtering" #ifdef ALC_LOOPBACK_CAPTURE_SAMPLES " and Echo cancellation" #endif " enabled in this build" ); #endif // bool call[MAX_CALLS] = {0}, preview = 0; const int perframe = (UTOX_DEFAULT_FRAME_A * UTOX_DEFAULT_SAMPLE_RATE_A) / 1000; uint8_t buf[perframe * 2 * UTOX_DEFAULT_AUDIO_CHANNELS]; //, dest[perframe * 2 * UTOX_DEFAULT_AUDIO_CHANNELS]; memset(buf, 0, sizeof(buf)); LOG_TRACE("uTox Audio", "frame size: %u" , perframe); /* init Microphone */ audio_in_init(); // audio_in_device_open(); // audio_in_listen(); /* init Speakers */ audio_out_init(); // audio_out_device_open(); // audio_out_device_close(); #define PREVIEW_BUFFER_SIZE (UTOX_DEFAULT_SAMPLE_RATE_A / 2) int16_t *preview_buffer = calloc(PREVIEW_BUFFER_SIZE, 2); if (!preview_buffer) { LOG_ERR("uTox Audio", "Unable to allocate memory for preview buffer."); return; } unsigned int preview_buffer_index = 0; bool preview_on = false; utox_audio_thread_init = true; while (1) { if (audio_thread_msg) { const TOX_MSG *m = &audio_msg; if (m->msg == UTOXAUDIO_KILL) { break; } int call_ringing = 0; switch (m->msg) { case UTOXAUDIO_CHANGE_MIC: { while (audio_in_ignore()) { continue; } while (audio_in_device_close()) { continue; } break; } case UTOXAUDIO_CHANGE_SPEAKER: { while (audio_out_device_close()) { continue; } break; } case UTOXAUDIO_START_FRIEND: { FRIEND *f = get_friend(m->param1); if (f && !f->audio_dest) { audio_source_init(&f->audio_dest); } audio_out_device_open(); audio_in_listen(); break; } case UTOXAUDIO_STOP_FRIEND: { FRIEND *f = get_friend(m->param1); if (f && f->audio_dest) { audio_source_raze(&f->audio_dest); f->audio_dest = 0; } audio_in_ignore(); audio_out_device_close(); break; } case UTOXAUDIO_GROUPCHAT_START: { LOG_DEBUG("Audio", "Starting Groupchat Audio %u", m->param1); GROUPCHAT *g = get_group(m->param1); if (!g) { LOG_ERR("uTox Audio", "Could not get group %u", m->param1); break; } if (!g->audio_dest) { audio_source_init(&g->audio_dest); } audio_out_device_open(); audio_in_listen(); break; } case UTOXAUDIO_GROUPCHAT_STOP: { LOG_DEBUG("Audio", "Stopping Groupchat Audio %u", m->param1); GROUPCHAT *g = get_group(m->param1); if (!g) { LOG_ERR("uTox Audio", "Could not get group %u", m->param1); break; } if (g->audio_dest) { audio_source_raze(&g->audio_dest); g->audio_dest = 0; } audio_in_ignore(); audio_out_device_close(); break; } case UTOXAUDIO_START_PREVIEW: { preview_on = true; audio_out_device_open(); audio_in_listen(); break; } case UTOXAUDIO_STOP_PREVIEW: { preview_on = false; audio_in_ignore(); audio_out_device_close(); break; } case UTOXAUDIO_PLAY_RINGTONE: { if (settings.audible_notifications_enabled && self.status != USER_STATUS_DO_NOT_DISTURB) { LOG_INFO("uTox Audio", "Going to start ringtone!" ); audio_out_device_open(); generate_tone_call_ringtone(); alSourcei(ringtone, AL_LOOPING, AL_TRUE); alSourcei(ringtone, AL_BUFFER, RingBuffer); alSourcePlay(ringtone); call_ringing++; } break; } case UTOXAUDIO_STOP_RINGTONE: { call_ringing--; LOG_INFO("uTox Audio", "Going to stop ringtone!" ); alSourceStop(ringtone); yieldcpu(5); audio_out_device_close(); break; } case UTOXAUDIO_PLAY_NOTIFICATION: { if (settings.audible_notifications_enabled && self.status == USER_STATUS_AVAILABLE) { LOG_INFO("uTox Audio", "Going to start notification tone!" ); if (close_device_time <= time(NULL)) { audio_out_device_open(); } switch (m->param1) { case NOTIFY_TONE_FRIEND_ONLINE: { generate_tone_friend_online(); break; } case NOTIFY_TONE_FRIEND_OFFLINE: { generate_tone_friend_offline(); break; } case NOTIFY_TONE_FRIEND_NEW_MSG: { generate_tone_friend_new_msg(); break; } case NOTIFY_TONE_FRIEND_REQUEST: { generate_tone_friend_request(); break; } } alSourcei(notifytone, AL_LOOPING, AL_FALSE); alSourcei(notifytone, AL_BUFFER, ToneBuffer); alSourcePlay(notifytone); time(&close_device_time); close_device_time += 10; LOG_INFO("uTox Audio", "close device set!" ); } break; } case UTOXAUDIO_STOP_NOTIFICATION: { break; } case UTOXAUDIO_NEW_AV_INSTANCE: { av = m->data; audio_in_init(); audio_out_init(); } } audio_thread_msg = 0; if (close_device_time && time(NULL) >= close_device_time) { LOG_INFO("uTox Audio", "close device triggered!" ); audio_out_device_close(); close_device_time = 0; } } settings.audio_filtering_enabled = filter_audio_check(); bool sleep = true; if (microphone_on) { ALint samples; bool frame = 0; /* If we have a device_in we're on linux so we can just call OpenAL, otherwise we're on something else so * we'll need to call audio_frame() to add to the buffer for us. */ if (audio_in_handle == (void *)1) { frame = audio_frame((void *)buf); if (frame) { /* We have an audio frame to use, continue without sleeping. */ sleep = false; } } else { alcGetIntegerv(audio_in_handle, ALC_CAPTURE_SAMPLES, sizeof(samples), &samples); if (samples >= perframe) { alcCaptureSamples(audio_in_handle, buf, perframe); frame = true; if (samples >= perframe * 2) { sleep = false; } } } #ifdef AUDIO_FILTERING #ifdef ALC_LOOPBACK_CAPTURE_SAMPLES if (f_a && settings.audio_filtering_enabled) { alcGetIntegerv(audio_out_device, ALC_LOOPBACK_CAPTURE_SAMPLES, sizeof(samples), &samples); if (samples >= perframe) { int16_t buffer[perframe]; alcCaptureSamplesLoopback(audio_out_handle, buffer, perframe); pass_audio_output(f_a, buffer, perframe); set_echo_delay_ms(f_a, UTOX_DEFAULT_FRAME_A); if (samples >= perframe * 2) { sleep = false; } } } #endif #endif if (frame) { bool voice = true; #ifdef AUDIO_FILTERING if (f_a) { const int ret = filter_audio(f_a, (int16_t *)buf, perframe); if (ret == -1) { LOG_TRACE("uTox Audio", "filter audio error" ); } if (ret == 0) { voice = false; } } #endif /* If push to talk, we don't have to do anything */ if (!check_ptt_key()) { voice = false; // PTT is up, send nothing. } if (preview_on) { if (preview_buffer_index + perframe > PREVIEW_BUFFER_SIZE) { preview_buffer_index = 0; } sourceplaybuffer(self.friend_list_size, preview_buffer + preview_buffer_index, perframe, UTOX_DEFAULT_AUDIO_CHANNELS, UTOX_DEFAULT_SAMPLE_RATE_A); if (voice) { memcpy(preview_buffer + preview_buffer_index, buf, perframe * sizeof(int16_t)); } else { memset(preview_buffer + preview_buffer_index, 0, perframe * sizeof(int16_t)); } preview_buffer_index += perframe; } if (voice) { size_t active_call_count = 0; for (size_t i = 0; i < self.friend_list_count; i++) { if (UTOX_SEND_AUDIO(i)) { active_call_count++; TOXAV_ERR_SEND_FRAME error = 0; // LOG_TRACE("uTox Audio", "Sending audio frame!" ); FRIEND *f = get_friend(i); if (!f) { LOG_ERR("uToxAV", "Unable to get friend when sending audio frame %u", i); continue; } toxav_audio_send_frame(av, f->number, (const int16_t *)buf, perframe, UTOX_DEFAULT_AUDIO_CHANNELS, UTOX_DEFAULT_SAMPLE_RATE_A, &error); if (error) { LOG_TRACE("uTox Audio", "toxav_send_audio error friend == %lu, error == %i" , i, error); } else { // LOG_TRACE("uTox Audio", "Send a frame to friend %i" ,i); if (active_call_count >= UTOX_MAX_CALLS) { LOG_TRACE("uTox Audio", "We're calling more peers than allowed by UTOX_MAX_CALLS, This is a bug" ); break; } } } } Tox *tox = toxav_get_tox(av); uint32_t num_chats = tox_conference_get_chatlist_size(tox); if (num_chats) { for (size_t i = 0 ; i < num_chats; ++i) { if (get_group(i) && get_group(i)->active_call) { LOG_TRACE("uTox Audio", "Sending audio in groupchat %u", i); toxav_group_send_audio(tox, i, (int16_t *)buf, perframe, UTOX_DEFAULT_AUDIO_CHANNELS, UTOX_DEFAULT_SAMPLE_RATE_A); } } } } } } if (sleep) { yieldcpu(50); } } utox_filter_audio_kill(f_a); f_a = NULL; // missing some cleanup ? alDeleteSources(1, &ringtone); alDeleteSources(1, &preview); alDeleteBuffers(1, &RingBuffer); while (audio_in_device_close()) { continue; } while (audio_out_device_close()) {continue; } audio_thread_msg = 0; utox_audio_thread_init = false; free(preview_buffer); LOG_TRACE("uTox Audio", "Clean thread exit!"); } void callback_av_group_audio(void *UNUSED(tox), uint32_t groupnumber, uint32_t peernumber, const int16_t *pcm, unsigned int samples, uint8_t channels, unsigned int sample_rate, void *UNUSED(userdata)) { GROUPCHAT *g = get_group(groupnumber); if (!g) { LOG_ERR("uTox Audio", "Could not get group with number: %i", groupnumber); return; } LOG_INFO("uTox Audio", "Received audio in groupchat %i from peer %i", groupnumber, peernumber); if (!g->active_call) { LOG_INFO("uTox Audio", "Packets for inactive call %u", groupnumber); return; } uint64_t time = get_time(); if (time - g->last_recv_audio[peernumber] > (uint64_t)1 * 1000 * 1000 * 1000) { postmessage_utox(GROUP_UPDATE, groupnumber, peernumber, NULL); } g->last_recv_audio[peernumber] = time; if (channels < 1 || channels > 2) { LOG_ERR("uTox Audio", "Can't continue, with channel > 2 or < 1."); return; } if (g->muted) { LOG_INFO("uTox Audio", "Group %u audio muted.", groupnumber); return; } ALuint bufid; ALint processed = 0, queued = 16; alGetSourcei(g->source[peernumber], AL_BUFFERS_PROCESSED, &processed); alGetSourcei(g->source[peernumber], AL_BUFFERS_QUEUED, &queued); alSourcei(g->source[peernumber], AL_LOOPING, AL_FALSE); if (processed) { ALuint bufids[processed]; alSourceUnqueueBuffers(g->source[peernumber], processed, bufids); alDeleteBuffers(processed - 1, bufids + 1); bufid = bufids[0]; } else if(queued < 16) { alGenBuffers(1, &bufid); } else { LOG_WARN("uTox Audio", "dropped audio frame %i %i" , groupnumber, peernumber); return; } alBufferData(bufid, (channels == 1) ? AL_FORMAT_MONO16 : AL_FORMAT_STEREO16, pcm, samples * 2 * channels, sample_rate); alSourceQueueBuffers(g->source[peernumber], 1, &bufid); ALint state; alGetSourcei(g->source[peernumber], AL_SOURCE_STATE, &state); if (state != AL_PLAYING) { alSourcePlay(g->source[peernumber]); LOG_DEBUG("uTox Audio", "Starting source %i %i" , groupnumber, peernumber); } } void group_av_peer_add(GROUPCHAT *g, int peernumber) { if (!g || peernumber < 0) { LOG_ERR("uTox Audio", "Invalid groupchat or peer number"); return; } LOG_INFO("uTox Audio", "Adding source for peer %u in group %u", peernumber, g->number); alGenSources(1, &g->source[peernumber]); } void group_av_peer_remove(GROUPCHAT *g, int peernumber) { if (!g || peernumber < 0) { LOG_ERR("uTox Audio", "Invalid groupchat or peer number"); return; } LOG_INFO("uTox Audio", "Deleting source for peer %u in group %u", peernumber, g->number); alDeleteSources(1, &g->source[peernumber]); } uTox/src/av/CMakeLists.txt0000600000175000001440000000167214003056216014441 0ustar rakusersproject(utoxAV LANGUAGES C) add_library(utoxAV STATIC utox_av.c audio.c video.c filter_audio.c ) if(WIN32) target_link_libraries(utoxAV OpenAL32) # Windows needs to be linked against OpenAL32 elseif(APPLE) find_package(libopus REQUIRED) include_directories(${LIBOPUS_INCLUDE_DIRS}) target_link_libraries(utoxAV ${LIBOPUS_LIBRARIES}) # Link OSX against opus else() # Both openal and opus are required for the static Linux builds on Jenkins. find_package(libopus REQUIRED) include_directories(${LIBOPUS_INCLUDE_DIRS}) target_link_libraries(utoxAV ${LIBOPUS_LIBRARIES}) find_package(OpenAL REQUIRED) include_directories(${OPENAL_INCLUDE_DIR}) target_link_libraries(utoxAV ${OPENAL_LIBRARY}) endif() if(ENABLE_FILTERAUDIO) find_package(libfilteraudio REQUIRED) include_directories(${LIBFILTERAUDIO_INCLUDE_DIRS}) target_link_libraries(utoxAV ${LIBFILTERAUDIO_LIBRARIES}) endif() uTox/src/android/0000700000175000001440000000000014003056216012703 5ustar rakusersuTox/src/android/window.c0000600000175000001440000000211014003056216014352 0ustar rakusers#include "../window.h" #include #include bool native_window_init(void) { return true; } static UTOX_WINDOW *native_window_create(UTOX_WINDOW *window, char *title, unsigned int class, int x, int y, int w, int h, int min_width, int min_height, void *gui_panel, bool override) { return NULL; } void native_window_raze(UTOX_WINDOW *window) { } UTOX_WINDOW *native_window_create_main(int x, int y, int w, int h, char **argv, int argc) { return NULL; } void native_window_create_video() { return; } UTOX_WINDOW *native_window_find_notify(void *window) { return NULL; } UTOX_WINDOW *native_window_create_notify(int x, int y, int w, int h, void* panel) { return NULL; } static void notify_tween_thread(void *obj) { } void window_set_focus(UTOX_WINDOW *win) { } void native_window_tween(UTOX_WINDOW *win) { } void native_window_create_screen_select() { } bool native_window_set_target(UTOX_WINDOW *new_win) { return true; } void native_screen_grab_desktop(bool video) { } uTox/src/android/res/0000700000175000001440000000000014003056216013474 5ustar rakusersuTox/src/android/res/drawable/0000700000175000001440000000000014003056216015255 5ustar rakusersuTox/src/android/res/drawable/i.png0000600000175000001440000001614614003056216016225 0ustar rakusersPNG  IHDR\rf-IDATxy\TƟaFtDPAǃi"izͅ,ͭ,,-.4%E ˭ wSqx\D DYgTX̙sfsɜ<9ĩ̂@8 r<|wHp/. 3$1eAT4Ӆ,8`xDI,`%("O{(<$[lA V e\w'%1գH)CʆDIjRxM 靁|`%O"R[NWS w_n'xg$8 (Wm>E#8`(?p6Pf4+%1QȋlДiN=CM~+gl|y8q((giVWdEI(xk>Lxg3YM~iiL+5%0Gb5A$f1 @-`LL8 %lrI!h'JyFA(kpl6+(~Ξk$DIYpx`3 #Ǡ2?o'ɔ߻OCnݺpl6#OzIKOY@i{~4oZl^ 5U< `h G٥k]pHpNnnŃ'LessW2ӠAWGzU~mk'կQ=8)3 ɋ/Zj!/\k"fMWwuPPPn>y $@Dʹ85yCS09Ns aDɹ}zr^=W:s)uR L#^q9jI???QMFpSE{h,iZҢe 9]:7BFV=fܘ.njޫjsdLrm\/<@HHHy|SZ}4o\L2q ~j_~|}ՙjM Y]e7tVUcfA@\T o*W6)ߨ,׆ª]a&LlB8\ կ_*.ʙ ~GF)hlkh)c#:.+.y:Nc)Fz=M7xzzʕQM*FoA1 @n$! vb3\\#SkJq K^L1pZ\PˡCx'C8y$Ij09uУ+B\tS۷+m޴"(BZ)Sx`@8= LAҪ0 uV\=dffj3222 %YS\Fj9%%%匠\/66֥Q>aXP ZN{wLRRe^A.nݪڻWx>jjs"@6Ou%RXl{(rvRX.=h߮t(.]ԌU=\xEwώZ8@#--M6t췧3_FF}JS!GsNZ L85OQ\|ɰ!ӿon~FF;)&Vc߾}=F]دO(ʹѣFw`U)RB߿gNwl|\GM?ۻw޽YIe;f5uᆹ@ӦM4𔿿bB.^B Q ;O8iy~&s/k/6ibV7|}}K$={9^Y杲{3{\!O(=Wr#^ʍzǎCG+ջw{{G]k6XmV]Nvwvv۷+F 8p+B<(2)j@2YF9y23m޺vZC^:[n {EI ћ> m)&|Y|΀~G%|, `(I@?8_*Fus'Mnr @FsDINu>l?ӡCÏ.oFxn:(xoǶS^^^)ǎ{|ra-|/% 6…}l~¹YM1pys5Xd8kl&X2Y@_QbwM+ߍ36 lZX"/Qcʥ?:Ŗgffju6(۸lR@Lao8 pٿ@O\JP?LzkҨԚLYE9>0ͯl:?yMI8'ʌqZfkҟ(c;wwn떭}ݡIII ]&J:Yf*OYWhl^7qcu?zhG˲ǧY8,J/r>ry6tJQƍ&N[^^^ew| {M!`:*i˦AAA$f;#СCrrr(p$Jw]f wOӧo%6U~ϝ={68قY(JM]fKv}cǎUd'͎9*--Q {(F*ccZf߾rNAA<&Sv+`M>G('?F{ɞ Qx/@0 UºRfT%ZVY/BS@C֋[C QAOKW?Y/BS_:J z"V!ΌWJŠV z-((Wl`զRSS_|989)9899Y}v0J;xw=Gڶk\ҿo͚57 b8Sv` WPj^,@邏3ϡ|XU /:=z4UHPřUYU kWUwC)&)))322ܝe$cU)RLVe8þl޴۷+)۶mk W_5g5)RfBӤ$Uljj'd5)RB,״ӞQ>̚9ѝ;wHiػwog5 +HR0~j;y͛XE <Ki<ŬQ/o QӘ_J;wTd(R\rW_y5J cF :j)Cn:x%JƍQ)[l6?m\wo9)??E(?i⤩1kc*+i\{ א)YYY M4ahԨQFY$Iş,~">>Mʍ:LOAXzhژ;;{5WBCCE[nÎ;gϞ]<')((`ogqc2/ IKK Q 6[tJ__| .??_=<]l6wK*@r׬B:`e&OuVMpp>Ks͝1Xnc\R [7^3|l(r(6.vvHHHo0~Rv-&@J?v\hQ~hڂu-UVV ŠU+橽oV/ 9R/Jx:~zۊU+}Ye F >'/(((wsZmMxӫ_>ض]<զ=},]u欙+W|U] zVe)'frʫ"""Rnt Ovnnǯu}>cRv"[t}\rNqP.{?^__|__ LpzxO|QK.Z̅p^(ª1 Lg E ,PΏ +Vb ω^!C +V peD8?^/ S ! P BB(B@!! P# O W^e.s LAs"sO2ٱcG5@8Nx)<3 INNv*L;VA:/5g+7o| ˄' Z< H)7RۯF2YI"R|n/x_NN`萡6o<pI=92"r]i׮Y[%2"?mPPPC!GC`\Jxl6\Z+t:Yj|rdKMDZ+#kFH!JZRY/BS߀K z^8zN^(%m!)+D!!UQ+i!%{ s֍e]/iX?BJQkqfQn[_R*: Jbɬ#!brav=ZR"!ÉtYB]O=xʱ7ii)&?MX[BWEI(džrQZz!&/!e(oʵ13v֘"^#!` ?8YQ3ܨ+g O7CpXW?C" @Ϲ@\ؑP3P"|C qv%g ?_8?KTB+fpj@_!NIs|)JEISkd yDTm*uy/`j&4P@u!܃m).8 vQϫa決qX5IENDB`uTox/src/android/main.h0000600000175000001440000000115314003056216014002 0ustar rakusers#if defined(MAIN_H) && !defined(ANDROID_MAIN_H) #error "We should never include main from different platforms." #endif #ifndef ANDROID_MAIN_H #define ANDROID_MAIN_H #define MAIN_H #include #include #include #include #include #include #include #include #include #include #include // Early include to obtain GLuint. #include typedef struct native_image { GLuint img; } NATIVE_IMAGE; #define ANDROID_INTERNAL_SAVE "/data/data/tox.client.utox/files/" #endif uTox/src/android/main.c0000600000175000001440000005723714003056216014013 0ustar rakusers#include "main.h" #include "gl.h" #include "freetype.h" #include "../debug.h" #include "../filesys.h" #include "../flist.h" #include "../main.h" #include "../settings.h" #include "../theme.h" #include "../tox.h" #include "../ui.h" #include "../utox.h" #include "../ui/svg.h" #include "../ui/edit.h" #include "../layout/background.h" #include "../native/keyboard.h" #include "../native/notify.h" #include "stb.h" #include #include #include #include #include #include #include #include #include static volatile bool destroy; bool have_focus = false; static bool shift; static ANativeActivity * activity; static ANativeWindow * window; static volatile ANativeWindow *windowN; static AInputQueue * inputQueue; static volatile AInputQueue * inputQueueNew; static volatile ARect rect; static volatile bool _redraw; const char *internalPath[UTOX_FILE_NAME_LENGTH]; static int pipefd[2]; typedef struct { uint32_t msg; uint16_t param1, param2; void * data; } PIPING; void postmessage_utox(UTOX_MSG msg, uint16_t param1, uint16_t param2, void *data) { PIPING piping = {.msg = msg, .param1 = param1, .param2 = param2, .data = data }; write(pipefd[1], &piping, sizeof(PIPING)); } void init_ptt(void) { settings.push_to_talk = 0; /* android is unsupported */ } bool check_ptt_key(void) { return 1; /* android is unsupported */ } void exit_ptt(void) { settings.push_to_talk = 0; /* android is unsupported */ } void image_set_filter(NATIVE_IMAGE *image, uint8_t filter) { /* Unsupported on android */ } void image_set_scale(NATIVE_IMAGE *image, double scale) { /* Unsupported on android */ } void draw_image(const NATIVE_IMAGE *data, int x, int y, uint32_t width, uint32_t height, uint32_t imgx, uint32_t imgy) { GL_draw_image(data, x, y, width, height, imgx, imgy); } void draw_inline_image(uint8_t *img_data, size_t size, uint16_t w, uint16_t h, int x, int y) { draw_image(img_data, x, y, w, h, 0, 0); } void thread(void func(void *), void *args) { pthread_t thread_temp; pthread_create(&thread_temp, NULL, (void *(*)(void *))func, args); } void yieldcpu(uint32_t ms) { usleep(1000 * ms); } uint64_t get_time(void) { struct timespec ts; clock_gettime(CLOCK_MONOTONIC_RAW, &ts); return ((uint64_t)ts.tv_sec * (1000 * 1000 * 1000)) + (uint64_t)ts.tv_nsec; } /* These functions aren't support on Andorid HELP? * TODO: fix these! */ void copy(int value) { /* Unsupported on android */ } void paste(void) { /* Unsupported on android */ } void openurl(char *str) { /* Unsupported on android */ } void openfilesend(void) { /* Unsupported on android */ } void openfileavatar(void) { /* Unsupported on android */ } typedef struct msg_header MSG_HEADER; void file_save_inline_image_png(MSG_HEADER *msg) { /* Unsupported on android */ } void setselection(char *data, uint16_t length) { /* Unsupported on android */ } void edit_will_deactivate(void) { /* Unsupported on android */ } NATIVE_IMAGE *utox_image_to_native(const UTOX_IMAGE data, size_t size, uint16_t *w, uint16_t *h, bool keep_alpha) { return GL_utox_image_to_native(data, size, w, h, keep_alpha); } void image_free(NATIVE_IMAGE *image) { if (!image) { return; } GLuint texture = image; glDeleteTextures(1, &texture); } // TODO: DRY. This function exists in both posix/filesys.c and in android/main.c // Make a posix native_get_file that you pass a complete path to instead of letting it construct // one would fix this. static void opts_to_sysmode(UTOX_FILE_OPTS opts, char *mode) { if (opts & UTOX_FILE_OPTS_READ) { mode[0] = 'r'; } if (opts & UTOX_FILE_OPTS_APPEND) { mode[0] = 'a'; } else if (opts & UTOX_FILE_OPTS_WRITE) { mode[0] = 'w'; } mode[1] = 'b'; if ((opts & (UTOX_FILE_OPTS_WRITE | UTOX_FILE_OPTS_APPEND)) && (opts & UTOX_FILE_OPTS_READ)) { mode[2] = '+'; } mode[3] = 0; return; } FILE *native_get_file_simple(const char *path, UTOX_FILE_OPTS opts) { char mode[4] = { 0 }; opts_to_sysmode(opts, mode); FILE *fp = fopen(path, mode); if (!fp && opts & UTOX_FILE_OPTS_READ && opts & UTOX_FILE_OPTS_WRITE) { LOG_WARN("Android Native", "Unable to simple open, falling back to fd" ); // read won't create a file if it doesn't already exist. If we're allowed to write, let's try // to create the file, then reopen it. int fd = open(path, O_RDWR | O_CREAT, S_IRUSR | S_IWUSR | S_IRGRP | S_IROTH); fp = fdopen(fd, mode); } return fp; } FILE *native_get_file(const uint8_t *name, size_t *size, UTOX_FILE_OPTS opts, bool portable_mode) { uint8_t path[UTOX_FILE_NAME_LENGTH] = { 0 }; snprintf(path, UTOX_FILE_NAME_LENGTH, ANDROID_INTERNAL_SAVE); // native_get_file should never be called with DELETE in combination with other FILE_OPTS. assert(opts <= UTOX_FILE_OPTS_DELETE); // WRITE and APPEND are mutually exclusive. WRITE will serve you a blank file. APPEND will append (duh). assert((opts & UTOX_FILE_OPTS_WRITE && opts & UTOX_FILE_OPTS_APPEND) == false); if (opts & UTOX_FILE_OPTS_READ || opts & UTOX_FILE_OPTS_MKDIR) { if (!native_create_dir(path)) { return NULL; } } if (strlen((char *)path) + strlen((char *)name) >= UTOX_FILE_NAME_LENGTH) { LOG_TRACE("Android Native", "Load directory name too long" ); return NULL; } else { snprintf((char *)path + strlen((char *)path), UTOX_FILE_NAME_LENGTH - strlen((char *)path), "%s", name); } if (opts == UTOX_FILE_OPTS_DELETE) { remove((char *)path); return NULL; } FILE *fp = native_get_file_simple((char *)path, opts); if (fp == NULL) { LOG_NOTE("Android Native", "Could not open %s" , path); return NULL; } if (size != NULL) { fseek(fp, 0, SEEK_END); *size = ftell(fp); fseek(fp, 0, SEEK_SET); } return fp; } bool native_move_file(const uint8_t *current_name, const uint8_t *new_name) { if(!current_name || !new_name) { return false; } return rename((char *)current_name, (char *)new_name); } void native_select_dir_ft(uint32_t fid, void *file) { return; /* TODO unsupported on android //fall back to working dir char *path = malloc(file->name_length + 1); memcpy(path, file->name, file->name_length); path[file->name_length] = 0; postmessage_toxcore(TOX_FILE_ACCEPT, fid, file->filenumber, path); */ } void native_autoselect_dir_ft(uint32_t fid, void *file) { return; /* TODO unsupported on android /* TODO: maybe do something different here? char *path = malloc(file->name_length + 1); memcpy(path, file->name, file->name_length); path[file->name_length] = 0; postmessage_toxcore(TOX_FILE_ACCEPT, fid, file->file_number, path); */ } bool native_create_dir(const uint8_t *filepath) { const int status = mkdir((char *)filepath, S_IRWXU); if (status == 0 || errno == EEXIST) { return true; } return false; } bool native_remove_file(const uint8_t *name, size_t length, bool portable_mode) { uint8_t path[UTOX_FILE_NAME_LENGTH] = { 0 }; snprintf((char *)path, UTOX_FILE_NAME_LENGTH, ANDROID_INTERNAL_SAVE); if (strlen((const char *)path) + length >= UTOX_FILE_NAME_LENGTH) { LOG_TRACE("Android Native", "File/directory name too long, unable to remove" ); return 0; } else { snprintf((char *)path + strlen((const char *)path), UTOX_FILE_NAME_LENGTH - strlen((const char *)path), "%.*s", (int)length, (char *)name); } if (remove((const char *)path)) { LOG_ERR("Android Native", "Unable to delete file!\n\t\t%s" , path); return 0; } else { LOG_INFO("Android Native", "File deleted!" ); LOG_TRACE("Android Native", "\t%s" , path); } return 1; } void native_export_chatlog_init(uint32_t friend_number) { /* Unsupported on Android */ } bool native_save_image_png(const char *name, const uint8_t *image, const int image_size) { /* Unsupported on Android */ } void flush_file(FILE *file) { fflush(file); int fd = fileno(file); fsync(fd); } int ch_mod(uint8_t *file) { /* You're probably looking for ./xlib as android isn't working when this was written. */ return -1; } int file_lock(FILE *file, uint64_t start, size_t length) { // Unsupported on android return 0; } bool native_video_init(void *handle) { return 0; /* Unsupported on android */ } void native_video_close(void *handle) { /* Unsupported on android */ } bool native_video_startread(void) { return 1; /* Unsupported on android */ } bool native_video_endread(void) { return 1; /* Unsupported on android */ } int native_video_getframe(uint8_t *y, uint8_t *u, uint8_t *v, uint16_t width, uint16_t height) { return 0; /* Unsupported on android */ } int file_unlock(FILE *file, uint64_t start, size_t length) { return 0; /* Unsupported on android */ } void setscale_fonts(void) { freefonts(); loadfonts(); } void setscale(void) { if (window) { svg_draw(0); } setscale_fonts(); } void notify(char *title, uint16_t title_length, const char *msg, uint16_t msg_length, void *object, bool is_group) { /* Unsupported on android */ } void desktopgrab(bool video) { /* Unsupported on android */ } void video_frame(uint16_t id, uint8_t *img_data, uint16_t width, uint16_t height, bool resize) { /* Unsupported on android */ } void video_begin(uint16_t id, char *name, uint16_t name_length, uint16_t width, uint16_t height) { /* Unsupported on android */ } void video_end(uint16_t id) { /* Unsupported on android */ } uint16_t native_video_detect(void) { return 0; /* Unsupported on android */ } bool video_init(void *handle) { return 0; /* Unsupported on android */ } void video_close(void *handle) { /* Unsupported on android */ } bool video_startread(void) { return 1; /* Unsupported on android */ } bool video_endread(void) { return 1; /* Unsupported on android */ } int video_getframe(uint8_t *y, uint8_t *u, uint8_t *v, uint16_t width, uint16_t height) { return 0; /* Unsupported on android */ } #define MAP(x, y) case AKEYCODE_##x : return y #define MAPS(x, y, z) case AKEYCODE_##x : return ((shift) ? z : y) #define MAPC(x) case AKEYCODE_##x : return (#x[0] + ((shift) ? 0 : ('a' - 'A'))) #define MAPN(x, y) case AKEYCODE_##x : return ((shift) ? y : #x[0]) static uint32_t getkeychar(int32_t key) /* get a character from an android keycode */ { switch (key) { MAP(ENTER, KEY_RETURN); MAP(DEL, KEY_BACK); MAP(DPAD_LEFT, KEY_LEFT); MAP(DPAD_RIGHT, KEY_RIGHT); MAP(DPAD_UP, KEY_UP); MAP(DPAD_DOWN, KEY_DOWN); MAP(SPACE, ' '); MAPS(MINUS, '-', '_'); MAPS(EQUALS, '=', '+'); MAPS(LEFT_BRACKET, '[', '{'); MAPS(RIGHT_BRACKET, ']', '}'); MAPS(BACKSLASH, '\\', '|'); MAPS(SEMICOLON, ';', ':'); MAPS(APOSTROPHE, '\'', '\"'); MAPS(COMMA, ',', '<'); MAPS(PERIOD, '.', '>'); MAPS(SLASH, '/', '?'); MAPS(GRAVE, '`', '~'); MAP(AT, '@'); MAP(STAR, '*'); MAP(PLUS, '+'); MAPC(A); MAPC(B); MAPC(C); MAPC(D); MAPC(E); MAPC(F); MAPC(G); MAPC(H); MAPC(I); MAPC(J); MAPC(K); MAPC(L); MAPC(M); MAPC(N); MAPC(O); MAPC(P); MAPC(Q); MAPC(R); MAPC(S); MAPC(T); MAPC(U); MAPC(V); MAPC(W); MAPC(X); MAPC(Y); MAPC(Z); MAPN(0, ')'); MAPN(1, '!'); MAPN(2, '@'); MAPN(3, '#'); MAPN(4, '$'); MAPN(5, '%'); MAPN(6, '^'); MAPN(7, '&'); MAPN(8, '*'); MAPN(9, '('); default: { LOG_TRACE("Android", "un-mapped %u", key); break; } } return 0; #undef MAP #undef MAPC } void redraw(void) { _redraw = 1; } void force_redraw(void) { redraw(); } void update_tray(void) { /* Unsupported on android */ } void utox_android_redraw_window(void) { if (!_redraw) { return; } _redraw = GL_utox_android_redraw_window(); panel_draw(&panel_root, 0, 0, settings.window_width, settings.window_height); } int lx = 0, ly = 0; uint64_t p_last_down; bool p_down, already_up; static void utox_andoid_input(AInputQueue *in_queue, AInputEvent *event) { if (AInputQueue_preDispatchEvent(inputQueue, event) == 0) { int32_t handled = 1; int32_t type = AInputEvent_getType(event); if (type == AINPUT_EVENT_TYPE_MOTION) { int32_t action = AMotionEvent_getAction(event); int32_t pointer_index = ((action & AMOTION_EVENT_ACTION_POINTER_INDEX_MASK) >> AMOTION_EVENT_ACTION_POINTER_INDEX_SHIFT); int32_t action_bits = (action & AMOTION_EVENT_ACTION_MASK); float x = AMotionEvent_getX(event, pointer_index); float y = AMotionEvent_getY(event, pointer_index); switch (action_bits) { case AMOTION_EVENT_ACTION_DOWN: case AMOTION_EVENT_ACTION_POINTER_DOWN: { lx = x; ly = y; panel_mmove(&panel_root, 0, 0, settings.window_width, settings.window_height, x, y, 0, 0); panel_mdown(&panel_root); // pointer[pointer_index].down = true; // pointer[pointer_index].x = x; // pointer[pointer_index].y = y; // pointerinput2(pointer_index); already_up = 0; LOG_TRACE("Android", "down %f %f, %u" , x, y, pointer_index); p_down = 1; p_last_down = get_time(); break; } case AMOTION_EVENT_ACTION_UP: case AMOTION_EVENT_ACTION_POINTER_UP: { // panel_mmove(&panel_root, 0, 0, width, height, x, y, 0); if (!already_up) { panel_mup(&panel_root); panel_mleave(&panel_root); } // pointer[pointer_index].down = false; // pointer[pointer_index].x = x; // pointer[pointer_index].y = y; // pointerinput(pointer_index); LOG_TRACE("Android", "up %f %f, %u" , x, y, pointer_index); p_down = 0; break; } case AMOTION_EVENT_ACTION_MOVE: { panel_mmove(&panel_root, 0, 0, settings.window_width, settings.window_height, x, y, x - lx, y - ly); if (lx != (int)x || ly != (int)y) { p_down = 0; lx = x; ly = y; LOG_TRACE("Android", "move %f %f, %u" , x, y, pointer_index); } // pointer[pointer_index].x = x; // pointer[pointer_index].y = y; break; } } } else if (type == AINPUT_EVENT_TYPE_KEY) { int32_t action = AMotionEvent_getAction(event); int32_t key = AKeyEvent_getKeyCode(event); if (action == AKEY_EVENT_ACTION_DOWN) { switch (key) { case AKEYCODE_VOLUME_UP: case AKEYCODE_VOLUME_DOWN: { handled = 0; break; } case AKEYCODE_MENU: { // open menu break; } case AKEYCODE_SHIFT_LEFT: case AKEYCODE_SHIFT_RIGHT: { shift = 1; break; } case AKEYCODE_BACK: { // ANativeActivity_finish(activity); break; } default: { uint32_t c = getkeychar(key); if (c != 0) { if (edit_active()) { // LOG_TRACE("Android", "%u" , c); edit_char(c, 0, 0); } // inputchar(c); } break; } } } else if (action == AKEY_EVENT_ACTION_UP) { if (key == AKEYCODE_SHIFT_LEFT || key == AKEYCODE_SHIFT_RIGHT) { shift = 0; } } } AInputQueue_finishEvent(inputQueue, event, handled); } } static void android_main(struct android_app *state) { utox_init(); theme_load(THEME_DEFAULT); settings.verbose = ~0; // Make sure glue isn't stripped // ANativeActivity* nativeActivity = state->activity; // internalPath = nativeActivity->internalDataPath; pipe(pipefd); fcntl(pipefd[0], F_SETFL, O_NONBLOCK); // Override to max spam for android settings.verbose = LOG_LVL_TRACE; thread(toxcore_thread, NULL); initfonts(); ui_rescale(12); /* wait for tox thread to start */ while (!tox_thread_init) { yieldcpu(1); } /* Code has been changed, this probably should be moved! */ flist_start(); ui_rescale(15); while (!destroy) { if (p_down && (p_last_down + 500 * 1000 * 1000) < get_time()) { panel_mup(&panel_root); panel_mright(&panel_root); p_down = 0; already_up = 1; } inputQueue = (AInputQueue *)inputQueueNew; if (inputQueue != NULL) { AInputEvent *event = NULL; while (AInputQueue_hasEvents(inputQueue) && AInputQueue_getEvent(inputQueue, &event) >= 0) { utox_andoid_input(inputQueue, event); } } int rlen, len; PIPING piping; while ((len = read(pipefd[0], (void *)&piping, sizeof(PIPING))) > 0) { LOG_TRACE("Android", "Piping %u %u" , len, sizeof(PIPING)); while (len != sizeof(PIPING)) { if ((rlen = read(pipefd[0], (void *)&piping + len, sizeof(PIPING) - len)) > 0) { len += rlen; } } utox_message_dispatch(piping.msg, piping.param1, piping.param2, piping.data); } ANativeWindow *win = (ANativeWindow *)windowN; if (win != window) { // new window if (window != NULL) { LOG_INFO("AndroidNative", "Replace old Window"); freefonts(); GL_raze_surface(); } window = win; if (window != NULL) { if (init_display(window) == false) { LOG_INFO("AndroidNative", "init_err"); ANativeActivity_finish(activity); break; } } } if (window != NULL && have_focus) { utox_android_redraw_window(); } usleep(1000); } LOG_TRACE("Android", "ANDROID DESTROYED" ); } void showkeyboard(bool show) { JavaVM *vm = activity->vm; JNIEnv *env = activity->env; JavaVMAttachArgs lJavaVMAttachArgs; lJavaVMAttachArgs.version = JNI_VERSION_1_6; lJavaVMAttachArgs.name = "NativeThread"; lJavaVMAttachArgs.group = NULL; (*vm)->AttachCurrentThread(vm, &env, &lJavaVMAttachArgs); // error check jobject lNativeActivity = activity->clazz; jclass ClassNativeActivity = (*env)->GetObjectClass(env, lNativeActivity); jclass ClassInputMethodManager = (*env)->FindClass(env, "android/view/inputmethod/InputMethodManager"); jfieldID fid = (*env)->GetFieldID(env, ClassNativeActivity, "mIMM", "Landroid/view/inputmethod/InputMethodManager;"); jobject lInputMethodManager = (*env)->GetObjectField(env, lNativeActivity, fid); jmethodID MethodGetWindow = (*env)->GetMethodID(env, ClassNativeActivity, "getWindow", "()Landroid/view/Window;"); jobject lWindow = (*env)->CallObjectMethod(env, lNativeActivity, MethodGetWindow); jclass ClassWindow = (*env)->FindClass(env, "android/view/Window"); jmethodID MethodGetDecorView = (*env)->GetMethodID(env, ClassWindow, "getDecorView", "()Landroid/view/View;"); jobject lDecorView = (*env)->CallObjectMethod(env, lWindow, MethodGetDecorView); if (show) { jmethodID MethodShowSoftInput = (*env)->GetMethodID(env, ClassInputMethodManager, "showSoftInput", "(Landroid/view/View;I)Z"); jboolean lResult = (*env)->CallBooleanMethod(env, lInputMethodManager, MethodShowSoftInput, lDecorView, 0); utox_android_redraw_window(); } else { jclass ClassView = (*env)->FindClass(env, "android/view/View"); jmethodID MethodGetWindowToken = (*env)->GetMethodID(env, ClassView, "getWindowToken", "()Landroid/os/IBinder;"); jobject lBinder = (*env)->CallObjectMethod(env, lDecorView, MethodGetWindowToken); jmethodID MethodHideSoftInput = (*env)->GetMethodID(env, ClassInputMethodManager, "hideSoftInputFromWindow", "(Landroid/os/IBinder;I)Z"); jboolean lRes = (*env)->CallBooleanMethod(env, lInputMethodManager, MethodHideSoftInput, lBinder, 0); } /*jmethodID MethodToggle = (*env)->GetMethodID(env, ClassInputMethodManager, "toggleSoftInput", "(II)V"); (*env)->CallVoidMethod(env, lInputMethodManager, MethodToggle, 0, 0);*/ (*vm)->DetachCurrentThread(vm); } static void onDestroy(ANativeActivity *act) { destroy = 1; } static void onNativeWindowCreated(ANativeActivity *act, ANativeWindow *win) { LOG_NOTE("AndroidNative", "Native Window Made"); windowN = win; } static void onNativeWindowDestroyed(ANativeActivity *act, ANativeWindow *win) { LOG_NOTE("AndroidNative", "Native Window Killed"); windowN = NULL; } static void onWindowFocusChanged(ANativeActivity *act, int focus) { have_focus = (focus != 0); } static void onInputQueueCreated(ANativeActivity *act, AInputQueue *queue) { inputQueueNew = queue; } static void onInputQueueDestroyed(ANativeActivity *act, AInputQueue *queue) { inputQueueNew = NULL; } static void onContentRectChanged(ANativeActivity *activity, const ARect *r) { rect = *r; LOG_TRACE("AndroidNative", "window changed rect: %u %u %u %u" , rect.left, rect.right, rect.top, rect.bottom); settings.window_baseline = rect.bottom; _redraw = 1; } __attribute__((externally_visible)) void ANativeActivity_onCreate(ANativeActivity *act, void *savedState, size_t savedStateSize) { if (!act) { return; } activity = act; // Add callbacks here (find them in android/native_activity.h) act->callbacks->onDestroy = onDestroy; act->callbacks->onNativeWindowCreated = onNativeWindowCreated; act->callbacks->onNativeWindowDestroyed = onNativeWindowDestroyed; act->callbacks->onWindowFocusChanged = onWindowFocusChanged; act->callbacks->onInputQueueCreated = onInputQueueCreated; act->callbacks->onInputQueueDestroyed = onInputQueueDestroyed; act->callbacks->onContentRectChanged = onContentRectChanged; // start main thread (android_main) pthread_t thread; pthread_attr_t myattr; pthread_attr_init(&myattr); pthread_attr_setdetachstate(&myattr, PTHREAD_CREATE_DETACHED); pthread_create(&thread, &myattr, (void *(*)(void *))android_main, NULL); } void launch_at_startup(bool should) {} uTox/src/android/logging.h0000600000175000001440000000015214003056216014502 0ustar rakusers#include #define debug(...) (__android_log_print(ANDROID_LOG_INFO, "utox", __VA_ARGS__)) uTox/src/android/gl.h0000600000175000001440000000422414003056216013462 0ustar rakusers#ifndef ANDROID_GL_H #define ANDROID_GL_H #include #include #include #include #define _GNU_SOURCE #include typedef struct native_image NATIVE_IMAGE; typedef struct { int16_t x, y; uint16_t tx, ty; } VERTEX2D; typedef struct { VERTEX2D vertex[4]; } QUAD2D; void makeglyph(QUAD2D *quad, int16_t x, int16_t y, uint16_t mx, uint16_t my, uint16_t width, uint16_t height); uint32_t setcolor(uint32_t a); void drawrect(int x, int y, int right, int bottom, uint32_t color); void draw_rect_fill(int x, int y, int width, int height, uint32_t color); void draw_rect_frame(int x, int y, int width, int height, uint32_t color); void drawhline(int x, int y, int x2, uint32_t color); void drawvline(int x, int y, int y2, uint32_t color); void drawalpha(int bm, int x, int y, int width, int height, uint32_t color); void loadalpha(int bm, void *data, int width, int height); void pushclip(int left, int top, int w, int h); void popclip(void); void enddraw(int x, int y, int width, int height); bool gl_init(void); /* gl initialization with EGL */ bool init_display(ANativeWindow *window); void GL_draw_image(const NATIVE_IMAGE *data, int x, int y, uint32_t width, uint32_t height, uint32_t imgx, uint32_t imgy); NATIVE_IMAGE *GL_utox_image_to_native(const uint8_t *data, size_t size, uint16_t *w, uint16_t *h, bool keep_alpha); int GL_utox_android_redraw_window(); void GL_raze_surface(void); int GL_drawtext(int x, int xmax, int y, char *str, uint16_t length); #if 0 void drawimage(NATIVE_IMAGE data, int x, int y, int width, int height, int maxwidth, bool zoom, double position) { GLuint texture = data; if(!zoom && width > maxwidth) { makequad(&quads[0], x, y, x + maxwidth, y + (height * maxwidth / width)); } else { makequad(&quads[0], x - (int)((double)(width - maxwidth) * position), y, x + width, y + height); } glBindTexture(GL_TEXTURE_2D, texture); float one[] = {1.0, 1.0, 1.0}; float zero[] = {0.0, 0.0, 0.0}; glUniform3fv(k, 1, one); glUniform3fv(k2, 1, zero); glDrawQuads(0, 1); glUniform3fv(k2, 1, one); } #endif #endif // ANDROID_GL_H uTox/src/android/gl.c0000600000175000001440000003736214003056216013466 0ustar rakusers#include "gl.h" #include "freetype.h" #include "main.h" #include "../native/ui.h" #include "../debug.h" #include "../macros.h" #include "../settings.h" #include "../text.h" #include "../ui.h" #include "../ui/svg.h" #include "../main.h" // stbi const char vertex_shader[] = "uniform vec4 matrix;" "attribute vec2 pos;" "attribute vec2 tex;" "varying vec2 x;" "void main(){" "x = tex / 32768.0;" "gl_Position = vec4((pos + matrix.xy) * matrix.zw, 0.0, 1.0);" "}", fragment_shader[] = #ifndef NO_OPENGL_ES "precision mediump float;" #endif "uniform sampler2D samp;" "uniform vec3 k;" "uniform vec3 k2;" "varying vec2 x;" "void main(){" "gl_FragColor = (texture2D(samp, x) + vec4(k2, 0.0)) * vec4(k, 1.0);" "}"; static GLuint prog, white; static GLint matrix, k, k2, samp; static GLuint bitmap[BM_ENDMARKER]; static QUAD2D quads[64]; static EGLDisplay display; static EGLSurface surface; static EGLContext context; static EGLConfig config; #ifndef NO_OPENGL_ES #define glDrawQuads(x, y) glDrawElements(GL_TRIANGLES, (y)*6, GL_UNSIGNED_BYTE, &quad_indices[(x)*6]) static uint8_t quad_indices[384]; #else #define glDrawQuads(x, y) glDrawArrays(GL_QUADS, (x), 4 * (y)) #endif static void makequad(QUAD2D *quad, int16_t x, int16_t y, int16_t right, int16_t bottom) { quad->vertex[0].x = x; quad->vertex[0].y = y; quad->vertex[0].tx = 0; quad->vertex[0].ty = 0; quad->vertex[1].x = right; quad->vertex[1].y = y; quad->vertex[1].tx = 32768; quad->vertex[1].ty = 0; quad->vertex[2].x = right; quad->vertex[2].y = bottom; quad->vertex[2].tx = 32768; quad->vertex[2].ty = 32768; quad->vertex[3].x = x; quad->vertex[3].y = bottom; quad->vertex[3].tx = 0; quad->vertex[3].ty = 32768; } static void makeline(QUAD2D *quad, int16_t x, int16_t y, int16_t x2, int16_t y2) { quad->vertex[0].x = x; quad->vertex[0].y = y; quad->vertex[1].x = x2; quad->vertex[1].y = y2; } void makeglyph(QUAD2D *quad, int16_t x, int16_t y, uint16_t mx, uint16_t my, uint16_t width, uint16_t height) { quad->vertex[0].x = x; quad->vertex[0].y = y; quad->vertex[0].tx = mx * 64; quad->vertex[0].ty = my * 64; quad->vertex[1].x = x + width; quad->vertex[1].y = y; quad->vertex[1].tx = (mx + width) * 64; quad->vertex[1].ty = my * 64; quad->vertex[2].x = x + width; quad->vertex[2].y = y + height; quad->vertex[2].tx = (mx + width) * 64; quad->vertex[2].ty = (my + height) * 64; quad->vertex[3].x = x; quad->vertex[3].y = y + height; quad->vertex[3].tx = mx * 64; quad->vertex[3].ty = (my + height) * 64; } static void set_color(uint32_t a) { union { uint32_t c; struct { uint8_t r, g, b, a; }; } color; color.c = a; float c[] = { (float)color.r / 255.0, (float)color.g / 255.0, (float)color.b / 255.0 }; glUniform3fv(k, 1, c); } uint32_t colori; float colorf[3]; uint32_t setcolor(uint32_t a) { union { uint32_t c; struct { uint8_t r, g, b, a; }; } color; color.c = a; colorf[0] = (float)color.r / 255.0; colorf[1] = (float)color.g / 255.0; colorf[2] = (float)color.b / 255.0; uint32_t s = colori; colori = a; return s; } void drawrect(int x, int y, int right, int bottom, uint32_t color) { set_color(color); glBindTexture(GL_TEXTURE_2D, white); makequad(&quads[0], x, y, right, bottom); glDrawQuads(0, 1); } void draw_rect_fill(int x, int y, int width, int height, uint32_t color) { drawrect(x, y, x + width, y + height, color); } void draw_rect_frame(int x, int y, int width, int height, uint32_t color) { set_color(color); glBindTexture(GL_TEXTURE_2D, white); makequad(&quads[0], x, y, x + width, y + height); glDrawArrays(GL_LINE_LOOP, 0, 4); } void drawhline(int x, int y, int x2, uint32_t color) { set_color(color); glBindTexture(GL_TEXTURE_2D, white); makeline(&quads[0], x, y + 1, x2, y + 1); glDrawArrays(GL_LINES, 0, 2); } void drawvline(int x, int y, int y2, uint32_t color) { set_color(color); glBindTexture(GL_TEXTURE_2D, white); makeline(&quads[0], x + 1, y, x + 1, y2); glDrawArrays(GL_LINES, 0, 2); } void drawalpha(int bm, int x, int y, int width, int height, uint32_t color) { set_color(color); glBindTexture(GL_TEXTURE_2D, bitmap[bm]); makequad(&quads[0], x, y, x + width, y + height); glDrawQuads(0, 1); } void loadalpha(int bm, void *data, int width, int height) { glBindTexture(GL_TEXTURE_2D, bitmap[bm]); glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_NEAREST); glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_NEAREST); glTexImage2D(GL_TEXTURE_2D, 0, GL_ALPHA, width, height, 0, GL_ALPHA, GL_UNSIGNED_BYTE, data); } typedef struct { int16_t x, y; uint16_t width, height; } RECT; static RECT clip[16]; static int clipk; void pushclip(int left, int top, int w, int h) { if (!clipk) { glEnable(GL_SCISSOR_TEST); } RECT *r = &clip[clipk++]; r->x = left; r->y = settings.window_height - (top + h); r->width = w; r->height = h; glScissor(r->x, r->y, r->width, r->height); } void popclip(void) { clipk--; if (!clipk) { glDisable(GL_SCISSOR_TEST); return; } RECT *r = &clip[clipk - 1]; glScissor(r->x, r->y, r->width, r->height); } void enddraw(int x, int y, int width, int height) { LOG_TRACE("AndroidGL", "Going to swap buffers"); if (!eglSwapBuffers(display, surface)) { LOG_ERR("AndroidGL", "OpenGL Swap errored! %d", eglGetError()); } } bool gl_init(void) { LOG_INFO("AndroidGL", "gl init\n"); GLuint vertshader, fragshader; GLint status; const GLchar *data; vertshader = glCreateShader(GL_VERTEX_SHADER); if (!vertshader) { LOG_TRACE("gl", "glCreateShader() failed (vert)" ); return false; } data = vertex_shader; glShaderSource(vertshader, 1, &data, NULL); glCompileShader(vertshader); glGetShaderiv(vertshader, GL_COMPILE_STATUS, &status); if (!status) { LOG_TRACE("gl", "glCompileShader() failed (vert):\n%s" , data); GLint infologsize = 0; glGetShaderiv(vertshader, GL_INFO_LOG_LENGTH, &infologsize); if (infologsize) { char *infolog = malloc(infologsize); glGetShaderInfoLog(vertshader, infologsize, NULL, (GLbyte *)infolog); LOG_TRACE("gl", "Infolog: %s" , infolog); free(infolog); } return false; } fragshader = glCreateShader(GL_FRAGMENT_SHADER); if (!fragshader) { return false; } data = &fragment_shader[0]; glShaderSource(fragshader, 1, &data, NULL); glCompileShader(fragshader); glGetShaderiv(fragshader, GL_COMPILE_STATUS, &status); if (!status) { LOG_TRACE("gl", "glCompileShader failed (frag):\n%s" , data); GLint infologsize = 0; glGetShaderiv(fragshader, GL_INFO_LOG_LENGTH, &infologsize); if (infologsize) { char *infolog = malloc(infologsize); glGetShaderInfoLog(fragshader, infologsize, NULL, (GLbyte *)infolog); LOG_TRACE("gl", "Infolog: %s" , infolog); free(infolog); } return false; } prog = glCreateProgram(); glAttachShader(prog, vertshader); glAttachShader(prog, fragshader); glBindAttribLocation(prog, 0, "pos"); glBindAttribLocation(prog, 1, "tex"); glLinkProgram(prog); glGetProgramiv(prog, GL_LINK_STATUS, &status); if (!status) { LOG_TRACE("gl", "glLinkProgram failed" ); GLint infologsize = 0; glGetShaderiv(prog, GL_INFO_LOG_LENGTH, &infologsize); if (infologsize) { char *infolog = malloc(infologsize); glGetShaderInfoLog(prog, infologsize, NULL, (GLbyte *)infolog); LOG_TRACE("gl", "Infolog: %s" , infolog); free(infolog); } return false; } glUseProgram(prog); matrix = glGetUniformLocation(prog, "matrix"); k = glGetUniformLocation(prog, "k"); k2 = glGetUniformLocation(prog, "k2"); samp = glGetUniformLocation(prog, "samp"); LOG_TRACE("gl", "uniforms: %i %i %i" , matrix, k, samp); GLint zero = 0; float one[] = { 1.0, 1.0, 1.0 }; glUniform1iv(samp, 1, &zero); glUniform3fv(k2, 1, one); uint8_t wh = { 255 }; glGenTextures(1, &white); glBindTexture(GL_TEXTURE_2D, white); glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_NEAREST); glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_NEAREST); glTexImage2D(GL_TEXTURE_2D, 0, GL_ALPHA, 1, 1, 0, GL_ALPHA, GL_UNSIGNED_BYTE, &wh); // glVertexAttribPointer(0, 2, GL_SHORT, GL_FALSE, sizeof(VERTEX2D), &quads[0]); glVertexAttribPointer(1, 2, GL_UNSIGNED_SHORT, GL_FALSE, sizeof(VERTEX2D), &quads[0].vertex[0].tx); glEnableVertexAttribArray(0); glEnableVertexAttribArray(1); // Alpha blending glBlendFunc(GL_SRC_ALPHA, GL_ONE_MINUS_SRC_ALPHA); glEnable(GL_BLEND); // glPixelStorei(GL_UNPACK_ALIGNMENT, 1); #ifndef NO_OPENGL_ES uint8_t i = 0; uint16_t ii = 0; do { quad_indices[ii] = i + 0; quad_indices[ii + 1] = i + 1; quad_indices[ii + 2] = i + 3; quad_indices[ii + 3] = i + 3; quad_indices[ii + 4] = i + 1; quad_indices[ii + 5] = i + 2; i += 4; ii += 6; } while (i); #endif glGenTextures(COUNTOF(bitmap), bitmap); svg_draw(0); loadfonts(); float vec[4]; vec[0] = -(float)settings.window_width / 2.0; vec[1] = -(float)settings.window_height / 2.0; vec[2] = 2.0 / (float)settings.window_width; vec[3] = -2.0 / (float)settings.window_height; glUniform4fv(matrix, 1, vec); LOG_INFO("AndroidGL", "GL init ready w %u h %u", settings.window_width, settings.window_height); ui_size(settings.window_width, settings.window_height); glViewport(0, 0, settings.window_width, settings.window_height); redraw(); return true; } /* gl initialization with EGL */ bool init_display(ANativeWindow *window) { LOG_INFO("AndroidGL", "gl display init\n"); const EGLint attrib_list[] = { EGL_CONTEXT_CLIENT_VERSION, 2, EGL_NONE }; const EGLint attribs[] = { EGL_SURFACE_TYPE, EGL_WINDOW_BIT, EGL_RENDERABLE_TYPE, EGL_OPENGL_ES2_BIT, EGL_BLUE_SIZE, 8, EGL_GREEN_SIZE, 8, EGL_RED_SIZE, 8, EGL_ALPHA_SIZE, 8, EGL_DEPTH_SIZE, 0, EGL_NONE }; EGLint numConfigs; display = eglGetDisplay(EGL_DEFAULT_DISPLAY); eglInitialize(display, NULL, NULL); eglChooseConfig(display, attribs, &config, 1, &numConfigs); EGLint format; eglGetConfigAttrib(display, config, EGL_NATIVE_VISUAL_ID, &format); ANativeWindow_setBuffersGeometry(window, 0, 0, format); surface = eglCreateWindowSurface(display, config, window, NULL); context = eglCreateContext(display, config, NULL, attrib_list); if (eglMakeCurrent(display, surface, surface, context) == EGL_FALSE) { LOG_ERR("AndroidGL", "eglMakeCurrent failed!"); return false; } int32_t w, h; eglQuerySurface(display, surface, EGL_WIDTH, &w); eglQuerySurface(display, surface, EGL_HEIGHT, &h); settings.window_width = w; settings.window_height = h; bool init = gl_init(); if (init == false) { LOG_ERR("AndroidGL", "gl_init failed :<"); } return init; } void GL_draw_image(const NATIVE_IMAGE *data, int x, int y, uint32_t width, uint32_t height, uint32_t imgx, uint32_t imgy) { GLuint texture = data->img; makequad(&quads[0], x - imgx, y - imgy, x + width, y + height); glBindTexture(GL_TEXTURE_2D, texture); float one[] = { 1.0, 1.0, 1.0 }; float zero[] = { 0.0, 0.0, 0.0 }; glUniform3fv(k, 1, one); glUniform3fv(k2, 1, zero); glDrawQuads(0, 1); glUniform3fv(k2, 1, one); } NATIVE_IMAGE *GL_utox_image_to_native(const uint8_t *data, size_t size, uint16_t *w, uint16_t *h, bool keep_alpha) { unsigned width, height, bpp; uint8_t *out = stbi_load_from_memory(data, size, &width, &height, &bpp, 3); if (out == NULL || width == 0 || height == 0) { return 0; } *w = width; *h = height; GLuint texture = 0; glGenTextures(1, &texture); glBindTexture(GL_TEXTURE_2D, texture); glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_NEAREST); glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_NEAREST); glTexImage2D(GL_TEXTURE_2D, 0, GL_RGB, width, height, 0, GL_RGB, GL_UNSIGNED_BYTE, out); free(out); return texture; } // Returns 1 if redraw is needed int GL_utox_android_redraw_window() { LOG_DEBUG("AndroidGL", "Redraw window"); int32_t new_width, new_height; eglQuerySurface(display, surface, EGL_WIDTH, &new_width); eglQuerySurface(display, surface, EGL_HEIGHT, &new_height); if (new_width != (int32_t)settings.window_width || new_height != (int32_t)settings.window_height) { LOG_DEBUG("AndroidGL", "Redraw window new size"); settings.window_width = new_width; settings.window_height = new_height; float vec[4]; vec[0] = -(float)settings.window_width / 2.0; vec[1] = -(float)settings.window_height / 2.0; vec[2] = 2.0 / (float)settings.window_width; vec[3] = -2.0 / (float)settings.window_height; glUniform4fv(matrix, 1, vec); ui_size(settings.window_width, settings.window_height); glViewport(0, 0, settings.window_width, settings.window_height); return 1; } return 0; } void GL_raze_surface(void) { // eglMakeCurrent(display, EGL_NO_SURFACE, EGL_NO_SURFACE, EGL_NO_CONTEXT); eglDestroyContext(display, context); eglDestroySurface(display, surface); eglTerminate(display); } int GL_drawtext(int x, int xmax, int y, char *str, uint16_t length) { glUniform3fv(k, 1, colorf); glBindTexture(GL_TEXTURE_2D, sfont->texture); int c = 0; while (length > 0) { uint32_t ch; uint8_t len = utf8_len_read(str, &ch); str += len; length -= len; GLYPH *g = font_getglyph(sfont, ch); if (g) { if (x + g->xadvance > xmax) { x = -x; break; } if (c == 64) { glDrawQuads(0, 64); c = 0; } makeglyph(&quads[c++], x + g->x, y + g->y, g->mx, g->my, g->width, g->height); x += g->xadvance; } } glDrawQuads(0, c); return x; } #if 0 void drawimage(NATIVE_IMAGE data, int x, int y, int width, int height, int maxwidth, bool zoom, double position) { GLuint texture = data; if(!zoom && width > maxwidth) { makequad(&quads[0], x, y, x + maxwidth, y + (height * maxwidth / width)); } else { makequad(&quads[0], x - (int)((double)(width - maxwidth) * position), y, x + width, y + height); } glBindTexture(GL_TEXTURE_2D, texture); float one[] = {1.0, 1.0, 1.0}; float zero[] = {0.0, 0.0, 0.0}; glUniform3fv(k, 1, one); glUniform3fv(k2, 1, zero); glDrawQuads(0, 1); glUniform3fv(k2, 1, one); } #endif uTox/src/android/freetype.h0000600000175000001440000000117014003056216014700 0ustar rakusers#ifndef ANDROID_FREETYPE_H #define ANDROID_FREETYPE_H #include #include #include #include typedef struct { uint32_t ucs4; int16_t x, y; uint16_t width, height, xadvance, xxxx; int16_t mx, my; } GLYPH; typedef struct { FT_Face face; uint8_t *fontmap; uint16_t x, y, my, height; GLuint texture; GLYPH * glyphs[128]; } FONT; extern FT_Library ftlib; extern FONT font[16], *sfont; GLYPH *font_getglyph(FONT *f, uint32_t ch); void initfonts(void); void loadfonts(void); void freefonts(void); #endif // ANDROID_FREETYPE_H uTox/src/android/freetype.c0000600000175000001440000000733714003056216014706 0ustar rakusers#include "main.h" #include "freetype.h" #include "gl.h" #include "../macros.h" #include "../ui.h" #include "../ui/draw.h" #define PIXELS(x) (((x) + 32) / 64) FT_Library ftlib; FONT font[16], *sfont; GLYPH *font_getglyph(FONT *f, uint32_t ch) { uint32_t hash = ch % 128; GLYPH * g = f->glyphs[hash], *s = g; if (g) { while (g->ucs4 != ~0) { if (g->ucs4 == ch) { return g; } g++; } uint32_t count = (uint32_t)(g - s); g = realloc(s, (count + 2) * sizeof(GLYPH)); if (!g) { return NULL; } f->glyphs[hash] = g; g += count; } else { g = malloc(sizeof(GLYPH) * 2); if (!g) { return NULL; } f->glyphs[hash] = g; } g[1].ucs4 = ~0; FT_UInt index = FT_Get_Char_Index(f->face, ch); FT_Load_Glyph(f->face, index, FT_LOAD_RENDER); FT_GlyphSlotRec *p = f->face->glyph; g->ucs4 = ch; g->x = p->bitmap_left; g->y = PIXELS(f->face->size->metrics.ascender) - p->bitmap_top; g->width = p->bitmap.width; g->height = p->bitmap.rows; g->xadvance = (p->advance.x + (1 << 5)) >> 6; if (f->x + g->width > 512) { f->x = 0; f->y = f->my; } g->mx = f->x; g->my = f->y; glBindTexture(GL_TEXTURE_2D, f->texture); glTexSubImage2D(GL_TEXTURE_2D, 0, f->x, f->y, g->width, g->height, GL_ALPHA, GL_UNSIGNED_BYTE, p->bitmap.buffer); f->x += g->width; if (f->y + g->height > f->my) { f->my = f->y + g->height; } return g; } void initfonts(void) { FT_Init_FreeType(&ftlib); } static bool font_open(FONT *f, double size, uint8_t weight) { FT_New_Face(ftlib, "/system/fonts/Roboto-Regular.ttf", 0, &f->face); FT_Set_Char_Size(f->face, (size * 64.0 + 0.5), (size * 64.0 + 0.5), 0, 0); f->fontmap = malloc(512 * 512); f->x = 0; f->y = 0; f->my = 0; f->height = 512; glGenTextures(1, &f->texture); glBindTexture(GL_TEXTURE_2D, f->texture); glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_NEAREST); glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_NEAREST); glTexImage2D(GL_TEXTURE_2D, 0, GL_ALPHA, 512, 512, 0, GL_ALPHA, GL_UNSIGNED_BYTE, f->fontmap); return 1; } void loadfonts(void) { font_open(&font[FONT_TEXT], SCALE(12.0), 0); font_open(&font[FONT_TITLE], SCALE(12.0), 1); font_open(&font[FONT_SELF_NAME], SCALE(14.0), 1); font_open(&font[FONT_STATUS], SCALE(11.0), 0); font_open(&font[FONT_LIST_NAME], SCALE(12.0), 0); // font_open(&font[FONT_MSG], F(11.0), 2); // font_open(&font[FONT_MSG_NAME], F(10.0), 2); font_open(&font[FONT_MISC], SCALE(10.0), 0); // font_open(&font[FONT_MSG_LINK], F(11.0), 2); font_small_lineheight = (font[FONT_TEXT].face->size->metrics.height + (1 << 5)) >> 6; // font_msg_lineheight = (font[FONT_MSG].face->size->metrics.height + (1 << 5)) >> 6; } void freefonts(void) { for (size_t i = 0; i != COUNTOF(font); i++) { FONT *f = &font[i]; if (f->face) { FT_Done_Face(f->face); } for (size_t j = 0; j != COUNTOF(f->glyphs); j++) { GLYPH *g = f->glyphs[j]; if (g) { /*while(g->ucs4 != ~0) { if(g->pic) { XRenderFreePicture(display, g->pic); } g++; }*/ free(f->glyphs[j]); f->glyphs[j] = NULL; } } } } static int _drawtext(int x, int xmax, int y, char *str, uint16_t length) { return GL_drawtext(x, xmax, y, str, length); } #include "../shared/freetype-text.c" uTox/src/android/audio.c0000600000175000001440000002405614003056216014161 0ustar rakusers/* uTox audio using OpenSL * todo: error checking, only record when needed, audio sources only in "playing" state when they have something to * play(does it make a difference?) */ #include "main.h" #include "../debug.h" #include "../settings.h" #include "../macros.h" #include "../utox.h" #include "../native/audio.h" #include "../native/thread.h" #include "../../langs/i18n_decls.h" #include #include #include #include "../native/audio.h" static SLObjectItf engineObject = NULL; static SLEngineItf engineEngine; static SLObjectItf outputMixObject = NULL; static SLObjectItf recorderObject = NULL; static SLRecordItf recorderRecord; static SLAndroidSimpleBufferQueueItf recorderBufferQueue; #define FRAMES (960 * 3) static short recbuf[960 * 2]; typedef struct { SLObjectItf player; SLAndroidSimpleBufferQueueItf queue; uint8_t channels; uint8_t value; volatile bool queued[8]; uint8_t unqueue; short * buf; } AUDIO_PLAYER; AUDIO_PLAYER loopback, call_player[32]; static SLDataFormat_PCM format_pcm = {.formatType = SL_DATAFORMAT_PCM, .numChannels = 1, .samplesPerSec = SL_SAMPLINGRATE_48, .bitsPerSample = SL_PCMSAMPLEFORMAT_FIXED_16, .containerSize = SL_PCMSAMPLEFORMAT_FIXED_16, .channelMask = SL_SPEAKER_FRONT_CENTER, .endianness = SL_BYTEORDER_LITTLEENDIAN }; volatile bool call[32]; pthread_mutex_t callback_lock; void * frames[128]; uint8_t frame_count; void playCallback(SLAndroidSimpleBufferQueueItf bq, void *context) { AUDIO_PLAYER *p = context; p->queued[p->unqueue++] = 0; if (p->unqueue == 8) { p->unqueue = 0; } } void init_player(AUDIO_PLAYER *p, uint8_t channels) { format_pcm.numChannels = channels; format_pcm.channelMask = ((channels == 1) ? SL_SPEAKER_FRONT_CENTER : (SL_SPEAKER_FRONT_LEFT | SL_SPEAKER_FRONT_RIGHT)); p->channels = channels; SLDataLocator_AndroidSimpleBufferQueue loc_bufq = { SL_DATALOCATOR_ANDROIDSIMPLEBUFFERQUEUE, 8 }; SLDataSource audioSrc = { &loc_bufq, &format_pcm }; SLDataLocator_OutputMix loc_outmix = { SL_DATALOCATOR_OUTPUTMIX, outputMixObject }; SLDataSink audioSnk = { &loc_outmix, NULL }; SLPlayItf bqPlayerPlay; const SLInterfaceID ids[] = { SL_IID_BUFFERQUEUE }; const SLboolean reqs[] = { SL_BOOLEAN_TRUE }; (*engineEngine)->CreateAudioPlayer(engineEngine, &p->player, &audioSrc, &audioSnk, 1, ids, reqs); (*p->player)->Realize(p->player, SL_BOOLEAN_FALSE); (*p->player)->GetInterface(p->player, SL_IID_PLAY, &bqPlayerPlay); (*p->player)->GetInterface(p->player, SL_IID_BUFFERQUEUE, &p->queue); (*p->queue)->RegisterCallback(p->queue, playCallback, p); (*bqPlayerPlay)->SetPlayState(bqPlayerPlay, SL_PLAYSTATE_PLAYING); p->buf = malloc(960 * 2 * 8 * channels); } void close_player(AUDIO_PLAYER *p) { (*p->player)->Destroy(p->player); free(p->buf); memset(p, 0, sizeof(*p)); } static void player_queue(AUDIO_PLAYER *p, const int16_t *data, uint8_t channels) { if (channels != p->channels && p->player) { close_player(p); } if (!p->player) { init_player(p, channels); } SLresult result; if (!p->queued[p->value]) { p->queued[p->value] = 1; memcpy(&p->buf[p->value * 960 * channels], data, 960 * 2 * channels); result = (*p->queue)->Enqueue(p->queue, &p->buf[p->value * 960 * channels], 960 * 2 * channels); p->value++; if (p->value == 8) { p->value = 0; } } else { LOG_TRACE("Audio", "dropped" ); } } /* thread dedicated to encoding audio frames */ /* todo: exit */ void encoder_thread(void *arg) { while (1) { void * frame; uint8_t c; pthread_mutex_lock(&callback_lock); c = frame_count; if (c) { frame = frames[0]; memmove(&frames[0], &frames[1], (c - 1) * sizeof(void *)); frame_count--; } pthread_mutex_unlock(&callback_lock); if (c) { if (settings.audio_preview) { player_queue(&loopback, frame, 1); } // TODO fix this int i; for (i = 0; i < 32; i++) { if (call[i]) { int r; uint8_t dest[960 * 2]; /*if((r = toxav_prepare_audio_frame(arg, i, dest, sizeof(dest), frame, 960)) < 0) { LOG_TRACE("Audio", "toxav_prepare_audio_frame error %i" , r); continue; } if((r = toxav_send_audio(arg, i, dest, r)) < 0) { LOG_TRACE("Audio", "toxav_send_audio error %i %s" , r, strerror(errno)); }*/ // toxav_audio_send_frame(av, friend[i].number, (const int16_t *)buf, perframe, // UTOX_DEFAULT_AUDIO_CHANNELS, UTOX_DEFAULT_SAMPLE_RATE_A, NULL); } } free(frame); } if (c <= 1) { yieldcpu(1); } } } /* these two callbacks assume they will be called from the same thread (not at the same time from different threads) */ void bqRecorderCallback(SLAndroidSimpleBufferQueueItf bq, void *context) { SLresult result; static bool b; short * buf = &recbuf[b ? 960 : 0]; pthread_mutex_lock(&callback_lock); if (frame_count == 128) { LOG_TRACE("Audio", "problem~!~" ); } else { void *frame = malloc(960 * 2); memcpy(frame, buf, 960 * 2); frames[frame_count++] = frame; } result = (*bq)->Enqueue(bq, buf, 960 * 2); b = !b; pthread_mutex_unlock(&callback_lock); } bool createAudioRecorder(void) { SLresult result; // configure audio source SLDataLocator_IODevice loc_dev = { SL_DATALOCATOR_IODEVICE, SL_IODEVICE_AUDIOINPUT, SL_DEFAULTDEVICEID_AUDIOINPUT, NULL }; SLDataSource audioSrc = { &loc_dev, NULL }; // configure audio sink SLDataLocator_AndroidSimpleBufferQueue loc_bq = { SL_DATALOCATOR_ANDROIDSIMPLEBUFFERQUEUE, 2 }; SLDataSink audioSnk = { &loc_bq, &format_pcm }; // create audio recorder // (requires the RECORD_AUDIO permission) const SLInterfaceID id[1] = { SL_IID_ANDROIDSIMPLEBUFFERQUEUE }; const SLboolean req[1] = { SL_BOOLEAN_TRUE }; result = (*engineEngine)->CreateAudioRecorder(engineEngine, &recorderObject, &audioSrc, &audioSnk, 1, id, req); if (SL_RESULT_SUCCESS != result) { return 0; } // realize the audio recorder result = (*recorderObject)->Realize(recorderObject, SL_BOOLEAN_FALSE); if (SL_RESULT_SUCCESS != result) { return 0; } // get the record interface result = (*recorderObject)->GetInterface(recorderObject, SL_IID_RECORD, &recorderRecord); // get the buffer queue interface result = (*recorderObject)->GetInterface(recorderObject, SL_IID_ANDROIDSIMPLEBUFFERQUEUE, &recorderBufferQueue); // register callback on the buffer queue result = (*recorderBufferQueue)->RegisterCallback(recorderBufferQueue, bqRecorderCallback, NULL); pthread_mutex_init(&callback_lock, NULL); // thread(encoder_thread, av); return 1; } void startRecording(void) { SLresult result; result = (*recorderRecord)->SetRecordState(recorderRecord, SL_RECORDSTATE_STOPPED); result = (*recorderBufferQueue)->Clear(recorderBufferQueue); result = (*recorderBufferQueue)->Enqueue(recorderBufferQueue, &recbuf[0], 960 * 2); result = (*recorderBufferQueue)->Enqueue(recorderBufferQueue, &recbuf[960], 960 * 2); result = (*recorderRecord)->SetRecordState(recorderRecord, SL_RECORDSTATE_RECORDING); } void stopRecording(void) { SLresult result; result = (*recorderRecord)->SetRecordState(recorderRecord, SL_RECORDSTATE_STOPPED); result = (*recorderBufferQueue)->Clear(recorderBufferQueue); pthread_mutex_lock(&callback_lock); unsigned int i; for (i = 0; i < frame_count; ++i) { free(frames[i]); frames[i] = NULL; } frame_count = 0; pthread_mutex_unlock(&callback_lock); } void createEngine(void) { SLresult result; result = slCreateEngine(&engineObject, 0, NULL, 0, NULL, NULL); result = (*engineObject)->Realize(engineObject, SL_BOOLEAN_FALSE); result = (*engineObject)->GetInterface(engineObject, SL_IID_ENGINE, &engineEngine); result = (*engineEngine)->CreateOutputMix(engineEngine, &outputMixObject, 0, NULL, NULL); result = (*outputMixObject)->Realize(outputMixObject, SL_BOOLEAN_FALSE); init_player(&loopback, 1); } /* ASSUMES LENGTH == 960 */ void audio_play(int32_t call_index, const int16_t *data, int length, uint8_t channels) { player_queue(&call_player[call_index], data, channels); } void audio_begin(int32_t call_index) { call[call_index] = 1; } void audio_end(int32_t call_index) { call[call_index] = 0; } void audio_detect(void) { createEngine(); createAudioRecorder(); postmessage_utox(AUDIO_IN_DEVICE, STR_AUDIO_IN_ANDROID, 1, (void *)(size_t)1); } bool audio_init(void *handle) { startRecording(); return 1; } bool audio_close(void *handle) { stopRecording(); return 1; } bool audio_frame(int16_t *buffer) { void * frame; uint8_t c; pthread_mutex_lock(&callback_lock); c = frame_count; if (c) { frame = frames[0]; memmove(&frames[0], &frames[1], (c - 1) * sizeof(void *)); frame_count--; } pthread_mutex_unlock(&callback_lock); if (c) { memcpy(buffer, frame, 960 * 2); free(frame); return 1; } return 0; } uTox/src/android/AndroidManifest.xml.in0000600000175000001440000000340014003056216017100 0ustar rakusers uTox/src/android/AndroidManifest.xml0000600000175000001440000000336514003056216016505 0ustar rakusers uTox/src/android/.idea/0000700000175000001440000000000014003056216013663 5ustar rakusersuTox/src/android/.idea/workspace.xml0000600000175000001440000004637414003056216016423 0ustar rakusers 1458026631571 uTox/src/android/.idea/vcs.xml0000600000175000001440000000033614003056216015204 0ustar rakusers uTox/src/android/.idea/modules.xml0000600000175000001440000000041214003056216016054 0ustar rakusers uTox/src/android/.idea/misc.xml0000600000175000001440000000124214003056216015341 0ustar rakusers uTox/src/android/.idea/copyright/0000700000175000001440000000000014003056216015673 5ustar rakusersuTox/src/android/.idea/copyright/profiles_settings.xml0000600000175000001440000000011414003056216022156 0ustar rakusers uTox/src/android/.idea/compiler.xml0000600000175000001440000000125614003056216016225 0ustar rakusers uTox/src/android/.idea/android.iml0000600000175000001440000000052014003056216016005 0ustar rakusers uTox/src/android/.idea/.name0000600000175000001440000000000714003056216014603 0ustar rakusersandroiduTox/screenshots/0000700000175000001440000000000014003056216013034 5ustar rakusersuTox/screenshots/utox-windows10.png0000600000175000001440000461667214003056216016422 0ustar rakusersPNG  IHDRp<%&sRGBgAMA aIDATx^v쾏N{Qg;=\BAFg/ An$3'J7ؑTe7m^GGa$NwbWY$:lctlEI=C6DV.oԥ#m/njclgaC@} d##U{99GI'aװf QlgPFFɶX y@il|QF>k;p֗clR+ߝFߒV/UB_x$_`L}]:&Ҧ74OwDH=YIjZJ=\>+nA,=qqrq3al_P6#GR=X-n3ƦAm:`J=zDqO(N|~w#o ۵7 ? r`JgsZkM4$$>hϒoqYa+?d~ۑYzQR:މ+}zӜ!#H@o4U5~62\<_pt6rl#y=!H%"%\S[D:$8I'e[^wQ ސrn7y##%=>,V{ |v _̳U,]R kɕXvdU>#|Ew}h9fy31K#M¾'T!&B}.h2!i$g -eʥˁ-5Epܔ] lϖܖ>0if'w6r>:-]ƓQWBv(+`Pys,W|$F gYoNܓ)=RLOs@yiIR僔6CoyD.H_xQ,ɔ I5 .߾ʈ77O'@s>x2L@JI:K.9gͣ]<r$,-YrHiH^D̓:(̟i5?9%ϯx1Vs &yx= h y)y= ] ?˺Y?/3]Yvv= 7#0tyZpxj8cYutfLo~6* 7"9]n%8^zKѼxX ރ3<1>r3T1>` n5&_齀dNg*KFk=ao|,EgW$?5|%y.uh!VDן$Z/}l61.ڦ@=T=x2W!y#g: -?>e&M[3޸XɱWK]m$ +YGוc.nSu޵vqXvqliۙ[ݍ:!iF< 8t%{NF:HԦϥuG`[]0/-нj1=nD~}:ouG )V w{L\Yzؕ-/g?]tˣwV_OUƖ^ޡWtyԣ_'wg鍵Oq=C쏓#>^ui'Q<uɆs ]p|GFΑpҏ+<3oR!3>@U]c"}[; H:5fG{7: r¸:ZGq~u+ yLDj17a[T%ߒx?|x<ԪMC&ִ@۫ʱ9Aou8^̏Adcxv=FGMH,Ad?eqJo>Kk܂ s/ (V)Se} j,ZBVƷ\߹k* YBפ>蹤UJyأ!?p8_U]Zj1PݨOsUet,^|2r.K۽tBG6Kf&=qw$N-,4yJ98/6(lx>|u9UzX֢cWT{ScT#mv_{8mb>_oVȜ_ͳFDTqfLT?K5&>(> B %?V&8>y[m(k Fۧ:g:{tլd#`=~=i-(|ⶨ+SAa|a U*ool\h[7%<I]3kǟXxcfNYs$ԛJͣaٶp? +y{3~?tɍ5 W{^wϽ.r ;.@=۹ܫH{(WND/(vϦng9D삡$]kI"ZS3PnrYkA3_/r3@ +_d˸ mJe1([a0|(;gZ/ z}@k-7έpӾFl :},AףNןGXo~Iw@̫W2mkvm_xA;~4vtc1;G= 5؂}HSןybE[\ jf5rA}>n\:rY:c}>q g NNN3br2gP{8:5޼݊]N&EcM3znFGA#EBm+MI*/; 嫴~CGg#U75ٿdkek kU%*G'0tޖOvpT[YcSktv\G~˰2KO8s%Yz$w$S!{IVѷ5wˤ{z'3C`8ȹy#G<݅ۘ '_Tzz.6\/}rY6JG Җa lU_6q&W7ftX|Q"ȔFAD?lr8GogЛ/(?뺪g}a>R75ZΑ`?I]pC:4w'/~'+ugm^?dA b/W{9~f^Kq7:ڍmw.ƪu2(YXyZe=>aBO :ף?[: g{^YF}NfviFMl#h<`Gٺ?\(^3~~޺_Ҿ9Pfc:&㑾t5[CjOhƏn\c.c9&Ip.".uEoՏ+31r 2Y}#SԼX9>Pq_y>Xs+" onzFڔqI?cXYtcmttgU>ȅ>=9M#EG퇀N1WfmȹIj0 ]ھ:yȳ` gYQasG+ȾCt6ҡFb'?9Oޠߛ8~_QtWxcA#Td3~ 8iN hy JtNXp!+& ,W^ܦNͅ+U8G(xޝ1ޛ߇5nN#3PR+ytsߒWxq~۱6fq^is4n":O?'䈖 !gvsn:[ :x[YzOnsNm|R=wf9g\Ewy)9^#aAWK<=9rr<;@S @cWʉT:beK!轹,Aؠ|fB$k| n:,/+b;Lb哥ǺtzSqޛ܊b}.Z_W07stױgyfUpZ~2W! >bxX>G)V$ο3Gk&@ Ա=cmVYSbcYXc"e!#"gc/)wc)ŨSccI&O\A߰f<*.ͫ?VS]InA~}87KҬI\f lMw3~A?;)7*g2 yLR<8~WDl'jr%ݼ흻477BQZ=)X*>#!{%(r{sr.;o7ݼW??׾i EahpLC-BImЌ MzE|4젊ߔP<.Lpg cSLS|}Q"fRr*TB?Rh uR+4mM:ivyYL)mX[4@ D|1=Vs((i\H;?d^ }+cde>q^uu>c+է~5xUqXXPW fuߙx+bDߑ=s9r.wJe=?mņL ]ZW^|٩@1y$6‡nsl|B>,úx8}Q H:Ay\Bo4:nܝL\7'Ո+1(ʮ`#uV[ЩaBEGzkNv+M+:꓏渌jAaK*ӋlG(h ht]agk8ONoVeע[>Ӥ'ײ/<_=}|b=V3:&vxO_v^5jzŝqo` _-%}QO&Ͽr`i)[^[W-72~[A|$9I$1wy<(jlƳ2.mMC;ep5r?toiJ,0XnaElt/[*v񱂮eR`Rt:TM$p|3o5azg*ƋhBX7)Gr .!]Be߲̺T9hv_cϟm7V`[ l&/3й8,Ƈ \VF-(gYy _r.Lj ?Kό{ Bj^ eTz{ ="M7gxeF cI @ť|?ޞFY)nf.7,h ? \Pu~kx<j#mw-Hcuef7/QUB%1~=աrT1GcJ;9Wi<XP]-MF"&c]J=kreӓ#7h1WU l^)ΙGy8/m,%њ׺.Uyˏbt^YgԖgCȾ~;;e /ZOJDx!8:+'HA#gmߓ.ς瘧3 HUz_a; @s7a,O5q1vx 10:>Rf;T#LJWdԕ>[wz!CDz5qdŧ|Scb@(-sfkA 綜nOp 'lޘ8~X7J?C#Ѽ6!_'ycnߚ_;2f}|Hv.#/97mHƢcRg4rC`3m>D:"W8JY8|_/Q^5ZG;y^\K7g[w6ҏV=F|U: s{zs{,*(02Nh5ieZy2iScv=R{ddma?x:t'AR8 +lR^˱PMH^'1F/iF<3M"LC,Y("\fCCv)]9BɥRܔS:N9GJA*_|3*FR,3+yKp *!Hy,n`*mbMAvuEN@%r 3B>e5S>iTk>8I!0<95X^i}#j.W7ȃiqy?:0}ͽ<~Mt}bk|{138fI R\3cO\dPϝ[ovz<Yi[#tֵ ֻ=VC,e8ZL7ƺX@Rci铇kO@ ~OrüEx.@_#Ǖč}%83rh{ ٘Dc߬qPI/2C(GȠ"ʯ֖,/%̤615\Lun,לa U)l]qfQj:O1WE4d,;|=gq aY,+ceyMgYH7ۣc˫cy?Zq\}{X.6^O‹qXm|i 1:B_)x:z:e?ȷmf}AG,]͡;V*O,wb+Xo6n@g¾ׁUci?Y>+V ^e߭ʍ5FR^ G)w_nq"FOmZ|OJw"甖wc^Oúby;yrf`0n&5 @On knZʇ$yѴiSD8'j^[m.owX)cိ.ms9P^uL%n+|1b'ZЫ7$log=Wn&Uo㽛3Wٗ|Zd؞voMH_a Rv7P$HnphbEsTa'-;B}=l?MdžzoйJX9oC7,wDs@#k, ҧYm5#s~E1ʾM+Kgg;9$+&L 9w^gtXQL=&# J֢WKE4&ېo]:cݣP Eٖ.c f~kܾ);b񟸰H=0geyh}ڡÊlaʣ34FeAGs6Dm]1Ycx>4%4г̓տ {鿥DU}o:8FLODzyP/ J>4G{y"ԫoyAZœ!/$/oKSc*~,9 N;gJN궖Mlb-ɺr|߉usj׃.Dʸ&{+Jsx\xz?r./XqpRtX_F85OSԶYK"M-dG4ͭ>gB nbm6W x$L;O"1HNbM뺧'5d;޷tֲWO}#zpݭn\]%ok;rJ O+_ ~t>lF`Ⱦ~MQ?Xvɜ#ne9Ɏyгq[O爏V^J^^{ QyaqױpHZ oljIi?m~|muљ8 Z8}g0g#yLvg^}ky\=؞1W r/s)׬gQg<)yx*q~>VϞS33"ԫo풾9p|< ^n#-둱n:zWXIћY(MJ@ȗrede?jmgK``t^6IE?_M{7 ɷ/>&/*D~li/Ig: B 8%U2l17XueZ$|X+d@S\ 529v᎗:'v#j}xj,vMX* Ŕ "hCqp\*T_ V} w?bHǟ9GRhh:]s@ ^cɳeF}YUgы2zVށD1!-ԕ q?^;kzD|4ƌ s`pv(Po\~]OM>h?x[_!.ͭ!:9s$YreQ ;%O9exy OKk |:y xbc}E~BͩS ˊly~ 9B%+ #3yhUBw:]kvDl)V+e{ROm:}|u^Pʺ9oW6zS1VbrɎ9_F69L2nݣxaI.T)> i,}RVpƞ kf5 zauKRٳ9  | )r>(Ee;{Ӈs\0"~G;tFUwoJ_'LZ~@E-J^*`8UyKoEyH/a=iոt?2eߟ7xn 㖤8IG$ʗzѶQ 6M?R%-EIGKcbj@-~OWhߏ`Sf]^izaXN Ֆ] K[Iz.ɾi#jc~z}_%2ρK?`WHc8%]Xj,˰"l]ܵP$m9ǜ+lKT6mr2gB(k\3W:W͊)?8jщr, }6d.xLv~7yڙLCR_ڝAǬg:~~ֿcͶmOW9H ~GLͬL`@g7wwt@-()`¾HTJg!#ۄ:-MY~ttCn=M9^%>cO=.BNPYz4Ë{!&^d_{rceDc-B֤>?񩯙*AlJ!T·:1OlJI !C+9R|tᗾiyax,x&hב:= 9s( %wrrMrKKz7M"IP4q%<OP?Ӑ%777bRqKly!y{y\g Q .pVJyۀ8x{r%qzǹ +E'bĜZ+Whc|l ϣY9SK.zWd|Dz6!m]6)69PۆWCjb&.mo@H-~g' y Q5╸pqbXO6ko:F?b _c3Ы}1:`uOomkYg6Y#\;tl]7cZsEQO|Iܐϝ!۫aI݄ҟ'ieّzhQG3tEfugs9[匥Ʋ˧UGj]w)𧡎$m[seF1w:jK{q#wk8P/o}Bl/v]ˆo?:G}>.Է ?Jj=:@]L`W%:v{~C3sKқ^/~V&چ:m_8ye#'8fltM!u%gnn·%XX^~ٜ #67lM/pG=K8-?'J<y.yaOX~C'Es]X?oau;-9ҜSrm%%8XGL>4¦%Gܘk*1q); ֣"[棹ߍcPLrJ0<\P:%8kr-`&&sD sIJzI"c:VB⑼07^nz9Jr"fsirQGXe Mif+4_Ǔ’wF_'JJXoDCHQ+r*,_6EBō5uL~4h@q*–Xq\4(eGGH}|"dž\VV滠lۧ勏|,?"l:S\`CWcb n/T;K/x EJ}gPl!?~'?,ڭ8kk6ޯ4q?soP-|<_Q\Ƽ4q&s f[xKϟPrږugXxQFm$sh,'9'*?!_]1ҟɷi,<;#m۰v\'^t$GyEOb0B/牷dKEN,ٺk$m[(Q 'W :TU?iBUѩK?C#qAYGWw\|~ݛ]<ׯu7ch\f:_At t-BDn?185~s4{O~h9輑_CѼ꾾;y}qmд}O5RB%SvgY򺶨:x;eA1Pt_<7KB,KĥO,K>mֿhm.6Lbvt12`ŢwuYHKٷX0g>?_]X[ E5FdrHBIH:qܬi7U Z9P'Ӥ5b9c [?gLܲB奴!}7] l j!PQlmy%onAL6uVH!'HcBiE]icԇQWh եJĉ6}xVb]xӳΜG7ȥѡ,Ifj]@jr݀A{{1w+3)K㴑 ^[@9TuUx>+.B=b;f m96Mo?Gۈc딴&X~ r`^#ˈ6H|Ӽۅ,9˒srܷOϢ\\鳕=HJe<*j>ӧFj-)\Q3?(z#D;Wl=8h}F82uб)5fc=y%/F6Y97s(YWhZu#sT%S[6no_HK8gm Zsoh܌D%kc]:m}`{srswas2%;Gp{Է]gPc9G_gSN?R? h oiq[樣0ʭNn$h՛?8:‹ho-Z~l9Xj蠧Җ?*vr,@%']Y~uISk?? dɮnJn[wj{{i@V]9T&˾G]=9Qt*ѷ U{x|^O _S|ћ+3h<6x R3Ԝķa7ǖh>`OC0WR;OY-q[1רdQ}ܷ^ KshVb0UG7GnLi'{3{RCnW>X">8vq#A~Xe#qΎC|1f$ID:%)JgJ73eO]{>V_si?ycv6i;6=jekc߻JGs)gVyxl㐦BQ=âi<3Һ!Lol~Ou2(mEOܩ׶sfǵo"͗ܳ)"4aӏf.?|NjXɾǬo}Vf,H,1 ;<^{޸yXXR5SY{bV'$>Kk՚ʱOmM@0kxy<kn\ys{b3KKi3 n{̵xF"Rb ,~<|qs~U\o9zOF@ϫ/n 2_ڤʏ $Rf\ ,НeO8O^tn!~gl]Goe?"j)t&O| H6+Wab Op2+=ol1_;7Zo{&,<* ,;,Ms)'8h>ۓ^Q6bʔ;962vxi8>;ùrkʃDrt߬HxLcXR3(MOH6 -+oR8l|?cIo7R~V|R^X@Ư$u۫b hh<snz>gY#:fџ3#0r{x\}̵w֡W&8POm}S.y5x`Xկ&o_Ѽ?Œ7^10x́7xR6Uxӹ"YF`Dagy. se779J'mcͮOnMCܦ%bfH"{ڡ5 MT=ŗk:|Cnn |M,n".pÛ7#|F$|1$;cͩG?ީm,-)й;=TƂ<.e@2SI3إ{>LH27rsV!776iBZ;ݍϝ>GZu@^YL tࡹx<8k^!iXsP碔ݼ0^}?2e-sXuya7ʒDk?8.Ϊ xgh+ۜu1j&KzVM;TL"/<x5}:rMrQG/E=Mjߟ[Ut3YˆEm}S'lm 36^(QbVBu@6?}n%6JL.O9/5|_ lLQ~T}?>Nۺ.(e$Vn_|nE:>j^B`7Ahi8J6V $R]. uj{zgOo?]^V#yNLqMm5@2XG:3Lۖ~[ ([㤻`,m cfퟶ{{צ:#z^fxy;oux6}` Ţn7G3%L] Ԑ |D4vw}p(ok7=c9v: ?y,Y' DK /ua|`ANlU('Nz/]M8R/yՖM{x:xz1 ME 6{:ux:օ5s6W'#|Nomd{} ɢ|6DcuT}MTW1=AIh3[%c H⹾Ndӂ }{zxF9WuAL-G_?_'!YϽWr/rqG[W#9'(O[oѼ}K;ԃϭSIGƲ1$酜WAq91䦲D4y%ԙMpN'%ߕuim(U%fXUA ~|p`uJG[y렐_YtΤҴlgлwHZ:N_>?yWҴpwquq>пys={.@!V.P\h`rEA+ٌ7"<}WrX24Vgo98?p'QA 9(oE7LuS+*ۦO=mk٫ !0 Dǿы#GS=(#BO7m~U l 0c^~Kc#ŧ~D3SNeW[p=]R{vMNR~e9Pɛ/ Yg0g̵q؏Y{#ɒn}t-o֘56=r0LĿE8ƈ69m2h׋uYRQjp;`5'gzN)&쳱(ezFG_W}I\`??qO訶\g=/DMXɘJ} omzxqv3`}sbQz䘜^OŹLRib_w9yTtMIuZ=ʫ2rl<^w@<X[4DO٦G3k><?dß1IY%ƼC[O-p[ϫcE"ụFȵZM :mYo48y~b7qo ߯x۱r"f$Hy Tuk?ZnE$5 l:&:>dwsc'q&ʄ/#|1':s5߭(yP" h+N DCp}XfB ϋY `Y|@w$7!zl0wΓy/*rMVkEA ?qs ^\6Aenc]{X}c0ˣ9?w[ZgݜơEM7EN>c@,,W'^ZU`HCW#/@;C ']5nQ5Vٓ8ENͅ&O܄> '[^okN>cX3wY[zĈ6Jɼȍrxmfd/ʠ;77`L"14p 7-Pu̓#9'GgE@ec@o2kKU^%1Z5C.H* =8#-?a#E㕟AcH?)Y9yvXO3 e~Yr +u+[ڔt+,תEН% }~[e7Wѝ37OoʉXCKKao\b~LRoy|EνgoM;Kik呟]hnnniK \? D˟XܟpXU~3r9&=qм(o40DzC\ eȅ̒%H^! ?_(2|d+V)}ep_炦9`;Eg8^/NXm,")t9J_bҌ,i .u9="9ٝAg v^tكit|,=L8!}9ȶrt~aI;mw Ɉ<:e3X\ne/`;|(X12Y(T7z=;ة{~WX@=ɺcP̞4{u68ߖܬcS(+}n˝)zX$%Uq-I,a;# ?y&y.3ʮBڒi}7(WEy}sss?\VO|co,!v+o&}_>|Cl~rK qddz2lfa,/1n|7~}xo>AJ.e,i6No'Bײ+ Hmmj*x,H%(6:%ƱM:(ZO#p-hH@WWs6|o}{:+Ehџ(KyOq8.f ĹV&T:WF6VnF}:0r ZR"Ah2ea:)O/enfv#Wtլqe*CykK;XZ.2Q}4o1Ԓ,3KL>JMA7BͺH֊RNR46Qs:@#=Po|oTrȚvH}}$) 8R{c|]# (9 `7U#uiigF혦ckEy_#ٿ^cw|sOн۵cgPO}t+.K[\Q^u$;~ ~~; 6~*B=+/\DMd#@y "tfhCsc(qW*i6Okk;5"P:<͂ƎDay56QޣYqghUyTbUzs G=jѕ~\fGzP֖~/2́rsh{ou$ӾP?4P#u2C96z<>P`Mw!xrT`+w+tkD3DsiW<"nwz F/s|]0=و\Oyc#<#9o>ޜ-?) :?=Ն@V_.;S{rz}KqG2~|p((Uz\aPԭzhNB~y1>c>AC0tŤ-n O%t 6#v1NrɄNy>7J(z@ D>Xd,Yc@TUp ȝ |L)s{12^=0l8Җud.:1qv>).7qHbXS=AkyE[fmk?}nذ0|3bw3||f{Hdy.W//lC:nգ*2Ƴ):t~ш@h9ܥ~Ic9Hy^#6èҬYb\ُW[ot},"]Rl>oT>7~/j3;Gb ЋR75AY= H;=OG@mX]UC-~#SoU-Ds%d9Onu AM9 T'{g90?&ʐ`ZN%xmdp{vV UN E:T_O' t񤿙Obzjsw|=DRi ~ `̦]Λ2N7'-{GqΔrb#|V{M)&>#cZ?8~"BypG|]!9b\*O4!ȣ͖(\pXɣ=:nJV$ -sٶRpax~ܓ2,HOz:ICՓ^,Hu΄7_3EVl\_`agْqql(~~"Z0 aXQyGFv1{gymˎtnPAn-< ђ^JrLxDYԡxE~3ot/1keK Ȼa0"''݋ ц)./uZvuNpPZZ$14Du9f\_1={eMel<;ߞIFYyηP,`١یaLW/8(md7>ҼQlH M!oӦ Py}''!eKo%$U[},6[ Uq WL?WUxx>9|1+!!7'1r~O"X9:}}Cvq wf9U?b7 0=7kzgY7tc]$$J:ncYīcیlb٭6U|-;1&ER/nlP^$?؄[ M21.5%wrWm+ψߒo'&a; Ɲ|;s(i$u_>Bt^ߡ~׺;!ӦUԝ=V~T9ws>i>VX([eS]߲C7cLy@?k(w?\E˫|@1Nͭ>Yp8ŐeNJߠOKPlCA#lo9ѩ|K/O6EK;t^q 15]0I_Kmflz1xDMwVCeX~qOVzn{Dvd_Ύe ʟ#>EcY7Mgb<+2}`=+-S @:#O,;]RXS}yvmsj5 P*J7$]rBc}-xktv 2}pG)|~OEJYjraU/sFMrG%ڎ4M_^pǗ>>%sbu]pX!ǺTGcv+Qe7p m_>~8uѕ睭"luo0#l'H⃮ *}&sSQѹ`=^9c(jH}?u.=<=>,3:9 Fi ';x >x%!ȝ=_C}wc֍ch_DI,}~)1k_xdq3Tf~~ޅ^es O?FQ~howz2h1lkg/:[ewO:+0q B=Tu^>sU91>uDY\Pl4jRDn?xT QĒA$C6:vjS@7s[m3ʡR'+v={h:Nҳ+(YY_YPߏe{~#<^\0a̸p?}-㫯q>-߬94e? y?9#[-Ĥ?qo}Q3h| 7aMy" e<1֖ ;˕H;+rssssssvoQ]ºYBțE,c\fYϪ䱼ۭ|S`ɣF,9qT2;8+ Bk$NQKjQ@'Γ!V{GH"˽kM,8"4EqR8ԾgSH_V ?:wX mOF;:fN[}>jZ^2pp@Z7__'MZWq VOćX~<=cB%me~F$q.Q P pQ+a.Ǥ'7G@~WeWW~ i`ȹmIuI_Aʫ`Ƅ#rë*Y'w&"|.Xr*iNL^JЕuXrp>g* 8e\O[g0蛎.RBjufi%Nږ6Fj`I7/$ B?2%H29Lʪ/.=*h ]:谴~iucPfD>:kLm|sϚ)GLtNs<3ʨ ^kv?x 繮Kz!8ƆJ (k ʖu%? axŲGWt7݊x7 |yX'TӋFcqe*ܦWؖ{zgڞ4 UQo:D,&'ǹzv5OsO \Dv>F|(klP^69`~.+ivZ5WYF3ʋ.ͻ҅}lFq,?g"G6w4m{+h{mV0ڱQ, ^>WY;{#6lA#X:Qz9DX|ˁ?=}6Ss.89Fg3e7C΍Als5I>fʫ8Hy }#t\[ciUqD±XX 99X e֕A?aᡑ۞D`Y,:I4gKEr>g.ɵΟ^ >!˃A~#e\fr-R)~kOWܼH,777aK>,7~#or`*7Q]m keT"d2'^y H'N۳GʱB`~y&L?8aОz"`9rȾL~lr'sY'~ke[k`ō$2\yE_wT )>::s 299=^4yp,y53䇍 Cc4uRC<9 #[֖<?vd\ ܏E盏 K>-߬94ߖ&ᧂX^.zc|ENu($qxƞ ]H"u۟ ]qgvnnRށ}z&Yy3_+oMLwf\卢I_{P_) m qݢxH`o[ndBeHvuV,95RO sP|EYKCDJ4z%o¨E~tf"QWwZjcM*w6RG|%3 cDlUk_?DGͮ Ifuc )ٴVej}??P ʊe^z9((@3Mcξ];Z".>'v}t ͩ`Me? ;* :UIfXբ͚c]<ȸ󵺪q9rS_M0aT/ʾa:l5js=m&ɂMrNO+(f45**[)k+ {jOk9'Bl NNV;h}ymsw[g!\LZP/ڠOA4z-ԉJ %;WNYDcl唇 tdx^<|UO%ĿӁo%wc7=y{H#c-Ǖ܌\{7DZ\?B V-S!x7k7&7L|+@yn0? ާ-]tc F[*?XtBg{S2k]ڢ*jAZ%)^w M;Fb~6mXFZce_57mip 9,Pßib&ƒsrK;thCux l9ȿmTc_)mY9zߓTiK-K6NԄorm8$gl|Mmo8P4U\qp>} P)ְz4 V[%ratZ&S9z0ax1q.9Hm(7QX*g-,5sדhzPݗ,[k=`}{b徎1$V}jΌׄ%Mn#Wo˃Bا6ViLxqzO5'Ou9ps: dev/??eGeW"L(L3_Ikn`DWHs#ywIvss.ǘLǐ^L^b$QSꮶF[o^[ Qk5%7wsJo@=Ş{{Tvŝze-wEw,rq.CbqHPмŁBq9Dr?k kQF3deoޕ`Z@? >G6.(H!;,-p?N'u^a ֝s@U 55Jzn*i' yHy/rIS%r>=s}- )rlBZq d%lc.5>K𤦊)HR٫{IupL~#Or#g,ZP`s5ӓ~FXrNiq؍UoXWu\\3pE<[#>?p~yKo4sU@6I }\{:Wns~5o/M bxpC^j˻%}EXYnQׄ3jF慬띾r0K' YC[/B܃"B@E(=;77";<4 2yҮ[R,r-7~sbqWP==Vnqc7B5Q6o}%^ Fû)7`$j=#<˸RV6(EPZ%n8y=l:~I+67#vЉ/D'_|6,ۥފgk=N۴OnV8f<?f#o;zr7bෆ~^%6{,b[CڑVݙt? 3/w>}+rqy=y\5v9 f[I 7ſj;zJ,Y";yܓb||eηz:vUt"n3aRUv2Oʹlcu~&egv&crruqܾ?7FR7\])OLe5^/Ҵok\8dl] 8WIOġ@P|c_ñ|Y&u=hm9Q󖚲 ,0կoʏXcmy˹l[:/fcgO~>#χ#{_c4 )<̶WB)#Wٽҟf^m4hC5R]FAzMǪ6:y1_ @QfOu#q󓾁#‹CQVY͙O~gZ9[Gb(7Gӳ:W鼗\}t7~z$1&.N`=K$wD*E/2J#q}!rOz8mG2\ kuGHFR,9ܹc,OBk jSa}='rB'jezB xC3$utHv[>+QGb6g9:~r hV~3qxq^6:G}O8Y&R [#Yy|ZWyzOKtӻ!)777 ,Y|P _˾6W!O2'hyYMTw^d^{u~r~<hv"MMk[6'9˶G5筲<[:onN觃X=y+:BX ITPa]Cmac:Y$$fK~eW;*R,o:ӏ~5[#j(rɦmv+okUKZz6.ao*jpf3#^cm<fO CS`d.k·^ѯ"0mvNhd? Ӽyn+u.; .,_7/mI7_,O"iךn69" kp&#E q^!ւ]Rͣ"ui2}#Y^̛~DL+Ȉ˽g՟Ѩ6fޠԖ~z,h̜\biF~}=.*ZУwNk ^C 80tyzE9JϿ}k1Y<Mf>Gv). ?87:+/ .Mp?ro")}.JkMlԉ ݝFhN./nyzUGI]'1Ӷ`젼z5 0rFu9AUcU= V?k`m_c kq%t\g&(>F6i4yLeTkJbSzl8M;M~7Զme3oۍ3owM,6w|^l.m^-r"n,d4Pk=Zۀg(_٨:-348mysm3dy_uգɵaT\(:8?՝_&v59M,̾l* P&ej:Z1mbsbN)!1ɉl3sɐXoȆo=.~|~V/6| ۏY>Py: L/2)e'a[>ڪvNe~ ycyzu}de1wҍbIW0F:,azGۼ|uHi,ic0lLVz3m!}`ECnMU]7Snq:t&Uڷ93NЅ[E?gd)F,Q#+z,y ǥY6^o0yo h˾ 'l͵JjIOG'wʂ4Dc=z }-hKۗz4b_i|{0? 3 gX^>c{8H=]!~X6?l׉Uk!nGZ&TUFǁq9V^)ۯ%{I'˩JH"G??c<]oD˻c'G8?OO3þ?ӻ8|( Anj@}KX1\!X?Ezߨf˳d#kN~Ŵa 8ڜld<&Ũ^M;{n҇6鿕6;?/Io}[(\k}e.79Ⱦ1^ܲ|-@r$ӝ? m۰FNiVZELkljQ4]a]̟Y; ]xNN}Nh{s4>;x=]#arpCB.𼅽3rsse.,^&=hqcѤ-~=wz2͓WCA4eWY}m?;^:Mt^wHb8Zߕ1Ee4ڏ!I/,Z}GNSr|.KEҐb^~ uN;S@(+r 69 ɵrcHTRzt 떷&ky9L pr?KwڒWn,}C^Dwe@oC"y?"P~DK? l5'ΑCY$˹\ x1 A1qEXwa^]t[IhOS]GlzX}#!?̐yE9u?^ 0fA7VFzs!B7>ѿ2M6V ~JlJob!V B^ qX`]q | q]+γ#qaw<m|e7kzӐ/bXn o17Pn)e_3ws:lfbe=f7f4s /׺:AYrID]\6pocO뱴Ɩ| }\Du$u3¦vs==%RJ{l6V\BOʋD֏O'߫CzZ` O9ztl, k݄X,qp3|;fżsF NSǃhwos\P֖k]گǢ >CGE2Sh#;7rp_gӅ87E)/Ê_ڴ+h'51X?6Ym>w{~%Jڤ2,Ӛrm>WyK*%&9Kןo(͸>Šo_;[:+6;:_0;'V̆@dm{yiBR N#9-S'GZG'0Ljo4V?}cӢe20wf^nnn~swx7|ZW~ X5 /vnly =r O_^\%#m~;b̑}R=~bT1WDa<|:j58FmLx);)鿐_-=fھ;)ty ;_"Cy6ȹ촧?AB2Tj^蚻<6*7#ߗ\?弑rCI[Xrg=Urp\"W:亩ȇH^ s^yE"x:g꺹Q Hw/a)^z,8ǥ(OJv5Bclv^veJ"8NO%7s9{?υ,GV=&?i!7^}yw4+Zs2'lSͅek%G^.ij35o )fSfwD^F攛?N7W;EU4ƩX%fU$_eחLX>#Ɖ~( =Ѹlc23fo~SsZ :@V_Eϫ9|㴿Lh?]*eSYP:_^aH!c6퓷5vk=ɬխZ-Z;$]m5/}`NDퟙ#>k!^d!=9WK9:ʟ=cx}ZGaŵ5+Amd~t=@}KXyP!ci*cy1o}i3v^K,2G9ﵵ]#m'eei )㿆<T^%:zx}6j{%ٴ5Q/^t.?Kp{EWGN,tט"6a_ǽy:>aڷˠc|JP);GSsD+^,ڏz-=Q;Ó;^OtQ'TnnnE)2iaerŌ/h VU-K^}5.#œ('ny,11:E,DӉq^ .,rl\ _.y"ɶ b` 'D沌ɳr ]*ˏD@5HO,A~4)ZR/6IƋVi'(%X׌d?X1i)DcI*Ms^^6|3 uK628Kf󖲃iҠj>U<{9n'zlk\ K :5gΑU)\~{onnnn"1 ]o]]H~7鶄@^|#pT5;bYܠhg\D"L>ݾi?̏#1I57:|+::N壱]cu&Afמuj~V8f*dOρ*=Wyݼ& %˵ m]ا~|ތ#LÃy#YѼ(68Y˸f?Si~T~ۂKDaFpd,?ڦ3+H[vAZxЯ1%]{:cgo h29[{ 7f7$P69m9!mz~Ar6tm.o6Ǝac2<c=q|+5GpoU=`͗9|<*'Wf#["ms\Vuˣgɾl}(p'ς >[qflDdOu{'wT1$rz>hY}ؤW]W(D4osbA*;m{d%8g"6;~GI)߻R#?uiHM e,;\?[V`mȹ>/筅es¦+߄f{(FoPNz]C_{qC6iA܇vz6z>YtKՕReH;MdA<:]ncAY KC}l[Z+d1)D3z/;oΫߪQgsȺd?Q16#zD[C 'ts3;;EɁPbVct7qʲ}F,K +#ߨY|&8x`o%eEpoeCP.eŷv-p'>9'|y@3 םmFzmܯVUڷG\HS$ϻ=+RB7ce֮]^}"cYa^3,SlC$l0K Bɂ~,_;s-a+gI/ŃaۖmFDr3u 9[h~YvsgM{onnnnkw"uᡛ l7#U=}s DEƿVzn){1|8x75{@wORŠt99f$Șg(8?<">^d5N_Yj t?zk˯? uJr^ioqs|v?24{Y-XC +,0NGѬcumMݎ,g`RA5XkrɬKmg?sx:Go\=25,>7P& ]S BG͏wo.}W,u+ʯJ87J Q ,]n4ѬNwˇ%.O.X~Dj!7<9ƌǙ|}psy[ܼ;|S%c9qlϒգ.'>QI_eG_AeydM#~Ks!̇d"u YӋJ`[\!cy:} pE\_Cٌ@lc.KBZ iXBc-fI/L^u`.T7Y=3H Ӝչr3L]nn~$u?}#>wZϵP3q$Oa-Kd[ǽ)=<1G݄$}tKʖƄԬ^2V+uW͋{Sί'7/^:@{7J8q ofU_HV^D:m=RUΑPuҖ=2)uVo_Qm9x{m#lfӍ/f+< ٠qFu7+f=K6gO+A\W< :ceKQԥ0i_!@hX'Y?pl4A] ь/qt AV@\`_9ыz6k1E_ڇ:g\ʌPn+X"Te)܆⑍ݦ3ί|<3y,r4E{)Ij̭Ʒ~h:G҉y$#UǼ b{N#6&pc|]QeMφ8~1bbu>ֲ9oOd9<26z#OiYZsO٤[F.oy{&;h>:$}ݵMȲ&Tn2=z{EM/Ϟ~]{s]_~ZU}Vh? E7vCvkU>~q_YzrгrǶyTil#crv|I,Л#LJO8ZQ܃.:8m1\/!gs1rh:OYnu@2䂀˧AfWeoȕBqʲW ʑМciJ(ɨKK@1gjTF(h %«:s/e,ªe60 . /*yFl~a Bu\{:򚺊<̃H\Z4VOEBK=ig9ekDnwOfYs3@Wy?N3rejk|DMUD:+r忔ۍ6, @mW* ~i̓#s&̍ r.|u8pAHxE )R0!#ˍwҽ'.A&_H},eӤJT5m WM1P+ }X7Dۇ&AAfg _ԗa4qnONלYc&W9g{O$Nu϶elz,6]<QY]MqN2+pה}trcC>IWfUNEs~vM)phĻYy]U0J&5߹:u~hE߽l 7]Dd{~'[TT:T)*ߝ?euh'; sV:]uF8߂ZρU&=afLјl<-msІkު<|ճI" (/̑o%Gt])ݐ7y} .U_+ǁͽ^s:{oG^O7k@ґDڐjjJw'Eڍ|} }gawg|u.t7R;w~cDox])&d_62o:Tm,[znk@co`zQmZځksN}P~G61P.Ese7^GscSp3%{7\S/ִ|!=p!5Kn}AW۹48f?K-Xcr}7m w2)FlH}Du&f]a9?IW3iP+ }X%z,v-)m?s5dcS=d! w JҜyaxQ 1'աyj= u-+(Z#<lr\&*"lG3TkW| my|2ˤ7^G7#Ⱦ^ ,y܇ > M6'MDy&^3›-{/k=OWԋ|oVwsA?y,f>ٹ>:~ӌ3iL:68ЗO5$5.2?͑HcC+fdžg˱iG-t@n2~seVyB:.)uA\^^NO:ǩ޲i줾mSn+ڀ^ GpKh~4IlO*_|_yfEеɺxx}}q/Yυd6>x@]t/M8FOwnΕ2>CsCFJk8ZRAHy8^\՟\Cod0y9w֭q?a\`ܧ6>]^6_+K?}"6Z:Q}RJ;\Ni𣡍+/ ݊i~ZvsoS;|Jou~035z>V#lo?F6 UA(!ʑn+>LJFًZMzr>~e]'G;镰Ga/#62܍ؔH\ ֟K|S?2]Lf+nic 9Ŷñ7:h;c.y‡2:_Q@d!=|[6r:zsP2W=v]' F~/}ZOS&F~yLvXQ+lrw߀z& AG|!uIsHo6y4>XH1csO$됯T`vǚS;{i{r|l_%y˟s?L?܎z o|h=s;6? `oئ̺`2l E}nn^Hn֩y>UfS:YP^ q ʵ*x/||?-wCCuڈ6p[KnNbe0r41sRzlY7? x =">d~7+!niHxkNI<y|E};O4V{8Bco(M压#7=Mv#_Y 5sGÝgI:%Ɠxppl??-~qi.'>i \#,/3NOȫao}gnnnnn*7 iڞ Cꎗ$ mWXZO𷩘[.y@wƏt,L[FA6ưm1kVm?-Dya丝-;}1q9vA{mw$4vWCHL=ƧsO=_JŸ6 =x~~^O V;(q̿~GU?a]ZOSu(+!unxs8ϬG77gK]]YG|>C2T0kej%``F%t.R؎.XX>c[ -σWYYÊL7eZۚ=yn.#³/d?KuoV#YʉWkIݘce]ROwk̅%ȵz4xzrE79fpgӖRDžbUg.<͸߬wss ,}^^J3|^!]/ZM=_<:p ?ѫ ;L/ +~Uv+: KSC1)Y/QC'ފݼ 7r捤WYD=d7LBm-˦M6\Co$)o: N 1V?K׷ɹь'_jdw.TҼIѬz:C_;@;FN)g晠"[kMQԋ d%KQr|k<(mY]sh(-e6zfK{y`;Ak29dmZP_wy'y' [2N+&Y]nn4=]޷t uA#sUwPhpmdbvۮM^G_;܏R9a@MY@>Mgbi&kڰpn]CvH X*y4N܊{iU[XRk vuTWz\R;>p}C_*[>6e^k=-jϋEAGڪ$En^ycD׺$XhjjAF}v#>gZU8TT*M/5mMEvD]r6pu{V`toZxd9 -qN6TWkY(˟yHvtTj/uĶԁB-eXExn蛛HTAG\|H5NY6hK}ӖpTF*K86H]zlf|j慬/eV-C\Q^ u8v0uܒK)w(iU[}*7׋b@Jy)G{?rEbK/?Osȷl:2Z+7:_4V)zlI4!qV(53^om=HuWt@?ѱҽ꼮lU-{wr;4G|9 n{tI+0VsN97S̟n<: [e$gkJ.>;M7g<16e]Ss_+"u?[ֲ(a~0X/f|sX*7H69y0mk6'k Nj[{$ ~۰?3e|e=P6b%G}|>ֳn^_ciw}36x[Ow VO=CέFy7@^UysNcj2_͍W[ј~&h7|u!5G.zm1);)//X ZNLu.Oy}ڜozdyOx̌?Zbr7R&+eZXHr6h}it@g9&qަ<_Civ%2Q;!cr KY9Y?gʢ?cK%*Kl1N~ a+[_N_ۃMbzTNeٰ]xZU3g)@ꓒjv_b&7'eUkj&6M;2UlӋzY(>rGFǒ56`6GEؕHFa!smG}E^O+&5!z{102gKNbrPfBбˇͻ^[Tj3#uOMg G pI6 u1Kz}|x\Wn: +yyYurT]$oaK|Bsr/g7s h{gw'gta{O9_.(Fc1ȟ=l8?*~41TTvV\:%یed>6XK;㨽Q}gu)/\tnǒ(/m ñ宕_P޻.\9Wlhb_ y./ƨ΢}+(3BmU]i{s͛D&Vny[ymܴݽlcRW8'Tt9$g㳠}/9i?mݛMmX>Q*/?suz:=bN9<: 6TN呬tHG0A$n;5ED\ ?!@FXηLi5ǖVUz8Rʶ$rMmQӽ 0 ~A GCl w`$gړFǐA>6zCs7Wih;4\L˯G7zcz?0Cw65O;+p̐@Nҿy2@/O'ckYfGjSxstO4}y,}ց5sk[L,`o5^U96XYs#fY&yp?1`ߝGlKk Ўef\q~ɾ>FmeWUWǂ)cd? ?cv.rNfhfm64/xŨ|,LPθ o86R;TՓ7ľpwFJisQoa ?CF%jZn.vr{78k\>x1~2u񃺝&_^FָC͟989<dG )yJ`l#YS2^b f &$?fıϽq)0&j\8O9;r/bfF7g@TH?yVÈ<|,Z!r|В^J7FY P~ű09n1ب-Csb%v{):OAώF1摘:kEIr;YC-|68(F{+[|wt<dW5iG Ͽ5 m/'f :buW Ԛ^t<ւqԹ2e{85fPWmI/t ю~s ^k9Lem"/KQA]Eeː >ʧQ?}h}m7^[UL}P9y"x3Y/*XQ^9op^rh }߶!FU]96{FlS${gt+'QD6 ]O@ڋ̲j˥97Γ ט ,? N3UG~PcD/dڙTO7-mfeT]k$<g/#|X@}O"RojZP!zƈ5عokT۲\? z=hDZ:ͣ3:J;l5#ψW?g YN8O ğPڭu|ӗ28eR3m1C+ |= /\WMOw?~i+BC-OԱ ;M d|k pE9OoOW-s/oNɓW~KZ}P=;Qnèls#?w8OO7oXM;]ҕv{.Gt2oϪA?)~/%jܨЬL::&?yl3wXXخp3rp"3six#:Vg=Mب[&.^%KƋT[sauҰ#6-ļ^|Vi|ߣI,> F15~MbuN:y ]dvޭaF.-Š qCPxuʵho1|a4oOw]'GQ1V8mG&ݳ{;ƜXs{m]':F U?s׊WD2bR7ϳ-?9{AWΛ'=_G/zMYW94{ ,b?g7gI:>bY?k~.?p+Pe'8$ }E8M6H__՗7G=yR>~\cj$Ӊ6yo.#/b͙@ɜɽI>[3F.[9p)?xi蜒| 3xI`֛ni_ +ZYh)5bA;s.r+~`iûX:ɣbЌbFuz-֓Ӿ{}N6k\A rSt,oIcNn>9ۥxsd@KX6z8pɹJ*91y>9@pعGXLPt}ql~Lv(FeG59#sZú~W"w+a&˟Up+.~(yW'gw,["xj ??>aߎވ(硴Umtiv|tdQݎNꁎFo׺{S}X?J:s8>示.]%t@5fT^g}4Ʃ]:/Gc577Ļ^7%kq4-ztYs@p8.C)4%nI[ee-X(a^`xd5?2S:=.?Fi~ sb9gN_z/[3P%V.Ο9MR~Ҟ_TPbpL8$#?nwsO+mW2& QnSj㍉+}[ψ?Ԇە`:%\>/ h&K9yKy59ysB|&ankMTX1 g.L!r8=c\{mß?4ۇp?u77'775v>,=&7Wg(+=n2 3l9iWQa }q2Cֵ̮}@A:Y˲b텼0`rtfZWZn`7cE -rrz=zuOK"FLsuJVݮ[WrϘ6e>$گ߱ c(rryi9H G㼹rTa]"XR]liW=a?ľaM/[9X|h??J h? ۬u[,cw3@UDW?:}5Ӈ(8Bֲ~ TEx9_!IrS ̡FĶ zҽOc<^>m+_B**+o"ZyTQmQ=`xg+ݨg#?iCY.x+TJOC`+ٔJv}t;_O ]Ƌb;܏^8K?7J.(Y}f1D6ّӐ>lu TGc_-rlIz<qz7hLBvzDI׹~NcYBgT69&k.,tdq#6@;T3Xb>jϹN['"a l;'ғbxqhHf5DU|h1ы[CzRʾ :FBEWd8oo-Gխ`ݳQn[*=Ŀ +)F/{ƟP*ߓ߰F#RY }G$䜏 |@G>ͷ)]cѨ/{R[)ՕcZ͸2[IFqX2ZWgMܾIh,Y^#B͟y1z|͚wׄV{x񔯁)Y S܇{Nemw=+V؍P#]_#f:$vwڙ MYQ :Wf7NӖ(r!mRB* ٯ):7j;uuJ->XN ?[v|S=To3gzu k;^H>=Ƴ8NO.'xj'Pj{~G{"%6Yӛ^dU:nwYR6S#ΝbW wub#ډ/?B-ad(|ќ6VWE7y0ʹ4;ec~ Muږ2 ?ͮDL&TK܉47Ѳ}iv 6; |v lt^[b86xL՞tUPw e2Ҹlv}uƸwT-t1 Tx)d.v7Yo\Y sWDgy,M'K?+ V{$i94Dy8ކrE;tP#=nٹ`񌎽g߁b7ty55(;ҾJ1o&gŖֿ깴׍o1_Ps (?`K8ym\7 @KH_-4ӓ3ؙIǟ[r4_\O }KFYFđfss'f7NΚu~x|#l}5$[Tׄc琾(4`8[!3O_#E/r5 ڗ~ygɟs)X/CMq< 9' KMXmFgY>NrX*(Eu O^Ngw,5<۝{ YGCʐ礄o*ePZ>A;Odp$cY_TT_Y[9y1rn[9i1O"L~ćXG[^ p @Ly" )Rvgy?2WQA% &v@.g-DTJ| O20iߚЌHNy9:.PoO \MyX>uaZmy8(k(j_ʥk'W3_%UWhy.2O?Pv`<'жSKαbzYBX}L=)㹟oޟK"ywK=\1A1>NWirq`y8"7:PyFJiⵁdr{VѾ>̱myI/yiԱ$'lY]s/YVֺ9yz%/P#-W(;7? 9o,ɟZ҂ćfRw&e<.$ cZ77.R`J(qKI/ VN!Wa=Kz)n ChO9wPe_kOVt"o8+㚑tkl+7i>}Q+_0D5Y͵9X@:_eKsہAt. ,kܔ"uzouXRmnϣ$hRA{_oooxۼyb>:g3%y=b.1Y:9ײ P9K2uϓU,]R<8wDt*cl s$Jeyٮ-ض67+|Fi*P1%f$`7~BYssss#zKry>H*%Vp }u=׋NrӨG/3V+V+ysA7Rk%\o,QlqP[ IAmHJ#Xci1e\+xO/g s%V cLY$Vh# xyssssè5 ry;}e,zrc=6qI]ey'oڦr,,:%(V|iHus7oThPJVU탧;;_xn^yMa\?8<=,e 0p35 o{y+"sd> TxyX։+}Fr|yOW}[e r0*l45ZzfܹhoMMTر+}N߷ݮ>ֽlRW'>z U0nZݩ>HyiE矲w5S3(,v2ɎyZ?2_Zj>Xyd_ ѱY1'v~x ˌ ݒT5?㯎_yJߦs)ʑESr6S%/@(@hc ʤDqo/c^l@'>D^z虐w4GZEG2NʾOgeo}D.Г/ׯD(_uő1jI/UhlA'v0M(Asywkٻ#9`yL\'9M('p}^Ǥ z~bq.:jm'Z{ -7丱;u߀18$70JǓbO86kO8qKkgk:˛۳ziN]ӯW`U Bߩ_ xz#_G8CAYXe4ʂo au܎c+SzZ9W8 [^ɼVF^k0xP\fyE=u\2&A[1t\܇zQgGb@eT9vc\{# jvWmR7/Or{M  9j䶁o. eaTv&fx^ ]J)0cΙdmQLjm;U&$Kzq~5F!l}綺M# o0F261Huhf5)Uq>+lԱɾߏevd(/ DMn%h_vq\"N&lvuV,k863G/?͊qM.oNu(mg]aT|n*sO[}FhX4ดȝIЍ\9zrpGk8}֢n^=8[OoHJ-f4@L5k msXEϥgԴ#} 笨@rtc;37X C6,qƐE,ɍZO髨:/]וW͒wÊv8נf[q牦i Sk/š׉++f=Wx͗u2㊼0/1?dΔ#ϷYbvplU zc ƛ*$6 9e{&Y((O<#2l9F֡';"%6@gfzsŮe 2}xRq'3Z;\`c =?[W_uY/.B/깇ޮV!IjL#mdb!9ү VS6~\L+2Vs*ߊt9kJDyqyKu؟gOozN5C/eY|;t&|"k*={NG!rW:gLKQ@z4-jqe[_E:&kpoRFys=~kbדY'hMiTvcьaʗKt}d~-^uVW-h=,d<Ĺ8qzCYĤ$f8-?O.6srystQ˝P"?ORB}ly_Ǽ''y# ]㚁v2ӳXV䂞 t_+&܋y>euCXX?x H'fHge a{yۋXD@)p>l޴1z:C}MKg>Z֑7sqmgnl /WMKANm/(;W[`7hFZf6@&fn_]gɘlڲvoϮXVPFlPuK͔hk[eU3CC\qu9KAoct+Ȗ|IP٤; %1!֏C2t-` ss%=bX[8N#w?8xpJ ee,Θ&SukeX -{?e)|&(W'굧JZ/PSӋYmL)_=]X cu<3YLk]`>糦V96fi1uj ]Rg /55[(טbMhU~ev1-٭] %wnXo~W- m6(Wu81*#, ]v@⭱P|t86$gGۘ$f#u3N=ckϠ.6( rYZ,Ĝ1-谕kET.s!EX0W`pwOY3@"L( +Xz73(R$jH6oLVE+PSBi$W$Wu5WKJ=|$8 j2P>*\J//*A&QUY_iLvvėquT|y9֡uԵO:s}M͍*:\Mp,R?XQX6O5Obc?4]8 ~ -5,aX;v0E}`|׉ d̥a_Ӽҧ_>uqHU0Q4աr<&C4QAtT.]o- ^dLʆs>JcèHJ߶:dV}5 P}hogĬSm-n_&}G8 >g>ڀ-ԇxG?J@QL1سi"_mo2pr԰֬dfk<;hk%] hijs d<^X1ðK]fӕeڝuE <va{IvֺTjx&؉ޜ֞}џMwe0gmEr}p?_ĭ|ń3W;=R~Y>1:n\EGskHG?CHzK4쳔έsPU 8G\b}41sp;Kujmjdm%۶}1R1F0ƃǻJ,Pʦs e*z,#Bj0&l{/c-m-q-޾WlSF(EKb'=PuS;۾yƎ3RK  |vRBH( 8)/7*><}zԈƉȴ>wVFi)Ե6O Sv<5~%㢪WݾvY[;} |C:8[3\+Rlz;d݅TژZYyN-q6#kS+Wn,dX >q*3qC6̩_stԿCձcziZ׎S+s6uoc܁| 1Pw{Sԭ{iN1M- vQqΘҜ8p68X\|oƂ ֎j'D{~c_ڛ.T)gtzn߄R]_?,+vIJqG9~dWBl{'qˈc-Q߿V2ixٶ^]N]mRVIh#CG۱/u͖Y]sVbPOm {/snMm xLgVnUk%sk}qxS;Nk}< ['R^uk/$󤄴1_vo%%-m7/sTn؎}]N8نV]|6:Ku`;Y}>͵g6t,ugUxmjrs}3~Zi1e1pIz=hnL!ZbՙwSS}u鱪̌800(VǟBU^NB2Qu_GJ>+0|ΚנGi /YLVcdvlu>!F²Xۧ),}ekiuO]S\9+v ڔ.ֳH;'򜪙R}Nj>)c+bzB$iO;&Ӌ֢R+s6uob.\ 1PwT'EO" kaфBe"Ng[…𢄊C_=!Q>yYbF`x+tx<J2 81Tc*za}I:4se `NE"23&WAvkZ/XW o1hilW\Wo9PEŮkm+vqmI[Jl%Z~Zeu"NKrzB65 Rޑ{ޞcm\CP;̠eIRcXKmZl?[qFzAgcC܄]|%Ķ~Rg84VՂzB-^]W<lh#H{mBE Uk m ͬ9W+1(ŧ_rŜCmN*-}JS??i^\L~# Udm55;N㱳V:g*x`]Ruf~m)W )J<&hwjeB@ Ě}'pd!Zc~[:=n[žzݠqރF\hZv;-ӥ>}6pL`d8&>Oɹ.g麡"Ҝx@Փ U0LŤ`_J_22e'ɝ%Jyb^ύ˞?WN?  m^ߓڼ}ul[g خ<)g|oTzx5O0}gAi<Q2t{:zigDS5S)aN_sp 7a)BuK}ʹvy-1s쵙)h?Se#NS$/mz(Qfs-6CnU;E#Y -uZsq[XZ?rɺG ߋ}}/>q/f|FgSd=W+5k}4[ڈq~2pS?06֦7nfN*kj,HF}x޶^Ggq^ پUvH:Tn|cubj_^H˗n ۏj_'lƘU`:PU;%>c(^< %Olf-zigDS5S)8#^ M:Tkgnv)z8rP. J/7bHVI=γ1Ws6Jle׹zx{-b`v>rQ,sV}t![ X$q+igJoKe=z+ []9V%$[Qz8R"&63VN l5ڦ'U̮=!U:uZ2ݟ ¦WAǰ_dGpN$Ա;L緆]}yc>}V02GE!ڷ*FΘu ޡe5v .xxcixxxEZւiMCcFJ穸Rj۶}4[DNY`? "@h,τz>t3kƒVv.D%XRY n6) /!A#`?; f%Om;z kxK 随7_0wK>nOTN=i,E)n4YR;XHAmwnG8kH[(pZͻP&3H*OhE|CΪq=D[+U8Y;_v n9v3TZcam"VjLb;[[Pr.Tk\Cdq%_aԏdǼҚ}y`ֽpRgN+8:vqh:ʦPUցLp}|υrԑf㜌ãSne_韪|v^j?iGׁ^XCYR ǩpYLM&G8 G۠J\'p̭o}mmL;]-Ǧ(mqsG=s\kٸGWbb!v vT}:mҫ1AOc-=E}&'j#z1TC[뱚&#Ubg:F;ҏi`#BSdn*^WWurqyMK2g/ -DŽs^ f[QmƧ2+K@OꤘE7 8j/~9Ybe.]p_Um6*K}rwew: _)c;Q_iJԐ}YS7g.SoY{JֈEv?u6 :QO&/ꥐ4]+.mA_68٘iX-d8utmg muaFImcyzRV7hOu"U[w&%j1l:#kFs_cڼR58Ѷj?Gãx.]A 64zt`B}pr8PD%R;b)\t*-x.7pl6 &l 3qWl|w-{LTYkG6|~ayk$շϋT3Tl|JX.Hgwܸ*ڏMw;q~[c( WG|ڇM0[y/Ĝm^[괲mS)թ_М~(Ք^u-rjJbx!ͥԟq||/k[lR_l60ƛ \rl&?vi=4+'@jLa3εۼ*ѮR0&F\umc_6S[c`똼d%?Rbc Kc)QYXK%u§C:vubsUlu9Cy?uЗ۹fcs(M+AF[ej硹2mq5Rfѧ] 㴾PZOSgbZi}+^F5I/I'6kZa~P:~TKlJ5v#2m[bךzl.(*<NC:?Rc9r?/%]} թ[Gԧu9ҶʋJ~uc3eK.@{FϘPګY1X /'r*L>%hx0T2YIQy! X.ckvFl` M.I|_A?z׶#>[<8[^ς(d:`68A60|}'ŸŅM[." BP,RLMtj$>p<Է㹌 9K斕P}:Ԛ`%TYKbUbm"AⰚξ4p{f*\u_yzkb ^C )Ӹi=V5Kc6qL%xqku并U~&6gϰvl9.>X:\aogxK |vԋoUPFFy.'m t4>s( !g;چڕBE^J"ՙK9%m :$`ϕqfP,P]c+WUо5v̺RYlgw%޼o~͵T6+,Wg'ʆps&km:']<"PK>#χH&n'XmZد&Vۇ1Y[EyXvnW[Wmi:]Ԟ\/LSކY1h*e IRBqnMkQ/-u+h4=D!~XQfyz.e䣪;̥?7>e:್%ԭ16Nll 24eWՄ'[?Ft_R2Og +Go.wi9Iχomlfi΅G[ej硙F /E'4pEh}*SЧ ni"SjEr :˨afT[f׬FToϚoyV/OzqXB v^2HE~$Qo=JdqG'Vw>ħk[] Z^Hƽ ?-+%vcܘ=?ӗ#6ޚK[駉j9v7|Qښ\f`u<.s$>[ ,;BxE\uk:h[p[myj7p86G뀼7h}6jse-r Ct]IlQTb8.G]}L׫֝Pi moŨ~JezݕxWԧ"-WgK3wx]`k3M?Oeu'].Ӿn1bsSkQ8tWƻJ1/΅@EI6m].eHR:$({owlcQG[boS=(98Į9Mb[|6V'įlT{-1h/J윷8jq6ԅ?u}r~lw}%4d8Xd`A>B2)O  pʄTǁhYL4H^HlqW^ _楼CڏvF_m,nv`ծgYڎܢQa Er-&R*S)/Qǒbzkb XC )ӸJ7vKɎ\k:)1cx){[ }RUBCq3Gsfg?1=vͬy[*5ߎk~{/꒍xRg.tW|- 6OL:c,eV^>伀{te~8ډw 2\|b_!CgX'!uŞGQ97GMNӚRBb'ڶV=B UBauTֺT֪[]w kW=ӧwy@kCt(G6xH/e&! FGm?X}̧u:~ߠ:.5v IǤ>TE=dt:-~79lnjR菫a 8&fJvou'YkI}=}Nud\൥MA~ Oݧ[ t!3Sw5{c.^6zKH=鴐N6aMږb$ ~a b߆Y~_[^}Զm}CzW5ַ X{ʥNF׌ƺ~ﵔ^ˋ_3a6ݲJw+2Fh[7\eֵ[ZanyMn0*٬G .m1}7NP r|ENj@P1R]j~^^꣼ WK}nh>*ݔ-%;vRrUħxW>Rvm|ڎ.>M5^h4.wS2]m_kJ{ӧAlݹcd\ry M7p8Oҭh]"EIe90'G@nY8-ßhJ4GCo6Gr PT2m)ŋ=NV kY{mY/dM4cZRYo7ÚcEXm8Mt:#)} 6M3ϧM!ڲZ5H&|P}٘Syn-Nxy&&[[Ѷ緉HkĿM+TڃTI {uDU<#KcM&T._7KR}l'ձxeX;2RkG|]O8l;P-1HJjY0u:Tn t,ä]/"` D3)qFduĢ8dWu'Cz!}y<+J`+`-4=j a>) fP]c+&Y]KʤOҧ*M 8qdH cSA&yLn82kF2 64`xkg5=)p:Y6յt|(e1](ISAm*&}eLz $lYVU-@ћS>NFbb95\4PRJGi~*hZ[7i6 3WUM'jXLco1G0h+gnh/QKui(sцL]@ lUjII4k/cZ_iE}Klf;=XjSxfЭ6(CqvPuJcQmZnP:@Zd\)dZ^OI7V޿䳣6|!tH1iуN1|F}H0 ihٛ=>}{O1kp]@,Q. sYRa [;=,z>3~1i8ʹK uT!'2Жѻl7B5s&iB>b0V0p,4N u-8|DMK1}C}!=n͏iFv)E-Oč,X ⺉x z.QeD'IW;-Sm'*31cRjS:)c&_>C QxGGz Y`]]Jフf 4IpA"e8T4JfQEaCEca^hgƑСhhj$b܌X;DgLFFIgƅmt7S_R[`NscXJPzoSX{n_m~)ܺLõ=Չjk5⊶cCէɄS|oZn_dmXϒc *-Pcu}OmVWRjkx:0.~)Bk# fj{9JkQߛsJW'e7p!vi ]BؒE?Xȁ$mi+M. e#LlBHl؏8-nP}f8d$hrwc$ģui]-BGNΗ~1o~>.: -CiBQt:Nt: 9y' ynֆ`& ӆK!޹ڀmSk{^ٞh7[㿐91͎8&S_M6l{d_3#1@|*OO{_q3i Ru6S'a+Ym*ٗvNEFzqjf m<-Bi}O'h;_.bXw) IE+kPj/fJR]lnŮc &jc8{28l;?3+w>Ly#|ȧ7O'"\[tLԉ(TVeR/l4bKvU*MpQ/u: w7~#ɝNt:N4(ڌlO1y#\ב]"_]vdX5}d4V^|[bNuY1UKQֱ&ˌ^ɜ/kjkm0e?K|C]Oh'!ly\yE.q<\=/ ~xb[OH+C ?#}P' %+֙1Y~L ߛ~_ O3hj; Yϴn`-tJLN3ɟ%7 9Aj\B:58ⳊymIx(u:Nt:NG|:u'sx{,nGns#r{Z!]'2Ƴk{@^[*Ջu:koKB>3_,H٤Ҿv)1k(T6$Z!'u0TUuؘuhaO U#qNZ{c,}t/K8mď7}s'ľs\?/@/^|sv{ӱʹ-hNdojV鿴E_Af?Zc_Jc jR ݧ?<$F.jzk<5mcPlLpRS; kGTl3~9Vdk-?~iR-{7⾖RI9n%Y1%vVN? 6\().#-RG~Ge Ǵ7yzAai hcYlPThCt:Nt:9'Jygvn}=T9jZ:/ZO7^CQ8\JחsfW_$yܤ=t%+Xje M)#EkqA`v/D<ՙ2p{l2f^yz-[SX1?s/]VX j6V=!r,-Y9<s b9a׌wne͂>=ii5od÷;WZdܳ #}nH[l8,[kKuvaW'pT 4]$} m:'Jd"u_)(9Iu J^R+E4'ENLG@em)#q,8<A}sLyqٟ4 BRk}SabBq9V$\XE,𽢥u:-vCgK˚@^"N:kӓ _v_~bt:Nt. +8_bŬskER|:}~_Vp0c1fZ+W&vvS ھ es#޵!jlSϤWQx]?bk<.p N[al@}%>b{e\][[xb3 N%ky6ۼ 3b Tֱʖ}J41\x6ns'ZZn0`~?VI-BKLc' iC|),=Gן]$t.b_<]o#~|[:2N)-1wl XlxPO:lu" N~Qyǚ$<$< ;>~Ӿ-64YHWl윔Ʊz8Ag?)=a` `v| :FHy-ɡ|Т)נ]X/h8wΤӗ\qh2I E]r ukǮkxy߰RKI*xeg%{3+_._N]3|鮗@RSPwYeF봭 '}w +%COf@ysxdM\ '.d8/|)k&6ξ=8P$>)i(.j)oQ@A$?!N،hޛ-t<hxH3O Kɖ}F#]WC9u~ kJfLhX]+ ?ҩ8rפtf c-mZ؍(`SKk9}^eQ,']5LY_{ K[ W#d= 'Hyz:v㏲>[ӂ,Jk.Ui_{l;Ow_wS3Bxu7 %}r]6%["wb w6uxٷX0cs|Oi~ s}R\ roǑ)مpe5%M} zxƂ:-TZ[G7>wdv&YiAU E UDu*\ǔ-;LD,o sq}. êT0qLmr?&asqR%6;o/8Ft:Nt:#}g7W =榠 u/q365&I%: <`~յڵv %FoEOw&zyfR][d#~C_Isp[B ׋|g w™s3_𡯛yY3b>.䦋XK~r 2Nc&%o(N碘5D(SZwa:=|8Xc%OޯyuT{~ianh >5_=|/)%o'nO߲񳇇0| 3nxН_˷3Nt:N:cg|wMn␛7P:Bqn̂s윂u/]iYY*{N,_5.{;)n\bf+;?[*גY2uu~v,evHʲ5 ZbRgd"]R^[Onߗ N &HX{Z'+fD>!3YJl@eg1: ϋ MZ`;]lk]1^Dx#Dž X~e K= Jm3m'tvz~/X lxX.u>ݸJU!J@&6d}6dGP_KD*LLnF.d<}";RIWŶOtגeX-n8f\!C(;k_1 )~a՟淆?[c>Byx|E;8v:Nt:3&޼1<Ƶ3j҅S퉦/k9ЯHe|h߄iSPE'餋"Eqn)LK*?Xm0'1@x6J\[h(ٻH Ki) lx̧~R28n7]Im;>-l`]# S[{N`"xڋsJsH\?7FE#K#[OW]:zc ?[t=\?SA+E>TE99Տi!4Fڞ }tTe$pęk[bS8N8N>mĽ_W=/?#|`-F]%0 W G>-^:=6"|8" #V1hAyOt9ǗuJVA EMAIJ% #܂- c\SM]uGG iSEB%blBz Oh$4 ! =m;s$%!sE[?d%x¢  M&#?E?!?a__0<4so~`3c?ou_gbѷt-D$o5a\a=,/`C|LݘXf~ō0;w;bn>{wWo̘w8<;CKt:NtMyן7_+'C\<\J\CqbW% ׆h{z_R8<4KrL}x_ B\ῶqr P&ձFAQZRb%,6ZDgigm߹HLP'֓y:=o-zǂc#*V _$A*}(?-CO&`7(FN΋jJt,c]@CZaތ@O΄Vs A^|6#(B^"cN\}v=eE)L#!ꈤ|m fquߓp "c |n`>8Z:jT±V\ lEe)&fq0ZIX^$U'$hd,vG5LzNH<-9nмgvb_zeIlyAp}WDN(*Kߧ{ȼa+8G~#qdaʗPs$0gӵg=9F j~.lk"mJ -uA!!l:.`6Yg3ه qFaW"EGfid<{xk[O?mß>?w~n/2O{K̂'2cнdžP4Ã0|?Aρo*ʲy9cnO0g}nX|2ax-;\~D?|'SMk#f<õ8o MhNt:yCn $\E)BOt /!~H1E_xE)i`b/tÜBKmQ>FaeDΌJ׬qLIq?2ȾtYqo+9yildd7 h]oZOD y7kx;mKʁ.t}l3L`0/1&]q]"Lk v0UPD֢m̎B\$Ͼ0차<Ȧeo^Ik\p0[Jc i[; {f+dPe%ށ Kxpuc?o'G^"C2 E-Ϗ?Q'> C8>xSH/Pe?xpUn)BDUõwz%`94~n0~c\C_nq</14ꐴc~=f9[Bۏ旦ONt:Ι#7Ig;ϦSK~LY"3&xsa5> 6r)B%<9!=q ˇ}?;=C: ̹ <LJ{ |_?8Ԋ{p]w 6 <,cD/3g=|5b,ƟM{Y~5)#o~6!!>ׇi'O|G_'~:E;D1Nt:yCM|ymA:Phl~\rr-'5)Tunq1i]R] agX'=\ _%g˹9i?TOubB1u-(eǚY.Gv<|,K$ẊIK'aC[SjzV{rѢ>y kjV,lb[n`l7נ+##[|lZЫ72kV:za`h6vȨn?tG7onfl9gXܞ͆~`ɮ4G,.2 Ylo 4Kʼj?>\6w|s)?<] b1'<>;)O #D)x<6H?2q?Oz SSct:N vA#[ā:[K)PqK|Ml%'_8'%5ׄRl]4FRiY">6iQuMk *׭8m\@v\1ĿhNqh{%gr$}آ ª&o4~ѕcUG 5(]<t:~=7xUPXWIQӂzzh?ǣ3'=W;S1qRuOwqP~sR!0mЫ(>u_|?K&/?E pf5|7d_덙8v:Nt:pO _8sGRNMus ) Ӣ xN/r&Vt@J[9EySHoFk`G@v=X'qbwMFyH}Sj}oϵk<QrU.a(QO_ +6__gUEtJ18q}]]3!| NO  1}_I) 7+u;N SɎ2U넗##%>D!Igaqѓ$vtm"18uty:.ʛ&i]Gzj/T0[&\>A`B:86>yCcFr1v/~赓^v¹~9k^5-l{; /닖8v:Nt:#7p?dsG:_\_qϱHG$]'|3s{ s:l< ?kS(ihcxeO>K - ychǁ39kZo}N بCGз! gpk[EX}3>zH7p̱*辴'c.cҀ٘b;*:-vP'rmKl#$·&}s=KLצ"b9BK&fe@]y1WYоVxz.\kS)MWɪeZS*:p?b [Q<-T }V\7_ [JWG<8U>/ZLlYͧCѾmサ^W=T+}|1_ɎnnH NQ^woh10'#ob[n0փ óeDe· &_C~SZ=0 ̓W7sg[-8?3T]CZc3:a~ R/ǚT 7w-`}~Jc50G6خb;+[Gi;#!WnKo8o7og'pt:Nt:aIct8-Xik}:Hu4m# Q0[Cq[s׆J6-Enmk˹/Ӯ%vT+S#:/8~DbuY|ZEpG+#oe'X7ĚtF \lVCD56INB?q Ҝ977p4FN̴eT:PzGxĀ8'9V2,ԧإ27x:ڲ5¡Z_l4c%WF Cusë^7p9ł9]9(g `sH>[)ñ6KJ}hךC:|,MƳE"3ejd3`j3T1a/2bN4X{׌tI6ƛo Sq캘4N`녮wl2.O mr>4H_QŦ5[r.3~UQ궦bF=ژVsR䑎ۅ7pt:Nt:NcOTf^}Z&=ٷ@k5/+@1E[Gb^+m.B>]SHWq]C~bzxln5&pmw>1,6t crvnrM}۾!Mka ڵb ¶tK݀s4,ë|Pl$Ɣ" e>ፁ ś[(`%e߃^1`dUi|J!.$Nt:Nt:53Vvnb Q URZM|gJ^ײ |Q+ C lǁm7ݏi#[4)[DmMDZ. +cz`Լ5BrQZis8·+:$}GrgM#$mЁ;jF ; ˰Cv [>쿧p^?MPNt:Nt:{<_kd%_żLV6'W_CH^u% 0uߠCtAJJW3}Q>c[ A|ਏ+ZJLœ}ٸNzY;Q7Fݿe+I|h=9oD}O>߭rvpr1'rd:(XN>ĶB:/IMRoz0>v:Nt:N\ upItmW*ڴy#'"׸/ f-ALT\ٴ ^|q2GVf}qd8lT++'as vF.݇y!D7/ܴ&H 8/#$"|3yO:";cLe;a~x,Kt:Nt:NRvV-RrF1ypf <rFx_R`ls=jv6FhD)܀Oa+Ҋ~J Jcn#߅u< =o56([i'2xkJ;Fn= Jod #OԾM ʏf :Oڎ$zIKU=rˎ}UP_x鬇lEٱGOII˶&k)})[9>Iyk8jox!eb/8˓bMR̐^;iQO^ `94B'oH B={X:R.MBAs;O"!i\Dܷԓ2S;>fE˜8Hee7pb'|GG8c&Hl?;.ݖKs}^cZѫjWabO ds>M?i3B>qbǣ񨎟ϗU=NJzP#Ģܶ/%+kI9NǍϊ1cslEʸ-!5jn-c}?PipLo|&ԍv)5jߍPQYja##DŽ-xq`Bb| pbEi~*Frh3 bꦸgؘu+i͹k/#ՙ #5lx?+LeB4ZP%h[þP~>[#vt\l y~mqR}}Pt:Nt:8b| ^Y}æ?PV>?LWļ-·F8LİXП]_pum}|X?/,#3r|58Ѹl%i/v?}q,n!CX/q Laa8%2(tޱ͓t cRG -~P_fngo [iLk?:`T6+7Kڷjж"g?Bot|I.F 5%ysz#Hj,ܫ2\~?K_C [q:PM;٣LA^kW%̴g'p趙.B۷5l8R%: ~LX|GſX'ϊM%?fzPt w|+ct:Nٍ}w{n+ϯ| kKk5m5:n+iSu:ZJxtejעvzƎs/`_ ʜkC޺kEڛO5ƅ1R; GLH}jڻ!Js␭yf)HUsџfu}Әbn5ħJ)_}:F2ntm q@sd!jݹ6 bmԕq>ʬmϞC {u)?1e9h?u.,-OG?h_Z(؄OM>L=mGuL3́CXFG: $9 "NAz=1^j}[i!ٴu:Nt:NYq~-q{DѲNT۲}h6}O|tQwOJxuL3v{a8+r$OɕQޱ+Eϋ;?76$Zi ^%"N$%fTAkڵ} hˠ>'8i3'?. :z)v(#H<]ˇBOڝ_;nL5שEX`!oۍ⚽>nt:Nt:r g/Yu"=Z.?]`LvBA5F*#񕐵٨O~ Jg\+J iPU"B2mOAt]2hY>A$ZRY&"=R )Y2;F@=yo+/ˤO. 9o5=r% Vvat|| ;O"%zxxu3YɹCxAS9 sт67fQ Kxc>Q#tP {Afeb`zo5{u:Nt:NYKrfu'ذ p-RA'{K'l0`~ 0t'bKrX)kc{׽xϊ&Mjq+ؼb C L }OIVͼER  >`@7Ms(eH<ƝxwY'XL<삶 c'2Dρյ)>΁j%NjgZӥk^VvBegO>hY "N-Ճųo}#V".%}؎ $A(]W %OuhF6a+Kbr(ƾŖd kM@{&ky+gHӘ$z]t:Nt:NlY{k4]6H?Ȧne c 5hSUՄc𘦂VS.pt$I>E$m`U.;B""lR^!2|MFq\eǴJ:->'@ӔOe^z=N #D(P~bزx}l; lME Qu$:PKh1/U3?+Q7=n]mc[ؒ@+v͒gUg “F#*9^})RGܷ'k3&L$R^HHN*>܈_e#([>@8n|˅ S!cg [&397]-(ӲMIRVƪ A^dt:Nt:!ΉFVFEk?:sJPx | "_%^ h|< o?"T$?Γ^}-U*_K쯏(22ce1?˝~]"r#UB'2Aؒ-Q:~6R%ܷAs`.&ˈlPB,xcm6eE&Fsڰ2]GY hŚG[ڊW-_BEĎ]Ej1ij%BB/%yb6c sX}%饂^{[A Ob$/!uB[~ƃ@W|Ażyt7"Nt:Nt#/Yl`\0HKe!ii+%ˤ7u]EZ/_U* YZz/IVOYԍ"9pDƮ5b K~"ouƾC1/qFS8J}<#}Y 8Rq&<^";7+U$ߥR+?[<\4ߛ׈( AʯN/f34:X!%zY*kly"s.?Dr>@`vysc[צjӝx~:c/yr~.$Nt:Nt:/Rٝ^ %R׆J׈$57@GE-} %HSE$m9+^7 d\OuW'NЄq)-($ꋠNܑCzqO%y"s1 YW5'eiӷ" ٷ0*>i96bm2z߷,_tx1k9PIZK\>.xDZPϓx`6rΝ-a|G&E1 t." ғNt:Nt:ے{<KS/uFD_ùm*/d8c2מ#2]d_x}hJzuŢJ_RYNKc);OR0|){qP7w/L7 pqvF:38/5~g1Yᵁ ؆>}?Fj"F:AG!u= 밍"x?.—(!$c(@|B%\ خcH23Mϐ';n| -{φ{w>w{x+_sNt:m>4sprs?Ig|C>mciQ }9._?':Dop]:rέBJ{OVހO71_B| mR_1ӌum^z&_@3/s%l;t1QCْRbqg攆4?[-FQ\[u8U[?$QHm %Qimc5pP>ymdN(oDVHg.6NUՓ>5(>c"ix琱U}!Wƞ֤YkvƋKʸ1!T)U. K[@idEGƕ`}uAՁɂV>CGV#OlnC-c>ڱNHVKm_V|_cQ+naJ܄XqY+\ɠP+ǦXף@˶Ğlk6hQ,pM&YBjVVPss]ϐ>Ul?pZ'@ A^5TDGT0P&A,ٰ7$-MҸ[{iʡ sЇRjU|x ^{eD_x " o =!@7C<2H⫶|& (v."ԶMBۆ.^\pϕ*xf}uX& 8:Á7ǬqÂ=ot:NܬፗF n\?E7-x8D'9X |WH+l(Im0S_e`{m% ׸0CWֳQ9ۨu-j[R[2("v:'olu-t:N9kx0%xlUst^`s\Տf&!m˵ O4SG: %" %w:I u%~AKzKW $H$ZXOV!Q`yᚱ u"?c]ؕd< 9ϲzғ<|Q|/!zoN; XbAuW_{0_:ySeGlw[+F/0˚0>o8=+;bsd=ٺ|ϗ@ 1r)FNg)ٔهNt:gB.3Kk9nȵ_iނ:h+-FQmC7CNS4GdF5Ғ4#>Ymt0ڍ?5N/E14Cokmuݵ;c$~\c;Mkk5WPi&k|Mvݳ"h ~9,tӱ>% To\gx"% r,;5ҙ_:},HCN"7}<+?0e/?g,HCNt: az<ZO*xs{»+ i~J2cz"NΣyCk^z3>H+~VvئB碛1I -Iu1JGqed \k*߱ ZHhlSVX33lš@t:3>z`x w7v6f7Kb' ?0e WÿWj[OO^ʂ4t(Ct:}+^կ~ۿ?iP:t:N9n@3? l쌲eeJ }-K_3ڊjeZZs\#ۣe" Љ$`c|2HŠߵr̽S3kE&Ps |+ωh[VpxqѲϖH ޚ霿7p'ё9y:KH,&2}pGHͩvو?Ӳ3y`ޢ5Hٺؼf*Լ$C$rVFQSuP?ӹ~wԔAOt:NӹxIP!jNЩ+!ρe}z-[ ]/ d:z}Olٓ~]'~Epct! tl9m5r\41@$T`͐7rcNڈbe'0Jfpi1~=1;yX!G+|=r[Gq\xle\(r&x4 jtOx_OhuѦ?ӹi?3?OhuѦ?t:N:Aa㹽wG3kV5Ki7 /nI S,o+^}%LMqr>:zƇWzC0{NKe:| apɳ O5:XcOlqĻIXG=çű =r~u,$wX[^n]N'ruh;\21DR&=e8'Ը.%Z뵂qgpL$=+B[컔r({gڠmӹx/⢛7ANt:!oSyx84}BgPcT_+bm УsI &5\#"v>ژ/H6."#7ΠL|pE_ ׂ(iFs+o9=ISu m-O1x;ztiG.Md r!l_zkJ *!=kV|QԚ%X!h2e}Uhq2 DD2m)¸o_>h^@GE"cNX Cu|(ɤYI(4QtW(v8^!Q Bkw/ ly1XR} _!KjUs,[bq]V%Va[|.?&LݖH _Ditc-Α[_~A^Ӻc[S:r5Z:5R-ٷE u퐃AuTv* JϦ@۳) o'D] 5nZ w!R7 ݑ8E?u?t:Nӹp^UѶp\Iwogk\IL?{9w{E雩NK]̑Ti%}ҷuZļ$gwvxsq}ɓ3Cw˵삷Zd%KB;s1F"fKEET )|ZCg^.RqX^ v;R_N.: e#7^V%Z}Ѳ5^Vzֳbj=[؅m&NgSFt:NPWHY\YMB1 HA3ZVLA#׵<9#Vų TRْQWDSՑZv틂 g;M- _#]hPe 5 (MƩBi%P:aO։HUY ܕ XzB/ me_!+Y;/"sxm ߼Xkv0.y,'n_J6"TUO>E2wyf!h5'cև5oyzK%y>kޏIOzғbj=[؍vpux?mO1|{=}x[Y9}{cj=[Xʝyf8g9EEdOomY{x[7%/t:On~W _g WNG/±=$]qƴ溈Xv'OAKf[;jh_J̭°x:PGd}Nf~kJ >HY)鐍[-؍1:2T9 d?ۂ>14&$ӟW)?rmRo? 7cj=[ظWo>o/^[)շJ|OG=7D}t:ܸO?nkK:r=ʊ'*^ZpJll58쥛*kdMQ"E`E1,p%o?OWŻF]lX]Pq"e11'gH [tkEܾ_JA+&Sv`SD:+5dNɵY[`\KDEl g붶= ^̴\Fw ckG'?,Au6E^,/2z,x|<+2EPxw X>7;VQ6Fhؓ[atV~rڻ^#Í|ssn{s_,7PuW PƯ>z z^ÍnKߎGw۠zη \o{;*kxËoꆔz477,џ,r=7?z?m>ﳆ8,ܧmV0I7<#YV.P ^4^b[ǝS^}2Zcfl岑T'cz@SD:#zS/o¹9|x/% /-YKۇkfܻpˆ[ϜoPg_??7+|?N zy-ч[^}78=nۆ۸÷|ُ7<ᆔiz-s)Z6vIXvK\ :ڟ5l5s/LeD|zF y7 ?F_Pwq$yGTv:N S9_$>gxsm>u"zFvm:Z5* qV}Zт' \a&/ѲWx)7Y,BƣΌ35䚜.6#p^<ONSl?=w0LOHO )>y5E@J:AgE $:Ⱦhr*lCcǮL@6Н? #Ӆm gsw kr<q]O5]+>?\eO'ȩ#-+<-%-H^ flcs9=ŇQ:<&-?Mr%ns&[*U'>a#wBHӞGјI3 m 2ml}4y z})mK{"RiaQVr>cj=[ؕ ov!7/A^z3:.>|g~CMYz󆰶*?sVGi\ck'.:<⥀KyJ֧Z3NB_(+^\nepq'k,Gݨ;S?+@pXv|V֤e%s`,ֿs-_O*|G=z61H]"N3I7D Ȫ㈮RAaa,>^/\h (bsrwk3 bjFIu$БXmT TRnN?Ge|/OBU9իmKTֲXZp0rTι܌ 9}yΉ]@s-jNEZКt|m|ѶK½ɇ>- $mjgKX"HP$"B%yi<tXAĺJ'L)vF Ћ{BA4H/jcE"|h2ex mHxuwxSux!㢮ܳ'~}W w 7u<3O4|7BC>3-|ǝCiY ^'c6,χG,o߳t:Fp|N^%B?I$|Y?5\ڈ;nlp+ )[ۧCC/jt[IP-f=uX9aTMLZ* ¦XPvmT?X!`5PXVlv^r{M_fqkxB5n"lrTHiu"^X>stZ&w i(osB-r.|I(DVjLk@QIF PJщ߮O"L[Emhj%dEͭ(F6)fQDcN2 1!u@ϫS?.̉v[i.۫H\uިڄ^HV̗ ߿ Yc3+#iebd1fxᚎc@lIP z\D{ŧ>b%/=dgHſM&4An@>0sd$,X<%b+solacn曇B>#I?2B|Ǎ_+Ԛo|7uWmJR > gU-sboW)sΟʘ:N掋sog}c\pxYʒ?JOEWH4иL#Wg_:B> 5ຝ-%Z/95tD7%)NLHRw֙F}^b!w"{~MUYe779AqA#GUʎ6'dnwV1 PЊ՟jd>h ]#Cc@@$ ;. ^LЋ6irȓ Esrw cn9h _j2A*yxqy(oP7>Í풻1}]񆐻w,V|S/b߯7YUy]|G]^z{/mOO;B#/qƐ4NWk.1i㦿Q'[䡿lWԉzo̞tVdDyd>XX]=Yv!q<_Iv:FvVhgT:fz-&߈yc>O|1pFv"#-> qGСo(=6ip[ԓ3PoxHk.'I7mx@n Oxrv@Z 7F}_7>04y5} 7}`;­ >?ϧ Î Ƕc}[8;:Nِ/x_s7WbrpgSt7]K_-e>^'z3Poԕlf'^]%G[A݌_Qǂ1ɸ$=;γ`:Knldk\$R5ɾ[-EڙґA۳B/$E׳xfvH] ~6G ́+:BS<94"sxm gvBZ=:;&Þuc]N ž聧 '"nѓPz]I6L=-VMk'cF2">ǭ>y[5#Rgt,z-e5xCtXTGN%~=~`nj-!p6&p2#tܞ }ȕ?rO(#ycGv=yOt:痛nI6%>k17r睛|-SO^cȷC?oz<|榖;_oG<}xs~5/z Ÿ<+!eYO~d>{x[ӟalV 7\4W؇m?=O7NӹS~.~ GG0 U15Ϯ_v[LmύX}G+Wl$B__ʰ&T\Ur\_(]x0昳Y_RYKƘٔfЉ&7oEdjh{t:l#H:sS o9a3o :qƤ`k JmZ_Ò赙tIL/F~_P~B¶F[.9("krwYmߧlA}"vv<OdQcCԭu*B7pr>[ҖtG6_W$6rZݡZiL тXaa]+le.uH?tu4%mokL|yoˤEV?_:,mbR]eu_n}*?Cܨƞ|5ۃ1Q9>Eqn4^Zm5x>@!?8|jRlB '%OI= kkOi̵?~~*:MOϥޟߘpQo9/B̵g>s/An[NtY7K?/\%]~gmy-k?cn9:^}']k ͥ\t:Q[bf ?wVu16);"lWD9Nt|m,'#}辴 K~z0;T1{~eP=;O%?'6+ORW+ۂ5sc45cmO] ^Í?oUqzҹj [OnVY`Oۄߐ?+dKX_[c8+ ¹Lu2_*F6pr3_ڒLnp|e`']2 cA/뜍 E-sQCstŮkxf.qd Eg0LtWĆg R֝ O^N %DL5V8\cJm*H_ߊBOCd K =nAj&P Kh؇ؖttӱ/yKbn7ot.{HӱZ]$p#Ɨ~<{o-~gt:Nt6yQ3e;_3(Rt:Vps}x]&7;_yNQU-9y!%fQXw y?ZLY}M^1e[. "v&p;!()!Y2 OѶ5yK2k޲ςtuTʋhJC[Gy6E_"SnzkР$Rʋ|n!I$U*쎮j>Z**^+9feQ_ԉ:F LE(qڙ&6MA3ƞ'ފVm3m?1q\+r=s4kYE]-iQy&uE?>,$pO\ _Vײ`l[ms>?316ȱDS/mwih |_?>|g(g`5` z֑`EdXM>gF"('0uU͖ Ş{kL|tUS繍%0*ç>lQ{#_KOxUmN۶s2]6y#z#6q{z2aW*)2?>o[//G}k_o?Ut:OaWcb̝/yMo?''CN}~~o{ìÍ~GNt:Ns>'TO>?ӿo4yDxmO?c=?ΰ==ULSdzIc ikmplOUd ~cAcCH-MֿLI}阇xj~4k;DwOyeW g\GˬNBƵt|Zz/cN4.<\^vmx_7t|ٗ}p/t:N9K|?\g~p{~nWgGǒ)%ۢf{}+O'&/qܼ;|;8jL[FNP'4)X/E۹/)>Eo tYM'}#MHYdxkkĮDI/҇DZF^t\ۺ hJۂ8uyԩٳ:g+sѤh}ORAiYW[]gt"M8~ 8~i۱3|g >kL ږ^3ZMY\Y)i;c0ͦ_:VM|uֲ60Z17)]i\6&\t @MDgr 6<{_iZQ|tǚP5d}u;9mt[Eюvn< Z!5YbujQFgwܹkrn~闆=yWKX&h[E7g& wÏo~I{bIiEO> 8Gݑ[r)09bX?>N bǚ[CL3 ][041y!6_Zgw%ʴC|ӼՑp=8+^=C'o捯nm_-^qW?14?o^n{;ruH ~NA re\>l"=ׇ__'< 3IC)eM7i?͸;Nsݰ8o?߇;~6Es'pG>kY9ܼ3wO؂B8EtڈRcߞgOРiH&f&lAG:]8@-$&TT=5g7|H4-ac<V/iukb ejBki SOly`.϶!Ik6Ũ~=Hu*}zqQ,enrBv\R3)"I''iZ> /O5CuO|!k񥜀mQ!h[ ayeo )woB A6gE5vDi l͔hAdgjRJG머,I eXk=xLXYfnߛ|n>h< ׹Oħ[j\8P[ɟSj({[2IF}Ê̑_v[Lmhq 2'uHƴOu*ÝB)sG\>ε׈؁݂p4-/J oT>;7pL8mLSl\D`Z^2 ~qؿxK=eXc8}'jވ #c8S'7qǁn+podyG9kKcs7ĝMnLGIP(<(=1*j%*.kksX$m큒OnxjeM3gjLɱI@uQod6U hY&|G7 U 4i<ꢿaׁ^ۄ_6~h&M#/Mn8~Bj3Ƙ{f&t .ʔ3.քۖo(zZ3DX{aN e&c}NX׶ArCRjpJ˵?F9ׁ?8u:jlOkj"]t5a?kPCOdlsu')UP];C5KbYo<|l^Wۓk?S}sMLU NJpb 9S;Q-; Y1yf&ж^vẍ́Lȍ'=F6 P s:>H=~sx!}$ab GL|M*Ĩ%m2R8p=;Q"ijS|xeQp;yL%cQ,2QBlv*ebz*/'_Д<ِ'x^j4Jz> _˜}7oonᖗ÷|ut֯n_w=K}H_9-> _\xIbWvw҂_@P}/ >koo e {3tL&ix 7 a)?S+;t:;oGosF^ï?p7:חp#B&tvMQEƁ-cq8[T@:]/*>EIx̀m1,=ǘẑ2OOS+WX`ch/ٌL<'dO)׵2?Q7# :NdJ6^C:VG qU/*٧- ר`+A<@}̟=2ة l (? *J4:o}cjBsn%ՋeZŗHZ;Ѳ:H._A9&5LƫCE?OtP[mҌM}@ܢ.cDǤ(GW?#M0mOS'4[#_z&Y0YS|/R֍z^c)@QYYqR{WP]% '}YeC3AYf(iuQ}B;sU\^t\]}e_i/6:7X^ĮO->՟? Ά/_nbï=)wI1Տ?gя>3+WGJweqw.+˿\@0=Λ'c1sx;F''WhTOax3<<$sj]uܝN~]?7:tI䚒?©δ{jU'%PF}.\b̴H.2r- FΏ:6D߰-e<_x\~#`"_K|ıeH^.YL>#u:ƾB9|ye^NG 裝p G}؎I6c(1.UJ_~Dn@"@ʕo5+.3OɃI}ZHC4- }8ds'Mqiŋiglk7~kIc">mt.><Oz7>PzYu±ʾ8Lfn88o,(h+Aۢ:kB:lSro8>;/cԝ 7ݭ=vp5n2fwB[[1u8'|pCLxWݿᆛnwGM#򴌙ƾt:NsppE IZظ~nx.Z!>x5D/TGp@'T[iְ}N'>JY`_i^؊p>l<# Q_LlKDRQ*OfMԉl˶uI ni:R6` C5;"![rmm3P$F]%Ǔ=65i{׏ h̐pSbES=Q*!Slak!:}Ps1 $@ͪyaf ϧV?/4H省9Y+e2vW}W8>s!k_<<o#{yǾݹnLq79-7K~p?'>>exOr҆Û3*7c;q49qw:N{\gk"gI .ۅM#oi/6qI9mp-SnLI6^)`Gli8eyz輤S+5Iܹ=LHl]/`CsY =94~.&̑iPk,үgg*H*򒬄jX2li^[;?VΊ3YW:uvv6DA%"yA}}}q|:Lo l=2O|+#y-J>dQN) om@ZY3Yg%l5!$vQb,cmJO`~N6?e1w8Y[`xk_;ۆÝM7[{nG'ngi~{W~ w x0ԞlMïŒwb2?Ø;?؛9~Gt_g>' 7 7<O7-m'~ axOQ{Mt:Nlƴ\SkL/[!WW!}{/z"3ǜhqt갍XU`C_\vqlU!ȋ"HyCs "s\kA9TB]SC s :ڲH9 d/e,jY_LĕKZӔ4X#+}SDb@$}Eߍ#5Wo s=e<$2V;ސk-=92w,@P9T|:1瘼Pc+U&2l6AYXO:x o\Iy]\뤾 z!A>=IOֆԙ57vʍ8ڬG(ٵ:Ǡ6GTn#;+GwRqꫥ71 H>)%oyb<㎘D 1|p Gw)ܶrnϙ~W2wsxի^s~?>.0|pO;Fيk}qH,t[I?Zq( -hh$7Hs-|_xkaMMz2֛}_Q8QkěS_>XEyyt?vI΋)n[Z֎:D,r&xR&fj׊2袞7=(v-leH+]ԯr}m -kA3xp18e8֎^_Úb}-#}\{3ƵѺj29xXS$Q_ohf>Md;dͩ&aNJ/ʄXQ@_lKpisnh6c|X<+q_7[ԶlZ XQV}g'8QD{C]Y JDdݿBٝOOs}oM7<<2[?xv_8˾w[nO`w~Ft:0)9 | UMz|Anu3ig+ m\4#L vc'ZuBN^|*ZC}8i< Z5+zEmAL%:݂}{v=Ɩk[ mEeH֠}Xh#K#^R^vvDhWbI_4ֹ6rޖ"쌲}'n8TGHC<9kΓ/[!CyE%`E6}hL{[~onE ΦyL{7>axsioyet:Ns.CA"֩]kDMBZb#:"2Zdl"YقGlc+UV9:z̗ R R&Fq$xRgӎïx3)oCuY|4{^[}')L_M-ׇ\ײ~׮ut<lo&<7-=7nxIsc7:nNX{zePt:Ot:Nӹ~??rt_5i8ZQH"L@|-%BtNs0: !rZɓ6(۶>;iҖ ))F9q:?C:XqnQc5fUk995g5f͹s<>aQ#lX^eM+Z,zoKlMm  Xk!>Tthy;>]V1j4dJMqۣryҜhiRu5^.Sj1n)jQfOm?kmf\~F߮"ٜ$E5|\>~9|YV9 W-ٱ9;jEM^k;d~'0F:d~/iR2ͥ:fv,KJj93Ҷ)mERl |lŸ6oѶV}^#6=JQV}fL6fʯhwRhXUmv:Y©Uue63q:s)6%4+:ju:4S'V Nt:K?,JaixlηL|~|f]E}S6A6=7-[ָ\ Ҏfm#Ά77 Շ7Ԅ2#t,jX%혝#u;_WK˕Mb뗤5ѲMg_y s=xjPfKF-抵&67ՁqˑR7en;dzP_rI(0n%LutYpy`\N\VK4\KRw:(kc>;Nt?+1=ϿL)K/V]6Tض9y9xlEʜzsI¿&JNK`Ɣ58Z_rcbD|YJ9WaiLc| _iE6P306- WQV ^[$q*NHFem'vmzmmI:VT?Wϝs|` R,x 31auNm ["uKB4}i)[pqq %;y Nt: WS'/o }< gg6qʟYaK ag[ť'}B}Osl*koycXX%ܓN{]$ٲ[V` jc;dTgJwĤbhעTϴP[S\Vc@fW+K_!p񠞊F熍^)i3gu UC躵Yjcl;+ W6[51x "msQGOIC)0þm?AkmR.s֟A1~UmQ>ϫAx[_)`;+JmEI䟐JZA9AEQ2+ qsb91`,j> Ͷ;7\ /z9P> >;Nth+Aп%ϷO㟜 ksSY3)s/{v]`Gyۮ2`lEڤ A1c,_c 9BƱXFd46Z/+m%ۧJ)6J4_yI:N2K9>v]K5 ,m{>M̊PZ*([͸'LI'}XI^Gc]^X`p}Fc=+\-BTuv|-kR?M{q6&̀EhGyRVDlƎsDt]wb=6Ů}h\{AZ5r[Di}w1Q e}qՇD[LK!YT\БB[]NEc0j\M8P*//e@in}ն8vJO-dj| 涿Hc-تdqZ Ns'su|3'j)'fیU -xbAޞ6V0c M7jZ_uYҾ{ obvyEχߗTt:No ?{$ .T?X|ʶx0~us!sa#~M?m;\"|864Ua wOJIjWrMa:5. c2Kㄥ//mʶ7Cx6h}y<_31qBI%2+#S!Wغ3=EhQSglx5RR״w9t!lfh*oP{% M|yfl^~ہ-n/ ^TXOr"8ouou)nd`?d7 ("M>`1sAіmo A5_v8P6ފbտr%b OKh܊[Ŗ7JcSxh; F<ןc͛&zK~O־ЧYt[iK|,k.X⢬S>o"@zѬ~͖J,YZ-Ug=+ocq̇Nt:Nt:`ABj|[& )Kb<+%Ƌ;%BZ`%?sB3- 5 ]=PZg˔~ S_k , h'phضJ)Tm8/􎎫XeEDq]NveSA^)35EFeZzYJ6Ko'RʣuMSSµ=1u`nGwI;^s+u}lŽ܈L8-" ش>%rM1;În6^8T' tgFtuІOPx. ?!4@\.{*}hJʾ;qQe1ڬCR]>N?xִmt:Nt:N'/3܍ϝ*žV[:O(=}݆Yz_[ĞZkįAK )9#|@ӥ05"(C6چ[c&Rf l -ʛUkM%Pi"ˤ=RעvUq͜7)(QglVb.JgaB3F qRBM4y%tCۆ??@g5[nH$(SSwq{ 5TuL)v,U>]1"%,-t0d҄QڮhG^ev&Ug=yoF*Oɶmt:Nt:Nsl>vf/&P 1ieyIiteThgS ^UdNl(nu*ϒ坟ZW mI 6iTIfd[QFH\$vClY?aE,-ѥ6uȇ|+O?E۱c˘xb_߯˃fâuk%)em@+vcflDl[w =!6H5x_!t>}D ٺF󁴢VkwsN;6V+tN6l~~54:A-Ow:Nt:N+=3sfay (4[&XlZu0lEݮ6 Ty9i1@5&}+ |}&l%Qͅs|mblVݗoeI6 +4nW FONRdԏ+ÖP|ono..RAP7Cs^8_JdgM4M`lyd>6>eU'~j:d4OHt$lю ش"qGGJVzoD EP%})CS$z) z,J e}Vܷo(zڈvDqasq;K^~Hr;[nw3&^}rx9q7-!/6eǚJ[U>;%1_mRX8Ms✛n-)Izn*ZS5]!D|i2Na+۝euob9 syQ{:'̶o+vt:Nt:M?6 mv F7 UY;`+ԯ ӘڅU&߀a $[6.0.Dq ׭yJfm)r6ڭ[8n^<-yPgSoK6dG0G"C4\O_f8. %]+-ϒ B^ {9*HMXGe;Vbf%j|ǖhWM b\ v,nkƙs4 ķwĂJ~TS\(rx򙵱o􁲢hp;vX.awN(o^s>J<[5)E3ZV%CeVP;i;%bENt:Np.g2{޾|LFҒ|sy=P;-H x}I[^%"([KM5HY=:Eկlv,Pݤ.^`fhJ. (LlCl:n| 替3 :-Q0V9XrOVND{ӸÎTF$V15?6xR .7/ı.oܘ3;Pyyj*dvFI}2(ҟQ5⎊=`;tLدHƶ2UMGrcID9ې~}(Q;W{m~}Slɱrﱚ v"vc H(Kɶ!:.K2<hfbۋm|l]+f &}[ U-]TU*))f It:Nt:?JyyZmSCu lA/>]J!~ygޞ4eJ 6v+ɌK l*&|+bqzr6A|TE|_Φ5ߊqQ)n*jWvT:dWZRj@)/ɉI}4bl:Jhy(^ſ,Kl@ 7ƭ p^R{H{I~*#lȇ^G57dHx?Z hi#I>M{fi޷<ݮW6 } y". "`ٯT.^FEAK*I+: 7oɺEPoȼ3&4@>WXвb<{m ]{Kc@IpU@;Vhlõ9#8!Q|2ܵ}8KL:Vވf>Gˣ #mqߦ%8g7{NDr) 1h)?1[J~H>⛈_oDZ/mNųɼ,780e]M@}/ f~( EMnǷT=k9Km.E}b Gڊ(T,IK~ʐ`Y(oŅDZ(RbԿF~k gϣV^+V{ IϕDIRz,?Cܮz CmH_ٵDd62|Ctm9;F5xM@6!aF)n͡Xa5Mk=D:`VoT5S=$L|6xYϤNjL$.}73bbl]grs[dkcIp*Ny[ f/Gaى4gB UNd؆kGo( 0oJs>b}K;ǙFu |GhB1<8jƎ)ZpiSnN~~GiPM|ۈ 61#Fߦ69iYh벤~G 7p:Nt:lg쒭deVۭsmVǍJmvcm}_n):h5OSj K 6.P? QZ3Rx4>v`8Sq@uomU  9_ivzF\5|8.2Xk^oQߪcereooп-jq&;-&BX\2(NcoF -#q"ӠvR=mWZ_}bnAziz}1%4:MR 8oLBTKʎڮ(;A8 v]:a|jRyoq㒍]kV| m5|]\P޺(3dNCkmv mJCڎi87p9jh-G~Ӱ bͱdt*MX[[ej.K@ot^yNt:Ng[?|nϱԥO#*9 `m?4EA?E;l:j|zݭOlj>a9X܉!k6_be\|o x-]s-zfa _ "]ے<~Iq_ѿ-jq&;-M(S?_ךgCZb5yk>F'WL@6!l***c[jv wh=[wʗ2/ӸR&Zjwikm`XF=xKe0h5KZ6O-ǽI|-gexmi$XJv$`&'ƶ05 ;h6϶@)Z|')Nt:NtlLNV[M`'SJpca.ŦtRJ6â!Ża?,KnoѸJ>jJ9lG2'}nNתh$q&Z/8sۦ辱hxH4?ܶ _5w]?v/S]Ix ȇ%4R:}&!3͐ʔy<.CUl nHC*i5MK_q~zDquiNE)&k몵`}A]b)6\&O\}p o7hx)|7ç$D1?ik>NGsNߋ\ -Tx ^ok)>4X^^Y}v?Tx?@ 9ܭ=yW?jcNL-ca{ۢ߶{ܵۻ;gS9^4ba+ef}5X'fٱa wͯ%6 1qESo4oRkg 5*\|pcp[yGφ?w!y󏆳woe.>nW&ğP~f?u|ݧqROZP=/TZ=?>k+iY)/]bW UHIYgXË(8X|)Fȫ&&u:2ex%%UK&Ķe|6|u Fhi4qC0JEy֬).jW}㿴YHAifDOHyXN);9ϫ(uK{ w|,|NoÇ7pORx/OoxGә+"؋(r ]XəyEs w;bmV.d]ܷG>}\hk UŹzvƉ/QSsEٯ_3EwZ}XO.NO%xpqeۘҮ~k*(3{,e1{tlkK֗#ob5ph{V9#pbnoc^ϵTXkny1ne~h[&;k5ڎɘc;kW`nDi}_Bn477bp#ÙPpI=Enm&{CG07#qӆ>g]|' ed xxgnmx'rb*1KOxevQWiY2dcfI67Վ355B,)z;?4F꧔,䣨Aa]$y^[E[?Gs fXmy.kv^օ\)V%Nz6Go3χ BGu˧aޞ66n  hOS;!% j g l?ٖʚLk/=5ɺ>=R6̺Əe|σX&ߖmv|jmHVrhv|mel(4E6J5> )~^ǭAZj4(/v Tb&Wx:*Ht kByE/RqS{OpwRj wB&/ƹ C //>F)7Y|Ӽ/q&pGC)'o*SBRCӹ y1|W^<:]nxX6K;Zsa>|p\:MKSx*{M4ύg}cޜaJNj4_X⿴Oe=ԩ_{hMk0o9'㜘kRi77Əɨe!\ި됗Ԍ=Oш>ylڴ3Xil' uvLvncKjRzh\ &O 9*rwn O~Ebs?t:[{a=5\÷\=:'v~!Z>g\ӟuy|!^hiĢiY_܉e}hG <@6 y)R vmfK☫mv4L JMk+_Y1Xl[kg 8sh+Dv gHOo ![ o- h KֱvHluD:%vKjQ)&B-3>Y\ QRTުtJ6u$! ZϚ)+2^=6}NMKZ*G"\R_>(d:bb GSBYEc"ƮdsRJ7p*&9/[H!Tc聳,)U)6|MŌq89ԠˑysO|,օ76\Ϥn}럅O|b7w;8Lw^N_S/x O~'/Fxw[N7HO~CzwI"/ϝޛps_ 4 3ȓ,Lѷ_ m.]~m?ٸQb"7s/}qSR㒳/̍&p2^a2 _}7o>hoڍ[Z[3oОS_cQ(7 =>0K hm)SЮގs 7O ~[ힾv[b w:xI'j\w&/!C${njAmL}c?Q<6Ә?~B.͹(4r΋Uħ ҶL(Vl '#Qˮ >_c~y3\;E/8qdB޻Ie0uOAXFMB?)~ْPv^Fc7)0GNE~kouϋ ohMop'L[wZ;P^ -D'k}̊du:Ǘ'Xg_ Hٕu\ ,s3^`bQ}գG3s7 J[£FЋx27WSw>W &?sӪ 񆘸DI駦O2uO> 9nX1^M{umk4mYV&Ǣ U2)Oڮy ^-g;Vt[LixWNrmMY`b|&1M} b7gq?1wb#Qy>l.5S(=O8/wo\yiy4uZOlg̨y3i/쟊M?"Vrbk(/9ccZkhvZ1JaSuXv۸R_(_RΦm-Qj(S*aׅ,4(H%:|q|WNZ1\=.Ec:jpl|Xm_ކKrP>Hqy%u;Q~CYPŔnZTk)$mPNE(n%h.1OF VɸnpDonϪr[N \m\^ )cFCk f pcm-,x5JȶڏRM5MD}RE\ݤ5kGltGqܠLkpH[)zonuf&(±fdmGQw|)^ >П5~=MCϚ|1اe0o(?bc_b?b(>'Ç3+g\:}=}ĀM_Wǿo[xbFX,>.P pFM#F=B-ۆ0/OńoˍB3꧟x43c,D??@=7t՟Y*'EVB(_ vmӊ^Jm< 67Ĝi/&Uʲc@V ż9>K36iԟ)Qg|xƳ4~{1<_?y*o/>?UXs?c ϴ_*Ϩ`]s j m-U{ivndd>6nm8H'!+5)SѸy6FU!8.f W~jݚ޷,R5͗?2ɜD:WH>j`Jc}6:&XNOMjcO|cuyjyz\<0mA+F\yWjrʕܨ|[GNn”Ձ%0d.M!esn6)5'&bR^6&?r^';p̨gˏQr;zmZJuk۔!"i$); U°㣩g:nOg,銴NIsʨOSm}੷"V|ʥ?7gTC?=㎏=~!|>[/^}^z"|6:?L #?WM'7}0|y<P' Vnj꿹/v@3*xzyR {1o},e [b!<.OHxG^ *?M.'7,?| :!g$CN&%@}}tR8H45=y0f[T3ޫ.?7K19g68^ıc1`W!V_y65vp,}Oǰps'ם ={cx>XVUS8!wre ϚքL8g&߄V#O_V1wF[mNi4s΅sPڽRI Xn >Y1O!OHT^ɞB}iq0 갦eZt߰ia>rh9-d1s\|GlOc;ԯĨAIP"濍֍̆2e 9Z"LKx[M˘>,-iOHscA>6)*!RzmRFBi\WX+h{xBWӖ~5<7Kc6-^c[64mۥ <ecK6SױT|R|DvpŖ~PsY.m"&?uFˌ>K\_Ȩ9R@0gh\A:Ԏ>D4:ڗ)5}1OLVAkoHmLy͗Mė/?{{'iy ~(I>pCÍ!_¥3-!>4/)y'hBܠrON? |s/oSʰoiV\?0?7\&^No7by['o4ګ o~j}C/ϝ{ryc\ڟ3rVlM{MMet䜙8^L0=W;,=LЪ8kAe?bsɒ9'fKrݙ… gTl^{4hXۺ{c|VKVmΟuY8WSeKyVǩ}&s?kwbT^۞U_ꢀʧ,?5(@R!ͳy0?cx@j\4)sO/ R[42OIDATFb~qdۢٔ-L7;8s%t[[Y֜mzN<FyHsWvnU*C1de"fuaWx^G#ṯO17eUOQ(QuR۴QƐ#lqgC˸d?{v}(L–1F ([1XW_⯊=j7B<*- 徑O)LMUọ|. jh~<r59hŝ"*1OEX'^g"&ϭ7>mSBmbv1sjq*am"}`;KnŘo/oفEy-{w!:ϋ Um=~txOc+FJ:KKQDŽxyGeǺ`է2 ϡŒqYp!Ux$jL̓xkz+c\wW|Ͳ}3.qB+8cY<7!__ixMp-GQ벤z;[tt>bpHI\7q,nxK጖iE|v'z"<`{`F,F1. YZ׆7|p\8f46@+Ohֳcњ&/gqo_0&fZAܗ۪h nF;e l?%n)|k$|,۵(ǶoM?QwŶw,[S17Ϧ9c=Qmo0s&ǣ9>K_(/~n4`>|;N13R[31_k~gC;.G+qvMovB^s_÷Ӈh/$>ٕ%>cA~VMJPO56Ogg}OC5=>MV<-RS47,֗ßTXHٔ6qSXwSYZy@BVmj]dѿxQFl1suر :id1ZWV8FS>lW 7 bL)gmK.'mKMR~Ineu)oPt&էH`wKiOn>0ڌhU("H *qv2&>E}yy0QqL71h_k[#W.2&n`1?V_\ ut:Ns6^d8#, 2@۲s|ʈ]o{-Y˥4Js.N%xJ,%iQeOV@۩KQN1OPg۷@fid)hO6UctI9CV\o&6kY?V؇+U2vu@qXn0MmpqD^D4ep-D^D%XbU1%\ԕU%5e n_eMljcR9u7hdƐdnta| ~{ *o3iEsۈ-ڭ_ic=rx%PFfsK%-8`]ӭ9b7phW"+cE={m˃v}_tAC }jRvk 6lq5>BH!ԟTbNO<+.gĻMI <OoscKu:`}ue=٦-ڞ?Tmصx?shFÃ1%0GCVuJ!bжm巙>Ӣ2;Ne?/t:NyEy_ U ѹ=9/RS:l4Pn|J HʠvV1%cl*1e,kmMf9QFHK-֋gI`>f!:&AHKBgcàYQJm-դ'j\6XK9I vº*jt~rcԧj :͗mo>(ӗ\|9ʱLTf.{tJۥnOpJr rCJ"vIK5ُ?-gx\XD׋sbR7+8 pdQ?X`# e5b97~0}0șQ Fw|hp@5:14~Ru:N2Ox#: x4yt:NglrpTigC9/RbPgM=6!1f>y@mrA,[41mR.S[-gib.ЌG1gE_L|nIS^X}Teonv\^)L506N`u=QhN6b* Ƒaf.J~Mc-oItu)R4XO+n +[ƿ~ѥućA9 qĸi OeL{4yGmHcɯŸ qKcjeMym6?#VoymQ밄v$j Ӓe\F(id)aǂ\^Z17h&;)u >TzP}2n̗2lkl.j4PfێVHc%F2*Tn$PHͷвj&kCk/}_ ˔NKhR]M6m%8Nt:NN6l3t.^,HY V=q[ 96Vba,QKAVc lkB' *o< m ],Z*21Cɟ)F|#|%#鈥uYAnIiyc*~p?hF}2Q,鿍&^#sC9ҔO O2(qHei~%` iaK7qLAimțǡMՊU(!kJj̪1%|jD(Y5M744އW;dA1Kh`PfUxȶA~5gYF{܇LZ|lIѱQlu|*c ڀJ]Y*4rZ%8h?q~IL5HJ)mq:E J ;h.TxIz`"lZmۭ<4.r0<dKWKb# twHm4k |?׆ /"w#A&뽴Bd9+.P!ލXv ^ƿԗ2Mp}[LQ)]2%S{.b\[?O >p۾OTCZ;Ss Ze( B#<0h ۣ+y6"o7'^EMiYLwNFGt:Ng {-} 5Q{ria㏯yٖlI'Y:"~Fk-oy+|ʹp-d`\S: 6>c \VMGrtIp (Q/vOYd<:Y$c)cjc2EɗpT 2b,23 #'Oҵ9g)umcrduu]MfsiNbe:xbSq>nC藖wOPyj ҍY_!!A%Wځe֓|5luU_h穱VrUC´}Nn9d*vhy?$N.*^PfiOed+// /|)q>W:4]Y\?G%(6)kE?FۻA:. Z/X9hDZez\5Y+ډmż8i9} 헇7ʍ\G!&Hm2 KXR-wJoG)l8&pjk hSxn2`˶MSꏭ{чgDc N@NƍrLkP$bC)14Nc/Cb]{4",*#Ql>-pSR՟{ d߄t ڴqxc _3Eu،q7px6Xih99`L2O!bS5ҞXTutċr,Q񕵿W7;wI\jl&BnC' "C"}%mՎnӬJ!?»-8x+UyF=q#~To H8&aMlL~B~l#[}NfQϗq?kcvn38Kq| s|&fmqTVWPȏׅ6TSK?h9[6K>Ԕ7]rG84bfbⳜ8MD}?4ƽZY`T[Omm⣅ﳦe<9L*'eʗҊ)-?;Zg[lULLs1McsWYpt:N'ys<7çpSnTxw yE)`|z1|Wnt:ΕpAٟ`i9o_#cPg{<%qv =Х9 d9i^Kh)WV>˃a%֏D|H-y|^J޼} JK+Oe}0馈jͷwd?j#'l[-QmwCf3f^޷\uS!`jKj&(;%~l+2f7Nt:EȍO۸:]nxX6K;~FtN8`r2ZM[;=odQ.Ax ; U۝XXnpA͏sVUy)Ğh;:%?},]l _Iiצ)BI R4O}>G~4R]_-ŮMJqj#^-Ŵ 8t[yыEqd]ǴԞ*io[Pv,jx?kʑ0!*+b_֩OA᧴ݛs@<͘Z'o蚂]FES ؿT54+zhLLMV8캌I&J:j(oe4-Lӛ^ =nܶo; JsNt:Ή?Q񞧆 O<'D $v羕ʟKIpx"quO卞шEӵ#/gd^8 N|ƷRݫ79L4|siG0Hf{-A:6/EeVm>EzC^ /Qqwu-@Jq||*,S6.X5Pv(G%c71a;k].frA|V}[4Z ۖs **0X=LG;/96 *07hJh[5ԋunjЌ4h'> Xjģ±?FSYn?+ ZGi#ZB'&hܸ-%ʂ&hS Dotyc{NtC?qӿպR5O_ #/7k|o{ǫ_ / DqM4p_b|.`~nKm&/ɍKǵn:y27< On0럞RWn>eC:7qD, k½d1/%t:!s zN Ki>eD j$I:~۵e=gHǽW)n4/y9ʎJ,xEXrOc*fZic`v ^KǃgpiT0Pٞ>oɶ%ve8V@iChYb̃ ]_ާ8%`40k~hZ v{F\(3R/'Oqb E䕷j,{Hcܔn4]nk}Oi^v&7i䑴i?gG趱Z |K,E-~G]e)٭3U3&_EͩOj3W;v'ޞzlW4=|j۩/K7m!,WM^U7@}uy6gQBė6oB$iw(MOi1岺Pihe̬)3 Plfセļ\:ajt:N' z>ݸo(:Byׄ[q 7_n /.pmׄ_/w&pD 987B%b.qMoF$eY2.З4=bFke1ׄwu7]|̡7rLb1~s=bxk{mt:ˉv kЬ5:F'&vc<2FfĞ4*qtڼV`4SK~aSZJj͹[+.Z8~_ž )^;.Զ6˖[X:lh, |#oRYݾ*zik&&%z !VM(z$]f94b&b0p^}-;693#IP} a]gQZ6[k=VL2Kրl: WkOB__/ ~|XJX?y`opۙmJ3XzyWM Ѻ^e~螐f8.,1 mbNS+;UX1Jxş}8[8;Ns% 7ãV4&|NpJc+l_<9'Il>LHSLci!Ou@k9 iش5GKlԘhnhђQKZ%b9_|2,S'S!1>yBA ftid1&9c1^x͘vޒk٪Gu+bhU<L5Kuq36MrYYmڼO3NK?G_"s<2}6k~'7X>7q=Se]2~M獝; ie| 5[i/P^WEq\EH[ټ؏[ u2J"ц}~1czprxoxy@(:xHޞ KG^6x(y*Š1gmzl[%0IcJq<6"ŅQ*;nLՀ ֩qeE/Gdf ɑFuΕn-u~ƒ2v Cujdct:l}MxBg_ ^ vMΜ7 ٍ vGܼ;gR ɊW5'G??BnPWT ~?G19z< ^lڝQm۴j& F.+ԜuW/TR)_x6h~TsYRv )Kɶ?Awn e^ƦRjq |6\=[ROض<oe?ZX2xӈ/~_xU(ıc|TtQǦ$Gя3kZǣC7nvmc1F2sVm"k:^Dc.:ti<($T([7k\M ܴۆZS_2*ဆ;Ŗkt'񝐅TˁaiE6,ve+rNsy06Mc]7v:N5xE0?ف0Obׄ|q ȵׇկn~k^>[O4a|?yquI "AÃTp5m爛OS; HK61~g% hNӹ<%Qۅۙy!Tmغߚ7i/~Ǫ|۾Fr*-> |}owgpD>Ĺt k|Xb}R5 ||[1\۱1;i9nnۘJB^\>[)5{ S.%>JhM} ƭoʾ,c-%[G{YC$݆jr.(UUcK1r;a>H&9^+!8/k!OK@9?nH/k{KlS>ChavEwWlhۿӢhH6cE&]B0*KYO`n%w،c4CuTئ:.2&,*eJ*͛(v:ثE̜J瘖D•7@rK{{uؐt:ptx7G|D~⁗?OM6|G2ax)ώ3 ^Z+nN9b|pç/>l~l| gg ss 4ׄo1[Οrt:|>py|22`J֬AQ5 '*I7ǝ굚|~)&F4<ˬRe: @V^Z·c]BϮr--&aT^|j%u}ȋ`Jm#J 䓲rH!ЮƃunH>ː\> ȅ\}\3ݞc`8tmb"bhWjuqhL%eUshLpK}Z7P8}Mi7.H.8hj5Ӕ/ WZ$]jx]Hy'}`SF~>m2Ϫ}{{8<ʱjiFGsTaް2D=4.OßT¬CㅦZsZ~6aǓ9(1__*|!6:xڴcm66)neiqmN>q[iYԓ%t/¥{*_-㦛n GOO__'K6.\NsE'[|p lt:z--}V0_IDʟ52cUm>Oeо=>͟+wpmǣjq9;'F;dNk-;3oaS _7Ō(uT_d D% [ϗzܟBPZBu-mpZ-'hזqQ1ɺlbۉzľۑ||LUܢG=ݒ_~uBei\_ [dOPr-3>k9f}pH2BS+m) TL#sOkUd_*WK[ڦOYkc")^eWɏE^RghSx)Q?KPrp|\mh#V>{Ponձ4ii-T<(r3?C UXh,b3%8gtXJ}-:Oj_Jm$<gG66k#Z۫Pŀ "-svlGPV-ekۗR;65b}(˘~VvQk>k7r^ܡʦz1}sl&~ұFZ=V/V~qV˨m꿔NJbWơ6~õRnmm9ئ]Bzt|ѷ f,7 i0vLu%qeE/Ssv&ner]=n^q%Oh17uK:8xَca(ULλE8Et:NSOϠ'YFN BY9qXmfOV-UshJ~#S>~_ߌ]r-';Am <۵Ӛ&P?-E8wL9m2vuRz>RNyX~Q}3)mPS1|”SX6&D `3SEGBIGl[(;f5NdM7и6%uIWl?[,HzK٧yݨl߈exzsqRTRyۑ=6x4>om,d}P|8.ThJ2DE 7 m3wl;b\\Ms?7-Rl.`/U#tE^()`1+<ј xce>MA[Ǹʤ"n6+eN< ˞fm av'W@= w:o)a+6Lgb ҘtpjsukcIEfM`e5Sc z>^ŒKp*%ƎI2'X4v*=Ь'oϩ}ݒt:ۢJt:Ng'T^O`D4C+?ikd|'T ؓ'?:a5"ZcA\Ij6a1"vv˧m\kD,ZZ&ZIp!B$}BF2* qB Ȋn-S~<./m1zq uqUFě7if}zlʖʰRnrEÓp4qHj[ IP`:Ҧ+qS{)?/Q&ѱy\Av K?ݼ,"`5g}:7MD{Oܟ,D+V`U牧Y2k,c2A9}6gX gW>-7C;A)i VDKY,z1N_ 6'R'Sῠ}sM#qS$l\mc`Y)yy&amNO#ηd/y~ٰ͡ki-%_Τvgm[U ʗSVĢu2sZKaMl#3Ҹb{bClOeExKnUpշ Mֵ^|/iE˕R@Q`j2PnBT?Χ\r*JvU,`[)ǫ7d jب(+! ))qS ѐ9x${"d,4J"ij\T Z\wj5P"d*X)D/-P& DOlZ)NNf`ݦT@p'$y!;|I۠_!#WY ^t u[t'qڕ uqif .Vt6 9qYԽLٟYY[6|t:Nt:NsEV;ǟ@xыߩ KŻD ΓYT-7DTSر*cU/+-TnEhIkcE҃.KωSئKHW<^Ibޟ>i!} h-7ax*j=.?e }J?X`3&Ŏc$Vu.B}{J6"a\KE/-y`_Yj oױ/ƱYbL@c~ePp?c^ۑԫX{X/J"Za3~i;>ncQOu4*aϾc6-֋z)/ئ!T_ MDst 8P̰ELXQb xS'tsHz ߂="ćَ^SQM^xCwt^cJ;x6coowSsg>??)kنpfB%器1}BNIv:Nt:N9g*YsipltEh$zik,9kJck6kdi^+AT&6|ۺ/ [+o(+k~p SlB2)ljaL87K1X[)4xQԖnҶuNBbӾCi|,Z~e60SӒБm|LQ_ >Q} ./kT櫂ˮ;kTJfnGzoe8MߠMj}a, ܙ浯}g>qȅ{BxpsgM+Nt:NsrKX]9ϋoixZ5APߠ6osvdz B,Qi־=۶$Oɶ=TqΏm%v_9S)86ʖ[^bP&~>ͪ %cDA%s6_T'(Z/_z&b2ċq c^iĈou]Fa$ەm2g Ecie}\1"MlOEiTj RmܘWdin3U',@Dc ɥMSҜT6ZUZ&e} /;Z#࿦Pn+`u Wxp$_a؃H C&:sc83!rbY2؂EUZFtضtײm͍_w1|b0<}>u}S.?~^EvOП\y$u'bdiL ={ 7S9eO)wgp]5cct:Nt: l > KŽ8 l_PUNYKJ}!?$'y)+_3Z_q /}}ǚ,.+J7b|t|Iiψ=h0ԍsqJyNj kzǺ'8d/zԏt}P3iナ2"!>IMq~BؘذQ3B7VĎOS+AЋXp~ecAyܡf06l tmA|[RX$T}; ]/+گԷB=(ZUl 3J:Kj%}=&QL>~[tKڂ_g+ʉss؏`{TQŝbP#"|}o4bǺWu *Ğlj s//em=17]{$\wkϫ঎xs+>Μ3&ׅ3g-Z.zOvƭ?ΚqwڋO y>\$w}(Α<>Ӝ֐@:|ž>8``Nsh뵌vSk9-n|VKO 0+LuJ9etγ|USඝ8&cwhȒǔ_ۣ@Ψ ߈jTNyf˗TD1]4im}~kmN-/Q @9Sv.K#x\4Ȍmk 12vsr4M'|Rֳ p |xNp1|Ev屯PƙO<ك^?)p3C!;7n9>/63 7↧gr {­\]Û};cm&NlO;g]}F |gD7oб}ݙw>p۷R3ggb9I8I/b5O}جpxD%JyTF=>:e!T,׫ TdR%-F/2gJZ[v8@G8!;(b[ u*wۚ~8O1u+]Qڏ(mzI;//dm=1g _w}niυoѓ; =]0ao?o {1yNnU?z*%җ/wg: Wc7 ӻ@n'~t:':6F{{L.S?;<17|ೋo@7Obym3+|NcϋEbۅOkS)?~ >K8^DzNi./Һ^&(6GCY9QՔmzUd+QKmW_1Dl%^΅Z`DK؟Sd%w\@ߩ/kh+ĞINH<*B::2\Ho{ lWF"ise) WJΛ鼋hSR5]ܨ^x/uh"M ٥oiPnڶŻ)$zRE_ p<1 z)MkwoKGkV"}KkW$zKcMi-[ҨF8vɿw._qd<}!|[ObtN't,7^s.h}ׅtuN&ik/r3 _h=?oz>'P/F1y-i>Yj?r94pF /ߛ8 g>}x A~ᑳτBuMnh*SuOF)+^m}Gk[t|+cw6p^Weƭ& O!gwP_ywכjaX?6.T=f3N\ZF#o|F~R ,ip!|Ti~(/k~ y"GtN wyZ}b~n>##gGۃ>Gr~KE!>6FyW鷑ӷvxjLŝCr( 2sKuNiYr<^\+!xqZ絬l?R$kO*:aisjԂ ho)%~>&EIiD%8:t(s";Nu8}JdӾR 6vynpgwwL h"r]8sB|ٮsϤnPʭ g1֕.<}g;p'eZFOIj>] Coئ=>Ws>_+|cRQmo݆ܹ<|[q]8yE}RGsA|?p"3D71 Fi5& ;c=qS:%}r?!R/#idbɟGEԭnFƳ5F'pNIJOx6>Wk&66׊8 PXձs1^XlSc* oSѯuP= {Ke+5rKԴkrh)m_Ӻ_CIq&49;kQl37=@dl#S<}> C~1\efg>>RUn)h c|ȉdSTsƤio_ 1*vzeM׳:IKRFN=KN>Td{0sPvO}f;SHΕ@|HDpuxxer]5{2.Iqil ӫc8[dV35B Mh#;LL>hτ[}kGr`(2,!7KvlnTʓ51G#HjENƫf0܉3$O8/= ~&mvt,/١X5= hǿR%![]r&11sX\}yl]hzUScs mX<1fE{ mio8аI S ֊f)k=s8ӱzy_ܘAepc>ˇ|c9vublęV'^@q61Y$΅`wd%6>7Asgi9ppl.ژsmP3V[ll%4ek+3< s h CVX~ is]9MpmqF{8~7p@XG]p, )RQ.6&ߏyާ urZJn$C^!gm^%-Sg߭H=uڠXy#ܥo#0,)Y,!餁Rhk?6|6c{ঌi>Uy(fNJ;[rΆgΟ*4f[ygx_=b\.\x&ܸjyx~[SDoEgʿo28/m>nx,(1>\ 2 J↊6hoۛy<Կ`ǾV\QLEy|ЇҤ u`bf\w&Пt:'؟uҟQyψݓAq~D'Y' >I9Y>y~/+, a^4N'Wėҙ%ɜCyxxԪ$|ǿ$8"9O屄 15gA|IXhhy͉bL"6Rwy9fۣb_>q#࿕s):B`;P")dMq]T)!}c0:se*w/Y ME><>)#HsL)ӱΟor?+sAbہYo}_8{(z/Շ[[є/'~4]~wO8:NsESgXq ~ϺL.29kGӠm'3<)y*=y)6p̈m5kjy%3-AP¥nQ|LToaВTmn>47d$mw(Bf|yrXTfۗײ4^XñiXˑ1 ղ6:1!egt1?bTT ^-| e0f*_aL~89?чLT]O kM]x{1`q m[T^]qS~`eƂ3/ [ :Y 7XR=[tT60~Yص-*<%-Һ2]xHB}oS)>?2C[>UJgMG]#CE;ZK ?iquI*t5?f!qB?blip4k*m &4YlbFb[xW"Xd([u&SopuCơ TV[UsS4XZXoo*/ϫb[h^_~9wȏH_?/m7i_U6.N {O4o\~4Ijy+u[lpoo=ܳ#_\ G'{:Ns%mSa>ϥz8Ox%\?r/,=* WqD?po<k>Zm D Sz~s>iVK>uqqSW m<:wucO{5( *hLXڌ<ǩFu֖$ cjm,gy<y hCۡ|\6dqc{~|C| SU,K7ap!a>1)UR#Sۦ<8WNNgTދj~k>#Kؒ&[ y,S0&6 Ў@`}D/@lCS1jcJyOp.S}+gaԎbۅ5-ژiXOZhb+ce>ҖQ~շ6Y\??9:'\N6mDs,ʥ2Χϫ]PJ,M.um~v X6Es|Rs*oˑ]l+qL߭i`po?lbY6*69a׏lH!nmioQԧ>~~) Ν?,.|3?N Ypyχ{vS?o_c3pFmܼ,wn^xkoolj,kY3,N&~NR{lc;xmgYɕ9<:G7fJpBrq9#im5T9F(%U4+s6.BXW-9/Mt,‹#'G-_+$V5mmȜhi_,ls*.WHї+b>]tvSYc8~NkSyc:r-ե-RjwV~ N"r&18GJbv ==ShioE^ǂ^"@+/SkO:"nfapP9KLX KJ 1q"wS301Q+@?};mVXY_U@ˏgMQGW^8_ [xWː-W<'j1W4i;JevZb}qj>DH?_7a(~?Qy( ||ܼ>so"~˯ Dw( Fabl#;ҙ-om΀eܸIHk|z#d v<,%׌ƇؘR;T-Ղmf}݌L̡ `鵻E7ULO dkc6v* y$d1T)꯰=νрf յ'$7muZ3#XH]V6,іJm&ԇ_՘#XAG~HJ;In^kbg)KVB7Z$5~?o|#<|Ju]OIvӇw~wHj 'م{~G[8[3Zu?7wG#fo}\drd}[T<;L:BTbI^Կ}--Xl1Ɵ`(AgJ{v<]0m/?Ot:Nt ʫ8W 􉓿%Df -i,59,s4'ֈOo$W@o}ݔKpv| Yh's4M򉥬wWsߌ>_ScSǦd#J}lMcg)כ.>vrjgF)vl'[MӯMh́Ĭ~/q]K`XOl;/-TtܲWl{|fąv_9v׈,%3>?vfmh0TB!':>"{ A4G˥e\vg~v8Fs3곔j.#e]ۥ1--Y~Pf?k/@__E~S(>f Siڪzc*G sR]d'qY-ۊcXy] 3>S1J86m6Yb=AX˸U[̇l ~-?NZQY|(2"jύi ]c6yNo} oO簿;O}/̷[;'!׆;^o~9;~=<6-6ca(vf͈OF?(:K~73桽׽o8wmt:NtSWE]%K֫<9Ǐl/.e:hLpPUۙPb2q%j#߶AKڄ7mgS|b`]d}5>sʨ@Jc[éMr~U(E/C&scVun|BDjJlhU$R=6Ӌo?+!El  gNublxoAV?G;xEin_[B|2/`֭<WW,-p\tҜ` P*+)}ۊ0Qe@)-IvKvrKp(&+^NƝd6`;(IKWt?Μ.Hq4mt[D/,^2ƛ%Qb `*hst'%7pBf/*;}t䘦Cth-J̙T&c\8ڱ^hr[1Cy(ΕLm%DCeQRXhN lpKqb1EZFe` v@;m윘4xM{k㞍Ֆhm?z_~ì{ϧ+?~-nџoxß^k_'Q—W|?|KrPb9|/.8;F+ƹC\vD-/&yx)qt:Nt:=G`Ս5f}Z\Z*G=h= WY#L=>\Ur. eg`|ƹc(ϊ~X(2%->j_:KuTYeG:71ƫ>miUϛrɶ#qQ.ƁbS KjCYúKEӕ|JO[Ȝ@":4U[FJװ[ɮHJhMбL>ZPeU+k|.*n'0(JXo6B lp3**'iUm'+fȌ"YbۨN1KӾ<@F޷ZP܇JԁH=bqm A6c~7aa18P{7>(nu%/+oH)~Hb7diU#~B.>oE=q Ǿ'e"qsmѿ}{>xԎ-UB{*nzG od'|F4%R<*XmFg~|0b[>v(QԿT4OXlǍilPgYjτ>p鿐<|2.t:Nt/ȅUaCf6YֳK#`O3 g9h&腔Ny ZHersY 8vFi[QP846 *BXVY9exf6s B=XP_:!Re^qƨ$R]??iy(-NΔMH}:(v:*Y[IǧR*+Zڈ-QܦufL^/U$vuL)F( Di^bپZ qY]Q0gl6kQTڟAS}qn)DnIk)tN&?v~@{M$VjXUmj9_jPwG ޶&mFLZ<:K>8y׻%kGNzB~G?񭷄 z wlض?㧙|+T8Nt:N'A3Mh%x7&W=/?d$.;F9leNˣVuhNj^R+|be.DKvh戊ƝZ~*Jc]3ێ+"xLIhJ%O6,ևmdžm BݶKiP:;!o ,1B%7~%o;~VJJqv6~X[c+66_>Z͖|;eM>y3!Of{93߻#:g? ?ׅ}xBJO/|ٌ.^^zt:N`?ߎs'_pUd9捽Sի(kOnH_@Yz#ٷ~.֏എ%-&%Oh5J GS34C*MZMe4Z\Řb+k/ ;mh/u} ;^?2)ewa=IY]i!j;@ 3Z@6f ݖ5J%dQ|&Dԋrd c4inŠ?f3w|XC3jKHi?lzPOL-a͌v\0-6M>pMo)8vAp?i;$^DiLYmP-m/0oС1>S]4Avl8 ̖W{{׿ΰ#xۢ (~KwL[N~] ejV7ks3mNa܊?0plq1V_WCNr 1kUssbyبNd˲6q(OmV'b>D\G2% ?)7_j.g?YI-}{__Iq&_]s ;:… vL<֛S=O߾pp3X>~rɋ9M_ _OIzʍg \'u?|[8? $7Z|Ӵ.WY| .Ҽ.O;B?ʺk-=Zgh,m]nXFgZs<>Lm6iPj΅ߨ.]˔c| ex^DilY(Q}pUdؠ \%8q/m6Z֖Me"[^qJՍqƺ񗷓![FDڛnF/J,crf:Sc$ľO>u?vd=K#G\Z`zW;X}C`]NeK͒_߼S?sj5#'영|,O+SYL/dImǓ]%BVMS8V4,PoV?OJ۰4r C|zN+Am^X^mXaz 4n 2d{%$k 6%{)Ԭ\hkje>P*R >Fu)l hcԶOS_F)SSߖ=cޮp[YPKk05mٓ2ݒSe11yR:؉jA(ORf gX5$͔ysOMKduVrM7smwN"?< ~FgK)?㠾g>?>%)Ϳ.κ K?qKxI_y( {?'qs7[))%51:N9\|o 9n|E?hC83"gR']| ,q#(ײRh^iƠn/! jFGF[Qy:Vx#ZIþL:{ы)\du?:d 0d#$I4-gc+Γ:|~L1G,fqC "'_ϾTۺYB N bag 8AA+*U!ϐŬ5Üu|b]W{}#q,bo)"B*6Nפ%1,u=tnjoZr+&A~gMioL. n9H6z^E4[˜pmcZGR0/67tiK}L̚:EsB|矷G68-b]k"*'O$) RG'#`Gάl^ b)./$^Kz!--cAU ' vs4m@K+Ƕty`u  Dghs@;ljm"خ^4gE/*yvNjTZLI:ۻ#[<~s!<{:Ļ>p~n>淄v:Ngzhasχv!<}׿1Ho?G ~{߼7<n<Ѱ7pd/ϑW-!=k!z_v@WUT 2-HW]Mz5+^G n_m^WEm6Z!\ =<PDzIΫ:ZOʑ>|>7D("2KC.ITGڧ-ϢPX/E:D/zޒk;5Vpi@i{"+8YZKx|1&P)i&"_R!*lvQ\ 9%)w\"u2-S>PĭcCJ ʔKEHb2i=S4N1@(CQPVƞqiLc[*cc'a[C4M9o_o>#'ui !tF3|4./hFupn,q#尊At|X%dƆتF";C; :]mIg%qU8Ey'֍ЮzqY i33\64YE{W!Pbg ~cǁ|>AcEfߊL}%K}m@hv= 7l'?_dˠx1 r_qCjd}„' mʞ>EAs6Y9J $i?k{*E1i9'P%nF>8?nL؀@E?L_#䩴*bmx娃咐f!MP뱦) m/*B5JDMdw&;͠^j[봝{%Oq/h ~j_1~^P 8H}x h9IqbK.ةt*es۠ FE.hur~و *r۫,*mQ%=Q*G_-u{kC1r]a'K<}BulD;8ܰ]<'۲vg۝Ng')DypÇoKôtOxo-oo#+)wl Ϟ/,ϣ8ypBAaD%t/rmU %mZCZQ#G'RH[S>X@͂Ufr`Q;MMs;qQEl5l5E<؝+څ+ͬ!+ȻۮSmlv=fDҿ7uB۝Nrx~&O/'7zSዟz?7!9?ϥfX2>>ru<7E[PGm{Ixt6KiӋ1y;-hǷ6oe^ɟlm.(!=-FOW,C`mZ?qaKoyi{Wh[Xq1J<Dx]cG!?/On)>`bNߎ;< Qg s>y^Fܟ/Y}%XTvMRTppazMm&BgI^R&(mWqQ{,yjVt:"Oo>φ/)L*5]wCo䘌rKx.~ROp_wrqu-g}Rfq O,CWC9<Ťy{~='u}ɶT~dr{T9)?t:+}4׿F^ZĿ2_ qYc֒Q1b)1|VUP4bT}SءOym%n<1mZpbzP*)(-2,T jqцE͡#s)c; }Њ2a剶]Io_m:)O!񋏄QMp8<;-sn16cj砍ׇ&[QXɜ^i[W!E+Pu"qm kqO׸"it`c!;{uvp=ȭ^V+oC,7ٜ\.ߦծ_OQt:l_ϹO6>!WgCxSjV,=GY2 )~]$RAPD^["嗎J&tMVuU!yc5\s>{:U=U=s1>k;dج3;_n4}b:n7H|3OKuTxܿ|^Joy| |<&Ð7s>kj< ]4ǂ ㆽ;qpt]Aݭ#A//qR?!/١%@ތ͐(_v qCJ$s`ZlƸBkտP" xbdl2bRqC)Cϴs9d~|r-b߿?<%RFqd?}&e\6l^i^H}(?s|2xMg @(y9yҴ5}g" 2!@O1nȺNj>8'Eg@D[iKݟ90[m/7sI*7T*60?戾$ +l꫷94t} ;#f4'h:i+1W` oisQ"]nW-w6#k 1X]{761O oQxwa{GimnX'OdR>)Q|,ݺ*ҥk7_Rw-]Ua Q[6F/"2 " \!tLi4Xqr#ą.7{W^oI xN>mE-w&swhVB? =Ȉpl!?als;9zȳ.;a5aoq)jV"JC=d6(o}bdyx~HkdzA~s5ig }͎fN9?٤ˋ xZFYk3eL,1-9\Wpzmsju@cd賌R na7 k}MFE9:bL4hN VU]N3 mbB8YZKiBq4?o8]a@i㖴T-{4҇SY!}S:l"?+3j/">? mcCG+:(\QKdj>:jyc@X&o#en 9'kqAhOn~執D[/K=/\J~d8/kH~r|qKZ?}SztX 3;g*Rm7Y/±]Mwv||m ܋7۷ kTb^ޜ+eh.r-o!ךpנr8ev}jт۳|e)BC=mJb}F:";.__苦a0}##3_K?He .->pgHхm Â1Zq(1ȘwT=h:nRkx_XЫQJKpq(u&M=HG'կ6k]oQ>!urc]{)FSԦV]EiYA(GJotD<&G]?RڄQ jFd5bYqm5xZgcX}Gf1&.AZ@C[.@q~]wC wd# V.m39<#ֹ  ﳃu:ph,voa?Z`m\\ Sc. ;nŌ@i8 Π3ħ +,{K-2.AZz]\O,dSvtttM_{3/Ͻ&}௧dy{a~ϹPaz/Po"E_J,'Mrvxgӝ7'\ns. SO auI&\ s{饕"a.Ŧ;3>\vtttttW607I?$@OGY#d[('Mʇ1Qu^:PAϠ/v6h'?rț=>r-x=x~ >ylvJc-X" 2_l:=<`7+V0%!Uv`ZtZ1QBSRؕ=/d/Z2ݥi=8/!N8݌̎Ή[|eq<,tÜVC׏w(}@->бC =O`3&Ϡĵ} >2 8dܒP,y`A .5˜:V>ȝ>C&c>mL8D ~4:[j\ ѠmpeNj|@͋~:Ddk D=0I0nc7l QdF}k1" A|a}l߯;nFT7F(_)BOdd̏:A>so:\58>aq>G\}1 yN{ݦehyDdLǼ!/dQ22y}ɤsjt%|5fʖM?Xty0Oky,T(џF&r~ն)-w؞qnuHvnvT7Ѭ?*gC~zP uȨf_@CD_v5ƀZ֜ikӶ0n+e$W5N(kC)CY9*?ǻ&` u\3|uls0egbbL:=X(?1ݦqg]?BF1} E+_ϑXF_)ld#v~(iGa!ZfRg~JPzNJRx0-pX dc_V6υE9a,dFP|0xo>o5!cTXV$ A݇b fz5|mLWyTmoQ@vM/!\G:r+5VNK^#Wl.գ] gIUqL@+J7k=qFq;,$E< ,sĪNOm<}uD{neEu6>陧qqs.1װћ:;Zݳ^b9x2%wtѹjOS} 'RULZF B&XeC;q^Qn>Wj %#8F$V (h~@YrC5@T_ Zj5p$F}. $bP m$TUP te:s66dݠvU گ(nbNN(^c^]5 8t6: -D}]>5&QԙQ! Sq9!SF֫u%u9G2hq Q*aUS~gC~^l+Zlj? Kz9*Z"e'7s@'Hp汳| 8ؤwȓDF 패@K؟<do뎎 {}_?^c+{H"<қ BqwÄMΌBC9Ňر!orȩN=YI gӡ0kS׬-_.):g-(si@ҼV I' ޮ->XE}H`A9Weq:d/_1yr)X˕_"=e{2ML=t *o-x}2/4}e:1Cg Edn3rW *6 dԈHrR$W(wGAm#oqcXYÐI(*Pl9 ,$%ct5])qEKJFQWU/myH<>5.dc<vDoSyR̝>q75.zcv%N؉rpX.YW;pD  _OܦfC]L[!Yc-#ǔ) Ã'7h:zɈV1R}e~ΔXܦU({> ӓ@ۆ4. L@v. ̧'"@%V&CO<L#nr c;'2 1fYCQ{v`׼֎c/,H-CBWp2vЇ6>w׿f8ȓQ~"(,}15`Nן Mӵ(P7a-ګ|]`m|8uqc qH4Hln8.ډzA;$~U.Hh~9/C5*.m%EuL5t,`7}L*/}!uF#C~$-vT6;VK2z}M C>&D kGOE;ra($>1mS~Gzl'-o~;u 86[bޜ^\*!3;uвiÔE[>AovP7a$᰸,ሏ)S8:*4kkXec31DScn;::::::::::::::pMsjnGzZqg)9/)qۏKXxB~:WNH{Ϥ=y=0o!n_rqĈ*/MχY|oפEu-ԊllBx(?0?hV:ŝm8( Tjۨn&tƄ?޶WU,x"6-@~EHUr,UcC}$\>A/휻gu{ OˁZQ:ͼ(~ Cn#=Nic# bn3| yk?-c ;\CPmmDwqǟxdQuzY'aVլv,o7YC; ZUS>V;Za>jЩeH{VM{GȜ/Zi ݬd w8LLTL&x1Pt@ʍ'\N=v: C3 ώA (ծkXApFfWrس4~1i/koka,8;~d*y`#}',O- AV^´-Ԑ8C.gH.E{ >i2&Ő6D{&\Ǘ566uKƴ2`7vu4v+.AM㫻X܏JGٶ}[(sCx8rb-]B˂4HTJ6*(h}ҮǧA0Nq0)BWgɢf\ `LnMk1\HJY!H ,aFಚa11AdA.~o.trX>eB?'-_y, @~ZW`nonfKWuʩMmYȹ!! nL>rc(fy '5Cs(M{0`b} sm{w!<.ĶHgċ:hrMѶ7(ۢN}Қ[1+fl%XGװ{>lTs4DQqHGͨIܡ,ֻ%I§q`0uٖ^ԩC9yarڕ_ovnc 4K0:ш|'=(gYsc5Pᮗv xV/5cb:^+aDF5#*u S+T~P9C~}vSo}-=0= į>_^*oj \¢ <8d]jߊKx8̕ؽ^{/Z< Ūd}l]/rܐ WW δ mr2OGr@oYgPLn29_ЇB]Y n/0p&>V02 U"("Tle731}͈~ Yڥ^,YU tm 0ھBst ڦEVLc8˩> AY2CsUk>uLűrhZWi E qU&my;*fHISNe % }ir]7dDE7 {( HV rN ,4F2P}< & 8>V3DYA, ?*f={4$dTfH&KX"ۓ4E!/Cց(BxY^vh8)WsuFYC'϶"h+?Zl}ނsy{{q-EV h^k~Y6Ua5!ۊXU_M$ӈ6{JOIr,hWmڐ+ r~M^uUr +pоkMtڕ#o ěs {[넡i (bL068Aa2ccW*|bfphq u=6:heW-0y eNfDK&+bR%VOXm,Ws`8iJ@.614π .mȘ/~'˾cc_ r)zJB#Kp}FeN!}Y~P8 h+TVBD~!p*&Ҽ6pO"zy"|ޫpM$p;{.xX\DCIab 7^vmub0NA2W8 uZ{<-j-VjKQ/)r}c."NSXVYo )SuJcc0N,WDzsteMX^4vUͫ랲 <ǐX\}~ce>m.zwxc؇+.*P8VhhQw8)jBBŘZ#a__y GP[g (F;1>0[t0e ] ub́eݔP+nƒ -E"cvƨobRLjZߎ9!="aLzmc!㚋Z^¬s@eK\AZC d[MBlǥRK6}F%:9 ^0ihc*jquGpQ`*?0 /Ў՜N xT[Nz;:T) *v:ƈx?0ceZ@?hg.;rt::::::::::::::"Kc) *~|K,|*-|Qۆ 耢 1ZH$!ܗ#][IDCZe `, EٴG,}JL=7:|-poQ9ES`ONCGgZOq7O-{tr7):C5 g:5 uPm2> I`^wt]Eu[:yG Fkڑ# lIi+Pm2^EUDFd1FYcIQnj9t?5z2!򣺳BF#%\^}s|_붼?%xX?:(r: (g;5WsAYߘe=GRE98?H4@lZs6h50Fi7@l[A)o++\/BOpmPUI&TxZն蹳'j sPεNe ?8#WTpbZcd{Z@8N!l;|d Pu%$ mHl `ΎG~s94x^)iĝ r[)vAb2e{#sHy1NC߽ep1]qZO,dC~ 9$Ar $֙tE"I=*AԄ-/w51 ~%u &8 \$`'Vhғ򖎡s5 *hA?6`C;ϿiGyq,Q> ȑ)d+GL˫!"wx2g ?vAj|M\ّ@e|5\&PUeDI/`!OJ YP0me|]a^m:(]lnh!U5߳.wzZx vafE:y!նUgOEY|"%.,Um 3T&[.1^o3ΣhLq*~#Y]d6F|AkSjkޝ~X#|]Fþp;?gS~/@8@lG1om, =s`_ 1A)bvfaC~2#->s\f1ԥ~f-P)\ҕƋL(ۯ & ,q^ܸa]iSL8>I/~#=>{Tpp&X.ڕON첳>tmutttlw_LWoYҵtNb_.г΃)G^.6BEk%M^1sIDi}5_=hF<$Ea>j5E0B%{x^-Paz_ބ0qEa1F'C+Aޖ 4ˏ1wPD E5baۈe]ְM*-|Qs1+K {DZf׈6jVM=RV[s2GBo*{usy-,YߟW_JC~<$9q}` AGFb 'YZ & g=v3|k@JWp]6}+dBdLGM`%<SbePDV Vv*lv=;P/=i:m/DnAY㩔/ X )A.Bnejyf7k\ٶ鍵ܖ`Y׋ӶXB7*/$!ה~O-ʟz>E*vTG~򖝉:Ge%@=WBG1={`YNFK6o5w-Mu!0qDT6e ˨󦩘v)ݺz%8s -@[Wup]qnE~ZV }UǑ\q͋NS.6&]Ƞ.syL2;7}FV}WbE0\o2]qqwɷ:Sx"ם:3OJawԡl.oۮoNJ!M@Grof0>2as40cbh:>8V{ Y.ͪ(uѩ'xZDžV yUs|m{l٪Ą{ح)uCe6 鈲 xlǴq%֧PDQnQ7r^GːV~/C~dY#idIY#ʲ_nGP6GmE=ExnXP"\gqTeM\a+T&C!EƇ Gؠ`ciqJמ 4AV 6$~ &^rtW`q,xB:e"!,%,wҐ4oӂ? Շ83qa #@`*; _΢.Y d8=5 bu;fՉmvlg;9?5S}ݷr`#&}F ;rtttt<*w+_lw+pν}b}yfqݦh]Vi^W ˉW2TJ_o3!n= <x+~P< ~Oh iu(0&>2y_eNc!ȳ׶kW[9/zه|S8l^>o!d#E7hScivE-_0 +kYk?\'q>!Z ew?qBfHvvm>HSp5VUYy4㐹-Bs~-4PoA{XX+PrI\k{}{C۹MA@~ptQy<,Ԝ/cjxLĮ>>C\3Iw?~ʮVi c'sntJ\З{C9cZ!"2݁@G\E%Du]a¡jCQc̨gc[>noxQh@yĺt+9>(s_ˁ*9 ci-@MgtLOo5}T?b|}:UJql|7Ci\Ak &@r^s*n{+NNP iQ?:ٹn_upHOʚ#hjqgAahGbg[GcpKEHɎ7vyЛaS,q~\!oUUmb6Fnu5._O&twxq.^@: |pW< ip/.½ϤN%RuV>佐^}-I_N*;nH;<,G[uOW>WRVaױmw`ks~XdNݒ+)2`1ķ;I7ttttxNFw_I7n\'gF~ \ Rsh]aNmZ++`Ȃ-nQ2OL4?orM i_B7d3$ V?8Ḧ́Lil7B 7D~J2x;pܑz(رCus}b,"W |c;Д QbT,#_k f>N)˹Q]PRViH6E'Zd,68?͋9V;"0O8y[v:혒18~n`l\͖~2DO0+>= .A6I⹾ȮdHl oV0 4վy Ca9ӪZ| :BD)X~O m1;G>2gD-o sMLQc:YȘ!aF:ZyMfZdnrgMkTr,qbQ7tVuݨ|v<:l'i'0F)nӶ5Gqtwl؝A`<~ͅub| (Ty`8gW}MDH!=_K\Ǎy܏3 -$F z`oΑ1IK>kp<֚ c&#N Xw'hђF]ֶhs~,d!v_җZ@xpSW[7nt[B;d񅘏yQpe`E{w wˈ5HB~h4 5,6|l?Wyع#σX¶;9?7DVsj΅ʵgcj^雠ꖎGXl1,dSkTb^^H4А]x%|7p*שPVr5k9l51q=z{i$Ib۪5o>ԧֲnfi2 ;^z 6|xZTP gec}6jf]ĝ|!_Fͨ4)jfC"AU dH*DE1$L ʐсhȨ[L=o^2z7x<9|\{v5,^֕ 4~Zյ[E| x5kße|!]L,g Xlpƍl~Fާëظ_._!~%ȶ;9?7}XYԯ/|Jùyb[q,50?0z'{,iTQޅ>"2R 47pr [B ~NBHy۽Dخ"dÎ`rw{fSAc_i?#)/wm]B;=^F) _6CPsou.ϰs VMN6kD7L/ )CـV |яV^M2g>q(7 :[>GYU\#D$tkpK?SDq|EF"Hڄ 3mq#~ᾕ)#Mz+zDQ8'>&"&% 4ڈWqF΃? =tjfGٍ2`-">=ԕrSa ݀:}vnЧNP y!u)'U=c|;<ʴ+ )k20=u{c]n`ka7ıI݄@i)@5M܇˚{h v}&SCVV>Rz"؞qѣc-pJ}ID86Y32nysP­(OJvvN=eEsy5 :!춲?:lzj.VX瀔Jv-A,hv"= 1C9)FJȨ| cv=> ce&zjgя~4]vR' x0~龻AGGGGGǻS\ڢ{kg 1MvfExZtʛU1+ LIh!JwdW:%<BW MId2ze C:oHɠw`(9L$Y]MQ =f>LاL؅$ niދ+a +ĭ;XѺC|"ˁwlbTePZ2ڱ1a](nA4XȾXzXܗDϸ"[t@:Lը,2S.{xo-nu|L">!]Zv@y50vYr  \P(s Ogg3M"gEŸ|"Qs;Z<̵J?F:av#!#Ӂk#CuLbS8~ ]?ӎhwGlB0#/tt3V hL o Q+s]b+T͠' !&]4y c)HKqцp Ц |f9F.`d.y3[Dގ_'hf+;e|lվqoer0 ]~/wJ.F蝖yw ) 3Ѣ[-ϥ ?gmmnO~%O~(}C.b xl8Y{oW?tspGGǻ|ʥ⍎Z~@]/o32VCEځ(Tez=-jw0R.y ޏ k){ xj;f{B(Uu:1 $t&(Ю0 e*y'rv@c_vi 'vHj{= h!jE)>;óO E~yءBcG^BXBYs@QWd`<)IKO 9CEcH $HY:%}>`F4|(J~fFcܐvt1g2~s}q2{xE0ow@]OH9s11(e :5E1#޿"7X. qr|)m b[B%?aL%AB^:syKC"|SY-cG98$ǶS$oWkַz[_ y.*x䘀:p.}Ez'l9T@Gqw"#8Lt軳j;eЉcͩ)y 1g+2p("uv3Ј|4YЎ@m>>1>_s@fǑ\- ;??؆G ok})woq<}9}_M[ro@ߺ6iGGGbϦk' ,,=6llm/ַ@,_W KD{'-_Ưv!Sr1tt!X~b#Sr:(iuo~X"3gr|ȑt(i io?k'F}@}ЛHjY?@{MQmN;asA_$ 7T- 6eepMN 9S`P0YiGU}zr},2AAX>^^ԊtJ:|+id@sЛ\u6#m%&Dk!x[>v5湷M:S1vctM oۚ>B.cQK}7 /+g )J+)cǯpxu=H:Qbq.P#o+mv8ft#t8\ a7Rm ~-_y;~ ~FB\j+H*!j\ZgJ26-hy1.FR ـh,(w$~]Zp=rmY3荜mX.@W [q#7E˖Q>g17z@ee<cG?S|7nқEaΟ韶؆ ך׊5#|5מJWTgܻɉ5I?*oƌ/MeN 1af[z ;:::::::::::J='0k䛤d =ۆ,϶GI*UX!~ESP|cii +0@=" eB\ʂZ'Oim-b-.{J}ջ9{_hIsy\e:N-aSq-FCZDkg5YU8Gw>@O4H??kͱ Gǽt󓿝җ&[oM~ݔ^B-W=^Q֋NNvX(Q/XKOש_XWuzA~W|J^}~7ҫ17zGGGGGGGGGGG|Ή'A}HWy{qw!qB}k#1B>9v8|@w@L=}h q{`H!;`qipet$T|QwEx#0aqpq^6Pxxqk-ZbpgƍAGH5Mj&)D>N}޴(Ǿ7A@|,q DaۍlֈZ| Ya_fX_+dBV c1ܓ@YQA9-:9n溑d%sCQ@)MPD`yqI].mSrޗ`c6B !i6g4*z3taTx>dX 9V+ޓK޸JviKa^aS?\+w GgWoHc7Rra}W >bQǁBZe(% ȼ mk+i{~izd/praXgC, ]1!i2fWQO Z9q0ߔ[bM?fM&: ?4zƘђs9gm ml1ۘ gز\Ps%y*yydxK"a "6r-Mq2sa9|buǺjv /#׷y7߰؆@_9;cvsm"NW>k+8[^2[́37(|j{8.?atGGGGGGGGGɅ\c֗A~ïErL#6nl# 5EBا-'$.sS49 0=Ŗ~MAץA))2z?pr׏$`qVϱaQ_jsJ.߲2;hKֺP6 ЫU'5#3tyۭQSҰ+F7^Mj]<~ۖ>/m?gm\o~|3~i;:::::::::N"W1y]>5*dANBXчPi]x5uNPA{i\({zO`p/f쟈ܥ@_!<<3Y9gih$/<|Gx~1qD&eU##@T.N)bc0 *gR:]qL&2X׮+pɧRzɴS'#iY!v8ꁈ3z!v`iAڗ~F!ܗS<ۉKKIAz:P(Dׅ%qtM|9΅7i;e}xH/fEl]Ę 塛i9؝{;^ˢxޏFs hs P exU_WdSr,`$t"]!-H_M;}^= MG!cuP&tޑ!>AuLw;816wB _%eDAMG]7t#9jiځy|6&ʁ"!C{l; c}?v!F<.7g @|`|唀o> mҾx7]ZmF걁rb3H nD|\c;`CX}gAvd·KI[eCQyu(;O^&}[Љ4,M4Vbݵ`c֥Ue<.9m:9&,Џw#)Y]f+}N P8jM ?#Ɖl "feFFmFؐA1깶mq;Y 'x'U' x[9[6z+ X' KtWW->P6 ϥU')G7^rsbϧ7 ~4~#=鷤`r+^_rd_*,}5k˸wk3;tXE-@qtttttttttHr @թkx ׻s6A0 .+¿J/WuF f"ӟ))hGe:MAz*gYFJ"MF[nå&Xhע!I|5 / X8$oup,Ŗ-xЛSox{|y.vA1ql2jw]hĦ$K27ªr^gs]ǂ+ N@sNJw}čxW&SE3鈘C:҉hM$Г}_Y&,,`9ItTA\m8.| 5z~3 :N Rּqj;<_̵Z|b@=NJ׾\ҷ.']kt/dyO.| b_MϽ6[@=WӯW/+wKOo7M+cӱ=5)S7SX+;̘טջ_^o] tEcg8>8<~/^4^_A<ΔͣW-frkp\$]Óyoκ |' ʂo;3^iPP aR.rGu;spCojuE::p< B s0/ 쮡s3O=c:+ÎîV{|B_6j(*:QOpT.1r wKl;EH|tSFZ<f_6>mp5d!c'Qc^D篥 dr.wE ()eӂ. @(ikO?Aa]I8ou _Q'v;2$d(Ss)sYLfs(q "HD}jO LlN>P&i=?[# Glj@|0-F18KE!y(|3FՑP߆A%IB6,צ7yײ꜐Z}[tpp۩<*@kr!wD@j wUirLuҎz;6me2Zm'/G ܂ :q_O=K-ʠWkDE ϧW[yrVԭӎg~>} },]\Wc^X˜_#i}e)sWt__wc^GGGJ{1ݸJ`IǏ;[)]v;ݾy%uUb9 7RrS.[W'}FkI6Rx~Ȗɼk\0ZZ*\! R/ =0y# > }B-GMG[ ƘKCQexC"?.xx "'tULQ[ - Z~x\+D9,iuqiF7#b@(0)tǥy9fUdW^a*k emRۘc~>b}.AC.PG#'ԲFNۀ;ד'noGFhyTL:/;ׇ9Z78y؋:Ÿ6n]W {'\'p*2"wϛ9+W.EPh -Lxt Q/Yp#:4J'xLR<$E׭Hw+Ulة=ÆE!b_kyPHQ`IDAT$TvyD(`R|qWB`Go}44Zc7^҆c|ojFQ:[(ۀ~ȋ#$y.sc2[j@;H>@攴)YCy :HsW]yds_:-?D_KT.ѷ ]mg}g(qB/ ;ĭx!+́b,Z몾v`a89B\Ž#7As<~NMa8Z1'kY\_^Q8N0)͹)ZaZ ' SqbnRE xsiMX?J?3?c1u{xܻ>נ,REu+WC!n N`&kaweνxxxQ Joapke+Pq\+RkK]`SդVp>X]q>]ȹt ,5e#B=n\շҕ7ҋ'qdzVƽ$TM&cmuzrv(Mg."#˼Lx|)!IWzqۣ>$AېF;Cqmnj:lW¡ 8lAgΦCV|qAؕ(O^EyVGm .A}PɇejݥrގDc:_ Ybbx9$xا>K!Id2+"X< /IUTݐ48h#j9"ui~@+H}񡾝jZt.d) (A3_lrUy7`Џ>#aİX2$\V2)[_{|! _^6@|_FXgږN`&KvG sb[UC/} Q[Nholw7I3?O># y#ڑʒ6p׸`Yl~][gSXeV>oylwT_< >|ᵤjJޖ+oW<oy\#~XWG7l_Kn]m,|y%u]H`tI/|wWzӰ׳󎎎Yܹ.߸_98؁WdV?bG޼n_zc:}kȈZe9Ј|d#LZt ɉۂ .,ܻp@ʢO2\q5$BXtCt;rE 1(i<9,+V<%qq*=.kVNq+[?%NJzS,@QVBznAe̪|B>OY7ds><"ĺwM*69lLL7|J[:Gx2g9o+ylEG+רR]Ts(}җ8&5˥,l>{1vP z6Ky| (ĝh\(֡{CR dC~=kK(v-f?x}5CɊF@($B+ڡ. l&I`'On>-.A a bD^M?ݝ Y|P,pF!~:&ץ|CK5O@^4Yw~\0fz"tpuM1Y Xl>T+(`iy#lLTk8W.G${FOg oRgn_>nSb<>wH_ .xw(>_C<(n}z_Tȇ^G2=wAp]pyIF?FuJ{Ӣ76}l;ynXwؖWNHxVz:J\HC:&aga1p!}t7wj#q&[󎎎I`W [WX;o`~ؽc%^J4@~ ~:|t浮\׮([J!~ςΉݘ?0Dup DKy F{L a -}0iXwDizH(Ҟo@a}:{8'q#|aO"{[>B, `~ajH" {B,'~B@CwxRytxtpV³I Ј6*RQw/k3v 4J(V4nC&C2 %+H$ĸ%`CF9!έ[D!e(7&~@PsHfî#֛{m:{-؎;@e`}ڴ\ `DxE<] ,밝2R9(2}jGҜKZV {67gz yE˘Fˢ >NMlxl#"!/v1rU }&!"hLNg:,nv55Wg B;%"jzh?6HM I1PK9z]6ԝ@;~ M!b! `jݷUeb,#BE8A1|V&)nB2I}G\:Iv]K;1s}K<oj9@s~UqtB1ŀ 9||xX2ZݰchsYBgEX -LַCr\jۻuKGHq91C_0lQ>:̑_Π3-W[N<$ӯo}[?'r賿 .ʠ,lq5n຿?mޤ[ 'q@g3{oYlVڴF;7\KpN+]w&Zo>HG.OlOW> !"f8xbWk*8mHw_I7n>r1ɷ./Wk?l Itj\ژɒ@5@v=뛩llyD0٪Z eaݔjH9~_'y8nX c.}Ƣ[pn<2vL#țݸɍ.G .؝wp7)|?=Idb -de6-ix! KJ5̄3e.mȿGF 793I {A֡̆ d] ^ ,C [gTc{Ga@+_1V2aE4,니Cy;< ̋o*ҮUr+yA%\!|Hi s=+yjڊC>Xe@d.H+gC~ o˺dE BS> 3M\u{Q~jC'\mN]6C%5T>) a#tD߻q7hؘbF)횣|4edt-wYKrx`_·NlǔHB򳜺lYE>@%WNCF# UPvcċ p&ΛaBGN!"ǖn0 |?y~Gn]oMp;NwhyЁ6` 6wo__HX>n^;,Ҹg76"otlaiX;p/}7`Xhs*x>v)@$_ V_קrWmo\.kbZZ.xFʶ\fˀ]?}IlXDCǶW}>i@e UGfKr::LMآ>03q)k >mh -?g*͛7ݻw`D2y8q']Ͽ޹n7Q_.nqį^=-[".ؽr=]r% W7D:=5ݱU5)g.@_ұp^qFJ-,K7q>dp> ./I=}?Nߘ*;wЯw7|g;7K=.~ zYM],)5*1ox+eh.ln}ƎkW~7횶umZWEufmf1"FveEX;wDy";#' Ax0 UO=Nc-8}FOH 7A,]:,n2{X4n7̅xȘ>zP[{be) 7`8R =Vدo<.sVLLÉ`w@}1Z0Ѱ8he(dP}B46'tc@ǷxbY.OpLc~Zwҭy8qMQrU)ųj طdj;j|_M˿$;ZzJ <{Mɉ]"^tÞMZ7@HS5k~bQqvwtt<^y%VrPtqf6wtYu<^],N(.PiӅH<%< 7v8ϤSOH <w?sLg$>%{\!-,;|p0w5,8})D.JXXEuB|G vjH;\ Ok*qAۼb(bOMFE7gj% G怐Q o8`6&)IR qto5j0)Va9;Չ8o -Xy"jAz Vު\iV )7;Nf[m筚@hNFYސGe[h?Z34M{ONC)*_E_0ISOd//>_](HognC-@qtME\,_*ҵ+_H39~F5Qb|_ewtttttl ~?<<>_q e6ˁY ^ů̬Eɰ̭D=v@ю@G&BCԶ"@er-z2|߄h>r.7E#bI葜k<~)Wj7ԁ亮,x:=sޢs˿yψXQΰvwtttK׊\z!/8IX>]WO{^˸C\.rpNZ6 }Y@X2}TK>Xqj;#vAI6 +\0#XЄ9|W,t: %:Hq3'T".|:Cxd:[u"Tns9=օ Aq 58LBǦ/Kw s:b;Ņ'meK@B[ʾjT8g#>;l62q-B&XDH`Z9/c81[ȋ6+bHڑ2َd"ىBR*8re~AɳaFTtw}H|lh_ۃrzL4 {v|}Mf?n1M90/lr_-'0:ls[-?IlKȘ1S4`~y.Px17-ٶЪ>VZ:8O߷qcMnjHG33h#Hy7;Y[#9$F[·KQu>&D zsV@Xrpl'XM8ؗ֎ <q;:~9AhFLj??Oַ,{.yl{#ëN|Fzҳ7|?}[w]qv޸x1](q4|N ؽ0Vo:WNF.1G>$v`y?-;A6.| b_L=#!GwL+R^c¦nr6X(A~ 7u)\CB}Si,^̋; OI}'ouM[v?XUT:%."5qdžS>7%:K:.s|f[Sl#2Wf*,+Y:taD)PRG6!- gtN55t3NF}1"ؓ m"@9E>CGYi`{ՐT~(}]Oah DW!Nm r@Oz۽YAQDK!S̘nHŜŕ\`tZWoЅeP8? 2ncBz8,q|N !͸f#Br |HEh-Y caFƜm+Ɉ~Eڑ2u_G>vXcQ?"\js޶MېkJygnoY-^wt&HNSŎ[[;o[/&n6v8̢} t%E{J..Xir:gO(>Ņ{g'EdJ-  C̾e3% $z+y19_B([eПc~jS' dNVsxzVHRfy m ]]S7 0!@[l8P9e[@hw c}9?E?S0 rF|d?Qe=~PB^)\g28@4Ҳf۷OKS1m%Xiđ4vr/oyG[<~wM.25VysE@1>._u.[e~ϣ# WY^6Z t@iLWde\>E/W,RfW[yCZ;rs-{ 0u| /&kv\y"- uٱ~s=FL6#nƁdeYJ4lcr56TgGeqX[@oҔS-v|8:/r-={rxbx5k7^Lng?⧟M7H3īQ SWRqYʋ/aWx׿ "yL/ Y c7#MmnQN}ms u1P;aޜ.u mY:QW¼h @tQwK Y9/(-dx=^ZMq.8e;t`Ǟ-3X!%s`g>%.a=()qi -`\*6 `]S}b~ѱ~?8e=p׸hZ襪ip92Fo]p{*RW],&qK{{yiנnCv!iXOӗ?hcuVTiiyʌ~'d_A-Cy[y0%-=nXhUF~V>t oIt%>L-4˵0Atwyն=|j畜! fg?d_QBmg]zױ1*?6ʮ{8QyuR(Ӵò몾YKiOO(Иm^S6k1:IFj2#uCCvwJS"OKxG?aֽO]1˷ś}FGGGGGGGGGGGǑa&x=gu~•M!^`vm~ސ@%髕l?--D!`@Td3mMXP;m(ycZtAEhBPʑ}rQ8}ޅ;o VL4vjE3i l7׭S} Sw*/!)nbǙё,}]s*;T"ٱiI D!su2c)Z10 הx `B>2ar"t d(H;B!Rl> _S +?+@#B}jI҇b;Ɓ'7(**'1Ůo@9ln>0(4B:L,'۵'].c@t#D29Mt)9o<_ N]f4Km7̍plhP]G,&-@ˆ݄V5 : QǴt6昁[%}|q.Ϲ8Q8wZv ӎ#u=K9SrUi vqiل OWv|<6*UZQ< KO~bì{;8^q;(o{/JGGGGGGGGGGG \uu+Uvm p?fU͸6_r}]_GNaG}} ׏a1dd8#䎘_4ds=_ !rV6[`ɣֿ&K-?fìc_ʇI r7~q/eoCЏV)o lq#vۀ]'>m[cByoۄ- }epCnLA;yةChad sȝ>Ę)|d9d\" l.dZG,@D~!_t^gHO}!?sZ!X "uۆw%- 'G#31{9[ 1aKZ-ㄲh>*n5ZZ.[%Xż)_$8yҬĜ> t뱆S5>#4tyӂ˾gM>:0~ƔcRjeO0iep |F /J:w0W*3!d9Iw"fb:κ(&ꢣ>ȳe@P*PH|{3Ÿ/>a2B\Uz6)@r^Z~@}\Сz\3yadI̶M v|<Kk7oY zp"yc*wxlO *9poDv 3z6~-O<аr{|Fq =QD+{N-=+ ^/>II ,@sQ2\1đ4 %:Xlbzx ".nAr YXxIh6zBNOz݀B?FPP[#ԗC![E;"2C4qؤ@A~TP@ӵaPh2D#3}"޾=(hfDh>4$0#XlD Ifu3H-Ć{vDrXa #†!5(Ki2g Yq)4<)Y ψ;C낯v_j&1%l=0'.!a~-S#}#Ud;&`C,jeYÏLj<:G =$fX4qQMriBޗUL|2χ!=S:'Xw :;y܏M_qa pr:r1(%:<V9>ޮ C >H ж9;QK9$^k= 6[I"gc2GY7ݎHmI1N"-,Ɖ> #^D]O6wzp]>>.8|hm4@y_N^𩄃x L u!m)Px{/=^;l?~-}Ԓ^?ؿ~>LV N:::::ܹJҵ+k 7RrS.[WkXqFkI6Rx~7ڇkwܷXE^f!ܽ s@>7KhO{VOq/!>lw|lo3F U)b2\ڼZk}I oB{‡5-~~ ^3|J=O))綒s@='I7!vhgWdih[ BP*SR.GCQ6`+Lj`@h:k6 ٍWu' =25Oﰣ:(G@[d-[@!ga ={VQ:VM|Lp;6f i?|@{}$K17XSejy>.DL#!e&7[V>~2 ơomDLlz e$efYVSS._hbơ@5szޠW`; 6>dpG)sR~PO13# u߮  p}B|~ǂO!!B<< oP#`gv<tHyIPOw2\'Nr;->,x{j lkoGGGVN\ٛ_Nw ~>~$ >/y;cDžW:W.XZֽo9s .D̋鈖,YS:se5O$^`!= 4/.)@m#U^MÄx$w:tѡ) gdw*'Wm/IYɉ"a)b s0ǦXp#qp},>utttt<&+Cb!슀].^kOD^_«J3~ ;j<~?H/*oƌ/WP5%?rAzzAdƄ{){;&~7'= >-0Ȍ}J+n귩p4&8mU5]q>]ȹt ,5e#B=n\.^}+]y# lj5op.篩j_@5f2juѺ{$̘ǜX)_ȝ8|d{htGD{i8vxҐz1?Fзu/y|;) ۫K./,3K.;T},^^rFtRP~կ/OP%R2T?? AFs-UVExYaK|1DfƱ6@fc@Eϋ!eF/̩!yWQV2p<[,ۜh1H։=@~#޲ICl6vW`5V-=,3?ݞXXIP{~*߫}wqhDhq=_;qty> eԎ5{(L ![Tq4&9Λa_E?:3B$*?Vae;$>M"‚MSN2s"^ŭpoeqTӔ~Bn,c ci ﷜|] ;3yrDUeڿz/0p+"5)}y";?N|y=}/Erc/nRkJM)}FL}t綾^z6!m\J/ bZ݇0̂Y|=> nl׿NćO~gq9cAT>N-cw7W>?"qt#n.\ײ\L/ێDžxOfo-J$ M`KQ;j.=J-q2"M".尘"?^P.8"WI^4hCA}Xm 6( -.䙧,,x*'$|R=j9_mC4t .dA`bPx YbKYE]xgآC⭺GeSB' ZOѯn7 4R ,y1*zDZ^x fy)k<-Аx|p\d}KG'\=rc4FG,tJzsfQX'IeD2EB;e8pY-' ʔW v>M'sTg>ABC&hsf nNOǼ.o1Ir$#==Y; s4&vN1[vZlِ bEyWQ%"hlR}*d C=";QU}BX #- vXGGGG>|?|;^~ZKY7[c|4}-cb_ذҗO{/Ic&᣿/w+_B}a3)DkEćm{Nҩk01[m[GGGGGC^rwӸa7~<Èg>ոׯ{Zbwlf/7Cڮx,:FvBz7Y C6ݷXNv\0o~/XW/: %~,=x4䛌ő:0#JRs?y54=vy u!Q)K IcGʄ9C>({f$o_wR">p쟒_sQj` 3':"; 8JZx K-SqW~*?^ݑ!.@Wz3H ͯ'|:D Al1l?i&C&PEfwpbfWS>/+!(gm5ʐzLK􅡝$63KCxI:˻I'(yWh P'gmduSuq.qu{c# :+uH?M'R)VI=.1_9&XwE>b\oi$۹`5ϖ][ ]Fq!9ngN^s 2oJK!>O2D]H *%]g 'QwҔryy%{::::W/TO|0BCBL7|wP`9v|j{?ZlxOoׯy>KiX#7-fx;H?]0QV0p']|#=% it>Jo`{o*<-qqq~G ]V⚍;o? \(d%܂ƃ7 ɌDm]6eN lS}.Yh>xxn dQ.qOB?R7!zB<2rT~162r?pɲtw+o%Hmam;׾tE.θ}WΧ[WEvVtUνx#]t7ݸeGM+G\Z37^4^2{{la % {BQf/1iH uJ[WW`Yq;3sqb})` Vu a`} O$"F/GnXV}@_h;sdLGy+`[I/L0Β„;H켁8+{ꕼ vxv~U/)T3-i}=)K@|$9syUv/ x{q_2 x4/m1o(bW}EؐOyYj|+1fhX] N0u( &{Zy pZIЮBE#C+OBAz&$@A[9N?&l}ia vV9G?"F@X^=G9H3|F[(r2=iLcw ,p+)0(ؖڪLJՕ}3L)).uڂ = qPfJ>dne Cz^8&W(r?nj"cr\=^8s3"ce0i>jeBSQ[`KcE6D:&ЀDP?[Vcyi gtݐWPcBVg+Ff)Xyӎ"tx>xVy{CǙ2E&-٦ئ-}v!N7.+5Nq#OjKq'mQ!}0 :NygkPV-H *"R 4~d/9/ë=~r1~/qbs|w~džsYB`'`{/;j|L/>mʶשtttttl`۷ kTb^^q2 4d^ 6zc)|sӸfkw~L+=x#X.BCv)Dݺ]B¢K+T>s5ebEy1 +.!N Y,_R%̺ Yz~( qAÙpH)T<%x/>fu+B>lFZBׅ'^wi_~e'`!(LS2a-Ce;?׫B&M^h #> vLǝ$B9F#t.i&WU<p=nХ;3P%҆#] Og uawf9 ^ALut/a#7?Ԗm]BҦu@'T|,9) P"x.`(2 Le%(ke0e(U"1 $m?:E=ۡ 0o_czQ?#ύ-bl}#Y<'1 zH3B#:2SV?c4k%O7ڄ\G% ߚB`#Z#Zuh J -OwV]wr3[㼊As~ܟ8#Fx@kё1Pm?l {/ ~^t X+/?^{i/]ޥѱ#{9s_##tQg!5l,D=Ӕ`.*p yЮ9H-oBkmgN(0Wn<]G9U ȳcEPl:,z!"q657+a0] 39īUsi XāE\!";W<B,gH>pV e8%Hښ?:cIv4Tt9-Pi~!ȸ)З8)%I)cW<,qkVv<+/ZO!3һ{?y߸U,?]ޢ*oYqr3;+Vr=B=^ TOv.egvnE;6dy,Qc|u aȳ`#.Ejm>( #i}g'F]ϸ汈[ ;؟Lc/QLʇЧG3@L"u}Df09_ߧ119w]hp\ |2dJ?<7{{^jFZB$~sdGA \YU_]:m5lR!';LӅ?`~L =Ob )GB=W8anzokLu؝vE$RbP"U5Q]~l7׶`o(ka6%Ϟ1C^#{OO.|;::5-+>w}?q%;C\F=r&\ZJ|/x{K-xVv p W!aImcxv [4C\ #' ?[}"/jafyC吏 L@}al#@}YV4t%*+.Py//<-n76d{GJ-z2A!q"rױ9W庝AQiu5q|&ںI)N"*y!#^!9$^fuS]U]χ&Ͳ=M6mY#ɘyWnϤqچ{La* d[JB[OSlcCy,BQ/6wf$_|`2-uɖ.'z#[UlmOg2l,;' C;2H+/2>UmX#1ľ>nhgnkIGEPeEף}!qE2B.z~2x :h^JxY hh]Tr+VxՂ+oxWuƊ+VXb+ql7vR" mCR_&l\ȅ`ePnV% a:g)Gd-;خK&t\Fe'B2o-`%q^lC:I~͉ku,_ez1J$:'t.W#^lN}J,g|speHu+|5 IVRWlςΈN$S 9y= &^@0ڱ19H}),bvvm<Gی01ɷ*SEmMj" 㫬c&o8 pYǡ PirC|ԗhQ2* aeKu8ةUGjR.##=3C9+&ʘ041-># _JIJH 7,fS_ynϷ03G[b}jL-]m Doa—Wa~ps=ņk-6Փ4H_?6.V%7Q"3^3O_600X&kJ&`,W^9f/qYbŊ㭯NYbŊ+VxezZ^hBDރslFye)caPv2vl/,rņ685>@vzkWȁr9٫ˉ3׀u)j'Pw@:eI" <Ҋﵲh;6cII73 .}%O {X |"c#& 3(aIx#19rDV2Vz Beى݄ؕ;1Mh`N KP%jCqN߲cǍ qkm:(6]6z>Rn˕g_Du4u'w)@7={ŔI, !pGʻ-P6{.'4ф ^% @}/ S^ >TkC$;cO@f3Od9sLl`V؟Qfd*4 gX'6m4o3N%ї˄?ܒP;xWmg* ̷ɓ,UYGȜ,S_dꙎ ,1n!K[zR1D(ŘX !'LD z a]6dG]q P6=%+RīU qFzXOa#Cb&v/)]`*2rJ4FyN6e=5d^ɞ6vD>0(TUyLݤsD̆4Sco1N6A/=TGLQcm8tT.B 9‡Y\GK-A/bUM6+Qz]/KXLw&WU'C+{p ,!#5)||iÇR)ʙc݉ WIeNxzJ4"Wp O_UʙK9 bzW9xdR>WT \{,,֘vy-dOр>ȤT$/|ȏ8" ' 5~6x[g)(GB =X5'd5\+}~s^z-m>l*L2z;4n(1նD*.1G )6C§lSGԑؿڤۮIGq2Γ>C'aF>P5$ے2 ҫWAۓ2vVZ:b1(P&ֹU8me' G$"k p8-CK` Ә0s"r_=p|ږ‰ F VZ2$GM-=r>tNVhgʨR' T-A3XܠD3cm+<s >觐9Kq]mSVEz/KB"LY̊1Dƹ_luu[$3&Ly5}P3u+pXqa]cŊ+VXbťWx ޺l90fva^GSqMu+=dc4Qry1Ӗ\} zюzՐ?!ݡyK՞ZތK㠵G$}PD,C0{ibXV۹' S}kI? *ȁo V'@DCA!;Ώz8:q|p>t+V/k_;xK MzP#2!,TȼlI/@<Mܕto rX' 79ڟql1XS'O̮3ez8l ʾ0Y[Cay `<-@yIPNIG|zow÷ح^lE]^ڑmFIׂcaE.(8] +JNI8[ǖcƍyM9k-N *<|~Ԃ(C ro۳gmoE}e;npǨ|O)7Plri('6rcؐ Ye"FE2Œn 1! P[F1|mlSrvXv28:aY}5hCvPc'%/-/|NuvF$Whus j Im?f_y9g4z}qVRw!Mu9*+ qxuv6"c'3oՖ {,/˦"{a1m(m~Yqiuc \7Ê+VXbŊ+Vx@Gظu|]@K$iN3-zwoyNȐ{' 1E^ސBchcEY?#*aWj2FwP1e|0F>+ٽr_o1Xׄ%$A\a$^p!QO)΂ΕWg.'\]\tuʕ [r7ƾHq/`r*+A/(l((Ok[AwyKP!y=ׂl1lںȷa9j ٬66 TLrNmPnfaW*/7'qt 8ƯejL$ fCL.9˅?rJD3m&/&b` K~CҐ\߂RQ&ؤ `:!?faM{_ ΏƿThmw%Ǽc틝_L,'91UD{(7/^ Ę~Ie;_GIeG3CIG rv{fd!=+y-1+'TUyRVTw\'wpnwl gL-GD4>m̶G\۩%ZԃX2I}ؠ䪎܋& _=>Z֡LuQ=L5=4 HŇ.q _8^WXúǕu+VXuOw xYek \#]ҪɀXvgV̶"ufxm@~ DcoᏵڿ rN Wt62mDZIY.ÞoS#q"A%dR,EhIhWaݶR(Ki'):xW7U*>v1xȲZIQ@:Jhc`V`Hc/8n|0IGEm>sbyƾ)R+˱>H~"#'yaS֓Ow=~cE]`9 Z=!?S"j@oc>I?u ]Fz8DlQE>A'LD3B~HX2ebֱJYHy/kJ k:'ʺoEx-n5d$[l14*ː3f?mէa/;$P5]P"h4'ڗP7 LX ]6z%.s<le: <#lƓ ڧ@u?:֘1kqD鈠ImczQǴ\%t9:mLֿxR lRÎteL_Aˍ9vgj2u!اK$"u+]t)<8t`}'FҤ "i6vmY9yK0rE"i 5x-jj{Q}mtW\cbF|M>钫=e l-Z@Pm.-a|D.*2 ɇY>Hl%zXm_W[RjvzT# >弿IŶ1q~Xlohڗ_v,]|P뒣=ɉ@^qh۔PFrތ󪳬ULBh\:6$6&ٶĬ!C^c!Xr$2_mQaēOxVB+ .:*ԯK~<2U|+R 4q_hcآkȆDh,o+Vx1q{řp;{S]wQ܊+VXbxOyK~^wD{W]w.LRoxoˋlVu}QךNq?b~[1k ['|E>tمwqC~NmH~ ^[&×z zЩiW f}]_ :ognLGu?qe#uUx2/Ĵ] l9Min3u⯲ M`GuSR2 =`QwAԡIF,[Y~#yAAڤ7}G~lMz[Y|])ip&w'ω8C7][ע|O(|Rt }) RN!&zZ{tlWu!>MFAyvQjG|Vzxr) 5&^|4g_7- ASg}D 6>bi.xT^GcoYA6&Yvx<%*H{ n/40^96TOD>3]ȿ뾩YZumI?<#u"و<7>Gyem : r[5d;A;+\6/}qli|$N -gCXQ#2?rrг1ry18Nlq3o'{Mo3G2?& '3q~m҄ھ+{ >[uADWBNn6`MBapvy;>Ύ;IP t8׫7b#w(Gf~O&F\]=bw,, Q XY^׾/hP]u.yl]$^6F᧺ Ŋ+q{㎻w^/VXbŊ+[5 [e{-~&NL}ӛm(}?iE.n+o~g/35%̮GujHr5偰vr9/%MxHw>Xƛmb ِ˅oBu3r#;Cn쁞^GdQHkS$WefQD#êk Jffc6!ŸZuAhԮl5->}ʿPCFqzO{kyrE [e㌥"URq&x>Io1GQx(V)ڣJc }+Cm='i ;6MTy|&]6HƛO2fza{@c:6d ]ry~<_h*>Qr-2s7xMA>DY lď(O >6&xulBu!D. ұDP}`6-x}@1I@9Q f2aƒ6^qrY6ʙZ~g.r׮ɷ]ڲ\",CNi#r]>QnkAitK30`uvȁX챑t)i!8ݟ,'j$|92 sM8+$YH{ĺZKcd`gHnLVeӯW]n/G?Di}zXbŊ+V6iiرmldpRȻR 8xzW(r"_{Jrhvetg}}*[+莇jW m;j('F&It0JeKW؆և'ȩ||.wZpJS6p%ʃ*S6DH!"0{$CtVC T|[ĥW;)NG&D-sM }F%'[D\CvS4L }&6@2njϿ`;bBoSA)޹_GZ)םNt)3$ϖrTyN个|٫ N8zNнi>(}5=>Y.8ߨ}r׎qȣ, H$&1G 8.+f`LlSMu^*;adq'qX2/2sG*a(NT9pԉ?Gڳt8@B݀%Z-Zk[mXcE+VxUo,59Q㝥py;,u坚qkV}sGJ{.+ />P -oq?&Ow~Wyw|%/= CcR{wodݷ:cŊ+VXqE)޻mwkdb_+pi|˝ߐ&Ǿߧz;wBNGD7Q(1~χ1뚗rHk:blj7Tn$xA 14 ED'{o,rLЄ . DŽG>d͙-/Ð%z|&xgYkrV8kr/$ꡪL*|(*2#FHVal=>亚E6,rG66fx9yuhIp0J6%弜LJz/>ɯl8\ږ?9 7X$A~_{F.Ge0)夯8XO}ĕCta[qIv@*+[-,Se+WN)㙳e8s2ㄎsȐ(˕Gf /yo b\m*d7PrN楸'!+lFI!V Q= 혛 +sK=Aiv(1e" 0uߑ}mDPu6DBY' V7^n)jTdƖ65k؞\mϤfnؒ#Od>.$WCUuoU3XVyɎe+xlԈ{ =Ws(sUז_)@kW\muFO=<6dOǬWeZ1>Tc=u$Am6VBׁeh.ʲ OuGS2/Ce,Ӓ|ohn|. ڃ92hu;z僼?t%bN+VXrŭz{W"D po7 _@|$M |uۛ47MͷIZ%>x[;](oSօ PeŊ+VXqV;w44gZ71_߶mE X?}:9҄؋Z]wM⚜(xJ,mI\^FIe^k'%x.Q R}% Xǖ؂{FSY!a,!(ulEbhy8!_”fr;H9cz Dm1lv z\88׭h2ɓe%eI/"`18϶baz} ONٚy>)dXW\ J2 v=+DyT# #"_TV8UʩSe8}>S_;NNkXΪ?èþSX7{ Gve>iǸ ƶrls/6ۻhA⧸Ym}$R}#6"M=&C#%T1XeiR]|PK&}_QNߥ&Ԗg H|ʂ4'zô^t@:^q:ܡI@`'-iF[^eѪ(njJ1(nԿ9qݎlıg)}Ya+iݥR 9k\ʬ}o:kN `=c}P ߮4{yn.[S=nI~Nl3' G[OC%}aHiCrs4dwni^:y֘tRkYdN'IWۗ|BaNa:3 "Ǘ$O8$_)ݘtedo'ў&"uvg"F'%YMvm/]`6)/z$),վFj'=h"|r,1ІRnF]P}!+VXm_G-wyH .i۾rwЪozs)wywċG:.-n[m|(rwyӫ[6aJ?_n wl.+VXb -ɞF\W'`mLtxodk<5 Q;ycj>гi P[_8fH"'{;Aϴ"{y_y s;3S-y=슟(Ce'8{2Rݓ9]2S28Ԧ)TG-Atn$=4ԉl?ğ#zC^uUVzfgBL`mI#I FaAYc ǂ$D ı^&0 ֕Mzb{ { Ia] S[+0fȘL$l nz^B:^:Qy?YY+pgrW "E9W8#}AqEjZrE3ȋ4&رNp9ۤ)C^yﯠj4x%B&?֙>y"ӛqz$YjHv|gּXc,r'A{%eE[7Fm3ذ:ڲ2 )hdcr㊍2i)>&SP~ARΫgv< l\q;4tX# 8}@dr 2uИS~KFFߜ#5vz$Wj}kٹLh*ڎNꊄX̿D%oz`loWc.|֋:NLw6o/kH,`i3D2n_thf,#~q1P;C|7QObD! eo3"80PGf Fᨥ% `f2=U%tl'2 G;C~R'hN ~'H | >M<#)ΘW'2}lF\β@d+ӆkI f4}7$]Cv>6`:{SA߰e=?`S- Jq¶V)9m'aN6GOHzXeGT7nnW6ber !5}Q)M: ҳ2>[4hRǵ d3ҳ ~gf20fu,O[Sԯ}wЗCdUn*[KaRshP3c'4F.=`AF%[1|TSƘ-N,ǻ?Oj>RO؂X|#/RzM$m#b'FKko>r;x SX#I^v YO WkSIKEs ۷ s2uԞ 3Ab&@[=NlFР6ԦDȫ=f{߈+V\1-WOznŊ+^e9-σun l9_ks|| _\̿/ٱ0^C^ k_X>v.t_mTl5] }>'bly>YT{Ff PƯ费"s<{rczqVc):ƛY8m3ۏ6;[P=(yyM04ۮ35^!1N gB~b;ݠ:(byȧSuqɧE Vxqpu$/q|>Tc{Ӊ2uZROb=]#~OC"' y\yO+,eDK`D ]㰇4 9u8q]rt#cvHE5&rIya3t^AOÂM!ӓYuZڂ1=?`t{vȣU9]WK>d'^`!Ye<)^4Ɛ*k;zؒP.pŭ֋(:ܧ֏HlNJ4t],tU &.SA$i\`B,TӾO/ Yqy]Dž\|DݱK!:@/ۈgB@/ AH\msגŘ!a+Ydwl]? Uňjgw˦ oї x){ 'h1/ۏe).By*pf}׬^J=4>ak 3"u~FO'hAtBqҊ+VXbŊZ,:{>LWNZґxOzܹRΝWXjKr݉v"\bgtldUsc H$xaˡ8Sy/(^<6QzcP="^kg3 7D О&"ar>Q䑑1Ճxdy$.Kp?Vd)xFDN,gNs ҙs ίHB Jǩr8p|ޱV?=d+&/H8C/$+> u6Ɨ˕/~U%Ʉ>] yպtl&QYR=TYMcMj% ˆ)cm1"q~0o3۪ۋv*+e9'mnR Tu& &k")s<$G6ӓ[_tG/]ܰOfXbaW>7${Ƴ}5V}4Zfl advgNN힟n86\xI _0af/ fq0e [xfa 39'sӎ݈S%̊/g+ple,(ctt+pcݗy[@V:j<b@juozg<#6Ta$Xg]5>ڱqQmc2E1\|`30o2&;ۭZަ3h_m6~fPߤq 9},'Oj{hR\u(omg$+Nv^F.czTdS_7@OXf>ڙ7 </:H,^"-RE!'r(gFZ1x6Y,g;ߵ d"=d߸Ϭ߳E)jtx ψ娋"W?_f7V1f:p>!eX4§Ivy:fQF223< {5Gr0˲ uu+W.˰J@+Tx8u4F 1mb%jS`q&ku3 lHM@Zs@ؠVL23;Hzm\‘⩶^c''@˱OC1,Vqa=sݪ``Չ2W|ϔp9O= IE=-哟5̳VcϔJO+(Gx[bx15_Kyۯ*,+^!xuN"lm7A=wd#]/^CO[ C 6 >QЇKj/8sŒav۹M~Ό} s;LIO#%dnP^0^TMg% zɇLЎ}b RBLv >TXA,|~KRmS'$#jS61?SzO5*Ѐ t|SrƄLT _SUG@4>q Iz9 sLjHROY}E H%:l@-3(mfe/* 8RL&~=׾XUޑAd8WٍErV&N[VeblE#?s4A2[#/K@]^q^n2yHMx`DM!ORV8uJ1"66캎^v.d2cjs|Z] ʶ(+e &ԉ# R6zf+zDDZB%ԾZs 赓feʤ-8RrG2s>%;lm(ko<PSO}x"a3R>(,$ Grh:UATX) !}G X /xQP܁^iUC괙Lsp`ʓ(m>U7}lHnx_kѬMkՓ@SGEn^,ևLmxa!3SYT6|: ϖFY6*6YX}> -.AgiG.z}KB6X[͈ےz.蕂kbŕuǕuNJ+B;3%麍p N̸s=P/ q~Aݿ/#g)ÓO /=x)Ozæ9ypqݵe|ק ys Vʯ ]'pxe9 ;8p|{~B m) P,O$9_~e+LX7FB}z_(KEXǡݨV<9vv> Hю}"yn!j[kԻ&3]*rm Jy~j|# = 9`?'KLPQ?Q:S?ʬG^IN +V\yX'p\X'pXq@8p pe>vM` Mу ;ຘFdv8Y{cwR~Wx8㍜{Aw2xA״uP.6vuօ/%8<;avo;QЗ)Æl@2H)2K0~LEGn ٯܸruA-/1۝O RMK }Ry\^ذ oe Mnf}9iz,F'34KGKԹrʓď2e)2X6NcXݎySC{'Q4c(ISevMr9nlk{4 f!gluǛ#SgR?Tn˗[&pD!UJ"m/=$dc)}Jl`Ί3LnƵ&p$l Nw%O6*;!_;!/X v4{:)&wk\H%_;l,ًGEdnK/Xun ܖ'8pYLV`ֶolK? up"aZmר V. QY&f|=~(ɠ&pSQsٯ,N<Qf=2NjzuNJW W +VBy^uZPy>i ^/D_(#B=WO>POTe(C㟀_sM~g!Ny+e1W[A\mB;Ξ-O=mc|K]<艷b+ ",~"iV Q~Ht\U}L~u= >x_*CA*}@c'RރWX=oCEߗ$@3-wm¶CU<6 p4HYgD a=]M0>RK뵟mHtg+yzь]Ym_11XXDĐE-_=H<-#rgC'$be'm˶m]p?-:#3g>u^ȉ/V6 @Gl)y*uG&ŋ]ʬS bra&)>CVyPkD[a^:Yo7$VϼV?!ﻡ>X8g yʰuϙ'?Pex>HMo5n"^ߑ?"Xgv/^eiggȡ>spV vR{?݀>$|M}Έ!dHi!ӟ!߃,;HA6ڲ/ AS'xwr3Aar)Lvĸh3Ek#3S7|M E[wq- 8X%.'8ƅOF/nOv度6㫉cLlUsrcc{iC\ʐcnS%  -T/gC*|Y JtbŕuǕuNJ/Chϸs2ϑxC^FYbd78Ay_S'>QgJ+è'a|p}*vOC?Ӻy2\@ϕS'x&uGa4l?*^ǎm!ݚKs5!'u!1"L#$ScB:{[ CzŐ D4r{?is?lyCJ@FU@^)9sDk噱2"+Fҭ@k+#|UUf\ Kv J[۾juMbEnVe|dcu`I xJG FuWC~ ev Y+}=dIt1󘍔/Nf#[d9E}ta3Q; )9b@^hMmЉ),>"#18Z;2 <1r6X:Ƈ3w }1s9'f펎L!ϐ2. ZlAcKVдm[8cw<~$dC.̐mH97BcV tm.!/Hmtٵ^~8t6&a1tO'c;Zp=De&mKE{!Kcx/$yoĨ]<ϱrYtCo{a>Mڂ.h6)fb`{JB <ػ~PlB?Bl2yL9Xyb:r6={}B9v\XMɺj*ʔA^>LmpX?NXJ::cŊK8g`yB砚q5-QU?zve@ 쟂G=EV?J=XW/> ?dqCo`{ =Nr&>LU.@G9 ĵuƾ Kotd.umVC@{Pc$!Ƭ>8Xj澐5wbO7_ݨG޶8E>qSTQfUCSjm6lڶ(U'7sĶhm x5>m(* 'a|*^/IHY~4E:?Czb﫛e ݏ#m;@m}Uz)y)97nd?D&pɔYO+#*=0v1iSbC6&iM2C`^MSM^@6Pny*;" )z>-vW 4Gm "bt': 'de/hu|>t1Qz.2u<>l_n |0ߒIxv0)D#ʉX-6#lF]6|-緡k̰F}L=u)m@ih?. FRګ=P~vA.YK1ll>ulTF]qMuNmbǤNPE%Gd'8/]>rUgfnեS/,vAlLM%bFDu|{o zֶS|F'p볍[>H,:;u,2|(o}gQ ?+ydg)o2Ԛ$d3bu8XI'N~=5Bo֜'4r!Ts:qS[ +V\yX'p\X'pXqD(ck=>꫽=_sgVpze}e :>XO@0rE,p^6<^u? d)|{]o/}K_Vn,w^_8N,J<O9Mx&DuRΠ}s&)c[/nN`q/h^:!ϸƷ2pN2=CWkp e2\]Wm(_߉8VNģgL xȰj^ۋ%eu , ǂL&8wm q7tҏ9˵1| 2ĕ>N:~Sy >Uuk;23CKٸ"t߬^ho[XZ_vT z|=~Vf2$~x }ڃ"ߎ߁w~&p)C*ږ}e_zQݿ"yvؓmdmH˲JAKق@BWu3̓h3{ jMY hKj(o.[!/OB[^ -r,K`Q.E"9{c[% PH%2MB4912J"gLnK7bCvr~Ze,z\o ]~G}7b6roG{8I->7MhǁY]/T IQKgȧc]*ɟǣ(d.bqwAݞh{ĴQL:ծf+mɜ1u~Re ?c AX:{q{eg ?h;!L# nZR/mbŕuǕuNJ+Z?Y7ZƏWs8gzF=+Їpg.c/𱏕rR8ixcyg ,\78WhtR:Wחu!׋<` _};?^o~AmՍsƅs紒xVЍ,r 0x\탱|5vv=YpsOlW ;rsǍחl7nU+{pekKA!b5_i~\C?Wy|ٗ\Í l'?UoeP//eXy+^aX'px/-8,>XL/Hq Hn30q sm F:]'ں%eޥ+fz:d+fx:mjO 5&6)/ي vaYcEtN\SzH ,4]jO8O/r{eLs ئ(qf)(.赅 ꏱ!*(1xMXy &ͱ!۪!PqOϗ8鈐mvWʪLE}5I'/H<@O m$:|?  i=cM6#41؂H함>uDP^m臜d,c)cO0,Qc|uo˄a˱vf8sT^p۹6Ge)6$y_B=d2>L>P6}}>x~ML?憵Є$>5ͤSchq3%9#}OꟈՇ5+dd|{4;>t&&:>oѱӅ,Y1aW7vjnm}ulKG?:lEc$Shgb)5Nu3Om )(JT_p3p5N(}[bovIzX=O,~-.^>Ʊh(o~{N5W^QCFo4vFkIM׈}Hż#Ç,67F v{D0 O3)u9@|>",j>:X6AEz~zE~ C. ˹oTOB7 @k?g,NeI)'}e"{mJ_:۪6yz /< n(7m~EJYWHlDY &? ,sǺNJW W +^qps^:Hz'+p\ip^-6y >Pd>z`'4طoxco+U6NH)xxy rn34` zu~h2^~ ?lyqr/t ?_h{])=Њ8lk7ʹ,> .6e$Lzk@&*ٲce7b.# (G޼XKT-1^R5<~Sۂv 5F2sh(^ږ<_`yvL{w BN;G8,xۘO~lZ!hJ JI #b-r7zmd?,F3 FgX]3/lLH_Udה Ï<`?kA8ό6◁ʟbV1i#$?D"&;녊 -<~zGe[uec'Oe~h*O~1~<Ȓg`Pcʚ[qGaI'de xoߠ&kdFuO)Fm~ ˄qprBeL0N8hz1ޗMOm%BT%upx UoqPkm`a"v켝ñw]zGX:hۨR^:qf 3߄׉1wk0PTQ b ]qOmgr&:.k=J]6 /tX-jx[oMO[E|)_9V?QgC5.t٫\O\*2A(O@#cڶL#1|2-e,A}C34uNJW W +^q8>^^G6Ged=u'U4rcN,8y' "jp2W(石  oP M$@+rx79Qz</@X5s2rqpE 88ΜՄMNx2>B;?.<ʼn+W*?eds2~Jye8{N$Cy ߜvrR8]@(u**I+ۮS'NGN2a{o,]fٰ?2~ϿD.2~&+^渒'pį/+Ok#ꏌxzЉiG1t|F=t ~؆Wp F6bշw~'!> կo(mڑTF\k9B|3@`V}VmZ"dF}$90?jD\'Vc~~;9_MslA2yOYw s:m *Λ{&33aCEQC] }rÀ^c^/t_6|EZǐ#DXju!_MI_yK%k~.M S|W_ӎ&xK RU4&KB^uU1ʤ([< ;mB{ϩolg 775}|ƹ Uؿ;'x\oscE[ ˈ鏯Qф:~^'䭀xΉ+G7-}޴uW F(K>X뮳 8| 'o57@["|srS|fov]J C ̘ϟEm]WOዱc_\ˏq<{Fv=<@ K:`T]"j 5~ӽy^L|ch-$N0mIߟa)n"zVG ?,~ٌشۣqၓs*mKuhxgXu&1Ip_컰 dA=Kf}G)0zmeZ8Hn"Np+H 5xbsOFXYxs !}dbdk+ٿ5m5STͽ٦IƂׅy5?b uϰ4c;*tF^XnMD9I4Xh˰yrU)ՠ1⵩|\h<>=}X`WqVwƴڌuL';_|՞dϐOm/źVn͝hc ?׌: uuDmב s!Y_2~ނ!UFA"ngeqwGǸ3L#; ݬS^ 4qDžqfIΉ璯]/|`OgN|Xm l_8|Q2 v؏~|Yee٦1cí1mG^eK?bdO( Q~@-zR>9heg@b-WPԋ8@'.TX}I MHKy >dX(72>d9ȕ'NV)]K\>2'5)%F dBF4o2i"R/O=eS'HD=/-Dy$mRxZxEu.M>N8 9>.WI.irq+O.O=]O~}O"@A5;U+/Y+A_o+l '?JܷZ~ŊW *k<09OW쬊T1T/c `.tln8_FE=@@1qvhGRɛ|yvϤAyD->pEE[>jtbq!fzNécTvrr=1bn/J)nW^ElOS"e>z8ﻰ4<#R?u Y&[곇!l` L ")qeB'pN."+>lsyzep.pڲNLQ־e 丨KE=*Pъ7R` {e~']蠧 Qv : ؿ'kLieD!lh ƁBxaQ멸o6=CDr5TF*<'ĢVVi֩яsRK1N:"yaz .#x;u=|IFOvlߵ"3Gl +zɿa=c.d=aVF>n3l/1QGwQ5}g[Amb݉~oz#c;A:~ZBFl a~dyOo?&Ѣ(*vq~lGgv@v}_ rX{7֞Mp/a)b{Ll+2xz60wqr=li"<^?hm3)@u?7:!dvqC1}#'OdvWF:usv[kX,(;姥 )KiaOI@6Wl~$E`;̇&GVyC=Uă۾+08 8Vs0_5e.[8K}''\8_FfqNkp^sMָ 5\u&.@+z\}8a9+dpi_k| N Wn)7 N,\Z:ؾ5exx#WDkiCʯP^R=ܼB%owQmlYBWc6ݪd _v@?u xɉI2mWpLkK#s&dv8*T?U[%5[i@>PY0p[ǐ1E<7pY"uL18)%x#ZlexPHͯUl*]>(؈i_I{5b'(%66wgG+ <׷Eߥ>:Qӧm_ryy(yV`SOmx-v~ć|__2=N o׈TƿקTnV5 /97t99YSC^B9pJO(_뭕@/]fP9{_MGйϠmf1Ÿ}-;~hp)}kD,?K)c|ʨ+\dyD$Y `*mtJv2ɧ t@]v9+l}䱨6PUdŽ!dl~X9u6lDٷiНZ+=Va>klDxR[!4GE K~c[7PG8W]7xֵq/{6."x B6uȃ3ۑ}he?#pXK2-v6죷w)}c٧K{u թن"*ۚY I7_;ll v's}!6v[%lƹa{rsmBwcmq E zâIGP r?GZ1@W1b\|Ai ()O\$ xuNJW W +^q )Z{-S\eGʑ/wvD/.#_I+_j.n)kl2g2x-O>WF.OξpSe-Ç?ZWR^x*2՗*W۩1JxΟ7~&00e9"8IJoLI ֪#=W _(l| \[7 _+䛓6nkL?'/`} ޣR~6/_!2৐!х2?>z1CJJy*3eel~2N9оx=]o> Zuc-U+^X'p`>e~Yg1Tt1eDz,vKujXv~o>y<G1!1|6Z] `j[Xm[kHs9`e&L<ӏEryĈ]nﻋ`K8Vֺ=y*6r,?z[0lxGl,ϩ.s[05n8p_bpOfvM2 :}S.A)=D$ :2 R9kC @ O{ 2Ph|[mU3bXC&/&6[oXd 7ێm]WheUUܔxX~]A^PBzN 2ȈA^vdݍx)2>foU!$:AB@:'Oyu@crTU3$r3s 445kw Ieņ!|ǡ1z_sL$J;kfrfklW徎~֋m;)v!V%Z2\ePMYt8˕3:8Ї:cŊ+ +8nBq NrΧ1ŹWJN*Ïp)_uvAGIdBDk:u!WYk՞ >.O uZLk}Jpe7D ˾;+'\|f 9;*'?U7ßY{E W x_Oq "@*eO?Wk.הO l; q e $ޠJ%|[wm۳/ѾX&̀FPaW%I/+Vji7|1ecY&hԜ/N\ ~myL0~ ]}~6}1ݼg,d^rsgvC?=@.~n}j/8h#m.-B?j!3:8qS]nal)NNHJ#vW潼.}Q9pG'>a\f&GrQ:!]q߰d{/:e@mm/׷(~¿GGc<r{x1~EUcl;#L#=I'#D̞r\h_; > ;e*mL]pƪC\Gy&P,~0u=˱dn"od#L>`۟+!bocu|֖~KaxZ[u2}0*)/>F,TSa3|"A4Xm˥2 K2a[=.>Mŋ'&pTde>#ø;eZej#9;"ur'D9rIJx]3بkc ˳,]B/]:Du'};;Š}|M۝nLoGܿMc{13k-ɘ3]ou=C'SoC uնɧނگUG#ՉSMOxwG +V\aX'p\X'pxkr;2w_?su_:+A8@z uxNŋRH\I7C)ϫ(Qy$N  'a|CVʣu$:c,6~2>|>2G?݇-eUgWoRuZ2Nc?^)‰OeXתh&?(ȕ;z+#'R _sVC7c<}+f|/ !ß2~7HV eD; oMO:'hQ~惥s*2 OiBG-orv>sWxչ|RtMc#O>9MV'O_?qMߏ'Z03_56%r.VodS.8+eFݕ I8mlEnK}4Ǭg/-ʄ"z&ʻ5@x[m1 CōIYx">!Jƹq 퇊kAJȲa?dJ3 CeMWAu%oXUOYF9|].W+urYA| c ry mUȆdXu1htmgbͶ>LC}4:qQvN6Ml8^uU|~WpЁg>=2LAL&U0:4ĶÇb!ruE8= =Bݶ)< #M@,|VmEerUW K3"vL^rMIy[B W0hj{Pm@:GT]M (өvz0.CvrLSq+e jvn=x]9GkGg쫥qv S>m'NBevZcZ@8j?jдρ`6;rmÆ 2rѶ(S6]6ںb6aR AQONl0㠥K:&E<[ bI(:bϋ?2IddOHf4yq$khXbŊ+V\u#?[ʽI\un+Op=exR> zN \x}69cU(8ˎ| _A\=Rϕ?U?'.-2/7mY%)2((??QSm0x2O1168uLkqo%A臜)彶Km>S?Q܏DR bHqW^[s%w ! `eے~!e >Dve 0+2[Y9ĨDr|]MHDD{K쑯PHO&:sS'i*b"1my-̀q|c8C ^+0[dkuGOm>TvĨ3~$ \kJ9V4^@ڹ^IV_AGr;c'يh(7_mˆhJ*kU6|D'6@ BTʫ}ܣER7a/ 5Rfm dKt\ yV6,c-7ՆlEbm7ӣL'|~Uv1[޻q)tŬ&/G;1l@H`ۃ=A/1`tۈ;D5bq$Y' MT7N}ģal7,.zě]$e䤍C!ۚhA:CIDAT&u!SSsHN4c+VXbŊ p:UZo(箲N,c~pzȯ@hkqpTD hd <΅xu#My2~2ϗ#?W|#^{nR2P2|וp)ͻJVʷRceKm^O+7F+g=|]_/qkяaWj?3O?ͥr[6>MXƟR N U8>zg\9/W#~ m1?DÌS'3g_\ʿ~)?Se@q瞗!W 6~aGmjƧ*卯9x9mv#tŊW~K~8L=Co}9ջLdT{z(qokNdr+z ^5w buce6gr"Զ> rώ6(lCsudlE.N@#xH6DOk;6$^pپzY5$֦QSt>h}ɞjBG "G%ٽNq8$UkFEdpK5w'N3a;Q@' 5ʉ3gZ:8C9pq>Pd؋A|Ή$_tp_R=O@\uL^>-7c1%;G-,r'0vFjy#bid(ﲱi0V;^#(˧'!oed,6j y|5mSl3)g y|P>(QΫy2ϳ0MDLAg12lD9MWHhX P ' 8 16y\0 5rAf_gbrqН 4eOh\4c+fEWPH5T-,ȑ$kڊPC1k>cwҠi,10A"NjQ0oo`Xb2l}q׋ƴbǞil+momǃMSe&P".AE-Q͋ @Jua|#\59Yq?ף:a#zL,ެ+VXbŊ/ԑ,^rn_!+˿N@8}}<9yV3FN8q@mWxSz5IXrכpoqb~/Ueue(Se}菖7m(÷?ۿio <$ ޴?rp%[n.#S~J2ވS+ 4Nnx2>C)\22*/R?Iڐx`S?- ˉ)kް#o,_uu9Dc I6r73pU})O7^[㋿ _{q% kog#;c5ăݘG;Wgyeh#Ybū qr(:.&nԵť9q/rm=b#qϝfg򅷽mKw86w>#AF>%ة\ :.ڪ36&9O<OqN_Q߉:?_9w479'|k>NyW89NGzS6ߣBl}6l0ǵOA<&[AM]shJۦom[|X4d,+Ddfēl HhrH2 T3e9hyG(iē2? }ژѐdLvzzp+VXb i#8_WK ;=Lʔ*#HWq-2o*RkտNo('d0IU"}NyRx{ eϿ'@uK^M_zz6& Vs>[\?^2\}U٦-\2N#h+_\)p>MyC?jO>U =nsj"7RNjuה@?, Wz;'JLn{&+krȕKe|gr*PW9;Wbc=Ř;H0tDrMƞ'סY[6@O1hwq{)!{?1&sA{!lyn.|+teMMg?I<ԽUsu5[DnYS+$u{tC<VAzmDDkIp}A ^xhȧNPOyɎl1FfMylsєb%3_]n41$3'}(! u~եgSk#i;1y^%:(гUR?}fc!2i}R˶;\&@rq<ұ˵9aG/ 3R}h+Lcao;Gu\fP}:~}=)v oe]]NUv(CgUW rD8݅}ۼ фΧh;] ܦY..f 8.Up#l9ay"*zI&&%[o]y4xrK 9CVG9z,.AFL2.Ꝧ% t^XbŊ+V\qN kAŧ#?ZC\gQ\᪫څs"hϕϾ~d| $qp ᩧR=+ÿwvs7%N >sK=2'opuNB9i2\8_FA'/(eउ>ġ\&u8WAK` /|V8qrN_U_YʓO kЇʅ+p~\'W>Z>Fܜpb!~זGJm/{[~n]yqĂ6ACZ_7NgD!_ .}Vv۾R+V\yHqf[.q=‡K\r)%P.EQPya4K 5ԖK 1J#Yh_uq`1Wq%†ccj M|ZV#^Ԏr0mS.l0l,&-UF'kOl#W9 'õI9b2eBvqDXf["EHD;8^Xe{(Pzvh>yqeNW :/1lEԋ(`6Ly0;"U}&Pq|}eHg)SAY3(d8ޝR~P[cI`)Y6z Os٠곥 0G~r8Qԇ# \#sb(˳]dQvO\|l1eZB>PrNCr?qu$v#ñ#xXj_P;zټX鳁D,;6GG?i5z'a;DUܳGԷv]&;6@ cf8/~NrAC9DO~ʶ7o| U8kQO'GcnR?֎+V,<^`/Ffc/E*U_sل}@_}S)c?.5fmۢkZqSѶe6ԇu39e7K 5ƣ"ƅE`hn|Ka_,#d] I X> SeyCCIm@MiCJVP"sϳ7#|Rxo5enU.VȝIbIxjLǠ<6X1(N/5.;A ]VO(}fr-rUmtIطA4a2'Sz 8R \)pG'b,̫$dSe5b@AXSu$~a8PR![Kt%"q 4KVji'?̓Xu5 A9xAS1~35eTRtzMT.N@rJ`bvbbŊ+VXr/ 97>Q+=M8_9;{ U$81cx9; Q' uW?z]~2 NvE6MZy2pb b8-MZy#e&|qͅkJWp|&N C$R>3|!ǵ{|3ږ3zkc7NS2Yz܌l#4CyYdR~̧d,嘙'yl46`6SːCxv褸V/c* yjNtb#1<&E2@ 8C592ITAzKa$B=Qw[""8^xlǩU8O>W.:ϗϜ-٫Jꂼ!iNNr67*=Y')^㰢V1~N?d*W-Α+Az]JP F9FB> vL!@/8GBc_+*{ Me]+b;;NN +k{sl`l'LA3"!tu$h3tI1Վ3橭h)j da6I>R7mTߵI&$iGܴnpPQ Q_JN ;G+D5V LQ`,Hk* ODR(# _L+:mNS>h uQRY,}qh{XaGVP=U>*)w`Lq[OK|n }ZEg-#1B5mecSN@ObGߑGAo0]6ц%y(/7ҺzejJD,ivTst"\H* !>6єd3XrP.TX1Q9xJ My׺d*s| 8aCl_ZC^_^/+VXbŊ x&Bppb-xSg<9u/Pʡ<@ګ8״0*{<`8!:2I ?>IWY\k S *&Zoc֧Δk'Ŷʰs5ZYG UP'\qP|NSOå &Nrȕ9?^mCCw2|#e g85E^l'}:m}6eR+_9٧5㐯$?֔Xmxhח?W2‰*c,Z[}E+Vx}1G5hbW"jLоH:gDN=}=fJ,-ۤa.,>*[PeqlV_93R3Z%M|zAS=Z@1~KF'xP^xK3ڶ|-t3\7#;Q|J|M5qBv;d?& (9%,m SNQ &́,JM=ё¶sNM0 6GC)x:y.hs8~aY!ER=QF`8QZ'ia0Ә!BYN z Εdc~1huLτLR{E+j4mHIKP &`PAqձ!H̉Zʼnd+MxYCQ,oA'1Q.&p\Gے์(t']lS)1C$Y5#HN'm"uT gCQP{mb LDSQ2/uQ&yAe]b ;KlhmS㐔o֗ A{2Ei+Z-zu݋ui{Hlc> YqѬN'qrڎFhЫѾꀹH85:A&i6, yo1@Xٽ~>Uqtle}+{+VXb<'Ν-g~FzN^{x9[~V !\`;x|4W$^t pnÇ>du| 'pp`ZO Z傯.G++~^q_AT|OR{&,\ubS#銧W]U`ǴZ?R_+exRyV9+L yM)oy ¾xR|ns ЇZʗst/},q?F]sN!}8eZk*RM)7Xt07VUyYEhy_ ~j_VO!a/SO+^]1nh3=G.ꑩBR/Ktȱ%)U}jQq?ېj>:]P‡Ŗvt ?>=2.Q\;E_5M8;A$*gcb8=]4^S#68fbՇ [<*s*H&.cPxd׊*=F~\9X { I//JT dYJ 'x brcs{z} ^$b`l59q'AD 'Ν)&:\9y#k2O,#W#U?xH>ہ\XS|;:䈾!=751dE&@\`F7rVX@~a |%@3E K2j>>DnRt 3u|+~8GN Y6YoK6-EY(cv`L,Rڑ/9ǃCggϜT>3o<C7邧CY/ܿWr"MaJ'yk7A^w606?ֹPIU>~8A#/sĜbʸ&l׽hDk>l߽rl\?zGXҷV벃cc+"D "?-2 |p쀈EƘ&>K?0s.R]/ӽ,@ƛ^`{6gԝԓ}|/ɻXhw)bl=gv貀vII_bŊ+Vx9/x!U)DoVzי|U:pAU 0r/XΞ+#c/or%s" !q1ϗ70F;n)٤ RP ڧMN`y}p뭟m\?XC//ዿ oLMH9]+??UĥlZm} *$ J r^ Xev0Óu'i8镊gO|:|-ه~@Y%$50^˫ΡAro_|#TB:q6eX.c֧A ڽIߚ<1gƕ/=|T:^ YLr?{Vzm(g 傷 jҧ+eK/mۺ|AjohŊ+VX>G(=8aSҤ~™꼓)tnz/ZyxNJݷ~NJ3e|R~'xה ?r @qu얯9pURzF+x *|5':Y',Ce?۰_#1MX"~u׌ w_F"䶷h2τPm;_N7~c;yT <'*[j6G|Vտ !ה[&i+{4[p"SvœO)'(nt9ɆX:#zK $\ o= 7ۢI+y2~[FȾu[? ="[7+Vxe UrQ )7d3oЯ6:2GnEŴ7 jh(~}ף˶=&q:C G|Yb L<|, m^vk^9@zP:PL`iLmC_$͆7'mD!οIF㩃reNNgNdYO]++Mj=DgU)O~l?pDHNÏ&)h!A$2/t$sJԃXt qנ{ >)ʬm'#icmW7S^,68"H~hSvзO(b>kn!y=bz5E캼l}bH#œƅ)w,]ċxrAe=vZ('Ҡg}A{…Qtu}/L/Ey6xbt]~p5&rlF|N̲L&yV6(@382Bp/ VˈÐěT'EA;Tx+VXbŊ}#Wx2q\=(uו+I?|9'$yϹC{kI-uKjdI2-ɖym<$CƓll~}ld>xުU7s֎kX;#=Ǔ{z2-_W1 D ٴxܔ#oR?cT`@euy[!Ԋ+D0+s)݀|}q%l3/~/Wԛ[ Ja>A /bLH׵*-NpM4N7K?YDO €}AY?Vvs9#(O}||=6|McNϖvҽ_$']s|E [y>*TX`[<k{>(`~7x0 }|+ c7OSЎZwzȾ46^8 g-bjh-h+0^g0+uكiĦ7ڦ0'_ݞ_SP_bkkuM" <ВؖB7^3 ʺ-bRoc>c~ě1;:"O@',X` ,X|h o0 3|s\Kqv`p_W}!"-xj +RjYq }Tʊl^vtkRq~ew(XcWנ V=/o_4; x{K|ޔbW73-A!\+OPwO>iBw*ҽ򲮚>llL/._)|#2-O 66̟+!"dKF9sOʧP,CR0G@^f eʰc=xѹ:w@z!hu{1tK;0ӖkD?35 i1Mh}<_eYy x+#:΂8EVWuTG绬R"C.#:TQ϶hCgxyXc,kv^S @ "l3qj8FuL%\ (+HKSl]}OM{>>hsW@}[p՟q`83O*%Qe{}h*uRmtcek×-60lVԙЛ@ z#15,F3mÔTX͓uy5 fY}z#]^6y:ESkvaJwZLȴ񔌩F~WyS,X` Ĺ _MKårtG'R_V:ng*|opAVyH|Hp5N\WpՈz׭p%&ly_U_Qc/c?Ysϗ‹do(#FtRʗ}ӥ)'~ږ;flw+30K#+U d>Alq7x3/nHq\>2آ=[`L:\;lY_%^y׻J'>\.cܿ/j=Gx38%6c ] ƿtXΗ?9aG,߯c|q^x ni؁9?aܳso,X Beچf dqYzO6&oNO2hmWfusslآ?S >OQ+N3mƟ]|NL7<1+K&`v#v1l ?[ب}nXk~r^_l*<ΘqpHu +a'Γ*rZ{)M1! TyaS1,16*؆uc|TjG. sjDIZp~WG2H x_qeKr0ϕ:p.NYp?5sv zx:><>)3+Zu8_G_d19PΈ:9G7AKu_P2, pj7xLD&w gmCwDF-Dk'˦~AsEnlKCs{;^?IthOvB;⣒K#:;O!?}L4ehFcDJA+ߔ )6ؘLNhDmidO w:u'h'z#&42}݅9>"nέ11Vmgپnaݞo ,X` ^D\A 8^-FMFZ+-Znׯ)`Ig_r󆝛BO5_)Vk;9P :]?hYܟSCQ+yth,A"|ǿJtӟ/@)_kVQt|ގ`KW7e,gkp%׬ߩU=.]@1V:~vq8pp{$W1f?CZiC~9"H#X+16A4lgSO 91աV0)ח򫾥?_#p KtB!{FY1mg[7(A;'/f\g|seU@`N1 aL߂ zvvN{(G٨4YPˎd}1r U}OxFwrusjk;cmfw(+?k3>t27+o\m{6τsK27V.t'i`OM6qZ >2#42ujk|TYvN&/nIm2<S],T1ȓpPWD)rՍ8k+9D@h|@lFͣ-X&OQ?K`Q&Hf.@hXflKBF0~b7Ib n6>s; A'<߃ z`o^']sU+WJE{1玲/?[O_xjS?G1EڀAOq~cw)0D?kn|\9Ys gd'Ko5*~ǹ~cw_={ޜ|%;sk  -nlx %oq$1fB Vy |+]O{Vnǩ [ck\*x D{sdMˇl0Zao5::;|P<U;>{n&$I*p _(h4dc$4OPϪS~D6x;@hP,DE"HAGou!)#9+($̻-ۺ eOc_D`ZP8𜙫^VܟX9׬\*| V +#O5IIeh9qLj Y=xGY:NRP>Qʈ>1OӿsX>pu9w;=y'm O_> mo &MXO3Xۆ{1vst S7,c` ,xʕz!aёtO~̮._*H J:?Wd` ޽* ?&,W-D d~R7R|W wtlS+\:lPZ_0a  Sfc\X;noM`mB)L:$%X{1l@"{#d_oJcg{僌tT[>fwG[PB46UGYvBrSxu*ȚW S.(y|PƳ]eZX{C tc0wA'\3pK@O\+pU^pu yqm. \5[&WIsٔd;\ R_mZ$xSr "?Ne"#ʼ^%8 sx ~n u'W`>S74.#[$/ǫZC}OJ _9U;)if.1P٧ml惸d+;s(^x^+H_yU RL޴!3ݎWg,5bgW2q.6ÿJWP7=p?o(~SK7R~'YKodg>[O~\:S?_ڍ ,؁cbgrfPm~;lx|.oɖ~7bC&#@7O۱ vg@^6}5ṅƬIVN'TBk?Y-R^8-WozഁSWmmoogfvuTt|&Y}mlwπ<D؋[m)@d+_#/!2\+!ϱ'imhEydqޡj ~jWa>WkVNp~r)/f@8ي4\E1gC]" !p*x)vXf Ǐ7yYe5>I6R<2ig<ؗ ׯ9#|  .uG|\H\=u/|x[W:-%QyEZX& YlFT-A16 L[ԷǕo3Q?EѦs #L$M 1/΢3_#LgB z*wװxOҾy8{fg0wK`ɬ*h SGn Ͷ=eQ1! Tۍ?߼W r~ ,XNTVMB.{ NMN^l2![u8_ؿJB{~9FYpzYOi}{FGQׯ_ w+C>Ex^Ӻ{O?U 0Z%@E'm ^\\_,c|_kVϛǸF?$w򳿦6ɠ :t}(CأO -]){dtq5g+kts}IGVxJJǕJ1ycj& ^ፔR~Ɨ/*/e{Rğ*Z-t ysgJ28}׼\_X]jx: ~׾L-XM| oܮ ʀ=ȶMLtFשּq1i(#l3 sr Ip\:> ;u 6ncCZK>9;w{)"Q.:?DٔهLp2Ҹ06syƇ9ThONa5FdGoJȻ~+Y`;+WH9VT /L`zsD,ZEYhQO!cgQyNA-fu\>JDV uȓGQeS;OA oQr ~ Nka(}4SdkL?+Bn>IgB&am"fkcfk)C&#aW^d'DLW@WS |Qaʷ䟐lm 魄ע;1nynX{*s4Z݅}͏}7)HDUv,X` (7xS򕲾pO/En(k^ㅗW䵊Ƌ/+pa|3ƛ: 6xu\vqJypӥ|cƻ-zNE?^z^ވ<&WҽLx*=_"`C7ž =Wk? ۊhJ#_JݠpW^J,l|ひJ__11c@?Xʿs OJwj[:#?@ ;-`|wKG>Z/r `>E|_POoz?R|G)/?V~7Kg>g>xSswt?U+n2ܷz ,xw:Dw5Aˆ6/*oC٧͸yжMg'|k!%z~)o8!?*1Oۢ:YIPO~ ]c8dE60j#cNgl% \)uc2t&D~rIm/Iz(ީSi&"pkvnuGY+i 6DJ`+"e/Rn*% |+nd8N@}Ye*ܶ,D-%N|@l} ЫW@.Z :p zsuSԇW} +d6~0^Ye0V$I5hOc{tg 5+'P`\;]#m+r,}þl `lMuZ Cvc_ 7AXzeycv F۔5nm}-!1卼St۾N-힥4jYE𭝱n?8WlIQSqJN $ @&twvVھG0$ r~hX^.TI o {s;iɳDG42.7 TҁTd`AU:"#L A|8~@3ض11+;?1%L#ʅfܠ,v.VDMeS$Vn&B6x"|~xlݢ_` ,szp^.||l\K ?+KWث7x}/֔g})[!Jl7lFh42U׿]E?\+J0Kls) MMR?#q}&p'(08&|^+\]W)ݯե~t7J=gJͿt]z^wT{ﵛj?åVx{K-co+ݿo|?kJ/RGHo%e˾toW`8 MÞcԧ _{B?4 M~hNN,8sڿB?)߅s;``9wvOiotG?k5:CېȪ/$/' &E'"z<Ћꪐ9hh>eY)o:GJV?& o$JԂ3#?< l!džyEjow^z|o`KnA21[y~͡=g{ˡR4)0sD>=U6}&6xUh}g O"6 _yQf*Jv[~#k9D-@C2uc{Xk azPo p>4/ ) gJDoe[Z>*cǥ29@$f  ``!v<Yvwp*qMR $RPTH3hm[r扼<x,>A$?c!(2adڋxk-=oxG5 mX9ΩamhDNEVA;;'zE+z 풍iX?O!guB3 "U<=m\ Gë3Ķ&} #l n0!m6;6F>K;ADنe xĞ3q(Q|ש~`3MWvH:;䑰mW9BW2_1|q#ڂ }Dy݆ A{AVqDܷgn:2ٴ}%D0*F1Mf ۗp,Duc\ N}ie8ZFqYnĨC8lLI< rjUES_TWWD్/lkm#؞6ܷ/tIs%d#Rԅ `MlsqV[y?u/?(lYhu9FG8 IR.i ,X&_P^^K(qtz} >S';ҙWޮz- 7)aэ-Iy-{^∀ oG7"[R~U}t2ײ5"|eاO?U:+P>cR)xg}湊ƅZ/R~o.q)Jߥ\}'K_~O>vcS*-^_=fR(j[J[/ v?qWU/u7<`A2Ʒ{Q{.ca//*F$#fÈZc4ǔg?  A}3Q)~[fA*Xu@-Ljh D|bf<^׻{$H2O'?r|@Cb>Fc|f3!G ON2o"ڤ_>p "F2fIe7;tiZ\ ]0'<)7Ds`$?C;u>TNecv&ԟD#h!X6qR:F ؀XX T~uh`V˼g>uK +m}_sbH^x渻ݼ_n/QrS)ɶEQ-Q\€seիU +Tc -b@G,7'n<<)@'ضHk\cµGwŲk3P DP(lz S}D,<)hjbF +4Ù>S;lRԇ Vhckΰ4ݭWQvl|oa'lz9G2ukKOH9b,8xyd@ w:<g*zŀw*IP=8N1V$/i'JCZ 1s^D${ E_+o(͛:K݄ g,k甏GNd:ױwQ@yS`?q2 gސcs/R ƃ&Kr48Vz4cϓ$g_9G` 1σ2a6PKa3cLUm4oP+Ȩu`vA'-cYbsCq%UG{$΋:MF#-X%b Uip&1ж99d 6:։X._WlUFs15`_o$~ZV>ruxl3jԑgƋB 8j.g2~RPIOZ~8^`]܂2^y-X&OWw[:xRmSz (]}{\I_~YSu= ;,/Յ{K/Xe}kK<޲o//RخnxmB \V_-z3Q08?(7}ch9)O^ڮ;&T7W+Dx))GH>/ZVjK HZWf+t}FA#òmgW7ʲg=w< rBމYrGF”˛7a<{ZY?tY}⓺_0OtORO?gKʫ|_PPv++c~÷O}l-Xp _o!|_Sx+?bׯ6y#=F9'R`'tn `;l3CFuX?eyo'bW6zD"oDCQ1|bdPH6vY|1>F6nHC ,l2A05N^6 ί:,&Yb-7 =62- |jQ 6}='Uq8u ==6&=ϯIn$Y.?v09*_JY =&0ĸ]1O2>~9;$5/I9|<#3*n _L-d')om[s>O#yL^/A#K$}cbNR%Uv˪[.TT}yl>yAuS^kx=:COIur( ieFHYWc$]ɰ̊U髗7|b QzYWP7tJ3u~m$2稓/< \+=}Gs|rS{&`xm=ӤR 틨kt)KP0R>Ava3?6|IǤ,+5>$}mEm6386UdSSgPcQ֍\?%ʨhḙZum<ˋ Sgn7R` Ol@t/n6C{j7I@t#߀2^ڸZa{6(pUHM9`zx~8zX)Ԥ(ہ6:[4Y`hi‘oiLmdcaP^` ,q./&ݸ^ʥ˥}9S<0WtJt.W}olx)/:á \h?ޔ<ӒկھK$w0vO ƕeGе_Y@ /Z1'~RZqDR~'lL?RU羷ٟ.+7Ro./oWJoR?ZwRP_KK0:Xj^8M q8̟-elcKke3X " 97Čo ZDyjniS]2|y#-62m>:hk.긾hBl+jOD*䨲~hev?Ә<| =tO$&@T _؏ ";mV?O9ⵍ'juATͲ)mZ\ ]@gh{'rmϸ~[;(+\.//{."XV\ "|JW8>} E5H}@ia'].Ec ^*W"4iogW =!H7.Y1FVpvepFY^?,Ue;"0v:ӕU&6'ǀ,SxY#rr# MFsԝm)?9M6!q6j/O6]bNuҀøۋv?uf  ^Xʡ]PbRD8,qw`Yc $k5t]_SWu%|%qW?T{cWv+J_3ʃ З?]ʿKߧ}l.SO|t|o,$^q|?T~xtO?Sw Y_Y3(Jr 飏[~ ˥{?SgJǕ48f jի j+WdXfS^x C3f7(Y/.|r7xY>sJxkvl |o*&"*qSѯpj>ek6B ;%x8ʷ%< ٢H$Ay , voD̋^>GյH'{`As_]ӥ3J8fSxC[DY _p~ae+NB*@ؔב5 9[62$?RW^xK ޚl|CV/o/!6?y}vCesS+pl8Vd`2 }c[1|~%vT?,`T?W:upW}Z_ [|֜g^cf|y|<_^TyLSn/kP3e'v1 skcΆ[m/CFAGl}N)R~<ۉ6,iѲէl;Lyyh3VL5̃?+]̺Ai5 l% aa.dmj?KkXYeN+e /{(6:Ѿ|e:J ĸWR25AG5{9mSǘYn/gԳ|y^*8_v|X~u[F;aOJuYh۶oUPCj|p &{,G~־g9b@y3=ޞ+&#l@5h۝nBV F} tb 0A˰sXlf8;rf2ӵ `+b~o#S¬LqBt8Qg Xnqw` Xoҝ?_?J;5{_ ܃Jݥ)x{KYUC7~a)C) (Y_UK/'J-_{U&xtWKr%Pϯx1{pP^=~I}xto_8ݰ~0p0x)I8V["p)b z=To({]?K~]>qd`~,8s]ȕDA?b?tt*_}xU+yƣ?>)+!.'&wd)1<Q@{^2# paǗ}h2 @ 7С]TCPek.}) _}Jys+^1TsG6JJ#ud ?ڧA7m62txo 'm\*mLw|shaiξvFEʇ,q#>T`jU],MQeQG)ݜF=m S'ٯ`}kqt7:u cGb^OR۶|~M8S2.%E3ȋzkt,z!|+ Qμ^1m xCt&W,>Fl2#eP1 DcM$(˲)ҿx;TDg3BW=z$fuqmך$]SO9sN1y:.8"@Cr]/m! :~G Gr_m(h9}݆mbYG3hAzٱ鳷5ю:9/[B*܎dccYBا6h(A֠GP>z3p(Iўe6LPf=wIOp=`?[s pJ?c@I :>1phS9%n}o/tuv<9i4!HDW*^@Su|U95|݊+O$$tW-I_V{c|ן*R KaeRz_T˗qLiB' .xkdyyïC&+_h-$ٸJ۩,n amkPA1ohsm ) h~q~)8cқ辟m+Tڒ !XO,o7Jv Ƞۉ:rG'>$" ֚)Ǵ'lI$asʌ'i6Ea_[hnˑ&g>52,}WJ}/ne[;D܈mq\]}3hSM HW@Yw5\RV`?rG?F{۰@Kr^7)/Sy*d&@똻^ `F0}Q\7} ;isǀz,pێ}AYIS42 2LC(8'yF؟]M8胷m$/y4"TkȄ}K}K[l'A`Ơ,CO1B#1ԩqf񉆪(v0srZ͍[>~B;Q@S_ {`crQGi*2/o7,=%`CŞ2N3[ϻ9-M&#7 Ե|l(γ6 ܑrh>c$_1ILtYO > ;|!Ɓ+`•,7m5?b+p|0Vs͕-@B'G>M_Tp `_,Iq"ȆMs;a0NI/.ƣ+j. }/?#/5_,V x~u2#m@4qlw7}8VQ}c RLj}HW@q dO| >ǎmNU<þv}rK oC\j% Gω:~YSrs s"E`cO1`]q%Q_Xmʈ9 _KπKK:oiPmE0fIUȏG9P.y fM9gb#/ODr.FzM*:2%Y&1'㛷4r#?vdI]`SyJ^Z.Fyٖm*mȄG*^J#s>Irgszy$DDVURf<=@4} >gp9!a'V_k'lZqik';KJ W @㝷jxԾ|{lq kuIU5Rُ< eWNeȈ]bN2+`[{ن ǵ&Wе;zP̼dn(Z҂8 'ڀ]ى5GXd; ܞRn;q `s6)'v2귨T'ֲ0Q dk2?>&dѯʟ輒 rKshH8.HYq|=^miJ.'mjvhSPךsDp{yWpD jY}ΖLK?Ou=)Op,Xpa ;p,x+__s/ ⋥_[?|.\0y@J:ϱ@Z{:=iu0/xM`u `ֽVЍ)ǚ7 ׸^_sBzgY=V/V?'Jg'd{}e?K/ +WO5C86lGJ|}8ƄEO=Vb*[]8_79>vA?NA|[.h!:pϠ ]@9V.s_@7)xb\x߱K>w`W?R>|wxg)B|^ysrw%~f馴Æo.3BDT9Nz4Nn?jP\:TPA<ʲ"ًPh|g ,# aXڜQ3w\o6HYervkCM;qJʨ8¨1GDpy : v)3[m|{>5Ʊ=SC[ʼn:'<@@ɲ# ȎxcB;fs9  ,:yBuhdqvϲ_8>g|8vӈ2%[!cy}`66 0_S[#nQOQS~/J/':<ǝ,յ의>+T K+<)f=: +v5r+A,6PPAs¶x u>u?Aj/,+%bLZRx>QUmi\l'q?f?y@)rqm:{eĔ^mab|FAaKM'c b.Lkd8/^oSAUV67C;?:n&5 6>^m8)yڝfDe ]@]6WE|$mtcڏ쫷n4yz%rND F,wozRזS.AWJO_|oc7Jy?`s}Japɷs|W1y )o^'sQ/=Hqxs6Q緜 X8\ʐyo LWDA)+HonFð^Ƒd?3D ɹ?|?G4NS5bT|l738p(Z*-p|"VRPMfҀͧx"Q#^Խ'04T6s.7$3 A50s쓲nc pd+WdAy{΄Jg|mf dS1๠2*1Qȇ5)51S1656!Mv'\$7@[lf)[5m}$鹐P̀jy d\N֝ ysV_Q |ҡU!<4ڰ+, $l HL; KhTȏ:GP_[Qye0EAA/' $K>1gS˯Np=kdp@=p{ vkX*pdJ֖ XFV@j}ys7*6BY @Ymf`۰c/QJ9I&3u;~͒ s!|. jfD%`ݴ[_ineg !o&#|dр&ÿ̠~ܖ*tA`m#tOM YfLm,.D۔t2f" /Xfa]m.o{nSc>oIqbO9e|˶*6&v=p8|sېqp yU6>@6jܗ F,woj\E7Xj3?3O>YU\)#L.s[0g>[֟yZ!Npϖ*\bM^Ε{#~lps L>ҽݥm0R> W(0]s>+=1Ο/+qZE[ck5-=PO_ >GsE CK[KJڃf}T.NTދ~]tǓㅼ$[ma"Y^ڭ?Əg̩ր#TޔkB;$ڑ- 0S{qS۶1T$ zљD?d|ʘ k 1aTd٠jVvk35S^j\W̸s^)XR+m N?)+tp|[Cs'i\* _T >AF1##9S/'_Y  wS`n5jxX'U#w+v7[mYPv+fX\#d dwraJ m+/?Yg< v]oz~Ն=pP_,ė)vMpYfO1!&'"s'H&vo6geðF,^4vDƚNa9bNN >8%@1' H-'):. ܍X8, XJ{t? iS] B8zRKw霧zVx?^Ks o_Z%|q0?#c/`)` B ]^ |[WP|muqeW+\X>T<]RC>tI{5ϔס>+c+{KcO!_)߸QE\v}O zu%r0cćH=_B_/]ƘL+o*x+^<L SL4S~a6suIHmUDte]1R킂3SAm 8י !C]\ok;OC xиxކd qɆ:jf3:~LC9ۜӊ=8O fWim7E[V1jnW c;hHcQ8::L І#ڬ7i8K͌$Qg-.|ըeWq& HeMFiHc{z2Dn!m oy$!X:>;xDExX54Vo.su#КD]+ $p,3oW>yp~z!8(|?<+eg@BSp&hk+WME;Novi %1z䋌UڬcAt`i 7x]ԉU7~nk*b[#o'׆߬6a3㰩hdUpBfjC|ʞyP8mTفLpYf B;ecZp܆[]m7Uڹ./ܙ8`YD{o: r}v(R MXj ?A`݈%M E? ``_חf|R^~YdwѯnЪ}RKt4)(QQ`g.e-3WЪ? <^yUA"kX=p)/`ڴzVx;c>R~GJ_Pŋ;?wY,g{] ,^/&.nwRY?b) ::ĵ>?W)_R|)Q?HK|O) Phg`M玀>xΨkSpu a' ,8%wtl!?27ox9ij~=x>5,DzPgk)19v՚t-/zb6E+D+x6gU80k)@[qPU>v/R u]C1u^hs8C$#/o7ʄXm(2L]am۶7/>!r^7a) ae 5Zu.;@f 0 8 0$g.x S,^V6_Q?gԦ2*tC?$~v= 67ׇ݂m`S}#섚)YA^U/J@/&<##5Qz#6B$Fб'^f,V4K?S? keڇtjLpmK̨┝W57\ֳ/3`GR*<z>ne޴B^Ma #2RZ+p(ou1oڜ2+y7EHqy?}M0lK3a0%7FNcma9+`jc.^ӱdcҹI JƷ8v7n?>mC ny:Gf,8̓͠ mNf@ZATJ^ ÎKǂw#Kǂ7=pβrWoMLtS+psD|^.WKמ³;8rxtWJGKs n,=|7o矷\7 &8)BWBv\ieTӸ\)3ߨ΍cna|{80@W:x D<|5U}e!>71L ࠼͟a-)B=1OJf7B69댶5هjSG xOƔ>$ڬ|ׇ]<c\nYnFdTlcnTUB`EpbT?GC=[!hΐ:VC⏞]%,5Oܔ"}!g7Z X[íoVGVU~13xIQ]ˍ ^YCA5y!43 fxe>W=9?tٔJ(2O`\_9.ves}1O6>1|b9X-u@qܾ uDzSYs8ǹsz?\ B y;:nN:!pm:U3c Qc&ದ٠(|4 Ӵґu`p3# V8A<&ĄS}"igї-bBnTl-t6AלMB9xl;ēRss ÎN@ F,woz{Joefo"`,pVЫ@p^3t/TyJO](yקŋeQvś >Pq~J k]?JpuGȃM{K _V3|W7V)>ZK ҿm{E  G`/u&ׁLI:sL;^`n EI΂t Ǯ8(1kt}0ئú 47ѵ6RٷzK[q<اE}+pXV8X/ ʹ(U[50c>?z۠6I-Ciե(x~oU]CrYڬ2'?oƊ/!)JasHiein5ږGco I1&t ׵s?Gv_o@6 h,y&cӆ qv-v-vg#ZmMա-rml6g^?u0QƏ22C3@&1#&a{1.>Yt>&M OkJ0 1φ\u+.j0IJyಏA''=Wob`!X!} [F} )R0ac%M4Fh? Uq=?`[x |/R8i5# ey}8ضNjJm1 X. _qd?_Ѷ2m IPq{arG%NAc w_X;ls^39?S8Zy;u܌]A=s}& fƕmߧc;=%;=v ^oWS^7ʺ=e)M M+e^ 51y8P@WNo  +J`Q'I t;;yZΔZمy>E1-_8KP=;s YOOr- @ɤNSb_M?!m2y [s`Yղ\m mfXfvc_mAT}58x`݆%M~?JR{K|ȋ/'?>%|M o}ه~ZBA|= h/);<3+9+Ry؂:+J׎]ᏖrF))?ewozc?> ޣ k\sōe4ڄi燺D:c,Xf[3g270\0;ġ)5옧C u :"۱jؐm~)&p{YPC:|㱎D2) D1~/P@Bj!۩}vK  ݱg۴m`g然- 8*3QyjT?E^cKR6 aOW,ߌzmcI;nM6T9v;c>ghwt`2mV[@d RcBGV'T5,7Vvڇf!ѯӐFdN'<*hXSԴv9}bG4B^3&elo60洽;+M')QW >$3a)1L.-~pk2/ A() HU0Gx}9X.S_i| ѮR9 *jٚR"GOSVYA.>o4!EGøƁ|*#_Ƴ$=(l3e ^s ]#K\]:A9@]<uG^'TC$ 5CB:۶{59Alx1VT]=p'ƧrZLe=QQClTXuT{HZ\?Aqq1E\Os;~dv-e{<1m685$!t)Fh6]z-f5N`n ;/`欞vנ>F~v&m}/VOC^Ƹ4gymR'-vL S]c:~ձT̸lyY`Yč*qbp,Xpa ;p,xS>|-^s[ݤדܼi4yM ӛ7Jw5=_r|\jM\xs_ťq*߮4㯖ז{/(wOY\x;A/#}=T%ؤ?9/7P,Xpă?Ƿx_r(x$un6Ze^zFt)9UoȷzuA<1.dcج'MR7>c).ѝ9-@,)9:_2$urw1#onc2'-d~ϔlg$ú(;n8$<{h]`d>aL"jD8ngĜM~S}2 { 'LO lZGA77|t4T9NU&u^g23ʵ~>!1؝4"s:yȀԬʩ\_925 lo卫km"Botmh}ugUH>@bc ypTxǘz4J븝XNn3Ѐy @3V(2eFEUOⱵArhđPb?vE6_(T^0A$2|V Um~@!~/U* fE&5똧/Vo^2@X%sj='ȝ }Ju:p o Oz̎mME|pd&,߾~P.|о4֨23jy/-"Taǭa =!T> 'aZmtkeUV6e9GD?'iYj!p`uqb#F o7Ltk#Z=i:ݙ> I:57;`P;sm~L5ncjǺ^!,f}yɏ Hgʏ\Otj.Z^FրɤtjZp2Fdݚ__]8,˰pX8١sKxP_J=7rł5yt|}-Ð{}ӞW菂dK)J=Wʥ˥+Q`zPB:˕=\ D?quFn,X`v%8j q] Њ:E%ukԫ!*y%+ [khvaݷЕFammd)i'j='e_}) )!ؠ>9ݸh﵄Э3f&ꢝ@S}r5k>egdk ./R4vOb3_C= p'> a@[vFr>&0!?1a϶OGc84WJ-|11YTOb=IK ti1j ʏ3E}'`v!+ȜNk:p,Ωl SmNօďl+mH'yO|E1yR*,8}"KՁ? `5e47,8/0}C6,0ZfXo {j3RM1ԟA*tC\?n,gkD7x`5Vc=n:J^V1 $/SWA OXR._RNn8x|,+uD@6LaKvC߈ -σgg8^hg%Yi7mP|3)[2β+LmW>l Y"3e^=F>QO$KuʺLTnۚk/r[g$S1jgFm9 X.W?z⌏sۑuHjCO^ɱ-|ʔ5)U> ra60NIo i΢05qfjBL ܦǤ\njújlf!.|>3M~l@bcq 0}NL&ͦP%#ى`݈%-B/ϥc=A[RyX{+j'K++z.6tgWGG|x[,X`[2m$r8p笒7u1Ia Dy 8.|}*jZXm]9ٸ֖w-sMvQg-X>PfY{Sg`|??qvH!Bw"#}/ao6٥[\0r[}B[.=vE9/Tf7@>} |;$Yב, T'TIG3g,!Pz6Hר((9Oi)*Eɔ,ZyjAޕ8.C!:ZĖ&["0: h. ; N]XV`>RE܀uckruPm垲QNÔ>T Ϣx1_}>$a Z]hyZϴ@JrY =jBʓhg",`5 =V9(Q39z\Z1 ^G:>c"m{SgB2˄'lyx{JxڗϬ r/mkmǷiyG >D|OfmqoPQwʊڈVlAzmSpLr|-Ǽôԏ⪪׽8f{79ϏJF󺞜T0ס &Ve~yFMPL-ta'"=! f;g-P WFm1O!O^׀ln֍ 2*07`TͶ~+Q3뼏:eaaVe 0EX&UG9 ʲ~&& oV$f5g5 ܄|$7ǏaҸ+'|P 6aBva80V=KEOr׌_Oa*uo@3c2Zm 1{Hs00dSI;8発ړq!*27W伎L9u$uNP^*l8 ȇ~%^%6=IUY=ֵ*<CU : QviT+(쐪rj A%c<,0p8}|>u <π\1#`706`+j2>TN0f F~'os, 0Y:Vc9&c,YdĜ%{7t\ t:.m0%߂٭m;B$m$ad{K;Ŝd(`<{]_fAk} .<@rl@cy&?p;+Ouh,;@;hP#y>c wb6ovmvC:-`=×%; 穱ӾEjEն kv}j@:Y=~̝Do.*շ۶  &7j0YF2=u%c K݁%c[:} V x{~q)|m mA|] |_E qT7nH:׼Ϊ< d"~$xT[f׮iL#5Y:>v ~4B!(L!Oˑy;jCvGpZ15 DLZFElgmjΛ9y?*|lP*쁔l$' ?3$ 8f,JmNmv_R.;6ρ_AƏa;e3vp$te;Q@FGi@Ui{ dm1 C}}'@~9~F#|Ang0a35Ƕ{@[mKP *؀"O!?Ͳ>Yt@֏<(ȼ*Vd%KR eYu2!RI^ )N JYFqg'LA(?:a U!"'j<Ъ|s S_}H9\9| SB06c (WπouȐkShoZG:t W68HҪ!#ԇuuL<6f}7GN^KЕk8r+񋀔 ,X`w(p` ,88W;wtAzOY]TVKK+]{rreu}| (:F5-i j7_CZ5~FL}(}]#2-r^@=DVv9lowQUD+xFY@||:VF]@}M8BnTBی_Iɩ07f?j>Ӡz"iVpJjV*#n-v@[6։d(0OsNMH2 #mpw6z1@|Wu"6.DБ|倓xr-'LA`\ӝ\XËs8_:WV%^ sGsסTK{ Y4/(LDLjONǾFp~C!眐T&ӠCU}A8_Ĺ'#9\@<+;_Yuiwv F&|sN.ʢ(}!gg'QL<1<9q.KŁ5VfJY莾;s{: !m2\shK>4S}yK(;)EGh)L2+24 7y+:Ń D4ܨatPӁ6nPC[*g?f}5ivݳ`4iɕgqʶ>ԧWu l}\'kQ:Y'htL}FsYΪezvbԟ5~mv\~/v=vGY}u!:\2z  eXV;` ܹxKB}nwʊ7uf?(nb Ntj\a|5-Wut#k[^`޼2^ eK{UVgJG\O}O)/+pށjGBĨ-ɶacfB_EٛG@?|w6[ٌIW)_ï5[SuuږoBȧ1;4ε6#կ\<ț|Pe Dﳂ6}ɺ1b[6 94~1:y_}#߯ouuYn'ϼLk๏̧⸎2Jd}GQTQ3qaݴec1:>vnϾ~Qu8QNωFڮT%[ۍ?&&|و ZȏPI0-quL?ltzrJ^G?X ro٪Ӧ>"WIIrKt?ShDoxlBP)+ΰTƁq D=''VJh' @@|9"N=!axMYn8`;Elv,!{#bsB,uY/>*46J;Q"JG( me~)9JTr瑾 cCS?7u=f&/hLavZ^My~TpSN=N㋡Ђ$:6f#$6HɧjK6ܡ> !"t}?ofh<6B: 7:hߡ(d\֖ 9}xHfþr$<PV}t|WsK8FvYllL(q|95fČvmv!F:iL!Euj-ڦۙc.r ,X` ,XV{<=U9ŧA9@89sJwRY]\_+t  ҁ E_C!|ċZ*<€+Rfec)ᕲv=Ngw@ĵ#sPP[ 8iV.jm&i)da5 o#߉i[2*Lϴ'j[s63M` rj?6Nثu~>QmucTgYNQ`'>`d#N*en Oh؊Vѓ-hGՇ`Jo=0矸0y;MX[e򝈜7o&0+o ~҄A9bJSԵ M@:nC-Yj J!O=*`im eX衊Թ]p+ו}澃u%rscA*ec :@1ezOu9y1þ--zSSm:b2a<_|)y"M+tSJs}r @>Jm|\ t~X ltyw2V:Xyg3:?` Ӥqf7u϶> &&md?}pw&{8mqψq*cHFZQ̺ mǰƜKk'nn= duJ1l>>$lb'f,-ǡ8P^sh0fJ?ǂw8,+p,X`w.ޚ+p޺\:׷/V4^2/^/y_$Vp"O+w]q/I鿎e| C[B@W.Sd◮ޗgIdݯ0Ed5@Qio,ԺԷ@#l%χ2mx:g|/%fݐ^omR3[mR j-Kr\]r{l eGz&j3{>O|$㶳M·ꭍ=DK+HZv *Hu.:X$G7)>%D!< ]s1?6x-:RO5MmՌYU&+H!Xqq/Qb~ L:6j̸Fmgd띍M vݰY??\Xr~n! (FG,>UJ4V&_wHy av c =DE>hpU .8q ?^+6Ҿ8>ƹ@@NŸ1O9AnP8V +!Oh#h\/+>R# `P&zv6:N|2?)YF:n5x2+pU79<bl6)GħG8dsed0 0C_l%r|68Icc:Rй-X!:B= 2#:(實 lԻNE>>c@#on8O<]+Z]= hEdmebsC;>W?]3'H NVHrUx~A䉿!z{"ЗFi5:b4͛U lӱ^v}10+{sܒS s}&1uNܸ.^[_Yz é a=}6ҽ襃{ΕG/+_XCg7 \w7AGp se a*| 9"ԉI-)SD0 ^.OxJRu:e 1…qp>A:<:ƹ y\Cp8qUQѸV@[KRrJtΠO!2Yc-}fP+mư ӕ,_mπs!e/ʮ)?H\wKFcĜ4N\|*zVslDԁ|C0O,?y <&[N߆MODtxL-o ,X` ,Ewzy/YCQKLH_WRv# 7/KsW=P?H9CݥKwϽkX:dp_}F2o#x" {tΨ H H+0e9uB%Ԙ큺Ir|Ȁ_3H[+AnݠxZHfE _PGFm:{Nw[Nxc974c̦ٯĶt+v_ӱȗ3co;4׵}w: ޾lTN}'t)ވ 1E9p hGr :~!^%QGE‡<Mj'hS%k$| M ;3s0Pz?gYIuC._(~8y⪼Aysm#?K{ʕ]-UM6Σ#yà pBZe"kt|O2|}y#Ch< |^H`\P{00A<`.z`rU*2_bA$خG"hrdb=;n^G~C"I tFj%ߦ*ۂPAr:Wggcc0f\2F9?E<9eS:8DLS|njG{c>V>5&:Vx0ҝcv&C;-m爸 ,X` ,XL36L.5g Wh<+'rrp+eurprprxCĕ;+{KxnW)_UF9ӃWM =А7A^Aۋ-k.FH7IF6<6trmD[}Lݗ\r\bl?UG>s@+e[a (cJ\NTm:6v6Chw#9n <ޜj_6$ߑlMUBmgçWU_Y Nٗ 2'LU8=iƚޓ.·D8X&&w⸃s:9G楣uyqyKG'Wv.7q>pZܺ\ؗKog"%~E^Q D,Wa<I ]8p"\1 iq]E*2 8VgɄQD0gly{wx%beĻmomQh;ufwL3d4o١27}F[,O۽mGt|nFrs;lu[tٶB72L ,X` ,X-BgXq.]O2b3wD}$wz# [c{VK:)/.{qoY]\]R/].+&:(ĨG>h uRQz)K;COxͰM;n2}Y8/p*#ߒCf\1: Td2 ƠDs>"v۫lmȣM}k<ɞH58@65W,?(#~aJ,meAgBn;m:"ꂟ(ancKЩ@Fg[_gվSF[s-1$۾3?ċz`d;RݷBqW)d)n*-ux!a|:!vtK,pe$clQ:PHB8*ݼYg踼p|>./8&.e ]yAy/wwHu-RB]A]:H ;b`r |qu Rgd 7 V€w3亙L_;vDR1e+dj,͉n{K_"޶^ ݍc/yiP&M}MaoҤض6mAnm֕w ^Ym'GH/>0|;Ȯ~&ȓzi{r#S%S]ɉ}txu:i!.iۉՙmK2/%j+3q.hnߦ& E}Ե!|OLS 3͔Nʞ:|'.rw s xW<` ,pϽ5~My⽿wx.V5+/x@Bހ/f3>L:ה?\}U]{&dKWǮM8`rR\neRՓꠂ)1AB9WD9dhlh[ nS`tƼLܵü4ƆӪfJB""R /P|a?*3 s?e,3<~y~ *lwPȶYE^('o8Ƕ:xOK]klJm #Ssz1)}P&۸#\H":EEC\,_<摆`܆Em+qU8X} &1Ll"mۂ_kW&lVVR]gdߧ^b?/ =#ӯЀzs"? ^ϰlD_@V^@}}Փx#Vr ˌO2?r"+ +D^ @E>aª=GA#Ԥ G@0# wP"kY]d:\psÂreRJs^.^S/C+~*Na^ũMo#|1>Ck|e2}&A8 :]o#|ĕVnXqϯFn/Žwꐜ"tϡXֹ@!wTN8rtt7o@?9Fԭ +oSaFDaFGG80!5|̚pl[u_Q> CCA|b@c=l`:s~| ӨjTo:ǕesQbAFEu;lT7Y @1Qv1YWD} 8}tjEF#B:$7ɃmϾA_5w&ƈ/ H-ȸ79Sv‡&+{*7nvkP6g±}]ܪ :gv 7+|4L'9D:q3h[ ]heu}bGR5wmV!OyxOA_Ŵ/+޸<\Oi|"=(l 򃲪6Yb\j[)xo=hPG/2H 2, Q\l#v}ݣ36QbFSl9_r[Gȣ!3Mx,8uՓr_O7qq>,急L9?오S3v :d PGlb>L UC: DV9([#m'G;fq9>Z=T ^qSƵ,8Qrr>8am'>7p5 7xh+#9`d`:K8XdcRǫm[`_2H]B–GSG%cK݁%c ,s x*M8tZ78Rymݺ^z)#S[ȷꭽ&SI&xޔ~mɛ'ŦDG7i]۵cv[+g!0G̴qBC` jGܧi]},[F\VF kas;՞x nǬg}| ԧۂ3ṕrhln7P5!_eTkn~'yaZ'/v]4Q1c>/L ɳ:vqpzar Q>+@cl(r|Btv_ɵ\G1Q~9r g]܆ gY|QAm_/HCJ[u?8'8vU42=(IZ$?iN!]8Z A'8w;YZSGl=8V!k R y O=N$s}cK»acQ>Y}=&m ȆIc[e=p7</Ra4>ȉ ]nD3:iJ&6S\6F~J=|ԱXʆ-71-f'5Ab\_K'kw:cr㛁&:ѽ4ު :go6b_n:R 8T i۹n6w!@›/#POco'Hy p,Xp7b ;p,X`w.ފO~!8*`f_ o#p8:݄dz6Rf=ucV1eS?ywǽC)~CK8C'C&9 6eym]-u: =Yw"ey@+b UO}E@6uET!/Y8^b]1im:j&A~!L}]gGúv(i ߍjYB3Q3r+b9Fr_P6_Uv.3֏H۬䷀Ho~x[g`+ckd!Z]k@] VY|h+:TZc֎T?Yv`$>WB&mem9lMsc5!/0ׇ-e[5^m`{"("|EO!lT 3.>(#bc cϥ"Y@"MFXHl0Prrvї Óu84ɇCϑ|p99ÌϸNW(W? G_g]F'8)<78">TlQţ'U GH;m)n @5:NG\Lˍ}qT:M`0i`c7]l{@_L9Qs488x4BP!->s z{ x\kA1s=A3]6pz^\_c-w.c0&:ѽ4ު :go6Xr*|{͇,p[)@a)On#%cK݁%c ,s\C\}IAa^ӂwpgʬ@zyǵz?4ڞ%id>Q:&$<5ݨ<]*7o^`CSy2ʴi47G)Y;7rΝLP>x^( Xϲ'>=ٍXpƺ#Wv`< 6SV:Mvl_76C5d|qNƈ6veMp/ph F_Tshk'AFf^e7lvFbs;ث,O3D;mY gNػoz:<)(_WZ9y=\wq I04 |ڠZgZ̢\yT^E*|\?:.Ozt&{WC]9wltysf A:"vYy="/+mqu+~\PL,O#<9^-2聂nQphP5tFY?4FG`⸜p9' W@6 䡌zWS㹍z)Hu^~El_>FJCS|:uxNylE vW<<Ѥ* q: fuDŽ =)P`=%5RbX*}|ӹa6Bnrv3s;P۝Oslo+T,_dVl@IB,|`Ң~I^LSc9Ӡ&mþŮv!s2|4 HcDȞ3߇p4;ǜY2NkزTےrě/#k&17OY~HwL=un{?rړM_2̦ ښ~ xRS16B\F{;MeS>S$mmߘW Uv=lr5s Qq9f*bs;ՖEtG&Y eM?XmI'h m/i;Ю9m2s+">ű"bde[08_YlჩƇe3LB>dBN |\^ɹ?2"yg uk +!_\]&ixCf\K` q0'+paw CqC=d0p,6ˠ-2A7p+܄\EIyqqsAsB裂6V"LWDuLIN:_ 8r27`~0%| :zaC  U*ZƍHo"o,HW `P;}>=o 5 `\Cb`V` :"Qr- +ų65al2GˣP%tYz9ږ&I6ĜArbV7^=kDI`07eaȞAd=pT:Bx Q+@q@,F-auhNFkxX iͱ6!P5ۅϭ0sFtq~f;?ܖG`;Y2NilC*k/l[I: ɵE%^}Q7h|(F=C*@3# d򻵊XiI~DGvUm:_H~8Vr}M2]2ϕF=q`U.@z} `-J7<.s`15' 8ÿV_O( yܗ P P 8=CmE >mi{c|m|0ZtL ɪ܀1t->s踜]1G#zs/e0`)&xn%[Vke}*t9 #"ʨ UkX Y'b;<7170 ``*SI_nsy$qK9>EFՍ|}xwnggD0zamef dy)+~bL`l`]" Pʻ82#ջc ކG2Py+-f|}05vm, [ssVn>mC5ꚧB?}Ą"κt$ 2[Έ?_c_ь0FnCP0 nUߘF])ˏnK~]:p,Xpa ;p,X`w.ޒR7xA7-qX>HНxެ>(z`Nԋ7CjG80QĘmv&le]mf\5*يr51} ھ $/Ump{[bl{6?NU֡U̦yT0DwaNfnjFx Oɵ0dY'a_m7\?6jPm!*d*0*-RC_ !T <&t#A.[׏TR 9x+~㼀+j(Z{#+K~S3^4G f@TrSy b*Jp1[b]N*MpzHBH.CysEJOZCm*>W c`y듵29:Sb! )'" >HtvyRAdNJY r/80ZN< SmS^Y.g޳x"oj+ȇNu( i3S7dQ}Bnǔ>Zַ ٬b4Qߎk#+xrm;`$[6D@PmevGkY W21ifAհmv>y,rumexW~*tKeSم1k'"; Ͼ)KcIAejI2 Bd5x&dϳU?*o#@ p =rtYΉ"mf0F޴Nb=B4;1.L2W:}qwpou6җ:r/J X@|_"2W`@M5 :Ű㶂?i:fnC-xWaj!Kk`K7^=kVVZpc}*ugPK<OuG)V8uVwr^ESq>7ϏȽqU6TcΫUb,sLQ՞;؆o 8+؀6Lŷ = SPjܲc|ik*C_0Ә%LIa;R~ܖA Rx#t<pVl7]>&op j딤61g?0GX.ȏNԶK-mNq1B56[]CS^ Pi)2g~^jt[ƀG;] S6ev?{ QH'\yc}{"ڴaj)C#nҠ%cK݁%c ,s^A KLp])S+Kݫ!?0W^u,z]ǍƙJ*Ϙң>`7`W^g%~~X#/ Ѩ=>4CvŶ|prClzePǔkoҔi2b .isHHY32KRFc7oWے|6T)@tGTnVnsc ISݢmP[Q S|z#md@;IG#I~ _Uv^]e?^[5qd&3!Ȳ5]ڦ eŶ6 ; ^ ^<~0tyCwa-AnR]*]nYrm-ONAEcH}Nقsɍ0BWo*&Wr(R ⹞'pTcYR^)b.eQ`< jrע'(2i!~sC3`aF n`:"co;Yu9:Zc]z9&`tNաAr v )*{Wn2ʯQ*qsNp ԕx8޸^9On#[ `ε]-: iU@r9ؠcF)s2!:s>l{Y{'cxi8 H &D`#DA.H|ΣSOm[V<&/6BKY.Z4~ ~ .OY䳭g,dE4jǫ3wȀdu-2GW}p,Xp7b ;p,X`w.|MV``c[,umNr58v'T6FAVtt!o`|u|Fz&+B:NM}xB+gآfL!{TS|@Ls7 mY iIT%$!4bBB W˵㢗WDGJTz("\C'"@$&TBTURu{w|ߘc5B=G35Xs&]"9lOnl#Gmi]"zH\g`1/~j"yJݢs)l@4GA1DulqnJ,oh̴}֦ M!.<ϩɡ#Y2\>Yޑ$h%d8"q6+;R%N4As {_a»Lt*zt9W̤C}6,ob&I^[qPIK\_,W|] `N/N(|Rh Y0`-9_­טC|c >ccG s[)8XF8OZ-l\58:i6ceH0,q3 sYxF^2{Eh;r*7yLMy[>Xv(ViWgz tjVm:d]״#NAzm!lOrԫ6|dP,E{XЉfFkA-A.hu (ViSCZiDMtr)?,8NC(<z}KTicOGr 8 4~ǚ޲NNK1gG>% CBQ밀c 0C/ħoL߽xo뫩{2b1q}edfz;MUСBau]/O3tz%͔e`^VxZ|3o@ C]OU zm ͜]IĔz9Gd$7e 0 Nk*\YcZm]wZ%=m@lU(5h:nv-؞qgR5ֵiץΝ(UJ}Q\K_:P~ 8=| /mGEGM-O/!mBkɡ >~gG[&.зm]4݋P˔mჸ#]dIѐ/%T\5oӊ$]ٟ\ /ch<Ւ^Ҵ>K^3) r!,ײ)\rdi;dvegc#:CWcŸ\1JO ppG~*ȣ}ژ41h<I!1oy[N7`yL\ xv ,eIDATcl6#&iGp|e8^%hŽrĎk:_I!zfjϗf1 xeCE#~;đ<q~5\A~u8جͅ j ۢ ˎ{ЉST̃b2Ke0nm6J{>VĖ4/Wr[p{g>o2X>mh_jacrQU\X&Hbet e+t1Qdj^(Z-ѧp&VQvXq*6Q(<zKTicO';:p qr8\-; ޛ$4ZH:/uRXp.} O}z=RW9(Esg *nF 8n 8 0`]<p1ғ7-,%be~U;(#]_ԭulT!;|y]k|%Ye}ͪEs~lGo1)tyAueqKY&%Kf(Џ-ZQKh)7 *:O4|d}&MryeD:> Q[l|y:2vLaOЫWP=.M25+ ;`^yȱ!|EI~UϞ"~"ڛr b ?:Z,mFc\ƞ]:lkpmaOWv Tˀc[͎͎}5UyKwi2lչDO`"z '^y9!xnc'G- BFNGizl| sN*-}N;=:xUv!AF?kMme9I+R % Qk O:KiI4yh廻iC1ed/ +@֫t?BTey.t-#MN&x۶BPI}6O0Rnac5M=ђxE?5hqa'wERlg%P/e֖Zϵ=lފM'ѩe:Ǥ#mޱ LbSoe+/"QK^=aGY&k=P8]25m~77/椶Q^;6xV]C1M+ UY.ieֲ*HDLʗsYtԋEͺHN2I5]UM1"g6woGXr~n }:4Yal\! .(V*ʮ6]G)'QU0!çYL1ؾ q^!9&b "e:p 1& ){nG)(jeo41FB nl iR9 /\Wɹ3ƈg6Tqq9:Įv%YsG {C 9#]>2r--3[͏mum^IE c| d7m+6Z٦ Op/h+_WȁCsrmS)y;\, 0FSws ^YY]]M'p@:HxYH4 U/!ae]u6P)\rc{v4~o=UN1 tѨnā-|\ܧnFgTЧ יEJzlyis=@[7Kcm{l_:вv툛n}oli_dqBK>{p.fy8Uѯ '9Q|{|'ݴ]8òKG=|#:[)X u: ž)K}+Ç zYc 0C7>RWؙtΉkrW 33ً?^/tE#\hCx;>A|M0Tb<NAOxKe^#`:ۧHɐڐcM9KmOnc sk-1tmC;ɹr|qBB d :hlې8퓖xʵX?6 =REwԑ <Ŝ2)"8%*QS  #$~)lbmIa է%8_"^#oɢNMV# ٺ hi+Q :NTUŖuJzK܇ղB6P.yEyuY&)ѫڐ6i4c|kPΚAVؒ\j/6 10/|@ݞRo'].NK\BH9i qG T<Fx*Ly!W/h&Ȕy,7Xpu"[O_QnÇW3^%"zm z DLsD5 B [N7RpBR4񡧩l- WgY/8^J PU5͉,iu>c|.8\Aąkr7Eg 3m{v`+8Bi_ BH-ep\ߠ0S v cV=UsD1ayډ~tcy \;jq"=,'Ʒ\rlW|f{3Gwtd'/ن;cĵ|29fKfc8tU%u/y N>be$ueȽ? ̚qu^@ J, )F8 iy bٖVEdEhD#p|O|ΩY]/ay4i7}tSIh饢Ӽ'%В`~/R&1g\C+D9WAU%Ӡe\㞍iN3TE#trIj'BDz(b ç|5wȓbkCq/F"qN_̵~z) )7];C+q'Rven 9mmC:|oׯT!,ݱ_3jtSeC:ȣ^)?,0ưc ųr˾h28}HZzK_QtS_aus\du$L{.e q.^u"z5/#/ovy|vtQ4!lP[ Ӗ\yKd;e#e3:JZr/cd 5(eϱ,ۡ]N g=ȬY<%~»_!EO\Ya>F]bBҒH(Ӂμ6~dJ ׋vq@Em_턴SQ`x@X{qG8JN~.HmvR$B'nd=ǟ]>-X@3iѓ–ƫuDݯც]%62Ob-)qP^f0SN}uKKB6K;DiKӥ^ Ջ]ң?o;"Sq TVN͸OUΓ}nZ|z 5%E;/1S%^`yqU Yv9.pەw罇]gPO[:Uy<;sԉ(C\7h4|*lvKFkbl.Г5?+)|m<> 0G+-3 `9ҡOY=t?Z2Yף1ȣE 8TF˩1Q_'U+z͋q'#{tn]/zb^]{.{Cl6E{oW.ٵ. Om:_!ڱv{N8_s]jœ>~ (pp iKP0'cF4D}qSL ߢDK}[P)-(4JDӅw(Eډ@$K(@+&Ozb8] =]~JYM.'@/wn욋!{TODW#$!Q/˔p pScXqs`X1`|YiK 8'p]5O'7|x)]R%kN#ʲ[M 2fcS@I 4E}@1q?v~w\k(mU' 6t9 wh_>=̢yl67rZ+`G/u _]HDHuuo(kXR&*F37I"6h2 yH//3 ArUPa;ߩp}ώy+%@ԗ[.{M[#b?PK=vKD[q)^B>CgD&/l?J ma레j(qHc$ D'Q7 _(g݂rs.tIz8j!SX=Ն1.["%zniT](Sn_w7 yVqYa:m2-AjW~ijGaљl Dž\qt{Z|Yש-*jKN_yp8vm̓y8!?SF<;J{ӎjeAv[2/bCW?mk 9UELyy}(+AS9~U[|C9pLpߛ&Za5U*Z7\rh]<0=Թ<B;ԃ)4 ^FqK7Ʋ=ڶhfKD'r:P~>j7vjQnlCm٢,w ɔkf^҇>v_Ar. 6F)j?c{xaǀ77 0`. 8{[,kTx|noxcm;zTӍpl_ƯѐwM[Lq:;;42Y[C>?|AȩiOdWEsL{ T:hO 6㰝>,.$E:ъ&rJm]N]C vఱxO XPAȁ%h*o]3#^9WC.bgDS eb=C{ p]7C@ڕpD;1'o ZgQt>6c¢}dehH.CZ1oGt!> !HniOZKDsh/ę yU+zid9.P>!".Y?߸F'@ ߪ:dNR/bN$;u pPB2U lWJ-^$-.H)uǰuDDZQc:ZDwAy(;PC4p ygz*qpQqO؃ڱt9).؇)uFk=O=/|q'\ħu0-.46I_ h dx>§y9d<KKPx#Oi #ee0,4d8攇qz]wV=a˗msttH dIc|Y .#a٫$y:˲DH!Xvb$ 8ʅ$M򌯰9mQ*{J" FWK6i x@>@Jh%ex  Ct@^Ա,e0r~è|=E 컞SyG{zҀߌԀ 0` 0C5)t9Sy]3Rz%_KE+ )GFgwMx Fyy/όyYN(] 1Ru/ϣ߉,ӝ“f4嗛-6GS#F3LMb*b[nC:@ioZtWpn9!2Bf>)m]tjzNC/ieŋ!Y*die~LS"DӉ`뉦{(?%K/OEV8635eHc5f1Bz%tn_Y SḊ6g8HvV_<ɹ2|6F)j?|죆'p pax́ vzυ qHn<;%f tME:%*$ }Ve(QpuӅ@SAcFS$b)բLd3 -d&]n2ËǦk5*9"怘N,͵^e.iHh\$`*1ހ /ҡ;J/miOŜ) .UBѳB$Q,9}(dG-i/YF(xkmՠb@ Ȳx8doBN*NIķ_"$Im[ێchϾᗯ}xll.].D:jv1޸fG ue>czW_B4LxG$_tFZ!$1-_!brI@Vט62գE&)HO|ac64G(1I"%^Ao3nk.k؂<(UZuUO:8} _ص3 6ʆ6 &b '*AP ҂ΘvQ]}Yngx]>Jg8OL-(}iwLھv>}xڜyFn Or. Qgσ6aǀ77s\.U0`^xxxhz x6.xYیl)s/}^qg]7xYۃWwX~M'K =X`JL{7͵r5+JU6`Kmd?(>2=rҢroS P׈ @?ξd<b:|%#yO<^ںfBPDij[= u.jK⌗\gHbCT ?cle+>]7J@u^5'~h@kNяښQC%x;)JGM&D@擵җ3Hny=#hQ𰍧65s!#-[@лz+ XyKۺ3+9G>ѻ l{ d}2̺{%s(^G .׭TFWqN!W?htJ[0;'TQ$tSA러Wb7H1b :uIm`wшC^"dإW膯b}Q eZTgt'% #Ts;ĸa .zK1plM׋8ӱ߳90ht_"2aƈE]|0J'(Ofm>Z$}h'h$lmɱ-.\'qqfs{d5W;KsナCPi*6iKMa%v"B)AEd~e:. 8 0,90,Ї}>Ο?s<5ǣ>ESv[0Ƴr'[I Hq!n<_buS׸H:F>^lk~6׷R:w]Z~\ $D+es[QV !^a1hC3!e S j[\ 8Rs@s%1|bi>@1WZL,z&t#Ga3V9~3%qAΟTF*D1?^ 8^e2MCHelkٖ| %ZnWB#ʏ6?@ GjzѿҠ%}L*H &URA߆_F, %}hn5% r^T1Ђ]|Tze>iyyo'Tz-'FfW8Nk-N}g#_Ć:骕,Rre@XUt"eHq }QyhЊez :v)̸+@ Q޶w} h׎qt8]D-3ed{;)}=!1Yz3 j:G+;>^ |fq ug&vpm80[`MPoh‰۠&kDٳ.fڟ}~聙=>ՖWsqO]=6i|t Ņ1GZ 64=#-Vs $/Әʾe=&*x*J9a2G"%z+'Ƥ<9dTN읎/mub{Ƽ-rOAB0ѶOBלRP)/m/zC/s -3"geCұ\-[z۩G!'c+HhA_LȺ~DJ^C$|Jmrxz9mA[ΏŪ'kVm|D(ʴ) 8 0,90,PQ|A{ ^`N0` \< "ijs\W {.y UXHit˛2l/T)wX=aא%Gg4"JgHGH.9n]v'NI+ [@ݢ -]( HfMx ("~Փ4rW [" H:MrJmQI^1@O(#ylxhQsir÷LΜA|t &C 8&h!bxe#@xCfGtiK'NPq=U\\8-׉܎*@M@ S ٮ8qCiV N:jSIA NY(]U[ eG`]sH+ *jlm?bQ+z]mmP'Eag 9Feye`iX1`͇áaǀGGGv{ _|0 nwnn<p6Bi: rjײe}5~ =Dlma2]?Lemt}'-䔗:B!R[mhk!S[kbնEL1[ JLxɺ>SiP+>A&An0^altr֢O5/c)Zl\ƋV n%b  ʤ) *0Mӕ<6Z]S䲡E}kp?+/aD9NWaL %ijP غFzEbglxr-Aꊙ=ule˶xG':5~'ۧw~g?D~]m[=Y˹E6jq}K(?|r9^QJ ;M;{dK2Q]6S)4)E<ّpA4~RCGʖ-8^%{TkIBB2:oP`|ӑMq^x0_Il[gv 8z 8BTU1LL= 8 0,90,P'/^ş۩ `mo{۰cl\q'%|=߷>}c6Y+wx-Z1'M߷s$eu}J+ssL]*^r%mPuH%$%VhoBǵ.Yp9BDhs#I;V\c"fH5nY:E- > ye%YTV=~;@̣n'#'b P ptӖվNJ^g]\y"HZ(:B M ώB^IKEhlFABab'2*gJHN[lcn@Nٿ]P[cTRSpR5J}$rzl&h m i+~ӾcfUk1fűTd]NOOr{,;F~s\~.,n ʱ~Q 'S5CZo$?qP3ycYP$tZ)O` C+/7mƣMHv?F97ݷs?Em,'Hp<:ZXS?^.+˕s-dCttf{S0V.Ę*7h!c_,׶8c8X,<=!c5rcgF69s`8o[]=ۓ9>_7\_|jG 3_l%,qQNFsD#3khv r@#Ov˔yIj RO:>'T\ԫE:4B>ohW:q[5JeYs}!bp@.9q$]J줒>eڗ/[ 8Fwlt|H,ИA(0bB_{JesYMA0OE3aF;s-Q"tC"Ri_|pp ( .ؙ3gow>ظy{^0ųs_5&7LݝS?njry}eZLMk}Oz}ov~ 8N:d{ZLz]rAkII<+ٰS[YOQ5|l%hMǺʩkM%ׄ^u-5I*nܠKmK(C>Rnk8g9ad+dzdssq׸s9/w\P#%Y6#&d+˃cR'}Ɋ\$ c~D_%""lE@f^+[ZVHO(cdrr. vqԶ|㮘 u R27FO/ R6;Ll k1lNr~R.qW[dKy%fߑ|66[>= z &^rktˊز^VotSTl!"Q@o)@^Oe q1 |W)9N'hk7M@qfofLzŌ4 Oq vm>G 7x)rQ*V8>x6k8ƫܞݲ?Ѣ=Dp(c&9p{%ħv+re>k*K /m>>9.i_p5ll&v>K{6cbobBK;=pabl\c<Fs1/6|Bws(xcO0zBƖ3cz1oזR)Y%R/IU(N-H\Dbq -LҗOuԶ$somRV(`Tƶ𲛭DIvn8h6\׭ׁ܎34ّ 8%EQZhQ}&lmxbP"|>y!NJ^WY4H K> .t\!GܘcHh#ZcFf<y!lsw]iǠj:@Ri_|pp (aǀ<KEX+cMfm gkZ̃Nk26r͔MƋBVVٶOn'x]A:dy7҅t d^-˪H|-UƳ?jU.b3亻pdңQq^u"u\eBJZ}] 袹%̨xD2y eؑ%]ly# ?!F?0׏tQ& y|hٕ~pB\ RTnIe.p,튮zm%RlM]~+nGrl; 2π]݈ⶒ\hy(_ iM@Wv ]ۄ:kr^rg^ߞJN N3N5[Fyg)r1|o*-sXNYD_{koNg*z΃H<;<&8Dvb\c]}y&lmչc:| }t%"w4OQT긺xN΅a7>+4WH97ED;a'^U4Y 7l5:uwC ;(SG|pp (aǀ<FMl3{0/;s  ׳eH೚.ls-w7R/+|OyD@ )VZHM9؝XU!mR{:5^vB]Imytgݺ!u\xL]GL.vEƅ b&RK[2JE EsmI9Gs}X8( M?u A*rzD( Pt݊>8un >&XbB,* #w$@OE!Okݎ"eNj)4铇 ƏsZxCl[݂b~8<4Wa# .2{K=in$O$R7ō%jmƓзN]J/}/w ^gx8 a7`?Mcr~jVAvQ3BA&F]-~Uld>])lM%tPKB:NS~RۢC4 ̲wҋ|¶x[ t̤Z3XF $9m2e{̙u \'^pf-ܖi`c& [r_ 9-#/h zZ4شFI,o=bo=o >~6vm5)@ q^o>q \8SXu-csS-/@LܕH8GL]c췾~k;>'3o]7F-5(\C./km.!' q&#>'BOp%$E^ O5S.O Os,عCQ:q_s60!@t@~&}B9^R;DrfwK?]v lMSd`yo`rn#KD5Bm11=uRz'Rm@!yvμeS$E_;e 5J9ΔQ o!DyE\J}>>E4Vpv#itoDMO;MjAp[fb'ڷ}%Nhu9"?L4,0ðc@ <boyۓ9}Ǟͫ 8 gf}F=|~k:x<ˋL5{.K-]Vߗ/*G$eOxK]gZ^Gn__M<$O7_wwA '_ uK( @]FueC2qD$>oDx璤j$ht]\12Zù B0K[ȾusB?5 DhS(H.۬zEyN8GmiQ%~- :V:L[y76.7_N@3#br IS;`'k䶙eo|HqF:)KK7'4zEhn'<鳵!uh7l$׉dQNg,xEJse$' X/sr.[Zh8@l!½V* yӭqC;=v!ߛ|SQNZQW\^z^Ɍ<6@7 !m~em7'`De*I@WZn#lyLr )Bgo;)FF-ҫylxc_}[i* xQ~uL %b:1-y~mr[gص'Ok`s,!ѓ fpӛNq>3Ο9iZ\A)bb^±:Σ8 x"b}&DƛL!h&(QދOWI2rmgeR’O#k?;\ys鬣 a Id]H\ CZ腍>_2!>:Z"糯9^ܚ4[8|v NH/x)A$_KeIꈍvEW?!^r|Jz힣3lZ\cq< y$?e6avq} EteNlpp (s_~[`jSxǞN/ 0g ^z GC77ƦשPuy +1("q{9blc4>B 2T"W~H:CGגkC),ԯER*P^Em `ҎdF"Rw?q3(dirQDn#Hi /E\]r= m>,B~IFy!S-}pcK3GE2,l4k>Y70ǖH-cn(`DX <6=hh7Ac] 5Vg9Ƅv#&^ }"lP9oLcAٿwЇ#⪯7͙06a]a!A2@?!nu߷ĬennG%vBgKUrlԾeJ#,zhW"%ʠ칻Dv̗v#^}nŕ&H.TzZO>Mz >k8&, S7iuW8tzX%F{܀~:B|V+>|>C3 J;/s6} iDZ۷Z+/V{|y2u^<'I1 LceC+-z ~bPh1VXN,.%@MbR85O6-  M \.8zDRZR-Hb@>ԝGШDt4B =pv3gP7#P5W0V@D!߅F)eSʰNiaKX(zLN߱=iۇlZϊ-tۑJ\gY\hڨU^u}OGZ-wRC=&iFQϡ쌕ZƫmM )EKixǀ77J\p,=o#WG~GW+_^bmО1 aǀq}붙ۘOߘ)S|`^~-ћ)KuHؾ͔ʝv~uRJbI"NH]uoeK-9?~B.m)hLkyα"Ku.Nܪ豯>pݲQ-˔)V>^ZDݿ-EQJ*U $)%:_O*5 UKͻNdը_r)S+\O9 qGe|xn\t VicM7UY/c-~x#߅:R[y:Qy'ʘK(:sj'7^u{Ckk N?_7u6dt͆lz6ktkZZ%#Q "eTtTR\$7L2\ X +NCG6Nm43q -/i; <~||j)dGO'E)^_o 8S4tj'i:-z >[gI&Nj2b/tPBdQp u #<)~?|O w{Vm% gqʼw9?1}eoy` &"_v&]$y#/@U> JR"-9zC_%_vٳPq5*/t!od-ˀ^򢬥 .|J쟼 D/ <7KۡCId"C/ډZPL1y+G͂nyVkH{6tM8T3y." ͉r1` iؾ}cyt\N}lo6>b׆Ӑ )˽<&E8 tb,Jd4Iu8ɝ+(gthh}':ly;r */.SV@?9eNWڅlD]Ogu]pZ46J՞}ܸ׉/} 7zɄrm=dߦ6;sfY$3m4BCȑΠ4;@i{.⯳"!2 T _53,ԅGb&e sR妞^R Ƴcߕ1fMٍ?*-b2z~L~>}ZuڊAjoX42AK.zNs+{fb]uV[]e? 8-d$WA"O.RV ^%^< Vhs:_32{`?1Gc;Ykh/rlӽnٻjn}vGaϱ{t`w3[^Ǝ2_cVK{߅%#]8G/\.\ i4A{|3%=.ʝ!Mml<axtǜ+kR ;zbnǏWmU+K8āh ÔW53=+=iX>}c"h=#'v:ď-;L=9 \ rcYB1ZB?Wې'pI؆<.yaL)&ՇL܇0qO c_cB 6dX+~q#G^;b=}:ڑEO|ix|ʶ~ؖ4U6ys2m]q(Jߍ]쌕Zƫ4#[aiє)sixǀ7'p1e ]/cvu:)ysmG+㯂L WYKyQ^~y܁]t6O?f?=?`/(NvIvޗ?Wm)`y}?|ro>e948l{G_^gO=z;^kox/"n{گbO|}azě}}٭w~?9v؏Ox>(Koyڥ}Kewb >D1{* *',_۪D2^.tyګ$zkVK\tn!ż@W d>r .$ق=Mzi<"P9ږKt %/'>]KiD{xrʀ{|7׼n}He<^tNy5Bt{ELJn <}Mr- Ģl#U䥃`J#2ȳDfAu/7 )Ku(G^](R{\>rE +xXDr'.#55D;- .QTܱ3V{Ru[6hNj %-|:imOMJt8#Gf6;ݏs 3|(G`\n 4cQHy=UxK\Ƅ8ǀ: jبcU/P׉/P&GI{ \_RIeT"G(w$yW,8qrbO]~:hT0֥Z&H%vL/}]}ُ?[~jcU=^}z7Wʑo䭱ObByV!4hf3w3[mvnQ??sv};5`rKr._EŽo|mG+;|XcEk[0d ;ZYllFֶ>^ ~[_9 uȯV/bFm.UF=[:L76ݫ^# t|@1u5 <'4 O6-7YBx %h0s+>V[džnG^d5})cut 6H$vllЇ:9<W/~"˦~e=><,!w^1s=%1yԑH9Y>H'\< IR-[ =ت{PO;ϵ/Cbe/~my;KB36/r&oqlmv[=7ǯ|qO ܿ~~+]?7c{C'6Q(\yˑ}$3~>?`] s^rˮد~ۏ<}}}/F"CAORK2h]NIc҅k-;tMJTu}'jYS4EMy I1Bm[(,2b ceI7b%[K6 D \^9R,RnvSՕv$؋S- hNH'ik eד.ށHEA__ OOZ !5Ɔ0IKrm̱e%ҿG oT-cS0аsWgH KH(./VOmܖOeؼ '!GaE=#M3%-@M[pқ>@-Y!r$>C p91։f\S+Hvm mL?I*|xٕ#kGS=mjdJ2^2dTΝ G[IZ,SQ<$l M;1Ĺ@}5||v^>VkVeR"s6=DZ|a$(c)=.)ħl$d8bF㠧8|¹Nxa,$8~oEmz rNI@H5aS$D?m4Oxڮ ]|(n|FF+\hQcixrLJ^2X.awz 厥okZ&KNV|l:Qw"B 0`tbcW8O#vGW) /Nx]~|~]y;.}߯lbҗ]/;7z}OO?77-/ۭ}{ዶK lFv|}w{_<{x;l}ُ}]m6۵'}W~}ͫ._j}}W!&vG|-V{_K/yg#?u~'aᡟ~M?ڧ؟_e{&jO|gٹO|W]8oK?j_8;ck?e^ɿ'7c{GXMoL{-%9_ecg_2{ bQv;Z Q'*3w:y4] H'Ke tї)hiNgcBc+A./M#}EJx,|"iEJy;t Z2n ir q$/]$uEN||$Ak vU5`,.;HeL6ze!zMВlkdki<ύ/F72sBt)9o^p⏹m?Ki=چ7lE\́|z:"vCC.\yM۫Ʉ4_@0yGI!Lh'?UGy:>SK5+"(v|bPp])EY}v2SzMԩ=Dd(¦) e۳,*=%1 NOm3<=2]ԇNYvzO|oJEJ`YۀӃyx*u`=خH|Ø dcBY_H!XA -|Su%|W:1p,G.m=A/AfGڃ!gg6@ 4{{V;vvp9-8nw3Cgs}"vkǶk=yutxcvʮhg`_'k$ od?3Mmo8f7w5zc9>\q6tinWwO WVAWJgmbzMd| bE|DJc%-*s8?a[B /qaUxnGr 0L4r tZ&zaJ#qI5GB9I|5 1šO#Ya/imXq>PP[p=Hv)ڒ:+xG9'ydØ-stoFq4@ )\E,q纴K C>PVEÏ}i>mP[}?H0)WÔr-% ?rOLq9$2qDbZ^Ek  䀀#5JӉn4X\|IOT?mtO}(eN^QVlТm&xlBNOn'm)A@Ϯvз"v)Bo:k 0`> ٙ=|s㢽O_?y'i7(ya0wx}鲝yG+_*j5ˋza|9rC_e^xmL/^_oxWGS0W;H_t4S>S՟g|j+ﶯpv[{Qg7vG|Ƿkᱲ?~;sٟ>.oW_Kzڏ?Ҽ~i@;Fdm}|lgoIoW7ikvsJ;v>v/ϧvE(o/_g3oQ=X Ex[<hP_#//T~ʥlVLgy$ )_iDԕ{ }I 8J⢵2yArʂ L+G$ݰNS=ʮRIG\ ^xt:JRz Ro#1~T̼Ak@v _C\"2 %/넏:Qw hʊd1q,=Ź2/3m$ {"y~dl?^͂mqT7+&tsSrKTζ~ t. ~"985ӂ2.|)O}ؙn3J(N,x>ݻ[\<6mOUrzqqۢvs~[/0o70֡}ܮ&~Q2@dإl{{v쇐fwbg{+ݎ"bw6ڛ =k}]k]A&G{ K~\!5 G3f4w){|N-X#;Wm|q-<2kCzc;o>= 54P/ڬm#1w0N-G!G1t_cOsU&! b޵Jidd`W7 }yL+Q9y])Ry|`2!PULcfCJ GQ,5I)oN8?" ќ|(/N?FY}tr>Lq˅9 )&QOOe +bMvZ~+= Hc؊3傾3XZK(̳zv!r2 o>zsh{3_>{ 0` w=_}D!_ۚ.pc{}y'̏~sїa?}gQ?1˿/7dtdֿowWo/=E/{~]vEO]3y~핿O؟;?|[_鶹T^/^`P^7gdG\C_=6o{Ͽۯ>lZ \A8bKn{?2s^jz=cz}{w%zsG?_^wm/D{~X嫿oy/) c'[r+<%;^EW:xQ\^ zh$ZDQ7rSJ|#QtOq 9uD~U:>:&FnPyqN蹟Vy<آREHOִ"n00nH:%bΖt!ge(C52AdD?mZCrz)ۓ/ڟ:lƁ+[ANh:Q&GBQ'ˢ1'9 Jxx" yzmPO?ss;~?"*ʯ݉ 2X_a"nfV,Dvpabn&3fb"H;|/ct&o;c=?.;xswؙ<;sy>-LtdW C\E|c i>D _c~.-Po:3ͦ6F:N,#؋ 1_j{Axͅ#[_Z h|~-|ˈߎ_cH?r1Έq Jm5Ni]16\3A֘XOuL (q6@zY刾8HWu媞1$ZH  *xFZcvƤIk7}!y:x*IRQT"t<-S MQUW%ML?NӦow<}(;̫TO+PDly-5RQ+ʆiv7 4]ݯ 餹靲j۬䯵?F KK'sOy7`__fFW> 0{liGX3 ~{ov .\5HG\谱s3_}ec_oȥ>>k/^ao?յvqv/G%v񱅽/NWط;lGslv;|[}}}]x;wۏ?GngO/^i'~}[=6f6>K~ﴯ?d{oW>?Ͼ}|3xicO>n;q/|S.۷w}eٷOj}ﶟ{?칼@ g/oþow}Wx->aWos{6f^Zl5ͅH/b"lЊ<.z:_,*\D V(~1WiUIpzgb9Q^|Gee~՜Ie>q 98~A̡vzܡ?g{ۘ-~6[&Ĺb9\ 30Z%5_J7MY-o"?vf`U|…k6rKǶt%xi` 𳯸RE~n!r8 lie}U1ĜCN'~r.C*CzIv aJ,g^h\.%V;sRŭEfq~fs'Ww䜽4\1{/o<|V >]fEI0,FL4Br m:[:aQyJyBIs')4Ĕ<5'!_ NBKF16x 15IиpҾB$.e2M`XOrH[ j>@QJZh/<>gS}'R={oxNӨNcn> Nޙ m/ ip6E ׃dp})]Oܥ.Nuˈ]KӲ2O]T+C-[ <ң0Kډ*ֲ 4tҚvZ%yPϛmփ&e;};MYzYmAz{w0ُҀg3._ҹɅ ̙3vk+0oG|=?{^d9son?Wc۟a³2`̈́ߞ}bgzo>ͦH3ɞmttEOєP3C_i;LGq6_v8L w0Ћe}/Nϋu信ez}݀K65YJ/T9')}B6]]h([q :5'{}oIɅ0cqT۵Dj3+nycDڦ܇RC7M\Iu[sin Wه"x~'C<u+:F!:n~* Tz 9قdui^醎R4VI~cx^m0aLGlKFb%rآM闈([wz hR}sǹگm'R(9.bҢ-$`<Ρ0F#?O'M% +A; rW/ЇFO_ 6>M3hmQT6SHpϊڊm`E!:B֌ P2vv3VVH .hEbTH!sHB?#:M(u݌brz1%|?戚Ϝ PTgG9%%$ UM4'k\ cTl:RN Ֆsp&VҶvF<$ߴ)#gu!x9Zn;[6=6oi\DDE%>R[= !ĄԨ&4|S@`O ufts '1T4> 0`=}׵x_~R^c|%W;,0`<_O5.9i^ ]7yS圜1g.e'|_0?m"v#ctY}N]z'%y.t Z'{Ӥ<:x%b/GCi %Ė#UhYi f^DŽItݩBWbo߇@^ŇSox%ܯ&#m{6b:ܷə=cltn9gvY3jۈ7%x#hH|ҿA8y^oǭql2#R"%99J:] e>.z~Xqܖ""9^ Z ּIq ^`ak?E߻QuxlHXT$?}l6l|6v{ϳ3ϿΠ~Ny[Ͱ|!-;5ؿ tij 0@WF6]4GH?@;@CyV+;+\]+`G5̔l|rcŧzD3,c].׶@B orҌ$.hD<ڥSQ}"dLHy7BPBtdoG"TO/-HIfJzч,֒cyK${mFGR]~ sZSM3x§8WhG91u*Uwنe#-˔hnWCOc,8/>VxO8OU۟V3><_u"d2ovK2y6ʔcPuB (X'e2 t8Mr_">=nۻ@g|ũbFHlT>M[S-ݛҗ8Eշ}>ʱ,;S"W/!̓ξ(imֹM! NW2sHcw:|%doL+>ut'e.O Ie oit^Lgٯ|3u]BAZ +WC>.PA<)h]%lVT mu*R?^vĈ7L 0%BRM4'UR yRV@'/g\gr]m}"Nom,uS u3ۋX*v=N_ֶ4:hS(t_Ki;!iN42^`4MV4=wkilI8!d֦wPyT )I+%5> M)vCrYKmG?Lu`tF-ӦOmHs1_O*3Ofc4 FziQЯ )Gr4Geˍj=N;pBk̭bΒa7QuUPtw 8@'kvIheHv6]cR DeNs2o$3>NTq 0:J+[@ .ԜP(ZN$F %t>6HHO-i ]],Fg4ʘLC1s?OR_c \k_>2<S3Q4j'y֐Lt6@*h'.Ühȑ jTAΫ<􄡤D 1et 8I>b>[5'\26'M!&8$ZѧwGim:](pzly-('k LnDw|`k}zJ)6'RNw8dT F*LdzCI}Ќ1">ڮ~Q;kiwK(ΰ|kb* m ْHhU\e\\[qoa+lg\d4*u!jAk 8 0,90,P977^_/>eۇ/ ؅aǀz4-NyÃ-cGu} (5mm'/+(^N/O .<:$ClNY.;r;&Dj\Pd4,HzQTvGt*՛kY_]!@}6F$^ ]OjY獸֏HSD$5pL.TC|V*)A=,B#f!.H| ? ;$rIOOAEQod麏xf)n>]2X?} h#)p^QV|aƏd]ce_6yKdtźdP-vK?(~bX_O8ɗi|0F I6d3>ibj=)L<(v>A%ͳӹ@bP$\☪ \ۧG38z񆋸7ȂNIQ!95IsnR=W ,'?j(?iƺĚs8hiGsS w=×Ē^[E 5'-qp[｟°TCO6< ٣ӣ R at$'>#;:~?3{fA7?`kq?9ʜKl7+> 49a5MCڠhl@C_sUR= [Ȣ(?r,F |*+E0?yK}PDeLuMy;:@xEGj>7CT'Z#'싵?G v̧ 3j 8AlvN쓦\=}1O#IHmTIBտÃO8p*I6q v੝~Ӄ0J(FLvRSHmo8 d# JG Қ~-؇V=;]rR :uр|&/Aeu{^%WE"0I Zqo!d ̣OsǓn2 8n 8SZ8׮aX1 \9_m6=0" 8 V2/rxy". TWٸ*E9UЖ7M@w2G N\Ej vNr*z!=Yߺ!L}LH](PN8|Rꅝ|}UqA )۠9]p¶캽@nRpZK[ŹJG71z&$t^gBUUm$TgMd_ e_SCI ee&%2X.,fmwPLu /n_9 ̈65Jbp̽(ǽK f~`5 O.|@]ga .9~0\gW80 Tau_{?ľ _S @I&&ik8]p-A J!76\E LjeK#l(>5I:%H~߀,H (^{$Cɧ/1N@D?w2-Aěܗs]MDDL^)Xa2a͖%Ul⫎0pk?]+xlALJKUgC#@17mJ'ڳ)v蒣`1ɨhM"i< yـqIͣ I `r}(v_ U ߶v dho 17=dozmyyn{c;:iʹ;x$˖0m[ 7Q9Lg vjL dUń/~Ir$Gф\> yj?s9H,(QQW~<Ѿ?#|#OV YU |hlxII)⢏r@Om/had@&6- 68GEcϔ(s P_QQzYR8,hl&Zˎ wm=O@zF`wI} ~Ǎq7'cw_D 9M\NT ׂX,H)_M>ʀl)tY۾za-}m]NBiu>qJH@io~(M)|嘗)p p3bXqs`X1U Q 8n|n{hc/`_C^,n+I;KPor㣕'fl!]ߟO{tb&/23T5dFrKѻτP =%PAU4ļ}Aw'ma+b#ψڶBZ}@z!עoiKXrDl~*NqOۅ:KڢeB3hA/bi]|_6/YP5մ^@[\ԁ\2Je^#":ʑȩ} :5|?V+ĄlQ3@':"\ɖˤ1|' n!q5%<;-`Cf3醋0B.dXݚ@\jKú!^[hC̱β:@3f}At&W qnpZA&| w&7u.!%9OYI;lKH2찮S#z93NF7\xcQ[e&Ry3ӶF6ga,a[Yv@WbkoB2~&)em !pS>/cxFp{lڝMv~lKGD!:cZw@K67tK/vEKw3ȑn4ԣLCG/yXbA)G2j>u{^%Wlh:9&];n0AO=80,0&ðc@ \xQŽ뮻:`6}wC9<\\o 8Fd"o({<;Mz:nO-Jf].zU[2WJՀ.ÅL ЊH>|ku~cO-=JmlGFζBWմKbLe/Ps5}n\B4WWVv/__nY5ٖN h'yq-.7Lq[bMK4H/۪R -.鋹ǑO֕>Z gƄrԍL+R5 㘞@BQ~ q3E -omyLP{: }$y oWaOSe6؅]<&ѲrSһdJ]ogFg^\FZI"T+YrOuGBۅ2~h_3s=/{#n{߿3{77lMw9/_Q+eMG 0kOZ1c[xAYH<֐6#s"0"RG:rqdOҚ.P&Ysj Xh62SF|D 2N F5~ZFyJ rORr^cTҐƴ/Max;mcuD3;d<8UnX*LB^Ct~Gm*ګrimV_[ @N)-ؘKDD9H~((?)C1 *^k b< 8؞.FI;7b;'Dt=oGp p3bXqs`X1Uc> _B0-s xvYCO@zƞх. 8U >vlgWVY—R. ghٗ룔!<^9{_A;5SQHdF(8u ZޥwTj@97jpJ[D2 Jn*z@oQ\ Vk ??eB9(+"e= w-BPYQی~U7g|"J*x^7K}Z_I>7?c iHeC}k< ␫7ȏzx{[@1&?V㍭b)sF7Ð77B}Xh1p0F-H_I7cc BnskRZi iFU!4GH\,!2x 쑆xí'g>* YOdO0G[r¦h|T&|ᾍc;@Fvٍ [#;^=yidȎ`y:ы9C}hs.č@)kӼdm./^5;m ;1_hI}T/sR ~ ǹP~II-hXYM4ߩ tD!>lcfK4c _Aaw-4S&y{jP5>/J巓1ϩ} 807%WH"L[ݫ_ά[{ZK6.fZݠHiM| v 88j[[6M:Ҏ뗤alͯ>H x ]βkNg m)5t˅3F:*W@Km)6/^.cIQJ2p>!HCr# .-- Ɔ- J<# 8`Bx?HDrB s9I4l{wE>cb\3QO8 !/9*Byήx*GDC/k^R1-%$2svZ w\Ƀ|=&}eNiV_ϢE:r7$KDdTxsaǀ77j ؀>x졇%[:|)p ]/`GH̵<|O7]X?-i5]:*&]FPHx]6fi[ߥL^!'{B)| pt$zpu@}R]&"-[AtV)e'v7v6PEE57Tᯊ9tKɯRM[9fOv( Qrm(}>"6.jPM5#}Cf(W&z5g)rˈyn;+l k:jwsTsM@I}]F~Hqk¶RPq~ ,rp3t A9ǂ)Hbnhv՛fm6҃2tMV-@R]/1+.\} [ 88Z}̋XƜ%d%ȠkgXle^VFw΃uhgNYYvmxЁ+Xp p3bXqs`X1.\`>}}|0Oػn>s xvaX߅u5}M_yI? q7R=Re:RS V 9;%]ӵk Ju#Cʜ % 8f(O RGU\" E⤾J~+m 6| 6|&SIuR"M/!u ϨwB-_"t#l٭c<@9oGDPî_obV|*ݞMcxCp^z5IlnN>^"1//hR\#]eMZ0'Sv" nA!Y y'+mfjk p0qdפJYmXpC6}ڕc_׼gTDR( ?F$>CkKAD.&Uinx"zMOמ MBM3hO>6FΝ?g?v喩9cel߼;G/_Eƴ'/^BZkʎ*uE6ľh)`p>]Y_?ԿH722~3~ qhh4xלcˤ'*DD;Bl/ʀƚ\";n_sk&ȈO6;xgyng*(mQ~?{VeKE[Px%rl[xW<& YMY#S9Wk;rmww؋\o]צ?.{/?>H˫جVyc?aZc[例sWԾԡ"A"ǒp ]H6)5b ] r,71f)TPr>}4 ` 0\G62# @:ovS|`<6\ġFq\(vx.4=DdO6GxI3N!|EDSɓxcixCz(\TPʝ<: BU ^)wbEgΓZ/>hA<%ze;}>- 199#lt Z ['N N ~%T@1mv"D\s+^O( Nj;Xm3ǣOWG%qɔ0s~a8s!aǀ77?=#vwFie pc/\bO>E/[oՆo 8>& 8"]/UHuDyC!W=l8#ʴ*:ᩘz"f]{6j>NY BmE5^\/!6xA> q1^dٮ)AYج}DNqtu4rWBB6W a%2}rϵNz}I ZnPcvQK{tsQ1u><6xMR6S~Lvv Ń.nf)t7`',Y!%(N"x,޼tO"DNE.azyHҨˤWrζ$>A:3tWxdF:hoXb;B A YDO\kT(cbaq ^ǩcy11f.@a~ZO<,j! :@>=c_߃ƛ3;۳u b!w~vL-{<إ]#]]5Y#YfwhBO C/5!=YK[%1CoYUD9ӫo}:^iirXI $Ǿ1\'B]}"5yWT8~? eu׍yj $$$ [4)YTp2!?#a)0bih@ " 15t٣檝U9w_wڙrʕCeծ\І5lB0s"&~rkۗq/.ܗ>N:rqR4uuרiPIm㐮ƩmO GAu9tB2<-nQC̎ɚe-h pؽϧ|96H(}jO1EKv 8*}CSy0`ֹɋkCP砎v}ʃuzl]*-С9lɒl۰Rx\ulx5yÜXqJں}":NrW> ߌ8Xt8pd@w_k qxjѕg +u,ȥZ}Wjq_puеko@;CwոN[epB UyXsUp%";x1|~?5ͩ浲ӊnhǢQmCgWW䁾Kus:{Y7'TٛmMlhp0y|`pp;??;p֭/ػ; 8"(|S}orҼL8hkr|F=8ăݕ'=.]}WF=:~*pzlnY$*#/xNzb^P߈(Ļ9Bݓi ĹN[:Q Y"N}3MUw+qx:cSjzk ^_2ydP;'@G+Dvnaqn}C9s;M2tl]=J}4F!uyȔt>E+vԟ+Z &]:gLK4@տ^)X)⼱ijc^+`#'P&mDVbKҧ(h8MBiuԎ"D[8~yzi64Y?V'k?O) sKStBΓ ˘ft@Lq%4"c5Ҕ"J; rmP$jm5b(WhM_^@vu _SԨʂZד|،5@W^D}vh>V.٣ҠdB27q In8pL,+w|gٺ/}+OW:4tFKɛ(8FZa籀t>*k휀'pHWoxkJ͑bAtAʵm>>Tr>'w >W U+mq̠EEg9'ӯIqïTq KGEXF>c"ZG#: zIP{(+ KnGX~c!)'Ĥ2{:)Bɯ'r†t]W)<)鞃pKZPf_8(vE^_4 )Ҍg_V΅!lP,vpU^Dz熅s:Y7՗/cTq';ǀǀDЀ[pm>8J ӔfفNS}垐Nx4_)*=ḡ 8jfyQQHs_=f)W;=X\dwt' /um5=r]=WY]AC q`>uz2OB>:iRݺΑ&س.'[s+[ٰnd}\ec+)Grg-}e@3&YSoFE'hJMuM~f9}'%0g~yeϽFVx*=Br=&S6~ `9K]' oZqCa8Dn>WWIv <T~d&mxgNeşn,VO}^,}K>lھK*O|y vZ Sʶ ťL 2zx1]PױĨyevk;@)!l:fmK\5WI9d%RP=6s| >ߐn\CLIWcgiMќUfLŗC;Ru/W7jئ_I 8pkaX?(kUnO c1eLUyҒQBك%X]!pPM^θj=r*>>fXJ)&cJkA刹 فCzqBW˚A]='y. c屴%ƩZ"*S}κk^8=$r7zb*k }6y]]-HpOk \Pf t8o/bAQxUu~J?"oeW/< 4uw:H'>8p 08p 0`_|8xT_V;N#9I7:pP\t؁xn(|'3,L]Zw~J.]\WW6yTvWo~a=`~F]xW&nok4`{'ƄĺOBM]( EW=@>Pw?}<ml-sȮC2O9nl}+>ݰ42=}@k_ grU6`5(~]J- .TVK|E:00L K4<1nꊱwQ6G:SS?WPJ͏Py>"^B׏(Յ,ZtDYtrHe+g`J)g'OrkgINM7ݦi:>gisrnϦd*Yj\+>qHг|<2_}PMxs;>-Ar+xFѥ퇗i6lt޹Xl9'seJ_S}$Λƨ擈KM{ǎIJORQ峾#SU5+"B+&e̮E:s*B䠦+?8pd*r&v?w>[ׁ)_, qM)ajb"g+*/M?2ᳮ@e. Tؐ5?K}}en닫Щ5j=7U [O87,\E@3JM 8 ǀ#ǀ (8 ~q* {T7dQ{ׁ ՊuDo]!׺" ]-W+"F7m ]_':c B?|ɻfPl}ѝuwNF}<ml-sȮ8dW5tow_Iu=|O{:ȲFubzSJ<׫ӹ\Lʄڮ*K 1;'A+#枢ruY!_ ƀW FRZn+o|2I2M7ڝI^Hy~t>>Jc-:̏ӘG`U9V8pu\]M"ݺx=}燏ҟ/o7N/+x:oUMFkI6Jp=1.\j*{!/ŗHz$_7;J,tn|Jo?9b?Z'i:Wa;op^2N3ݳ E<_<ʼ"5kf!7`r!}"ƞ/{@r`9 &MՈ+ڡy/*^%ج ̡zD[ϥJ {ŋbu.Zv $dmOM[:8+ێOG+*#mͻ_}uS)~H2W9p{鼝1*Ol/oMo?ܤ_Jb}&{m/ljךNĴa-OuJUyЁ(u|:ö>tA=Gf.zdsIJ<휓u:C~;yʆ4YF@lÓ~G=-UE(8 oVC̮9u@C}g)q߭+d2uFy.Z֚BŁHq(2Ղ'q(!yPXQ/ch6Fco+Q~l{46*f^]W҃-:I[?.>N/~~J^N{i9DsREҖGdʯY[JVJW4|,_O[^N?rtOE&-ў:m 2.7SzqJo=ܦϼ8}Gl;],pXtdZ]"}=to&Ƶ8:~GEWWx>nӚנ3@E1~CDž?ߣ(", ϑ5( ,8<:, B^Nu77c^6JWs?Ae[x]6VOG(^>|z-:euG[G_Z 5NVpUk09Ydk 8*dsfZ.ʣMt;p҅h68B2y}/F6ǵ$ wؙ|H[eۤw9Zl:<(vPc;պDGh{GPQЪ3\Py#B%B+2v; YcúM}Ɔ<.sF*D2!4ezN㤨;ZI"WJw?J=BAW=EO}F< b8U?uZi"̓+6=vOϾfBT/ՙ'ٕMvi[}#x ǻ ~5FS?!Vջ2q@? i\r]QWqh>n^PYpTX87_ǟ@1^xͼcc x3}ŭ8LN/_P^{p ~Ie4EMtês"BU.oN)Q߯+e R!eT"r/&KԯA~7;k}nM?'SH۵Y eo՛8UԨut6+/U}([p];* \Z@a mUz\鳳ZFq3&}@KNYtՅ ]u؄ b}c@<򽆕8F`9D'6nfwI 8UQrB oǐ:oҔ#zY5b)lKU^B] 7aDZDFT&[8Vt1UYOEh=_\Yo}jxMg<9~tXe3X=PDfpTЈEYmKZ  ]v?zP/_ac{ˬ+ʴ;gOhLWGPg^y#ptB@9QܸBu9BKU<RvҼys^w,&x3b،'.'{ɧӧ~FMF}bB v:hؔwg]כ+y~҃s6rX(~q5ɟ tϷ8 ѭ錘M(2'rstٻӭl}4ʜF2Z&E޾q9`+[oS'|(,)wl#3}w[[,!,OûD˗yhʠ3@t('ae"oW'C/(y}B!'v93`(σ 5pش@y`ݶiۈBݺmc/ 7,$-|Q(qpD혞/~*}W>XCYzž*N&L ڥ9R7A]R8$sw#WyɿF_ڮC舲]W[gcDɫ^nlBz!3ǀǀ сcN 4+,sϧw\,j]"Fy|'.w0h 7dP-=%7ؚ)T'x%UD2h"E,gG쯁֭H#U2}迱ʿ3[/y+쥍Qo.tF߁.թle47hcs6_]讟r=ʶ;yC0q{+T#ǭQht9h (D@_ٶL[yP!5JS Ѕ\]|}GU渵XEIzkt)i}Ěa=kbuzn|("hNB&QPV Ig!jB4xs@m)B nK_@8b8B]buL2'7œiz<}͝j^*3JzX_J˯^gb) 4, gƆ e.ҽ}^?[/ߒey :=O_|AZn&iRp>;G}3*N8q1yȟ^9āgn<7<>:"*qd6"0sYa[qzJYؼ{F]OkC-UF=ufBm󞞠6.UǮ~Vj ǹ{f4Zm#Nְ8ُZ*S h"Uҙ&ZOX6Zrun_|3{ϫKD_1h).~ן#(<]*~L3d]0A‚l ^&AB=-q"~7\+t]td$+[7F ޳|L^C,u p JJHD̆иLq {`4 ,! O P)O)Z$"f_OO zR@+a_ {PFKi_)+z5]LS8StܖUٷA] o5`5`ЎoZVPؿ[mʯW˴\\*H2ˋ4ql>Kz*qJ}a\g+"27~tǾծ ^d~z.^#k&mxXV) Fe[7J, S2Cw)ߞKS"V39m%X&߄/ ];2Te݀1ާ<̱ʆ^ȋz43KO:}]̑|Enq5}\7"D_CtB۵1XA_vhc~Trד61ͣUxy(O7g]7yRuG 5].Ӄl}7MՏybcwl; dBs}$f"l/ՈδB|U(f!Z t]ZmsV>}OeFn}Jk(2"Go{^eEr\+TϿC^H~=#b^ֺttZSDP\kY~*"rkK\"}z>c>n5굅_eW#l̯]o\ݔϺyMU}̳\ۅWAeX/e5;tvߵKˣw #Fd 1a7y׸bn$/U>.nÓ#|>k}B3;͟m|0` 0`>(8tKt:IXߟDlnD\Mc}ErZAqax2 %#Uʛ"nX^Ҭc"b4U.VH0?#4"S:VM.[ e=T߇R֦,Sgl۱/ uh |@W|x7[Sei Q-+aM4_a3~9]>vTBw;Ӊ&O6i:_=9}GKѱ!i6w-0`FHM u׌SPz.86jnux*ʤ" ]Pknw JtxߓxU6aʫ'QM*]A_"!lCӞ2=_ݡʿJJA>N~37L D*:G8d@*].m:чCD~n~m1>qOqt7>wuai*j#{5!Pt; \ϓtԵ;e\.;bA>A7joˆHuYC۵p'~/74|ߪ jV9U.i F*v\e|TZ}Lލq5][[m{+/ [ x 0` 0`:wI)L݂)g)')"}߶s&W(=DozzFS`!Nc2?Ce߶K nY(⍍(TQr5W V"\\7Nbbx:~xT:TRxoWɶ>O^>BU~;"^PdCu=]oc=wOیaH{:};)Urr_ 0²U}`O/!jqmWXnqXNJ͹6ht(},vo>zoYƏono}+'%wkT"mz|Ml҃Gh$]>NogQzxtO2&ɒ`9J_|22=yc^5nJSY&ozU|NuJYjY6qP]ud~j)ݛK9t^n귗ΎGn'֎tJǢ*U\(M$3%ət 4IdNu x쁚M04LjS툡@b9C|I3H!*ED$"~] x )њ9tIɯ2^7C>fu\JECԲCm{/ʓ k2+(QE_*|mڼj}Bg?q!_ٛu|h#١cOW'^O~*\0JSҁl6)C7Cw }EzH?|=O~_2X_!dK; $'ZN0OjكюBӮU(MFn%a:h#x[* teuu5}u^90FUʷ'kiك|d%EvΞZ۠]GU45@aǣwlPE%lG| 4MN#lr Hu(t}"lttػn^|+Uru[חBu74y6A?Uנ.@e]I&:W5Q}mAO%D8YH|0Pwlgfҿ) xN%6؀ 0`]_Mi~D4)QL)76"%ΗU7+0jk>v Wwnv}EES.;uaA6B.D!W덊 ؐG{|;}F T=Z-K!b,RVRL;Κ_npSs*G*"WYi *c!ɺ3*RbFَ=[ZZ[(:= ղHCr=bXTn3exG}S6Z6*멣ǟd @*?eqWQWҡn֕6#H@:}M\pUq˰ACБX8┷8GkSldtf"Xq|i>woF']%7JZ7Ix } ڀ3ݗZt:۳i:wOM]7|^_2WRӹ/omҏ2}N_/,txZV*N 2l?-/ӿy/}o~e8}ju'V{R.Vt)=u駂ҹa!Z=FzmR۞ge@x]82O$LB{y>!`}g9}xEzW^0=5SlLYP0:}xmH*6F)sU]Iyvq(-M[5G ]U4YD(F^^OƑlcg|J{?8^5|s<8)eA>kmVZW^'odt`~&~ܧ$LSkZkqFcOPLn-4B, bg|&x9Ci˕<fZg]f@3^~Dm%Zrkp| =E:66/PE8FG*eQI'6Eh+pH Q?&9/c=+ATr9{A'<=]}}֯]1LaSE=AS1/iZ2uNWa'dTᗌt̑j^WW58 1wLJ/{>f 0` ?F_7wj~x3\Dqߚiݙ GivXqx&wO$ddʥH5aNihODlf4@B(|_DkQZ<>| %o&D;hTLy@!?"aӐ@)%x.Hސ㻧j&kTcrZA7uYlC׬Y&Ub_Rleʿ(8TW~еYAUs 5H6:]hN٪LF}h%M }Qt͇|mb;:] M*l Ʊ;5%=I@aلPD>("}mG铯oӯ_Gyz}3KoyqZd2ɜ}Ɓe 'j.|Mꂱ uM&W:yL!˺J뭋zEs4J~yϠzWb΋< kYbhBמ4:C}Mu[9͟xJPS\1^cݟ&?8=!]k`HQ„YA§ܰє-2-&AӁMe ,I}o +-@ *p[dD[8oAR%/'wQؼWvz^!aSM ʁC2:TeӛnSkGV?mjCWw~^j-JPhɃC}nuhD "{/1` 'p 0`_|'pьgӈ@~~fHTy,o%nx..Gbdxj2owl}7llRVߗɃ+4#ËvQQ5D% YT:8l9ӎ#qF~ P2'ܒj{EƛzvFˋ8|ڙrAfdrfnR)ZBf?Y [s" oe!]&jYTɃ>{]}mЪK"&]*͙Qε}}} ~o!K%NǪY`龬G_/Y3H7:vˇ 6mDn r@VpZGPGy'Wt)ua qvʛ>)MgjjV<)b-sT^3$ |t?Pke8^jk2oXu}Vd_<-y"WxtT%XHJi%/PyY2ڕ\&G]ֱY{ b| ȻL{N)تz=!VjqRr"C2l{$Jh''E&w"tV]IDATnjX] lv+xAW C7ݢ LLfwxh3h͓!*TKf)W6W7u}84]^\_#>=!>"lR'oFXdCrm{+AB?$eD/fa=W.P!ʆu=kꠑ))o@4(>Z΂># ]uXԓlr.ߏܬF慎:/Zԡ49ǣc(z3z+gBF9Jk2Ź"KE4kO5˚v+_>K;N<ݙi~{ZaKXhdPfq::Q:(:Wo=/O3olү~a~ _X_y}~mm87Gqb:I_JޚJiz<;N't_XWuZhm]&DZLi(p2Qjf ˀ[+}TkȚX"I'5Ly׵h&uGONAtKwqPwD/+Z^Ok:?}4} 'k_Z祏=M:AЩD礙ESc'1 O9Mg#8r WDqbMw; UO(g$Kyr~ݎtqL'Aw TS8 6>=Th_'Ż}x+;@oNC,L  oOe'up=dawy^NwhH mweIVEƞ`OA<P'O8>z EMXWer*K$ ݂ljW ^aa5α78ZCD>'pXfA)*ot2Rݗu3pЂ]Y/FfD\٫/qFa z)חV2*28*[-k*6vt-V۴'_Vڲyt]jv=njC'u]u})}yU_4y=zobgO%^̍l|7CaSŎ+\$V?c>3?8hvtp vb%M[T#Vx zM֛n5#TN_{} HL?߉|'&-=|fnw`*.{эlLo]6sw2$K~ t.yM"`g 'YDHG A7}@S5ve%<@o$Jr/ik)y eI]qf-ʺHWPqfvQqÃ23IV!LtEA)O>.+iq -b"m7Ce[ZDΎI=Mn鋷;~K GXkT*xʱi3պW68+ug/>H_|HE߸Lk|..."]>ZʯF*踚X&i~4MGttDz콣%RET[uI(]Ԟ#)UN XՑx2 xW^US+LXq%]j}[k{s:wחWߑ}9쑿):zZz\_V&}\74GFA/*|SfD'=QyZL+qZ+7ȋS:Hf룓BS29ݲYiQ vl)53˅%czPW7 ץ{VX Cz.BXqBP-SS#S$g堁Ӵ], ] NO8OK?v25W˾}/}'8 }C=6\Աe 0` wweόlo,);p*ވS|͎f:6-+ ^c|4xH:>I>c#dݳhݚ^0MҽQ{ t[dq9=MGi*T~{N=q/)E:m'fhklwosa P¥"CnS$e$̝ck ' xAbFH7F/]&WăY"5H]C~(ox?5E /{nG?e"__NElvxM <-RxW-'3,&$nѽ4z$Mʓ4sfgl5c淦qnhxPOR G=niJnmF*m..WvX^J5vP%?B tn5u6qZifiztKVhj:#5&ؠ>,ҿPW6 bJZ?ֶfyL Gш~yZ'i"7Ml~ WVc/(: u:A# mch6)2\IZL^eR/]C(/hShdoՏ y#T&\V|לkAu陠bzF7z/7YUλh9Ϗru_f( 41΃/X; @>/w\dߠ[ ~ 5myݎp50=ر|>vfTQ^+MǼ<-l}7|F7 0` 0+e"7j5qIƐ#_:\~Uk:)W(rlpٰx8NDG)qs2IN'[;4p:n)2gqz6IGDSdƄ*;OeCzYMڰ!;Z-oAT}7@5:y ]ߖXJyԳIMau\7!({x_C#ɻDgy7:4s&wsƋi-+x uOH-T THU@OMdXf-{^o:g<ݦG5ͱ:Љdz'u:׎i8Oqx.vv^oJe-D^(SIDU&,1h(ͦ4!4ac[68XNٙ0ttQ˕5וRt3=ڝ| e^Ct=b zCoNr5= 0` 0`_i6T6EFqoFif*#TߤM8yQΛ 䞊t\\L::].VirlaQ0&?]t^qsG~jǭQװL)4IIn~4NHvt.45_" x~-ExQvzvrWL4SɌqPG^7K#'|7HP}r$ ˲\͔vc8VL&Z;WWx_eGo*EU[jEz{N$s_w6P@sj/.TYkq0Ō5:M4Ռj=yIEj}¯։5'_Y8 lX:tvX)'C: ?C:qIԏM8İǣ1U++ Sd)|Xb 0`J상~w_MivT_UgǓ43"?-5{t}c}%˯'sͥ`28?,Cه42 x^G"ͣ3?G hUo*Ho'yX+.q Hœ !ܾlY8T;J13s9IiJ_`7wLS[,GnݕJH]:j%Kl EY¦nhCJ60`{-I->~AOvq#f3L+1v$>0UGsUndd>)jpD5<ڃ1g 1Qmx7WPd kty^W.bp\6xu9@ s~ΠWqo$OJL'Zf(:^BUQ6T o=W@xDjATDңF+;}c鏊ߨG(tlg 9iZ9dΦtW?e~Jwu긭cE-9NǛwC :ШMȘNJ?/OH~]h/5j$ה[<[pM'{sӧwZ1e +ڿV9C8JY {Kşi.s9q.r<Uc%ǪppYF/F, DmDjDsaB8NeZܴT݋LZK$ftHS cd9et5';r5b.d2hRHm()owY|6%t|/>' ؋h;B}; : -sU|DHwfFuU^ uU~ +]cT_! rst6NB\q}Y]t?O|(}E[.=slcp¹Nz}U%B]<3cvErr](z 1)"m;+0T6Rl &,:u:Oyʷ>Ԅ=^պ\u5+zS-y-t9C]gF}m1hT8jtbo"#\i'ʃpA~x=`ttk/.ȏj}Q>IЮ:0tk=t= ZP9V&eR|x{wp/~tt]X̓nuӒx}u{·?Զcot_Q0#g l"cĸԱ]RbMi%^PdMU=R[0Yȹ=2GQ#ĥ\CN3w)ܼ(# & ںP<Aљ? &9bβH"Ԙ`*ΙN4?A @j2F:| zm!8ZOyi1tly~M2#;1`+Qɖ|\YJϰP;aVbrxL۲"W]tVH'pX#ͽ7qC;MzQ>r:JVّcc 6mE?(/oN4^ l%r& 7XI߸S\ӏүooہ2V#陈T3'!14- W&CDM_,W+k)wx]27%"6/RyvIEdCBΎ4'Mu,ӈ?Tr4!=le;੟(_/z[s$zgDv82_?Ad_yR}$:zk"WUyd/FKn{N>:zc3|gXs#E)mhΏ5Wq^oyAmktyEsJ>!VJ5#=udX݁N_ײ d&k]'p""2{dE-M?6pส^`zW߮Jij aaM^S_av:pgت6MΑc08p<8 0`/>r Ttȁ{  In=\w٪+GX ^_vFTߗyg9i6~/b]*棆'ZS ~_Hs4. *cQNUؔ^~rLf3V߇f7@?HfKl%2xq f^k"ʿ&8i .:Ș`5Ҋs# Cۂkv ҥːj{[F5eo`[L8𪃕8k;pMna eF 4'GyXk*H)ⰍY5u2=~-FSu|;/E dN1Q $9 5RB3_cf͛5֚e~Jm&Ze\T^1AI]{W/ȷTVűM䶙F=v>~Tv};<3)Uy8 7U8kws+AiOʁC!O R1SKTG;( 9׌h7 (Ç!_F-W~jb>m}e^;4P:N|YtN`E C_9Ǭ6A7,`*gZ"4h wu=)v.(7+RysrF5[*xuV SGltڑu$Mt\\//r[>21?K\SiBY訒r晎 ?zp㕆IYʠ]$ipt'yuX4(zbinF?'rh{S$ ."賯H.eN Ez1fen枫(pH} >|VJ6bcQZK)E~Lx+-Q$dbxm@ELG=^q-Mt肊(a-H88N48pcHc8QKZʞ&(8~mۦok)O_H ȌVZIV(15G+Yya܆kJevp~uב6|UEM 34: %Ͼ^)hӲKeݓ0r?hWFHs ~9^rG<04z~2 }&?)̃Qޓnbt6U# XѾ܆vv`'M?O ~j"wqdIYT3+^n>1n@?7Ɯ?7WZ"U"*|sڎ!F~ugت6MΑc08p<8 0`/>a'7_a |{{ƻL"&8qg@V;Ry=ސ֓MڌɡR,]c<+@3I3 Oo+[q?)= JtPȖN+>QM{_VTQ3_x6B~EKH;赱 ʦFh+|8sX/ 5wK|ͣ&_J;lh3~:E өGFBAڑk9&2c6ѯ(,T4%QgTg>l4<Q?J֫4OjA3~UR5*"2F]DP5񨬠C=ʩ#]l) Ks~ts=1Jo)1n|g̺@^$kp$Qr?HI}͊Ry% 0ٮu.ױ^ «#f<;*?d \ĐmjNPdkPꪇBؾxu\~Y:Ҹ Ht{(O7kq:99MC?3NQ:^^V(fۛ@ ıN+s^f6}T m ^G OA1"] S;d~8tvqC]ا,E7ڇ~pY֮Eڰb{IS6؎Ba vi@Fȷ=ic8!94m}Y=(vqZIՊwwpR.QЪӾNSO=Byl7);^nbcum?j'B˞:^ށ jGI7O~jougzmU{&H>G: Gc c x_pȏn8L.}BoHb篭|%xR*bg$Weޜ'.WTc&ׯ xJJx?~5$Sȡܫ0I(,ٽ7ףSY2 E͍Yob'X!e5J7~sRB]V0wn^n|$k ]y8pKZe8WMRDeпԦ>>].FmM+_:̱Xr&jq<ꚍMhFGDsd~ڿ7mt:8VRZ%k6\4`>@Mx*P7C7Q88Ŧ*FP=̝RϤd)5P}vNAK!*xp>-ElL*{%$<FAs83bⴗy:V䐥<7JyB7E>vJlg15&/: xD[jk,QDe hCܢ~K n#!zLOF8^g~uB]:L#N}S[2%ϤڠnPqDDZ8F鶎c 8t\W=-Vف#'p ;pXWސ_co3onCM;pPA)ƼcV9pPdKB8pJ OL8%_./5jׂFe8>L?Px:W*Ԡ1.&d83RngOsY"NuJ2Vd}7 ͱ@`lH:z҅˕a/f}gLT MT;.R P)/١#϶\xR <ɹyl)]Y0Ӑ2+U.[!=e0$5+@̍C9,obRѷ-~gOc!8ѿqu7Q5N?[^ItHJNO_M~J&=i: 6U|MO; u<^!#ؙ@NY)Yln+D^-k~PAS>XkNg9̉~.yLFƩ2/ő8TPloCz.z].;@BGei( 7VvEnɲBQgSwĩ9'UAtBXgv`|.@K ;m (d-;Mavun^>!e"lědx :PB bp7#USs4;rFu]MZ$lz/жW64f1`C8 Q_ovs`:?t'p- q#ρڪr Qֵu]J_<ؘ_ aUI J/зBmRIvhZ7]_ϛ hDMEF!g L[gGG޼.oռ:c¯⏭}l!SnjP&i9?BfhDM}\ueZy7: #*N8P0ɧ kRRzWkG?:6-Tǥ5Koxm\lRL&ƞ ld}8lxHHuP  BgAXrȵNۖ{d(SfX:%XuvdK 'pgQ'<[<ΔPq&Ua _غbӡ)aAn/  C1t|]gSk⌁ YO*rDPY2(0ݦ}'ո{6WyݲN 1b%qICsDcw*:тuW!ܪāӇv`2+:gV{g~uz??C&j248BkezyFϫ{k9U{SǃNz1;Y<5CW~v-UXIPVOURruuKwXT[,SzU>Q)==)h^ݚG΀GX#baWK jӢhuQ}XgC'niX|^݁O-!8^\}aI;7ޛimRy@MFJ`ZqTe͆']W_L'dNo/3{BDž%;INkNb 8z,+_3c ޫ"yV eԿeN.|`qꬊ5099K(*U69p>dFZNtēx9EdV[4oG7ײP LAڭW }4jK^7 yʓ\Jގ3bn)SDTa'`cD\pfI7E'leUnô:@|\56vyFp=לz24)ٖq\#aU[igpC}Qo6iƢeף1-ō-5dʠp @r9j9pHͯo>HQ:7?~_dt"ot9Qb M+TSmئx &J${f(;)sv@jP:vW|ɻžAŧs6וOu9t\{+Y:mGBnsO99 І\Tʔhq͠IdEg]q-r}htTR&B? k| vp].QnczuA!BvO&M [J+ -uā#Y굎ʮ'@{,/vI6H ] !Ӓm W- W-;};p9}6vu_׎+m]{6Uty>}Q8p8 x08p<8 x " BxP8p }2ViEU^$R3 dYy/7KdVUTDntrRMuGA27*dSzcVQ@eR٣|g8Sy·>&3)X:LD'`aeh8dZ^eN^*)؅TѶ 'p\z~Go-d>KotgtQcIetrɜ@V,*k~ 8 gII,&rrg~Ŧ?jM]6d,RAxGڮ@Ȏ~/%0z*mϞ} ܃x]lEu6QPk1Ȁ(]۔yB{lBܴ!O@[96.ubi)muTgOaӖh[nƤW#y\cgad\oѠk_u}pyѫ8;p38p apx>08p C\F<4t8lv8 3d2q8E|_:| _(P_2FQv\Yo]$uIkkVo8ѷV:,Ɋ*n-;oU2`{Em0 D C&gX_: yMʰ>(k.+6c +2z1c:8MS\~݁caBoѷ#\xI )Pl koet28y!g*x6UljqVDV"s>MҚ]\ۮ1Z7(%c WE`oFɿu2MGt4ilNuhџwEXܾ-(:6-\ 8˔K6=mXnӃ˭X`ٷq0Bb3P lLTʘFW(A(JZ+f:dX'3"Ezо&MǓƂELiK`[)gy(7"E##DtX7O8S3*|I^ռƗ#v.UK23;p;tne4Á'4K^KM_͞q1pPEj? OѠ^t\p=x|'oL*͏gg=Q+VX#|T=Ӈw@UznV5ty[-ZIu2WQv~ Ц2m~hYW?-˸ax죾lSߵ%8Fǜ6j@2u[}D~ī1J_ڵTBep!zi "jGz.͞ьRSG>/$g-mfY ښ`e ]WG^{>O[дݗxȓXvpLFq|e'S-M?8ǀ_p}jAX-Vi/lA=8\ C<ʭVX," C~:Z:z(o_|087vģ}oŁC j=J;.Ey=zkg+*XFzLeحAQ)\Bzʟy#M1loFZl ۃ:tJ'B4x< XY<ٯPQOz,j_ϕqG(oĒ<n+,AވNJ+N +⸈ِS#l"fC{1#\#_o} 7$t깄.Vk;{bvV#VLi9JtkH}4pi^%^.[ç|Gbԇ:ǟ3:Qը \}r?Ӷ}ݗ;Wr=Z.Sz2=بm8RasW ʮ#Uj됀J|_/xx*lrvSb̄[B1ja ~KO]P^`-hC=T_ #Nfp E<ƭ+oO$_,u ykZC0pTFF\ ~IWn9!D)_kj ˂1j0WdX8plV *;<mw-y{, ;[vhl_u~_d㶍T#^K  t:13 pNNNpxHǏGّ8hSG8rDueAw=<`g(f |FM|{6 I/|3AF%[b#5+GDŗ><R^VatM/X 3}=a=:-APh8pDKB\tgfw^M@74:HQ+<Î*Yu z\ƺy+v ؜pRq6O QeRm ؤ?̿lE:i!~}iMZ@ċD{J'EzE W勞/fݴJtRUڟqdT;>664w.Szqv8m 2>/ޣKo/W }|k,m&':NY`)#*F?S@VVC9;c/ss+ J4;>1`;OY}:w8ٔ.-}nA7Fj"K[+!t mSE| 0jD0[vV_]*=^ 9wOX)Nm빮 Ӊ6^!pn(|[yc Nl7O⠙,Vy:쬧KTyJvOX.*6͏wIJsSiM20JI0.Gr~@2O}EnE^wyEsumѮYQ)_0(k GS8pp"}&=;M?^GLdN| n;IsoHN߁k僚 ~+}hbEas>KLe-y|#P5+;FdPkW3gfvsX!xg PUm^Dk[h%u$2n;gD'9hCh ?JHASm?ʔt]sV ˨*y{2B׀) ؙ-hiW}.h+OCum gWv=Cu BWQW&l 8R1Xmݠ>x"u'B<Ʀ 3j^c1`|`p0G\v6qc.wI_k/wқo.//m6GMW;s]30}(ḑx޷ƴ֗CϤuGk"y=*KpX)O[@IWَCyu-\.o)8/ ꍝn_d7DA[PfJH뭳a\AzV=Z DuiljNJGvDzM:^]zS>zQ:)m [IKH3QW}⽭zx;%/}n\l[yOYVpco.uD{>` l2o Ʀj U.Mͧa#9Yҍ5/qFȊt~OEIBen76rhÞj4+y{us,xtq ~3.pT:qr:U,6xUvG:'y&tWy78O9њ"UJs)_x+/ޙO?ʯZfE To+T>q/BE7$ ORսԉ6\j*[gS6:5bT:V+٣HnRn0_`V/I2!#MMå |.ɼF_:;6:J۔*8KY~݊`u/էWp ]̗->78ut,rm+rڇ^qoOxIv!Nsbװ<\зycW&_H,թ,AeZ,p̗5k#O,|9`Q!EF!v}]kPIQ rSm#ۯs[I? :y1^$R;p(u+"Mo?J|z>$2O|JsO߿y.>i"zˣ89/}1q;ƈ[M>d-.=+zќ @I ko.~ e=ؓ5eI]"dMؼrWՔcE]pҕYϱLL$\:(Wفl m9m!jx8pd=!Fk >~ ֑JwGt׀~؜j&cNz (nŖuZ`Vơ>}n;Y#&^)EIe5Z%kXkBYڨm~ꪫC"w#kE@#G9nl궳jːlGuOCz2p|b!e"#p(]WP_aSUPwkbq:}f68p apx>08p ނ06iZ 5޽nݺ|r}sȄMFFU$@%_m . g,OUyQNr'N9_U+7'lX{9pf8,st&ͷce<-^ׂ>-ŏ'uOQH6 ~:Q&۞@$mne3o[x:*oحTzF/z)"6үgQ֗n6vr.]o?^7Y+76s_|+qǛi:$=zz3cՔf6jdiFy#4K|Fzd[9ϨߢE9 Lq,4l OQQb z=UBE*^݅.xa q erE2܇lO]S5&'w>Ӝ)wĻEz:N&μ1JHcGOү븲4:~>Q95g2z=Gk?ĽUZxpx};IE|'}vz7=$]8&H͹yJN{MZsyUw5qcS:i-Y=GNq삶(=rP}dtW@V $PPt?6 @$ 9~՘ltC'nuIT}R;P/ t ~*/ ^%ZY9WǚCuxN',W'?N -X&ε踱pX@@ 8jipQވ^ڳG s)<'4hgv%w,G`G졩^*D[s }]OkZkR>,qǕ>g.Sseջ,L*C=Id/d9t/n ]]"O*Euك! ՛⻜бm-mY}CӾ<_PچΞebDK٦!ݶDP\䅞˕\7aPqPͺ8Dy-6}Y\u8ZG_ }WUZ|&F]^E_a5vN>8p apx>08p ހk.F8m6g_z9q^%^Bȍʚ ltwJJ )̚$̬#5aĽLt||^{Z7 BGwݗfuuR_9ri@ȢvՀW[UWy16JCPafi oIoI{VGPj 74n|2er RB~Ml/:>;}gѮr} s[ӣizx.]!%,jZ7ˑ(/N<ɦ5bfԛClxɩMI*WqۀěM;`A8x*ޑBCL`CrT:嬧$EyyD:<</ ՙ ;"RwQJ5ޔ=-:dEBwLJOثCV nkKFPH]cCuYOfT[uzA'N'u3Mz8}h>4׮_GԎo<?}[n1T4-W:x**a^o~5,R̈<7'|]kO7$}C;okJodi&-Qk$-<.xq ˼͝B$uؾ\nGD#ZOR⮰@qPųXAUؘx~eb9wve^roeiǒ:PC>ItvRwmĨ'B )&CPr-ySg w?-}TVr}`PkEK׼Z-իtrihY_k({s.w_G!+>qn`'ן T}l EMʹ!W,}6 Qoc%5^7&27g Fdn2L6# ?[b>ȈM<=#_cPio߾^}UT|?b>_|6#o t[p~OHJhDdϭIa_Ž9G˯x1)aʱks؛jKt"Z_ JtPg'bEOh ҄Fgn2(-Yö\CI>]BBot=+.ИZt0_XʨeJ<*L'!|ί[q''L~ʙ3 Npȯȃ 5zg~u9N~MU c~}ĴvlGx~M[;vWmF?K7^W| b`}Al8'xVHS_^K+'q}T7c5bN< Ee+AY"G@{=lcMc px[gSɜd$p<Mݣ*۳X:h-c< ?O4S}ܞ񑮙D#g/W]98\ٍq[?!iG:Q3G ^@[L(E[8"#栱@d7 OAVhk0E4+ۘSYU98(uEeV-.Dua5TEztgJ_sMҏ~1+z*Fjc' S9x"Gr 0?4;S*l&LE8oz Bsν֝lA.1;u+Ǔ{~m{g}P]k,0*\0'sau󱇻s6b;@_?ϯ:)VO; !<3TGg(βkUT̛31<8l6ͿF&qem\䧃;4ySx:aSNu7tpqkp҃tX%$.##Y9Kv.p*٪5D[!K%pT#b1\ZD#KϬ\ia3Ynu\btH($Y?wn9b&eNbf̯.Q㕮GEnsHٚ@fL> CPH@/R|HV:km!z93Zhb*+L:X4"g9=eoөL6}d'o|KU'i%׸rh>ڣQ_L?x~eRsd(=м˥l~${dK</+tK;J'ʡSX[ёl`Gbn+!ij^s@BU絝ÁI&1q8g78:^>ޱVf6+Tb''U[1 N T?!2_#oyNi8B6S\k˨瓯*uxVYo\WP]TSs.=KM犡hgo\^&ZtMqm8x>l'/iOBK]4p>յ$]GG'Pg4 ,HilX[Ea[ۣm|ܥ?JN4W}ʯ:h+n?O N9}j_AT>C OsSOf( /jJ_/Ǿ X(/8ads @k}P7 waWSBӖn[;xk"$.;heveTKdfȻ a%+t9xlnI\1Qi"M':/M]^ /A9׳O [,f PYhU :vS>ħce)ЭOUu<ޅ{F]^+&Pc~zzhܻw#V峟7O#G8p7z~OǔWkTX7ج{2"@q"{+ZkW)@ijY<3)Vv zttY!Jwwm-`C6qn4GC\Wl(lZli: v&IΛn*WfHr3 o8PrJ_Wmiޤ)>I!E؁ƿ%]d&NwMO`Kg˒~g~(/[)Ų}CŒpb #Fp }!"\+ ,g)<]r5S.TN*SOVvY?omKե/9^Tt OD\5St3O1lQ"9͆7㌜Tç?AQi(DÈ(:ku&Fu7){vxF+킺_ttj@ZSntcMxgt.O);uFGr;Np1M?"}q㊇m\z1Jkځc]86mܧ=JUO]ώOc8@s6ugiIqbS'?t٤&@?e`k Kתn")r^#8i^JO2f۔9B>@V>w0+bix9e1T8`+6J# iVlĪp`15?U.8rg12S18y"R5OtuF&2rBv8i,jZ.5j)W_dXq>J*V<]B!kxF`(ODX˵ >tBg2xY8#ZtL"" <`_o;YYTs*tam}Lz難i6?O;_Kq{~=֯ҿ"KIsoa#m/4P|5v52 |1Q9f(~YKN 3+4fT\0+݂*/Gu3bu rC\0rp裝Nc^tS9|tt܁6r ҁj iM^ONN{N8z-ZO3Жn[Kَ;ȯ,T"!RZh]'pfUVP ѵ$eS kU :Zxmo{qzjO旼V۟ QW+^ypp0y|`p0݃ n>B8oS7ܹcw&?//󦛼 獗_~9kߞ;?JǶq YOѲ%Y'}ӻosf*23rDJTRA IRӨ-`*1/V 订4j`@@ $UH%FJQRfJ)e*Cs{;oǏwwv3۶m۶ᘻn'E] 8pNN8ptb@G|l1[k[G9OXg=\u~eRՈ G]& G'eldgiT[]{`g5{PS>tj:\c7m谡HS6 kpF T۹E{,}?fVf0 cyL"e/%<ɗ)7>x=>*},&.ɚHZ"+mz2E8_|FPP6+E97|$ /T6 [Ac2Y]eILq&c)il]e^)dwtz:mȔBQ>P%]@ܶqi`nlc6ۉѴkOuG>3׳uwчZ ف zk5{ywca?'qرC q?<Ł8OƁh:s*G|z( ?\Tl}>:5|-9SUPyl ouTkZ'$oc8@W=A x4IewYZqS&h>xl }S1Hk!>k;d:º]e;>,6yAYqkhk 5DXD&lU^J9Ѫspk[\w!s__dd>?bHs@8p0xs}1a@<',dl^lC^ E06dH|E>Pj;2B0)GECL~_Ku XrVaCSfm) c\D甆+9|(x9]P(#?#oͿu}57}77|7{=>"ā#K8syGa-NҁpGy᳻N~]|MRwwpwj[! ZRz9Du"^o,M*hUuM>G~eoU@ZY x4Dw9Qt*]z!E|+YV§M1\41)>GϽ,Ux"?X"xѱ 7f[w~зsÎ]2{| #6ݾ+fǚ}x 'P 2N}GJtG/ N-pT7QQ-6Ǧ$'J3|3P< >i~8x8*;$s:ױk^hΑQv!z1xi8~w-;pۧԁ==T9k\>I\SG'DWDr\be:6K2~=}GdpSI 3uD8 >J[xoAVtיV*v޿$2?_U=EsMpcysBOYc-'<s>X%I0}hUҌ8 (+8p(I+'yRR˼:mʇ%~5S"sa݁5_y}^~ frF׿|z#.J@t4z N3AwAcdvN/AMsCTw(_>J{0ܖL5{I^Sʗ(#Zg}:_CQgY0_U[J{ku4VYA%!%V Xu}אj8ꃇU`} ڨIAUj*#23߲ު/žv ɹCls ugqyB{^ FDūG9DYW T<:#"){G!]/A3ېƥTdId -Uyu琮J]Z ˬ*8ցE{ǽցE;G|N*1 ._N 3XHÁrNeᆨ7ttGD<|p-7@qAS:wʦ8@0c>QRiZTFy)8t?FkGT8i:ͺ̼/(~xyǁC;?BH=sKzOf1jR2NeP>kPE]ʭ%P%f۬bZw;rwlod_vw$΍ ʭ^.פ/;@b'`UED8*OoA8 8Ac+ӖXt5&NcT4/'"hF'P;h/^:]I2*c<K~6؃B/R+Iw뒑Rué^C_ks?usoCzJZXq 'Ux?hm7NC*Kcs+ׇ-`|'z*Qa9TNmDKjkm5,#xCs| )@E̗p 1`i *]cY$GU9eD̿m3PS] e,s Yo#(1SXGEJۚD 2֕р;Y\,2+Eǒ*dr5UNWq/&bL b u:Ŀ"|"ԛ iS҅L6z!l2%V/e#ߙ#[kz{l jx\$;EU}B,I9(cG9ඪ>o|.dru \]B-bS!cOJ / @üTw^!WX;~5(ג uҤ(R Qtl_G 屓Y`8؆Lon6n_ٮD5Mx#Ob ]I9c]:/ęJ׍BԱ;Pu w!y .GUW_ԓn<7&_iN\<(c;j]HYP>qɍE,ݗnL&vT{*7x4ŜGՌaN2:"-R;MD֙<2|rNF#HTߏ)Ȟ1F2(+UvK xM9+l}ty?irqBh^v킆e[yv~C{x8?7mi8io=f3f?{}n|YIhKؤkywxľṔDzǾ&;i$QE%WKAwu9N^5PK' !#@Q_KebHeS9=g"5ׇaO^ J;4,b3T <> C f6zP[/1 ©;J*A`>B>ԃA`䅁\M^_i& 訰X(ƭ xPd6''\ݴ۶/Ե~χӿLSMG#TXCgOe["a' (|W }Q@:ʿ &QC^#%[BMZUʹ) ;)^zXo1x+PZfM`,LOu9ieƤѤ/\VUv:_U[f+v,<8ھ㍞rkmZXJuc{t}Dsy}9NѢŽց@Ѣ$n~I^N1w~wݿ;sn__rg҉GSi8Z8J[gi۰yP8|oǩs݁ﮢ !^7 Bl6j(l,.C=%{%'˔yl>d^Dﳭ=9l)Z ^rȮHvSqYf5x>OjMQ_ EDu_kFF"[!4%O-[v{ }>dFl/Wq4q*̞wOZi{{GN8{G7xꛊl F#YtcĵX) n|S׋'QwH,es:T r|$ 7ո ?riRdxCN8XW&w=lڏz􆲨D;Tp}1AL:Rx~BwUC~g6.͡ɾw~ϗ+W{?dO3Cɪݚ>^CnkfTv4Zy P.`}UT׸yIQm*ԖQ ?Y*^XU7T+Ke݉bIWBY/iu)k쯗IYu-~(lE]+@f]$ӱGjUPc};-a( *8J;.W2]VqI<)h[5pEJz_ekjq`CDIIʭih.u y#5Y ܒ GaGLSn]o|pZVU,wy>IN"/y}k8Z:ph8Z8<:g??h'U|૿mkݼyΞ='xS '-Z]{Gp{;g{|Gkoro d7E8eו{e:ǹW<&$txF:D\|aGT*zJ-%'Փ9Y]RD'p,~()¼ᶄ\ZdF*OI7Y/6oZ̯,<~ٛ#,1;=ɾ|vǁd{vxqi+LCX59/ iBJ0lع*ŝ*0uhKgSR[v=Cbo؛ٰ? F %;ȹh8?'Nt͐M+ՙ$"\E90ơPl$Dl&Hž8t,Wv$ nXpK9'5(]X6 nI8< bEyOlҫMpsd (xt1QUYԇ6v?ǧwVqGv:3;5qqxC{әm <*hWD饹OOgv쓷hl4c5# Dt:P[box[r`ǧF[8p5S]3qKz.Ljn2А 4{oĸ @6g3QUp?iF`u[棤;#A%/8BЃS8<9>t\mㅠҽn@ۃMivًwdh[Zo{wg9"iNQIh?k19Pu@u~nm<7v|z׌Cz܁Hq-g}׵uȉ_Un FƐyPGȘ2VّBNAL7kM-ЙUc\ K)URI OFq T9;>o܁o=k97Ȗ]z=g*]gqQ`rS#a<&:DPG 3纞%-Q7(*L87"9@D(k?Z~UQD}?"@GAU[T K [%XW(!Ҕ؋ _ܞO̞L:qn(~Sg&S|_ tRs8inp ]ّN`T9$bh'ǡsS]{@t@atooD}{LN/E-7vac; sLm؁Ɖw>z>g`6dϬF+ +w#B<c8-fC\QH}>Th.4};LOc}~>skykÇkKlƘ{.0~scuuqg}ej18B'{4Z^kh|PUd172Fĉ>Es!fb&|/#߯<ŹOOqh=U&TQ!3wg'Nvz@Ql2v5 :<6Uے݄(>|! Ki'hM 7G?2qQ MoM)FUpQ(GGOٟޓ6_D= zNf⽉GmGum-+"00u~N_Ei:[*#UގۊoHq_@Pҁs8 *σ A>gFTquHzHG2"Cq[M;e;s}wd v5 ޹U6sq&`RxuvjVu?7})g=#tu*HE@^W'CI@ w` YteJ[2|C 6&gUx[K*PZ~K ~̣;p+SfD4UI`Z~ &\ I;J%}5SN{6syXn[ T_}+:V>)ݩ@VPX3LdZǯcL4{!R髅B_#Ns-NP~k_uo-Zkh8 -Z 4nM&?ycww8n꫾יŇq(7mQy̳>m΃™#"ޢEUܭz|ւ,՚QRc0Whl$ m#rݎˋHT^aնSSvz^B.pRp#Px-z<m0=<رr9-PWKNi&8Q*{^wMޮo}_;(ӑݰv&M}um6Uu4e:q |yΚj@dfq PB~C'Ƣ#{kwkn6|ckw类;44T{8pz8.m#\69ٯ\ڧOla#ɺTTlFX>7Fnop4߾3gw(JO.;9k(G.ciQq]k6NK>tq^Fpס8'w{NIjI(ס<*ǿ@ްhƜE5QW@һJ<gQ}=l~ PA;qߏM3SPcx彃w*eʼn1QvEҋX!񸔉~8o[]U>/ҒʜWsX:۟9pԚusZsq8'8zh s;8mNp|DŽyE:{Aq") wA+}aGZXk0y.Μݰ&䅞]yh5-\_ at4:p,l*)i?#GsX:ZIz+mtlEי v+ a&\ҖxgSCmSoQF'!dW'5sv*fDFCECr+/_ғsMEuVyM_vJuK.W <+:oȝcPW#4kjV"P6syj>P/Worǃ2ERGAYMM} lPTWYfJJ\7`]OWʥ6S`'Rz>8I=w`mMN"/-0{ 3WGhq}ʽ*-Z|6p_3=CYj=>ao??SA?&q:SiѢ*G<{{xP404w rO[{=y~IY;~@uaIǀvkg%Q,ccRD|Pftø?_C[>X*#E؜hBKh(VOSKzyMڏ3+9!^cE~U~o/\c}{/'׳󣩍T泚/ۿme~uۈ] HtxzϾD|^!|"66ل~6}˕1mmZB p2Jl+@l)8'lnyυωlFoC~{Mx451[F*b%ryJ,M̫bKE }먐7Y7U{\;ٮdyM3*~NosǍ=ԟ{/o{vNm}QGϽҵ+ q4Dcœ4xDsvИJ:}#o=o58s}S#_?{h/ -\vi.<8[7Y ƺ6k8-N8ot)߈X~R73m"*FZNW5^4W;ҌGip9Ba;o' U\S#ht^c'99Ȋ:4ځn=yјnʊ'H/}1Yy4 ƆfN|q*a;D)b5mJ9Oi?bbmQé|jzځ~N!xdbIwҟiJ(x`#kH6ĩ# #ߐqރA8B֊1|ӮRi0G%k(ĝQT.!`ܔ)L CJ,qw9HcWn dyQݜjܱP6ްˏ=سyg{gtKp_cW=B5(քhC\fxVsHxѢ4@ҕq?Ⱥ|Q}n}AP/!9lUmMmXل, 6' B*  'E҆uWx)80KOtx^n *QR>eIj-ޏK}yW2\Z4(50UKqbS13BUuREC*I8nES#}PW[82TU4! vzQNqrU|jJE^g,&dYgR+WO(tTq+(+.ѐW++>zm]rEn;u "\ې%ByuvEZ*hgOxzR]k8Z:ph8Z8/7&?6?Y̹{_ΩQ*ܹsx e"FlGwf^\/"55zYBW߯3D>a%cIPTRudC.v-!z=$ }nr ?rCc{PxBS$Qߨ !',CQkT7}S4Dkb?CVP#,% w[ O ,ԋӶRF!`n@tnLOGك>6?kKs~Oj un2UqB,#2`a9GkA 1c#W$)٦xǣ/z6A6E[wAcSYܕ $QfC/CIkH!z!s|~*M-Pf@oVG35%\Wo-ќF;m)8}]P.A#S&UٻypСI~3ާGG9Ml:]s>1 dԾ2&Soj+opdkz3WFcΜat'Ux~#7+ò<'}[/!ͥ J5E8K~<ЂKqfPw<4}~%%6!F mSZ X6p|_ e?iOHҺGE^kNcdN{SN+d> &چ;^nq0#h"u<}g'(c:Jc'zJ8i<Ӻ!s[<""PdLTpVYG7%pK|_Z&>Ba(OرyN{gIy>ё^zۈ$&6{_S Ң@CHSƗx_|?RCiܵiþrǞ["[pTДL Mͺ~G'үW,KڷhIdבI}^-AqOVV]hqy$M!6{iAI+1@vlZ@u'PK+31:#3.綆^ 2e|?Q.@~ ӺU/&y wNF;gųxQ[R*[i2E@npK)O4S~e^'y=.ʋmh#J|A(8NRۗE\<<@u.mP':vx7C^ݾ"D2@~^fmbHu$I, U[zy 0PʮȬIi,Vq4a-uF,/Z'6] -q1@,nz[N6%ocp/&3B_$tdLhSVxZMOyfGZ{GG >cS8QG༁q N޸ApR|ƞ{9q>,EoE{w!~sUki76IwWQnU.֐[qf|&87n'{`Ir*yk;䎿瀂 g-JCc ^)yt,96eJH1rFoVuPLVe;@S$e/_y[2[DຘCrkJkΏ_oyؾ塮ֆ vep֦Miff+@k3}Y} ]_PVK8NDΧ.̦9`gJumߵNT|ǨiPMUCU:P)_0Sl$F, TF[&"s_K؏c# Ǒ۝1w$]GNW}eIGN8PxplGy#k#9N zf=b6xEI} $ܚCTמȣjS&gZCwו55@A;S2>iA:#Mj@sbط5h`񈛝;3ذK^Ov~?36S;f68yZGcѡ5/ݭ;t6}|ԾAOL/Mee_4{O_pMk1O Ǝ&3u4&fGh S:$=!Vۀb`tjnO;UvN'6ٓСUt}gAJTrwԙؗ:6b+0eZPfB称ѩL3T Q+SEX`>˄eQم5tJh 9Gu/POAݐ_k5;AOOPO݋χW|6t^>/;"թ: `{d+%2o{׭D 25,g5)O oPy,r*tV&vܡG}ՠ2>O8+¦3" ]Q _Y_" y Qm_'/)f)+L9â MX^N4޾ؓ=ǩр(/{xy:ph ǽցEdNހ.^IN|Gu6El@y PxJ:cSWFvUSےz)f/xzG(k?^',W5. _OYb=Rod3q_4cNqO|.\k(C,FQW~Rc{GS;8wyrY:%u5zc1J2لD};x_Uw#b|S#y{C[w쳿p~G>d/?j?[G2V].+J%~I8b5YSc|+[۝_fOX)ekHJ]o堐 Щ,O9g⣡s2PYgiQyK<'Db\,IOQ,dlceI33Xg[r*JW]$_UmY/(y|jkBiKQ`]zu2KKZ&T e1T3OM/鰵R lMY_=8Ҩ,”9,Uhur,u{e_ ^beߖcq-ZbCqouhb= ͩxt ܼ{GD3^y{^Ǧlmmo-򖷼~$|gvM{^@~~~>kx Ωfpr uz8~{wyEw6lZr(N5 q "߭s:?+vU:\bnwq政XYדmX}L+ps|J'2oBC*}OUH.nƔXWG@1<>]*%]8 f#w?W\?3;K#k?7k'pd3nCXmZe,6wk!(Y5t=F^ƃ9Ԕ56u>'s%F!dђqf0O;$'uHΠ&1wؐ,2lda9W$0o k2l)Se?8X9y,˾:3hj=;Or==߀q;&Op"c14򩭔o:'z.u Mǰ (mS6͏cawfK]wF"mѝ}c_9}nWO_}df}vm#18lN߹V~GvPrvفSN:k=:SXf>!uWgz況V7n]W!:aeo@LL$_ȩ?r81wR""P+ӵ#YcYNuzOS"8xoϱ#u^dxAJ Eqtb-[ p&U u|#_pG 8WKxf %#yjS6dڪ;DI R=rDœ}X9pbF)~/}Zš O~Ne=)1]sf VwŹRaDj䍕>8qPwk{9t9r8vc!](?ٝ:T?VyxQ B3e?yKJ46M5pj8gO>0X> vpPj+brH6mr:8ȫa ` Z;p$P&t_,Nz^i:ph ǽցEfYozӛ:P_~9s^{?;OO?~~Ȯ\ _ ΩfH/j}*i-$Kԅ q8tp#}?`Ouͻ ⬁*| 'MI<@5MT ,Ӻ˯}o_OՓWBWLK~FZӽmFߝ8BFong]5 ߷780:78ԡ:$,$|d~fy &*N*8ЅHX ':3;pj޸ c<8 \ADyGPw8pP69hhNsՇRv+D$rj2Gp'==9I5 7dkWڿw_Kse!_u_Sx7A٘ƉR i^];`܁70B)H+\: 9#9T?wٷYw88~݃`wٞ[]=={gmNN{82θ86^?8p` +Gqzzo~H[Y>/T<;,t}ۻXjs#\*Bz1HWN::}h8p U=?!B ɉ ͉<]O pv 68],YTMkwPq^A9{HV|`ʦ6F'8Dltd@{{?Np[ȯ889Di=pŽxA&r\xSkE2 %Q*!q`} fҕʤz\[Enx;4.TTYFW\:EX-a*vD<`nKeѳ3&xt CU˕G\ '?cPtEOJi0qzKt]r[w_ĸ0Oeֳ;K'udz(wZNu&ցCy2|e 3+$*|(ddcE(&lRxjD> =Bc%/+v K dJTwBAGd _%3{xv=b\Y7F5#i_yUH~Qfx8"P e>ʮCծhGLV^L$x.~*4eMȄܢ/Tףgqx*LH;Hg,C)Ǜ+EKV]Y[&[.҄ 8?_Wd׵-ƹD!3W|8"%GzM. Yܹ:phq/u7:ph >q3 7&?8ݿw[[s_oc{'3?_$zu3Kt G8ppc0{=?hŃց78pt{}}[Fz~ydv=+!H 29=l/PCt:=,l{T9^"u~iֻt,4ܤ˒^>1Ryd+8?_2 LΥz+ m'1"Gr:kΎ_o {2nfz@ٮ.ٜue6l VyR ȃ;N,LVq^RAq)q%8>15XMٶS#P#d7BEliC czq cS8rl{--ᄏ薎mHOPҁv|؀AgN7'ΘR Ջ a ŸϨ*´yZ lBYf o)sx`GHDu+ίϏ&8c[Tnfb߸TTC PGBp)Pe]y)VonԷG电-̶{=۱|=$tTٱ=_ەyC!s6Pw8A#T6^o?N\θBqZ6,w^Ee*)z\6Qugk4<4Tmr s_cYN](Vj>D 4qZ#p`z,{bZڱ8 #\Z&vNX_kx6܇_+8pt%8l̙Q ZZnzNA{*}--dlVf! ce |FDcLJe^7Ԫ%DNfZ~ dJdZwMXW~x:jW9c=I]TyK2M<йuh_evTLa+yJ4j*S,8K8(mbP.u&, (]j2!\q\5{E\Ȣ.EۖPMu_OUv5Ι4B2_ :҄+6IꈺN[y'Ew-^ d)JP"㾴X<NPU'E9ϯ xћmѢŽց@Ѣ*y8#˗H}]bww׾~÷}۷w|wԝkkGGsmoo7܉ǨG&I*-v>2Lǯ]U<6R+_nIo`u4Pɠ*_̈7c,t [2Q"~,T7ٺ_'ors[GOc;V+6%v{LgFҥ" ~ J.+BWrx?8`>3G/7߼k_;op 7n Q;#<=9O]i+F+ + Х\Å W /.L.GԱfZl{uy:yY[ 9IbC!cᛐ .76[]<\1sSkPI~6"ӮMpP\PmB2Ӧ̝<&|"BSur+u52̼n~~|M#Y_'0p#^]jT'BMaS׳tQ32"^_ۜ6؆vW|G8^˗/MvP>a]5]p"GJ\ZByuc2o;RQ,O\k,O e"%|&U{E1~CN)T~#XWpְ'wp;m8'}!>A(} (6+Ql u^KkIPpw=uiyaI\H6$hlt ߀ʑ'N o7bC𩮂68>Mqb3Lxt$6wS?h|&Krڃ]\N z/MOpth~J˸ '%^Z?$U+G\:CHh">o5t r߰għICs5%TQ'@{@)/kWG`]GjE'?iE|#ʢH>5nCuVNؠg DH/ᰅ# ANI`5SߑZg}jybG:E~)aj]ipHG#@{L( %ͷXG:CrHJz7ɐU)zr 1+g|F`/o4DZ)T_*rYw J(Et#J{JYE)rOƁ@9@MXidGu fFg&qs[ium6E>aMq]GR6gRe9Sm9,cзt(qk֙;ذʦcl zH?]Te3^ֈV Ǚ:}/mv}8&oyKǺ\˗/هف֝:p)s F:>lo5aM!ulPMdI7Sa EvWkf9/H-PޫoDE)V_xIg6N~ZQdU&9ntmS-p2ܶ2);՝䠏S=ɕG T0>yJq0K#BW#8mc ~N%D)źCG2q,Ɏh&6w;ҿ1;7v]or?履\?c&6ٓ%GZ >:iL|s,[FVw=8ph<'ϟ>w}tl?ul7};2qچL/N1ӟ8p mg̓V;b`| 2)Ag׌|: RʈI$y IN)81|Jd}wv)&.yBNGCPf㉮mm |3lӷ=]`Ʈsk+iǨt(įVL)?ʄJiI|`N>l pҼz=*!SOc}uJ1CrOKmDErr[\Eg_ִ:%0Ő[&6S)eyR!!U6ˁ.z #;ʣk!7Sh&s#Lvq9qps`t:wjQ<dq4ևZ8ȱ\Z;/}h>? 8R 5)Pe*.#VXE)^xTKA"rHt鑢U2 ,@?"z:_i7c)oJ_6iOO.^Ä16_E:IhF3l. oDVe<42$Z9βC$l+L:n{9Eaf!RABpYʫZ,^,\'A!XSrwXv]P0ZהKM& lV9M\PA%J-ҶVykڵh(#˧2B:GC"^ͻ}[Ⱦ7}mѢŽooɱw3xh6Pr{j֠[*ʬgWT̮v5pbvhb&]Sg^>KwuڳWTh,Sl_CUiھC#idSM8l-;mvDg;#svDҒ?'qrq`vF=(zHrn᭾ӣ?C]t>)$C.(lwbgt]OmGc ް٥JNmP;~3WM6mkv J Se '9gO^TH|yjk,F~}X},齍 Wr2oxSuv`}WY! 2-scA:: Tt,;lJ{Y#ANS\R~>om mKs T:g?#!z0_QSԇ?:IQwj;;\m!ijmryiɎ1ca'gur]Y#$?ē I;Tuz \\<yPx.:$]Y'95%L.+J WILJd+A`}J8 GS8hnGH뤔j|UsQݾYط̆8pG] -^29U7!5/>s>p_'ZCtZHFO<S^9nLR!!5`IHSbv4|BQGgX>%8*[ү(ɐ+Ċ.ċL%SXpdH*ҁw j+ch:'%hyp׮-ZhѢE 7*Ν9; /SOO7}7 ??l֜:=ÜZŋ}sǵACmѢ @\;3qC#}c5@z?ɵ@gٔD/nSbVwB_]Gwut~n6=wmgбÎ]74A)|l;fO(|HwH"{R}ۉ|kAN_+ugݮgk2{,]o bv?3݉mu6W>Oa}GSuA\m~eIDATA\%QT1r<^7ƥQ6] ei~PCGYWe{/"t~|:7÷e;0(ل5QIHs>ſHHq©<8vyDS}ǚՏ6 pM?IFB`E0 hxj6zuhy'L檟qې,5IRg_ Du5ԧ#{Ad#,5d-1-8  Qd}؛<v?kRzL t ՑSr^V{DOIҷT~:S.ҟR#&QKͣJYW6˜e@6?dv!3uEu [ބ"]Ӂ.DRӷ;{Nq{74ooW7+=s-К?فHvz e7dYMl~}fcۜlv) Wt?'0O㰮IQ\OQb̳:ǒJ>z+kWupz840H=uP*fK}P 꽂hՉ]ҝIWEY5t^ +@V3BaI&ɪqN?ۀ:Pu|H(5*TuLu8_#0 8"?~q`.ut,¾+ɨQȔip]P#cR(y&tDiKwRL8P lPuR?!AJI/WT Dqkn1_>Oޘ'#}ˡ資sܡٳGf/ځM-EG#ue38@3U_`nm͹]ޚCg=*zl'9zYcgOngc9۷ڻ/l.l؛1Cvnom{#=.F/yeBNkis &Ek%"d\z'ZGSF AJ 5m(q:=~((#9$r)#dB2 W>ZC8¿oF="غ'Yc5S#v>6<~&sbؿItc" /99R8AK.zs=7D)Tg{tk,+RѦ:JM6L^jF} lzQQڷd:m$u hd!IףzS<2+3 ̴ϥ38u> I}%GtUۑ ӾhOtKtS:oN:vCMў.1EiΣ!:tn;ٲ׉W\MJQG=}j|m6DpZŃjK6lPf,BWAuw^K*:k㍊#. Lw ո֨&<ceeޘ&T t-ZhѢ] >p )~jſK7Nr N/_KzjN}qG<~m.wīMNܨgMbfXm=TGʠ\E3Y'aLd ZثH5{EY%4%]E#X]_G)P(K8͘Z*령vIsLn(EQɃNRsOl`sX/S. |Bx5,,tz2̣Ŗv Et`W,Lq~=WȖZw_e֖i\:lg);us;v<&$6XuR>4#ё́={Keotv۳J ۟VvfiQV==ϯIYxVϨOˬύ;Î}|k5W+͉}pj :دӄxfO3{^:4"z(܁c O8tp|jӎ7nn̶6綽5-s:mvqϚ]ƹc-͎eoo>Mg{ع=ro۲nعm ^T#}Jh5> |*(IN*@:(TiSF_|N (s@6m'޵AO7 Nmsܠy",aGb^g~:~~ l߀gNN5ttv oy?Lgp7A:udS'@(J .>ଡ*e F8|t1(/y c;2)"s [%<%-˻HKN3|6ڗuJXj+_NWh`z3]LǐӾhn뼯|ԝڡ֞2ƚ`ZP(_ʫ:ujI19So4phDXzz|7ZmvKm@NM-7Z/GvSk#Ժ%7;O/W;_NzuUsȆW ~e HC^G+N%2 K6ܹ=4W s9mޟ#S~ZI/Y&}A!xޖlD`(h&45ƥ^nնW[F)GPT^9|cDLs'r%0ZP=o:)ͥr7c/?Xi2*j2|ƈ^H6IK ^=|X-ZhѢE{k|ą ;~]ʩ7>z!{ߟS+bÜZP1*{8р{]-q}FJ're߇su kleþoCc&P+ ZH;+~ < 5 ,ӿҩNi)m" U_+*,8Rx}s:k]5yQe^=/;Ws{f{{jۧ䭉}>~CSO䎙}>}3={IgH^:&2Rxυ#Ӆ&M-O6 ].o]V=;շ^O!;Su##lwm<p=vxsxpM2D ش;mp}V;Hzەѻӱj$5`=6qE<MR9P2tGF4ԜqGIŝ@9 a0P+'$q{< H櫋^\qI&Xr[(.-/-iRCX!ʝ鄔e(`K~ҟx i5ݖZZNY+pWWF;e^/8r1e^j5%CQr<:/=]Z;7Dmn l{{,hSqd5 %ٓ0$ohp[T.!YHy7cB^. E˵Wg\fnsBI/e 4AUY&ZR BAQ5t5}Y|0 6%cD4dke\I$aEY *+z Ā2 2Yt2\u[!ףh)!۵"ȽوrFxni̦IzKD`5QMZ֐gR(o]Pɤ TgR 6d](tQ|ǐb,s*;blqM} oKBOke9ee>*tҸ#DI ^T<ơBN<.Z9Lu^-ZhѢ]T>ԉO|9u:|}_}˾stkDBy <P]^ΜpeOsQӣO.z*#U88$RA aƮG1G9x?Qs \Ĝ4;Q#8~_p6:ֿ(͉}7B+9誓NG#]#՛>I'.P7ՊR0ٖ>OO IgT&B^è>ND<k(vPK$9t@>_FZ'b0vL8Uv$[p0&;-xݞj5j댤 "Ix/%-4 ^hN'^ [ a>@.G/TQHLDu!@Drς"A qV+ dgO R?eT<v]~"aOKY㒂> Y /a+UPܸRxZPߺx@mnjI^ t@qtJTv=9ɢj@<>ʶlFB_E"L8aKF٦uć󃰓m| x-ZhѢEǃLqd2!{|?G(N9s&S'Ǖ+W@Nck‰thѢ] L~Gz ׄcAcSOxɏxnB&L76֔] }PY?7Wfl1~ +\ɦT7ȱF]uR*~J>(utn -Z*@I4NY Y}E9nS_/;6'y6GhEG7’ģ_9w?SPPV(!Ҟ9s8iSbAi{Nu˖\;d;m_[x"S=؛̮n³J7=eyI_3{~4gĞ>#3{c-§[#{fOCse3w$Gf/^du }K'>Hlnd6ВXt, 9/Vnޔӷ-g7ͻ}}{Nc[{TN.=Mt_gbc8Nmw6.;vaгvdljzNJg\K/=+l1!.]UOPC:Ȫh@K8$?m”SO\Jn*!c:.T 9j4J̄xIE''~tGC'uLLɄfOKj d^)|Fy1q<"z+rEu:^ }FXy& k .It1Ԉ,%=a)T9(CR4oF60iDFG(7"s^ȼfH*DU5^gQei"P=0E)[/XOݣjlK : ZzqjI(ǪB%$ F@m81\[hIG&Eukr7*:p='F_&>NTu_P/*=*^_ZhѢE-Z/L&&\MdgϞͩ/N?'stɟt#j pniz h3hqw_ᑄW 3JF<\[śxŠ %&yl_O@o@ r*́G5Im蔨hʼ&&]v]u+>g |6 Sw  Jz a$ҙ̇R^u<]ls^X|Oy 9܁c:]M uv8)).]2d26Dfo7:=.=fzxewzy6I^we 9ԍC{} vd1f.-ў {s7#SG>j>c)=ESxGG fې U3{|{n_3=yFu={Kγ]⻃Dgݾ ckoݜ۷nOM]{QkT^.紾\}^ mٻ!Uj:uЎّ1 ZN!Xt<9qzN@!9 ;)H-yf`C-8TTi_t,`>2pcաhjPCmU6xLi2yyN2(9RIZHJKZ/+XڊxD Db(P(|h2ޗ$2ң:谀,ƿOytm^lN@N~dבubT?|dJUK,eN ?|r~ԩIuSXP ㆮR!sݞ֬N80O Z}8j?9bzZ+miPpI} լʕq'z_Q Yue~RD`IǢ&:) =1:<4HIIiVVDG}W_zH ﬊23@zd|N l|}?_&v%(ښllD:O@n(ZIgYW=E-ZhѢ|eC FWϭf|~oo}~kNgɩU\x-Z;q[/~!S2W\Ӭ1uYi^弪:4C҆|ԩNUN NtU^ožBăB,SoT6'^m$u'uQ3$D)zH_"&[9VR}R<_J+܅h"IP;P/q}cT'ɰ#َ:.erʻ5M4=T|=ߗΡuv`vK7MݜƤoF=:صB}yǩpƳ8pܜ7͞e?#c^+,fPםו1EǼO_ԧ/ _-}M]].ܘۃfou챝=~c_+RҜ]{|yow_T;tm;~vr={ByOl+ۗlүőD>!tMntbwfgg#mk2iM:`LN9ԁ=ʛذ)"ݻ9\rp@n(!ك8-/|Ws@Y4m1BkZhdCXc NX06<٢ =.x!W%(pBgQ^yg2c>9h0*nN6$p6Uv鯴12vg }4@MPJ1EQIR˃u탕H/ fJDZ}˄}n3'#ChR5QqQhA5VANj\J6!ʗTqz^~\FekPRRK^u64RZ:z}u7A09:e,URΫ_eH,TA:*YMZr iбhP/Mq̵rpb:9RU<;B:Zю&q8l=)1]EjlhURYPrD^V3oN'u5m/F35=^c552!6FFw? 5KP-ZhѢE(Lrlkk+4NN L݀?P?[}΍кFP-Wk߅W6 A0m'A/8$ U< ZUWnN#&]彍˚VƐB6bݬIeū:BcQ YaDZğmJ)I/\ܗC_mion 3ãf.3i7~x&:Y>oGT&XЗPځ8!eE% ֍,iAwR K/DjN}cRf3~VPZ Kc|QӳIo#CƁT,tsNLR1Ipc0&q׎F;o+ʆ>m"OTVQo }p'W={hn/vUɶ룉MG}B9]# k2H{uRwyOJKtR;@/Cچa73w%}f4{t;9xIfş:s N}{پJ+=={pboݘ[c{xoNۛ6hodWocg7vg4C;zGsa; eOc4CvLC4mg0mwgaGGmBmv诉[w:MOԧ# ԗ}MLc:C5S XM4p32| ,~H_v$ ͒KB;׋diU)fCua~2 \'ԙSݚPЍ~Ewu(՞!DREy1sˡOb1:52&h' Y\U۔R6G.ry}8e d~e|кJ=$RtR)SuӦS+c.#dJuzzDyERQ] L,ѝ<9N{-R'AnWe/E-ZhѢzg&q:ݑ}?+vvvr[8_b<ϳ-ZX?ւ2ooZ;ro &JyA/(-Wk::*%Llfz *;s<* ~IǂȜJ(ejhwŎZAMllCɍrtҒ]5zv\T& ƧU\@$.+RM:DžZUd^Ŭ!]ȝ4/ Z2p8bHr7v;llDc!9$w(9E U {s]cH<^""|G{cu8FM:dفlݓ}P Ogϔ<oNG%XcM /-sop~9람é:GJYI*yʖBLl'Rx^tQty쁡BceĮ[ϊM9yذݿa_zߦ / \Hmɜگ9۷wlS{`bwQc=!uyӮAx^W*Gc&W,8q!L;Иmƣ@lϤG;HNvmg8Tف?ެ W}Q3l8u]ǞC8]@itc*TL%RJP=1NJ >sdP5=`Q?l7j`8* PmeYb^#OpDY'!jR$#Ja3 4ߖ8[WgE"ɪF. Os$L9aky?hØBh<1P[F4k ɈyM(ŲhjhۢnG`D]Ɲ,;׿dl[̏&+jr^%VK %i༂rPHG5JME@L@W4 !q/nνwBx/RכK@8ZhǒMJ}/y5Tm2eNTV6tE6} ml}.} /8 &hŎc8(qM:=0Xܹ^VFBmL cGTS^й zi{95 ,-ZhѢEā_t'7ߜcw>N9֌ ?21'@oѢ7}׶t<}GﭠZe>钄rW+SAՊN,w:/cGo@- K@.{CȕQN&7ӄl:TjTYg/N/QN٦e,ʢ-kMj }{jkj&̝Ыk(ļn>AJ;Ո! E{ BjXE!_Ԗ\\%NBzAg bzq(*S3c^FZ&*Ɓ ¹ڗֹMgWjs C>y#?MfTN01"EtMd@Z'8N{=m*؄w%ƊH9WH$O`Ss~ ̞KGs{@t88D_]WGf׎̮v/b4==)qQM$O|;2{T_QQMeQ+o۞E;Έvީ/rY/ }JBwg{;s{϶mIϦHYu?Geò>ueͧKKj%攪MUۖ)J͢@:T:GJEWƛdq`[f)٦ж;-mLI}UѓshBPSHK9I D 4{>1'}'ExV۪,ppD6@MOO&S RXe\PT+M̎zfG2PgSͧvStCtk>S\$[dlfࡴ·ʛX fop$76u-_Q$Su?Ƴ8_c⤄D\*{¬JČ};u솲^s{S{Ԟ5gf4tknܜ+=LrxeWDF=}-;w x4 ..*;={nϾLϞLvko; gqs]}R;v;[eu3{rsjoݜ%ǎau#dCأ~;ކqC ;phmXzj3'k4p]9Mo!١i1 8lhl"2uE 'I6 ԃr![0z{lE:^&Oӟ ^seY!vⰁ|9>:"8Mc6I?4HNH?nHq8Gq y耐I,SKWQE[K{zOI,Q0)y$Bғ%;E)X H- y1?$ǁې [b{2$%|btJ H魯i^ JWrN.f PyB6.xAa議?rEO*x, 7b,"lѢwfn6Quo H'.'Ro\UݕƵԈz%TQE/3)e_z%?yع =9 f O|Aގ<+QdM`U9)g C A#J;FUw^GcTWz4/M(z‰w c~"?#oӎl<{ z}8"T0|}CFN>:ⓝu7RtvܮN:vEk/)fs{SĞO؞̮pS-fZ;h+{5s?a(74&< ңYpߝu 9ןʸO??$nBJ!ic;N"x!8VgzMisԳ\&*A)j4疻qI/\p ֬647?4 C$x*] 1 V4W|NetI>G)S)K:"N"KxJv(6|0Eɨ,;DZ^?HJ8jqy!a6z?n8c^ܮ72b!!{2wItD}q>ǧen68)6'+@9OO-ZhѢE=>?.=g9vroͱ8p$iѯ/BNGׄF9&t-~pͯ|ǟuyuy?QSҺ<$-U2J!2EVCJ!V?S&ީmƾzxGnGC{ұO @;BD' I%~)Ԅ0GEU$)i֙D]غ65:QGDG*21Mfvlؓʣ~FI*w h%cPүӕ!d~]Ÿˢ(k(%+V_xoRN]ٳf9+Tzֵ!:գ|#W:ܹc?9w.P8oXo}xD *g_y\% >0ѰG2whN 'ot8NSee6x1VCEr=.`udD!]Nʫ˺nHY+1Zj*,nȼ^{z&mHs# ḧTI8yM xWߒgO&rd!IG]dW67#t c8="JHq-6;tődASzsl/jP(E# &NP'寧wKsen / ^[4]!{2w 2Pֆ6jtu6щEL+s<؛T[-ZhѢE->/d|:<9vrid| <}\ԗ>ul4ؾ}ߛua4ّT#*y}hyxePy.>G(Q3pr&"Mdpp \XR*( e>1h{o_&?tC"Q8Khs̹*j{뭷z1shŷ~XW~(념(qO5Xw pJ }ԅZG ~G vk^d#Z "ԅ\imn@wP8\y)܃iA~0+811A7}yRfQtGށc!$skCCԛs")U/У&6r -8cTb^RX Ix;o];7B;}~~~r/J>M]޹}ƻp Cr&{)ȸԦYyv:+啋+W7/WGڠ޵n\{|f|MnX3*F޷·/ '8܅<34<=·I+hZ8h]/8y' =!s9 Iɜk3{+ef"|圏 ̑:4Fӗ."HGX,zP.߃uo3ՙVUvpwBˌ*>t6@nc;8wxXUX)szr]>I% ɔ¼isRfl[徣q<N0!>NחoV'&XԦ 0` ~|ݱko~˸ 0ુ^msmb\.tXszR:㾁D-?|L83ݸAaU7=\o:{7a)>~Χw0 =C m=QNαM Rc |]qr-ӊ.ߐy7n^] ֩=zwew;|1R>?&=>ve^{ߺ}Ts|wi)}|-~)&OD7[,bDCMGq pdxum,R7>?*/^orSuUOʷnL;WGȹ7&,OM7ʷo]/ߺ_߼ㆺ7 5'Xl\N!Ė}A;AG^1ʹ oqAD8O?8d=<Ʋ<^.PwA6P/G}&!! g8lmh|MM1"/mEh[nS|/kf TqNR__ T@e 0~<X9^0OPVeeGMB^^;Dr+]b-dUQgMx}N}Շ0Fv Sy@}Lr-a~>7a/ƍh/]/;<- wݨLޭ)6qRv`pFvC眶{aC> iX;Ob"LZ*JZ ]GM'lǏntnn=3(2_ٞ1 ި/N5P;H> &;t+coS_Z7xn@$YS=9F& i5x#3ŊBŮ-'/D|`l73/^pʢ Vb'ނ](u4_;g}twF(K\E5j} ڤ 0`=i;=wWGGGS6ٿݕ8M0F}üۙi'.1 [&t|@C6GDkq  xf{ӧ<,V!{n│.ʰ@H5;*N|3dǁz}t#1d|Tiը6#X"o?M Q~ d>-e8m' d%r9]J+'0~Bn{蓪E aՠ㇠g-dYNlT7 H\(A`| ߐ\=t-"Tfd\w̧֨rclGxBnjXN'XFW"}wrfXX}kGGzxZeo1.EnYhNWxg YC<>R(Sg]]B1*țܐ1|#g<*T}8=:1X+Xch9XN},*E>> )'Ih9)#[Kx|}M-o=VG.HGrǴGlZ^qdqu.qn,Ϡ|ūP6w}w{ז_YuuT~~Q_۵Mۮm{uQ޺<+o\:*߼pT_oNfU嫓t^rc~㷏90E1p i!3(̣)"r zsGo =4!71'Е x 'g<ϯv\x"ttԷũZ2` }Q uB|wҸ}v j@xgű!ii Z-&;A&[񂌟}l5`k]fN>XjbCzL>OcA'҅6d:ؖI#Xe~>#Wuɵ'ܠ|4}zZYquzDō߼sV#8֝21U!5Txu/OxqhUs.XP$DNdS5լvTG-5i.I<NnC."!ԆD^3ĹY;ZOW{eyee۔0! |tU>9XP6I>K|տC`ErG  {sKyҪquU޼*o(ݧ;7[7'OMoz|7.}bߞX{j|멽֕iyDwyT|t秥|c4/OrctTʥB7R\yYЉSg6.N.&g:(6xuN 7SSĴ׮e>=pT)qm!-Yw _AP]͢0Փ*'X*ljlN/o:wR] 90" #mLFA}% ] 5fYģ^Cό2GG<:RYՉkdix"f޷jh  A{10ƛ:M/2U'|&yuЫYnINV{lwn#G.gĚזC@ #:j s <&>> BJ>tt$H6I~fZ'omA4%;Q|y!Ď[k aa[0`|pE/}uܿ'g?}w0`Wq#ͱe=0:[+:Oo,Ûkǫ~yF||t ^yJ jy3!}Cg=?vZYT^hn˕5AB ""Ղl/I]‘_ EKc[dѬ{9ǁq pRË>ɿ #m& n&ml6d/ |KgHDʪRA`2w8D}wqh^:/с_?7+9*>*ޙo?Ynϵ}{i;>=*"7/Pm_!$:λqtY.OW괔k{;y\(eՋqi\޺2)o^wn/7~ƅmZ˷{WKyr)o\pi:f)įOʵɬ\QT ܱe#\)&c+w$[x`[(7F'eG._{">;+.F]cBlNЙO1H5dqcwXL ~.3&#c㑺ЛA6-ewD9 l!8#'iI{ 7LF{*@7^ (EkSR^'J |t'(ƺ;'Fmh ?96ܸԶYhbcaJ԰k;z98{H(N֟{jGp\S TFHF9Pi܀@MwBHmE$:}uZD羏}iT&gI{"9 G҆~VVf@ :c{[&wSM wk 0`__؀dy'w}c~o<H{ 0oGY>?"$ myUSނEzF}톻"IEu^Uq9 N,ZqCSa X8ï81;m9 yf}kS_do\td:R7,@rcB]Kzoo^-kbkA[WGߘ9-~y 8~e\^ }YFo˂U%I'6[lن2; 0` ،nʿ~c;Aǀ1xwh;xS?Yq^@o2n .ɸ8T( y gA+8(tP=1>z:lFK6>.3u]8=?loOX<&fwI7Às;ZW \`\!s[+X͍͐w|Tyx 4j\;#>1kj<_eh>qCź 2FB^Xئ%rmذxr5dY_yݡDǫ@;n%!2C|{G:Vro.Wp.r ^ ~Dda)scq(icV|Q]rC㻋eL\/܂[KѢxC@yt'=we)4 9-9;^__PJy |ʸ{u\ ^won7ߺ1-̣;W'Kqy¸<qT&r:ʼ\Zʥ(W""627@e&nc,& #]O8QSrsi"vI Y8iU;ؖ0E$A]P+nސ}th'`eƟ5B~"yP*S yywxhac]' l(N3@r>uJ9)Ce. ΈւDʯWr7=KHUzW2l!02phg9sꗎ&L=tX~ñmoWSઇ+Nq/%D[CG4Γ"ѵ ̉ǘ$>Ǹ*IiS|!6 rJׇo0,;:s9/Yӗ?lX81Cx0` 8?j 8!0/9bs]-Xп_Qt::Q噵#; ѵ< ;@[|9ڍ!NUG`vjXb[nt!؋Sp@6qB_ooir[Npw\ n qƦ^:eO }@(x;;Ciꯋ"g1{T=+j+t Ӽ8e-v.=q7 FlBn4By ~aR8CHfׁ?,˻n,bD"HG7"[(r(GIMaE[޽2&ƥ >F??#V3{]$rgM]>xcU>>(Ss8|wZaB Qbtq«I)7Ainqy}eR߽:)]oo>-߾1- u[{ԈׯL7XʥUyiU^_Eyf }e=6->3v A}z;dݜz-lW1dMn0*G <)(> #+re\K)W7]#$f}-Ür2* ƅaXR_u2ArZUP֓[k'˅w sf,Wm`<ّ ި {`]NV8 uyZD\S`S}g|>v|Jێһ⯝`e߫yїRl.U_yo 0`?{1S pBo뿑W<9cuj@։A'QxWTۣ/MXk?26^#e)՜hWm8]u1>x&spnul2LeU^EK..Qwa4G`TH/ԔJ,eBo+an؀)W^R6l@#Fg뮪[vyܨnB+$孺`JCP>w8Bgΐ/Ba>k-KvP_(e^%ܐѲ|zG,aoT{oU{wG|G-7xmw8Z;h]4<@> 5D5Ƽ]xN7ɻx<ǔ}iW/K2*p`||9AxsƵiy^y s&w];&r}(We٥\-ѣ2YBchp^8VހCMw/ц (Y Qc ]=sv|c=@b 4n!ࡻ 9ISq|Clj3ƃ.hOO= ll:}e7Ad/ DwF1٬玣@qpzڱͤgU&V [E0\ .TYcuGp2[9o9469TxQSo-趧ն Hj7ҮsP'Nv`ɰA2W| v6qWȟ`h+ /mWX<5]ntq\c]жy'Nz4 D['quv׵9}Y3-rܝ :䳇 0`NǞ||6 0C=s񋛲om y"u0߯(SXz=cj{sgRrvBeօKuk./y;FؕM j,#ֹIS!jAжۏ7n84c*܀Z( ] { A;&sg3Mx ̓ryCTtDBOLJ˲(Mcڸ,=ZQ\@fRmz4 Q7= hӊ,җGh 6&!Dʤi9,{;yEނQg0|1#rR>=1_/e.7oޝ yghU>'@>G6u} Zbm$ab]%*>"cZn|T Gry/U6 pCǻO(IOwigy(KaQ^(_^>{aU.ˍQ<,Vr}(W1JWra9+=ceCIޔ ڌh;tчN@YDZf5u 䜵ILD!M0D'e""& EL!t$9aHPa#PR4;P +.Z3huO ~Q=B۔QVqq+!^c]["wFŨ=צ\2tɾ AOJghK|*u'clX-f *~摥M7Ы2,80QP`MvW$f שM̔oj[@QYmE ߤIׇ\or@=?6w@gDtP˺MuH/| bX|܎ܰqf~VD;NڞEv)KڊhI.1Z~k?8rxpHǕ]Գx=j@BX :8i2̠,]o ,K ;yPO&# GsȋGiqK 囓ed7m̃.? ȳWӎzWh3r0+'Xm8X!NE#n/F|Uo/K's3x*{{ݻ}r^?yETL&9+@e$?(O+8L#t#F!Ŵ (ߕ`;<o !oh]WC"2 d}wIE>nKE *lg!#m@@/F:dܜӰBzfP@ܿ˓&>V{, *VP-$$"m]x7_蓝5vo=u-5;v45*X (42hҚjҰN\峽` &>|x u\yvl,unGG;y3~x !4=o 0`_ؓ ~G*Md5&,ӬwI_+-""R6kqs;x9/K0E;zts_xr}<*d~M6=-0JAtLx" ^ `9K^ATnG -ĉz3@6sRe;lPS=h?b:O]cZC.<8)OL1virj{N('q\podw'%G"Kو("8:d |L0dF]P*HCQ|%FYƍ#_9em /nPWWT;p|qw}f=ҧqyGpżf"Z.iǧE7]RPB/GP ?DaXimG@'!{riz$^w'se0#n]w%1| tVrqF+0/KpYcw-f9'3M3cF~CdCwQ^&8"Krc ".C%32nGB9~d}Xgǃ1>;N!W&.Lɖ.fI| c 7p;&}Nr~ Ed9vD<` 9&6nhC+mְcϷqP2ަ~G/0}\rjkߍ49A[ IO3쥿l},4!7]Q>0c9FNca0*n Kx`H6VoG2"r'46юn'F}ӝ= ,ާyZl(+-L9~<-Xo;Vep* 0`a?X?Ǟz2?zpP'k<~}0`mOq+ Zd2 !0JKև`Ze?Yo[ۖ2"}\78toach8 Pk6;8 XǪÀO*tl#7"%m"\"6D$4V #LW]}bFR]FMR9~ZX1-0Gi9\C=r\uȣR>9,e9=ęV|^޿;W}| ~v(_ u*р;p ImFFndaeuI\ˣeӓUyv,>NeT^4zTkKy꨼ywwnnw/ݜ|[ywR+WKy KW}aY(O-)ɢ\Y:fzwouTòDSt6v藹E0ȆLwe$vѕ|8{'G~h >G? d8/֯># зvXec] 0`]%1i0ǞLW<`E.U7/sٰ9`lƘ+yJ+5r&^6#V"6CX\iC.+Kc5*G(j,e.WS؝>Ǔ24|o2I* ٝDlcII;yenڻ`դ }q-3X3OF|^)ow~研s*rT//|,xuG#/&ӲD)|?"0 ^7)4wxB)qseߘqW:[7Jyf)nN˷owM;W&ˣqyҸ {/- { XlK;Sa13зMk y8"[w9GkqMpR'`S)$m3ȷ?*D@e*թo7B7 c[=d¿^O?] ^$Ugp d[nWt |8[A[W ,{h`}R#$>>蛫qzj?_#< 0`ΈH]gd|64iO>,/R{ 0#[ŘG92|0 Wex}M YG2Be{ڧK'ꡡ0aDqS;|܈MǕuF s" mX߀_u&;İ:rmJ6A1j>TYrښX]et]ŏ)Cl6e iipAP` M5Xy*+n`$C/ `P}#= F(GBY:xG#dm>a]7.r {Swwlyćrr$>Xx49*;#ogU}[5~GEBwpY>QB,b\f~VC./9/OK~V)YiꪼtmY^YK 8-o_wb#@ߺ_޸_/W/Q{d\! 7`>]Cg_\G^AOA-B1m@<|NKgסHp6SEio=v!9CKr,* =M!rNB.j\_Xw8[@*K;4g; 撯A6" 0 qt/2Ok^ݼ?-fɻ:]O u.dcٴo=OXi =q`]b狨m{xN伾BwA^HAǭcy\E[>^P 0`yi<ɣ#ŃVQq}ɟI=NIßcCn cR8y0C`i2!~:G/D`{wQ~޲|w8(CRw;| :*7u>& BBz\[}tY.tUF=~|qGUs]/ƕiy^yUo7^/o޸P޸~|څڕʥiy2xivIy~oT7.Qj?/W"YD6oA 1`l߯;}Iǚ2EwJfӨ9jalz&aFl̈4BEQQNe We+m0yl ׶jcCG.kIouח6{{yM#sP!:#]f >JK[u0#~}=>6(Y/w eCE7g:n hp|<_Zu\K QmL_edy1%$ØݴA:^lʰE峽3h LM]{jC}G<Nd]+zh(GH>$Y(I0Ȩf֚SڛBQ 2sttb{c' mtu|6 ?h)AZ^BBSh 01E~B?/߿޽{ݻeه?Ǟ o/S؄q˛8yG? x4~4- xOUf*:@S8뼘t`ңL0įb; ]&ٜ2y-'IX8.!%6~E3(#׮ ͗?AyD+A b*PR;!t:Wej2_sٌi>dD{z ksq~` X8k %)I9V`rصlZl2.1:1GdyG|B o5Qt90š>AtFy]fd;TT?f>i /s):U 9B>78Q˂+BY0iH3B`UrT]'v,MP'7\,lXi>fB}(Gcz R BZd^ұ2pLuQ2 )FC!JQ(Uf$d3(3]Cp`%qAamTb1|< @2~g,r 5_" ~z(ߟ{s\;(~)pgFO~p~~;S︂96꼦_E^PuO!cYh.ʋV˥|WڍR^'oOO˛HycU޺,Xo[׎W+n. sު<5Y8o/o`_<K \ BnXڦ|Ϛb?^ FbLDŽ6IN181(b-=^'Rl%} mMZBd!.dyMwDM3Fh Zp+@˛m9E}@beyY~L*AHkz9-Yњ00PЧXwۖ6 񉂭(Bjhrp9& -&j\?ԳPtMG'8=Taf:7L'c 0C'80hnrʕrrSO~ZayUb i.h-y}ūgާc֡%=$u מAeJZ˧%+sf#d*j\e\Jy! _dC-k*P293AZ $9Fͯl(krk*Ϸ&dd 7iN n0dZ\qsיFK85i㠔-߹KP* )⟃_ñ! e>?` +"ʞo@x|j6xhUy<+WKy QyQyIy[nʻ7@ܜwO[7@_o^W/O˗&Kqyª<3H?}aoLdY.Ѳ\1p#:',De$.2=܉f"Jf bD7 3s)q?:QXuWt,I(`f]|PBqI=eY3I]2 \kvERldu"m7a12[S(K.\ϒZ'۝w}VҊ*]+Å]/3hiP@ 4lhJ)]`!Ʃ -}9k,4Մ~0?`Um :7OjdADx8';=@`q96sz\>V/1:R GFwNNC[hL"ljn/k\6ssgAz 0`݅y!~7xW_|&{|Ѕ }^>,ʯJO=kƑ7^|Eǧo܂q7e:j7rppMg)ͪYaww * *8E-Xoxsu5tC@\Yj ̫D }y覉u^cAY>ܢF t ZV [sny{YpV0xw%x89ÃG:480GyuR-,Kjb m"OL wMY'"CMbǎ%.S|EN~DP`֢52]vR Pӝ]5B򲁸B : 2_-An|r,U:j-*P."v9ɸZ"84(/m@9I,㦍|7L<\f>QD;c08fxr=U>/ʗ wg3|v|zasp2=`U>?\/JuX ;RP;݇zw_. ͍2d%/Av}zu2*7&ޤ8 1OHYBcHx¤!'Gi-Mp죪}S&܋9I5[|EkALb?/˻RpB@ +0L}Bرo񨻏1esn?33ɧ88K񒶩 4zfK;;OlRH"N[t`XlZ0Q!U`GL:*fMW9}+ 03D LLmtP wL#k}>z+$[:1$uZ']߷'X@g<>'*nʮѭkkݝ@ _V#Oŷ0` x|>x^6x4xI//??=w/_M$q֭NO⿧ȣ2=m.eiV0"`[ c'r'H]ZeF&y^2۳F헓兾xnZmrGnG=Rٴ63lta"|̌:2,9t=,rK!4W>7mm@wCxxpgrhU<↍EޛU~6v["a)_[ y7Rn?B8y:;SQDVw0'y >'tU.Uyb)/\(Kv7W-|Bkʛ~uZ^A.dٽtVnu\.a:*FW@\yGw'ޡ5՗m< nn8%uP<@w8G]P#$PMDӢT~m|'Ft8Vyddȏh5rl"|>ނ&pj[iiHxXl9Yc8}VdKS;!ϧsmm$t(8ES qB8y[]lAM<]3Y_N21mh-jm?7 䧁w 0a ʼno`;. ~z\/ſ&~~%~{»p'a~UNYX2\*I@-iHw:H@`1;`?AXTHYs'O~:Eu~[7)"PeΈvٕI7˻"=?6hǍ ,V>`N,_ q@( $Ch+.s3-+bPhJXՉȏw`ІPRμ\3#c uZ_C5zioփ@?ɕkFDyهi\2ضݗFoP\'Mvy6hl;l`ͯ6l1Cb,EȰķJ]6݅mXYv77{F|6``L@nZC圆\'`IK]>6Hp>RH =m8iG9A]45Zk=l6eSzn>Mv|Ԍ\ЍX׹ԧ۾qrwg C~VG6k؈#=o3wb+WOc|e6vɺ8~.# 0`b'N>;~(??G.?gO=x嗵'6q.N x߻"7qK&,2rݴEi_qKjmaQziQ{>};!z1M8Ak]a}>6dn/U@;!"?\ڋ(2'O5tɻTUBDzL2[fl<˛z\cúJp; |2V՟`#:cK2[-hmr@ʍ~)MqAI$6um.m@mq2?XI9Z퉇1Ba {NYmtg|~9>,;*?, ?@)>`N?*#4!>~wP<OqCy$$>3-V9ҸĻq\+/ݸPyBy |^yK&Eʴ<yR/pG)7KxMFruu 2ZFnvy7 ߾?'CFZeÓJ7AX Lf1[cuhCb -6kk2Gaȴv6GNIȒw0%X-~tGze*V[ l;[L}"Wu@#7IpW;ϭKݏ'`i܊v 9cAq M +/e(צv֑ǔ=-Zuu/r)O=]8^xrmK1ȓ|0`Egx v_</) n"O+xq)!!/:,Ts4פfO&0a!ޮe*EQj}ҙ6Vm n"66Q%2kČy/4NH͓-|_Fݤ9=~"\YadhnhMgęYgM* RQ|_mЎKǜ2O凿97u0Q>߰~Жf+dt ؒ˃o`{yLu(Gݞjፌ@MVwsT@N 6Jvx Ph飙uQ)<僜WWG;o۰ RXF%.І%eÍ 3q\g::?B#Lh =7yN2 wИ;U}(J~>F|Q>:Zfcq^>-g)9_ϡbG||+_"}{L-nm.ёntUV‹{EE2!Iy||Ҵpytu_Wc|^y~y&Bc+WeˣnY"\oeyj(Oh^Wy7eH?#3Yb1#V(zcflXe➶id<2}>CHcnNC|2FMH0QOtt4 0`l"m.,*٦i/[[ilW ~neH 8x׍%>wP!#| w=Xk5~s}5!hg]42CڻW۶2M9)18dZVIQd&CY7뀜)3dteGMpjh2"~yvΙkoud<ʄq*>!: Os#F)";TʋWˣQy|ڸ|vcR^FrC29Dz\Z/q/||goLgqhǵǧ#$[@`^X# &oBh*iʻ:.CMc*aG8XU>H>~R6ZR!ϠGkcPurC %P#a6XPEٕ,ph<$H7Փe>ʦC"3 kWԳY mOͦ~*#Y BC(6mI vIέ.[`+C_wnwm&!7vx~ y  l{ Ur:~yL^ w~e3zd 0`6}&ȓ}λn\z5|G#J?|g{ϕo}[~ʿҥ/R2㓒_k#i'1*y 0bXCZ'!<:ߨ 㡇_3B$o$o]ݮ fED3࿡>A"_huNu2YIt=g=t>WD9-0BWPF?ds ϯ[L?% A2ng H]x x=f Gќ3 /S8gHp$8DO~n0E @XkޔEl^V\w@^ߣ& ڌ!R6#?VӶn$NՇ@FAuĠϩУ?ckw8cN=V̄V)Ejf(mM Bgm\i|aRHP;rx=m&FN=CG O:Bݔ@i~7nʰl+7l.q i ƺCnf&m"w`Xܱ%Wro>*rW1F٪|;xd9W䃟5X>9\xt q E\u6u!K܇!}ip>n"dUʳ<7i\.+Ǥ|WJ)^ZW. qqU۷ #p橽6W] l[O8٬7E,O(ΐ&B̩#a2;6AZN'f'-D)X~B5"u2UD֯td2j o 1֫vƄ}Ðt>Z'L=ףVxgBCqڴ;x(~p5Its!Cץ(Iqd|jen ph|KY[q/QY_}RBѝQ疮Nak޺TB!<́X@4}uCxfiD9o6"n:ڙ 6M}ȹ1ܡiQ va/׶EH["9xm.} >h>pIrey%FTV#u~%̗n2z󑲰}\&aU} HWz.N}[;?^·|m?؀28G O^swMx饗ŋ?__._k|??V{W;i?T_^{=nOOw$W 7p3Е+Wʅ tWn2<.8ɦ'~UB)=gܮ'@Xw4O俉)9Gǝ0~Gg,y@ ߱i+']FYյ+!Co mbAS/+:iC-yZQI[C_u[s(_!mIDfѼ\)_?=ϔGeLw^,gVNqls^oC__RhtoElt {*|o,5^͹X֦#rm*E>2~i,//˫{ryP\) @+Fz*9>Kp.LJXJasʋq;tUnAOZ&,D/Q+mXG]8.xE_c2˧>T --V ͆![?V!G:#/ΐK37'Yʋ>ک6{@o eiGAHyCC q!U)MdVzSxC F?f_6 '\HiH~H23_#{=n"sh2Pq10ZR1ܸI6v!YƟ)A0E{8Ae7p˸m8^J3qD*zQ;H6-7mpAېPHk7{> 97MtXh9.V)_w֭e|4+{pk֊ ePAStÎAQ΀NG"fk\WC2iaF= ֗6 0`8xqڷ/P~+y+}Wx?pSO?gLɟI?aw=[،y"7o'qm} t̷m߉ p<21Wۀms:o:oӡ k*#r:lj1m Tm@'i\Os=. Č* '= @SGҮe W /P # h0WH-GeT_Sb'x}kݖ\jkzgwݰilmy0ҁ 4 De lw{0ʦsC@[j*sTM"p#rpPwYG rG|>in:X,ug[G%2??Z1-K|E//sp%.E<٢ܩ G.Kȸ2YQ;jsPz 克{़ti\^2.^WH>|wP i7$&$BZHg=VGCV*ƃO1D! wBf&9܈"[ї;1P?v-뺈sx(IO(׍f$/H-+iVm|GC[;޽\YrZŤs>X'[ rك=rǧKC/F(7E=>lh6n2׾dT@!|L ;n{<Ǩ\eƅUyҗehTI0x5Л6b=!b}2a;x`ǏgcW0-2NCܨ }z{Qwi"PHVTò7&Y85N2MJ;O$bt*{(8Eig߼ m-:s6,ϥ sQ2` z"{:/_tsܟ؀.~+xj?WYƍz|>slҀ)ߦϡL= xW~!ѓI龆ntoE_.NE].[[p^xhq:K˃gt.?*S##'_B~]}!HwaYouzn/ ѕU8]kUyj)O]DO]Xg`yNOs*(avFM3 lL!Fâ *ěL:MQ`ءm*ho AbsH/6q@2ɹ!:q1nthծ>#AQCz_}D[7wLsXqfֱsiⶪ/ yZm-㤏Js,4 b:Z=PPZ4A]@|-:&Ȅf@wċLW[,\6^'ߖg?n( mQ_UvQmϰ qj R[ SdMlƩ Dyivx7STrb(K}40[wP]i|ҷ4Q7zpd "6T?8j| i{|0X,5SU#IQ|޲}~ {CǏ&ݹi`>|PDYEى;z4)fKn`|U昗1'G2/lyD"<@`*8~z Dž6dLl5՝6evJCЎQDz 'ڜ/ !la.†rg9)_Gsr6*O~%~!~`Un,˗E޼BHv9ZFނ (|xbW3\g}c$lXm޷9-eD92Ky}Nw " !.uٝZ_Y@T2/Cgu'R8i#lW2LRrW\iu\y"s38h/D݄zEK47!5ǧ< * [[oM[Ahz&8P!_9cyCSi ˡf LW )ZE_#L(ˏLPY״=;P ~38OHB^*ɇuK=ok0EO:\͈k&D!КD"vَeLk>M}M=@kyr 0!"y:Ї?'F}r-|u'l} Gp~ho xIDJG'#ͅ^P簖뱋8yZBwm|2-89yAUgo_錴d;`MkC9t-fml_B!,oC\LmTD2L pL0К"s>&mKe*:%ck PMgOφG.j_XZ`AڭDW:Pfw@Զ`' a;ԎS,h:L½scD[i>wВ7ݢDa"۟5{ly .KOG$Ox4yRO w|%/(Gqx.)m.|cں@dz8A=[Om|u4KΏxbG<"CF4iCIZ.ۂ| 0`Ca۝?k駟&79?c 8Ggߡ܈_`ʠ<8߭$=*TMm܂Y1{#>7Zr0ͯ S Z7=:y v.J|_[#^Oc?"8"9? WV?.,6LO7$[ z0v!ڳq,  ϙQ}`L`L0qKy٬\ ĠǕ"c0Ѓ]ʨɑ̣5z0 atmdc6fڰDlDMcCDϼ u5F;Ⱦ&h27KCPBI@9 kb 1Ʌ6p@\2ޏzcp9*^.3j{!&,`&qd-UQvO sD4k#)yxm.\xm%Sfvi(BW-dL(yvR%+VUsPulYQdAȸLxJی0622mVYN`w8~SUѿJ¡:Fqt*y5C9;8lS.P2C=~o_q{{pȻxL]Ý99*_`WnaЦݝAwWM˭IOa{snX8Fq4󖓇s,g똮=Hs<@*6ZgN4 9o.sB6ut& C0T- ̋ق?pW}@}d. aMB@My~kwM53 0>x) !~G| 0Uvb>Kn-Php䚣7[iZnMYj_ԸCN_fGJ =P^(}QPrv:}Nު|`?A㴁x-E}vדuttL)% $>؁xDW;ޠ-ЂgyD`',7` sX}'^{;S~W%_MlyƮsm{oi DPg!U]&Ty: ݽxrrǭ>fXlz>YU6!%4%F[ h#GWQt|*A7q2˧yqeZ2P> Vу^]C ۦ>tmG6#6et*IYc4Myq(1#cD+(w7y?G@aew (wv7}q LxA Om`I*sV[ ɟN ',= SAwN"J~?)𿏹AntA{wgX[Cg[h0𷆰jH;V5bs7e{d:F|ĎȾGܓ65X%LG-PTI[ɪH96؎lWS54aǜMiէ<y`N2U' X4@M0Еo#x][d^60"vcff|m@x2"< 㦍{G\97~F^6t|.Kyd$7fp@S^ylm0LgKƐMq3í?>xUmIN!hJX'\/Zi^ h\_m:D|( >uJ@X?ⷔƓ(5E:yp@06 mk͢ P'c^:8*6>]Ϙm6綟mZ溘wL^r~nӀ 0`7|J_."a8|0aN Q#f #Ny猼 d<ːXGs\y:0:7waĿrоnSXӂUl.tK6ancLc͑ +'6MMz@{  8v*ŋhA>F![GZʜ#yZ?xl͈i55aźe+U7g>/ًPfxƒh_ 2Z9<ꈲ| HkPl c9lmң]a %Rw"֡;F0|r 4Ҩi`Al0*B3"3]c;ǔQj⛘l&WR6<6oѯTu^hͣѬeM"Gb]V5N8_+c~` 9/=,д|xJsowM*; >x Qo:x#pKdⅤE21w `/29kaö2}2,ߴmBSR6ɸmp,v7ӂ.;4۴LglavpZhL 1ny}cNH)O6Cm Y_R])wO { ; ^ vMZY oqڐe!dh ][(d8fZцƸ6}#=0tȨĮ2i] U>M5TKzChbmlە "Iƻndm5}i,?#.8=]]Hs?YqzY#6oXH9>kd Z<qO4@>:O }g;ńD 4_1Жhli,c*NqpB>>x̌nf|N͆]tUP<m$m%x]ـ 0`ٿ|=oVG~GOO)>0ჿwI״7>̭ύm&U3>v: hgt }+9GAbFJk], xZ`7 cǧ@6X0I'h'*nCY`n<w5"q<kG-)([w4μ \2 xXgk"lKs}mЉ L3v0{xc:j6{U#8˳a 1}Un:ƕ+9F5 2xF#*"dץIrv'3g'c $G$&#?cC#E9 kmAvx BM!5@Z#WKkCqgcH/0Nk=GfҮ,~1q"x#8o]yWGO`mQg Dq>wM`wDN|;%Cy7یV$C;XI1菦WPN$"!l7a[w!nڕh|r:mDayD}-[Pv |r 0'|G+ 0|0,^Bee1ϓ ;}rO2GW}RC̰K-$r| ?Zec'al'?g;w14O^m ܖ P1d~ml%nCPԣux!IBCC1/ul7cMb\+XB"9/`孞@W0' ,^tu6Pny׭!Im4NbK+R myZ2yڑ\ Cw$WhG sǝ9JB K7ӵ;.wvh"<(](m33Px]c]#ƘuƛY/V<1&L:Վ>cr`tth>*ن<%XG8;Y3\`gD[,8yZZD_.{=Fc)Ҟ22)5 N/vGGu.)Y{1A~u}".CQT;ĴE2*I?ې7z~$Yv/)MjCiާ`4>q10` '|R.0`<f v7##7%,͈UOffTz* x/:y!41 dE"wu Q <Gd!|d_`>U(9<QyQ9@;Ѥ٬3T&S$}`~\ilf"3 l5%|Rkq\x#i7bn1m|vXG0e9lUK҉X`9cYRS?q7rtRE!k9,&D呿( B'Stm# F iawBXXXv&htZ9-J29AQ7Cڋ&5~:;NԵn4"_>| 'TM>eu3gkdbEO|,/|k>_Bq,XG?!7\as6!zPerNӢ$QN>B!?eDlGSAuB>v *BOeeFG@Ym!r3T3qOF"f䆧j^j,ciׅڊ3[!o#x L㦻l_'6@w;k#pu\"7  #<X߸ia t@-)0Nh}%T{MLq91$j_~ 33 V8t>u-YmdׁdBv9l:sqFXCFH/3de(،7҅\wPŸ,Kxۘֆ^d׀~R_/Խ uxJc;@o%]3l3̈́tydWs}AFŁΊ[}Q, =>9N6\uG/=Pd?OӖ0` GG=5`3[Xj$IĐdW\7\獝l'~ n^}} BnG@O4" { 遀Gc scjuB_{b 5̷1/# 7fM~L{EI1yL%vP$ku>﶑;%!oHT[=m:v0YW-D@X+ڝXGv*s ^#E.G.oɻ:av[FL]N2D_zي&UF=Jjjg!@̌i#JW}k LB,x9AFRxfht=O9[a\7]̳,ɼE[}haIܮqU9HI:u$'U!luAQPnZl`B5,L[~.h_y2/&dx/ʥe: B]Hb%s6YRj63M$Ѫ?2"S> |Qy)#3$" P[n0禭k(}\n1}fc|0f]-zwHs f~SƵ!uBnqr݆xGoS'`hu0ΓWVkU3qVkE( 8Äxx̲4@d3)O' yלO>AvZtPьs>b<+0` 0`N d^ qibU;7nAvs1.P=j$%,9l(љpbOuFٞՎ.v bqXM*y1Hx)Aq7v@o 1yT~3D^ص%1 Xr!]ѸۂE[b/avkRUk ]㭛?]D#O6! L"Ƿ>c[^!4"!tڃwzặq tP:,{񿓷)?3w}n+םC"μ["uڲ&78w mv(YNcG XntDe_3!,NQ)&SxU'W lSHm~`WKcw2\Gu7uǼDs肥 rFb{(Z/y$>t=1pf&LPuqi4A4:zo@ԗKKj?bc*lx; mɎ"hguNnJS=YSึ:'&l)nAUPv6<kL{Feh;8 g)An$c(\0|Iģ.M8Pv 8pqs=hZj䚚W`lz]v8miA`,AQWNs>å Iw#0d+9iða+^gp0H;Tu@`ܢkAqB$%Lq +fEBmcmܣOv,0tm _7"ҧmP O> 0` pX'>ߘ>oF?} rYVd_u{S o7>D | ?uu28s?vgAgM]gEvCu?O494oW'fRo-&(mbj`!M%:]|Ɛ{[=-*D# ؃(\$Bd.uƁ2!WL?aYwL]%zԫKq5N?-+J~VW }U?35ݎ -VnCd3 6-?z;խoq;A:rP}@o}Qq'u 0` 0`#o^,~; S\Ŧߵ(&w xsS} !慝lP8n.cyPm$|YoKnxRx9/bU)2|( p !c4je2PaxA]1.c;e%}mD]wH\Ǘ~>juV," St> 389vc615~#YL0` 0`^]P.F<ߺ Fuk}e#_+$C$_"֠N?y'fe,0idIzLӓ|3Xw[:*q؄8XhMnM䬈{}-*@4[l"Zi gx؜b5_FS6l0#2"ʻN*- Cnmg!:bۊ)/o2Leds\ATi;}@̭`6Y%5CiDLJ'v9˲-Yǁлtq,1^zPF)?>>e:hyppA [A zl=e[#Q&nG=֓ek[MNzy%uׇNRH&riwf5/gz뚢 Y7Ipr"Ѩ!AQcMC _uLw\.{)New\T/2VdƮ>D"f-ey ce7ȠG^}~ ?h<a}0V~ 0` 8߾.;ؖGōFԓ: 6fzh u; 9 㞦<'3Pǎ"u@]_BG]Xc<ؐnyG/lq1ntV^"թN# QO-(?Xta>02sH Tƌ;tA41/&AS(;뫹JnEpheЯipZZA(brTC!/@;SԁW_AjHߖBG x5my7e-狜9H̝@Y5) q"!ۜ(qU`2]Cr'2^#t+bYƹFu*#t=*&Y&:=`JRj7؀Ne{|0m3h@m,g6!g.uCۖ Kd4dd96'v YwX4(7XmÒ܌!1ph|;2[v#@KNj. t~bA݅oK wsgtܽ;rzm~͈Ů^0CJ7'tUYD9EdcvO5Ϡ]'m_yCߺc҇MrY 0` p{064$K|"Pd~?i]c(Z+,ym` Z+:*Ao}[i=<Zg\|vKsdiIOgf/.LW%GT 'cpZ,0gfyY.x|rs]5)d"lehd!Z tFD0|NU dF)LD6/9ur27]4OӖ(Gd{(%U7 1ɏ8^Jm8`qۜ1X.+M]~jG"m/ی򵂽֒HetΜT7dmJ Y&|JDUTՕim76uQFdB1{ѬjԫP6ִd|L~Ɔ1ҴnB }ouiе*S7ГfOۻ<+Kt'CȍZelzl@$CKM6{P_$h ]_u 0` 0`,7Nx  ͔.e[NH;;bIDATZ`|F['yqCO_t(`B 7tIFA >Fcݐǭ~FSaHڢPx`4e]<^uDOIHf'Շ蛾j{ >Rkg:$lmxD'գZn#Xh#-?ݎ|+xqP{re gm2]dM6zDލ[h}ix ֭}H}E,qjY|Ev\Pnt\%P9-X'8g͝Ӡu̟վ/ۉ4P"Q41'A /cavSak˥M< ~cD~i&ttfD6#b~YHrĹM!~9s%\@ߗ [}.tۖ#r ZFV: 0` 0`G ]i{"_╢_gόI[;Y=OJ'@gyGoWtWx?vb>.+vszukš; . cSϱƂ) d:!ؔBө/#M fXy:w)^a"t:.#CD X'yt$Mfmd"\d5N5C:nmc6^MOӔbџ 1'2 Ǚ=ew n`8׻ ;B vvM'9OwX:f&j2+ U~t _U#Ԧfcpq# چؠҩa}@A!5 x'DoZUWAyN,'K&O> >A=x@oÎ)k 8M ^ߴEjo˗Si͠:i'B;Cl3ʝ<&G {>-6+e{F;5` 0`<] -:7cg.uݢ0mzy&NF:tuܿNz>qۧ g `;[W+tT" cmE.{;0;*;<(t CwRln'(s2;D88Z:ZCկ)VGm]A0[뼐fC/cuas|;kb^;H]˶Gmc{D-ǸFn6C"1d$EFȮBVAodKe„ I^1)^ҦX$=1 !;'u}ED_;O E*3m1减[IL_:ټX)e'v(͉HFWƸ˂B#Mx6Ytǹ軮qHJÑi]ѵC|`CwK݁)2Îc r;&uˆ%!|h AbY˞f9B±cKNoOcϊjǍE{Qe;rվc܂a'їGbaHm~HhVdU70w:Q?ZOVrm 岏;/V^џ:vC<,s}!+'=)g>w80` 0`'lO^7Vo87$JcT>i03^2I鳱 =u>sanW;2 rV@7 ԾqNu3lM{@; Cω 2>3B ! ԡs|<k[J_sOvn|lMl,s\]CԦQX E! \QN$R5ׇ6 @ʠ4Wrë '|xQF4:AAI0cBȾz =66f @#ހ]04e}ַYNu&f2% )"W=u-/K5mXhcBG6ԡQuf8+o !p{ [t@]OwB8FXqȎ1.Ӝ4np=+,0f턞t;tiˌf+مvs։A+Wjv߫zW$od/iƽ 4ǹ9t)+gn&dUS2׫; Ml#Ghc/8,eO$uZItv=HSWfwGb&po"K+MZenG֭7#Amr'`A/}]aǾ'sĺ]?τlD^1 mۉqڇQ׶:bו(!cG}I 0` 0`cQ{Ӈ_)sF=:ϲҹ4"G vv}2I^6lv]_ Y;k$P9l3Њ9L;ǓE8+;gc&dNg\Vޮ?JG=׋|ΐ]oy/\!yـ5d$JzQ HkME2Z'I ]u]ʓ{vE܄C뇃%rوW[,gmC}>y? YaR"A B-XH"! C%$釒Q55s͵s{ys9c1Z{vt֘k\ƺBh:ȫ|aMgO[a0gnF!+VB֏N(yi YK?vtŰYa_YNA_C1˙z*)f4A<Qd#q nr'PE׋b7Џntv Fw;===x/КCLfK/БZvP5eon2:{OԈVF7J@V`(`D02a:j$-P4Jn&) f^rcLȡ/n{gi yտ'pE{@Hxe( >#`y郏|ͱ aD|mlZ 2ǀӋkz[0ϗ4[As<# +]fqGa uRz0l`/rL`M2g@A7/v4fwM$D_ȌiApQW`(ZL|B2wTM9ᖕ5yBN#hմN5 iP|8j,|g, baStApbbbbbbbbs wÏȏ~<|~,GK}}??5o6 ix՗~u*r͹&#Ψ.̃8~NH@RY4~/"ME Z !K?t4K!;k\]Y ?gAaSW..H}P)IlmǴsvqգh*xmÖuA_@a4GYh>оƾ.!=uM9?Ah㺂l5r|BD0lm,%ZshژP;0bi \oR"[# k-~1PQ+UR˦-fSȹhsl}Ϳ7Q^&&&&^:Am,ǼH~ Jx B9ULo1h确ṠS.s8p .pbvCvָ8ěA{So ,巊hc{Es|xSFuC Dʲqbp{<pZ]ma:G5laڥMn˺.^490ACP>33,W:`ބMY21dmy^d HllT8V}rnIB/MXP*k&)/ܸr*5xQ؁lpƻw0~lb@cWn۰q6lUFBY4BKB>9k,C>1W9[8{t5'DdP{_(=~/Fibbbmcwcc,p=Xts*8u")_kq)Q(@WIk㜎1Uvmհv3$nmJx#Fؒ.7+e_. x'p5MW1j߼F@id#}n;$g*%v=ɶO7 *m}.; YbE=`93^)'C VR qoer$7>Z9.uϳ7k)U!'1ȸVCyl")k.>+Q)(eeY \'+~XHQ&m;J\VB0Е.XyyѦoey oHP+@mJm.+#`;ЮeVw} 9rV/9首,`l (r mE PBcY?Km>vgdqMv2lK5n[2zԛse) _y4㪲SHWjNħبTM"{^ Ȧd)jW ϛٞ [11ȼ@S_u Vݍ}o| oW`2uj',l֡3-śinP>%>ƈ],RmH۱Ve|Maʸ,&j"֍-'J3ʸ#O X2=h\4F 4H/lۮ^ER 3ԁ??0 {/&Y0@1н;\u!yFno>aH;|ot*:611111111/|/(]?!kDZr'? 陑d<Fpo6 zRV]ؿT&BgD'zOe?B;Ȇ:aU潳Xꇨ6B;I2#duYsqN+6RfS[F/_aSC{8wGY{Ul6{Z=,u$k Ҁ֌{5@ؠʵQ[43k :fIc V+ >n2qڞckq8G}ssg۟L@{;S:~y^A7Btٗ۾֪nY#9ctaO?J FxZ޼QI/b?J\j[{:t 1 J-gJEwWݖ1BNq3F({PXͺ=5g 9ކ{s >NLo>efjF$0XWq qSc݃d5L.AÂك nLƐ/&g_@Ǎg,<2GD;Fk^ϔ'zb`| 1mT]4.>$3.""Nɐ}Ix/b\l!%܈ح~1ךsbqPa|ZlE]QryG}bSkaburFyRu$CWiɟO k `x|` ^;.cx1,aS#;csDgeuZd44x+|w~g䮏?|ɗ|I&&&&'@gǮv)cGǺ=V{zz:^ft:]T)P Af'18 5>^̲?k>xS pwh3 ]v}\9Wh g)/= cksè:퍄]`j*{AT02ϟ:OۈG~,H=8ci"ujEc9d[oR8@%)uX1L9A[T=ms<h-pPu#M&k˛bq?"~̗k;-0E;SwQ?^jbTh- m۱i@O:Y/)`ӑc F@؈z' h=ތ#Hu|ErO, Spe Ȭ? >My=>FFІ4/})ۯ2"ʉzyI KNn՟QWr(ۂ%q*Ҁ1!H0ܖ Ci?F5q d>0*`g5_S_7S!{#>[t}:Jo88$Vo'x;'Ѵ'Se|uwĩRg jq*?p t;~ma0CC5NMa˘~@"RLOe!`@|c7vi !MrĤ(AxO\7:}5~䳮q &.xl1(;QĽ@29LP(h~>@Uv^06YfC7< 7Em(_i>hql~|xj0Gr׽X!y zf>m~Dcc{!ʺ3zy.7 %Aj89WA-y #~VLW}.Dl3[ր1vqc4l}O_Ee`J8NO{Iio=NU@5jkmZԇzbbbbbbbbԟ?WW;V?c6*`ghJf=i|0x"霓o//*"!q {.ʺxk戯neз+Fjo_U$<.O 6IgvmQ0#; pJ%F Ɗ|GK }N)a)sIᝫX4 ߠZdV׾qJw+֋`=q"La$ :.ⵀo5qj;Ӏ[ݏ:,xD؛hjXN._;7aK̉Y\b-D<`a L>/[M,ǠO>{r)qaD{[ 23F2]l24uXZڸM@/ΕdH,=2j`M5ސǾ~s kh-Y\6{~3(WW~WFU_Ux]8EGz8L2"o`o ~2!;?K3Q7lf ْLFs ĉՁ?9&gT 2~\8EEnFgϸlg")^ 5fM0~Oќ>ŠrvryٷIef rQY~&.I)K=0"z go-2( ~\zؕ?On0 #~ V @?K/}_Ux "6yιU [Kl)%#69Rn/a͹^j&z"~EaЇ`n#jk{aCq2&_D㒨#lpQl?Rn[ ‡#J)-]k _&;Ly7h3q8w I&갸scۗkN܅%JgD{s`cqpW8aٜxU|}Q^ԧ"7111JHǚacX޼a96FnKvtls#z4NCj!4=ur]4[2 L}6.3P_8oxa/uoo|'XA1Asd~yOY$uFq # 8{kΝ߹ƺ3?羹<>H1T@}7ʶ[nlgD\؄#PG #>>{ ?g=ɶiU\-I[qV fd8@}6lA=7ق쀍bnxe,&)xʈ?'ddwLf\ `[<_;סycol`|@l)&* TYYۤǐ1 %Go!4!36kPZ=H|%>5ݎKMR 2^9SJX;,@% ]O' '< ,e.qd:ymBĕh\`ޚ[lWw)lu 1ĺؘ qɿƟ:g/[_ ]kxpt]$ `,D[~s M]~ ۅq6%`O_Gz#ʇ:'"u}H"{ z}jpU+x? n'' @U"v{̋1%ڛ:Hz(vf}#.A`o&ni Km쭘FDH Up?nFmVF ;]d. VY(w\hz 2 Udj_W7؅F#ELh_~FzՉ#P.jF([K›o Y|.g`z)` .Ի-L|}Gw;hC1 igyߌb~*[2as\Rvyi:vJTYQȪ'ݤ[b\B_Y޿]uZd #;ݧ⃈7J w="džYlCw.5et\e7aYzG<茇dR Ea ielV(C1\߲vcA.My М}@Q;9s%ݾ ;θ*v}`0tq7v*>{ֽeayЇչ=#==11111111_MLLL| Ft&GzlWQ6 ȣNG퍮!޵8F;oh6t ݏblcv0Ă@\Bm=cq62cR*#Ÿ$p|2IEZ2W=B=G6(I1Dj/Wb͚;yϖ,훹仡qPa)0K]cp8H~8r|8js$d}ĭmbeeIʯ1v!A\xmg?Lۻ`5[a @=i U[sQ0y zae HVٗXJsL.W]ivGPG>~TZ|7h r#U/7A ^FTOH''g6u0mYR.O#]. }y 9fۃ 7&.>JFO&5uuR,m `)<͇.]_}W2cۚm(HpzVPgFyiaےL׮XF*Ҧenc4ۭb4΄qyjmX/M9o4Ndߝ'"+:Kfg &WHcl#,i7:KgPRZh?!>_G:xcuA I@Fw?r֭3><-R\u {&^_bj?_=`,*OXcͳؗW0׋,Ng6mT,mɶf{>;11111111q5OT^??<<Rk_==:-=LgE|b J.cQB;+#$QaT656W/v,EZ(9P%AxM_# E551h?m 9PsfHO]k8h_k}N~oesY@{ٰ?Yǜ۴ڑ 'E S.25#"}c-"Qq=n$"?A,XsdN &^`6'i {G/.4Wõ|F܊q #a>4\:Vx.vlPO}g&ndoz$wR(}0 ^鳝6;='- nFӚ~ꅑB PN ^ ?o He >4=m1u|7X bPXqCD1d.In۱bRS#U#JGbWѷVon'ɠ a3n5F1|,)Ijs,#î:S`P}<2/i* \Tht^k[@/-~ X% s{T2n)5˥}$<_98{@O p_>ˇY6VX az~~5XJ#(^_oO| 8^SJm6ulEc뒞?u}\F5汹@8q&,lY~E}X=\d#f$շ؊A\n6hwӰc=Qr^G}K\S3o:7q[~m*18 GS`[XP+2.3pE47pjC|6}e|F\9Ɨ?0 WLTC_+ݗ/kabbbbbbbbb7{9#71116$VWyyC4Q݆ $v[ ng~f58~f"k:{}+g/Z `GME02ߋ01q&tGs MC6Լ~S>IO'aMu-ǵQkaIye`2Wlk&22<4h06"-.-ˣpEd߻}YL|Jg?:4^b}Y\4@9ʯ&nLŨRQY\Zd)6b*76&aWW}Ï؏E_?g,Jh_UW cǸ@7ٟQ_;Ė>(f^lX>@6cFv: MtٛU죈:mxu `F/ęvkFK45^ ]iʺjos/Z]fXzr,!zoʆ|n H),dP!π ^ h"NtF6p!CcZq]mqS F HE.yh(v۠.#w^+evA?2g Q+gݎu$luqcM' e/ wI͕C 4yq7W?usG_Y]%%ҿ|129HD5@ VƭnzpL|棧s6`_ߢ\mhq4vd@+r>==˺7Faώd^ʽ\#/&`<)S+c-Y6)v%7D٩h7^mGZ䮏WW4111;l('8Ǯ=` dm#XP} I.H(G3AybɪR0eFl|M! b.Nǻz01ț~"ö:Uou?)[Sױoݪnhm)o2p?^uԈtk䈰ۨFuK?<q] tM6f#I{_nsȯ3fD,~zaM 2t}l}o@Xnf֚ڃ,;82t%+>kڢm."τĤӓbT P۳䎭m}uD;bFm#ȶ 8HXӯ[uwq={ =k$A->HnE^;''Pqr+aEBm/4T?%l.>p~XkFV1_Kc#PM'RZbT|d3R|P.:ŇWDϑ? ,:??ggmqtxuX"09A`)I>SMй8)-2/:*m(+@{.ܐ"2qE),O8m*1fLĢ/2nGnmeoqy6Ǐ~Ȕ7\u#zBWZhSOzR?yo8?#KOT{eGO]C/h2O s뮛 | ݴNX*lnߛNoWE!˜Qaq3ڡcyoG^?*6:>b}@f=3-jaK4w+=ý_ !=]JWC?&po:^> q}y.P_""Ŷ/M~&ξC:lS`?BWyzj_g/YO(6:>x6ZcX-;c;C2:Ɖ7KKQx]o'IyR;';xzQg|7c:FѶһoc-sgdoq_;ئ=7(¶ ҭe(?m[Ǎ!ԡ?wGޙwEvw|geklz7>Z^}W_k tPgf@߹Gl53}ms_s !3>p-:ˈ1g$1΄m#د[4Mq6qc:M0ΌǸ Hx`/AY󃶦OƝ&@{Cwp vv.Vê[]Ԗzc~4 ]tw\,֤Gly}߫HѠ=; _+i"+59[\X"o}Vl5kVű7b%5 ese;'c,Ѿ>~>``djĻ{=b74x}cl+4M҃m|4+%c=VV;ɕ,n·>Q{JR+XZӖkkA;jƄサfb}A;;+Cu0^4ӂ/i fCylu17Yq (@#֒ѯ~8邨vt؎"w~+"`&d#+A11eLs VXB~8A k ;j䝵>(h|_1F>[aͻO/"9Qdg}#)I ڊ+B!^ t3h.%G:R>*F6,@ɇk_U_uC<|7}'~'4111 10O1ny2|)݂썸ԫ',"vy8향{[8 C x1,KqbX rl= Xxy㹅vB8fRM q,JӅN\t{wy~aXJ64[{sW/Hvp7 Cl'P"UzYȮkH K}m?8ؾ/ALz{( c׃0# ֬tA߈$U{^pM/ZH1x.mnԠy,nr ж3%&he|ޢ)->(K<Rߖ~dFP r1/v_V[".|;^jH /QLfNaaP:2z{=6 J&WwĈ .ҵxQ8H0YCԛ ٬P*zzNQtUĎ/1ʑ y39l8uO^ ZX:&1C-?L\[fz&f wMLI 9;IHGF+dgFk} /T]F6OMTBe0?$S>-,&P_sоŝh( O S\7)i/֜FsM0h@9!b`z17Elo H:^H#(Ԕb}ǡc07r?PlސS/jYG:1"nbmm([7 .\fr74NcbOg1.y)nF9Dῑ=pnZ @6 l*~ĦdN (=G7mƺI!|XqoWm^ #!-}͕z1tN9^׶?11111111v_}]]̟/wyLLLL|s:~Q-(qwiwA~zׇhΥĪh9NB ']="|hsI-1(*Č ?k:36zxMy7Gp_Ǻ!x.lLj7y|,t%7{Xۀ] @5}< b] #{y|kNp;b\GN/@rsIBh2*Vۺ@蜌Gq թٚ)׵xdیkyzf!BP,UR"baoڌ|d2!T4 Ȭnk"v4nNiF׹]:bK>-qNb'Я9٣=<]/g<0tq[a`wo>V[ƴ&%y-,d:$)}'"}à/@b$ l!Hz}LLLLLLLLL\qo(m'#oo8B:111 c݌K{FZ;Ƃ3<:@ǽq ]K @6׸ (G3*'#>1<%з&c@$xźv o>&#![\?{uSͷY_mr!,H/<ۣ/Ȣ2Yfȓ'Gl/k[1).&[!.li`;RJA-VS8U%xǂ(S3ds?n`M ≺\0?{QխaBÚ~Uld;*zh ty+v:o@/]@uslFnQ oԀu,F+(>`i5 nJ[کaiO5YZw)j#(Nq }}c_s ?.n}X8¦r! Jos<,PĪx#_~'g+]K}nwn6RĪZQyS<5U& NmXؙ*'f_s|̛PztXƲiEP,5r߆tbbbbbbbb-G[__3(www~)o 9.cYӂczn=Ϭk@[1PEX gOJ~uKmhpitR<|- 쫟6E 3C>ydx{&Kg xq`ݫek5X@LktI,7?{73ɭ }nñw4[\AM|+4,b"}i:}x52ЭEjYS$މQ x `|;v$%y" )sea)#zTLk<oFyEb2$݈kF0u|}*z?91},9{k>mjV˦;7>+Gơ4l-–|F}.+h è:zWEonN7Eű 9cC/ǡ1r VayډQe[C7vȇ-$>4ݩpǀͧ7p9u2peOC?@7zbb\B?vy,4^3ȕu[fHkbF,iK}GfL csKـuJK_@6}1J~ǰ/>З'&&&&&&&&^__}w~w>??ݻß;||OH'&&&sH [Pp>O:f;+*%G^ {5vbLS\SlCgςtN4V Gik>Q-X/UV_'#ޓ \B]Íx[}}yXEf?Ў[{@~N\l?d<M ȋ5ܾ;yye5rpEm6LFD#W95͛?ռ\VдC֌MWg7.gT:JOec9tq@G޴z2~0.X&YĆ|0mYE=G|GH(ވa 4XBō.Ip# 6)|S&P IXCé&hh.i.k[I\Vc/0"A{+J@ycѲn$"oԑ %n0/gl`b4{ X1dj+d8o#P?:|FQ^^(w3 X/G{8¢>uQ7S dIЀk|UfeZٗ{F}_D] &IST]Qk*]}(?X#1M ?֘Ok_kؽV{t_rīw苾($[[KKC2111F pj-t(@122km8tїz؉2乽l]:6h:P%G`C`Y 'eԑhķ~ =-;A~q1?8v累 wр6|hD-uCnhY؄>Ī(B3!4_$  8 LGo by (>zn~"|byٓv5>3OmE^Co6ŸSo&ȹ X[TQRs M>] Ԧ2IeNa't`hƮP7Ymx1֚/i= dU{y%`9)>PJ96w,T(x!x'n8Z]3y@۞&N}{ޯ.> Y:їU~`@̼o|gxr:>&mG *;4/,jY(ޑWY?2;x[{[V%>Xe+cT&**^/;idՇX$faGA4q {uERZ!&|=Ie\^ceyA&4- -DIa+ST,.묕>z؟&h9ON/mT\.7 Χ@(ohr,7g`#O{+1u'R&< 8Nq]7xX~ĺ@m#uERW.Qf:?=_h\sGj稼lgbbbbbbbb??t}iUOǪ~|LY7mqu BޭM8e4n?H ۜفE7ON0p?}&7؞} ٴvk6g[ =B`M#2qYukys8}g>@4Oqٶ  % /u#/,\X\s0| 9LUQWS0) j6^}FBEI1e%eu!oS"/&_iAjSJWA)i8%~EBR;['dDCKRQʇ^50,[H#繀mskW+kAJV CZL*iYoQo!~ z܌鬹;slϰF Zl6,[ܟ~(MLLL-3ȔtEw0k,MllnYK9s?+׸`r2p"~a&[)Gk}d2lTȿ088ܱ[D}tcw=-}~Om(bA7vW<&kyasP3{6mVh2IъЩNU(<~''&&&>s)8~߾C,MLπ] `<*(~B׈d`\Kw)O* ;3ĉN`; :mL/=@+UԾ olTEop;Q|!t o 7|2[TIibm؇Y#aV)/muLE[πtG_%,xW!186[v =b&b^& d"<G\Z\G"XqQY!yK_hH;/4a z˰1/ȡY. mM ]k~ʏ~V_ D+Tf۲o uQfGƨ͚\>kqJe!^<$/v&؃&L|GB_ o4N9*[G])6_gl8T=Ta[B?},gLx o#:/GibbbDGDZ\cEb:ʂمxꎯzV\ύ"䱄0KPS{_1PᅙFSV> QcVtm>M~:e ׊Np*>˩uldz"2h^= 5%fPew x݌@cx*q9QH-L̰*֏>ïȀ`@#v۾*^ ہ:|l͆2Vi/ ֧|LnY=n @)}vDb[ZY)A_G{1o.5B۬JZĵȐfJ#(Yݏey-`m 0感Zp.P|d=fψdRv!,D0A&|YxX^m{#!zrśyon zUwa&oYƆpYA@d5Zv,r/ 7[2#o`I #@1uWLA1hB( Ȳ'k(JmI*x~a_k> f.o\ƻc$[ö#EvGwoꑂt`#sl:DLutﰈxZ DUL$nWU]@S- $ I$6pQCYCܷj|ybB y7y4cU0̕>H(vȋ`2ʼ'TaF J# }|VG@Y)h(xe@? $Eã/>|B! Ҍ'QSPg1_[(Q9oC&'®KLC<ښ p1/G?v 争Gwߍ!@GʬxSXi+Oł WZF{1 R-vjϓyI,-pnvīG~AFʉi{JT+ڀryMv9,\]5{jhdĢgIG$/2FL0視wV[һwç>)"xw8y%UF3R5mяw^u{Mзoܛ.Qئo&k[k,u?g` /*(dsu1}YdA,iԶش7 Vh-so[ƍ;nĵWP~0h&kTM{p{k,(GcϺ31C~sڐ,ƌ8m@Ӓm\{&-UZeS߄ju:3vn#BYrl.CNrYY@e.I`Cm?6d7XqBLv+3Dkš"D4}-D+r"g}My+_eaG _6ɟy?7{=<3 C`Fn 䞅OEKܷ)'#R=y58-EYv 2ѢMi-tVYC2Y>~*3Z,YqAb]mO`n,pF[r>x$" c0_9|'~idtXuv*"SeEN>mƖ` M) \r{] (vtQ|Am{-I c8k2, 0:PccRf:7ȼ}K&py %j Tg )c uPlǎURyy]vE!݄`\~Uwr5?D h Kz|ZY"Y6}ɰۇD [c!)|K7|گ(>01118-ڀH7 86Bhŕ?g;:[&*F|#ha:OG@z'լ\'B'=qul9do"t@TS^,)z$˦8/Ir:q&pj XcfU&/A!s8 wE<:(Q7\Z#Y YOO ^hyyWpC4sqFs$5[7n na׷`ǼX88Fa$@X;=%.ݙ7wxK+t7_!p16cgf591u2hVH?3XhSJ/MLLLLLLLL0k&ro1111vXСWC?koc4t%lr_u4CA; ]&E#WK ;\hXek8STxyp' ,]6I5+V9ܞpB7nǾ5OR2Mc.E$+9l> Uw<4鈼zK{S,DP>˄&>u?g})}~,\C:oD^vH>%\t.>#>^mS۵m]VF :kunqzǙl{DR[ v{Q i93+G.@&{K6J. &LMa T&(4(LYl"ڗ(1>@oeꄜv1=&>G (_>.ȅđCa9 :'V@cu# ,ɫ}HghZ ւL'OoĤY3b %šs@}@ک$[g}3Ȇl)80Kc&rG_ 0@u,oA13}@񹂅'&&&&&&&&÷~FnbbbceU\ :n39u\?q1ًfl?I@?7ȫ?٧cT7?40y1X0Z9+1] k9!=xZF$\Am }y~l@_-%ϜG Ȋ}9DφbZVԂR%{6Ez|Æa=Ap+bĖJ<+XΑݚ7^E׷:lq\bI䃺 i-}/f߆#d*tO σه5R%R~B#3cMv@uU9"Y[ܳ4M n!o٦. ?œɘo-޼>pbWim3c'X2pYa˭hOXk1ͳS5"sdr%>fVvBڦX_7(kcp9`)VF2=zωY[\Y.F>olR̘竐^aJ"?Rh~'~&O|2<\G3V} tY6@ILо6ޣI|CpJOxz>6䧌q>޽œ(.BgK$GŦ @,wcnI;w18P3aWPMJ~on A",E~\vRF]1!r?՟^x/N!Pr̬3lFF֢='l.ۂl646dL<E21_|I7"k,я frm\/3=5"eiĕ棏>:Űwn@-,-`H_,5;󻰡p_9/Omk<~.}[&9c+~u1)!8꬈]bx% "xv`s;k͆ wsPF$i$&:ᬍw ^!boepsCl.뷼mOُ@`T _Qg\pq M$yW9N">ī9MLLLLLLLL6~݇//7x/(MLLL6p,12# dkX|,MK-8cȩ47|՘jF>X:^5}^.'%v3#/7qʏpBF׭uPuij9--Xd|ƆUo,M~x~CoW!`m`2W3 ctaOHClyQm9oߙni^SNXp΢W"uȍV} ÀI%$MylzAP!U륟 OX[XkB0L_jv0نmeM>Hˎq{4-09gs-@]u%Gw?#O{7KRd`DF/Ǔh%r1Ο ab {[yG,zVxI(a 핟Uձ,F8t^Q2Gnar52|rt ,:ŧ_OG ӘNr37d +Q6#5`9lȶ8n6>z7˜rvƛQ~;s>/ SGֳQ_'n8ݺ:j~.?QM.|x.ro} m<]G͑]ǫ+#(sOu(eyܘ-R#.b@^ 9~.)˂,G(;HBYX*Dݾۅ=KϾlڭ@qd7'kcol!C9b77=)M \^8eb5%oR!A[ т98:4h4+J5Vx É xƽ}m2aW{9(25HhKQdJɲetRn)ź(.n$3CѸhj7;F!/ak ~x@8EɠkWP^Go~u E,_q<:n!v&ЏMA#N!e!ihzp 7;FtmuӅ|-mCmyT`r^clXq?b &w=Zb>C"NA9l#}TODX#J#ؘ1Fy͎z6>.\+uyFA(nHV ;9̸l#:R/0'm \m&K?&&&&&&&&&^xXx ѦxǠ9O"~{9t\mP\<8>npo^Ѕu}=qKG6-\懈w%n-q k{K#JaoMZ`tg5Ё+19xL޸m5(2p;3W6$!,kh>[[8~τYkFާf87 y쑣p(o 3TڏF+C֏YK_m4iQ|4!T}1go.mQ\سE]j܀Knb>|%4O'?b9VF;q<L AY;Ru)!{~4\v8mȋ*r񹀿,q[fz }1y.{B2盜qC: K:{@i,ofJQ|[ kOK;X_ƣ""4P7 ^qQA. b8g#b//߁oK#FHqdM}.Y/VgI9>t(s`|5*}8n鉰OňזVas BZX[аБ$&ܼt1V8`̛ZQ2`F1No+9="E#5 $[o]}4K}q{P/PM1\qirlVyO%I9Sj.V7 t:gEet!4y9x cuٹ`O^ ڠחrB7&Sο5r!r i8wpsyb}1 F$[}xYOMLLL=p^ϗ p<x[}(}O3hv5r8kFfa(#f!7ƗD ^'/WP;nc7_z6tP{_bZ-~᣸Ibi5%txkov'bߓ0Z 5s d{a~ou< ly NV 5i@q륇t@){qQ*C=MH-dҀ+H b:BC;/c\XlMpAQh&&&&&&&&&^oDmMMx9Nx.Žpz ty\%fٞu!g7cf1bAlj߇r| ?? UVA&M{ &m.,c\ۏYi[W_Wd[S(5 opp3;^EWdΗx12NeʮgA{Pz>gBd7Pֈڌؾl\ ٸ ~;'lyUxbۄ XR&P*^,ކ?3V:hhpEXJ^}צ\; ׻U߁bO4A@;yA4pts18ޱpx6?)"0VcD>3M HΙL]1r; 3HC6ڎ%R[{s&^O{R\٦,k^_~N [ :aMO?%'O\Oo[!g.#7gpm` -F:uN Qet6-HoԨ,~LƔ%{Ν&eD-oiD?mR/4/UFRqLxk&r `GgD{\JOMqV;mWڒWMν -fK}@jC[{!첞BuX~u(_=E79dEDR/$@L"f=8k3?p'3 91#[)tb.ޝȋ.]KPg(d_ z0'`>k+h;exF}hm^BbsuGiy~PAۥ3|8?۶ѶçmwO3wѧM}XC^66?lܾ;||Byg؛=⼮9;3H j0 !/\HQ]':8Ȥz*cSiy ImCOqj jL'sBv}+ |v|@gĎ@\~g6+0>S5z>Ax*=p4;KP >Xi),o{bmPp4b:6 97x0_9fKS b8neBx]D]ľ*2Z0yyAk#4[a 9.0H3m0O} *J?NG#eƬZ::XhMz j|<``>FܽAm ۓ-#EaqM>Goa @'\U(ܙo˱~5d^@=G炼z1=3"_ϥ=l,՗X6"5t(:,PqAkfk䣷 жv:y@h7J<2EycGNZr{P#. GqwF5qY:h.K,?c0ǩ阮Kptxxē6pζ`˻Sy.o||l< =HM'@h[2/Ã_|~ JCbx!8!0#[C>*, PZ? mUְ34 BSŜ 6zB6mUG={?* LIcŢ1Qݙ  2>F[\M:s'dC4ׄ6l xVo[7D`Q_|u*{[Mju@o٥: e>>pGK€ W]DoBr, h5Z}Dܠ&h^ey'HUT7v8e߇"ES=F `=Xg:Cc=sl[)VEdhob5 8D4 0#y@{ƹ'UR殍ʰypbQ $3f#F#x)J{c|G8D/b[m2R^9G|~8?^_e_vo'&&&^[ǼLt(gK+:$m?vj\TGXm,5bI=|oPTKm/j3\č Z+"![MCQ1c;0y:`\ S|]aX +ws >=W`A%3r>`x0[G@cWcE]Zc(SXԿ@(` w>11111111<yٟ٫6߇{(ıvsM%_q"/ Ƙ *"5Lk Aj#$;#/W{ AkVǢl(uF{ocw>Y >;,&N|@ؼʊz ;]=|xFl.x'2p!8ns q=><1-\gq5|0ۖZ|mE%oz_)ۇ2ԛ&,wv ^9hGmHFLlڞ,nTQm0{|xޭqØ;AdrMʓ(t?2IrwPt=\&0zИIs28{DƋ"LG %o}b*|mqM/Syf$;y |uu2_e]'c݈# /^[NLLLLLLLLLLLLL\<9t. X2#F^8 d;/Z(5uvopDg7"鄟,˟ۚ}1H/4X'c(]x_ć zPZqMns NFȬ[(q] JY]d~6k5<.E ~sY)#}G9*/e "[DTF& "tM\j\0; IS(FD}˼2宽ZD~}ȉEj췰d>p'{pAFd[d~Seb˼e]gibRf 7h5VMOn9!y7L25ȟm'cy%)NLLLLLLLLLLLLL<8 wr#j=p 6u"wvQ;u>ĠLI(sE#&Фҭ(|?+֜%]BE^y kɹ:ֵ9 ]9 Āf bGCI q쭞jhi#/u&m1ЏѵƛOx} sm}B."܂0JN_0eH l1@xzM=: _(xCHY=.B9&vK*`[fT{{!dIҵԎ2 V3x6?٦dx|f$I`\5=`727|Y>ȶCR%K?y<:9VT7 E<_IG,vWԍOiE egJ7vwF]Y<sb܁>9 y)\CDTK, дzBB]^^. z~-%Yeqmd'GZ67/92k&O.ĚHf4u!crl 97_4 |o<#9fٗoϖ "+,sgj4IHFnrK@>I}&0a_qx۳F䬋*bASp@ x"zdѸ@?^1h.ċ1Xm>eazB7 ?^S>Owј-YZ|k 7f@3{9?_ԑ}3`m}xԷ)ebej;ktHsyR^nxO[}+ϐ|#\ɠ5w"އs du _㱬-K>F=Y4.G7=>`pƝo rƔ6ѲۋaH@cAm4W&qGvw 9 6lf M!Hz6b{bG^3cY/q _o;zH;chldY&&zOj0=|&LA-ϼe4O5>c!!5x- נMiA&(GBkg_zFcnE >ZA˂P;}.|U__bF8HZPb\WE4>VF#=/H2<_V)]ĝb/ʭގ@;cۡX|gWO|7su6G5WF>wG)cSr15Bd}LCe{ 85tls rn!ۇ^mn=b)-F_O^ HvBm'8,O|x(d<8Pv8-6+=,O!j;;#Z3\7\ k1(\e[\>ժ6S]=:?pq.+!h YH}v@S 0l-cn7;=Nmʃ~W~pxo^y4/Қ~ ֑Pƛ"y^zשqMF(e;JY?,GV̀kɎFleQn޸GrKm{~ ۏnqM܃:ui@(iGX5 =/ emV YŸ4yD^K{AۄoaE֦f bBb9U'-Y/v1]ġEGoːZ*(:+H=h,5DJI I)PP}S l>-.ڶ|]o|%\җx?N?40o ug͕&FM<^F?ovCM>Y:BiP9K(x(L`uUdFeV>9(^̓i\ļ_.CdP 'KQԀ/oQ{xM#^+#ׂbd@FrT9 [/$ eU bV;y\ID_v`ŀꨛjD}y9_͂ꮍ=ږcv>x -g9~k)N%S|gHLJ'&&&&&&&&&&&&&^c^yk| Fo {(H&3qyʲ݁P'nS@rz4&5v _5sx\9Wbk *ek’#;$K\)C-$TK"ók@lkLZ_ty},0{DFi7۪C &_E6ѝ{oX]\h7R§;xD9ϸOHÆXc2Rx@4>tq]% 2妚m@O7ƪdĈ(zJGȌmLA`O0Ajj TƓ9T,ƨ/oBtU5A J.#7NiZV]| 7D~c m#7{m̌ec5ϛP]xDb8հ]ľ{huX[[c귁= .%_># _Nsd dLڿ>eٶʀ(@i E(DQtuCTy~5ט1&sttu8\Y;Jcɐdmã0<'El<3 =Lו/9EȮß1 D<xk}|G]7]e]+؏ፀsWym5؊k-A O!ĥ=w`*ρ ~";>|v׾N>Ȑ*y{EƓ 3TҠWcC5a)7MBF?5!k=џƚ˞[XۀZĀ4* w nd_'Ƨ*&% 6L4ȳ~BNƖOw2>YrItWi<ö9-4Qy.qdyNaBTo1#¾9QxyaĕiL@Z?{ #~.Eu W6 ^ c)c $2m~= zła~m޴oFi7(X/vk%=0+A}kC{%>5ϰ2xDO^֛*0 Y&?;Rok!En6 f:=7=y?==p2swmbTӕO񭼑ل 4ayo+|\L'zـyɺO 09DcQpBXӜ_KA|K}ge u+ S,:{[#9ARezOKA`cg^  un`c=L;_i Y;ӦoƂKK~XNLLLLLLL)jˁrkblw|b E}fmZyz$s@ChۨM6^]O@6ni [g#spbE GXPv?{E oxi9 W@?=_ w.>w*zksm.w(:o2οÜ?8V@x]+货UXK]PZFâ:pKLVm7 <\u|2\_䘟oKVfSiɣ>tzބ[`''ަ7*׻?d{Eum掱#l)֗!Z?K{@!la5/molVw>a6NːOk-dh[A)ƽ_{Y|!~Jx$Ka$ա[kǟ7v,{ n~ƌ7D .Է1WִpC=?E} d=dK|x]2?C4` ,8iO|qēɘb>`rXl#}x0~#fs{;+|> `cǠ8 zGe#9 T_ ׈@}ς:y.ݒ9f uJA @k[k˿BG|h b+a]02M݀ m{ fK{onTMBqG{Xtx`qHww`W|YwT?b?Ɉ-Sn|C (>,{7@F )5;Ykǯbbxy޹d6|^cd~3aDjVE‚ bWs C.C!s&c)bOG8.Ns 6ָspO7S伾b)ې pZ`'N]#"ChqyPGL[A day@Ob0Nl 4uSB,5ʏ@|ÄAkTk4=l@`ڢ7P͐+aMOmEֲk8Vb0 ꢞU7r+";1&מ@iEMg(ZuCb\x\ }ߓǸPbsɠ頻Z^{zudp̾X¶wY`g\%]DϏ:WsCܮV6-F `&!ZrZ!ʴp}cd%t7d)'Q;ɡb`Y4]LX~lO6IӞRR H9+>E=9t762b+ɺE8 }߰YV¦K; $n mZ$>vWֶޔ8hy yưMa|kw_"dؾ Z["|y*'SnF-:M{OLLLLLLL2 {t&&2f=~7;lz8)cbG]=R$O | gS,3#g|xG?ؗl Ⱦ%¹%r2 FB̈9 'tņ:teы$JzY:56"uATSoo} Y߼4Í"L#@% |M Ty%C6V +a]/K56_S&SHGya$i|)}cM":{S?(OBAkoFf9낸^D^UƀHbGZC+vp'&Ǖ|,US@EwR)MK֐ՁR>.hSTDth p8I[d~].[ش[ ЦdshЉ' HE} EzNje>> 'E-Dƙȱm*sBIc,֨ɢm_cҁROi=KڸpWݒn0Lޗǔ '(E{-%—_+uk} Xb6N6mN@O&#Ismoױq+~]fooA/+ /r ꉉWSm8aΫSpN /ӈ t>n>k]U[ȷ V}Gy ۔Hsȣߗ!1Lm[h/fHF_;&>F9<>C5FUV% 9^9\6n?1 zʣՑA>5?:Y{5ko·5@'p/49| } ?![~Bf f?+8| Mzo\e5X>->Ej"Ӆ)OHFT<?}@q~qb3JO.?R{}.%Blc}& %luIy' "g~;sȎ&umC MAhz%ƣ /Jg~nX!lŌ6%zvF'c8\ tYKmA_)t)c.m x<2a1Ǵ ]u;Jc}s+P8:OYcW0&i[N7Gn,״ɰ/pw#4=u߿X_S\/ tacxO{qDyY#O~f5' /w sݧ@5K8Gw`oXH&#^B΄n}ÏA&X d}|Z^O\EO]>Rg,ھ/N1B1 An;D}NlY\(5 huA}oc@bJXᆇ=i·P!RndtAkmpMmrn/fBxaR31111111&{|Y}ٗEnbyy~~'Z:'&&^~q[='8'sm=}ԋbB XPF*i ǍKΗcXF<-.Zj8Vm(4U?`M3'/i~"A\uiE| y1q4}^.pDBV&t o}$$KhE\ސ nUVnkoR]A˄_օBoE1kL3ngc܃<hEVΝuh(<-zk ?~:/ /|S&`։X.o.,E^Ͼ͹Xkjmim=. 9Gm,QdV9+#Yjݾ5{EX`}p('w6/q]B. Q)̶rvW1md.43SǟbmxB=r:-tCu}F+ոz>)C>%?u^ Sˊ_vFwBFҕ۔}hޖW^iTv?],9G: 0ɐv:Uj;x'~W5$K|7~c&&_5_suEi__X111J'ly͎WqJ92 6Wigux_zInh AK= })~`v71:5FHe|@VT7n+b fEİ\I)/?[Yܵ-MOOa˒(t!d+?.ezoR^zonit?pJMm&c{ڲ}z8ܣ[p'w~4 ooP;zo2旈uGm9!*:1V YTR `^ k'C`T Prڲ2V c78ѣuf @RRwn_LJBo rSd]S Xu }@6=F5+Z9 mH1|SxH !v b_<V(.o Ytňv+셱X[ЀI\|хl)'&_^49 ÖFFje+V2nQDKChB(AƝme4E,tFQE{?xKAG;>o|*I.YV諕Fy!ĐmGkf+C'epRCħ?_=JwwGn &7<'5ʎl6ePNb #X}ZC6X+ M=rLW8{۲ [{\,iwyOWJho+z}s1>eGPc=5Rxw;pxQh+uPU$19"B Azo%b`;Q[<*bEVfO@̨1L[g}9zRno"c2^e0Cf#y>$N(x[%]&h'.Vt`CwFk:ZNNYH*`C\G'sYF).5qxx/W#n|/xp}}wxTـn(׍cMvBE>0,AL(V@O1Cf2 Aʂ2&$)#Y`TG:o )YudZCYg &0]=c$;yE|((6H,f}2x/`#ӾGm@\HiR: ]G;T<9<RT3+f7dtm>=n6lg_(ٖ7SFkR9-y>SalK"/eyoe}pӑ7bƍbmX;17 [o ++Q;w}w.J8JK|39|LJwq}&@kobba@o/ )x6s}2yN VCD+m^7O v?@g{Z'?^92|P9z*D sЃ6En~GchOۛmb"xZIwazrڱ"Rg|& ? P~߅d*7> IEJ(cr_kO 7(m&@P}3$= ?C^ξXq IZ}ts,ŗ?g9Ǥ22C0~DnD[R"p@82;.@>VYWuc oժE<F7!H(œ6h\p S+PQ ʌmmXp#eѶwӂEʗG@Pʩ>׾"˱5l6ZS,gZl'"YEml}PgOlһ>pe̼M^U*I4e Ն04ƍE va .7$[vmU2ATRMA f9'[{}9y̵߫Z5sZg;59nQ_=I`E:ur?y@78ܨN6P x)!7R>?xF }SߜW&[oll7hdk8tӵYtd ^#aȻ}G l\7CWnb*B_OUl!% YN=vSsa |r42g6<|xeExNOĦi@F5̕{TC_ɿ+I\(dk5I-,X` >i?\JY𰀟K~{+u??臨p0Y`g U0}/}nopuzrB:kJj;2XOdgU?zPAO` ':& Mht9tm7?z p[k_m;zJ8!Qdخ'>0[GUudOv{${ `} y^ZGc@Æ7xd<c]2 sz f/ 龁M$]H]̡ܜ@EIJ|_]emR؃ol.پ Jߚo;Fgܑk]k! dxSJ1:[c >' :ҿ|—~$H:u3 ;xϰ3 aRAUJlS6Sb2GDO sGF~7ЃB 0`Ѡdڝs@{Iu@r h c38/HW,zTOug]8н`K?xM2oo75q(E8>Q_=cMJf@DC;u䚐!IrJԫG 1Iݙ)I5m/=.zLSd@qSO𚿗IMw^`蓹x!csIy{|׽<߾^t'c:nLε7R qy{Ta4z̉DU&P}'n^V =g:!CWs&\kLۣwP8:ږcuöUy~ye_/E)/|;c~yy3\܏ٜwsգSuoau.?tW~OmyL)_e?]޻}\JƯ:**~ ڽy`/_&N쁰& o .^Zs}?\_ԡf #V8qQxl9`CÁǂ*x÷Ɓ{y~ɗ|7,xZ>~88ȑOR |>>:S8p(>>)GVUϯ8q|2Ƭˎ?ל=={gR6NB,gatOS>pK܋u:F!zD1v }2kyxr 8-u8e_8'ו߾~dѓN7C1[6=[}^XE#"}u6xszܢ^,=gWkLӡ{!}v)^&(sLvC^ye]_T}_YʓbO\?Ώ޳\k֊k1)F=ZPxǿ}[Ӣ僊3=ʹ]GpʺeO `[8}* [^]p2Uu[xat#´C]N he!)zz#g'/T2|'-s~ʏ\n:wWuȶyB%Ox?`& rn9' LR,l$y|VJjוL#h S<}Vc@wA>9N%ltgM?ґaF*pPרoot# l} }=jb"8,6==QvS'}C[ /~EؔLjoos#_uvu;|#)ћo6j<.gghmIұǨkCeiYGqUZѷE!ם9d~\oSD+ܤ9!}?VnʑAm%z`,chP> P|Cn,PiY|YЯ,_RUpKX wOO/eK ,X`M96\g}{u,Xp[/RG? |Ooލn-Xsmq; جi9L?ƎtZn:ozOúCG>CiU{Xۋkm|9[Eƴ{dZ@Ql ͠8$j:d`ǾA]6r)bé\)h[a'O?p)@u*wڮucd}ᡀ*:︃|lny?{^c4^x}(Ms([Y ctj (rP%5 l@r؈OJm+}J}^C|>PƊB?B_ ZKڿm|aZ=›ϧ/X` zCwlⓟd?q#o=H[lf`1->NӠ l>akdvʻpj g_SqĄr n`(lsx-1n-X0F7k^l8Zs aP_~/ӊT6C_{l$-;XuLL@h:8nԺETA{jTd;C>Dz`5{=6r I<Ѝ_^sDo }ûa}FK{ 9d|J9|}-Wv]<[^6Ȑ[5QqdeAmڂ8 UR s #߅qÅ1'r=ES!NUƼxPVϺHY n~%&ơ sg g`9Bo|@丕υDߜ!he5g =m*޶, +CՑ9Y Oh za 4|hS>S=CgL8;+?o3eoYyOP-,J3ֿ &?o=X& ̳f\W*M(ySpNA_ϾMoSt_epvt=ƀ?3Ema9z6~nnK.b ,X` ^\|J6OT>V,Otvxoxokl{ >o.!uK[^ ^+p|W ll[yv֣[{;@]* 3J |!VCوmkX]9nk\pDʧ.%5_̩Ms,y蓚HPʙ>?"kŶ~^/;W톫F(jJ 0}Th7uufk`ue.\X$<(t0isܤ]j4zgB~\ r\kR"1_L1 5VD]TVar.כrĚ[o֢ϨUQ qAk!*'4xĆXe3]2'[~bS Btm#D F{oѳL;( y{K7 >7htjQ.U~ҦCsB'rm׶d R#@`FW"5Sa*1 LH:kZQGSxwԇgw١JhY;YǴi'!3a= 0 y+AYUhг7z`DuDr_e9γ4:z*\=Ջ֞W ițx^0Б&#«.e^m'ΕCʅ ur8s 9OTt_ F 8 @|@|pٽ` nL1ao>twWxBg7 7(?3se-ia`Lx8 <54\ɿ\0> p>D= @(?sCx ,X%@`x6iG̷`}hoͿY>WU7ys"ڂ >)lH\mU'FokZ+,v[+qh.[X۵/ym&8,xh[/HN`MuA1nL R%q62T$I8h-6(.0qUz!?ȆwjO㔷0':"7 tbOii#Rbqę|{2-a]I_J8-e^jk#Eff:椌W_ʬ?bB< bl`^FX(jZ_%=VNhK/ ]+9 y &Y+BH[E IwAE!jmE '͘ [ njl7g j^ boGj?#&hꕢˍ_Nz>B{t,{ry|ZG&[iɉ+c~}Bln8!>YZ)>*J_*j5d_ /Kr,7a{^CXﴯDҼRn~#δ'iUK#)? SykPYaQhրOF V}0SF*mr57WXŮy󷩯njm/VCX5_I.'Z[52!Бzj]^a]5.m"غ"P A3V0"a+xB/E)-kUgZP6'R[oFlWe]1fCzURk]}DAZ4mbV#YМPMd R@`k_$Q aSQtdhLbv|_y5H!94_)nm1!۝-c ;~W\@%ώٲNDsPQ9v0װ>ЩAB"AWbZeo^P:/u?i3E:&yAnILu'ͰJ2G m7@'i_9)ߜ\BKuMu-L tL̻ٖ^4üΜך)h/j8Ti .lggy|wkp'?y8{~,XR+ o.o?PRVgHN4n;fdpftVZ 5ZݬY6d1߹My{~UP|֟o5f`3H=sH?_"OVLuWf>B "&D.iKwCA_4ewc:9PKAoMWWSK!  c:y`7BX4^ !YML]_GO/㛞*ĪGS{LGNZ6+laCbyKjc6ږ LrÞ=8| D֝tt6<~0c!G0 'BqEl}A1/O}\gY4K*mRzL r_]!q<62j 8]M=G\])wM]_*^%3(ᏖuyR?_:Rű86aEzզ '~Ck/.̭֟&Dy䦔k\齧ZOU!b[ǼNĨO̽\Js Z'W OcӺĆ6r[&9QytpM@5I[wh" ɨ~($O V`WuE(]?*O黏P9š6 ." .9BFDA#*϶MM?x/,a+Z CeYOhYH$y8]YC[UOz }xxCHTԡO6ɗ'ZVJЏͼYHukP9ɚ5 >ޮH8zsN3Ƶﻸ*G˷~HPk=鸔4ـU 8&9q˿a J{WR.+wSV?|S:ˠgY㹥-O6Bmݍ> 0C:)DAR1-o== P`5G_1]3+ZV> Ώㄳy 1t5u3< 70`G5vF6:L!NfE:WY_MnkD=>Ֆotv-ۛ Eڹ1;׶9-Em1O_>uZ>; /h" ,b9p`9Xqz1>MY|4~i |BK>]b qeH9XR+~SV%lѪ\q 0ѼRރ9\W`a]i*>3!}-ï!Nֶ ;cK)^?㗙*Oc3of! Ӛ^ Y.p+ %W̚k%mZ:0ٵA5{ iO'>Mf0}td z%C@k`CɛJF^#65N pV6x.O?[_tG?ڳrɣWL ˯rG}>m}4cfV#]O9y8x^[Hw$wе -y ScNV3)zxOn^.Xi#6:GLsկf;Ɗ4j!bIDATEXbk}٦Y "mJHl@D/nQ;sJT&i ߒtc56L Og8>Ҫlt:/Zn9:.Ow?~W\~rRΟ/B|pנ8%Nնo~הMo-s|zWʻr8\N/FgJ]@; [,3ofViR4h Ԟqy_^|>9A,H[Lqz1yk |!Y^#U4 /H[+i3)Ar {զea98OwMb{efYEQPQ6ڏr]LHܞzpDe ez>?1\þQz1kfz=BO Z-Q5Ԡ<'@*ۓՆ0.} 1/?9 (Qb.̆h(HV2!O_y@3 EIpۅ61#|`˓< ~L^k֪ S/_}}=\ĎJ3{+ Պg?ti-lNbSh8\'+[_[B[ബ,g_{*9ysl5!PgӒX5!l3<h|4/۬4WD QTPH嫠i4P8 9%QwrXǭټ=(g6Fp BMX7.Zʇ17BlD3 q״X ݞi$럵Pl'^Q?FhGݳq'ux85aus>T2^;k ɆP bQZa+ĐtseˡayrHԝM]t]ZF@wXRLG_鬮؍|pyPl;V_ղG0)C<1v#,4>ԃ,|Z5@+3,W!|rI9[Tޣ#uCZEx9+KoA G IrhKG ]ch*'͈`!ywO-2^tgMPBe T|F}t [gW'_ٞ~?k|c?R8V>ukzkUEzA{#0qZ5GkiGѷK"h!a8ME=mJ k[SҗĔ^:]!^i*8D/=ũZԉP󐜍cn# +^LpֽaJ۳d)4m@;z}T?cǃ*Z}:Fn˗5Ǝ>N>q8;;KҐކ؝"xhpܤF<{i4!rcS,8,8||FixI{=0in V)lIs}Qoi ui<^VvR4e}Pi,thky=7w&*VKǥr챲_D}_|V^?b?|Otu9'Tb)jEyӗ_/M_\4u˹»5iHyOxspOʅ9嫘SLs)㶬z9%Ԡ sUnC̛i/5:rț*f3A>`6kvHE}PY+Ay~NS6)XM1ut@Eb5i\\gz<> ؞c\6)o{я*ĢNGrMI +v+K_ J $A IC/q04zT|ЛX j["@օIPn$:|H~KZ7@qwW+]B#fBsKsaMZdy.5?4G1}9/̟t Ei~Տ!p^0HL'dYETKZǎ=tajCyFm~n4TmzTi9e)#voص&΄u)ag- hUQFzTY"=׀Ea)YzUt|O7r%Lүn"%!A ͏X}ߎPBFW_7E 4JU[vkVn=A zЁ16R +;,:*wN7>r|Ûc_>]oիˆ]?Â~8$k'qƀb! ގ<7Йg_նpH>8ҟ{Lԥ{z=_!PB'2!G$IHXGڒbʥAfmRd RidfC|8^ᶎ3B88vrlԂgkS|t[>XGrCoՂvc>p&>*<Բ)P{OفS[O䃕V_cY>\ι<oo8?!: `#G/d"i.Tc^Z+ > D|V bƒَ<ηJBfี=>Rs|;:DOʅֺ ݦͦzͷU{mk\]>fb ਀C y[n)N tsR<o Z MyZQm5!@?_){ĈWrUX~D:I9)7~aywW>-_GW?-ldR>\)k~`7h/r<~QWB|86+{e#6j )'Rްwc<@_d#]?G>%Ř&K ۾gUHPPc1ٛztOD̡թmLO;Iۖ՝<82E%WP,QG2ru%h$Pl5`A5soF yF)yFږ>=>{lyΦ/w/)_}8yw/hhmI7 P8rf#y:\+_uoǿ<,kͫk_-ߞ޷Pݷc?#55cz2i}W:K5y9:pJC!F?z>9/{tYְax@ T+?rleHC?97)y94 JKAEN=mVeRST@Q8,<*4<~("vA<Ȥ4Sՙ#{_m>Ȍ :?r<cÚxlR}ZJeL};'ĢL<3^n_AHeoAotI3sY:D=7*O $!2 Z6|)?o'|_'F+m<~8c}oe'"5S7}ɖqM*R&qG|e,'_7W -:3ݶgZCH7yY+ѽ2cjZίQA%}2~H@0‮I{ꯌiF:}ƌ9?ڜkTe}:3~R'aU%ě{}A?А1 S>l&?WַyOLjO(+G}8?#L[f,/(s{oafr -D7:/ w9`ÈÁǂ;x_CUdLZi~+ {zҙϛ=,x9*|Y:>+s(}^BTh&;沿L֗a޷^o[ܷ:4is(b j}t4tF|L}g~|&-Wn6R1-N=׹b\/i S/ij dH>oe96׉v1RNq\q%P!}g9vFBjY?;lh(V8=-wogG#|[.oxNOI&.7yWܮR5<`g?QsJ%=+s* N&ѷU{&71Wr49yVsbL%C:LK1bU̠D*_HgZ J,b?EY,ΈݞXc<cvק1|OMu4fx+y^z"bBךMQg/M)Tx94idnPk< bERq.pF̯^EbBw@yn΍;uE*CO! (&˺`])A:lr胓Gc5|-Ě۰Np0*l Ӝ֥p&8H_`'?Wz-܁ 2m?Rᡡb۝;3Q]PH[&\[Z1\mKO_3o ,vBcЄO}|C8Ŀ 88Nž٠l>"κ8dڔ {ʉzSĹSF~tM~\8Z-w؟Nkyeң|0D,LuHx>"9WL蠠.q r8nLx# q~8R]S J2I4YN7h<)&(?#="}&}jȦl8}81?Ay/*=kj) "m+ic5Ɯ9uH[LUR1ii=oRADLۻndm+=o_RK ٩i*K@& @h w?O<&QC#2`?MtRwwWMC472~)z֞# ؼ]/YLU5s8c# Oʍ8nzc&1Z{ {Q1veK̾5"{*)T~TݰAopuFpUyot^S<ź*Gޚ, f8 TyAs*I=rvͶ& 3N  y }Yqk1Wx{>Y tCZkM1}-RQx8Q-/ov<`cYѯ6uq`;7ΝrαuPot+3\J9i,rc[ +ɟ/J`eq东9Oj`p<1^9*wVw-J?)Ӌ܊97~Ogb>ʯR8^O++1~_PPCXsircXp<Xp,X`/]2p|uܥ!>s+,[> dZ& e3i.[v*\^5}8}W`O:Zg0ugt/{5?w/b@[ v"_U^G W(f*/P+o-%Z;#cQXlYN29A!C''e f;yr|DCtS>RVw-kю.\ҥ_BӔvcc3ZeWRqPAZrϱFEW7_9ǜOz.SX^v ޢq"oUU]ogH#:j61vu454&#~bWY  džFF곏f TK1]V>(Ә=ىOERz-EU9QCպ٨:Nrl3 ZX:|C~r"5lQY]GE{kS,__o|<&:Ͷ|FmOmO_~lYrswKCP }g_Z˞*Ol9jv'<*I1X cQ_w˅o(CsaH<1~t(l$pl ZJחTp=A PFpI'yװ1jBF%ԅn"!C:@ݬJ -R$}ZHuty+ijr?%U(5Hji0lf2ߘsItbKe?&I?;^Qwwmu8t V?شg՗Yk? Deu I-X5|Kg,y GfUh?uG٬!_wzU>"hQ%9ZS/byVg4GOWPNFeΠۑOvWd5Fkvg,7*4Y|苬;vB| 뇩A' s3E6SlRrhSٱU10O)m̈d1޹לYVn^#QCAq/Yۘ;$qk|:4}Rѫ6$%J58T z&m|AA~ -9_{SdL ,rrc ,xy1p=o2{!gF?@YK{OWT?FY:bѤE*"m̢|ɫAva&Ds7 s5 jrv']I^ePyW!}.?l]ZrăWRE7Qɦz8ӌd j3ѧ+4TG^1k(qOS` ~LAw$P}g,n;i7?~I\YqHrOy5QPe=)OJ onJS!O 6 |R/J ve냘$SfUPl>'c[|Ƥb [[Ɵh9F r$$1$J3G9ӂm+j“9~Lsk]M9B;> WX \.Ql5M0ڮ"T]<6gSFq.vz3֡gcԇE1CY`Oϻ$i~1`_͎*S6cDtYrj0D͌g~ɣ8Vp$p9ncsԈUt~#Jhp I1CyzT1p_-;K=p9=^O++1~_PPCXsxs-8,X0Áǂ ,X+G* ^lh:O +?\d8=U~v  TwI]̣t-2@&˓IrrYQSHq^Azv5 zML{$4 *ҝZjq%ƇGTRCR=e\lU9Uyey䩧\oq\WY1J$hvnˋwlzZHHFa ``t80}pbW1A`ʑRq F]7V;C*cTd!˽ylv%TSX CGPL{㏺|r"l0dD*k-79Mxj1hNZi9/WgrӝG;xS=_T{qPl/4v8Xt#gc5+^xƝyYm/juZ.TrcB?>WwնlDumZZ8D1~-9\Bd ?㠄loc;*P{[3*P%0o}i22AjYPVAcrJ@v5=Z*An kJyMm+a9& :ћԧ&D}Y*_ylq[[~Py햶>z,Bocu'Osɾ%l2fH^k")MjY_'h"Ey@.~J U?׻nB| 5#_y`LsKŭ ~|8Iz*`!b)\ZYy)UW Upٻ\˚ UZc⒃wz=9Emq2"ZvB'N3_#1 .?,j^%hߵ\} s2|1<Zg myN<x$W3Vu>#Ļ~CR$ΟE3GszM0kU 0'8NuOI-~LkҷɜnM{Z}mN}C')(]p¾z$s&:ژd+1~_PP{{׷PFy5Ӣǂ x8X` ^xeWj_|.ϻq/+?*1 fM7%nI%,Po?hٜxOV]ꆉӐ|%=͕u]h y`Wq1 aS{ZNʱ~G'gQ쉘'pVs|suGs@o>=mp W2: ZfՕLP6O]W'^G7'UH*rԎ7t]jÎ+A=Foː vc^YcN?@gΰ))4}5LteMЫ {.*5a4]ELM6iΈu[Ѯ3+"Sn?%d-xZRAG:9=LХ? jzܡ!YTA[RZ(r9k(zsCL!kp>\4/i^$T 􍶱lG_QÃMǀ|q:ͣY|?$'jCz;~J7^k =zk:r͵y䪬utzR穘%96zt3қib2dUL|mMWI)F>d 'p/N I{ZaL}cǃ8Rv*G>9NkpskiSlYԣҦFoɚb}j\q:"K߰m W7o3zˇ9gʹ(<6](F-~z9`ÆÁǂ ,X+Ǘ66hn\*x:\~T?G,Gfst~{ȏ-X!x '{'6=>h4!Tyɡ۷2'Mq;'zԼ0vuVDǕl^Dt96ڵ=hu#T7.V[DNLa &|ac zH6!_7ѦlW$3ilШ.}v\ ,j2m2ySz*ŘdkV Oe{QCCjGЕcĀ/OBP@+?<æot& =6L3H[{1щѱo.lv~Rm e1&I0vu"+eEfz.9n[(*o3/4vJPyL [\v1Xc ]n<`| OSkv]ڃfΓ>'E*ӓFvbxY?Rݑ٪lŷ=?<猶UA=iڢsU}D,r}U6 up7Li@m_7@ɰ@n1|tIz@}|(A8NkgEre^RE˖BExecU&4'4kPmoe8RQ-q?.m'Rko2+J `Qn~ 6iH*\~OA78@!QCud"?Ü#. ! RiݮdeMQI1:f` ђli䪬1;ߢ$)$ ζvϤHSĒW)!H|ifsIwRfczYZ_g5lX ?$p(D7VyΆ UJ=~C8/ȱUfe)xut *3 YئHmO)*y0š}nWg&_a1}[Żho} ]p{s}^H?Ԯ}zx}胈sEmLCI!y5C}|9`CÁǂ ,X+'T |{ }3?4?ܪ&g>g\dFM?sEU(}dD@zy3|6F.D;=5 Y~M#9fmzse|Oc@7ڍr{f7I*mG+m9RR<٣eOf?x vS(~8s9ǺǸuV]4_&ߓCG$r܆Gufsk/B :&ps}'0¯JRYZ@& >"prMcO rI" ~>WV.]d07҇IG9ЫFmn܇Ԋ p1'p>qMm-n5tHMqFT,흪C (:D5mB+H8ăvhnqduA?vy~-O5㝶i,#FF0vo! fD#xٲ;ZA9Yz=Nvk"W?d4x"iI3U=&YY*Kha? F6CLՔFPၜAApv@f)fr=J]U>ߧјG,'DCW'j3Jt/ǛuDllrmA8M@@rLq1 zd[av*N- 4ҩcNձՔua7*EYآʉ#WJ뚗5fXCI0t:UW] YHq l;XZUڂ2>:[$^k1#yC>}^XB"ְn, a}p'z䇎gMrcdgԎBA`jgTח9Qysm x' Zڼ>}= >GD͢QfR dM(| 6,8,8,X`.^8ޮ'qd9{2Аҥn%~grÑ' >Z_Eݾڽ.en dF:0Y4g{qqTO/9r)ek>H-FY1ԧ23mtW:`6׭U\J|)&MAH+xcKe1j~M xUEé27px+8fnZԑ,qDLC~aeup;OD#o;زoB;,jESv|7ƴh軫)sYi 8iǃ0' 67[7AǤ!JfQТ^.+o+$ѪPlENՕs,bp%eR|Hcy)cB *u4J?P+㶨"<00m+CT9va|ʚG+]waL`{HP:M=۶An;^5oiS 9ݗ9'H-r̡8<ف|D0-龐b鈱O:Ȟ&qX~_,XI譼AcS2/ˆ;T6tMRG_O_%3i>W==`O3cI68A>Ls]ޱ!_jaGUum׭%.99T~n:U$i>{"{&4>h&}p$c8 6tJ4q IJÈt$O?w[`g 9*LmDGֲ3k[<^0nVOÍڣ>K884euvLu~Q'w:mp$܎.s ovmD{Oz[胈sq, rʋ--?`CÁǂ ,XCwGTMt:{TʘFɤArPpK qYEMvˌN yz?0^=N{ܪԗ꯴]rSl_>Ib}H}Ay6 z?<ņ_@uљČ +ؚa>N# :mQyD8Pԧ馝϶tGH&>R\)o&"UOgmLqC:E_•(c8փ*\u_$ Y`F) Ėڡъ V[uHIoU@pfi6p/eBv.Ɨ5۞|#8ݤ;LІQ8p50 nn9Hx-#@vKz^n[BLufIq]Fj@ ,!#s$Yl~dhB qgg\gH :~ˀ/?U[O4Dfk3z<ݩph!_fz5tV5rP'؏>uV| }69UԻ! Ek jGkсITUY>D3ӳ=g۾ϛ(P P@1t>1Z$] L4肿5T ; gZqҡ:7j{0 /\ K9_^ E//q` ,X` ^s~Ft`yh7i}jϙh7Jp,h@ȳk|am\eInAUl$~Ç7VGesR8q`>Y.F9rK5.lyí*LIŵ/oqHW_,y8"!䟷W+i{eڡ"A+h_] \*:?>a] >vg԰3MYU.0BOA j΍mŢ_^?Opên8rb"֊Fv6ŐJم`av:th6E㉎:plS:Eoݬ;`߃Q] |`  \RLݍ=dcj#^pp)׷Eܵy]S&c6V=Z+Q{E_~BeO,X` ,x1qO[Ge X | {~0[$;Ddv-D/t*lOER$Z& <}^n!?^hY=? ڸJ8H}O^_Ɨ#!B5*bÆ4q?Mz{2 _OJY~ң8椽9]SU*#ĕ7 1IC ]pl)0I 1b"5]D #IY>eB*CWMc#f\2kGO[ W TIcV80D CÃ(#?%\J cU)'qxГ% /wsuq RIm_\]|2a^k~! H(7w`-/4^m@~r2&$q:Մ2S9hWˎz*$ee]a]/ MOK{U759Bү-c|,AltήQ3EG('b|x kLex=/T]H Ԍt˖DcH"5&D6b.i@~#>*NB@*otFQcIiѬKmZka>_Ȳ}C`?$=_T~m"\u?|G m$z LptTmԴ} k4jUw]eݳN+1d)AuspAWLt'qzfЄChΏ*N|{AXv_ńw٠a`=MSY4D} ]LmNTFsQ]?8@ڹ^PM /_cb~ӣ1^cp7Ghܵy]S&cU—ChJïy|9`Cǂ ,X` |v%bC~.OlRV~?"-hL+`Xn (7s3ʋνeNY#y$މ*+k=6[alZw]Q'w GL7*B0=R^4*1n[ 4:߰-g × iJcv{|Kte!qYcņۑ7LJ12y^=| d==0%]k~~`?8EQ<1ۤh<bYEU 3OP J d#+S並&) Yt|v+Zw#>ʻ((}9B)SNqQ#g_Yiǖ0}Rrg , Th̘1˚.Jy"1AؿQJtzLN%5rމI|g݊C z()"JY6kStV6=om !@֩th'ar.A7}H?yL痧IB' z@ > s\pu5cz:wzKCuF+yl70nȟKD}D]t^ >xHoJ:Rw Feo2O[B+5tbNM6:z<;Q?0W}J[pd;h:Ogs\a=jݺ3<%o{h[}9-밷|'uKVo#h(q9`Çǂ ,X`{p7HF{HvE_D|5e*&5 iA>cI!i >l>IO-Mz4m:Ggdo{}J7< ^T647tfGi ~B K,qxWʿ-Uw0r]}N YTugμ):w6z䑲T^{uA"*3;aۍnfK]se<7fc`= \{r5 u/4U^9R0;$)kd\3~16U Y52,P61~nW'ĸR ֣R񝰩)Kjpg)?W-rrE2$+{mhI7T(ڄK9DgľVθ':\AsCm c3ۋ#v-sa-?*'-3u̍1դ<ҋB*)fPhΟ9H9휊1@b6!qO放;lonXuht6>x Xg,DsHSr2U1ٔ#N]YdWTR~@fmCK>W_ nˇ^p,Xa9` ,Xńp{'y_M> zsD À*6V{{NoqƜv[=6aF ʒ|Ħ$e lRe/H TM) 8! \}G`cNubLaZ.D'힭.>uf ڷ?U̿a=@Gd'DmS$_ߖ)sH&E(uMUGg$6bJ9n>b* *Cn=n\zVT_ͦ)"a%4u-H0cL:ݗv>+yԏ m2̮`S9A<%>RvF5?7gb&I;θ~pUo׼!S) ew]*gUdu2cnt#7i61GIe[DtJ6H~Ǣx3MD=+y!9>ZGO%x%ON5$A =i e>}:#xx0J5e>猟ӻ{/}czltJ]Ǿ_#n WHх.ni:Ʊbʣmcj rM=YjWK -4/3LyX'p9F STY7ՖyNO#<2ݦJ`/4#͡A[+b qTee-DsMEO_ =y嶑c1+*~d Ͻ{؊t:or+=1q<~x̗a@6!Y79bs0-?|dz=,z{=mG-fdig:}Ejg6{!y5ތU c9pFb9` A?+pϟ(e[aahjA9֗U͇)YLR? 9a3Aظ7KaD4RF4kVGމDEb򪜕-ケr-;rߴg ^'˗Mj.|YoH?<7ג#曶xfyn)')vb?=/p*g gݫ # 0`CP7,zC~{ǬY]ͣ^3tirtSWH{X|Wmo}.^ !W+q=j6Bl\'qISYʉ> h;E4;zT7dO=Qki蛫Ʒ8sK[Gnrj4Ǖ,K{9-'(|~xƎY_iiɳvGOX/+~rF48Ww4VJ 7?z k4)@$UONEF0+7LCŴV=U5 *dTF<1d%G*^ c`keE15).s$uVxи Gs'8ԃJJZc2_cL^˫~z, 4mio>Úy ѩuk. Ao(dO'ʹipҧ9l*](tDW 5+Rf?*Sv ٺn)CGӘզJ¸Qn[omm6l+d,D'zJO|_Gv02mԾZZuU5]R]zCO}Gv:7ziOɴC8R5\w/ /=o:Ʈf[EWi B,8O ,X`/kO5@;@_蓧>e}2}f\?xü$[ OdyHǽ ?+LE|awI}Plc3vy*('[67a>mE'MtcPY*m3V#zuU}گeoyuy|^Ur)e}Qʧ˳m\V8]>srVu$''LCEg^9Ymy|ry~_b򘱩xT#̋O ݬ1lC8j50\+?UK7j+] oi!1Cd suۊ,3Y;@-kxf|nnAAn^ %k;JUc 2=/:m'8WYMFmAy[:X%fH_=Ak@GX$͔•fʠ y-z:C D"WI 851~MAc6K? G'Ņ8hw+QzO줄"r־"|c4gvpm?g4zD=ۘ!}OvdS/V_n֞6HY9ժ[p,X`~`9` 삧po5w?';ȷ8=xӿOT.>m>/'\ylUO8m+}OOZqB@%-F G/bZ>3 G!veDǻnX3TTDOK۞|aNt:.E}Ȧ W=.w6[oh[7΍s On΂kS- .ǯG\*Ah^JO-!ZJrv j;?B<ܸiZwQ{G'DalL+-ڶ8%F`{W7! 4+?h +"= 9fT{ȣzzTmcFq?De'/4_I~dYG˱'q107p1mɲ;B;XV+ፍ2?r@i޹/li~-_Eo,oܽ+5>D]'ч]--#\Hzz_6~ͯysy<_l//Tzި<)w&CtE˨ךSE ЇόRrR5>92Ō.\SiQ(zDVm6w%_išٙO3"Y;xYmOaE_UnZHݪA<GD\h_B6.fAuKu)t#^H=]hQ~34'\47z/=:yX/xgyӮ,eR/˲NF5:k~HQ 4W%zda5F~tSZ7}^~68~jy,g,Wm.Qy͓gw,KyjuQ ]Sc.aC5ݕj҄&oԌTlH{mG6:o1OpAdyƑR|El Cee`jM%)fSƷW57 >RtI_PY=7;?LdP:>fŋ&R _E⠄ƨ}v4^8Yke 8Jm.r=,_' Gƕl'fGNʉ9 t:.R|*[ˏGO5#' <*OG]^Z)??|ҩb%׸ OUWw/)|Gyӫ3TY+ u8<(~ >L9+߅+s4Cv-t#{ 4Zr̢Go,!PBX.X^EkFPV~ЎB<: 0ݥvFm|%5,0smWsxAr5} ^ gucO~P&KHu#08DP/SH `?W3B>rT`]hɟ["XsO4}lYu(lؤ.ݡea&L*hp%#uJ} ҁ_X6t!_xEB ~iz$^߉ֵ ǟ-??QYZ_I-lWA7+]|Od,׵Ozca1]!pb"zjô!ٜۤCId;Hh}t g}8˃FLh5f|Nvy^ 7eis+0"t(2&gD(' )[ښS[^ =ț ({5_;QWq7z=V\T誄 #c{ ьYY6;=so(rfz)cEN:?JVM״r50/9&gN h 3:tօGoJEu25ӹ(Xx[>rc zhNogox㷗GO{Va,8,X`yGz|_*=x[#['lC8%|2xnPo32i±ЈqPV ]3?G2&nkbECu$C%fЉMxF]Og#et7'1g\eiS_ q͗A_IwcԜbo<օ0ԥO65vI7)6`˖Ml<8Vl_r-}|orIygJ9S6cS5x҆fh#+L<%rO_l˳jgԮstU݈vηE&~Jh%m[~θV?b.f4Kl:0 6a@dU'Pz0jSAcbdl)ODL&B m@9Xшm*m8ыMS!OM;%g~{;/i[\*3ꪻ \և<,`!U9<{*'_mɪ}B_؈M=<?R/\ؿO/ySͻO囦[-[斖 '漄ʼn]$~M^R9\_d'|8xJsTp}kvp@@zLՀ}4X#Dc6[9(C ~r* gꤐEIHeJ@8H&J5mgIzѮ鮌 0S28GFtҿH}px=wTϡ0""Iܵa,p-Ƣޙ)~7't8ofF坃A|LAPN(0uhz:u6G:\:\5)>״sBo}5/uRT6~7iKώklISz}A&9g}xHXJ BEjoŌCeyCXOv25n&# 2,8<ȡ/~m_z+Jc9` 8'S8'P~;w|>e>٣/}Qopm\N7JMYPF: xrc=|˅\@}>fQ~Aeu>T{SPķ]ý:݋  L M## ɺG?6>D3>̶P ԔU佘9zmѷ,mNMC6f8V'W_Rto]O}PV\gO'MѥlFs7Gi "I:AUC3H#J~ɏ}M_͏e3t\'Wm ܃ sl㜿Ym }t3<:RkđnۥcmgYNT~&wώ㏬ʓzixZ?jzL_U.˛nWNyؓhvqAq~}/O]-W`'.ʱC:fGy"e-_Pd)gk֕Myfs\>~BMkQREWYlT$Qv.ԅ'PG[Ui k+X!'a.Hk]x~R!z pL&4R'v(2zjv LU:k$\\]autzVs~Ovgf @DHigJ#k'cUF\VyW'<-}I>O:uyT=n[%r6$!SAm[*^ z4dK5w|+T?7~beGx[BvE6~9~rNx1*p,D;U~_mLeKf2m#rb:Ukx=&S٪@TS :V^r̤yÔ. =Rz̔Kj'ۣS{R/3km,ױr#:yU{Ѫ_Xzqh@/$7UِM}3^ڻV6m52DiS[DeQB&v'0O\ !~c d6T&u@vR0LN9yШ3M]"5*33ӻі* otn9WzbMSw ߟr=iQep㏳Q{\*#ϯfPH]$j=|uQ-dݽٹ )'?5_]Π9oT3汹Mz/ՙ^DXW_j@ ߸/J!kΚ օLqO8Ӊ}miW '7\FH7e'fxRwS^q>m_uyϯѸpsjlK;A%FYA~il$Äz I;6f*C0/&tc,o Tt0m?"`P>YpFJNm{y qf-+挩bf%9}~qTN89/ wKy˫ʛ^TyR|g7G%G__.,<t.7MvldE3ȇto,Cy>Җ/<{Tӟ`ro#-6G[_H귭@۰+i^oZe'ZWg'Z2QjlƇ %c>K ⾱@$ Oq 픶C`9&p=Űg5m6\>9aR@<J"2˘ȵcշi9Ӄr#N/3N@Q3dĢ-]U6uuFwҫ}cSh]h339ل7..KvG1A->s: \8^oޘC||\tCO[ y@"2C諼ҨXUeF|p TS4 R\K@Ֆ-F}ٔꪼR~w}6Ф{\R܉؎!{Fׇ Cl["*uf f,;AV&F<}XF`t9ə ?A-b^(,+xN= ?[=^7DsEey䪜^Z:}GuR6BPF!6 4֘(@WAdS'ɺ​Uz%K ^=>`e,!r[g]6$B'hml9@zEGo~¾)/ӵ=B~Зr1&75s58d"-p#rh'ל~y7=]+_cd <-%zp5J}\ݻ8jNQBN4d]ad.mUen#`KpKի5R7}1cedukqz9kFY72q!mFuT6t4=#}Y}eS}9u9D6] Ku::zLDV,dE`ԁ$NߏtόO7tw#oFdۭ 0eASc#;9 -V#٦7x&Q˒!}bVLښ)#mezo?/+, 2neOO9qڧдql rWfMʄYD25BeCܭ crpZt]6h&k ݦg9)6ԓc!O׿f|ǂnsh۾*—_~g8oS~{RKv9o/7WIn*[o'Wџ[+ۀ7܅]`g ~|7;,~Kw|VF鞨6GS,p[RNp8|p劍}¥\iS\?1J1<9Jtʓ=b99(A]u C{ʦtzޕ,K۩-hL Xg*&q'7Dwpoŀ4F˔Q SKjvV)e}%k+^ɶѫHg/O^lw?]~zsst9dsVz!}!E~EJ}i0qD j";0#z)Bftb<_#LGﱭ=W)I0j')-V  1LEv&φ6߀w)~REquqYlS>]7=]ʳR'_[(Qx^)eͦ\mX#\].--wVז?T^Ȣ>?)|5\~'ٲR^rz8)_E_x)05Z6\If@cEH˲C zBy2B_(xLV*!]n%wA BG>:mh>P 2#D%ȓ&9jDR:^SXG-H>q.sWE~?GxgeV}:D 88fxack^U}}?|Rǥ0iobS&0WWه( ?{jsrP `~'\:@'r'ٞaR]GHKԒދV_i=hB>6V"5pcU~lJztF*(OyʓIO^A/4{ .8U+9SvFY. /DlIUKR!]Q(ibJ)ؿ}ظ<*AihF&$TA߀x3/Z!bգVC~׫լ8@# ZcOP_rS))&CW#=w)S|qTN#5OXxG ~ j41?U)̋v5pJ؝ 8b)&c;OJ+s;tQG„+8oγ(h{dk\;l<Z?ڏw[2 _aS><U&h&|P@i'u{~}Y>ܧ4˾fu=Mui:=);=ӼlWG=8.SЉn&Zzk kO\+5 }^mfh^j1_kaJ:̉XWz8Zku.Ǘ۲Zocɯ7M<'GZUXYuV҃JcZ9${&;W˔SdJJa$@h=yTzW]twiRQqR^W; ?+(ܽ:=WCA}p6㐋Nm‰ʏOP 4j>JyteTyʈY5$bV/5l6[+iҡ /t!4+{3(+zcW ke?#X(O』CZ>GmPmfW>RoghcQQܻwa0.*@GjIEP0^EcĝutAli9&7Yb 0o {Aٞ0tɎ.$0ϙ!vЫluNJz҇];0w S\[ONw0zSmwLv^]&/ZMNi$|ŦeyFCÏm'p,XayÁzڻ+)o|ӿ3)xx[7:OSO>_>@N5r ,/~_yx#qScDt<4fFOtOÿS L'T^& o;N<˛7RMdt>&;g^Gq BWPei=@_OyO%=FʨX6 Uc[bJr%o::{~HnmmD%"ɖbZxG_+rGo?<c?7*?ޗK@9{\)?>+#[Xfm&<9S;oq*b/~<_+_:rxΗ5N̳% וl?Myx*1'w׮ądGr {h Mk1ug\ї 2_ܔtT=̅vUow2xǡvZOP^!jR,5:⾢dɛC!e<(KiTˡM-B@>G2>[Lz)S40KD/ 7Y3٠ѩGH !3<+`YǼvsLPcx&TY 0scU^4N86e$̎ z2:%ȆybPD?|e4O9O+OrJ^pȯf_b"0s$(H۫}](MמU/ 1N_)Ggwp@0^Ϡ$& ~Vk3l)c/1bjA8[mPq"@EZ>zgIy!]:ΩCAF'ȊvJ<>k|\yzx6!UfXeʱU B&ˎAsmh'kkh`x,(;l͚qډܨ [C\ucوCM292y ,g{'jEP_ | ޲2b`kaiSCN,/rSDB@)'Y8u㤮U{kZe=' ,WG-+}ԛ> "vDw {JIAm)V19V8/:}I~ շqvmyo#ّR< ~C>LUI<ĥ~E^ɣ<!킜(l;|ꇐSJ)03f̘7`x?{QϴyRǪ?^H?%q,3k]6j˓z$GQ-ofT?흟(g7Weĸ\,Eg;۪vP} 7{]ƃ*Z~bwŖl!|لd /ycƌ+7-D52捸#虗Jy5lۼq=/xGeD.v,xPW\u#m¢_纈zƋ-Zr]TYBƛL|/DbB_j]n%'h;n'*iR嵉ś6VVIgqhO7.z[L]hKLOxMuEOs3N(xt67+_VqT1 "W6W)O"$ql@'~RK0T 甍IϴIuQI h{ĉ<*Y.xRBtD=kː򒋲A(dЮ 2"G-R`ħ6k(HCfE]?fB~<~̙<—ѣ|a0HmmKPcXi7s|1l#1ƕ)҆?hk7d\?n&Vv_\uDUe6) z-|Q1^#\BhǾx=?ŏci NSh|ƌ3fpcy|=Un۞('?R9sW=wr3?Qr_}?U>w}6@?Z>WLy߷}S0EPnvw?Ql?zGgiƔq?#_,?U,Ϋο , @|lBkNM#0+9mjK~Z6r5 x 8E䀷:Haz/>+)&OyEIWsD6ʈ8# j(q30]&H+2DwX(v)YXh}΋LYfˣTOVh@(2X_}$FIe4L ʤ\*9"˪'> ؞ =B @W+ѳ3|#{ghy"5υXG["AB. E̫yBmTyrγL?A,L)+2xmŔORR- 2z:wX"vxNꚶy~El1hsq\B-BS YV.V|aAWHy-g|sa^;m.Mx|6Ps1_ 㞍 5k4i 𭾀 +1> )a?ˈs'6\;QCPI'Y 3Gll8ïO4eb2#EZg#'6DEۻf0G`NN욢T)2(Bto&vHql~qDZg\0dEr#h'x[{F"I5A:C.Rٔl*Eu2adNt9 EjD^8 mdy*MJYfʺQ%3 ʗ$RY<С $ic3Voc{[U ??Z~,O?[>OkO첯"J`B[!/>{_'|sؑO|&}Dò}us^HQ؋T}cFKaˈzZ,~\a7z{J;*ON OL ж ,8x^#I;-¹)319 >\v2Ppbq%Aw~8?0Y+`#~mMQȴdM;Zܒ^F~z2eSuKMSvGuFB|`dc| eY.ʍRN@*#P8/J-L#rTVyh|8+Y99~v1G(-Bg୹[<- <;aA:3C/qUB@S *'r;{/ʒ.Ϙ_Y?_0]ᘠac3}? Aqş| S9HAw#+:|Z x8W|:@qGX5+ȹ,f)VfB,M/S+1Уҕ3' A#ZmEȴp^Th+riI21tpB:.⻋CzK^{vѾ}cEO̘1cƌ7=~;>g|-cܯy(w{~o+7n?51◼X/_~Z3{ٗ_u>iM'߉{;bvǎͅVg{x%mf.?l[]yG~ʏ1ag9cƌC&ul޸ l>22~xG)}>Q>SNQ`i6|y2*naݗr3+872A] p!|mѼuflE\UR( .#9+*P5&N#POh\ȗ&*6U m\6.୹ 7T|G[(p,t<=Sd-m%H6aS'T7 o_=id."EY"Eg!zvբ_9&j`& =)fj!!ufW"{JWy콾)Γؿ^""S)zB 9%)g'jc 'cen޸8:yt;輜{E:ISMtNyA y6mק1Z iDk屙%g 9h^E9;uƹ УT0ź.Omr~ =: -%{Ay?"[ pa\8;p^k湹yLwo-V\Gj>0s<}$inubxY Z5(J΅|KҰI w}ptm8R^sb3H&# xGdBR+ZynX$>HcDmeRԑz;Z$ zKغI%'ŚhU2 J+/ZԑPկWy~ǿpTqDSv~6H-LjmUzu2m~l%Ho kݞ'-+Tg=k0t |["Lô O/ +qm"U:rA6⹐}v]MV2xNǩA񌜗 ̵l4ա |"6\q ?<MFn6v[H#D6<Oz@W&P䕃 b}'VTO[*#_~NQY&]lCY! |1A{qmIPSKpV0vRBR0ş1cƌoJ|)l4Q_}Ii{ww:/KxUE.O]>[cV!1iMw<`Z E;cI1>KV'|o0G|f̘q8ܼaoZx9qu߉w#a/l~ҦSwtǼSۿTG."iب~} sknUs6Q2`^)#l|Л#{v'ccFҒn"azAySvB`AU/}lӓ y-3$ U1{KT0jAaLcaOD{ "gMc&Z4eQhk!>CD&eKp<3_<(@'K#rogCLmMW@ 4rq2mEɸ #SGiשR;E Q鮡,cqPv#l>vMm5Pk݈gƌ3f'sW7|_Vox~7} _m\#tE40<"_P]**`VKlӿЯS5/*N|w#n ow*+(iW7񲭮/B>ҽI핟.?3fL5~KPk#=%b?b*Ǥ|{v_O/0/qO hn_(7B5S>;*`||ͧ2f]v7Y|?WQkƤ٠N]y-kuuj䋼|#Kم`զ"ǫ.P{_k^˫WӨ:/(dB&(Gjs$GW moF՗ΰ6t 'w@7CTt9H^viQy&hC)!2VŅAԱe_dwIN7xǾqJ=[z5s*< R)DĕYYNqZQ񲬎WeZPefAX $Oe歞 p4v9+w.ʧ+iyW)%ڡ?>;i7lel&클MکZ#.x'UY1n0QdÌyot G|X tϲ'$B$f V?ldeh_H?7u ֱ@-SA:N4(bHT_'?n"g'=[C=0~X搓Ycn? Re.zrƯ>f3|=lf |SAV69QO<c27pj WyDĢ#T.:F5M#Q5d6d_YjGщM d1IuAv()iϵ8^gGմ˻JQrȾ2| 8waB6AYuxYAmk]D1el{ya;զ&M?ڙ|4#uE9:S pe\ Ge6vNEY^}3Ԙ2ڶcz dgsi5@T?Eأ)ng#ɠFz ԙa>z j8韄DUiHMҿ6GvEcڕ۲F-:aHq51cƕw)>Z~`ެoB_:`yo~,SX8pGؼԉAwH./G6?Gp ދn,k|Zͅ3{(^e҉6}5-/>B֪%h SI|-I~z"k<_F|Oŷ rglKmS)vȊȇ?k_WM`߉XQs'y 8Z{2kF٢ʊ1#ONjdY7Ov݅.p bjfs6"G\ ֌.HA w;9 SM%}t-B"R>im?w@  GP+(Ϙ= \-w8E[n wn$5S,AL)҆BgR$G{S̫g8SֱoPG@;ͳFl S'EgwM;"^ypOማneqq qV?or8O1l 8$KcT;(;9JOYc8F*?4nPFQvh8i< Sqc)$Q12 9s9:AP@E<s :Q@vcD"h^.&zixW+O8_Ύ; e{ x8~9Oa}B>-?ES*>%U8_us<{n(8W1qc$yKff6tkpT1#u6+NAYo3k _?cPMiPF'ߩGG^PK55H{0{#[jތBNId,@1 y<3AҐHeTblL#d^g=| aŎ_dRv!oeUh0 ܺ;HE[}MN^<ކI6ؕ59781V{LfXq;ꐆ͈ak8 0e/6ͮm-.Y j8^s\;C{;A/ K7<|\|Oo?3fs[xs{ok K|ƿ۟,[~򯗿KK/ˌxא*Uo_˻Zg̘1ck|ʻ>JY(eyM" ,}߉2~ ֣ ueKL;"z9W*SaT0N~6Z/}o.\aGS}0/r\&z/o{ҫr ͍ Z7fs>@`H V&,"2Ty8X&h b *ssxH/&T,@qre8 9x(OKn X-(hg2hi \b^>7+7p'ǎZ2hX~Ķy0-փseF}cq[cMd}~f_?z&rd7WL:̠_G_-F84XbUe;>=wy!kwa`Q8foK%57>c5m 6ɈSGۗR8Ҹe67i# ?y16E>++?3_.U_@85fUbi@2@Ts@OzO :>Үʸ#Z3ic8WՐa'pⱬv2uODfC:?yl9%|T>ˎu^'ZB ݅g8փަ>JbuN"urm3UKn`> IQN"9$zջ5ҳrgyQ^YG_}Q~+_+\X4 zTCp/ JYhSxVƅ܌x\.@E}ѽĶB9K&]6DlIE^gspcB_<ۺV5YFbG ;q ΙT m6SCY%,TъvMXh\'<6t`q\Uv[{]DĮxIU??J'2m0VzدjMzޟ1dІ>C<? &YAqxB'SoDfт6Ho.E F9e[3i#%pݐq\Zqx\;W[y#94m:S}² d;g̘1c[oGnFgby{/}/7oG=Z0OJ󱈱L^puF,@Im48\/SfBp#} yVGh FD,[*œC"$ مC` vG1F ٣mP]d|_ 7Icm͘uQHԠ8.Qdꌮ:Hc ¬yyџBvBv'h &gzKB6Ȅk}{T pQ 9yD>hZ&AGz{xp`B&\!ꁆ kxSlfzH`x"'m׈c~H;miw3f̘1O/?w*O~.~#|[~2vqwrSOQ5FSf̘1cN+4۞;}8ߑO~g9Z9el!77nc]kڀqr\\ 3#m/nVe֙m>cՓ~mHRB&m.0g3H{VE7ƤNI5n7&vz'voAq[rw~phAϘw||`7N Xys%XO5->UEQzKXG‡Î8#bu>Z_G}Pvu@5㍅v\'8~↋s;A1,u!7;lwԈL/q)PGq!bIPMR:cƌ3f4j;q|oOC#Oy(77DW/`ƌ3f̘1#kCĶ2rƅR]rY1 ZUV׫*Xf ">]ݱc]@,gy+|()hh;n[ˣ_GkE>Yw~q7[P;mRO&̓FzB=Ww0BhtP Cd @޹.P6Pcdkd2~cRryB"K!-yJx&lڲIOmpC/a@@øn8?ih'v 9 c"t3zr6dzКcl㌭&Քc2.H1q,X=u$ _AE{Fp6v[^{8_0lsgKSP[( yFW@?wMtޘx/e:u ?kcw>FюE@J5f Y: m2Dzs+#vp>oX'hgˢOFV+F@٦ nyި ͂k8q\ǹ3cƌ3fp__K'~Q_yQ3f̘1c6𫪑_8 ޵];h[).S ; X_141xl]d~Fr^$4l$ 8Q0z-*oG~vlC#] khv[s\YӺ6?;&N4R[ :S$l'c{9cg_X,r&X,5pPAJߎ-9Z[ ts~رRxga )D$\b0jћ{lT1pѝ9}T2O\y9$$i,m>KmqÌ-W@7q2ϣk:ga;ϩc^S#`+/3#|6p؈erIͮrH'"}vYı!Yc( ^AX>;}(x'0a^PO$6D*F'(a#f&cr~<-LA 1U$= I듰s}V?r[{CtwIQuru}pn|it8UwbrGֈt6j#Fkw(}F_ǜm.1&~m>nt+3K+_~7cƌ3fl>Ws'c?)f3f̘1cƌ~_l>| @N Yo3@I>h$Q]ܞة ү49ktQo461ƒqPRιWϼw ٍxt/XB0/݅@~Ϗ1>mR`g܂zѓySzyS%EWBlxPpC;Aa}yK/AVX󠣍 kn ZemB 93OBK`xZ?-"\zmE#T7}o[&3P!6I 6oh"dY(s_o#qaQi%a.a{(zme{K؂FeSk?|EIʏ'f;f,9? :Il0G(geF`mk~ٲMidԿ8d#CqB_jv=l6[ƶ [K# /lj$;qhܽkhr܅=Eˌkǥ8C1%;',%̊Of(dc,YP_|)ﴱqLt e=[v ω3R9uLhK2=4Jg/U.pR~kmұ1PD-R C7;\6VnrE[=d@c';o=" [#_ hSTa6MՍ퍀I;f*G|*m"փ8t7cƌ3ޜx7.͘1cƌ3^Ox~FǢY ~+To< g]|{.d{@k3@n-m4-}ݹC,nzeWi"\S$Kdz˔A]X7?W c<)kD^ qT>[i)8xC=q-Z넺Y/=-Q4`< 456׌$@sc`|}i婁zP<*C& >zǞos sY ~woC֩z68ec$T;qu좻o(A 00[㍙\G>Zz6P=]HmVcuڂ*")4cƌ3ޜߴ1cƌ3ިg3?ߔ߉M3W%?hM^+>뭸 WA_ZF(hT=\d>+{uο4ڪ)e ٬}eA=yݝ8]1sr%(6i!]`{:%1:flu 9h]/L qZ.e|hŀg Q?|#hNhwTV1ETR.(F.:flCj 17}b(rN1Y>B< @Z@]'Y6~hP\)b YV9p=Ϸ͘Ey5^珐xoCیٟѥF1WxIqHY.1.%"9-v,ghqnSړ!Ie}dB7B{m9/ޢoF6tb>yf?r r0߈|tW8w@u]}A[>TMe:kxt=7MCd9;V[[QsfOAɁPށh#ڇDh% n^}A{SD_r*oƌ3f)׽oT]F3f̘15?f~F9|*}|F^]_ȸuK:}–p"(_ q #Q6a_؊TކDݶ׶A @^&=% KdŅ~eD(k~2ό#mnMĘiԣit#7D17ZI+Ȱˌ<?c@{1C#!LRUP!@懭!UbmL6f6d;!xG;| )!oyzpR~j Kя=uoad~2riLȗŕdhB#Ņ\OD U5&QxM;VAu\ &d $T.hH{(6*\iw.l% PfOܑ]WR^RyY%ڝ߁E|,+")T,|;İ1|.7:P*4&>?BYw15&فS{ScԱ9਼gtx-{:xYɞ:?<'IYONn?S(K@ChG;p IvGY]%Xh]Ǵ'WȴnOܶ[fN[n.ڨ wT1S3|%diT,/G?ЃTmnWu+m&\ eS#g_vSzDf̘s=3f̘1cƌ3_z+zϕ:)_n|"vUǯ,u!cϞ˺vwcTىS% ʎv GYot}$de0NYՓ2?k,- k>~/xhl_h3(Vٲ|o2.|I93uyۃg~וo]w~syκ?缮rCcF呐gY5VK ʄȢ!_GtݎX4rY/neRlTX5j9}:`^ett A#d0nR,pq3kx`d˙%oe{nO2ßAXpcT=Ec rg2g$av ǰP,LYc~VOz ח<=|W\ ~W׽w۟+?ny_;Ѡ{@O V!7ټ[-5APo\gA0^_e[,}y JL@^~܇`SU7*9^m6l%h1eYT*Z4٠OXd4oѻŘ^c_xnƌ3f̘1cƌ3fx-|=iTwkǾOuL"tEwD^ Jx!6k S7Q>`JBrM5C/mD_θ^1~ق ^?v-q$@:%dTc̀Qo)A01pcl DD n Nl؆<@n|sc %Q; ?ˀҬC!HV&ȋXnȪ}M -xx NÄ(M`eR}efk~ mcfJ|yCVa:tE#Ҕ֗cqE*sZ3#'qou>p(h7&*ꂘ|:uqN=Xp,MTⱱ1C]U4&h'_psOP`6t0a-udr#^1|.Ϙ._Az =P퟈>1cƌ3f̘1cƌ3&|/͡Оh9mwS-# _75ЉMU1u-*F_K[@^M!-H], HWB7:ڱ -|wS6zcx"~96xC$BlL}T:Y !j6->2}R.c5D*<@ģO&u8(0O]0lS=FW1syV ;M1""&s|DY, ȋ>&DShGd}Җݑ͞lh8@dRCOvAV5#>,H6CdE2>zYggkfqGށ3EqLqЪ,VIu.)?z!ö`Đ[C+)d߄=q =.{l~Va\͘1cƌ3f̘1cƌ76x|C;>wU|[7lQkhS5oPF[LmVcy6!GN"2yA}9xW5\θ,p Y]uͥXPmu0:Bk,%t\xhE$>VMkHX0:& G\6NM yPmq!*}s y7> V4V+nRY똳;@D:=ւ |QN8miL '=iwFٙ= &WC*g#%`F5r+JP24M DhfY90{W_H@S-sKJ:o VxW;~ FJ Ћˇqj HyJ{*(D\1Nd'y[U߷ccKcAT|Q RS ?Ǒ=~<a%Al4s&Nx{: Ϧԁvh wPQ#1RfZIDATC56lvealxc]/>”4 OD+m$0}Ir)ψ 9z lo$S-2b4^Npa Y[BQ/ +GwD85%.ɱ%)D_Ƀ5 5\iqIcy?h aUFh/ CZTtP"Q)7ƔZV?XDx9WS%?+aGlmxc`L7TH#D>bJl ԇ8IP#B| ocg&s zy a(3dH̓r\ԣ㹉22W$ o OketRLW%9_XW(c3YCƱ_63,O {юr :.Gf;NLrзf͞2\wr/{" 0<}_؇NV1b8r+&VJ/ڃXR;g @;Xj9ƊLp9+ "%18%։3SPH:q.`dGʏ%Ԭ~ G֭]?%Pr!yTc1=e,>W*<6vv#vӊzRMQR 91e'q~I֬fiH"f)2:^3n&$xMQc SL83#9ڇ;߅3=q 8_x>z h˯  =5z~ySSc8t۷"$d&ڡ7z+"D;O S.=t8hs!gg|ƿu!#9ou 1MyldIVSFr3f̘1cƌ3f̘1cߎ[y[^ ~.;΃8ڐ|Qx!i]hlz}C73Oט2:^  ڣ|\AQ>F$Zj1ϐͅ6LysVjOPn zm %2Pxyi-ݖhPvsKK\!:#Ϗε<( n\8^. N&ޭb:*˅m:eB!O}+Stt.g:89&JĐx@֡'<ʍ5lǣLFq 2U!,ow ]Sɏ{sZz\uÇ6 {_cn@V8X:D̃qHDN>[=,s G!3841ۮxԆ)څK{<GvO='I;mdy8 lO|űk1_<&X$TA4=؋qti(4͘1cƌ7+3{3/O>3 Ug˓?S3?Y0^'{'/ᨐI3f̘>3"}@}ngL6_9۾ꫬ@9ɂ3+!l} }ƞQőq>ƒ4cWGqlpWqsN/q"h`"iTI0u✷ ( rTM& 1.;|c>-yP8 Ƣc^x ?FbXȢc{lxDxLLX~z䂎0D.e.# P71GwVn>/?fE .PQ+”X<#oxV')ϋ kcdsllt%`(iCuUP8?E!zXoBʑ/Z=B}Le!2BߢX^\p5&Q݉Q9Mԭb]dVJ']޹H2gru|&[iP{Ӈ{HzƮ◎/vq m8]]1aܫ>?:Vܕk: 볺C0So.?Lmcjƌ3f-ŗJ#'o'xC\^zG/{c^"OztB{w\n "yF]t\߁R9mTAzp?p!r+RS>?$ eu<' _v!iK512$CnwXoE)bcjzmԋsCt}V.εPc<ۣmCHw;S9:-$ iB}ܠw.ay}fAhxV֯ I,@#Cbf.+6c'yDia=r̘hGM kc]g!Qe .x^UmbN12ؘNA ?z赏bIT/{0^h^Ss(7n^o:G&>(ciYE9-osؼd]4P1Ag^6 룟z<] ޙwh'D$sfiKou,2U<&Q0Hl?A*Ⱦ-]#}$^$z>jnz| jt ʡ/'H1j^7`,A;:bI(0m tm8zB_MW)Ff[4~)-f1t,ȡlÛXF3f̘1cF>xyϗa哷(|[L^*{?Yn=dScOPԼcƌ3g7=v O=W^(ˣ(ioi+6y7>O> q>s9S{_hߊyծփqۮ\5Mzо[k ƯGHzn2o`l}hz}H^1bo#4]_P˔r_gz h):Y~Æm0kVsiȯ f17yMv<0QZ:6e: x歜y-D,kM8.#%˯ 0?٦Cy(ic[*lO**'8wON0ϡhg7B>[|kզ dž|r'컘8~TyjAO@V:%o{=`:V{jsikZ&>ٰ͸_c[v=w޹/FLLfD= t#ՙi\ن8h{"h`1[v|ƙ+j~'nHgB,|EYuҐM~=l@S'E.5R/& _zg̘1cƛ=\)'c/}wyw?by)j2ڿ @VO|*/u3E؝{,n!);⧻j-mIg-GT-sqvGG6cƌ3flӆmMcpc;t?{~Wxv]cyC"1u;EPfpL 3M!~1XإCڲzy "[meKP&9n/d}v7X2jhu3 _8ފ}q0pQ1U)7pJr7oR`?#ItCD^P\Я}c[]ZD|,7A99̺gC,ndQ8(#bc7}H]a`YuVߎ=z^8g#io&>S+y(s &j08!u ?A6X{I?,9*(g߸Q~nz^AQ]t=>c q:$y" :/蟆q Q8mDc( h_N)##C7hϮmVI.@NM`[?DZמM,43d4s4fӤ`WW}fоHF>8I] ?h r<-EG\u-ex` v@Ja(٦-񝇔Ϥ=? źAǎ@햤cjwMJ1=ٟ1cƌoRİÅCx}RmHn?8|y[vw+>^}o^({fPwX~^#D)7?c织\> ۙT[ŭ\h{mq/7;3.7K#nj3f̘ώ|g|Wuԝn~smA*W3Z+;BVP^vߊCuw^OMڰiXcU5]vסrSSQuk.u=P& t.,3勘S[thٵ&s1_\JBj\r h"ĺ rXq(Ė 05`֔a`r xoioP$:EѼ x\(2' {JLd2Aɢ;q؜'kXwuv;ǰ b LM9<=C ԡmp@?L9嬑[yf-i6:0Y H)jKF v×[=DG{ &sƛbr{-CSȖjk1bmٙQAaCk<@Mec(Ao(V'jж"@~[]G9b`S09K\bZ-kwKRR?cP$*\!,@зq<Ή$ 'Lvb"?@4YdCД)ǼcZmmQoݜuSз6c=Iz=B_ Ԑ=Ĩ 1XĘ(nI`{Rm_Mkޠ3u"mۡ?s~uȾ}fs3f̘1͇>DyAT[]zs*Am@< !F^@9SSӑHrQл#ȏ  }(!tȎG KZk}?G`}a#C>|tY O m! #9snvYl)gą:D-6bSRD{Fz*aCv؇̌2Z}d,fh]qޢ.1j㐠19{8'njcK;`C7cNBn7pH6Eҙ Gh D[JR#Uh`',ҵcFqf&ѸNeq('j8Ju Ԣǻ"nm2̘wh#3V5! GԕM? [$rƌ3fYM/T^.ϗOj67R=1!񈒧]4CwK//.>ş=rwp"O~Q9[drG,|h'̘1cƌlУ}|"M<^ihһj66FнV+%@]K"s{e6kl.K">'}JHl"Ayt*d2o mn6/LS2/{zג[;XSDLS ΛDc!EkGGe6ZI޲ź,.%sKZ)پZlc9H#=jA4 Yĵh}^)\& .Ҟ=AB{4?RаO.ב(EMYF%_Gw#X0DGg"], kPld,K6 bm$e;ޙ@:GU y5o [6Ao){Ȳ<d=PB2nچc~Z_zX$/6&7wXYNͻfȔ$ tZ6cCrE)C~,X D$6?q|po6vP:3#pG(Xv^c?u|+h>67ϱn ogYct.kg}U,y$ʰ386G_hPI2|*B6VSD;$=#$[[mƘh4xzD#:x T/.qO=Ͷg9-o rs=y;btd_bZDu૏\>ٽ2o-t=ug\Wפ#p/|TxBS46} &K 5mȁrzdYu_"Xn%"h/GkTrKZg4w }DGQ. H y5BI#;0#wn,h2Vu=[ n{d^EuWIV-]TՎ |9xZIL[wOCGA6}_/N`B ;uU6Ty<^bV;Me'p]^)7Y=¦wߘ1cƌM49P+#$ LY;p.Rkl[?DZ9spz Bm'1O vE Ѷe/|}vLR"d7O3ƐNjoŠ=Jc@syDGp<侁L:9LxR 9?q\ n6]5fο$wr|-1C-h| { n[3GY@>ϸ'!Evջi߱wE_؃;mR1@u[Aݱ6a4Vzub33f̘Vc|BSwŸuϽ/voPGNm+O}" *wŝanݼYȇmv+T`g[r|8;i)w3f̘qבO;)u l1|b$?t)l}bmj f /=VfHoz'0Ye+:@!߈e$i {i;r'jˁ8."lka!=]諶)}WD (lŝrr}q`r}vjnD|ābO@ݶkhKd9*W&6#9/q'Zˉ6#o 2!AoIՖn Ɍ0o0:{⨼wo՚ v]z {5"PdtQQA#CQl/R!0h<hӧ: u7âO'{POG& ]¨H*og^;͌kOmg+fT)@NȮ7lU*Nݿq]`ᘦ~n+;lGGg^m1i[oǤѧBAO<:.hrm5%G+21 6t7s|W˟z1c[ohq./X1cƌ3f.K}]sn몔% >g[#P|7H {oT ̶T0&GlC0ۦu}TnH6uخWD]6fn\{hl zcHm1'&A\Pӕt@2uF;_k1# _^]qtQGx]EQ~׾V~;,W㯇ckTHtnY#AWrԆɛahnli/ULetG;&~jϝɷ CS[h!U{ Sz74p~bs݉'b6*ǫEUp.;ZoĹ@9-o|}߶,sY~3dxW_9+?.'~㬔Z)_;-6 slG)]M_B̗|ks|tD2ǣg 1]lzO5dŻd_ĸW\Ƽl.rc:lcűނ2L)LKlA`kB08tZPSuԅ"j!wJ/K!wM:h7xddLcud`Q`ٴ jd[VgQ\yR+̓l 8Kp%SzS!J&:$os_x,My0Bܨ>8:;Zd ?u5l݄kD +IE5`MK<(}"ړZ`B%Xr. t!wO/;*oGF%;/&Qw*05v0|Бy5W|leAɚ7Huz.9cƌ3fѠG܈Dr(*Gy|%F`s}ˣ V5z'N RxJA;}p;=ꔆmذɞU,|–*C<N\3.GA~в*Lhn9d.ڜBqS>6GxtjvhdSwB`-ZA u %!W'ThZ^( Bsp9<XJл !IЕBt'}w~=* KD-vP'^Hф]Q 2>cƌ3fnj<^>|{3f̘1c^q_u 'Wx^Z~ y뗮"Wr>0fZŐ`i DžV׀}xdAڂ*B7nBʼ`<%2kK֞e.RՅ (󑉶^ayO^k^O![Z9!ӶŠk)E0]-Bu~Jb2-'mlL;I-&k,+mCHeAU1ٿ BHAD) |VSx eg.h øD$>= )РBu)+RKo1 @g%8|A xp?Ay 7rN@tJS`1"VeV."s\ j#e)P+,!<: JtǖNrvg ')cc@@F% ȳ+_Z7 cAÜ˙(Fyz Jlx^+7Zv6{_G*<e~ALF|BO Zu>DvHǀq۱UUF^p|UIyPrу#) V 69kڱ/ҋMmVNwAds^Q{[]Sb72A! mp(1%SrF.pIb<׆/v޸a'`㆙3TaYe8F5y3 JP}1Pɡ@l*,4H1lhi>ɻ†}zveu>7R7;*%\—x?6&36LV\vغm+VhDwн6'gtcLA*jE0cM`S-df̘1cƌ7Ps)3f̘1cƛva[_u;2/2"oru!loî 0LгEr/S]P :u!_qf{?+7 Os"l d $Ƒu- =6: iPFFw&kՑRbgc8D 7B5Qd;qȖ$V0ًEu6οӲZmd͗ԻV 5㼦8yvnYyd%6؏<%7$bQ7գQXO=.RLBdl!!!IJ"c|ĊomkBDlu\>@Ԩj Χ-j6y B ]Q&Zm`pp SM]g)}[ V(d$G"EBus!c4,Q"*( 9)0{m0 :Ҹb{.uDex5հl@V?"ae8nN[c[-6vӓ< m ɽ̸w3"Lxq֒w[A ٰ S(fU\;>G xNln/u>'wdrA҃lзڨAg&h>}q^qC }@*4¸'~ҥ@o.8`^?h1?l-ͥay>ݫ ې?JEIP ѭ}Mپ Y@6Ҍy90Z`8wfΘ1cƌ3f̘1cƌB\+5}9aځ_Svkz]æ<OA\i!^r'XB_A\Bk<Vn< ?;}Ք4s5=骫#l뤹oz9r>НRJrx R/czDX'3]E UydQ<^݅X(Cp ٸ ;|C3ev vyϕ2QA?YF7:D[mAz6*ll! .-I1,8Ȕon1H{\[&6GFu - )!z<6HՓxo͇;So{\oJ]?"RmBE\?*"x|&V= ¢2<e`E؊ssو  NA ~:o^PmC{F^9د@{8Ӄ0b#[7~,2$mlFNB.8D0g/kC޶p)z-% `,𘮯?E9c]B/~Ta#yOm3-{TO9$^\k@k3f̘1cƌ3f̘1u}Qe.C}G_~ T^;%OM&Z(kG۞=@Ixs-mFFśj⛿8vF1F=ǭfE\|[ cs/&V2ˣ ݥw Kft Dq9ֆ [dhv7bRdf&~.zU_ړ S-lQ\,q[n@^&j6뵭oO"XXDS.R~ UZH6܌YvfmՔh϶";eƨ~IdPnwkiIMY4YګWo_3a~ $|fS1m^tozFMe4 2ʱ쪞:mѦ k(xЁ|~YU~#sD{z#Nvȁ6]f86ؽS:u^'Pr?qYK81$)oo =boK]Z[(U9rxND7vliJK߆n 蕧T}&][^Ǒ؞`) mR͘1cƌ3f̘1cƌw߭IW^H^Z d[ɏgM#.hlK@ĒBcRG_E7%P3K ~=?\5dz =]J.*zMR\lF< Py 7B7S濖hc*ؽA4f[n N8n0A:P4ɠ( ].1 ހc2( ʴKscNe1(޹LD b рf=SlI']|Z>N:yZ,u7 .*ASB MgggS9{3Zw7k1'J,+.qqRq*|t C76r@\f#ti_6$؄.PAf ~*! )YmV%Nc7̲P>G`Yӎ5bU(sQ-5[?clMm1nO|NzP lbAZmZM/ϱq9'Tﬡ9.`jض%(.6.3QGxY&1FĢC;. mfI|R8^^ W'dx҇g_"3Iy xbCu1$[ -Pl{'2ґ}?Nj'3[ɯ 5& A-D=j3iK6fbQg-R_ӈzKo.Pqg|h ԅC_ݽA/r62j5W0?. d:\ZqBhv݆:Z!8/^?1f 'fn oQ47ccCD[&Z:b5cƌ3f̘1cƌ3f\ S_H`.+j@NGlBfJ.ѳNT_eLPś&P%[F?Aw71|*+x a-H&Pu:+wD0+TtY\UE^:m¶!NdmMP enxdY\a2XGye-)<ޅ̸6jXB4䎴8G.+ дȵ豳Bx-˶9 E hh e]wQA%#rx͙LY!ܥ?ls|R>Gox6A̖#d V7.|);XDw 6o$/sHyk@."ja<Ѹ=ĺ\?b% zU:2U iֆ1t)"f"}ψҘ!>cBd| T[ǁZ5$uF.USjar< I9} .~l[yP*#4ˋ7w MI듑ȒLŒ󲕁&Ad&IVJiCecQ$؞ RJԈx< yR%Eʹ]DXPgoXݳC`;ہ>.pva"mHvaiϟs3-H㶶~ڨq^(§l=wB?hw@Y~r6?vwK^].lK]6l'#!'GQ ڔ hM8Gp^F.<#ASm 9]z wV: GIJ(/ԑob>w0&iYEܩ&HcbBZǹsF:s+7~k=ޭe&1\su>"%ds»0d42ä[1X2eIG״xy#^Mv`r(ٝ9*+Ae+P˖f8n/<~|lcMq>>tC""%pDDzåx̄ "1|w:P>HP >Opsn( eDaǐ Ǵc~E Q6S6x10`p1J.A q嘈*7}t Ʈ _DŽ_P`Ϋr^yO1M;1=)ڈ9!eD3$P gwԃq9w1]W12Ee1)ҠQq\so1t*c%p^Kb<8&z=or@Pia9͈|B! NIώߩ;1t8rAًפ-o" ~C13f̘1xOg_[/?[|'\@O[qƌ3f8 ?3|<>p^~>3+dw3_Zuo^]a5 ) 4uv{({q}&~/qӓNۆ&F-FPi,|m(ru;1FIT5# v^q@{>Cu#8!nʸq|Tg}QicQAqg3G_ !4s))F۪LKu(b޹6@Sft`Ev.qU:7REO![dqsY\ PtX2{e;B'"!*\,FY[&>v 10DE fψV sՏ] D$1#KbSZLƨ S؈%lGoCuF 2Xly=Hβ0m7-0og#OWoG#4#aG}rKA=60؂Z4<(*6պ nmոenOׂQxx.DۉkKbL,1" j|`"_##{&Ű41و!{8WUWE[zz~{-ֻL"`sAҾ=?6lA3f̘1͊˳Uxrb; PS1/^ ;/|fycϕ}r3f̘q3[<ϜO^"Ozte_/=<;k)\5A6D u^p.6/;]cS [95>(\cҶ~ж /~,?ߣUMwڡ$ص}޵EI8Tƕ!'J7qÆKT+cGn< ՏlAY\qstPY yuvTk2&JnL+1M@rGt\PC<߇ovw֌gKTj/c?jݑ/yut7(xx$Gz%엌h ۶9Muvѡu#PiP,ʲaJ '_,ոR&CqoQSuAC"ꋁYkb惜-6q Jkۜ& pȥ8PeUVΐ6e7 ]תX1ߧ=O Io0,[CHGx<#8ؐ&qkDْ~P|E y2&]cD\@:+WDk'ʉ>1:~붝o \`wd_'v0b2xy^h'*,fm'z|&_yAkգ@j53f̘xS(wGo}rLO[>Y?v51cƌ |pSi'/ C`Uyxc,O@|u^F;}q*mp:ڏy[t]< 2p (@;-W4B}_d2~3Tpo߆Vf\`-F1|n1 o1@(a@s A]h-3Hx.;sfC ZaUw~;PPȅ!8=q~0Rm ƣ;*^ EE8(|"RZC9MMȰ9+"[G_ygaC3>O BxgN=lܝ6$|^$c#&9cñ&llN h#:s9e7H1t(qƆxfLiܽ8]+Vcm|mbG 6tld[ DrnjUd7t"N+G[eRB`d1 铠xԩi5PD|}n+#cb8fcTcv: e~/d[M$!NlJh" bA:= |k#L{ 5Mj>nm4cƌ3xoxOox|G˭O>_ʣ_z< O ē/Ǝ_۰q"?FA݇Ǜ/n=WGY.um;xV)lqtSw1s\*fy{y=ը^ĵXda2ӊ nxL]{vimxٯXB i.[}-w鵃]g.w?\vd^!NӺN&YfAPtkjkx.@ccEKF6p6\ֶ&@ў)چ^< Pzb| |LdyЮۆ=.m.gmti\vЧ?2# ﲀnjoi"fYyU_az`

:]vOo=Q>6#nj3f̘qݣiv1cOfHy䅻p-SoUҿWz ѻN>u;[s]{uɺL L.Ьۖx TlXKHLj2Gw ϲ|Ȕ$),6I4cv'鞀O_A|GإFv\Oa~юy9.S,KosnDsV.N1xz?!H>}#صV_\ʝrvzVNøv{_-.`_ aVpz m~8⯰l687ڝ:tlz0 o6DdW+.0wfbs6;sԑc͝}O, /›fK1'hg0`.TGy˙Y//ϧM;EcXy깏Tz]z$K//<2x;6e)=s"c0 }iM>cƌ3f̸.}|"MC0is~E`- 77Nm|,SvNPk1":7]̋!9onw8Y;HO1\hs1܇oqxO<J_Q sluTWVLYjTYV?Vrƙ~vsp55絵څcHyCw7Q`.vNpa^SIPĵn~,x=ڱ?+g秨_kFcLr<8gԤ5b=GyG"X ^dcI6!R?#q7V;y;Akt>X@|䋑sܰ?e$|_u@l;7Np`)YM[T'B|]0Tf{)%Sɍ1&-:5R07@Y%q\8_.q2U'!ǞX$Y9͆y!E8`L?BzGbNj]bXSQfaz62jcl@憖4GP?æ-s*pP<ԡ 17?m2cжB Oe5F &Gd}G\ya>T!e0u0e_,` v,y8|L>R.0 `ξo@ٷ>=(u|p;<xdlj'Nvljx'}/XgB(ٟ&a[mFΘ1cƌ0/lOX/ -X~'˭'>6&vD#b˰_B.H~xG<`< tC7}̘1cƌg?nf'ЇG|=}<>ė]ڍ4ݖ  ˋ~Gx3cѾ>iISͽbuEQޘ&bS{.# \Tн\E܌+BCWĥLCeǮ׀0]N.yB InЦ.q醤 1SFsgWZjժ޳>Fio# |0JGEv~RdiR[߄+eXylA=WuOUxp!IE1|!arBȓ]lf{}T^Eṟ~X')'"[5'f׷w?0~H5±øofdM lFf(hqaˌavz`X1l+R&_CkpmVR>]Be?^"-N:Iv86*~19PcNM9`Y.SNTgf'c f{Z;'?>sCpRxV\;hsՖȼ&w{}:oxU'/vQC][ 6lצ?Yl̯L/0鷾5My} _koB_g xbҿA:t`=cácڢIX~`qڷolذaÆEg~J-kj~fO~CD{9u{3ͳډ:6o{yB?uCVek TIʦυSm?}0D_xG<O<#~Ї!\zcÉwdA$lBܵ6/XndFmѫY`=I贏u("dK Yk[SBnFơM# =d. .#Uհɛ .;gU'RȬ>'R_ɑQP=;)#h'+6ox["ﾐv.23u EvL|m1'ـM8d_(.ӰF_NǍMYӓ{~&lد#a8;Ld@Gz(w $[^^ 6}<[<`a\;d!nTGz"s Mx4WǁMFugz?(9ȓ=; ~̐>z"Z`8]+8X- W7ÉAa{k!0F<.$z3h7I~(64~8mذaÆG?;5^aƟ|?lOʘO NiBO/|k\~m_(?-_)oNe?_}S $>.IF 6lذy4m>Gח7ǏW)>r<[CX6w^?oēqc쁢/u (즷W 778"&џ{~Xo s^ kJxBR+7=˒޹5%F ʣ_ Y#F& ^ژcL2[-yc.UrPh;b4cmP| sYx oWb|dz}|7rHgLɌysq{ nAt}_؅E\FBWHG.lV?C: p5ӑ^'ds泬RJV:l)Y.͖fX ln%O>ڏN˟|5㿼/1b=㊟ o9TSddCG@u޾#=%s%SU?Fvce&c _ f/6og{3ses?cؙvsi<9?f|~EgQu3_Vj6MNo>ֺ.Lf;^Ox}ܿbmۜswOLrzN |]Bb66Nibzl@'7f˧LʲhC-֢׶y[ɮ-7:-@ric  cqaYfZː[l@>w}h͙8H"SLݼR&!~Q>"mdv\/y[%:; *ޖ65ٱ .nXhh}m҇|~$s~#S^wi?3߁or;ݱ#ʡM$+ܛ7v +. 9>7뻫beG=Hzqbr>" Mg޸~J-t)1;ʛ6=YWr}v,A҆~RÀGD߰1o޷Z',oCawâQIJi1& 瘨%ḣs#'6ۦrmyV_!s|/ovͶ5-uҔ{}ڗL,eyۉ%[I&^ V^ެYQL&5\V_J0>駠i׃OyZ*3BVZhǢlg* }@{˺Qmh^n%.}f䡲g@Cޖ~cI7nذaÆ ?+ӿ׽lذaÆ |Vs3 "]?>yca5y[CfuL+d|}xa' t#ߎf=Ʈ&e#mF#t<ԑl\h ?*#x2r 4cTFѰ'!BhÅ90W R\5UE>xA?4O777X"cLVsOttc^83l>@mh{g>Ʀ'Zb:(L^59sWdeWlXr\-#{Y<_@l d$A6lc)mZ?ddv =NK= eoA6\y'ctRYaBi{C̰F{ RfJtW [*9F}XNs$WlR·dFR|;xKmVenoS9lH?]Q3>r>?/ Z=}r9F@ۢ?!kZ:N'4f$4҅ *@u4>QWLRH`mmlm%1h0aR:*P(gz"'!; 3X;꧍7:=Հ(jԩP[\B\ؙ}AJyHƁz"eu'HQk>zHgPiO>/g?.^o) |jI|"9ǖ|Ky%hVPmHUF0ާPM+_*TTЛΨ,wv-f^irJ / ^(N.Ύ8pH{H|'0,yǝ=5{z[HyߗZ` "m*_g')Qo1^a◬9JUuF6 Gt!2rm얥a]sk<:c6JKckw;46`Qg628ir?p"W:}M٫s-GY>BV'ZP=R܀ c{d Uqb#榦W<_".?17vM '8ZDLd:CF91YVݨff[*Ԍg\-s('?4$bԧm1I]5 WZSW>>bBm^(b._L-Gƴ=sY6ѓ睑aﭬzFʱA|`.Gz,) 3yw{+9׀挜8~/ { \^:ǔ%:2s>`jM@{*B{N I?bn5~$κE|c$fnE+u2]DO0p7}0A&|~>XZՈEy"rG$eEkc9&,___N׬DsZk!7#̏r?^G M6qf: ݴY`N׬p<Zfbr~I}]rK)uGX9Mkߗn+}YnZa2.1.KY%7U.8,m>XX~ԛuM靠 jՀ'B!d+L̩XزdFikf,p.^s|\ w!{!䃗6+Do5X;uv,\}_9RWV#]:*f۝ďʒ=McO>pQ{sOWTVXfx zraGLt tǬ!s>+UIIR!qD~:@b}?Ֆq:fDwMa7y'sD_<r,05D!u8sqAd[$ǼL{B' LH" 2eÆ 6lذaÆ 6lx3i~~lFF$z>7꽇5潥߂ޜߟ;^_#͠&@29iHн_1`yƐƔQ7ݖ!Id_ GCne>;Yθy'O^1 yU'*޺s;"vC-ƀz[mkȪ(}~W뱎16PΜha@5}A{TڱYdsW?$z]kdM(bx0໾'a!0ϻmz޿ƁMl VƢZ[ΝshAzfPdF5O 힂5ewwBR7}0u]Ms\wN[0 $F4Xg \+3ِû`!md9rKdܟ<\O}.7y^R /S3L%cx*Fb_9ǎz\ˈx˽b 8Cre{ā#t*,݋_y |֒wSS?%_/JZ{ϣ6ov-lNceZHP"4V.lAoa2)u˹>7j,2}8>v/94 N};gڏOqP_ϱM{?yMd%-P%!eGćnDTIWݘ?|xؽT@"yן?B߰aÆ 6lذaÆ >I?K/_I'|>jvzJ?ϐi3yWWӫxN[BźDr F;Gl-yx ,50dt}blP!6SX,%'At~kaK=rg}MX8kFXzYMʃt$ R}3l]>^rf _Dmk,Gm0>))G$"!ӵZ )c,xHIA֘(+gZRHFX| $TJ|<0+'ĩ8)a;c'Vu'Z;W_$ ݣ|P/&{a X@1<'7}q⸜ψoþW[GL7woÆ 6lذaÆ 6|d#{Yq6?'2c[[N確Ew&$3Ci?P}ioTg%FmGu?]qCHkjxôےk  ό'Ϲw/)v |'3\__[lhnn}kT쪢%za(Ŏ.[`L]RL=U$7Ṩ@̦OZ4}黶tuӇ׬DM+)b KAٓ"Or]ql0 (!1}Mz&_K,?rmp0-v\ޜN,&~G1:uCJ613NiՆ˒,;wI0=HV{)TyCO(}>-7v!5kAt2.DT4.(d \scbu ٘ D툴 ߵdG|>4{- AVo7[fotHC e5PωC<@?ݣn"&x`( hꤜ#gD|赼=x_jo1>>FgNorS5ioA HG>q ;h7cG}ӇmÆ 6lذaÆ 6l8 |$y{ǂ@~Ư=3+[wwB ?mdOY)[RPC[U7v\*X'426#Oi+ V[.-^7dw<{˫O1雺,{ ڹfbo;.}"vjQ#:WɃ#3E(i@1ȾyŽ|.Ѣ]HvE61g=&veZD"P']2+Z{m`#PJ(+~諀-_R#+,yjG?z*ul7jv 豘I Zikl!7x[l"VO@)w1'J6Z]>QPH.4,y T@s1ZqXCH2ŦphQގ9RManeOوafۯo,^(yӎڴ(6‘V ϲ #An#X6,^wAM9RqZ ouĪ#ꯏݏ~FIi*\`5AWxSl y 6Φ#Ās > C̹G#JF*M?2=`Ur{3+ :C%{J"dY"uPgTP'Ml}+գk5)Ծ}= 3S)w*jzԶ0< 6lL雑}s_;ыG_ ۟9gV~,Wl_x18a^b.ѱ{~D8oŸzʹ曉ճ pЧڛˡvbtÇM\iM^7jSmX?عԨTf&`jܚ*;GW0SӮMD_ - u.5&j:9(wpuQhq>_f f<[=;G޳6zpm OqlB}vk!,P7ˋŇ !=g9+7h;2v?(wv1| m+:xX Un/yUj]Zv)wv!nDO ēY~ѸJگ]wf?'\ "y?ɩ@Է|i%UK@$ BK2HvY 5>:A;d5q4f^/_AJBܽMR]kFk EUޟsQ^ǃ-~Y+QI"~};B%Slҷ#YBe-1#{P/[Y^åcȺ'2~Bs {FDE&.᭢g'nWo<dHP2զBM*ҎΐioDAҙGz1s%a!`q'_>y,+fSOkq47"|H6l7Sӗ> ri8>ӷ~g|dl'C֠E_od7OSϿIEONoL_Η/t>|+wg<mx 𼿤( $NW 9Z`59hF,wgEQ+!)Tsӿա_,7Pݘ{R_ Mf/AAeH?8jH{s5⃿q櫗s,=nNhq:bdf>@E.b|hH^Xbqym߻Wӫ˫igX~+=Xֆ˳8# hq0/ -J\uÆ-F5/'TpkD/*>X_n x^ TnH;Z83Fڳ`zDrH'T!~Yi }Ml5#O=WnйEa)%ek @VH\sLc#6J㹞cտ?7;^׹J |D} ;wuL"E;eu{d*P~kK€Jf6釷Oi~ؑe{'DyhDՆ4uqsજ5=p{ mONO 6_ٰtG{W,Z L7r3ٸk3qȭx^Kγک5&.$Z`y3r(!W6PQ6s`uk^t"m0 Ϳj'hs<.mn8@'Uczmm5?q4X zGiZBF;[rį0խ " E8vB':Vcg;iTCSa>T^h1OX8>_s+ ~ LoWWɿ)z6OW#Z;( 6lxwQ`|r-}N;{WiOyw ,&~fႵ/Nߩ>|+w`ˆwԹX6ml8ӷo6?6'_Ϙg-S57?HgL[vp6A;Uz'?~% 6 f+;`ìl}ݷB.rG+H4loS:$ػ^m/QWeɬNA`{@$@2˱hUߦ]-|视99“wWO˳ɮ#HkˎyNُ/=;NYX;m%+lS~UHQmY3nsy6I[;Yԅ 6X^y f SVUt^Eeˑiו_M64%>,<fO4xkn7ioޮZ mڏjEec59׭!u^Plp! 2Jigչ8 zWN6z vEwn%]?0`c~)$?z>}_%t;*ڹ Y(>G# ;@(>= URNc8Uo6)Od:u5]a-$ߒX'\:.OwoujiC@t ^+I 68 ]Q]ACB6sROvDOop}!BocI8Z6@8/O. >{v𒐝`Ek }>Bήcw[eG6@V1ۘ}kY3d2⠶L̑<= `~V(<'N0Yr>:;x|^g.`ήP:@:sfj*|-]9+Ԧ^36RCqj@Gnoo|>E;_!m^΀L l?NVj Cao?7hBg`W7 u]w"V=UMPlˈ/f;})tG>ǡ;1_zo9ό: 6vs/cP zEP:Jk)y$@([7lذᭃE+>ߝ~1w:MIYl6(ߛ~ߙKMk;{ G|YקߕC>IM+~k鋩s5π?;^K_տ;}{T}'iY䳟_tkӗ>u`t]ꍴ:_~~竿mNeZ|:zutm?)]׆8F6,ߞ?~WWxr;~WGw~W6_k_/|kgA~ UoU}=h7e>ڶB6ˆXHlaVө@Yb&@!zϊlaGm"Mn=m\xi(0}AVZ\g<^1~BgHtEO*?k.E#'zg9MOoÝ[BQ}u ?@ U'ˮ sk^.鎸ܘsܮڜ7f\]L׻i]<}8QүYYƔ2sÆ v8+-27dlvW$ӧ>F\MD_c:;m r߁ZnOWg{*fIe6*i=Fl^"e#}bڐd$ zS;n|: 3=WXx"as#}1"X'؟c0:ک{;Ochz0 f>IP>ՇC@%),s똵6F̓)? ض16].IkT[&ICt[ooM|h<\[5|q"&{z e!PC=cz23J{b֨o, ]#JVTyeTc!b1! \>ɟSyZ{*|/hoȲ 6lxO=ߜOVG̗hiXkcqԗLbS?gNߛ=+=O>;SKXö_:뱯0{ :E_QSm}wG;q$?;÷k[uX>Gg3}1%8a+gyljxXgq=.'}~/fsB6+'/Oi7//O@pi5a'Ouu*pQUMY6S6Q|YƲ36[BUd.c+ۖlLRK H{}1ߣLaL:X>׾;eL{}JgjzVo KyKVL6z ~][FlҮwk5_?!br765To'f%M-X)>gh<"C!7)d_.(k:GR[<1=QOY=ɶj"YV^Gciu&ý,譫=zY?Ms+> ]%Zǝ򚠜fk Z3 Pw ok\s0\wAYӲc>@eMA*9~LZ`xgka$Bn-N"${@`e;56,. ܯ"@Q1ܔ\=*Ő!ҏt..|2$b ja>Bq6cY1˦Qv.p4ְ MGU2Ȕd'*hHϠrgT\oY,fߎ545(_5922]]|Ny3~{s0cъpry{sa[P%lJ>_vɏv!#lzFԨ|r-k~t# rg‹gH1'*>0<ɔ Y$O. ~칐yN5ކl+g`t+_}όh_ŔlgģAΏ@ө|^;,cve-8Vg=;7M=C 7lذThk+C~_%1a?e@'ݽ?8+~3u$F B#y6?TĆʊx_llOyמ85O۳!oMV|]!g|+R6* ={O@#A,~Z*ϲ^'1WZS5 }\oCY+L֐~ػ/H;e~eʎBPÈSlu.ҏL~t &?։`XlИ5oo;ξl@KPWvz͕?+`azm{-kV҈)Erٝp,s?I\II][Ph3|C^zRyn>/O~Yc5knS:$v(˱$ dW1O(Q'iJrK*o5ۗ{~fJ?|H7TgPl*~ӝ7[y|ZWudž}C:k&<{?|z;koW1n+ќ>Ƨ/}!cmt87Wc{'~ƳO#Wn^Ӿ9_Eiq 1ڬx/Nz|?swLxڑx|/5ߟ6#W̯Qe<ؓ+_-t -<Z?{wHϿ?Zl_&^GX)Zܣ~e"|nGoorNSN,*r^e=>`gi?^cx5~ ̩oƾ͙6/ћsهx`y,fчO6tn] | I퍧a`\O/$uRV?ruDlтeW01:"q@03j;e{59xyumYޠ{.1vw͹`".υͅ,W0@=%S1 ZYyȏk(bˆ_XzEy/Ḭ)`+/{UΎ-!S[+/=_#Ar~QnqhXmذaÛ<K_0-b?nQ~Kӧ3m@;7>SygeSY|wC /O'=|קo?_Tŧ/}caoX>`L_T|E6+y qN_n_LScF `~9h8@wyxL [?Gp(pn3O#<޷/~wx9͊GɎ|gti-OLzڑx1^.gΟg>nC g!>ؓsB]WʎBU}L[gihi;ƃ:ă;ve|+gAgn20$y Fu:g=0 o%=fm6ц/d8yO嘯-I?!'aI}e ۷9#OSFh.XԽwCo8@_M?x_.F 6uL_tE݅׽2ѯuq vqU^ =.h qiޮo9X3~%3ua۰MH'Oi=_<_s# kMˆ|rEΑ`.m2\ף}6*ņC\39m%;;0C`LNsd">Xۋ5'05ol٩Konn`,[D<8qkD%^*Hh+io&e)?WtECwHǵ9<"_0OUn1##{fʹxRuaЍZZ<S|]mCpr'>_ra>bjVRó! 6cP{k6?dž1?2jI+JߧMˏ< ԩ:Y~448e'pٶMQ8u;ӯ_lذ# ,}|8amÆ ~(t>5o> 6XaÆ oL;Ӵ{o^M|f!{J8 W>ӳ>2gF/QOl[y[AU7Mh\9աi[Vmu >~c>߁V ۬:W-HД9HDs_}E`s˂iwy7Gbn?9M'/'ǧ)P[CioUMDljvfg[aT|:vCX|Ožھyt2HHͱqnZe!Fmnr+ BŀiDeWiw0}5]~*_O&:puyW\Y OS*Zz>؇3 .罓YLbUYp%lsӮJ['o-OmMto)rsS;>󒤝q;.|K0M yVSH Kti Ks^EWos{13qdMCU'!v.]MnWm (!\(U[FzJ^=MvdpG?Ɓ\h9ozWm"8-?1kJM'.NR.FoͯK'>̓ QLO@(5T^2/aL"dk>2&,ZcDag3@ XxD^}N^C=nO*A >~l6P Q&ҍ8qXՉsBy*sb`SDsf8Ied~1k4 c1@(1/-ЕWe_c5gРϳ ϻ,> E99$r^Xx 'e6pwjD'ydsB&˂ާXY1uH#> %zR։:8/1b`k({hУҦW Ԇ 6<z}%6lذaÆ z9>>|l` #[)+ÏK_N~P9m>t19_ |eqg~t|+Xi[s$ҦG]g:>mfoZ'ݝklqbWxnԔ݃/Κ }ɮK!2?—a4kά`u dZ)#/`)Fj(֓-3闹es䊣X;P#OWg\vHS_g9[Y_tJ;Ir xJS\'}Yj)4ǽy*+_s5m@e%a +8Ȳ'YȿH'j[&SH-YBy< HOd;6NTN"t~4ԓnhuyi+o #h2eq˹!IaTps=y<^~|Bae6xdއ(BaS儺kw;?*h'>֐DCHz=GkGSVX?} k\x+ACHֱ6h7? ʟlMdku|ht9qÆ >O߶k)6lӯ%lnذa >@vy`uC$+F2@eo~|9 ݾ #jzQo=-oS=Q>*fCyspv̇b;Ye{#R*w-p3q B 3ytn?<\d^\0pvH_ W3K)&Ǝ+gX;W;ι\lwޛ O7X5rVB$6PjG5e oa9/+W%M lp_dFBƈy_ڈ`[?m..LZiP>3MqVlZ(±Q~X=b'XY~Gd+Pۅ>-eckm_]SJYcZ q|GCKӇTs mk\}OKݤ@}1z(} M6Hq\|S;O F:細 l-FO u.}K9B^jrvԺx_`1LC->,MUxd AnkUl>mGo3?zXa ;>D{4=>^v.˶WZ먾$=ވRc3l`A[鷊Zs%&@+#īn@Lb'0<[0%*3YAP.YW>x>}5& z6ofLUVeOS弨ÐCXIJC5d,?҇{kh T[i=粹aÆ 6lذaÆ >893>i%WcE,4 Y;z?u1cbמ U^w/!|Z)ODy>x=l7; 2F~Elܱ~t?x@m1[+Ř-ݱ@0=g^l'\A_eH{`bT|ǧ `iHPcV9A ۪Hn^bl턨AfƑE`[Ffve|\9fR-bSƥwMqnqɿ,u!̏n?6 ]{B[$U9 'ym:T(*zOց=z2 -LXLD*,W.&U6\_/ws%bomriZbkPbWtْB+-VMuG4&iΤ\ii"^r=|uk}NTؾbJFɽk • ,BFLiHUy_#m,h@w0LyM}+ch@fi34Ͱ~ n fSG ~E[О lfq"IiZi' ,=K]D;h;s}-GjS-v6ۛȷDi`{-wxfީ8rHIWZK|1fZLKY X|Ykl9鿶3Mv_Xxh y?.А#`08BO`May uA2&PvSZjȚ 88GIkѵI!݄ ʫNE5i*ØpvԎ,,Pʓ|\UDzG*Zy6rkZՎ[*d5 ɘd3V{sϑ%5O+ }jtZ“G:'=ѭ8R '"4cr»٬Zh)"=!:Ć&իk/T{jt ،Cnto(b8Yv]mƑ]'_aծwҿDͥ]Ax+RʳF _zZY`UW[w Z3m8:Q a)[߲ DbT&Ne}F-r8h J5mwtG>p[9aC5~@+;/}ZCcA8 LS}gٓ*K u#S1 Q-Ǟ1?3@PmJw 6lذaÆ 6lذȏfI&^sneg~^m4+y?Pr.Ny͡'cbsqd]Swh2.NʛX~_#F .VxΠloյ|?*cA}ckv̝SQ<{#*;àwAЅֲ0ү<@I9Ѝڗ[؋P93gȾؿvGQ 1{ F'ȶFܰaÆ 6lذaÆ  ul_~2>\}_5ĺ)e=-ߋnڪLPq 6or0s9o=4v~i3 #ܛ|s4쇭GU_\Z@ ^AGeFo%3x E⣱H5SCQ#?f5iߦ2f?뢃Sʛ*:*Q }ԣ.j'%s⏚t } ⠉1҈e&渥b >4Ys`֙Tfmu%үk5~tŚN{VJGt>i`F~ee>]?kU&%r˨9Aj zԾ5K^*e]JߍKQ+vՏ 86j0gm' ȓgkyԸt`Ns<qh=dX ʟogtPY6WW{443bXsÆ 6lذaÆ 6lxUZ=c$d#?/?gl%} Y8$2=CLjA_DF]}ED[ dh{ӈPF}y <'rLF`,bŷ7<o2Qǣ=aщ/Y'׍LŠ0T~_)ȚBE_^\ػ&BDVNl#mxӓƆ 6lذaÆ 6lf%xϟx"?4<8ba^{OR͂v5㨻E~1VgҗI*EN!ԍkH{e_{vhfiD]խY=5}= #?3QƬ3CPbhn_82 pt:o"+88& VCvAP-*=QɧL&zgP2v?U嵾C< ܁. c)ձޚPv%:[8yeĦ-b,7lذaÆ 6lذaÆOk|i{ybЕ-dTt?@e]:ɸ6汰,}܀lh .ԺL ͘GU6t4UBt#2z.GڙJ8 @aL4.&rF4#wUmkRAe@$FA (J!uNc+i8sK4D:yŢQ%ٷ^kŢdUKp/}[jiu-V}@Z1YAXǦ2&O ,6p􃔃Q `-(_jl_#qn(ܶd֥Q8nSjJ,?#F==yD5lwk|L障~$Ƚ̮*e ϝNWח-|6cL,<#O bsau/툽t_'ڋ ?_Y lY=8^[vv<Nj`}}UQ&6/oV vvG:#^}0e͕IIy2 :Dg'm푳5 yb"kPHaEKY> fBU|#WtαE8mذaÆ 6lذaÆ ρ\Os9xgg LdgB[lZ}~t."n6+|1^5NGuAEڠ6X7[aQz!ru ?gz77ڄՕ6 O_EEAX,50R% D{hRlg=kBn"x ڵDz: H̅z,#c͍,ʦ t&> GQi6o?YXm>j=1|9ÕԎH: b4Qk坼9&UC}e#:V8+F]13ًIdV?JŞҾDlǙ <d KL6dbhV_.G;B60@1_9v /2( bDž1X0nuT?TƄ4Oa`ߧe>m,@cP3Z\㟕3Q >x Xqco2X.eNdϯ!V^S02֜4  ?̖v??UAS}W[ H$O2dM0 0osG}Ld9mgc1|{J矦RdŚqL\( 6lذaÆ 6lذYP>ϩyG=Xn:h$Z3O}둲Ce/ש}>No,>bˏe~ޛ>6pXs>;^ 1:GQOI S6C6|IC&Iu]٠۱Q ZЙ-ϖ rn^&''N\s\rAO6>Q٫ݵy2T7l&eO')F<5Iډ~g8E6R.6HA-jg?M{~aR2݊ k}cFydE55iDSoao>O ^ênΨT =BnPtrw*ioaـXo3d6lذaÆ 6lذaÛ9MuF4v2Mkg}|/aTz`^EaxbCz9kh4kc!e9ڶz.t.Æ Ḛ;K &кV}A^i^]u~APN2?o;6ۦ炮9v̥|qM_2M<~ȴn$'5S:,(<J>&<0҉Q>m@=f7z,e@z@&ok3_U0 C$D;@}͏&sj LL2ꧽͬ8'3縆2K0 aX}32=LsZGHi'{F@VxdS,Tv')/$ׯ^鈉|>B>΋/rZ0]L2GP+ԡo"a _&w/'+& Dy2fPq3\`Omu {`/mysN6KqH!:Yίa<:9WAy%KmFٰaÆ 6lذaÆ 0i}} 7ȧ?Sp GԛEY~ fk;8&\h{3 N0ssipRbYXl0`QS{8|aHYVZ|բ&q,eǢ"yfe k Z]0Kh&Fo=pۙŅX >~ (l6z+9_BiOO0?qT;\Â:eS}5&O`S6.gwq;%^uC|>c+-AmwwrM ft,˶̄4Y,Bx"O]#2-7rQޢDK ˯$ĜN9<C!ƈZ0YC[>ޑI xjAqeos&m%yŽszvnW@Mۈ#fx*@A*2HERs'D]-be~}"o9H_j俟.`|x)c*; _'T9 l95^=X?pePzv^H&b쀯r6}YQٱ:/E <ɺ 6lذaÆ 6l\MIUFGEW @wԏe{~I/*ֶA = {1r1 e{fF"aûoh6j|v}sA\۵jzZx&/c"uE׻iw}mVh' p =nЮbZHy61Kc<7qoމBLF6ȧ/l渺R\YK_oo率BEMgLkYnaZu- |ԫe{(qqziƈϒmAfI ;cG!9PmZ^e.mNf{26z2 +#D 9褵)DAc>g>ǩGM'\gY2Q@:#Y馿-::gl<Oa61 u,@M|gIoJדM.>/Z< _|"1iǚk1ȧg$sҿHg{[T6 ,KHG¿<WPZf }a!欽5,*qSp &o ?ފcS‘Ⳡ>i;Y+sIKFOiFY?qzv=/(t윁sL[RYӱ06lذaÆ 6lذaÙ>eR;(Ϟ|>1:ܟcqOGUyc{jH'n>ҦpyyeƱQsSYReunhErn|[>͝շ &$pΛ!_'Ǘ|u'M+ ٽZм\5:O19Fsy.`uq+=/;:A\Nia]@/E?H?W6:nWz^`x,dqtPq1ssPtq.A<ßN\I1N5ڟcխU*0'sʌzԛq tٝ:5 q y2 QK<$"60^w!ȶ)A]DXI#Ss(Σ3e5ne?^"e Zј썑)=nNaY2JƪaÆ 6lذaÆ 6lx&]>I:JYQ>rV{SjH&^lC{X/ ܷ{7,P%̝ͫBfe~Z+ 4fU1?#/q<&e~n cwٻf @ı-(#67";q=]+î9v?s8!ײ3G=X4By+ V^sAʃ?Wi8̏u92Wbe{bd F%sfuBʖyksՕxo5z~-g{j7|y}rٍ%n/_{+2ۋ.nm<.on4)7fM93B/sHg'nvL. 9qʓ]N7*|km5KZ&ݥ]7xYEJO|44]BXY 7Hpi5=[㺗L\pweÈ;/slKA b-͑f:~OHnqzRea&f\T3j0V#j:p",m1Yw' 6X W̼/mLtԏE8,7fҾQ-pLe)>GȂ(ՅvD0b9]pmNs a,=[[+;5t[[c_ᛠf;>f LJ>HIDATGVQ?̯%ui`(ڰ omAm_ g}1rS2:˿ey5_{iL;?G7 '[-jqLp+YcP:*[u}!4!LY]/̶Lj\Hϳ0z#G927Ce'Zr (dzڙsɑ,3=(X`{ºB_5? mt-|Ͻ`{c(P'fA>5=$I 0Z5SQ㸠cߜ&@$w\C-6ɲ5 7q!JDI7K(vrv+ЮM_`moذaÆ 6lذaÆ }?zYCSl|P/3|{?!PnR7Žɐ/޷4uz.S/nRF;šC._X٣@}%ͣOum·͊ C'kԶ1 q<>CƗKac˫ik_w/H@ɯyvkuZqg;nn휲cԃ, jta<फ़~Gj^s8]R r)5.]&l+B_EQu?Uxť6qFbvDxSd/~4YnU{@i^Q%c-+d\1ۡm5#][]"olHQ nZ ",m!ZvCˈʻ MgKfY2=s_ S,@LɖX;Vĝ$#''6d #m4J6y-m㢸j/ *#sR?OTMxBǴ=|p%Qܭҵڎ9<:|5iCN]e@Acd];]}\/i" {'=&0Di7p0+;IЗ呤;n^UG$AmDȔ2*(b.}%^0rl4;+/7ےѿL0A=*CșuLA9ǪՁ~tqXA^9џ lL|rZ l} 8{H{mwÆ 6lذaÆ 6lO4ro3x^V品H6تʏB۬ Wﱈz5k \A>FC2J|G<@`aN-?r)jҞkÄ ."ߒgMkA]#u 9*Ev-Ƣؾs&:9_6owZu,z0A|a18ӀtR7IY ~>ew]#|hRy#K|E;2l _^C̠S9,y'h!#VGPyǾZv"YIݖ0xFi_WX^6r ,Ŏ6ox'#ەM!qi-698fk ~69< ~!\xX`A=OxeyȘʸ=dodvٟ 6lذaÆ 6lذoIIS#>o9ۍ},`Gr15>Zgk Y0/wv>\L?~wzF>uN6jhżO$gQʊ8tcw{m$ױ,)`=`2=[ /&;0]<0Z$V8;BM@x d+9yL 6lذaÆ 6lyQX9Zo m/pXL+ \„#iȋ#7]iT>bKyC5U|3H?+)nnW\]_Moq5sWFΥjivwKju`ԓo)6qh`w1eLo~ ֏9틆|u?6/## ( r}=\l{fC:Yv_Aɬ0}S LI=rqx FIM864Z6xVT|DQlC6@ЮJ{`u/|! 'O p3Z7x45&Nm1 d?}˔!ysK>sL(ژY(rVel;*&"窐Z2 CD&TޠDykxе!dIzW o§k\~"hNKdfz=炪_vԨfq yO 'O[A[h =x>Xi''׍<= (g9͖DV|?mxwQ XP'HOm&@/>e?J_^ՇVj/13Si2ZY.wdRx@V-|vP};); 6lذaÆ 6lذ"X<򳮷$n?} O)]u"Xx,jhۓc| '+nyЂ4vӕ<- ?q8LG!w+9}H%mLhy8⤅H 3bzkז+mx}w7vn+Q& I]^ײl@!/@l`c۞wZ>]KXP,>|Qb\2{@\HY喑6Tfou!`p]9XWL/ !z}@IXu`],h FƂhygFۦGd̒Y7cra IQ<[~,1MmB^(x? !^0 U.r6&d! ]7bY.m.G|uY+żMb}R$ycF:7@^2lO (ItL}~5_^ԡ1]XQ$1u<<jm S+SO1H_husA߭YP">9f8_ B>oH tԑ, R6厌W8:ROvG$4h'g Z^b(9 Nv#5w6@ߏeM~6 y"M-A_&Z AwЖqWYoqM6 ڏ<$[2'>`>Tt0]S^ƙ6[sNmO}X k8 66lذaÆ 6lذaÆǢ}f3q~3pQམqHm4k2vvFK>/|#eicY rTG:{FBz2שyꤾ PzW[fů=Dtij yY&KypE|`wwpD[_چ̈5]eg  arz~Ҏ-̰N7Vkר;eS nM|#Ҹ*}` >W(g$p/ )3Ўx)>GU< #Y(L`6`Tj_vMI1dgsQ]+),YY"WX~{B@ڦ^T05;-' )ohe]]h qΈV)s@yK&{{2ɭ~)ObZ`Vr /FX|_ M4 gTXovPI !TfR?sY]sƎcsp1u!iRmPm%3LhDZ^Ěr*˖%-3GFI^]<9KK{SȉډrDVKxMij }ԃƦ[YsG,zYr +N6+{1 P.#3*P.Ef0%.c&U{+yu=z,H٨0wi-TY#yP3=b7gb2QY;"-vAk(4g: 5/Kl,5iS%x0atcuk㍕SJE|Q6^?}̰/+8jglEں!Ce/ZYt3UˡL[R$MA)7pS V_1ُ=*W@<^C02q,+V̆UWko"uC&M"ro<,bFm{kU$SYc|^fTNHFwktV&뢓y}:gGLh#tLTYOk~~ 2>O>'|^]hGdž K禪ʮjJcȎ@)_X2)wi7b2!áR'X/?+? jJ{j-Col쀊9un J`H9}SI~ѲR6՗:U@G\/Y[ mlg,42i=ٮȼ6*)ϑG+Ƞ$A}#-6(U.9ոOVE/U.`3'"^1rLP{W󯟃U^Ay!dk2IˤˁV:<Zfo!]T7:wEaÆ 6lذaÆ 6c(>K_yZٳ5Zّ~tdsz2F#ZLWY_fFdWqjt_yȳnυրl$ԍi? Plx>_;k(l ;2~/?ʃ/ {,;Y|nvWڠTlxm̝6vye>)3g?.?Mv52hos7CY0Xe|=IOdDhe%.[= =Ȗ9IS(ЕKu#`Eg:qQ`*~_{‰ɨ-@EO'+.$M-*q4ȶ6rt~AkŽI=6&ԍM/9&в?˩6HZQ8d53fޞ4@14 yC&}6 SqAm~SWm:<=|#~q򖁚&dOyHyQ5ڤQy6KP82?/| wy!Ǫ1@܆0yS1yl*䝇^VVC" t)q(6k\Ҏ EnrkĨoXd26+ֹ- IG'#rBs_`Sm ȸQdjlmR3䓁=ڛ8* +]QΡpf{>nbc-XP7Ys92=_W97;˒ <6$FwnŽKE?GL 6lذaÆ 6lp6?sq8y> w?|_`c{g߲5 z'н+>{k3uS}O+UћdͷBK̳gC4Ce\xv:[da,:dYB"'_a/#4F?X`߁<Ԃ%H'ZF|#eL'ٸj)ӵ|v3. Z`qr$c7aw^IJ\C%8[H[k}׫y|ϛ/ f,LLC1S?>5Im~[5[{b'†g|&6r0bԭ8'ɍ]y#;Ʉރ "3;N(Ao| ՗쬶:QwЀ\;T*5gDwqim}52k>}~>eޅɢ\|FGo=P_6d![Q-NͧGxۑ1Ǯ2֑O6F߼]a/3_eⳉ ̑5F y!(j-O17(2Qq2ż&Ǧ1!/냞@|匾v&.ɍ >&Hڔh:_ f[m?S\-+Gko9qQ?i._t ǀX@lۼOsٔW]l==-O'/n}Wֲx%[@Ӧ9 ԑx. F#^쌻X>6x*+m6}m ZxW;叄t20rBo1?;=I-)=heX};M:G3qN ;q>p9o@v9y=V|^ŚvBgS~HA_<2FI@2'm();4_֫yuXQq(={v_?6lذaÆ 6lذaSoM{2>'<+1/ !N ٖ7k;dxnc7RqcGɌ6i'奪t, 7[!~o8 ue>Mמ 9mN9Ƣ;BEK_m0V<|~飞rA-r<@VRk᰽zM, T:R;=ջud; hhφYw@dYb<(-ҍ v㪺KFe7i M(K͋ MR,6,M"?1k}b:cfk^tzdŬCHYr<kqL㢯EWUlaoe.xFS@HP,o3˳ჯ1*ADs{;ݿ6t FiՁ{2/y!t2 #h'ʎuDf'ms7^̲S žÓ5TqbN9]ȫ--~:7!Y9fz #S!6;C8+og3<4%A8%xku$G!*K}Dlm֩uΏŹ؛+ },2fVdWyӆrwh@mQ3Ibc3,|tmhgQW 6lذaÆ 6lذÂ3 ?7}~ЦHZ'ބڽFө7ɓ5BWTY_FfgW| cԗGM8yf;ΖB?f+c:qϑ(@RHh8 NDK`&|9޷sPm[c| 7A~zmcܐ*C]]lHpe]mVTs`-w?X~PR=/{]#<$ 6)ת:8^Ɠ X^*Z+IiWHdcO֎quuzU_I٘GKX'mLNdzF?f䍏]OMޟ}7og2qo;j*t5{e9`-_e&Fi0Ҕ[<&GS:|^{y _:4)7f^M?5/PJ<.Z >eN~lEm3Xyyƫhe?]sspL_H_STS8z?~z;"OG:C8&ɓ|@mF9! q)X{~I;b7iC3,hKH{}[ Ԛ|ɻ_/"IzNoqx>H7:=g1)3,t+4OLd6/x!Oe}:~srf@ø_EZ@=ҕ&6 * ֊: 6lذaÆ 6lذ, > ߏtp}|E1tbaFߎD~zD%"jX/Զ\=y,ՅO4B'F2I"jjA2E'Mg10 ,8cb-XU5Sr&ak~Gמ qz<.bgETA{k*=ꊱȣ4׈V(#Z #6nLvn}`T>SGۼlnvV_kk:ڎe󕯱\̕wf]o~"KZ'nrb'9f*=cn 蒿ЦmƠIÎz:_+smy7޷Mcv7[۟0֗/Z?{~jw?+{OB,ԫiKf7c&Ys 5"p4bӄӫțǂ(r):(@ RN%R^%PEA-fz5"#ru#\6s" 6j2zlL9:iv͎u[ʠ../ V_Slmܐ .k@6*ev]ec6A>}v m_}oW vֈh Ğ$v:Klz3C+hi"G}yo7MC+ ] k˻|Z3?1~:E_z~M_~b˯.O03]M?aNQka{M7X 荖or6tzLV1kI`FJQK /'ɍO;\[:4孊yY2 5 9 UZ4 ^Q ոN"JGCё -'\΄\۱ś5u"c-ICz̶汋ٖ?$M]X{<2b!WtxI+IgnGxs4N3mxP_8X=ijQbQ[pD0GlJY)?eތJ> 1*ە{Æ 6lذaÆ 6lx g#>_Tt҆]\h>/ߒ} ݧ}R\9m;pC~_@ICQ+yd)?1ahڢW'@6\ExMu^='ƧKO{ "=wdg:ᜒҗ޿6Y)ȵd_D|Äw> r!,}59:rϘ5(W Q ˜E uoZW>u ]I-=IC1->vƲu}CYO8XA5 4 R?a!b5kZ=W0ڑPv)x5wӏc憐w9]6_,vM3y߿zF;chtt%v$%VU}ܭ/ijVm{76z=HW J/,~nC7~9ع>`;* f2-E9hz}4Lp&,uT޸C'wdn2lSײhŽ#[GOBX}^h&:;/4V@lj|N:w1޿wFgzz{9^5 1]C#ET)I^7lذaÆ 6lذaÆw||!;GP9A)zZ_Oj2-9G'Q[̏FװKJx&3@[s>r^^*b.'IHWHZ2Vs Q?دgLB.|E7$HF?D)oM־(/9=  ufu4nwnZ CJڮxCv~Ҏ?aď]NG.7[Oxq4xg~`ngp9.ɦ?iOvs?}֯kW,3GXFP农!:cNagD۪eԛ}hgWnP|i~ , -Dy}x*N##q6Y0Qym$ntWܧ`K;w2@=q8P02O|O`넞nq+d/f<36U3r'fxީToVvw<+ w);-}e-ĒpCO=/Wso7g|ti2^sz~k{w{}K 0;אZ3s{O_|bi6b1f/Ύ4.Mr.1,<|ʝ6dd?0~Dnz7ra0}?OK1w|1f6j9أωc.A@5fpl=}*v6S/w׸Y;" ^dgҾ*MuӟD쒗#چ>sjW >譀;^Kr"r  2ka6AokU OSv>֡[-s<ΩsD! 3%ڰaÆ 6lذaÆ >|~?p2p^^??EyϮO=FZLDMzp-vWϖR9Nyģ3kX F.O ;)?|aݽU i4;_2 _-k ՞k]IlT`1^F(׿*(&Hc"7$R'׭5CȽ]e3 tGMޫ֋Α%|="D_`a>d=+䝴6Q^{LgKJشAMM<_0(jӋMȷ2o\6vVH>i 4X$;NfDfmUի7Hlf~H!I34L#3ę̤!3#3Wg(#p@Q]]Uݵ/o]rH}9~"<"#ｪ]{ݏ?7zئ 2 yԯPFI(zrEҐBoJ)(^e%44ip5yB7i Dȍ[ND7hYl F FOF=d)ͨ*hd1yO#qНA'h\ȇl3yܘϮsyX޹v 8DX޽=LQfܙd8W"'+獀udVJXqvu^ k 6 #i16 q',s6 zcD/?Mdy6gSh|sxE"R=.}εtivZv䕫 xJ> ,p]mZ9.=A8y+ 2\r^'iWmSIA_/x`xM6V' VԽDz#).ۆ"V:kH de8Rv +TQ(C6bжx'EFLߡC:tСC:<vk|e4$cJ?\Tӿ{A@Gm g;XnyA!5,ƕ"@ BTXWG۠QP<1jJ쭂gWu ׮^NCTܮNt 0Ay(g2dR[o g\OU"#^}̫I>TtE*ڠ1r[x^.IM CԅԹ偨JxNGi(1AZ ꋦhA:a<P`x7&k6GT` Q`{dا,dnh>+o'nFC;²c 3\2W K6K*} A A)QVJPXiXWt'nH=4pKRl'SP10@!) 0 7JJC!niO؀- _v즙"%r ;˙;)kL4˓taK힆&s?ٓ,7aOQMNA<}dўO%! =YB-|t_=.;s홼us*o^OA޺9C~&ܝ{drs˭)/~2@}CeM8x~i~-*_yD1eA%nLCr@TN M_yv=Td(]_䙎ҋ!Cy%ʡ05`өhCRyk6 ^~rn&9 #6Ry:JUypR)B=)؈˄l56#U\9_RM}QM?.Zʔ)DiM3*i#"wСC:tСC ']^u{kPGz\CϱJ:&[`/1Nd{>S=(ӫ@YXwlxًW}|OĪ[Ä>V# |rhCJtV@*z@cѦG(Wدg"hg']n~Ó) &4&L)4eEXhX!W˷ jj s}Y|P.R5QQIp  ǰ;h9M&‚(C}f2>JLgRy(L)bg+yQEL t 6CD3q0'-U|3AXەi_L142&iv_/u% ^D H<COk]@P A#DzڔlvzB59: G΀BBo.O%3y*PQO.F"l <3 [C ʓ[#9)( (ףyJ$9 } [@Br wk*\?ؓnܗ7IL~rs*?5wnCrCˇ"W=>K| w ǸZASh?4,m!ItqcN<4[Pk%Q̯po8 KΑCK_O cwjܢىLոH=q|OzDkahp]PLux4tĺm^_GAljOOH}GYcq&P|RUocq: Lm`/eTNBn#5}v9Kp/oxS'GP\'y$O2gEDO{ryʵPn#> mPitCn/2E&!h=渮$Xs¸'u:rX'e!F:ObzQĿkI^43B_?ŕ2J2H?eZdi>HO`<Os PJDv Ю@ Ebx>(B!v,is^wP&$+_~u~$X~秸s"x4J0GSh ^עΑz^Lkgǀ6:V۹/IA;hҷJ9tBx }( vH` _",wСC:tСC{jwqLwWPʬ|uǟc ʂ'ݤuxGv'FƼW$`U's|pL}+lH}X-5DͶZ<)=8o>V^}&q}F7rrH)gBtC~& @DZcڜ/qee!sY Kpc-| yL87~h6D=K94ʇ^6MƧ~胖|&fR'߯qQ[Ȧ8h[ܬy CFN#ehQ57QpIS7UpE @Mh (܈_<ꞀR-ia#)C)Y&i"2eeO)-4ʝr2vbFs(PH¨/OnzBnZS;O @7W \&r},۹qW6d){vƤ4Wf q_?^Q#sXA24㼅$_y$)c tB,M(Xd2)!"l$O6IL]8k\'ȘC%U DmPP"nrpr}"q~-]{`P']io7pLec:E%&W/$@FA[~:־b;MSDTo.¸" (ұũcg-X'4g=g;Ý N ~`c{9(:tСC:tС#Q=߷+ trm2(vSA)މ|`TI7(Σ#uůďDb)Eq*tL,gA5 2}u/jxyWCK3_7kbܰ'k 'bs }sF1B(٫J&h岥\z (Cer:.R`)|fȳ46,F*OV*ON*Sys[Hd 9AAq=1כa>.ۙMЕB..&{w.KfͩT+M 4n[sL޹r0/\Y_n5Kak w[){4O(n°FtQ<gV ]ۓCG6D7LMα6߬M %+ "UkFFpB(`~kP[2A|/NP yoZu?nLГ&AOB*"4 F k&C)| $#_{MaE6lI/ccQvh͆NkNRҾl0$T )1ݓ! hF 4? h~&@;gJs yϦ,BOѸzn3@ϓRynk:yvw( Oo@ΎR93Le 4HIQ4Eh">Ah}7hݚ\\""o{sɝҏoBo˛w&vx3h/ri+\ܘ`/wTK*=Ihmy$k8 8lh[33A&CwF>9^|Q7uufCJ<`J@ (FӸ.c!v5b{"!7QP>f~\Mu߸'\>;o8 P㣉lzr,t4^"/)׼"?,u,r4 nUM_h4Օǡ ~} 4ymʵ0?樴/C'MM}Zi:tСC:taoec% v8>%i$qD(}VtB؆tW>,} Z>}bP<+/*13 pm>3$9gss\_4߉ē92]X"jץI~q: Nti,yy1V&ܜ=+/5!(cghv0)F̧M-nHA|4$GyEknyꚺ|$Q6hDAcPY8L$kO攈;7nh=@E}BMKSڦ F nkM,F t lFMp~#B6)A (:F<ח i3[H<#mM];#\w!OaȍTc\s;S[c+"E>'νu'7''[թ~u&?6^D~ ٽs?wryPÉ'\FNN-R}>Z,9Dh9S{$SOǓ485L̳Bi >|57mpa5t@7#@6qĹIieB唐vː`̤@ۘer6:>BWHˡ1m[\'3yL~p'7;=ynO>K@nL7|K[rs6D|(w6~)!{y*y_1GO@;O|ya&yq )Cs|Zߢ-$BNA< eM3 y\; !I}hz<#E89(C|CTu' Lh|lBEF V ē@oEZP1X<$10+7C;k=%-(,tP_"f|jk߉ nbIů5jO'-TLm*yZlk[4^>*xGQՁ*=24؊i]B-R1ѱeCiQLJrr'@cqȐ~kz R 8su9fC:tСC:tQw--y\U!?~6Q2AO~Xφ 3@b'zٵ>'np(cQ"6QxHaGCRS'aq 4ѣA-G ׺JدX|.N\3.CxPI\WXhXeKf r:xG U\7W[>s.lbN n, oi[W$eh T'dlSnАs <`+3s  Ns!EI#O n 4:2r4$ir}ҲBې6C'%PH>-S4tÆI9CPpPvv@B4 Φ0s"{n_.&rT*0<ݗgAϝ2z剭˩ ؂ )))k95$E.D>|}/G7yZƁ|}yꞼ~P^d:]97n姷fsw.|9&=ʵ|$@<9^Ƚ,&r4kLu&/>|&4|b.@=|{)m*i Bk@:/c8,*=8A~} zq>9⺡&mfmOľ9#_޸tTFuBpd+X:tСC/M.I7D!B>L%%P>ƽ?` -Q\ {z,,UE[]ʌMΫܳ3(i?%}\SJIM݀ȇޞ֯_l~ȿ|\mybo; n۫\H6Cד ^w& BՐD7Mqa^YFnB6,A+'UPx0$s(xU=I 4˩ d}}5 fz.*?!zkHnB!}nn| !ivL)AO;~$PO `Q"͓:F!tdl+Jhؗt0 y t 1xgWaӰܟMmj8W>>Hc XrsmmQ}E Ywi9?Z L;196+Q+c̲, pjESrZ 6|4fpsLmD;ݫrqkS^~nW>$(?y1g>t 75o_K| ]Wa`!Amlsvx۲ KCBA1,X>m2oɌ b|0=q.k|eZu!޳ B7Ѿߣ0td>=fM30DU6^EEoA.mk=:I#9uVj8,*CڎU]biПH hJ[ }Pux}z`D;vv̳c cR:tСC:t 'x ~?".pL-`'~t1m;hm8M>'`j+8eP3RP"lׄ|vJG4#̬Vgoҧ 6nLႽƥ2rNV޼ ޑm93m &΅3l:M؜Iݶ<ʂ&E*BH_ρ9` R.6H㚆/H:W-$-.*msqúـ:uDQ5iЅ$IEWzRL)E3|IyB60Ap_k#G!{( ə$:"~&2Lvr:( y$\V.n /w̎ȋgSy7rvc('6}7)4&#/ yN.o޼ˏoksyTwP{iOJ&?[צ͙{k.䣽L.\`fH&qL MP*ƈ~40ΓIe)46d# | ڡR=EOaHJ8uBM>VZIpak?(iK]ƍTUiq>QtՐ8(ĿY/G!N|_Y>>P+_UJCj+A^[Wa5bygʀ?8)1:82:_ ~>7k~zr|eTHVNnx50D8 y>X?xvXl>~q_0}<egXQ:P_JPg:ӭ`~$S)5]C[^jסC:tСC:|*X^NE̚:YB,i%5c"EB`6~k5c^Pŏ{ :ƺ5В(rz)܃OAQ,? hgٵOnt:D<4^V3s#օ tB>W֬)stMԞA~UmVݎ@` o9zµ;y0e{v',{ru@߿1oL&X~tc"?5-|/rXn?[3s0\f 9Yx&؝;DO qT x”no7b81<ڨ05j)$dP׊rmK e)+0 b?@~;XJY[bIuG4q[2i(17-iɰI7Tܘ1_"+b:iHRK= Ms7 ߴ4?mq7SGUc*JYhQbr"+tui=탽PO}U5q'փ֕kADZ[G,kA}ECD^ #Z-O|P@zy3+6ٮZ@:Tqo9Xw-VPO˭KӑO:tСC:tС/>7x{O. %꺗@^(4VpqqlKFH}=.X@С.1:"EBbRH{N ٣*S&D˜O nfVpC6W$uea"6M(%K33 9nؠa#Qx16r3䇽)=(K:N" ay4á=Y0P]$G l8` xRFNno&eL.g{ r.O L٭D^mn*/ g3#y#yH;5gvD}1Jd4Ld0H$2CW{LNϸF:/}-ne\z4\?P3y\~t{&oܛ˛Qv/I*NSx6\Frc)z[&T f|5J(S9x7ڢ~2M K1Hׄ6G0m;Vp"xz#{y TvTU /GP&&G+넏 z6{6~Tٍi#H+㲉X\Y>#ccЩDtСC:tСC?{@Im0P#ZnE0{~C۳lsUZWނ畠X(|6']׏R6y-\rŢr{QߡCf蜥 _wtb^qY(P\+R M}rFM+Y~Ua1q-a*x:ՏXFO@i & nzH=#b^ ma>ӾǍWeaF j N|M }" &Fih|%% AvӾ $Zd Ál# 3i*gC|&Bz&\Z|ȝ'7"ק=<'"'E~v_ͻ L~t3_]]>!MW'S񍩼u{*o=4}h"4+@Tnort?2 ~/{>| = 4A?yO7o9F4C5F/ _ p#$IqSQDk`a'PQAqWTTk#meb46X.q>Q",ib]sctԏˈkBy: 7[sAp|Ye4s)]ꄏ P{ ?EZ NG/ڹʰ\;ݺ:#S]3N%20'ar7-ChD?Qe} |>\azM]!3p5׍2:v"|DDMфv ZgCI1e4?P;_ 9fn!1ͺ.ߨ*V~4MBN@W yu=Eߒ!ցdu8J8!"l#겜O;NyD %Gp Q C!^\0ΧMmOllkN@'xX/݇by=]&crmd!䇼"^|:E2J`~Mxl:tСC:tYÂJx9jD?c8iS?Zo/t}2*Xׄ?oPͫeF(B/Cf82HqɅJf( esLxј*SŠ||v\+2F_=0g!. 97p bm Mr 8Z.:f 5үH8O7K %G7opFd8q6oh5X@iz6o V 47R1ٶ%Eeq#/(?'w_Y'r2!1+W8 HC LNN3939s&h;Dy4^Kyi/_˗i/;5gNiğI䉭DNoew'ÞCP%ؐw.7=7=q(r@=2 d&߽:\ȫA~r ?ޜOn\޺;sGT>S8%8qstmMm}edy 9ΕX6 <,x " }5G4G>O`Ij\1^]A $ J]ЁN!i)_,GY.Ud((,C TSmbAY'TGW:钒ΧLERFC \<kE,GU[uަ6 }nRbDu\AL ud$KXR9(dh Tt~PM!`P#7ٱR,xBX3Q񛵀 4k gND,#"2KrB견,ɿ<Qe'OϋI١NUN6mu[Ȍ*s"t*xD\:m+M'p_p.UL@|:례b4:}p4WtpR66СC:tСCc6 y{zԶQϋ8ɫS@q9}~ j ǀ+ G|6@I >5Eq2 SaCm"Щ  $)]-^Q^| ,mD_Y`IGUժ%`ѸX=SXψ)fC2%:)VQ>rXf+FY9xPSMc L9<^f\_O޾O~62iưHiR2pSutsS̯N+BS0xc,ºCK$EIzJ|)S N3"٨'(QmMiu=16|(Ɂȇ|ɞv;ܜʷW[?8WHDL}k.L޻G||eظ9ͬZm]h}ⲏC_v݇ %p6V@^^:D#$\ 3L|.4|*ː|k4 Upppa1(*zOB.qBGwqW YA}I7G^2%cIrz&~Yi>EWY_7g0mM8Mi%јNQ{)&ubBm镤Y8DIM}+*2XWfI9kTSPoneUˑWIy3MkרA7PB# ^d $-P.ϐ|VCy#L׺}kB~5=Sr>|Xp}GuMtl&*Y _eWSSɋqk^t>) Z[o!g1\+Mc>m*ANbRk_Ae&ԥy@=`C:tСC:t޳ԂUG?CQGzG_EMGi+Hwk5qYƝNJ6-(u2@aa#䙯|+[ ņ6@G4mz>5<?V#[4Hq)qKZ\岝KpA(eDK %$Y!3,W颴KX%1!C7C {$7kMh.e4"e\c'(M#Ϻ% |d!nB`0RkEH|_cr%u& {r(xzp!<§6 蹭L.dB7]pC#"/-4CWO܀-fОpM'h@|!htu:  nxț7D~չ|T^3>ړo~/_:?> ݜkfsy~.?f|0O}N{ {P3zb?cO5o>ֱBz$$"T.iݔ8p̄ǹL!w.ӆ/CɄtXLk~HkH8UQe6`}zr񫫭V9eyXUZzh#W@{8 Om=˰@Sm; _ۄi"m@&^dv%V=bUYJqVCk}̿ 25~%J^(wTrM>lVGSBL0n1_BZw\Y^R:|>+X:tСC/M.IG" |`˕&g9ļG%=O2a=rXNx"ʌ \}j8|Uy5 \as u _oCb?D(GQgaqn#1]HUxk J@Su>|iWAE_.fSN Gpȑg\X:WazO$ AeO)>ox{@6Ϻi~pC%U'!]=ma+˧C{^.S _?r34TCH cdyNRL6g=Q]Yc `Pӆ5/i UHP!FC า#j:ȡy q_CInH2fca,ꏃ^s T|1XA8laڵXs4ENsL3 i"(kf"fnJof2q K|iy\?2 '#Ct1 :he!"1eQ`e]QÌE]g=P a~AV'lȉ5s-ʇh¨2yq'|?-DAQa0eY!˯ q ~ņm)E%_z>fXw@q_Mtb+ȚAGLWfw|~ ]|<:\=KkJ:-AؠHHs4_C3g2Sz )32#7d3д F ?L3. trgKD?'L4 < |= _SS"_9#Kgٞ|TP|nCt~S  yt"<ȹPR9Añ.Cm g"STDX֤'g=/=_ry|fc==O7?9WkwP^9',#('Mؒ VOAFr۔qoCƋTL"B&\Cc%92ALs PXwmQx 3' `QF)8ݔ vF>qs&-Vmm!JytR}SNY#Q3Se׹^%T&er DJ* >t 8Jˇ2C MX9:t*EO 0iEo"ՁT"IaQ/Hy s,q:xK^W<!NYq7+B(EC%o)hsdV-":?0z@/ >C;#Zk`ňeh7k#趠,{8*ˀh9[C:tСC:tX W?нa>kXgLƬz+mg ysboФ?}+mxL\eP_$@9ϧ 6QS3tktYpe\/ Q\X99|h U 5AOqiHzܜai =4S a|!hd4/d# 4M(A|n/JFt429S<9@?'ә\ffO.nYs=y~//NJ_} _kn"/$©D9(ʝӧPڀpGmΘf"{ݚ\\9@}Awsyv&߻ɫ7r3зeu|D|Xye"vm&;}@~tO4| WCl˭h(P?{蕻= r}GE %K 2x"7p= ]<ŃCX_BP8z~B:O_Ezz$tۇڷ2djI/#߼׵n4X${XGײa{փ~ zPh+ GX>\!| `sQkcDPNCNOgAZ疪qre1j-{ r0U;Q717bTCw"OJ׀6*4)yf;Fg쯇Êv Y [ W, ɫKסP6’ڪl˝lc{Nvw!9 TO>> d`~#ê}}Dj;u;o=8>hm5d]N_$ x=b :tСC:ts}D=MuujKϿd 6=5혨<9 t?C>z{پ/OiG_#{l}l45yNW>w8r~1qrWl+@h^Ҟ㼮 v(I>;!D_+9buG3DFHo:!MAƍ!j?:iT򞀮0$BSPtg"́< ;CyP^<3@_8,<{@&ݾ\["6ENo$ ]#"ԟdo*rg&r񻳞ܜ/潅BO΍LZ&3j&\+gGWʕ|T}m*߽5oG2ys'o|4'\Z!7 @H&rgrt/ e9 mm?*sLB!B~X n3IQj6xJ8OՀ%нn6aoő1-c![-|aXw`pd7:@賩R7}D6P|bǸ}HA|m:04ڠo ϐTd`Qw)CVmSF0/+zz3k(l%$嚨 6~m\|%>zy"=5BX;.&^ kD:uu{<&Q'GV[z<?t!D@ҏ%_t񎪉:\y29 =.; dm EGը¯ }mOf©i?]1À:HyN-,SeLv,OE NC:tСC:t8ppo}~rO.`| XGG]"PcX'eWC'TdM!p̐8)z8ڏ-3WE'I _k5nҼ^:=`=Kk0өCcbYX/U7I y@S.jUsx@_d C'/'۴aFx _u}7f !CP(3l2my"@Q'gG}9 |]&F*qs@^ L5©|čPqssH?ө\؁.ك ݡS4`>-=w56t wB~t-^fՉ|T~ybtq7#ͩ|Luw&߾?W"ߝ{Tޘ%'d=0'y"W\WCݜq/OeC4Y$2cz~&h璡tKxl?1zi)㧲Q&9hA3Gl 7q(:fi}"Cp s| _o'uJ{7pr{^7X۳~q9C%~cnDU3D.P^\W exyP;j nJYʫ{QuSBNlcC ,@cvyhGgG `Fi1S⺏޷b.뢐W py/~rb ;uq2y>>) 2ݩKB1QovM ;7-eUU`.Q?Y_é4 ̵̊|+n FCC=P4ئ7PpF l]>xHSe tpDf̦L /&VsH! ȚI}W է^ovQS k js^>|<'׹c?(Ǣ,ߦ[#KPn? KQQjH4 #+1Iߠ| |1Q_K;"{qB:tW^ :tСC_\kO$Sd8ڽ6UVJ; <+!>Sve~gn^lͤ1ߤՖfP1`Xd'}PHSԿP딭,TClQ=]Ǿ)uԒp\zdEq%0 1,|T(bZ& 9\e;#?Ӳg.H&gYNQaԚD2q5nuǞ1:-D "5t-ԌַBOY`$k+J.Qڪæ-\at΂CMS#*Y^% >Lp(P\\aWsAl\/&v&86>{{|uOw[&>Ǔ悎?WmƩ_\6$=F>1Xe=t5y>7(Cךa!7z-َB>OmFʙ!$%w yOnHȇ=~ey.$L_t[X9fҀOCgCpt,Mlj~dyLfhGdG)`6  ǿlp| ~0,xd%(~qc|@612&iH1}E+z"T2$Q6`To9yC{!51wxt7Az 8)x*jWZ5JB#^f5h X,c9/KOS(f~<1~cۢ7&ei&SV7RR{rG˫䳾nKBn<\tC i8|k;W䅳;{W%+0O՗Enl㗾DhHp\!JPĘYB`fXeqM{9^Ӆm|_ ۴"?AGqʇ uWM'ܯ yk`~Y W3˺AFKyoCGEiڌL:\c5[,* y :ď7ѺAwk ΁ @Q<5R;j+B-N8.*^E'q90?8 IC'ǐ2W#{[YcFcLlET|!xH{qV|Ř/&m[FP^>K7:uo_*5jy/"ļ:tСC:t#<;>x΍s~tE˟Be\@o!'~K Nŭ0$Ɵzڡ"FuP9[24>ƣC!}fj6,*Yjj3Qv2E#|]tr2rY@IuZslZam(xTd`&n`؀Iȡq۫kϘ۞AsIX)[>i'0mkBd@,t q G|ZΡ .}zsIz3 T.gKd>%X^K똩`HkC`er2$~_7pMt8`7po  -1k˓3 IzAxe. D<3a,zVh'/J|\"_>ۗ/N \=ٓ'7EA)߆ ==)I(>&1*xS"=wn|w|_s2o^O?ɟ|<2o\Lv{=y^.1[+^ʇ@>\Y &w{Croޗxޓ ?-7p9{q1G%f$7:&CLj륺4@:M 7 ]>S[? 1t3/`dFD =hh$yg ȍ*Lس^l9:&Qf.(f#BnryG4I?EPaY^Uߕ巃ŵmTk0+C]sl|f ]J^ nsYgAj j WSAA?opjG(?930vus֖gG:7|PԔqO+b2]F6Ƽ$br[YNDYڪs &`Y p_T_D $eT.:Za$ı4y @>0tRJ՟8O3|fD| ƹnkӍG^eq ԑX>=UP ԥ&cjiB빊р6~4Su`A x< hw,!yQ YLR$灊:&:v}%ZE~:tСC:tСC^z{=qep.B"/-@n#f%3I> wRYDaL+Tȯ@P^BΩZ-4v]~'?(TdXWam &!p:nȫ ~g ^61t9D}:sy$mq(tB݄/7܃s1?DM=;Ye572nFM̃g,SEdHԘAWIfeؐD1FeFS">`md0]U<Aٗ|'e,k P_P+`4QA.LpUUJ!ա6ͮ;BuO`6D:gTo٫ 6>t`<F/Z|M ;(thf:!47&ئvb]ܦ7z*}X{z;~(ltX@9uT%5ɪ3H_gp76~<wr;qp2)ۢ>jAS-QB#4Ț6%['/F'E8\Mh)wޡC:tСC:o3y r/ZQ[QxyrLrREp xq/i#~=lBcN$uzhcЂ\cF5hٍ@KuWfXJ]FOG "9P=XVِxxM;. u~dW>T:޹;VCdJHs5 |n#+ B@|i"[I"#&^tS$h)5ď$3ȹBryrG y/n䥝Dtzhtf tg 'O @|||OtN䥳"F_ man?pt>ɕÞ|gm~pG5^浅|Jȿz#81c'r,p.h0/`n&هLOt_!fy4(C9ϡ>EHG"2)䷁㏛0|>.F|+Tymi x7ɑ2|F+Ś[oBEPDł+_ce%2Pb\9U㤀۳dS@T 5vRFmT K,_eH(nNB&uU/OIL0nGeB"S1Jr8nqrhW(\Bq="md`16E}MWk?ZԓgE"дwރBT.taO4+M4*mzbpيd3 eowIiR]i67BeTUC:0T^r@6/>ZhjJ{Qo㘇8릻BF.2==ΰ:X;\n +(b>{Y2B`uK; ]ޑtsW^y%:tСC:txp\~krwH: xZ}48k!&!M⭫mxg7>8j܆]\ g Ѥm*D: Cz٣Ӹ#}`|ƽbv4VQFU}ǹFl7cUx%~.=$a2Xܑ=;_=#sI Ldr͇B٦q_F'hQPҘr?zP]<֤&Xh6PuKw%FM%p6]P76T7w8|@bu 7@& 6Ñ85?)!i]uʅq'jW Ls}Q"vadIȿ@܁?`,W;COEƠ tms|N_~2v?<u@ | Uɍkfu%Ǵ!2M/O'Ŧ)\ OƈC$||!`i`kFa|{p?=Μ\_mPy:/ԷX/q]y]wºm}ҡ¬n]Fy!rG'm- gX "w nR:cPZ)˾%|c?aS[(嵳p2CEzF/ˋvg_?Op։>(##P1m|N>ln 6wK6b5._ #huLȯԙ>Xt4~c_nJbXw:#B hnv*mByk=ga9Cȏ&_mOohlzh>*E"4t#@Z:jn@h1)N ʬ# UoNGA14 KE\!"Fq݄8Q#^+z쏅Rj󫡍:tСC:tСCpo߂=2ʴ#ܗr,LQʻeyױ%:Ej' ׁjBEQkTP=*9FJC=5h*ըHD7F'D*G5)8DhHJZt7~q!B*ǣOp@ [kX@JPM j{@ b'V maOrij'sP7@ld ɭŌ+Ď)E1EEO@F]⿗mB~w/Ϝy n2E-pP _ں7PSK|-}ov&߿wg'Sƥ|7r _rO[{syme,C{SҤ/?%՗}~|"ˈ_{rCo n#~:eɤ7 dTf=_{mlq2C1$t =Isx,eC.4Mu#g2C[Zv"T ڃ!,ɒ>:Dj(1C&HNWLZw 2TE~Y9:$N,6_P_zx]`%&b}NF-ɾ}AZZ_1in'ǧ3'Ø7kèA S{:*◹B4ԔD3N:tСC:tСÃ"ޖ(y?U<NMM66Ty@>8HD^Wq6}aD6C >(2Bߖ\l:몽b4]q+o q&[c qVl3i _@vR~XP]g*ס.&>Po0Q%B{oO|{q%ĵ qK/x 7bA[x 7$V|E4I|?ѷQJ7ad3T/@H,Oӈ+ {;Zz]+&LkeXѶ+Їo)|y LH6Mrm _(1mrk"to!ows\^7o啫3W/!}+onO(|{ʫ6ʷ*}<[YOb | js7[oy_nGn$v{h=w?+O2mY䎔TQ4,GXJS9gԀӇy>C9C7Z+$rܸPP4DN@Yiq>}XZtef^QZ6.fZ2Ԣui 72 BG W Y ԟ>hfTL[Wڍ7-U2C &#LWWֲo Q13R'50αɨ~8 C'2<Bp4}ke vY'91\i8$7ߐP} iTNK+"T.Fo ]lF\oU z\&vZ"|@~}+ /9%Mce.a Mc:tСC:tСC#">x0toIB>ep~BI5w**uC"1LMh ٨[CZGXLu4g1B IZhuGb{|GכтݸqAbGf ZkϸiBE6+[]zꄱ {f$.# bi&81˘<BWȃVKs|:);@S1ju1-v˅$g\/{@!7ndrac.Onp"Or\ȹݞ^%Y̋-%V.AH*bd\Ld!Ws4L޺OG3yTTui&߸<_߀L'7W[s;|wzAO~0I凳Tޘ ~<țH9K-6ObC-r-q<ܚ?#9_җZJ{d׼x p8lT6,tx Bs`o>B0IǍEyB_z94f5 _MALMs"1Hq:er8XV7!b<73<~2FtAnvX`@9W%eHfb¿Gu[늊>ҾHEAn-V:qR ?IKUvǢy֗7+ӭhTS,"8ui}\SwC>Ui/t3]GO\/ ǨcزJRe;B?zNZ@Q!W'? ӎ8~RlC̏E튴nrz˒BقV؁vbx5M @oV8WLZy(ܶ7X?u@6ٕ ǂ%n8:1F2ْ_ĺc[D:冶)41گކy#WAtQC5~8]KTk}trӊW>~СC:tСC"ߖޓE+9'Ö*~_^G}.P*O{\ 2u=䷸w73ȟQ?z,eZuKへp>4_>Q_ZfyRt5X&.G^Ou_W~C<%*XϋdhAD=&DCmpUA|q_G#B1vޮuԯ:Nr^Qh+(gyM I;:LY1P50|Ufdu_$|crRb!;6E8L䋃|1Yȗ\~i(/LK;.33LDO^:}yl*[iI!|It7k$!π^hݙL>۷3ɭTwe*߹r(^ׯL߀*D~m*߸>o^7![S6B^}y}<q*oMh>g#yw>Ae$eռ/7P;Ԙ2F2E||$W@mL7eV?Z[lq\ v}|0ye)!^%Y}vc];(}Th]g],yt<#@OhDhԋɤ O_>ܾM>y9 2ebQGœ6h+ $_ =Գ]>+L BeT ' W%{"W;AM}^>ZżU~5(?j_!\a!VeyWe9z~XO_zHF&/Cm?\3݋6eBFg\P4V'"] 6!O 6X'Q XhS)^ 6_ |ҟ32;@n,ʇ'pxZ2oP >űƏriL/O^EUclƜE\fe9o:=hh#9VquVŏ:B~J!e`?%RM8)2ꪏHnzءC:tСC:<*S~4g)]3jżXN^>h<S & m hL1x Ҷ( @j:yu;G R4h6Ur ,Xf?󁟹SDɵX%*ϯ qrD9*=0K"i"),},$O19qy$.J!J]TB,bz6{eL'cy2Ӄ<;E7DՓ_[}Ku;/o h!y+=_;8ӗr.zt~ _{/_WI+O:ח_ȯlw(_TJ{ Ju< ١6"~N\tD7e\G[yN&o~*oN74ے+y[l(C7O@n,R }`~/1|g+OC{f 2-бz f74n2N`A/BO }n q#%d3XXƓ9L|&9[ 4N|!s3U]꤭/h¢1tg1 Wyi.˸n 3A7N'?<>k&A7AvZB2b ."/$FCG"&j(^r _pjeW^<]`f6Jb3f2Ogۓ)IJA tž#TfX)4!}yܻ̍#  Ju?* A6rPˮ9PWc*X zC*CvpV~TAD?ϫkqŤ-vH=^w= W 8xś*~ ٲM jg<ǐvO\[K/z4] F"uN ouɋ(ΫQ&I@PH8f{>=zߡC:tСC:qaOd]425݅M@o@qʓX!q?y 2}kAxY5@q~ +UD=.ln"gBlllISIQ7n*Vfد.Dc.UAyY \ N;bd,d؛00pFh1 d LT.T2g3ya0~qWFsK"y{B3rխL~m;_=';~R䯞OoߐĆ7$_zvO=ٓiLۣE_E"/y"y_=??5D_*sjccKQs|L@_G↌ r>OC(Ky JZx-t.{2 6 ݠAX Bvk4@YG?k mD$mcd8^M{Oӄ-`H<@O"Oǯ{3^pzW?ez nn@@ 23Gf`N? )7 d?kX67U ˥K É?>!D Ch{nؘC[. ݠœU8 u>'1D z ;s;5NV,Vu~7[:iu"b^x೾ˁ$63?tY."~C E 9fyJo1VPT( u~khAS9$G~,? pQu1_ @ NYYuǂW$69E)Q]k ׉mOFƋg舯cbBh2[2j-Fmt$ƶ`+r^+5x}x-6Xf JTmMN Ii`?\uСC:tСC&ָQ+xh~jp9B˓/xy!# x}t< 9%#=Ժw{cE7=>h0|*;y&$3O@ׅD$g<7E^K["/o|i08˯nv_~s/_=՗N巶{DN gs'Wo=Eo~I_9{%f_)Ѕ&Q u:DxtT飙;9=ѽ|,7gr=FT7CpslS~dg=KPTҿ-74 8 k_19g/{?PRP<2=fFax$ ]4 x e%|o\@nHLP4%C ^7k)S |-8 '|϶#^[:>LMy#*kDdN@뱯u P ؊mi񬌕/e 5X#--;+Ca-Rb 5:VsFI&"E,f i@amx6 _BkDRatbJ1@Y~E0*k׊Wa\]u@L;(]Mg2 "~]G_QKC[sh+ rUAzoGqczL8C*w " …n .y ^ >M~7s.7@Pgr+h?֚%? LWj˿f[IԍPdYXrcnkxyj-V~Bu+zpc2DTKTH3Q"G܃1$e@qGסC ^yСC:tqɳEґ,}|ͥ3ܗ^ϯ> .aq{g Ukex]9/.p y]A'#XG=&1(ua^N񩞱L.C< DBQ_;F_ mS_ ʐ.&ϋE*⥝> cO"{$gS.ߑfO|d<?{nx=ML>=;}0nݔ^Ef_ (?<-@)MT((ShLA.ZE}&8E@n2ĘHI!O@rGS)7[^7߆?[JQ!l Gdb|" E@l!3@4Cin ۇCKF x80I_7FL(Ԃdstu +_A!>ɫ6e?eT 8f& e'wmw^Zo|a:9'|U䖼?-|wGI|)&t ?i'C`l?@k-vE>7}K~.9_ H HjsŴ A_IecVPR¡.psQ''A xB-&E{OYmqdP/1䂹b> ƽKڥi T,N= ~׶) c'0pCڇ~"PZ3;,}bFho(!Q5PDR7QVEB }k kXOϪz2RTdF X>6GI r]g}J*% 'Jژ+"`Ѣ 8P(|r ⫩|JS{.Hiy\e~& NP0nE2"ֺZ!:Ik]Q/]Ř^ZeO(&MO3׾#O䊌ﾨYܡ<׿3Y:x𽮻SZV ,r!6P7(v불&^\JbR~ uiU~ n e*6@qtS!rA]0xE^~Jхɼ} ;5`kEE.-+hwY(bi3I@%RJ~w5AsX/5`_FOt#~yĈ~U[xVuԑpA=n/ *aS?qx&FfE<9]8Fs]Z&;kL,T-/x|!_κ :|mСC:t08"G')$Azpw *Z֟fVTGs[(*xu|ƕe9CSn"ȚRx K"#TIK@j T+u'TAMqDЫY,Ex(]E+_g,$m=\7pL%yb$@?ߑwfd<:jM|TTn¢a #5 x /GqǺƴTaiMί\,.14bEksb$rsNjףbH.))K,.q18B}. Pn2ѽQ7c`BeUfFq2[rIje@ \xr(w"ppK_$>=dP؜ov }Orڃ VBgrw2{froƅ?ꐠT^B%z~C)4\ 9@kgwnmd<s%tǾ6.XMV"|y;+=/~|]ޝoM|w$}͹j`% уz2 m Ka(_nd&P>w5zC1J]wUю ȶVc] +'\>І!6S?u. 7c 7A@O&'Vm$8'&P'  q0"B;˳:e7p-בQ;M#C9 oV-H)OQ>: 9@ߠBPٰ1r<@M96X;6A?AG7P^ ?!tq<5=*cZWc)$h6ڶPBQM,FQ `v j`Lۮq6خSY//C% 63QU%oy 11~vE^W?#?z/?cݸްqPРl)\DU8/Qׁ}Z-g1ZH0p4ז% }i/E=Ek:$@%m#Ebs4dž_ E]=C1:q<ҩ@"@孳|uEJe,˸\]Ci:FzaGNYB)Qpg My&<-5#GFձH2TN#P^!M;b?8&dkb.S{xu^*PI' cBx|[$q[cۆQ Ui؇|`FC(T.gED2jz+@ yC :tСC&{8$&4C7t0zː7;ˇCI gYU9V +íoP3( P/ >}}9G:DhCѾ_&z<]t(؈CehBe#rP:NߑTvJ}ْ䛻9ֽQ6eK!Xe;!k;c>CF6GaK 5 k؉0iT"0.8u¯HQ <9'@ekD9>> Щ*!|9R1cBJ |$="ҺAPd @y'iþlţ2 1r1^ [<0oiZ .ess8<-COŻ?`i.YO.;@p!x><ד8rA  _HcGFzC>璹'] {(O|F*=X81SJt~շqܠ}w{;/ar_RW~|Wηq@W,'8$2MPTy>>!BR@iCkT^fȍE|D&@x 0q%@პڎ'Upl. &} @vTr !& 汞/oqt!=t nU nY_t @7s& lnTaƕPui Cy ! >O >jƔ %?1|E8O ҆^YŒ?ڧq}:XdTqMu=\_e*Z<ˆҢ4=,idPH1#~|MXElkjrs0ί>𳱎Dʍ;)>_z9E|{+;g GEn\řeٮzoBi _ƫ.i/Y.d,Pb3H9n\C\gB2^mN*M4SbxD1sQuu1M.u%OM=o<2k)hX"*KD.h?lzsF^GOGx wr$HYQ+ߦlgiƉ5oC#\Xp]MUMEu%61~3Dٛf]%A`]^ۿW6$0soEocۆ|Ԇǂm(АOfKpmW/|>Z UyaPmtqC# :tСC&7pp/6p'}!~mh~W9 [YXla6e/t<cY"J6Z˯~nS+\gTo^("L>!>Rqi4 (8Hü҃ |39P/B_+ɾș-~$?<+hG|&9xO^nnREoI@˩^P (ԥ1c?#f@f}uls428BruGW@22_rTu!r!CM}l!Ĺ̍B)My" ex_eQ'(qM̕|= D L<9i} 㰁@7p]!XN438eCnPlX }8}7h,TY&{r;y^*cXf6c3nDž՛9 [S.C#u^ ~9巿Г~U} oޓ; *v>梅W\E?eQBu=%P׻$2,oUqb^k ɓ%Jin4q IzO %z LSc0z9^zk0BGAՍ L AM >[76E6(joMVnM̵$Ln`!FB)O4!hazɲlK2;Jnr7hFm6EOQ;L"6[1cESlC+\[FHUtGm)cDġjoTa=MmC\>.u~1a}| ?9efpO"Ku=:/__=)/=+o]'+u#l, gHj{|YN ;]VXO8B=Ƌ@^BES gQA8 4hC}xMPn9HJ  7eKDixd85<$X \aBd'y~Ce U MEzEV<hU}&&Wp^tUﱼe^)Ӧ J=VaUwÀ&GIVm57B{%e]Q8Ap5BWy/sjC :tСC&l I}i4]C5$l ֗p+T g5`SG)驱QBUgdo׋(!Y&c8NNDÐoJ*}mlj1 fyHPe mcn}ڎ ;)>`S_%`8cT3TdW TJ6Ԉyb ~Ɔ)_yy K20ПlEQɪL1+NLiYDzaa͵sbÅֳ'3~9l,,|c(|=Nsa3mP6 #[r<]8NtFQ- 7n w=6Oד<Hq$w:\LJ9dr1x7^94 Kucdp"GrTڞ d/,pJyā4^3G}ݗy>7_@1>@i&=G-kC7m_nP8ޜm%}0G6pPVS'3G.tUP:wo#i_$aliqWmF%]ćIzy#`r{tZlӁ韣ϸn| O4i`uSS"tCtk~Q[gr?m!`\CTs'p^ӎ< ҖV4M#2m2YA v!k_-aP\C}b&?H]F,]$AnTc}UrC(Ǹо?|l°!6h&`9CuL1A>^^ב<1,93#6G?x 1LOy,o(Jh6p-P,A @Ok(t0#*B @qEKp=m`˄X*y&hUfKD^ه캉X>Gx$8WI@5UK:7cuW=/M:rf]4_UF(82d(wV5ɪ&bXzӄ\q}G4y.iX&B6ptDC:tСÄmJqn8pZ uw:Y oya5rRYqk 3jf1B5"z2 2e(PDCA߂g0KC ~wEL?Nm9B!f,~gH*bN8Ce!YeBT5g9Fџ.0Dtvdc69=P]W4DP(¡zbӎTMk|yE8zYIZ8~YafR,ȡ CL_KfYt hY t ?y+~bE% e|E=TAĹ(;H,M!kI_1L& 71m Qړ <@C q>p@#܏h\Hטp`0>a8[xח'dr8IC9{(Ǔ62̵͛ `s@;X5y2: Fb*BDO94<Ӯ}I1n˅}O+t_rG|P&16IoP7RIċ _JޯтPIo$oޗO7tǘ8Y _?4LJ* OPۈ]7}`Q/sI1xs J^G~!ГBKz"9L5x\bS i}7IQ[sۄu9Z8ʢ'/4O.-~*Q#}&2bKy%NnrGa|QE 3 ։L#4 ߴ(@Mm dxM ױHU_ІѨ><n~Uų >>2ycZ%!#EݝKP@kLe >,ɐ/"=['ꈐrZ %-Lqca,b#9l<߾9rK7eqd'ph"4.F4iE[ zM׃ vʲ|("Tw.mXm*@J;-*zi퓇kH7׀Ju8/mrmz)הW>:D[q\h+ª-d:nPVCC '|XYǺpuyq&ײqyɀ&G[:VS~1X,DlsE C-`$Rg ^ZAC# :tСC&tǿ1P7pU7hxڴߑgwٌآ!5賂>2v+@ȋQ~l_e >d!s~Wt-?ArS{cj Bd2؄{3ʗYpCWdp64ɮ4:Ѷ0%<}ӕ,FN/9(u5Qn>5dCLaSٚ<*&kĨʆ確x,PlGy |큞zOH\kMN癜[d`8H W ! e Շ8>.0GeKcL9OeH*6]yc HY&L_m2'p0ZD?:V)!{mWR BE&lL_ Ј_HmCת.OrD}Dfʿ*u#=|1!o G 7}}Ձ,=B c\Q7mkS4*Q^_0T}rH5) Q-I"Oĕ!=iS;*BJX;j<c rP} ?0](dh9:z̊C?@5d6c #ts*R̡ 7p7CUTlL4ihɠ'wݐ&wroe(uakn0>FӁ~`gEm8캨0ʧ~Ѵf==A7JmPS ? 6ㅵŸU:>ħ#Wɓl2*zx{|hg[9nUajvzAh/y*CwS6lCNSI%?H(SSƫ}ǁ>nPl 5e,Ҏ5VS~CC,Q]\s‡U9_yt 6 ϥm6pt9CC:tСDcNHKͩnHCHO;Q&Ր2 Bi ~>x㳌Wf/b(~߭v)lRA%~j<]0a@Mkq6%(!Q{FVوQGB-Lc=G?^8|,N# I.#G%o?o'prn_^otѦ:690KO5 U)tp+~b!nf-J\Z[Yͪ頇9]?4qӇwrDxz#M|F1Ht_Wp=/ۘa'il0i 6P1xe6l` @7pOѠ^ܨ8݆M:,ke0ݐA3!in؟쁱\}}d"YX\\$17vs=Ex۶d}Xx=7Թ FF#(s)YC2a[4(=, EBec7+K9A&(oy 7RlCb0M mXB!CltH҉Ł=<}qx&}8pq~y>_a)+3΍l}ԙJJ&`}xρ/gWa-nޚU>oi'Tsk-K6S;q&cP>T\֕ӻ'M=7N?Vo,ȴa(+C !ӭSٸ~ZhC (yݺAFwkL 0>mXe Kuaٛwsg* ucPF:mWCvBϹ~[ӭ~PC%clmWS m>mpHC+>`_**zDc SDϑO T$# St<n$I*4Bq?|it~MT|rlx`*}V?-'0[mJDL% h$SWlku nHl@>1УR6~mNgg gi&2Nt:S gMOd_a0]ӤsdJ|#Y{\gWǼ=m]*oY jEA\ʸv21 z=sn!]qO; U`5J1B;2 H. &hK ozkp7Ѩۢ`;zV涷eoc_ؾ%XuFУŞ7;pč6DeUQh̍0p)n߇ttרxY}K5ՃD@{xI52BIfS< {zG]]vdj!p&9ЭF ܦNE[-cK[7J8W[f{*M؁?~t>#uY JV&ǟwox]Nf)ec r;Sː\ -۫@99 "ŹL)*-f,Y6 ;W>IיHpƘ..Y: e˯-Ču:;Itw&-3'Eߩ<&30meIRr4a'NJsɖvRf k~ 9 R W+]썫tyr!bi›~5x8Fnq?IDAT}Je n%x̆e *5<ڔR2A'BLװ#lz#(RWw0I+_U}y;/+T.ٕɝql'&K>0INzVϿ/ -OhlpXZI>]ǟ%¶Jwᖨ'dZ]p{:ۯEֵ#l&{"]\vx,~6:ZĻiD _qZ;=J y~ܱa3\:b恝*$Nв.u'>"HX$@^A!7]i]̆rSйU[x-8:W{=#;`ڪ2t'[&EYIe[(R]DƱ4eؓdLd79YVyŹVq*kd-uik.s׋J,/8n0KYg߸hݤKٲ= W1b*KV疕kφQ| 8QJc͕=?3Nq:}_tʫ2LVp Ȟ-l7J+Fn< A (KDBh19PT炖=@6;|lQD}WhGN4é`X5lʢ- G##tˇ_-.Al~Qgo=jX%r8~g8q! v j7}ܮm>jF.ʻDyzlˁ..cewT݄vu~/D(i:ggO}~?=In'}1'zև2QQ]Wn202_mRZW!O6bG<4W+9^#v˦ֿlmӝ8Y^i2< Q 8d|1>/祥3-#ח4'g4NDkTc8(r=li,8XJs3RJkOpָP=ڤǫUzz)dD[l$n&tx!uțla)bXO @^M4bpE s ZSV]X7Q 1ön+gLlٕրN7~ͯcNWy]'݋їg+ BҨrzn+jphl5J9ňL1Qā#6q^3TJ N$&4Nv5O=8+ =e_qE+]G8l3jOP ` D"qX8EP[LS2r vg|S>%}h&K_b*YXl\WV[yN8OdYyϱlIJdjF$Z PGұvy יW-'!"e]J||݇E;ox 3?쯢as3jZJ2+w aHN :˴o!^WHN7(<\X]vP/`o5fNYmd%d}QziwMWc~wG/"U9!+u-h}sYЩ[>J>h\KDY1߭3_#{4:/F,}BQk+!z&QϤ=qQcǁ䶊T"u\߇Pv?:і!W|/*M>qR7BBq3>`92G- O ~@82ݺyl]AC>t|>N,R^܎ 9ӎa#"84ݨU,zuB>2_!;C?k fOc?n[m͉VƤLu)XV/gGY 8 xap0` 4{Miz0K NS}-N~ Qд:Gv;q֛b[ĠE<ߨzP??h K0vU]y So)Pl%sb33<7p چ{n lt(.to,<]l4s_k:>Lo~*_{>wң{i;^KVsxQ_Iz1)R{9S7l82SiKħt.lBO KҊvx\`3G 1cƽ2ݥl:Mw&!tͦt(Ύš66IćҠ""A(xO  W: 4ҚH]rYCnvCuW*AHcyTR׍ț;q7W!TkcvԬlE̷Ƃ>s~w˪ ]x;u5O<olwZsh+C߸| ~^Z:_OZ~G[+e$Rj꣬Dފ8 0`m] ?ߣ02 %yVTWZn+}nQ [gkI0{)g 5D=}Iބ㧴]vըi= zeKI"NwuHKǛZ-d6O6ݾU9I.}%}ƃ Kǖ8YW_sjqgNgu&$)L5rh0Arֵv:QSC)~Uɺlb)sub6cG>]bM~ѷ\mM8fݽ!C1Ul$a#MI I!q$`Ը % |VA]8nk%4E'PS'"k7A +%iw]gQ8_?Kth_'ph_T_㊹ hivltN`q,rNjk8\]KZN3(/ۗ>&)8T@>)C7a}*F"JӅjvŞ~a=l92异Frļ Dԟ`0kצpQI(QutUv*lkeCtmkNCJSD5K/(O1s15rଁrW \&]+}-=kŚZTbս6=$B9%(I>69ҟPN!w2ftyZk vSFWi{w^u_kd{T]mK_;l!L[8gDp?.3*)r5@43ve`9r@:*{QL9pDdhzbahq=Q_![G[jD}e[q̆uTilq: ]b駀}W1u[[>|i].UZ`n'o+Ien:i.PVZ&ҵ%GB- a[^Xgn <|9eA DycYn%?ZrJS78p 1` 0iBq)Fe\9pdIz y<硯 {k[Wigf 퇝g4Zj]CYB=<7vY4Cqt@u3L|\ܩdT4MfNGҿ+T~z?9IYzϛ\ep>GuuI\iXIlűHiי/JZ|I*wÆxOLi8S]@Ayky6i,ʏϗb=-{t_ʆmޤ6]-|Xz]-Ӆs.z/GCJKzV2>#~?ɭ[ggd8\/ <1"OByEh9i䣤 ZZ槄ج)D+iCsFЈLĹKȧa ,v5`PVȻnIE؀.rW|N>IL ^=E?~>ʬ2/7y>,c[Xٔf;;pЇ*DZçKjQZQvPGqjUIx&(0z4?]f;(sGG:(p_MW,f,輎c8/$=$}ӻg3N?˛WN?IfwC\D== g'yTFl1?L2keEbB:XmG <Qls  Lp~78 3~8< @[Ƈ>Λll`Ϙ@)=逸1Pۅb8R`;UwmAڐm,kZK Ct-Nqv?>u!u۷TF9!;UWvHp.)C-7Ơ}_@=¶hWF8pt-cҶ~8m䢜EQ08p 0` x8l;=}q-1̉ w#n&:;7ZU`wcVӠ5l+q؎.K">?siO8겆$ţ*@;ʨ`PY704bC *~ɔ6_+]X.ٺZ^n '|ps'csln*= Fv)mZs TF}*ptXT;fxxQ'v8o)6}$ݙ]9eT|jtNĄsLQKf|هdT)kʼ:csϯ6QbL.pؤ |L FeXᬡd4*㴦8~ ŚG2$6iFj1y7e9'sMV-eJk ֡yU&$]BFh`K֚JQR/^]'gi:- 8p8ǮcekgFbK=ۅOہC]Z#.j[3OG5#Hy;GYXTjUն:pdaM FO@7>RqSy^k"F7G$Sc,Ja+!,͈}|u o.PF %18p 0` x㽿R4}oőp|n @>I=GS2 y3r$^1 u ]^ݳdz@*+lωn`*mdz}UxÁ5_ss6N?Iٔ/=IPz]׳}u.8FhF\)ELҷw8^,;5A/e,BeL_B)g#7WpB |8r.݆wtV+WzxK]c N8Yu jYQ~|֢r=I&&?5/ pzZM[^<hP` ʳXo%0r&O!Lj-N* 㼒F 3)} t>1=JOz1eN3ED\hơtCXY@w%{58խTB}%Wu1IC8p\1K@{a o!f3[b{<qvqvI1VPftz\=C=e"x{&fY;po}8I/@ԧ6mǁ:@Ă{9J7HQQ8F.Ms곃:Ʉ'tG'm#e3ѤOgHA^(C*'x3O 08 _vT_,rJIb٤j_g_+3FGr0d`t@:6'ّiye')FvP-ۆY-eR]6 -HBA9G{sdZn?L4<'ƜR1*r&6nE;r6$1Tx6*_inrd~f|N\5մ<īw9G\\bƫ.B4ec^Ńyӷ}ˇӇfفr?|~vy'}Lukv\vcU>MfuRLp 8 ][cZ?O| N3#1hk8< k51ZkP*𷄄Q]>BYx҄EmZSೌȣ3^H}ʻ ʽLh^-U4f3A2yXmV[K!fs ~cmիOCzKlށ6!Wk c>;]e*CeT qf' ƓG8k+7OBnAGyM0љo @1yyG@ΟȈ,fR[o߻4ۆc"͟$}ݳeM'+TǴHmsY#8mlxL|~蠪WNN6z?4s}4ќfv*#4zD%'Z]!9'xM6|d4 `9ü[hhU 1_r TTU]WFBmV`3Xk]UB¬h@T r}._F1nPGm_Ph#:<'E3(&u/R m*s$z궵'dWCFK6n}xs:]!o z6}&c`ԯ|O:.=]ņ [Ɩo9Qvmޕ柣 ׯ8]\WQwWho&ف)ڕsfobăǀoE  0`&;өNxqhw׿x6|E߿wb!S7tD[I8C-2Uؓ[=%U<].ܮEU~Ek7UrG qG4HX,RCbÿ*$? !Ϳmk۾<7dV4b5h~&2`YO#J_秣O7Sɬ5?!??Hy{:O q-FVޒvڠK[6+x1SYb;MKպ6tY?*P>]d=5hyy>QAS֡ 3_b j][_݁Pi"lb(Ta(bkt@׼ӍsNto4OpdHer~;f{v8p?z.qFc&)kG?;p\qwK҇T*=}{_Y_-i8p•HhQpg vj[-,fϦq`a3,Z./$_evDtM޲:i]̧eh#hZVZCiu ]m.y W@ʽX ̭8&i::&y'aPsJқD^ƶS6gYi-NK|u]Umd]1G[_eKq[C-=hP(FĬcvTe;BjyhʏuO@7k" _6f8xklk1{na}l.'ln"N;Ѡ2%eBu0ًerv}чceMòuu]TOY`KӞ6cca8$ۇZ7ȴ6;؂;=#'~x ui-(ZA6\5{c 0`Ov}^+T8pp<:ag>}h̑HenNi|q-ߕ+ˑU{1UY뻱yd~'J8u.:+%0UE:._[ ƛc<^7Á#狕^_}8~t+T.4C9CwtMkFȞ\|N&nW~'o4Ip8)buoٜO' T3y.ڢ|~`~m6:qTOyF닮gk^ .1ଇ)zIh"\la4tqyҏӂ5ž>EX|!&qlƫSkl#y G m`XZ܎н*V0*5 @rAT6Ne}8|?+< VzqZ8Thd!N*$r1IC<+QqҠ*׋9 ڏDzJZr2*s\5ʃ9 5oJ_籮6Okt9Έ{ / rrqLF}?N_Q/m_OF[~&( d(¢e xku#_jW_dS2u Myv:]!Aӎ'FW) =:džp}oց(꾺Qo!O =Cv4bB^~k8p|:<Gӹ|vw|;h&w1=\0 >-Bp7&Pם黲6p,^[u n&iO]U.!>QSwV~&8꫁L׵Q5HJR%`j1`[ǀ 0` ;p/mq;p{4?9A>ʡ]mM$jz@|/~oDa]҂9T|*HR:wTZONN9KЩ'Bo6q|;;Mt S3.20s|/}vc {~`o:qq?cٖ8yz?`q.xr~&\ɑ5X.uBs F5Yfc-l0hZ5]Bٜ{}%coK [9ͩ\ *}Ȏt@ "S(eSLaG!OnƧrwD MRUBJ1Hc hMuW(&VT x;IJNZCWeh}NEF%;xe'm%*8" >cv{,At$h#:yb?:kT48R8Ӈ=JMSquf7̩<A(vr[v[yko.1Eoq`܁ʳl!4m̍@%1碊?mu{vmx]hA:|qCIԝ tMQ$qrkb囬1`[ǀ 0` 8{98j&cFفl2g>K˫ƫzo6bH;PP/%ߋw4 ʆ,G-X% E`(8HM;B8vdlLl!G|0?NQ"Gx{Mύ0I_4KW`b8tK3/n˛Izf,%DgGqGȰNԏtLCtnI;@W`}v0JWoqSqиjdڕb^wrX Yer-= ~"J_}Dlߘ]+.)0t0 2?w5e"1Z^+(uPM@ܡJըPG:Ч/p7~F"<Ɓϴ;er׼?oCJmsRE;p\JX㙻l9p(߿bMBm^ k%P4XzN3鱃zYSd٥PD'S3( E:9{s{T'0N5rEdD` -R#ҁ\:)AÁejkH8h7n2p&D?D.'<$ Uݍ>17?|/TM9AjOMZ(k/r1mqd[RɵXF\R4S}dS!g\1*]V{ WEEHLE(j-Hہ *mܟ/}8/ow^΁c[^9T?3#|WhfkC(Fb_zaWG4Gj9߻ʖud׷~B-[]{27A;Y_ݗ! N6lܛk޴'z_Z6ZI1w.=b]=5oqvkѮQm='O[61ԃB][te2D6GmMn>m.V_m}*'OuyoLuv!͂vm]!UpB:l'f#sX*fc 0`O4_>ics`sHtU;0I|Uqݙ.)K@'3BƟdZ o7ŷu .A CEH`23WqUV)X t]Ǹʡs`9'i<{SPzf*?Q )~XW`tÏ]xo&%wW<^M3^rV"86uJ<ߦ5e+7 6dK8Dy^A ? f.VZ1[>8K/t~uJ\IZ\bF<NHnx8{M?oT$w7UH۠4}kU+zXhF0 2:!d6TE1Af˰\O5;:s;W }|97E2p8cJO9,Эr<5U'4N`(Yp{m%bܤk5Nȯ~aVlc ^OsJ)yj&,w.zxV'u8JSϹq ,q`e6(QīPz%8їRB4NDn+U%.f64莹y<@(Kڕ:׀sB;G <}4OkFS^(O<*B:2ۦy,}IO6}_W>ݜ5#]iCr5tl _h:[k1+ҮBzxܝ.~ATy YG;_j9PCثE핿ItlX4_poFWk[y}PaKӗn}]仨$SDƁ#ݵyG r}N8k{Fޤ6vЁQmexp0ୈc 0`ӄ_oidtr1ULZvڰcbqwQߏ;mA\2ہ͗^03RBGiC+FuʎUz*峠M/|AsE^(H>tcfֳb ?Tc ~(IKӉqW8W!43§p,x췝qXޯO:g5n<3ݦgLlEZKD4ѨlҕBs}|أZlrN(-qPpxvP]JzrI[O\%\8Vi%rxGS4$E3Hl6,gd4Ê**lͷI3`$Kk)j}'9]L^ݰa4)؆ Xcu.=omQdm/RAE:EW6Wh=K ͵:Lc,u|E6tE֕-ѹ@YdžiUU=Oһ3wzEï_?^=I8pWLtluفĘ Eoǚ-oϪ_Qe;Kp}?k5JL5+[qp jE\!ͣ]"䩒M?b6=Y ؠmiQo8us4%$@+мNva|_IkGP-gBCU)K2ҧYu^gU搝3dKfM jt'+tOK`fSUk+p|ЃW?p£/D? ^a*R xtn>rm5 U]!~O0IfFZMN6И"ݹ?JΓK5JU+/jBhFp1u84=܃xdݥ̈e^Hk+f뾌|[Ճo(eFI7u|-/`6dv?KG;꾈tKZЇmc x*[7-Oj] }u9 +s.S]BOہbh+[T7۬MJYV8 B f GYZaυ ,3dӝ0Pz"}}E~{ im>duԼ B7Xn,Wuu.9PE2j2 /V"Мq2_D莹ejAlݤ*E[(Q`^2`[ǀ 0` vS89cJx.c}YHR,F[ltQxu=ڎ%BUIg&+t%mƒA|CjOOu< SkDy"Zt 0T!t~&?ƛWI6Sݼd>2268?>+\&8qb=78}֣ N3sM?^p"ƹy@t])68Ojf̺ԽP?z|#Jdz+2],xm(rIX)ܤ/kuIRf5FidnވjQc-*76ੀXul<5p%L}C4a3ejY(C%2wn'%yL( OAB&:dkLA05$4g.~}n!6m(|q&m7Y/Nݳyzؘo}2ɟ8O;r8z%T poiYU?IcM=MD}6c_ҒC]Egv`bu!Z^UdK{cC8PଁM81A,Dn^Oj-d$Gbbp "]GA~^ }RvP}#!eq gWBa).ĝ_e^qԠ͜~¹R!J;7AY`Fq%Or^x4(r~u|!en$(XqRQ38Rbtl.GepjPznB͇*uTRniP/t(};O҇=J? o+kS;peD ũP*W3D*l9bJ,>kœ_x4gJ܋̴~ ܐ{|| htx8:ݼ*z墷O|MS_rS!DY_{ɇ4_E:5\qnl+I -s\1Z@2“Ý胬6^7B3 j=7+o&6Cu(B)mmLxK:PZAM!+`A" O.m\X J6]zV2` 0`U䫋UzmzxcIZ\zVėjBZ!fPޮVc=.x$f6mqZkZ+M+*n~] 28_08u637ԛleR; Z9uIQkj)Ş':u],؞> tӨx3Q4lpa{m-ޤXR~+6Yc 43t+I-iGbjG\mhd`?F/XH;Z >5mڦ~cD"@W>qJl:B #MٺԃƝWlpv>oDklRP-Pj흪1:֛L ϴI"Ҋ$^}WkQO6z7ߩꜫ]JrbVt%=kX-Iwzr>y>uN/+^ؤW ʿNئQk^5^k4-WZϫXSbN ]Fg_OS_'ׄF*$pNaUiНM &P֟DNIN.|])Dkh$(=Q+ɡlL 8N74x,-]dFк}|.[(!e@z7<@ۃzZ2@C瞴yc?YBnYg@Ѓ?N8۟Av5q } 8hV"x#FơB$%:zߧN>>QJx3Ss_>\bUNE]D156Eu[zh.ש/m]5952ւ uYR䍠E 'p pǀ 0` )MO8c iJzT|5t}㻱h| 4I2ZKlz vIwu}tu6!B{NZFK5vy]zDTuzeFC; {l^58bvR>'"N8ոϤS3 Z Wea_4W O1vi/c2'l ZG}LKxbt$u8b~:=;^row2KPBQ:V<ڢ@]<Z6̧˰щ[Blv^*\k6R2W.FEz&]lz|3BNkicͯ|iF1;4eK"s=Kƒ,lx3pLp O5=кn ]}u~LGKVuՁǖ,uAs\ ZzK` WL׵HoJ=4SU$_?G_u `2ҙ[RL^K><}['ps˜q~zq~]2֙b_/9j=ӷ'D}eGe9JujA_KזRf=% 6˽4's X٣h,6_LٙwrwV,@^5CL Ǝv-7\ TmEk$og CSm:e:-K7q' CpKEϫ!?]~"P> L G=kV U{ HS ѣ\sz',_Nn&qۣwZ .]OfnS/t 쵪 dLgSz ?w~W/?^OHp287ƹywe<_סUomiփdP!ojN6I2!WTqRY '53P5KYnʃ։ [:AM8_;~rJ]vmhu{?Gmcqڞio'p-wh\L5ekdrJ|_QQCt42A9ny##w!G+ow,.ɿhqǺκ];26%C\FЁ28p 1` 0i_͓7xĖIv`ÙC~}mҥ=w o}zyGw^- *zF)풻|<:lwtʰmG4eU49>vPxZؚü) QlBcLi&&ʟN6v9㸡⽏ EvrTƔqWSN`:rcՕ˚Һ{jN*-/DfezQm﹗>,W6W>Rަ?\.2_fXH}j{D $ r8dW` Jwd t8l|=3Jsf_qzAvrCu?y~58p(x,ve~:OpX;U:5/OSWqjT׈L:ϗD:}>{BgJ}E> -[5,W2Q6 ' v+d57Fᴱ:w1L: NQ#AO1j:#?i7S1Vpg[E[ӧ9Yi #gW(ʹSX7Z;qX7Xbu"eqy✱ՍN1p_WpڅO"Pfܹu7F$'FC俯Alf9NvazK{nBSg{ލcہ06t(}g랝x(/mwK|%{ ezngLYoQ}C}mP}Oӥ4P#ۼ^@@[b kcpʵH{Zmz!巰Amcui}<6m1>Е5r8UVĢYSgF7őPd%18p 0` xǿ4aIr'qxypQFt"ù>>`N-h;z<غTC]Pӥe >ZJ߸Jen:~I(}8qz|HWWekFil 979Ճ8eON1`"%f"[:۔Șg.9|(%!Dk[h!SC OBXkՠՑXЭ?]zԺHVYhMfCZx;NޭS$v~S'~"'Ep'pv-JR8pp~K8pOhE8pxphKjY*mY)lPeYDba1Vi4)1 ʹtY:'dj|ԑ@TDY!dQ^Òg 5 tR{+ED YNPloø ӊ8Tr;l2wg-'TR/A,@-rih.˺4s=@&V u@_1#9|u_Ў@׎(볏?Lzкk}p`4}s[?N?K#])lH+-WȘ5S\ִ'sYcѵ&kF)g=9J[ `cl@vBcK(ؕp=Ymgw.OC#(]./e5nFW6PWeo]3'dmSH@77 JfDg), m׍m;TմY赵'ҡJ66R5FOS6DǩjSu?x<#-y]NQ1Q]L!cQ؋MḻOr/eG~bNWbͺk%Z<5$m0$=sJwot}WGW-wz1KwGt eZWԆuoi>$]go{&F&Iewil_s?TEJD{&M]|x^9_$]lj7O\J}Sr؈lGj4} 7~ Y(EsREg]Ԡ|))Kh :seF8[hD;.z"TI[O| lMGfN1B׾G!Kݦ9ӀdeSl+d&I"}dQ'w.fYї/ť&9X \𴅍PYp>J_ó+TK~qɋID׈.MY'YvqcySׂm8ll45'48z?qr6+uqM c t)q`5*RL- ‰BFjsS585@'MSB! ?J JGCm97CrYNQ)Q&8%³+ut~b{>7KYwm$mP_j*s$z[jh'J6e88FU:MigGiۿ'^s>c칁s rZ2)ϤRf|\ fԨ)D Tˇ!AJԽ H (<=+8鉔dGe(T0Ѝ+也x\)?эFmӲ`ЁH]sv]zes&Q/n@U'.ώR3f&I:|yn_$ϟJIz#ӏI_I:+MkŚ#]k8:F{Qs8hفҋg]WyBv]WuZA}\{/t#_beS/NB2`T4fTՈ]qFe!D@.d\,&ܕۮHwSO'B-Ӓ^HF=8P*j>TBCBPfc+# X OF*:ަjU7WHwlɹ5h Ttt Cw]M*T@6%o/1`[ǀ 0` /єfi˫S&45*8o9Csxu$bwaP%&qr%!ǻ(ijr{e֌Bs}M*`Z5 _UxZG!NFb7Vfөn'barXw#s ?B-db66(㋍m}Dsʵ+r~>A^fG\'}$uֶJ #3Fl*^'XmfNgezJ<Ӵ4>M5mI4O46'Fmr[9DFj,Y~>UtPLT{'w{w8ݽMwN6ΝIs42-0?~ ~тpMMzU *rί|IZe[j%sBHF892Cذ*`l(h7bSvsuM7vgk]CW\z F"*2~G3C5y(TLR BP\.mg9E6yH+-FZ~(yB0N6: e"_U? Ve`hRkkN oyR:^,W6O7_W~t(%5*8=)fP4=Z&=*w ~ɱD!few ]*AbՓ3~]28o4j!EƝvd:n1T k~6Qgk3Ѫ$ tfue8]TY$=}ij~9F7/Q]kqئG}vVI:ڤ+s:7 "GjIfSƄfnϝֆ(* sgG!AJ*ftW@INb.ʑRb=x$ޒ*πMȜ,&"cgrBWi#yr;vXWeE۳'bn D{biȱwswMtws>|Y7M҉RO?69OS)=^+oy\.}2<ǀ*j>3zyX}ehaFWmM'F1(Jsx&M7t_W1Ҳǵs ߩW>)TkOq42я!胪6WB-v>VL&>.eLY9%H 4G=_E T$ʈY߈C.*&BۧLLn'SL F3d<>RU,}w-{n1{znj[Iޣ RhFo>۞-htJxy1}Ct' ?.۟ۤ/l>9飿M>녮$y&"Q!3 }ӱ9[{jG/y]A~mvԚ4z}y;\Me=!ی<žܛo49r:%pCnb8 0` 'R7rȸ?qOƪyjOehy^juC:u'+(Ylf ePe~& ?6o uЋ πÈ(8RJtW_,Q)*l[mh5j}-<1x3M7=9%gydKϾ_i>4գ2)wX;p<9p5s5U=/ҟӗXOY% egSiq2:Bps2ΒtAŏN+"}ɩJ.S&mj"6e\pg}!v 8 AE!#FpfE]@$A=$+1:T˕6D!>@w[J:@7߃Z |lMYYjCzt7sS=CySwcāI-s73B :}蝓5Lo~䗶/7??>XhiE 98L`/4EaЅrXyBT x =RoA=?q c%p? o=hk\;N-Ar;ٰ8Q<}oߡ l:=gDߓ#P]YV"`cI%_ 1k5uCHz UYuVtd!CaK3J&4q()khN󓔞.W>?O4'4jj2K?FJow2:-_k֟O&;p8J=N?jZ:Ż5lmKе-<4/=<+i'8d@5y 24G!o HT-`WeТ`{LCZ-iu|3NC^MTd<7F.CQS繯pk eY#[Y#GD^;oc~J_Y;M;$=KXt}srո^t2ѥ2%w(<- ɰr;.gяLi#6CI޲ޜNʂv;t㢧ρG[8}o!MYų3ֳ'0@~C/o-Xc+E}FԆW65&]^[qУko@bzbHΝAoӟ|9@ڞ-m0 :eO76GpȮIs[ ۩;2vЇ8ָ8%(yݼK`n9x ܯ]08p 0` x?vheS?t\aӐq&n1+NK?ÇׁPdrCQ ]Q:U@]XViBV>V+^av"-69ILѷI=]SHj)]\6}굇yZIv=4O6M\ |afb}y<*0S޲iO6h?,d_ku:CnFYv׽cBXKU8S3nJ=3f'K9L iscwQagd8+C{w ( Ov[ȃ^'plӳ8N~[v͹IqƁQJWR_ZO~4՜'pxX8=N?{u^<-[+KAo;?`n p==0Y:FۑfTk 蒑 RZ mӒks R 'hs)eg 5 z¯:>CWYBRl~]mTDZ v~G+C3v5B58e7ripګʪP[jwulCS6vc [rup\ʹہC7A4i.۟Y-λ#67>rJ ]-vEZH=^cT2-l1 .ׅA#Pc˫LyאҷFW!ػKO`U#,iBA\F)7X#ߞL0Ϻ56=Z8@ͻKpW"Ϟ7 B5t8Z=i(Ö@[ju.z/POD+_1ۨgo`-G!9 W]'[y|Fw?hlP'J> t˞n٥ ,eX6gV/|מMhnEMK* 'p 1` 0iqkp>':ఁ#߯ h$V%)Y't2?5J}#,v!Jen};;zɏ5C1nF:zHT8pps,NñoNyK=k+yZp`f [(u"ǒm뇶K#rY0Yk̠,#!I? H_|F94:eNR{=]"!ҁNE G;_SFSU_]ldw'pO#ez-oO|b?COƉCi e5 4 먙:uйSe=fͧ_놧[ww<; [7<%=_W4E郼VGao(iK:N{:dD"aׇhb qyJ@]S7!?y.meFÁϠhqO9KI{νm#RJKB2i{xzlK*#^Cբ?ևvBoA#.vufZ|h @-=sV:׋yd6{uPa9$[zTŻ7v9rs\Qc&h|hp0-c 0`ӄ8aJS8v'pj4-唇|C^W4w;[&DwG-}U %j!Lw~$`X!ŷAYL黠#b-!=pÏ19&I}oޭG@LA7u岌.-:3C9#S dyo3Dީ4tO5׿2>j.CM.'ppoy9IԯE/l.Uv&Ѽ2ޗ:MOTJJ>Z"qq.Wo _iexh.i~A45W_fBy>|)kIX̂A3I;r̥:z*8ϐL3ZN+| /kC?=r:`Zh[1asLשxףnt~Nz4wi8O3;pwez:-.4.4f|u;P8p`+ϹǓLj;pU8pp2(ӇCu>5НBe8tAiEwOoyJ3w~i#Oj8! uQmY[XTUlEvewVve@aTW.ڮ@IO4(n-|]tմkx3@=m^薛/X_$5ZHP+wz ; Sp nʎ=`gI8Χ[7 JWtCm#}*ZRO&~%Bz^g]@< \FK=%nXp!􀠓7c 0`Oف$| ,y8x&:;+nqʃ\@|n% W< tVlكU# G*n)e]ho4Z6ݱ 0Ѧ ^!yT]y~͞@KcWsįS+4򲂩]v1)-5K]l@Ғאڦr6ȡf8gL^xTblDAbķdo7i>JeIt>O>w?ϧwGDx*mz|)=^W^H봒V9wWu)ج ^}-C4LF7m'o^H&<鍴6vghbyAW4I ?6o!9.Xs 5?%%H8FZ+$}85?2;ۤ2ߧFSו#V_2_" tE8r6V}RHI.lÞYEO^s1.˽2A% B%{[D((wѯ5 Fqٸ̉MеFcm=֬9qu#^5G}o>JwM_YOlӟ?^+#Ob!8ӡ@=PeT)[;p&`\idu<1nH uGxGԭrȔʞ4rޘкV3QyօHXq0#4*,d !ϵNC_y"\^|f0ۦ6٠J$6tq"}FkJ.7 IXՒxdT7= ?caz/k5GPlWJin55ئKe M?|IloVWƨ ƌ*=0FE_nx!.F%k4&=-W4}sML#g*__+͇NKZ}>ֽCҤ)o:@W@O+ U:p0>%A4} E<.e@GxA}de.0c8p7T/*^=u=k$׋s{t}ɳ^nD& X'|ykdsQgW랟4_ߦ'_}Oج3ƑrUܷ"mRY] OAai`:_C9M5/Ι oAM{h4hlנ>=xվ6;?Gka뼠rTCs.mu<OFw9D&@ xGeG79p(qxRqר.*sC3_*i7Ցut5+gˁ٫ ݶԶl_ ۺdųH 6v}qS{Dm{=Oޱ ظ7Ւ4tlrt|3£M y% _E-=xJ^\Y1`[ ǀ 0` 8G)m<"izc#:6ד' w((hBkJk>adě(/3>d,lsr!Ӆ釠Ul}tiWэOh +ߔvlf闺}#l5(͢qGY !zQEEI /**8%ka)ȃlH?WiFUk`8qLw֪Z3Ei-23$NlB/ntraGJۨ160iɇ\/8]_t__ qTYZ˦GS%T_ʰɔ~rR_?s$'–SNpz^͡M=]ʀqzkb L׽?rWEZL2MϿҟ٫^Wk]q5 M0@ l8~qำ+/;NqPh9p(~q2\oe jb{{t鳽gaM}kO]D8NDך-tHx4}sϟo~7JPkTv %'Zw]T}l8di3J:͖BmQgJwLNeq|BldJ\; KaB &ٜU[\+z:`,!8 [h_-:CWia!:h5-P:9F79pTNȠwQ/O|,\tDE]`q},"ۋCe] 8pvqS<{uQ];N7mc@9щ:puV!>qkGcaoӴ8@>>j:A o,Úe2X>~w38p 1` 0iׁר.:οW:+Ka8~WLVZL;qC;rNrBa†M̓̉T,7ޒ6SGu b9hol&.L}TN 7ğ;6<(HzynpLnUfv tbhm7pckuc/=53D>Mgf#6+z]8+S^ljtb=^uf'ҥ 8p)v2ڲf kMI4{i8rK1!Fըe0jwmxa,w|8}p7Ix|`muk=~F'ā7}Po=P׏O^uclZYd鿮iM]% E="(HF?xvp0-c 0`8 #v؈t{'͕hx%8 rt{ c}/.s=dABs2?"o4FPpQG!J6)]V?qJRҴ :u&Va.+1T|8fR*,(nlf Z(oeza2I݇Ey>E~LMxr)[$H\fKH.LM}`Iw(/ 蹒wC:F(e~8+@\UQGZ\CFI2?|i16,]?o~~~&+t"]WK1Ky[ӣIZ?Nѥؔiy#}rGZ)Az$;p Bå&$.2XQfCfITXd浚blf).BeIx+CLa.zryuf)+moHe и^-:+槩.:+Uuް8G Ƙ@AlVںn?31M=JW=8_}#8.Ӈ>p>`$}sNO6?#铟x C1ܿrRأ{66xln9Ry2kݞLoF|byz7 +T9ʺ,5Ы2-+걍}!E ; J{jb*u}y*}`"$htp7hl:@diX<߅[h-85E-++F>GAznw+|8@o:3nvFzjnמ<VF'PCC{S݇nZ'7w(~,-|6cgӞGTմ;Ĕ^k~n,Sno_*(=8p 1` 0ijǁ~ yx,|/_a~f ﵻD 0C·ܚ*&~^+T&[\e<%_$ ګS,!.+}~Op ɒdo)kk:piKɪʳ;4\̟p(>YHUdxj*SWHުCe&kUL̦RcK}Rx3*TP5wU L{,9^Ky??MFs?cЙ_ [~#GvV76mDF,%/Y)WN/)68i9Q;W"\t*=4ru4?3ё8ռytvv9I;cmbJW6=8x^{M*[pIEd yۨiT<+0Z39S#vuguB8p412}~d'/~ec?uՓ?^)SNP?:2͝>7V8>/~Sgc(&*?QiWXScy崍<'%N'mVy'en %ijuhqMTrsNs Y^`%]>|%)+ۿROlYej (K"|>tMF `* SzޚSỌ=<e#=\=5W {`uxMt>F+uwLӏ6N/nG3.ŁtC\%G00c7Or[lMo5h{.BjlNAe5/`' LFGgFn+6$&ݒGmmwQ޴k73 '@:.!l:D 9 [uྕ]t nQw;Ϲ7q]7 Dm,8p\:3nWYmmڂ] ΁6]у܎7w(~,-nV(/OTxI WzܤH6yYxp0ୈc 0`č|)A`Ghk:?&P(tlNL )\G~8rgm,QS BBU6U#<325Om-. ^?h~Zg&f(̪ сt&52bB>$yK*vX%1&QPq wC'_I\kt뫳MqFlG22ϸK^;NMӋ/?*4Z]6ط-n%2,uX@5~Jcj2r?ݦ]Y+-V/嵩Zy^׮2GѓH6ˡ=uʺCcB B(a!z]ow]@&! Ǯ3*4<$Cq<N;d OUز!PiQ[!#Z7n^8vrLn/۠ÜMaK^{wN|C%lmޛwlw.3жXh(MzhL,:'}eMڃ.ɐƂ|xs[ 08p 0` xWT|'Λ<.߁}~Zk֚?|TB;N\/3ir3]DWtm'>*,W%٠<mw54yҏZ}pJ}Fx?\< b@ͳ]I\5Q>*+7 )( PvQ -Tl 46ݺ"ۢ{>| vyl?[ˀ7'L5}ȧ\k$MZ%κ]y('gk7ظ_caR'1؜I۠5FW9;@y)g.)M۰Zi>X+n[⛦vHd8TZF'k:G[{w su2==I~; |N;8)lӕT\IW>6xeJ} XGT6gO7`7f)V!3BE xTƳ\a\WWr= ԵYOv@kUGpȪvl|#ƞya^!6%E8ʹN4<=;U'wSDt5j/FQJo^~t,-,]i\z;Kk8-tZŕ.V׵g^Z뚒.N&5r)zW⦳JEmrM7C曉>H Cѽ\IrεT'"=uRL=IϿ}#kدL?~z|)ŵ )zbښĘ7|:;UK?ӗLWŻQ1'wYWJJ zhEO]a,  oEZ+(\~&^׌(YyՉb _(BЌƹk RT )t?>~o<8p 1` 0iKԧol b+:<;{/qlx&ϗ-Z "tV:3[%^|O/!Yx*ئ:Q]#WБSFOn뮎xе7/NBo=xu`25zx]V`ř~aqC\5lAYm/z`1.4{bwا2C.ބd1Lm7UMo`m^x_/·ta=b@X?r|q\8w!m8mױr =rT3>)|# "*ビ˹L koYw>}㿰?}>71pٵ/@œBuȵXBb1pM2x%h5XQDFI,!莲 ƴ1oo8: H6%q)B::>ԃ+ki:}ڗQfů V& 8Bd[hFd.$kgM Y᧭y`|Mp$$@$_C}DPƞAf(fYsz?1dG6p+L,+u~>ƾz=rvXCҴc„w&L0a„ ^&>eW qcKON:Y9qC8_2oq 1=䢭N[@ӕd1:KpXbřmZtabCf-;r =}'.ҮXsvaWmgor^|2Y1W| =BQGH.=/s-.!Q*U7[:-8dlbgM+G;m},/~ gS_y`W 8hIygwi;{cc?%⁽m~a-bq<{ʉ(ׄu$S`FGst9˕dsnGsq6>rԃG  H)Ѿfx*gM1h{S}f k7}X9 $m- ም!Gt3{3t#>!]J3njƘZ趜enھҾO ,]l,ix=QG Pl.f{ۋKX01Ě }~( Qx"BϺ|R$Ec7EN^ "rߠ^իوD Z-;¶Kn^Qb L 5>jCEQ(t#yen" ~nA5'|IVdQƌ OnG2CAߠXm7>r>"}rl/_Fնx8a„ &L0a„ &xa]9Z+W+\xQg~Z/)>mcklRp󺗄ȶG{ 6̼\xJl3Sܐdb*#&eiOeG'cbωS46njv%eYVb9W;HbCrE['2-ʭ(D\Cm;,?z`rw@J/OS{vqes{|>k~ٯ}7no[7^{f7ؽ;<3;_rE$'K[lyܖm>tM}8 ]\-0W!k Qf;-viogJ7Վcn]B`mm.2+`8h~;qc *r`ma{D^z}cWsmty3ӛY.ov _ n TJ\~ń6"%^)ؙ.@SDa 8_ D&c&-\HH (EPsF#烯lmkNQ-S**%Fbs 6Pa#s?ƨ0\im%4[mhQ)l%)T&y]vgϠLˎq8]g:PI.3k'?,0Ql7[ni7[.(8V̖솏/f[ xyeγO __o7o {Kl7No#c?O|>'C>m}Ywhfg{f{;ol hr=4;ɵ-7?KЗvكΗh>zdږg]a[>zf:y,-l칲.3A)W2bGBҋ'΢pL).w'ٟbG, `;Bɋ5 #m`)-B_!-.ѠO'&>3.}XH=qc1yoGN엜h}Mcn/i hS,J G7x9zg-e-$qMj;i/OAqs>2[Mmh17,c\r1C1 ǯ7% >%GeGl4O=Z_T%VIJRID:3a+R):y6&HQ)p`_LZI\k-`/#5tPMt}f,GͽR\, IN3er;|=.so+b?q>qD~)BfbtTXP?G1dE}P`H'bfIr60_4l19s?t@_wȋ_ O[r΂A}@Z4DO(3녏*C-yяcWuqi0F׋hB;n0Ԯ10Ght]lq|JۘIO4tj]klrB.k?. f'Oڢ@09۬Q`ǢDy]Y 7Kr+td_C?}}i站,dng0eؽ{#Sp7덭||lfvΞ]\ vyw<5:gթ0ɅF+äuo8ot\w<{Į>.|آ\>vTl^>]XC-`o>g^n7bå ͞=\AH"<_rkQO\klʵdzE]넮%L7*#|A)k[ !ܦ{ w/cuLvY͜HzgJl|?2}H߭ sd_א.cГyN݌cz.9PYF7`.C߾}ecq>_S/'+_,Ozy ycldcJXf3If\8CmbupY!t~mt㸯zɄLpT}W|'[!~' Rg2 RJ{v5~FR ]mc`gE)_v$G؁q|~ϲ3UAsnĎYbaŽ8#s8+iN'PEQlb%o/>ٛCYo؉xh?Bo=>}C+6WvMOѸAH5(kP4O#N%vKA)qwlNn =ו1[/G}i )^,S|EwU"nNVs1.f5 mQi@id&3}/+1&bP Orw c=r$azŠX*WD=БSj6R<#Q<'+I'8;#}H֨k(C PMvJ{B+t;k[l"<#)hsN6d=,S/WSb|Cw_qNzN%xZ9](Ҧ )#Xc1BNRᐧP,|' +/ZPi@ףѐj@`}A ~&_1C.eb &0=c„ &L0a˄g)m%9M悿J *ohr3"y,KC>t.ul/K6F',iF(p<ψyTԅtn@2Gr{}AU|863U, y葯 $}LbP{H¯ \" Yt2 5>)zUTrdFm%N@& 6AX ۅ,_P'Mmfr~Ej/I-BɓLȋSY{U'vɗ3Xcw$E@`31&F9Ҵ"'6쑇OeRYbC8׽ Iv&|77x _䳭ϯ`O8;-O8YAk9'ʣ=z0Q<~ J務]NmqnÙ}~'[>.!~^?z_ cS1Ϝ[;~ëh:cocy5t++i.vCKgN/|ƹ:h(_\x'*w6Iė>E88MvOщWԩ31[DBv=-V'xdZ(/v1|hlAq:Qиk>(e>4 Qoi˙f/Г9#n~)[&+8.~}on>da'~qoOEَG8 ̃eߦݖ}^p.)7}Z4|^T1le{cPlS} PvQ ;=?q$:-M^zfЅc3 ݬ2~+M}2‘cv+3Cj2gNf̽LaH<bLj'H@po#,eG %!SG ^,t?BGp}|#nݕ:  e@h 'upx{aDZVT0J\: d6[GvT CNq,5|[{%z`<$~%T[B}D#NfwAq% ی3kSv;?`h+C< Bɓ p,hGt~c|;LOبh?l3΀uE<}߇z?w~iA{d n |Ǝg&kt*Gs}< oo|L2RV' !ё|~}.d!D2,/XcN>d֦ryF-Q.dϔ#T -p>8~LOLOɏ5}N?!nwp;!fz:Ҁ~0jsyYxXvc{׾<]ڇ??S?5c3 |T^4on's:C^P*O'NpiT;gHr~l;Yǵ>ғom'\>|pL4?b x2&ͩ-eT_p8ȋR;7P}Bʎ;-Ս8$Pԡ~C$$Vx&X vWCiP<7}F<~h%c"٢$ d?)c)ƱZ}s[96֞,~oA/#,m{!_p56 q{#2+d"q~][܃iDŽ 6L 8&L0a„ &Lp,p8dΧqq<[Z?y6 FH#Fֱ1Xzר页zW40Hq_")㩄 1}~-,KK'z>niAe|p1[ģ,ym~{}rьDHZ$TAD{- Ж [Ǟ-YmB#>+^<ۇ_iq{fN`]]BW{?yO[&ٌAG[82l޲{݇5O?}Oɾr}fO/OĞvB?nciKv u'P9t5%>b&v/i$x-*:n3.@-2'V/0FW,k}%-z]Ʉ?Y}mc98WNR?:_v}yڥMb|tѧ\P˓c8ګ;~-{+^,ؐB#:210/r-G?: .;hT )rz>X]^MP1c5BW >׀ha=Cƨ2#o?GNPբ~^)1W{!%^DRyi'1D[ڶ|@$CF6Vv q?ybX72pLnĴc„ &L0a˄p|p,}s=7eCyKeQi=m3煥$erTɋܿ)3t D=çPH~j<J!"w3VK ET~{ڂ:-L(r~Tր mVN5w Fxmdy!RГ mm~ .81Dh w4uz1l6,~U58fWɖڈ&4Sh`ΧP'QϴLu=U \|Q||Z"E򜻑z3ۭ^§JPO(۞8̹ؖtN/, İ+ozd}}v3_}꿽'ۇUp5GC9G1">\=@w?w}SB6 D o#=17|b\^سm7 梎]ol;_v7׃8v3Ѷ% 5 _OK@L6D?B)jԯ@etu]>ZCͻ v ɶXN>&۰Q mTw/złI~-Zc}K8c~T+̎3mgge.;'pl~ۯ;_~oe/'kO{\/ݮȺ1W? 4OPK&e^y!W[ d;#GǝM>C`?j3.IU SojovgbSdSŗ.WAM5@QL1Izt9gȹ #h}uʆ@c-Σ3m<Ы=$̑JDӄr]11@_F1jŁ~/R )Mr,T]S^}jmm [loGz9=NXHϼ:8^sjQcu'Y?Y!I8̧&1-0a„ &L2QpKf˓L\Q-tCWm#eZceu;?=uYƿ\iB:j|^'88_g}7d,Avc[ : 20Ͽlԋ.xaٍb&J^e,QC>-tMdloǣ6^ryÈ[mm=oS0rq=-h2j9]{*Ew9ІO6G2Ep`hP~J6cY h q9F8Cb&^w6I*99hヿ$^*K| ;h* 807NmkK6л k;_'[{}X.S{tT5͙-+^AjQopF_ݽc??g[ S[#5dA vD<޹1{v'bٝ]gvٳ֮1o1m1/#WR.4$N!}U6T2Wd- 5Z[LAC8[G=K'* 8~稬 Tʓ#x_?~Qd\pdzӟj"W/ugL w!GYKH#VP~{q"6ROi: /@%MH==}Pie!"Qh\Izxb;? Щ͏jj_׮OL 8mlPB40Jˮ HU֏PH㶶wֻ#O[0?]89?+";w^qgx,Ns :rM\&1-0a„ &L2YyF.`bYsg0RY:VF=Jsy>!rA+wzUdL!Dg]!Uf8-x^dD\wZy1aՊL ׻v )ުוi/D ؤ=U `rSc/j;MnF=3!9c:~] 3ȵŲ͠x+ tGcOWBa,V`seİM/p )u@RBuY v3Pܡk.5y mJ)sr He|fqT9 #ETԵ;k pX+5' E@^OxliN q17@gå.3㭢aP4ƌ#=ox!hgN^ 2ol7.mП!+b q0Ž_.ȭz+k^vBB2-@҂1y'ASE s!͌OxGu^8V<#:ChmEl>Xe@A09pǁH/ \G 8.?~-nV 8SA`x. }O=Ii{yt- qiZ[ۮpcݻK3쾼 ś=0&cߎ:"FтW ߀_g'[>}.AM.J ]7v} OmAa(SRnQZH>.}WӮqlzwri⓭=^ڳw^F|R/ #yu8!sŴGg3{i#{pj^9W^g_;3V秶_f:AG10&|~qUmC ]U>(NVJAc6~Ⱦ#.aWl{C* ߊ*Ȋ\hrm*]1 sNw#€P~\oAݚZO.HF0I4Ήg}ү>/o϶bݔk҄nHr'bQ =|HTM)YEZ?E^Q61lcm$DGI'`;iy\ h带rSS$:}?QoUOI/)H}e a*63z{*u9DDNV)GyOQyRjo!d HX$ȥ^LPc+ R񬋥H(rHkw,"kzAb&>n21sˋ(rQ2E)ue%'gwmߋ;>A]$$V9z,4Hoj'mTufsQ?ԋlӪľBŞBAG(2Nk2NO0݆ &L0a„ ^&3:eO-.*|s&t`9.F9GFNo)ú7s^HU˧ agS&r |^漻^Eh^YƠj`.3^4t ' h>/ՃBRiQ ^ c,#@^ yd<+X\g:۶HP]/bd[€_qq:Nm]}COR3hTn%h[*Dm\/C 6W@oUƽ؂tW\ħh6~=O_y޿//xmkKȹpMxL/&?r~,vmﵟWeKe)sMPs/9 :<$zsS Ru^ ϤG$=m]O9Z,v4b8 &Ţp$C:Rgt 2\*d(ziCYzxhYZv:dU-٣<*`; oi~yp_Ay`DY>Qԓwzioo,AH]L$:`FtīdW됇}8! }aQYO?XnYR$?m[?w[Ö)š vTw 3p?~|r2W~yd:y>]cKscݖ uv IYS*r`~gΦ&0-0a„ &L2i I2|I7uX&uS*Ĺe _8 _Uڤkl$g:«)k>x ,:U e^͏ho r%%#U_,vJwJe5N@sҙ?9>.‹$YTGCC+1pm7TtI돋 ~y,lٯ7Ej_X;3 ]mD%=Olc>ӧfCWg,gyAI%۫z>Z1xsh # - 8 Z}" mϵ3/qqݲic(Zkg\NHB4ŶAu^7,棓Չ꙽r{x?Y+ثHe"mlؚ_Z+zfO@ۭml S^2(zK&f[DŽ7kkc>;aSlh [\':O>a_υk?4!Q?\ ?I -;=Rrzr1}. GIA-Q$} B~JWz`lʤ{ghe}@#:o o z!s Ն|4ArLc~ /A:poxsG+OW;>>x/'?}7v^.@L2<6cfqж/cNՠBF ́O_Ec$B 3czj; A:4Y@v܄jѳ}PN!։;m:-x9#32- x9HCg mK}&.زoHVhT0b[qVvk3vZ*|󓕝.gZqv̖˥=xt^{=z<^.l}+.ͫgvvlekvc3877ev\ح/b-8.A ڵFk40fC7M̈́6glnck6;=-ޔ bݫ@lGH+z4D?>olB|O !"1u&K@VH0w*W+`LP%7I|/F j@ltK91[ H>̧ށ<lۦO (.eZ wVn>9X1/ 8>ם'^{WKgo?}m/`$E;7a1WMb[2^zq; Yī37:گi}~ op.0^;+ JI"cfxp>ptzQ:k!ƃxoE)c <D#֓-nF!ZjG&A]}cp@_Q9@5Xl}76vpDw6;<vMۈnlѻl^?c 3'<6f<𲵲?h&Ac1@d㶱0rr"%ːɼ;Թ |(hh _ae]d 0b@t{#VLȑ:aiZ1a» &L0a„ /Z%_P|nxK8,`t># q[M>ȳVL&zZc7y7$=>!S ٰQǾQNF*7E.h3DCiVve.( GIDATǬ_B*@[g(ޘm . f|έ˅-NvyiSeG~{{ۃGdg{ۮvmdmzZOgbooQYvqui,N'ex#SIR`xAHfcQLb׎c\9mJ;ȇGW綠noX|ш-HJPj3vޢqԥPE(v ˥lF)PqX)Kuޢwq;/#{1l~PV|%UPȺwA+ ʾŸ7+]?pns;}|ǗfGO=׻(44x)DACGpp[zFC- 6'eJ8зm_ l`"ӏ[q#DigtK{zP8IlGhQʍ鑾EY~DW g >E=Ǿ7 9_9X_=u~Qn}x 8nPoib2?ooFL|C}ym7胟Zy׹%нs,A@E1?$pb/r2b! 氋4-0݇iDŽ &L0a„ .Qpy3?yy};[o6Ηs[l;}:+x>٣ӽレV3>L6.̾}靷ŅV\ԱՂlevx[c#ڵ \ݝM+}EnlXw|o@|OX#W&ͅ<~ 0ӂ77u.T0ag_SG͢\<ҁcc|UP%ɓWz 5eQDwQ: 1^ m;=Oy)!d#nOڀAmJ mؖF#+w]v؏C6=S/_q!*\q#NyCum}޶ |" !2q`֑C] ߇">ٴL>~cR+y /VR;t| 'Y"Û՞oF  1WڇTSc"{P"Y"Z:RoGA [ZѢhu#Q}l%֊!OfIKA! 36|˩ۡh7M8Gt~y}7~x箺B:p{ʐ8Im鱌tn)&/vGŽ]#xAe"RuePo^ShR5'9 y(##|ѫ\-GۏU⺏^-%#//Y%[3AO}Qϱ' Wa}45cB&ǢP} [ZoblPn$.kL\F&wDuP}R˺qcz#X`CcWp"/0Zy4~e>['spY,,nq9NR{@q |jD3T1V\@3>h'k[-''vvՅ{ D sa_Ǘn67h -gvzRcZ{pу]<˭6V`tesH) Ǡ)QT-XpP,KD!VjVyesN44n/+XNueYC[q)dZmKBٟmeA^;m;Xm ed6 ʒۖȾMe{$_^Gήcԇ?8/\aaO$G>?(C6*B6ӆsc@M} 8bTiM]#ǎqYx-s-ʜwjVUdBʣT]~ecF?#($o?Is<Ճ2G}{\1pS5#l(Z k|'B͏!|[oQ0cXhHHC 1Ǎ ~;j0f?@E&Mf̓i 8^ /X_lHm}pÐP;[Pm"Ѷ#жuz>2/ 9P0&M}YN=dXo1=D<-0݈iDŽ &L0a„ -|o+T [#u䤁ys`ܞy8&8yя.ɠ$2scL  ;1u<']e~RUg07 1]L-k$@C}e1u]P* zUV rj7XBd?p}OcYHpuGs>tZWj1!C109@27g jGJ'C04fp[L@s]ۧH?d:i.i<,);ԣ/dږe˱MrG.V\ _sK|Zղ۹- nEGPPr1Crm =9;G<^;[`h|d=}vc\OXk.0ljnV{u~j{B}" 6H| ｠v~QN0 ^fj|6RqkU{~0R.Ye(wp(k u1O,'VncgV)Z!|B-Qd#%?dƋ~F~S?QEۑuZn㇞3;^w=??ŽOZsA}} p!_chSo <6I֘1_z?єr:ӣ☐O"?Úx^@%qOO4_1P>DDb["q.aBjOKXVd\0*L.]7~$-5AR̺|A1j;'(Ϫ ߧe63Gp8>*eeaqDVdrc 3ke?tR mtbCX8En`@cc߆㮐n"A ˀlapJiv{~!vۡ,y T%/_OBy}y?|^&B"w3V"Wۼ-W]JLavm# .}X?\AiDŽ >L 8&L0a„ &LpLJ~_|eZā4[,On&95Xs%B=e"lE&:ғ;d:3 *r9_UeR4I`줋r:qCڏ=%1};ژ-CAr[6kbCۦ!mr6k?NK6d3lSvJg2ey!;t7e>PG.xؕW`LcW0op\Oa`>jaN핇3div ;o,wv>>9g{wm^۳ڮa ?ٓ]\of sZY5Kuw-!fۭ lӞ;\Ѣ8b||`韚}CٞY6 9 K]h+?[bz2Z|P4q`Rcl4%&do؎ |܀`(#uq s{,T_m8?h$?KZ3Du _ .>_>vzNno?3wv>'p. hS.vd` W$70~ac 82Х}}[Yc_".v(G{Hg$0~b2a~`({.:ܦ'0Ԉ4u+lɪd4$iLq!_90/2'4#vWY%EJ$Օ6Ճ? /$#fAt>CDuTPMzJU@DgQYBz(w}]d[SV9L>lvr+UDVѸD9#QlнLD_E\5f #`*[1c[%qts[!nPߡmyp8Tr;hgjl<!|NWg'3Y`#~Q_ṇMԗ O'Z>dpܡ%`0Vw1'|M UROy_rs;;]VqzzklrgK_|z˛=]ܬՆ vK$IJlm~+bl[nY,r.nlmaht|peξeT ~L#ೆ# ue2E5,ns=>GQq]4 @ l11uq$胩x>ePFpC6==p}axk;8xxj 8~ p\sEyF1fB;y1CUN er>9%6:q Z -.:~xKؙv30j~r[sy/_K^u$=oYv;G ^a9LOBx$ȡPQ|`il3юxI.YuAPIo q~Y ?"?c„w7&L0a„ ^&7 eɵ` u.̙x:_e'~9⼛0xN\yp;]E{hw]e^/?{ւ>CX'繐##&@.^J ]=_st' mR)NvN~G+Y\y(˔ -eʓyN7s[ZȆ zFJD(kl1ۧ6R:Y&"(.>z9^HPE𲿠y_>/Yyu[>BfVA8mm91|ޘq Vnؕ_Cd1G4yV ,7e:g(F$5  i!AC>^7e\:F,xz7{ A+\<1*\?=S=co+leV#;jo;ϓ+'3{v3Kml zk):|70G,a+e!]6Ez6[BOG*CT+ƎR_Xˆ%MYR<GۼL}34_C i>F!@>Z:ᷭ!szĞ| ]ﯟgo'_)A,ZV)6,DLc/H_huևӼ{ U{|7 }`X#`16ϒi=fR]!qۯ,BݿwhlfDLQ]q+h emxFَ/:C_+ubP+C7hep~3־n[p0=Gߡb'"A_%t1@s(<~c!m%Y']H(7/}QT?ᜠ~Q_Hck/"4-0݇iDŽ &L0a„ -?o{^̎o~^ 7t1'y's]|} S֑e.,2œĉ'6ywaqu.bws!.tJ; N !,W^qYzDg7TG[q;]d,Ů e5PfF*P}v*J6d4 R72՞SK>c_hbr/gNV~c9{y&|Ϳh"ơ>:ܶt6![Ǒm6_o86P9o֩x{ 8WnKMA'υ[-_x/k ;2VbW7z!f4r(yI7A_M69<&K>4Wņ~[[-cCW(\ ơ0 tnMn=%?W{މ_ۿc?k{kk77_?c#>q#q$l)' X{*b)J=p}~¿D7; .?cS[jvh@s^kI/m ;nCMd|O%<1[l=8x{%/%[%8( ,eŇ3P/ ІL{l']H҂Ͱ{voPA՗e;#s - yxaO 8nOVCC坈`m=evcH2`Uc+Ռc!mvLFIg˂˨tئSwAP LT PpLôc„ &L0ap|?jP'p褔Lٞ ,}xuA|`:B)xAY~Ih3[)%#5Gh-TMܞ@`d}{D!ʅ[ۏY7{q^Y:[G["' FyPz>t"9ϼyA" 9qˡ/5#_m JL Üێ~l}U#hn3`=a]wAغmv9b~e=dL dxi;W1/Hk nIA\2 ݵHUdEX-+̑-N]n olKXm:$O._1'` SV+A+.)bl !Xt_Cs%l5|-حo LWs[]SYf|.0^[wr.oֶqc u~wØfi .lĿvѹHg@W^vH?~h;szj*93$CDj6/wXEJz~j?_}σ+;6q/Ͽ+T\Wpo׺AChoqoU'~kbtelÈ `p[dBa"HL`8>h7ŹF~˃g¶wzJ̪T ^+lk 7uʕy,G^ls=G.;l'rEG}p^7k:f?ovCʑq1`NI5Mɔ ; M!];7 vN{LJؗ^IÁ&(1ƹMEϧnZr4#NEZOA߁BP\EbHdE(~ifX.Xl@Z`hc`R1ТVHsZV'f= `MOp}\^ہ21iO 8&Lx7bZ1a„ &L0e,=8mMO+TxssHA:sd:2٨y-i4ʹR-?w(BcWlzAd㣜 xQ #](aԑׅTtð2>M/Ǔj GH^"!e 0h~ACc$ I"0uMiBmcY7{7 ~bU= 9V8?Y@S=@#_UA݆͌ N % ;KyHr[a=`lO(H}>V#l3LYq:J!<7`,` p4]Ǎq XՆC6ܔ=Ys:r:Q(c<:bLJ  Z4G.95z Lׂ Ԕ:z젍bso A*W8"S{2M: {N gGۏ(5B"h QeiWSqeȶ= #Jbqơ}2Ǻę'<{ p\v/#>̮1W|ʥ1bz|k%.cO̹?G=]ۂwPr`c ӱ8UVX(}[>O{"ǘc#a*8cfF\ 9mv94",WW. {5nc]U.e~ cBsA^8sg0{ ' }I׆B6R^P>: "qehyt|#/MίBMȽNtF'/(#}P??=+.!Kݴ1H)*w1mq3ܖPRqp#܎hd-A#'|61WV! ~oo(m Idn6ic} dLӻkL><4"#l6۸y oc>}yO56*>p6-0]iDŽ &L0a„ -c7xQp<9ϧ2ys\8}YZqYes`7PKw_=Hp]Wb9H2f츎px/}΁ 0J}հ}[d.7:Fce:S"n}#_^]%ö=(ʺ 0P⑞Rh5fe&^R6k` #8΅l 6d~BvɜSm@Opw*ǥ-c[ 򖫙=x'vc:va73nl!mvzo;|-fvf(* N5 9lVCȩ[!38[cnȍm>Ncbh{yնwhhaw꧱ :#ɷ<ȨVRQ iZ1a» &L0a„ /Z=.xR$\2C3W~y₡vg=PI6:Oy@X'+PRBz\[`b|L_aCBek*,Pk֠jRGbz9ǐs\hsthG|h KAՇAu=N/SGygܶ$?'tk*ԛ- ܋EMv&31Us6>'P b /@v,A)"gm/:oyBu^ytN 2!ah1BgG'"B]rhΔd%r{m**V۟,y3,YB1S+8om1yWo@g.Pd}qj|1+zm m^Lsg9K|jS˧rkXk;Y-llrf߷S[ܖ's6ݮfkP%z i\[[#vV;W\m3v+^q˻#zN=OقBl? ~s$Ν58`{ 墣9 ?N;=oXF*ֱOT!jJ=rsvE'phbC F.l9,T|%1e1c);w 4[&ow]NŽsOvup̌76WH&6PL#,5e|U#.Di?VEs@I' ԥ[+%##J3(XTsYxB~@-mxbTΣ>1 8:G"}&b<5v-BJvdr9+P4t,Sg퀇jV/-_ /^fƉJEDQu C7+T'u NȒN2sD/x m{G@M܂j+D R՛(q0s1mx 2o{8U*;@ȩ}Aj! BQl::^(A'ξɷ )'*%80&0-0a„ &L2?7[7wGxM GI8#WΉY+3Tҹ,.udȷHg}|0u划9YGHz /'~ʆ3f -B'$hq3rDEEɲw||Zg(4ݡت?^ ח/H˅x腒^vԇqP$|? @tK9Y$Cdt >v}Uvɶ*-~u5fC1/Y(m(|se/td )n~fۡO˭=3B6ߐDVzj gA#r~dΤ@<(Շpl*\B, [C~$2;M}r׹]*<'|ȴn+a}7@ lpO8].3F[/ 3{fvbkO}@~vlkϮنnvqʮw {_ײE}n[>b;g cGvDހG@ڀv[Ţ+A(kI9w96 i4 m&R96ZX"Y95̡K~G$ѷ\Q78'@LJ~,P_ 8z)6tQ|SxDUDpPX@E1n=WJ΅gq"C :I82y-q=wf;vخ+o߲Ͼ3++Tf+ A[Mʾ@p<㪾|p(24&Mr޵gAV%8vJ5ieIp@v69l裰DĕяkW#bA,Np.6LEV};DD m[񫡫d  KrQM6xw,9tm#mc Cm :6 8#$joLpHUd56*s/byZ1a» &L0a„ /enGKq[Syᮮ,3'pL17}AΣCh99g`!k LqBi7ڗ}UɗbFGpU Hk/fcA81r1؝^ 2egk8E #; xX9d/U@$r-(6#zmU\N?oQ%켜)׹1Tskd1*;C.n,iX'C!e6II1>9'CAjSHLsOJ;Ky1t6l3H(׼agxHdT6&N rDy O%L:GصWyp{4gF^C~Cfz]4C"c}֣:L /YzjzSnU.Ӕq%w Ņ-ml1 ~mg8]ti{蝬(anQ0Sy|W6'u-h6;ۭ!ok7''=x||r.7achYUt=̓)Ü̝E*ؿy$8=HcU$Jp8(9^Tc6 [>ychY oW;ng˕{߶Ͼ+l`y~l# ?-s_1<)C9>gWMQe)=U(TtY*]y!˙RB)DWy!=^PY tEy'>QSeV/LV@rw@:QeGnk@ʉۚ@(`1^pMLwzs>ҡ!EPW|b"lTGѶ1U?7ۤՎԡW)R&6q }=4@9L 3eG >erj_qB*;/$"O6c 8r{GߧQX+8zEF  }pL0a„ &Lx}ﶽ^§o& B_"rC'ž#rSAz-(G!&9}=w82ni|#ezitpA:6n!_1 ;ܮ)}B뵓Űqm5Q2T_/I$գ-1~r?7-z'O-iIlG$"kLPw}AXxL W 4b@cq8Gl%G9mOhIȉ:#pQV#}'dCoCҩmqݡ>x'ps[3JCQn5 N+5<׏Slw`(e.@uv^7ǘb9_䰿@nzYhj]mc'vcr{yܳ| a޼E7s{̞]=ZZ gsaH,| cZV>8;rn,Ԏmx7nssA7f.c81^s-D3d%ub eOl g2|2 u~ʘ ɾ!h z,?pT(rc/iUyw /Om}{i&K5p+o|o"K>dw\'f?1OMu$c!H}W;H=JB2+z}B:cSiZ'R^R5xXwZ/)ۆC"9QJܧQ"vCnl1uz-.q{W~?蓫Omҝ*α~DC})Bϧÿx UQ#c|Z1a» &L0a„ /zw.8^⹩cyY :g09'XLίSy::!W*Zθm@K5ճ?+y@!J+Xm#jRrsm@э6XGs,A1sWv(%6>;ynK~^usR\ ~"UI,@&ZV%D_t%l$krj/L'qqLD.(YMlzC+˯#l`FODㇹxnE(;}u*AݬOd8< eCs=}6=;5Yoh͐6({:ss6G-Xg}+=ץ1K>Ye\xByVؿʡ,@R,DNTl@RAZ1$e5ۦ?-f~/06?ٷ/ƾF R`R8csμF?a\mebp1NȕxIsP&1-0a„ &L2Qph 8x*㜴^a9ͣ .w N_iENթh_)2hvS׈_,`Bo@7Q繿N\g9=oʈx "' Fǰ&{q,۩>3{eX ;nSn6m1p_om6|? L껈!/Ʋnp |Wƛw]A@I״앟7vL?}}+{`oWW{CK{ui3wAzzenfxx\A>_BGթ]׊evaU< |?a3;?[|}4)ųm{-r)$q,g"n0֞ b&Җ܄ ]} p1J1m8F!G[RޠW.[-4"ʾ}{LxT@]g\t}|Y[@67n [ȨTF*+`4s)YؗQ(Mi'N>Ojo\YuG=-s BVP8<<GYOՅ/2Qe0H/Vf޾=P(B'p[=Ls z1Q63>+,wvfǐ<v808֎0vz5}CA@B+c񔠛*ZꡫFcjiIB:$0O_ZF"m ɧRA";]=I:Db[at2_F GF!􈡘V?T!{Wcwy1!2P<?8bL:P">'מb[Z9rJۨǢAhZ1a» &L0a„ /ZrS|ڕ 8p?Mou'1uqg|nผ L9@qKu߃w 뽉V=1צmW-:jxjg!7'X'DK=";N<[d9Z~F+KH㈼Ϋ ^Cmv4JjPBrk@1ǝznc >~j#^Ϯ'dB'IOex`?k1WTPUh۔y!">0nw $KOFS]>`q!k, b/`+wZ4d|bi66|% >!df ''K{^me=z`C{k[5Lk~+wO}0.|Xߚ1r |WCx#_,-vpn܇TW}|{34^ZOᾼv[o6hj3|N)!\A[,u|\.bJ6| x3=:%gr(-c8 Mqy `cCqsr_s>(# K,[AۼcG{5b3;ۿc]ޠ7|:+f` p'o w7277s)x$6S{Te(Xk9S>?o%#m_X=޺p-z+:|{Q!d?‘c1/j GzˆX1y+^tG,DJc 67!6jP9Ҵc„w&L0a„ ^&C柴+Ttnp"ZSy]ˤ]9unz(^D {n+﹗x͏`i V]z{9@RĔ|viwGڨ/w]^lpڠ}/kCDZPK%n?i[=]Cr[KR+fEԻ.l_~oT)jX뗲Il+r5Ch@xGE*7x r2^uSڡlL}|]5@"nC>q# yWN %#t &;A?"~"1+X[ilãۙszL{6֤'dŖG -۵ 8;j̾(#(*?Pjׇ%FaZjt'Dg'S7t[e*Q.+o. @Nږ=wfr3;?/ <`c/_-lxٕ*WklgHlmn1z;xG`^ vZju ;=:[iN̮gvI@Ozkl>E+>Oh!-xuQښ5hsM#\j-B@YO uOJ,rYkrq&_4r E|/ 9~sႎQH?a ;[uaG时?iOPЫQx_}~mvSƲ5:@mBNxxtD?i?/@O]@2ROPFJ1'qHN\O[N  ~2 xunTTŜ>8>خn#GpZ]E']R@Ы ?QY@si ]e;l#. yu2}V[a=s`+xe!HCצ~B80=kz0Tڡ]QuM꓆LVqsoC5-nE )OZT1:C2(5N~oidF{y~ϱkS신e<ԅ"F|OLI*eĖƆs epL0a„ &Lx>7|o!Ox i2y*H7rV4tAGq݀:q- CU^c4&_Bmڢ^VʍIPIl3E(WnʎIQlcuQ..>|m(wWNfˬ0mR!!'Ot؊q1c _]yb @pRɉ- + bh 6ƐZ=[cjb<+'DY2#vcGz|u*l% n/*} q:cK\ge=@,hӐA>43, Tzֆ(Hljb#cNMz˫EIXzm's~|>[׹}24//*1w(?&6^:Nv*v~Uwz: =bvjfĶ8f?}j7٬fҋf֋=C_=%myO"a Q.8o;Yߜ_3-+zn5 i C;}s}8ކ}>gcCdc4/˸1G* \KCzj/&mD<|'{o[- [{zǿ>cp.C 1  _IAAan.m}E|UO8 oGCüRF`d|Px;#a{t$"Gv 0繎|ʜ\CY"ULP)V$Ypv6V:rs+uPp"}Wmrծ**rC6t54)˧.YQ1 eACմv7ٷYhUi4 fh4k 8lk)^#@~~pD[Q]ZCpݺ#_˧~˺737ƶ2G}9i@gDoWK:h})|ěJ DDZQl*ʲ9 (Ek*g,gs[kxzoCc.rԵ3u`phO}{}hva8+Oddzn>s*n`cO0Ц=@m+<Յo֗쒠Wu,A~}_ؔ\KeHG)Ɔ6rXIHyJ_!S2WtmPCA7!/>|Qtإ _3੎߹  (2__bp!:}[pvZJ_?,[ڣLmxw,@k+DƠK QP\۶?DTbZf}Q0)4/h;dXz"@1R>5vzh7 ):ʼn吩}vZ]/'N&;-(`!8"NYFJq[A_⌙%3񺍮iWƺjBk̃Ҵc„w&L0a„ ^&ƧoK΍\/6ȩ2:Nt'%?tyy>GE[D\sB/q].t߂dʰuk1c6[n5v:+m $ o-l`@簯yS۬{߿L᧹zG߄6qO"E:3ׁb x([J_|=}{)y]R@>ႈNp>)9 i_{뵚4_.l}\! c[nq^yxcVvkg3;jGg߫B0\Zp޼S{u-k~ t]sK;W8G0(w'K[.Uqyf =@mfOכ7s\s! |Z!C| leA~Yö#O $3cxMʼ>#ksn#+C/>cW 1uY-3;mب OxcA{Ѡp 3 &O}QePBꡍŮXg"HS92ev!OA3`CPeTB 8$O(q0"УC{nQheMWO};*: YAsiRMqc9w;4}v\A-zG@p`m}4 ک92prx,C&v}RRL ܚg{/aCH-~1qҊqz#Q':tziWT= l'tFm3 b|xu@F&co^cv+hK1`UA6vOEI @ט=H }尀O)u?#Nz3ڟR~~~'^+1)SG7liכ(n?ÿFM?k~9z?u~'L0a„ EY?5>,X\pTWy-~MC:uzq*[NFmC>_y4!zjy) u#n35|>Y5՘Bw;曀\Eך"{:U`T+ȯX2M]ҿuבVp12эx~K&n8shk@r)p_}(pӟ_3u~;>)vN {hec&>bghqQ&7C.3:퍜q$Om92݇3|vͼ,!yrm]$i>ZA @-ȵYx-!n1z@\gem8z`Cg'~)dAy`lcF=H{ jҜsJ >$oglTmFRB:D=MdzNp t@a7>WY0.TFia mX;nO. _"H?\̱m4e >{[=8;K7v>@de\pٽ !,Pvukg;z˅kklsnK`]-m~9dP?C >N9b[=b xA@O ٬gvfo|-l>lrqfW/9=5I0^:WWngmW٢1|SoCfZ?Lggv1;+mg>]1{^^]_]<6|3ЯD23~[Ʃm<oh[!^V=|9ttDy6ԏ89v RQ r6dC $:"&S, -oS+5C]x"udІtr{HCppR.BN9e;A]d˲="l*e[71u;eAcrK`[_R3+GNmQJqlz~ f۶D#ΘY9.*Qy-OWZyxzSnX >Lb^/ge_Q$ՏcQFQL._+R0A^T9 ѯB)mz9} 8vw֡ü ^Qm$#!" }ٯbg#ɏδz 4;B`G0jx}1Vhz9Da߀msu`,@ʴюVfY[Aē8|32zH&_'+˄<}KRWnc2RBrB3;5wTꡓCs 1sw9$D/}#E]%fnk/ }C"Y'A|Dr}ʒbע.~8{ s{@je}3[ G 3b[Ym5qqn6k;==bek[;K..Ys1m`_4^Ѳk4싛y+w\.*Vk~dt{>dڣ=+ھ!pjf<%}[hzo.nl@;cvy٦Be@E;7x,PZTe50xt/]5%h'd\HzT؛E7 eI+,VʔI}c / S|\i^[+^EӋpAP\w] ȶsL#]q'nhqc! 0hx&;( uIk7˵h:^m`w#aZ,8:۹\ts1P<'ˌU'Asu[tw]Y1ؘ?82YE'F0fG(C!HT)ȧ&r/Zt>c{57t~w~^s"`X yklշ絲Au.6QA87j>y Ul{ܩI'L0a„ _whG Wy!n ^<5r =R.8xVm3DE@, ˙HGɎt|O` V!YڌCj"֬!Hgho_,gL|B!?KhΪCB- ٴHEZ o8G4brNsԶ!d#^">!J}HTOYc Up8#}i yi,I R RY6ENqxW<9̓mJfSlq_+U4t9J6{ރP:ћw e@`2Ov*n[mW^%V>&TJނ* nkU|&o+U͉7>{nox?YoQx?36og~YQZCן7u>c?s}ooii6ggg~þ?` {~R~;}t?9}}>j}C~[~}?O}5OJ>Saݿ썷~s>h.n(}c gg?~`~~{{„ &Lu?ڿw|9x.,4NHʋ:z.\C>4r*v IuN흃'" s+nTtv#?@'+آQb,Bl r"~*~X%xHiBBTGG#wv'O碔_xT~B^u-.Z>i6=ZrD(N/W%:Dr{|OeNk +5%*+ID]EC(}$"HNC*1z5-(=Ua*; Sr(^ (;+8uYə$f^%E,Gx䠼XJUS\y&Y_enp1ұ X="IT. ZR.񓝖`Ꮶ@['x=?~КWJ%fL^^iw8BK!^G^$!v93WЅ.bwzT~IzbI88te豈VKE$ޝy K6Ao3[fyf73ܞNm;f+zi_6ξ|/}cʵ}[_x{Ǿkz3z㕥`a=߻_sx`Z,-rifk[Z4ro1SҮ.m/׶⪍OvkМG.g 3o[߷_s_ ?p>Wۯ|tnｷ7V{{>|oyme=и}B۵[޿go_}͝mO mY9!A#R*,Kfl]t#0Pehcuy(].mʍ*eJkVcSmC1! ɤJRJ2_gc;NsνޗODsĎzP&#~&76lVnk6 .>tXz=!;L)Ͽn#?ö1"mBY풺Ꮜ "wj\|Jq"9 sSSBNP@CYFyFqNCNj̞ЏHmM!:Ek$|Gxݧc2/[̡ʧ6FHC5lS9ܒqE1T3o2a0Ծ"?l1b E"`_uv{.|;Jbѝ}O"@om$1PL>4W_[UAic}!|(d?9vk9^ a`,铨|6w ̨k%CMI|}ݨ'^.U砬pް~ZݎnK;HWKh~3,ItcO^OKo3_o~sONүLMkX7f~%9қ>{_{oϾ0} Yz"}ֹi-GJ:x)M}"->x|ӹ'M_OMgcPIMs&Io^./=7~/7W]H|00I/{iߕ^]z(M.|*bJ3si8s č,oFa/6mI. ;EӜאg~YU=s>MVg~#( *ؿtm@|؊yO{ƶxv%`||&#_t7.Nx㫵8G}Nyܗ^ >Ofo\G1bĈ%gFv@GHb!LEG) nlQjgZJ*y jz$G}Lk Sz>_EZ1XYR7? -Z.y"/B *?0#y\a|cCܣi{=C}f@~O=YN|{^ƈjAUp^e},N<&>n|m8Ź Nk.cOQǻw%Q \byϧ%{zC c0y>o:mů08w]eIcfd9e=|ikŗFQ^^zF([zU^Cb˺} 1K$8$Siq4b::1-]>{|t{}/K;OW&Wgg~Ow#]KGl-gb/;g?tzgݗ^Kk_wϽYO\zm)bz^4q5}2yeJ@>*}W GEty_ÉcrO`iO֐۱?k<;<턱)H=ݧ{Եf6aX? o;ךNO"x;~9ӣm0\AFbp}o|"niװm׶4: vA˷ӆo.Ǥ ;3~H\?omƕbR&bk;k$~#N`=~&f?Om]y~ܹt6w\tߝw{o iqŻ㓋\Ե+_K?kgw9o|t<}Y{&￐׽[A_[^zgޞ>wK/WܛKN޻VE[qoW<}/.-IvOsu|=u}.H3>DZ]wR-m's !{z|jZkvC]$bz,aBgkڈ=oBusÊm7GU;?<.$kk]O5Z<ǚmhYW{e]#[ ;5D-" 8DCFq}l t/ &ĊyX-z YeCAzu~8mjrv{'0֖xl[?XO'qi90bĈtJoM?oWx _PyǿxWJoƯJ~P#PX*>V+Az(Vޛxys/Ns\})ѲfӸ>tڞ7"~UƳ#F1!_e;VrN#.[^?^$Pz]m"&ƒ~}ee,ofP,^$Ӟ7tkݖ}w\rhcS^"Zچ /HsyP|xvs砾"CNM8blp/mS߫n%oA?00؝]iwMd;rF)ls/ROwz6DFw+K̛k{(7 Fu5 ݓlj,:8cx76uy-@ykVz"jZd]nFV >4Ukƹ-Uz#V*G|r|Gezc|#ݎ #dRkSf:} _+K9큿)9 d^ݎ=Eezj^Oۛ"3]Bg_鶽E7y:/ܑߕ]+]xOm鎋ws(g3O-ғ]?~Avy2͗vŷ輪~>4|J/F#] t9vg kV9jcq*{;vwJo;Js=/>aC:VaFh0QA, (n/ngȲ,j~{;"qkgSm5]sfs [A9uYJh^ A !h` &#`(/t[u_jɨ#k6[;c[ٗNTEFpTN> Ǝb[n;C#9OW>frnfP_&_3#F|''ɆGӏGo +Fq0Ż_}y[o’#F1b/Ix!s h?W@>7>|^}6 Լ7#Lx=^ˢ #VI9W :Qz ۯvZN}ng:c=ùq;!Qw Ffxs|]ڹ`s+ƅ& |mPy2+2,\1qLz}lHh˷]Հ\6@EqΔc v`~:-)4*.(o-Ѷ?K ^ڇ|Z:vCkSe(QCo9bn#{\u/'tZcyk th鳤R*+9/c]T19[dSqq=5NoAO? HK ȔFƂaWx(<ʐxݞ2ueQ䰇,zY~#Ʌ)se~>n-Zq۹IGߙ_8_-9@JR&9cT\-~tc{~L_BqA_}tC{)O3.Pᓦ=}Dg&Hh-(UFɹ4M Ə.ӻ?>O?]2I/]StA-#>I U gy*ǝU\_8pNEH:E6kSM m۬>삼([z?&cITzc3yӟQK>5̖;g@qm׎IP26 h}/E/ 8F'_/Dy(}3F i,0Oߌ1bĈ/<pIR(K5$^O5}5]A) !խ![Vj&(+ \y> w]˯WQ,YP-?زa:徃ܗݯ2odQ`B1>aG0CFȑ/]@s]܁,.'re~S?DyS_7= \g"|eQz_FA;@xê#hm H|s+ё#N{#fޏBQaڃs{kvX|%Fx܈hD̵{_}3J>cqP嶆ۚ&07bKXkbz˷QkmD`Kxv~m{S'PK16[[3Oz;r+fԳekLДXȢbm񢬲Oq/rx:G.zkE2-ƕ7(7!h *nᙎ@'`ξB߁d _M 6U4(E9yn rKdE&.؛;~ĩ$!d*\:9SɅy/쭴(7C 4{pA;٠ͅ^ax\(!:gAn[%{iop&0;W0)':Jj.]:HWR|V p,R_C8.B-0? *9_Gx c6Ώ"ŏ~QZAhCbwe[l-̰H)ZA*ԈIM-h9 l'͢~8n?:1ljE-K|e\-Yܴ^/ sع0ڔ:w,e=wӃ\W~PCb2]lӻ3 װCڮȴv%*1.1SO1bĈ#F\@ 8imf݈޺6y/QG_z}^[)P|B[p̋ԭ*WsG[njݷ+?ʢ\mZ+M>8 #׳WhV?Z2S3-~\:8c/[M@;2!.u+[⓳ o]1R:}O#<B*f_ юzuXE~rʯxoNcz1," 1})O5j~E_GqŴλrw5P,iד{LME 9y@/9A7ۧ{U#P8)a#ԣ/nMB}xʠsr.p]. 8cOG B]9U,SWu!!0ޔ?A!{|ڛ*B<"r^=Jr>ү>#_g"MՍYZŌ7tt-ki:?J˹?qq\hMF*9Y&0Y CwDZnddSFS =P%w9j&:ϞדY,Azӄd3ztDs?#/ qvG=nYCkmQ̍OuA_CҷǙ4ўSWQ:u)ȱTϥܫ]{)@7c7(i@K~9E6}8>1'r ЍOSsڪ qLjp1bĈ#F8Mhg>\*cx:oumj;3_vF=ĸUL觉byUs!K/ /GE^z ;>*jfPqX:%X+*hmn<6u~T%u| '㻯hI>-〴#a(2B%| |_^ܟe7]^q1/c-@H=C)B6$S n/8'7lLs9E~PƧl0 r/\/\jl(GEgK.V eptaZBkx"У=pr{<.CO749ėgdڴDWn8ы63%k/pɾIj2xӤB̻/5!=2-Q;`&/ԉmz; IDH92E̎DB 亮ñ3 ^?.ae]} rيmW=F!^"U' #>5|;5bĈ#F1b᳿/W|פwp躿kcDl_)kr GEo 5/8/[UC,!gg菔r}0ʺo5Z<v2>cmۃ9a~NV Sjȉ,W&_^lmJ%m9u!3!f6ߴK*Bcd 8 0T-RA>s-G+%@ c }Ŏx}^k#xuZ+`xk2 (w3}0a|[̿*dh4v+{wve\yѶ>dhsPxWKFN5bYP{Z^˶xU2}WϠQAY#Fto0R]vݴ<ڨ$k;lP[ ?ެ}xE~(BLWq >uJ;y,{9(B:k\R"rUlC/w/`}H{.؜/fzEsxkoV|EIzɋe+ߝݑVwܞ;xZJ3"P,ݔ%犔Ԗn)br- 6Z0SCZÁ8kx7k5yA_Iyt[<1// =Poo~5qG-'>{0:'yf[>h;pT8ۢCJV_iq16`og(ndGCkOQmY!6 oYCܬh ū|AGyUXmbm$rZkYdۨKmuͦ>d<&[$X l] $3oc SLyЅ}=e6."L!.\5$\Y>b@Y 6<0z qacpm0ĩQ~)O_Is^zWW;߿rz+,<i#*/c Z `܎fi5{bQ^6XpEmxdy(3GV$>ΒqjHPϝM3Y}z~ ~훑6{k &P>Q d2/-xsırDtv4}r9VpQ}Aɷ?>ǥݱiRP7#چ1##՛ۍ6N7݌z}d!:#(!: u;;yYe84bĈ#F1bĈ#F4W8еnV7ef{:eMxF~cxD+*em{Ly-[o֤Q݄2ߐ뇀bQSfnStΛ73P:,Ɣ|Hm\g-ꮣG:;:C؛oalA16Z$XE-d4Xzxq9WEH5Z1" b,9X({Tri}Os6q1XTcPF^GWG Q~-}gQ:b`)6(vr Fv:6 )jiu`Ȏ%Y;Y89ԦlV<|f?Ե;@\ . .ڸ}o?{|6Ѕi !S1vʧ_Ur=-OpҢ q'Jm\;@Iڇ5N+8ZeX&Cy^XsfLE%J Q,rCv6PgfуUzp/][JX󟮧w>v%ҥEze'}(tJܖARnϦg޵K)]xJO??WJڳ|dGJGizJ{3}B[~!%J|慲)?:l0Ƙ( ,&&My>!4._-v{H~H!F BX|٘NϾl6nSt|?O:O <4=~=)^.s?@<!˚v@s[ M.""%`_ [>,K} Iw*偞K9f*>amĈ#F1bĈ#F85:ӮmIk@oPuJݫq?N5R r[FeB-K6(;8 O1X}E@yx?i# TW~[/e9Q|p9MT-?KJd#JֶZ>V͂NFڜ2R5;8!_ȣN>~_fbt$R"[d:ոyLY#(vƨՍoEvu?cǚ-QLjcN&`t^t~mon\E\Iha'} >Ⴞz^>Sw/47ž.t pJZrVt("I[Y@}s8!rF$lI.}ÔJ~u~EzUWVP'<7{?X+˕ez'ş㡶[v<j=k@\M[ Jֆ;F[^gөtyz{Sedu6^Y>Ks ῼAnS\W1fW)pW=[}]߃ zq&uml*>>Z-ܰs =Q,k4:8)yƏeU+]ƶ_+TF #F1bĈ BߜB%KսM{!|oE]YTeKB\?GDPLs}$MMPsQ,}<1dɁ,38^.{ϵ]YڌcR۶-"dD h[ r{* P-Ex2Kus목-y 'oMV{v+?=d}ЭSXnNAWf**I|P{|h]dB9+ 1Q~hbG=}'Ԥ=gي kKzZ96;YOg]#-~; S|PϪ\tlFPT nrxʕ̇!&p>d{Ϭ{~jӜ^U Mk>} Ɛd,f?6풓3`U|Oyb ?&e?(Rs@Eu/Q199SDβ7ּ+\%T"lݦawyA_Yz~铣}B˲lf̯,ٟ ZAy|B$FZ}C>Yړ8U+\q1AyɎǖu7)α@:Dy%<"}pMSh_:8JO]gk@O_Lhsik)}RJ< :rBDޅ3&]iM5Ƌ%Ж99<raDB &9i{D[& YM. -!58[ >&ɅOl.~s\e N z%舀 ɊS^Lbf繏ʯ%j*\n+3:wj9zʜtd& ]'6a(.[|n)G >\jJثtږfL lӋp]-Ve1t%0Rw@Pє=B0;"TC~Bj§l۬b1I>ƪ ׆1*l[υ(}SR}ےsC*5D}\Uu;.j$_f9p)qLj#F1bĈp_V{i2O+Єu[Mop!C{,5.Hu.?cݮh a#xA6yvd6^kw>mڑԏkw| NE*$MV֣z )5=-b3/aE|k=na 9BMWsàSC T7J2-3rY\QlAN$_|ܔ*Tu/} \R.Y'.(2C>ngx DXB[`)7oq|?/(h0rq-cگA?&"+H%z‹z}.&6<< :.T> .ٲ8B:nk#?DiO]o;Q#_ ާoOB`zPnϒ1CnEQphJ/4a<e^LB>-SY"Cc^] >p3{w`'bS61bj ^:c9AΡ{-@-|Z!>x?La@_ϯ)Y..|uڒZ:lȇ"Gu 198KTqͱ~5|tpEzb>MW2]ٴ h#wBv[ڿx^O2=s%-K)ݸFcPȿ ]N VA L(NP,^U*g1r}God}];9\X2',L{v+(!o ~Qɍǎ%ݿioz6z>]xatK'evM]k9ޗ5dcioC]mII; 9}J4-~w<g\-Fިd(Ror_OtZ؜vǠD`NĖs2Qq+Ĉn"˕~Q|4o=9v ʰ >(Wט1|1ɭNxR6cI/RKWrv#4*g(AFVK>EoD}s繮 C&XN=^|"dݪ*hr%čqBd2P8Pv-hc//d΂O @KX1 ;bg\.?r|A3ȎИU 3I҂rI:ZNa3M7!t&*]L-ǯ)=z*U f:J?S>HO]tҕv,MInQZ^?LkGZ1!䬤Yz$vCȘΤsty.ȅ<ۄO-9k:lމ2;fLWjd^"(OZGw>W΁xc!I΄QW<|څNV4!>|O'plBlD`-!G_[rkϓ1h5^ mwIIqlrq!?M)9RSΫQgvBycٶmo" աPĘ#O^mv?s wt?UQNݼ$×7'pmOrK>|_ߧ/a/xF1bĈw|OYwpzt>#=W+qW쥉^|C/ܜS|M'~Pup҇î nBZ*FUV!/AYP~Z_fK(z<֋ae?FEwDnt6|Xϋħ>/KA叫NZ1?G*սp{C׷y( 'I>mS#ґmndԏ=ks1CJ>Ku:>itJ+?౟֩WڀUi̋ /{~pXzݱﾼY U /gKF~mA㡊}/lƳG[G:s݂ok,ޗ 2Z-z6ȁ菟=ؿ/iXKRݎ(sc;zٚ@Vŏj!j>evO24[qk%]APfUpԎm`MSy1/҉ X锯OYMt|+/<=ǹ޹=$/2U, 22Daf<Os_yyޱΘ)!t;ҖSuL Ioh@~-]th}}L~iqFJ .^@L.O $-)]_rx \"VDGQI_L`t@^'8EXw&y$YކeHclv>k `'52kŸOIu6hQ<gƸc\Ǜyx(\-ȖϷ1a<\<=1%ΦTژϖܢ};O!C d} 9}mExmz>cДҘ#ke׷wdqctMۘ2E:f]|3O2q׹㇃6-G(>B=˃_G+PS79 xpM 8xypɲK5bĈ#FxkO>gϾ}@7&|<6_o]|^A] TZbAjj|jGZorF; |}V#'OYf;[bcg޽%e޽ 7ݨ%f.t}Lgn`OpEeo+ݲ [K9Hr·2#}o#"PKmnys]i7`h܁s7[ sYʿ7D=κ(H6Dg>b|/~Zتz6z۟dKAOV-'^QY51 uԉ>zu}V='/KǪTR%G6>j'z㗷:$BE vbY|y'ǔ=yɲbׂݖ<>ogDg`-{YD~CnV!•䧯qI V^ I]We@|8T\_aq$lpᛍYp.qQ .o'3B-`m>} ihOQئ-QCz_b]aDls Z)G5A$=uLO%RףVivZ"AZAO1PmL;.MQ2 v)]GkW05F Lu]hQW"+$_Rd+9u_']tr7,5)Ɗs%IgXɰ@fM7STĬ`'{yע|nxyۈdz {[S( NW 0< #n k96rIPD;9np m{ <*Ww1bĈBY1bĈ#F1l;>~wYk3xex+׾ZǗ,8\G]Wo֦DB~hX&{\|nu(_XXN^eY`ބ޵]SmF Ǹ6.xl"n1=l;TlnNMloݎ5q ԈcJgl8V[7-'@' ktg4CT#"E{wem>z^rx1-fᅔtAZ^V/7L>MQګN*\AJ籇  A*v$Utx3fe\_xrk`ﬦǦ{ưiqst6 4XISr,:NhP!>ʹR pl~ws0qBT 8Z@"peO4`>A#=1jnYM2@>6N؂/'-@-D|8f$>GX:x!(1' W(g_,ws`#FqkSF1bĈ#Fp\ek Cyp^ #bEϗY>LX}U' uq@l;"=u<"e7ByҟpfH"u <޼ɩk ?"؉rDK$t!C ܛ{SR=n*`)}I|!Ǔ0Ɖ̏$cJp6}SX[LER8R/gNl1GP7hqcE~y?'N!2^+F~k>kWm9ybs5aܡwΪ<c*<,ouJ%z\W(K.wp2|!_FNy 2e6_sAŧuiuS!>*cd?ʓR%0f"ONOG@:JÔ>уUzp{u{}~akCW{\.Eڻ|&R:brO|. c6eSN _Ȕ:~'=y>IZV bt8@Lt[3@4 ?vɾO͟AY-c-QhPN}>ux=Im# GQ?eϓ` Ѣ\"(9A~R?s ߾e[JZ(ggѰ&AI|&o&#͢򵭟>[ǃrzQwNb[E+}C [JQm?@CsF%o巍W>c|l;Az;1S7{ oڈ#F1b|sX%]kW.< ;͑9 <*2 /8p<ތ7$uڼFʝ_koe1mA{@EW"ٲOGX? f_$z$YI`3sO(~lDr߱\#HZh鶑G4ߠc:q]nk0l Tvc%C0Gen_o>D|y>;!?uy!k[kܧh&.44m Qkj<+~Ɇńuc#*,>߈纾 #!P{Sx׹v< QHʈ"#Ea!*C&Q\ Cml>1Oʃ"];tt {iWMSjo/͠'h|嫕TW9qSkh_2gr/=$q|(m~كY.Nҍý?@i5# 9"zz{灬[3׳?Et}ԣo.ai.WT<>@"^.&\eK7bݏVnm=bT-Q!9TMYBP=$}(m|d|)<&NGD3:v@<o6Kvb0/UD辽ry:0[tqvseY'km=.oy|R^%TS;Ƽ"'bOcjqV;`ht #F1bĈ#F|ÝJ җ\:y*|⇬`:.Qq%ʋU\Cb!^:ъuY[6H%['$x|CHKI?I||'uUCVKA^!v纃 b9ܲi,oGB>lR%1-#?+c#*y$~ݰ$R )lx g,NՂ^˳F%\|cuT+rZi uuLWكt(ݘ!^o~O $A(Y#НsAd\S|\,}!S7pUWV{~zj1S7Uzh> ezEOo\=L]9LW4D5,nt5>g2C%A%\0qc)'6z\O+Je.M,.]9'ac<>ux6uz2=p" s?: ~|ߵ'U e9\TOoJ!>q?\D!aIVN;Wz(0?'˜\XgkJy֙^CX䚁ZC4b3 t+ҩy?aJ/x%K8BBϥ[X'2P OYmxk| צ^@Qסh_^D4ir\O$6}8^8G- 5w_VџYmc ŵQ/}`M9Zfo:>$/suZ' ɶq?+;ߝnSkI98ċ!^ӕ}oc[#RT y_Y;k( }hZV~q.E/{3xvn\?.s{Z`qX? nsg"p$!п:N`qlPrAśhs cWa}8t./'xO#ڟEEgyzO&>i~VZI\ՃwFڿ~=ݸ&GWjv99n\A MzCW ;Թ` 0T+H_>saqaF̓\(y>E:o#-iwP}`7C`>Y%kHl)gM+}ۿ w99 .Y qDgsȇ ݕ8dwVC:bĈ#F1bĈ#N\7wH?˸àuiC۳=/ ^ o%Sh$>P;lCNMl79Ŀ:s4 p=ݻ¯Ug5آ^.v`F&.hܷ^DH=z!d#~EYnj*vȺwr@Y tD* Ss,cD]jΩ'|rT?PF-iE^FAĐ|>=x"l߈׌Cڇ7`:@o5i1zrm kh馰-Psq;Hzyd>|n)Ʃ)#o`Y"mԸ]G;};G<kTې܄%?E77 ty>+eWs>MGh5cgЙu2vC7_K{7_:ͮD4; 8lQƊ6pEs]<3/CysW!s|u9]ϧ؊*}·$T%y@ozXtmY^:@ge5ߟu@~Kf9s">~}e׺hWC}v10w>&"B<&/W 5;ې۟9isYp6M `S^%,DEq.e<@10/Wr{hKYp[hh">cyv ±†Xg)|J3>`΍kйzv%^?ױ/'}A̗0I 5D|F'q\[/ʫй  )=>1KIz }6n,Ačyz sOGsi*F Giu(MAi:COPr|&8S ZAZL\ϔCA8OۆӉ/7v ϙChh{@<_vIE6Sȓ> X\͹fkU 6`HmV2(1}Wp#9$Nů}3L1Rf}q $С; hE6>  o |([{~m/Bm# XP6ٶC0_(cnŽPeۊƸveͮkbgPӃEsġyV9ta 2yɫןO-<huwk-) ܶf[wN7v1S??[wW|%/yٗ?규WgWҿH?Ŀ3C%J oxCz{c#F1b_}Oo)kyKo{yN/ƹ9|y>~c9s/J|R=A4K/y6:ʺ%ڼl|]+x=^SuongrXRp?(uJ? ЫTsd~wJEy#I{!qn#??$d~^`g3MbS(;T%dCM㺲2weRoϠM{j.?"u.wY6u<0]UQw[!bg;ڐ~2z }S)8z1 &VzNrSº~N  wQrs\CЋvBc|ONM۫?ϩo}Pr鸏 kXim+AOLgn ߖf~k[;`Kcj ˞ Ot3eߌ ŔZ<\7O''_ *ǟ"eAÅRыOՅj lG^vJicg%Q*[iIJ:EBE.$`9]hE>~YXY.>=/`}acR\9ŽIڗ,pa8.| hBp4_^rurA]̇!9]1$t(B2&Y'lp!0ep1A>cx= hw.#h(͸HD\foOxL8䃊>HfK!2 # gDrcɪNױTnFNKD]_Ru%v[Aj(Vg+#0x*c@ɛ[A2k@1Wyc|8:j9[ i4z U `1tٜ+/-!.P&Gp2ʜ - 'owNCX)Gh8:Dl-N m3Ğ;'pt9q.&Y$q qJW|,},},}p>xϮZO7VB\-:| I"M/E˴{7fizsʣ-gGi>?LsW@8!r|.ꝋj|yjGz r>Y#?]MZhg&uIƤm!8GHۥ <,Ⳍm1S%[X5@yQظ=/Qe?RW vL;3R;rc7:zzq7'C=Nlm{yOt=_|zMT> 6' 'mS,3'pnW`1&Sn+{o= /3G#'JϝG S952{%"|S)+u@u'/a>B!@so`󊿘+e]Wt]sO|Kp ]_U7uݱ?x$X?e|DoQ;FNmeO|nІ:wy42lbc&) 9k1ttvEd7뺥U'Ǻt`U[ϙoyz868ʏv[1aݤE8qc̺&bF}>t [1HYA}*C} W=W3(jRȋ|;r{yl9&"94ط\^@<{呒 ǘܕ`ttt.8/%sLk/ 5`zՙ,|\1[hmPB \rtџ\-F͘:n_m Qv,^u;c%)ǰRRƺ#\j=3\cߏ \\ R%b]M~D>v%/#k;C\|x`:A-1/8ej7[u{2Pbdӂ{G1EJ? @|ǚd 6c@kC:>^l@y#~+Xb ڪ<c35ꝷشư )MvSW}0xu%#wnHUW-(x[}sbg"ؔ5cٶuBНdsn~7Ėxw'gč\ 8Fí\qaB;_;kLO}gs|d_?u.[_?Yk\1bĈ#F|,p|+~ozkZgx~ZqK'.z6zF J]j,6RGX걠_  \+Q,u>Mu7s[p=( 6hKl#F(v; (1 E^bWY+y3wӀ.ЦWuvۺl mB dD9`Y˵Х {Hֈ)|؎"}9/\67>NYB}V'v+p YǮ>^Xk#nzwА| cw|x||% wcEFȴi@{NZ+.-#\7'5~xVqpu9P D:| Q>.#q(<i~DЗs.ν(jTPt61Y1 2,EZf!ءs km^ea D!DذSDֈc݉u{hE&3c0D9U6}<]8.frpnC"zS3[0$s"*1|Z}-b#Fīz0?Y[A|G>fo7k?bĈ#FA&|nc0֙C7xO+-^Ma*KtT.e7J^ΗA:#_2Q* )Ôfnn H?8 a^>b܊]LuEռw?ie D+*r9+i QSm p4-1yw9^9ZK7(WiK t ~nthtU,3r| NfFpxJgPb yAAy΅ u@S&Vx.^D⹩Iȁhr#S6Ԓ ?{lxnzAs"EM%Cov!ld)cṔUh Z'rx|P?1=0:;|y83NhGH?q@_<0'kڜ#l@zlcmE/ |Fߢ0 trK(wWrO ;qH?|Id;ύx\!nyWp]1bĈ_K~ߥ_Nߝ?Kχ^aS%/1bĈ#Fxtuv` :sG޼ -@M];.e|nqEuh&Hj}_oOeM`k('P*<.0= ڻQzXt<*ޟ(:d'Y[u=GG#9enF@Q֣3 2Ĩm"/8lBѵLQBidn)k^+hz_☓r_)t:my?)nƶpS e);1zp"O5+(Nj1_I.1 9$034Hz>|Iuڇ41S7gFGi'l (՞ϐ a"@|^RxLcc欻$ ,3`Ѥ܆D۲IwsȫUS:)~! D4Ǽr tUo`;XFψx@N̷;FSDx="tߎcSI /Ҙ숀SSn@k9/sT`zg yH7vA_:r'ok(tvT, +kF1~CA_+'?>rCWM?I=9S .|o#F1bħxspkb:oB,õ}שѸ6!JP}u:M&j=#@ 5# hU<>],#5Pڱ6#I%Hه!b3ExV/psh;n^O~Ǧvǁ谴'{q!4&I|ЊӀ@c_>2ob~o 6Vr<7}6O*K򦓴1s,Hy5?H󸦂5[:L]wihrLNG:`dOHVr1!iOPϤE#Cɧp|=O _[I "?zTO_j+u ،܅GT<ϡ˱4CS7Qb1BaHmu;>[tR(z_mp]t qc-%sҟ '߶q=b<yKF-^9bNǂŕM oN:N JRfM#F|ė}ڛG2o8ZTJ#F1bĈ]?Zgb3E4xjװZmlA=%~WEޤOId}jll#W+c<#T Ei[qcĶ ^Y5Cb|:?Mouz|'۶d5Ia|4n z;eǯĦķq(bcaS.ȓ\Q '6f_Xǎ_&D};stU~;4cqV!߳-m*م?=W$r8. =:^Za dTrt56@sv~8TY EZΖyC6.@?$'nn4< ^2AIEt>Ohn 8Xj/аz XwB[T#֫ů.vU o@mH,eD;Z<,QR5>)wx~=> k?z;m,R1yL&/>N }tȷQS ~K}o9 j?kU|p#U*:9y9@vG.6tͯ==3YeĈg'|j>/a \ s?v=rvApI6U[Ot)xl#Qvq-{xo4p1|cH:#׍SƧcĖv g >}ɇ :~pD f~dFD{/ˣMp~ YziI e+Wl}-C>eSygfCLh#DOG?m`Um6YU gwSOa 5cz-),eZ$uFZܡ긾;%y|b,Wu(\CcM\47_2}N$"`:zl3FN3}?ȋJ۳ʢ܎WtzmTq_8 ݺuFpe[U?rBڃel[=2ycGk7b%~xo*!q̭xCtInDĺQ@eCmjnStu{W_bah_sP& 6ncB%+6Y@9UMs'h#Y%;bĈ_|Iɭ7>/Lwߑaܔy׭n{F1bĈ#>y^j["fA}LnkߨqW/1ޣYJ ?U{Xg%~_|϶xM?\/,:lzQ!5~rTU݇wlv/[6n "_jq"鞩w@fSjl;3x_c?$52}8$l36\o;68C:☈8~o_6~x9D3ö9#,}-Zl Ff43cC4mXU,^eMeW侲d?W }t$7h{C@'lgΊJԂyZΎ R0kRf2ŧmb$Y+UGNQOx"k`HVGwtC!C>ǚ'yG*a식UՄqƬ')T16ԡƉLC=bvv`|<@qKӊ8{yLi 99bvU%_1bĈ3z0/+צ).B~Sۿ~oH~nz^:3^0H#F1bĈ[kzcĿ*8֝b^z} 2~C(]/Q_)(~ "5ޠ7rP&2{BQ-ү-n%4O QsPlWe\"/q; ȵv\:"pPy<[Ɯ~b_ѦFl:vWJ#!>ibO.Ap?ca`(\H7k>_>[A]'czc(6+Ǧ C1>H@{7ZZ]dsj^L5az>>Gڮ6_v`}%0P=~gO+x[ECj4\ WCTͪq|FeE'thzy_|y@#-`Qo%|po A}S/ԙSu*zet(W$0sI/{v3(ip:ͅZ;I_2MVGb 1dv^B@=@*XNbyPO>~IZ:x~N< ~.,)~a1,0XgDֆX`eRD 03?X7*` D@:5, ~\^2/_akf*5Dm뢬^DMzql7> 1N֜۱eLP赝"Q& H1PZp50#B#F|jޅG>]V~mݯtj_RIp'q|4NJ]ڧ.ק1bĈ#^kr K=#NvfȻW`~o z]ӷvS =jH'KԉDN=5,y8hցy# b<0/M?ʽ΋t+Gt?8C:| ƨym Oqx3tr*>) 齞u!_;/ٺ1oGS۠ѣ/SmP߹>d~Etzιǡ y֤BCE>Hk PN'M4胥fFsk'k3,Г6č/b C (2*>e?3ec&bSThHM qQjB;C9(XB G6DjEv!*N{]4+0VY}жy*6g :>v>.UX;~<7z}|_iw3cD޻mw'8Pm](щpY䓷6uwJƚOp]F?k16'jw/ 5ͻraNaGu>yg>qg7w~}~-=vQG1bĈ#>q =ELעO0xo' ~pO._CL*7ޥLkKf*jП[Ϳ,`K<^9gM&1^c-Ў|[Fg>M]u#hF/9i5+%4r0llہIhGU~/ky2#lcݿaY+pl[c ]Pu&j>ۑG=~}X~)p}݆cb>kЯr(x:7ʌ|P3~ݓNHKc(D@(7{ qPnjK>!B}3;xB~q{SI2ڟtPrH&ߚ| ~cK/cs/- sw‡2/ebc/n q񂓞cY<޽Q):!ӍD>1_y9\!b4Xړ5& -w5u>A#CO0"nX6DKz hv  v| Ρק:K~oΝg|K~k1G\ᥓN;9!Ғ)WvB[#>|&s%$F3q(;2 >\q bry\CZϥ|1xԴ<#yW3~\#?`,r㰁vh\tOOʸu{#N Bm8 #6}c~9x<1q1bYwU/Mu^yݿ{7ޔtz;^}kQG1bĈ#7>n[ZD.kUƬCx%|b5Z7HPũhaMst_QFCv߂^,Z\iӿ nnm+ِ_EE)yC+;` ݸGM9/>`mXd?}DEs qsa8MewJ}s1m:q8.TK 9:fnq63@V6O5ZB~/eʿ/PTJAHTh zU궠&al&F1AŅzfKȍJ-@ɅaAa?ЂDpF@čEXxxAC|*#x,WZHAUңp ||ȳ8.=Qts\ʶ:-}[!] P}HcTkfUY`9wJr!hKq~&>D'Ǹ&Po`8s!=/H{ Yn4t#FtK]*#9w]Jo|Ce_g>q#!k=?~k;ҟ_1NS>bĈ#F >xVu8MJ4J ֯F.̦Q_>Qmo)h:lQ,d#@"ZJl@bm[r֮dI~(19~P.1jkS|r!Y{lz:>P7X_$ہz}bľѾEB1B9iBZCOyK焈1c cMBT8q, C=t^.Ƭ`n8doL@^>hw}'T , (oB4S̱AZ/Рg᯷xC%[2A)kUCp.V|lkOP 7[s/ưףd>a 8@[1luPХNROOuM<yGJWu϶U2Od@̃MCR1vE̫g2I MhZ0xc~Z9l`?̽l6QcM&"0WX&0bs6nDTA1ht6ك{I:S벭~FϷ CNE0 C/9Gql㸏1yj}kӇ>BlGj)}GɃ'T~MU'^{Õ{~!xtR*_ד{@l<:15) '[WYD>١],3\oTp `y^Gi>iGw6E)9;98q\M^v~;_giTx j:+v8 Neq" ~N |6d>b?w|S}ufs9}W>k&He=M^?q|݈#vw}wOIoQ=cئiw+K.3MYû?*_z_m5"/zOŧޛzGf-ԨA[_ϫNI#F1bĈ]'&oّxIvף~Z~Y{hvgRSL%r!u~APs %|wg2+7볜tipf*%.c='q[lXeiI j̜ۘOVqзWV+V u4:U$+WQi?>?kYT}a߶k6[q'!vЉqkGu{iю(y5SIbc/#Iwlw룠lͮ;j %^CMUژg%؇{{w9ytDꒇp  ].3B].3ʋ=`X&0 8,c/!HOY]:*O|Bl"mO ʏ8Wenۣ2ɹ"/%a)}E5O)~ @n ϭAYwPW^lӏO>z賾 T=:1n|,(bkKdH:YA@ʙ$9bbi_Lk*1kRIO_֓)ϝdG#Fx0򖷤7 ZK?s?~~42&rQvr7>fsg>j.O=w?6'skp繻~_~Boy&߻:G1bĈ#\O";k0c9E+u3^D^׵u'ʌWS$Uee$Cnޖ|@粨\ӳT1`4w6FEAL ˘9L^8*)!7a^$8u7:)nmI]dҽUJ-079l,\yH?XnwAk c<Ч@>.(5Oczk3%L:eJ^3x+ĶrmKg!ϣEȫO[} ˳i;<:(֡} :Rs|p!~BE>NUuFnC^|wŚ]m(j".}C"Sb[$ --hVGB-,€.5\_'l񞜞H1``f+謖]$ͰIulE g23>?5nh/ -GĢO Z.R7o\zFm$Dlk3Vz4۾'N M<՜G?wn I-3 Fj`M&o Љ'1"Qc(/ￓ󦁊 `_EQM\nۑ( V"rO殓)aW!t1Dm WxYv4L,P:?F+:(W8}O9USy>5)oB >?P_?qs?켈wFM/r`kIfs\u5Roԧ݈#F1b&,W#_uv` :kP{Vp[tT5jUwzmSZٿxIܑ O@e<]D)G}ֲl@6fY_2?ۚM";-Q]ZT*ǵ{! x7*^NYN:R}a5k;]n٬.|C?Fd;vPZ >UpqiFUs mP~%JE\!>K L.02 . .q 8-ʹbE'Sّeh|_ 8(IZ…⍴j.@]H| e(|%ئYwH1Q+D>ծwrU&=}<{s<3uHR5>e"@ݔҷHv,},˜8/1v!}Z7qZGNC1ڔ4`vV!1dē*$ۄDgMѿczk6N]`FZ<17#]wyrt6u| cEcK9.s0s}UgoC}1;X8yFؗx}ǮƆh.pA?w_ K9۰WHLUlwg<&V/ezUWܞy*VxQ{I<{/_w_XJߓO)cޜM݅CERSoLy.šq[/\T"~ 晵1v!Zo+DTQA#wxXg>1p_=_W./>qNX0y?"(7:xΞc봑Ue2ul[q dZلq܄V#(W˜'+c8׉m;9ԩnۺ7IVت-P/z5vje bZ#4k㰻} J7Gm}{A{Izԏ|GB{V& GC7_m^q F=;|: _+ u{Mn=(to/M@j‡i u7Ssrqz _dFFcZ6 >/22"(8~:n;mO?+>5薃!-rLn&$AG 4A|*<`^FcwlTzwQXۮ![)-Ta}jzG\eh7~LCǣɠ>FPrWS5韀Ե8Cĉ~(GCa[ʒp,CkN 'QW*%/Z|~PN@ȦK+U 4|u$ц~#!nX[%SlY 8m;hbI-@[sۦT\f܀%#j?C6E[`Ow:t~F&/ U/<U+|CӖz:"rJ7`+T"> |[*.rQa~:^8+TNW_W\K_L_/z߼~[_2bĈ#FpVPqy.4_'Zt+Tp{PzrˣF`ۛ=|%d*<. #^+Tp |;P?;b?C]|m/thb^'|xwS,nU+̋x׼E2C ?2pcO4E;BsCu~ kCH^9-=O%zWz3[Q{g@w4.̶% 66m źX\@qW׸ϒ<Ӊ>qc-yFsg(^P-pg$]O<9C^c?#]eY"Ϫ_fDߎKGUA˨PbuQxrsx_pQw̟XdۮgmBU|66Wg՛ smMgz7 z[]qC+؁s+ngu,5#9N(>Ͷ{u_C:R>Ay"\v_Vy0&s[ "x5? eo'o~^sKDj5EQG] lmmA?樆 ccpr~u˺5Z<qS5X p[fo횷 [cu|I8E0 _r$8򎹅#,ry!j;N(NЍTONp?Āiohvz!q\9w$W'؏-;cJ~;cI/Z{u y)wW7}K<Byc)=E鋳0{H(~ҳ{fp7=h@=`zK)׿.'!`/Y%w U?ޏv6E1SG;IeG: 62˩hnj|DZjmC~^ESN8~H k!krnÚtøM{D^Z}"jH bAQM1NJOv͍)$]mB/ 2G- eô<:HA)ciumn $.NUHQC#B?|_YbQl[@oo-N_>l\A^.'\;n ļNuh H(cɹr툡ǀS)Gݾ`!ҶF[([=D!fV&nm>Zr3s$S( dHMlu'WPzn!lErUqx0k{PĆqۜ3>5=0e =ޘC]3՟:xrm񆃋8G#F1bĈrB3şS"ؿNeԡ.mN)'2kҽHbNh]`u?N пȧu_jaFƶO<Gl #A>Oxna CDOx(qZCsW?[:[dAGyHc\J-}GMWI@*90e &`[' 2oCܳ5_Pcn}uXe&L4sPbV5?kW ^}F{8ƆM=<9ܾOrыzE< 'vd K'oDl}r㭡嚼B1&-Ygnf=}|o(K춾PB!ZK+}q|ɟumYRe/fAlFF43识'9ygj\\hfu>g^ѵ qܴu_TE#傇tlthkFN)iJ='X/d̡m'ЙOBhk?}O8¼`=/eE) &2C5<@@ӎ<'Ga02G'Ð!LN0jpS89VC9}vq$χRq@n9}טz4}𤇵P=x^><Վ >G'uؓ-֞luգk7ʩ7bĈ#Fq.iWQVc HO7w]oS8]x#ǟmbUc|uh?% s=slT}gln}| + K3傶m}pP? a :5Ѕ$=^D;|lN儏6=>5t |q9h>@Z`qv=1YX۟-|j@H̩ @x"6XԺmdy.=$~99_s>?}L|bFyZttvc9||C0kURG 0C|e=y[>ES4@\Q!YslW mnpZLC'wą7E.qQ-2IQZ)a=1] 2䃋;/-`q 9R:'{#~9xTm8qk#Av+ISV]ĄȄSU# k8i#@7 ixcxKN*Diݢ7C-{|hGXz5q'㛾w~w'ndў~F>d_Kk߭'mcJw=1bĈ#FxLq XKHhd7|m|lXTՖ@ A_̦ ϑ(A7`~+޶za_QuK /cDآrkPX>8X(Zc٧FvJo,8bI}t4y6ñW`l hcy|-e_`E\&K /6(kr俪;KD>)b%XztÜaP#ྐDYGPhAQ|*Dr. Ϗد!,`yϪ CW iYFbϊ>8VN]"(W>5o4Ϥ eI^> ^ __d/}eYYE0cιp \ @\WpNJL+8 97|46p|A2>d㶄Eeqv Mn[=-GrEĈm$" 0䣙N Ap@ i qÝJZjH5T;EP쏌s̱\k~9筺=s̹s? Am$(Zw-dmT¾#I h|d/6; OX٪~8 D`aݖ\&"^c--dI3BRh~ou)t2ƴ^Oi.bߕą ĵ+>S| [7#l^ͣW J_XkNCrV؟Mzo˯|_~߲5Wk<ȷceS  AxhI"b"'Zï >>ݓ5J;d/#| [-/Hض/5&ڶ0MQ~)/g5-Q7m|taʷhR<0V rQU2Y2rY㴇?~)f=Hh ԋb֛`7r {pB)c^>sb~P@1cRΰ:r)-v䤖׿.=\M@ h@4N6e8{Ϸa3|]]mJ;n} *7qeP g% .C\UC+3}JoH axa6c TKkѲ9jt{旗ٗ??p'xƟs?O7FP~_e ۿћE~3X /'x'x◊_?_w7_ћf?5Uk|:Mُ6UQWe,8\Oym"VބX Flf 1t[L_Nw5fz1&7a71R} Mvhw1s%uߴe?*t*5d(ډ@T$)5.K|04GQ A#ʩ訫qP2̎7.P3ɃF:lf&oNvU 88kOXXƼQGvP`/Gdm) d^3rڌuC۾m2.{qs P5 EHgu/bݾ0cRy83 P6\eV:vCՕlo7_*`w?!9GmǖxPuZăq~frMhХmd >%ahϔ);j=Ҭ{`ӆs{ư9CMo(eP[zxQ/O(>֫ןϦG7}}.ma79֫o/mЌ4"K3m6 Lh甃Z:0t*^8 kW:թ@P[Q* Vh+:rymG<$u]0ǡH.(<~{McR+( 鮐 mYhu<1 ڪ&U^n (Jb!O sbGw v\bʷBfsh.帏?5Xx+{*?4/<Ym<0|;O<O<O<oGk\hjl.|謠*V%|~  sp j0{\m(Ƀ)6nLiuކ̟(lcR!@9>C@Ƅ?!'qSk' aӆl?iA'oU @)c҅,bXĶ qT|96VNPϱ"v8~.] s V'@tqU"c=)@?Eź|3> >ٙ( cU-ww͹%Fb @b^GtFO pBcv}ZVPWb_O߾|?~yG+vLl>@"yꔶ/̗ IԮ4 o.aG/XUgfrkſ5 (ɔ"6G,!G:6ԋv/xBiZ|/}#*oVo1/m`gf~B}ȃo|VA> ab_DMA>Fqc+<d>oJbścU ^\9Gѹ:G3ha6(6'%dL G سbs8(:Jj?ʔwz6R#%m18 4ZVC|-\%6dZb+ʬJʠya)hzm6l'O>ޞfA_C'[}+oG;V}_˻ wO| 7jݿw_~~/(3@r /x'x'xos?mP/ѮQV _ܴlL]Ъh^t_K@-aTqPV?ɰ hrA ?2" |~7kCnJVNd(`͙/gnOrȖg}Uvt/feWq>>5dsQI.E},4.#h4谄DnQ0W(G{u$*BEvݨkK؉x%l`*k9]ǰ+Ƃ :ۇY[6}ޖBHzDEj;)k/-** ʢ%H*'^Q@:_S|ͥ`hoǃ/~|Q3?u,>;D#naEeM)shG q,O_iTt^GՂL4/XY_ӆE/yh7@mзtRD<, eM/MK}/ u}( = N yam<&I"͚?v- g1ڐEXl͒z("~-(-IS@ok! ,us: j& m*dAs~m;΀r5еU usEOؽ9_`*"py4ϕuk9,ռ0,gN2vٕOIU,X #9w}RʭZq2fjاY?sB?pgiD 0؂ϣ5NtNkg(cǃw4@K;h gW'lʏg(ICډx3/j?~~O W_~oͿg[o7w卿wig8 _7z|<B'x''T[/[?_^>SplVpm^ulY&9'MRnqfݯ}`\+@!}#@>et28X04?AxGa}۰aJBDCmc$5YćIA@nP؅X6# i>R`:\ >= & >hxteV0-cy-x7rdA30 r`?j24j mλJ B.#dq[5'$ek_p#bl;e#(Ѵ;|{ÀZbvN.Q@I>Աڜ(3ʓL%(UW퐲O~`30˚ra-D|Gف+i$9,;(C,*@dg#Хt+qni !/-ի5w~8 ôY@asZ&QG྿p7d=v'm]m<@8"yN }(X ߚa2䁆>J# \kxza\074E& , ?D ÷G0f\1$-Xg`+i t=+ $㥤x1NsSzB=@:s/v(lPÅn[vvvsO!pV8l+pZ|*Uگcc'8g*| \ Xƃ F?X/Wɩ&rCg_Fk>O&/aԗ7??!;/o\OO<O<o޸zy#P\j,t@[(ŵ_QB^p37 Sc%gs O@CRߺnG%cF9&!}0cp*SM!61;GUv=Nv0:Hk>Z6O^~?zۗI>vuGt؏v*/ԫ|4E;?U"zqV *UH~ am<iQG;#@/K{n=NǦ;;x 63^C|/O{'+-zD*$`5嫒AGˣmvenyr) 88woeB#ѴF&s[O![@mXC/{u쾁]>" h:RaGcT>|e ~zm̵]#mbmj?6`ɰcmo5h (~Cc|Nt2Ɛľla͖3|>:x xXaᮡ8" }J 5.uV1+ ?ΙPt ٭.'TyVCNq>o2] eV4!ZmPiIcv6_0N_lˍwq3T<\~@ 7:bFEAkc|a;x irҮ|Psڢ*%lG}OP]ПюːzCFI_Nn.9TRׄ _ʰvij/u@IËnЃQG]sLٔ\oOpNxCQ#TEkqDLϿ_ܐ\ȏEAr?}C(>k6a򜤀b4AilDCÊ61>N\O 0clomy*/e{r=.Q5הA}:WSQmT_g77$SvhcZXTvC#/p1NAIQe@MS Xh賋f>},T>hcmCV{8a',E /pv9X!m& #E ?6X8T YCp[1d% >&qیtq(h˺DH_ |Eݑ` E0iB0 ֘Kba GӼVW#wߊ:s{vfK5U. [_ށ @5_?^$oqU} *h)`-bTMk m.zm ZEG{'BnT+l=koBqrhVƶ7q1iQ^ }d?xف:|a[(#V`S/7> tЎ鯾a@jТ8!YR1ߌ"t*}FƛlyK F*[ҍ:&tw{7صv?:-7F/(Y;+d`So d fg|MЦ1Զچ![C7*†ּd>EԂzNuO<O<O<WN\u|~'}#pĦR ƦTݠ3kt_S@A*\'d&V~J?9rƱ-7c2Mц۶8~'L%bߛ 34?UQ $/r܂OO 吆GbQt|v~]a^c:>|ՋD>>|'+_~+^8i6{xR~l|w&^`EW73 x/0h?g/B*F *T-m|Y"^}+~4W J"Q(kt8ߥO/> _yd_,@i=7_B^6]Ip;Y?V.0| %bç0kl/J$=Q*SpfcW~a tR˟&Q",yRQi+]uh;.lL;GM9owɝ m5V:*?9 b,1wEɓrbO<O<O<o_Vl#3xpKE~} BcA[+,l;轅2D@B}OfTED`|Z1޹WwܞwEv>x2U+ey b@lAg(,AR 9x3t5Qb?l U 5޻ }u~ i~u~q3XAm_Ç/_>e_˯|6f<7lT ?IG Z]r;Y!9Y* >+ڷc1 @hic$-(P X* j7ɠm#~G /O+ }=\J`eBib'( Wyh8ҏjzv:Ly$or&a}d)4uD|mo s)6+'sO<O<O<O<\3i?| C?@g \Cf>˸PA[\[=op2brʨ]i,ծholY ?A=s`y I+\[m,@KЉ6hVDZBAq\;*9/>E9gS7`vr=r*R93o9Ʌ[m[tOb!Nmۍ_2g9 w%Bga.e<(U}76L~MLO+.ge-]pn_ߑ]HAYTwA0V!kX#j~@ t۩薯pO,II82)k} ??GϾxߏχ}=O<O<ķ?/7]~o0:h&Qt1DL׭kko>jxI^S̤}4I7b:'0N6PGUbQ?+(J . -н4A}6.yOn ܯeWMcAjDȹ k5!;a7yņ0>GLru9VӽdW:}O)tۄ1Yω__poplͯfxv}\{AInbsEǠ}#;VrD<دqB/T-}&E 2x"!×u@/x#t./qȎB,G|~s UA&1sB=vjv]$ '1{~#+klA`@~C/0Sm`1Ԓfǒ+Ͽq}{@ jTfca]zԩzɍ[\kN 8}<08G B_He lyyY ]$tbZr(}/q?k%'siѠ %;Q d)?x$97FI6eV11,x/IKGNShy+0F4fkk+ocd>X&{~_Q>}GF'@(,.K>P O>T f$ f;VP3 5.;jg9dzz 8dmo~3G ߪT 9sAFg~xr̟|CCZ [97jtGj{OAmМ1F HivR7U)|{[Z];CqH-' z u ½5%Wx,qG-U >68abŸrVƱ wꢽ+Cq * Zn ԛ߀ƌ;9_k}3x(UTPE~ ,sQ߰9F=6񨳄l?X=m7gi>8wC5섣Qkn]@tBگ+o?/0^Rq\22>_l{k@z= [⤬ю5Xel<{>tj]I͟ q-cZ]ŰB7L1u2ąP^Bc"3c |N1x-AN՜ӆ@]0>6+ y@l+[(W =jcBumIXC_M xl\臍4To՘:Y%ƀ?2^6|{(v=$9; |PFMy,/्C׏s,3x1tT eƋ;_q_!g 94>>\G!4kFD?N&rBq[b?䐾 1Ck~c~MFM)J"rxu?,WU`ȸ@=Ccs(Tq^I|Q]퀆d@R$+@Wu6PjL8~a/plo >O:{Ų5u<Ƈ]*~[5.\kK0|&#^ࠜ_ @~. _>͗;J2nЙbK^<}N0qRB>etTѮڒ'@D}.Mڅmٳ%j|u=nc'UŲP_ )/@9`3bȼo1|0ǕmOq3ؒ⧮߱]>[wbX6;Oz}@f- u{$oRop7k{76*IZc ):-9 @m||dXkR7+r0h{kǯ"7>=B;wK@5T;: m]hmiV R1QVB5΅imܘk mKFJ4~t51>;z<>'RzYs : *u> /@g.*f\`dPwMJ|zCЈΔhS{A5F7PǾs <dӵj3XdkNAئaf` HB|5b qtw]YΔ e3Cx_nc ^ y@:(G8#t5չ>A_=)VO?e Ԭ7~G :pol#c `:ib)t8Hy'ty/W.q KX2>-2[rrAdq[3])ĀCf]D|;0"c$z5žb99]67U;3y3f'Lh#.Dt ƾl7Qrq1r\ǺA=sHo͊W(l/j;P\䀴a)g5ϾRF6-ۇַE&y= $k\ˡӕ y2wΟ={0%&ٻ+L(=7r hMk NM[VuȘ^ c[%gt1Lxa2|qv2 м~5}g6 k﻾ˇf:|92i44Es a;Z4xhX‡_X㎱g\p9πtmuL@6&M!;t|Ϡ>J}\7 "P /j|[ǹ5kЯ:}n`Ç_>G8+8>y^/p^PbVuu d9Fߌ:.JeG>*K ga;9Zb+'_{]tؘ~:{Np>fN3-on=ɮ ͬErsW7'*qELIr@|kj@͙|_Kx]u lPck9ؐɬYX/Ns6%ľɫxlVd[07qyr+M>|6t6WB [c3&L9S9TvHi |3^4>h)>hUa~\)ܱ D2e.VFc)|p7h=KQqmQף17! (uX_~khWmuۮ2I;ĮӂμvA]:-,v\}f4ٯhp仳9 M]d.:Ę & *XZ)YlˏaS&l3ȗz@PӠ R&}0dǮQe*o݂.4j8O8Kb~$7'!< 92; V7٧yA7Yþc.~2xym+a-{}/o^֯w1q"7W/p\7"?RW" Se|U\*c Y@9ȿPDZ`W,qSV/p@x{? ԊOXuB?-`}/pH>Nڢ=sr P ;ƕtc9rj Ѯ 08Tng&; Ek>.xBy7G(﷬ qkR8 kba_c\k' 8"X2з39r}oGlW$RJ0 `wܯ9}#yqc՜3^d/>$􍰉_ ޫ ΟVt3{휦Cy `,61a7N;?_à1})IWviMcv&R-& y«O,Qֆnoάk y|П} dhoyC~kuMc/thuk.–?'Ix< 3 "l`Ū-w/6Ia_IKV}_W5$QJ4d@rޝg[^E:}X5O`<8f?-ؐMI ^.3kd8A J6' ۙgten=]󁐙f9i6U(Wم u^t淨=}ѿأ$v}>0Myh(Ҥ@ेGE_/^B^R<ѬȎxاZ_ n q/&?^b Qh#Wt 3h#W\8_ۜۀ] /1ɆsZqGilVbO~[VVr^Z| : ]v'<8ΰ][W 9yS2w~%Y7'5TY\ 2on4r :l^HGh;"u^U %Q 1k2EhDG'?5*Z ?xlF?馋ٰ#u#^壯ɚ]s&vs@ ~re6bv_٩voXoz[NNma2#~|SKUݐ=cߎN W!b_ Jͤ-`j2,n~ {g暟_q3?igoI܉p{,)iuzVh)ݠ x$/1O^YrD] M; @6Z(hm aO4k#&1D;y6z#L'cׄ7BWzV`%BؾO,@'rTso)A_'nt2ƒFJlg}ZTk(Vau^1֮\wltwpΆS\m|?#>[ss@7uMlnCȤGǃtd6>|'3^r$Zbq6rL1{}Mb0>9hM2jx}D}A.e#>^j0(xX }H6J1hQ(bwC skѥǸM2N%@]T88e֌gA%GvF$_kNjB[~X˗hG"Պ JЧ5gЙPlU-e}ЛDwhαjFs-U}P`F䚇q.L+|'1Vr!ñe;Pn 25NP^J\esR5h\dm%}X|f ݫT̀Ѵ}Hz=j6fٮ|9w Gvh+[QV(o.7j#M `:goV&!CD^(!MV8!Ijcv:j|@< i i5=^`$bτac*BzZ\d~mb-IG)5>YG@)ځ i;`kzBr|uϽSdZ2 GƟr!{]$YT|o9%:nc+(WarɟeOq;&%*!~c/{%3!zKr,/z!LI ԥo#NsQ$MM@h6،m'qM[v@xQ}O&ﾑ5D؇vΚ{VzIU.#c r"XWj?gbrknOyfO[0@ՍUpsP?Z$; %{-w {kx;wv(YG)@A8+9<CNvO3WkXcAf0Y![fdG1Q'Bc*mTLS`ge/p~6#,|x3یy8Aj'׀챎Ւ$Vɚbqo'f#Pm렭ӊI_R偮>x ՇF0<%X|uV:lHjKF|a{ث|P bc2wDKc xD4ܗ7|ٿ0l_O%/@6E1N?y(SX+HgOœn5Q7Iy$:yHve>Y+Awmۣq7IFak:GRO/a[{5N遌)>]1k^RЍQy1Q  = dQЀbrc1r ՠ ᅕ27d[!UC#P\%a ]aDmV%tsM-F}6"8';Z?x]'SNHG/+>!dZsK)Z}Т+NVN2c("zot۶o_jMn:~W<@~(b4"8/Go:Y3P(2 AL!~1 Ǔ'Lȥρ/?}qZҭͥx0PJWPLy,>?;,&\H)Ơ#B G"be4+y{6m`9~06_9I ۜsm_Q|^XduEx-0YØopMV"V)#;Ե6̧8OK]cmu?쩏? ^p~^7NבʜB%a zl 9'%|+&1rph/~",T AM(յF"XƜs2?3V+BƜq 2U<1HrGAU|u6R whV?ٚK4 r*&_a,p+' Qsq_kGjףx7sXP/pD٢ڽaB^z::֫|92;tosMW`}Z y$sq5t‡>n5~cNnEiÈ˭=#1]7asȓA9E?!v](x9W<<l9w!>\pxxpp.)s$!]컱࿫kf wr;u$OwI6v*ɎH7FP*?D/ī EntVf6Kcbat6-]vhدg4aG:Bݟ%6،|F\Vh}I8Dn|P8eyc'r*[D?VU_9bIt)gzՖ@zij@Voqa#aUإ^8pɞ`quH&Ѝ{>I+WKɾCl9dh&eCx1uqC 5dXeԱ6Ǘ1CC_VE7}%_OPmTtTi%ّjkr{T]"L^(]1PlzLdMb&\+?㘾udӮju V]Gڇ'wZ' WNe.vV1<j6f~PqyL6Sz2{27Q4րc`urѠIa}}h!c֭}IUz|}&MVi^^I5dtgF7Q lQmts,>cy(Y| :X<LPz,^`PsX=>;z<>onn{Ś1@]ѫc(rWot>l`8 +XtkCL|۠eWcUSݱ::ǘcEn!+ }2֌7x/ׇyG{3a T]xY<7g{#70ǖ5p.ud0G '+, | gX`~`w#=9*g@*58Xޏ]/S mLoTev>bM'{˸ d?3by]5Uv~c팵o 7X7ݍ.Uγ@MofUUsk؍%D ԯQ_܌r<˿|4GN<boM&/.eࣖ.ֆ-ʺȓx?n^vyesՇ#.Ѯao7^yg#vBg ޜܓbD1v3Ly qrϪ<|Q}/j*WT%:yNqF2)Ga?Ŋ*cwK1S OLPNMB$ex}}\|;y?PUO襍WAA dy ߒ Sa#ٺe~>mtGPM.\v SF`aҘ`{ D oSJ_&&A5נN gA _SiYhwڹHD X`k6!c5_ t%B&d}MJ/;3>Axb-cTP@qю/@1'g%\ȁgB4 qyX}byƯ۬K9ȷl[l%V['@e;>m@!Z|T[ 99gο^@p5czz⡶B3(A+~9_hJ>X!f%m(_0Ƒ?xFχO=?F3=^oIOAo4ɠ(0PL5mOߒp6hSt5(> /}Q#O 3~D:h$yUєm~$x 7|_ ::c= ؞iZf>/a 1xf k#e`mzNll}fsNؘڷ2;@mݛg/cU,cny͂7XFqgq߃Y]7O ߄?7b_X8gߡ@ 5{O2RKV Bp*6hze Fّvf dNj)8Č>0ΛΎvz=vuc*e1'?V׼+tw'|0b^Ċ@ٌàz8<>ÑVԵCK>:Nfj(_x8_5dž6Gz''+$O_{\W'8Fzt!Z!:`_v^90 sk's{GC~f*z\ vc#ь f+wVra7Fh6.з5Ĉ"zfbBxhtἲ}T?)MH|١VS"xVkC?݆b֬9EO_}}$d#az]$W[9?NNM OyJxjd_LXcx,iMv4 fa{[qxE\P;d%V(/ HY#/1>%j<Fy`0.Sg|+M"!bU)ikBǂm/:fqlWtfŽ!H׀6y(%XlVP x=ĕĴ},.x M1dةg)ل'|)80/|%T2舑)u [G;hkQ/$c,֏|)'/]$<ҸG`,Pe;KrJloG]r옐̩OqX(8FC~-mkYAm(ɸ<͹P s}KEz.>>~c|ʮaຯ'Cje8E>]AL:u!Hk|@XV2b">8& hKz>9uIQ!U5?mQM5 yyCo⓼(VNq\+Xk@𼮰\ &J2}AvЬMmNʗ0v,࣍bۗDi8]21vy A4PZ4b?yj'?Yemrl[pѧ5)>#yOe1>Ȣ.i's_= ,灘bD&8+2OOKTSLC3z\@ Y*1 yGory]\ex[DU4W%^ 'Ś9SQѼ}uLȬ<9균8ϳSDěy35=_{~ܲyvАaNя:GH $~BhXW8 Wy5NlzUNl[H<䅍%1 \sf&JoԸӣccXVX 7O_)yLoTev>|G {Oo8kzc3h/z=T;5fcwX;k<<=w ̩AC{6͜UZ?q)>7ƽ}#jU}VzȆA&+ݴ?+ߺȝ ~-a@n*+uF ՉU ؈m\K<P;z% S=@ r3^+nT; 60mu2d .)@]b|Nl|1x+_m,49y6J8!3dtw:8G9m>__Ch~C~v/b5}kVĎvW>cbUyD] >aDk&tl[;rC/s19^0G vxX3O"i#.5FmTlro|M{KSRˁl•fGO+Fx.<ϿN1ĘaV̋Ag]Ɠ:I W 0`胔s _o?JDZ~9mϵ@|[aַj>%kxg/p/cȨ@Fi~q t&On+-to 6N}"uB\ ky٤]&oxavV/7i(8VhV)/e-dj!^,;9LUh@eڊDյ/ :&ض?`mC"lsJdV 5 yGŷعF^<bU{'-s(8*H/?[*VXrslqMN'̧T[&-oU(?v<@fkr߄yhmн/(yUNjoeLV!Pе X41604g"3_'eg63h^Æcߠ)S>$ 9,cE *OWdv6>4;.vo=mhѧB|.XX0yzh.-i&E DG>hI_Жo`/d5לrQI[؏Y9]YG߄FMٷv{x9SX 9ќMѓq(P񉀴$9_4x>۸wGum/Xg \)@R6:͢m1V<"T6b㶏>F _VyD8`t`|`\>d$9I껀?Ѝ~E hLfE31{/{s;ȼ2Пc(Bc2 2_ ' y@>M6a*ZW9&L[rcXEdilDб>:NFObc*/LX?Ѯ<1gRm98} WӇ֩fHbۤ8 vS<zu>AxZ~G`ձġ eʃv<(,q a9˝wm7'w qvoAʤh~'@y5|88 k1N3_󻢭PcP@s u-m~k<\>`r} ܄J\V^Wjw9lcjr ]bZ5HR@2> "0jLw]{/z-q_a{ zTг9yCHZNFeޣk5&rCf:.;8yC6˾M6W7+]ݐv>u>uv^|}{3iѷUS<* ՟JowL?t# +4YXgXpB2p[4QC "z՜ W` ~ {ȠrU͉__mxU 5(۳<6:ڎ>W^_?Xe&m>oQu&|lҋ)+SSL^ƵFc`?CO~)Ya /t>nU@Vc@y;@~as˾m3eIiP.c@r18<*d,^|̈́Feȥ}۾A>3.00['?fO~(L:rSasz anl@J16g4e1u}8?gE/Cqdw؆t>/fEm  =ra{6[]D*?9h2p>NbFS8'rp_]Mtl/~.T͊x\TLhrEo%;H;#Lj~,q[;OƓ\ύM|dk/p(i|/͚G|Ia12!}bF-NmCQCghxcAк[Ŧ ;Bunk|^P2>^fw–QhQiwUd_1;b; |>кk~İBqEVyz[c^wg~hOs_lqec8a+Y5yc!}PH^.ƴ qD.lwݖ[> _E{WXs粟O0gdvy?[Xݲuc*ɌZ Pv/+Z0(tМNd+Ƽ ۾#:BJU#?5h]Qc1!z&c4/!>p\q9S x.!ٕNU2Fw|>@Î/7{!l6_VkNZBmKGh 51N9{Gx o>\ıIQg3@"x <ҊAAY٪4]'<(s.i]JLЇ'PwO+⤌XwE3zuu'e6,XRM+`&?ٙCCVۅc8%a2*@Í~Y8c0:[:?N 59⩸c.CULc/F2@F)_cnAG23w3 &ch5 luF&1|xٴ:R݇UУ= d-rC@5&|1dD6 <J8@ۻ!>tCtgi/|&o/x41>Ev@Xp'>Uڻ#V#/m5;! _h HvCn7o0|N]}@'@uJQ6Q ?XMk6M`: } x 9z!'V:g#ħ<_ES/| BZc0Z'PB8c7?CեrUdzPMV'u CXQ,Qq,8 σlN~aY #ٖOԢkCsR:uLN/Z;޿103qlakuC]P-ӪDSv ea[I}W?e7ed;r9y5_?Mgňob43Ӑ6Vkڐ*mF n2Bi8CwwvF~ k$d9N) nk/nz,7?x܀>8!80@oʵ!/B6p_qHo35˱b"49Dcft堊T+?:ȨX"=|Yh5uOaǒyRkIukK / k!/P.kC@sYDZFYvig569V8(\c@d'g~+-m~ݝ3(<[|~tԸe+9|VkXO 1[ƍ|Š2qЀ7 w_e]^p[>dy#[[\CX>c\_+=+:dEj%xSh度9<'m>i ac8^ 3[[?QO_y\9<_ohÑ1XvKS:cvP/ufvhSq-[j LcU-}7 ea x}\k}u!vv` X`b.#VAle+Tfa]l~ۏ6p2W Uk jPY]ĢG@{SL>ԷFZ6eǬ㮮 lH׺Dt9tu%7xOMOסm X1ÞҾD:g<6jnѷ^:A>7>= @a!6hӸUm;u/AOC e>Џ2w>+ovrs=@3wgf u.[Y7(sڲcIE`G_uڏZ`8v\mIzw]çMCdQFkMUܫX'׌Чh2\AVKBx1u̬9/BI+@լu#֖,6:c>\y/pcu|8 :`r s Yv@W PMY򠖻2x9ɗrcqx*5%QslOm׺S{K}4j ]V|o @J {bX%0\6Ev} XW cΓNS%&c4ineY~wNIb5Mpt|5_o{ q{uS0Ś6:[ti?Ʒ[|K8]LBŒ8t/Ǝ>v=he h\{'['nK—. vnos_ON@bNkB%{;Â5#n`ގ$`؝1l?QDza˫ Ck\o+ q! >wk]nμqM=cx6X!d`[R{+ZXͥ hjOͬo̰z9v\Ae+NNc!L6z7sB^"㫘'Wi;V=jj-ukCjmiؽE#л1 :54VjWNW9s$U'~4'Kg+trNg}yu<&fclደ8"!k-lxz 49Āc 8d'Q!PKٱxʕP," %D)eЁ }rlڇ(aZsp֘B.tiĚlOnsb6cgF/z7bu' \XJ4?dQF/C/;1>: }\#+ .5yc+vk>lY|N5E 0["d_07Is_u JTMXOη"D09V |A Ov>{~c O]CظJuOtz;yv2w6oe[PX*@Vl+ˊ|@o0\ NfPc?bP/q6):ij\?!8p$r\5(*oױ_&[}e*ݶ[۷)7B.iNZ,w{5ĝ+.ǜVs,gr%Amݝ cb-9`gI4\Cf[K;x<]~v(uyVŰ٭r: xCN!NgMOm2gzX+M98/Z:M- m>$#{3lX6t#DljPo^ UFΛdn}8m wlM|8qaCU\T|\Ӥfy$&ԘL6wqNxu XF4qX7KP%WE<L7{-~vGAe<)?K☔0a[yk/8v?`Jm`1^Tt|ѡgvSGvIn+Un}4kйo\g؃heɷa5K1t@Js}@7 رQ9dt{{ W o }YsoGpCVt8葧>Zzu,ULp݇۵IghUFm0Nnb~@u3x56\Ĥ>%;gS̾vȰ6%=r j:Ղl?{g1} u=C }|mﻢ])ϼ7^=ŷK(yiߐ/p:,fl9N/6 @>1gc`r)>s·sǴ6j>Q ! )Q20gL4Cvd[8tզtq#^؍fcHCmCk4mhz$ov ^dJ-A~=SL =!ij=s,/Gqޞ/p\{\ DntīHz876!wFknG_$LpU껣ҫHiϧ;OGyV@GA_+{m.t9/pMF*H|ʨ4TmUI+D6{lL" 춃*/-͏|lپH ߚ+ ƼQے1[Tznn~;h`'pƻ;nm['7].͸3T>rœ1p<J \vǸZֹt@Uv7|X@˛'*GG>"!ԸVjТye]E67 vr;;[~Kd'sWɋZT/xҖ:O`6]c=wiW. ?69tucaò8|?p#W}yʝPmq+¦CIoC=aU&|bXMjV5|7VȤ6f繯Ds zvlx슟w[u7 t7}F?HYOy/Jsd91hJ.4cv {!h]:_1{Yǐ[2hs"Dr)#O΀|/l'X׬Df]t`MZDo3L9:=xęUW^?5<P,WLUvS~NcNJ}/0ж',c;sa%|)Cj|&:bi}hjv{A}/zAR 5Q:#v_PhHu9K ѷ7D' Ѹ]U/8!h}oL(O}n?2hmaھRFmݝ` 2r$ѯ\^#N|3 ,m5V$ JO u?v~9\Ŋ-7>:s &OT8YE~rݣ8oϟPy>UeU[`=f;w'*2h+{S&b^>;t1//䃼wt·x!X-lc ]U /u.@|+Z }pjoE=yxԶ0+< -|WNVewñ y41>[Κ<]Ԙ3FK_F BugG«C^+*M 'aɃF\ |]XG6w/pd wm/pE/pyj&MC%֙}!E}aFYݮ)rF:hYĬH\?bzkGQɶ~n,6j PnM<ٟj N~X@VWkUǫ :e5qg@MJl.M8rL56!ݨq402C 12@yuS~n[_@4]f2߂(|DcgӺυ [6 &}E!P%Tty1*jĚ2!`}݈G/p+A#y>znܠ /p@t(6 'jTU{>;c+yi=kG=w9K{bSUg y, ~G jl>VQ"2>Gdʢ:睵r%\nXA0>+kթƕ2Î}uS<8vP.eM_bm'j W(8"ɠN+4p)lB֠%@Aru!&oWN/MK[fITy#/pPm܈W{/:'0\.Π{5;|tlM#ShW}5UKl" Ovsfr+qdd k*"8,=lCDOP˜8 L6ۚ4k]E%Cݴk6ɉ: ]`t&eB4Vg;=v<>1\Ǽǝ {&h+tkx_U(;{ 貛xޚk 70@O?уo?@UXu8ڐhf<6k|bhwsyk;7c웭:ƚ'_*_}b\T-['nNح%aGZ/$y8;;:?5x l9"0ٙ׹,5> ncj*ܕ ⑑ԅNUs4 ̾Pd<4@D!jo >Dxd;Ճ$Eq ;ƿGA]̥sD8X6ˎ4Ő<\_2Vk[ 22?oH<֨ۘ0ك.<<\籥Y*^>.%[_MmmrU!礘O!>.<(xfo $וC82cu†~[QGyZ>1i)̏Ud$CZy3_9t]_/0b)JRE mtK`sC%٤ȯU<!GW0~/PI{,z}8y iSHV3Cּ􂿋g3l U-H@|jϱ+ =*A}D6Ա!-Hl;}@)nǂY\^m_clXgW%=e}4l+_Նo};}}q d%g y]OM⟲>WyE c Ax$ԧLU xмptv>k2N o{Om]ݧox1Nn?5yIX>G|:>a _0Q C+t_~h<ɰA5 /8qyH;v&,6y%A,*Ӽ  ;@n tYIlU?<vQЮ&P_>tڵqvOX*tt{֖\ļ\Vt]2u|57^pNhs#q&p*#QC,[4'"lv-N L>@TQ?j.,#;R30]Z ~4 nt_#j5W8W/z݅mV[Tax?&3+]yNVj3ïΥr'tGnG͇AsUQAC@m4<⩩k?@ߞނj[E{Y =3<'%>bAl=w bU^ݹllg]Pz r}\n$vz Sѣd'f v:;;TnwijgC<qh.$9I5t'Z2VqVOCnIۭf5Zw]?ngưɹͼgCMM<'Y\2}ƺAWd=lO"=) oٳq;/>M>*ƂԊQu[`t~WX6׎1ȼ^|? Cz/ƧȐ="tv1(0vЭBl(M-;:`6 ۇ?±n>䂲ѣa,-E9mz+:!#y4^̎[¶7v>2C/@պe)8s1ɇ1P'̈nCpl6 g8 D]/u|c{SAc:^bCh'}@E:v|+\ +r=PqD7566Yid#L]lhCVkو|(d4 FSKAc_i + أM]rNY9 :1XA{EQMk3w9')@@$v%(A:!&=4ٵ^۷lǺuc  ȯ\ \nXp-ʀ~܃a(k=F;OukozA2ѧx8_J9+E+sК+&d+fq>:mA@.XEEE y}&/1X+A. b)>C!bo-XѴ2ڊo(׉Ź xPՖL(\ #}E[Pj__<|0h>֚sv1L %{@,ogΠ5 .i=W)> ?)DŮv܉'[FO^; .ՉpbhqV1m2w]<-uort6·Rf<=Wx87վs5S{>xyUK !g7sp&78gf*ϓ=kOE=tg| u=Cԇ8U~vH|,c[9_#kC!ffDp ġCyq. WkgE;X=|E>^K5 5'.|(9m\bߎ>VVP6#u?7?v么R廮1A|+>V§i;c;zc:jm Ag;  0ziX$kOa?``jMF"^~7h;a^Mv/:e-H~b]qڴzuYܳ2Kcx\_!ڴ؇fmV2SiZm6XƀAX| 9uE[+s&寐e_:k\@ayy/[m].$Ob 0 -"NL>➷e]4>V<< eg;&K6kwXMgS cc_~}+p⇾lg/MY+.Aþ>m&/~%\ رDǐIھF@u1 ۭ?Ĉ6|БXgƼvywz@]l1-~N@G ic1&LV hOGȃXU^H4g| rjz66Gnmv̮0Px1A>lɡ3|!vnMxxsY.zAWldmB5A*m1QϹμ֐x1_. {8wOWm< Y;n`2k- Xe?kq.|x\h4Mtm̓!i9؝_Э>D67E툗tF)ɧLgR۸b@Ȳq! Dea#8NvduU[/p xlp܁upB zVDe-#8Am1xa𖵳n-8Z'VH:>?+NrEU~2ꅭvs5av!1K`y ʳ~(ÕoT ; W>[`wWŘ/m5hVqm2gTb\o-[Y疑0QJ>lȧ <n~Gq><&Fw<WqL3>a2Xl-(_.+5뱆Y$m+\t,sz@xքݍ 8QQ#C,c]c(b=N_XF7Èq9D FΎvr suI-qTtg R;Uq_~0@+_xCG|!1pnCcevLs^@ kqc|y0@o"V7~V h? lUpo_G4#:fG[6dЧA;j.y P.OIZAʏ۷B]WȂ|y븭=.FE[C4n2ܗqQ bj@%|hx)K] ACש9s[H Ҫ6z)Vr՟i C䯶4+5++22zI.{,ֵ-1G>11h[L1 d o£ # ;&$~1T;Ylt> ۴l۩K4J4s|mږj񬾊t(, Ƚ쥟ZA%ҟzu@? :Te}^·'O _~^kuP/b1*|ζ4k/\7c. /Gm6^m('S&ϡs >,g&`/F?~)pNj7*JP>CfY#i+<1P VH]9QA1b&g?Q&)mۻ'N!<2m;c]QE쎙oM,fr3mY=S 'lWH+_-ZFe"DW PDؘǒ:>Q$SHs7g,^@wX=nxuHYWNw+'f8g[ķB9oUMCm|E=A:MʷܮbQ y#MjrHUgпK=^zwKgo@+2 W)SVj[ί(=6nbv~Np1~ 횫ujF/?wW1puEyHQ5ڿY/p?Dž[sxw6Mx(R匑fkڲOU/w?~QAv 7MOg,b.>pl8Z6f36(;}F+/v nߊ,bX(|f|}lY x8u:v r%W"[~AO!>*| hf}ks.+1֗&3wfT -YxA~n$۲ Յ\uDn[7RmX٩̘VyM}G{y|bV3$Kj"[ODDHt?L;r A6H0As dEx8[m6Tԡ=du1}S<>x;+he D FœI̚ҞEc].Ի ąR4dXN_}q k>|t ZF_khmFUT~?~?YNrB9$6->;rg7#`uՄWR6".=W} Vr}f/ߨT/WXɜ8g:)Ӆ @c#VÙ;Kߞ'Sg̟`<(RT:ew+oZKU3WvQ bH2؝ ||~ym-^/drrgrߢxO߷mNĆ;8}kO4.zRح>g;w}-=,q_.b|8ksk.kZH۵/iX(HX|i/lTęi_E7HVͫ1&kX䲘*ħz1f8Ї8L@}A iaW|"]NƐp6> P_% n (4iF]kjc-~NYq,C*!:/>[m|x}Ǘ?#Fu^|Sg^p.u:jصv(FP<҅;7㴾 =6S^F_d@L9 y /9>CFR)c_%!PНPƃh6@A >eQ<ڠ_˚>G;hAgQ LO}Ƞ!]1).sv9![ bh.h,>$ %rߨ7Զs. (L%.rQ|<:#쯳ϱ XKuЩvK,i|5T1YpDN;WesW]h+ڌXm;Y*>lG;s%t߮J PxI{ {pB>@B^,Z-}㫋])ss#&RoTaj6i6gg R~uo.[+ NW9Bq Z2]'BkYVYxiizuȉ.*yip<z n'{[R[ý- (D' 685U,*ȬVw{dSv߷,gmty:_xuo㎝R V߈mSE1)yR`]톔.Zh[s"xj='*_yQі~lǙܕm<{d\6r}xZbg^ނa%uoy >vnu>/ QOuz07؟W_~P/ q(cUXC>Ghd|WنnzwEXc[7CY7vu*5ޤ-tK`kaT Qk[%VlP.S]] Qcy8Oˍ:ԎcZϵ49Gm Eshþ*iEV؜3=bht6ՎK!FY>d%Vd):x@Ki*Z}?|e##ϟ?|˗O_~N> 58f<(EE)L#1S?`t*_3t&[Hӿmcfhb<~4#QtUDC;,q; S P+EC/I;!Ր6jʄ^+_>Z˟>DB?CG}I@u(`NS~cMrd|w^)NkmQСOh2nYډe;*hwϣPmw+RjjC]ٺ{k㟾:17Y_klxqz}:GE}[-;Rx՝ܿ%:;N911\@i=tOC*985;u.G^3rtY˛'oU x+gs5VG<ֵ!\T[e<菸nciwczۉo 0mS>y2'jQJmGʾhfd`9m[n__+߱8nsI@FzUݠshI'TMlq\>憞Wk=yWqZ \[IކXc@tD]lT?遯qOAuQ0zȘ_cg E ',tawk&6MpÇ?L5pLH#A'SXU)[q㹭MhmD}a ċ!j \wo}cm2+cnTWuA瘭$]3!&`X }B. 'ūlX_ES0'Oq48N-۲?Ѵv2[A[j.2ZWtrY>[ ~EЍ/Ezi?9;λI S>ڹ5*qZ}lPO~U@\_ϊrc/^Vy "&G:4U:j˛0 ?\0?5(dwF\W`UT}G hBgz *ЂP^7#}"T ):Jd3spmyx/jBfq]P[ g=,Zۇg C6\\ rc|1|˿֪q<c6Oz|@ˆͽw44&Am]oWti/-5ze DL@ݗXHNQu<$/e9fDR7ps(ո76DOոW36/pvvS=!h3t|W gPDb;+&:Vҡ5}(ޕpYp/mV66S㽳}PxRw.oU'7#:5> b8|9[UF<Ъd|Ba8&?ُ#.k_>rCag+ؕx:j]mxgko1HvyNX[\Ɓ?{g;Qبv #> u~Bu:kUaI]ϠRm?w]^8ױXG*6_sxL|//g_۲RMr~dI5S!lU^<,[u/3viAFw }أ-%VlXM&ML(2 S>P3 .7*62V"C;Wp^6hcFMOɾ=cpf Wj+|@4QL/SRmDgPЎ ߊ>`rQa< ? ԏzvA߮*?z)%F2f ɛYqîTx1f71 cli}/b.ׂ MF[˨'PLF,mFčm&f;+4!j6^8Xý.G۵ڐ㰮ߎsO7pD!E!?8C"UKrPg㺲Cq [m3vsPGsNvqUtۮ@eu1֗\B 8.+~m;[鳝 /4&S޸Uaĩ7pu ;;y\,qFgGr!8vzWv+ bm69^1 QZ|37)0 ֧xc.o[=!x%We;jM\^_]~T‹h67p=7b1LN.>߂Uboꠠ^xp61_O͍]R O-.m },boyyvE~6@OsMGC9c` J>bK\{&_&C_׭[ŽC*?l]C6XQ 1>`dA\/ؾI//ڱ#6łvE1h;*DH6cJ<Yj#zf^P dtg|(xu;~A.}ŞF=^RpF-3"g ݌#|Dlq_W um0DkmǸMn447@"ҩ9R?o\~.D 9ďl( .``@_; /tPLg]l,~~YBu4˩F lW~=܆}>ɃMo48[p]pCp :vd*īÌ(ds G@[f4SOڷ|rd%vtQnW;n!N~"v]֯t|?"ЏfAqⱏP->׮!bqvj~Pȗ<>+W@^^ircb@r1vaA%`L39xHgumZ+'=}zE 9LջVwyB6L{+AN;Vuv]S} le5/cc%^Nt*7d7饮&`};1Pᐛ~Ǘ~c*I%xU&j U]4w*⧌xphEyF/ZB@s~%F1x H߻ю~ŃEƍ&Ya< B2~u 섑j ¡O6dZe/Tl TnKqǾz,rkc}0>Z㇗/ws~̇ ȡ2'k 7UtnXX ZZφt@5Q+#y28! %s~oI0يqIba^\1+UWE'V ^}Ɋ?UmYVOC^~u.t`W?iǗ-uZ*F䣉i羵GBڡ,>q]1!7ӣ@5j=N>& XC]unᩐ_ |p3„IڛCPdIʼnfab!+5-?7@2ʗ>EfUz `LU/-d<,64d(@eq„"le|@F/dVq\Q[9/~r3lo?tLoāw\+y{'oA5s_[bDNl݅SŎ0՚ 5h[ 7F\C14yL<Φ8@U$:-l2?gH&j:jn9X&No0X~wy:Ŷ\!1vdNN@ύtj.= ,jv޲6݄rQ)A-PΩEN#:V<*2:1W.{uܵ[!ݎL**w;%Xy_gU PjN _?2f7>ϱVY<{_`A$U1zhg4eȬydkksMmØWq'Lj P>P u{Nu~̗54Notiq@Dhopy##pMҷ뎚2Q ֧Mdz-Oʬ> [ƚ/ϛO+g 6@w=b/vk&*t\h2Зݜ Yn0g=&~,5E+i t+S&xCΫ} :'%J*c րoܷu  16A0_?ňZ:q A+"tO%=V9"Vë88N||D >Om$AZI[ѲN|#|wsw|t^&C.lUGن}hd<ߎbmcihtU`Ŷ8}l?éwG]?[VU-zK2$PYsR< HQyvӾ ΃U/LjʷRf}[k'RQ<{箭Bv+"k=K- D8'֯z􍀾@}-*bN:(ebViH9}wZb8cb(o;KV2&BЂ9 p.4@2O>&TtـeoT-%e&XY)Y2`@OAI=b S\ E6E!TR~Pݕ၌@l m* 9җ&"OXЏv^}W>P݊uD[|uy!ŏij\ d a@y? ./jmeh\LE}{i`~<_sX~G`<=i{ $,sPYr1`_΃h'R8e-3,ǐ GeAc}UT 6g׀OM x3Vo*w#؞xAڑj;N'|r'~x=湬c~IUy!+~5zyh!~3X￈LL1GM*4,۟]/mAιSZ-V:*Gw|w-d=|6;?EC!|^x6[] $ꬩo[[<2wa6|u^;"w(UwBIk%Zm[Čܞj .vOK-|_v<]_!DGm̝A1G'xoݾir }<luQX-6xu>koÖ |cN&A SRNa Ilxq#jaۦ_l;˗y_ qDambEMO/-H=Œ1\ ^YXV3GKcWj0c9^UBvH@7S6'ȷ6u~ ЋQϟ^?~y6.] lB} Ÿ܁ƨTPM0}61blQcڽ |//*6jNOw׵ٶV)*d5>Tq|lfaXWa`ʂ.Z^.?,#~#.~P Q腔Jwd`d .`K~ؼkaC8@C|s3>ig}<u܇@b~ ɄUbkBd5P:`5Ylw|v@磝 b Řz!0cR ^+Z9qj_>ʩ1d-Gf?{83 yLo&ȾwW@P R֪]0I Rl^֚VPJS~wL׏-so\7nnWWV&&^nօ2ؓ ɣY!_lYlSqO"zǓ1/ϓ`;zxy\;ˏz̈́v9~uc G~s^Z$5 @A_76@ ?u@WAlawr2u 5x[isX]V\4.1smYc]sل:x`BAe)0}lk;^!y^eJ9);u{SQYg1.ݪU6bXvK1w)cakltTj*LuzbVVgbS':޳nF䊗lh>O9fXLN<0YtD/d Fe]q +:c߸psͲ[qLRB(?|8 _:\2Hk #jacّy u2C>G &n{yWc8N$x=8'2QM1?:1z :c^^w. dB)ܜT>!}XYa8k+!Cڷc6y & 9 ?}/k\+ǧΙs >_ڑ._p~@/,0=Z3BFsRwBJ̋~U<#"6WXw8O?cݩk~M2 ̡Y2%ܸFbGAp\p-l o~C@y8 %c`2<:~\q(uLcus9 衃C]O>Jtb <8Hf >qxn:515YgV,:|>IgynU$0pa}q $ΎбfuT.G|x- LM >l%*.a.~c#~cDzls2y.}<Ǽ#oQ?r>t1 5d_hYcM1?{Ƈ2Lc{zu߁lv;&_'y'nv\G0ٷސ|jne ?USs:p'6G>59u9>MY`ܤR_Y=;ߐP]k`{Fzޅj4͜mgZ1GV炪Å|! [bX+گ]Xc7y2 h.|tف4' |;pȹHVuܳ.%-;=_o2y繶D s:BVuVs>tmPRVĮ;0:k^~|o16ˇkaĆ?Ϣ< 0ӇnPp|Mcc<*کvFafdtn)m`3fs-u=y9J/]8q&5C:dMηw#n;gZT>ė,x NGeh2v/}~YdZCrm!o@Gc ha;xtc\aoяDu4ox4룘-kLi=V7c{ 䠆G ̓B;gyW)Ǽ<ƺs=a2#s|VW~ؘ-"xX@xҶ2jXϬL v +R@ dN'c? wt2?9 1 u~ƞ= 7:8+ ksdݪqajئtɰa#vV6;l ߐqocƶY(ؗyydt ogwaF|P!D/@uш%pֽoK^z=g.|DI@qaoX=ڧ:XS@<ӥZFxA"v51f,ܳ~|hvGl\ @mNo= Ic>̵|sΟbv-qS );^K1XGp=G~cI<)%" Ӝ9'6&c6Gz?@+n[`\o|۬s\opF6FoR;c1OD9E7)aCA@E:H0p/4L94r]ZEOvi6ن:#UTGl7^@ ci}zwus{9X 3&*I5)L ]n@ƻcm'zf̪B]SsFWsU.mm|8f6ǹ0=;QjO5[m/[xayK. /a2tJ/잭ͮdrŬxwzwZk ~d;\~ho]$]\8%gZ~J`}%L l9dat0'x[vk.o{ܞ fu1.!Le;ˌ2f]s9~?|I'۸k=I/ac>!{Ӆ~Ʌ7 4딁U?9K$y\ã{،fD9CR<sxk?b/tR ilSkX} M:cbN =ey@V~F p-avgǗN~]],kj[Ek|;fpk Wѷo~۟?/ny Pzy^ [Νz3wy\@Dqҁl(O2,ѹ߿ o9糬ӂ#6K3G=/8?'4{;@@QA5^HC_h%k<&Y@2CCD±֗ڎ3 X~muq>Pk>dky\x9<;<'/@ z,Uk+Sբ4x:ǝݳ>w0\_|PY_:}rNfT AGnuG_}e Vgc̣t3%|p{\u_AV@)Ű "mŝ=\;_Upc;M>BNw>H9?ţ0@&yyi|mZ3fPAɏ[CW|l^yW6lC59v y$3SW4 ̾'nzP.}aVke|Ɵ'q/yƷ~~7jX?6ߕG~xc 2CX_emslðiHw+Iڀ39C!q`bPq ڡ =RcM4X^o /O 1@]4g5=̹@{>D -\8a{gm'Gg̛bBGt2v:/΁5mOE.&\s0_'wf7}C/'rΡ@"ߥT>̾~q{ O縲{:/d|g K⋀_hֱ׸Я s-rEr𪬎?A})\GW;F۫{ڜ|,|bQƋW8$u2 g۲O w;35p'GA+P ΐ/o7 ͵&87c8հMPPOPUdqNdnFԋu_T@uȻ̶gc{xѝk#x0߫:˭틝*XqWns\lX̚# |&իaͩc_a@Lh7ibGa|~eO8ٻ.N^d}0d ֙_s2;w {aBv7ikÇ|}a仟cz3b,>|tnBvۨ_xը}wF:(&ji`\lw kmNbeIh&?cO9LA'ݙE%t¯Ut]õ/3\hb:2$eY>NW^%ױadc_ 5 ܬOk}?|||0吐\JT<0{ǹ7 v=Hfl1`2G!M#P?(??P'0@p_vWǬL@jk kIܷXKρO=1%K4Ƃx+6~e G>>ƨ'd|&ӗ1^p}e$Feh!俼qE $m~$%xwI?`ͮss_gB #l (tYdy!_ ޝy7Vl` \m2UMw1,-ٸ^JվvsW\Ԙ#ޜ[tZ6;~Fm@ȶ ͐_Ecsc@ljx6c9p0w<x?fx䳯-eؠ7Z; 3bcLWyuS> /EIE-j}k0S/Մ9)OQ,a^Q A'HrkܳSy@CU5džm5ƌdS?8ph@=2ڇ Cϑ$& ۀdc_ç?uk-S/ 8'XN"aKm }!_t[߻x KCڔt0'=1.Hr g@:;0fIデғr_5K^!Zp]CgF<#ṙundojAzz_@ڄOywzs (Of6vGp)h IIHqCJhB#\U<\K P^(q4_ P֏xxгW| @~^x+npxo5~[+UD+,hB9t@g⤚0UWFzg DoIL#DAWjwD֙'`ވn@1N5cA}|kuwp+0GCyWr xvDK{3OBcT4ΘddWl!sv^³T8FHc|@Һ+t{<OY>gj6^H*E^"swDe,M$pN+7!Յ\bBz UC1S߿}O_>},~GZwj<\F~cAҁ>^ 2}#huCgȖ9ƸF^rW + >* 9O$ÂkLyP7Пp;}h7fǵzxDч7az?|!ncb1j".FqoKf1\R\' ⢍_ann#gQ'h?|b}N͆S/| }Kv3yqFLO2rt' Tn"(C+zvD m"]'{'f VqogkHKuBVj :*8 7?s#P-CPO@qk]`T}d]L y&sϨ>~8pA?N"5Jb2ʸ9?g|=~yα|b9 H۞M߾}맯_|_xڜHU6U<]t:!#A+;r r~T k;:Vv# Yo? ٗ?bgڊo'Ov8t(oyhU`#zou|E^>`Y9 \3_/+7>`gN\wsk%}eX'8{ƯYߦ];Ӏr]Ig:{S3qwc  Y)p:'U`BntZ ٧Aiow:f^hd7F b3v֦MmĤKʚsWM 2š7eY*pS,cooE[ϑg@:ZȽmKbjr- JBεV6Ư.{w(}')#"0reqy&=Y>|GK^w Tqq?¾qq?=)t~q]^ćF6 4d,2<ԈDo/'7ss43?E8`(xk>Z=T9 ?sIҵA4ʶ@_DG')ofW?p"<( 'g;|WP,g^ GMPX:ć4xsA]akL{<>{X`t@2-9 Ȳ8R-cv @96bnƟdXإ>ϯb!MKgLJ _ :կ]oc VGL!Z@2@r8E, ^06u!?'ńC?n8EI>q#>l>?L=NZ^o0?*'n Z3 gx:|O?eSءA}q1 q$}-|.agԃMsl {;UA~#[+~,xd٨FaG]sa]̃x{!j6Mfl'M?G>2/7K'1;ȋQ@S\Ѽ}苮u: {cqUIQƕ0̤JBKWOsIã!H_ۘEy?wly>s@pG'#͗Lăwvo<kGOHRe$ƏlVkuԒ*hg'F+|@.> Yar.K8('aqC%T0΀?0kq"j~ieC8gĕR#alak$K3Z Qiy$N+0w_ɥ,sF(M]4ֳ 4wmk4Bu &-r ?kʆ A=  #9O‡Z(?tc?|Bfb|ұs(0 ;$pl~#?r\o$q6a[=/I>H %ዊ9HvFS oa(;é׀N;r)犍-`FWoNBn_ic`<|9=NiotJj?:;tA6^'9]!XD/ IM.VՕnܻڀvk\]7zDoc|< Kl怋8`ʻ~#@.O_`3%昒8ou|S/TQks뽪p}ܸݳū1vOR:&ߍ>pӘϓj%mv4ە=E`ϩ ȑMuo8?kgT@P%<\n4`hN 3ed<4^_xVWu|;cyG L}{wiwWr^1m:.\r%3Tow[٭L7j/ [ J`{)dojtV *:W 9x֮.!b>;czoF\(5&R;SogjC;~SBX~U+rZ #-B>s|'HGGǒMT_ª&υ3qyeIGzy^FڧRxa>?JF:GmOui^y5k4zOq3c;|X[dw\ >eN.5 ۮfLgs+y$j<'hҏ|d !w;޳tvWZ1쿞Sps>B7:uH3r-r);h/:|M>mLFs`vl?w4KDycQV`>__8$y삇Wsq#DBr$5&9F&s-ݏixΑy (nd{Asdh\Zƶl}rVғV89g>c8_`?~8N'\y.1oܹ>a8&(//~oÁ!ק_~~tG|s!G;hB+cDsFo&cG*~ ` |C$;>mjЩz!R?~.w/iz-І#He7d},4Nu_̹*r`k97Nyd ]A 9x2>S|ymrYևm<g7~6s&@_]JxۼC(o>Y`'7 t)ѻ=7{:=@cC;tw7X}8 /x\Lnja_.~ut9ZF1Mc*&hD]1vѻ!bHh^Sj.do^/诀^G|Q7D7<>nC>;A1yݚuxuy6se#_Id ?d9=Di0l3 ~# ƝIGծ{@>zAK?;4&7|䂍Gށ:6ܫ ͑>  nAs(xBw~i۟~n o|TbҍZ_pD<δ汾8l6G> p\̀x{@[;# <='% ;^p2/ۜ;Eؑx(+fC-Ѹm-Wn[{EƩ̵u~2IăbƴCxAgns y)g/+-FFMUvwky |X7L@eE'ؗazft:r?u,D߂94kТ+AGwC}DqSC'qs^^ӛ ;1v̿Fua\Ym6YG<|$DLu@ n|c?ascX_~|1M &vy.̇8!_β}>XTq$LyŲ  {XO?c|t> ;uO, FZ^m1lc?3`_-qQƂ5C礧CmGq >g [9 UsJOck_GmuIJ$_ flq+ƃyWAt<6mO+c_u_˯GԀE o˱;&~rf/Q\<>yӂP}eQRhsży-rXLӵN+.~W$d/1$Cso] SZCv}[X&}_ݵЛ7Pk.tl]W+\V)mr]K!G]>8a7A]cQs8:FJ}]{+EE5M_7-7]MF;|2F (oZ+u>5)<OFO 9۞Sk~H9FJesC[Xge,k2q X2 }Y;g!P@:ha ݑK@ruj~R#)-$;?hׁ,+ Yo!]kٯ|C;뤱3ُx IJ;~gNuX&ސJ[o!w|<#&Fjs _" Z ىcR~%Xi}*nxhwYۡp5yXVԋhd<y]a Gx$F">)';{'tv!2,9Nz-j[w6^}.繩Yq[gáuva>S5Ϩl19]c]5Y{Q.۟v<ړoVWc}s@_Ri_o6"`eɾ2WLCM? oV1[3}%:嘎a9u~\ẓ[89q<'M5Ӣb< cx?r7:@=.d1XY6t܆P}0uM.yaG;0gP\,ۡÜ/ֺ ))ܤoA3 |5a>;Zp_H 7\0?|Ѭhً!/m\Зk^Lkսhzas+f=G-_eB]~Eɳ.ZR hv:-@=v8LȌk? />ǗO矧wb$Lvj\r ~W2>SLOy\}?EӼ.`syfP]B.xIlʇ@sv ShMCֹSDŽm),M =\f9ao0;#8H`FC&݉xxj)k%״ 6MPj]cezW;?xxF]"?ޔ^t:xOgG y&,d;A9ɕN*s@̵gp.Ϸ2-Yy^o%0_=f@V޺=!۟ x]2Şj OFl1F |׼#[O h{\y!v]~1ÄU芲^~盖bY X\䥵}5=Wr>t7j<I@bȰ>9*}\^q.#V\Tgԅ㰇.rA_Df -36NZ<}p_t4+{`=`덏\g0q>)8- nH!+[xCWa\DԱvß 幒P_s} G]Ӌ'?mfK ȶg>C:c1q C~7U(Ѝ=c`?}6cI0CkhA qۘCP/v4ŝN<EE,$_SQM4M8\,V3v7^k1kry>`ʯゕ4ץgcTGߺ3C%xxƬscr96ȱ)GY` o\3=0ۜGxzI#ُ>P4f4vs܋G;/YreҮ/,uۃgya~kצ63 }舸:c\ }đ+Е"xKe^kzqxuS̺~FT5ϜFx:IZSb^R@GWa#ل-Bn4$r?YBc#'BF=8T_W+pX@>з=ac 'G=.1؍qΙZsك;M5pGGs',u\9H9s-tTЧ?|o~_˾|cbޣBʙ[חcF_h~Wt= g uy5FCOWIBP\ y3Ȕ&c~cGk xB5pOfC#GT]/U/oC\Lc{c'0Tt,U7~2+b^>Φԫvɖ]{P}c0`;?S u>h3b:׺qɄq37'l;@? +31q|?Wl}sztM}kqp_vh?x|>fX|u~jdUY~S5|^\f3oe}?^X@kWwÜ}x9OU|c~i|ڈgS:uWu];۵:\+.k[?ɾ(k#/ݼzq%<]KnPor@%djy6|حa*߃zݺ(+I&.@41T~cxdsἁ14!(}b# _M!k}'8?^aF:Y{٘.cOy$^sYЅf/Nr|?ⱷ1o"J/x#o"_%]bɐ䊋qg#,νC4l3降>xԞ]wߠ|ѦxN&vT7@Fvvx]h~}m<~|HmA>bramZf`‰{:2>Md~΅$~ +vz5jÅu_%4T=oGˇ?Æ~npZ#k!vh}!U BωdK$b7n@o఑8_޲_뻙p±`b񟵻8:>7W|v.*WG_(9yǯ\J~yEG5d'A4(?1N^ך.0Uչ?8 y%LTuVv9%`?EG՚dWڿ&>>_!zi<'PsF!ݾj*֋'S^9?(?= Nb,P'H62:P#4g65d{-?1r/(O&$ T(~!r1s~ӿ>'> ۀnxO*7`}4vͷŊ_0j:t>3 7?` ~?uBc8)G!m}v]*{_ 'ŏɟ>v!^ty8M>׀Q7x^Fy,z˘~Wvmr"#~Běq:a"K2U^jgqs~ ؾf~Fɀ.@ٗBIs]qQg@y䜛=b> %&OqE|ƄX9wI5M7x}{!!gt|5d9z: ?LC >x~9InX{lƂ~cBܜ/lM}\Gp0l-–x*g {. }@'`D6N>qc?GWP^{ q_s}6ZOyf{+WOVHg(,lU, ˯{5(>&a5b+9F)|G"Ewb>lwؾ=y"6gT T+V;C/cqAlVzwO:{|Ӊ8+{:G+&^gl5܈ ut'Y; hTn\vTLs[=Sc o:Q}am.'+ޣCn/c.ʛ-]ae}0m, 14nc_&cKظҼv4߮片̛_M.>--% 'sUJc߅.]ů@1~gtw5ĿMib,7PVz]cI޻XQt&]뷶?zv=qoLϳ_BmLZ} \,HOqyn7Oa<LծCum1O*W>ߐ3"Q^` ?z1:aF+aP"?/%` y(=k|I8!+'+^ZX[w(:XD:L!R~ިW]Wh~Gx 183cnR39#< z3 9l3z3:QWo1N}?>.?mǧCmk7@*5Ӽ"r9Wt sd߯ @̔G okٿk8ɫGͯaҹʱo˸𹳦'?~!Kr1mOr 0ܠlAŇUF_dfEAj#yx4}B/B͉12Wm E?HL<@W Y0,[v'{>+hƺ:_1/+Ri˙1ǟA:ڕQ(F-eAu,ވ&`j4?Ora⡅<LjWσ ũkq~?!Ak1v̛mrĠσ9iʎU;9\t5_(>_d*fQgTl O^3мU^@WUMUmtCe?vh/~'F^GlÈSq\wG?WNHeQ,ƻw!s}jl}dwK5kwףoskKN 4 qVru|Eu/< -X1c/4~>+Vs#x5$՜7u8dbbǚl2o8ql|BN?i 9FyGPw vxlc󿋉]} [1[sc$y 8kG2NQy8ˡvO;s db)Ywk- ůju|ȿRqk{K:@f{R`e"bn3O@wght W\Jƾ-o_*^ ̃t., ?^:.s:l-oMZSX GGlcx=y,zXl#1w[]֟?H}59+|7x#/ .:ٝaCS䪱!CǴ֏swΧ߾y 2n mvQc'߇mO>u/ĉ3sw^e^Ea2/NK^:ڷ!ŖLg\`azxbL1+dSϟ}pvzRfЍc079}zP|15\83( 2V9ukUM<_=0}vx.r1O6xH{ 0>̰t|} ~'%yL)qgs_w³"}_ycpaddӱt0.c?'7O tCm f>Ϙn4=Xd]7X>9v Pr)+㉟ۈ7Ѱ6d 35~ΛtF?a.X',̅zϷ?՜, *|b.πϱm|ԤpS#ÿv?c T?@Wك̅0~NuD,}:~7<@W +_9|/>c̡õMj~y"^q'=|Qƶ~͞}WvCx̧rݳ_?bY'!օ%rbȅ9`tjP/q5.ĉ̛_Mnzq] ^oR6[|v't@sk~j|K~Orq9S,Dž /Q$,s|zɮJwe^_#!OB,p |Oαo$ /l|ǯlx{Uы>x2b[CDn? C0TNCzm`6|·Qt1v>PetP.w7=h,AopaAq×% |n nw O~B]_)щJ zъߴ-21IR7[A$Gc('rv:Ϥ9AmlhxBW*> Wn0^=%8s:_t~آ:3r ~K:A6]n<Ǐ|/{]_ %pǵ?o}.c>;T69/hsπexB `m7-vg& 牡Bʋ`R m(~s}~s8t" M gJvy^#`75'b<[䰪kG?dEG/5E(^FXA# ι荾lv߼̇uG (MHsS PNKo<5~,XN)zMVݔ:7Ī7pj yssՍc3#GkgW4E"XWx!_S7ZL msVA s5+t:lwqccYҜZykQy%g-z< Igt<"\+?=\a 3_iUkOe]7ݺj%RL1G푑?(}X vĨ`9o|kN 3J:YXh;كů6.L_zjCȱ3Ǵ5?#xjtr {H'A@F}4а~\ 9_a/rª^.ٿ v[+,ی ]̻vM<쀿1AWx"XZ9UKa}rԠ+wPb=_`(E>wA}!d@yEZlwHyU7+9 x8x[cǂ< tvXmfC`+/I'4 :t3T"XsfF/w$}^uKTPc5}f=`4L:E5(q'v8|;{:'[It:lw=.ƼX[yBskٮE啘V-q'\˵76GW_쁘.W'1WX'| ʂ<%,| .Fx~`X,5dKGsajW[,ˆ7`cRj&O:}uXB/ zknw}fU<:'>ɘiJ612n Id^>(Gkcco111nЇشS~<Z8F-Uh@:9ULsq&cܾC냘[ǩl"g4ƴ1*ߠ\S1ɷ!yU|>|J5p>5c#t{7GMso&( b61}~ dǺS# 50tGߏj9;g7FcF™0 J<\1\E9*ORp^ĩ4lSϱn)I/(c%qUק5pvYރYƼ6N!2G׸#Nsȍ8?G90=ۓ_9{.>x_Yvfr=tN9N@CvCEQs8΁0NN$MrM^#;7p<2uMd=Q8' y(`p~93l5x"3Z/>|7j>o*KzQb=?!tYǥLo5מR/d{qߍhkWptwgjv\yݟȁ6vy=m|- Z-{k[ˊZ˵- R,=fjV:` ǜ썧S^ ?NDγa%n^~+gRƪ5f|f  _1mv?5 ;h>)5_8R1 g<#Kq{_s~2j8U&$.P+Pdz\/@đ]MC,4|@REr=_ڄq=2;CS'HВ.|o1cMȄG5gV62ݤCFCgƹ#dž0xU vm:ƛ$%MLQTb<؟+&{Xw&# q|o˱,{hu~A>qCqR<~f>ǖ5c-x~ ɗ^৳h|PL: ;QA1Z6?LX`ؑGG-btG< >et)Gu1i1X{gmϦgҧ^lJ{#7gt8Z?8F-7>5\p= wqzFʫ~~Ȝw3̀\75JI$X;/ 'O^վ"":^7@aV<;#qC>s@ⷨsg 㜗v:AM^ٮѹ`6L;Ox\'--sױ8G/ӹWhy1~:d\a׭xc =] lBZ9{9DW>ka7=^<xm[t/sd޸9W=+7X*&ؔ`Zjyc,w#·?,8AF9F~i 6Ec>(4d6 I2ݓ1>M~a?ˆKP!k x1FG.50>?dX$Ԝb8`??O[|)s~Rϝή1hCnb.@7|.A$?N?ry˦ hqg|H<{xZMY?rf1/Uc:Da d%G L°u Er|EoAqW%tO3N'][;V#JoU&'(6in06. տ .o^(,7yGѣ4RP{+f̗3: Mm<7!9ZJX|q@<`6WG6PVp>wci}0jDϱ/IUǝ=537s~F5U 0"Htr n`Smъ> 딎 3>Ɯُ058W<ijcj~z 6JQ(ȱ 68yS,o8Cq+9lI$)A%&x[sMnZ}Fͦ`CN7As%G+Bxw9 ܗABd:׆@\O P zy֠yU" Ḭc)$?Ϸ$%w*: 9O' ޕ{`7j ?e`[Btj&_]tTw;EwB4"'Tr&g;3QKPku0t܇] ͫaʣ {`'Tv,5Y/羱rZ Hv&WqNuԇv,늹7B9/G^:ۋ=C\DN\ 8}UzL'eQj7٪WWjgٯDZyX]L䛹<~]z\ՒRd)w%V_6m&{dg}Ř7Xo|М;yZdxIo9"YF>8̀Y!Mc.{޸ }̮FOzlSe+\b)^3fسl|ͥk{QO EngL<қO̴ba7 yvF䧤|+f b-^~-&DίcAEVޚ˸6-]Cd5QWd#1y° хޜ۠O눅9=5})a ]'s8==]W6D DH:{\/ϼ5t])GL7S]`ޫ5޲(7dXwm]S̆q c(Y&}tn5ח쿮7'RX"lX A CJݟz9wA>o׹ZkD?!)]KPeq\lfҭ{㬫3x?|z'4|qi]#f C2ٯ:w2! s)|(ڳO?6{z.NW}sL8l_0Qw#?`6Ă]ՇL!)wzFass)ωI.EX>B0y3Z7kg`~~0?Q9tJ>WE'XLO O,ךo@a(i:##q{lq>=0o[?<#anu02|ǿaҷaA 2GI 47m N';ɂG6< XXm:.O9ğ_H9ǘb5J&9.c;~^nY퇊7f)y-413wlVlFfC^Yp(ǝQǺvK\սã'R6_'LH:Wi"+KˇLj<e.F ۙlSWgpRWkp&N `룃|d;lJj[:-vA~1 3 *jd#o<|z_b6Ɲ]n\xx=hŽke'nts:ǽ\Xiݘ8'77"N `Ny)^̬aD7k&8-ZᙨF'kOҘJ2Ro 邏l`o ':{.Q7(֙xp6Hr 3on-:ۜ{FSLw; EzXCs,:/"LCFmpn ^EC=$wQɣَlI`ȃ"}1pCxCxŶ 5+;CMhN#Q$Rᐨq79*1gwslSE |a>pAy0l9WP0^g^ |Zx,yVC<%r?C6U}F d:w}B <\cI訖_o!(v8\>_@L6a fŽ`:!Ozs?*(x *n0 zu5e?oUḲk7m{mDȨNz ۣvoBĈ<L8dle#ЈC؅-Q_ *W?C^ Y!H5s+T9iΖc"ܳVoMLnZTw=>::iEj^c.vk"d{->Or=LíJ? sA?aϟQ#|1juRw|vy 7t}-{mZ^8 !gky!˄7#uxwaqkpbXC?3.DJ3Zf]8VZ uFȨz_HZC-r8>3c__KnxdjkiIW:5s]?_2(/^CἛ<'l9WoӾ6+F:"z_ ֟Ki5/U,L}2Ȳb= ymk2yO_ >f_?SŪ\FN;N'!dFtv ѩ:pGgƖ9F|7>ˊ9LvS{`i‹yw$ܱmuVf[*[]9]{7rxw؋Fd{&'Z +hxuMƨ9GAV^gOv'-couW-Pm1~$F ;硇}gg:;=Ȫ[7tuWs.z;_!mW'L: dOPtv5%x2e͓z04#7B06jix38 M[/ oec1f]-<|qMxWIy81YxsbC!u @g?>) d 8?ML_~5-~~9?\[0]PFsZnk S+1)۫5:1F}##|=ycjO9z.qV7DtlE}yScٟP6L@2"w؝Z_Ž[|?yUCE+~G $= $fʦbcgqђsU&>( aZ>aկø+sּVgi͒+X?Zx <9>hq֗mwɺpOe[# C lC4&깰<2V C?ٝ|<MxUB{ahvNOx*lw}>1jSp[ 9qC'`}ϱ 邿(qɔ0NCGF| s-?w<w~?p'Wcѿ;OBOU=6.V Aӿ!k6F=]y'\O{!ｌN0<>9y`#+9M>T b=aQ@ο@En4}(@%{h'<85|3%@7cܐِ/{c'^dZ]Qdbn |0h|a 5k<-P$:w4JlO 8]Oya^7A+lq?O abdˏ?ѐq"4 @hƓfPFv1a&4AgPy|$[0B^h+k,o}])ߟB.;G4lq Nuc-/XvlazrO@<\ Nu)rL~򝜟eH5l˹c R"Hy@Ua Îa ^=?|j. hO&%c\iN0_TQ Ε 9"dϻ3\d.CgڷuL2tXn'켺|XxF8ֹ x1ZugeO+G Pfc`yW5a<p`<S/Qo_bN) 0:jƤ<@vѰ !p^S6?Y -eG"c[Oq͒~T>lɇu![!7rcV+ϨM\9A\[a '"0 Z؃ɗamvqgw[ Lsr̼G Y F7p^O*qU =\O*wO28vk)YWG$qazЅOG_\Gh ;✅"9aW7sk^-Wyg1Tyc>=Gc:q-'#cMnͱxz.j[{T} Sxvܰ->{]|20L|+pѳ>QƘ_UlXf`08_*tw,P ğ|=:auιNwa;&?nHq7k#{ֹȏ'h<_f 7jӷ?۟4c$Tްם U2 z#M :cOdtnَy8:}?Il]xvU_dw_ټ+V9 (ۘ ql4cޜgq'2\\ZKɆBd$<q1ywQ}an^Ad'*=Er|ēP ˿3uBV:ݠhȇ>_߈t`ʨOr.qy^mT~|"pmIcicyFS-?L?<}o%:U|(|R  ac0> ߿+ PO_c"Wk??c Fx~i$A%f[OXNsC>>O@֬: 8|&;ENk]=<+zpލ9ƍ mfj#炾Yk}\{;fQ5:ջ+GO&ډQɧ&?crL>:>oy 6mh= /0Cs7ky94K$2ps;t |f;Elб.tPLqꢘgd*͍)V++9P}|tsݔקTX+8B<1mlC-3\zW(a Əsfp{h}@&}Fsx+L1à(m{aʝ#XM Ƶpm\/bQdcvcKCw^kc׬o[#癇VkG5&3|=2]@v<m¬[[땋i7DCπb|iA>IO21g=i⣟!T;@25@Vs?Xksbtgvz?S|6ujX( h=:>!'@#ܭBQϾe8~B(g. 9Y:xpϳ#'|~_۷雵ӟO^R~yf/7j(V4JX-59R>EV͛_54ěgi "v5G5_1?c X7kQ& +Sκ,~Ў1(*aYo#NqejzTCؐb\1*dW9tPc#+9h3|$!O&t?dM 4%!u?ͤ y-v416b>|1x0y?&(]O4'2?4 'ƿ"iM2~żӴ.W0ZC>U\n#9T^PIgWcy=9|#mF/^m!Nhc\%Xv泉y|7]g8@O!8|;ce×x',yq,ȧ"Űt xO[X} ?krn^ =j p3\3d؇ӼL,fUenа#ŋ@|嫜=vpœskFkf3']+%xWכ7hWEKJ#\1 7sFSn=}_&;5E 6vLo[xO~r-c夓lٍRdyv)iV?|D:4Mu.?3>LPݵ|i d@] 9#5:h=V9WLO{]0 ,q z{Ӣ#ynmΨb) :΁T ݄l o-wU2'/j[>ng+Ʊ(~:@6fݒACxΛ<ӁR㠯ZW:|k#s\i#Q00=d7GoVt:l2O1П`g66615Y]LL=n M7w1N fE؊籖ȉ =*GR?k16kxv=C\Lx(X `,v>}| /hfzXb;s~.n;>9¦󽋷]4SN lſ y'lB6˟gv]807,+?I>zRIh|>|幦sM|׭pIm @=V&Wr ۀFbskz1Z}g1a2150_Nx5<E6j̊rVhk4e KI+V' 6WurGq8c3~mc-!7c1l\rY'1PbzL=d A}kq!>3Si1?lF>nҰ>}`o}3!)ð~TuVm# k$҃p]^qvd%yXts͕Ϝo3 ? EaJ"H"hs7,%['B6t3eL7 YG!qn\Nc-sXc}_}S=Gk8Eo$Fg5{8sƇCFpcS㼧EK1ڎhoR >N1\$*|0j 霷pW_5_Dl;1GqsN>ԁסNQuV$j-aFs_8r3Ko-} 'o#(az-@~/;ȵ E._Q^|9wbO16wqS[=^ |Zㄪ;#:jn=sfUUlLs#~ð5_ ~ȹmm#{׵Wxf+G sEB7/֫'x\仜 "-9jsoyo; g+Ǧ;_ ##쎛NâR]MW&~uo"lWu~>j>GGs\bVL5^W[:~.ֲ&7R9x[rx>vuzܬeAY7p:J^WrGuzn|X~MsUL.Q𺁺7&֨k0Ŵ]&A~]AG-hQA%F|>Vs|CfɄݞikɈa`xC ~p||{/NY9&1?~2[HdF>poxϖN0ЗPBgF|t=Atξ&@O@|V>lw]_X6c8֍C0"ޡ\w~ %aJ~û^usoq{ 6ɦ=b E~&3(㯺#t}`g=F_5A;|m8 _!+:trX?w@C7qkօWlKN3Ǿ0y/ndXR,iY},2u^d'ԃ~؍>{~3Ƈ8y~a3jac ֔:^s݇E4^}ҟ^x Pp/pdW#=9,p찭k1F 珌C`>"?]`{m,KIq_Mzl}w|u9d.JV}f=ʩ|nz QDW-NngxTrOFgbv췂{R Cp^7ttkHyb[;ؚSݟȆ&Q |hj(YgR 焈Ƥ.byl{ xڿمrls5xa߉yGg¦#n lwx7a/9N's36sXzh^._d\Ʌ]v4C_μKL6F5{~/ÝpkF W쐧t5$bc4Ϥc-<|>?ɗ!@{>NFoe+Dz8ւx)x-5,te7=5edϲMd?>b1f[}xܠPe6y!cȬMj}~ii ABgomVw%Z{; +d`c{ıƷO:8՞Rf1Z|e|d$>kԗ hAx=RLyw mx|^L y Zu>dK0Z<).s"!4?C\'q̮!:J6H,@!m's𱭔:FW_C2/ǯC/3lɳF.)N"4q^9F0%(OAcDK{{pC-18L<*󄡎gn?;1?gMNb`To\wL3pv|NQ,oOנ|n-5]`'(>Yj{_@]'<8[fa#?wyO]<Qƴ tx/Xh<=kZb}TX`%~&W6#x:TVSj[?u?C{3WNvv~Eh}𡛶.aڟ&x^.y99~?jMd#zFԡ<‡~kZ`}v\3QFgd@{FQevѺw,?\21n $~r?mf{<=tE]Bs8hτ_XPmcfc|'/13*?^Fw{,劆rL|kʾDFidcuoi%GdKx?b=3e̓_2 }#|0z@yO|?B_.<ʂbػQN7oʣ/9({FC] %EK\}x=ahw\R};XW@GOX~i^9^_Wo^L5V/G* lF-6gB}g^^G| ^5/;8N/fjw+qh~3Bn]uƃɶo&w0F|'3yvՑ}9vלF'&nu.W@gyCtf sCȭ?t5bUj#=O}?a&r Ok.sn=~5=aU!*umޜC8忉-|>2&C%-I[sK}`Cѷ=JscgLd\j2Owƪ͗ 2|z\X:jb7n49Av>eG=źZרmW{7uī5f}j &s"q=t7aH˗zF@\0K)`6qmxF<6q8Ŵ|"L7/eBǛGEgD;qN]Qm c5|TCڻX$+3jZ2C> ;WJ=qn0`ࠌzX+Xz.b-TOXF7uj c"|lKX9ɍz_ł9_o-Hk7b2S&j~ёxO&?tw!3X_*NC&͗_A7yn7;kGj0y AH+S\f1DG؂@S 9.ɳ9Au1 * X@r 6zn{@J`"* j@7h/ s 5_Hqk7TN3us }{4iyLN15P0 zw Pn ܫ@ js>SüoG/_8!/~`xP*!:h:wX`#?+W"V5Sb>3B^˨ D ) 8NowZ¬8HOp5(rN%C6c|ܲmS8sӼ+9= Zyɪ1z@.[asn:8@CԊoǹ_!gpqؤaE g`Pp.Ácm,eFYE>`k`'tv,갵\T@Yٷt]ڵϹt1NM &$x==3!<^kfy 5J!_LSWn[1)PHg'!plP 0$6>?]\9rlKWN֬O[ qa+сxEہ5^ҹ?w#NЅjanPz-r 6҅̚_!$x!tC\! m"f[3/3_qI5{qsCj51u$̃LJs8b8:Fcp u9q0}}bL1VxUbve:YyBGb:yH{/d:Fs}L<mpldn8t2R 1^? S'}Mx69Yb>~TS{򹫁f|f7IǏx B }8A<>>lTc$]k x o lB' BF4$~#P`i[0|u;V\D_K:7g;qyޣVfLgrWlWd~8m_j׿Λu~4ާ˜u|qvਵR̗Ƴ9,Q4iD Oǡ:71Wk]gfثh &Cׅ8dhm8sW}[]ǵ^xE1$00'Ïck(t{$&;gnhG_yQP,2R=DIQxo_ >ȁy=Nï -{nb}KcVy_@8&g<Ӄ]/,hk\wQ|x`aE:0]<.7tͷ<1uT ?C"gZT]ؑ/d~o%D?aky9ju:\r6))/_c`pS ^2SnX(V>W l+2 g1#R7+#x#N.ׁV`oXRBLêesɭO ymځ\5l7gFXj\ 4F6${?vj'|"I\ꏱzWgKۀG_@ .Vu%N*֓iǒu~|!?+c#ZxOPIf]8tJʞ}Ʋ9|~<гA~7k.7?GDwx0y1a)C /Ȯ=(%èIk:Z)؏`f@p7vށ9Γ9dd)]PӹPqƣ59tG>jy /P*u|_`ϬU~CIZT;.os 8oS^'[68C%xD+z5̐ 5gx\=OF0۸3o`rW>k|Z*s N11x,KA!_P#2,O>Cn^~g,>z>. f&w A1JeXڜGo]^L̗.v{< j~֭ l o'ߝp>~(;(yg9 Yb<.o7g~mqdB1p]Su!b9T﫽\p~n@Sl 7pܭ*vjU՝|^pckYM>$F9ޚZ7pn\1'M|MG>T:P~?nC7pyB17ǀ;_? vt˙e:ߍ ȯtVӒ$Ls10dlC| h>uګs/=zW:9W鰶Oz#0FtB^qPrBvھkrxCӕN {Q}Ikg1/Lcc0nՊ5f5ЩD$3}sk/c/pXFl}䏐Oj%8TPUb]ٔt>^LJu|.C<,gAd~}4ϬB oQ@s|0~[O ހ?vu=QyO9j6s"9o ;#݈Fny:'?Qǹ|~ƺoa|;CHkr-KN|Lpx7~2l !QsT[ًm;v Soad`9h+ڇ´ۀ?(Nvt?]{9`t15B㟁1?7~ ²m_8<9S.o|x#y4;|F:c_vuƜy"_xB2:_/oW\S W ^P4|*O2 _~A_G?gx &n@F}jO>np?}?>3c AH3c:Cq 11h||84ʆq:Hy rM8)(?r11F;VasݙįdZy AEq>i IvEK8 4:#nG‘ι:Ubs^?gi+rQkPȩM(u$0dW]pԃtg'?REٳS̷R_v.nNmKaz `'c )~K t~2=764,>!:Kn ]8 ^wBl ]ĻQ/{>8_ߎ.[!4~>~`C*Z/"ޙ~?Gb>s~w][Kwy$sGzohN{_a@_S*ȷI_w& ބwݠ{gs|%/{.Aޣ:ff;n?ۘ~_&c-xR?ǣ=/7y #2LBbG6^?ӷoV&6bgaQHYgCihy! -hSݺ.;QHO'Śit=7$A D| UX$'G۠ iL ~I׈LznsZ/9+Ɉ[Rcb<)if|Q·Z選dk =0t11EQ~'y3:?g7LgNJoBsDw_U*z9sZC%s2oXW!qaXG/g3iG$hsKY GW8N~PU`7p]UWWsjHx!Oxv)&j~tQ/.ym osU>+nlv{W~GWV̲ǛU.x/њnxmNԏ⹐da6ԀZʥ7x\ڗ•v?JO&u=fH~z &0縇䚟q少neeE6uK y/)tONvcbf yv.[Qf8_j<݇E<;28J E9tQǎUxt{gFiwŝ݉Ey]]Ŗd}7v牄6|d%6:?ѱ:6X 7Qt6ct_sÁb' ?}kݎ]iXrqf!;5NL D=7>瓰<3)ruU]. *2L\]䇾s O)wazgC4V ؒP0',WnQl'oFl?Fy$ =t ˂S;pV0֊̗b3x c ޫʨc=:ևxnVdmQngD}b{O?ɣ>s)#P쫎ckMH~=Y`Wo,x&4u9].&U[t48[_.Н_d9ftxPluM4wBN.lhQy0&&B8 r 0~]<$h|1dhU|MSƺdbϝc&.8dՔU9X`qpþ=ՙSô (}#"5&:y" vc)(wcAɀdЛ :;l#jB'l I+*ǧ|O ^nJ`nLO|tOS.J*>ʳxU9y.̯f_ZY_7U?'poJfNg@w?;_W#Z'8[TqqL\}[k\dyW^=.^UW}1@cv9 DzŇW)4ck@]WgKI޵]Ț59ƇMWpk _վVG[_x~7p 5ZhNow F>:gLτ;?5ދИ5.b'vs_s6^u0e_L쎏 4ssiV`?.'Xjg?zX}C5c_6U~4?TLO6?ī4y[5OoX}e`{F;uac[&ȝ>CqʿMDۈwk~/|sQ]Q˓Q;_Z/W_ߑ[yG_gyr.C![9u=sEdhTohP2: KSuuC*ӺE\z>xp;{ρ1Ylo?AP6uϺA-,>0P@5 cNh?0ϦW?~ηӏ3;bK]T_6/&B]Ge6M`["7f >\/0o@Z1K*c,ClPn֍2m}!Ú;Ħ1 *3z7ܣ5N|xUߛkRo竃c合=pPθ*t5g;9}?xlvy0m :ηVnx/:LܫRhanP<9#*QXP+:_ͳ:5X0Sj.`3l/NOXv_秹x6b> Zه]\PR]*n^Eۆ2 ~1<>7.sZ]aQvO;xowsv{KSU}U2XW:5=/=ck.[r6jr|9;j{U6e{UHuYJ*ZΩ~Wv00{D굃Jny<ZP9vRWA@}wr+`l8bDCx4C6/2 OS;1owZ{D9tP}5 ,׋|&feF#Cgۃ#_Șٛ'sB؞PV ;+N/ơP>r܃}#@Ϯ E[> >xhˡ>b$;X#6x!svu}#*w!>C]cgΧowOBp|ts3Vl9rlн%`k&%to45 #Jz`}`ڀ7xtKuj؜7LIS*?$?nx)Ρ1>Zy6|=αngQsѸR55&[`Ei<^@s&<y =I@3Ck[y!El3' P5=h OعƸƇ[3v;#w5D(#㟡 1H͉}sqǕNmOI3.gϴo(`2=x^|(A+ VWD\O2d&JvWh'_a| =9oa; _R1ƚUW{cG&>vXQǑew{|;*.WVIz^9q1m-NvADTi| Z# erk[,溒sHO 'J@'ߺc]޷gO8̧Gx͎Wc +aϖPKyljxmnxWtlw젃hBX]gu.ud5JO/1ae+sفh _ p)=syǜ7,'s@NN9~ĪfYo 6L`{*3vX!_9)]!c&O_ƾ9kۧ@_FהoN>_%Mu-|XrMw2p"u d<a0Y87ė(&_jG?_}>(q_cr8&13%'ΆӞJٛ} w ;T~*"59V9ER3qk]?!1J ht>U~(Qhk den [v1G΃>axDuy0cԞpwl;%y[Mx&#NQu ?_˭+%/teގ&>܁dq؟bu=sV=O ~٨9Z ѝ|bqΎ熎9I05x 939g@5" {uV__a1s.\ypy[z\ _?}!O`θ$r!8 Ay͞># ځчK\/pEO@~uU#[} jn٬jUQ+*)uWuuKZ {ҩ s7'ӝў]2l WT}Co~|?{:.5ܠ+׭^-`s2W-snL/ Ց9|> y69]>~*=ÅϏUqLޕlq /?_>8xKMܭkς9i~%[پ;K6<';n;׮jۮ[ծjN]I?bl.rmt+xk1H\C~UU>+ wv*kvl 3ǻ B#Ka, V?졹7 kGpaøl񦝣wKFg\L= r0{\(.ws[W*}A:׹8[ H OV?nV_0b^:/#-!P&S|j.5>)|+Կ 7hzxCd69_ e7\Ϝ:Ď 1ݖcAKfIG#c@]o0 fu?؍}v; Nʣ+'Š.:x`]1t1g.1qLae !>| =BG>,L4օbmll և< ]@>L5p& G78Lf{73ujv<'Rc6#q0g0'\^)c}%;ߤ1A @yDϹ)lv\C1c%:1ɳ=l?֐ 2?Bl3u:jbG '%<^䋑kIko60ɰ``pɝmdE|~s=\eyW,Zbi>%$y'hs="^4V9cA/c~u{c{{zn%)GN F<&ws75xuzW}Fw=t=>o*~H)8 [zo3'w|m:ԵyK}@:?tIu`:7< Q>D΋%>z^G%ѫ:_Fߓ>X'鹉2{cvG\VR|\8AJ?m5Akxoh/*gx6oF>A?u/?'I㾣;`g\O*S7W>I>?kRlsךkrER;\vX?E*1ׇ4-(нs9Sbilq ed w:/[i-#:=r98Ona}>}뿬>_}7o ؀"_ K拘;s H&4pygz[;XK=">Zf*̞}秞SG??h~+y#`cUN1_1Fw'": `1\&f'[\Aıw:Jh 2!qry\?'Ը>iJ |r\ԩI$ttZl&IDAT*["=\c2Yqnrx)Z DŽ&Sq,Ě %v2  Xu*=#w8LJ za82UM԰ HٿS:mi^vᓠi~j'X @7[oV aTuP]ӭu x+P_# ] p  ef蜮_fFɩUsqeN47zV*;:pm{ľ1ߏ `~5Wʾv Fvux_]+,Ε]KQn>W찝r+v%K@SEλWurae;rw\5_ EJɀE\[ިʙ]oNs.Wu**ܜ;;MijyK~7߲׍soQ_{(~)&́9`]| _#~Ju H#Q8GA[q]~ 2GCAu.}li)Wօp-wu_]|-rZ/K> L-yV?yq9ҏ%% 5ΠF᭨sC~qV@_džsy:+tu[tY0UooZ`ͶBLrs#|^ދ~SʼV{kH$0p}x|ߨf?{.<`վ⳽ޅB{uSslt.N%)j^bMNc1t`N@W`V¶S GB tC @ ߤa^50dhG)ϑ#1A~Ȋo.#ZW1ع)RP5 zd,ÌCd1}oecWcRc3>I T} _5 n9(T~G}|zyuRǟ0#o:go苺#[2ym5P܇E7jgm kw~ۂ/2Cj×'<1H$sM$9Aי).`B \~d8&jw_XVM#h(wu!䷀oADH=!@?9WiX#}דIyWsv<_w&,>[R'EQGg~Ȅa+T{? J73n+I_f/Z\(#~?p]GA~ﶿ>@@j/? { W%~#=Ao Jh-dDzi8S^g9طƪε1.3=')ǘQ%v@8v=G~e#i#~mO'o @&u\]<'MA8VA0>v{%t1:̣IqMPX>;o 0D;TwU*5 kaL4vq]0)㑇PTn67JG@ƚJE|~p΅G]PQ1Hx]O#qqZ8(玀:j^{<'́'H7#`֊WW0v% ^.<=17Dm/K;Jǿw/Pd/(%|7s 7ئ;"xϢORT]5<V๊tOtWdeom'y_AA?|oO$rc1+/nuG15TzΤYu`N y~@N+7ܸ$+w 58F] ~Mq}^|_;/s^Q?/.0̗0cވiy@?0j e1 ̏J/#}+ -itsN_γ>ot9ğ\k<97v׆ָ+:zYsr ^*o?|}e g1F kZm'eX&otQ/Z;~j'~G<# ~=D'vc\5+U%OL-s1p3lr@t OgoX&C ",CnfcW^zrj{/nP](<[ݢ_sCUStWs_FnGd5}8/f vbGMRleg~WXʷE; d~"@}%uXRy0Uʔ2feSok (B@{rxz8nC.>fo6r=M#Ĉ ";di}a΢_usY 8dW$ub9}: F< goP.l:a ƕh]r7OT&@#U9_O䙅^vS#bظkO6<-=2) riU?Hu1["X 5:rfF>䂍 R{ѵpu Cq p |:iN2-xٞR1mRE:& g W ~w/ 3Ǿ6p[K9}F I P[Ð}<!䌘r0.sHt&ԩzE\#M>~*Lu,IGL P8jkm}ƈLA(;q'@x 3w1R O1|`{-PxC|k?y306'oç<=S'9t~ a\%mL#N`Z/ǿ/Rmݥܠ{ f_>v>nFǧ/96g<7ϯE-] 5->犎c{ 3='ꁐ9y ["d޵ zt}FȏfWW-t:^O݀.` y$@iKWtGL|M{ l\r~/@=g25OO 8G:tu!LȋhJ0ΏuVZ W pSG>8jcNMGUW\= >>Owp.&rex0[&< xM@c^Mkdvs+5a\_X[y*Rt,w/u@q|/ #`whP-[tP=d@1 ?t?'tN]>y^쳜ggw  :l_ڙo1)s*4^->ܧ ܘs^D]'գ,Xݵ]T1ߍE\G\cq@e:gH8C?,ծ\upSnNvTMu{8x :} (߷r9n#jj 'u95>i;xt>ar&fbɸ|v{$3u=>lw{̪xŤN:F>ms=R+o1!sѳʯ¯S2V &"8s^䢀|\WQ{d.w-y2Z2QzNqO71|Ys!@5̗+}7KUɘ6LCz<ȫX{̡e@l9:sywur6r>]{vyүFr{,QSDž#^|hX#P;d0n1X.g3mg 8mCA6-'?N]G^e@eXe|/P7ưV~Rh풬&a]%#FY,6ż}2knD ` 17[)# Aǯ!߷&߀냰&m&2#n|׸:FId5R9H5:޳sxh:Wqjns|2Z[C 42=V>}xms8/B=XGrH~'t~[y5}~9~RL1M70_:+j6WycIt1&`6#>9gGM~**ϋ_ਉ>[{GD1ҽrn[iqZ .[ڟ04xF*߀\t}4G͋90r7Wy^O޹ގ\!b'{ 8D P)!ݩ{^CW0ݶ 1KtZ<]BUE7wWnļ'5j09} >$\GzO) @,U:`#e3k}lX#6qV|3k ̹-|?HI#oTjg㾞HVÝ]~w:kV!kKI_\耤!vNhA]7Jrހ;r/_\}wn,#u_~MǟA?:OVUBZkg)HQ!cXdn?8gZA"|AQCG nf+?;{.q=繌|?ʃDWCI>H@~ɋ^z@}g;̆2ZYo|YA țy-&PasoEW@0q'{8@K*` qu1u$w#;g?z܀!J 9Mq$>tGy"#h@K&bOZk9'G>AĒ-c :ͧ,ckxE\zg{{ik6 r#+XyBcD~.9_!>\8c Yǚ/]\`=bD^C%60ݸ,O׋_H~`-@k-k=#&\x%a7"DVK>9&yw?Cq%8A?ek=Ηȡ6mEխx+s~V4.^y9l7>Tn)Ÿ8v1'jrkױz8ytH_{`p_\O~럋#ٻ{w@VM{'zvu hr|RG@wyM7`՚t;xU cۡE<=g,TEkߗq;ӹ?җ ;Ň˄g5PQ2& ls}'T g=ΐͧ߱%mU3^ghk衽i}/\ُ2;t\e[9HO1wɀA1N~yWuZf۫W@vHud{`oQwcĀ2 kJru7g-z'2B+}=CcgL6~w:l9TIP<kyL@_śذO!l^d\w3>}X'6A&uA37`cߐY4Qwk= kU8uTmw'E;5#8O7U?#~%980Og|EU ?z5O{m@Rs9s,1Y޿aHjhuEat=JD+>0Cckl'E j,WgBaCk4n (CYOTA~'#(V%Y>xpkm{J 9wĘ`!we9XOhN+І8:VؽUf܍N9.aG[?׎㩍 υOtnϊ~.c{7>/rFΉVqwts#np;r◰2IWPݎ yſ1dmp0t<@|1nW]`[k`5WI WY;:a~l>u:xyts/svh ώ a6cI<{#zRvط;pPJ'r:[sWv >7Ee\x1ɗHyݾ8fN=kb#]t)o/緶{)f[޼J)5c쪸nt5dcsv+P;6>ǀ^U7܂ň9sY{9y_]'[CǨ}!6dqvOF> C|4;#DV#nֈ㧟٩̛4e7ӿQɴ`G,~&H^sl6hy^c##c{+y]ʆcKT~f'>_PTIC]7{u0G2xl~::sw2>'_Lcӎ]~ﲃQ)<*aKOǨw\#}yH; ;+ky 4hȔ1ogy%xu"LjQaD뾘7X)GN,/X&7DWAf'h 6MN !ܟ*prkAHN/v_QߣRK)'TޭH["l;\Gy@w=_p S<Ct*m 1yyq¼ql: ^[ثg^D̕uN=O">f_e);@䱲cxAs4[<<<z~ /ERO$(zi_}:wgl:Mߥxv4>IAx4R{h yYO=Ut@"ON`t~;< ?]Pukav0Vt0d(h)(,\쒯\/ qt~2**3ӗׯQ|9 }%GM&%s~ O# h `:2hkdjiE^/Pfw_Bl"ǫ'{Ľs[>0x؃.0}s 7J'~πKIYrNxo|5H!őy>C078J+d.|]Qj;%?TI&@Ǿh҄'Yq%/Ȍ= L{ SQWXކGǮpo_-@ո/v6*cBwi0Yb&% RFUGk#&ek`Ǖ7fcC?x \qp;p״V @:$6+rO+nl۵cP`NO3]7 o!!C?uv{n߭D͊co0/r<_0;N\v cڬ2]g O`sS.}V7[Ok;V~4QmYݟAq;ߌZv>B]+Vv=Aa\s$N7gqA14qЭi?y( WcU6;u@e5;]uuq 8=B{m܄_@*T:b_'F.7̹-[bjmͯ#j~b>r-׷uu1ߊkh@}Nuϫ<|=vjv |c3r\Nl㩏ovvm[=|'l6)= j(xcn?aC8~2?M,[1xGԗFɯH̕<'=Z# tKڈ.>V| Pлs -& 0vlrŨ2be#w: rz~2ol S'{Y h^c8\qsn9qe9.̇D}Wqh~|;yry!#Z M8_0mo{sAkYǻBPFbR$ GYͧ83=n_b`7qm%/\u?5ׯcÕXS*x8'F=2k`C/ޟS ,l/~AKk`-s%y]}3I} _=kw@ ns&B COkqsIu**v#$T Cc~w\n:'@Zwr0%Tӯ<ȮbN^M9&:j8ԍ{kIgɜPN7U` v+j9vccIt0j^-b`V󢟑9, YeLXĘqg־a_])W>ڒˌo1e|9>@S'Z;<ԚA˝8 cEͽ鸹3"cgHxS̼_@H,a9 {B|>=1QݶM,Yr_x<ڳ5S%svSb9&Ď&:W Gh_BeWG&Cޮ.Go4ir:3o=> 6.qQ|-ב|NޔN0;BF" I>oObl7|Àu?b~*wq+l1s80Yx09>a(-^ cl(W~rMRrW>`N=2¨ 6sQat~;Kl|Цk`|ú531逗],/|&#3y70pG;rh_Q`*㩰):C^/CxaFeÊSOO0O)fcr5ӷV!:S:]M_c|L$7$֛mc^䴩J ->]#xˀX0r]ξ-U-k-W6i@;Ca\3>Qu2[ vj`ʍм+'֮­_>uǝ6.<kㄺ xht?_w_b`jdLB> y@gKlex(boKS]gZ-I̓6*P~q7߫_~z)<y.T|3|ȼEaM׵q~`Q-G9>@|V2}41iAGs}D~~kT/p(1ob/p{vQq~γIwQ~ kJ ~K 1M6xzz!՛sduN?-Zy Zujd9weL5-~V~ϪKRjs1t_5u\9rG9tϧKutt R?=Q#3VmWqR)g .e|ӵ7t;R-KS_8"u-s5˔Q/rW ۯ\kt="С6~~5Psl\Gc<T;i! k|b\@1sVc3·UD/ n_هK7^s|պo3 -h\A].mQ31/SX#A|G튟 ]2AaNmϗo7ܡYH?c%9F-L9H`uJi]_+đǢ1>jHDo~g} sNsb;\Wp0h}4qC=/Gu?>.x-1tf?PCyEI1l# Ts;i)ɫkO?OzuMC >cq㞍gC}_A>x 3c?C@}ec׵ն6v=|=v&j<ӏl5R;E1!;~ErQʞ7 V~n{1^K *+8{%+~qr*ƓbU]'N:]]U|'{9ձ|Vdס˻^;)Tk8-k㿵con,T/>b{lE[ '?KenXbtEkj`y*$T#88~b?7 <9nH:g^5u(s+FTs7nd-<#Wvq:h{`}|g`k}4Fvs^{ e4^FݧGwzU<{B .qN~e0;or.yJpoT^upbɇ:;{ODST@5Nq9ldM+.c'R1 MwvsrB+<\~6;?_t-{;Q:0P3|9"xC5 ?p0߿e7q?`*`ӛ#h!;X_UCYULݡ'%Nc)s: YBGu5>3 }1 YrJje>PM[kLd8 7š+M ļq Y9] I6u5M:(Ɏ@Q 8apCv8}(9}Qq˴5EUDJh>xŇ>Wq]'a&Z3$,yt}egGeI^hDg jTy)s9j}{f>YwR|8)+#[1Y>Jw g/ƫ1yL\O&}m T-qO%1e5Nk= Tf4:9| đVy^ ھgpE _w:H|Dc؀Ƚ%%-83dqþή8]/ū6+e%M:ޚ8xoNȁful}26=MXxk76蚓W6 7xbU ]DM.Qb)vGbVKŽV;Ϥo?'hW3|f Ŭ@FghѪiM՚ܴMZ&g ue|.S6UeN5QI'tH+T:,s6d}kBːbl0~y N>^b V!G"q"x Gsyc$ƍZxx Ӗ}e6a'oeO-xf=֎(/C6Q}~zXXO-䀼4Jl̙;ɿA]%yt3c#ysн&ELJ7H.:zg cXxO)v~RVcb|)8(,F 7i Gf`ۈ3(?S%+M{[&&@֡j 8$h<1Z% wN֧%dIǹĩ>f$o⣯ZhA^d q:_ 87o4G.r]6kʏ}!65{#_bnذe˱<: .s  "#ȄgwN.85*O=+(5'z}1?nMqIt^ l̐*>nS |Vt'ך 0Se 1z9E!Qs+{Fuưu%>Iϛv /mWeng7lHW|~?  oR#jvovc/Nޛw>~ tV|BhN擲-NjW|;VEZsKxmu/'\UțV! [1W/lџPCdu^k̥,Ѭjn'*]-N>mBvkx1纾=nn=^sww^)$ݾZn'xBuʱ˹}e*'b'oe x/me{lbCb:Ҙ$slrW?@5>`;X\:r;·z?d&_=ߠ%/g}-F~.v<eOihn^ij$ߤ4嫋?ʋ?7n|7&ftWȘ[L.+o2tx^CdoK]~'7%ݔ#y7&\r51|%uF9e#|>lIkĶuS>9agiNfWm} =:&Uw]Awb8?!X#LҨAÇu~O?yUAYP9yJky7 8xp|hA޵<&'oɾunrC yIyLT'ˬ[ O,=GO%j38t^ɟ3tm 9Rż69 v@vP9TnP 95pwg5\M7c4(G05ձRy5?3k2c? ?AG|G9u.5~7& 1'?֏qcvNĖS>~(RG 8Ys!V=u{OJU/km#{5v/.q!Ozj1P+Vߢ;Fcj V{/bF9xQr<7I4.Ȏ_c"qtVx|g&}L^OG؏|'VV,;Ӑ>ׯ'QϣĘ;nۧowkXkS7Q/l~=ýtJSl-͒68 qx~oktWa/ZKԊr H't8-oE{d-ƚd|Y5/xN/tc{OiY)-#JӇy`!UT*]&B߰ǸŵHssƐXhq SyZ]9Xanc9<.yqU4K&јS{|'<ɇ5\ֶ$~qgۀnGc5~})i}g۷f; ;i;`ӷ j>ǵOh_:mWV˓%]<] :?'*ɸW5\b+Z@cutLP=S ]ˊ.SZaγx'gb{kC.\ڪiMٝ9͗707&\6jQ ocoWD[mHguwe.x_i&q?} u5qdN]loj1<Ӧ5 /1c[ƤOkÿ N(1F_ypN=,Y'=rzjs l4+{7\V8_>8߼!Zc|Y?V1 C7~EfI3ĿFge{#N~LzhWAx; dv< m$.W0t4-EAWnɂ|q|p'zD&qk'FmU A9v4.7'd*9ǃaMq [;,gqt@~ͅH~zG^+G}%q\b8|7a8Iw"NJ;3E&mFqϟId`orkuJN#Gd1br[nxF CDZ/L, cO{Mqe9?Im_"66=Ydž;:i*|AxD,@1hC{iCopUGZ Cۜ'r{\Q8\v~98gLNQd\B վYsഷѯ>)'orT=ŕ~. O2`}u2?=A~;xu-&!kg4?:k`~˹'=\+Qk6i/^&5-5_Omp/oKo[ׇ>љXU_a9wbV<;ܩ{a9ֺF]|V0ټ's1r!4">ٙ{qGlsw~ahpƯk@itꆉ:6ov~AL4d YĺZ_ךo!(k'cXJ{rǍk)o!#LP3)]A{o)iYWOz@n14m&w@xicL\kvP&;՘,u9@dc#qNp]ϯAY!4̵;tKf~U߳|}dS;&<۞b2FQOhD%1dA'ἄ89O&$ ` :oqW JٛBkܮu'S <9%^2^؄#ʓ8.F 7zW=`H;]+e.Oygյ'nrSvU\ƃ\G՘; \v;lkVy+!V^wYw>n *FWDG;ǣ]+ /[;CEYVs*C+XSN 5؄b״E\YZ6e͒ ~kWP} a ɧZ%tq%usgE|%m~|b6Ł돆W@ZYtW\e|~.զ0H7}vfO7s6w'|ngco=g9ȜAv܊᱙_Xy9awn\u_̓n/wjgXuoTnv"v驮;zϨ5<"e|Wh|I D^qG#m>۪A.^aW/C wMp@j2u.V,>{Xfe=d iSʷb$8]a/]ϗ9>c-2cϦ (_r;<'#}#p؋u7x}?Vj=+&ۦ֭o㱉7BθYf-۽R:y4{bNЧڪ.1́ g8̓cwMo23y9c:O`\0 yDlǸ0⺎)e \v?ޤkns-vjx: `ԿkOPUq/-bco2,jpCK rKlu'Z:#z8T?N*qYxmeߚc9lܝ<e|%o g@!;q5!3u g1L1@})V|&·`w:X=U;]g2uQ~s4r`*qW;]>;2PPbT=#r>!P U^}ӗAz/bPZ}loord; 2yx CD W+΋d7//X&CaE{;/cB@O8&u |<1Q^A'ڨn] GĮ +\sdD e;w mMd cb^P;|78Tn}>}%i9)q OEYP0w1FW 1>BxTEkI8*:r2Wܬ1s|Ur8쩚 |H{$/ceUЏ 'h 3hZ@U: }?`4yUZz/ʆ)c0YQJ>op~(ş^ yb1iS[< = ڍ7~\w'>[o5^r+wbN2(D#v)#C4N9Vn[k(#t([Zt]_|b&w7f5zO~Obx||;-圷Nn2we⇱^A{gk qav'8\6Z`q6v5v];FK[$1y\=v6.#)'V`?P+Hǣ^..!=o9G@Iпn^Z;;ꁹ/5W=xnj 9SG]Yo͹|>{g?[=K;_|x}N}{o0ƛ0}Wx5 'þgj-> e~㿋9xgQz 7Zx8S9}$zܿd/$r@>yyk ^sxR!c;jb%X:2'ngǜ)RMgƢSs76ɾQM' N5S@S;]$=wBh<BHH*_ >"jǚ9`<8Gb\5L x&X56 `DJ=GRv\{"jWmMi6g$/҆$16M\ S78!//R9eU)  4-ʬ}S7O\tģ|7dx 9yKGF|'SFJ)\ "u `>Tvҫ5L&mnЁ>e8Mŕp59AۃYxV'=k.x0F\I;=7&C7(گJIutuBN&<>Tz迣W"]]DGsOG |Кm/{W>~yvWG& } V'@.=H>|Xp ]pe~S5ZO;7F݂uVy_Zd%K/61VxzL-c P˔Vz'EGܡd̩lё>[P=F9|lo>_Iiq o͠y}()]a^HϭOPWk"^jH'oBƯ&S1֑ KZ@sq Ԓ0&1~RW$ԛ%3]\gЅR+'BÙyP "_s6}||稃H8N9uЄ7c@MreE|KI0􇝵9 Ut'Ŷte}obԜ ׹^c6`4֫wsT:g%{ǰ[tvG"O8#_c0"A30Uȭ ~[XL\2>'^^`}Tm{!n竰Xjm沐qAk/c\ė8wB{i/׭#E+&.%Ɔ?lo~Eѭg\`7CM3uM6sCKp[&)п}V\1Rŷȯt B!7>x:__oC&2 /Z?|~xh& h}.Σv4Io^g #!V2}bc^!u|ȔDpi6g!njb>Ѐ}b^ΐ'q}}*բF x_`eI PeG 8'S=+8{t,'3\A~ >Wp):8Ϲ݀c[_ ȫtϟ~[6 >W36nǫv]D<_)~K}.m랪 z VH}+$V"08QaLxcvy@5/^LrRCk?11L&iͫDW簳}8~]i$R} KVy|\9 @U)]ˡ4k /v$Q<ۻ8jdLtsj~20LuO?o?Ծνm}TW(1g-pAA; k;>t}N1ƛ|[wT_1sOrE]]*Oㅟ ԥ W5+VsQ+V<>9'\Q^}֥e[6B:?W8oq|Lc1W0vw^+%IK=xuV::es~!PZ ߬9$S ?"΋#昪A 8^z|y T]Yg 9>aC֤|p0{3T(ad5GQ0}%|!;I_['{r^]R=o0o&U;>`xNhM3 qqŘ, Or,8 EOS>5i3$Sև[)?1拾@n:1VTApyyLjlF<۰\[~o]]Ee6QY^19E``NZhK91M090: Y,6C7zW6َ4Yj ϛ\86>סw>':gqnշt lg]`|8V\z!^V/icl!t=ڹ&lk ;J{qsbz,~B1|) c5᳍D^<v2Tc {s?!Cvl oE7o|<|#^WO}ڮPbY|c`'6K<Kߔ >/Wڂb)*`Z泥{8ߧ#xmc}6Dޚ;Ksv>!5~C r^x><\PwZ0{kojs^ͿXOvGtmXxwuJ±V @t.a>ފ{.p\E^ ֌zxoG> 51j9cU0džW%tη)'rc_}7U1o~a1v`-n*/F)hkj,iϮI)-9s 1buP՞2k:ڬy͙`wH38aC1goQg 80gս"YY_y..x;1т&}#<ّ5|yדs0鵤xd!r0߀6H 4W &uK6;1}o&v›:'*<:< p~F] ?qN'#.?5q]б^3渱kv_dmk< PGV;Xjߚ۫U<6wh~,l\f}'=0r/FY=TA~:U}ܤ2wsҋTΝcZ ݜ+jXv~)鯳r a5:jԹ{/_Rbsv}\gl[7kk'gV"\̏b-<,n|D 1s?3n~_;÷A |\)f)U <;Twʩ sc-@m 8k/ ]/79ϝR>@c_Xq{ۨ\v*B1b[8*V|j+Arj 5bQa\N\yG \_x%_+kNVA"wDG#"}<7ksl+n4;3V6|hs[mںhBn~N>y(o@nt볳ӹT=̥vu~g_rMbm yD3Awit)|tqc0 n\etٕѷN>׎~5M_$"ܷ4gBX<}/Vm2m2s)=ֶŸݡ_< 4 t#uKgWosM Y#KO-׍s>at^bs/u7}"lby}cᣚ&u$s}o/Y>1 α_&0-M@јgEε: Ahq'Cʲ9bԻ}Q3~[@Wjl'cbSx/ 3;0e0*\bEɁzOs~cǤTJjO¸CP^8CAC';@{iP?UuVvq|d)td[@.sEi^K$jLw{:yyB2nzU>N'n^uA[hd!״_^jEEl+<=Pq\v5:.9 LQ%ӽaS"i>-bð`ſ ۛ<}oINB5qoW: t{B] D%IS< s[;BkԱBӕ&`\ )?כ.UɹF2ɇsP'mFi=^Qk.>u|{ &QEĴ@Sx9&+S` *=`Ps-|;r9DSV}-s n6cq #)GSɇG~란)lu6pp pHs%|gPеVs"oF }JkuMwuEO PӔnsco ON&O) p^k;2>y)Nk^Qy:&{=B`. |!R6K{gjQ9oYɘRW/c`ⅹ^!2׺~{ XSo-nEz$G'օt:{ܸC|5..dWU {3]*Y6W=pEF*\?d9EW1t/7*'#A}N/zɳX/pO3euZA΍L}򳠿3{5b8kWo11#4\y/г6X6K/|}tn nps=5fB|sklуs|,^a}xSq |M2o`]xu8T?@uS^穟lhg-|t{gQgUZs^ ?|:n?jy'̓p1/?n;{>ޢˋ!;VqW8F D q7oUlX{aOf~A=jkt9{7ָ';N|\_k鯁Cck|SmKǕ\qAq >oe %:D]V9=ocbo2WݍW~4 8ObVY"&k}49? a:S~:pjCzr,~|?×s$i}wغFЭ苵 8kAv q Ҭ<:08vαZ:78Dc7Z:U dm',%<ُ<Zfg݈e|=S}w95ԥV|fU5Pq<vGOؓ\fK@VwCy`VIx%g5'sqk+D)N9z'?GK{c8:ߔ-&K:sm~u Nnh+֊8vEx3./ї >0dOk5I Үˑc Ks6 OFûCܮ8!ۮ)Z%Pgkn)o Psj{ m8Ft\o,xuZ^s]xʗn%[<;'4r!+NH$O}LwƊ3vOH^:NK}2/1PVt |{4g GcO~&sI`^t]m.y=D?ṇr{8dE/xO1<+ѾQT?l{EKῌ>6f_ :BXx=Ӏ:R WsOW޿ M?I=V샺 iΟ:scnO&N]Ot ~V><@V(nW,ﲎk7k~y9㋜D'#_eoSB.9eXb1H\+ {KG6wcoǚzO׶Iz-\:<~n8#);:1|ܝZ%Ԕ0q2sE5uWZcn𳠑򄜇Fy aX`Q? g5,p,RO! x3F}}.9o1%~y:`Ѯm c|7^گ]sğ>r?<)ϴFQXzE4m d;."<猺bak~Iޤ0)c},MCC|y8|Tu(x7WPuT2=?O 4> ࿣^?[NR rO,{Wy? g?7{9BY+* /x~5':ݻ+~w߈,sc(~;r.{m̤Yc/ \杤gC]mւzO'~(6e̝a7c0S:IC&L%ېE0F;PO;b8s=R|h;:`Wluyѧ@u73uc>=zpNIاEnC<wy(2}f46c^onq&tD]uSAٮGXYhNtg@cT/7KF7qɮU\2SlW|GvYVb m||pLH8Q$ѾYS t&=Nu6P:.aj^2&G+*e1dIJE.v>D˼pmRgxH?)VM)[#MF\`kh_FPGG=ídou ̵A4CUIPZS _ |}0eXk_xBw+hv7Q5g|^;UzJ {Lk7'-SOӯt*=I>o燹:zS_Soр4mP7 qcn }QW#1` ˱ǿXZB8p i+]Cj|n>+z̫c=OpJQ`Cuz*/9Gr{=U0 ]Z=;]5uN>7O6/X~Pl6>:L y/&{[cg/tgWa49r':y*O@YØm6!;n>L2>/ܫ%xc1~Z] Pe_' R G?o0# |/VM~GW {AaG h"f@9)l7%C |39/_ tPɷyDqiry }c65RE:E)Onj|㽁9(y*IUX^ĺ1I]#Gc .Lö1ܦk8ڝm_Oa+2˚:N?_)1橹iSa5mW˓\sT:!ZS}oP`C(uH)\q o*r.'FtWd /gvڽinty/uo^Pw3\b1/'o׶ia M)Wm*?Ʌ:;psfd;Vv+dß]5౱m_o O`ta71OSލC1;7e :T5h;ӹ)4s9gypV+0@8z!2>yRƃdrWG~:ﺱ);Af;= %akk{'}=8 |Ff9nfct}]JB]~ Vyg@漕1J lg BKs`>W ]!ߙk^؞JLh`J||6#@ă;rA1cVQf~k$;sةEd:^oOyA3utahNhɯҟ7bNSo#Uy .-==uc8ĶYPw]knpGK5--N=(Z=Ogq| ئ=㼒ɯbxu}!N:?MGo彰Y ^{ſg jP?c@xLgLT\d>c Y Kc-qsZu!oAU qY}H5cY0nmxuspy3g?9<';3f]nZG?-1dc(9zEŗ|!/%g(Am5?-a1:xN~ MyzmƲkr< Tgt"`ۣ\)@q:Am]yn :&C ǣ7vMcW\#@T6?=1KhpP׌ϰ)\?np)~U8,(w1}OIZPV #ƩF>7e㛪/37Pfך "luưb-cюcƞkuAo K=տc݉yX::N_DSjd;t.tGbhKxDꇽgx.&`r;gKL~V9]jZ<:?˹N]t5}.ͫ>~60ﮤƋ];F% gWYTXDyL&r|f \ i^U_ob@S5%Ѓ (|lzicshsulք~Y[qoqnSqgz^Ո6UF?׭%1$}ئ7mwo~vp)^ru4~Y32)nN wb>W[|Mx}^5ޗ=\j T_ek"r_u&w^cӭ|8M} s.+{Yc<~s$:77 c>l~P)Os~&_e71n0|UjMz@0+Q/ XG J-ެ/2߈!N&a!s:yGnglj(y#ε ?죙2R1wb.ڢj۹2oiznẢ\|8.b:[Aly{.\MӓLu:}g<'9h?s}C5z]w̹`C@?=nP1z×cTFշC:֊s;iJ5MUL^Wz8/7ьWޏe9qMJyceÇ{9؎Fn͍M fz<FR<wQ':'<2 8v9A=Ufm X7٧/:P_#~ y<4Ek1'o;otX_g̯֬u? GBp%'wWp;K'>n_-~u9BH{ZzIծ=++SR|>jl9rV~ ᭘֦Bs{~V2 N睁xU\7QS8p+G׳}2^V L\aew^7rj<Ҧ"'T7n\A.M'?hx750"V*n 6;&9P &4m7;o_"CƟMP?'k`6&"w`!3D+;ykDqN עJ>\t&>pu~g1Sji^&IqRwຯD_=-GJm8Yˡ[븒Է({4t:1<$ K*cEpo4c0<1 &~zmW/hRfrc'9+b."μa})1+kC\x "y3z+`ZӬZ X]`OcO]u~;k>Y捞L}d='^9]`m쵾Κn )T!OSt:沮%HoE!@k%Kt2ڈbLy]uѻӸ7X-0fΗBA_=޲8vV1/33O]j1"j}ۦVWjwn-lZ8Ώ_c޼}[NGYN]PV}p XW A]^Wb<vy ?5Ⱦ%wxǚUv9a@dz㼛<>˹mp"_miv=b|pw5Lk7OܝKbެvq]&v N1sg~Ѿ1ytFn>BˌVym?ű ;꜀1 _!9}:ODWPlI04xL{u&ZNØ<Ϻۡv(/uGzՆXMi}mEcsUMf}͞e 7B1y& `*9"vBQ@\c>m몄sK%b)曭bڬsuιÈ?:.@k05NUx87>ÿ֙PR_<1 ϖvWr*ڃ?>0} vϭ.>WׇRɻ@kX\д>i cvs8k ?S!pq~l;8a& G=`3Ufǯg+t9|&9g[= EB^=|HͯvjE<5?*gΩ>h65bXyF9I.!l8񼳆t-`Ӝ=sX4h3tG=۳ | #s^Cr#ṬVyxԱ1~l<з۫bf۝V\ C#Q1wB߫Z5ql}_'T*^#rmw'bYGS,>ܦWtKH#6y;$GL_wsNl]C>}b^#ERAde+B i0xkvST8u~za:IzWg>L 8ryt&>i z(:MsW+<7Iխ Ƽ/xa601m \#ѯo7PXA*CuwiFcC+GQaJw؈渆.Hd;b[T /B8ȋWC;"=,{`d3z٥~9 }yy%~o˖؇w OY2?=G>Z0CA{}b)8'5MΤnjqVW0b /t\-=n/͜!??p~MuWAl8'Hݐcb~fSt2VoɃ؎vkž#C#O  VQ W>u5?DU8|9qPcO@POW{doj{{Y; Lj{zŹ6]ml6; E_ਵXj&y_{V~7w~fīZ} O F+ldO0vWe}Aϥϫxf 'k z#sr~^ G/@=#>xꇀ>{j?6PyC?`Tm1 _jG_@ y%mZp:zOld}C0,:G<,Asmc+Ot/ph+Oi|2P7NM(=[h C&[jk>ߺ8%xw_ .7ktUKCSdKYU[Ս_zuzިwտacUnܐrP{0 L^C5G8Vخ57˻uuw{$;e{V%s73^: sv2M>yWsxwLorArb?.j}Q_̷?nJ]>w1߈8% o {$f5s?OoS7S9(c*r݁F ,a>51_@uu?śh+8_Y',e+3&I8P-t%B;yܩ 4z8wsgޚY%v1u:O NsW?Rr)y{%q}CWxɟsusE}褝c>U' :0:$| 5`ȟlc(wH=ꏼh/y|V=mzmxȶ)WJU|mɍG?OYi˱rthA`GlL7Enڄq\|z U8z`{*'G*d;~O9bwzs:ط`YP/MgV9s :c'myC~ |q~$6;d.#*CUO]Йy"2>Ǘx~mΓL|ROOsR]t]$4 %M8W%V|ū݈&emEGG/p8"~ V&Ϯw꽫9rMq6'\lj'oWުt3]p:֚:)V_GEUrGSVУ_-^u0(ܼ9\0{vsٕ`伩+TV5xJu{3WU9"xs7U%Gc[|\\srX텿6cGOq: ;>Z|;0RPX^ZcW0d|,/R}>O ]Qw.\nʭ.tgM>u~`W`pNPGV^oChވKr- zm YvYO9no|ќsޢX^ ;sh#Ʒ04,M#1?ñb!9vy@쟔MgVy)x|otn~mQ]ޒ|vǧ5 c6u,Sk`v߀!"&5KgpL2C6uM 6{@$vgߔnP:m5M!&|~_K1k| ^]~>x?Zi9,@YklC_jʫܧx>lb4ٹ܄K?ks?f׋@3A2mګ?`ot;?|S)p\ޝ究7NH;'lXjͧa)z&cOr2og(Vj!мptO>dC= 0Avv9-s3/_}M1︎Q}Nx@%GߐZk+ K{ W{-5{[ m:^+Ǯby@)7`9Qagl|g_2 vW0p36::@yn%j.w͗V+  0h j~8lkxqN]'!?f_|7~=}7>7!ӵ.w:O=3m $\uyԹו #䭯U;}QZ$4.My$ϘC!Rkr` %<ˀxz7lC/SGmq@h5pf4WVL1'r>rr0`[+t>77gq?dZP6@vT_|uyO'ÖpCg|SNONBI<v92_{vwR?GWTw8?32fc ]O͉GxRypB>1:wJ 䏾ROwkn3uA[t :@HCa[a|qʦ2FW>>{ |N6 ~gSIMm[ 7_د\@uۯG>]EG8??˚r@Djs[W~GB||18 _@Yi~7Js? ݆x܄^'-~`_ק:up>O%1dnS? ʞAWWΛ?U>"PZr v4+k׿yװƻ;Mx 09F=6cb.わ7|o:#> ї~nPsC? k/"!yxFK5wm_ƅrFF.CN6 n 5ED||p˾i.3hC ?Iıe}GR>79M1>9ǯ8u:cC=\i+Y8a !RrNBw0CTǕ"b m%!oS1IsK ;z=f(ZOA=%gGE.l1b1hs>F!p~|؛Y VDKO0|L)>G; 8a#>ǀcdo}۬g^psHj^~86cOY)|dJ5:K_χSs:_c\94)8\k>+8ԖA|tAؼAqtk7gMn-k[?~!8WpΓo:RվpO2X?uwO| ll@j5{_ kw:6 Fh(OWm-\?lni,i\-xu^<@x$odbAT|9Xyڀ %j}IĢ\k]slpttOt?]й|[c#߿JT6 >Z U䬔 _+J>[tC S_Pʘ#ڙّ'O-)y栘y}$2yzJwJUHeuXb𣾴fxXO`|GH^x0llcLs OtG`^?@; 6]]' /O? BCoH890?Ru%ihCry=*-QtI: t~Ht=RwC+x9߭Hѣ}"BW 㧜zjWiؖ:_`;{:JMן|..ڹ3/=XxUzkޫs{EŶ|]ž.ǻXՠ)^.c͜8F/-</4M?^whgIgg{O?ǠZ[dJ:γoO3`3Q@]o5] 76; \ WvVLT:^1ç'nn;M;|`bXbW~M},'V9{1@Mwפ;c >Gszn ur~k3`}/5KoV 9Njn4MfUz9Gկ_}^ :dyO8f3cg_'jm PERtߥ@q5OJ@5T<僇_,&||o rPc)Gǰ:"st<,{ ױRW{7ۑGqJk:lp <1b#ȀOʀ)KU}u?c-ס!.⋝pscN$95bӏo|kWcGc-~-+j#ddL9vn@S#aXǹmdSK29 Lՙ'_-Pmژ;?yϑkCW薸>v[e=u 'Vs>eg rεir#@:(t?x0ig_KY&eێ 4/^7DFV >ob8Jh?؍C+xNuP6h휇6SjBr(`B|wu< cw;5[}jfu+2!3M5̫5՟qY_369~܄9Փ1anC[$f Q50F1vvg|wq=f.jr+l<ęd.Yxyj YNuղo%4tX''ԹZnwRԡPi+{':]-ҍnd8y!>ʹ#ln sڭb^yNV;@~uܞk$WI+;)(NNyK+zc9 A1i~+g\.L]?,rz]WK4 wU:;5𔚼,W=& ]cչ!/,eavµl;:;SoͫbqnZ<7۹ndtժѫwzuF͆ħzإ9d\ DjEI`Ƈ&Se#TY|؇cw1뇟7}o(C{5u1` xomhؐ/N75:.Wu\re ؁N|a 6wq{v-VcDzoxOӫ8BM1o' iu3"jYC) ́cNN;7(,SZ?#Я7کU ?8A glCB>#xG}PZjOױ&n0pCmY"'~c5aV _V\ h~|y b`}Lr谁O`H%r2FUè76PCGӀuF B)x ڵ(|~M9T&RFڡƇ ):\J0Vmڏq.<3:*w=\zȇڧ)36vol7aMNg76\^KNe v&qXsIn ^GD7H+djNy9=Mf9$}>~Yһ{['];Ne:׭ו[s;/cL9*+yy|m7)&zEǷ30vx+q/%UGͿsxQ$x]xo?7ߊQ7&#O+a;DmH%HO:7zv9}`Ak;6/5x'%uwa0m=vmlq^{dI_@NJx.'sQN\yrW7︒%߽ۚٻe.+WXn=lup1Kc٧ftY`ZoMUmb7;NMy 3{ɛ~18"e|>:Z1ׄ:,ohC }>܁ m1 }Z@n8u 5zks,^*\w "#3r{|۱C90c6oʢ/@:,희~C}]8s)&|^q]gla,vBG;Q XBέ[!Z8O'~1ģ^EgQro}T!\yX$uۛz~e.6/ 4,*mLjtC&$ yN#9ޗq+@V9n&~s U]˃7-g‰es&!a?A1!;%B}"%c>EY{NQn9ίP =vC{"ܯc["_jbbbwq֙y:;ǹC0\3X-N8cYz)C˳ ?k>coiqew3HU+eg nCk6{ѐ{ \m@y }bsY@O_xۿmmA<_1!@"gxO:Fie2=&cy8lǰ?݋lǟx5jr;鄉Iy3@WorXjc^y 273y]c7p. TfSᜧPm2]54CJ61=V;*n|o6䫾=x 6}Q&9ŵZ{p7aV~{=-I9 m̬= 2I%xM2)_r C؅Ժ+C1+ЖĖY8o:q^ JWC9hpXWK 7 _߷9ꮏ'2߬Klnꗀ]67}]?ɹ82Ϩن#]g$g/SJdgIwbsiOr/珁n@5'(:V /]bC,(ctLu9;*4/511{L{6~UeyǹȞG::bE7l׈yy }E"ʚgPMa>n{zO} 3 U=:_l6J2y=ϧ~OI9#hnOOGWg~vHγMè_uPPnb<:}A)%:mdX6qf;٦x~=05YmȜ'[ݯC#IuX ;i͚6bi}YK;]';KE#Ն󯜻+C'chk$ooF{:V6 s9 81y<)*^ԳШ}ۻyHz.h3|g~:?B_UAY}:t|0흓F6o-1`H,cCg޶w [^.3 @C[Pn |uCh('' "U+FuQW'2 6@hLeS$sc"`[~X٤>A/;Wt,Ƹy ÜĠ#뿓+bLU׮.!S ૤Ǘfst2S=R3|g]h#@K7=iǖ_'`14o5[>vF6FSC&9B"g<[#u1OK5ʡt"vdRzUC:ZEnsњq&zU 5e8e| -I7񇾇|\t0% BHtJ>-\%Gם/0qm%RkGk}ã~#~6g~6r b%|Y>gADo;f|[2#7B|sy︛ !y'9x_j ȚAt]ZBV5xTB66#%' X|Cu-9NrUJ'ddr%T6GQm0~kmBhx`k'D=U }+t;x7ƃV' :Q8Goqc ty ;[ysNM,i̫ ٟj<)l Xw'Wh(+qBe|F"7n~eM^;-ʀh^mI_S0.8aYiJ. _e!XHDgw8WSd6hej;ԳaXS}Fl%Vmz`sY[͛}؉XyxeQvЛ 3xƊH#4F-|nI=x޼\_~s‚lE'}l*k Wj'z'r&ZжЧS2P}Fߘ珬Ey=aH }+H HLjoxHlY2WcOks+o/n4jl2H_` U0J"gm~J0n?tm>Uz&Ɂs A~x]\wQhLLju'k9=z\Ң_49c%'h: _ׂY}1)~6jv`yGAn\7?y5yH&tb_[|IsW"+ߒd,_U"̀&Hy)d%+I6# *FjKA_;jK986x雼=9㨹hO2Hmry־RAg0:=ǹ(" hi%Q{! J&V3Ч ߿*o^3_5 #R-,7xOI0tGgss\"&;dzX" Xi&>>&Y +q w6'[ o,h弬w5=*[S9Ef'ݓOyπZběT]>.;\oT G\ӭfgv hƙG4[}0}/k8tZzf{>КT!Pgg߬-:f\êKGkRFb `.*O;ڇv__/"v+ ? "2aףY~]X{<(௰M\]웦˘{0h#3SvOAGGUO2k<z< At3[{~V_AsĺN/[O|/*^萭j6}>`N#IH7֥O9鱉_~&{dz-a4?m|L -pws=^QiUEћJ_?WEqjz:xYLy_dطt,/g'vO|~PR)/+R~9ȡ_mŪÎs ,ƈڊDbSgKh8fAC& ?2x0&<ŏyTyñ6czppk@|x'|>DtL `;MrUP5?w_xMc8ZuFVٵO`Ӑ3 ˹S"[D]xY&OjhBy&dؖV*+qw8o/xrÀUfx#VHܡ? ܤb;Dh?% 9F@|ψuZ&r5q$fc)*=chz!"2BH/ϩ#ܡoGr|yE{d Z@õCU oX;di2`Aֈ"}ucB|ҹƟ[lNyqnb{{7v G[_)#'/fsWqrW0VqmP6$*}π=4%Y X3k^ǫ7OQjKXeX|W؂(fx^l%OnF8;x֜ pv dN]\PH΁ש_;%c3@.y2^f71'S;^kX"TˋX+;TuwFL댹nnO0/xtH:N;JgB T+YW_GCRݵLO!f o?ǻ 8MrWqOl.q#s 6 a+ۧ}ϯKu@?[K|zD+H󼠿G,(YQ2yqqme*;kK[.wƘlcUVr"ޝofe;׋1ܭO;ɴn*;'*ϕ\s >ow/ֺ^xxYx)@xd$G9r 5+;xmYA;kb2-se s'Q ~ǦmlGK}/b*9?ű64N? ͈BN0&;qG;ufbCya6Վ/%x:ug_9O~k_1\KC[eK9%r>o㕩Ql,s} M*c.?jߝ]|Dun Rݳ%| 1C$elƚC+[?[N)lxea&S{gj5sSrrQX]'EЯ~w͗1Wl^\| \#Ɇ)ix- ļ,*`* UM[џiMaٰ2 NHS 럃@Ymzm"qy- վwq@}J 8J)LFpS$s@:#{ؼh8L@梟#T'+[X7uo\iU큻5axľ׭W*m\>p#rM4_k>$a6&֯?e0Wo7_ Oyu=o z~D5_?-`ooݞ|}Jw ;uN Z'Mko1 ?W=6V{f5e篛LLEp+N0082N*/Tl}ښ.8TVpĐmY{Ȅ9ݿ+= =aظ/Gt?=f[cxVA~dH@vP PUi:ނ\6s=dk=/L1H2`: Ժ 6CYg!֏rga- t xY<\o! D]H7ϰv,מ!⁦jgfmP6㰖MSj}DOu~1.t*L|0sy [e5`@e+yƚS&[ =]dkkF7*BOJGMt f>ewm̎Dw}ďaZq;1fzO|;Wj֍}LFez=Q/'sq=m/ l_g294ϙ~KᷯǪ}}6Vj<\qvtCHYC#Y+?KnWj6Z5[lVrhs:uvj,by5X/phz6Po a8p6~G}q} 6 R"@~ uz6-EmVDNl>rU?|OcoA<*4MoK~qPW Uc'q5p\A?/8[yUzca}r;*}ƱCv-h#r82Qס{@.9w]դ!"N,yrj"W06e <ϴ ^ e@*ȧocihn/ Ogz|2cPoF+9#R^wkŢs$^ _3?o|T.nc;%B kx誑^E w^X5BO^C._g)[_[HZʡ/-ޭ7m<#B"vH71d=+ufA'WZ@S بVG,;ƩwEj쁹UTkC6Cܖ9 <{;M93x0瀌ar~ثH?G$5i:g}< e}X+:BkxEMmX+[=6!ʱ|Tp-GT|#41i>Vve&[=&#n( I%ns)O5:E^FͷD -7ȡhqdoYǺjir{` GT.gExBܺ/ mh}ؿDc{Ou=+WImc%9^.=6wFxUxOcjz67ð7mvmM.x{h2ޟíK3wuq>q Dоyo@yG>s&=amEL ru6>[$BϑhwE@/#ٷ I7e _r~S!s=.EZ9Zk_hix~<骬Rñ.xj&3<Ϥxnk: i78Rhe( )?['?)l;FHsܼ.Y '#|k_k5~Vg9WuىnZw;#ol8Z0w]P:J&ywF?_}U ~Jn'weP9\p]_aQM1AD~d+7/zvfVg6UBi)1 i,~į?¢#! xɟPa@~eBE&vkಯZ7]d h+ΖbETy3z(Ghڤ!X\eA{9tG\8ve>KОb F;iSd~'#/m(x? hsz:\uϠ8b}>%4\)֦ѐO+*E*G@l+W ulm7 ?kVBOa(rMt7!5؆]3&σȃ3\czP"5, dn箞W t 4/t=?P&/||^y׹r#~/Ϩg >?*Ƀ8u,D>T5#{c[),o|)`Wvho'_PY}m'{GunB ]l?0 ,? s8Vxc"3:u𵘠J][w9նK lH7"7u!vCkrfq uYݖ䙆dtbdrR4 c8η_˾=9 'dυa_ψmהruud4I:ߺ_nu=3Q z^"gPFrO o-a66̑Iaވm26/7p5KvP<i[%I6z d:Ԁ#@;/3oS>R f-k@1nLj[W2jެOS6v|ER  Oz`/j'DE+_<.i%x ƹkjEƔ!fs'7Dd3@G{DמhnFc6Y2VuTH</UH`kqB a=8V'Y=i n;~F*S-8I7oԂ9;14&z@UlZLl1r_UvxLPl̙6.<(|wv.l޴{WOL75Q՟+Lpxű4_xK^,~]y-A<ЁtkV̏/dmdȮI̱f ˓rw%F@kG?v13on`M&>:9F΢ލ9w򭨏@ܧT_]S=ԪpDfD) " uO4qNOq{9'[ns}.* QJDzKA^ gMCX#P7(tίLm|~{yD @i1yqжCd_~дA/"h#Ee120NozlNCcrf[&fwn:sj\<]xO\EMӶΘsBVG=f^zV~!x>gPTx~.֧ؑ9=ab27/Q{of:ONź;Nnnth<>XįPG}vT^ ;b ~WifJ!~CO&Z~0c{ (CrzVs˵0 e"Up>@d5#kT\c:1j2Uܯf:Aco6]2:2_j>q {~o [#_<Nn8?@|N<8`6&o[X.>C BN rP"# q,,W7eITuInj缼_ rPq\OȾ-Pĭ#CVh!I{|v?zh\Oxd_-bؙL6"5TV8cRg_zD}Zo8AUpΕg_<+.s|;@}UboVω2 o"d=(øTBYx[*Mu<w?w4sDcu֜!}R#19b/D]f<^F[C6d |:@u˗~.0[iPֽ/MY?7s.>e "6Bދ;7pnM֋uqPŒT5c?\D&jޞmo:=e|ɛ;4g.'> uc2}T& <պԎN+y >XԵAdt.mr<6Nq{>sޯ\R2APym{m9'8<>}sʅEyq>T"cWE؊Fj䌼ul<Yv?R[NφHVCFZG` }o)||Ƒpd?Th7RcH SnMf >(s$s<ٯ@5$ vQ 7pq^ qp{1) WcchS۪)Ahי:~m&P.ޚ+(>xl潌`VXOEw!6mׁx_ƇCn|9OsOkY썮%uC3mƭI۠ *L0䮀f*ZQ:u}`)bdz*hi;8쵸,zgX8 9Zk=>@y8ő}`9xR a{BsmיfOӠo׶:GDP'=l.xޏ=z47{r Q4h@_uHmcU6S1s6#'}ΫBXW󕏋<4snxAƦ,[:P59- eG-qVmam0J%v}ˆyBˠrau F)!)Kݴ֣n\ \g?ќr 2|x[+xW4qtP# i>nu:X!|GE=+ڞğyx)hxY#/]ŰkYact1tK2 5 hEύ{eaSӋ򵁠/y c@~Jwtj__N k)#mώ{u;`G#]GOoyCרuŦ7D:`rm4;?0F1bZ_9@Ly帪!sx~v)WL+[:Dl.ĕ$|'Qm,;i 2ܟ\͡偡(nG`Wd^ε 5sqSS:mG}dkWkD9q]]'zݝҌ_ xt:W(gj0j`! ݜ*4cz<H}oE}<"d6naV0v=r|4 x?=&1d  럥Pysmh~ЇhÖӗ?#Irh{˵c -mY,>g1nr%bo <|EzgHu4Ц%O%$k1*Tb&oc'{G_K Ύ7L&q^߭#/\dɃ;k{A4#{ ^{9Od 1C6p5~/: `J\v>/Pރ6I;dQsokxZ|1)߾~*cw>稌>C #u_ YWҙOo|1d! y8]]ч%nO7\V~NF0zm9BX&|=E7@9|@%6갉}rvϊ |n݄5'7KeT@Gȫ6Jg믁ȸ=9U2$5okX_zkI? ,ɼi{Er9눳ޗrw.{`jN&S ;3ޫdĥOANX~QVd_ 1㤢3stkK^g{:;С_Dg? 9La)`#/>|\l>LI?c1k@l !O8;S6P,. XQfqMlbvv!"e.y!I|<`xR0zk+[ܭ_7lQndwڧ\i]ʼ`n<G_f79&MWu{3Mg(oS9s0{^5&\f`r ?X f>bä&ρm';čc(bv}]9 ~cg~,!v&ɍ,裺o:Dk3 1_G"`) 3tx׬kPzZ'3_-X3< 8:f=E2~ s=nj>~י~αCa߀x~6/,y Hֺ.ڈ> 's7b1OG#|\=* dy?ts/8 a'q `<g{&5$[ah}Ė1tx@wV3rm HqrJmنR ]Y,!M'Z'n};rsM%sh5 m-@ ޗEciJyMIDAT!>xܚe~'#}U8 8@zƨ)<LJH*C] M۟ANk;K 2uZzƠ`xlЮG>z~D!$3gx̖3S;AK[8WU9 SGo ݓ߃avgէdlg^Q&5WԈ%uS}zq1 63{y3%tDLr v~'Ϫ;l l\8 6vG. ,*.n/ 'Mx-'9?LJ>)=®Ulڍu'esgEϣx|BdǖT 꺂T>;Ju})`; ivﴵJY2Bv9ӜcotXҋ}l׳xM)] c@#.C% ʮStouk7 ^}c!oWy n~xl 9<хQ7# _ 'z9&gk#=$-mH[>ǎn7vGdZ]Q@Kqd7Q"<5ZGʠ(a: ]dlsBφU *Y//Pn7n9xWZKIU'D.BmXe.m/kO~6~3 NJTfwk1wVxg]a ̴ϑֺalqٝt.t:>f09?/v'B $52'Ʃi[ꍨn~H&Ƙx&T-1Ld\MfRw^=2 ϋ ؋68׬s:vx1֧V R0lv],_r=̆Wsd0&yVUHc|s  hcr0 Y;kwwn&'+CC~_OQ6`[.YeAM[O%0wW3^tM)d8 Y+p-٫&WGEQ\SPAǓl1ecl 0Iы!OKK$E{6f~l6uyõ'k&fyiM0ӯGezLw2U pCGN\g~Ue>Q9tka{AdFؓIxbu^V򭹎S\\q;6:,_f>u/Bɦ$Otq}h8T뱮É]xz],~`W=hO4dUO~8q2T|mv-7/YPv r!ճ1|m-vV !a p~ G, `Dw61`~}jn3@DZDΆ M'xy؏ٜH~>Rz'!'[F{2Hy<ǮxUzbw7Cbq9l+kُWbGȏ~ZcJ<H4#_\/)qsN'ݿky@1AD*4hrkvޕuϥrA#ꗘ$s]JʸRa] !?̝4|^0e8VHKl.ϰlػqY"{M|6>ק|bkLudNdG;98^ZL~ۉ~y)+~z7,0ͮ3z$7A+z~b,WDAKDj N} Yk+{3?3dz_=G1W.GGP8뻒MP$~Ş;2|]>tcK4{`\8&_G ܹDx1ÝA =Y0xBZgLdm#&GA65LN@lx5ڵ_c~8߻>aTIcz`'Ih)ƞŻʁ6ejwrs>mWtWٯEyڇޭu<^eT#0!E.XD{-BCC_ao|y? #B+hD%!/mtca_;-x F?Z)ux[o?JtNHl*g|q :veay u1ؾ}Oi } ʶS^?_]>`بXNm=,fڪ/D1D=Z*.~zo| xMB"VigK_<<#NSJjJF7<$9?@OF<."Ü>k;ԩ=o(O nb~Q6蓼1TO9Oـq=ul]h)IJZAdTG6pl 􄌋,{,ϫ>! IU9;.1!Ƅ\<}Pg1GbxvDÀ OpLkmSNj=uxl~0/W@*F 3WWob|_ѯ_˱ u~{cU&jk%~(y:iDSI-z `O D_)^k*oߌmߐd:'W<$~@7*w/mq, r4l/OIqHά@yLƧΔ: D^F /WHmX{tE0Z73ϽMO6^ (g|OV"Edq_h5x\Pb#Y^ᣋ_q$W~w05f?nWtK{x4us3U{hԾvb~<\lZ׵V6=֢"WtT:%(1u2y-FPN;|YXh6tŔ- \ -2(VNh0:y\l 8^{f}۩\ϑr%x)v[e;kd1(BP#zkjC>/ sQj!{.aLy/qmީLk} qNf3uDމ lW) Vt> mm W. {0Qb+c92UU1a<AxK7搿Dη1nϋTC9|S 4}3Žʙm~ՔN5߿ G?ի#=ˀߪkΜYP̕A?`.R6DUsh / q]#2e0, %87+[x,cJ?_&> bwU9'9ٓQU8M`궣4} "nx0u]>iFǜZ{L?1qX6/8p^ ztMSdx'8ٔ1Xg}1 BUS ݯt4G#7{{ cgP ǣ0:?O=}N"# ^`r-kߍt-c} C?glǀPI!|vgn rt<r t4 qi}Ŏ>s"_Ba `߮{ Zhxpz}X0A:d[8'eE6SgOћ~wqB0v["3ɀqc!V9 g%^7A 4o- |GOP rdѡ!vw'e7KgbU@ ~Mm6umԌ:'k<Ͼ^}K͵1eh$"_{hjhFG[# 9?~Zu9ܫ,b;x7q"tOBd^r\Z~ 7;:W1ČoWu#ꭠ_8]0<︅E>'@\NVMy#i̡}f EhbGgckqW͢)줖# ʟa)n׬ϳus$"(kUr`絶87-U1ǐ#=BaYs5Qn3i1AQe5@ :[|T>up@pe] _`A;f??wxq(y1Fbm+< no$W8c~Uq= zkn^dTv4 oTݰor6{vm?c}kUrrG^xo2Cg1|2I--vqGw ҚosҎ cbA|ڟ XWuH\׏kb+`5k<<j)KWR/iYeyӱ:+7#MǾ=|e)9C[p`xچ<9B8 ڵAӗFkwSIZZ?Z6ecvi.6auka?^ ıxB 5O2'<ηqd؛l8逓wu8?p "x9~=ld0 zMrz;m*p"Ͻhmc~,tc\4I30ŮH@Ĺ|U% XP\ = q|Fۯq6x}DkqS /?XgW*XǬV>N"NO7pD^9, ^Q̏oOz.߉qQr*:mxM"9D嘮aC;W6 N=:#sFxlMo~H}?Sn5ѣOWynsy8P~Wg=en{ֽ W7p5W+m67# ztX B9lzD|ObP,dŎU+5mgytJzV;4_7nik}~t2 2^m\[l~QIty,ԟJ<9xL{vش1|rS#ZUa|ON%D+31 ν.|}XEWd8<:cdۏk 7ilroSys^xT V5Y;ԃɈ{*p kJ݅F_y)(kPAA.M -j(*̮ݠ)9=Xm#ڱsYB>xOcpN-%~`F= ̬F\A8axWh#ex8pסt R)}*`"٣ !@\1s'湶s6UfčX+-ƻ:7b9<^e:S^thBģ3M| s[e~v}Zx$4xMqǽ7`+yF]9,Ό.Zq xcݮ\jmkIe\4s#! e6L@V_KXe |J:PրʎȥwvAiQOv744gŔ"~?ÜnSa[nkn'Ɉ]G}? c_ًjudnUn [5d3?s^;2gG~Eb^6b;_m`;Q ^ DPAM6<{%)q/`Nbkr:8tk]bj7|Eky #QGmAO`O*mbgA!Uuk7۵8Z|N#2!"wp_H[Ui]'S[4LvK)v`]'|>[9sY-kXH֟҃(skzZ*!KM|\"eeXzWʣi\e{x䥹_EPOQ<,*vw}:M5%? ~ 9q x|g 2#:aC@vk6F-|'#)焎itiRY>A@'5t2태¦}~Z+ݛڳ QVGtZ$\ [m 8Ov4.gc=@I<A7˟↌?W&Dut.1Xʏ 8VF zK_s3$Wl 1^ic !l^|>?7"m+'򱹠Gw<iRG2kVD,ۓXx&qeU,f.J?/x|#+#s)?2;#֞s2l{1/z.jǿL6~l 4ӠIɻgk9~oLcWk_Ÿ+^fL__h{7^}vٵóby?km;/RfJNcU+Ŋ+<{cjkhQmx?7l"[5 .]W;^xn<}GuGĴ>oyn.ye5|s^w![m]u珈^kqyzSs̾5]@'1H|.uP![ou(LyhB)zOԢ%OO7Dg`=Vu#ꭠ`+i=pϥ+k?Dj%Մ끜X]Q~`}ggio@$xX6zxВ#E{3-sRZ [ /rJm}^]yoOzInӎ!#b!ׯ{V^ysB(bwq!k>f|h8ّ 8Zk{Yɏ|bGYWGC¼S^EWtuMNkhvi/un1Vi 6נn .ly6>( }`ɜmAfW}Ĺse:ma7ȏqZ<~]_}89 ^}̞fo(|”ȭa]b?92ւcjc 1M]Be |"l=0z`tUxNǏ2jʃI >Cg E;v#0/Oy+bOҷȟۨ;ck砯1 9 _Q? gL^5'i'zu9(ٸkEl-ć[|C> rU)C ek7pϿ}'T2XaaD1tZ?bݍgp{ѷ?N"`jevB0NٮE]l/}ѶQ4;ovpI5xglޭlcސǤv^ُ>>wgփcsy% \[{N/ubVleBu>؅w%>^Ֆ|+c~6[t>=r~hWM8v#{+ݪQ}[ &[+k"Ӌ|%\;?8 ڱGƀWXŰ?@-/n\KS؍{ps|/al 7rO6 Dh}eі# H {١(WŶ/` uf1&ΈЇ<ΎѸ e5;>!*$‚1\fpJ8^o=qb<YUxs|'6ɐ9H 1\ c?fzU m;Du2jе듡)P'S ㏪(e0vn/ZgbC?4w5ҶnIOy/c:mXSwAT;0P\b{]ճqg;a4pC,Lj6:~8!`G(MxIsJ^UX-o/e\{]vҰ.\fL ^AC;QZKawg>K +ȎQցsǸLf"tYG];ɑ6Plcֆfkp^HD= '}[m g _ׄks%6r<_A;;;i?x>wjf_ENv,nz;k*G7[xp 9{pĉw7l{{8t|f=Ss ƘY}4jg=˻NebR[_Ӭ I%XCoux{fsolɤ=^'3?h+&jZ\!NX|q,]U2Y\൧CٍPW7?!jU&=akbF l7~ 6\5)|whuUB ʛL^ (}8;ޖ11>ew7=IƀȧO|K}<.^[c|#8`>y+VkL7/g'{ kYtP&b~ܥR;wkMZ:dXnO[;W D/1 _޾w|9Py˹թ֯k20GtKlG~<#:q ?0*]h~kKg̩cVH?& x˛Oێv\1_1yO59G-zʏ[@}<ؙ?ZcZvzҶ8Y_"AEZHv>z'[vu xo:kRjG;8=aӺ|Py궪c:>]v|~߁ _@2jPG~bYe&z.h67 W$sLJ/;RT[}]X+S-g(O6VF}K%zБtqPg#DvVUvGvg'm Xx.{x2^诶;1o;Y9_=׷cnKo6lf_ym$R3h9ی(Zy2s+0sODMIk-T~xGRǰAUzݎnʗDA~v\r>)4qΙC`Gfvq\zt7 վy]8>S8OQۘDA#5p<29jh#aj{v=LgjS?J1]^.cJ RC__")P,w| sM;e`}\0}exعz⺭=f z|W{I{\q.c-+xlq3v K<1l1zy}e0 tR2Tqz~K^e7>@LJY|1X#oFDZvt`|і ~#w;lENgrU k*zό1aY)jmZKP\7Mksgjm>o?[nw]4v e29/p|9 s )ooJP0Ðի3*rnD^ XƸUqpퟁhkG(#Pt}M&>2Ęvx̫  מ3P`~_Ƈ/yGM3[\{ Q%vLPk: kaeg6NoVї@Y?C'D/'ΰI' ^gRG qPW^)).H7s͙ ;oOvp}ak=wDE29\K yvc};/<|\1`DPECs}_3aWcົᱝ81BŽs:Ε=ʵV|7x?r,a b-{NJV0 hW`,vX!1ޙjpa407w}w9SЂRT59tʷ)6T+9ɰZS=VI>i6ׯNv O^W?3;׿xO_kKQ62M^]6q'2*$'7CnFѲ৮'gS9_?B&¤W@Jex]x{+ ;rbχY|UW/0 '@]w8^#wӋKțν4V}t^6 2~v}_r; ,>Fp~Gje1l |(&x?o C )煸*Ɔu@S cjO^%NoP%&\ЯI21ܪbdIXƗ`2#7|cNk?S%#0<(S[_zd;MG\@/!m5uƤNѮd1|x8C p`0eh3 2C[hgTz7`Ͼ R~s@ ~xi%ۿw ̕HTf~BCEIW| = bk>SAI;e\$x+ia̛2 o=0y},Ѱ_cgp@l~oo [~Fp"c YsO;O+ O7xOaP n;VuB![/bKYaU3D%Nwl g'Y[GOG=}6!W.aFUgww)S p>-PU@gEcexf->c]%\"{y5x+=e}{tn3:15*#h62'pZOt^n٫l/MshRG kQ#29@iLGcǟ` j W$ q_NxaFe2,\zyX[ǧ;I`36E~)vkBp3櫵}g ʫtN8:p^WZfM!/; `HkC{Ku9t0v>?5s#8> >clҗ9XX{ՇMkadA^mh:6^"Kav:!ZIkDFnQT6<}O }a"Q>';#86nP a/(;: }ie@8mI3x 듄!$^ڂfycG4$#y8WBD -{if>,i-a`5¿GAHtL~ Ň'e:yI:u'>7K4ʛ矅g H9<@)$_E@?( 淀X֬+E$|)FFpoT q!" &oЃEWMBy{m'y`Fm5yօ"_I(f5 kC$%ܢܷ`D Y~*Joܮn&Ez sQn#rt w2=6by4[HZ"$WϏ:n Y?c~w@/s#P > /"౭~| qC\ߟ[XkK<1~6'{{t}<땨%ٞZ)[^U:11x1Ơ6H |?[r!Dn(zwjWm5ײ$՚ 7̾d~޻~x~\'6T~UIGh]lc2vjnPWx=f!݁}eB9[gY:Ps*A0}=KAE1<Ԅ=꙽Xܳz2- .b<;zL'{=/}PQ,ӋʇrzdjZSQՓ8l9ʺ Bo9m%dc>u eyӄ[4J\̝\j)]@2(8k:3t-m]tmqme.1)*к@X=wd5i8$=QG;I{1~]MhW!2]g,=bbo\1GiUva;24GQezxdV13 |X,h>UA,X !nfk}>Tǻ ] !5AƚJs_ȧk 3~0GP-]mu:$cSȹs!1 s ScOC|S 0%@hOu[OZx)k򀏯B<>'1 (vC\YWݠ7”qNm+8E=嵑c Ǘ9a^=*JO^jc||~eOAƟ&.|"wrg=d:oqa]X[&]eq ğxYah.b~G2n[r($#m5W^"^orntI+ ^6]U Q~f6$nf'> ͞qGQxeϴ [%a>u ' '7N8SG~xzgY"fcϡͰe?ދP2 q*<%m?\c|{c~ߣj,~M(z[ Șo&3-D_`b%iazٗW20snn(.C㕸m=QdE1u'ovvŘ;σ&>JUu7!yTYx#&`vٚe>*B^]$i$8PAGym=/zUѩD4pڶG+Ng8{G-Ѳ?9gi5ILq ".|`E7몉DR#N%{VC~TM>2YxD#3h]|!¾:p/+"m Vb&)ֽQI>݋Bq-0g}v:ͫ>B&"L *ߦd| vHD6xa슲@[<ȉ5U+ޡvuv)unn6gꉠ<`2wk=Sm=!?dHplR>фs/cݠj@k7#J(]!aH+s{' `ec+Džw boQ4_Xtq7ۛ Vgj#}F\9Yŕws('쒇\vrs9s|s =1Odf~f7Ben؟1:؍r-6a}_u6 ;{#0[z#xj gveMpi?UnH=Vy <_Ýc90Ȭ7M|kC`Wõʯ2 q?YaeoL6]FxW $ַ<4֊E}qk;E'%:*6ܞkDНH)d};tÚ]T7 =᏷9Y[4V{@20Ɗ/82<ݼvkg̖*HQdʟ2Q?+s)Vu>1&b8\n |z[ODa~p1 *k}CQs8 ʊ< S#+_r~nkt=:D9Μ~}DM^kFP!7q"(1&hמlO-В`/ Ġ'}?ށTu⼀sh.?#=/1  ǘ S`G&]=`v_(v޺W\`yjŹWAkGUo+Rx o1=p>J9#Zt?\r:ہO??7+?<"3=e )e~* _-Xm^ z_ۅ= 1wr>݄fuHS@xAv-Gʰ3re=RWRb@4 3XsGo8bib>b䐰_!_<;~Ulsw8c(wD7 ?M?kPof%=:1JXaNo-3q'AߑYO11Uz{EK] 1W!5݀+*r7c|71mº>)o?p@V*dFdz/` ~}=5#sXG|j1y]W#нҿDF^֗vweHm^%kh%o7|-'ugi"AM0 w| n;0σ0ǃ'=*v'"-j7`W/,+bS-SFFK$ >DeeQGdWॵ}gpdׁmF/[LHgAOOGH >V,/ 'AF 8 hps<})Ze54r7T/Hg!\~/ϓ<$ymA?>Pj ,&EN5P Ha"d"uXiM~_з}z#skFgbsJ_ 1rX/HrO N0JD>_CyF S1?_ i=Baf;i6;e!V,A&~'ǿiuU_ߌ.! vG?1"cWĺgjտԹi⨁bX?V&^a:MT͑v w}z>+dp^zمs}y ^n<mPiShv2(O@pL\3;6O<yІ;.#hld(O{-Sȓ©:!*/0c\ ofv}߶/4ڟW~m*T""a{4|E}[8xMrXſrM+;hgZ9i^orϐ3PO}Jo^1xw|7A&7O*~e_bῊȎiW/D↤Cl uVm+yDew׼+ TK#S>Y|wb_<5Vt;}X!sGƟb~ uOTцV~c|]3P>%|ʓv"ѭ^lm@D(|E[Owm:_e=ȯƛxu?OnapՆ]۞ sê p} />LyJ YLVYQ"_(,6L`k32=@x}jse X:CxC ~ʽiuL`~|̻׍s( x5XynXkUU0+N=5}f ,jX-=1VC Mt!5AѸ4R xg|;MGY VF~0'7ډ51:Nqs@%c<:k LqbXRϱte:_ FANAmEOHnfz_qbx!m Nj5LM4'OՆq_ُk&y utvVTϭϋd0X_Byu?: z' E}*2]Vϊ`yCt b:ťc㽨w0# 1]CVW͑Gە0F tA>0tSt>!ed߼U?ڜ{SY#UGo jɸҾ%/*םԦ5H]^,7Jd+4;?6$]9";''l^bk%$hsڕt6Po-3L_iN2Џ4 TCzLخ{5Kd)i#U: \@b.. |B39yiN;yz.*ssf\;įWV35{>#veVÇA{e/rD2Hrn"WrH]eQqO5A{Gf>B۸ {ma]|Vkϧ3h עWdpjA'Ezlg~D?F0YzI9>({F_rsqMKՙbϥJ䲧o z]ChAGW}4C ԍ>Wp^%8x.9cƣ~Fb Z (zH *lga&{ d3s?ZxzlEvxɈ`o$+Ǣ{<Ѐ@$_~$xQD/x2&zhq y ࿢OlQukuC>%WF#o|iG'FZacoU䏗CR̗I $rH0{'ם9G +b]L<FF-_iQN>}y09ڟx41G&T)'W#>qG~懄3(uhZr#e<,Oq]%]/V~jk}z?>w'pq2濱ۀ.q}}{rye=tw #3͇ky`֯\ߛV&^J c'ƣ|d^Id\:Gq#ēx֚< 0ÿ2ӫרQHo?e '/!+#EmdoAv|?Hty=8d= >>#i1ѧb8k>v۠M>&L=Obx8_Qb||-kh'#6 ٵܒB[M#.ceπｩP8q='kH=7^kk4yۋab.!Fspz [X7ȐAԿ}3SzM ˑIWe>>_z?xpEB8 SB2t)o\o${nW!'uZNmMfXglNJ{Gπ~vxxDk |~{E? 5 ? /ͺ*W@V\ %y` t =F<I/lO{+/3y?ۋ|y8("a༲? ~{z'p j;Cayb-H Avn C GTm@.}1 uD.^_!ۏtѦ=^_n/E5 ~HZ':<1ZkI,j:ˑ'6WC̯19;ϓ<tAWŢȣ5cQ$Cb:ű`Be`]3Eqz٬~NQiU<1IHcBJ0xIctMXkq{ ځF<8IROZ/'SԠ+ڽKWi^H}fS f~z 6l7tW$BGC\&qNC_֩mGV7Q6,cuf3-o^.Gùn:ol'؝ש6aٚ!ǭUq^9qD*1h%hid aO%y`.[Ρq,q8|Iߋu[hy茛O LCJҚ _4gȬ '5aD)' S x r>X y]N_Q:z d=7jr 1T.!V_YX"/DF&%c|7k1;͏]mo{TÊB'bRZaG,Nj~Mݶ1 I}zu6Y+umѱ³vb,կִkЦhw.^0eDx7׻:] d>ũ A&*ABd3h#xTn&ꖭ_[許T2ymÌ4m&zɹMo=c뤜pt.vPF#8+^e s }ic=cO , " 1.ivNR19?CC>3JȔAyJatJ ] y<'0KV}|q" d23qNNu{`K|fϵ3,spS.o?f:@r=ZDvX:OBΎBNKuRq0 t5޵N!12˯ 3*=j{60( N6EG炏MNz;8౓̛;)>ABvrMBn%]7pn΃q]3@BGnQoZ~X'͍qxu4ɛ:,:uq0M_ScBs#6/řg ޽'o> ЭBT נK謆(Y 4~!z͂3곁BI_Q}= ^DCQaדt5[):y yG fk|qm㮭7? |ʗJCd&xCS GgozK?lj&=gsנA)Vf< ٵC$ϲPBZ!ԈR ǝa<`v):^ LsW1Yh/[Txv9 Es}܈#x*ߺĹ6Hl ?$Z_@ Sd}G )Z1o= [MBqľ38>q]3@BGn+65ܮu&ʽVaКPQk bs/xWl\lIb̹+@cU/呏CU"s*ozkn1^|\\f=8Vv17#:wtǝ<|rDn:Z~ZD<`۳Pddy)įc~fCZO8[@2 |^N+ ٚ}kvD91Y3O22N}sc*jG$JPG@iiAם׽҄ki'7^8'zRDž;AcVmeRY~!XP%ت#G}n.^kMxqm ؜˧ `zxbR^yv\wGCU!V@ݪoZA;^Vx:x@z^fs;Ӝ8VԊ}P$$3I'O_> | pu; ;Hk}hwө{~ֿ[SR @ƻ`WmsKi+>g`\<=p;zmqO ǻs~ĻYf9Z2ٙ nG>\MƿqLgGoL\g-YȐQ;;6f0ܘLE>F{6`q[;CT\固 ̫5wh ] c3p3 [i0qCR]V} TIlyCduCDtW>ܟʱ)vbuW6ת|RvtTdZut}̽^D[qBwqa67Ǹ֭lǛ2h3?;<u7oF;ȫ`3y3U2ΎvWr2@E[Hj>'d<,N=q=s~ur.Ӎr%&S Bp\\ٜ"RvAϸvztfE&͉,ײ.Jͩo4~GΉM?} 0aqkI|y6"֓*'/ktmg6,9Smb.# G"/q *>U][LmwG\T6'>8h;Q1 wKc 0?'[ 2,W|_!tzDja{ ndxA?cz :,ϵ_88e8M3GS/e>W0D}sb:>)~kX1[g?ALƣk׏q__c8O0_sp U۸#׸'fu}uHgo<-H=rz2f&3Vʚ\i>7_xh]<2Wt'τ׻B(b& | 3ּ,/ zh `NTgYž/Lfjݝx{N^m.jQQ {9)Á<[y$OBt Efi5Ek=,bQ5>1s OzNW1鲭|޸ӀF?7}>Z%T07;MnK1dssb:Ty6 ^ d\H0[g?ALƣkOSǼ][g,f5xB$jJ=#9^p^mdHo&:ς׻+KLcDU%"UYBe|טNOϋe[[ؘƴ>-:ny-kFQuun7o~8)#= >VB.?,l HPW-w۶uݖW6>f>glqU~sc /938]3޴gYxue)Rl^[c{"f2i<й'| @jX4='Sŏɋ՞A?v~'ؘ, <sj257>c6=&d6691fn&A=uX3;z8s֫z~]T(^xG9Ȩ[;f]fi1~Axd4 gk1c68^J}to={{s=XU ό:◐łO B_DY@Xd7cX2wm E:'cx,7+3s '^Oz;2ֹ;SbVaKcN=tũ>3헶NIyߑw/`Ni~IUb5oqO|@iN&suμ36'ݭ(k3P#2ޮK'Y$]T"{cn\86cj#m8} P[x7vO1<c> .=iC7jY-@jc Xe"($<'tֽ}+=m2G~Egve~ _8ϱAM1wM$>p~Os*QӐf_V1N>Nma.'5~;C39G02"=扈j~BAȇp!s- 9S73e,[vsLNlrU[>RY 2^+R\#;3T1:=Z#/+}UdnKxcʩ@lsS)b*ϊalMο Íڞ6yŷb]^8ݻv9_P_7#o-1]|ѭp:ũOq8*Y8[12W<>z,iXtwn]Vef}4o ہ"4+d*{> (>.O<80Y:jAY|#'{4FSͦ>sOQ*Vz-rAzdW~ce+'b<1;ڮ%ۣbF52 {DmvƁ6zO1b>%5)kc&|cih5%CDU]E.yl6u <#Gmڟ0PLÖhrrnԻ?kYogc3˭(tcdN 8 Oh(`N170? _eM0"z`s4gf~2L}2p9ٸ=r_IJ}sg@e.b2e&,ZllFݮOs%Ю9$em8iGiGECiMeخsſڋq`u*8Зb-'pZ<5]>u dDcnk;|ŧ]A3;C2sG;:XXO/Z@eTz mag|YlyFN(khs ^>xWn@<ٽk3vѷ[-,N/u9lW>f6y&&wE]MN&̶bl9$'r`ౖY~Ky[p O4+@Mx5ˍ<7\}Mlox?WyZΓ̧s6@o^ #|S6r.N&gU;|W)Wv^V/~l}_>x5{eN {{r<`H?EEA7ݳ&v`Ws3q=ǹۺDby{hSL}Tbk-\]zݛ: ^\i"F* 78c ?|H ލ7pe<~yVl+c: ,VAjel $-p!of.qBsr~ oglB-C¿gDxUl*ʹf|l{ ϳ,4*6o;$zcL9G]&1q7lӀ68Vv\l.o1GW >O;|K`~_^P 䲭'}:_sφw8*z^yuY_"/OOwJ\=)cՙ~6/#-xC=iDZYxdFC{2QK_t %؇2>}1"NɈ`ڇ#9WkɵO)Vd1䑍S{ پ?޼ıv5>ڊts~GaaݸokJoh#}@fBWaq0_p0~VƓ3͑O17]XwՌk6è|nث\<_}/Ǹc9=kTysy>7םC p_ _9>"Ggkm qx"EdW*G:d$M%$Ah]5 1ޤcyf_?ֿ}2wAf HVA[4b?LH[Z fD D!46BE :@(8X;yk묵s^9gky5bp/ |yJDSږ/Epj-_gE8f,سǩ9_'N]?Ȓ<ρu; ?)3ܮWEc֞/Gfuncם cjOSmҵUjEGj;ܖʶ'>"IeZX4}eHWn{ҒtێV!g8`5gjcHփ}6zO}La١#jݸ,ơǤs>d ϚMjD:BEkP  2/ v!#|ʁtf~m2"v~WEOm=~wo\޼4bqiHFZ[ ڡM8Гv@F1߳): :ayTNjjm뭝Yviя7#JC:3~Ƴ]?l]A9*ȸGг^8ocvyy||еbBG΄l#rgF7ɤwδ9Zxk<7^N"wwz#=.N[KgkIiP_#9ш_~6= Ǭug[Lҧf\ܖe;`;ZvsA?A9 йIgDei[Q{57I1_rsC١9m}޸Ny4гS[~=ŠkhkLh|I}×7!zvV Z:|yBͩ/0_|~󇭍~rxbmC6΋-U{.k3@.;:egKo@(6u-wϳB>+sȯuu쿭/]1ʹKulvlM{49<_*^r~s56ǏϼF_Ev>ޑWqk:&wR_|e>V]4]^>oڽvպ$GU I}k}Cst6vM}1s蒱i h _S01af:r;>0OTf|3!`*| ʸ<h e|AKX]9s;`d" /s9j%"glچ+u{{݌Tx?%">nml!Ԁ&=@+.xU[!({j=cG紊g_Y 9{U:;Kn;ɵ5(O[C1yCm{I|$$#ґl17{}C/UIv^2k7lñmwy&HSt]Aa@#o5ҩ}gtNQ=a}Ƙ?M7-Eb~.mudڎ=4:x>2tiZXC"SVl,v!Ǫ@6GyT.irzU;e߆zNv:ܨ˛LғlNʓެġԺFvqK }P*!:\ce 8TW4X>EYVvKڦuG%(nӤZFr/uFb yGZ*L>Ta9dQYoU'JΔ)w {΢[03GUe;(ԑ5fm"̮3L̓ jS#{T$4LkL؊YQ7 NbrfZmW9ƽ!VPM?5h tr_cck~_vG}9F,e춱`x9 S5c k`^`Vln lO(y3QG5k-mM|'{.~nC|[W KɉoIj:|iRO'{cB>|_3/'94Y<|jVjFjBWL^4V/i[NcqWt{kAxیO=aӡ'R7 c[:H}6g@eo3{?[aK'U",c7n#W+.~fu ö:<K㌑Σ[m`fy xy3|P-k9Q!ϮmT_v2}~|DWTnynY]6d)r<?W_ֵ@#R7ȵZ8iq#-RGj?˯e;*KʇR=mOzZXh'+VsǖCR}Wedi*H=O:Ǥ_dh'/l#Y|6ߦ!š>/.K4jOAa$Z6<w(nR_:68um~$\!',!V9mCS~"X7sDD_K:z ೴|ȱ!́+r$Y?ڏqgIIv֩#>ypLsCmnTCsPO&^?8B7) җWwYJmY43AۇxA|曩,%xt5ö!z~#cXwg0 Ǒ#FǾZ#>|5 o 5qӉtH*~[tqܭm֑Q|@36ٱr{d,sO<ѳ5hֵh>vŶ~Xmg u[l9eQkN?NH3IM8įam[:cOێs^,g;ηƐU0]z )mgZƏGmtyHv:˾еuom` ?V% ;]19f>ulAf۷rv+x5hL1m6RXlw 6T]v S6+o^E$.v) =(8Ҟ>^>vGc#&V\qا9`R'm"Rڲt>mFv6NF˶⇰s}.~isH }MR>n}/Y9y~*f}tyZ<e6awN>GMqR]ϋ=O#o `dQn r A/P c}],@߂[;tXtٝQv Azj'`mM0;?hrGX43A'^P$ÒSdˌ|xjmC*[b!w.]_?~،@l{9bk>W}EC^vٚOm}vE՘CT]]`߰alڦځ}zyYc?[8nf /%NMk&n\vhʏ>}~KfM^MkV Y܍ ܄>n7Mf|FM=)-77Rvf |n+t{R[%٠ հ%Ll//mٜq]QN`斎[iTꉘ/m3![} ;rkIm$Vsi'Sσy]\W}ҟ?;N/&Z/q;_w5R'M{#1JH^P{{?@U o.ʖ@~D aV +4(=~.Q}z94kmImUhpmKX&Bv|̃łI אiI!>gi"|X'==xF=|RWi|7p'涧3Cǹ1ȱ'k$G)Y"voN)5O#DO}'^^\ rW揟WnKk<2g)!\<+罱k\ ad85 zʥX _!ՃRIR?񤌫6#؈5ҭm>|vܓ t?Gs/!`GK k.o$o4D0MW)%Xi?^m,VI[oŌn ͫ Hi"6tSq`~d^H}U6I[dc"Fz(Հec]9j4VRxtOʫ[] +tnsAϑco'...߈4OpjnN1Bn5ޛZ犯WqK;d|}\.s}&A\FBɩk<+罱k>8wo #űgse's-zqs},AKF C/6@ raо:ZD?8r؍{"uf62´eRqI殅km,"|Wezq~НӬsP8Vm,=,=:AȜIq\v8!tkXjO8Q ɶ}޼QNCAڟl zXҐV$wHs6[^/^1oq5b{/AzrLyMcMҍ ;#دc,pCQ]O!FrLs/v̿Ff},n[@eFWJ?uqƣ7#זvX3|<2cl8{cǒT9hzf|15]œIk?[Tؾ732Ieo3G:鯀8cI;]?ؽq~Ƌ S?D\C18׬JC?X#Xk4F]v\{ӧ@#ϼ\]brƚIAn [ZvV,w7c ׸>-ٻ$9-|O'b(e $Շ|IəI,OυW\%ɏqt~]NqZ˟j#M:e=箏tO[)&f24 _<|/4A?Vգq;zmܜj̵hf~ ߉M%`'up̱3MtL+3^6rl:G1> ۑNڧ/)a6*R* XY8גKȼ-Gn;8&>@[}f1~/j_x)tZD~>KFȵm~˵8gG:J[Scn9vrL.I:f̀<ϱnN8pǺm,kҒ72GQJW4PWTGU8Wȃ;eGe"gcH]gTyq,_$pP>HÞhKB_~'8ȝAH*[{>&A7'_^dMzW.V}ѶzE~oʡTt:Z?KnXG@ZHc[%ٍbH68e49M ,}vOhҵᵏ"m=?Q'e/(ϓhyD S)|\)_~~&ӓ3K0!d'}8u[ŘA{WNgURNV]lHxIWtDN..^k-;k|Gn"`ç5/N}™7*־~L҇i7Y&f /֜#vY@Ʈ9޿t#cաWNBw\S[K>WT[|ģ{Wq~ʘVyw͜zY.n Ƕbh+@[ O'pD$a\]sͮ΋.luN?a1@e' ȣy!;aٍ9kw4Gim;Y vLjqCp)x_z4_/zN`+Rk8ضm"==X_/꘰qSYe>]R,V{xCcEO`djھx ]+e.\Cq͗~|Wus#ׄkv8 Z#1:Aբgık1֭^m#]{cqxy:\M<#&TzFc!ԏ}HdyP7&o#m~G A u+IJ[?7ȼj0YzA8'>aw"NrTt=@|e&D'mE*= |FרJƵ9K[}9J{uc N/dמaҶc_gg&fqKNZJ{ o0ClOZ@s}$vu?:oYcԖ5^C\?C"tym/>A/=[3OOw5Ͼr?{;i0+`6kh;f QHNAR}hwHbKT\$;m* ,;R-8^Wk`+ Wwk-+s`=>ִy_]{>9]lq5!N\|똰j@v[TFjyȷe[r?zo8i51RKg;Gw6f_mWw(ؾ|ړ\U?8EIDxcI 3j/9_lBqҳrKi主O>@bA[i!wtاL č 3Aڵʱyh=V. Yݷ!06or\T5^&śXu~''pq&oŮtȁI±oOu'pT= znvf.{35-~8ԯ_N-u!6ݫGӊ?:[bbLڧ7`6r$JJ&l݉DݘTۉz2Iv\O:@XJgӯYOJ7fZ<6 FǮ~\{2x僩 tfT%i:(ʁP"`~W3G #ŸOQ:@K9tosf$ҰVz.dkDIΟ  7u8G0?_.\3Y֓wU |ZjP0S:sF>:2+AWvz>tو׬Xce=56&ǼCs}k9X?6!51&9bSS~8R'+Vf=|V 9@ev߁4ߕrdErjW#cg]fx7ouwX/9n~,_fbo7+ P7Iw>7Xзr:Q˵0}\OpVx29mkB ۲RQՕm.tKj3/nX2.t>@?$X,'op}`/|u@wx3Z^+r^^X^ >{) {s^_۔c^ 9ΩGڢ #V\cֺs`<%GѲ5jǤ. ά@cqIKE}K^w"Ic<^,~یvN'|Ă}뤨:l/w9ػ"O|(b-C{ƛ1\_Kҏ,lE9RWt''s< ̞}\CK^N|s޹F_ȓEQū^Wly=ʱjڭ3,h ޖ0g}+TH~9%O3L/-xz@ wUy뜣>IWooҬ1V 4u>vY@Ʈ9&wzJn;C=V1/ٞmά؋sdL $Jтl5^B߫3SKۡ/ A^|@j-~xܖ>0M}DfVh-X| ǔ}2aƾs=s$^1m#,:Z>\GBȚy@[/fnܢϪ*A4ގmBreq*:~,V,g Xry}|3CwN:q0Y_H~ m0_4F?~5utI YK@37&܃cCsXk@ m~b՜ kGr|O6'<\v}\Rk@/hо{ڐ֪}i7l#>/y22&Λ#M~''g LYbtQ|= }醴ɇє7h44!<`n>zJKmu_CcC XgiGKeo}x~|9@NjCƻ':;#pVk 8絤ˈ]q kh}}HmSym X]G9Wb#ڰI:ضڔbWmAľkF79r"j߽B:˂}T86xN;Y9Ui ۓ5es@`d쌓|46G\'mh,ٓEG̨ }-ྞ_B2^oWRWosh2qZzlAUCm4p Nm?Lhqc_ m(G>etqmѮIXsVm |wNVn6U ͋3U;}xEIF1`EfYˏeyOqj"|ul<|ˍmjᡞey=يwd7G.{xye<&.صYrOScfr/<2^Yt0<:}hŬa'l9R.!hUL!NcFW9'/I/IvWUV)&qGщS ðIr6 j-v)T: Eu)S-fݪ+ʵu81W/? +VWNb+c֟[/zWqm@'hʁ׏Я-/rrCN2k'|RBpMWEvyԯL00/M}O ˨/̏֍r76l>w@_!+5p]jwĖqW>ǡk#ejN:ݘ1$j"luƯ浲_:(aojD]qwO^&JHe$t$?fnS;thܑ/c]L/<͗Pj}ǷGkO^cA* ]=mԑǼDūz50vi}֤.AhYOǖlta{᜹])&v ;/IO:6F: N>d 9}KUF.5GO3F:\&C>N@=)6t4"GͯP'\n8pJ{rG#m;vGǦ6 2~zBU*4dP7QSPT} Zs_I]X?# Ek8%9ţcA_Im~O8('ܬa{I\k֒^<8W7%李NiUBOnhx,G5uq}M8Հg7&$)l]q]q2'^Dohrށ,'0tkSCcbC?/E%N$ gƃ9-s2pii!So Qr$^RGE/ |QŔ9s ,mXYE,9D͝_+T>ב |×3}RG5ȺOqKǓ[yE~'o<$9c^cǾO%LM]vfrs/Ѿ鷬 K`.IҎ]8rS y%" DX ǁHŽ`w͵EwųGl~^^3h_zLcul/4 UȄ #@\Rd\!JxB~ i>?nIJ o ^kY}~hbid|~(q8ӎ-e?DTo4}Ǧ˯k嚤m8KBAM;goL S,I3^8\Ӿ-;0S/OpΓj<͘ 'J5O9Q$?7aK:i#n7ELc85#GM