1. C++ / Говнокод #4770

    +159

    1. 01
    2. 02
    3. 03
    4. 04
    5. 05
    6. 06
    7. 07
    8. 08
    9. 09
    10. 10
    11. 11
    12. 12
    13. 13
    14. 14
    15. 15
    16. 16
    17. 17
    18. 18
    19. 19
    20. 20
    21. 21
    22. 22
    23. 23
    24. 24
    25. 25
    26. 26
    27. 27
    28. 28
    29. 29
    30. 30
    31. 31
    32. 32
    33. 33
    34. 34
    35. 35
    36. 36
    37. 37
    38. 38
    39. 39
    40. 40
    41. 41
    42. 42
    43. 43
    44. 44
    45. 45
    46. 46
    47. 47
    48. 48
    49. 49
    50. 50
    51. 51
    52. 52
    53. 53
    54. 54
    55. 55
    56. 56
    57. 57
    58. 58
    59. 59
    60. 60
    61. 61
    62. 62
    63. 63
    64. 64
    65. 65
    66. 66
    67. 67
    68. 68
    69. 69
    70. 70
    71. 71
    72. 72
    73. 73
    74. 74
    75. 75
    76. 76
    77. 77
    78. 78
    79. 79
    80. 80
    81. 81
    82. 82
    83. 83
    84. 84
    85. 85
    86. 86
    87. 87
    88. 88
    // TODO: use Virtual memory instead of heap!
#ifndef __CHUNK_H__
#define __CHUNK_H__
#include <windows.h>
#include "../JuceLibraryCode/JuceHeader.h"

class Chunk {

public:
	enum CHUNK_DIRECTION {CHUNK_UNKNOWN = 0, CHUNK_IN, CHUNK_OUT};
	Chunk (DWORD ChunkSize, WORD id, CHUNK_DIRECTION chunkDirection);
	~Chunk ();
	// override
	virtual void eventChunkIsEmpty () { 
		Logger::outputDebugString(T("empty")); 
	}
	virtual void eventChunkIsFull () {
		Logger::outputDebugString(T("full"));
	}
	virtual void eventChunkOverrun () {
		Logger::outputDebugString(T("overrun"));
	}
	DWORD getData (WORD *data, DWORD size) {
		if (data == 0) return 0;
		if (cs.tryEnter ()) { // if it's true, we locked.. (TODO: check, i'm not sure about that)
			if (((size + nReadCounter) > nWriteCounter) || size == 0) { cs.exit(); return 0; }
			memcpy (data, pBuffer + nReadCounter, size*sizeof(WORD));
			nReadCounter += size;
			if (nReadCounter == nWriteCounter) { eventChunkIsEmpty() ; nWriteCounter = 0; nReadCounter = 0; }
			cs.exit ();
			return size;
		}
		return 0;
	}
	DWORD putData (WORD *data, DWORD size) {
		if (data == 0) return 0;
		if (cs.tryEnter ()) { // if it's true, we locked.. (TODO: check, i'm not sure about that)
			if ((size + nWriteCounter) > nSize) { eventChunkOverrun(); cs.exit (); return 0; }
			memcpy (pBuffer + nWriteCounter, data, size*sizeof(WORD));
			nWriteCounter += size;
			if (nWriteCounter == nSize ) eventChunkIsFull();
			cs.exit ();
			return size;
		}
		return 0;
	}
	inline DWORD getSize () {
		return nSize;
	}
	// TODO: add check for nWriteCounter?
	inline bool setSize (DWORD ChunkSize) {
		if (bExchangeIsActive) return false;
		nSize   = ChunkSize;
		// TODO: add result check.
		pBuffer = (WORD*) realloc ((void*)pBuffer, ChunkSize*sizeof(WORD));
		if (pBuffer) return true;
		return false;
	}
	inline DWORD getReadCounter () { return nReadCounter; }
	inline DWORD getWriteCounter () { return nWriteCounter; }
	juce_UseDebuggingNewOperator
protected:
	bool            bExchangeIsActive;
	CHUNK_DIRECTION cdDirection;
	DWORD           nSize;
	DWORD           nWriteCounter;
	DWORD           nReadCounter;
	WORD            nChunkId;
	WORD           *pBuffer;
	CriticalSection cs;
};
#endif
// EOF
#include "Chunk.h"
Chunk::Chunk (DWORD ChunkSize, WORD id, CHUNK_DIRECTION chunkDirection) {
	bExchangeIsActive = false;
	cdDirection       = chunkDirection;
	nSize             = ChunkSize;
	nWriteCounter     = 0;
	nReadCounter      = 0;
	nChunkId          = id;
	pBuffer           = (WORD*) malloc (ChunkSize*sizeof(WORD));
	zeromem (pBuffer, ChunkSize*sizeof(WORD));
}
Chunk::~Chunk () {
	if (pBuffer) free (pBuffer);
}
// EOF

    Посвящается всем изобретателям велосипедов и просто неудачникам.. :(

    Запостил: neudachnik, 27 Ноября 2010

    Комментарии (4) RSS

    • ava Govnoeb 27.11.2010 21:15 # 0

      за MT-safe надо плюсануть
      Ответить

    • ava rat4 27.11.2010 21:42 # 0

      CriticalSection::tryEnter - это обёртка к TryEnterCriticalSection? Весело...
      Ответить

    • ava guest 16.12.2010 22:59 # 0

      // TODO: use Virtual memory instead of heap!
      :D *ROFL*
      Ответить

    • ava guest 16.12.2010 23:00 # 0

      Исключение и мы останемся в критической секции навсегда...
      Ответить

    Добавить комментарий