mirror of
https://github.com/MariaDB/server.git
synced 2025-01-22 14:54:20 +01:00
7fed1c703e
1. We add a vector of locks to trx_t. This array contains the autoinc locks granted to a transaction. There is one per table. 2. We enforce releasing of these locks in the reverse order from the one in which they are acquired. The assumption is that since the AUTOINC locks are statement level locks. Nested statements introduced by triggers are stacked it should hold. There was some cleanup done to the vector code too by adding const and some new functions. Rename dict_table_t::auto_inc_lock to autoinc_lock. Fix Bug#26316 Triggers create duplicate entries on auto-increment columns rb://22
99 lines
2.6 KiB
C
99 lines
2.6 KiB
C
#ifndef IB_VECTOR_H
|
|
#define IB_VECTOR_H
|
|
|
|
#include "univ.i"
|
|
#include "mem0mem.h"
|
|
|
|
typedef struct ib_vector_struct ib_vector_t;
|
|
|
|
/* An automatically resizing vector datatype with the following properties:
|
|
|
|
-Contains void* items.
|
|
|
|
-The items are owned by the caller.
|
|
|
|
-All memory allocation is done through a heap owned by the caller, who is
|
|
responsible for freeing it when done with the vector.
|
|
|
|
-When the vector is resized, the old memory area is left allocated since it
|
|
uses the same heap as the new memory area, so this is best used for
|
|
relatively small or short-lived uses.
|
|
*/
|
|
|
|
/********************************************************************
|
|
Create a new vector with the given initial size. */
|
|
UNIV_INTERN
|
|
ib_vector_t*
|
|
ib_vector_create(
|
|
/*=============*/
|
|
/* out: vector */
|
|
mem_heap_t* heap, /* in: heap */
|
|
ulint size); /* in: initial size */
|
|
|
|
/********************************************************************
|
|
Push a new element to the vector, increasing its size if necessary. */
|
|
UNIV_INTERN
|
|
void
|
|
ib_vector_push(
|
|
/*===========*/
|
|
ib_vector_t* vec, /* in: vector */
|
|
void* elem); /* in: data element */
|
|
|
|
/********************************************************************
|
|
Get the number of elements in the vector. */
|
|
UNIV_INLINE
|
|
ulint
|
|
ib_vector_size(
|
|
/*===========*/
|
|
/* out: number of elements in vector */
|
|
const ib_vector_t* vec); /* in: vector */
|
|
|
|
/********************************************************************
|
|
Test whether a vector is empty or not. */
|
|
UNIV_INLINE
|
|
ibool
|
|
ib_vector_is_empty(
|
|
/*===============*/
|
|
/* out: TRUE if empty */
|
|
const ib_vector_t* vec); /* in: vector */
|
|
|
|
/********************************************************************
|
|
Get the n'th element. */
|
|
UNIV_INLINE
|
|
void*
|
|
ib_vector_get(
|
|
/*==========*/
|
|
/* out: n'th element */
|
|
ib_vector_t* vec, /* in: vector */
|
|
ulint n); /* in: element index to get */
|
|
|
|
/********************************************************************
|
|
Remove the last element from the vector. */
|
|
UNIV_INLINE
|
|
void*
|
|
ib_vector_pop(
|
|
/*==========*/
|
|
ib_vector_t* vec); /* in: vector */
|
|
|
|
/********************************************************************
|
|
Free the underlying heap of the vector. Note that vec is invalid
|
|
after this call. */
|
|
UNIV_INLINE
|
|
void
|
|
ib_vector_free(
|
|
/*===========*/
|
|
ib_vector_t* vec); /* in,own: vector */
|
|
|
|
/* See comment at beginning of file. */
|
|
struct ib_vector_struct {
|
|
mem_heap_t* heap; /* heap */
|
|
void** data; /* data elements */
|
|
ulint used; /* number of elements currently used */
|
|
ulint total; /* number of elements allocated */
|
|
};
|
|
|
|
#ifndef UNIV_NONINL
|
|
#include "ut0vec.ic"
|
|
#endif
|
|
|
|
#endif
|