Signed-off-by: Rusty Russell <rusty@rustcorp.com.au>

Signed-off-by: Ahmed Samy <f.fallen45@gmail.com>

Signed-off-by: Ahmed Samy <f.fallen45@gmail.com>

Signed-off-by: Ahmed Samy <f.fallen45@gmail.com>

Remove the assembly file that checks if the CPUID instruction is
supported and have it in inline assembly as suggested by Rusty.
Signed-off-by: Ahmed Samy <f.fallen45@gmail.com>

If the list of addrinfos give to net_bind() contains only IPv4 or only
IPv6 addresses, then the ipv4 and ipv6 variables may be used uninitialized.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>

Suggested-by: David Gibson <david@gibson.dropbear.id.au>
Signed-off-by: Ahmed Samy <f.fallen45@gmail.com>

Also merge extended features and non-extended in 1 function.
Suggested-by: Peter Hutterer <peter.hutterer@who-t.net>
Signed-off-by: Ahmed Samy <f.fallen45@gmail.com>

The new functions are:
- get_cpu_type
- get_cpu_type_string

Also add more tests on how one would parse the low-level stuff.
Signed-off-by: Ahmed Samy <f.fallen45@gmail.com>

Forgot to add this to the main commit, sorry.
Signed-off-by: Ahmed Samy <f.fallen45@gmail.com>

This module parses data provided by the cpuid instruction.
It still needs more work, however, it works for most important
stuff.
Signed-off-by: Ahmed Samy <f.fallen45@gmail.com>

Signed-off-by: Rusty Russell <rusty@rustcorp.com.au>

Suggested-by: Rusty Russell <rusty@rustcorp.com.au>
Signed-off-by: Emilio G. Cota <cota@braap.org>

Signed-off-by: Emilio G. Cota <cota@braap.org>

The extra spaces make my web formatter think they're literal text, which
looks weird.
Signed-off-by: Rusty Russell <rusty@rustcorp.com.au>

I noted to Timothy in 2011:
   I finally got around to implementing license checking in ccanlint,
   and it shows that your public domain ccan/isaac module uses your LGPL
   ccan/ilog module, which partially defeats the point.

   You and I are the only ones who did anything significant to ilog; I'm
   happy to relicense to PD or whatever else you want.  Or leave it, in
   which case I'll need to document it clearly.

He finally got back to me, and I sent him this patch, to which he replied:

     Ack.
Signed-off-by: Rusty Russell <rusty@rustcorp.com.au>

Signed-off-by: Rusty Russell <rusty@rustcorp.com.au>

Signed-off-by: Rusty Russell <rusty@rustcorp.com.au>

Signed-off-by: Rusty Russell <rusty@rustcorp.com.au>

If you're doing endian work, sparse's bitwise annotation is extremely useful.
Signed-off-by: Rusty Russell <rusty@rustcorp.com.au>

For use as direct locals, or when the size is a constant, inside
structure definitions.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>

Handling bitmaps which extend some odd number of bits, and assuring they
don't clobber partially overlapped variables is not worth the bother.

Also avoid namespace pollution.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>

Go with "words" rather than explicitly referencing longs in the macros
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>

This also fixes a bug which will hit on platforms where it's not safe to
dereference a (long *) which is not correctly aligned.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>

Some way towards iterating in the middle of the list.
Signed-off-by: Rusty Russell <rusty@rustcorp.com.au>

This adds a module for manipulating bitmaps, based on the API from the
Linux kernel's bitmap.h.  So far it's missing the trickier bits, but is
a little more flexible, allowing bitmaps that don't have to be contained
in an integer number of unsigned longs.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>

Signed-off-by: Volker Lendecke <vl@samba.org>
Signed-off-by: Rusty Russell <rusty@rustcorp.com.au>

Compiling with optimization FTW.
Signed-off-by: Rusty Russell <rusty@rustcorp.com.au>

