Protocol Buffers - Google's data interchange format (grpc依赖)
https://developers.google.com/protocol-buffers/
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
57 lines
2.1 KiB
57 lines
2.1 KiB
/* |
|
* Copyright (c) 2009-2021, Google LLC |
|
* All rights reserved. |
|
* |
|
* Redistribution and use in source and binary forms, with or without |
|
* modification, are permitted provided that the following conditions are met: |
|
* * Redistributions of source code must retain the above copyright |
|
* notice, this list of conditions and the following disclaimer. |
|
* * Redistributions in binary form must reproduce the above copyright |
|
* notice, this list of conditions and the following disclaimer in the |
|
* documentation and/or other materials provided with the distribution. |
|
* * Neither the name of Google LLC nor the |
|
* names of its contributors may be used to endorse or promote products |
|
* derived from this software without specific prior written permission. |
|
* |
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
|
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
|
* ARE DISCLAIMED. IN NO EVENT SHALL Google LLC BE LIABLE FOR ANY DIRECT, |
|
* INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
|
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; |
|
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND |
|
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS |
|
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
|
*/ |
|
|
|
#include "upb/internal/unicode.h" |
|
|
|
// Must be last. |
|
#include "upb/port_def.inc" |
|
|
|
int upb_Unicode_ToUTF8(uint32_t cp, char* out) { |
|
if (cp <= 0x7f) { |
|
out[0] = cp; |
|
return 1; |
|
} |
|
if (cp <= 0x07ff) { |
|
out[0] = (cp >> 6) | 0xc0; |
|
out[1] = (cp & 0x3f) | 0x80; |
|
return 2; |
|
} |
|
if (cp <= 0xffff) { |
|
out[0] = (cp >> 12) | 0xe0; |
|
out[1] = ((cp >> 6) & 0x3f) | 0x80; |
|
out[2] = (cp & 0x3f) | 0x80; |
|
return 3; |
|
} |
|
if (cp <= 0x10ffff) { |
|
out[0] = (cp >> 18) | 0xf0; |
|
out[1] = ((cp >> 12) & 0x3f) | 0x80; |
|
out[2] = ((cp >> 6) & 0x3f) | 0x80; |
|
out[3] = (cp & 0x3f) | 0x80; |
|
return 4; |
|
} |
|
return 0; |
|
}
|
|
|