num_recs          144 drivers/gpu/drm/amd/amdgpu/amdgpu_ras_eeprom.c 		control->num_recs = (hdr->tbl_size - EEPROM_TABLE_HEADER_SIZE) /
num_recs          147 drivers/gpu/drm/amd/amdgpu/amdgpu_ras_eeprom.c 				 control->num_recs);
num_recs          435 drivers/gpu/drm/amd/amdgpu/amdgpu_ras_eeprom.c 		control->num_recs += num;
num_recs          436 drivers/gpu/drm/amd/amdgpu/amdgpu_ras_eeprom.c 		control->num_recs %= EEPROM_MAX_RECORD_NUM;
num_recs          440 drivers/gpu/drm/amd/amdgpu/amdgpu_ras_eeprom.c 			control->num_recs * EEPROM_TABLE_RECORD_SIZE;
num_recs           49 drivers/gpu/drm/amd/amdgpu/amdgpu_ras_eeprom.h 	unsigned int num_recs;
num_recs           52 fs/hfs/bfind.c 	e = bnode->num_recs - 1;
num_recs          176 fs/hfs/bfind.c 			fd->record = bnode->num_recs - 1;
num_recs          192 fs/hfs/bfind.c 		while (cnt >= bnode->num_recs - fd->record) {
num_recs          193 fs/hfs/bfind.c 			cnt -= bnode->num_recs - fd->record;
num_recs          144 fs/hfs/bnode.c 		desc.type, desc.height, be16_to_cpu(desc.num_recs));
num_recs          147 fs/hfs/bnode.c 	for (i = be16_to_cpu(desc.num_recs); i >= 0; off -= 2, i--) {
num_recs          341 fs/hfs/bnode.c 	node->num_recs = be16_to_cpu(desc->num_recs);
num_recs          368 fs/hfs/bnode.c 	for (i = 1; i <= node->num_recs; off = next_off, i++) {
num_recs           94 fs/hfs/brec.c  	end_rec_off = tree->node_size - (node->num_recs + 1) * 2;
num_recs          111 fs/hfs/brec.c  	node->num_recs++;
num_recs          113 fs/hfs/brec.c  	hfs_bnode_write_u16(node, offsetof(struct hfs_bnode_desc, num_recs), node->num_recs);
num_recs          187 fs/hfs/brec.c  	end_off = tree->node_size - (node->num_recs + 1) * 2;
num_recs          196 fs/hfs/brec.c  	if (!--node->num_recs) {
num_recs          209 fs/hfs/brec.c  	hfs_bnode_write_u16(node, offsetof(struct hfs_bnode_desc, num_recs), node->num_recs);
num_recs          236 fs/hfs/brec.c  	int num_recs, new_rec_off, new_off, old_rec_off;
num_recs          264 fs/hfs/brec.c  	size = tree->node_size / 2 - node->num_recs * 2 - 14;
num_recs          266 fs/hfs/brec.c  	num_recs = 1;
num_recs          272 fs/hfs/brec.c  		if (++num_recs < node->num_recs)
num_recs          282 fs/hfs/brec.c  	if (fd->record + 1 < num_recs) {
num_recs          287 fs/hfs/brec.c  		num_recs--;
num_recs          293 fs/hfs/brec.c  		fd->record -= num_recs;
num_recs          297 fs/hfs/brec.c  	new_node->num_recs = node->num_recs - num_recs;
num_recs          298 fs/hfs/brec.c  	node->num_recs = num_recs;
num_recs          303 fs/hfs/brec.c  	num_recs = new_node->num_recs;
num_recs          305 fs/hfs/brec.c  	while (num_recs) {
num_recs          311 fs/hfs/brec.c  		num_recs--;
num_recs          321 fs/hfs/brec.c  	node_desc.num_recs = cpu_to_be16(new_node->num_recs);
num_recs          329 fs/hfs/brec.c  	node_desc.num_recs = cpu_to_be16(node->num_recs);
num_recs          385 fs/hfs/brec.c  	end_rec_off = tree->node_size - (parent->num_recs + 1) * 2;
num_recs          401 fs/hfs/brec.c  			end_rec_off = tree->node_size - (parent->num_recs + 1) * 2;
num_recs          481 fs/hfs/brec.c  		new_node->num_recs = 0;
num_recs          484 fs/hfs/brec.c  		new_node->num_recs = 1;
num_recs          495 fs/hfs/brec.c  	node_desc.num_recs = cpu_to_be16(new_node->num_recs);
num_recs          207 fs/hfs/btree.c 	node->num_recs = 1;
num_recs          213 fs/hfs/btree.c 	desc.num_recs = cpu_to_be16(1);
num_recs           54 fs/hfs/btree.h 	u16 num_recs;
num_recs          131 fs/hfs/btree.h 	__be16 num_recs;	/* (V) The number of records in this node */
num_recs          124 fs/hfsplus/bfind.c 	e = bnode->num_recs - 1;
num_recs          245 fs/hfsplus/bfind.c 			fd->record = bnode->num_recs - 1;
num_recs          261 fs/hfsplus/bfind.c 		while (cnt >= bnode->num_recs - fd->record) {
num_recs          262 fs/hfsplus/bfind.c 			cnt -= bnode->num_recs - fd->record;
num_recs          308 fs/hfsplus/bnode.c 		desc.type, desc.height, be16_to_cpu(desc.num_recs));
num_recs          311 fs/hfsplus/bnode.c 	for (i = be16_to_cpu(desc.num_recs); i >= 0; off -= 2, i--) {
num_recs          509 fs/hfsplus/bnode.c 	node->num_recs = be16_to_cpu(desc->num_recs);
num_recs          536 fs/hfsplus/bnode.c 	for (i = 1; i <= node->num_recs; off = next_off, i++) {
num_recs           92 fs/hfsplus/brec.c 	end_rec_off = tree->node_size - (node->num_recs + 1) * 2;
num_recs          109 fs/hfsplus/brec.c 	node->num_recs++;
num_recs          112 fs/hfsplus/brec.c 		offsetof(struct hfs_bnode_desc, num_recs),
num_recs          113 fs/hfsplus/brec.c 		node->num_recs);
num_recs          189 fs/hfsplus/brec.c 	end_off = tree->node_size - (node->num_recs + 1) * 2;
num_recs          198 fs/hfsplus/brec.c 	if (!--node->num_recs) {
num_recs          212 fs/hfsplus/brec.c 		offsetof(struct hfs_bnode_desc, num_recs),
num_recs          213 fs/hfsplus/brec.c 		node->num_recs);
num_recs          240 fs/hfsplus/brec.c 	int num_recs, new_rec_off, new_off, old_rec_off;
num_recs          268 fs/hfsplus/brec.c 	size = tree->node_size / 2 - node->num_recs * 2 - 14;
num_recs          270 fs/hfsplus/brec.c 	num_recs = 1;
num_recs          276 fs/hfsplus/brec.c 		if (++num_recs < node->num_recs)
num_recs          286 fs/hfsplus/brec.c 	if (fd->record + 1 < num_recs) {
num_recs          291 fs/hfsplus/brec.c 		num_recs--;
num_recs          297 fs/hfsplus/brec.c 		fd->record -= num_recs;
num_recs          301 fs/hfsplus/brec.c 	new_node->num_recs = node->num_recs - num_recs;
num_recs          302 fs/hfsplus/brec.c 	node->num_recs = num_recs;
num_recs          307 fs/hfsplus/brec.c 	num_recs = new_node->num_recs;
num_recs          309 fs/hfsplus/brec.c 	while (num_recs) {
num_recs          315 fs/hfsplus/brec.c 		num_recs--;
num_recs          325 fs/hfsplus/brec.c 	node_desc.num_recs = cpu_to_be16(new_node->num_recs);
num_recs          333 fs/hfsplus/brec.c 	node_desc.num_recs = cpu_to_be16(node->num_recs);
num_recs          390 fs/hfsplus/brec.c 	end_rec_off = tree->node_size - (parent->num_recs + 1) * 2;
num_recs          407 fs/hfsplus/brec.c 				(parent->num_recs + 1) * 2;
num_recs          485 fs/hfsplus/brec.c 		new_node->num_recs = 0;
num_recs          488 fs/hfsplus/brec.c 		new_node->num_recs = 1;
num_recs          499 fs/hfsplus/brec.c 	node_desc.num_recs = cpu_to_be16(new_node->num_recs);
num_recs          329 fs/hfsplus/btree.c 	node->num_recs = 1;
num_recs          335 fs/hfsplus/btree.c 	desc.num_recs = cpu_to_be16(1);
num_recs          111 fs/hfsplus/hfsplus_fs.h 	u16 num_recs;
num_recs          156 fs/hfsplus/hfsplus_raw.h 	__be16 num_recs;
num_recs           75 fs/hfsplus/xattr.c 	desc->num_recs = cpu_to_be16(HFSPLUS_BTREE_HDR_NODE_RECS_COUNT);
num_recs         1692 fs/ocfs2/alloc.c 	int size, num_recs = le16_to_cpu(el->l_next_free_rec);
num_recs         1694 fs/ocfs2/alloc.c 	BUG_ON(num_recs == 0);
num_recs         1697 fs/ocfs2/alloc.c 		num_recs--;
num_recs         1698 fs/ocfs2/alloc.c 		size = num_recs * sizeof(struct ocfs2_extent_rec);
num_recs         1700 fs/ocfs2/alloc.c 		memset(&el->l_recs[num_recs], 0,
num_recs         1702 fs/ocfs2/alloc.c 		el->l_next_free_rec = cpu_to_le16(num_recs);
num_recs         6250 fs/ocfs2/alloc.c 	unsigned int clusters, num_recs, start_cluster;
num_recs         6262 fs/ocfs2/alloc.c 	num_recs = le16_to_cpu(tl->tl_used);
num_recs         6265 fs/ocfs2/alloc.c 		num_recs);
num_recs         6268 fs/ocfs2/alloc.c 	for(i = 0; i < num_recs; i++) {
num_recs         6218 fs/ocfs2/xattr.c 					     int *num_recs,
num_recs         6248 fs/ocfs2/xattr.c 			*num_recs += le16_to_cpu(xv->xr_list.l_next_free_rec);
num_recs         6250 fs/ocfs2/xattr.c 			*num_recs += ocfs2_clusters_for_bytes(sb,
num_recs         6288 fs/ocfs2/xattr.c 	int ret, meta_add = 0, num_recs = 0;
num_recs         6295 fs/ocfs2/xattr.c 						&meta_add, credits, &num_recs,
num_recs         6310 fs/ocfs2/xattr.c 	num_recs = num_recs / ocfs2_refcount_recs_per_rb(osb->sb) * 2;
num_recs         6311 fs/ocfs2/xattr.c 	meta_add += num_recs;
num_recs         6312 fs/ocfs2/xattr.c 	*credits += num_recs + num_recs * OCFS2_EXPAND_REFCOUNT_TREE_CREDITS;
num_recs         6706 fs/ocfs2/xattr.c 	int num_recs;
num_recs         6737 fs/ocfs2/xattr.c 					&metas->credits, &metas->num_recs,
num_recs         6782 fs/ocfs2/xattr.c 	metas.num_recs =
num_recs         6783 fs/ocfs2/xattr.c 		(metas.num_recs + ocfs2_refcount_recs_per_rb(osb->sb) - 1) /
num_recs         6785 fs/ocfs2/xattr.c 	metas.num_metas += metas.num_recs;
num_recs         6786 fs/ocfs2/xattr.c 	*credits += metas.num_recs +
num_recs         6787 fs/ocfs2/xattr.c 		    metas.num_recs * OCFS2_EXPAND_REFCOUNT_TREE_CREDITS;
num_recs          404 fs/xfs/libxfs/xfs_bmap.c 		xfs_extnum_t	num_recs;
num_recs          407 fs/xfs/libxfs/xfs_bmap.c 		num_recs = xfs_btree_get_numrecs(block);
num_recs          427 fs/xfs/libxfs/xfs_bmap.c 		for (j = 1; j < num_recs; j++) {
num_recs          436 fs/xfs/libxfs/xfs_bmap.c 		i += num_recs;
num_recs         1229 fs/xfs/libxfs/xfs_bmap.c 		xfs_extnum_t	num_recs;
num_recs         1231 fs/xfs/libxfs/xfs_bmap.c 		num_recs = xfs_btree_get_numrecs(block);
num_recs         1232 fs/xfs/libxfs/xfs_bmap.c 		if (unlikely(i + num_recs > nextents)) {
num_recs         1253 fs/xfs/libxfs/xfs_bmap.c 		for (j = 0; j < num_recs; j++, frp++, i++) {