nodes_count       137 fs/dlm/dlm_internal.h 	int			nodes_count;
nodes_count      5433 fs/dlm/lock.c  	int nodes_count = 0;
nodes_count      5441 fs/dlm/lock.c  		nodes_count++;
nodes_count      5445 fs/dlm/lock.c  	if (!nodes_count)
nodes_count      5468 fs/dlm/lock.c  			  lkb_count, nodes_count);
nodes_count       517 fs/dlm/member.c 	for (i = 0; i < rv->nodes_count; i++) {
nodes_count       561 fs/dlm/member.c 	for (i = 0; i < rv->nodes_count; i++) {
nodes_count       695 fs/dlm/member.c 	rv->nodes_count = count;
nodes_count       703 fs/dlm/member.c 			  (unsigned long long)rv_old->seq, rv_old->nodes_count);
nodes_count       706 lib/objagg.c   	unsigned long nodes_count;
nodes_count       713 lib/objagg.c   	return index * graph->nodes_count + parent_index;
nodes_count       745 lib/objagg.c   	for (j = 0; j < graph->nodes_count; j++) {
nodes_count       764 lib/objagg.c   	for (i = 0; i < graph->nodes_count; i++) {
nodes_count       779 lib/objagg.c   	unsigned int nodes_count = objagg->obj_count;
nodes_count       791 lib/objagg.c   	graph->nodes = kcalloc(nodes_count, sizeof(*graph->nodes), GFP_KERNEL);
nodes_count       794 lib/objagg.c   	graph->nodes_count = nodes_count;
nodes_count       796 lib/objagg.c   	alloc_size = BITS_TO_LONGS(nodes_count * nodes_count) *
nodes_count       811 lib/objagg.c   	for (i = 0; i < nodes_count; i++) {
nodes_count       812 lib/objagg.c   		for (j = 0; j < nodes_count; j++) {
nodes_count       871 lib/objagg.c   		for (j = 0; j < graph->nodes_count; j++) {