diff options
| author | Campbell Barton <ideasman42@gmail.com> | 2019-01-15 15:15:58 +0300 |
|---|---|---|
| committer | Campbell Barton <ideasman42@gmail.com> | 2019-01-15 15:30:31 +0300 |
| commit | 4226ee0b71fec6f08897dacf3d6632526618acca (patch) | |
| tree | 560c333c5a9458f3dbbb606befd52d558b35503f /source/blender/blenlib/intern/array_store.c | |
| parent | 30c3852ffd140b003410aae25b222dea8b76412f (diff) | |
Cleanup: comment line length (blenlib)
Prevents clang-format wrapping text before comments.
Diffstat (limited to 'source/blender/blenlib/intern/array_store.c')
| -rw-r--r-- | source/blender/blenlib/intern/array_store.c | 10 |
1 files changed, 6 insertions, 4 deletions
diff --git a/source/blender/blenlib/intern/array_store.c b/source/blender/blenlib/intern/array_store.c index 153ba3ea0d0..c9142608324 100644 --- a/source/blender/blenlib/intern/array_store.c +++ b/source/blender/blenlib/intern/array_store.c @@ -473,7 +473,8 @@ static void bchunk_list_ensure_min_size_last( BLI_mempool_free(bs_mem->chunk_ref, cref); } else { - /* If we always merge small slices, we should _almost_ never end up having very large chunks. + /* If we always merge small slices, we should _almost_ + * never end up having very large chunks. * Gradual expanding on contracting will cause this. * * if we do, the code below works (test by setting 'BCHUNK_SIZE_MAX_MUL = 1.2') */ @@ -1324,8 +1325,8 @@ static BChunkList *bchunk_list_from_data_merge( BChunk *chunk_found = cref_found->link; if (bchunk_data_compare(chunk_found, data, data_len, i_prev)) { - /* may be useful to remove table data, assuming we dont have repeating memory - * where it would be useful to re-use chunks. */ + /* may be useful to remove table data, assuming we dont have + * repeating memory where it would be useful to re-use chunks. */ i += chunk_found->data_len; bchunk_list_append(info, bs_mem, chunk_list, chunk_found); /* chunk_found may be freed! */ @@ -1377,7 +1378,8 @@ static BChunkList *bchunk_list_from_data_merge( BChunk *chunk = cref->link; // BLI_assert(bchunk_data_compare(chunk, data, data_len, i_prev)); i_prev += chunk->data_len; - /* use simple since we assume the references chunks have already been sized correctly. */ + /* use simple since we assume the references chunks + * have already been sized correctly. */ bchunk_list_append_only(bs_mem, chunk_list, chunk); ASSERT_CHUNKLIST_DATA(chunk_list, data); cref = cref->next; |