Lines Matching refs:code
2 // Use of this source code is governed by a BSD-style license that can be
201 uint8_t code = static_cast<ValueTypeCode>(heap_index) & uint_7_mask;
202 switch (code) {
212 HeapType::from_code(code).name().c_str());
218 return HeapType::from_code(code);
268 ValueTypeCode code = static_cast<ValueTypeCode>(val);
269 switch (code) {
279 HeapType::from_code(code).name().c_str());
285 HeapType heap_type = HeapType::from_code(code);
287 code == kI31RefCode || code == kDataRefCode || code == kArrayRefCode
302 Nullability nullability = code == kOptRefCode ? kNullable : kNonNullable;
326 if (code == kRttWithDepthCode) {
379 DecodeError<validate>(decoder, pc, "invalid value type 0x%x", code);
383 // Anything that doesn't match an enumeration value is an invalid type code.
385 DecodeError<validate>(decoder, pc, "invalid value type 0x%x", code);
820 // reachable code.
822 // reachable code in unreachable block (implies normal validation).
824 // code unreachable in its own block (implies polymorphic validation).
1220 // Unverified code might have an out-of-bounds index.
2405 this->DecodeError("Beyond end of code");
2422 // Controls whether code should be generated for the current block (basically
2737 // In unreachable code, we still have to push a value of the correct
2764 // We are in unreachable code. Do nothing.
2772 // We know that the following code is not reachable, but according
2914 this->DecodeError(this->pc_ + 1, "trailing code after function end");
3104 // We are in unreachable code, the return value does not matter.
3139 // We are in unreachable code. Forward the bottom value.
3250 // Hard-code the list of load types. The opcodes are highly unlikely to
3268 // Hard-code the list of store types. The opcodes are highly unlikely to
3375 // We are in unreachable code, maintain the polymorphic stack.
3401 // We are in unreachable code, maintain the polymorphic stack.
3634 // In reachable code, check if there are at least {count} values on the stack.
3635 // In unreachable code, if there are less than {count} values on the stack,
3723 // In unreachable code, we may run out of stack.
3742 // - In non-unreachable code, a loop just leaves the values on the stack.
3743 // - In unreachable code, it is not guaranteed that we have Values of the
4476 // This logic ensures that code generation can assume that functions
4539 // This logic ensures that code generation can assume that functions
4555 // We know that the following code is not reachable, but according
4625 // This logic ensures that code generation can assume that functions
4635 // We know that the following code is not reachable, but according
4706 // This logic ensures that code generation can assume that functions
4713 // We know that the following code is not reachable, but according
4796 /* We know that the following code is not reachable, but according */ \
4941 break; /* to generic mem access code below */ \
4949 break; /* to generic mem access code below */ \
5214 // Peeking past the current control start in reachable code.
5262 // - If the current code is reachable, check if the current stack values are
5267 // - If the current code is unreachable, check if any values that may exist on
5272 // stack). TODO(manoskouk): We expect the unreachable-code behavior to
5273 // change, either due to relaxation of dead code verification, or the
5289 // if the current code is reachable even if it is spec-only reachable.
5313 // Unreachable code validation starts here.
5320 // TODO(manoskouk): Use similar code as above if we keep unreachable checks.
5391 // If the current code is reachable, check if the current stack values are