seg_count 45 test/datatype/position.c ddt_segment_t** segments, int* seg_count ) seg_count 54 test/datatype/position.c *seg_count = data_size / segment_length; seg_count 55 test/datatype/position.c if( ((*seg_count) * segment_length) != data_size ) seg_count 56 test/datatype/position.c *seg_count += 1; seg_count 58 test/datatype/position.c *segments = (ddt_segment_t*)malloc( (*seg_count) * sizeof(ddt_segment_t) ); seg_count 65 test/datatype/position.c for( i = 0; i < (*seg_count); i++ ) { seg_count 78 test/datatype/position.c for( i = 0; i < (*seg_count); i++ ) { seg_count 83 test/datatype/position.c (*seg_count) += 1; seg_count 90 test/datatype/position.c shuffle_segments( ddt_segment_t* segments, int seg_count ) seg_count 95 test/datatype/position.c for( i = 0; i < (seg_count/2); i += 2 ) { seg_count 97 test/datatype/position.c segments[i] = segments[seg_count - i - 1]; seg_count 98 test/datatype/position.c segments[seg_count - i - 1] = temporary; seg_count 106 test/datatype/position.c ddt_segment_t* segments, int seg_count, seg_count 118 test/datatype/position.c for( i = 0; i < seg_count; i++ ) { seg_count 146 test/datatype/position.c ddt_segment_t* segments, int seg_count, seg_count 158 test/datatype/position.c for( i = 0; i < seg_count; i++ ) { seg_count 224 test/datatype/position.c int i, seg_count, errors; seg_count 247 test/datatype/position.c &segments, &seg_count ); seg_count 250 test/datatype/position.c shuffle_segments( segments, seg_count ); seg_count 253 test/datatype/position.c pack_segments( datatype, data_count, fragment_size, segments, seg_count, seg_count 257 test/datatype/position.c unpack_segments( datatype, data_count, fragment_size, segments, seg_count, seg_count 278 test/datatype/position.c for( i = 0; i < seg_count; i++ ) { seg_count 44 test/datatype/position_noncontig.c ddt_segment_t** segments, int* seg_count ) seg_count 53 test/datatype/position_noncontig.c *seg_count = data_size / segment_length; seg_count 54 test/datatype/position_noncontig.c if( ((*seg_count) * segment_length) != data_size ) seg_count 55 test/datatype/position_noncontig.c *seg_count += 1; seg_count 57 test/datatype/position_noncontig.c *segments = (ddt_segment_t*)malloc( (*seg_count) * sizeof(ddt_segment_t) ); seg_count 64 test/datatype/position_noncontig.c for( i = 0; i < (*seg_count); i++ ) { seg_count 77 test/datatype/position_noncontig.c for( i = 0; i < (*seg_count); i++ ) { seg_count 82 test/datatype/position_noncontig.c (*seg_count) += 1; seg_count 89 test/datatype/position_noncontig.c shuffle_segments( ddt_segment_t* segments, int seg_count ) seg_count 94 test/datatype/position_noncontig.c for( i = 0; i < (seg_count/2); i += 2 ) { seg_count 96 test/datatype/position_noncontig.c segments[i] = segments[seg_count - i - 1]; seg_count 97 test/datatype/position_noncontig.c segments[seg_count - i - 1] = temporary; seg_count 105 test/datatype/position_noncontig.c ddt_segment_t* segments, int seg_count, seg_count 117 test/datatype/position_noncontig.c for( i = 0; i < seg_count; i++ ) { seg_count 145 test/datatype/position_noncontig.c ddt_segment_t* segments, int seg_count, seg_count 157 test/datatype/position_noncontig.c for( i = 0; i < seg_count; i++ ) { seg_count 193 test/datatype/position_noncontig.c int i, seg_count, errors; seg_count 218 test/datatype/position_noncontig.c &segments, &seg_count ); seg_count 221 test/datatype/position_noncontig.c shuffle_segments( segments, seg_count ); seg_count 224 test/datatype/position_noncontig.c pack_segments( datatype, 1, fragment_size, segments, seg_count, seg_count 228 test/datatype/position_noncontig.c unpack_segments( datatype, 1, fragment_size, segments, seg_count, seg_count 245 test/datatype/position_noncontig.c for( i = 0; i < seg_count; i++ ) {