| /* |
| * Copyright 2023, The Android Open Source Project |
| * |
| * 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 |
| * |
| * http://www.apache.org/licenses/LICENSE-2.0 |
| * |
| * 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. |
| */ |
| |
| #include "apf_interpreter.h" |
| |
| // TODO: Remove the dependency of the standard library and make the interpreter self-contained. |
| #include <string.h>// For memcmp |
| |
| #include "apf.h" |
| |
| #define TO_UPPER(a) ((a) >= 'a' && (a) <= 'z' ? ((a) - ('a' - 'A')) : (a)) |
| #define ASSERT_POINTER_IN_BOUND(p, l, r) if ((p) < (l) || (p) >= (r)) return -1 |
| #define DECODE_BYTES(value, len, p, l, r) \ |
| do { \ |
| value = 0; \ |
| ASSERT_POINTER_IN_BOUND(((p) + (len) - 1), (l), (r)); \ |
| uint32_t i; \ |
| for (i = 0; i < (len); i++) \ |
| value = (value << 8) | *p++; \ |
| } while (0) |
| |
| #ifdef __cplusplus |
| extern "C" { |
| #endif |
| |
| /** |
| * Compares a QNAME/NAME label sequence at *src with the target_name. |
| * |
| * @param target_name - TLV encoded name to match against. |
| * @param target_name_max_len - Maximum possible length of the target_name. |
| * @param udp_payload - Pointer to the start of the UDP payload (DNS header). |
| * @param udp_payload_len - Length of the UDP payload. |
| * @param src - Pointer to the beginning of the label sequence. |
| * Will be updated to point to the next position after the labels. |
| * |
| * @return 1 if matched, 0 if not matched, -1 if an error occurs. |
| */ |
| int match_labels(const uint8_t* const target_name, |
| const uint32_t target_name_max_len, |
| const uint8_t* const udp_payload, |
| const uint32_t udp_payload_len, |
| const uint8_t** src) { |
| const uint8_t* p = *src; |
| ASSERT_POINTER_IN_BOUND(p, udp_payload, udp_payload + udp_payload_len); |
| const uint8_t* q = target_name; |
| ASSERT_POINTER_IN_BOUND(q, target_name, target_name + target_name_max_len); |
| const uint8_t* next_pos = NULL; |
| if (*q == 0) { |
| // target name is empty. |
| return -1; |
| } |
| int is_qname_match = 1;// bool type is not supported in c89 |
| uint32_t label_size; |
| uint32_t i; |
| // handling loop by limiting the maximum number of pointer traces. |
| for (i = 0; i < udp_payload_len; i += 2) { |
| ASSERT_POINTER_IN_BOUND(p, udp_payload, udp_payload + udp_payload_len); |
| // handling the message compression: rfc 1035 4.1.4. |
| if (*p >= 0xc0) { |
| if (next_pos == NULL) { next_pos = p + 2; } |
| ASSERT_POINTER_IN_BOUND(p + 1, udp_payload, |
| udp_payload + udp_payload_len); |
| uint32_t offset = (uint32_t) (((p[0] & 0x3f) << 8) | p[1]); |
| // checks the offset is inside the udp payloads. |
| if (offset > udp_payload_len) { return -1; } |
| // rfc 1035 4.1.4 does not mention forward jump is not allowed. |
| p = udp_payload + offset; |
| } else if (*p < 0 || *p > 63) { |
| // based on rfc 1035 2.3.4., label size is 63 octets or less. |
| return -1; |
| } else if (*p) { |
| label_size = *p++; |
| // checks labels inside the udp payloads. |
| if (p + label_size > udp_payload + udp_payload_len) { return -1; } |
| ASSERT_POINTER_IN_BOUND(q, target_name, |
| target_name + target_name_max_len); |
| if (is_qname_match && label_size == *q++) { |
| while (label_size--) { |
| ASSERT_POINTER_IN_BOUND(p, udp_payload, |
| udp_payload + udp_payload_len); |
| uint8_t pc = *p++; |
| ASSERT_POINTER_IN_BOUND(q, target_name, |
| target_name + target_name_max_len); |
| is_qname_match = is_qname_match && (TO_UPPER(pc) == *q++); |
| } |
| } else { |
| is_qname_match = 0; |
| p += label_size; |
| } |
| } else { |
| // reach the label end |
| if (next_pos == NULL) { next_pos = p + 1; } |
| ASSERT_POINTER_IN_BOUND(next_pos, udp_payload, |
| udp_payload + udp_payload_len); |
| *src = next_pos; |
| ASSERT_POINTER_IN_BOUND(q, target_name, |
| target_name + target_name_max_len); |
| return is_qname_match && *q == 0; |
| } |
| } |
| return -1; |
| } |
| |
| |
| |
| /** |
| * Checks if a DNS packet contains any of the target names with the provided |
| * question type. |
| * |
| * @param target_names - TLV encoded names to match against. |
| * @param remain_program_len - Remaining program length. |
| * @param udp_payload - Pointer to the start of the UDP payload (DNS header). |
| * @param udp_payload_len - Length of the UDP payload. |
| * @param question_type - Question type to match against. Use -1 to match answers. |
| * |
| * |
| * @return 1 if matched, 0 if not matched, -1 if an error occurs. |
| */ |
| int match_name(const uint8_t* const target_names, |
| const uint32_t remain_program_len, |
| const uint8_t* const udp_payload, |
| const uint32_t udp_payload_len, |
| const int question_type) { |
| const uint8_t* src = udp_payload; |
| uint32_t value; |
| // skip tid and flags |
| DECODE_BYTES(value, 4, src, udp_payload, udp_payload + udp_payload_len); |
| uint32_t num_questions; |
| DECODE_BYTES(num_questions, 2, src, udp_payload, udp_payload + udp_payload_len); |
| |
| uint32_t num_answers = 0; |
| DECODE_BYTES(value, 2, src, udp_payload, udp_payload + udp_payload_len); |
| num_answers += value; |
| DECODE_BYTES(value, 2, src, udp_payload, udp_payload + udp_payload_len); |
| num_answers += value; |
| DECODE_BYTES(value, 2, src, udp_payload, udp_payload + udp_payload_len); |
| num_answers += value; |
| |
| const uint8_t* q = target_names; |
| while (*q != 0) { |
| src = udp_payload + 12; |
| ASSERT_POINTER_IN_BOUND(src, udp_payload, udp_payload + udp_payload_len); |
| uint32_t j; |
| const uint32_t checked_label_size = (uint32_t) (q - target_names); |
| // match questions |
| for (j = 0; j < num_questions; ++j) { |
| int rst = match_labels(q, remain_program_len - checked_label_size, |
| udp_payload, udp_payload_len, &src); |
| if (rst == -1) { |
| return -1; |
| } |
| int qtype; |
| // read qtype |
| DECODE_BYTES(qtype, 2, src, udp_payload, udp_payload + udp_payload_len); |
| // skip qclass |
| DECODE_BYTES(value, 2, src, udp_payload, udp_payload + udp_payload_len); |
| if (rst != 1) { |
| continue; |
| } |
| if ((question_type != -1) |
| && (qtype == 0xff /* TYPE_ANY */ || qtype == question_type)) { |
| return 1; |
| } |
| } |
| // match answers |
| for (j = 0; j < num_answers; ++j) { |
| int rst = match_labels(q, remain_program_len - checked_label_size, |
| udp_payload, udp_payload_len, &src); |
| if (rst == -1) { |
| return -1; |
| } |
| // skip type, class, ttl |
| DECODE_BYTES(value, 8, src, udp_payload, udp_payload + udp_payload_len); |
| // decode rdata length |
| uint32_t len; |
| DECODE_BYTES(len, 2, src, udp_payload, udp_payload + udp_payload_len); |
| // skip rdata |
| src += len; |
| if (rst == 1) { |
| return rst; |
| } |
| } |
| // move the pointer to the next name. |
| while (*q != 0) { |
| uint32_t len = *q++; |
| if (len < 1 || len > 63) { |
| return -1; |
| } |
| q += len; |
| ASSERT_POINTER_IN_BOUND(q, target_names, target_names + remain_program_len); |
| } |
| q++; |
| ASSERT_POINTER_IN_BOUND(q, target_names, target_names + remain_program_len); |
| } |
| return 0; |
| } |
| |
| #ifdef __cplusplus |
| } |
| #endif |
| |
| // User hook for interpreter debug tracing. |
| #ifdef APF_TRACE_HOOK |
| extern void APF_TRACE_HOOK(uint32_t pc, const uint32_t* regs, const uint8_t* program, |
| uint32_t program_len, const uint8_t *packet, uint32_t packet_len, |
| const uint32_t* memory, uint32_t ram_len); |
| #else |
| #define APF_TRACE_HOOK(pc, regs, program, program_len, packet, packet_len, memory, memory_len) \ |
| do { /* nop*/ \ |
| } while (0) |
| #endif |
| |
| // Frame header size should be 14 |
| #define APF_FRAME_HEADER_SIZE 14 |
| // Return code indicating "packet" should accepted. |
| #define PASS_PACKET 1 |
| // Return code indicating "packet" should be dropped. |
| #define DROP_PACKET 0 |
| // Verify an internal condition and accept packet if it fails. |
| #define ASSERT_RETURN(c) if (!(c)) return PASS_PACKET |
| // If "c" is of an unsigned type, generate a compile warning that gets promoted to an error. |
| // This makes bounds checking simpler because ">= 0" can be avoided. Otherwise adding |
| // superfluous ">= 0" with unsigned expressions generates compile warnings. |
| #define ENFORCE_UNSIGNED(c) ((c)==(uint32_t)(c)) |
| |
| uint32_t apf_version(void) { |
| return 20231214; |
| } |
| |
| int apf_run(void* ctx, uint8_t* const program, const uint32_t program_len, |
| const uint32_t ram_len, const uint8_t* const packet, |
| const uint32_t packet_len, const uint32_t filter_age_16384ths) { |
| // Is offset within program bounds? |
| #define IN_PROGRAM_BOUNDS(p) (ENFORCE_UNSIGNED(p) && (p) < program_len) |
| // Is offset within ram bounds? |
| #define IN_RAM_BOUNDS(p) (ENFORCE_UNSIGNED(p) && (p) < ram_len) |
| // Is offset within packet bounds? |
| #define IN_PACKET_BOUNDS(p) (ENFORCE_UNSIGNED(p) && (p) < packet_len) |
| // Is access to offset |p| length |size| within data bounds? |
| #define IN_DATA_BOUNDS(p, size) (ENFORCE_UNSIGNED(p) && \ |
| ENFORCE_UNSIGNED(size) && \ |
| (p) + (size) <= ram_len && \ |
| (p) >= program_len && \ |
| (p) + (size) >= (p)) // catch wraparounds |
| // Accept packet if not within program bounds |
| #define ASSERT_IN_PROGRAM_BOUNDS(p) ASSERT_RETURN(IN_PROGRAM_BOUNDS(p)) |
| // Accept packet if not within ram bounds |
| #define ASSERT_IN_RAM_BOUNDS(p) ASSERT_RETURN(IN_RAM_BOUNDS(p)) |
| // Accept packet if not within packet bounds |
| #define ASSERT_IN_PACKET_BOUNDS(p) ASSERT_RETURN(IN_PACKET_BOUNDS(p)) |
| // Accept packet if not within data bounds |
| #define ASSERT_IN_DATA_BOUNDS(p, size) ASSERT_RETURN(IN_DATA_BOUNDS(p, size)) |
| |
| // Program counter. |
| uint32_t pc = 0; |
| // Accept packet if not within program or not ahead of program counter |
| #define ASSERT_FORWARD_IN_PROGRAM(p) ASSERT_RETURN(IN_PROGRAM_BOUNDS(p) && (p) >= pc) |
| // Memory slot values. |
| uint32_t memory[MEMORY_ITEMS] = {}; |
| // Fill in pre-filled memory slot values. |
| memory[MEMORY_OFFSET_OUTPUT_BUFFER_OFFSET] = 0; |
| memory[MEMORY_OFFSET_PROGRAM_SIZE] = program_len; |
| memory[MEMORY_OFFSET_DATA_SIZE] = ram_len; |
| memory[MEMORY_OFFSET_PACKET_SIZE] = packet_len; |
| memory[MEMORY_OFFSET_FILTER_AGE] = filter_age_16384ths >> 14; |
| ASSERT_IN_PACKET_BOUNDS(APF_FRAME_HEADER_SIZE); |
| // Only populate if IP version is IPv4. |
| if ((packet[APF_FRAME_HEADER_SIZE] & 0xf0) == 0x40) { |
| memory[MEMORY_OFFSET_IPV4_HEADER_SIZE] = (packet[APF_FRAME_HEADER_SIZE] & 15) * 4; |
| } |
| // Register values. |
| uint32_t registers[2] = {}; |
| // Count of instructions remaining to execute. This is done to ensure an |
| // upper bound on execution time. It should never be hit and is only for |
| // safety. Initialize to the number of bytes in the program which is an |
| // upper bound on the number of instructions in the program. |
| uint32_t instructions_remaining = program_len; |
| |
| // The output buffer pointer |
| uint8_t* allocated_buffer = NULL; |
| // The length of the output buffer |
| uint32_t allocated_buffer_len = 0; |
| // Is access to offset |p| length |size| within output buffer bounds? |
| #define IN_OUTPUT_BOUNDS(p, size) (ENFORCE_UNSIGNED(p) && \ |
| ENFORCE_UNSIGNED(size) && \ |
| (p) + (size) <= allocated_buffer_len && \ |
| (p) + (size) >= (p)) |
| // Accept packet if not write within allocated output buffer |
| #define ASSERT_IN_OUTPUT_BOUNDS(p, size) ASSERT_RETURN(IN_OUTPUT_BOUNDS(p, size)) |
| |
| // Decode the imm length. |
| #define DECODE_IMM(value, length) \ |
| do { \ |
| uint32_t i; \ |
| for (i = 0; i < (length) && pc < program_len; i++) \ |
| value = (value << 8) | program[pc++]; \ |
| } while (0) |
| |
| do { |
| APF_TRACE_HOOK(pc, registers, program, program_len, packet, packet_len, memory, ram_len); |
| if (pc == program_len) { |
| return PASS_PACKET; |
| } else if (pc == (program_len + 1)) { |
| return DROP_PACKET; |
| } |
| ASSERT_IN_PROGRAM_BOUNDS(pc); |
| const uint8_t bytecode = program[pc++]; |
| const uint32_t opcode = EXTRACT_OPCODE(bytecode); |
| const uint32_t reg_num = EXTRACT_REGISTER(bytecode); |
| #define REG (registers[reg_num]) |
| #define OTHER_REG (registers[reg_num ^ 1]) |
| // All instructions have immediate fields, so load them now. |
| const uint32_t len_field = EXTRACT_IMM_LENGTH(bytecode); |
| uint32_t imm = 0; |
| int32_t signed_imm = 0; |
| if (len_field != 0) { |
| const uint32_t imm_len = 1 << (len_field - 1); |
| ASSERT_FORWARD_IN_PROGRAM(pc + imm_len - 1); |
| DECODE_IMM(imm, imm_len); |
| // Sign extend imm into signed_imm. |
| signed_imm = (int32_t) (imm << ((4 - imm_len) * 8)); |
| signed_imm >>= (4 - imm_len) * 8; |
| } |
| |
| switch (opcode) { |
| case LDB_OPCODE: |
| case LDH_OPCODE: |
| case LDW_OPCODE: |
| case LDBX_OPCODE: |
| case LDHX_OPCODE: |
| case LDWX_OPCODE: { |
| uint32_t offs = imm; |
| if (opcode >= LDBX_OPCODE) { |
| // Note: this can overflow and actually decrease offs. |
| offs += registers[1]; |
| } |
| ASSERT_IN_PACKET_BOUNDS(offs); |
| uint32_t load_size = 0; |
| switch (opcode) { |
| case LDB_OPCODE: |
| case LDBX_OPCODE: |
| load_size = 1; |
| break; |
| case LDH_OPCODE: |
| case LDHX_OPCODE: |
| load_size = 2; |
| break; |
| case LDW_OPCODE: |
| case LDWX_OPCODE: |
| load_size = 4; |
| break; |
| // Immediately enclosing switch statement guarantees |
| // opcode cannot be any other value. |
| } |
| const uint32_t end_offs = offs + (load_size - 1); |
| // Catch overflow/wrap-around. |
| ASSERT_RETURN(end_offs >= offs); |
| ASSERT_IN_PACKET_BOUNDS(end_offs); |
| uint32_t val = 0; |
| while (load_size--) |
| val = (val << 8) | packet[offs++]; |
| REG = val; |
| break; |
| } |
| case JMP_OPCODE: |
| // This can jump backwards. Infinite looping prevented by instructions_remaining. |
| pc += imm; |
| break; |
| case JEQ_OPCODE: |
| case JNE_OPCODE: |
| case JGT_OPCODE: |
| case JLT_OPCODE: |
| case JSET_OPCODE: |
| case JNEBS_OPCODE: { |
| // Load second immediate field. |
| uint32_t cmp_imm = 0; |
| if (reg_num == 1) { |
| cmp_imm = registers[1]; |
| } else if (len_field != 0) { |
| uint32_t cmp_imm_len = 1 << (len_field - 1); |
| ASSERT_FORWARD_IN_PROGRAM(pc + cmp_imm_len - 1); |
| DECODE_IMM(cmp_imm, cmp_imm_len); |
| } |
| switch (opcode) { |
| case JEQ_OPCODE: |
| if (registers[0] == cmp_imm) |
| pc += imm; |
| break; |
| case JNE_OPCODE: |
| if (registers[0] != cmp_imm) |
| pc += imm; |
| break; |
| case JGT_OPCODE: |
| if (registers[0] > cmp_imm) |
| pc += imm; |
| break; |
| case JLT_OPCODE: |
| if (registers[0] < cmp_imm) |
| pc += imm; |
| break; |
| case JSET_OPCODE: |
| if (registers[0] & cmp_imm) |
| pc += imm; |
| break; |
| case JNEBS_OPCODE: { |
| // cmp_imm is size in bytes of data to compare. |
| // pc is offset of program bytes to compare. |
| // imm is jump target offset. |
| // REG is offset of packet bytes to compare. |
| ASSERT_FORWARD_IN_PROGRAM(pc + cmp_imm - 1); |
| ASSERT_IN_PACKET_BOUNDS(REG); |
| const uint32_t last_packet_offs = REG + cmp_imm - 1; |
| ASSERT_RETURN(last_packet_offs >= REG); |
| ASSERT_IN_PACKET_BOUNDS(last_packet_offs); |
| if (memcmp(program + pc, packet + REG, cmp_imm)) |
| pc += imm; |
| // skip past comparison bytes |
| pc += cmp_imm; |
| break; |
| } |
| } |
| break; |
| } |
| case ADD_OPCODE: |
| registers[0] += reg_num ? registers[1] : imm; |
| break; |
| case MUL_OPCODE: |
| registers[0] *= reg_num ? registers[1] : imm; |
| break; |
| case DIV_OPCODE: { |
| const uint32_t div_operand = reg_num ? registers[1] : imm; |
| ASSERT_RETURN(div_operand); |
| registers[0] /= div_operand; |
| break; |
| } |
| case AND_OPCODE: |
| registers[0] &= reg_num ? registers[1] : imm; |
| break; |
| case OR_OPCODE: |
| registers[0] |= reg_num ? registers[1] : imm; |
| break; |
| case SH_OPCODE: { |
| const int32_t shift_val = reg_num ? (int32_t)registers[1] : signed_imm; |
| if (shift_val > 0) |
| registers[0] <<= shift_val; |
| else |
| registers[0] >>= -shift_val; |
| break; |
| } |
| case LI_OPCODE: |
| REG = (uint32_t) signed_imm; |
| break; |
| case EXT_OPCODE: |
| if ( |
| // If LDM_EXT_OPCODE is 0 and imm is compared with it, a compiler error will result, |
| // instead just enforce that imm is unsigned (so it's always greater or equal to 0). |
| #if LDM_EXT_OPCODE == 0 |
| ENFORCE_UNSIGNED(imm) && |
| #else |
| imm >= LDM_EXT_OPCODE && |
| #endif |
| imm < (LDM_EXT_OPCODE + MEMORY_ITEMS)) { |
| REG = memory[imm - LDM_EXT_OPCODE]; |
| } else if (imm >= STM_EXT_OPCODE && imm < (STM_EXT_OPCODE + MEMORY_ITEMS)) { |
| memory[imm - STM_EXT_OPCODE] = REG; |
| } else switch (imm) { |
| case NOT_EXT_OPCODE: |
| REG = ~REG; |
| break; |
| case NEG_EXT_OPCODE: |
| REG = -REG; |
| break; |
| case SWAP_EXT_OPCODE: { |
| uint32_t tmp = REG; |
| REG = OTHER_REG; |
| OTHER_REG = tmp; |
| break; |
| } |
| case MOV_EXT_OPCODE: |
| REG = OTHER_REG; |
| break; |
| case ALLOC_EXT_OPCODE: |
| ASSERT_RETURN(allocated_buffer == NULL); |
| allocated_buffer_len = REG; |
| allocated_buffer = |
| apf_allocate_buffer(ctx, allocated_buffer_len); |
| ASSERT_RETURN(allocated_buffer != NULL); |
| memory[MEMORY_OFFSET_OUTPUT_BUFFER_OFFSET] = 0; |
| break; |
| case TRANS_EXT_OPCODE: |
| ASSERT_RETURN(allocated_buffer != NULL); |
| uint32_t pkt_len = memory[MEMORY_OFFSET_OUTPUT_BUFFER_OFFSET]; |
| // If pkt_len > allocate_buffer_len, it means sth. wrong |
| // happened and the allocated_buffer should be deallocated. |
| if (pkt_len > allocated_buffer_len) { |
| apf_transmit_buffer( |
| ctx, |
| allocated_buffer, |
| 0 /* len */, |
| 0 /* dscp */); |
| return PASS_PACKET; |
| } |
| // TODO: calculate packet checksum and get dscp |
| apf_transmit_buffer( |
| ctx, |
| allocated_buffer, |
| pkt_len, |
| 0 /* dscp */); |
| allocated_buffer = NULL; |
| break; |
| case DATA_EXT_OPCODE: { |
| ASSERT_FORWARD_IN_PROGRAM(pc + 1); |
| uint32_t skip_len = 0; |
| DECODE_IMM(skip_len, 2); |
| ASSERT_FORWARD_IN_PROGRAM(pc + skip_len - 1); |
| pc += skip_len; |
| break; |
| } |
| // Unknown extended opcode |
| default: |
| // Bail out |
| return PASS_PACKET; |
| } |
| break; |
| case LDDW_OPCODE: { |
| uint32_t offs = OTHER_REG + (uint32_t) signed_imm; |
| uint32_t size = 4; |
| uint32_t val = 0; |
| // Negative offsets wrap around the end of the address space. |
| // This allows us to efficiently access the end of the |
| // address space with one-byte immediates without using %=. |
| if (offs & 0x80000000) { |
| offs = ram_len + offs; // unsigned overflow intended |
| } |
| ASSERT_IN_DATA_BOUNDS(offs, size); |
| while (size--) |
| val = (val << 8) | program[offs++]; |
| REG = val; |
| break; |
| } |
| case STDW_OPCODE: { |
| uint32_t offs = OTHER_REG + (uint32_t) signed_imm; |
| uint32_t size = 4; |
| uint32_t val = REG; |
| // Negative offsets wrap around the end of the address space. |
| // This allows us to efficiently access the end of the |
| // address space with one-byte immediates without using %=. |
| if (offs & 0x80000000) { |
| offs = ram_len + offs; // unsigned overflow intended |
| } |
| ASSERT_IN_DATA_BOUNDS(offs, size); |
| while (size--) { |
| program[offs++] = (val >> 24); |
| val <<= 8; |
| } |
| break; |
| } |
| case MEMCOPY_OPCODE: { |
| ASSERT_RETURN(allocated_buffer != NULL); |
| ASSERT_RETURN(len_field > 0); |
| uint32_t src_offs = imm; |
| uint32_t copy_len = 0; |
| DECODE_IMM(copy_len, 1); |
| uint32_t dst_offs = memory[MEMORY_OFFSET_OUTPUT_BUFFER_OFFSET]; |
| ASSERT_IN_OUTPUT_BOUNDS(dst_offs, copy_len); |
| // reg_num == 0 copy from packet, reg_num == 1 copy from data. |
| if (reg_num == 0) { |
| ASSERT_IN_PACKET_BOUNDS(src_offs); |
| const uint32_t last_packet_offs = src_offs + copy_len - 1; |
| ASSERT_RETURN(last_packet_offs >= src_offs); |
| ASSERT_IN_PACKET_BOUNDS(last_packet_offs); |
| memmove(allocated_buffer + dst_offs, packet + src_offs, |
| copy_len); |
| } else { |
| ASSERT_IN_RAM_BOUNDS(src_offs + copy_len - 1); |
| memmove(allocated_buffer + dst_offs, program + src_offs, |
| copy_len); |
| } |
| dst_offs += copy_len; |
| memory[MEMORY_OFFSET_OUTPUT_BUFFER_OFFSET] = dst_offs; |
| break; |
| } |
| // Unknown opcode |
| default: |
| // Bail out |
| return PASS_PACKET; |
| } |
| } while (instructions_remaining--); |
| return PASS_PACKET; |
| } |
