Lines Matching refs:And
90 // and arguments have been pushed on the stack left to right. The actual
205 // It's saved in the stack and kept live in cp.
236 // Register holding this function and new target are both trashed in case we
238 // and we allocate a context, the value of |function_in_register| is correct.
301 // Visit the declarations and body.
455 // Drop the arguments and receiver and return.
958 // Discard the test value and jump to the default if present, otherwise to
989 // TODO(all): This visitor probably needs better comments and a revisit.
1022 // iterated over and use the cache for the iteration.
1034 // modification check. Otherwise, we got a fixed array, and we have
1066 __ Push(x1, x0, x2); // Smi and array, fixed array length (as smi).
1122 // Both Crankshaft and Turbofan expect BodyId to be right before stmt->body().
1142 // Exit and decrement the loop depth.
1217 // All extension objects were empty and it is safe to use a normal global
1299 // Three cases: global variables, lookup variables, and all other types of
1318 // Let and const need a read barrier.
1481 // each pair of corresponding getters and setters.
1497 // computed property names, and so we can compute its map ahead of time; see
1499 // starts with the first computed property name, and continues with all
1501 // component of the object literal, and arranges for the map of the result to
1602 // Emit code to evaluate all the non-constant subexpressions and to store
1633 // (inclusive) and these elements gets appended to the array. Note that the
1674 // We need the receiver both on the stack and in the register.
1886 __ And(result, left, right);
2286 // - this (receiver) <-- LoadFromSuper will pop here and below.
2349 // - this (receiver) <-- LoadKeyedFromSuper will pop here and below.
2439 // and the object holding it (returned in x1).
2446 // function and receiver and have the slow path jump around this
2483 // Push a copy of the function (found below the arguments) and
2529 // Call the construct call builtin that handles allocation and
2533 // Load function and argument count into x1 and x0.
2573 // Call the construct call builtin that handles allocation and
2581 // Load function and argument count into x1 and x0.
2863 // Push target, receiver and arguments onto the stack.
3124 // Evaluate expression and get value.
3136 // Put the object both on the stack and in the register.
3416 __ And(x1, x1, (1 << Map::kIsCallable) | (1 << Map::kIsUndetectable));
3564 // and suchlike. The implementation changes a little by bleeding_edge so I
3643 // Allocate and populate an object with this form: { value: VAL, done: DONE }
3683 // first argument register is x0, and use this function instead.
3685 // FullCodeGen, that it is unlikely we will need to change it extensively, and
3773 __ Pop(result_register(), x1); // Restore the accumulator and get the token.
