/external/chromium_org/v8/src/ |
H A D | transitions-inl.h | 8 #include "src/transitions.h" 68 void TransitionArray::SetPrototypeTransitions(FixedArray* transitions, argument 71 DCHECK(transitions->IsFixedArray()); 73 WRITE_FIELD(this, kPrototypeTransitionsOffset, transitions); 75 heap, this, kPrototypeTransitionsOffset, transitions, mode);
|
H A D | heap-snapshot-generator.cc | 1295 TransitionArray* transitions = map->transitions(); local 1296 int transitions_entry = GetEntry(transitions)->index(); 1297 Object* back_pointer = transitions->back_pointer_storage(); 1299 SetInternalReference(transitions, transitions_entry, 1303 if (!transitions->IsSimpleTransition()) { 1304 if (transitions->HasPrototypeTransitions()) { 1306 transitions->GetPrototypeTransitions(); 1308 TagObject(prototype_transitions, "(prototype transitions"); 1309 SetInternalReference(transitions, transitions_entr [all...] |
H A D | objects-inl.h | 33 #include "src/transitions-inl.h" 1672 // Here we just allow state transitions from undecided or maybe tenure 1850 TransitionArray* transitions = map->transitions(); 1851 if (!transitions->IsSimpleTransition()) return Handle<String>::null(); 1853 PropertyDetails details = transitions->GetTargetDetails(transition); 1854 Name* name = transitions->GetKey(transition); 1864 return Handle<Map>(map->transitions()->GetTarget( 1872 TransitionArray* transitions = map->transitions(); 5089 Handle<TransitionArray> transitions; local 5210 TransitionArray* Map::transitions() const { function in class:v8::internal::Code::FindAndReplacePattern::Map [all...] |
H A D | objects.cc | 2172 TransitionArray* transitions = this->transitions(); local 2173 for (int i = 0; i < transitions->number_of_transitions(); i++) { 2174 transitions->GetTarget(i)->DeprecateTransitionTree(); 2189 TransitionArray* transitions = this->transitions(); local 2190 int transition = transitions->Search(key); 2192 transitions->GetTarget(transition)->DeprecateTransitionTree(); 2237 TransitionArray* transitions = current->transitions(); local 2283 TransitionArray* transitions = this->transitions(); local 6514 Handle<TransitionArray> transitions = local 11274 int transitions = map->NumberOfProtoTransitions() + 1; local [all...] |
/external/bison/src/ |
H A D | state.h | 54 Each transition structure describes the possible transitions out 56 contains a vector of numbers of the states that transitions can go 61 deletes transitions by having them point to zero. 115 } transitions; typedef in typeref:struct:__anon385 162 struct state *transitions_to (transitions *shifts, symbol_number sym); 202 transitions *transitions; member in struct:state 234 /* Set the transitions of STATE. */
|
/external/chromium_org/third_party/cython/src/Cython/Plex/ |
H A D | Machines.py | 61 transitions = None # TransitionMap variable in class:Node 68 # Preinitialise the list of empty transitions, because 70 #self.transitions = {'':[]} 71 self.transitions = TransitionMap() 76 self.transitions = None 81 self.transitions.add(event, new_state) 112 self.transitions.dump(file) 148 for event, old_state_set in old_state.transitions.iteritems():
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
H A D | DFAState.java | 74 /** Track the transitions emanating from this DFA state. The List 77 protected List<Transition> transitions = field in class:DFAState 156 * can easily check for non-epsilon transitions because the only 159 * for all possible transitions. That is of the order: size(label space) 177 return (Transition)transitions.get(i); 181 return transitions.size(); 185 transitions.add(t); 192 transitions.add( new Transition(label, target) ); 193 return transitions.size()-1; 197 return transitions [all...] |
/external/chromium_org/chrome/browser/thumbnails/ |
H A D | content_analysis_unittest.cc | 472 int transitions = 0; local 475 transitions++; 477 EXPECT_EQ(transitions, 4); // We have two contiguous peaks. Good going!
|
/external/chromium_org/v8/src/heap/ |
H A D | objects-visiting-inl.h | 315 // When map collection is enabled we have to mark through map's transitions 604 // inside its transitions array is marked. Skip recording the back 608 // Treat pointers in the transitions array as weak and also mark that 613 TransitionArray* transitions = map->transitions(); local 614 MarkTransitionArray(heap, transitions); 644 // Mark the pointer fields of the Map. Since the transitions array has 655 Heap* heap, TransitionArray* transitions) { 656 if (!StaticVisitor::MarkObjectWithoutPush(heap, transitions)) return; 658 // Simple transitions d 654 MarkTransitionArray( Heap* heap, TransitionArray* transitions) argument [all...] |
/external/chromium_org/third_party/icu/source/tools/tzcode/ |
H A D | tz2icu.cpp | 157 // A collection of transitions from one ZoneType to another, together 159 // list of transitions between a smaller list of ZoneTypes. 164 vector<Transition> transitions; member in struct:ZoneInfo 362 // Build transitions vector out of corresponding times and types. 375 // transitions into zoneinfo.res, because data is limited to singed 379 info.transitions.push_back(Transition(transitionTimes[i], transitionTypes[i])); 384 // If there are any transitions before the 32bit minimum time, 386 vector<Transition>::iterator itr = info.transitions.begin(); 387 info.transitions.insert(itr, Transition(LOWEST_TIME32, transitionTypes[minidx])); 395 info.transitions [all...] |
/external/icu/icu4c/source/tools/tzcode/ |
H A D | tz2icu.cpp | 157 // A collection of transitions from one ZoneType to another, together 159 // list of transitions between a smaller list of ZoneTypes. 164 vector<Transition> transitions; member in struct:ZoneInfo 362 // Build transitions vector out of corresponding times and types. 375 // transitions into zoneinfo.res, because data is limited to singed 379 info.transitions.push_back(Transition(transitionTimes[i], transitionTypes[i])); 384 // If there are any transitions before the 32bit minimum time, 386 vector<Transition>::iterator itr = info.transitions.begin(); 387 info.transitions.insert(itr, Transition(LOWEST_TIME32, transitionTypes[minidx])); 395 info.transitions [all...] |
/external/chromium_org/v8/test/cctest/ |
H A D | test-heap.cc | 2049 // Verify that only dead prototype transitions are cleared. 2053 const int transitions = 10 - 3; local 2054 CHECK_EQ(initialTransitions + transitions, 2057 // Verify that prototype transitions array was compacted. 2059 for (int i = initialTransitions; i < initialTransitions + transitions; i++) { 2712 return map->transitions()->number_of_transitions(); 2716 // Test that map transitions are cleared and maps are collected with 2742 // Count number of live transitions before marking. 2750 // Count number of live transitions after marking. Note that one transition 2800 // Count number of live transitions befor [all...] |
/external/chromium_org/third_party/libxml/src/ |
H A D | xmlregexp.c | 315 int transcount; /* the number of chars in char counted transitions */ 457 int *transitions; local 467 * 3/ build a table state x atom for the transitions 539 transitions = (int *) xmlMalloc((nbstates + 1) * 541 if (transitions == NULL) { 548 memset(transitions, 0, (nbstates + 1) * (nbatoms + 1) * sizeof(int)); 566 transitions[stateno * (nbatoms + 1)] = state->type; 586 * if the same atom can generate transitions to 2 different 590 prev = transitions[stateno * (nbatoms + 1) + atomno + 1]; 601 xmlFree(transitions); [all...] |
/external/libxml2/ |
H A D | xmlregexp.c | 319 int transcount; /* the number of chars in char counted transitions */ 461 int *transitions; local 471 * 3/ build a table state x atom for the transitions 543 transitions = (int *) xmlMalloc((nbstates + 1) * 545 if (transitions == NULL) { 552 memset(transitions, 0, (nbstates + 1) * (nbatoms + 1) * sizeof(int)); 570 transitions[stateno * (nbatoms + 1)] = state->type; 590 * if the same atom can generate transitions to 2 different 594 prev = transitions[stateno * (nbatoms + 1) + atomno + 1]; 605 xmlFree(transitions); [all...] |
/external/chromium_org/third_party/WebKit/Source/core/rendering/style/ |
H A D | RenderStyle.h | 905 const CSSTransitionData* transitions() const { return rareNonInheritedData->m_transitions.get(); } function in class:blink::RenderStyle
|
/external/zxing/core/ |
H A D | core.jar | META-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/zxing/ com/google/zxing/aztec/ ... |
/external/antlr/antlr-3.4/lib/ |
H A D | antlr-3.4-complete.jar | META-INF/ META-INF/MANIFEST.MF org/ org/antlr/ org/antlr/analysis/ org/antlr/codegen/ org/ ... |
/external/chromium_org/third_party/android_platform/webview/ |
H A D | frameworks.jar | META-INF/ META-INF/MANIFEST.MF android/ android/location/ android/location/Address$1.class ... |