uipc_mqueue.c (15bc6b2bd8d8c56ad74e57675dde8501bc7f53e1) uipc_mqueue.c (1cbae705336e905e91f837c88798a5df098c7f67)
1/*-
2 * Copyright (c) 2005 David Xu <davidxu@freebsd.org>
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright

--- 779 unchanged lines hidden (view full) ---

788 */
789static struct mqfs_node *
790mqfs_search(struct mqfs_node *pd, const char *name, int len)
791{
792 struct mqfs_node *pn;
793
794 sx_assert(&pd->mn_info->mi_lock, SX_LOCKED);
795 LIST_FOREACH(pn, &pd->mn_children, mn_sibling) {
1/*-
2 * Copyright (c) 2005 David Xu <davidxu@freebsd.org>
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright

--- 779 unchanged lines hidden (view full) ---

788 */
789static struct mqfs_node *
790mqfs_search(struct mqfs_node *pd, const char *name, int len)
791{
792 struct mqfs_node *pn;
793
794 sx_assert(&pd->mn_info->mi_lock, SX_LOCKED);
795 LIST_FOREACH(pn, &pd->mn_children, mn_sibling) {
796 if (strncmp(pn->mn_name, name, len) == 0)
796 if (strncmp(pn->mn_name, name, len) == 0 &&
797 pn->mn_name[len] == '\0')
797 return (pn);
798 }
799 return (NULL);
800}
801
802/*
803 * Look up a file or directory.
804 */

--- 1710 unchanged lines hidden --- 		798 return (pn);
799 }
800 return (NULL);
801}
802
803/*
804 * Look up a file or directory.
805 */

--- 1710 unchanged lines hidden ---