Sign Up
Log In
Log In
or
Sign Up
Places
All Projects
Status Monitor
Collapse sidebar
home:kolbma:sdr
csdr
csdr-libsdr-cleanup.patch
Overview
Repositories
Revisions
Requests
Users
Attributes
Meta
File csdr-libsdr-cleanup.patch of Package csdr
--- csdr/libcsdr.c.orig 2020-03-03 14:22:31.931062698 +0100 +++ csdr/libcsdr.c 2020-03-03 14:51:40.655733565 +0100 @@ -130,7 +130,6 @@ // cutoff_rate is (cutoff frequency/sampling frequency) //Explanation at Chapter 16 of dspguide.com int middle=length/2; - float temp; float (*window_function)(float) = firdes_get_window_kernel(window); output[middle]=2*PI*cutoff_rate*window_function(0); for(int i=1; i<=middle; i++) //@@firdes_lowpass_f: calculate taps @@ -611,7 +610,7 @@ //oi: output index, i: tap index int output_size=input_size*interpolation/decimation; int oi; - int startingi, delayi; + int startingi=0, delayi=0; //fprintf(stderr,"rational_resampler_ff | interpolation = %d | decimation = %d\ntaps_length = %d | input_size = %d | output_size = %d | last_taps_delay = %d\n",interpolation,decimation,taps_length,input_size,output_size,last_taps_delay); for (oi=0; oi<output_size; oi++) //@rational_resampler_ff (outer loop) { @@ -687,7 +686,7 @@ int oi=0; int index_high; float where=d.remain; - float result_high, result_low; + float result_high=0, result_low; if(where==0.0) //in the first iteration index_high may be zero (so using the item index_high-1 would lead to invalid memory access). { output[oi++]=fir_one_pass_ff(input,taps,taps_length); @@ -763,8 +762,6 @@ for(;(index_high=ceilf(d->where))+d->num_poly_points+d->taps_length<input_size;d->where+=d->rate) //@fractional_decimator_ff { //d->num_poly_points above is theoretically more than we could have here, but this makes the spectrum look good - int sxifirst = FD_INDEX_LOW + d->xifirst; - int sxilast = FD_INDEX_LOW + d->xilast; if(d->taps) for(int wi=0;wi<d->num_poly_points;wi++) d->filtered_buf[wi] = fir_one_pass_ff(input+FD_INDEX_LOW+wi, d->taps, d->taps_length); else @@ -1538,7 +1535,7 @@ { *status_shr=((*status_shr)<<1)|(!!symbol); //shift new bit in shift register //fprintf(stderr,"*status_shr = %llx\n", *status_shr); - if((*status_shr)&0xFFF==0) return 0; + if(((*status_shr)&0xFFF)==0) return 0; for(int i=0;i<n_psk31_varicode_items;i++) { //fprintf(stderr,"| i = %d | %llx ?= %llx | bitsall = %d\n", i, psk31_varicode_items[i].code<<2, (*status_shr)&psk31_varicode_masklen_helper[(psk31_varicode_items[i].bitcount+4)&63], (psk31_varicode_items[i].bitcount+4)&63); @@ -1818,7 +1815,7 @@ unsigned char pack_bits_8to1_u8_u8(unsigned char* input) { - unsigned char output; + unsigned char output = 0; for(int i=0;i<8;i++) { output<<=1; @@ -2533,7 +2530,7 @@ int trivial_vectorize() { //this function is trivial to vectorize and should pass on both NEON and SSE - int a[1024], b[1024], c[1024]; + int a[1024] = {0}, b[1024] = {0}, c[1024] = {0}; for(int i=0; i<1024; i++) //@trivial_vectorize: should pass :-) { c[i]=a[i]*b[i];
Locations
Projects
Search
Status Monitor
Help
OpenBuildService.org
Documentation
API Documentation
Code of Conduct
Contact
Support
@OBShq
Terms
openSUSE Build Service is sponsored by
The Open Build Service is an
openSUSE project
.
Sign Up
Log In
Places
Places
All Projects
Status Monitor