luk*_*ell 1 c qsort segmentation-fault
我正在尝试根据手册页使用 qsort,但无论我尝试什么,我都会遇到段错误
这是重要的代码部分
int compare_dirent(const void *a, const void *b)
{
const struct dirent *first = (const struct dirent *) a;
const struct dirent *second = (const struct dirent *) b;
return first->d_ino - second->d_ino;
}
int process(FILE* output,const char *dirname, int flags)
{
struct dirent *entries = NULL;
struct dirent *table[256];
int entry_num = 0;
DIR *directory = NULL;
char cwd[1024];
getcwd(cwd,1024);
bzero(table,256);
directory = opendir(dirname);
while((entries = readdir(directory))!=NULL)
{
if(entries->d_type == DT_REG)
{
fprintf(output,"%s\t\n",entries->d_name);
table[entry_num] = entries;
entry_num++;
}
}
fprintf(stderr,"last entry: %s\n", table[entry_num-1]->d_name);
/* RIGHT HERE */
qsort(table, entry_num, sizeof(struct dirent), &compare_dirent);
return entry_num;
}
Run Code Online (Sandbox Code Playgroud)
运行 gdb 时,我会fprintf在 while 循环中看到目录中的文件列表,并看到最后一个条目。我在 compare 中放置了一个断点,该断点执行 N 次,其中 N 是文件数,然后我立即从 _qsort 得到一个 SEGFAULT。
在从 qsort 第 N 次调用 compare_dirent 时,它崩溃了。
这是 gdb 输出
Starting program: /Users/luke/Documents/Dev/code/cs647/prog2/bin/prog2 ./
Reading symbols for shared libraries +........................ done
.main.c.swp
get_pdf.sh
main.c
main.o
Makefile
program2.pdf
test.txt
last entry: test.txt
Breakpoint 1, compare_dirent (a=0x7fff5fbff018, b=0x7fff5fbfec00) at main.c:88
88 const struct dirent *first = (const struct dirent *) a;
(gdb) n
89 const struct dirent *second = (const struct dirent *) b;
(gdb) n
91 return first->d_ino - second->d_ino;
(gdb) c
Continuing.
Breakpoint 1, compare_dirent (a=0x7fff5fbff430, b=0x7fff5fbfec00) at main.c:88
88 const struct dirent *first = (const struct dirent *) a;
(gdb) c
Continuing.
Breakpoint 1, compare_dirent (a=0x7fff5fbff848, b=0x7fff5fbfec00) at main.c:88
88 const struct dirent *first = (const struct dirent *) a;
(gdb) c
Continuing.
Breakpoint 1, compare_dirent (a=0x7fff5fbffc60, b=0x7fff5fbfec00) at main.c:88
88 const struct dirent *first = (const struct dirent *) a;
(gdb) c
Continuing.
Breakpoint 1, compare_dirent (a=0x7fff5fc00078, b=0x7fff5fbfec00) at main.c:88
88 const struct dirent *first = (const struct dirent *) a;
(gdb) c
Continuing.
Breakpoint 1, compare_dirent (a=0x7fff5fc00490, b=0x7fff5fbfec00) at main.c:88
88 const struct dirent *first = (const struct dirent *) a;
(gdb) c
Continuing.
Program received signal EXC_BAD_ACCESS, Could not access memory.
Reason: KERN_PROTECTION_FAILURE at address: 0x00007fff5fc00490
0x00007fff8e238540 in _qsort ()
Run Code Online (Sandbox Code Playgroud)
解决方案(完整)是两个答案中的一个
int compare_dirent(const void *a, const void *b)
{
const struct dirent *first = (const struct dirent *) a;
const struct dirent *second = (const struct dirent *) b;
return first->d_ino - second->d_ino;
}
int process(FILE* output,const char *dirname, int flags)
{
struct dirent *entries = NULL;
struct dirent table[256];
int entry_num = 0;
DIR *directory = NULL;
char cwd[1024];
getcwd(cwd,1024);
bzero(table,256);
directory = opendir(dirname);
while((entries = readdir(directory))!=NULL)
{
if(entries->d_type == DT_REG)
{
fprintf(output,"%s\t\n",entries->d_name);
memcpy(table+entry_num, entries, sizeof(struct dirent));
entry_num++;
}
}
fprintf(stderr,"size: %lu\n", sizeof(struct dirent));
qsort(table, entry_num, sizeof(struct dirent) , compare_dirent);
fprintf(output,"\n\n");
for(int i=0;i<entry_num;i++)
{
fprintf(output,"%s\n", table[i].d_name);
}
return entry_num;
}
Run Code Online (Sandbox Code Playgroud)
您的问题之一是:
qsort(table, entry_num, sizeof(struct dirent), &compare_dirent);
Run Code Online (Sandbox Code Playgroud)
应该:
qsort(table, entry_num, sizeof(struct dirent *), &compare_dirent);
Run Code Online (Sandbox Code Playgroud)
第三个元素是width,每个对象的大小。由于table是 的数组struct dirent *,这就是您想要的大小。
您还滥用了 readdir 返回的值。从文档:
readdir() 返回的指针指向的数据可能会被同一目录流上的另一个 readdir() 调用覆盖。
这意味着很可能表中的所有值都是相同的指针,具有相同的值。您可以使用readdir_r,或者只是分配struct dirent(每个 readdir 调用一个),并在适当的位置 memcpy 值。
另一种方法是将其更改为 的数组struct dirent,在这种情况下,您将使用原始qsort调用。