nn               2128 dev/acpi/dsdt.c 	const char *nn;
nn               2131 dev/acpi/dsdt.c 		if ((nn = node->name) != NULL) {
nn               2132 dev/acpi/dsdt.c 			if (*nn == AMLOP_ROOTCHAR) nn++;
nn               2133 dev/acpi/dsdt.c 			while (*nn == AMLOP_PARENTPREFIX) nn++;
nn               2134 dev/acpi/dsdt.c 			if (!strcmp(name, nn))
nn                200 lib/libkern/qdivrem.c 			u_int nn = COMBINE(uj0, uj1);
nn                201 lib/libkern/qdivrem.c 			qhat = nn / v1;
nn                202 lib/libkern/qdivrem.c 			rhat = nn % v1;
nn               1283 net/pf_table.c 	int			 n, nn;
nn               1288 net/pf_table.c 	n = nn = pfr_table_count(filter, flags);
nn               1307 net/pf_table.c 	*size = nn;
nn               1317 net/pf_table.c 	int			 s, n, nn;
nn               1324 net/pf_table.c 	n = nn = pfr_table_count(filter, flags);
nn               1358 net/pf_table.c 	*size = nn;
nn                 81 xfs/xfs_node.c     struct xfs_node *nn;
nn                 85 xfs/xfs_node.c     NNPQUEUE_FOREACH(nn, h, nn_hash) {
nn                 86 xfs/xfs_node.c 	if (xfs_handle_eq(handlep, &nn->handle))
nn                 90 xfs/xfs_node.c     return nn;