OLD | NEW |
(Empty) | |
| 1 #region Copyright notice and license |
| 2 |
| 3 // Copyright 2015, Google Inc. |
| 4 // All rights reserved. |
| 5 // |
| 6 // Redistribution and use in source and binary forms, with or without |
| 7 // modification, are permitted provided that the following conditions are |
| 8 // met: |
| 9 // |
| 10 // * Redistributions of source code must retain the above copyright |
| 11 // notice, this list of conditions and the following disclaimer. |
| 12 // * Redistributions in binary form must reproduce the above |
| 13 // copyright notice, this list of conditions and the following disclaimer |
| 14 // in the documentation and/or other materials provided with the |
| 15 // distribution. |
| 16 // * Neither the name of Google Inc. nor the names of its |
| 17 // contributors may be used to endorse or promote products derived from |
| 18 // this software without specific prior written permission. |
| 19 // |
| 20 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| 21 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| 22 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| 23 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| 24 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 25 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 26 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 27 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 28 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 29 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 30 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 31 |
| 32 #endregion |
| 33 |
| 34 using System; |
| 35 using System.Diagnostics; |
| 36 using System.Linq; |
| 37 using System.Threading; |
| 38 using System.Threading.Tasks; |
| 39 using Grpc.Core; |
| 40 using Grpc.Core.Internal; |
| 41 using Grpc.Core.Profiling; |
| 42 using Grpc.Core.Utils; |
| 43 using NUnit.Framework; |
| 44 |
| 45 namespace Grpc.Core.Tests |
| 46 { |
| 47 public class UserAgentStringTest |
| 48 { |
| 49 const string Host = "127.0.0.1"; |
| 50 |
| 51 MockServiceHelper helper; |
| 52 Server server; |
| 53 Channel channel; |
| 54 |
| 55 [TearDown] |
| 56 public void Cleanup() |
| 57 { |
| 58 channel.ShutdownAsync().Wait(); |
| 59 server.ShutdownAsync().Wait(); |
| 60 } |
| 61 |
| 62 [Test] |
| 63 public void DefaultUserAgentString() |
| 64 { |
| 65 helper = new MockServiceHelper(Host); |
| 66 server = helper.GetServer(); |
| 67 server.Start(); |
| 68 channel = helper.GetChannel(); |
| 69 |
| 70 helper.UnaryHandler = new UnaryServerMethod<string, string>((request
, context) => |
| 71 { |
| 72 var userAgentString = context.RequestHeaders.First(m => (m.Key =
= "user-agent")).Value; |
| 73 var parts = userAgentString.Split(new [] {' '}, 2); |
| 74 Assert.AreEqual(string.Format("grpc-csharp/{0}", VersionInfo.Cur
rentVersion), parts[0]); |
| 75 Assert.IsTrue(parts[1].StartsWith("grpc-c/")); |
| 76 return Task.FromResult("PASS"); |
| 77 }); |
| 78 Assert.AreEqual("PASS", Calls.BlockingUnaryCall(helper.CreateUnaryCa
ll(), "")); |
| 79 } |
| 80 |
| 81 [Test] |
| 82 public void ApplicationUserAgentString() |
| 83 { |
| 84 helper = new MockServiceHelper(Host, |
| 85 channelOptions: new[] { new ChannelOption(ChannelOptions.Primary
UserAgentString, "XYZ") }); |
| 86 server = helper.GetServer(); |
| 87 server.Start(); |
| 88 channel = helper.GetChannel(); |
| 89 |
| 90 channel = helper.GetChannel(); |
| 91 helper.UnaryHandler = new UnaryServerMethod<string, string>((request
, context) => |
| 92 { |
| 93 var userAgentString = context.RequestHeaders.First(m => (m.Key =
= "user-agent")).Value; |
| 94 var parts = userAgentString.Split(new[] { ' ' }, 3); |
| 95 Assert.AreEqual("XYZ", parts[0]); |
| 96 return Task.FromResult("PASS"); |
| 97 }); |
| 98 Assert.AreEqual("PASS", Calls.BlockingUnaryCall(helper.CreateUnaryCa
ll(), "")); |
| 99 } |
| 100 } |
| 101 } |
OLD | NEW |