def find_file_updir( filename, dir = os.getcwd(), access = os.R_OK ):
"""Find a file in directory <dir> or its higher level dirs."""
curdir = os.path.abspath( dir )
fullfile = os.path.join( curdir, filename )
if fileutil.access( fullfile, access ): return fullfile
#go up in directory tree
updir = os.path.dirname(curdir)
while updir != curdir:
curdir = updir
fullfile = os.path.join( curdir, filename )
if fileutil.access( fullfile, access ): return fullfile
updir = os.path.dirname(curdir)
return None
def find_file_updir( filename, dir = os.getcwd(), access = os.R_OK ):
"""Find a file in directory <dir> or its higher level dirs."""
curdir = os.path.abspath( dir )
fullfile = os.path.join( curdir, filename )
if fileutil.access( fullfile, access ): return fullfile
#go up in directory tree
updir = os.path.dirname(curdir)
while updir != curdir:
curdir = updir
fullfile = os.path.join( curdir, filename )
if fileutil.access( fullfile, access ): return fullfile
updir = os.path.dirname(curdir)
return None
def find_file_split( filename, dirlist = [ os.getcwd() ], access = os.R_OK, depth = 0 ):
"""Search for file <filename> with access rights <access> (see os.access()) in directory list <dirlist>.
Search into directory tree of each directory in <dirlist> up to depth <depth>. The default directory
list is a list containing only the current working directory.
No wildcards are allowed in <filename>.
<depth> = 0 : only search in directories given in list.
<depth> > 0 : descend deeper into the directory tree up to max <depth> levels.
<depth> < 0 : ascend upwards into the directory tree up to max -<depth> levels.
It returns 2-tuple (dir,file) where:
file=<filename> if no wildcards, or the actual (local) match to <filename> if wildcarded.
dir=the directory where <file> was found (from <dirlist>, or from a subdir if depth > 0)
If no file is found, it returns None."""
if not dirlist: return None
for dir in dirlist:
dir = os.path.abspath( os.path.expandvars( os.path.expanduser(dir) ) )
if not os.path.isdir(dir): continue
fullfile = os.path.join( dir, filename )
# print "Checking file %s..." % fullfile
if fileutil.access( fullfile, access ):
return (dir,filename)
if depth == 0:
# not found at all
return None
elif depth > 0:
# not found at this level. Go one level down in directory structure
for dir in dirlist:
dir = os.path.abspath( os.path.expandvars( os.path.expanduser(dir) ) )
if not os.path.isdir(dir): continue
subdirlist = []
for d in fileutil.listdir(dir):
fulldir = os.path.join(dir,d)
if os.path.isdir(fulldir):
subdirlist.append( fulldir )
if subdirlist:
found = find_file_split( filename, subdirlist, access, depth - 1 )
if found: return found
elif depth < 0:
# not found at this level. Go one level up in directory structure
for dir in dirlist:
dir = os.path.abspath( os.path.expandvars( os.path.expanduser(dir) ) )
if not os.path.isdir(dir): continue
updir = os.path.dirname(dir)
if updir != dir:
found = find_file_split( filename, [ updir ], access, depth + 1 )
if found: return found
# not found at all
return None
def find_file_split( filename, dirlist = [ os.getcwd() ], access = os.R_OK, depth = 0 ):
"""Search for file <filename> with access rights <access> (see os.access()) in directory list <dirlist>.
Search into directory tree of each directory in <dirlist> up to depth <depth>. The default directory
list is a list containing only the current working directory.
No wildcards are allowed in <filename>.
<depth> = 0 : only search in directories given in list.
<depth> > 0 : descend deeper into the directory tree up to max <depth> levels.
<depth> < 0 : ascend upwards into the directory tree up to max -<depth> levels.
It returns 2-tuple (dir,file) where:
file=<filename> if no wildcards, or the actual (local) match to <filename> if wildcarded.
dir=the directory where <file> was found (from <dirlist>, or from a subdir if depth > 0)
If no file is found, it returns None."""
if not dirlist: return None
for dir in dirlist:
dir = os.path.abspath( os.path.expandvars( os.path.expanduser(dir) ) )
if not os.path.isdir(dir): continue
fullfile = os.path.join( dir, filename )
# print "Checking file %s..." % fullfile
if fileutil.access( fullfile, access ):
return (dir,filename)
if depth == 0:
# not found at all
return None
elif depth > 0:
# not found at this level. Go one level down in directory structure
for dir in dirlist:
dir = os.path.abspath( os.path.expandvars( os.path.expanduser(dir) ) )
if not os.path.isdir(dir): continue
subdirlist = []
for d in fileutil.listdir(dir):
fulldir = os.path.join(dir,d)
if os.path.isdir(fulldir):
subdirlist.append( fulldir )
if subdirlist:
found = find_file_split( filename, subdirlist, access, depth - 1 )
if found: return found
elif depth < 0:
# not found at this level. Go one level up in directory structure
for dir in dirlist:
dir = os.path.abspath( os.path.expandvars( os.path.expanduser(dir) ) )
if not os.path.isdir(dir): continue
updir = os.path.dirname(dir)
if updir != dir:
found = find_file_split( filename, [ updir ], access, depth + 1 )
if found: return found
# not found at all
return None
def find_files_split( filename, dirlist, access, depth ):
"""Search for all (regular) files that match <filename> with access rights <access> (see os.access())
in directory list <dirlist>.
Search is done into subdirectories each directory up to depth <depth>.
The default value for <dirlist> is the current working directory.
If the same file (without the directory name) is found in more than one places, only the first match is kept.
<filename> : can contain wildcards as used on the unix command line.
<depth> = 0 : only search in directories given in list.
<depth> < 0 : treated as = 0
<depth> > 0 : descend deeper into the directory tree up to max <depth> levels.
It returns a list of 2-tuples (dir,file) where
file=<filename> if no wildcards, or the actual (local) match to <filename> if wildcarded.
dir=the directory where <file> was found (from <dirlist>, or from a subdir if depth > 0)
If none is found, an empty list is returned."""
# if dirlist is None:
# return []
if depth < 0: depth = 0
# to speed up search, do a single file search if the filename does not contain wildcards
if not has_wildcards(filename):
singleFile = find_file_split( filename, dirlist, access, depth )
if singleFile:
return [ singleFile ]
else:
return []
# filename has wildcards. Find all (first) files that match.
filenameList = [] # the list of files to return
dirnameList = [] # keep track of files already found
for dir in dirlist:
dir = os.path.abspath( os.path.expandvars( os.path.expanduser(dir) ) )
# protect against non-existing entries
if not os.path.isdir(dir): continue
olddir = os.getcwd()
os.chdir(dir)
## print "Checking files %s..." % fullfile
filelist = glob.glob(filename)
for f in filelist:
## print "Trying %s..." % f
if not os.path.isfile(f) or not fileutil.access(f, access): continue
if not f in filenameList:
fullfile = os.path.join( dir, f )
## print "==> Adding %s to list from %s" % (f,dir)
dirnameList.append(dir)
filenameList.append(f)
else:
pass
## print "==> Already have %s in list" % (base)
os.chdir(olddir)
if depth > 0:
# Go one level down in directory structure
for dir in dirlist:
dir = os.path.abspath( os.path.expandvars( os.path.expanduser(dir) ) )
# protect against non-existing entries
if not os.path.isdir(dir): continue
subdirlist = []
for d in fileutil.listdir(dir):
fulldir = os.path.join(dir,d)
if os.path.isdir(fulldir):
subdirlist.append( fulldir )
if subdirlist:
filelist = find_files_split( filename, subdirlist, access, depth - 1 )
for f in filelist:
if not f[1] in filenameList:
dirnameList.append(f[0])
filenameList.append(f[1])
return map( lambda arg1,arg2 : (arg1,arg2) , dirnameList, filenameList )
def find_files_split( filename, dirlist, access, depth ):
"""Search for all (regular) files that match <filename> with access rights <access> (see os.access())
in directory list <dirlist>.
Search is done into subdirectories each directory up to depth <depth>.
The default value for <dirlist> is the current working directory.
If the same file (without the directory name) is found in more than one places, only the first match is kept.
<filename> : can contain wildcards as used on the unix command line.
<depth> = 0 : only search in directories given in list.
<depth> < 0 : treated as = 0
<depth> > 0 : descend deeper into the directory tree up to max <depth> levels.
It returns a list of 2-tuples (dir,file) where
file=<filename> if no wildcards, or the actual (local) match to <filename> if wildcarded.
dir=the directory where <file> was found (from <dirlist>, or from a subdir if depth > 0)
If none is found, an empty list is returned."""
# if dirlist is None:
# return []
if depth < 0: depth = 0
# to speed up search, do a single file search if the filename does not contain wildcards
if not has_wildcards(filename):
singleFile = find_file_split( filename, dirlist, access, depth )
if singleFile:
return [ singleFile ]
else:
return []
# filename has wildcards. Find all (first) files that match.
filenameList = [] # the list of files to return
dirnameList = [] # keep track of files already found
for dir in dirlist:
dir = os.path.abspath( os.path.expandvars( os.path.expanduser(dir) ) )
# protect against non-existing entries
if not os.path.isdir(dir): continue
olddir = os.getcwd()
os.chdir(dir)
## print "Checking files %s..." % fullfile
filelist = glob.glob(filename)
for f in filelist:
## print "Trying %s..." % f
if not os.path.isfile(f) or not fileutil.access(f, access): continue
if not f in filenameList:
fullfile = os.path.join( dir, f )
## print "==> Adding %s to list from %s" % (f,dir)
dirnameList.append(dir)
filenameList.append(f)
else:
pass
## print "==> Already have %s in list" % (base)
os.chdir(olddir)
if depth > 0:
# Go one level down in directory structure
for dir in dirlist:
dir = os.path.abspath( os.path.expandvars( os.path.expanduser(dir) ) )
# protect against non-existing entries
if not os.path.isdir(dir): continue
subdirlist = []
for d in fileutil.listdir(dir):
fulldir = os.path.join(dir,d)
if os.path.isdir(fulldir):
subdirlist.append( fulldir )
if subdirlist:
filelist = find_files_split( filename, subdirlist, access, depth - 1 )
for f in filelist:
if not f[1] in filenameList:
dirnameList.append(f[0])
filenameList.append(f[1])
return map( lambda arg1,arg2 : (arg1,arg2) , dirnameList, filenameList )