diff options
author | Harley Acheson <harley.acheson@gmail.com> | 2020-10-19 19:15:34 +0300 |
---|---|---|
committer | Harley Acheson <harley.acheson@gmail.com> | 2020-10-19 19:15:34 +0300 |
commit | c0a6bc19794c69843c38451c762e91bc10136e0f (patch) | |
tree | 24248b8d8e93f37925299cb535ec5cfbd8fefef2 /source/blender/draw/intern | |
parent | 84ef3b80de4915a24a9fd2fd214d0fa44e59b854 (diff) |
Spelling: Loose Versus Lose
Corrects incorrect usages of the word 'loose' when 'lose' was required.
Differential Revision: https://developer.blender.org/D9243
Reviewed by Campbell Barton
Diffstat (limited to 'source/blender/draw/intern')
-rw-r--r-- | source/blender/draw/intern/draw_instance_data.c | 2 | ||||
-rw-r--r-- | source/blender/draw/intern/draw_manager.h | 2 |
2 files changed, 2 insertions, 2 deletions
diff --git a/source/blender/draw/intern/draw_instance_data.c b/source/blender/draw/intern/draw_instance_data.c index 0654f949e52..4050a5f8b69 100644 --- a/source/blender/draw/intern/draw_instance_data.c +++ b/source/blender/draw/intern/draw_instance_data.c @@ -24,7 +24,7 @@ * DRW Instance Data Manager * This is a special memory manager that keeps memory blocks ready to send as VBO data in one * continuous allocation. This way we avoid feeding #GPUBatch each instance data one by one and - * unnecessary memcpy. Since we loose which memory block was used each #DRWShadingGroup we need to + * unnecessary memcpy. Since we lose which memory block was used each #DRWShadingGroup we need to * redistribute them in the same order/size to avoid to realloc each frame. This is why * #DRWInstanceDatas are sorted in a list for each different data size. */ diff --git a/source/blender/draw/intern/draw_manager.h b/source/blender/draw/intern/draw_manager.h index e40328c0f2e..8e505d5df71 100644 --- a/source/blender/draw/intern/draw_manager.h +++ b/source/blender/draw/intern/draw_manager.h @@ -417,7 +417,7 @@ struct DRWView { * In order to keep a cache friendly data structure, * we alloc most of our little data into chunks of multiple item. * Iteration, allocation and memory usage are better. - * We loose a bit of memory by allocating more than what we need + * We lose a bit of memory by allocating more than what we need * but it's counterbalanced by not needing the linked-list pointers * for each item. **/ |