n_used_nodes (reference) in projects: kernel - OpenGrok search results

Repository(s)

Full Search		Search through all text tokens(words,strings,identifiers,numbers) in index.
Definition		Only finds symbol definitions(where e.g a variable(function,...) is defined).
Symbol		Only finds symbol(e.g. methods classes,function,variables).
File Path		Path of the source file(use "/").If you want just exact path,enclose it in "".Source files end with: .jar/.bz2/.a/.h/.java...
History		History log comments.
Type		Type of analyzer used to filter file types include with selected(e.g. just C sources).

Help

Searched refs:n_used_nodes (Results 1 - 10 of 10) sorted by relevance

/kernel/linux/linux-5.10/fs/hpfs/
H A D	anode.c	25 for (i = 0; i < btree->n_used_nodes; i++) in hpfs_bplus_lookup() 37 for (i = 0; i < btree->n_used_nodes; i++) in hpfs_bplus_lookup() 81 if ((n = btree->n_used_nodes - 1) < -!!fnod) { in hpfs_add_sector_to_btree() 134 anode->btree.n_used_nodes = btree->n_used_nodes; in hpfs_add_sector_to_btree() 136 anode->btree.n_free_nodes = 40 - anode->btree.n_used_nodes; in hpfs_add_sector_to_btree() 137 memcpy(&anode->u, &btree->u, btree->n_used_nodes * 12); in hpfs_add_sector_to_btree() 140 btree->n_used_nodes = 1; in hpfs_add_sector_to_btree() 156 btree->n_free_nodes--; n = btree->n_used_nodes++; in hpfs_add_sector_to_btree() 177 btree->n_free_nodes--; n = btree->n_used_nodes in hpfs_add_sector_to_btree() [all...]
H A D	map.c	`180 if ((unsigned)fnode->btree.n_used_nodes + (unsigned)fnode->btree.n_free_nodes != in hpfs_map_fnode() 188 8 + fnode->btree.n_used_nodes * (bp_internal(&fnode->btree) ? 8 : 12)) { in hpfs_map_fnode() 235 if ((unsigned)anode->btree.n_used_nodes + (unsigned)anode->btree.n_free_nodes != in hpfs_map_anode() 241 8 + anode->btree.n_used_nodes * (bp_internal(&anode->btree) ? 8 : 12)) { in hpfs_map_anode()`
H A D	hpfs.h	`407 u8 n_used_nodes; /* used nodes in following array */ member`
H A D	alloc.c	`484 a->btree.n_used_nodes = 0; in hpfs_alloc_anode()`
H A D	namei.c	`87 fnode->btree.n_used_nodes = 1; in hpfs_mkdir()`
/kernel/linux/linux-6.6/fs/hpfs/
H A D	anode.c	25 for (i = 0; i < btree->n_used_nodes; i++) in hpfs_bplus_lookup() 37 for (i = 0; i < btree->n_used_nodes; i++) in hpfs_bplus_lookup() 81 if ((n = btree->n_used_nodes - 1) < -!!fnod) { in hpfs_add_sector_to_btree() 134 anode->btree.n_used_nodes = btree->n_used_nodes; in hpfs_add_sector_to_btree() 136 anode->btree.n_free_nodes = 40 - anode->btree.n_used_nodes; in hpfs_add_sector_to_btree() 137 memcpy(&anode->u, &btree->u, btree->n_used_nodes * 12); in hpfs_add_sector_to_btree() 140 btree->n_used_nodes = 1; in hpfs_add_sector_to_btree() 156 btree->n_free_nodes--; n = btree->n_used_nodes++; in hpfs_add_sector_to_btree() 177 btree->n_free_nodes--; n = btree->n_used_nodes in hpfs_add_sector_to_btree() [all...]
H A D	map.c	`180 if ((unsigned)fnode->btree.n_used_nodes + (unsigned)fnode->btree.n_free_nodes != in hpfs_map_fnode() 188 8 + fnode->btree.n_used_nodes * (bp_internal(&fnode->btree) ? 8 : 12)) { in hpfs_map_fnode() 235 if ((unsigned)anode->btree.n_used_nodes + (unsigned)anode->btree.n_free_nodes != in hpfs_map_anode() 241 8 + anode->btree.n_used_nodes * (bp_internal(&anode->btree) ? 8 : 12)) { in hpfs_map_anode()`
H A D	hpfs.h	`408 u8 n_used_nodes; /* used nodes in following array */ member`
H A D	alloc.c	`484 a->btree.n_used_nodes = 0; in hpfs_alloc_anode()`
H A D	namei.c	`85 fnode->btree.n_used_nodes = 1; in hpfs_mkdir()`

Completed in 8 milliseconds