mirror-github-bspeice/cuburn
1
0
Fork 0
mirror of https://github.com/stevenrobertson/cuburn.git synced 2025-02-05 11:40:04 -05:00
Code Issues Actions Packages Projects Releases Wiki Activity

A few harmless const modifiers

Browse Source
This commit is contained in:
Steven Robertson 2011-10-25 22:49:26 -04:00
parent 3436291eb6
commit e793527c29
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
cuburn/code/interp.py
View File

@ -268,7 +268,7 @@ typedef struct {
* bitwise search is just for my own amusement. * bitwise search is just for my own amusement.
*/ */
__device__ __device__
int bitwise_binsearch(float *hay, float needle) { int bitwise_binsearch(const float *hay, float needle) {
int lo = 0; int lo = 0;
{{for i in range(search_rounds-1, -1, -1)}} {{for i in range(search_rounds-1, -1, -1)}}
@ -279,7 +279,7 @@ int bitwise_binsearch(float *hay, float needle) {
} }
__device__ __device__
float catmull_rom(float *times, float *knots, float t) { float catmull_rom(const float *times, const float *knots, float t) {
int idx = bitwise_binsearch(times, t); int idx = bitwise_binsearch(times, t);
// The left bias of the search means that we never have to worry about // The left bias of the search means that we never have to worry about
@ -308,7 +308,7 @@ float catmull_rom(float *times, float *knots, float t) {
} }
__global__ __global__
void test_cr(float *times, float *knots, float *t, float *r) { void test_cr(const float *times, const float *knots, const float *t, float *r) {
int i = threadIdx.x + blockDim.x * blockIdx.x; int i = threadIdx.x + blockDim.x * blockIdx.x;
r[i] = catmull_rom(times, knots, t[i]); r[i] = catmull_rom(times, knots, t[i]);
} }