search_path        85 drivers/scsi/aic7xxx/aicasm/aicasm.c struct path_list search_path;
search_path       127 drivers/scsi/aic7xxx/aicasm/aicasm.c 	SLIST_INIT(&search_path);
search_path       219 drivers/scsi/aic7xxx/aicasm/aicasm.c 				for (include_dir = SLIST_FIRST(&search_path);
search_path       242 drivers/scsi/aic7xxx/aicasm/aicasm.c 				SLIST_INSERT_HEAD(&search_path, include_dir,
search_path        69 drivers/scsi/aic7xxx/aicasm/aicasm.h extern struct path_list search_path;
search_path      4742 fs/btrfs/tree-log.c 	struct btrfs_path *search_path;
search_path      4749 fs/btrfs/tree-log.c 	search_path = btrfs_alloc_path();
search_path      4750 fs/btrfs/tree-log.c 	if (!search_path)
search_path      4752 fs/btrfs/tree-log.c 	search_path->search_commit_root = 1;
search_path      4753 fs/btrfs/tree-log.c 	search_path->skip_locking = 1;
search_path      4794 fs/btrfs/tree-log.c 		di = btrfs_lookup_dir_item(NULL, inode->root, search_path,
search_path      4799 fs/btrfs/tree-log.c 			btrfs_dir_item_key_to_cpu(search_path->nodes[0],
search_path      4817 fs/btrfs/tree-log.c 		btrfs_release_path(search_path);
search_path      4823 fs/btrfs/tree-log.c 	btrfs_free_path(search_path);
search_path       197 fs/cifs/cifsproto.h 			const unsigned char *search_path,
search_path      3009 fs/reiserfs/reiserfs.h 			       struct treepath *search_path);
search_path      3011 fs/reiserfs/reiserfs.h void decrement_counters_in_path(struct treepath *search_path);
search_path      3012 fs/reiserfs/reiserfs.h void pathrelse(struct treepath *search_path);
search_path      3014 fs/reiserfs/reiserfs.h void pathrelse_and_restore(struct super_block *s, struct treepath *search_path);
search_path       360 fs/reiserfs/stree.c 			   struct treepath *search_path)
search_path       362 fs/reiserfs/stree.c 	int path_offset = search_path->path_length;
search_path       369 fs/reiserfs/stree.c 		bh = PATH_OFFSET_PBUFFER(search_path, path_offset--);
search_path       373 fs/reiserfs/stree.c 	search_path->path_length = ILLEGAL_PATH_ELEMENT_OFFSET;
search_path       377 fs/reiserfs/stree.c void pathrelse(struct treepath *search_path)
search_path       379 fs/reiserfs/stree.c 	int path_offset = search_path->path_length;
search_path       385 fs/reiserfs/stree.c 		brelse(PATH_OFFSET_PBUFFER(search_path, path_offset--));
search_path       387 fs/reiserfs/stree.c 	search_path->path_length = ILLEGAL_PATH_ELEMENT_OFFSET;
search_path       589 fs/reiserfs/stree.c 		  struct treepath *search_path, int stop_level)
search_path       614 fs/reiserfs/stree.c 	pathrelse(search_path);
search_path       636 fs/reiserfs/stree.c 		    PATH_OFFSET_PELEMENT(search_path,
search_path       637 fs/reiserfs/stree.c 					 ++search_path->path_length);
search_path       670 fs/reiserfs/stree.c 			search_path->path_length--;
search_path       671 fs/reiserfs/stree.c 			pathrelse(search_path);
search_path       688 fs/reiserfs/stree.c 		     !key_in_buffer(search_path, key, sb))) {
search_path       693 fs/reiserfs/stree.c 			pathrelse(search_path);
search_path       712 fs/reiserfs/stree.c 		       !key_in_buffer(search_path, key, sb),
search_path       730 fs/reiserfs/stree.c 			pathrelse(search_path);
search_path       779 fs/reiserfs/stree.c 		if ((search_path->reada & PATH_READA) &&
search_path       785 fs/reiserfs/stree.c 			if (search_path->reada & PATH_READA_BACK)
search_path       792 fs/reiserfs/stree.c 				if (search_path->reada & PATH_READA_BACK)
search_path       831 fs/reiserfs/stree.c 			       struct treepath *search_path)
search_path       841 fs/reiserfs/stree.c 		return search_by_entry_key(sb, p_cpu_key, search_path,
search_path       847 fs/reiserfs/stree.c 	retval = search_item(sb, p_cpu_key, search_path);
search_path       854 fs/reiserfs/stree.c 			(PATH_PLAST_BUFFER(search_path),
search_path       855 fs/reiserfs/stree.c 			 PATH_LAST_POSITION(search_path))),
search_path       858 fs/reiserfs/stree.c 		pos_in_item(search_path) = 0;
search_path       862 fs/reiserfs/stree.c 	RFALSE(!PATH_LAST_POSITION(search_path),
search_path       867 fs/reiserfs/stree.c 	    item_head(PATH_PLAST_BUFFER(search_path),
search_path       868 fs/reiserfs/stree.c 			   --PATH_LAST_POSITION(search_path));
search_path       882 fs/reiserfs/stree.c 		pos_in_item(search_path) = offset - item_offset;
search_path       884 fs/reiserfs/stree.c 			pos_in_item(search_path) /= blk_size;
search_path       894 fs/reiserfs/stree.c 		pos_in_item(search_path) =
search_path       897 fs/reiserfs/stree.c 		pos_in_item(search_path) = ih_item_len(p_le_ih);
search_path      2063 fs/reiserfs/stree.c 			     struct treepath *search_path,
search_path      2094 fs/reiserfs/stree.c 		pathrelse(search_path);
search_path      2097 fs/reiserfs/stree.c 	init_tb_struct(th, &s_paste_balance, th->t_super, search_path,
search_path      2116 fs/reiserfs/stree.c 					       search_path);
search_path      2129 fs/reiserfs/stree.c 		check_research_for_paste(search_path, key);
search_path        15 scripts/dtc/srcpos.c 	struct search_path *next;	/* next node in list, NULL for end */
search_path        20 scripts/dtc/srcpos.c static struct search_path *search_path_head, **search_path_tail;
search_path       130 scripts/dtc/srcpos.c 	struct search_path *node;
search_path       217 scripts/dtc/srcpos.c 	struct search_path *node;