Buckets:
| std::unordered_set<ggml_backend_buffer_t> backend_buffers; | |
| void apir_track_backend_buffer(ggml_backend_buffer_t buffer) { | |
| backend_buffers.insert(buffer); | |
| } | |
| bool apir_untrack_backend_buffer(ggml_backend_buffer_t buffer) { | |
| auto it = backend_buffers.find(buffer); | |
| if (it == backend_buffers.end()) { | |
| return false; | |
| } | |
| backend_buffers.erase(it); | |
| return true; | |
| } | |
| std::unordered_set<ggml_backend_buffer_t> apir_get_track_backend_buffers() { | |
| return backend_buffers; | |
| } | |
| ggml_tensor * apir_deserialize_tensor(ggml_context * ctx, const apir_rpc_tensor * tensor) { | |
| ggml_tensor * result = | |
| ggml_new_tensor_4d(ctx, (ggml_type) tensor->type, tensor->ne[0], tensor->ne[1], tensor->ne[2], tensor->ne[3]); | |
| for (uint32_t i = 0; i < GGML_MAX_DIMS; i++) { | |
| result->nb[i] = tensor->nb[i]; | |
| } | |
| result->buffer = reinterpret_cast<ggml_backend_buffer_t>(tensor->buffer); | |
| if (result->buffer && backend_buffers.find(result->buffer) == backend_buffers.end()) { | |
| printf("WARNING: HOST BUFFER NOT FOUND | %p\n", (void *) result->buffer); | |
| result->buffer = nullptr; | |
| } | |
| uint64_t tensor_data = tensor->data; | |
| if (result->buffer) { | |
| // require that the tensor data does not go beyond the buffer end | |
| uint64_t tensor_size = (uint64_t) ggml_nbytes(result); | |
| uint64_t buffer_start = (uint64_t) ggml_backend_buffer_get_base(result->buffer); | |
| uint64_t buffer_size = (uint64_t) ggml_backend_buffer_get_size(result->buffer); | |
| // tensor->data is serialized as an offset to the buffer base address | |
| tensor_data += buffer_start; | |
| GGML_ASSERT(tensor_data + tensor_size >= tensor_data); // check for overflow | |
| GGML_ASSERT(tensor_data >= buffer_start && tensor_data + tensor_size <= buffer_start + buffer_size); | |
| } | |
| result->op = (ggml_op) tensor->op; | |
| for (uint32_t i = 0; i < GGML_MAX_OP_PARAMS / sizeof(int32_t); i++) { | |
| result->op_params[i] = tensor->op_params[i]; | |
| } | |
| result->flags = tensor->flags; | |
| result->data = reinterpret_cast<void *>(tensor_data); | |
| ggml_set_name(result, tensor->name); | |
| return result; | |
| } | |
| ggml_tensor * apir_create_node(uint64_t id, | |
| ggml_context * ctx, | |
| const std::unordered_map<uint64_t, const apir_rpc_tensor *> & tensor_ptrs, | |
| std::unordered_map<uint64_t, ggml_tensor *> & tensor_map) { | |
| if (id == 0) { | |
| return nullptr; | |
| } | |
| if (tensor_map.find(id) != tensor_map.end()) { | |
| return tensor_map[id]; | |
| } | |
| const apir_rpc_tensor * tensor = tensor_ptrs.at(id); | |
| ggml_tensor * result = apir_deserialize_tensor(ctx, tensor); | |
| if (result == nullptr) { | |
| return nullptr; | |
| } | |
| tensor_map[id] = result; | |
| for (int i = 0; i < GGML_MAX_SRC; i++) { | |
| result->src[i] = apir_create_node(tensor->src[i], ctx, tensor_ptrs, tensor_map); | |
| } | |
| result->view_src = apir_create_node(tensor->view_src, ctx, tensor_ptrs, tensor_map); | |
| result->view_offs = tensor->view_offs; | |
| return result; | |
| } | |
| ggml_cgraph * apir_deserialize_graph(uint32_t n_nodes, | |
| uint32_t n_tensors, | |
| const apir_rpc_tensor * tensors, | |
| const uint64_t * nodes) { | |
| size_t buf_size = ggml_tensor_overhead() * (n_nodes + n_tensors) + ggml_graph_overhead_custom(n_nodes, false); | |
| ggml_init_params params = { | |
| /*.mem_size =*/buf_size, | |
| /*.mem_buffer =*/NULL, | |
| /*.no_alloc =*/true, | |
| }; | |
| ggml_context * ctx = ggml_init(params); | |
| ggml_cgraph * graph = ggml_new_graph_custom(ctx, n_nodes, false); | |
| graph->n_nodes = n_nodes; | |
| std::unordered_map<uint64_t, const apir_rpc_tensor *> tensor_ptrs; | |
| for (uint32_t i = 0; i < n_tensors; i++) { | |
| tensor_ptrs[tensors[i].id] = &tensors[i]; | |
| } | |
| std::unordered_map<uint64_t, ggml_tensor *> tensor_map; | |
| for (uint32_t i = 0; i < n_nodes; i++) { | |
| int64_t id; | |
| memcpy(&id, &nodes[i], sizeof(id)); | |
| graph->nodes[i] = apir_create_node(id, ctx, tensor_ptrs, tensor_map); | |
| } | |
| return graph; | |
| } | |
Xet Storage Details
- Size:
- 4.53 kB
- Xet hash:
- c5bf5f1f4213510b8317f24ea87a1ec5644d468c9bf5844584e6500893dc7721
·
Xet efficiently stores files, intelligently splitting them into unique chunks and accelerating uploads and downloads. More info.