arr               168 kern/include/array.h 		struct array arr;				\
arr               190 kern/include/array.h 		array_init(&a->arr);				\
arr               197 kern/include/array.h 		array_cleanup(&a->arr);				\
arr               204 kern/include/array.h 		array_init(&a->arr);				\
arr               210 kern/include/array.h 		array_cleanup(&a->arr);				\
arr               216 kern/include/array.h 		return array_num(&a->arr);			\
arr               222 kern/include/array.h 		return (T *)array_get(&a->arr, index);		\
arr               228 kern/include/array.h 		array_set(&a->arr, index, (void *)val);		\
arr               234 kern/include/array.h 		return array_setsize(&a->arr, num);		\
arr               240 kern/include/array.h 		return array_add(&a->arr, (void *)val, index_ret); \
arr               246 kern/include/array.h 		return array_remove(&a->arr, index);		\
arr                59 user/testbin/sort/sort.c sort(int *arr, int size)
arr                69 user/testbin/sort/sort.c 	sort(arr, pivot);
arr                70 user/testbin/sort/sort.c 	sort(&arr[pivot], size-pivot);
arr                76 user/testbin/sort/sort.c 		if (arr[i] < arr[j]) {
arr                77 user/testbin/sort/sort.c 			tmp[k++] = arr[i++];
arr                80 user/testbin/sort/sort.c 			tmp[k++] = arr[j++];
arr                84 user/testbin/sort/sort.c 		tmp[k++] = arr[i++];
arr                87 user/testbin/sort/sort.c 		tmp[k++] = arr[j++];
arr                90 user/testbin/sort/sort.c 	memcpy(arr, tmp, size*sizeof(int));