| /src/lib/libc/stdlib/ |
| tfind.c | 29 node_t * const *rootp = (node_t * const*)vrootp; local in function:tfind
34 if (rootp == NULL)
37 while (*rootp != NULL) { /* T1: */
40 if ((r = (*compar)(vkey, (*rootp)->key)) == 0) /* T2: */
41 return *rootp; /* key found */
42 rootp = (r < 0) ?
43 &(*rootp)->llink : /* T3: follow left branch */
44 &(*rootp)->rlink; /* T4: follow right branch */
|
| tfind.c | 29 node_t * const *rootp = (node_t * const*)vrootp; local in function:tfind
34 if (rootp == NULL)
37 while (*rootp != NULL) { /* T1: */
40 if ((r = (*compar)(vkey, (*rootp)->key)) == 0) /* T2: */
41 return *rootp; /* key found */
42 rootp = (r < 0) ?
43 &(*rootp)->llink : /* T3: follow left branch */
44 &(*rootp)->rlink; /* T4: follow right branch */
|
| tfind.c | 29 node_t * const *rootp = (node_t * const*)vrootp; local in function:tfind
34 if (rootp == NULL)
37 while (*rootp != NULL) { /* T1: */
40 if ((r = (*compar)(vkey, (*rootp)->key)) == 0) /* T2: */
41 return *rootp; /* key found */
42 rootp = (r < 0) ?
43 &(*rootp)->llink : /* T3: follow left branch */
44 &(*rootp)->rlink; /* T4: follow right branch */
|
| tsearch.c | 30 node_t **rootp = (node_t **)vrootp; local in function:tsearch
35 if (rootp == NULL)
38 while (*rootp != NULL) { /* Knuth's T1: */
41 if ((r = (*compar)(vkey, (*rootp)->key)) == 0) /* T2: */
42 return *rootp; /* we found it! */
44 rootp = (r < 0) ?
45 &(*rootp)->llink : /* T3: follow left branch */
46 &(*rootp)->rlink; /* T4: follow right branch */
51 *rootp = q; /* link new node to old */
|
| tsearch.c | 30 node_t **rootp = (node_t **)vrootp; local in function:tsearch
35 if (rootp == NULL)
38 while (*rootp != NULL) { /* Knuth's T1: */
41 if ((r = (*compar)(vkey, (*rootp)->key)) == 0) /* T2: */
42 return *rootp; /* we found it! */
44 rootp = (r < 0) ?
45 &(*rootp)->llink : /* T3: follow left branch */
46 &(*rootp)->rlink; /* T4: follow right branch */
51 *rootp = q; /* link new node to old */
|
| tsearch.c | 30 node_t **rootp = (node_t **)vrootp; local in function:tsearch
35 if (rootp == NULL)
38 while (*rootp != NULL) { /* Knuth's T1: */
41 if ((r = (*compar)(vkey, (*rootp)->key)) == 0) /* T2: */
42 return *rootp; /* we found it! */
44 rootp = (r < 0) ?
45 &(*rootp)->llink : /* T3: follow left branch */
46 &(*rootp)->rlink; /* T4: follow right branch */
51 *rootp = q; /* link new node to old */
|
| tdelete.c | 30 node_t **rootp = (node_t **)vrootp; local in function:tdelete
37 if (rootp == NULL || (p = *rootp) == NULL)
40 while ((cmp = (*compar)(vkey, (*rootp)->key)) != 0) {
41 p = *rootp;
42 rootp = (cmp < 0) ?
43 &(*rootp)->llink : /* follow llink branch */
44 &(*rootp)->rlink; /* follow rlink branch */
45 if (*rootp == NULL)
48 r = (*rootp)->rlink; /* D1: *
[all...] |
| tdelete.c | 30 node_t **rootp = (node_t **)vrootp; local in function:tdelete
37 if (rootp == NULL || (p = *rootp) == NULL)
40 while ((cmp = (*compar)(vkey, (*rootp)->key)) != 0) {
41 p = *rootp;
42 rootp = (cmp < 0) ?
43 &(*rootp)->llink : /* follow llink branch */
44 &(*rootp)->rlink; /* follow rlink branch */
45 if (*rootp == NULL)
48 r = (*rootp)->rlink; /* D1: *
[all...] |
| tdelete.c | 30 node_t **rootp = (node_t **)vrootp; local in function:tdelete
37 if (rootp == NULL || (p = *rootp) == NULL)
40 while ((cmp = (*compar)(vkey, (*rootp)->key)) != 0) {
41 p = *rootp;
42 rootp = (cmp < 0) ?
43 &(*rootp)->llink : /* follow llink branch */
44 &(*rootp)->rlink; /* follow rlink branch */
45 if (*rootp == NULL)
48 r = (*rootp)->rlink; /* D1: *
[all...] |
| /src/sys/fs/cd9660/ |
| cd9660_vfsops.c | 352 struct iso_directory_record *rootp; local in function:iso_makemp
362 rootp = (struct iso_directory_record *)pri->root_directory_record;
366 memcpy(isomp->root, rootp, sizeof(isomp->root));
367 isomp->root_extent = isonum_733 (rootp->extent);
368 isomp->root_size = isonum_733 (rootp->size);
377 *ea_len = isonum_711(rootp->ext_attr_length);
514 struct iso_directory_record *rootp; local in function:iso_mountfs
523 rootp = (struct iso_directory_record *)bp->b_data;
525 if ((isomp->rr_skip = cd9660_rrip_offset(rootp,isomp)) < 0) {
|
| cd9660_vfsops.c | 352 struct iso_directory_record *rootp; local in function:iso_makemp
362 rootp = (struct iso_directory_record *)pri->root_directory_record;
366 memcpy(isomp->root, rootp, sizeof(isomp->root));
367 isomp->root_extent = isonum_733 (rootp->extent);
368 isomp->root_size = isonum_733 (rootp->size);
377 *ea_len = isonum_711(rootp->ext_attr_length);
514 struct iso_directory_record *rootp; local in function:iso_mountfs
523 rootp = (struct iso_directory_record *)bp->b_data;
525 if ((isomp->rr_skip = cd9660_rrip_offset(rootp,isomp)) < 0) {
|
| cd9660_vfsops.c | 352 struct iso_directory_record *rootp; local in function:iso_makemp
362 rootp = (struct iso_directory_record *)pri->root_directory_record;
366 memcpy(isomp->root, rootp, sizeof(isomp->root));
367 isomp->root_extent = isonum_733 (rootp->extent);
368 isomp->root_size = isonum_733 (rootp->size);
377 *ea_len = isonum_711(rootp->ext_attr_length);
514 struct iso_directory_record *rootp; local in function:iso_mountfs
523 rootp = (struct iso_directory_record *)bp->b_data;
525 if ((isomp->rr_skip = cd9660_rrip_offset(rootp,isomp)) < 0) {
|
| /src/sys/ufs/ext2fs/ |
| ext2fs_htree.c | 715 struct ext2fs_htree_root *rootp; local in function:ext2fs_htree_find_leaf
734 rootp = (struct ext2fs_htree_root *)bp->b_data;
735 if (rootp->h_info.h_hash_version != EXT2_HTREE_LEGACY &&
736 rootp->h_info.h_hash_version != EXT2_HTREE_HALF_MD4 &&
737 rootp->h_info.h_hash_version != EXT2_HTREE_TEA)
740 hash_version = rootp->h_info.h_hash_version;
749 if ((levels = rootp->h_info.h_ind_levels) > 1)
752 entp = (struct ext2fs_htree_entry *)(((char *)&rootp->h_info) +
753 rootp->h_info.h_info_len);
756 ext2fs_htree_root_limit(ip, rootp->h_info.h_info_len)
[all...] |
| ext2fs_htree.c | 715 struct ext2fs_htree_root *rootp; local in function:ext2fs_htree_find_leaf
734 rootp = (struct ext2fs_htree_root *)bp->b_data;
735 if (rootp->h_info.h_hash_version != EXT2_HTREE_LEGACY &&
736 rootp->h_info.h_hash_version != EXT2_HTREE_HALF_MD4 &&
737 rootp->h_info.h_hash_version != EXT2_HTREE_TEA)
740 hash_version = rootp->h_info.h_hash_version;
749 if ((levels = rootp->h_info.h_ind_levels) > 1)
752 entp = (struct ext2fs_htree_entry *)(((char *)&rootp->h_info) +
753 rootp->h_info.h_info_len);
756 ext2fs_htree_root_limit(ip, rootp->h_info.h_info_len)
[all...] |
| ext2fs_htree.c | 715 struct ext2fs_htree_root *rootp; local in function:ext2fs_htree_find_leaf
734 rootp = (struct ext2fs_htree_root *)bp->b_data;
735 if (rootp->h_info.h_hash_version != EXT2_HTREE_LEGACY &&
736 rootp->h_info.h_hash_version != EXT2_HTREE_HALF_MD4 &&
737 rootp->h_info.h_hash_version != EXT2_HTREE_TEA)
740 hash_version = rootp->h_info.h_hash_version;
749 if ((levels = rootp->h_info.h_ind_levels) > 1)
752 entp = (struct ext2fs_htree_entry *)(((char *)&rootp->h_info) +
753 rootp->h_info.h_info_len);
756 ext2fs_htree_root_limit(ip, rootp->h_info.h_info_len)
[all...] |
