894 	unsigned idx, shuf = 0;  in udb_radnode_array_clean_front()  local
896 	while(shuf < lookup(n)->len && lookup(n)->array[shuf].node.data == 0)  in udb_radnode_array_clean_front()
897 		shuf++;  in udb_radnode_array_clean_front()
898 	if(shuf == 0)  in udb_radnode_array_clean_front()
900 	if(shuf == lookup(n)->len) {  in udb_radnode_array_clean_front()
904 	assert(shuf < lookup(n)->len);  in udb_radnode_array_clean_front()
905 	assert((int)shuf <= 255-(int)RADNODE(n)->offset);  in udb_radnode_array_clean_front()
907 	for(idx=0; idx<lookup(n)->len-shuf; idx++) {  in udb_radnode_array_clean_front()
909 			&lookup(n)->array[shuf+idx].node);  in udb_radnode_array_clean_front()
910 		lookup(n)->array[idx].len = lookup_len(n, shuf+idx);  in udb_radnode_array_clean_front()
911 		memmove(lookup_string(n, idx), lookup_string(n, shuf+idx),  in udb_radnode_array_clean_front()
915 	for(idx=lookup(n)->len-shuf; idx<lookup(n)->len; idx++) {  in udb_radnode_array_clean_front()
920 	RADNODE(n)->offset += shuf;  in udb_radnode_array_clean_front()
921 	lookup(n)->len -= shuf;  in udb_radnode_array_clean_front()
935 	unsigned shuf = 0;  in udb_radnode_array_clean_end()  local
938 	while(shuf < lookup(n)->len && lookup(n)->array[lookup(n)->len-1-shuf]  in udb_radnode_array_clean_end()
940 		shuf++;  in udb_radnode_array_clean_end()
941 	if(shuf == 0)  in udb_radnode_array_clean_end()
943 	if(shuf == lookup(n)->len) {  in udb_radnode_array_clean_end()
947 	assert(shuf < lookup(n)->len);  in udb_radnode_array_clean_end()
948 	lookup(n)->len -= shuf;  in udb_radnode_array_clean_end()