search for: hlist

...obat3 engr wpc20 DMI ATI PAGEMGR KPCMS OPLIMIT \ wpwin60 dell mouse vibra16 teac winmcad win32app acroread acrobat3 \ bsdl pkware ACADR13 DTEXT23 MCVHDL RECYCLED lotus Corel ACER \ MAX2WORK ticd abel3 clipart HPFONTS ORCADWIN ICM98) # Hosts with pcadmin remote access account # # set hlist = ( drachma kopek masada tohoten shiva peddlerI fujin sappho ) set olist = ( sandra johnf glenn jean peggy paula jim maureen ) set i = 1 while ($i <= $#hlist) date echo ping $hlist[$i] ping $hlist[$i] if ($status) then echo email to $olist[$i] for $hlist[$i] not ava...

I am trying to setup my Sun running samba 1.9.18p10 so that it can backup my dept's PCs. I can get it to work manually using the smbclient command with no problem. What I would like to do is have a script that is able to take a list of PCs, determine if a PC is online, backup that PC, then move on to the next one. If a PC is down, it can report an error to the admin to state that the

...inger <shemminger@osdl.org> diff -Nru a/include/linux/list.h b/include/linux/list.h --- a/include/linux/list.h 2004-07-28 15:30:04 -07:00 +++ b/include/linux/list.h 2004-07-28 15:30:04 -07:00 @@ -678,6 +678,24 @@ pos && ({ n = pos->next; 1; }) && \ ({ tpos = hlist_entry(pos, typeof(*tpos), member); 1;}); \ pos = n) + +/** + * hlist_for_each_entry_rcu - iterate over rcu list of given type + * @pos: the type * to use as a loop counter. + * @pos: the &struct hlist_node to use as a loop counter. + * @head: the head for your list. + * @member: the name...

...tree members more deterministic > > - seqlock, except this version makes the seqlock idea multi-holder on the > write side by protecting it with active_invalidate_ranges and a spinlock > > To minimize MM overhead when only the interval tree is being used, the > entire SRCU and hlist overheads are dropped using some simple > branches. Similarly the interval tree overhead is dropped when in hlist > mode. > > The overhead from the mandatory spinlock is broadly the same as most of > existing users which already had a lock (or two) of some sort on the > invalidati...

...d(HAVE_READLINE) # if defined(HAVE_READLINE_HISTORY_H) || defined(HAVE_HISTORY_H) /**************************************************************************** history ****************************************************************************/ static void cmd_history(void) { - HIST_ENTRY **hlist; register int i; - hlist = history_list (); /* Get pointer to history list */ - - if (hlist) /* If list not empty */ + if (history_length) /* If history is not empty */ { - for (i = 0; hlist[i]; i++) /* then display it */ - DEBUG(0, ("%d: %s\n", i, hlist[i]->line)); + for...

...akes adding/removing interval tree members more deterministic - seqlock, except this version makes the seqlock idea multi-holder on the write side by protecting it with active_invalidate_ranges and a spinlock To minimize MM overhead when only the interval tree is being used, the entire SRCU and hlist overheads are dropped using some simple branches. Similarly the interval tree overhead is dropped when in hlist mode. The overhead from the mandatory spinlock is broadly the same as most of existing users which already had a lock (or two) of some sort on the invalidation path. Cc: Andrea Arcangel...

The HTB scheduler code is a mess, this patch set does some basic house cleaning. The first four should cause no code change, but the last two need more testing. -- Stephen Hemminger <shemminger@osdl.org> "And in the Packet there writ down that doome" - To unsubscribe from this list: send the line "unsubscribe netdev" in the body of a message to

...akes adding/removing interval tree members more deterministic - seqlock, except this version makes the seqlock idea multi-holder on the write side by protecting it with active_invalidate_ranges and a spinlock To minimize MM overhead when only the interval tree is being used, the entire SRCU and hlist overheads are dropped using some simple branches. Similarly the interval tree overhead is dropped when in hlist mode. The overhead from the mandatory spinlock is broadly the same as most of existing users which already had a lock (or two) of some sort on the invalidation path. Acked-by: Christian...

...S OPLIMIT \ > wpwin60 dell mouse vibra16 teac winmcad win32app acroread acrobat3 \ > bsdl pkware ACADR13 DTEXT23 MCVHDL RECYCLED lotus Corel ACER \ > MAX2WORK ticd abel3 clipart HPFONTS ORCADWIN ICM98) > > # Hosts with pcadmin remote access account > # > # > set hlist = ( drachma kopek masada tohoten shiva peddlerI fujin sappho ) > set olist = ( sandra johnf glenn jean peggy paula jim maureen ) > > set i = 1 > while ($i <= $#hlist) > date > echo ping $hlist[$i] > ping $hlist[$i] > if ($status) then >...

On Wed, Jul 24, 2019 at 04:21:55PM -0300, Jason Gunthorpe wrote: > If we change the register to keep the hlist sorted by address then we > can do a targetted 'undo' of past starts terminated by address > less-than comparison of the first failing struct mmu_notifier. > > It relies on the fact that rcu is only used to remove items, the list > adds are all protected by mm locks, and the...

After some parallel mount/umount test on ocfs2, we got this: slab error in kmem_cache_destroy(): cache `o2dlm_mle': Can't free all objects. Then we found a memleak situation in dlm_add_migration_mle(). When a mle found, it will be removed from dlm->hlist. If there is no pointer to it at that moment, the mle will become an ?orphan mle? that no process can find and release. Signed-off-by: Xuejiufei <xuejiufei at huawei.com> --- fs/ocfs2/dlm/dlmmaster.c | 11 ++++++++++- 1 files changed, 10 insertions(+), 1 deletions(-) diff --git a/fs/ocfs...

On Wed 24-07-19 20:56:17, Michal Hocko wrote: > On Wed 24-07-19 15:08:37, Jason Gunthorpe wrote: > > On Wed, Jul 24, 2019 at 07:58:58PM +0200, Michal Hocko wrote: > [...] > > > Maybe new users have started relying on a new semantic in the meantime, > > > back then, none of the notifier has even started any action in blocking > > > mode on a EAGAIN bailout.

...pm dlist Dest id Mode Destination ------------------------------------------------------- 1 Local PORT = 0 2 Local PORT = 1 3 Local PORT = 2 4 Local PORT = 3 10 SIP Dest = 111.222.333.444/5060 OK To show the hunt group table: Console>atpm hlist ID Type # Member ids ---------------------------------------------------------------------------- 1 2 1 1 2 2 1 2 3 2 1 3 4 2 1 4 OK Console>atpm hadd atpm hadd <hunt_group_id> <hunt_type> <member1_id> <member2_id>.... Console>atpm had...

...use a lot of memory and also not pipeline > network access as much as we could. An additional comment should be added observing that this will affect hardlink processing, since it relies on the entire flist array being present in order to match dev and inode numbers. But perhaps the required hlist array could be saved and built on the fly as items with node counts > 1 are encountered. .... > Hard-link handling > > At the moment hardlink handling is very expensive, so it's off by > default. It does not need to be so. > > Since most of the solutions are rathe...

...o be a behavior for > notifiers that failed. Okay, good to know I'm not missing something. The idea was the failed notifier would have to handle the mandatory _end callback. I've reflected on it some more, and I have a scheme to be able to 'undo' that is safe against concurrent hlist_del_rcu. If we change the register to keep the hlist sorted by address then we can do a targetted 'undo' of past starts terminated by address less-than comparison of the first failing struct mmu_notifier. It relies on the fact that rcu is only used to remove items, the list adds are all p...

Based on net-next. This patch exports port->port_no port->port_id in the end of IFA_INFO_DATA. Cc: Herbert Xu <herbert at gondor.apana.org.au> Cc: Stephen Hemminger <shemminger at vyatta.com> Cc: "David S. Miller" <davem at davemloft.net> Cc: Thomas Graf <tgraf at suug.ch> Cc: Jesper Dangaard Brouer <brouer at redhat.com> Signed-off-by: Cong Wang

On 2018?09?28? 01:04, Michael S. Tsirkin wrote: > On Thu, Sep 27, 2018 at 08:22:04PM +0800, Jason Wang wrote: >> The access of vsock is not protected by vhost_vsock_lock. This may >> lead to use after free since vhost_vsock_dev_release() may free the >> pointer at the same time. >> >> Fix this by holding the lock during the access. >> >>

On 2018?09?28? 01:04, Michael S. Tsirkin wrote: > On Thu, Sep 27, 2018 at 08:22:04PM +0800, Jason Wang wrote: >> The access of vsock is not protected by vhost_vsock_lock. This may >> lead to use after free since vhost_vsock_dev_release() may free the >> pointer at the same time. >> >> Fix this by holding the lock during the access. >> >>

Second version, all feedback so far addressed, thanks for the help and interest! The patch to iproute2 has not changed, so I'm not including it this time. Patch 4/4 (the netlink interface) is basically unchanged as well but included for completeness. The other changes have moved forward a bit, to the point where I find them a lot cleaner and am more confident in the code being ready for

Second version, all feedback so far addressed, thanks for the help and interest! The patch to iproute2 has not changed, so I'm not including it this time. Patch 4/4 (the netlink interface) is basically unchanged as well but included for completeness. The other changes have moved forward a bit, to the point where I find them a lot cleaner and am more confident in the code being ready for