Lines Matching refs:input
124 int get_len_step( const data_t *input, size_t buffer_size,
145 if( buffer_size > input->len )
147 memcpy( buf, input->x, input->len );
148 memset( buf + input->len, 'A', buffer_size - input->len );
152 memcpy( buf, input->x, buffer_size );
160 if( buffer_size >= input->len + actual_length )
163 TEST_ASSERT( p == buf + input->len );
233 void parse_prefixes( const data_t *input,
248 /* Test every prefix of the input, except the empty string.
250 * we wouldn't know what to parse the input as.
251 * Also test the input followed by an extra byte.
253 for( buffer_size = 1; buffer_size <= input->len + 1; buffer_size++ )
259 memcpy( buf, input->x, buffer_size );
265 if( buffer_size < input->len )
269 else if( buffer_size == input->len )
273 else /* ( buffer_size > input->len ) */
279 TEST_ASSERT( p == buf + input->len );
291 void get_len( const data_t *input, int actual_length_arg )
300 * and we only test the empty string on a 1-byte input.
302 for( buffer_size = 1; buffer_size <= input->len + 1; buffer_size++ )
304 if( ! get_len_step( input, buffer_size, actual_length ) )
307 if( ! get_len_step( input, input->len + actual_length - 1, actual_length ) )
309 if( ! get_len_step( input, input->len + actual_length, actual_length ) )
315 void get_boolean( const data_t *input,
318 unsigned char *p = input->x;
321 ret = mbedtls_asn1_get_bool( &p, input->x + input->len, &val );
326 TEST_ASSERT( p == input->x + input->len );
332 void empty_integer( const data_t *input )
345 p = input->x;
346 TEST_EQUAL( mbedtls_asn1_get_int( &p, input->x + input->len, &val ),
352 p = input->x;
353 TEST_EQUAL( mbedtls_asn1_get_mpi( &p, input->x + input->len, &actual_mpi ),
367 void get_integer( const data_t *input,
410 p = input->x;
411 ret = mbedtls_asn1_get_int( &p, input->x + input->len, &val );
416 TEST_ASSERT( p == input->x + input->len );
427 p = input->x;
428 ret = mbedtls_asn1_get_mpi( &p, input->x + input->len, &actual_mpi );
449 unsigned char *q = input->x + 1;
451 TEST_ASSERT( mbedtls_asn1_get_len( &q, input->x + input->len,
460 TEST_ASSERT( p == input->x + input->len );
475 void get_enum( const data_t *input,
506 p = input->x;
507 ret = mbedtls_asn1_get_enum( &p, input->x + input->len, &val );
512 TEST_ASSERT( p == input->x + input->len );
549 void get_bitstring( const data_t *input,
554 unsigned char *p = input->x;
556 TEST_EQUAL( mbedtls_asn1_get_bitstring( &p, input->x + input->len, &bs ),
563 TEST_EQUAL( bs.p - input->x + bs.len, input->len );
564 TEST_ASSERT( p == input->x + input->len );
567 p = input->x;
568 TEST_EQUAL( mbedtls_asn1_get_bitstring_null( &p, input->x + input->len,
575 TEST_ASSERT( p == input->x + input->len - bs.len );
581 void get_sequence_of( const data_t *input, int tag,
586 * For each element in the SEQUENCE in input, description contains
588 * of input to the tag of the element) and the length of the
594 unsigned char *p = input->x;
599 TEST_EQUAL( mbedtls_asn1_get_sequence_of( &p, input->x + input->len,
604 TEST_ASSERT( p == input->x + input->len );
622 TEST_EQUAL( n, (size_t)( cur->buf.p - input->x ) );
641 void traverse_sequence_of( const data_t *input,
648 * For each element in the SEQUENCE in input, description contains
650 * the start of input to the content of the element), the element's tag,
654 unsigned char *p = input->x;
655 traverse_state_t traverse_state = {input->x, description};
658 ret = mbedtls_asn1_traverse_sequence_of( &p, input->x + input->len,
670 void get_alg( const data_t *input,
678 unsigned char *p = input->x;
681 TEST_EQUAL( mbedtls_asn1_get_alg( &p, input->x + input->len,
687 TEST_EQUAL( oid.p - input->x, oid_offset );
691 TEST_EQUAL( params.p - input->x, params_offset );
695 TEST_EQUAL( p - input->x, total_length );
698 ret = mbedtls_asn1_get_alg_null( &p, input->x + input->len, &oid );
702 TEST_EQUAL( oid.p - input->x, oid_offset );
704 TEST_EQUAL( p - input->x, total_length );