Posted
by osgx
on Stack Overflow
See other posts from Stack Overflow
or by osgx
Published on 2010-04-07T14:31:25Z
Indexed on
2010/04/07
14:33 UTC
Read the original article
Hit count: 368
Hello
How can I enable mtrace() (and MALLOC_TRACE env) for a binary program without sources?
Thanks
© Stack Overflow or respective owner
as seen on Server Fault
- Search for 'Server Fault'
Any ideas on how to get this to not fail?
# yum update
Freeing read locks for locker 0x82: 4189/140342084876032
Freeing read locks for locker 0x84: 4189/140342084876032
Freeing read locks for locker 0x85: 4189/140342084876032
Freeing read locks for locker 0x86: 4189/140342084876032
Freeing read locks…
>>> More
as seen on Super User
- Search for 'Super User'
Using gcc-4.4.4 or 4.5.0, I'm unable to make glibc-2.11.2 on RHEL 5.5:
.././scripts/mkinstalldirs /dev/shm/glibc-2.11.2-build/sunrpc/rpcsvc
CPP='gcc -B/home/klaw/share/rhel5/ -E -x c-header' /dev/shm/glibc-2.11.2-build/elf/ld-linux-x86-64.so.2 --library-path /dev/shm/glibc-2.11.2-build:/dev/shm/glibc-2…
>>> More
as seen on Server Fault
- Search for 'Server Fault'
I'm trying to install glibc2 version 2.11 that's needed for openoffice 3.4
https://issues.apache.org/ooo/show_bug.cgi?id=119393
but i can't seem to find the dependency with yum.
I already have the following dependencies installed.
glibc.i686 2.5-49.el5_5.7 …
>>> More
as seen on Server Fault
- Search for 'Server Fault'
I have a static version of wkhtmltopdf which requires glibc-2.4
wkhtmltopdf: /lib/tls/libc.so.6: version `GLIBC_2.4' not found (required by wkhtmltopdf)
I have apt installed with the DAG repos. Other than that the server is pretty stock standard except for Coldfusion MX7.
My question is, is it…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
Is there a way to find out from .a file what version of glibc is expected or was used when building the .a?
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
I'm currently helping a friend debug a program of his, which includes linked lists. His list structure is pretty simple:
typedef struct nodo{
int cantUnos;
char* numBin;
struct nodo* sig;
}Nodo;
We've got the following code snippet:
void insNodo(Nodo** lista, char* auxBin, int auxCantUnos){
…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
Hello,
I am playing around with multidimensional array of unequal second dimension size.
Lets assume that I need the following data structure:
[&ptr0]-[0][1][2][3][4][5][6][7][8][9]
[&ptr1]-[0][1][2]
[&ptr2]-[0][1][2][3][4]
int main()
{
int *a[3];
int *b;
int i;
a[0] = (int *)malloc(10…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
I trying to allocate memory for 10 bytes
BYTE* tmp;
tmp = new BYTE[10];
//or tmp = (BYTE*)malloc(10*sizeof(BYTE));
But after new or malloc operation length of *tmp more than 10 (i.e. '\0' char not in 10 position in tmp array)
Why?
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
Hi all,
I just started out with C and have very little knowledge about performance issues with malloc() and free(). My question is as such: if I were to call malloc() followed by free() in a while-loop that loops for, say, 20 times, would it run slower compared to if I were to call free() outside…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
I am a beginner in C. While reading git's source code, I found this wrapper function around malloc.
void *xmalloc(size_t size)
{
void *ret = malloc(size);
if (!ret && !size)
ret = malloc(1);
if (!ret) {
release_pack_memory(size, -1);
ret = malloc(size);
…
>>> More
