mirror of
https://gitlab.freedesktop.org/mesa/mesa.git
synced 2026-05-19 15:48:19 +02:00
When a buffer is provided to eglGetConfigs it's supposed to set the value of the num_config parameter to the total number of configs that have been copied into this buffer. For some reason the EGL spec doesn't consider it to be an error to pass this function a buffer while specifying its size to be less than 0. Given this, one would expect this combination to result in the num_config parameter being set to 0 but this wasn't the case. This was due to the buffer size being copied straight into num_configs without being clamped to 0. This was causing the following dEQP EGL test to fail: dEQP-EGL.functional.query_config.get_configs.get_configs_bounds Signed-off-by: Frank Binns <frank.binns@imgtec.com> Reviewed-by: Matt Turner <mattst88@gmail.com> Reviewed-by: Emil Velikov <emil.l.velikov@gmail.com>
212 lines
4.8 KiB
C
212 lines
4.8 KiB
C
/**************************************************************************
|
|
*
|
|
* Copyright 2010 LunarG, Inc.
|
|
* All Rights Reserved.
|
|
*
|
|
* Permission is hereby granted, free of charge, to any person obtaining a
|
|
* copy of this software and associated documentation files (the
|
|
* "Software"), to deal in the Software without restriction, including
|
|
* without limitation the rights to use, copy, modify, merge, publish,
|
|
* distribute, sub license, and/or sell copies of the Software, and to
|
|
* permit persons to whom the Software is furnished to do so, subject to
|
|
* the following conditions:
|
|
*
|
|
* The above copyright notice and this permission notice (including the
|
|
* next paragraph) shall be included in all copies or substantial portions
|
|
* of the Software.
|
|
*
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
|
|
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
|
|
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
|
|
* DEALINGS IN THE SOFTWARE.
|
|
*
|
|
**************************************************************************/
|
|
|
|
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
|
|
#include "egllog.h"
|
|
#include "eglarray.h"
|
|
|
|
|
|
/**
|
|
* Grow the size of the array.
|
|
*/
|
|
static EGLBoolean
|
|
_eglGrowArray(_EGLArray *array)
|
|
{
|
|
EGLint new_size;
|
|
void **elems;
|
|
|
|
new_size = array->MaxSize;
|
|
while (new_size <= array->Size)
|
|
new_size *= 2;
|
|
|
|
elems = realloc(array->Elements, new_size * sizeof(array->Elements[0]));
|
|
if (!elems) {
|
|
_eglLog(_EGL_DEBUG, "failed to grow %s array to %d",
|
|
array->Name, new_size);
|
|
return EGL_FALSE;
|
|
}
|
|
|
|
array->Elements = elems;
|
|
array->MaxSize = new_size;
|
|
|
|
return EGL_TRUE;
|
|
}
|
|
|
|
|
|
/**
|
|
* Create an array.
|
|
*/
|
|
_EGLArray *
|
|
_eglCreateArray(const char *name, EGLint init_size)
|
|
{
|
|
_EGLArray *array;
|
|
|
|
array = calloc(1, sizeof(*array));
|
|
if (array) {
|
|
array->Name = name;
|
|
array->MaxSize = (init_size > 0) ? init_size : 1;
|
|
if (!_eglGrowArray(array)) {
|
|
free(array);
|
|
array = NULL;
|
|
}
|
|
}
|
|
|
|
return array;
|
|
}
|
|
|
|
|
|
/**
|
|
* Destroy an array, optionally free the data.
|
|
*/
|
|
void
|
|
_eglDestroyArray(_EGLArray *array, void (*free_cb)(void *))
|
|
{
|
|
if (free_cb) {
|
|
EGLint i;
|
|
for (i = 0; i < array->Size; i++)
|
|
free_cb(array->Elements[i]);
|
|
}
|
|
free(array->Elements);
|
|
free(array);
|
|
}
|
|
|
|
|
|
/**
|
|
* Append a element to an array.
|
|
*/
|
|
void
|
|
_eglAppendArray(_EGLArray *array, void *elem)
|
|
{
|
|
if (array->Size >= array->MaxSize && !_eglGrowArray(array))
|
|
return;
|
|
|
|
array->Elements[array->Size++] = elem;
|
|
}
|
|
|
|
|
|
/**
|
|
* Erase an element from an array.
|
|
*/
|
|
void
|
|
_eglEraseArray(_EGLArray *array, EGLint i, void (*free_cb)(void *))
|
|
{
|
|
if (free_cb)
|
|
free_cb(array->Elements[i]);
|
|
if (i < array->Size - 1) {
|
|
memmove(&array->Elements[i], &array->Elements[i + 1],
|
|
(array->Size - i - 1) * sizeof(array->Elements[0]));
|
|
}
|
|
array->Size--;
|
|
}
|
|
|
|
|
|
/**
|
|
* Find in an array for the given element.
|
|
*/
|
|
void *
|
|
_eglFindArray(_EGLArray *array, void *elem)
|
|
{
|
|
EGLint i;
|
|
|
|
if (!array)
|
|
return NULL;
|
|
|
|
for (i = 0; i < array->Size; i++)
|
|
if (array->Elements[i] == elem)
|
|
return elem;
|
|
return NULL;
|
|
}
|
|
|
|
|
|
/**
|
|
* Filter an array and return the number of filtered elements.
|
|
*/
|
|
EGLint
|
|
_eglFilterArray(_EGLArray *array, void **data, EGLint size,
|
|
_EGLArrayForEach filter, void *filter_data)
|
|
{
|
|
EGLint count = 0, i;
|
|
|
|
if (!array)
|
|
return 0;
|
|
|
|
if (filter) {
|
|
for (i = 0; i < array->Size; i++) {
|
|
if (filter(array->Elements[i], filter_data)) {
|
|
if (data && count < size)
|
|
data[count] = array->Elements[i];
|
|
count++;
|
|
}
|
|
if (data && count >= size)
|
|
break;
|
|
}
|
|
}
|
|
else {
|
|
if (data) {
|
|
count = (size < array->Size) ? size : array->Size;
|
|
memcpy(data, array->Elements, count * sizeof(array->Elements[0]));
|
|
}
|
|
else {
|
|
count = array->Size;
|
|
}
|
|
}
|
|
|
|
return count;
|
|
}
|
|
|
|
|
|
/**
|
|
* Flatten an array by converting array elements into another form and store
|
|
* them in a buffer.
|
|
*/
|
|
EGLint
|
|
_eglFlattenArray(_EGLArray *array, void *buffer, EGLint elem_size, EGLint size,
|
|
_EGLArrayForEach flatten)
|
|
{
|
|
EGLint i, count;
|
|
|
|
if (!array)
|
|
return 0;
|
|
|
|
count = array->Size;
|
|
if (buffer) {
|
|
/* clamp size to 0 */
|
|
if (size < 0)
|
|
size = 0;
|
|
/* do not exceed buffer size */
|
|
if (count > size)
|
|
count = size;
|
|
for (i = 0; i < count; i++)
|
|
flatten(array->Elements[i],
|
|
(void *) ((char *) buffer + elem_size * i));
|
|
}
|
|
|
|
return count;
|
|
}
|