k 188 src/arm/lithium-arm.h virtual Opcode opcode() const { return LInstruction::k##type; } \
k 229 src/arm/lithium-arm.h bool Is##type() const { return opcode() == k##type; }
k 185 src/ast.cc Object* k = *key->handle();
k 186 src/ast.cc if (k->IsSymbol() &&
k 187 src/ast.cc isolate->heap()->Proto_symbol()->Equals(String::cast(k))) {
k 161 src/ast.h virtual AstNode::Type node_type() const { return AstNode::k##type; }
k 191 src/ast.h #define DECLARE_TYPE_ENUM(type) k##type,
k 218 src/ast.h bool Is##type() { return node_type() == AstNode::k##type; } \
k 1835 src/bootstrapper.cc BuiltinFunctionId id = k##name; \
k 760 src/builtins.cc int k = (relative_start < 0) ? Max(len + relative_start, 0)
k 770 src/builtins.cc int result_len = Max(final - k, 0);
k 779 src/builtins.cc CopyObjectToObjectElements(elms, elements_kind, k,
k 929 src/builtins.cc for (int k = actual_start; k < actual_start + item_count; k++) {
k 930 src/builtins.cc elms->set(k, args[3 + k - actual_start], mode);
k 1582 src/builtins.cc functions->name = k##aname; \
k 1696 src/builtins.cc reinterpret_cast<Code**>(builtin_address(k##name)); \
k 1702 src/builtins.cc reinterpret_cast<Code**>(builtin_address(k##name)); \
k 152 src/cached-powers.cc double k = ceil((min_exponent + kQ - 1) * kD_1_LOG2_10);
k 155 src/cached-powers.cc (foo + static_cast<int>(k) - 1) / kDecimalExponentDistance + 1;
k 756 src/d8.cc for (int k = i; k <= j; ++k) {
k 757 src/d8.cc temp[k - i] = source->Get(k);
k 759 src/d8.cc for (int k = i; k <= j; ++k) {
k 760 src/d8.cc self->Set(offset + k, temp[k - i]);
k 419 src/factory.h &isolate()->heap()->roots_[Heap::k##camel_name##RootIndex])); \
k 427 src/factory.h &isolate()->heap()->roots_[Heap::k##name##RootIndex])); \
k 414 src/flags.cc for (int k = i; k < *argc; k++) {
k 415 src/flags.cc js_argv[k - start_pos] = StrDup(argv[k]);
k 2140 src/heap.cc {type, size, k##camel_name##MapRootIndex},
k 2148 src/heap.cc {contents, k##name##RootIndex},
k 2156 src/heap.cc { NAME##_TYPE, Name::kSize, k##Name##MapRootIndex },
k 1125 src/heap.h return type::cast(roots_[k##camel_name##RootIndex]); \
k 1128 src/heap.h return reinterpret_cast<type*>(roots_[k##camel_name##RootIndex]); \
k 1136 src/heap.h return Map::cast(roots_[k##Name##MapRootIndex]); \
k 1142 src/heap.h return String::cast(roots_[k##name##RootIndex]); \
k 1690 src/heap.h ASSERT(k##camel_name##RootIndex >= kOldSpaceRoots || !InNewSpace(value)); \
k 1691 src/heap.h roots_[k##camel_name##RootIndex] = value; \
k 376 src/hydrogen-instructions.cc #define MAKE_CASE(type) case k##type: return #type;
k 224 src/hydrogen-instructions.h virtual Opcode opcode() const { return HValue::k##type; }
k 330 src/hydrogen-instructions.h explicit Representation(Kind k) : kind_(k) { }
k 582 src/hydrogen-instructions.h bool Is##type() const { return opcode() == k##type; }
k 531 src/hydrogen.cc for (int k = 0; k < block->predecessors()->length(); k++) {
k 532 src/hydrogen.cc HBasicBlock* predecessor = block->predecessors()->at(k);
k 1171 src/hydrogen.cc for (int k = 0; k < phi->OperandCount(); k++) {
k 1172 src/hydrogen.cc if (phi->OperandAt(k) == GetConstantHole()) return false;
k 183 src/ia32/lithium-ia32.h virtual Opcode opcode() const { return LInstruction::k##type; } \
k 224 src/ia32/lithium-ia32.h bool Is##type() const { return opcode() == k##type; }
k 437 src/incremental-marking.cc Object* k = stubs->KeyAt(i);
k 438 src/incremental-marking.cc if (stubs->IsKey(k)) {
k 439 src/incremental-marking.cc uint32_t key = NumberToUint32(k);
k 1788 src/isolate.cc isolate_addresses_[Isolate::k##CamelName##Address] = \
k 2468 src/jsregexp.cc for (int k = 0; k < elms_->length(); k++) {
k 2469 src/jsregexp.cc TextElement elm = elms_->at(k);
k 5748 src/jsregexp.cc for (int k = 0; k < ranges->length(); k++) {
k 5749 src/jsregexp.cc CharacterRange& range = ranges->at(k);
k 186 src/mips/lithium-mips.h virtual Opcode opcode() const { return LInstruction::k##type; } \
k 227 src/mips/lithium-mips.h bool Is##type() const { return opcode() == k##type; }
k 5349 src/objects.cc Object* k;
k 5351 src/objects.cc if (!maybe_k->ToObject(&k)) return maybe_k;
k 5354 src/objects.cc cache->set(EntryToIndex(entry), k);
k 10067 src/objects.cc Object* k = HashTable<Shape, Key>::KeyAt(i);
k 10068 src/objects.cc if (HashTable<Shape, Key>::IsKey(k)) {
k 10070 src/objects.cc if (k->IsString()) {
k 10071 src/objects.cc String::cast(k)->StringPrint(out);
k 10073 src/objects.cc k->ShortPrint(out);
k 10091 src/objects.cc Object* k = Dictionary<Shape, Key>::KeyAt(i);
k 10092 src/objects.cc if (Dictionary<Shape, Key>::IsKey(k)) {
k 11064 src/objects.cc Object* k = get(from_index);
k 11065 src/objects.cc if (IsKey(k)) {
k 11066 src/objects.cc uint32_t hash = HashTable<Shape, Key>::HashForObject(key, k);
k 11293 src/objects.cc Object* k = dict->KeyAt(i);
k 11294 src/objects.cc if (dict->IsKey(k)) {
k 11295 src/objects.cc ASSERT(k->IsNumber());
k 11296 src/objects.cc ASSERT(!k->IsSmi() || Smi::cast(k)->value() >= 0);
k 11297 src/objects.cc ASSERT(!k->IsHeapNumber() || HeapNumber::cast(k)->value() >= 0);
k 11298 src/objects.cc ASSERT(!k->IsHeapNumber() || HeapNumber::cast(k)->value() <= kMaxUInt32);
k 11305 src/objects.cc uint32_t key = NumberToUint32(k);
k 11937 src/objects.cc Object* k;
k 11939 src/objects.cc if (!maybe_k->ToObject(&k)) return maybe_k;
k 11942 src/objects.cc cache->set(EntryToIndex(entry), k);
k 12167 src/objects.cc Object* k;
k 12169 src/objects.cc if (!maybe_k->ToObject(&k)) return maybe_k;
k 12202 src/objects.cc Object* k;
k 12204 src/objects.cc if (!maybe_k->ToObject(&k)) return maybe_k;
k 12216 src/objects.cc SetEntry(entry, k, value, details);
k 12328 src/objects.cc Object* k = HashTable<Shape, Key>::KeyAt(i);
k 12329 src/objects.cc if (HashTable<Shape, Key>::IsKey(k)) {
k 12356 src/objects.cc Object* k = HashTable<Shape, Key>::KeyAt(i);
k 12357 src/objects.cc if (HashTable<Shape, Key>::IsKey(k)) {
k 12361 src/objects.cc if ((attr & filter) == 0) storage->set(index++, k);
k 12377 src/objects.cc Object* k = KeyAt(i);
k 12378 src/objects.cc if (IsKey(k)) {
k 12381 src/objects.cc storage->set(index, k);
k 12400 src/objects.cc Object* k = HashTable<Shape, Key>::KeyAt(i);
k 12401 src/objects.cc if (HashTable<Shape, Key>::IsKey(k)) {
k 12404 src/objects.cc storage->set(index++, k);
k 12419 src/objects.cc Object* k = HashTable<Shape, Key>::KeyAt(i);
k 12420 src/objects.cc if (Dictionary<Shape, Key>::IsKey(k)) {
k 12425 src/objects.cc if (e == value) return k;
k 12450 src/objects.cc Object* k = KeyAt(i);
k 12451 src/objects.cc if (IsKey(k)) {
k 12493 src/objects.cc Object* k = KeyAt(i);
k 12494 src/objects.cc if (IsKey(k)) {
k 12498 src/objects.cc MaybeObject* maybe_key = heap->LookupSymbol(String::cast(k));
k 2839 src/objects.h bool IsKey(Object* k) {
k 2840 src/objects.h return !k->IsTheHole() && !k->IsUndefined();
k 3518 src/objects.h set(k##name, Smi::FromInt(value)); \
k 3522 src/objects.h return Smi::cast(get(k##name))->value(); \
k 4046 src/objects.h return type::cast(get(k##name##Index)); \
k 4049 src/objects.h set(k##name##Index, value); \
k 4063 src/objects.h return type::cast(get(IndexForEntry(i) + k##name##Offset)); \
k 4066 src/objects.h set(IndexForEntry(i) + k##name##Offset, value); \
k 105 src/platform-linux.cc int k;
k 106 src/platform-linux.cc while (EOF != (k = fgetc(f))) {
k 107 src/platform-linux.cc if (k == *what) {
k 233 src/platform-linux.cc int k;
k 234 src/platform-linux.cc while (EOF != (k = fgetc(f))) {
k 235 src/platform-linux.cc if (k == *what) {
k 2176 src/profile-generator.cc String* k = descs->GetKey(i);
k 2179 src/profile-generator.cc if (k != heap_->hidden_symbol()) {
k 2182 src/profile-generator.cc k, value,
k 2194 src/profile-generator.cc if (k != heap_->hidden_symbol()) {
k 2195 src/profile-generator.cc SetPropertyReference(js_obj, entry, k, value);
k 2237 src/profile-generator.cc Object* k = dictionary->KeyAt(i);
k 2238 src/profile-generator.cc if (dictionary->IsKey(k)) {
k 2244 src/profile-generator.cc if (k != heap_->hidden_symbol()) {
k 2245 src/profile-generator.cc SetPropertyReference(js_obj, entry, String::cast(k), value);
k 2271 src/profile-generator.cc Object* k = dictionary->KeyAt(i);
k 2272 src/profile-generator.cc if (dictionary->IsKey(k)) {
k 2273 src/profile-generator.cc ASSERT(k->IsNumber());
k 2274 src/profile-generator.cc uint32_t index = static_cast<uint32_t>(k->Number());
k 245 src/runtime.cc Object* k = element_dictionary->KeyAt(i);
k 246 src/runtime.cc if (element_dictionary->IsKey(k)) {
k 9813 src/runtime.cc Handle<Object> k(dict->KeyAt(j));
k 9814 src/runtime.cc if (dict->IsKey(*k)) {
k 9815 src/runtime.cc ASSERT(k->IsNumber());
k 9816 src/runtime.cc uint32_t index = static_cast<uint32_t>(k->Number());
k 13633 src/runtime.cc { Runtime::k##name, Runtime::RUNTIME, #name, \
k 227 src/safepoint-table.cc for (int k = 0; k < bytes_per_entry; k++) {
k 228 src/safepoint-table.cc assembler->db(bits[k]);
k 158 src/serialize.cc Builtins::k##name, \
k 171 src/serialize.cc Runtime::k##name, \
k 180 src/serialize.cc IC::k##name, \
k 260 src/serialize.cc Accessors::k##name, \
k 1439 src/stub-cache.cc #define CALL_GENERATOR_CASE(name) if (id == k##name) return true;
k 1460 src/stub-cache.cc if (id == k##name) { \
k 188 src/x64/lithium-x64.h virtual Opcode opcode() const { return LInstruction::k##type; } \
k 230 src/x64/lithium-x64.h bool Is##type() const { return opcode() == k##type; }
k 5816 test/cctest/test-api.cc for (int k = 0; k < utf8_written2; k++) {
k 5817 test/cctest/test-api.cc CHECK_EQ(buffer[k], buffer2[k]);
k 6396 test/cctest/test-api.cc for (int k = 0; k < 5; k++) {
k 11292 test/cctest/test-api.cc for (char k = '0'; k <= '9'; k++) {
k 11293 test/cctest/test-api.cc buf[2] = k;
k 11295 test/cctest/test-api.cc templ->Set(v8_str(buf), v8::Number::New(k));
k 1132 test/cctest/test-parsing.cc for (int k = 0; k < kFlagsCount; ++k) {
k 1133 test/cctest/test-parsing.cc TestParserSync(source, flags[k]);
k 1217 test/cctest/test-parsing.cc for (int k = 0; termination_data[k] != NULL; ++k) {
k 1220 test/cctest/test-parsing.cc int kTerminationLen = i::StrLength(termination_data[k]);
k 1231 test/cctest/test-parsing.cc termination_data[k],
k 580 test/cctest/test-regexp.cc for (unsigned k = 0; k < kLimit; k++) \
k 581 test/cctest/test-regexp.cc CHECK_EQ(seen[k], tree.Find(k, &loc)); \
k 657 test/cctest/test-regexp.cc for (int k = 0; !is_on && (k < 2 * kRangeSize); k += 2)
k 658 test/cctest/test-regexp.cc is_on = (range[k] <= p && p <= range[k + 1]);
k 1552 test/cctest/test-regexp.cc for (int k = 0; k < length; k++)
k 1553 test/cctest/test-regexp.cc CHECK_EQ(static_cast<int>(chars[k]), static_cast<int>(chars2[k]));