FilesExpand file tree

 profiling/sample-rate-cli

/

object_stack.c

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

66 lines (58 loc) · 1.63 KB

 profiling/sample-rate-cli

/

object_stack.c

Copy path

Top

File metadata and controls

• Code
• Blame

66 lines (58 loc) · 1.63 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

// Stack of Python objects

#include "Python.h"

#include "pycore_freelist.h"

#include "pycore_pystate.h"

#include "pycore_object_stack.h"

extern _PyObjectStackChunk *_PyObjectStackChunk_New(void);

extern void _PyObjectStackChunk_Free(_PyObjectStackChunk *);

_PyObjectStackChunk *

_PyObjectStackChunk_New(void)

{

_PyObjectStackChunk *buf = _Py_FREELIST_POP_MEM(object_stack_chunks);

if (buf == NULL) {

// NOTE: we use PyMem_RawMalloc() here because this is used by the GC

// during mimalloc heap traversal. In that context, it is not safe to

// allocate mimalloc memory, such as via PyMem_Malloc().

buf = PyMem_RawMalloc(sizeof(_PyObjectStackChunk));

if (buf == NULL) {

return NULL;

}

}

buf->prev = NULL;

buf->n = 0;

return buf;

}

void

_PyObjectStackChunk_Free(_PyObjectStackChunk *buf)

{

assert(buf->n == 0);

_Py_FREELIST_FREE(object_stack_chunks, buf, PyMem_RawFree);

}

void

_PyObjectStack_Clear(_PyObjectStack *queue)

{

while (queue->head != NULL) {

_PyObjectStackChunk *buf = queue->head;

buf->n = 0;

queue->head = buf->prev;

_PyObjectStackChunk_Free(buf);

}

}

void

_PyObjectStack_Merge(_PyObjectStack *dst, _PyObjectStack *src)

{

if (src->head == NULL) {

return;

}

if (dst->head != NULL) {

// First, append dst to the bottom of src

_PyObjectStackChunk *last = src->head;

while (last->prev != NULL) {

last = last->prev;

}

last->prev = dst->head;

}

// Now that src has all the chunks, set dst to src

dst->head = src->head;

src->head = NULL;

}