Home | History | Annotate | Download | only in dist

Lines Matching defs:dpnt

1711   struct directory * dpnt;
1713   dpnt = node;
1715   while (dpnt){
1716     if( dpnt->extent > session_start )
1718 	generate_one_directory(dpnt, outfile);
1720     if(dpnt->subdir) generate_iso9660_directories(dpnt->subdir, outfile);
1721     dpnt = dpnt->next;
1736   struct directory		* dpnt;
1756       dpnt = parent->subdir;
1758       while (dpnt)
1765 	  if( flag && strcmp(dpnt->de_name, pnt) == 0 )
1767 	      return dpnt;
1769 	  dpnt = dpnt->next;
1831   dpnt             = (struct directory *) e_malloc(sizeof(struct directory));
1832   memset(dpnt, 0, sizeof(struct directory));
1833   dpnt->next       = NULL;
1834   dpnt->subdir     = NULL;
1835   dpnt->self       = de;
1836   dpnt->contents   = NULL;
1837   dpnt->whole_name = strdup(path);
1843   dpnt->de_name    = strdup(cpnt);
1844   dpnt->size       = 0;
1845   dpnt->extent     = 0;
1846   dpnt->jextent    = 0;
1847   dpnt->jsize      = 0;
1849   dpnt->hfs_ent	   = de->hfs_ent;
1867 	  attach_dot_entries(dpnt, &xstatbuf);
1871 	  attach_dot_entries(dpnt, &fstatbuf);
1879 	  root = dpnt;  /* First time through for root directory only */
1883 	  dpnt->depth = 1;
1886 	      root->subdir = dpnt;
1892 	      next_brother->next = dpnt;
1894 	  dpnt->parent = parent;
1901       fprintf(stderr,"%s(%d) ", path, dpnt->depth);
1909       dpnt->parent = parent; 
1910       dpnt->depth = parent->depth + 1;
1914 	  parent->subdir = dpnt;
1920 	  next_brother->next = dpnt;
1924   return dpnt;
1980   struct directory * dpnt;
1983   dpnt = node;
1985   while (dpnt){
1986     ret = sort_n_finish(dpnt);
1992     if(dpnt->subdir) sort_tree(dpnt->subdir);
1993     dpnt = dpnt->next;
1999   struct directory * dpnt;
2001   dpnt = node;
2003   while (dpnt){
2004     fprintf(stderr,"%4d %5d %s\n",dpnt->extent, dpnt->size, dpnt->de_name);
2005     if(dpnt->subdir) dump_tree(dpnt->subdir);
2006     dpnt = dpnt->next;
2012     struct directory		* dpnt;
2017     dpnt = node;
2019     while (dpnt)
2021 	if (dpnt->dir_flags & INHIBIT_ISO9660_ENTRY) {
2022 	    dpnt = dpnt->next;
2029         for(i=0, xpnt = dpnt->subdir; xpnt; xpnt = xpnt->next)
2040 	for(s_entry = dpnt->contents; s_entry; s_entry = s_entry->next)
2051 	update_nlink(dpnt->self, i + 2);
2056 	update_nlink(dpnt->contents, i + 2);
2061 	for(xpnt = dpnt->subdir; xpnt; xpnt = xpnt->next)
2064 	if(dpnt->subdir) update_nlink_field(dpnt->subdir);
2065 	dpnt = dpnt->next;
2078   struct directory	 * dpnt;
2113       dpnt = node->subdir;
2114      while( dpnt )
2117 	 fprintf(stderr,"%4d %5d %s\n", dpnt->extent, dpnt->size, 
2118 		 dpnt->de_name); 
2120 	 if (!strcmp(subdir, dpnt->de_name)) 
2125 	     return(search_tree_file( dpnt, rest ));
2127 	 dpnt = dpnt->next;