search for: hasher

We're considering implementing gluster for a genomics cluster, and it seems to have some theoretical advantages that so far seem to have been borne out in some limited testing, mod some odd problems with an inability to delete dir trees. I'm about to test with the latest beta that was promised to clear up these bugs, but as I'm doing that, answers to these Qs would be

...l I would much rather have an interface that is close to or mirrors this one. We already have some field experience with it, and using it in LLVM and Clang would provide more. Also, it would be possible to essentially share code between such an implementation and libc++. We looked closely at 'hasher' objects and using add methods on them and they tended to have some serious drawbacks: 1) they require some amount of "incrementality", limiting the quality and performance of the hashing algorithm 2) they require more boiler plate 3) they compose recursively less cleanly Even given...

...r) + iput(root->orphan_dir); if (root->inode) iput(root->inode); if (root->node) @@ -1603,6 +1608,7 @@ int close_ctree(struct btrfs_root *root) btrfs_stop_workers(&fs_info->submit_workers); iput(fs_info->btree_inode); + #if 0 while(!list_empty(&fs_info->hashers)) { struct btrfs_hasher *hasher; diff -r 99b12e2db0f8 inode.c --- a/inode.c Wed Jun 18 20:50:41 2008 -0400 +++ b/inode.c Tue Jun 24 21:04:39 2008 -0400 @@ -76,6 +76,11 @@ static unsigned char btrfs_type_by_mode[ [S_IFSOCK >> S_SHIFT] = BTRFS_FT_SOCK, [S_IFLNK >> S_SHIFT] = BTRFS...

Hi Hal, Because my function merging strategy is able to merge any two function, allowing for different CFGs, different parameters, etc. I am unable to use just a simple hash value to compare whether or not two functions are similar. Therefore, the idea is to have an infrastructure which allows me to compare whether or not two functions are similar without having traverse the two function

...hat's where having a good hash function comes in. >> >> There are a bunch of hash functions out there (FNV1, SuperFastHash, and >> many others). The best overall hash function that I am currently aware of >> is Austin Appleby's MurmurHash3 (http://code.google.com/p/smhasher/). >> >> For LLVM's use, we want a hash function that can handle mixed data - that >> is, pointers, ints, strings, and so on. Most of the high-performance hash >> functions will work well on mixed data types, but you have to put >> everything into a flat buffer - t...

...at 5:08 PM Alexandre Ganea <alexandre.ganea at ubisoft.com> wrote: > > For enabling large memory pages, see this link: https://support.sisoftware.co.uk/knowledgebase.php?article=52 > > Meow hash isn't in the patch I posted, but you can use xxHash, it is good enough. Just add /hasher:xxhash to the LLD cmd-line. > > > -----Original Message----- > From: Leonardo Santagada <santagada at gmail.com> > Sent: Monday, February 25, 2019 11:05 AM > To: Alexandre Ganea <alexandre.ganea at ubisoft.com> > Cc: Zachary Turner <zturner at google.com>; Rei...

...ave an interface that is close to or mirrors this > one. We already have some field experience with it, and using it in LLVM > and Clang would provide more. Also, it would be possible to essentially > share code between such an implementation and libc++. > > We looked closely at 'hasher' objects and using add methods on them and > they tended to have some serious drawbacks: > > 1) they require some amount of "incrementality", limiting the quality and > performance of the hashing algorithm > 2) they require more boiler plate > 3) they compose recursi...

....d54033b 100644 --- a/src/private-data.c +++ b/src/private-data.c @@ -68,6 +68,8 @@ guestfs_set_private (guestfs_h *g, const char *key, void *data) { struct pda_entry *new_entry, *old_entry, *entry; + ACQUIRE_LOCK (g); + if (g->pda == NULL) { g->pda = hash_initialize (16, NULL, hasher, comparator, freer); if (g->pda == NULL) @@ -85,10 +87,12 @@ guestfs_set_private (guestfs_h *g, const char *key, void *data) if (entry == NULL) g->abort_cb (); assert (entry == new_entry); + + RELEASE_LOCK (g); } -void * -guestfs_get_private (guestfs_h *g, const char *key)...

...ubisoft.com> wrote: > > > > > > For enabling large memory pages, see this link: > https://support.sisoftware.co.uk/knowledgebase.php?article=52 > > > > > > Meow hash isn't in the patch I posted, but you can use xxHash, it is > good enough. Just add /hasher:xxhash to the LLD cmd-line. > > > > > > > > > -----Original Message----- > > > From: Leonardo Santagada <santagada at gmail.com> > > > Sent: Monday, February 25, 2019 11:05 AM > > > To: Alexandre Ganea <alexandre.ganea at ubisoft.com&gt...

...;mailto:alexandre.ganea at ubisoft.com>> wrote: > > > > For enabling large memory pages, see this link: https://support.sisoftware.co.uk/knowledgebase.php?article=52 > > > > Meow hash isn't in the patch I posted, but you can use xxHash, it is good enough. Just add /hasher:xxhash to the LLD cmd-line. > > > > > > -----Original Message----- > > From: Leonardo Santagada <santagada at gmail.com<mailto:santagada at gmail.com>> > > Sent: Monday, February 25, 2019 11:05 AM > > To: Alexandre Ganea <alexandre.ganea at ubisoft...

This is an updated and extended version of the original patch: https://www.redhat.com/archives/libguestfs/2010-August/msg00163.html This adds OCaml and Perl bindings (both tested), support for progress bars in virt-resize, and adds progress notifications to a number of the simpler commands. Still to do is to add progress messages to more commands. There are still a few commands which would be

Times for lld compiled with LTO: Input File Reading: 1430 ms ( 3.3%) Code Layout: 486 ms ( 1.1%) PDB Emission (Cumulative): 41042 ms ( 94.6%) Add Objects: 33117 ms ( 76.4%) Type Merging: 25861 ms ( 59.6%) Symbol Merging: 7011 ms ( 16.2%) TPI Stream Layout: 996 ms ( 2.3%) Globals Stream Layout:

This patch isn't ready to go upstream. In fact, I think we might do a quick 1.30 release soon, and save this patch, and also the extensive changes proposed for the test suite[1], to after 1.30. Currently it is not safe to use the same handle from multiple threads, unless you implement your own mutexes. See: http://libguestfs.org/guestfs.3.html#multiple-handles-and-multiple-threads These