/usr/include/directfb/fusion/vector.h is in libdirectfb-dev 1.2.10.0-5.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 | /*
(c) Copyright 2001-2008 The world wide DirectFB Open Source Community (directfb.org)
(c) Copyright 2000-2004 Convergence (integrated media) GmbH
All rights reserved.
Written by Denis Oliver Kropp <dok@directfb.org>,
Andreas Hundt <andi@fischlustig.de>,
Sven Neumann <neo@directfb.org>,
Ville Syrjälä <syrjala@sci.fi> and
Claudio Ciccani <klan@users.sf.net>.
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 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., 59 Temple Place - Suite 330,
Boston, MA 02111-1307, USA.
*/
#ifndef __FUSION__VECTOR_H__
#define __FUSION__VECTOR_H__
#include <limits.h>
#include <fusion/types.h>
#include <direct/debug.h>
typedef struct {
int magic;
void **elements;
int count;
int capacity;
FusionSHMPoolShared *pool;
} FusionVector;
void fusion_vector_init ( FusionVector *vector,
int capacity,
FusionSHMPoolShared *pool );
void fusion_vector_destroy ( FusionVector *vector );
DirectResult fusion_vector_add ( FusionVector *vector,
void *element );
DirectResult fusion_vector_insert ( FusionVector *vector,
void *element,
int index );
DirectResult fusion_vector_move ( FusionVector *vector,
int from,
int to );
DirectResult fusion_vector_remove ( FusionVector *vector,
int index );
DirectResult fusion_vector_remove_last( FusionVector *vector );
static inline bool
fusion_vector_has_elements( const FusionVector *vector )
{
D_MAGIC_ASSERT( vector, FusionVector );
return vector->count > 0;
}
static inline bool
fusion_vector_is_empty( const FusionVector *vector )
{
D_MAGIC_ASSERT( vector, FusionVector );
return vector->count == 0;
}
static inline int
fusion_vector_size( const FusionVector *vector )
{
D_MAGIC_ASSERT( vector, FusionVector );
return vector->count;
}
static inline void *
fusion_vector_at( const FusionVector *vector, int index )
{
D_MAGIC_ASSERT( vector, FusionVector );
D_ASSERT( index >= 0 );
D_ASSERT( index < vector->count );
return vector->elements[index];
}
static inline bool
fusion_vector_contains( const FusionVector *vector, const void *element )
{
int i;
int count;
void * const *elements;
D_MAGIC_ASSERT( vector, FusionVector );
D_ASSERT( element != NULL );
count = vector->count;
elements = vector->elements;
/* Start with more recently added elements. */
for (i=count-1; i>=0; i--)
if (elements[i] == element)
return true;
return false;
}
static inline int
fusion_vector_index_of( const FusionVector *vector, const void *element )
{
int i;
int count;
void * const *elements;
D_MAGIC_ASSERT( vector, FusionVector );
D_ASSERT( element != NULL );
count = vector->count;
elements = vector->elements;
/* Start with more recently added elements. */
for (i=count-1; i>=0; i--)
if (elements[i] == element)
return i;
/*
* In case the return value isn't checked
* this will most likely generate a bad address.
*/
return INT_MIN >> 2;
}
#define fusion_vector_foreach(element, index, vector) \
for ((index) = 0; \
(index) < (vector).count && (element = (vector).elements[index]); \
(index)++)
#define fusion_vector_foreach_reverse(element, index, vector) \
for ((index) = (vector).count - 1; \
(index) >= 0 && (element = (vector).elements[index]); \
(index)--)
#endif
|