• Home
  • History
  • Annotate
  • Raw
  • Download
  • only in /macosx-10.9.5/xnu-2422.115.4/bsd/kern/

Lines Matching +defs:list +defs:flags

37  *    notice, this list of conditions and the following disclaimer.
39 * notice, this list of conditions and the following disclaimer in the
120 int flags, vfs_context_t ctx);
122 int flags, vfs_context_t ctx);
147 user_addr_t utimeout, unsigned int flags, int32_t *retval);
700 * time value. The saved filter-flags indicates
824 /* no "object" for timers, so fake a list */
1192 * We walk each list looking for knotes referencing this
1196 * safe in the assumption that the list will eventually
1224 /* start over at beginning of list */
1244 /* start over at beginning of list */
1323 kevp->flags = kev64.flags;
1337 kevp->flags = kev32.flags;
1368 kev64.flags = kevp->flags;
1379 kev32.flags = kevp->flags;
1440 0, /* no flags from old kevent() call */
1455 uap->flags,
1462 user_addr_t utimeout, __unused unsigned int flags,
1524 kev.flags &= ~EV_SYSFLAGS;
1526 if ((error || (kev.flags & EV_RECEIPT)) && nevents > 0) {
1527 kev.flags = EV_ERROR;
1606 "{.ident=%#llx, .filter=%d, .flags=%#x, .fflags=%#x, .data=%#llx, .udata=%#llx, .ext[0]=%#llx, .ext[1]=%#llx}",
1609 kevp->flags,
1677 struct klist *list;
1679 list = &fdp->fd_knhash[
1681 SLIST_FOREACH(kn, list, kn_link)
1693 if ((kev->flags & (EV_ADD|EV_DELETE)) == EV_ADD) {
1713 if (kev->flags & EV_DISABLE)
1767 if (kev->flags & EV_DELETE) {
1777 /* update status flags for existing knote */
1778 if (kev->flags & EV_DISABLE) {
1781 } else if (kev->flags & EV_ENABLE) {
2059 * kqueue list locked (held for duration of call)
2280 __unused int flags,
2290 __unused int flags,
2349 * list of knotes to see, and peek at the stay-
2515 klist_init(struct klist *list)
2517 SLIST_INIT(list);
2522 * Query/Post each knote in the object's list
2524 * The object lock protects the list. It is assumed
2534 knote(struct klist *list, long hint)
2538 SLIST_FOREACH(kn, list, kn_selnext) {
2558 * attach a knote to the specified list. Return true if this is the first entry.
2559 * The list is protected by whatever lock the object it is associated with uses.
2562 knote_attach(struct klist *list, struct knote *kn)
2564 int ret = SLIST_EMPTY(list);
2565 SLIST_INSERT_HEAD(list, kn, kn_selnext);
2570 * detach a knote from the specified list. Return true if that was the last entry.
2571 * The list is protected by whatever lock the object it is associated with uses.
2574 knote_detach(struct klist *list, struct knote *kn)
2576 SLIST_REMOVE(list, kn, knote, kn_selnext);
2577 return (SLIST_EMPTY(list));
2583 * the knote to the active list at wakeup (nothing calls knote()). Instead,
2607 * Also remove it from the magic list of directly attached knotes.
2610 * ignore any failures to unlink and just remove it from the kqueue list.
2641 struct klist *list;
2644 list = &fdp->fd_knlist[fd];
2645 while ((kn = SLIST_FIRST(list)) != NULL) {
2660 * it is safe to move on in the list.
2670 list = &fdp->fd_knlist[fd];
2678 struct klist *list = NULL;
2684 list = &fdp->fd_knhash[KN_HASH(kn->kn_id, fdp->fd_knhashmask)];
2701 MALLOC(list, struct klist *,
2703 if (list == NULL)
2706 bcopy((caddr_t)fdp->fd_knlist, (caddr_t)list,
2708 bzero((caddr_t)list +
2712 fdp->fd_knlist = list;
2715 list = &fdp->fd_knlist[kn->kn_id];
2717 SLIST_INSERT_HEAD(list, kn, kn_link);
2733 struct klist *list;
2738 list = &fdp->fd_knlist[kn->kn_id];
2740 list = &fdp->fd_knhash[KN_HASH(kn->kn_id, fdp->fd_knhashmask)];
2742 SLIST_REMOVE(list, kn, knote, kn_link);
2831 /* Initialize the vm pressure list lock */
2836 /* Initialize the memorystatus list lock */