mirror of
https://github.com/golang/go
synced 2024-10-05 01:31:22 -06:00
870c91aec2
R=rsc OCL=27304 CL=27304
80 lines
1.8 KiB
Go
80 lines
1.8 KiB
Go
// Copyright 2009 The Go Authors. All rights reserved.
|
|
// Use of this source code is governed by a BSD-style
|
|
// license that can be found in the LICENSE file.
|
|
|
|
package os
|
|
|
|
import (
|
|
"syscall";
|
|
"os";
|
|
"unsafe";
|
|
)
|
|
|
|
const (
|
|
blockSize = 4096 // TODO(r): use statfs
|
|
)
|
|
|
|
func clen(n []byte) int {
|
|
for i := 0; i < len(n); i++ {
|
|
if n[i] == 0 {
|
|
return i
|
|
}
|
|
}
|
|
return len(n)
|
|
}
|
|
|
|
// Negative count means read until EOF.
|
|
func readdirnames(file *File, count int) (names []string, err *os.Error) {
|
|
// If this file has no dirinfo, create one.
|
|
if file.dirinfo == nil {
|
|
file.dirinfo = new(dirInfo);
|
|
// The buffer must be at least a block long.
|
|
// TODO(r): use fstatfs to find fs block size.
|
|
file.dirinfo.buf = make([]byte, blockSize);
|
|
}
|
|
d := file.dirinfo;
|
|
size := count;
|
|
if size < 0 {
|
|
size = 100
|
|
}
|
|
names = make([]string, 0, size); // Empty with room to grow.
|
|
for count != 0 {
|
|
// Refill the buffer if necessary
|
|
if d.bufp == d.nbuf {
|
|
var errno int64;
|
|
dbuf := (*syscall.Dirent)(unsafe.Pointer(&d.buf[0]));
|
|
d.nbuf, errno = syscall.Getdents(file.fd, dbuf, int64(len(d.buf)));
|
|
if d.nbuf < 0 {
|
|
return names, os.ErrnoToError(errno)
|
|
}
|
|
if d.nbuf == 0 {
|
|
break // EOF
|
|
}
|
|
d.bufp = 0;
|
|
}
|
|
// Drain the buffer
|
|
for count != 0 && d.bufp < d.nbuf {
|
|
dirent := (*syscall.Dirent)(unsafe.Pointer(&d.buf[d.bufp]));
|
|
d.bufp += int64(dirent.Reclen);
|
|
if dirent.Ino == 0 { // File absent in directory.
|
|
continue
|
|
}
|
|
var name = string(dirent.Name[0:clen(dirent.Name)]);
|
|
if name == "." || name == ".." { // Useless names
|
|
continue
|
|
}
|
|
count--;
|
|
if len(names) == cap(names) {
|
|
nnames := make([]string, len(names), 2*len(names));
|
|
for i := 0; i < len(names); i++ {
|
|
nnames[i] = names[i]
|
|
}
|
|
names = nnames;
|
|
}
|
|
names = names[0:len(names)+1];
|
|
names[len(names)-1] = name;
|
|
}
|
|
}
|
|
return names, nil;
|
|
}
|