Re: [9front] fix ref822

[cinap_lenrek@felloff.net]

i think this is also wrong:

+	if(i + n > Nref){
+		for(i = 0; i < n; i++)
+			free(a[i]);
+		for(i = n; i < Nref; i++)
+			a[i - n] = a[i];
 	}

i is number of entries in a[], n is number of entries in f[]. if we got
like i = 1 and n = Nref, we'd want to remove 1 item from a because:

i + n - Nref == 1 + Nref - Nref == 1

also, i think the uniqarray() approach is wrong. we probably want to
deduplicate while we insert into a. we should never populate m->references
with duplicate items in the first place.

delete uniquearray() and instead just do it like this:

a = m->references;
n = tokenize(f, ....);

for(i=0; i<n; i++){
	for(j=0; j<Nref; j++){
		if(a[j] == nil || strcmp(a[j], f[i]) == 0)
			break;
	}
	if(j == Nref){
		// handle full case, shift a by one
	}

	// now a[j] can be: nil = slot free, 
	a[j] = f[i];	// put into array
}

--
cinap