Lines Matching defs:const
118 bool CheckArguments(const byte* bytecode, int pc);
121 bool IsSequence() const;
123 int SequenceLength() const;
126 int OptimizedBytecode() const;
129 BytecodeSequenceNode* Find(int bytecode) const;
133 size_t ArgumentSize() const;
137 BytecodeArgumentMapping ArgumentMapping(size_t index) const;
141 ZoneLinkedList<BytecodeArgument>::iterator ArgumentIgnoredBegin() const;
145 ZoneLinkedList<BytecodeArgument>::iterator ArgumentIgnoredEnd() const;
147 bool HasIgnoredArguments() const;
152 Zone* zone() const;
174 const ZoneUnorderedMap<int, int>& jump_edges);
179 bool OptimizeBytecode(const byte* bytecode, int length);
182 void CopyOptimizedBytecode(byte* to_address) const;
183 int Length() const;
192 int TryOptimizeSequence(const byte* bytecode, int bytecode_length,
197 void EmitOptimization(int start_pc, const byte* bytecode,
198 const BytecodeSequenceNode& last_node);
210 void PrepareJumpStructures(const ZoneUnorderedMap<int, int>& jump_edges);
220 void CopyRangeToOutput(const byte* orig_bytecode, int start, int length);
222 void EmitArgument(int start_pc, const byte* bytecode,
224 int pc() const;
225 Zone* zone() const;
258 T GetValue(const byte* buffer, int pos) {
260 return *reinterpret_cast<const T*>(buffer + pos);
263 int32_t GetArgumentValue(const byte* bytecode, int offset, int length) {
389 bool BytecodeSequenceNode::CheckArguments(const byte* bytecode, int pc) {
408 bool BytecodeSequenceNode::IsSequence() const {
412 int BytecodeSequenceNode::SequenceLength() const {
416 int BytecodeSequenceNode::OptimizedBytecode() const {
420 BytecodeSequenceNode* BytecodeSequenceNode::Find(int bytecode) const {
426 size_t BytecodeSequenceNode::ArgumentSize() const {
432 size_t index) const {
441 BytecodeSequenceNode::ArgumentIgnoredBegin() const {
448 BytecodeSequenceNode::ArgumentIgnoredEnd() const {
454 bool BytecodeSequenceNode::HasIgnoredArguments() const {
470 Zone* BytecodeSequenceNode::zone() const { return zone_; }
474 const ZoneUnorderedMap<int, int>& jump_edges)
619 bool RegExpBytecodePeephole::OptimizeBytecode(const byte* bytecode,
644 void RegExpBytecodePeephole::CopyOptimizedBytecode(byte* to_address) const {
648 int RegExpBytecodePeephole::Length() const { return pc(); }
657 int RegExpBytecodePeephole::TryOptimizeSequence(const byte* bytecode,
685 int start_pc, const byte* bytecode, const BytecodeSequenceNode& last_node) {
836 const ZoneUnorderedMap<int, int>& jump_edges) {
919 void RegExpBytecodePeephole::CopyRangeToOutput(const byte* orig_bytecode,
935 void RegExpBytecodePeephole::EmitArgument(int start_pc, const byte* bytecode,
1003 int RegExpBytecodePeephole::pc() const {
1008 Zone* RegExpBytecodePeephole::zone() const { return zone_; }
1014 Isolate* isolate, Zone* zone, Handle<String> source, const byte* bytecode,
1015 int length, const ZoneUnorderedMap<int, int>& jump_edges) {