Showing preview only (679K chars total). Download the full file or copy to clipboard to get everything.
Repository: Trinkle23897/Computational-Graphics-THU-2018
Branch: master
Commit: c37073376f30
Files: 32
Total size: 654.5 KB
Directory structure:
gitextract_kj7v1f36/
├── .gitignore
├── LICENSE
├── README.md
├── hw1/
│ ├── hw1.Rmd
│ ├── main.py
│ ├── requirements.txt
│ └── 计算机图形学_习题课1_本科生2018_500301909.pptx
├── hw2/
│ ├── pt/
│ │ ├── main.cpp
│ │ └── utils.hpp
│ ├── sppm/
│ │ ├── bezier.hpp
│ │ ├── bezier_test.py
│ │ ├── kdtree.hpp
│ │ ├── main.cpp
│ │ ├── obj.hpp
│ │ ├── ray.hpp
│ │ ├── render.hpp
│ │ ├── scene.hpp
│ │ ├── star.png.bak
│ │ ├── star.ppm
│ │ ├── stb_image.h
│ │ ├── texture.hpp
│ │ ├── utils.hpp
│ │ └── vec3.hpp
│ └── 计算机图形学基础-习题课2-2018_949307398.pptx
└── hw3/
├── MVC/
│ ├── CMakeLists.txt
│ ├── edge.py
│ ├── main.cpp
│ ├── report.bib
│ ├── report.tex
│ ├── stb_image.h
│ └── stb_image_write.h
└── 计算机图形学基础_习题课3_529603220.pptx
================================================
FILE CONTENTS
================================================
================================================
FILE: .gitignore
================================================
# Prerequisites
*.d
# Compiled Object files
*.slo
*.lo
*.o
*.obj
# Precompiled Headers
*.gch
*.pch
# Compiled Dynamic libraries
*.so
*.dylib
*.dll
# Fortran module files
*.mod
*.smod
# Compiled Static libraries
*.lai
*.la
*.a
*.lib
# Executables
*.exe
*.out
*.app
# Cmake files
CMakeCache.txt
CMakeFiles/
Makefile
cmake_install.cmake
main
# R files
.Rhistory
result
================================================
FILE: LICENSE
================================================
MIT License
Copyright (c) 2018 Trinkle
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.
================================================
FILE: README.md
================================================
# Computational Graphics - THU Spring 2018
## HW1(10')
实现一个感兴趣的光栅图形学算法
| 基本选题 | 加分项 |
| ------------- | ---------------------------------------------------------- |
| 画线(6') | SSAA(2'), Kernel(2'), 区域采样(2'), 相交线反走样的case(4') |
| 画弧(8') | 同上 |
| 区域填充(10') | 边界反走样(2') |
### Result
图太丑了而且这个作业也很trivial就不放图了
## HW2(60')
参数曲线/曲面的三维造形与渲染
- 利用参数曲线/曲面凹一个造型
- 渲染
- 基本：光线与参数曲线/曲面的求交
- 其他：光子映射，加速，纹理景深，体积光等等
### Scoring
```
占总评60分，按以下算法得出分值后，和全班一起归一化到70~100作为单项成绩。(负分倒扣, BUG倒扣)
基本功能完整性[-20, 0]: 光线跟踪基本结果，反射折射阴影
实现网格化求交: [-5]
实现参数曲面求交: [0, 10]: 解方程请写出求解过程，其他请写出迭代过程
算法选型[0, 40]: 需要实现对应效果才为有效
参考基准: PT: 15, DRT: 25, PM: 30, PPM: 30.
DRT请在报告中注明使用的函数
加速[0, 10]: 算法型加速为有效
OpenMP: 2, GPU: 5
景深/软阴影/锯齿/贴图等[0,5]
主观分[-10, 10]: 设计和构图
其他额外效果: 凹凸贴图、体积光等: [5, ?]
```
代码基于smallpt，添加了纹理映射、旋转Bezier求交、景深的效果，详情可查阅 [hw2/report.pdf](hw2/report.pdf)
### Compile & Run
```
cd sppm
g++ main.cpp -oa -O3 -fopenmp
```
由于sppm代码里面还有bug，就先没调用……实际上里面是pt的接口，当然可以直接把main函数的baseline改成sppm，不过相应的参数也要跟着改了。
```
./a 640 480 try.ppm 10
./a 3840 2160 test.ppm 100000
```
### Result
upd 191005: branch `balls` has another scenario. Here's the result: (others are `ball_*.png` in the `releases` page)
PS：别只抄我构图，这里有一堆：[https://graphics.cs.utah.edu/trc](https://graphics.cs.utah.edu/trc)
## HW3(30')
图像大作业
1. 基于优化的图像彩色化 Colorization Using Optimization, SIGGRAPH 2004.
2. 内容敏感的图像缩放 Seam Carving for Content-Aware Image Resizing, SIGGRAPH 2007.
3. 无缝图像拼接 Coordinates for Instant Image Cloning, SIGGRAPH 2009.
此处选了第三个选题，实现了MVC和Poisson Image Editing两种算法
### Result
[hw3/MVC/pic/2_6.png](hw3/MVC/pic/2_6.png)
## Other Result
### MashPlant
Please refer to [https://github.com/MashPlant/computational_graphics_2019](https://github.com/MashPlant/computational_graphics_2019) for more details.
## LICENSE
本项目基于Graphics A+ LICENSE，属于MIT LICENSE的一个延伸。
使用或者参考本仓库代码的时候，在遵循MIT LICENSE的同时，需要同时遵循以下两条规则：
1. 如果您有效果图，则**必须**将效果图的链接加入到这个README中，可以以PR或者ISSUE的方式让本仓库拥有者获悉；
2. 如果您在《计算机图形学基础》或者《高等计算机图形学》中拿到了A+的成绩，则**必须**请本仓库拥有者吃饭。
================================================
FILE: hw1/hw1.Rmd
================================================
---
title: "光栅图形学作业"
author: "翁家翌 2016011446"
date: "`r Sys.Date()`"
output:
pdf_document:
latex_engine: xelatex
number_sections: yes
toc: yes
word_document:
toc: yes
html_document:
toc: yes
header-includes: \usepackage{ctex}
---
\newpage
# 基本选题
基本选题为区域填充，顺便把画线给实现了。编程语言使用的是`python3`，使用的第三方库为`opencv`。使用如下命令安装依赖包：
```{r, eval=FALSE}
sudo pip3 install -r requirements.txt
```
所有代码位于`main.py`中，使用命令`python3 main.py`即可运行。
## 画线
实现画线的函数为`line(p1,p2)`和`drawline(a,p1,p2,col)`，作用如下：
- `line(p1,p2)`：输入两个点坐标，默认$|p_{1_x}-p_{2_x}|\ge|p_{1_y}-p_{2_y}|$，返回一个从$p_1$到$p_2$需要着色的点的list
- `drawline(a,p1,p2,col)`：输入图像矩阵a、线段起点终点和需要着色的颜色，在a中画出该线段
实现效果如图\ref{fig:1}所示。
\begin{figure}[htpb]
\centering
\includegraphics[width=0.5\linewidth]{pic/1.png}
\caption{一个五角星}
\label{fig:1}
\end{figure}
可以看到放大之后的毛刺效果，如图\ref{fig:z1}所示。
\begin{figure}[htpb]
\centering
\includegraphics[width=0.6\linewidth]{pic/z1.png}
\caption{放大之后的线段}
\label{fig:z1}
\end{figure}
## 区域填充
实现函数为`colorize(a,p,bg,fg)`，具体为在矩阵$a$中，以点$p$为起始点，填充颜色$fg$，默认去覆盖颜色$bg$。使用队列实现，效果如图\ref{fig:2}所示。
\begin{figure}[htpb]
\centering
\includegraphics[width=0.4\linewidth]{pic/2.png}
\caption{一个白白的五角星}
\label{fig:2}
\end{figure}
可以看到毛刺效果并没有消失，如图\ref{fig:z2}所示。
\begin{figure}[htpb]
\centering
\includegraphics[width=0.6\linewidth]{pic/z2.png}
\caption{放大之后的边缘}
\label{fig:z2}
\end{figure}
\newpage
# 加分项
此处实现了反走样功能
## 反走样
反走样使用卷积操作使图像平滑，其中卷积核为
$$
\mathfrak{F}=\frac{1}{16}\begin{bmatrix}1&2&1\\2&4&2\\1&2&1\end{bmatrix}
$$
我自己手写了一下卷积实现（代码中91-95行，已注释），经过测试，运行效率远不如opencv中的`filter2D`函数来得快。实现反走样之后的效果如图\ref{fig:3}所示。
\begin{figure}[htpb]
\centering
\includegraphics[width=0.5\linewidth]{pic/3.png}
\caption{一个没有毛刺的五角星}
\label{fig:3}
\end{figure}
可以看到边缘已经平滑，如图\ref{fig:z3}所示。
\begin{figure}[htpb]
\centering
\includegraphics[width=0.6\linewidth]{pic/z3.png}
\caption{放大之后的边缘}
\label{fig:z3}
\end{figure}
出于美观角度，最后在背景中又人为地加入了一些噪点，能够拥有更好的视觉效果。最终成品如图\ref{fig:4}所示。
\begin{figure}[htpb]
\centering
\includegraphics[width=1\linewidth]{pic/4.png}
\caption{一个有背景的五角星}
\label{fig:4}
\end{figure}
================================================
FILE: hw1/main.py
================================================
import cv2
import math
import queue
import random
import numpy as np
phi=2*math.sin(math.radians(18))
size,cx,cy=800,430,400
bg,fg=0,255
R=400
r=R/(phi+2)
def line(p1,p2):
# assume |x1-x2|>=|y1-y2|
x1,y1=p1
x2,y2=p2
k=1.*(y2-y1)/(x2-x1)
if x1>x2:
x1,y1=p2
x2,y2=p1
result=[]
while x1<=x2:
result.append((int(x1+0.5),int(y1+0.5)))
x1+=1
y1+=k
return result
def drawline(a,p1,p2,c):
x1,y1=p1
x2,y2=p2
if (x1-x2)**2<(y1-y2)**2:
res=line((y1,x1),(y2,x2))
for y,x in res:
a[x%a.shape[0],y%a.shape[1]]=c
else:
res=line(p1,p2)
for x,y in res:
a[x%a.shape[0],y%a.shape[1]]=c
def colorize(a,p,bg,fg):
q=queue.deque()
inq=np.zeros_like(a,dtype=np.uint8)
q.append(p)
inq[p]=1
while len(q)>0:
x,y=q.popleft()
if x>=0 and y>=0 and x<a.shape[0] and y<a.shape[1] and a[x,y]==bg:
a[x,y]=fg
if inq[x-1,y]==0:
q.append((x-1,y))
inq[x-1,y]=1
if inq[x+1,y]==0:
q.append((x+1,y))
inq[x+1,y]=1
if inq[x,y-1]==0:
q.append((x,y-1))
inq[x,y-1]=1
if inq[x,y+1]==0:
q.append((x,y+1))
inq[x,y+1]=1
inner=[]
outer=[]
for i in range(5):
x,y=math.cos(math.radians(i*72))*r,math.sin(math.radians(i*72))*r
inner.append((int(x+cx+0.5),int(y+cy+0.5)))
x,y=math.cos(math.radians(i*72+36))*R,math.sin(math.radians(i*72+36))*R
outer.append((int(x+cx+0.5),int(y+cy+0.5)))
inner.append(inner[0])
outer.append(outer[0])
a=np.ones((size,size))*bg
for i in range(5):
drawline(a,outer[i],inner[i+1],fg)
drawline(a,inner[i],outer[i],fg)
cv2.imwrite('1.png',a)
cv2.imwrite('z1.png',a[200:280,290:370])
print('1.png')
colorize(a,(cx,cy),bg,fg)
cv2.imwrite('2.png',a)
cv2.imwrite('z2.png',a[200:280,290:370])
print('2.png')
filter=np.array([
[1,2,1],
[2,4,2],
[1,2,1],
])/16.
b=cv2.filter2D(a,-1,filter)
# b=np.zeros_like(a)
# a=np.pad(a,((1,1),(1,1)),mode='constant')
# for i in range(b.shape[0]):
# for j in range(b.shape[1]):
# b[i,j]=np.sum(a[i:i+3,j:j+3]*filter)
cv2.imwrite('3.png',b)
cv2.imwrite('z3.png',b[200:280,290:370])
print('3.png')
x_=np.random.choice(b.shape[0],b.shape[0])
y_=np.random.choice(b.shape[0],b.shape[0])
for i in range(x_.shape[0]):
b[x_[i],y_[i]]=fg
cv2.imwrite('4.png',b)
print('4.png')
================================================
FILE: hw1/requirements.txt
================================================
opencv-python
numpy
================================================
FILE: hw2/pt/main.cpp
================================================
#include "utils.hpp"
#define eps 1e-6
#define mcol 255
struct Ray{
P3 o, d;
Ray(P3 o_, P3 d_): o(o_), d(d_) {}
};
enum Refl_t { DIFF, SPEC, REFR };
struct Sphere{
ld rad, ns;
P3 o, e, c;
Refl_t refl;
Sphere(ld rad_, P3 o_, P3 e_, P3 c_, Refl_t refl_, ld ns_=1.5):
rad(rad_), ns(ns_), o(o_), e(e_), c(c_), refl(refl_) {}
ld intersect(const Ray&r) const {
P3 ro = o-r.o;
ld b = r.d.dot(ro);
ld d = b*b-ro.dot(ro)+rad*rad;
if (d<0) return 0;
else d=sqrt(d);
return b-d>eps ? b-d : b+d>eps? b+d : 0;
}
};
Sphere scene[] = {//Scene: radius, position, emission, color, material
Sphere(1e5, P3( 1e5+1,40.8,81.6), P3(),P3(.1,.25,.25),DIFF),//Left
Sphere(1e5, P3(-1e5+99,40.8,81.6),P3(),P3(.25,.75,.25),DIFF),//Rght
Sphere(1e5, P3(50,40.8, 1e5), P3(),P3(.75,.75,.75),DIFF),//Back
Sphere(1e5, P3(50,40.8,-1e5+170), P3(),P3(.25,.25,.25),DIFF),//Frnt
Sphere(1e5, P3(50, 1e5, 81.6), P3(),P3(.75,.75,.75),DIFF),//Botm
Sphere(1e5, P3(50,-1e5+81.6,81.6),P3(),P3(.75,.75,.75),DIFF),//Top
Sphere(16.5,P3(27,16.5,47), P3(),P3(1,1,1)*.999, SPEC),//Mirr
Sphere(16.5,P3(73,16.5,78), P3(),P3(1,1,1)*.999, REFR),//Glas
Sphere(16.5,P3(20,60,100), P3(),P3(.75,.25,.25), DIFF),//Glas
Sphere(600, P3(50,681.6-.27,81.6),P3(12,12,12), P3(), DIFF) //Lite
};
int n=sizeof(scene)/sizeof(Sphere);
int output(ld x) {return int(.5+mcol*pow(x<0?0:x>1?1:x,1/2.2));}
bool intersect(const Ray&r, ld&t, int&id){
ld inf=t=1e30, tmp;
for (int i=0;i<n;++i)
if((tmp=scene[i].intersect(r))&&tmp<t)
id=i, t=tmp;
return t<inf;
}
P3 radiance(const Ray&r, int dep,unsigned short *X){
ld t;int id, into=0;
if(!intersect(r,t,id))return P3();
const Sphere&obj=scene[id];
P3 x=r.o+r.d*t,n=(x-obj.o).norm(),f=obj.c,nl=n.dot(r.d)<0?into=1,n:-n;
ld p=f.max();
if(++dep>5)
if(erand48(X)<p) f/=p;
else return obj.e;
if(obj.refl==DIFF){
ld r1=2*PI*erand48(X), r2=erand48(X), r2s=sqrt(r2);
P3 w=nl, u=((fabs(w.x)>.1?P3(0,1):P3(1))&w).norm(), v=w&u;
P3 d = (u*cos(r1)*r2s + v*sin(r1)*r2s + w*sqrt(1-r2)).norm();
return obj.e + f.mult(radiance(Ray(x,d),dep,X));
}
else{
Ray reflray = Ray(x,r.d.reflect(n));
if (obj.refl == SPEC){
return obj.e + f.mult(radiance(reflray,dep,X));
}
else{
P3 d = r.d.refract(n, into?1:obj.ns, into?obj.ns:1); //...
if (d.len2()<eps) // Total internal reflection
return obj.e + f.mult(radiance(reflray, dep,X));
ld a=obj.ns-1, b=obj.ns+1, R0=a*a/(b*b), c = 1-(into?-r.d.dot(nl):d.dot(n));
ld Re=R0+(1-R0)*c*c*c*c*c,Tr=1-Re,P=.25+.5*Re,RP=Re/P,TP=Tr/(1-P);
return obj.e + f.mult(dep>2 ? (erand48(X)<P ? // Russian roulette
radiance(reflray,dep,X)*RP:radiance(Ray(x,d),dep,X)*TP) :
radiance(reflray,dep,X)*Re+radiance(Ray(x,d),dep,X)*Tr);
}
}
}
int main(int argc, char*argv[])
{
int w=atoi(argv[1]), h=atoi(argv[2]), samp=atoi(argv[4])/4;
Ray cam(P3(70,32,280), P3(-0.15,0.05,-1).norm());
P3 cx=P3(w*.5/h), cy=(cx&cam.d).norm()*.5, r, *c=new P3[w*h];
#pragma omp parallel for schedule(dynamic, 1) private(r)
for(int y=0;y<h;++y){
fprintf(stderr,"\rUsing %d spp %5.2f%%",samp*4,100.*y/h);
for(int x=0;x<w;++x){
for(int sy=0;sy<2;++sy)
for(int sx=0;sx<2;++sx)
{
unsigned short X[3]={y+sx,y*x+sy,y*x*y+sx*sy};
r.x=r.y=r.z=0;
for(int s=0;s<samp;++s){
ld r1=2*erand48(X), dx=r1<1 ? sqrt(r1): 2-sqrt(2-r1);
ld r2=2*erand48(X), dy=r2<1 ? sqrt(r2): 2-sqrt(2-r2);
P3 d=cx*((sx+dx/2+x)/w-.5)+cy*((sy+dy/2+y)/h-.5)+cam.d;
r+=radiance(Ray(cam.o+d*120,d.norm()),0,X);
}
c[y*w+x]+=(r/samp).clip()/4;
}
}
}
FILE*f=fopen(argv[3],"w");
fprintf(f,"P6\n%d %d\n%d\n", w,h,mcol);
for(int y=h-1;y>=0;--y)
for(int x=w-1;x>=0;--x)
fprintf(f,"%c%c%c",output(c[y*w+x].x),output(c[y*w+x].y),output(c[y*w+x].z));
return!puts("");
}
================================================
FILE: hw2/pt/utils.hpp
================================================
#ifndef __UTILS_H__
#define __UTILS_H__
#include <bits/stdc++.h>
typedef double ld;
const ld PI = acos(-1);
const ld eps = 1e-6;
ld rand01() {return 1.*rand()/RAND_MAX;}
struct P3{
ld x, y, z;
P3(ld x_=0, ld y_=0, ld z_=0): x(x_), y(y_), z(z_) {}
P3 operator-() const {return P3(-x, -y, -z);}
P3 operator+(const P3&a) const {return P3(x+a.x, y+a.y, z+a.z);}
P3 operator-(const P3&a) const {return P3(x-a.x, y-a.y, z-a.z);}
P3 operator*(ld p) const {return P3(x*p, y*p, z*p);}
P3 operator/(ld p) const {return P3(x/p, y/p, z/p);}
bool operator==(const P3&a) const {return x==a.x && y==a.y && z==a.z;}
bool operator!=(const P3&a) const {return x!=a.x || y!=a.y || z!=a.z;}
P3&operator+=(const P3&a) {return *this = *this + a;}
P3&operator-=(const P3&a) {return *this = *this - a;}
P3&operator*=(ld p) {return *this = *this * p;}
P3&operator/=(ld p) {return *this = *this / p;}
ld operator|(const P3&a) const {return x*a.x + y*a.y + z*a.z;}
ld dot(const P3&a) const {return x*a.x + y*a.y + z*a.z;}
ld max() const {return x>y&&x>z?x:y>z?y:z;}
ld len() const {return sqrt(x*x + y*y + z*z);}
ld len2() const {return x*x + y*y + z*z;}
P3 mult(const P3&a) const {return P3(x*a.x, y*a.y, z*a.z);}
P3 operator&(const P3&a) const {return P3(y*a.z-z*a.y, z*a.x-x*a.z, x*a.y-y*a.x);}
P3 cross(const P3&a) const {return P3(y*a.z-z*a.y, z*a.x-x*a.z, x*a.y-y*a.x);}
P3 norm() const {return (*this)/len();}
P3 clip() const {return P3(x>1?1:x<0?0:x, y>1?1:y<0?0:y, z>1?1:z<0?0:z);}
P3 reflect(const P3&n) const {return (*this)-n*2.*n.dot(*this);}
P3 refract(const P3&n, ld ni, ld nr) const { // smallPT1.ppt Page#72
ld cosi = this->norm().dot(n);
ld nir = ni / nr;
ld cosr2 = 1. - nir*nir*(1-cosi*cosi);
if (cosr2 <= 0)
return P3();
ld cosr = sqrt(cosr2);
if (cosi > 0) // out
cosr = -cosr;
return ((*this)*nir - n*(nir*cosi+cosr)).norm();
}
void print() const {std::cout << x << " " << y << " " << z << std::endl;}
};
#endif // __UTILS_H__
================================================
FILE: hw2/sppm/bezier.hpp
================================================
#ifndef __BEZIER_H__
#define __BEZIER_H__
#include "utils.hpp"
#include "ray.hpp"
class BezierCurve2D
{// f(y)=x, y goes up?
public:
ld *dx, *dy, max, height, max2, r, num;
int n;
struct D{
ld t0, t1, width, y0, y1, width2;
}data[20];
// x(t) = \sum_{i=0}^n dx_i * t^i
// y(t) = \sum_{i=0}^n dy_i * t^i
BezierCurve2D(ld* px, ld* py, int n_, int num_, ld r_): num(num_), n(n_), r(r_) {
dx = new ld[n];
dy = new ld[n];
assert(std::abs(py[0]) <= 1e-6);
--n;
// preproces
for(int i = 0; i <= n; ++i)
{
dx[i] = px[0];
dy[i] = py[0];
for (int j = 0; j <= n - i; ++j)
{
px[j] = px[j + 1] - px[j];
py[j] = py[j + 1] - py[j];
}
}
ld n_down = 1, fac = 1, nxt = n;
for (int i = 0; i <= n; ++i, --nxt)
{
fac = fac * (i == 0 ? 1 : i);
dx[i] = dx[i] * n_down / fac;
dy[i] = dy[i] * n_down / fac;
n_down *= nxt;
}
max = 0;
ld interval = 1. / (num - 1), c = 0;
for (int cnt = 0; cnt <= num; c += interval, ++cnt)
{
data[cnt].width = 0;
data[cnt].t0 = std::max(0., c - r);
data[cnt].t1 = std::min(1., c + r);
data[cnt].y0 = getpos(data[cnt].t0).y;
data[cnt].y1 = getpos(data[cnt].t1).y;
for (ld t = data[cnt].t0; t <= data[cnt].t1; t += 0.00001)
{
P3 pos = getpos(t);
if (data[cnt].width < pos.x)
data[cnt].width = pos.x;
}
if (max < data[cnt].width)
max = data[cnt].width;
data[cnt].width += eps;
data[cnt].width2 = sqr(data[cnt].width);
}
max += eps;
max2 = max * max;
height = getpos(1).y;
}
P3 getpos(ld t)
{
ld ans_x = 0, ans_y = 0, t_pow = 1;
for (int i = 0; i <= n; ++i)
{
ans_x += dx[i] * t_pow;
ans_y += dy[i] * t_pow;
t_pow *= t;
}
return P3(ans_x, ans_y);
}
P3 getdir(ld t)
{
ld ans_x = 0, ans_y = 0, t_pow = 1;
for(int i = 1; i <= n; ++i)
{
ans_x += dx[i] * i * t_pow;
ans_y += dy[i] * i * t_pow;
t_pow *= t;
}
return P3(ans_x, ans_y);
}
P3 getdir2(ld t)
{
ld ans_x = 0, ans_y = 0, t_pow = 1;
for(int i = 2; i <= n; ++i)
{
ans_x += dx[i] * i * (i - 1) * t_pow;
ans_y += dy[i] * i * (i - 1) * t_pow;
t_pow *= t;
}
return P3(ans_x, ans_y);
}
};
#endif // __BEZIER_H__
================================================
FILE: hw2/sppm/bezier_test.py
================================================
import cv2
import numpy as np
control=np.array(
[[ 270., 0.],
[ 150., 100.],
[ 200., 200.],
[ 250., 400.],
[ 300., 500.],
[ 300., 600.],
[ 300., 700.],
[ 300., 800.],
[ 250., 800.]])
print(control)
fac=np.ones(30)
for i in range(1, len(fac)):
fac[i] = fac[i-1]*i
def bezier(t):
n=control.shape[0]-1
p=np.zeros(2)
for i in range(len(control)):
b=fac[n]/fac[i]/fac[n-i]*pow(t,i)*pow(1-t,n-i)
p+=b*control[i]
return p
def init(size):
return np.zeros((size,size))
img=init(900)
for i in range(control.shape[0]):
img[int(control[i,0]+.5),int(control[i,1]+.5)]=255
for t in np.arange(0,1,0.001):
p=bezier(t)
img[int(p[0]+.5),int(p[1]+.5)]=255
cv2.imwrite('try_%02d.png'%(control.shape[0]-1),img)
img = init(900)
for i in range(control.shape[0]):
img[int(control[i,0]+.5),int(control[i,1]+.5)]=255
def init_new(control):
n=control.shape[0]-1
delta=[control[0]]
while(control.shape[0]>1):
control_new = np.zeros((control.shape[0]-1,2))
for i in range(control_new.shape[0]):
control_new[i] = control[i+1]-control[i]
control = control_new
print(control[:,0])
print(control[:,1])
delta.append(control_new[0])
delta = np.array(delta)
ndown=1
nxt=n
for i in range(delta.shape[0]):
delta[i] = delta[i]/fac[i]*ndown
ndown*=nxt
nxt-=1
print(i,delta[i])
return delta
delta=init_new(control)
def bezier_new(t):
n=control.shape[0]-1
p=np.zeros(2)
for i in range(n+1):
p+=delta[i]*pow(t,i)
return p
a,b,c=0.8125, -625.0, 132500.0
def ray(x):
return (a*x*x+b*x+c)**.5
# return ((400+.5*(x-1000))**2+(400+1.5/2*(x-1000))**2)**.5
for t in np.arange(0,1,0.001):
p=bezier_new(t)
img[int(p[0]+.5),int(p[1]+.5)]=255
for x in np.arange(img.shape[0]):
img[int(ray(x)+.5),x]=127
cv2.imwrite('try_%02d_.png'%(control.shape[0]-1),img)
s0=''
s1=''
for i in range(delta.shape[0]):
if abs(delta[i,0])>1e-6:
if delta[i,0]<0:
s0=s0[:-1]
s0+='%.0f*x^%d+'%(delta[i,0],i)
if abs(delta[i,1])>1e-6:
if delta[i,1]<0:
s1=s1[:-1]
s1+='%.0f*x^%d+'%(delta[i,1],i)
print(s1[:-1])
print(s0[:-1])
print(a,-b/2/a,c-b*b/4/a)
img=init(1000)
for t in np.arange(0,1,0.001):
p=bezier_new(t)
y=a*(p[0]-b)**2+c-p[1]**2
img[int(t*500+.5),max(0,min(int(y*500+.5),999))]=255
cv2.imwrite('try_%02d__.png'%(control.shape[0]-1),img)
================================================
FILE: hw2/sppm/kdtree.hpp
================================================
#ifndef __KDTREE_H__
#define __KDTREE_H__
#include "obj.hpp"
#include "bezier.hpp"
struct SPPMnode {
P3 pos, col, dir;
int index;
ld prob, r;
SPPMnode() {index = -1; prob = 1;}
SPPMnode(P3 pos_, P3 col_, P3 dir_, ld r_ = 1, int index_ = -1, ld prob_ = 1):
pos(pos_), col(col_), dir(dir_), index(index_), prob(prob_), r(r_) {}
};
struct IMGbuf {
ld n; P3 f;
IMGbuf(): n(0), f(0,0,0) {}
IMGbuf(ld n_, P3 f_): n(n_), f(f_) {}
void add(P3 c, ld p = 1.) { n += p, f += c; }
P3 getcol() { return f / n; }
void reset() { n = 0; f.x = f.y = f.z = 0; }
IMGbuf operator+(const IMGbuf& a) const {return IMGbuf(n + a.n, f + a.f);}
IMGbuf operator*(ld p) const {return IMGbuf(n * p, f * p);}
IMGbuf operator/(ld p) const {return IMGbuf(n / p, f / p);}
IMGbuf& operator+=(const IMGbuf& a) {return *this = *this + a;}
P3 get() { return n < eps ? f : f / n; }
};
class KDTree
{
public:
static int D;
int n, root;
struct KDTreeNode {
SPPMnode sppm;
P3 m[2];
int s[2];
KDTreeNode(): sppm() {s[0] = s[1] = 0;}
bool operator<(const KDTreeNode&a) const {
if (D == 0)
return sppm.pos.x < a.sppm.pos.x;
else if (D == 1)
return sppm.pos.y < a.sppm.pos.y;
else
return sppm.pos.z < a.sppm.pos.z;
}
};
KDTreeNode* tree;
KDTree() { tree = NULL; }
~KDTree() { if (tree != NULL) delete[] tree; }
void mt(int f, int x) {
tree[f].m[0] = tree[f].m[0].min(tree[x].m[0]);
tree[f].m[1] = tree[f].m[1].max(tree[x].m[1]);
}
int bt(int l, int r, int d) {
D = d;
int o = l + r >> 1;
std::nth_element(tree + l, tree + o, tree + r + 1);
tree[o].m[0] = tree[o].sppm.pos - tree[o].sppm.r;
tree[o].m[1] = tree[o].sppm.pos + tree[o].sppm.r;
if (l < o) tree[o].s[0] = bt(l, o - 1, d == 2 ? 0 : d + 1), mt(o, tree[o].s[0]);
if (o < r) tree[o].s[1] = bt(o + 1, r, d == 2 ? 0 : d + 1), mt(o, tree[o].s[1]);
return o;
}
KDTree(std::vector<SPPMnode>& node) { // multi-thread forbid !!!
init(node);
}
void init(std::vector<SPPMnode>& node) { // multi-thread forbid !!!
n = node.size();
if (tree != NULL) delete[] tree;
tree = new KDTreeNode[n + 10];
for (int i = 0; i < n; ++i) {
tree[i + 1].sppm = node[i];
}
root = bt(1, n, 0);
}
ld getdis2(P3 pos, P3 m0, P3 m1) {
return (P3().max(pos - m1).max(m0 - pos)).len2();
}
void _query(const SPPMnode&node, IMGbuf* c, int o) {
if ((tree[o].sppm.pos - node.pos).len2() <= sqr(tree[o].sppm.r) && tree[o].sppm.dir.dot(node.dir) >= 0)
c[tree[o].sppm.index].add(node.col.mult(tree[o].sppm.col), node.prob);
ld d[2];
if (tree[o].s[0] > 0) d[0] = getdis2(node.pos, tree[tree[o].s[0]].m[0], tree[tree[o].s[0]].m[1]); else d[0] = INF;
if (tree[o].s[1] > 0) d[1] = getdis2(node.pos, tree[tree[o].s[1]].m[0], tree[tree[o].s[1]].m[1]); else d[1] = INF;
int tmp = d[0] >= d[1];
if (d[tmp] < eps) _query(node, c, tree[o].s[tmp]); tmp ^= 1;
if (d[tmp] < eps) _query(node, c, tree[o].s[tmp]);
}
void _modify(int o) {
tree[o].m[0] = tree[o].sppm.pos - tree[o].sppm.r;
tree[o].m[1] = tree[o].sppm.pos + tree[o].sppm.r;
if (tree[o].s[0] > 0) _modify(tree[o].s[0]), mt(o, tree[o].s[0]);
if (tree[o].s[1] > 0) _modify(tree[o].s[1]), mt(o, tree[o].s[1]);
}
void query(SPPMnode node, IMGbuf* c) {
_query(node, c, root);
}
void modify() {
_modify(root);
}
};
int KDTree::D = 0;
#endif // __KDTREE_H__
================================================
FILE: hw2/sppm/main.cpp
================================================
#include "render.hpp"
int baseline(int argc, char *argv[])
{
// Ray ray(P3(427,1000,447),P3(-1,-2,-1.5).norm());
// find_intersect_simple(ray);
int w = atoi(argv[1]), h = atoi(argv[2]), samp = atoi(argv[4]);
Ray cam(P3(150, 28, 260), P3(-0.45, 0.001, -1).norm());
P3 cx = P3(w * .33 / h), cy=(cx & P3(cam.d.x, 0, cam.d.z)).norm() * .33, r, *c = new P3[w * h];
cx *= 1.05;
ld aperture = .0;
#pragma omp parallel for schedule(dynamic, 1) private(r)
for (int y = 0; y < h; ++y) {
fprintf(stderr, "\r%5.2f%%", 100. * y / h);
for (int x = 0; x < w; ++x) {
for (int sy = 0; sy < 2; ++sy)
for (int sx = 0; sx < 2; ++sx)
{
unsigned short X[3] = {y + sx, y * x + sy, y * x * y + sx * sy + time(0)};
r.x = r.y = r.z = 0;
for (int s = 0; s < samp; ++s) {
ld r1 = 2 * erand48(X), dx = r1 < 1 ? sqrt(r1): 2-sqrt(2-r1);
ld r2 = 2 * erand48(X), dy = r2 < 1 ? sqrt(r2): 2-sqrt(2-r2);
P3 d = cx * ((sx + dx / 2 + x) / w - .5) + cy * ((sy + dy / 2 + y) / h - .5) + cam.d;
P3 pp = cam.o + d * 150, loc = cam.o + (P3(erand48(X) * 1.05, erand48(X)) - .5) * 2 * aperture;
r += basic_render(Ray(pp, (pp - loc).norm()), 0, X);
}
c[y * w + x] += (r / samp).clip()/4;
}
}
}
FILE* f = fopen(argv[3],"w");
fprintf(f, "P6\n%d %d\n%d\n", w, h, 255);
for (int y = h - 1; y >= 0; --y)
for (int x = w - 1; x >= 0; --x)
fprintf(f, "%c%c%c", gamma_trans(c[y*w+x].x), gamma_trans(c[y*w+x].y), gamma_trans(c[y*w+x].z));
fclose(f);
char sout[100];
sprintf(sout,"%s.txt",argv[3]);
FILE*fout = fopen(sout, "w");
for (int y = h - 1; y >= 0; --y)
for (int x = w - 1; x >= 0; --x)
fprintf(fout, "%.8lf %.8lf %.8lf\n", c[y*w+x].x, c[y*w+x].y, c[y*w+x].z);
return!puts("");
}
int sppm(int argc, char* argv[])
{
int w = atoi(argv[1]), h = atoi(argv[2]), iter = atoi(argv[4]);
ld rad = atof(argv[6]), alpha = atof(argv[7]), samp = atof(argv[5]) * w * h;
Ray cam(P3(150, 28, 260), P3(-0.45, 0.001, -1).norm());
int nth = omp_get_num_procs(); --scene_num;
P3 cx = P3(w * .33 / h), cy=(cx & P3(cam.d.x, 0, cam.d.z)).norm() * .33;
IMGbuf **c = new IMGbuf*[nth];
for (int i = 0; i < nth; ++i)
c[i] = new IMGbuf[h * w];
IMGbuf* final = new IMGbuf[h * w];
IMGbuf* now = new IMGbuf[h * w];
cx *= 1.05;
ld aperture = .0;
// for (int _ = 1; _ <= iter; fprintf(stderr, "\niter %d done!\n", _), ++_) {
// build kdtree
std::vector<SPPMnode> ball[nth];
KDTree tree;
for (int _ = 1; _ <= iter; fprintf(stderr, "\riter %d done!\n", _), ++_) {
if (_ < 3 || _ % 1 == 0) {
if (_ > 1) {
samp /= sqrt(alpha);
rad *= alpha;
}
#pragma omp parallel for num_threads(nth) schedule(dynamic, 1)
for (int y = 0; y < h; ++y) {
int num = omp_get_thread_num();
fprintf(stderr, "\rbuild kdtree %5.2f%% ... ", 100. * y / h);
for (int x = 0; x < w; ++x)
for (int sy = 0; sy < 2; ++sy)
for (int sx = 0; sx < 2; ++sx) {
unsigned short X[3] = {y + sy, y * x * time(0) + sx, y * x * y + time(0) + sy * 2 + sx};
ld r1 = 2 * erand48(X), dx = r1 < 1 ? sqrt(r1): 2-sqrt(2-r1);
ld r2 = 2 * erand48(X), dy = r2 < 1 ? sqrt(r2): 2-sqrt(2-r2);
P3 d = cx * ((dx / 2 + x + sx) / w - .5) + cy * ((dy / 2 + y + sy) / h - .5) + cam.d;
P3 pp = cam.o + d * 150, loc = cam.o + (P3(erand48(X) * 1.05, erand48(X)) - .5) * 2 * aperture;
std::vector<SPPMnode> tmp = sppm_backtrace(Ray(pp, (pp - loc).norm()), 0, y * w + x, X);
for (int i = 0; i < tmp.size(); ++i)
if (tmp[i].index >= 0) {
tmp[i].r = rad;
ball[num].push_back(tmp[i]);
}
}
}
std::vector<SPPMnode> totball;
fprintf(stderr, "\rbuild tree ... ");
for(int i = 0; i < nth; ++i) {
totball.insert(totball.end(), ball[i].begin(), ball[i].end());
// printf("%d: %d\n", i, ball[i].size());
}
tree.init(totball);
fprintf(stderr, "done!\n");
}
fprintf(stderr, "rad = %f samp = %.0f\n", rad, samp);
int per = samp / nth + 1;
#pragma omp parallel for num_threads(nth) schedule(dynamic, 1)
for (int t = 0; t < nth; ++t) {
unsigned short X[3] = {t, t * t, (t & (t * t)) + _ + time(0)};
int num = omp_get_thread_num();
// for (int i = 0; i < totball.size(); ++i)
// tree.query(totball[i], c[num]);
// for (ld y = 0; y <= 81; y += .5)
// for (ld x = 1; x < 200; x += .5)
// for (ld z = 0; z < 150; z += .5)
// tree.query(SPPMnode(P3(x, y, z), P3(1, 1, 1), P3(0,0,0)), c[num]);
for (int __ = 0; __ < per; __++) {
if (num == 0 && __ % 1000 == 0)
fprintf(stderr, "\rsppm tracing %5.2f%%", 100. * __ / per);
// gen random light
ld rc = erand48(X) * 18, tht = erand48(X) * 2 * PI;
P3 o(50 + rc * cos(tht), 81.6 - eps, 81.6 + rc * sin(tht));
ld r1 = 2 * PI * erand48(X), r2 = erand48(X), r2s = sqrt(r2);
P3 w = P3(0, -1, 0), u=(P3(1).cross(w)).norm(), v = w.cross(u);
P3 d = (u * cos(r1) * r2s + v * sin(r1) * r2s + w * sqrt(1 - r2)).norm();
Ray light = Ray(o, d);
P3 col = P3(1, 1, 1) + .4;
tree.query(SPPMnode(o, col, d), c[num]);
sppm_forward(light, 0, col, X, c[num], &tree);
}
}
// gather result
memset(now, 0, sizeof now);
for (int i = 0; i < nth; memset(c[i], 0, sizeof c[i]), ++i)
for (int j = h * w - 1; j >= 0; --j)
now[j] += c[i][j];
// modify rad
// for (int i = 1; i <= tree.n; ++i) {
// int index = tree.tree[i].sppm.index;
// if (now[index].n > eps) {
// tree.tree[i].sppm.r *= sqrt((final[index].n + alpha * now[index].n) / (final[index].n + now[index].n));
// // if (tree.tree[i].sppm.r < eps)
// // fprintf(stderr, "err: %lf %lf\n", sqrt((final[index].n + alpha * now[index].n) / (final[index].n + now[index].n)), tree.tree[i].sppm.r);
// }
// }
// tree.modify();
for (int i = h * w - 1; i >= 0; --i)
final[i] += now[i] / now[i].n;// * alpha;
if (_ == 1 || _ % 1 == 0) {
char sout[100];
sprintf(sout, "%s%03d.ppm", argv[3], _);
FILE* f = fopen(sout, "w");
fprintf(f, "P6\n%d %d\n%d\n", w, h, 255);
for (int y = h - 1; y >= 0; --y)
for (int x = w - 1; x >= 0; --x) {
fprintf(f, "%c%c%c", gamma_trans(final[y*w+x].get().x), gamma_trans(final[y*w+x].get().y), gamma_trans(final[y*w+x].get().z));
}
fclose(f);
}
}
return !puts("");
}
int main(int argc, char*argv[])
{
return baseline(argc, argv);
}
================================================
FILE: hw2/sppm/obj.hpp
================================================
#ifndef __OBJ_H__
#define __OBJ_H__
#include "utils.hpp"
#include "ray.hpp"
#include "bezier.hpp"
// enum Refl_t { DIFF, SPEC, REFR };
unsigned short mess[3]={1, 2, 3};
class Object {
public:
Texture texture;
Object(Texture t): texture(t) {}
Object(Refl_t refl, P3 color, P3 emission, ld brdf, std::string tname):
texture(tname, brdf, color, emission, refl) {}
virtual std::pair<ld, P3> intersect(Ray) {puts("virtual error in intersect!");}
// If no intersect, then return (INF, (0,0,0))
virtual std::pair<P3, P3> aabb() {puts("virtual error in aabb!");}
virtual P3 norm(P3) {puts("virtual error in norm!");}
// return norm vec out of obj
virtual P3 change_for_bezier(P3) {puts("virtual error in bezier!");}
};
class BezierObject: public Object {
// the curve will rotate line (x=pos.x and z=pos.z) as pivot
public:
BezierCurve2D curve;
P3 pos; // the buttom center point
BezierObject(P3 pos_, BezierCurve2D c_, Texture t):
pos(pos_), curve(c_), Object(t) {}
BezierObject(P3 pos_, BezierCurve2D c_, Refl_t refl, ld brdf = 1.5, P3 color = P3(), P3 emission = P3(), std::string tname = ""):
pos(pos_), curve(c_), Object(refl, color, emission, brdf, tname) {}
ld solve_t(ld yc) { // solve y(t)=yc
// assert(0 <= yc && yc <= curve.height);
ld t = .5, ft, dft;
for (int i = 10; i--; )
{
if (t < 0) t = 0;
else if (t > 1) t = 1;
ft = curve.getpos(t).y - yc, dft = curve.getdir(t).y;
if (std::abs(ft) < eps)
return t;
t -= ft / dft;
}
return -1;
}
virtual P3 change_for_bezier(P3 inter_p) {
ld t = solve_t(inter_p.y - pos.y);
ld u = atan2(inter_p.z - pos.z, inter_p.x - pos.x); // between -pi ~ pi
if (u < 0)
u += 2 * PI;
return P3(u, t);
}
ld get_sphere_intersect(Ray ray, P3 o, ld r) {
P3 ro = o - ray.o;
ld b = ray.d.dot(ro);
ld d = sqr(b) - ro.dot(ro) + sqr(r);
if (d < 0) return -1;
else d = sqrt(d);
ld t = b - d > eps ? b - d : b + d > eps? b + d : -1;
if (t < 0)
return -1;
return t;
}
virtual std::pair<ld, P3> intersect(Ray ray) {
ld final_dis = INF;
// check for |dy|<eps
if (std::abs(ray.d.y) < 5e-4)
{
ld dis_to_axis = (P3(pos.x, ray.o.y, pos.z) - ray.o).len();
ld hit = ray.get(dis_to_axis).y;
if (hit < pos.y + eps || hit > pos.y + curve.height - eps)
return std::make_pair(INF, P3());
// solve function pos.y+y(t)=ray.o.y to get x(t)
ld t = solve_t(hit - pos.y);
if (t < 0 || t > 1)
return std::make_pair(INF, P3());
P3 loc = curve.getpos(t);
ld ft = pos.y + loc.y - hit;
if (std::abs(ft) > eps)
return std::make_pair(INF, P3());
// assume sphere (pos.x, pos.y + loc.y, pos.z) - loc.x
final_dis = get_sphere_intersect(ray, P3(pos.x, pos.y + loc.y, pos.z), loc.x);
if (final_dis < 0)
return std::make_pair(INF, P3());
P3 inter_p = ray.get(final_dis);
// printf("y %f small!!!",std::abs((inter_p - P3(pos.x, inter_p.y, pos.z)).len2() - sqr(loc.x)));
if (std::abs((inter_p - P3(pos.x, inter_p.y, pos.z)).len2() - sqr(loc.x)) > 1e-1)
return std::make_pair(INF, P3());
// second iteration, more accuracy
hit = inter_p.y;
if (hit < pos.y + eps || hit > pos.y + curve.height - eps)
return std::make_pair(INF, P3());
t = solve_t(hit - pos.y);
loc = curve.getpos(t);
ft = pos.y + loc.y - hit;
if (std::abs(ft) > eps)
return std::make_pair(INF, P3());
final_dis = get_sphere_intersect(ray, P3(pos.x, pos.y + loc.y, pos.z), loc.x);
if (final_dis < 0)
return std::make_pair(INF, P3());
inter_p = ray.get(final_dis);
if (std::abs((inter_p - P3(pos.x, hit, pos.z)).len2() - sqr(loc.x)) > 1e-2)
return std::make_pair(INF, P3());
// printf("---y %f small!!!",std::abs((inter_p - P3(pos.x, inter_p.y, pos.z)).len2() - sqr(loc.x)));
return std::make_pair(final_dis, inter_p);
}
// printf("y big\n");
// check for top circle: the plane is y=pos.y + curve.height
// TODO
// check for buttom circle: the plane is y=pos.y
// TODO
// normal case
// calc ay^2+by+c
ld a = 0, b = 0, c = 0, t1, t2;
// (xo-x'+xd/yd*(y-yo))^2 -> (t1+t2*y)^2
t1 = ray.o.x - pos.x - ray.d.x / ray.d.y * ray.o.y;
t2 = ray.d.x / ray.d.y;
a += t2 * t2;
b += 2 * t1 * t2;
c += t1 * t1;
// (zo-z'+zd/yd*(y-yo))^2 -> (t1+t2*y)^2
t1 = ray.o.z - pos.z - ray.d.z / ray.d.y * ray.o.y;
t2 = ray.d.z / ray.d.y;
a += sqr(t2);
b += 2 * t1 * t2;
c += sqr(t1);
// ay^2+by+c -> a'(y-b')^2+c'
c = c - b * b / 4 / a;
b = -b / 2 / a - pos.y;
// printf("%lf %lf %lf\n",a,b,c);
if (0 <= b && b <= curve.height && c > curve.max2
|| (b < 0 || b > curve.height) && std::min(sqr(b), sqr(curve.height - b)) * a + c > curve.max2) // no intersect
return std::make_pair(INF, P3());
// ld pick[20] = {0, 0, 1}; int tot = 2;
// for (ld _ = 0; _ <= 1; _ += 0.1)
// {
// ld t_pick = newton2(_, a, b, c);
// if (0 <= t_pick && t_pick <= 1)
// {
// bool flag = 1;
// for (int j = 1; j <= tot; ++j)
// if (std::abs(t_pick - pick[j]) < eps)
// flag = 0;
// if (flag)
// pick[++tot] = t_pick;
// }
// }
// std::sort(pick + 1, pick + 1 + tot);
// for (int j = 1; j < tot; ++j)
// if (getft(pick[j], a, b, c) * getft(pick[j + 1], a, b, c) <= 0)
// check(pick[j], pick[j+1], (pick[j] + pick[j + 1]) * .5, ray, a, b, c, final_dis);
for(int ind = 0; ind <= curve.num; ++ind)
{
// y = curve.ckpt[ind] ~ curve.ckpt[ind+1]
// calc min(a(y-b)^2+c)
// ld lower;
// if (curve.data[ind].y0 <= b && b <= curve.data[ind].y1)
// lower = c;
// else
// lower = a * std::min(sqr(curve.data[ind].y0 - b), sqr(curve.data[ind].y1 - b)) + c;
ld t0 = curve.data[ind].t0, t1 = curve.data[ind].t1;
// if (t0 > eps) t0 += erand48(mess) * .01;
// if (t1 < 1 - eps) t1 -= erand48(mess) * .01;
// if (lower <= curve.data[ind].width2)
{
check(t0, t1, (t0 + t1 + t0) / 3, ray, a, b, c, final_dis);
check(t0, t1, (t1 + t0 + t1) / 3, ray, a, b, c, final_dis);
}
}
if (final_dis < INF / 2)
return std::make_pair(final_dis, ray.get(final_dis));
else
return std::make_pair(INF, P3());
}
bool check(ld low, ld upp, ld init, Ray ray, ld a, ld b, ld c, ld&final_dis)
{
ld t = newton(init, a, b, c, low, upp);
if (t <= 0 || t >= 1)
return false;
P3 loc = curve.getpos(t);
ld x = loc.x, y = loc.y;
ld ft = x - sqrt(a * sqr(y - b) + c);
if (std::abs(ft) > eps)
return false;
// calc t for ray
ld dis = (pos.y + y - ray.o.y) / ray.d.y;
if (dis < eps)
return false;
P3 inter_p = ray.get(dis);
if (std::abs((P3(pos.x, pos.y + y, pos.z) - inter_p).len2() - x * x) > eps)
return false;
if (dis < final_dis)
{
final_dis = dis;
// printf("%lf %lf %lf %lf\n",t,x , sqrt(a * sqr(y - b) + c), x - sqrt(a * sqr(y - b) + c));
return true;
}
return false;
}
ld getft(ld t, ld a, ld b, ld c)
{
if (t < 0) t = eps;
if (t > 1) t = 1 - eps;
P3 loc = curve.getpos(t);
ld x = loc.x, y = loc.y;
return x - sqrt(a * sqr(y - b) + c);
}
ld newton(ld t, ld a, ld b, ld c, ld low=eps, ld upp=1-eps)
{
// solve sqrt(a(y(t)+pos.y-b)^2+c)=x(t)
// f(t) = x(t) - sqrt(a(y(t)+pos.y-b)^2+c)
// f'(t) = x'(t) - a(y(t)+pos.y-b)*y'(t) / sqrt(...)
// if t is not in [0, 1] then assume f(t) is a linear function
ld ft, dft, x, y, dx, dy, sq;
P3 loc, dir;
for (int i = 10; i--; )
{
if (t < 0) t = low;
if (t > 1) t = upp;
loc = curve.getpos(t), dir = curve.getdir(t);
x = loc.x, dx = dir.x;
y = loc.y, dy = dir.y;
// printf("%lf %lf %lf\n",t,x,y);
sq = sqrt(a * sqr(y - b) + c);
ft = x - sq;
dft = dx - a * (y - b) * dy / sq;
if (std::abs(ft) < eps)
return t;
t -= ft / dft;
}
return -1;
}
ld newton2(ld t, ld a, ld b, ld c)
{
ld dft, ddft, y, dx, dy, ddx, ddy, sq;
P3 loc, dir, dir2;
for (int i = 5; i--; )
{
if (t < 0) t = eps;
if (t > 1) t = 1 - eps;
loc = curve.getpos(t), dir = curve.getdir(t), dir2 = curve.getdir2(t);
y = loc.y, dx = dir.x, dy = dir.y;
ddx = dir2.x, ddy = dir2.y;
sq = sqrt(a * sqr(y - b) + c);
dft = dx - a * (y - b) * dy / sq;
ddft = ddx - a * ((y - b) * ddy + sqr(dy)) / sq + sqr(a * (y - b) * dy) / sq / sq / sq;
if (std::abs(dft) < eps)
return t;
t -= dft / ddft;
}
return -1;
}
virtual std::pair<P3, P3> aabb() {
return std::make_pair(P3(pos.x - curve.max, pos.y, pos.z - curve.max), P3(pos.x + curve.max, pos.y + curve.height, pos.z + curve.max));
}
virtual P3 norm(P3 p) {
P3 tmp = change_for_bezier(p);
P3 dir = curve.getdir(tmp.y);
P3 d_surface = P3(cos(tmp.x), dir.y / dir.x, sin(tmp.x));
P3 d_circ = P3(-sin(tmp.x), 0, cos(tmp.x));
return d_circ.cross(d_surface).norm();
}
};
class CubeObject: public Object {
//store (x0, y0, z0) - (x1, y1, z1)
public:
P3 m0, m1;
CubeObject(P3 m0_, P3 m1_, Texture t):
m0(min(m0_, m1_)), m1(max(m0_, m1_)), Object(t) {}
CubeObject(P3 m0_, P3 m1_, Refl_t refl, ld brdf = 1.5, P3 color = P3(), P3 emission = P3(), std::string tname = ""):
m0(min(m0_, m1_)), m1(max(m0_, m1_)), Object(refl, color, emission, brdf, tname) {}
virtual P3 norm(P3 p) {
if (std::abs(p.x - m0.x) < eps || std::abs(p.x - m1.x) < eps)
return P3(std::abs(p.x - m1.x) < eps ? 1 : -1, 0, 0);
if (std::abs(p.y - m0.y) < eps || std::abs(p.y - m1.y) < eps)
return P3(0, std::abs(p.y - m1.y) < eps ? 1 : -1, 0);
if (std::abs(p.z - m0.z) < eps || std::abs(p.z - m1.z) < eps)
return P3(0, 0, std::abs(p.z - m1.z) < eps ? 1 : -1);
assert(1 == 0);
}
virtual std::pair<ld, P3> intersect(Ray ray) {
ld ft = INF, t;
P3 fq = P3(), q;
// x dir
t = (m0.x - ray.o.x) / ray.d.x;
if (0 < t && t < ft) {
q = ray.get(t);
if (m0.y <= q.y && q.y <= m1.y && m0.z <= q.z && q.z <= m1.z)
ft = t, fq = q;
}
t = (m1.x - ray.o.x) / ray.d.x;
if (0 < t && t < ft) {
q = ray.get(t);
if (m0.y <= q.y && q.y <= m1.y && m0.z <= q.z && q.z <= m1.z)
ft = t, fq = q;
}
// y dir
t = (m0.y - ray.o.y) / ray.d.y;
if (0 < t && t < ft) {
q = ray.get(t);
if (m0.x <= q.x && q.x <= m1.x && m0.z <= q.z && q.z <= m1.z)
ft = t, fq = q;
}
t = (m1.y - ray.o.y) / ray.d.y;
if (0 < t && t < ft) {
q = ray.get(t);
if (m0.x <= q.x && q.x <= m1.x && m0.z <= q.z && q.z <= m1.z)
ft = t, fq = q;
}
// z dir
t = (m0.z - ray.o.z) / ray.d.z;
if (0 < t && t < ft) {
q = ray.get(t);
if (m0.x <= q.x && q.x <= m1.x && m0.y <= q.y && q.y <= m1.y)
ft = t, fq = q;
}
t = (m1.z - ray.o.z) / ray.d.z;
if (0 < t && t < ft) {
q = ray.get(t);
if (m0.x <= q.x && q.x <= m1.x && m0.y <= q.y && q.y <= m1.y)
ft = t, fq = q;
}
return std::make_pair(ft, fq);
}
virtual std::pair<P3, P3> aabb() {
return std::make_pair(m0, m1);
}
};
class SphereObject: public Object {
public:
P3 o;
ld r;
SphereObject(P3 o_, ld r_, Texture t):
o(o_), r(r_), Object(t) {}
SphereObject(P3 o_, ld r_, Refl_t refl, ld brdf = 1.5, P3 color = P3(), P3 emission = P3(), std::string tname = ""):
o(o_), r(r_), Object(refl, color, emission, brdf, tname) {}
virtual std::pair<ld, P3> intersect(Ray ray) {
P3 ro = o - ray.o;
ld b = ray.d.dot(ro);
ld d = sqr(b) - ro.dot(ro) + sqr(r);
if (d < 0) return std::make_pair(INF, P3());
else d = sqrt(d);
ld t = b - d > eps ? b - d : b + d > eps? b + d : -1;
if (t < 0)
return std::make_pair(INF, P3());
return std::make_pair(t, ray.get(t));
}
virtual std::pair<P3, P3> aabb() {
return std::make_pair(o-r, o+r);
}
virtual P3 norm(P3 p) {
ld d = std::abs((p - o).len() - r);
assert(d < eps);
return (p - o).norm();
}
};
class PlaneObject: public Object {
// store ax+by+cz=1 n=(a,b,c)
public:
P3 n, n0;
PlaneObject(P3 n_, Texture t):
n(n_), n0(n_.norm()), Object(t) {}
PlaneObject(P3 n_, Refl_t refl, ld brdf = 1.5, P3 color = P3(), P3 emission = P3(), std::string tname = ""):
n(n_), n0(n_.norm()), Object(refl, color, emission, brdf, tname) {}
virtual std::pair<ld, P3> intersect(Ray ray) {
ld t = (1 - ray.o.dot(n)) / ray.d.dot(n);
if (t < eps)
return std::make_pair(INF, P3());
return std::make_pair(t, ray.get(t));
}
virtual std::pair<P3, P3> aabb() {
P3 p0 = P3(min_p[0], min_p[1], min_p[2]);
P3 p1 = P3(max_p[0], max_p[1], max_p[2]);
if (std::abs(n.x) <= eps && std::abs(n.y) <= eps) { // horizontal plane
p0.z = 1. / n.z - eps;
p1.z = 1. / n.z + eps;
return std::make_pair(p0, p1);
}
if (std::abs(n.y) <= eps && std::abs(n.z) <= eps) { // verticle plane
p0.x = 1. / n.x - eps;
p1.x = 1. / n.x + eps;
return std::make_pair(p0, p1);
}
if (std::abs(n.x) <= eps && std::abs(n.z) <= eps) { // verticle plane
p0.y = 1. / n.y - eps;
p1.y = 1. / n.y + eps;
return std::make_pair(p0, p1);
}
return std::make_pair(p0, p1);
}
virtual P3 norm(P3) {
return n0;
}
};
#endif // __OBJ_H__
================================================
FILE: hw2/sppm/ray.hpp
================================================
#ifndef __RAY_H__
#define __RAY_H__
#include "utils.hpp"
#include "vec3.hpp"
class Ray
{
public:
P3 o, d;
Ray(P3 o_, P3 d_): o(o_), d(d_) {}
P3 get(ld t) { return o + d * t; }
void print() { puts("Ray: "); o.print(); d.print(); }
};
#endif // __RAY_H__
================================================
FILE: hw2/sppm/render.hpp
================================================
#ifndef __RENDER_H__
#define __RENDER_H__
#include "texture.hpp"
#include "scene.hpp"
#include "kdtree.hpp"
std::pair<int, ld> find_intersect_simple(Ray ray) {
ld t = INF;
int id = -1;
for (int i = 0; i < scene_num; ++i) {
std::pair<ld, P3> tmp = scene[i]->intersect(ray);
if (tmp.first < INF / 2 && tmp.second.len2() > eps && tmp.first < t) {
t = tmp.first;
id = i;
}
}
return std::make_pair(id, t);
}
P3 basic_render(Ray ray, int dep, unsigned short *X) {
// printf("Dep %d\n",dep);
// ray.print();
int into = 0;
std::pair<int, ld> intersect_result = find_intersect_simple(ray);
if (intersect_result.first == -1)
return P3();
Object* obj = scene[intersect_result.first];
Texture& texture = obj->texture;
P3 x = ray.get(intersect_result.second);
std::pair<Refl_t, P3> feature = get_feature(obj, texture, x, X);
P3 f = feature.second, n = obj->norm(x), nl = n.dot(ray.d) < 0 ? into = 1, n : -n;
ld p = f.max();
if (f.max() < eps)
return texture.emission;
if (++dep > 5)
if (erand48(X) < p) f /= p;
else return texture.emission;
if (feature.first == DIFF) {
ld r1 = 2 * PI * erand48(X), r2 = erand48(X), r2s = sqrt(r2);
P3 w = nl, u=((fabs(w.x) > .1 ? P3(0, 1) : P3(1)) & w).norm(), v = w & u;
P3 d = (u * cos(r1) * r2s + v * sin(r1) * r2s + w * sqrt(1 - r2)).norm();
return f.mult(basic_render(Ray(x, d), dep, X));
}
else {
Ray reflray = Ray(x, ray.d.reflect(nl));
if (feature.first == SPEC) {
return f.mult(basic_render(reflray, dep, X));
}
else {
P3 d = ray.d.refract(n, into ? 1 : texture.brdf, into ? texture.brdf : 1);
if (d.len2() < eps) // Total internal reflection
return f.mult(basic_render(reflray, dep, X));
ld a = texture.brdf - 1, b = texture.brdf + 1;
ld R0 = a * a / (b * b), c = 1 - (into ? -ray.d.dot(nl) : d.dot(n));
ld Re = R0 + (1 - R0) * c * c * c * c * c, Tr = 1 - Re;
ld P = .25 + .5 * Re, RP = Re / P, TP = Tr / (1 - P);
return f.mult(dep > 2 ? (erand48(X) < P ? // Russian roulette
basic_render(reflray, dep, X) * RP : basic_render(Ray(x, d), dep, X) * TP)
: basic_render(reflray, dep, X) * Re + basic_render(Ray(x, d), dep, X) * Tr);
}
}
}
std::vector<SPPMnode> sppm_backtrace(Ray ray, int dep, int index, unsigned short* X, P3 pref = P3(1, 1, 1), ld prob = 1.) {
// if index == -1 then the node is illegal
std::vector<SPPMnode> result, tmp;
if (pref.max() < eps || prob < eps) return result;
int into = 0;
std::pair<int, ld> intersect_result = find_intersect_simple(ray);
if (intersect_result.first == -1)
return result;
Object* obj = scene[intersect_result.first];
Texture& texture = obj->texture;
P3 x = ray.get(intersect_result.second);
std::pair<Refl_t, P3> feature = get_feature(obj, texture, x, X);
P3 f = feature.second, n = obj->norm(x), nl = n.dot(ray.d) < 0 ? into = 1, n : -n;
ld p = f.max();
// if (debug)
// printf("dep = %d\tf = (%.5f, %.5f, %.5f) %s col = (%.5f %.5f %.5f) hit = (%.5f %.5f %.5f)\n", dep, pref.x, pref.y, pref.z,
// feature.first == REFR ? "REFR" : feature.first == DIFF ? "DIFF" : "SPEC", f.x, f.y, f.z, x.x, x.y, x.z);
if (f.max() < eps)
return result;
if (++dep > 5)
if(erand48(X) < p) f /= p;
else return result;
Ray reflray = Ray(x, ray.d.reflect(nl));
// result.push_back(SPPMnode(x, pref.mult(f), nl, 1, index, prob));
// return result;
if (feature.first == DIFF || texture.filename == "vase.png") { // vase: 0.8 prob
result.push_back(SPPMnode(x, pref.mult(f), nl, 1, index, prob * (texture.filename == "vase.png" ? .9 : 1)));
}
if (feature.first == SPEC || texture.filename == "vase.png") { // vase: 0.2 prob
tmp = sppm_backtrace(reflray, dep, index, X, pref.mult(f), prob * (texture.filename == "vase.png" ? .1 : 1.));
result.insert(result.end(), tmp.begin(), tmp.end());
}
if (feature.first == REFR) {
P3 d = ray.d.refract(n, into ? 1 : texture.brdf, into ? texture.brdf : 1);
if (d.len2() < eps) // Total internal reflection
return sppm_backtrace(reflray, dep, index, X, pref.mult(f), prob);
ld a = texture.brdf - 1, b = texture.brdf + 1;
ld R0 = a * a / (b * b), c = 1 - (into ? -ray.d.dot(nl) : d.dot(n));
ld Re = R0 + (1 - R0) * c * c * c * c * c, Tr = 1 - Re;
ld P = .25 + .5 * Re, RP = Re / P, TP = Tr / (1 - P);
if (dep > 2)
if (erand48(X) < P) {
tmp = sppm_backtrace(reflray, dep, index, X, pref.mult(f), prob * RP);
result.insert(result.end(), tmp.begin(), tmp.end());
}
else {
tmp = sppm_backtrace(Ray(x, d), dep, index, X, pref.mult(f), prob * TP);
result.insert(result.end(), tmp.begin(), tmp.end());
}
else {
tmp = sppm_backtrace(reflray, dep, index, X, pref.mult(f), prob * Re);
result.insert(result.end(), tmp.begin(), tmp.end());
tmp = sppm_backtrace(Ray(x, d), dep, index, X, pref.mult(f), prob * Tr);
result.insert(result.end(), tmp.begin(), tmp.end());
}
}
return result;
}
void sppm_forward(Ray ray, int dep, P3 col, unsigned short *X, IMGbuf* c, KDTree* kdt, ld prob = 1.) {
if (col.max() < eps) return;
int into = 0;
std::pair<int, ld> intersect_result = find_intersect_simple(ray);
if (intersect_result.first == -1)
return;
Object* obj = scene[intersect_result.first];
Texture& texture = obj->texture;
P3 x = ray.get(intersect_result.second);
std::pair<Refl_t, P3> feature = get_feature(obj, texture, x, X);
P3 f = feature.second, n = obj->norm(x), nl = n.dot(ray.d) < 0 ? into = 1, n : -n;
ld p = f.max();
if (f.max() < eps) {
kdt->query(SPPMnode(x, col, nl), c);
return;
}
if (++dep > 5)
if (erand48(X) < p) f /= p;
else {
kdt->query(SPPMnode(x, col, nl), c);
return;
}
if (feature.first == DIFF) {
kdt->query(SPPMnode(x, col, nl), c); // query col
ld r1 = 2 * PI * erand48(X), r2 = erand48(X), r2s = sqrt(r2);
P3 w = nl, u=((fabs(w.x) > .1 ? P3(0, 1) : P3(1)) & w).norm(), v = w & u;
P3 d = (u * cos(r1) * r2s + v * sin(r1) * r2s + w * sqrt(1 - r2)).norm();
return sppm_forward(Ray(x, d), dep, col.mult(f), X, c, kdt, prob);
}
else {
Ray reflray = Ray(x, ray.d.reflect(nl));
if (feature.first == SPEC) {
if (texture.filename == "vase.png")
kdt->query(SPPMnode(x, col, nl), c); // query col
return sppm_forward(reflray, dep, col.mult(f), X, c, kdt, prob);
}
else {
P3 d = ray.d.refract(n, into ? 1 : texture.brdf, into ? texture.brdf : 1);
if (d.len2() < eps) // Total internal reflection
return sppm_forward(reflray, dep, col.mult(f), X, c, kdt, prob);
ld a = texture.brdf - 1, b = texture.brdf + 1;
ld R0 = a * a / (b * b), c0 = 1 - (into ? -ray.d.dot(nl) : d.dot(n));
ld Re = R0 + (1 - R0) * c0 * c0 * c0 * c0 * c0, Tr = 1 - Re;
ld P = .25 + .5 * Re, RP = Re / P, TP = Tr / (1 - P);
return dep > 2 ? (erand48(X) < P ? // Russian roulette
sppm_forward(reflray, dep, col.mult(f), X, c, kdt, prob * RP) : sppm_forward(Ray(x, d), dep, col.mult(f), X, c, kdt, prob * TP))
: (sppm_forward(reflray, dep, col.mult(f), X, c, kdt, prob * Re), sppm_forward(Ray(x, d), dep, col.mult(f), X, c, kdt, prob * Tr));
}
}
}
#endif // __RENDER_H__
================================================
FILE: hw2/sppm/scene.hpp
================================================
#ifndef __SCENE_H__
#define __SCENE_H__
#include "obj.hpp"
#include "bezier.hpp"
const ld bezier_div_x = 3;
const ld bezier_div_y = 2.5;
ld control_x[] = {20./bezier_div_x,27./bezier_div_x,30./bezier_div_x,30./bezier_div_x,30./bezier_div_x,25./bezier_div_x,20./bezier_div_x,15./bezier_div_x,30./bezier_div_x};
ld control_y[] = {0./bezier_div_y,0./bezier_div_y,10./bezier_div_y,20./bezier_div_y,30./bezier_div_y,40./bezier_div_y,60./bezier_div_y,70./bezier_div_y,80./bezier_div_y};
BezierCurve2D bezier(control_x, control_y, 9, 9, .365);
Object* vase_front[] = {
new SphereObject(P3(1e5+1,40.8,81.6), 1e5, DIFF, 1.5, P3(.1,.25,.25)),//Left
new SphereObject(P3(-1e5+99,40.8,81.6), 1e5, DIFF, 1.5, P3(.25,.75,.25)),//Right
new SphereObject(P3(50,40.8, 1e5), 1e5, DIFF, 1.5, P3(.75,.75,.75)),//Back
new SphereObject(P3(50,40.8,-1e5+190), 1e5, DIFF, 1.5, P3(.25,.25,.25)),//Front
new SphereObject(P3(50, 1e5, 81.6), 1e5, DIFF, 1.5, P3(.75,.75,.75), P3(), "star.png"),//Bottom
new SphereObject(P3(50,-1e5+81.6,81.6), 1e5, DIFF, 1.5, P3(.75,.75,.75)),//Top
new SphereObject(P3(40,16.5,47), 16.5, SPEC, 1.5, P3(1,1,1)*.999),//Mirror
new CubeObject(P3(0,8,84), P3(34,10,116), DIFF, 1.5, P3(76/255.,34/255.,27/255.)),
new BezierObject(P3(20, 9.99, 100), bezier, DIFF, 1.5, P3(1,1,1)*.999, P3(), "vase.png"),
new SphereObject(P3(73,16.5,78), 16.5, REFR, 1.5, P3(1,1,1)*.999),//Glas
// new SphereObject(P3(20,60,100), 16.5, SPEC, 1.5, P3(1,1,1)*.999),//RedBall
new SphereObject(P3(50,681.6-.27,81.6), 600, DIFF, 1.5, P3(), P3(12,12,12)) //Lite
};
Object* vase_back[] = {
new SphereObject(P3(1e5+1,40.8,81.6), 1e5, DIFF, 1.5, P3(.1,.25,.25)),//Left
new SphereObject(P3(-1e5+99,40.8,81.6), 1e5, DIFF, 1.5, P3(.25,.75,.25)),//Right
new SphereObject(P3(50,40.8, 1e5), 1e5, DIFF, 1.5, P3(.75,.75,.75)),//Back
new SphereObject(P3(50,40.8,-1e5+190), 1e5, DIFF, 1.5, P3(.25,.25,.25)),//Front
new SphereObject(P3(50, 1e5, 81.6), 1e5, DIFF, 1.5, P3(.75,.75,.75), P3(), "star.png"),//Botrom
new SphereObject(P3(50,-1e5+81.6,81.6), 1e5, DIFF, 1.5, P3(.75,.75,.75)),//Top
// new SphereObject(P3(27,16.5,47), 16.5, SPEC, 1.5, P3(1,1,1)*.999),//Mirror
new CubeObject(P3(0,8,0), P3(30,10,30), DIFF, 1.5, P3(76/255.,34/255.,27/255.)),
new BezierObject(P3(15, 9.99, 15), bezier, DIFF, 1.7, P3(1,1,1)*.999, P3(), "vase.png"),
new SphereObject(P3(73,16.5,40), 16.5, DIFF, 1.7, P3(1,1,1)*.999, P3(), "rainbow.png"),//Main Ball
new SphereObject(P3(45,6,45), 6, REFR, 1.7, P3(.5,.5,1)*.999),//SmallBall0
new SphereObject(P3(44,4,95), 4, REFR, 1.7, P3(1,.5,.5)*.999),//SmallBall1
new SphereObject(P3(56,4,105), 4, REFR, 1.7, P3(.5,1,.5)*.999),//SmallBall2
new SphereObject(P3(67,4,112), 4, REFR, 1.7, P3(1,1,.5)*.999),//SmallBall3
new SphereObject(P3(16,60,100), 12, REFR, 1.5, P3(1,1,1)*.999),//FlyBall
new SphereObject(P3(50,681.6-.27,81.6), 600, DIFF, 1.5, P3(), P3(12,12,12)) //Lite
};
Object* camera_left[] = {
new SphereObject(P3(1e5+1,40.8,81.6), 1e5, DIFF, 1.5, P3(.1,.25,.25), P3(), "wallls.com_156455.png"),//Left
new SphereObject(P3(-1e5+299,40.8,81.6), 1e5, DIFF, 1.5, P3(.25,.75,.25)),//Right
new SphereObject(P3(50,40.8, 1e5), 1e5, DIFF, 1.5, P3(1,1,1)*.999, P3(), "greenbg.jpg"),//Back
new SphereObject(P3(50,40.8,-1e5+190), 1e5, DIFF, 1.5, P3(.25,.25,.25)),//Front
new SphereObject(P3(50, 1e5, 81.6), 1e5, DIFF, 1.5, P3(.75,.75,.75), P3(), "star.png"),//Botrom
new SphereObject(P3(50,-1e5+81.6,81.6), 1e5, DIFF, 1.5, P3(.75,.75,.75)),//Top
// new SphereObject(P3(27,16.5,47), 16.5, SPEC, 1.5, P3(1,1,1)*.999),//Mirror
new CubeObject(P3(0,8,0), P3(30,10,30), DIFF, 1.5, P3(76/255.,34/255.,27/255.), P3(), "wood.jpg"),
new BezierObject(P3(15, 9.99, 15), bezier, DIFF, 1.7, P3(1,1,1)*.999, P3(), "vase.png"),
new SphereObject(P3(73,16.5,40), 16.5, DIFF, 1.7, P3(1,1,1)*.999, P3(), "rainbow.png"),//Main Ball
new SphereObject(P3(45,6,45), 6, REFR, 1.7, P3(.5,.5,1)*.999),//SmallBall0
new SphereObject(P3(52,3,75), 3, REFR, 1.7, P3(1,.5,.5)*.999),//SmallBall1
new SphereObject(P3(65.5,3,88), 3, REFR, 1.7, P3(.5,1,.5)*.999),//SmallBall2
new SphereObject(P3(77,3,92), 3, REFR, 1.7, P3(1,1,.5)*.999),//SmallBall3
// new SphereObject(P3(16,60,100), 12, REFR, 1.5, P3(1,1,1)*.999),//FlyBall
new SphereObject(P3(50,681.6-.27,81.6), 600, DIFF, 1.5, P3(), P3(1,1,1)*20) //Lite
};
Object** scene = camera_left;
int scene_num = 14;
std::pair<Refl_t, P3> get_feature(Object* obj, Texture&texture, P3 x, unsigned short *X) {
std::pair<Refl_t, P3> feature;
if (texture.filename == "star.png")
feature = texture.getcol(x.z / 15, x.x / 15);
else if (texture.filename == "crack.jpg") {
feature = texture.getcol(x.z / 300, x.x / 300);
}
else if (texture.filename == "wood.jpg") {
feature = texture.getcol(x.x / 30, x.z / 30);
}
else if (texture.filename == "greenbg.jpg") {
feature = texture.getcol(-x.x / 125, -x.y / 80 - 0.05);
// if (erand48(X) < 0.2 && x.y < 50)
// feature.first = SPEC;
}
else if (texture.filename == "wallls.com_156455.png") {
feature = texture.getcol(-x.z / 150, -x.y / 100);
// if (erand48(X) < 0.2 && x.y < 50)
// feature.first = SPEC;
}
else if (texture.filename == "vase.png") {
P3 tmp = obj->change_for_bezier(x);
// printf("%f %f\n",tmp.x/2/PI,tmp.y);
feature = texture.getcol(tmp.x / 2 / PI + .5, tmp.y);
if (erand48(X) < 0.2)
feature.first = SPEC;
}
else if (texture.filename == "rainbow.png") {
ld px = (x.x - 73) / 16.5, py = (x.y - 16.5) / 16.5;
feature = texture.getcol((py * cos(-0.3) + px * sin(-0.3))*.6 - .25, x.z);
// feature = texture.getcol(x.y / 32 + 0.25, x.z);
}
else
feature = texture.getcol(x.z, x.x);
return feature;
}
#endif // __SCENE_H__
================================================
FILE: hw2/sppm/stb_image.h
================================================
/* stb_image - v2.19 - public domain image loader - http://nothings.org/stb
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.19 (2018-02-11) fix warning
2.18 (2018-01-30) fix warnings
2.17 (2018-01-29) bugfix, 1-bit BMP, 16-bitness query, fix warnings
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)
Christopher Forseth (animated gif) Daniel Gibson (16-bit TGA)
socks-the-fox (16-bit PNG)
Jeremy Sawicki (handle all ImageNet JPGs)
Optimizations & bugfixes Mikhail Morozov (1-bit BMP)
Fabian "ryg" Giesen Anael Seghezzi (is-16-bit query)
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 github:rlyeh
Janez Zemva John Bartholomew Michal Cichon github:romigrou
Jonathan Blow Ken Hamada Tero Hanninen github:svdijk
Laurent Gomila Cort Stratton Sergio Gonzalez github:snagar
Aruelien Pocheville Thibault Reuille Cass Everitt github:Zelex
Ryamond Barbiero Paul Du Bois Engin Manap github:grim210
Aldo Culquicondor Philipp Wiesemann Dale Weiler github:sammyhw
Oriol Ferrer Mesia Josh Tobin Matthew Gregan github:phprus
Julian Raschke Gregory Mullen Baldur Karlsson github:poppolopoppo
Christian Floisand Kevin Schmidt github:darealshinji
Blazej Dariusz Roszkowski github:Michaelangel007
*/
#ifndef STBI_INCLUDE_STB_IMAGE_H
#define STBI_INCLUDE_STB_IMAGE_H
// DOCUMENTATION
//
// Limitations:
// - no 12-bit-per-channel JPEG
// - no JPEGs with arithmetic coding
// - 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 <stdio.h>
#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_GIF
STBIDEF stbi_uc *stbi_load_gif_from_memory(stbi_uc const *buffer, int len, int **delays, int *x, int *y, int *z, int *comp, int req_comp);
#endif
#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);
STBIDEF int stbi_is_16_bit_from_memory(stbi_uc const *buffer, int len);
STBIDEF int stbi_is_16_bit_from_callbacks(stbi_io_callbacks const *clbk, void *user);
#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);
STBIDEF int stbi_is_16_bit (char const *filename);
STBIDEF int stbi_is_16_bit_from_file(FILE *f);
#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 <stdarg.h>
#include <stddef.h> // ptrdiff_t on osx
#include <stdlib.h>
#include <string.h>
#include <limits.h>
#if !defined(STBI_NO_LINEAR) || !defined(STBI_NO_HDR)
#include <math.h> // ldexp, pow
#endif
#ifndef STBI_NO_STDIO
#include <stdio.h>
#endif
#ifndef STBI_ASSERT
#include <assert.h>
#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 <stdint.h>
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 <emmintrin.h>
#ifdef _MSC_VER
#if _MSC_VER >= 1400 // not VC6
#include <intrin.h> // __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 <arm_neon.h>
// 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);
static int stbi__png_is16(stbi__context *s);
#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);
static int stbi__psd_is16(stbi__context *s);
#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 void *stbi__load_gif_main(stbi__context *s, int **delays, int *x, int *y, int *z, int *comp, int req_comp);
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
#if !defined(STBI_NO_LINEAR) || !defined(STBI_NO_HDR)
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);
}
#endif
// 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);
}
#if !defined(STBI_NO_LINEAR) || !defined(STBI_NO_HDR)
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);
}
#endif
// 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 void stbi__vertical_flip_slices(void *image, int w, int h, int z, int bytes_per_pixel)
{
int slice;
int slice_size = w * h * bytes_per_pixel;
stbi_uc *bytes = (stbi_uc *)image;
for (slice = 0; slice < z; ++slice) {
stbi__vertical_flip(bytes, w, h, bytes_per_pixel);
bytes += slice_size;
}
}
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;
}
#if !defined(STBI_NO_HDR) || !defined(STBI_NO_LINEAR)
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_GIF
STBIDEF stbi_uc *stbi_load_gif_from_memory(stbi_uc const *buffer, int len, int **delays, int *x, int *y, int *z, int *comp, int req_comp)
{
unsigned char *result;
stbi__context s;
stbi__start_mem(&s,buffer,len);
result = (unsigned char*) stbi__load_gif_main(&s, delays, x, y, z, comp, req_comp);
if (stbi__vertically_flip_on_load) {
stbi__vertical_flip_slices( result, *x, *y, *z, *comp );
}
return result;
}
#endif
#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
long pos = ftell(f);
int res;
stbi__context s;
stbi__start_file(&s,f);
res = stbi__hdr_test(&s);
fseek(f, pos, SEEK_SET);
return res;
#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;
unsigned int 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 >= (1u << 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 * 256) + (run * 16) + (len + magbits));
}
}
}
}
static void stbi__grow_buffer_unsafe(stbi__jpeg *j)
{
do {
unsigned 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 const 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<<n) + 1
static const int stbi__jbias[16] = {0,-1,-3,-7,-15,-31,-63,-127,-255,-511,-1023,-2047,-4095,-8191,-16383,-32767};
// combined JPEG 'receive' and JPEG 'extend', since baseline
// always extends everything it receives.
stbi_inline static int stbi__extend_receive(stbi__jpeg *j, int n)
{
unsigned int k;
int sgn;
if (j->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 const 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) * 4096)
// 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]*4;
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 const 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) return stbi__err("bad DNL len", "Corrupt JPEG");
if (NL != j->s->img_y) return 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 const 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 const 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 const 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 const 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 const 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->nu
gitextract_kj7v1f36/
├── .gitignore
├── LICENSE
├── README.md
├── hw1/
│ ├── hw1.Rmd
│ ├── main.py
│ ├── requirements.txt
│ └── 计算机图形学_习题课1_本科生2018_500301909.pptx
├── hw2/
│ ├── pt/
│ │ ├── main.cpp
│ │ └── utils.hpp
│ ├── sppm/
│ │ ├── bezier.hpp
│ │ ├── bezier_test.py
│ │ ├── kdtree.hpp
│ │ ├── main.cpp
│ │ ├── obj.hpp
│ │ ├── ray.hpp
│ │ ├── render.hpp
│ │ ├── scene.hpp
│ │ ├── star.png.bak
│ │ ├── star.ppm
│ │ ├── stb_image.h
│ │ ├── texture.hpp
│ │ ├── utils.hpp
│ │ └── vec3.hpp
│ └── 计算机图形学基础-习题课2-2018_949307398.pptx
└── hw3/
├── MVC/
│ ├── CMakeLists.txt
│ ├── edge.py
│ ├── main.cpp
│ ├── report.bib
│ ├── report.tex
│ ├── stb_image.h
│ └── stb_image_write.h
└── 计算机图形学基础_习题课3_529603220.pptx
SYMBOL INDEX (665 symbols across 18 files)
FILE: hw1/main.py
function line (line 13) | def line(p1,p2):
function drawline (line 28) | def drawline(a,p1,p2,c):
function colorize (line 40) | def colorize(a,p,bg,fg):
FILE: hw2/pt/main.cpp
type Ray (line 5) | struct Ray{
method Ray (line 7) | Ray(P3 o_, P3 d_): o(o_), d(d_) {}
type Refl_t (line 10) | enum Refl_t { DIFF, SPEC, REFR }
type Sphere (line 12) | struct Sphere{
method Sphere (line 16) | Sphere(ld rad_, P3 o_, P3 e_, P3 c_, Refl_t refl_, ld ns_=1.5):
method ld (line 18) | ld intersect(const Ray&r) const {
function output (line 42) | int output(ld x) {return int(.5+mcol*pow(x<0?0:x>1?1:x,1/2.2));}
function intersect (line 44) | bool intersect(const Ray&r, ld&t, int&id){
function P3 (line 52) | P3 radiance(const Ray&r, int dep,unsigned short *X){
function main (line 85) | int main(int argc, char*argv[])
FILE: hw2/pt/utils.hpp
function ld (line 9) | ld rand01() {return 1.*rand()/RAND_MAX;}
type P3 (line 11) | struct P3{
method P3 (line 13) | P3(ld x_=0, ld y_=0, ld z_=0): x(x_), y(y_), z(z_) {}
method P3 (line 14) | P3 operator-() const {return P3(-x, -y, -z);}
method P3 (line 15) | P3 operator+(const P3&a) const {return P3(x+a.x, y+a.y, z+a.z);}
method P3 (line 16) | P3 operator-(const P3&a) const {return P3(x-a.x, y-a.y, z-a.z);}
method P3 (line 17) | P3 operator*(ld p) const {return P3(x*p, y*p, z*p);}
method P3 (line 18) | P3 operator/(ld p) const {return P3(x/p, y/p, z/p);}
method P3 (line 21) | P3&operator+=(const P3&a) {return *this = *this + a;}
method P3 (line 22) | P3&operator-=(const P3&a) {return *this = *this - a;}
method P3 (line 23) | P3&operator*=(ld p) {return *this = *this * p;}
method P3 (line 24) | P3&operator/=(ld p) {return *this = *this / p;}
method ld (line 25) | ld operator|(const P3&a) const {return x*a.x + y*a.y + z*a.z;}
method ld (line 26) | ld dot(const P3&a) const {return x*a.x + y*a.y + z*a.z;}
method ld (line 27) | ld max() const {return x>y&&x>z?x:y>z?y:z;}
method ld (line 28) | ld len() const {return sqrt(x*x + y*y + z*z);}
method ld (line 29) | ld len2() const {return x*x + y*y + z*z;}
method P3 (line 30) | P3 mult(const P3&a) const {return P3(x*a.x, y*a.y, z*a.z);}
method P3 (line 31) | P3 operator&(const P3&a) const {return P3(y*a.z-z*a.y, z*a.x-x*a.z, x*...
method P3 (line 32) | P3 cross(const P3&a) const {return P3(y*a.z-z*a.y, z*a.x-x*a.z, x*a.y-...
method P3 (line 33) | P3 norm() const {return (*this)/len();}
method P3 (line 34) | P3 clip() const {return P3(x>1?1:x<0?0:x, y>1?1:y<0?0:y, z>1?1:z<0?0:z);}
method P3 (line 35) | P3 reflect(const P3&n) const {return (*this)-n*2.*n.dot(*this);}
method P3 (line 36) | P3 refract(const P3&n, ld ni, ld nr) const { // smallPT1.ppt Page#72
method print (line 47) | void print() const {std::cout << x << " " << y << " " << z << std::endl;}
FILE: hw2/sppm/bezier.hpp
class BezierCurve2D (line 7) | class BezierCurve2D
type D (line 12) | struct D{
method BezierCurve2D (line 17) | BezierCurve2D(ld* px, ld* py, int n_, int num_, ld r_): num(num_), n(n...
method P3 (line 65) | P3 getpos(ld t)
method P3 (line 76) | P3 getdir(ld t)
method P3 (line 87) | P3 getdir2(ld t)
FILE: hw2/sppm/bezier_test.py
function bezier (line 17) | def bezier(t):
function init (line 24) | def init(size):
function init_new (line 37) | def init_new(control):
function bezier_new (line 58) | def bezier_new(t):
function ray (line 66) | def ray(x):
FILE: hw2/sppm/kdtree.hpp
type SPPMnode (line 7) | struct SPPMnode {
method SPPMnode (line 11) | SPPMnode() {index = -1; prob = 1;}
method SPPMnode (line 12) | SPPMnode(P3 pos_, P3 col_, P3 dir_, ld r_ = 1, int index_ = -1, ld pro...
type IMGbuf (line 16) | struct IMGbuf {
method IMGbuf (line 18) | IMGbuf(): n(0), f(0,0,0) {}
method IMGbuf (line 19) | IMGbuf(ld n_, P3 f_): n(n_), f(f_) {}
method add (line 20) | void add(P3 c, ld p = 1.) { n += p, f += c; }
method P3 (line 21) | P3 getcol() { return f / n; }
method reset (line 22) | void reset() { n = 0; f.x = f.y = f.z = 0; }
method IMGbuf (line 23) | IMGbuf operator+(const IMGbuf& a) const {return IMGbuf(n + a.n, f + a....
method IMGbuf (line 24) | IMGbuf operator*(ld p) const {return IMGbuf(n * p, f * p);}
method IMGbuf (line 25) | IMGbuf operator/(ld p) const {return IMGbuf(n / p, f / p);}
method IMGbuf (line 26) | IMGbuf& operator+=(const IMGbuf& a) {return *this = *this + a;}
method P3 (line 27) | P3 get() { return n < eps ? f : f / n; }
class KDTree (line 30) | class KDTree
type KDTreeNode (line 35) | struct KDTreeNode {
method KDTreeNode (line 39) | KDTreeNode(): sppm() {s[0] = s[1] = 0;}
method KDTree (line 50) | KDTree() { tree = NULL; }
method mt (line 52) | void mt(int f, int x) {
method bt (line 56) | int bt(int l, int r, int d) {
method KDTree (line 66) | KDTree(std::vector<SPPMnode>& node) { // multi-thread forbid !!!
method init (line 69) | void init(std::vector<SPPMnode>& node) { // multi-thread forbid !!!
method ld (line 78) | ld getdis2(P3 pos, P3 m0, P3 m1) {
method _query (line 81) | void _query(const SPPMnode&node, IMGbuf* c, int o) {
method _modify (line 91) | void _modify(int o) {
method query (line 97) | void query(SPPMnode node, IMGbuf* c) {
method modify (line 100) | void modify() {
FILE: hw2/sppm/main.cpp
function baseline (line 3) | int baseline(int argc, char *argv[])
function sppm (line 47) | int sppm(int argc, char* argv[])
function main (line 159) | int main(int argc, char*argv[])
FILE: hw2/sppm/obj.hpp
class Object (line 12) | class Object {
method Object (line 15) | Object(Texture t): texture(t) {}
method Object (line 16) | Object(Refl_t refl, P3 color, P3 emission, ld brdf, std::string tname):
method intersect (line 18) | virtual std::pair<ld, P3> intersect(Ray) {puts("virtual error in inter...
method aabb (line 20) | virtual std::pair<P3, P3> aabb() {puts("virtual error in aabb!");}
method P3 (line 21) | virtual P3 norm(P3) {puts("virtual error in norm!");}
method P3 (line 23) | virtual P3 change_for_bezier(P3) {puts("virtual error in bezier!");}
class BezierObject (line 26) | class BezierObject: public Object {
method BezierObject (line 31) | BezierObject(P3 pos_, BezierCurve2D c_, Texture t):
method BezierObject (line 33) | BezierObject(P3 pos_, BezierCurve2D c_, Refl_t refl, ld brdf = 1.5, P3...
method ld (line 35) | ld solve_t(ld yc) { // solve y(t)=yc
method P3 (line 49) | virtual P3 change_for_bezier(P3 inter_p) {
method ld (line 56) | ld get_sphere_intersect(Ray ray, P3 o, ld r) {
method intersect (line 67) | virtual std::pair<ld, P3> intersect(Ray ray) {
method check (line 178) | bool check(ld low, ld upp, ld init, Ray ray, ld a, ld b, ld c, ld&fina...
method ld (line 203) | ld getft(ld t, ld a, ld b, ld c)
method ld (line 211) | ld newton(ld t, ld a, ld b, ld c, ld low=eps, ld upp=1-eps)
method ld (line 236) | ld newton2(ld t, ld a, ld b, ld c)
method aabb (line 256) | virtual std::pair<P3, P3> aabb() {
method P3 (line 259) | virtual P3 norm(P3 p) {
class CubeObject (line 268) | class CubeObject: public Object {
method CubeObject (line 272) | CubeObject(P3 m0_, P3 m1_, Texture t):
method CubeObject (line 274) | CubeObject(P3 m0_, P3 m1_, Refl_t refl, ld brdf = 1.5, P3 color = P3()...
method P3 (line 276) | virtual P3 norm(P3 p) {
method intersect (line 285) | virtual std::pair<ld, P3> intersect(Ray ray) {
method aabb (line 329) | virtual std::pair<P3, P3> aabb() {
class SphereObject (line 334) | class SphereObject: public Object {
method SphereObject (line 338) | SphereObject(P3 o_, ld r_, Texture t):
method SphereObject (line 340) | SphereObject(P3 o_, ld r_, Refl_t refl, ld brdf = 1.5, P3 color = P3()...
method intersect (line 342) | virtual std::pair<ld, P3> intersect(Ray ray) {
method aabb (line 353) | virtual std::pair<P3, P3> aabb() {
method P3 (line 356) | virtual P3 norm(P3 p) {
class PlaneObject (line 363) | class PlaneObject: public Object {
method PlaneObject (line 367) | PlaneObject(P3 n_, Texture t):
method PlaneObject (line 369) | PlaneObject(P3 n_, Refl_t refl, ld brdf = 1.5, P3 color = P3(), P3 emi...
method intersect (line 371) | virtual std::pair<ld, P3> intersect(Ray ray) {
method aabb (line 377) | virtual std::pair<P3, P3> aabb() {
method P3 (line 397) | virtual P3 norm(P3) {
FILE: hw2/sppm/ray.hpp
class Ray (line 7) | class Ray
method Ray (line 11) | Ray(P3 o_, P3 d_): o(o_), d(d_) {}
method P3 (line 12) | P3 get(ld t) { return o + d * t; }
method print (line 13) | void print() { puts("Ray: "); o.print(); d.print(); }
FILE: hw2/sppm/render.hpp
function find_intersect_simple (line 8) | std::pair<int, ld> find_intersect_simple(Ray ray) {
function P3 (line 21) | P3 basic_render(Ray ray, int dep, unsigned short *X) {
function sppm_backtrace (line 65) | std::vector<SPPMnode> sppm_backtrace(Ray ray, int dep, int index, unsign...
function sppm_forward (line 124) | void sppm_forward(Ray ray, int dep, P3 col, unsigned short *X, IMGbuf* c...
FILE: hw2/sppm/scene.hpp
function get_feature (line 69) | std::pair<Refl_t, P3> get_feature(Object* obj, Texture&texture, P3 x, un...
FILE: hw2/sppm/stb_image.h
type stbi_uc (line 322) | typedef unsigned char stbi_uc;
type stbi_us (line 323) | typedef unsigned short stbi_us;
type stbi_io_callbacks (line 344) | typedef struct
type stbi__uint16 (line 541) | typedef unsigned short stbi__uint16;
type stbi__int16 (line 542) | typedef signed short stbi__int16;
type stbi__uint32 (line 543) | typedef unsigned int stbi__uint32;
type stbi__int32 (line 544) | typedef signed int stbi__int32;
type stbi__uint16 (line 547) | typedef uint16_t stbi__uint16;
type stbi__int16 (line 548) | typedef int16_t stbi__int16;
type stbi__uint32 (line 549) | typedef uint32_t stbi__uint32;
type stbi__int32 (line 550) | typedef int32_t stbi__int32;
function stbi__cpuid3 (line 631) | static int stbi__cpuid3(void)
function stbi__sse2_available (line 652) | static int stbi__sse2_available(void)
function stbi__sse2_available (line 660) | static int stbi__sse2_available(void)
type stbi__context (line 691) | typedef struct
function stbi__start_mem (line 711) | static void stbi__start_mem(stbi__context *s, stbi_uc const *buffer, int...
function stbi__start_callbacks (line 720) | static void stbi__start_callbacks(stbi__context *s, stbi_io_callbacks *c...
function stbi__stdio_read (line 733) | static int stbi__stdio_read(void *user, char *data, int size)
function stbi__stdio_skip (line 738) | static void stbi__stdio_skip(void *user, int n)
function stbi__stdio_eof (line 743) | static int stbi__stdio_eof(void *user)
function stbi__start_file (line 755) | static void stbi__start_file(stbi__context *s, FILE *f)
function stbi__rewind (line 764) | static void stbi__rewind(stbi__context *s)
type stbi__result_info (line 779) | typedef struct
function STBIDEF (line 846) | STBIDEF const char *stbi_failure_reason(void)
function stbi__err (line 851) | static int stbi__err(const char *str)
function stbi__addsizes_valid (line 874) | static int stbi__addsizes_valid(int a, int b)
function stbi__mul2sizes_valid (line 886) | static int stbi__mul2sizes_valid(int a, int b)
function stbi__mad2sizes_valid (line 895) | static int stbi__mad2sizes_valid(int a, int b, int add)
function stbi__mad3sizes_valid (line 901) | static int stbi__mad3sizes_valid(int a, int b, int c, int add)
function stbi__mad4sizes_valid (line 909) | static int stbi__mad4sizes_valid(int a, int b, int c, int d, int add)
function STBIDEF (line 952) | STBIDEF void stbi_image_free(void *retval_from_stbi_load)
function STBIDEF (line 967) | STBIDEF void stbi_set_flip_vertically_on_load(int flag_true_if_should_flip)
function stbi_uc (line 1017) | static stbi_uc *stbi__convert_16_to_8(stbi__uint16 *orig, int w, int h, ...
function stbi__uint16 (line 1033) | static stbi__uint16 *stbi__convert_8_to_16(stbi_uc *orig, int w, int h, ...
function stbi__vertical_flip (line 1049) | static void stbi__vertical_flip(void *image, int w, int h, int bytes_per...
function stbi__vertical_flip_slices (line 1073) | static void stbi__vertical_flip_slices(void *image, int w, int h, int z,...
function stbi__uint16 (line 1109) | static stbi__uint16 *stbi__load_and_postprocess_16bit(stbi__context *s, ...
function stbi__float_postprocess (line 1135) | static void stbi__float_postprocess(float *result, int *x, int *y, int *...
function FILE (line 1146) | static FILE *stbi__fopen(char const *filename, char const *mode)
function STBIDEF (line 1159) | STBIDEF stbi_uc *stbi_load(char const *filename, int *x, int *y, int *co...
function STBIDEF (line 1169) | STBIDEF stbi_uc *stbi_load_from_file(FILE *f, int *x, int *y, int *comp,...
function STBIDEF (line 1182) | STBIDEF stbi__uint16 *stbi_load_from_file_16(FILE *f, int *x, int *y, in...
function STBIDEF (line 1195) | STBIDEF stbi_us *stbi_load_16(char const *filename, int *x, int *y, int ...
function STBIDEF (line 1208) | STBIDEF stbi_us *stbi_load_16_from_memory(stbi_uc const *buffer, int len...
function STBIDEF (line 1215) | STBIDEF stbi_us *stbi_load_16_from_callbacks(stbi_io_callbacks const *cl...
function STBIDEF (line 1222) | STBIDEF stbi_uc *stbi_load_from_memory(stbi_uc const *buffer, int len, i...
function STBIDEF (line 1229) | STBIDEF stbi_uc *stbi_load_from_callbacks(stbi_io_callbacks const *clbk,...
function STBIDEF (line 1237) | STBIDEF stbi_uc *stbi_load_gif_from_memory(stbi_uc const *buffer, int le...
function STBIDEF (line 1271) | STBIDEF float *stbi_loadf_from_memory(stbi_uc const *buffer, int len, in...
function STBIDEF (line 1278) | STBIDEF float *stbi_loadf_from_callbacks(stbi_io_callbacks const *clbk, ...
function STBIDEF (line 1286) | STBIDEF float *stbi_loadf(char const *filename, int *x, int *y, int *com...
function STBIDEF (line 1296) | STBIDEF float *stbi_loadf_from_file(FILE *f, int *x, int *y, int *comp, ...
function STBIDEF (line 1310) | STBIDEF int stbi_is_hdr_from_memory(stbi_uc const *buffer, int len)
function STBIDEF (line 1324) | STBIDEF int stbi_is_hdr (char const *filename)
function STBIDEF (line 1335) | STBIDEF int stbi_is_hdr_from_file(FILE *f)
function STBIDEF (line 1352) | STBIDEF int stbi_is_hdr_from_callbacks(stbi_io_callbacks const *clb...
function STBIDEF (line 1368) | STBIDEF void stbi_ldr_to_hdr_gamma(float gamma) { stbi__l2h_gamma = ga...
function STBIDEF (line 1369) | STBIDEF void stbi_ldr_to_hdr_scale(float scale) { stbi__l2h_scale = sc...
function STBIDEF (line 1374) | STBIDEF void stbi_hdr_to_ldr_gamma(float gamma) { stbi__h2l_gamma_i = ...
function STBIDEF (line 1375) | STBIDEF void stbi_hdr_to_ldr_scale(float scale) { stbi__h2l_scale_i = ...
function stbi__refill_buffer (line 1390) | static void stbi__refill_buffer(stbi__context *s)
function stbi_inline (line 1406) | stbi_inline static stbi_uc stbi__get8(stbi__context *s)
function stbi_inline (line 1417) | stbi_inline static int stbi__at_eof(stbi__context *s)
function stbi__skip (line 1429) | static void stbi__skip(stbi__context *s, int n)
function stbi__getn (line 1446) | static int stbi__getn(stbi__context *s, stbi_uc *buffer, int n)
function stbi__get16be (line 1470) | static int stbi__get16be(stbi__context *s)
function stbi__uint32 (line 1476) | static stbi__uint32 stbi__get32be(stbi__context *s)
function stbi__get16le (line 1485) | static int stbi__get16le(stbi__context *s)
function stbi__uint32 (line 1493) | static stbi__uint32 stbi__get32le(stbi__context *s)
function stbi_uc (line 1514) | static stbi_uc stbi__compute_y(int r, int g, int b)
function stbi__uint16 (line 1563) | static stbi__uint16 stbi__compute_y_16(int r, int g, int b)
function stbi__uint16 (line 1568) | static stbi__uint16 *stbi__convert_format16(stbi__uint16 *data, int img_...
function stbi_uc (line 1635) | static stbi_uc *stbi__hdr_to_ldr(float *data, int x, int y, int comp)
type stbi__huffman (line 1689) | typedef struct
type stbi__jpeg (line 1700) | typedef struct
function stbi__build_huffman (line 1754) | static int stbi__build_huffman(stbi__huffman *h, int *count)
function stbi__build_fast_ac (line 1798) | static void stbi__build_fast_ac(stbi__int16 *fast_ac, stbi__huffman *h)
function stbi__grow_buffer_unsafe (line 1823) | static void stbi__grow_buffer_unsafe(stbi__jpeg *j)
function stbi_inline (line 1845) | stbi_inline static int stbi__jpeg_huff_decode(stbi__jpeg *j, stbi__huffm...
function stbi_inline (line 1899) | stbi_inline static int stbi__extend_receive(stbi__jpeg *j, int n)
function stbi_inline (line 1915) | stbi_inline static int stbi__jpeg_get_bits(stbi__jpeg *j, int n)
function stbi_inline (line 1926) | stbi_inline static int stbi__jpeg_get_bit(stbi__jpeg *j)
function stbi__jpeg_decode_block (line 1954) | static int stbi__jpeg_decode_block(stbi__jpeg *j, short data[64], stbi__...
function stbi__jpeg_decode_block_prog_dc (line 2006) | static int stbi__jpeg_decode_block_prog_dc(stbi__jpeg *j, short data[64]...
function stbi__jpeg_decode_block_prog_ac (line 2033) | static int stbi__jpeg_decode_block_prog_ac(stbi__jpeg *j, short data[64]...
function stbi_inline (line 2153) | stbi_inline static stbi_uc stbi__clamp(int x)
function stbi__idct_block (line 2204) | static void stbi__idct_block(stbi_uc *out, int out_stride, short data[64])
function stbi__idct_simd (line 2267) | static void stbi__idct_simd(stbi_uc *out, int out_stride, short data[64])
function stbi__idct_simd (line 2448) | static void stbi__idct_simd(stbi_uc *out, int out_stride, short data[64])
function stbi_uc (line 2656) | static stbi_uc stbi__get_marker(stbi__jpeg *j)
function stbi__jpeg_reset (line 2673) | static void stbi__jpeg_reset(stbi__jpeg *j)
function stbi__parse_entropy_coded_data (line 2686) | static int stbi__parse_entropy_coded_data(stbi__jpeg *z)
function stbi__jpeg_dequantize (line 2810) | static void stbi__jpeg_dequantize(short *data, stbi__uint16 *dequant)
function stbi__jpeg_finish (line 2817) | static void stbi__jpeg_finish(stbi__jpeg *z)
function stbi__process_marker (line 2836) | static int stbi__process_marker(stbi__jpeg *z, int m)
function stbi__process_scan_header (line 2939) | static int stbi__process_scan_header(stbi__jpeg *z)
function stbi__free_jpeg_components (line 2978) | static int stbi__free_jpeg_components(stbi__jpeg *z, int ncomp, int why)
function stbi__process_frame_header (line 3000) | static int stbi__process_frame_header(stbi__jpeg *z, int scan)
function stbi__decode_jpeg_header (line 3092) | static int stbi__decode_jpeg_header(stbi__jpeg *z, int scan)
function stbi__decode_jpeg_image (line 3117) | static int stbi__decode_jpeg_image(stbi__jpeg *j)
type stbi_uc (line 3159) | typedef stbi_uc *(*resample_row_func)(stbi_uc *out, stbi_uc *in0, stbi_u...
function stbi_uc (line 3164) | static stbi_uc *resample_row_1(stbi_uc *out, stbi_uc *in_near, stbi_uc *...
function stbi_uc (line 3173) | static stbi_uc* stbi__resample_row_v_2(stbi_uc *out, stbi_uc *in_near, s...
function stbi_uc (line 3183) | static stbi_uc* stbi__resample_row_h_2(stbi_uc *out, stbi_uc *in_near, ...
function stbi_uc (line 3213) | static stbi_uc *stbi__resample_row_hv_2(stbi_uc *out, stbi_uc *in_near, ...
function stbi_uc (line 3238) | static stbi_uc *stbi__resample_row_hv_2_simd(stbi_uc *out, stbi_uc *in_n...
function stbi_uc (line 3354) | static stbi_uc *stbi__resample_row_generic(stbi_uc *out, stbi_uc *in_nea...
function stbi__YCbCr_to_RGB_row (line 3368) | static void stbi__YCbCr_to_RGB_row(stbi_uc *out, const stbi_uc *y, const...
function stbi__YCbCr_to_RGB_simd (line 3394) | static void stbi__YCbCr_to_RGB_simd(stbi_uc *out, stbi_uc const *y, stbi...
function stbi__setup_jpeg (line 3529) | static void stbi__setup_jpeg(stbi__jpeg *j)
function stbi__cleanup_jpeg (line 3551) | static void stbi__cleanup_jpeg(stbi__jpeg *j)
type stbi__resample (line 3556) | typedef struct
function stbi_uc (line 3567) | static stbi_uc stbi__blinn_8x8(stbi_uc x, stbi_uc y)
function stbi_uc (line 3573) | static stbi_uc *load_jpeg_image(stbi__jpeg *z, int *out_x, int *out_y, i...
function stbi__jpeg_test (line 3744) | static int stbi__jpeg_test(stbi__context *s)
function stbi__jpeg_info_raw (line 3756) | static int stbi__jpeg_info_raw(stbi__jpeg *j, int *x, int *y, int *comp)
function stbi__jpeg_info (line 3768) | static int stbi__jpeg_info(stbi__context *s, int *x, int *y, int *comp)
type stbi__zhuffman (line 3794) | typedef struct
function stbi_inline (line 3804) | stbi_inline static int stbi__bitreverse16(int n)
function stbi_inline (line 3813) | stbi_inline static int stbi__bit_reverse(int v, int bits)
function stbi__zbuild_huffman (line 3821) | static int stbi__zbuild_huffman(stbi__zhuffman *z, const stbi_uc *sizeli...
type stbi__zbuf (line 3874) | typedef struct
function stbi_inline (line 3888) | stbi_inline static stbi_uc stbi__zget8(stbi__zbuf *z)
function stbi__fill_bits (line 3894) | static void stbi__fill_bits(stbi__zbuf *z)
function stbi__zreceive (line 3903) | int stbi__zreceive(stbi__zbuf *z, int n)
function stbi__zhuffman_decode_slowpath (line 3913) | static int stbi__zhuffman_decode_slowpath(stbi__zbuf *a, stbi__zhuffman *z)
function stbi_inline (line 3931) | stbi_inline static int stbi__zhuffman_decode(stbi__zbuf *a, stbi__zhuffm...
function stbi__zexpand (line 3945) | static int stbi__zexpand(stbi__zbuf *z, char *zout, int n) // need to m...
function stbi__parse_huffman_block (line 3978) | static int stbi__parse_huffman_block(stbi__zbuf *a)
function stbi__compute_huffman_codes (line 4020) | static int stbi__compute_huffman_codes(stbi__zbuf *a)
function stbi__parse_uncompressed_block (line 4069) | static int stbi__parse_uncompressed_block(stbi__zbuf *a)
function stbi__parse_zlib_header (line 4098) | static int stbi__parse_zlib_header(stbi__zbuf *a)
function stbi__parse_zlib (line 4140) | static int stbi__parse_zlib(stbi__zbuf *a, int parse_header)
function stbi__do_zlib (line 4168) | static int stbi__do_zlib(stbi__zbuf *a, char *obuf, int olen, int exp, i...
function STBIDEF (line 4178) | STBIDEF char *stbi_zlib_decode_malloc_guesssize(const char *buffer, int ...
function STBIDEF (line 4194) | STBIDEF char *stbi_zlib_decode_malloc(char const *buffer, int len, int *...
function STBIDEF (line 4199) | STBIDEF char *stbi_zlib_decode_malloc_guesssize_headerflag(const char *b...
function STBIDEF (line 4215) | STBIDEF int stbi_zlib_decode_buffer(char *obuffer, int olen, char const ...
function STBIDEF (line 4226) | STBIDEF char *stbi_zlib_decode_noheader_malloc(char const *buffer, int l...
function STBIDEF (line 4242) | STBIDEF int stbi_zlib_decode_noheader_buffer(char *obuffer, int olen, co...
type stbi__pngchunk (line 4265) | typedef struct
function stbi__pngchunk (line 4271) | static stbi__pngchunk stbi__get_chunk_header(stbi__context *s)
function stbi__check_png_header (line 4279) | static int stbi__check_png_header(stbi__context *s)
type stbi__png (line 4288) | typedef struct
function stbi__paeth (line 4316) | static int stbi__paeth(int a, int b, int c)
function stbi__create_png_image_raw (line 4330) | static int stbi__create_png_image_raw(stbi__png *a, stbi_uc *raw, stbi__...
function stbi__create_png_image (line 4542) | static int stbi__create_png_image(stbi__png *a, stbi_uc *image_data, stb...
function stbi__compute_transparency (line 4586) | static int stbi__compute_transparency(stbi__png *z, stbi_uc tc[3], int o...
function stbi__compute_transparency16 (line 4611) | static int stbi__compute_transparency16(stbi__png *z, stbi__uint16 tc[3]...
function stbi__expand_png_palette (line 4636) | static int stbi__expand_png_palette(stbi__png *a, stbi_uc *palette, int ...
function STBIDEF (line 4676) | STBIDEF void stbi_set_unpremultiply_on_load(int flag_true_if_should_unpr...
function STBIDEF (line 4681) | STBIDEF void stbi_convert_iphone_png_to_rgb(int flag_true_if_should_conv...
function stbi__de_iphone (line 4686) | static void stbi__de_iphone(stbi__png *z)
function stbi__parse_png_file (line 4731) | static int stbi__parse_png_file(stbi__png *z, int scan, int req_comp)
function stbi__png_test (line 4940) | static int stbi__png_test(stbi__context *s)
function stbi__png_info_raw (line 4948) | static int stbi__png_info_raw(stbi__png *p, int *x, int *y, int *comp)
function stbi__png_info (line 4960) | static int stbi__png_info(stbi__context *s, int *x, int *y, int *comp)
function stbi__png_is16 (line 4967) | static int stbi__png_is16(stbi__context *s)
function stbi__bmp_test_raw (line 4984) | static int stbi__bmp_test_raw(stbi__context *s)
function stbi__bmp_test (line 4999) | static int stbi__bmp_test(stbi__context *s)
function stbi__high_bit (line 5008) | static int stbi__high_bit(unsigned int z)
function stbi__bitcount (line 5020) | static int stbi__bitcount(unsigned int a)
function stbi__shiftsigned (line 5033) | static int stbi__shiftsigned(int v, int shift, int bits)
type stbi__bmp_data (line 5053) | typedef struct
function stbi__tga_get_comp (line 5323) | static int stbi__tga_get_comp(int bits_per_pixel, int is_grey, int* is_r...
function stbi__tga_info (line 5339) | static int stbi__tga_info(stbi__context *s, int *x, int *y, int *comp)
function stbi__tga_test (line 5404) | static int stbi__tga_test(stbi__context *s)
function stbi__tga_read_rgb16 (line 5436) | static void stbi__tga_read_rgb16(stbi__context *s, stbi_uc* out)
function stbi__psd_test (line 5654) | static int stbi__psd_test(stbi__context *s)
function stbi__psd_decode_rle (line 5661) | static int stbi__psd_decode_rle(stbi__context *s, stbi_uc *p, int pixelC...
function stbi__pic_is4 (line 5906) | static int stbi__pic_is4(stbi__context *s,const char *str)
function stbi__pic_test_core (line 5916) | static int stbi__pic_test_core(stbi__context *s)
type stbi__pic_packet (line 5932) | typedef struct
function stbi_uc (line 5937) | static stbi_uc *stbi__readval(stbi__context *s, int channel, stbi_uc *dest)
function stbi__copyval (line 5951) | static void stbi__copyval(int channel,stbi_uc *dest,const stbi_uc *src)
function stbi_uc (line 5960) | static stbi_uc *stbi__pic_load_core(stbi__context *s,int width,int heigh...
function stbi__pic_test (line 6106) | static int stbi__pic_test(stbi__context *s)
type stbi__gif_lzw (line 6118) | typedef struct
type stbi__gif (line 6125) | typedef struct
function stbi__gif_test_raw (line 6145) | static int stbi__gif_test_raw(stbi__context *s)
function stbi__gif_test (line 6155) | static int stbi__gif_test(stbi__context *s)
function stbi__gif_parse_colortable (line 6162) | static void stbi__gif_parse_colortable(stbi__context *s, stbi_uc pal[256...
function stbi__gif_header (line 6173) | static int stbi__gif_header(stbi__context *s, stbi__gif *g, int *comp, i...
function stbi__gif_info_raw (line 6201) | static int stbi__gif_info_raw(stbi__context *s, int *x, int *y, int *comp)
function stbi__out_gif_code (line 6215) | static void stbi__out_gif_code(stbi__gif *g, stbi__uint16 code)
function stbi_uc (line 6252) | static stbi_uc *stbi__process_gif_raster(stbi__context *s, stbi__gif *g)
function stbi_uc (line 6339) | static stbi_uc *stbi__gif_load_next(stbi__context *s, stbi__gif *g, int ...
function stbi__gif_info (line 6588) | static int stbi__gif_info(stbi__context *s, int *x, int *y, int *comp)
function stbi__hdr_test_core (line 6598) | static int stbi__hdr_test_core(stbi__context *s, const char *signature)
function stbi__hdr_test (line 6608) | static int stbi__hdr_test(stbi__context* s)
function stbi__hdr_convert (line 6642) | static void stbi__hdr_convert(float *output, stbi_uc *input, int req_comp)
function stbi__hdr_info (line 6797) | static int stbi__hdr_info(stbi__context *s, int *x, int *y, int *comp)
function stbi__bmp_info (line 6843) | static int stbi__bmp_info(stbi__context *s, int *x, int *y, int *comp)
function stbi__psd_info (line 6861) | static int stbi__psd_info(stbi__context *s, int *x, int *y, int *comp)
function stbi__psd_is16 (line 6896) | static int stbi__psd_is16(stbi__context *s)
function stbi__pic_info (line 6925) | static int stbi__pic_info(stbi__context *s, int *x, int *y, int *comp)
function stbi__pnm_test (line 6997) | static int stbi__pnm_test(stbi__context *s)
function stbi__pnm_isspace (line 7035) | static int stbi__pnm_isspace(char c)
function stbi__pnm_skip_whitespace (line 7040) | static void stbi__pnm_skip_whitespace(stbi__context *s, char *c)
function stbi__pnm_isdigit (line 7054) | static int stbi__pnm_isdigit(char c)
function stbi__pnm_getinteger (line 7059) | static int stbi__pnm_getinteger(stbi__context *s, char *c)
function stbi__pnm_info (line 7071) | static int stbi__pnm_info(stbi__context *s, int *x, int *y, int *comp)
function stbi__info_main (line 7110) | static int stbi__info_main(stbi__context *s, int *x, int *y, int *comp)
function stbi__is_16_main (line 7152) | static int stbi__is_16_main(stbi__context *s)
function STBIDEF (line 7166) | STBIDEF int stbi_info(char const *filename, int *x, int *y, int *comp)
function STBIDEF (line 7176) | STBIDEF int stbi_info_from_file(FILE *f, int *x, int *y, int *comp)
function STBIDEF (line 7187) | STBIDEF int stbi_is_16_bit(char const *filename)
function STBIDEF (line 7197) | STBIDEF int stbi_is_16_bit_from_file(FILE *f)
function STBIDEF (line 7209) | STBIDEF int stbi_info_from_memory(stbi_uc const *buffer, int len, int *x...
function STBIDEF (line 7216) | STBIDEF int stbi_info_from_callbacks(stbi_io_callbacks const *c, void *u...
function STBIDEF (line 7223) | STBIDEF int stbi_is_16_bit_from_memory(stbi_uc const *buffer, int len)
function STBIDEF (line 7230) | STBIDEF int stbi_is_16_bit_from_callbacks(stbi_io_callbacks const *c, vo...
FILE: hw2/sppm/texture.hpp
class Texture (line 6) | class Texture {
method Texture (line 14) | Texture(const Texture&t): brdf(t.brdf), filename(t.filename), color(t....
method Texture (line 20) | Texture(std::string _, ld b, P3 col, P3 e, Refl_t r): brdf(b), filenam...
method getcol (line 26) | std::pair<Refl_t, P3> getcol(ld a, ld b) {
FILE: hw2/sppm/utils.hpp
type Refl_t (line 20) | enum Refl_t { DIFF, SPEC, REFR }
function gamma_trans (line 22) | int gamma_trans(ld x) {return int(.5 + 255 * pow(x < 0 ? 0 : x > 1 ? 1 :...
function ld (line 23) | ld sqr(ld x) {return x * x;}
FILE: hw2/sppm/vec3.hpp
type P3 (line 6) | struct P3{
method P3 (line 8) | P3(ld x_=0, ld y_=0, ld z_=0): x(x_), y(y_), z(z_) {}
method P3 (line 9) | P3 operator-() const {return P3(-x, -y, -z);}
method P3 (line 10) | P3 operator+(const P3&a) const {return P3(x+a.x, y+a.y, z+a.z);}
method P3 (line 11) | P3 operator-(const P3&a) const {return P3(x-a.x, y-a.y, z-a.z);}
method P3 (line 12) | P3 operator+(ld p) const {return P3(x+p, y+p, z+p);}
method P3 (line 13) | P3 operator-(ld p) const {return P3(x-p, y-p, z-p);}
method P3 (line 14) | P3 operator*(ld p) const {return P3(x*p, y*p, z*p);}
method P3 (line 15) | P3 operator/(ld p) const {return P3(x/p, y/p, z/p);}
method P3 (line 18) | P3&operator+=(const P3&a) {return *this = *this + a;}
method P3 (line 19) | P3&operator-=(const P3&a) {return *this = *this - a;}
method P3 (line 20) | P3&operator+=(ld p) {return *this = *this + p;}
method P3 (line 21) | P3&operator-=(ld p) {return *this = *this - p;}
method P3 (line 22) | P3&operator*=(ld p) {return *this = *this * p;}
method P3 (line 23) | P3&operator/=(ld p) {return *this = *this / p;}
method ld (line 24) | ld operator|(const P3&a) const {return x*a.x + y*a.y + z*a.z;}
method ld (line 25) | ld dot(const P3&a) const {return x*a.x + y*a.y + z*a.z;}
method ld (line 26) | ld max() const {return x>y&&x>z?x:y>z?y:z;}
method P3 (line 27) | P3 max(const P3&a) const {return P3(std::max(x,a.x), std::max(y,a.y), ...
method P3 (line 28) | P3 min(const P3&a) const {return P3(std::min(x,a.x), std::min(y,a.y), ...
method ld (line 29) | ld len() const {return sqrt(x*x + y*y + z*z);}
method ld (line 30) | ld len2() const {return x*x + y*y + z*z;}
method P3 (line 31) | P3 mult(const P3&a) const {return P3(x*a.x, y*a.y, z*a.z);}
method P3 (line 32) | P3 operator&(const P3&a) const {return P3(y*a.z-z*a.y, z*a.x-x*a.z, x*...
method P3 (line 33) | P3 cross(const P3&a) const {return P3(y*a.z-z*a.y, z*a.x-x*a.z, x*a.y-...
method P3 (line 34) | P3 norm() const {return (*this)/len();}
method P3 (line 35) | P3 clip(ld r0=0, ld r1=1) const {return P3(x>r1?r1:x<r0?r0:x, y>r1?r1:...
method P3 (line 36) | P3 reflect(const P3&n) const {return (*this)-n*2.*n.dot(*this);}
method P3 (line 37) | P3 refract(const P3&n, ld ni, ld nr) const { // smallPT1.ppt Page#72
method print (line 48) | void print() const {std::cout << x << " " << y << " " << z << std::endl;}
function P3 (line 51) | P3 min(P3 a, P3 b) {return P3(std::min(a.x, b.x), std::min(a.y, b.y), st...
method P3 (line 8) | P3(ld x_=0, ld y_=0, ld z_=0): x(x_), y(y_), z(z_) {}
method P3 (line 9) | P3 operator-() const {return P3(-x, -y, -z);}
method P3 (line 10) | P3 operator+(const P3&a) const {return P3(x+a.x, y+a.y, z+a.z);}
method P3 (line 11) | P3 operator-(const P3&a) const {return P3(x-a.x, y-a.y, z-a.z);}
method P3 (line 12) | P3 operator+(ld p) const {return P3(x+p, y+p, z+p);}
method P3 (line 13) | P3 operator-(ld p) const {return P3(x-p, y-p, z-p);}
method P3 (line 14) | P3 operator*(ld p) const {return P3(x*p, y*p, z*p);}
method P3 (line 15) | P3 operator/(ld p) const {return P3(x/p, y/p, z/p);}
method P3 (line 18) | P3&operator+=(const P3&a) {return *this = *this + a;}
method P3 (line 19) | P3&operator-=(const P3&a) {return *this = *this - a;}
method P3 (line 20) | P3&operator+=(ld p) {return *this = *this + p;}
method P3 (line 21) | P3&operator-=(ld p) {return *this = *this - p;}
method P3 (line 22) | P3&operator*=(ld p) {return *this = *this * p;}
method P3 (line 23) | P3&operator/=(ld p) {return *this = *this / p;}
method ld (line 24) | ld operator|(const P3&a) const {return x*a.x + y*a.y + z*a.z;}
method ld (line 25) | ld dot(const P3&a) const {return x*a.x + y*a.y + z*a.z;}
method ld (line 26) | ld max() const {return x>y&&x>z?x:y>z?y:z;}
method P3 (line 27) | P3 max(const P3&a) const {return P3(std::max(x,a.x), std::max(y,a.y), ...
method P3 (line 28) | P3 min(const P3&a) const {return P3(std::min(x,a.x), std::min(y,a.y), ...
method ld (line 29) | ld len() const {return sqrt(x*x + y*y + z*z);}
method ld (line 30) | ld len2() const {return x*x + y*y + z*z;}
method P3 (line 31) | P3 mult(const P3&a) const {return P3(x*a.x, y*a.y, z*a.z);}
method P3 (line 32) | P3 operator&(const P3&a) const {return P3(y*a.z-z*a.y, z*a.x-x*a.z, x*...
method P3 (line 33) | P3 cross(const P3&a) const {return P3(y*a.z-z*a.y, z*a.x-x*a.z, x*a.y-...
method P3 (line 34) | P3 norm() const {return (*this)/len();}
method P3 (line 35) | P3 clip(ld r0=0, ld r1=1) const {return P3(x>r1?r1:x<r0?r0:x, y>r1?r1:...
method P3 (line 36) | P3 reflect(const P3&n) const {return (*this)-n*2.*n.dot(*this);}
method P3 (line 37) | P3 refract(const P3&n, ld ni, ld nr) const { // smallPT1.ppt Page#72
method print (line 48) | void print() const {std::cout << x << " " << y << " " << z << std::endl;}
function P3 (line 52) | P3 max(P3 a, P3 b) {return P3(std::max(a.x, b.x), std::max(a.y, b.y), st...
method P3 (line 8) | P3(ld x_=0, ld y_=0, ld z_=0): x(x_), y(y_), z(z_) {}
method P3 (line 9) | P3 operator-() const {return P3(-x, -y, -z);}
method P3 (line 10) | P3 operator+(const P3&a) const {return P3(x+a.x, y+a.y, z+a.z);}
method P3 (line 11) | P3 operator-(const P3&a) const {return P3(x-a.x, y-a.y, z-a.z);}
method P3 (line 12) | P3 operator+(ld p) const {return P3(x+p, y+p, z+p);}
method P3 (line 13) | P3 operator-(ld p) const {return P3(x-p, y-p, z-p);}
method P3 (line 14) | P3 operator*(ld p) const {return P3(x*p, y*p, z*p);}
method P3 (line 15) | P3 operator/(ld p) const {return P3(x/p, y/p, z/p);}
method P3 (line 18) | P3&operator+=(const P3&a) {return *this = *this + a;}
method P3 (line 19) | P3&operator-=(const P3&a) {return *this = *this - a;}
method P3 (line 20) | P3&operator+=(ld p) {return *this = *this + p;}
method P3 (line 21) | P3&operator-=(ld p) {return *this = *this - p;}
method P3 (line 22) | P3&operator*=(ld p) {return *this = *this * p;}
method P3 (line 23) | P3&operator/=(ld p) {return *this = *this / p;}
method ld (line 24) | ld operator|(const P3&a) const {return x*a.x + y*a.y + z*a.z;}
method ld (line 25) | ld dot(const P3&a) const {return x*a.x + y*a.y + z*a.z;}
method ld (line 26) | ld max() const {return x>y&&x>z?x:y>z?y:z;}
method P3 (line 27) | P3 max(const P3&a) const {return P3(std::max(x,a.x), std::max(y,a.y), ...
method P3 (line 28) | P3 min(const P3&a) const {return P3(std::min(x,a.x), std::min(y,a.y), ...
method ld (line 29) | ld len() const {return sqrt(x*x + y*y + z*z);}
method ld (line 30) | ld len2() const {return x*x + y*y + z*z;}
method P3 (line 31) | P3 mult(const P3&a) const {return P3(x*a.x, y*a.y, z*a.z);}
method P3 (line 32) | P3 operator&(const P3&a) const {return P3(y*a.z-z*a.y, z*a.x-x*a.z, x*...
method P3 (line 33) | P3 cross(const P3&a) const {return P3(y*a.z-z*a.y, z*a.x-x*a.z, x*a.y-...
method P3 (line 34) | P3 norm() const {return (*this)/len();}
method P3 (line 35) | P3 clip(ld r0=0, ld r1=1) const {return P3(x>r1?r1:x<r0?r0:x, y>r1?r1:...
method P3 (line 36) | P3 reflect(const P3&n) const {return (*this)-n*2.*n.dot(*this);}
method P3 (line 37) | P3 refract(const P3&n, ld ni, ld nr) const { // smallPT1.ppt Page#72
method print (line 48) | void print() const {std::cout << x << " " << y << " " << z << std::endl;}
FILE: hw3/MVC/main.cpp
type P (line 7) | struct P{
method P (line 11) | P operator+(PP a)const {return (P){x+a.x,y+a.y};}
method P (line 12) | P operator-(PP a)const {return (P){x-a.x,y-a.y};}
method P (line 13) | P operator*(double p){return (P){x*p,y*p};}
method len2 (line 16) | double len2() const {return x*x+y*y;}
method noise (line 17) | void noise(double r=1e-2){x+=(rand()&1?1.:-1.)*rand()/2147483647*r;y+=...
type Gauss (line 19) | namespace Gauss
function pr (line 23) | void pr(){
function solve (line 29) | void solve(){
type Mat (line 43) | struct Mat{
method transform (line 45) | double transform(P p) {return p.x * m[0] + p.y * m[1] + m[2];}
function Calc_Transform_Matrix (line 47) | void Calc_Transform_Matrix(Mat&f, P p1, P p2, P p3, double c0, double c1...
function intri (line 66) | bool intri(P p, P a, P b, P c)
type IMG (line 76) | struct IMG{
method IMG (line 81) | IMG(): img(NULL), w(0), h(0), c(0) {}
method IMG (line 82) | IMG(int _h, int _w, int _c=1)
method init (line 86) | void init(int _h, int _w, int _c)
method IMG (line 95) | IMG(std::string _): filename(_) {
method stat (line 103) | void stat(int lb = 0){
method write (line 112) | void write(const char* output_filename){
method print (line 118) | void print(char* s)
type Solver (line 138) | struct Solver{
method resize (line 144) | void resize(int _size)
method additem (line 156) | void additem(int _id, int _x=0){
method addconst (line 162) | void addconst(int _b) {b[id] += _b;}
method addvar (line 163) | void addvar(int id2) {a[id][++a[id][0]] = id2;}
method print (line 164) | void print() {
method iter (line 175) | void iter() {
function inside (line 240) | bool inside(P p) {
function getMesh (line 254) | void getMesh(const std::vector<Point>& curve) {
function getTanAngle (line 291) | double getTanAngle(const Point& a_, const Point& b_, const Point& c_)
function getLength (line 300) | double getLength(const Point& a, const Point& b)
function main (line 305) | int main(int argc, char const *argv[])
FILE: hw3/MVC/stb_image.h
type stbi_uc (line 322) | typedef unsigned char stbi_uc;
type stbi_us (line 323) | typedef unsigned short stbi_us;
type stbi_io_callbacks (line 344) | typedef struct
type stbi__uint16 (line 541) | typedef unsigned short stbi__uint16;
type stbi__int16 (line 542) | typedef signed short stbi__int16;
type stbi__uint32 (line 543) | typedef unsigned int stbi__uint32;
type stbi__int32 (line 544) | typedef signed int stbi__int32;
type stbi__uint16 (line 547) | typedef uint16_t stbi__uint16;
type stbi__int16 (line 548) | typedef int16_t stbi__int16;
type stbi__uint32 (line 549) | typedef uint32_t stbi__uint32;
type stbi__int32 (line 550) | typedef int32_t stbi__int32;
function stbi__cpuid3 (line 631) | static int stbi__cpuid3(void)
function stbi__sse2_available (line 652) | static int stbi__sse2_available(void)
function stbi__sse2_available (line 660) | static int stbi__sse2_available(void)
type stbi__context (line 691) | typedef struct
function stbi__start_mem (line 711) | static void stbi__start_mem(stbi__context *s, stbi_uc const *buffer, int...
function stbi__start_callbacks (line 720) | static void stbi__start_callbacks(stbi__context *s, stbi_io_callbacks *c...
function stbi__stdio_read (line 733) | static int stbi__stdio_read(void *user, char *data, int size)
function stbi__stdio_skip (line 738) | static void stbi__stdio_skip(void *user, int n)
function stbi__stdio_eof (line 743) | static int stbi__stdio_eof(void *user)
function stbi__start_file (line 755) | static void stbi__start_file(stbi__context *s, FILE *f)
function stbi__rewind (line 764) | static void stbi__rewind(stbi__context *s)
type stbi__result_info (line 779) | typedef struct
function STBIDEF (line 846) | STBIDEF const char *stbi_failure_reason(void)
function stbi__err (line 851) | static int stbi__err(const char *str)
function stbi__addsizes_valid (line 874) | static int stbi__addsizes_valid(int a, int b)
function stbi__mul2sizes_valid (line 886) | static int stbi__mul2sizes_valid(int a, int b)
function stbi__mad2sizes_valid (line 895) | static int stbi__mad2sizes_valid(int a, int b, int add)
function stbi__mad3sizes_valid (line 901) | static int stbi__mad3sizes_valid(int a, int b, int c, int add)
function stbi__mad4sizes_valid (line 909) | static int stbi__mad4sizes_valid(int a, int b, int c, int d, int add)
function STBIDEF (line 952) | STBIDEF void stbi_image_free(void *retval_from_stbi_load)
function STBIDEF (line 967) | STBIDEF void stbi_set_flip_vertically_on_load(int flag_true_if_should_flip)
function stbi_uc (line 1017) | static stbi_uc *stbi__convert_16_to_8(stbi__uint16 *orig, int w, int h, ...
function stbi__uint16 (line 1033) | static stbi__uint16 *stbi__convert_8_to_16(stbi_uc *orig, int w, int h, ...
function stbi__vertical_flip (line 1049) | static void stbi__vertical_flip(void *image, int w, int h, int bytes_per...
function stbi__vertical_flip_slices (line 1073) | static void stbi__vertical_flip_slices(void *image, int w, int h, int z,...
function stbi__uint16 (line 1109) | static stbi__uint16 *stbi__load_and_postprocess_16bit(stbi__context *s, ...
function stbi__float_postprocess (line 1135) | static void stbi__float_postprocess(float *result, int *x, int *y, int *...
function FILE (line 1146) | static FILE *stbi__fopen(char const *filename, char const *mode)
function STBIDEF (line 1159) | STBIDEF stbi_uc *stbi_load(char const *filename, int *x, int *y, int *co...
function STBIDEF (line 1169) | STBIDEF stbi_uc *stbi_load_from_file(FILE *f, int *x, int *y, int *comp,...
function STBIDEF (line 1182) | STBIDEF stbi__uint16 *stbi_load_from_file_16(FILE *f, int *x, int *y, in...
function STBIDEF (line 1195) | STBIDEF stbi_us *stbi_load_16(char const *filename, int *x, int *y, int ...
function STBIDEF (line 1208) | STBIDEF stbi_us *stbi_load_16_from_memory(stbi_uc const *buffer, int len...
function STBIDEF (line 1215) | STBIDEF stbi_us *stbi_load_16_from_callbacks(stbi_io_callbacks const *cl...
function STBIDEF (line 1222) | STBIDEF stbi_uc *stbi_load_from_memory(stbi_uc const *buffer, int len, i...
function STBIDEF (line 1229) | STBIDEF stbi_uc *stbi_load_from_callbacks(stbi_io_callbacks const *clbk,...
function STBIDEF (line 1237) | STBIDEF stbi_uc *stbi_load_gif_from_memory(stbi_uc const *buffer, int le...
function STBIDEF (line 1271) | STBIDEF float *stbi_loadf_from_memory(stbi_uc const *buffer, int len, in...
function STBIDEF (line 1278) | STBIDEF float *stbi_loadf_from_callbacks(stbi_io_callbacks const *clbk, ...
function STBIDEF (line 1286) | STBIDEF float *stbi_loadf(char const *filename, int *x, int *y, int *com...
function STBIDEF (line 1296) | STBIDEF float *stbi_loadf_from_file(FILE *f, int *x, int *y, int *comp, ...
function STBIDEF (line 1310) | STBIDEF int stbi_is_hdr_from_memory(stbi_uc const *buffer, int len)
function STBIDEF (line 1324) | STBIDEF int stbi_is_hdr (char const *filename)
function STBIDEF (line 1335) | STBIDEF int stbi_is_hdr_from_file(FILE *f)
function STBIDEF (line 1352) | STBIDEF int stbi_is_hdr_from_callbacks(stbi_io_callbacks const *clb...
function STBIDEF (line 1368) | STBIDEF void stbi_ldr_to_hdr_gamma(float gamma) { stbi__l2h_gamma = ga...
function STBIDEF (line 1369) | STBIDEF void stbi_ldr_to_hdr_scale(float scale) { stbi__l2h_scale = sc...
function STBIDEF (line 1374) | STBIDEF void stbi_hdr_to_ldr_gamma(float gamma) { stbi__h2l_gamma_i = ...
function STBIDEF (line 1375) | STBIDEF void stbi_hdr_to_ldr_scale(float scale) { stbi__h2l_scale_i = ...
function stbi__refill_buffer (line 1390) | static void stbi__refill_buffer(stbi__context *s)
function stbi_inline (line 1406) | stbi_inline static stbi_uc stbi__get8(stbi__context *s)
function stbi_inline (line 1417) | stbi_inline static int stbi__at_eof(stbi__context *s)
function stbi__skip (line 1429) | static void stbi__skip(stbi__context *s, int n)
function stbi__getn (line 1446) | static int stbi__getn(stbi__context *s, stbi_uc *buffer, int n)
function stbi__get16be (line 1470) | static int stbi__get16be(stbi__context *s)
function stbi__uint32 (line 1476) | static stbi__uint32 stbi__get32be(stbi__context *s)
function stbi__get16le (line 1485) | static int stbi__get16le(stbi__context *s)
function stbi__uint32 (line 1493) | static stbi__uint32 stbi__get32le(stbi__context *s)
function stbi_uc (line 1514) | static stbi_uc stbi__compute_y(int r, int g, int b)
function stbi__uint16 (line 1563) | static stbi__uint16 stbi__compute_y_16(int r, int g, int b)
function stbi__uint16 (line 1568) | static stbi__uint16 *stbi__convert_format16(stbi__uint16 *data, int img_...
function stbi_uc (line 1635) | static stbi_uc *stbi__hdr_to_ldr(float *data, int x, int y, int comp)
type stbi__huffman (line 1689) | typedef struct
type stbi__jpeg (line 1700) | typedef struct
function stbi__build_huffman (line 1754) | static int stbi__build_huffman(stbi__huffman *h, int *count)
function stbi__build_fast_ac (line 1798) | static void stbi__build_fast_ac(stbi__int16 *fast_ac, stbi__huffman *h)
function stbi__grow_buffer_unsafe (line 1823) | static void stbi__grow_buffer_unsafe(stbi__jpeg *j)
function stbi_inline (line 1845) | stbi_inline static int stbi__jpeg_huff_decode(stbi__jpeg *j, stbi__huffm...
function stbi_inline (line 1899) | stbi_inline static int stbi__extend_receive(stbi__jpeg *j, int n)
function stbi_inline (line 1915) | stbi_inline static int stbi__jpeg_get_bits(stbi__jpeg *j, int n)
function stbi_inline (line 1926) | stbi_inline static int stbi__jpeg_get_bit(stbi__jpeg *j)
function stbi__jpeg_decode_block (line 1954) | static int stbi__jpeg_decode_block(stbi__jpeg *j, short data[64], stbi__...
function stbi__jpeg_decode_block_prog_dc (line 2006) | static int stbi__jpeg_decode_block_prog_dc(stbi__jpeg *j, short data[64]...
function stbi__jpeg_decode_block_prog_ac (line 2033) | static int stbi__jpeg_decode_block_prog_ac(stbi__jpeg *j, short data[64]...
function stbi_inline (line 2153) | stbi_inline static stbi_uc stbi__clamp(int x)
function stbi__idct_block (line 2204) | static void stbi__idct_block(stbi_uc *out, int out_stride, short data[64])
function stbi__idct_simd (line 2267) | static void stbi__idct_simd(stbi_uc *out, int out_stride, short data[64])
function stbi__idct_simd (line 2448) | static void stbi__idct_simd(stbi_uc *out, int out_stride, short data[64])
function stbi_uc (line 2656) | static stbi_uc stbi__get_marker(stbi__jpeg *j)
function stbi__jpeg_reset (line 2673) | static void stbi__jpeg_reset(stbi__jpeg *j)
function stbi__parse_entropy_coded_data (line 2686) | static int stbi__parse_entropy_coded_data(stbi__jpeg *z)
function stbi__jpeg_dequantize (line 2810) | static void stbi__jpeg_dequantize(short *data, stbi__uint16 *dequant)
function stbi__jpeg_finish (line 2817) | static void stbi__jpeg_finish(stbi__jpeg *z)
function stbi__process_marker (line 2836) | static int stbi__process_marker(stbi__jpeg *z, int m)
function stbi__process_scan_header (line 2939) | static int stbi__process_scan_header(stbi__jpeg *z)
function stbi__free_jpeg_components (line 2978) | static int stbi__free_jpeg_components(stbi__jpeg *z, int ncomp, int why)
function stbi__process_frame_header (line 3000) | static int stbi__process_frame_header(stbi__jpeg *z, int scan)
function stbi__decode_jpeg_header (line 3092) | static int stbi__decode_jpeg_header(stbi__jpeg *z, int scan)
function stbi__decode_jpeg_image (line 3117) | static int stbi__decode_jpeg_image(stbi__jpeg *j)
type stbi_uc (line 3159) | typedef stbi_uc *(*resample_row_func)(stbi_uc *out, stbi_uc *in0, stbi_u...
function stbi_uc (line 3164) | static stbi_uc *resample_row_1(stbi_uc *out, stbi_uc *in_near, stbi_uc *...
function stbi_uc (line 3173) | static stbi_uc* stbi__resample_row_v_2(stbi_uc *out, stbi_uc *in_near, s...
function stbi_uc (line 3183) | static stbi_uc* stbi__resample_row_h_2(stbi_uc *out, stbi_uc *in_near, ...
function stbi_uc (line 3213) | static stbi_uc *stbi__resample_row_hv_2(stbi_uc *out, stbi_uc *in_near, ...
function stbi_uc (line 3238) | static stbi_uc *stbi__resample_row_hv_2_simd(stbi_uc *out, stbi_uc *in_n...
function stbi_uc (line 3354) | static stbi_uc *stbi__resample_row_generic(stbi_uc *out, stbi_uc *in_nea...
function stbi__YCbCr_to_RGB_row (line 3368) | static void stbi__YCbCr_to_RGB_row(stbi_uc *out, const stbi_uc *y, const...
function stbi__YCbCr_to_RGB_simd (line 3394) | static void stbi__YCbCr_to_RGB_simd(stbi_uc *out, stbi_uc const *y, stbi...
function stbi__setup_jpeg (line 3529) | static void stbi__setup_jpeg(stbi__jpeg *j)
function stbi__cleanup_jpeg (line 3551) | static void stbi__cleanup_jpeg(stbi__jpeg *j)
type stbi__resample (line 3556) | typedef struct
function stbi_uc (line 3567) | static stbi_uc stbi__blinn_8x8(stbi_uc x, stbi_uc y)
function stbi_uc (line 3573) | static stbi_uc *load_jpeg_image(stbi__jpeg *z, int *out_x, int *out_y, i...
function stbi__jpeg_test (line 3744) | static int stbi__jpeg_test(stbi__context *s)
function stbi__jpeg_info_raw (line 3756) | static int stbi__jpeg_info_raw(stbi__jpeg *j, int *x, int *y, int *comp)
function stbi__jpeg_info (line 3768) | static int stbi__jpeg_info(stbi__context *s, int *x, int *y, int *comp)
type stbi__zhuffman (line 3794) | typedef struct
function stbi_inline (line 3804) | stbi_inline static int stbi__bitreverse16(int n)
function stbi_inline (line 3813) | stbi_inline static int stbi__bit_reverse(int v, int bits)
function stbi__zbuild_huffman (line 3821) | static int stbi__zbuild_huffman(stbi__zhuffman *z, const stbi_uc *sizeli...
type stbi__zbuf (line 3874) | typedef struct
function stbi_inline (line 3888) | stbi_inline static stbi_uc stbi__zget8(stbi__zbuf *z)
function stbi__fill_bits (line 3894) | static void stbi__fill_bits(stbi__zbuf *z)
function stbi__zreceive (line 3903) | int stbi__zreceive(stbi__zbuf *z, int n)
function stbi__zhuffman_decode_slowpath (line 3913) | static int stbi__zhuffman_decode_slowpath(stbi__zbuf *a, stbi__zhuffman *z)
function stbi_inline (line 3931) | stbi_inline static int stbi__zhuffman_decode(stbi__zbuf *a, stbi__zhuffm...
function stbi__zexpand (line 3945) | static int stbi__zexpand(stbi__zbuf *z, char *zout, int n) // need to m...
function stbi__parse_huffman_block (line 3978) | static int stbi__parse_huffman_block(stbi__zbuf *a)
function stbi__compute_huffman_codes (line 4020) | static int stbi__compute_huffman_codes(stbi__zbuf *a)
function stbi__parse_uncompressed_block (line 4069) | static int stbi__parse_uncompressed_block(stbi__zbuf *a)
function stbi__parse_zlib_header (line 4098) | static int stbi__parse_zlib_header(stbi__zbuf *a)
function stbi__parse_zlib (line 4140) | static int stbi__parse_zlib(stbi__zbuf *a, int parse_header)
function stbi__do_zlib (line 4168) | static int stbi__do_zlib(stbi__zbuf *a, char *obuf, int olen, int exp, i...
function STBIDEF (line 4178) | STBIDEF char *stbi_zlib_decode_malloc_guesssize(const char *buffer, int ...
function STBIDEF (line 4194) | STBIDEF char *stbi_zlib_decode_malloc(char const *buffer, int len, int *...
function STBIDEF (line 4199) | STBIDEF char *stbi_zlib_decode_malloc_guesssize_headerflag(const char *b...
function STBIDEF (line 4215) | STBIDEF int stbi_zlib_decode_buffer(char *obuffer, int olen, char const ...
function STBIDEF (line 4226) | STBIDEF char *stbi_zlib_decode_noheader_malloc(char const *buffer, int l...
function STBIDEF (line 4242) | STBIDEF int stbi_zlib_decode_noheader_buffer(char *obuffer, int olen, co...
type stbi__pngchunk (line 4265) | typedef struct
function stbi__pngchunk (line 4271) | static stbi__pngchunk stbi__get_chunk_header(stbi__context *s)
function stbi__check_png_header (line 4279) | static int stbi__check_png_header(stbi__context *s)
type stbi__png (line 4288) | typedef struct
function stbi__paeth (line 4316) | static int stbi__paeth(int a, int b, int c)
function stbi__create_png_image_raw (line 4330) | static int stbi__create_png_image_raw(stbi__png *a, stbi_uc *raw, stbi__...
function stbi__create_png_image (line 4542) | static int stbi__create_png_image(stbi__png *a, stbi_uc *image_data, stb...
function stbi__compute_transparency (line 4586) | static int stbi__compute_transparency(stbi__png *z, stbi_uc tc[3], int o...
function stbi__compute_transparency16 (line 4611) | static int stbi__compute_transparency16(stbi__png *z, stbi__uint16 tc[3]...
function stbi__expand_png_palette (line 4636) | static int stbi__expand_png_palette(stbi__png *a, stbi_uc *palette, int ...
function STBIDEF (line 4676) | STBIDEF void stbi_set_unpremultiply_on_load(int flag_true_if_should_unpr...
function STBIDEF (line 4681) | STBIDEF void stbi_convert_iphone_png_to_rgb(int flag_true_if_should_conv...
function stbi__de_iphone (line 4686) | static void stbi__de_iphone(stbi__png *z)
function stbi__parse_png_file (line 4731) | static int stbi__parse_png_file(stbi__png *z, int scan, int req_comp)
function stbi__png_test (line 4940) | static int stbi__png_test(stbi__context *s)
function stbi__png_info_raw (line 4948) | static int stbi__png_info_raw(stbi__png *p, int *x, int *y, int *comp)
function stbi__png_info (line 4960) | static int stbi__png_info(stbi__context *s, int *x, int *y, int *comp)
function stbi__png_is16 (line 4967) | static int stbi__png_is16(stbi__context *s)
function stbi__bmp_test_raw (line 4984) | static int stbi__bmp_test_raw(stbi__context *s)
function stbi__bmp_test (line 4999) | static int stbi__bmp_test(stbi__context *s)
function stbi__high_bit (line 5008) | static int stbi__high_bit(unsigned int z)
function stbi__bitcount (line 5020) | static int stbi__bitcount(unsigned int a)
function stbi__shiftsigned (line 5033) | static int stbi__shiftsigned(int v, int shift, int bits)
type stbi__bmp_data (line 5053) | typedef struct
function stbi__tga_get_comp (line 5323) | static int stbi__tga_get_comp(int bits_per_pixel, int is_grey, int* is_r...
function stbi__tga_info (line 5339) | static int stbi__tga_info(stbi__context *s, int *x, int *y, int *comp)
function stbi__tga_test (line 5404) | static int stbi__tga_test(stbi__context *s)
function stbi__tga_read_rgb16 (line 5436) | static void stbi__tga_read_rgb16(stbi__context *s, stbi_uc* out)
function stbi__psd_test (line 5654) | static int stbi__psd_test(stbi__context *s)
function stbi__psd_decode_rle (line 5661) | static int stbi__psd_decode_rle(stbi__context *s, stbi_uc *p, int pixelC...
function stbi__pic_is4 (line 5906) | static int stbi__pic_is4(stbi__context *s,const char *str)
function stbi__pic_test_core (line 5916) | static int stbi__pic_test_core(stbi__context *s)
type stbi__pic_packet (line 5932) | typedef struct
function stbi_uc (line 5937) | static stbi_uc *stbi__readval(stbi__context *s, int channel, stbi_uc *dest)
function stbi__copyval (line 5951) | static void stbi__copyval(int channel,stbi_uc *dest,const stbi_uc *src)
function stbi_uc (line 5960) | static stbi_uc *stbi__pic_load_core(stbi__context *s,int width,int heigh...
function stbi__pic_test (line 6106) | static int stbi__pic_test(stbi__context *s)
type stbi__gif_lzw (line 6118) | typedef struct
type stbi__gif (line 6125) | typedef struct
function stbi__gif_test_raw (line 6145) | static int stbi__gif_test_raw(stbi__context *s)
function stbi__gif_test (line 6155) | static int stbi__gif_test(stbi__context *s)
function stbi__gif_parse_colortable (line 6162) | static void stbi__gif_parse_colortable(stbi__context *s, stbi_uc pal[256...
function stbi__gif_header (line 6173) | static int stbi__gif_header(stbi__context *s, stbi__gif *g, int *comp, i...
function stbi__gif_info_raw (line 6201) | static int stbi__gif_info_raw(stbi__context *s, int *x, int *y, int *comp)
function stbi__out_gif_code (line 6215) | static void stbi__out_gif_code(stbi__gif *g, stbi__uint16 code)
function stbi_uc (line 6252) | static stbi_uc *stbi__process_gif_raster(stbi__context *s, stbi__gif *g)
function stbi_uc (line 6339) | static stbi_uc *stbi__gif_load_next(stbi__context *s, stbi__gif *g, int ...
function stbi__gif_info (line 6588) | static int stbi__gif_info(stbi__context *s, int *x, int *y, int *comp)
function stbi__hdr_test_core (line 6598) | static int stbi__hdr_test_core(stbi__context *s, const char *signature)
function stbi__hdr_test (line 6608) | static int stbi__hdr_test(stbi__context* s)
function stbi__hdr_convert (line 6642) | static void stbi__hdr_convert(float *output, stbi_uc *input, int req_comp)
function stbi__hdr_info (line 6797) | static int stbi__hdr_info(stbi__context *s, int *x, int *y, int *comp)
function stbi__bmp_info (line 6843) | static int stbi__bmp_info(stbi__context *s, int *x, int *y, int *comp)
function stbi__psd_info (line 6861) | static int stbi__psd_info(stbi__context *s, int *x, int *y, int *comp)
function stbi__psd_is16 (line 6896) | static int stbi__psd_is16(stbi__context *s)
function stbi__pic_info (line 6925) | static int stbi__pic_info(stbi__context *s, int *x, int *y, int *comp)
function stbi__pnm_test (line 6997) | static int stbi__pnm_test(stbi__context *s)
function stbi__pnm_isspace (line 7035) | static int stbi__pnm_isspace(char c)
function stbi__pnm_skip_whitespace (line 7040) | static void stbi__pnm_skip_whitespace(stbi__context *s, char *c)
function stbi__pnm_isdigit (line 7054) | static int stbi__pnm_isdigit(char c)
function stbi__pnm_getinteger (line 7059) | static int stbi__pnm_getinteger(stbi__context *s, char *c)
function stbi__pnm_info (line 7071) | static int stbi__pnm_info(stbi__context *s, int *x, int *y, int *comp)
function stbi__info_main (line 7110) | static int stbi__info_main(stbi__context *s, int *x, int *y, int *comp)
function stbi__is_16_main (line 7152) | static int stbi__is_16_main(stbi__context *s)
function STBIDEF (line 7166) | STBIDEF int stbi_info(char const *filename, int *x, int *y, int *comp)
function STBIDEF (line 7176) | STBIDEF int stbi_info_from_file(FILE *f, int *x, int *y, int *comp)
function STBIDEF (line 7187) | STBIDEF int stbi_is_16_bit(char const *filename)
function STBIDEF (line 7197) | STBIDEF int stbi_is_16_bit_from_file(FILE *f)
function STBIDEF (line 7209) | STBIDEF int stbi_info_from_memory(stbi_uc const *buffer, int len, int *x...
function STBIDEF (line 7216) | STBIDEF int stbi_info_from_callbacks(stbi_io_callbacks const *c, void *u...
function STBIDEF (line 7223) | STBIDEF int stbi_is_16_bit_from_memory(stbi_uc const *buffer, int len)
function STBIDEF (line 7230) | STBIDEF int stbi_is_16_bit_from_callbacks(stbi_io_callbacks const *c, vo...
FILE: hw3/MVC/stb_image_write.h
function STBIWDEF (line 253) | STBIWDEF void stbi_flip_vertically_on_write(int flag)
type stbi__write_context (line 258) | typedef struct
function stbi__start_write_callbacks (line 265) | static void stbi__start_write_callbacks(stbi__write_context *s, stbi_wri...
function stbi__stdio_write (line 273) | static void stbi__stdio_write(void *context, void *data, int size)
function stbi__start_write_file (line 278) | static int stbi__start_write_file(stbi__write_context *s, const char *fi...
function stbi__end_write_file (line 291) | static void stbi__end_write_file(stbi__write_context *s)
type stbiw_uint32 (line 298) | typedef unsigned int stbiw_uint32;
function stbiw__writefv (line 301) | static void stbiw__writefv(stbi__write_context *s, const char *fmt, va_l...
function stbiw__writef (line 330) | static void stbiw__writef(stbi__write_context *s, const char *fmt, ...)
function stbiw__putc (line 338) | static void stbiw__putc(stbi__write_context *s, unsigned char c)
function stbiw__write3 (line 343) | static void stbiw__write3(stbi__write_context *s, unsigned char a, unsig...
function stbiw__write_pixel (line 350) | static void stbiw__write_pixel(stbi__write_context *s, int rgb_dir, int ...
function stbiw__write_pixels (line 383) | static void stbiw__write_pixels(stbi__write_context *s, int rgb_dir, int...
function stbiw__outfile (line 408) | static int stbiw__outfile(stbi__write_context *s, int rgb_dir, int vdir,...
function stbi_write_bmp_core (line 422) | static int stbi_write_bmp_core(stbi__write_context *s, int x, int y, int...
function STBIWDEF (line 431) | STBIWDEF int stbi_write_bmp_to_func(stbi_write_func *func, void *context...
function STBIWDEF (line 439) | STBIWDEF int stbi_write_bmp(char const *filename, int x, int y, int comp...
function stbi_write_tga_core (line 451) | static int stbi_write_tga_core(stbi__write_context *s, int x, int y, int...
function STBIWDEF (line 529) | STBIWDEF int stbi_write_tga_to_func(stbi_write_func *func, void *context...
function STBIWDEF (line 537) | STBIWDEF int stbi_write_tga(char const *filename, int x, int y, int comp...
function stbiw__linear_to_rgbe (line 555) | void stbiw__linear_to_rgbe(unsigned char *rgbe, float *linear)
function stbiw__write_run_data (line 572) | void stbiw__write_run_data(stbi__write_context *s, int length, unsigned ...
function stbiw__write_dump_data (line 580) | void stbiw__write_dump_data(stbi__write_context *s, int length, unsigned...
function stbiw__write_hdr_scanline (line 588) | void stbiw__write_hdr_scanline(stbi__write_context *s, int width, int nc...
function stbi_write_hdr_core (line 677) | static int stbi_write_hdr_core(stbi__write_context *s, int x, int y, int...
function STBIWDEF (line 703) | STBIWDEF int stbi_write_hdr_to_func(stbi_write_func *func, void *context...
function STBIWDEF (line 711) | STBIWDEF int stbi_write_hdr(char const *filename, int x, int y, int comp...
function stbiw__zlib_bitrev (line 766) | static int stbiw__zlib_bitrev(int code, int codebits)
function stbiw__zlib_countm (line 776) | static unsigned int stbiw__zlib_countm(unsigned char *a, unsigned char *...
function stbiw__zhash (line 784) | static unsigned int stbiw__zhash(unsigned char *data)
function stbiw__crc32 (line 924) | static unsigned int stbiw__crc32(unsigned char *buffer, int len)
function stbiw__wpcrc (line 973) | static void stbiw__wpcrc(unsigned char **data, int len)
function stbiw__paeth (line 979) | static unsigned char stbiw__paeth(int a, int b, int c)
function stbiw__encode_png_line (line 988) | static void stbiw__encode_png_line(unsigned char *pixels, int stride_byt...
function STBIWDEF (line 1108) | STBIWDEF int stbi_write_png(char const *filename, int x, int y, int comp...
function STBIWDEF (line 1128) | STBIWDEF int stbi_write_png_to_func(stbi_write_func *func, void *context...
function stbiw__jpg_writeBits (line 1150) | static void stbiw__jpg_writeBits(stbi__write_context *s, int *bitBufP, i...
function stbiw__jpg_DCT (line 1167) | static void stbiw__jpg_DCT(float *d0p, float *d1p, float *d2p, float *d3...
function stbiw__jpg_calcBits (line 1215) | static void stbiw__jpg_calcBits(int val, unsigned short bits[2]) {
function stbiw__jpg_processDU (line 1225) | static int stbiw__jpg_processDU(stbi__write_context *s, int *bitBuf, int...
function stbi_write_jpg_core (line 1290) | static int stbi_write_jpg_core(stbi__write_context *s, int width, int he...
function STBIWDEF (line 1462) | STBIWDEF int stbi_write_jpg_to_func(stbi_write_func *func, void *context...
function STBIWDEF (line 1471) | STBIWDEF int stbi_write_jpg(char const *filename, int x, int y, int comp...
Condensed preview — 32 files, each showing path, character count, and a content snippet. Download the .json file or copy for the full structured content (701K chars).
[
{
"path": ".gitignore",
"chars": 374,
"preview": "# Prerequisites\n*.d\n\n# Compiled Object files\n*.slo\n*.lo\n*.o\n*.obj\n\n# Precompiled Headers\n*.gch\n*.pch\n\n# Compiled Dynamic"
},
{
"path": "LICENSE",
"chars": 1064,
"preview": "MIT License\n\nCopyright (c) 2018 Trinkle\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof"
},
{
"path": "README.md",
"chars": 2438,
"preview": "# Computational Graphics - THU Spring 2018\n\n![](https://img.shields.io/github/repo-size/Trinkle23897/Computational-Graph"
},
{
"path": "hw1/hw1.Rmd",
"chars": 2073,
"preview": "---\ntitle: \"光栅图形学作业\"\nauthor: \"翁家翌 2016011446\"\ndate: \"`r Sys.Date()`\"\noutput:\n pdf_document:\n latex_engine: xelatex\n "
},
{
"path": "hw1/main.py",
"chars": 2184,
"preview": "import cv2\nimport math\nimport queue\nimport random\nimport numpy as np\n\nphi=2*math.sin(math.radians(18))\nsize,cx,cy=800,43"
},
{
"path": "hw1/requirements.txt",
"chars": 21,
"preview": "opencv-python\nnumpy\n\n"
},
{
"path": "hw2/pt/main.cpp",
"chars": 3835,
"preview": "#include \"utils.hpp\"\n\n#define eps 1e-6\n#define mcol 255\nstruct Ray{\n\tP3 o, d;\n\tRay(P3 o_, P3 d_): o(o_), d(d_) {}\n};\n\nen"
},
{
"path": "hw2/pt/utils.hpp",
"chars": 1974,
"preview": "#ifndef __UTILS_H__\n#define __UTILS_H__\n\n#include <bits/stdc++.h>\n\ntypedef double ld;\nconst ld PI = acos(-1);\nconst ld e"
},
{
"path": "hw2/sppm/bezier.hpp",
"chars": 2165,
"preview": "#ifndef __BEZIER_H__\n#define __BEZIER_H__ \n\n#include \"utils.hpp\"\n#include \"ray.hpp\"\n\nclass BezierCurve2D\n{// f(y)=x, y g"
},
{
"path": "hw2/sppm/bezier_test.py",
"chars": 2265,
"preview": "import cv2\nimport numpy as np\ncontrol=np.array(\n[[ 270., 0.],\n [ 150., 100.],\n [ 200., 200.],\n [ 250., 400.],\n [ 3"
},
{
"path": "hw2/sppm/kdtree.hpp",
"chars": 3319,
"preview": "#ifndef __KDTREE_H__\n#define __KDTREE_H__ \n\n#include \"obj.hpp\"\n#include \"bezier.hpp\"\n\nstruct SPPMnode {\n\tP3 pos, col, di"
},
{
"path": "hw2/sppm/main.cpp",
"chars": 6291,
"preview": "#include \"render.hpp\"\n\nint baseline(int argc, char *argv[])\n{\n\t// Ray ray(P3(427,1000,447),P3(-1,-2,-1.5).norm());\n\t// f"
},
{
"path": "hw2/sppm/obj.hpp",
"chars": 12758,
"preview": "#ifndef __OBJ_H__\n#define __OBJ_H__ \n\n#include \"utils.hpp\"\n#include \"ray.hpp\"\n#include \"bezier.hpp\"\n\n// enum Refl_t { DI"
},
{
"path": "hw2/sppm/ray.hpp",
"chars": 260,
"preview": "#ifndef __RAY_H__\n#define __RAY_H__ \n\n#include \"utils.hpp\"\n#include \"vec3.hpp\"\n\nclass Ray\n{\npublic:\n\tP3 o, d;\n\tRay(P3 o_"
},
{
"path": "hw2/sppm/render.hpp",
"chars": 7039,
"preview": "#ifndef __RENDER_H__\n#define __RENDER_H__ \n\n#include \"texture.hpp\"\n#include \"scene.hpp\"\n#include \"kdtree.hpp\"\n\nstd::pair"
},
{
"path": "hw2/sppm/scene.hpp",
"chars": 5866,
"preview": "#ifndef __SCENE_H__\n#define __SCENE_H__\n\n#include \"obj.hpp\"\n#include \"bezier.hpp\"\n\nconst ld bezier_div_x = 3;\nconst ld b"
},
{
"path": "hw2/sppm/stb_image.h",
"chars": 260289,
"preview": "/* stb_image - v2.19 - public domain image loader - http://nothings.org/stb\n no warrant"
},
{
"path": "hw2/sppm/texture.hpp",
"chars": 1111,
"preview": "#ifndef __TEXTURE_H__\n#define __TEXTURE_H__\n\n#include \"vec3.hpp\"\n\nclass Texture {\npublic:\n\tP3 color, emission;\n\tRefl_t r"
},
{
"path": "hw2/sppm/utils.hpp",
"chars": 554,
"preview": "#ifndef __UTILS_H__\n#define __UTILS_H__\n\n#include <bits/stdc++.h>\n#include <omp.h>\n\n#ifndef STB_IMAGE_IMPLEMENTATION\n#de"
},
{
"path": "hw2/sppm/vec3.hpp",
"chars": 2492,
"preview": "#ifndef __VEC3_H__\n#define __VEC3_H__ \n\n#include \"utils.hpp\"\n\nstruct P3{\n\tld x, y, z;\n\tP3(ld x_=0, ld y_=0, ld z_=0): x("
},
{
"path": "hw3/MVC/CMakeLists.txt",
"chars": 731,
"preview": "# Created by the script cgal_create_cmake_script\n# This is the CMake script for compiling a CGAL application.\n\n\nproject("
},
{
"path": "hw3/MVC/edge.py",
"chars": 379,
"preview": "import cv2, os, sys\nimport numpy as np\nimg = cv2.imread(sys.argv[1])\nimgray = cv2.cvtColor(img, cv2.COLOR_BGR2GRAY)\nret,"
},
{
"path": "hw3/MVC/main.cpp",
"chars": 19580,
"preview": "#include <bits/stdc++.h>\n#define STB_IMAGE_IMPLEMENTATION\n#include \"stb_image.h\"\n#define STB_IMAGE_WRITE_IMPLEMENTATION\n"
},
{
"path": "hw3/MVC/report.bib",
"chars": 1044,
"preview": "@misc{JB,\nhowpublished = {\\url{https://en.wikipedia.org/wiki/Jacobi_method}}, \ntitle = {Jacobi method}, \nnote = {Acces"
},
{
"path": "hw3/MVC/report.tex",
"chars": 5317,
"preview": "\\documentclass[a4paper]{article}\n\\usepackage{latexsym,amssymb,amsmath,amsbsy,amsopn,amstext,xcolor,multicol}\n\\usepackage"
},
{
"path": "hw3/MVC/stb_image.h",
"chars": 260289,
"preview": "/* stb_image - v2.19 - public domain image loader - http://nothings.org/stb\n no warrant"
},
{
"path": "hw3/MVC/stb_image_write.h",
"chars": 64478,
"preview": "/* stb_image_write - v1.09 - public domain - http://nothings.org/stb/stb_image_write.h\n writes out PNG/BMP/TGA/JPEG/HD"
}
]
// ... and 5 more files (download for full content)
About this extraction
This page contains the full source code of the Trinkle23897/Computational-Graphics-THU-2018 GitHub repository, extracted and formatted as plain text for AI agents and large language models (LLMs). The extraction includes 32 files (654.5 KB), approximately 229.1k tokens, and a symbol index with 665 extracted functions, classes, methods, constants, and types. Use this with OpenClaw, Claude, ChatGPT, Cursor, Windsurf, or any other AI tool that accepts text input. You can copy the full output to your clipboard or download it as a .txt file.
Extracted by GitExtract — free GitHub repo to text converter for AI. Built by Nikandr Surkov.