HomeSort by: relevance | last modified time | path
    Searched defs:namei (Results 1 - 4 of 4) sorted by relevancy

  /src/sys/kern/
vfs_lookup.c 58 #include <sys/namei.h>
205 * Determine the namei hash (for the namecache) for name.
237 * System-call-layer level code that is going to call namei should
347 * called after namei starts the results may be arbitrary.
358 * path string. The first copy should be gotten before namei is
391 * namei: convert a pathname into a pointer to a (maybe-locked) vnode,
393 * See namei(9) for the interface documentation.
404 * Overall outline of namei:
453 * Internal state for a namei operation.
472 * Initialize the namei working state
1949 namei(struct nameidata *ndp) function
    [all...]
  /src/usr.bin/make/filemon/
filemon_ktrace.c 114 char namei[PATH_MAX]; member in union:filemon::__anon8289
461 S->path[S->i++] = strndup(F->payload.namei,
462 sizeof F->payload.namei);
  /src/external/gpl3/binutils/dist/binutils/
dwarf.c 10954 uint32_t namei; local
10955 for (namei = 0; namei < name_count; ++namei)
10968 p = name_table_string_offsets + namei * offset_size;
10971 p = name_table_entry_offsets + namei * offset_size;
10976 printf ("[%3u] ", namei + 1);
10978 printf ("#%08x ", hash_table_hashes[namei]);
  /src/external/gpl3/binutils.old/dist/binutils/
dwarf.c 10864 uint32_t namei; local
10865 for (namei = 0; namei < name_count; ++namei)
10878 p = name_table_string_offsets + namei * offset_size;
10881 p = name_table_entry_offsets + namei * offset_size;
10886 printf ("[%3u] ", namei + 1);
10888 printf ("#%08x ", hash_table_hashes[namei]);

Completed in 26 milliseconds