Is there an 'easy' way to convert 32Bit code to 64Bit code. I have this benchmark i need to run on different machines and it would be nice if i could run it on the 64 bit machines ass wel.
The output when compiling(1) and running(2) are the following:
(1)
(2)
The make file and source file can be found here if you want to have a look at it yourself. http://users.pandora.be/steviewilliams/heapsort.zip
Mind that my knowledge of C is very basic .
Greetz
Whats the difference between 32bit and 64bit OS's or applications. I understand it a little but its just not clicking the way the teacher explained to me
thanks, any info would be much appreciated (1 Reply)
when using the command :
cat /proc/cpuinfo I get some basic info back on the cpu..
but it doesn't tell me if I am using a 64 or 32 bit processor ..
a) is this the right command to find this ?
b) if it is not what is ? and how do I get that information..
thanx moxxx68 (2 Replies)
Where can I get a list that maps the each Linux version to corresponding 32/64 bits model?
e.g.
OS -> Model (ILP32, LP64, ...)
RHLE3 -> ?
RHLE4 -> ?
RHLE5 -> ?
...
It would be better if there is such a list that contains most of current UNIX OS versions.
... (1 Reply)
i have solaris 10 x86 64bit installed on my pc (dell 3100). i then decided to move my hard drive to another pc (dell 4600). I noticed that each time i boot up, the OS show as 32 bit (instead of 64bit) and i can't even get past this stage to the login page.
when i moved it back to dell 3100 it... (13 Replies)
Not really a Unix question as such :o, but what advantages or disadvantages are there between using 32bit or 64bit applications on a T5220 running Solaris 10? What about mixing them e.g. 64 bit app using 32 bit libraries or vice versa? (1 Reply)
I have an application which builds and executes without error on a 32bit implementation of Linux. When I transferred the code to a new project on a 64bit implementation, the code will build without error, but the pthread functions, such as pthread_attr_setschedparam() return an 'Invalid Argument'... (3 Replies)
Hi Gurus,
I need to check whether the compiler installed in my system supports 64bit compilation.
Server - Sun fire v490
OS - Solaris 5.9
Processor - Sparcv9 (64bit)
Install Directory - /opt/SUNWSpro
Compiler Model - Sun Forte C Compiler.
My development team is claiming that there... (20 Replies)
Hi,
I have a C code which builds and works fine on 32bit linux machine.
Now i want to convert that code to build and run on 64 bit linux machine. I dont want to maintain two separate sources for 32 and 64 bit build. Same source should get build on 32 as well as 64 bit machine (when a... (2 Replies)
Hello, I am trying to use a worktool on SLES 10 (32-bit) and it is saying I do not have libcap.so.2:
error while loading shared libraries: libcap.so.2: cannot open shared object file: No such file or directory
Is there an easy way for me to install this library? A quick Google search... (4 Replies)
Discussion started by: bstring
4 Replies
LEARN ABOUT OPENSOLARIS
heapsort
QSORT(3) BSD Library Functions Manual QSORT(3)NAME
heapsort, mergesort -- sort functions
LIBRARY
Utility functions from BSD systems (libbsd, -lbsd)
SYNOPSIS
#include <bsd/stdlib.h>
int
heapsort(void *base, size_t nmemb, size_t size, int (*compar)(const void *, const void *));
int
mergesort(void *base, size_t nmemb, size_t size, int (*compar)(const void *, const void *));
DESCRIPTION
The heapsort() function is a modified selection sort. The mergesort() function is a modified merge sort with exponential search intended for
sorting data with pre-existing order.
The heapsort() function sorts an array of nmemb objects, the initial member of which is pointed to by base. The size of each object is spec-
ified by size. The mergesort() function behaves similarly, but requires that size be greater than ``sizeof(void *) / 2''.
The contents of the array base are sorted in ascending order according to a comparison function pointed to by compar, which requires two
arguments pointing to the objects being compared.
The comparison function must return an integer less than, equal to, or greater than zero if the first argument is considered to be respec-
tively less than, equal to, or greater than the second.
The algorithm implemented by heapsort() is not stable, that is, if two members compare as equal, their order in the sorted array is unde-
fined. The mergesort() algorithm is stable.
The heapsort() function is an implementation of J.W.J. William's ``heapsort'' algorithm, a variant of selection sorting; in particular, see
D.E. Knuth's Algorithm H. Heapsort takes O N lg N worst-case time. Its only advantage over qsort() is that it uses almost no additional
memory; while qsort() does not allocate memory, it is implemented using recursion.
The function mergesort() requires additional memory of size nmemb * size bytes; it should be used only when space is not at a premium. The
mergesort() function is optimized for data with pre-existing order; its worst case time is O N lg N; its best case is O N.
Normally, qsort() is faster than mergesort() is faster than heapsort(). Memory availability and pre-existing order in the data can make this
untrue.
RETURN VALUES
The heapsort() and mergesort() functions return the value 0 if successful; otherwise the value -1 is returned and the global variable errno
is set to indicate the error.
ERRORS
The heapsort() and mergesort() functions succeed unless:
[EINVAL] The size argument is zero, or, the size argument to mergesort() is less than ``sizeof(void *) / 2''.
[ENOMEM] The heapsort() or mergesort() functions were unable to allocate memory.
SEE ALSO sort(1), radixsort(3)
Williams, J.W.J, "Heapsort", Communications of the ACM, 7:1, pp. 347-348, 1964.
Knuth, D.E., "Sorting and Searching", The Art of Computer Programming, Vol. 3, pp. 114-123, 145-149, 1968.
McIlroy, P.M., "Optimistic Sorting and Information Theoretic Complexity", Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, January
1992.
Bentley, J.L. and McIlroy, M.D., "Engineering a Sort Function", Software--Practice and Experience, Vol. 23(11), pp. 1249-1265,
November 1993.
BSD September 30, 2003 BSD