Searched refs:node_count (Results 1 - 25 of 27) sorted by relevance

12

/linux-master/lib/
H A Dlist-test.c1210 static int node_count; variable
1215 node_count++;
1221 node_count--;
1231 node_count = 0;
1235 KUNIT_EXPECT_EQ(test, node_count, 1);
1239 KUNIT_EXPECT_EQ(test, node_count, 2);
1259 node_count = 0;
1263 KUNIT_EXPECT_EQ(test, node_count, 1);
1267 KUNIT_EXPECT_EQ(test, node_count, 2);
1287 node_count
[all...]
H A Dobjagg.c19 unsigned int node_count; member in struct:objagg_hints
678 objagg_hints->node_count++;
968 if (WARN_ON(objagg_hints->node_count != objagg->obj_count)) {
1026 objagg_hints->node_count),
H A Dmaple_tree.c1156 if (node->node_count == 1) {
1164 ret = node->slot[--node->node_count];
1165 node->slot[node->node_count] = NULL;
1196 reuse->node_count = 0;
1197 if (count && (head->node_count < MAPLE_ALLOC_SLOTS)) {
1198 head->slot[head->node_count++] = reuse;
1206 reuse->node_count = 1;
1241 if (!allocated || mas->alloc->node_count == MAPLE_ALLOC_SLOTS) {
1248 node->node_count = 1;
1250 node->node_count
[all...]
/linux-master/fs/hfsplus/
H A Dbtree.c172 tree->node_count = be32_to_cpu(head->node_count);
234 if (!tree->node_count)
302 head->node_count = cpu_to_be32(tree->node_count);
368 tree->free_nodes += count - tree->node_count;
369 tree->node_count = count;
H A Dxattr.c83 head->node_count = cpu_to_be32(tmp);
84 head->free_nodes = cpu_to_be32(be32_to_cpu(head->node_count) - 1);
94 if (be32_to_cpu(head->node_count) > hdr_node_map_rec_bits) {
101 map_nodes = (be32_to_cpu(head->node_count) -
109 be32_to_cpu(head->node_count) - be32_to_cpu(head->free_nodes);
H A Dhfsplus_raw.h175 __be32 node_count; member in struct:hfs_btree_header_rec
H A Dbnode.c380 if (cnid >= tree->node_count) {
401 if (cnid >= tree->node_count) {
H A Dhfsplus_fs.h83 u32 node_count; member in struct:hfs_btree
H A Dinode.c116 } while (--i && nidx < tree->node_count);
/linux-master/fs/hfs/
H A Dbtree.c89 tree->node_count = be32_to_cpu(head->node_count);
99 if (!tree->node_count)
181 head->node_count = cpu_to_be32(tree->node_count);
244 tree->free_nodes += count - tree->node_count;
245 tree->node_count = count;
H A Dbtree.h34 u32 node_count; member in struct:hfs_btree
155 __be32 node_count; /* (V) The total number of nodes */ member in struct:hfs_btree_header_rec
H A Dbnode.c230 if (cnid >= tree->node_count) {
252 if (cnid >= tree->node_count) {
H A Dinode.c119 } while (--i && nidx < tree->node_count);
/linux-master/drivers/misc/cxl/
H A Dflash.c177 u32 action, node_count; local
200 node_count = be32_to_cpu(*data) & NODE_COUNT_MASK;
202 action, node_count);
205 for (i = 0; i < node_count; i++) {
/linux-master/drivers/w1/
H A Dw1_netlink.c547 int node_count = 0; local
573 ++node_count;
582 if (node_count) {
602 node_count * sizeof(struct w1_cb_node) +
630 block->first_cn = (struct cn_msg *)(node + node_count);
/linux-master/drivers/firewire/
H A Dcore-topology.c491 int node_count = (card->root_node->node_id & 0x3f) + 1; local
496 *map++ = cpu_to_be32((node_count << 16) | self_id_count);
/linux-master/arch/powerpc/platforms/pseries/
H A Dmobility.c318 u32 node_count = be32_to_cpu(*data) & NODE_COUNT_MASK; local
322 for (i = 0; i < node_count; i++) {
/linux-master/drivers/net/ethernet/intel/ice/
H A Dice_nvm.c744 u16 module_id, length, node_count, i; local
769 status = ice_read_netlist_module(hw, bank, ICE_LINK_TOPO_NODE_COUNT, &node_count);
772 node_count &= ICE_LINK_TOPO_NODE_COUNT_M;
780 ICE_NETLIST_ID_BLK_OFFSET(node_count) * sizeof(u16),
/linux-master/sound/soc/bcm/
H A Dcygnus-ssp.c1304 int node_count; local
1325 node_count = of_get_child_count(pdev->dev.of_node);
1326 if ((node_count < 1) || (node_count > CYGNUS_MAX_PORTS)) {
1328 node_count, CYGNUS_MAX_PORTS);
/linux-master/drivers/acpi/
H A Dviot.c296 for (i = 0; i < viot->node_count; i++) {
/linux-master/include/acpi/
H A Dactbl3.h505 u16 node_count; member in struct:acpi_table_viot
H A Dactbl2.h385 u32 node_count; member in struct:acpi_table_iort
2791 u32 node_count; member in struct:acpi_table_rhct
/linux-master/drivers/acpi/arm64/
H A Diort.c245 for (i = 0; i < iort->node_count; i++) {
1054 for (i = 0; i < iort->node_count; i++) {
1928 for (i = 0; i < iort->node_count; i++) {
2003 for (i = 0; i < iort->node_count; i++) {
/linux-master/drivers/md/dm-vdo/indexer/
H A Dvolume.c1158 u32 next_record, u32 node, u32 node_count)
1160 if (node < node_count) {
1164 child, node_count);
1174 child + 1, node_count);
1156 encode_tree(u8 record_page[], const struct uds_volume_record *sorted_pointers[], u32 next_record, u32 node, u32 node_count) argument
/linux-master/include/linux/
H A Dmaple_tree.h134 unsigned char node_count; member in struct:maple_alloc
401 * node_count in this node. node_count is the number of allocated nodes in this
404 * by removing a node from the state->alloc node until state->alloc->node_count

Completed in 278 milliseconds

12