Re: How to tell where a symbol is satisfied from.

Reg Clemens wrote:
...
How do I find out where this symbol is defined???
...

Ok, this is kinda stupid, but Google finds it in BSD libc:

44 /*
45 * Return remainder after dividing two signed quads.
46 *
47 * XXX
48 * If -1/2 should produce -1 on this machine, this code is wrong.
49 */
50 longlong_t
51 ___moddi3(longlong_t a, longlong_t b)

so I checked there on FC5 as well:

$ nm /lib/libc.so.6 | grep moddi
4f30f980 T __moddi3@xxxxxxxxx
4f30f980 t __moddi3_internal
4f30fcd1 T __umoddi3@xxxxxxxxx
4f30fcd1 t __umoddi3_internal

Sorry, I have no idea why it's undefined under FC6.

<Joe

--
fedora-list mailing list
fedora-list@xxxxxxxxxx
To unsubscribe: https://www.redhat.com/mailman/listinfo/fedora-list

Relevant Pages

  • Re: A REPUNIT OBSERVATION - 2
    ... > Let Rn denote the n-digit repunit. ... remainder 1. ... IS THE SAME AS THE SMALLEST k WITH q DIVIDING Rk. ... it says that every p divides q-1.) ...
    (sci.math.research)
  • Re: To find a prime do you only need to check remainder in dividing by smaller primes only?
    ... to check for a remainder in dividing by only primes smaller than the ... I am trying to develop an efficient algorithm for checking if a number ... So if we have already tried dividing A by 2, ...
    (sci.math)
  • Re: Why is 12345678, 85263147, etc. always divisible by 9?
    ... Don't know the divisibility rule fby 9? ... In general, if you have two numbers x and y, and you want to divide ... them by a third number z>0, then: if the remainder when you divide x ... the remainder of dividing x+y by z is the same as the ...
    (sci.math)
  • Re: OT: really neat web site/trick
    ... using the "casting nines" method of calculating the remainder after dividing by nine. ... Subtracting this number from your original number will always give you a number that is divisible by nine, and all of those numbers will have the same symbol. ...
    (comp.sys.hp.mpe)