I am trying to create a debug version of the eglibc to allow step by step debugging in a program that crashes in the eglibc.  I want the created ".so" file to be as close as possible to the eglibc that comes with my version of Ubuntu (14.04 x64) (with the same options, patches, etc.) with the exception of the debugging facilities.  So far I am having a hard time finding an exact procedure to do that. It is becoming frustrating and time-consuming, so would anybody be kind enough to provide that procedure to me, please?
How do I get the source code for eglibc in a format that will allow stepping through the source with gdb?    I have tried using apt-get source libc6-dev and that works for getting the source code, but I think that since the pre-processor directives were not applied that the line numbers that gdb has does not match with the source I downloaded. This makes it less useful when trying to step through the source and look at how functions in libc are working.
I understand how to define include shared objects at linking/compile time. However, I still wonder how do executables look for the shared object (*.so libraries) at execution time.  For instance, my app a.out calls functions defined in the lib.so library. After compiling, I move lib.so to a new directory in my $HOME.  How can I tell a.out to go look for it there? System.Drawing in Windows or ASP.NET services According to , it is not a particularly good idea to use classes within the System.Drawing namespace in a Windows Service or ASP.NET Service. Now I am developing a class library which might need to access this particular namespace (for measuring fonts) but it cannot be guaranteed that the host process is not a service.  Now there is a less optimal method I can fall back to if System.Drawing is unavailable, but if it is possible, I would rather use classes in System.Drawing. So what I would like to do is to determine at runtume if System.Drawing is safe or not, and if it is, use it, otherwise fall back to the suboptimal option.  My problem is: How could I possibly detect if System.Drawing is safe to use?  I think I should either   Detect if the current process is a Windows Service or ASP.NET service Detect if GDI is available Or maybe there is a way to ask System.Drawing.dll itself if it is safe to use   Unfortunately, I cannot come up with a way to implement any of these approaches. Does anyone have any idea? When I capture packets using the packet analyser wireshark while visiting  I can see packets that use the HTTP protocol (e.g.a GET request). My Get request uses 4 protocols: Ethernet II, IPv4, TCP and HTTP.  For the IPv4 I can see my own local IPv4 address of my pc as the source, for the destination I see the IPv4 address 91.198.174.225. When I go to this address in my browser I get to some wikipedia related website that says'wiki does not exist'. Why am I not seeing the Hydrogen article when I go to that ip address? How to disable the touchpad? I want my touchpad to be disabled when I use my mouse. How can I do that? touchpad-indicator has stopped working on 11.10. It used to work on 11.04. Gnome3 is not a solution as I don't like it and find it buggy. Connectedness in the Quotient Space For some reasons, I would like to do an explicit quoting of a string value (becoming a part of constructed SQL query) instead of waiting for implicit quotation performed by cursor.execute method on contents of its second parameter.  By "implicit quotation" I mean:  value = "Unsafe string" query = "SELECT * FROM some_table WHERE some_char_field = %s;" cursor.execute( query, (value,) ) # value will be correctly quoted   I would prefer something like that:  value = "Unsafe string" query = "SELECT * FROM some_table WHERE some_char_field = %s;" % \     READY_TO_USE_QUOTING_FUNCTION(value) cursor.execute( query ) # value will be correctly quoted, too   Is such low level READY_TO_USE_QUOTING_FUNCTION expected by Python DB API specification (I couldn't find such functionality in  document). If not, maybe Psycopg2 provides such function? If not, maybe Django provides such function? I would prefer not to write such function myself... Quotient groups of D10 How do I find the groups D10/N where N is the normal subgroups to D10?  I know that the definition is aN for all a $\in$ D10. But I am unsure what the group, for example, D10/ D10 looks like? Any help would be much appreciated. Mounting Flashdrive - mounted to home directory I wanted to mount my flashdrive, and made the mistake of setting the mount path as /home/my_name. Now all of my documents, downloads, pictures, etc. are unavailable since my flashdrive has replaced my previous home folder.  When I go to terminal and type sudo umount /home/my_name I get the error message:   umount: /home/my_name: device is busy.         (In some cases useful info about processes that use          the device is found by lsof(8) or fuser(1))   Is there a way to fix this, where I can restore my old /home/my_name folder and then mount the flashdrive to a proper location? Merging multiple vector layers to one layer using QGIS What is Renly's basis for removing Joffrey? Related question:   I get that he considers himself a better king than Stannis, but why isn't he ?  Did Renly know about Joffrey being illegitimate? I always thought he didn't and was distrustful that Cersei would accept Ned as Regent.  I think in both the books and the series, Renly finds out Joffrey is illegitimate from Stannis' letters, but rewatching that clips makes me think Renly was with Ned, Varys and LF in the plan to arrest Joffrey and Cersei.  [looks up something]  Oh also . So Renly did know? Show that $[0, 1)\times[0, 1)$ is homeomorphic to $[0, 1]\times[0, 1)$ but not to $[0, 1]\times[0, 1]$. When I sketch these spaces it this statement makes sense intuitively because $[0, 1]\times[0, 1]$ is closed and $[0, 1)\times[0, 1)$ and $[0, 1]\times[0, 1)$ are each "missing" part of their boundary which would make them closed. I also know, $[0, 1]\times[0, 1]$ is compact and compact spaces are not homeomorphic to non-compact spaces.   I am having trouble saying this explicitly, as is pretty obvious in the clumsiness of the wording above. SBS 2011 - Is Store.exe High Memory Usage Normal? Is starting a group with 5 newbies (DM included) possible? Some friends and I want to start playing D&amp;D (5e), but none of us, DM included (not me) have played before to any great extent. The DM and I have some cursory experience with 4e, but have never been able to play to any great extent. Is this advisable, or should we play with existing groups first? We live in a relatively remote area, making it hard to find experienced players. Bidirectional 1 to 1 Dictionary in C# I am looking for a generic, bidirectional 1 to 1 Dictionary class in C# (2), ie. a BiDictionaryOneToOne&lt;T, S&gt; which is guaranteed to only contain one of each value and key (up to RefEquals anyway), and which can be searched using either key or value. Anyone know of one, or should I just implement it myself? I can't believe that I'm the first person to need this...  There is a BiDictionary in the answers to , but it is not for unique elements (and also does not implement RemoveByFirst(T t) or RemoveBySecond(S s)).   Thanks! Recover harddrive data I have a dell laptop that recently "died" (It would get the blue screen of death upon starting) and the hard drive would make a weird cyclic clicking noises.  I wanted to see if I could use some tools on my linux machine to recover the data, so I plugged it into there.  If I run "fdisk" I get:  Disk /dev/sdb: 20.0 GB, 20003880960 bytes 64 heads, 32 sectors/track, 19077 cylinders Units = cylinders of 2048 * 512 = 1048576 bytes Disk identifier: 0x64651a0a  Disk /dev/sdb doesn't contain a valid partition table   Fine, the partition table is messed up.  However if I run "testdisk" in attempt to fix the table, it freezes at this point, making the same cyclical clicking noises:  Disk /dev/sdb - 20 GB / 18 GiB - CHS 19078 64 32 Analyse cylinder   158/19077: 00%   I don't really care about the hard drive working again, and just the data, so I ran "gpart" to figure out where the partitions used to be.  I got this:  dev(/dev/sdb) mss(512) chs(19077/64/32)(LBA) #s(39069696) size(19077mb)  * Warning: strange partition table magic 0x2A55. Primary partition(1)    type: 222(0xDE)(UNKNOWN)    size: 15mb #s(31429) s(63-31491)    chs:  (0/1/1)-(3/126/63)d (0/1/32)-(15/24/4)r    hex:  00 01 01 00 DE 7E 3F 03 3F 00 00 00 C5 7A 00 00  Primary partition(2)    type: 007(0x07)(OS/2 HPFS, NTFS, QNX or Advanced UNIX) (BOOT)    size: 19021mb #s(38956987) s(31492-38988478)    chs:  (4/0/1)-(895/126/63)d (15/24/5)-(19037/21/31)r    hex:  80 00 01 04 07 7E FF 7F 04 7B 00 00 BB 6F 52 02   So I tried to mount just to the old NTFS partition, but got an error:  sudo mount -o loop,ro,offset=16123904 -t ntfs /dev/sdb /mnt/usb NTFS signature is missing.   Ugh.  Okay.  But then I tried to get a raw data dump by running  dd if=/dev/sdb of=/home/erik/brokenhd skip=31492 count=38956987    But the file got up to 59885568 bytes, and made the same cyclical clicking noises.  Obviously there is a bad sector, but I don't know what to do about it!  The data is still there... if I view that 57MB file in textpad... I can see raw data from files.  How can I get my data back?  Thanks for any suggestions,  Solution:  I was able to recover about 90% of my data:   Froze harddrive in freezer Used Ddrescue to make a copy of the drive Since Ddrescue wasn't able to get enough of my drive to use testdisk to recover my partitions/file system, I ended up using photorec to recover most of my files If $x^n + a_{n-1}x^{n-1} + ... + a_0 = 0$ has a rational root, then such root is an integer Let $n &gt; 0$ and let $a_{n-1}, ..., a_0$ be integers. Prove that, if $x^n + a_{n-1}x^{n-1} + ... + a_0 = 0$ has a rational root, then such root is an integer.   I understand that posting questions without showing your work is frowned upon, but I don't know where to start with this one.. thanks in advance. Is there a limit to the number of magic rings a character can wear on one hand? Cookie blocked/not saved in IFRAME in Internet Explorer I have two websites, let's say they're example.com and anotherexample.net. On anotherexample.net/page.html, I have an IFRAME SRC="http://example.com/someform.asp". That IFRAME displays a form for the user to fill out and submit to http://example.com/process.asp. When I open the form ("someform.asp") in its own browser window, all works well. However, when I load someform.asp as an IFRAME in IE 6 or IE 7, the cookies for example.com are not saved. In Firefox this problem doesn't appear.  For testing purposes, I've created a similar setup on  .  example.com uses cookie-based sessions (and there's nothing I can do about that), so without cookies, process.asp won't execute. How do I force IE to save those cookies?  Results of sniffing the HTTP traffic: on GET /someform.asp response, there's a valid per-session Set-Cookie header (e.g. Set-Cookie: ASPKSJIUIUGF=JKHJUHVGFYTTYFY), but on POST /process.asp request, there is no Cookie header at all.  Edit3: some AJAX+serverside scripting is apparently capable to sidestep the problem, but that looks very much like a bug, plus it opens a whole new set of . I don't want my applications to use a combination of bug+security hole just because it's easy.  Edit: the P3P policy was the root cause, full explanation below. I am designing a poster, which has some geometrical shapes (TikZ paths) surrounded by some text. I would like the text to flow neatly around these shapes. I bet there's some clever TikZ magic that could do this.  EDIT: This is the sort of effect I want, sorry to not be clear:    \documentclass[a4paper]{article} \usepackage{tikz} \begin{document} \begin{tikzpicture} \draw (0,0) to (2,-2) to (2,-4) to (4,-4) to [out=up, in=down] (6.5,0); \node [text width=6cm, anchor=north west] at (0,0) { \hspace{5pt}  This is the sort of effect I want to \\ \hspace{23pt} achieve, with text automatically \\ \hspace{36pt} constrained by some \\ \hspace{46pt} geometrical form. Here \\ \hspace{55pt} it's just a curve, \\ \hspace{57pt} but this could \\ \hspace{57pt} also be the \\ \hspace{57pt} text label \\ \hspace{57pt} of a node.}; \end{tikzpicture} \end{document} I always know that the natural logarithm $\log_e$ is the inverse of the exponential function $e$, but to my surprise when reading elementary functions in complex analysis, I discover that that is not always true. $$\log(e^z)=z+2k\pi i$$  My question here is that, why is the above expression true?