search for: rehashing

All, I am having a winbind module load error on aix 7.1 trying to load winbind module for 3.6.0. methods.cfg WINBIND: program_64 = /usr/lib/security/WINBIND_64 (have tried authonly here) NIS: program = /usr/lib/security/NIS program_64 = /usr/lib/security/NIS_64 DCE: program = /usr/lib/security/DCE [root] on [barrow] on [/rehash/samba-3.6.0] {932}

I tried admin rehash for the first time since upgrading to 1.3.12 today. The rehash took at least 30 seconds [If not longer -- I didn't time it very closely] and icecast slowly snuck up to 99% CPU usage. I tried issuing the 'alias' command just to try and get a response from the console and that never responded. [I waited about two minutes] I had the same experience both of my

All, I am having a winbind module load error on aix 7.1 trying to load winbind module for 3.6.0. methods.cfg WINBIND: program_64 = /usr/lib/security/WINBIND_64 (have tried authonly here) NIS: program = /usr/lib/security/NIS program_64 = /usr/lib/security/NIS_64 DCE: program = /usr/lib/security/DCE [root] on [barrow] on [/rehash/samba-3.6.0] {932}

All, I am having a winbind module load error on aix 7.1 trying to load winbind module for 3.6.0. methods.cfg WINBIND: program_64 = /usr/lib/security/WINBIND_64 (have tried authonly here) NIS: program = /usr/lib/security/NIS program_64 = /usr/lib/security/NIS_64 DCE: program = /usr/lib/security/DCE [root] on [barrow] on [/rehash/samba-3.6.0] {932}

...and reinsert everything. This means growing a DenseMap costs much, much more than growing, for example, a vector. I talked about this with a few people and here are some possibilities we’ve come up with to improve this (some of which probably aren’t what we want): 1. Use a map that doesn’t require rehashing and reinsertion to grow. Chaining lets you do this, but std::unordered_map is probably so much slower than DenseMap we’d lose more than we gain. 2. Include the hash code in the map so that we don’t have to rehash. 32 bits more per entry (or whatever), and it might not help that much, since we still...

Beau D Simensen <simensen@halogen.org> writes: > I tried admin rehash for the first time since upgrading to 1.3.12 today. The > rehash took at least 30 seconds [If not longer -- I didn't time it very > closely] and icecast slowly snuck up to 99% CPU usage. I tried issuing the > 'alias' command just to try and get a response from the console and that > never

Hi, After the 6.2 upgrade, the new /etc/login.defs has: ? ENCRYPT_METHOD SHA512 instead of MD5Is it safe to just apply the change? Will my current MD5 passwords in /etc/passwd still work and only new passwords will be SHA512? Or are they automatically "converted" (rehashed) to SHA512? Thx, JD

backgroud: ocfs2 dlm uses a hash table to store dlm_lock_resource objects. the often used lookup is performed on the hash table. problem: for usages that there are huge number of inodes(thus huge number of dlm_lock_resource objects) in a ocfs2 volume, the lookup performance becomes a problem. the lookup holds spin_lock which could put all others cpus into the state of aquring the spinlock. if

Commit-ID: e8b1ed5d253922aeb880518f27312b112e360f09 Gitweb: http://git.kernel.org/?p=libs/klibc/klibc.git;a=commit;h=e8b1ed5d253922aeb880518f27312b112e360f09 Author: Herbert Xu <herbert at gondor.apana.org.au> AuthorDate: Sat, 19 May 2018 02:39:51 +0800 Committer: Ben Hutchings <ben at decadent.org.uk> CommitDate: Sat, 28 Mar 2020 21:42:55 +0000 [klibc] dash: exec: Never

Hi All, I'm using the Call Queue without the Agent Login to provide a company with a Call Queue for their tech support Staff. Basically they have several techs the work from home. I dump the calls back out the PSTN via a SIP gateway. With the Queue application is there a way to define an absolute time out so that if a caller sits in the queue for say 10 minutes with out being serviced they

...rt everything. This means growing a DenseMap costs much, much more than growing, for example, a vector. I talked about this with a few people and here are some possibilities we’ve come up with to improve this (some of which probably aren’t what we want): > > 1. Use a map that doesn’t require rehashing and reinsertion to grow. Chaining lets you do this, but std::unordered_map is probably so much slower than DenseMap we’d lose more than we gain. > 2. Include the hash code in the map so that we don’t have to rehash. 32 bits more per entry (or whatever), and it might not help that much, since we...

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.1//EN" "http://www.w3.org/TR/xhtml11/DTD/xhtml11.dtd"> <html xmlns="http://www.w3.org/1999/xhtml"> <head><meta http-equiv="content-type" content="text/html; charset=utf-8" /><style type="text/css"><!-- #msg dl { border: 1px #006 solid; background: #369; padding:

...thing. This means growing a DenseMap costs much, much more than growing, for example, a vector. I talked about this with a few people and here are some possibilities we’ve come up with to improve this (some of which probably aren’t what we want): >> >> 1. Use a map that doesn’t require rehashing and reinsertion to grow. Chaining lets you do this, but std::unordered_map is probably so much slower than DenseMap we’d lose more than we gain. >> 2. Include the hash code in the map so that we don’t have to rehash. 32 bits more per entry (or whatever), and it might not help that much, since...

Attached are nits I found in 1.3.12. That first patch there looks more like a bug than a nit. ------ Dave Hayes - Consultant - Altadena CA, USA - dave@jetcafe.org >>> The opinions expressed above are entirely my own <<< Before criticizing people, walk a mile in their shoes. Then when you do criticize them, you will be a mile away and have their shoes. *** avl_functions.c

Attached are nits I found in 1.3.12. That first patch there looks more like a bug than a nit. ------ Dave Hayes - Consultant - Altadena CA, USA - dave@jetcafe.org >>> The opinions expressed above are entirely my own <<< Before criticizing people, walk a mile in their shoes. Then when you do criticize them, you will be a mile away and have their shoes. *** avl_functions.c

I can't resist. Read the thread that was pointed to on lkml. ROTFLMAO. *Real* UNIX addressed these problems long ago. I guess the "Gurus" suffer from NIH (Not Invented Here) syndrome. Given a "general purpose" system, tunability is a must. UNIX, as delivered by USL in such examples as Sys V, had tunables that let admins tune to their needs. A single "swappiness"

This series of patches address several issues causing memory usage to grow indefinetely on a long lived process. These are not convenional leaks -- memory would have been freed when the LLVM context or/and JIT engine is destroyed -- but for as long as they aren't the memory is usage effectively ubounded. The issues were found using valgrind with '--show-reachable=yes' option: 1.

My element IDs are constructed using the object id. So . . . <div id="foo<%= foo.id %>" > <p><%= link_to_remote "Do Foo", :url =>{:action => "do", :id => foo.id} %> </div> How do, and can I, build that id in the RJS template? Also, can anyone recommend a good Ruby syntax book that would help me out with Rails? I know

Sylvain CANOINE wrote: >> De: "Jonathan Billings" <billings at negate.org> >> Maybe you're not aware of it, but there are a LOT of things that >> systemd fixes that people are happy about. > Like what ? I don't remember there were as many errors to fix before > systemd appeared. > Agreed. The speed of boot and shutdown? Whoop-de-do. I've got

Hello All, Sorry to rehash a question I am sure has shown several time but I cannot google up the answer from the lists. Does anyone know where I can get some royalty free, cost free music for my music on hold? I saw someone's post several weeks ago that said that this exists at a download site but I have not been able to find it. Thanks! Wiley Siler -------------- next