Thanks to Jeremy Kerr for the idea!
Signed-off-by: Rusty Russell <rusty@rustcorp.com.au>

It makes the names longer, whereas the CAPS is probably sufficient.
Signed-off-by: Rusty Russell <rusty@rustcorp.com.au>

Sometimes you really need a compile-time constant, but there's no generic way
to create a macro which does this and only evaluates its argument once.

Thus we need specific const macros.
Signed-off-by: Rusty Russell <rusty@rustcorp.com.au>

Not worth LGPL for just this header.
Signed-off-by: Rusty Russell <rusty@rustcorp.com.au>

Add examples and a documentation fix.
Remove unused cascade function (was used in initial always-step-1-bucket
 version).
Restore timers_dump() to within CCAN_TIMER_DEBUG.
Signed-off-by: Rusty Russell <rusty@rustcorp.com.au>

There's a sweet spot around 5, without going all the way to 13 (which
would make each level 64/128k large).

TIMER_LEVEL_BITS 2: 100000000 in 5.833399-5.884659(5.85912+/-0.015) (18 levels / 32)
TIMER_LEVEL_BITS 3: 100000000 in 5.267610-5.303589(5.29018+/-0.011) (12-13(12.5+/-0.5) levels / 22)
TIMER_LEVEL_BITS 4: 100000000 in 4.215605-4.417297(4.27771+/-0.062) (9-10(9.1+/-0.3) levels / 16)
TIMER_LEVEL_BITS 5: 100000000 in 3.859340-3.972603(3.90149+/-0.034) (7-8(7.1+/-0.3) levels / 13)
TIMER_LEVEL_BITS 6: 100000000 in 3.976157-4.037230(4.00199+/-0.02) (6 levels / 11)
TIMER_LEVEL_BITS 7: 100000000 in 4.014228-4.082031(4.05024+/-0.022) (5-6(5.4+/-0.49) levels / 10)
TIMER_LEVEL_BITS 8: 100000000 in 3.915615-3.978781(3.94972+/-0.02) (5 levels / 8)
TIMER_LEVEL_BITS 9: 100000000 in 3.859413-4.025842(3.89993+/-0.046) (4-5(4.6+/-0.49) levels / 8)
TIMER_LEVEL_BITS 10: 100000000 in 3.983507-4.170152(4.06743+/-0.055) (4 levels / 7)
TIMER_LEVEL_BITS 11: 100000000 in 3.468756-3.610746(3.52843+/-0.04) (4 levels / 6)
TIMER_LEVEL_BITS 12: 100000000 in 3.274397-3.377530(3.3192+/-0.026) (4 levels / 6)
TIMER_LEVEL_BITS 13: 100000000 in 3.116845-3.178162(3.1398+/-0.017) (3 levels / 5)
TIMER_LEVEL_BITS 14: 100000000 in 3.152599-3.264060(3.20733+/-0.043) (3 levels / 5)
TIMER_LEVEL_BITS 15: 100000000 in 3.186556-3.552432(3.25597+/-0.11) (3 levels / 5)
TIMER_LEVEL_BITS 16: 100000000 in 3.139352-3.485653(3.27263+/-0.11) (3 levels / 4)
Signed-off-by: Rusty Russell <rusty@rustcorp.com.au>

We spend a lot of time searching for the next timer to expire: by caching
the minimum, we can skip most of this work.  Even if timers are deleted,
the minimum will be a starting point for searching.

The expected-usage benchmark has to be increased by a factor of 100,
otherwise it's now too short.

Before:
	$ ./expected-usage
	1000000 in 12.701647935

After:
	$ ./expected-usage  1000000
	1000000 in 0.061095153
Signed-off-by: Rusty Russell <rusty@rustcorp.com.au>

Signed-off-by: Rusty Russell <rusty@rustcorp.com.au>

It's got some useful stuff in it, but doesn't pass ccanlint here.
Signed-off-by: Rusty Russell <rusty@rustcorp.com.au>