Lines Matching refs:any

45  (5) Index keys can be of any length and can be of different lengths.
47  (6) Index keys should encode the length early on, before any variation due to
114      will then be passed to call_rcu() to free it and any dead stuff it points
281      returns true, it must perform any appropriate refcount incrementing on the
317      iteration algorithm should not, however, miss any objects.
321      immediately if any call to the iteration function results in a non-zero
344 The index key can be of any form, but since the algorithms aren't told how long
346 very early on before any variation due to the length would have an effect on
363 unlikely that more than one word of any particular index key will have to be
454 then the node will have all those leaves in it and will not have any metadata
459 space.  The leaves can be in any slot not occupied by a metadata pointer.  It
461 metadata pointer.  If the metadata pointer is there, any leaf whose key matches
470 	any	LEAF		9431809de993ba
471 	any	LEAF		b4542910809cd
473 	any	LEAF		f3842239082
478 	any	LEAF		1458952489
545      leaves in a node before following any of its metadata pointers).