search for: hash_val

...samba.org/mailman/options/samba I could be wrong on this, but generally speaking, you can be compatible using idmap_rid if you set a low range identical to that of the low range in SSSD. SSSD determines low range for initial id slice using approximately the following algorithm IIRC: ``` uint32_t hash_val = 0; int our_slice = 0; int max_slices = 10000; int final_value = 0; int slice_size = 20000 hash_val = murmur3(sid_str, strlen(sid_str), 0xdeadbeef); our_slice = hash_val % max_slices; final_value = our_slice * slice_size +slice_size; ``` This works for the first slice, but slices after that are n...

...re than the slice size, there could be a problem because SSSD allows multiple slices. I haven't tested sssd-winbind-idmap yet I mentioned in another response > > SSSD determines low range for initial id slice using approximately the > following algorithm IIRC: > ``` > uint32_t hash_val = 0; > int our_slice = 0; > int max_slices = 10000; > int final_value = 0; > int slice_size = 20000 > > hash_val = murmur3(sid_str, strlen(sid_str), 0xdeadbeef); > our_slice = hash_val % max_slices; > final_value = our_slice * slice_size +slice_size; > ``` > This work...

...I could be wrong on this, but generally speaking, you can be compatible > using idmap_rid if you set a low range identical to that of the low range > in SSSD. > > SSSD determines low range for initial id slice using approximately the > following algorithm IIRC: > ``` > uint32_t hash_val = 0; > int our_slice = 0; > int max_slices = 10000; > int final_value = 0; > int slice_size = 20000 > > hash_val = murmur3(sid_str, strlen(sid_str), 0xdeadbeef); > our_slice = hash_val % max_slices; > final_value = our_slice * slice_size +slice_size; > ``` > This works...

On Thu, Sep 03, 2020 at 06:43:32PM +0100, Rowland penny via samba wrote: > On 03/09/2020 18:04, Johan Hattne via samba wrote: > > Dear all; > > > > Would anybody be able to tell me what the idmap configuration is to have > > Samba do the same SID-to-user/group mapping as the SSSD defaults?? I was > > convinced I saw it on this list or the wiki not too long ago,

Hi, below comes a new version of the series of patches implementing quota support for ocfs2-tools. I've fixed the calls of ocfs2_malloc_blocks() which were given number of bytes instead of number of blocks. Besides that the series should be the same. Honza

Hi, I'm sending a series of patches implementing quota support into ocfs2-tools. It's the same as the original huge patch I've sent but now it's split as Joel asked. I've also realized that when disabling SPARSE feature, we should update quota information. That piece of code is missing, I'll implement it soon. Comments welcome. Honza

Hi, this is the next version of quota support for quota tools. I've addressed all the comments of Tao, Joel and others. Sparse feature disabling also correctly updates quota information now and the patch is merged into the tunefs support patch. Honza

I have a new problem: Register RBP is used in a function foo. (I am not allocating RBP to any virtual register, the instances of RBP in function foo are in the machine code when my register allocator starts.) Function foo calls function bar. Register RBP is not saved across the call, though it is live after the call. Function bar includes a virtual register. The code that I'm using to

...funct (register char[], int); struct hash_entry *ndtbl[101]; struct hash_entry *sctbl[101]; struct hash_entry *ccltab[101]; struct hash_entry *findsym(); int addsym( sym, str_def, int_def, table, table_size ) register char sym[]; char *str_def; int int_def; hash_table table; int table_size; { int hash_val = hashfunct( sym, table_size ); register struct hash_entry *sym_entry = table[hash_val]; register struct hash_entry *new_entry; register struct hash_entry *successor; while ( sym_entry ) { if ( ! strcmp( sym, sym_entry->name ) ) { return -1; } sym_entry = sym_entry->next;...