2019-05-06 12:52:13 +02:00
|
|
|
/*
|
|
|
|
* Copyright 2019 Nikolay Sivov for CodeWeavers
|
|
|
|
*
|
|
|
|
* This library is free software; you can redistribute it and/or
|
|
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
|
|
* License as published by the Free Software Foundation; either
|
|
|
|
* version 2.1 of the License, or (at your option) any later version.
|
|
|
|
*
|
|
|
|
* This library is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
|
|
* Lesser General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU Lesser General Public
|
|
|
|
* License along with this library; if not, write to the Free Software
|
|
|
|
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
|
|
|
|
*/
|
|
|
|
|
2020-07-06 17:08:29 +02:00
|
|
|
#include "mferror.h"
|
2019-05-06 12:52:13 +02:00
|
|
|
#include "mfidl.h"
|
2020-07-07 13:40:15 +02:00
|
|
|
#include "mfapi.h"
|
2019-05-06 12:52:13 +02:00
|
|
|
|
2020-03-25 13:01:23 +01:00
|
|
|
#include "wine/debug.h"
|
2019-05-07 14:25:44 +02:00
|
|
|
|
|
|
|
static inline BOOL mf_array_reserve(void **elements, size_t *capacity, size_t count, size_t size)
|
|
|
|
{
|
|
|
|
size_t new_capacity, max_capacity;
|
|
|
|
void *new_elements;
|
|
|
|
|
|
|
|
if (count <= *capacity)
|
|
|
|
return TRUE;
|
|
|
|
|
|
|
|
max_capacity = ~(SIZE_T)0 / size;
|
|
|
|
if (count > max_capacity)
|
|
|
|
return FALSE;
|
|
|
|
|
|
|
|
new_capacity = max(4, *capacity);
|
|
|
|
while (new_capacity < count && new_capacity <= max_capacity / 2)
|
|
|
|
new_capacity *= 2;
|
|
|
|
if (new_capacity < count)
|
|
|
|
new_capacity = max_capacity;
|
|
|
|
|
2021-06-17 12:33:51 +02:00
|
|
|
if (!(new_elements = realloc(*elements, new_capacity * size)))
|
2019-05-07 14:25:44 +02:00
|
|
|
return FALSE;
|
|
|
|
|
|
|
|
*elements = new_elements;
|
|
|
|
*capacity = new_capacity;
|
|
|
|
|
|
|
|
return TRUE;
|
|
|
|
}
|
|
|
|
|
2019-05-06 12:52:13 +02:00
|
|
|
struct activate_funcs
|
|
|
|
{
|
2019-05-10 17:44:33 +02:00
|
|
|
HRESULT (*create_object)(IMFAttributes *attributes, void *context, IUnknown **object);
|
2020-03-11 12:19:41 +01:00
|
|
|
void (*shutdown_object)(void *context, IUnknown *object);
|
2019-05-06 12:52:13 +02:00
|
|
|
void (*free_private)(void *context);
|
|
|
|
};
|
|
|
|
|
|
|
|
HRESULT create_activation_object(void *context, const struct activate_funcs *funcs, IMFActivate **ret) DECLSPEC_HIDDEN;
|
2020-03-25 13:01:23 +01:00
|
|
|
|
|
|
|
static inline const char *debugstr_time(LONGLONG time)
|
|
|
|
{
|
|
|
|
ULONGLONG abstime = time >= 0 ? time : -time;
|
|
|
|
unsigned int i = 0, j = 0;
|
|
|
|
char buffer[23], rev[23];
|
|
|
|
|
|
|
|
while (abstime || i <= 8)
|
|
|
|
{
|
|
|
|
buffer[i++] = '0' + (abstime % 10);
|
|
|
|
abstime /= 10;
|
|
|
|
if (i == 7) buffer[i++] = '.';
|
|
|
|
}
|
|
|
|
if (time < 0) buffer[i++] = '-';
|
|
|
|
|
|
|
|
while (i--) rev[j++] = buffer[i];
|
2020-03-26 18:09:17 +01:00
|
|
|
while (rev[j-1] == '0' && rev[j-2] != '.') --j;
|
2020-03-25 13:01:23 +01:00
|
|
|
rev[j] = 0;
|
|
|
|
|
|
|
|
return wine_dbg_sprintf("%s", rev);
|
|
|
|
}
|
2020-12-01 13:16:29 +01:00
|
|
|
|
2021-01-14 20:40:17 +01:00
|
|
|
extern BOOL mf_is_sample_copier_transform(IMFTransform *transform) DECLSPEC_HIDDEN;
|
|
|
|
extern HRESULT topology_node_get_object(IMFTopologyNode *node, REFIID riid, void **obj) DECLSPEC_HIDDEN;
|