Lines Matching defs:access
12 #include "src/compiler/access-builder.h"
153 UseInfo UseInfoForBasePointer(const FieldAccess& access) {
154 return access.tag() != 0 ? UseInfo::AnyTagged() : UseInfo::PointerInt();
158 UseInfo UseInfoForBasePointer(const ElementAccess& access) {
159 return access.tag() != 0 ? UseInfo::AnyTagged() : UseInfo::PointerInt();
2378 FieldAccess access = FieldAccessOf(node->op());
2380 access.machine_type.representation();
2381 VisitUnop(node, UseInfoForBasePointer(access), representation);
2385 FieldAccess access = FieldAccessOf(node->op());
2388 access.base_is_tagged, access.machine_type.representation(),
2389 access.offset, access.type, input_info->representation(),
2391 ProcessInput(node, 0, UseInfoForBasePointer(access));
2393 access.machine_type.representation()));
2397 if (write_barrier_kind < access.write_barrier_kind) {
2398 access.write_barrier_kind = write_barrier_kind;
2400 node, jsgraph_->simplified()->StoreField(access));
2407 BufferAccess access = BufferAccessOf(node->op());
2418 output = access.machine_type().representation();
2423 if (access.machine_type().representation() ==
2425 output = access
2440 BufferAccess access = BufferAccessOf(node->op());
2446 access.machine_type().representation())); // value
2454 ElementAccess access = ElementAccessOf(node->op());
2455 VisitBinop(node, UseInfoForBasePointer(access),
2457 access.machine_type.representation());
2461 ElementAccess access = ElementAccessOf(node->op());
2464 access.base_is_tagged, access.machine_type.representation(),
2465 access.type, input_info->representation(), node->InputAt(2));
2466 ProcessInput(node, 0, UseInfoForBasePointer(access)); // base
2470 access.machine_type.representation())); // value
2474 if (write_barrier_kind < access.write_barrier_kind) {
2475 access.write_barrier_kind = write_barrier_kind;
2477 node, jsgraph_->simplified()->StoreElement(access));
