diff options
author | Campbell Barton <ideasman42@gmail.com> | 2012-07-17 03:23:33 +0400 |
---|---|---|
committer | Campbell Barton <ideasman42@gmail.com> | 2012-07-17 03:23:33 +0400 |
commit | 32cf7fcdb147d4f467279109db384b9a9d3c6708 (patch) | |
tree | a6a899e8a801c7c8975289de99137626e21143ef /source/blender/nodes | |
parent | 1f96470b5d80f05aef1dc1c262ba1a0a56a1d1fb (diff) |
code cleanup: spelling
Diffstat (limited to 'source/blender/nodes')
-rw-r--r-- | source/blender/nodes/composite/nodes/node_composite_doubleEdgeMask.c | 8 | ||||
-rw-r--r-- | source/blender/nodes/shader/node_shader_util.c | 2 |
2 files changed, 5 insertions, 5 deletions
diff --git a/source/blender/nodes/composite/nodes/node_composite_doubleEdgeMask.c b/source/blender/nodes/composite/nodes/node_composite_doubleEdgeMask.c index 6eb70636efa..c206b9a1a5d 100644 --- a/source/blender/nodes/composite/nodes/node_composite_doubleEdgeMask.c +++ b/source/blender/nodes/composite/nodes/node_composite_doubleEdgeMask.c @@ -909,7 +909,7 @@ static void do_createEdgeLocationBuffer(unsigned int t, unsigned int rw, unsigne int x; // x = pixel loop counter int a; // a = temporary pixel index buffer loop counter unsigned int ud; // ud = unscaled edge distance - unsigned int dmin; // dmin = minimun edge distance + unsigned int dmin; // dmin = minimum edge distance unsigned int rsl; // long used for finding fast 1.0/sqrt unsigned int gradientFillOffset; @@ -1027,7 +1027,7 @@ static void do_fillGradientBuffer(unsigned int rw, float *res, unsigned short *g unsigned int gradientFillOffset; unsigned int t; unsigned int ud; // ud = unscaled edge distance - unsigned int dmin; // dmin = minimun edge distance + unsigned int dmin; // dmin = minimum edge distance float odist; // odist = current outer edge distance float idist; // idist = current inner edge distance int dx; // dx = X-delta (used for distance proportion calculation) @@ -1084,7 +1084,7 @@ static void do_fillGradientBuffer(unsigned int rw, float *res, unsigned short *g * pixel color as |GI| / (|GI| + |GO|). Since these are reciprocals, GI serves the * purpose of GO for the proportion calculation. * - * For the purposes of the minimun distance comparisons, we only check + * For the purposes of the minimum distance comparisons, we only check * the sums-of-squares against each other, since they are in the same * mathematical sort-order as if we did go ahead and take square roots * @@ -1130,7 +1130,7 @@ static void do_fillGradientBuffer(unsigned int rw, float *res, unsigned short *g /* * Note once again that since we are using reciprocals of distance values our * proportion is already the correct intensity, and does not need to be - * subracted from 1.0 like it would have if we used real distances. + * subtracted from 1.0 like it would have if we used real distances. */ /* diff --git a/source/blender/nodes/shader/node_shader_util.c b/source/blender/nodes/shader/node_shader_util.c index 9aa3c76e0a5..56704b981be 100644 --- a/source/blender/nodes/shader/node_shader_util.c +++ b/source/blender/nodes/shader/node_shader_util.c @@ -211,7 +211,7 @@ void node_gpu_stack_from_data(struct GPUNodeStack *gs, int type, bNodeStack *ns) gs->name = ""; gs->hasinput= ns->hasinput && ns->data; - /* XXX Commented out the ns->data check here, as it seems it's not alwas set, + /* XXX Commented out the ns->data check here, as it seems it's not always set, * even though there *is* a valid connection/output... But that might need * further investigation. */ |