diff options
author | Campbell Barton <ideasman42@gmail.com> | 2020-06-05 07:34:00 +0300 |
---|---|---|
committer | Campbell Barton <ideasman42@gmail.com> | 2020-06-05 07:34:00 +0300 |
commit | 9e96c6d05488370cd74c89b69b306da6f5e4de69 (patch) | |
tree | c443908c02f3eb6386aab015fce8d78a9bdc2798 /source/blender/blenlib | |
parent | b2d1c4873fd5ee6244490e47836dd24c83955574 (diff) |
Cleanup: spelling
Diffstat (limited to 'source/blender/blenlib')
-rw-r--r-- | source/blender/blenlib/BLI_task.h | 2 | ||||
-rw-r--r-- | source/blender/blenlib/intern/BLI_kdopbvh.c | 4 |
2 files changed, 3 insertions, 3 deletions
diff --git a/source/blender/blenlib/BLI_task.h b/source/blender/blenlib/BLI_task.h index a4a855c354b..eee304a9b72 100644 --- a/source/blender/blenlib/BLI_task.h +++ b/source/blender/blenlib/BLI_task.h @@ -286,7 +286,7 @@ int BLI_task_parallel_thread_id(const TaskParallelTLS *tls); * ** Task-Data ** * * Typically you want give a task data to work on. - * Task data can be shared with other nodes, but be carefull not to free the data multiple times. + * Task data can be shared with other nodes, but be careful not to free the data multiple times. * Task data is freed when calling `BLI_task_graph_free`. * * MyData *task_data = MEM_callocN(sizeof(MyData), __func__); diff --git a/source/blender/blenlib/intern/BLI_kdopbvh.c b/source/blender/blenlib/intern/BLI_kdopbvh.c index 3a07cef7cac..da67baf0ead 100644 --- a/source/blender/blenlib/intern/BLI_kdopbvh.c +++ b/source/blender/blenlib/intern/BLI_kdopbvh.c @@ -719,10 +719,10 @@ static void non_recursive_bvh_div_nodes_task_cb(void *__restrict userdata, refit_kdop_hull(data->tree, parent, parent_leafs_begin, parent_leafs_end); split_axis = get_largest_axis(parent->bv); - /* Save split axis (this can be used on raytracing to speedup the query time) */ + /* Save split axis (this can be used on ray-tracing to speedup the query time) */ parent->main_axis = split_axis / 2; - /* Split the childs along the split_axis, note: its not needed to sort the whole leafs array + /* Split the children along the split_axis, note: its not needed to sort the whole leafs array * Only to assure that the elements are partitioned on a way that each child takes the elements * it would take in case the whole array was sorted. * Split_leafs takes care of that "sort" problem. */ |