Lines Matching refs:node

213 		node := f.nodes.GetNode(filepath.Clean(path), false)
214 		if node == nil || node.ModTime == 0 {
304 	node := f.nodes.GetNode(rootPath, false)
305 	if node == nil {
314 	results := f.findInCacheMultithreaded(node, filter, f.numSearchingThreads)
393 	node := f.nodes.GetNode(path, true)
394 	f.statDirAsync(node)
493 	node := m
496 			return node
509 		child, found := node.children[firstComponent]
513 				child = node.newChild(firstComponent)
519 		node = child
808 	for i, node := range cachedNodes {
810 		stats[i] = f.statDirSync(node.Path)
980 				node := mainTree.GetNode(dir, false)
981 				updatedNodes[j] = node
1072 	for _, node := range f.nodes.DumpAll() {
1073 		if node.ModTime != 0 {
1074 			nodes = append(nodes, node)
1224 		node := f.nodes.GetNode(path, false)
1225 		if node != nil {
1255 	node := dir
1261 			if !f.isInfoUpToDate(node.statResponse, updatedStats) {
1262 				node.mapNode = mapNode{
1267 				if node.statResponse.ModTime != 0 {
1385 func (f *Finder) listDirAsync(node *pathMap) {
1388 			f.listDirSync(node)
1467 func (f *Finder) listMatches(node *pathMap,
1470 		FileNames: node.FileNames,
1472 	entries.DirNames = make([]string, 0, len(node.children))
1473 	for childName := range node.children {
1482 		filePaths = append(filePaths, joinCleanPaths(node.path, fileName))
1486 		child, ok := node.children[childName]
1496 func (f *Finder) findInCacheMultithreaded(node *pathMap, filter WalkFunc,
1501 		return f.findInCacheSinglethreaded(node, filter)
1505 	for _, child := range node.children {
1508 	childrenResults := make(chan []string, len(node.children))
1510 	subDirs, filePaths := f.listMatches(node, filter)
1537 func (f *Finder) findInCacheSinglethreaded(node *pathMap, filter WalkFunc) []string {
1538 	if node == nil {
1542 	nodes := []*pathMap{node}