c - bitwise: different behaviour with negative input value -

-

i'm on hardware/software interface course hosted on coursera, i'm sure you've seen fair few of these questions..

one of assignments determine whether 2's complement integer x can fit n-bits, using subset of operators, etc. i'm doing well, came across 2 separate approaches, , hit whiteboard them both understand them fully. came confusion.

the function returns 1 if possible fit, 0 if not.

method 1 (correct output)

int foobar(int x, int n) {     return !(((x << (32-n)) >> (32-n)) ^x); }

executed positive integer

foobar(5,3)  == 0

correctly calculates 5 cannot represented 2's complement 3 bit integer.

executed negative integer

foobar(-4,3) == 1

correctly calculates -4 can represented 2's complement 3 bit integer.

method 1 analysis

x=5, n=3  00000000000000000000000000011101    32 - n == 29 10100000000000000000000000000000    x<<29 00000000000000000000000000000101    >> 29   00000000000000000000000000000101    5              xor 00000000000000000000000000000101    5 --------------------------------     00000000000000000000000000000000    0  00000000000000000000000000000001   !0 == answer, 1.

as can see, returns 0, in, no 5 may not represented 2's complement integer within 3 bits.

method 2 (incorrect output)

int foobar(int x, int n) {     return !((x & ~(1 << (32-n))) ^x); }

executed positive integer

foobar(5,3)  == 1

false positive.

executed negative integer

foobar(-4,3) == 0

false negative.

method 2 analysis

x=5, n=3  00000000000000000000000000011101    32 - n == 29  11011111111111111111111111111111    ~(1<<29)               , 00000000000000000000000000000101    5 --------------------------------     00000000000000000000000000000101    5   00000000000000000000000000000101    5               xor 00000000000000000000000000000101    5 -------------------------------- 00000000000000000000000000000000    0  00000000000000000000000000000001   !0 == answer, 1.

i compiling with:

gcc version 4.7.2 (debian 4.7.2-5)

question

i'm @ loss explain difference in output, when analysis shows identical @ bit level, hints/tips can shed light on myself highly appreciated.

thank time!

sc.

in method 1, write

10100000000000000000000000000000    x<<29 00000000000000000000000000000101    >> 29

but not correct (note analysis mean foobar(5,3) == 1).

first, result of 5 << 29 causes overflow signed 32-bit (or smaller) ints, undefined behaviour.

next, result, if shift creates indicated bit pattern (as does), negative.

right-shifting negative integers implementation-defined, common arithmetic right shift, sign-extend, , here result in

11111111111111111111111111111101    >> 29

which, when xor-ed 5 gives non-zero result (and applying ! produces 0).

method 2 doesn't work @ all, because, leaving aside undefined behaviour inputs, check whether (32-n)-th bit set.


Popular posts from this blog

How to calculate SNR of signals in MATLAB? -

-
i've encountered simple, yet fundamental problem on calculating snr: there several signals : s1 = original , pure clean signal without noise. n1 = white gaussian noise going added s1. s2 = s1 + n1 (the noisy signal before performing noise-reduction algorithm) s3 = noise-reduced signal (after performing noise reduction algorithm) n2 = s3 - s1 (the amount of noise after performing noise-reduction algorithm) now want compare snr before , after performing noise-reduction algorithm. which signals should consider snr_before!? s1/n1 or s2/n1 ? which signals should consider snr_after!? s3/n1 or s3/n2 ? which commands or functions should use in matlab in order compute snr_before , snr_after? thanks billion putting time on helping me. what know calculating snr before : snrbeforenoise = mean( signal .^ 2 ) / mean( noise .^ 2 ); and snr after : residual_noise = signal - noise_reduced_signal; snr_after = mean( signal .^ 2 ) / mean( residual_noise .^ 2
Read more

c# - Attempting to upload to FTP: System.Net.WebException: System error -

-
i have api takes in xml , uploads files based on information in xml. uploads on schedule (also xml), , have tested surrounding , know works. i getting error 40% of time on first file attempt upload in each time cycle (time cycle = 45 minutes files, 30 minutes others). here code upload: try { loggerftp.log("uploading file: " + filename, false); // create request. ftpwebrequest request = (ftpwebrequest)webrequest.create(appsettingsftp.ftpurl + @"/" + filename); request.method = webrequestmethods.ftp.uploadfile; request.timeout = 6000000; //set 100 minutes //request.timeout = -1; //set infinite // add login credentials. request.credentials = new networkcredential(appsettingsftp.ftplogin, appsettingsftp.ftppassword); // grab file contents. streamreader sourcestream = new streamreader(appsettingsftp.uploadfiledirectory + filename); byte[] filecontents = encoding.utf8.getbytes(sourcestream.readtoend()); sourcest
Read more

ios - UISlider customization: how to properly add shadow to custom knob image -

-
Image
i need place custom knob image shadow uislider. far have image of 38x38, of there region defines shadow of knob. now while using image, when slide knob extreme ends actual knob not able cover end points, hence end points visible under transparent region of knob image this code using customize uislider uiimage *slidebtimg = [uiimage imagenamed:sliderknobimg]; [self.ratingslider setthumbimage:slidebtimg forstate:uicontrolstatenormal]; [self.ratingslider setthumbimage:slidebtimg forstate:uicontrolstatehighlighted]; how can implement custom knob shadow beneath it, covering end points?? look inside uislider.h , there methods let customize slider knob , track needed. (ios 2.0 , above) // lets subclass lay out track , thumb needed - (cgrect)minimumvalueimagerectforbounds:(cgrect)bounds; - (cgrect)maximumvalueimagerectforbounds:(cgrect)bounds; - (cgrect)trackrectforbounds:(cgrect)bounds; - (cgrect)thumbrectforbounds:(cgrect)bounds trackrect:(cgrect)rect value:
Read more