| OLD | NEW |
| (Empty) | |
| 1 /* Copyright (c) 2013 The Chromium Authors. All rights reserved. |
| 2 * Use of this source code is governed by a BSD-style license that can be |
| 3 * found in the LICENSE file. |
| 4 */ |
| 5 |
| 6 #include <errno.h> |
| 7 #include <fcntl.h> |
| 8 #include <pthread.h> |
| 9 #include <stdio.h> |
| 10 #include <sys/ioctl.h> |
| 11 #include <sys/stat.h> |
| 12 #include <sys/time.h> |
| 13 |
| 14 #include "gtest/gtest.h" |
| 15 |
| 16 #include "nacl_io/fifo_char.h" |
| 17 #include "nacl_io/fifo_null.h" |
| 18 #include "nacl_io/fifo_packet.h" |
| 19 #include "nacl_io/packet.h" |
| 20 |
| 21 #include "ppapi_simple/ps.h" |
| 22 |
| 23 using namespace nacl_io; |
| 24 |
| 25 namespace { |
| 26 const size_t kTestSize = 32; |
| 27 const size_t kHalfSize = 16; |
| 28 const size_t kQuarterSize = 8; |
| 29 }; |
| 30 |
| 31 TEST(FIFONull, Basic) { |
| 32 FIFONull fifo; |
| 33 EXPECT_FALSE(fifo.IsFull()); |
| 34 EXPECT_FALSE(fifo.IsEmpty()); |
| 35 |
| 36 EXPECT_LT(0, fifo.ReadAvailable()); |
| 37 EXPECT_LT(0, fifo.WriteAvailable()); |
| 38 } |
| 39 |
| 40 TEST(FIFOChar, Wrap) { |
| 41 char temp_wr[kTestSize * 2]; |
| 42 char temp_rd[kTestSize * 2]; |
| 43 size_t wr_offs = 0; |
| 44 size_t rd_offs = 0; |
| 45 |
| 46 FIFOChar fifo(kTestSize); |
| 47 |
| 48 memset(temp_rd, 0, sizeof(temp_rd)); |
| 49 for (size_t index = 0; index < sizeof(temp_wr); index++) |
| 50 temp_wr[index] = index; |
| 51 |
| 52 EXPECT_TRUE(fifo.IsEmpty()); |
| 53 EXPECT_FALSE(fifo.IsFull()); |
| 54 |
| 55 // Wrap read and write differently, and verify copy is correct |
| 56 EXPECT_EQ(0, fifo.ReadAvailable()); |
| 57 EXPECT_EQ(kTestSize, fifo.WriteAvailable()); |
| 58 |
| 59 wr_offs += fifo.Write(temp_wr, kHalfSize); |
| 60 EXPECT_EQ(kHalfSize, wr_offs); |
| 61 |
| 62 EXPECT_FALSE(fifo.IsEmpty()); |
| 63 EXPECT_FALSE(fifo.IsFull()); |
| 64 |
| 65 rd_offs += fifo.Read(temp_rd, kQuarterSize); |
| 66 EXPECT_EQ(kQuarterSize, rd_offs); |
| 67 |
| 68 EXPECT_FALSE(fifo.IsEmpty()); |
| 69 EXPECT_FALSE(fifo.IsFull()); |
| 70 |
| 71 wr_offs += fifo.Write(&temp_wr[wr_offs], kTestSize); |
| 72 EXPECT_EQ(kTestSize + kQuarterSize, wr_offs); |
| 73 |
| 74 EXPECT_FALSE(fifo.IsEmpty()); |
| 75 |
| 76 rd_offs += fifo.Read(&temp_rd[rd_offs], kTestSize); |
| 77 EXPECT_EQ(kTestSize + kQuarterSize, rd_offs); |
| 78 |
| 79 EXPECT_TRUE(fifo.IsEmpty()); |
| 80 EXPECT_FALSE(fifo.IsFull()); |
| 81 |
| 82 for (size_t index = 0; index < kQuarterSize + kTestSize; index++) |
| 83 EXPECT_EQ((char) index, temp_rd[index]); |
| 84 } |
| 85 |
| 86 TEST(FIFOPacket, Packets) { |
| 87 char temp_wr[kTestSize]; |
| 88 FIFOPacket fifo(kTestSize); |
| 89 |
| 90 Packet* pkt0 = new Packet(NULL); |
| 91 Packet* pkt1 = new Packet(NULL); |
| 92 pkt0->Copy(temp_wr, kHalfSize, 0); |
| 93 pkt1->Copy(temp_wr, kTestSize, 0); |
| 94 |
| 95 EXPECT_TRUE(fifo.IsEmpty()); |
| 96 EXPECT_FALSE(fifo.IsFull()); |
| 97 |
| 98 EXPECT_EQ(0, fifo.ReadAvailable()); |
| 99 EXPECT_EQ(kTestSize, fifo.WriteAvailable()); |
| 100 |
| 101 fifo.WritePacket(pkt0); |
| 102 EXPECT_FALSE(fifo.IsEmpty()); |
| 103 EXPECT_FALSE(fifo.IsFull()); |
| 104 |
| 105 EXPECT_EQ(kHalfSize, fifo.ReadAvailable()); |
| 106 EXPECT_EQ(kHalfSize, fifo.WriteAvailable()); |
| 107 |
| 108 fifo.WritePacket(pkt1); |
| 109 EXPECT_FALSE(fifo.IsEmpty()); |
| 110 EXPECT_TRUE(fifo.IsFull()); |
| 111 |
| 112 EXPECT_EQ(kHalfSize + kTestSize, fifo.ReadAvailable()); |
| 113 EXPECT_EQ(0, fifo.WriteAvailable()); |
| 114 |
| 115 EXPECT_EQ(pkt0, fifo.ReadPacket()); |
| 116 EXPECT_FALSE(fifo.IsEmpty()); |
| 117 EXPECT_TRUE(fifo.IsFull()); |
| 118 |
| 119 EXPECT_EQ(kTestSize, fifo.ReadAvailable()); |
| 120 EXPECT_EQ(0, fifo.WriteAvailable()); |
| 121 |
| 122 EXPECT_EQ(pkt1, fifo.ReadPacket()); |
| 123 |
| 124 EXPECT_TRUE(fifo.IsEmpty()); |
| 125 EXPECT_FALSE(fifo.IsFull()); |
| 126 |
| 127 EXPECT_EQ(0, fifo.ReadAvailable()); |
| 128 EXPECT_EQ(kTestSize, fifo.WriteAvailable()); |
| 129 |
| 130 } |
| OLD | NEW |