Lines Matching refs:min_position

236         arg_v->min_position = 1;  in copyArgv()
656 arr_to->max_position = arrayMaxPos(arr_to->min_position, new_size); in arrAppend()
687 arr1->min_position = start_position; in arrArrlit2()
706 result->min_position = 1; in arrBaselit()
726 result->min_position = start_position; in arrBaselit2()
763 result->max_position = arrayMaxPos(result->min_position, result_size); in arrCat()
845 result->min_position = 1; in arrGen()
870 if (stop >= arr1->min_position && arr1_size >= 1) { in arrHead()
874 result_size = arraySize2(arr1->min_position, stop); in arrHead()
878 result->min_position = arr1->min_position; in arrHead()
883 } else if (unlikely(stop < arr1->min_position - 1)) { in arrHead()
886 arr1->min_position, stop);); in arrHead()
889 } else if (unlikely(arr1->min_position == MIN_MEM_INDEX)) { in arrHead()
899 result->min_position = arr1->min_position; in arrHead()
900 result->max_position = arr1->min_position - 1; in arrHead()
928 if (stop >= arr1->min_position && arr1_size >= 1) { in arrHeadTemp()
933 result_size = arraySize2(arr1->min_position, stop); in arrHeadTemp()
938 new_arr1->min_position = stop + 1; in arrHeadTemp()
953 } else if (unlikely(stop < arr1->min_position - 1)) { in arrHeadTemp()
956 arr1->min_position, stop);); in arrHeadTemp()
959 } else if (unlikely(arr1->min_position == MIN_MEM_INDEX)) { in arrHeadTemp()
969 result->min_position = arr1->min_position; in arrHeadTemp()
970 result->max_position = arr1->min_position - 1; in arrHeadTemp()
997 if (unlikely(position < arr1->min_position || in arrIdxTemp()
1001 position, arr1->min_position, arr1->max_position);); in arrIdxTemp()
1006 result = arr1->arr[position - arr1->min_position].value.genericValue; in arrIdxTemp()
1008 arr1->arr[position - arr1->min_position].value.genericValue = in arrIdxTemp()
1043 if (unlikely(position < arr1->min_position || in arrInsert()
1047 position, arr1->min_position, arr1->max_position + 1);); in arrInsert()
1058 memmove(&array_pointer[position - arr1->min_position + 1], in arrInsert()
1059 &array_pointer[position - arr1->min_position], in arrInsert()
1061 array_pointer[position - arr1->min_position].value.genericValue = element; in arrInsert()
1089 if (unlikely(position < arr1->min_position || in arrInsertArray()
1093 position, arr1->min_position, arr1->max_position + 1);); in arrInsertArray()
1127 resized_arr1->max_position = arrayMaxPos(resized_arr1->min_position, new_size); in arrInsertArray()
1172 result->min_position = minPosition; in arrMalloc()
1232 if (unlikely(start < arr1->min_position)) { in arrRange()
1236 stop >= arr1->min_position && arr1_size >= 1) { in arrRange()
1244 result->min_position = arr1->min_position; in arrRange()
1245 result->max_position = arrayMaxPos(arr1->min_position, result_size); in arrRange()
1253 } else if (unlikely(arr1->min_position == MIN_MEM_INDEX)) { in arrRange()
1263 result->min_position = arr1->min_position; in arrRange()
1264 result->max_position = arr1->min_position - 1; in arrRange()
1295 if (unlikely(start < arr1->min_position)) { in arrRangeTemp()
1310 result->min_position = arr1->min_position; in arrRangeTemp()
1311 result->max_position = arrayMaxPos(arr1->min_position, result_size); in arrRangeTemp()
1327 resized_arr1->max_position = arrayMaxPos(resized_arr1->min_position, in arrRangeTemp()
1336 } else if (unlikely(arr1->min_position == MIN_MEM_INDEX)) { in arrRangeTemp()
1346 result->min_position = arr1->min_position; in arrRangeTemp()
1347 result->max_position = arr1->min_position - 1; in arrRangeTemp()
1402 if (unlikely(position < arr1->min_position || in arrRemove()
1406 position, arr1->min_position, arr1->max_position);); in arrRemove()
1411 result = array_pointer[position - arr1->min_position].value.genericValue; in arrRemove()
1412 memmove(&array_pointer[position - arr1->min_position], in arrRemove()
1413 &array_pointer[position - arr1->min_position + 1], in arrRemove()
1422 memmove(&array_pointer[position - arr1->min_position + 1], in arrRemove()
1423 &array_pointer[position - arr1->min_position], in arrRemove()
1425 array_pointer[position - arr1->min_position].value.genericValue = result; in arrRemove()
1466 } else if (unlikely(position < arr1->min_position || in arrRemoveArray()
1470 position, arr1->min_position, arr1->max_position);); in arrRemoveArray()
1487 result->min_position = arr1->min_position; in arrRemoveArray()
1488 result->max_position = arrayMaxPos(arr1->min_position, result_size); in arrRemoveArray()
1513 arr1->max_position = arrayMaxPos(arr1->min_position, arr1_size - result_size); in arrRemoveArray()
1527 rtl_qsort_array(arr1->arr, &arr1->arr[arr1->max_position - arr1->min_position], cmp_func); in arrSort()
1549 if (unlikely(start < arr1->min_position || length < 0)) { in arrSubarr()
1562 result->min_position = arr1->min_position; in arrSubarr()
1563 result->max_position = arrayMaxPos(arr1->min_position, result_size); in arrSubarr()
1568 } else if (unlikely(arr1->min_position == MIN_MEM_INDEX)) { in arrSubarr()
1578 result->min_position = arr1->min_position; in arrSubarr()
1579 result->max_position = arr1->min_position - 1; in arrSubarr()
1610 if (unlikely(start < arr1->min_position || length < 0)) { in arrSubarrTemp()
1627 result->min_position = arr1->min_position; in arrSubarrTemp()
1628 result->max_position = arrayMaxPos(arr1->min_position, result_size); in arrSubarrTemp()
1644 resized_arr1->max_position = arrayMaxPos(resized_arr1->min_position, in arrSubarrTemp()
1650 } else if (unlikely(arr1->min_position == MIN_MEM_INDEX)) { in arrSubarrTemp()
1660 result->min_position = arr1->min_position; in arrSubarrTemp()
1661 result->max_position = arr1->min_position - 1; in arrSubarrTemp()
1686 if (unlikely(start < arr1->min_position)) { in arrTail()
1689 arr1->min_position, start);); in arrTail()
1697 result->min_position = arr1->min_position; in arrTail()
1698 result->max_position = arrayMaxPos(arr1->min_position, result_size); in arrTail()
1703 } else if (unlikely(arr1->min_position == MIN_MEM_INDEX)) { in arrTail()
1713 result->min_position = arr1->min_position; in arrTail()
1714 result->max_position = arr1->min_position - 1; in arrTail()
1743 if (start <= arr1->min_position) { in arrTailTemp()
1744 if (unlikely(start < arr1->min_position)) { in arrTailTemp()
1747 arr1->min_position, start);); in arrTailTemp()
1759 result->min_position = arr1->min_position; in arrTailTemp()
1760 result->max_position = arrayMaxPos(arr1->min_position, result_size); in arrTailTemp()
1775 } else if (unlikely(arr1->min_position == MIN_MEM_INDEX)) { in arrTailTemp()
1785 result->min_position = arr1->min_position; in arrTailTemp()
1786 result->max_position = arr1->min_position - 1; in arrTailTemp()