5079590438

Committed 25 May 2023 12:28PM UTC coverage: 92.228% (+0.5%) from 91.723%

Build # 5079590438

Build Type

Pull #3502

github

Pull Request Pull Request #3502: Apply clang-format to the codebase

Run Details

75589 of 81959 relevant lines covered (92.23%)

12139530.51 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

78.05

/src/lib/filters/buf_filt.cpp

/*
* Buffered Filter
* (C) 1999-2007 Jack Lloyd
*
* Botan is released under the Simplified BSD License (see license.txt)
*/

#include <botan/filters.h>

#include <botan/exceptn.h>
#include <botan/mem_ops.h>
#include <botan/internal/rounding.h>

namespace Botan {

/*
* Buffered_Filter Constructor
*/
Buffered_Filter::Buffered_Filter(size_t b, size_t f) : m_main_block_mod(b), m_final_minimum(f) {
   if(m_main_block_mod == 0)
      throw Invalid_Argument("m_main_block_mod == 0");

   if(m_final_minimum > m_main_block_mod)
      throw Invalid_Argument("m_final_minimum > m_main_block_mod");

   m_buffer.resize(2 * m_main_block_mod);
   m_buffer_pos = 0;
}

/*
* Buffer input into blocks, trying to minimize copying
*/
void Buffered_Filter::write(const uint8_t input[], size_t input_size) {
   if(!input_size)
      return;

   if(m_buffer_pos + input_size >= m_main_block_mod + m_final_minimum) {
      size_t to_copy = std::min<size_t>(m_buffer.size() - m_buffer_pos, input_size);

      copy_mem(&m_buffer[m_buffer_pos], input, to_copy);
      m_buffer_pos += to_copy;

      input += to_copy;
      input_size -= to_copy;

      size_t total_to_consume =
         round_down(std::min(m_buffer_pos, m_buffer_pos + input_size - m_final_minimum), m_main_block_mod);

      buffered_block(m_buffer.data(), total_to_consume);

      m_buffer_pos -= total_to_consume;

      copy_mem(m_buffer.data(), m_buffer.data() + total_to_consume, m_buffer_pos);
   }

   if(input_size >= m_final_minimum) {
      size_t full_blocks = (input_size - m_final_minimum) / m_main_block_mod;
      size_t to_copy = full_blocks * m_main_block_mod;

      if(to_copy) {
         buffered_block(input, to_copy);

         input += to_copy;
         input_size -= to_copy;
      }
   }

   copy_mem(&m_buffer[m_buffer_pos], input, input_size);
   m_buffer_pos += input_size;
}

/*
* Finish/flush operation
*/
void Buffered_Filter::end_msg() {
   if(m_buffer_pos < m_final_minimum)
      throw Invalid_State("Buffered filter end_msg without enough input");

   size_t spare_blocks = (m_buffer_pos - m_final_minimum) / m_main_block_mod;

   if(spare_blocks) {
      size_t spare_bytes = m_main_block_mod * spare_blocks;
      buffered_block(m_buffer.data(), spare_bytes);
      buffered_final(&m_buffer[spare_bytes], m_buffer_pos - spare_bytes);
   } else {
      buffered_final(m_buffer.data(), m_buffer_pos);
   }

   m_buffer_pos = 0;
}

}

1	/*
2	* Buffered Filter
3	* (C) 1999-2007 Jack Lloyd
4	*
5	* Botan is released under the Simplified BSD License (see license.txt)
6	*/
7
8	#include <botan/filters.h>
9
10	#include <botan/exceptn.h>
11	#include <botan/mem_ops.h>
12	#include <botan/internal/rounding.h>
13
14	namespace Botan {
15
16	/*
17	* Buffered_Filter Constructor
18	*/
19	Buffered_Filter::Buffered_Filter(size_t b, size_t f) : m_main_block_mod(b), m_final_minimum(f) {	4✔
20	if(m_main_block_mod == 0)	4✔
21	throw Invalid_Argument("m_main_block_mod == 0");	×
22
23	if(m_final_minimum > m_main_block_mod)	4✔
24	throw Invalid_Argument("m_final_minimum > m_main_block_mod");	×
25
26	m_buffer.resize(2 * m_main_block_mod);	4✔
27	m_buffer_pos = 0;	4✔
28	}	4✔
29
30	/*
31	* Buffer input into blocks, trying to minimize copying
32	*/
33	void Buffered_Filter::write(const uint8_t input[], size_t input_size) {	37✔
34	if(!input_size)	37✔
35	return;
36
37	if(m_buffer_pos + input_size >= m_main_block_mod + m_final_minimum) {	37✔
38	size_t to_copy = std::min<size_t>(m_buffer.size() - m_buffer_pos, input_size);	2✔
39
40	copy_mem(&m_buffer[m_buffer_pos], input, to_copy);	2✔
41	m_buffer_pos += to_copy;	2✔
42
43	input += to_copy;	2✔
44	input_size -= to_copy;	2✔
45
46	size_t total_to_consume =	2✔
47	round_down(std::min(m_buffer_pos, m_buffer_pos + input_size - m_final_minimum), m_main_block_mod);	3✔
48
49	buffered_block(m_buffer.data(), total_to_consume);	2✔
50
51	m_buffer_pos -= total_to_consume;	2✔
52
53	copy_mem(m_buffer.data(), m_buffer.data() + total_to_consume, m_buffer_pos);	2✔
54	}
55
56	if(input_size >= m_final_minimum) {	37✔
57	size_t full_blocks = (input_size - m_final_minimum) / m_main_block_mod;	36✔
58	size_t to_copy = full_blocks * m_main_block_mod;	36✔
59
60	if(to_copy) {	36✔
61	buffered_block(input, to_copy);	×
62
63	input += to_copy;	×
64	input_size -= to_copy;	×
65	}
66	}
67
68	copy_mem(&m_buffer[m_buffer_pos], input, input_size);	37✔
69	m_buffer_pos += input_size;	37✔
70	}
71
72	/*
73	* Finish/flush operation
74	*/
75	void Buffered_Filter::end_msg() {	33✔
76	if(m_buffer_pos < m_final_minimum)	33✔
77	throw Invalid_State("Buffered filter end_msg without enough input");	×
78
79	size_t spare_blocks = (m_buffer_pos - m_final_minimum) / m_main_block_mod;	33✔
80
81	if(spare_blocks) {	33✔
82	size_t spare_bytes = m_main_block_mod * spare_blocks;	×
83	buffered_block(m_buffer.data(), spare_bytes);	×
84	buffered_final(&m_buffer[spare_bytes], m_buffer_pos - spare_bytes);	×
85	} else {
86	buffered_final(m_buffer.data(), m_buffer_pos);	33✔
87	}
88
89	m_buffer_pos = 0;	33✔
90	}	33✔
91
92	}

randombit / botan / 5079590438

Source File Press 'n' to go to next uncovered line, 'b' for previous

Source File
Press 'n' to go to next uncovered line, 'b' for previous