The C based gRPC (C++, Python, Ruby, Objective-C, PHP, C#) https://grpc.io/
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.

125 lines
3.9 KiB

10 years ago
/*
*
* Copyright 2015 gRPC authors.
10 years ago
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
10 years ago
*
* http://www.apache.org/licenses/LICENSE-2.0
10 years ago
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
10 years ago
*
*/
#include "test/core/util/slice_splitter.h"
#include <string.h>
#include <grpc/support/alloc.h>
#include <grpc/support/useful.h>
const char* grpc_slice_split_mode_name(grpc_slice_split_mode mode) {
10 years ago
switch (mode) {
case GRPC_SLICE_SPLIT_IDENTITY:
return "identity";
case GRPC_SLICE_SPLIT_MERGE_ALL:
return "merge_all";
case GRPC_SLICE_SPLIT_ONE_BYTE:
return "one_byte";
}
return "error";
}
void grpc_split_slices(grpc_slice_split_mode mode, grpc_slice* src_slices,
size_t src_slice_count, grpc_slice** dst_slices,
size_t* dst_slice_count) {
10 years ago
size_t i, j;
size_t length;
switch (mode) {
case GRPC_SLICE_SPLIT_IDENTITY:
*dst_slice_count = src_slice_count;
*dst_slices =
(grpc_slice*)gpr_malloc(sizeof(grpc_slice) * src_slice_count);
10 years ago
for (i = 0; i < src_slice_count; i++) {
(*dst_slices)[i] = src_slices[i];
grpc_slice_ref((*dst_slices)[i]);
10 years ago
}
break;
case GRPC_SLICE_SPLIT_MERGE_ALL:
*dst_slice_count = 1;
length = 0;
for (i = 0; i < src_slice_count; i++) {
length += GRPC_SLICE_LENGTH(src_slices[i]);
10 years ago
}
*dst_slices = (grpc_slice*)gpr_malloc(sizeof(grpc_slice));
**dst_slices = grpc_slice_malloc(length);
10 years ago
length = 0;
for (i = 0; i < src_slice_count; i++) {
memcpy(GRPC_SLICE_START_PTR(**dst_slices) + length,
GRPC_SLICE_START_PTR(src_slices[i]),
GRPC_SLICE_LENGTH(src_slices[i]));
length += GRPC_SLICE_LENGTH(src_slices[i]);
10 years ago
}
break;
case GRPC_SLICE_SPLIT_ONE_BYTE:
length = 0;
for (i = 0; i < src_slice_count; i++) {
length += GRPC_SLICE_LENGTH(src_slices[i]);
10 years ago
}
*dst_slice_count = length;
*dst_slices = (grpc_slice*)gpr_malloc(sizeof(grpc_slice) * length);
10 years ago
length = 0;
for (i = 0; i < src_slice_count; i++) {
for (j = 0; j < GRPC_SLICE_LENGTH(src_slices[i]); j++) {
(*dst_slices)[length] = grpc_slice_sub(src_slices[i], j, j + 1);
10 years ago
length++;
}
}
break;
}
}
void grpc_split_slices_to_buffer(grpc_slice_split_mode mode,
grpc_slice* src_slices, size_t src_slice_count,
grpc_slice_buffer* dst) {
grpc_slice* slices;
10 years ago
size_t nslices;
size_t i;
grpc_split_slices(mode, src_slices, src_slice_count, &slices, &nslices);
for (i = 0; i < nslices; i++) {
/* add indexed to avoid re-merging split slices */
grpc_slice_buffer_add_indexed(dst, slices[i]);
10 years ago
}
gpr_free(slices);
}
void grpc_split_slice_buffer(grpc_slice_split_mode mode, grpc_slice_buffer* src,
grpc_slice_buffer* dst) {
10 years ago
grpc_split_slices_to_buffer(mode, src->slices, src->count, dst);
}
grpc_slice grpc_slice_merge(grpc_slice* slices, size_t nslices) {
uint8_t* out = NULL;
10 years ago
size_t length = 0;
size_t capacity = 0;
size_t i;
for (i = 0; i < nslices; i++) {
if (GRPC_SLICE_LENGTH(slices[i]) + length > capacity) {
capacity = GPR_MAX(capacity * 2, GRPC_SLICE_LENGTH(slices[i]) + length);
out = (uint8_t*)gpr_realloc(out, capacity);
10 years ago
}
memcpy(out + length, GRPC_SLICE_START_PTR(slices[i]),
GRPC_SLICE_LENGTH(slices[i]));
length += GRPC_SLICE_LENGTH(slices[i]);
10 years ago
}
return grpc_slice_new(out, length, gpr_free);
}