/external/v8/tools/ |
H A D | trace-maps-processor.py | 23 transitions = {} variable 66 if from_map not in transitions: 67 transitions[from_map] = {} 68 targets = transitions[from_map] 124 if m in transitions: 125 for t in transitions[m]: 126 PlainPrint(t, indent + " ", transitions[m][t].reason) 130 if m not in transitions: return 0 131 return len(transitions[m]) 136 if m in transitions [all...] |
/external/icu/android_icu4j/src/main/tests/android/icu/dev/util/ |
H A D | UnicodeMap.java | 52 private int[] transitions; field in class:UnicodeMap 70 transitions = new int[] {0,0x110000,0,0,0,0,0,0,0,0}; 89 if (transitions[i] != that.transitions[i]) return false; 108 result = 37*result + transitions[i]; 120 that.transitions = (int[]) transitions.clone(); 132 || length > transitions.length 133 || transitions.length != values.length) { 144 if (transitions[ [all...] |
/external/icu/icu4j/main/tests/framework/src/com/ibm/icu/dev/util/ |
H A D | UnicodeMap.java | 51 private int[] transitions; field in class:UnicodeMap 69 transitions = new int[] {0,0x110000,0,0,0,0,0,0,0,0}; 88 if (transitions[i] != that.transitions[i]) return false; 107 result = 37*result + transitions[i]; 119 that.transitions = (int[]) transitions.clone(); 131 || length > transitions.length 132 || transitions.length != values.length) { 143 if (transitions[ [all...] |
/external/v8/src/ |
H A D | transitions.cc | 5 #include "src/transitions.h" 8 #include "src/transitions-inl.h" 21 // If the map doesn't have any transitions at all yet, install the new one. 173 TransitionArray* transitions = TransitionArray::cast(raw_transitions); local 174 int transition = transitions->Search(kind, name, attributes); 176 return transitions->GetTarget(transition); 186 TransitionArray* transitions = TransitionArray::cast(raw_transitions); local 187 int transition = transitions->SearchSpecial(name); 189 return transitions->GetTarget(transition); 228 TransitionArray* transitions local 284 FixedArray* transitions = GetPrototypeTransitions(map); local 306 int transitions = NumberOfPrototypeTransitions(*cache) + 1; local 352 TransitionArray* transitions = TransitionArray::cast(raw_transitions); local 404 ZapTransitionArray(TransitionArray* transitions) argument 436 TransitionArray* transitions = TransitionArray::cast(map->raw_transitions()); local 468 TransitionArray* transitions = TransitionArray::cast(raw_transitions); local 492 CheckNewTransitionsAreConsistent( Handle<Map> map, TransitionArray* old_transitions, Object* transitions) argument [all...] |
H A D | transitions-inl.h | 8 #include "src/transitions.h" 40 void TransitionArray::SetPrototypeTransitions(FixedArray* transitions) { argument 41 DCHECK(transitions->IsFixedArray()); 42 set(kPrototypeTransitionsIndex, transitions);
|
H A D | transitions.h | 18 // TransitionArrays are fixed arrays used to hold map transitions for property, 19 // constant, and element changes. "Simple" transitions storing only a single 22 // prototype transitions and multiple property transitons. The details related 23 // to property transitions are accessed in the descriptor array of the target 28 // and handles the distinction between simple and full transitions storage. 31 // [0] Smi(0) or fixed array of prototype transitions 32 // [1] Number of transitions 34 // [2 + number of transitions * kTransitionSize]: start of slack 94 // order not to multiply maps unnecessarily we store these as transitions in 97 // transitions ar [all...] |
H A D | objects-printer.cc | 482 os << "\n - transitions #" << nof_transitions << ": " 555 if (i == kPrototypeTransitionsIndex) os << " (prototype transitions)"; 556 if (i == kTransitionLengthIndex) os << " (number of transitions)"; 1271 void TransitionArray::PrintTransitions(std::ostream& os, Object* transitions, argument 1273 int num_transitions = NumberOfTransitions(transitions); 1278 Name* key = GetKey(transitions, i); 1279 Map* target = GetTarget(transitions, i); 1323 Object* transitions = map()->raw_transitions(); local 1324 int num_transitions = TransitionArray::NumberOfTransitions(transitions); 1326 os << "\n - transitions"; [all...] |
/external/bison/src/ |
H A D | state.c | 40 static transitions * 44 transitions *res = xmalloc (offsetof (transitions, states) + states_size); 57 transitions_to (transitions *shifts, symbol_number sym) 70 | Error transitions. | 141 res->transitions = NULL; 168 res->transitions = 169 transitions_new (s->transitions->num, s->transitions->states); 191 free (s->transitions); [all...] |
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:__anon485 162 struct state *transitions_to (transitions *shifts, symbol_number sym); 202 transitions *transitions; member in struct:state 234 /* Set the transitions of STATE. */
|
H A D | lalr.c | 84 transitions *sp = states[s]->transitions; 118 transitions *sp = states[s]->transitions; 172 transitions *sp = states[stateno]->transitions; 243 s = transitions_to (s->transitions, 333 transitions *sp = s->transitions;
|
H A D | conflicts.c | 224 transitions *trans = s->transitions; 332 transitions *trans = s->transitions; 432 transitions *trans = s->transitions;
|
H A D | graphviz.c | 92 FOR_EACH_SHIFT (s->transitions, n) 93 bitset_set (*no_reduce_set, TRANSITION_SYMBOL (s->transitions, n)); 103 /* If no lookahead tokens were valid transitions, this reduction is 184 /* Build the lookahead tokens lists, one for enabled transitions and one
|
H A D | print_graph.c | 142 transitions const *trans = s->transitions;
|
H A D | ielr.c | 261 transitions *trans = states[to_state[i]]->transitions; 311 for (j = 0; j < states[i]->transitions->num; ++j) 312 ++predecessor_counts[states[i]->transitions->states[j]->number]; 323 for (j = 0; j < states[i]->transitions->num; ++j) 325 state_number k = states[i]->transitions->states[j]->number; 829 for (i = 0; i < (*tp)->transitions->num; ++i) 831 state *t2 = (*tp)->transitions->states[i]; 903 &(*tp)->transitions->states[i]); 1001 for (i = 0; i < s->transitions [all...] |
H A D | print-xml.c | 127 transitions *trans = s->transitions; 139 xml_puts (out, level, "<transitions/>"); 144 xml_puts (out, level, "<transitions>"); 172 xml_puts (out, level, "</transitions>"); 242 transitions *trans = s->transitions;
|
H A D | print.c | 131 transitions *trans = s->transitions; 243 transitions *trans = s->transitions;
|
H A D | LR0.c | 54 | later examination, in order to find its transitions. Return it. | 265 | Find which rules can be used for reduction transitions from the | 313 the states have valid transitions and reductions members, 317 if (!s->transitions) 357 /* Set up itemset for the transitions out of this state. itemset gets a
|
H A D | AnnotationList.c | 155 AnnotationList__compute_shift_tokens (transitions *trans) 431 shift_tokens = AnnotationList__compute_shift_tokens (s->transitions);
|
H A D | tables.c | 244 transitions *trans = s->transitions;
|
/external/pdfium/xfa/src/fxbarcode/datamatrix/ |
H A D | BC_DataMatrixDetector.cpp | 60 CFX_PtrArray transitions;
local 61 transitions.Add(TransitionsBetween(pointA, pointB));
62 transitions.Add(TransitionsBetween(pointA, pointC));
63 transitions.Add(TransitionsBetween(pointB, pointD));
64 transitions.Add(TransitionsBetween(pointC, pointD));
65 BC_FX_PtrArray_Sort(transitions, &ResultPointsAndTransitionsComparator);
66 delete ((CBC_ResultPointsAndTransitions*)transitions[2]);
67 delete ((CBC_ResultPointsAndTransitions*)transitions[3]);
69 (CBC_ResultPointsAndTransitions*)transitions[0];
71 (CBC_ResultPointsAndTransitions*)transitions[ [all...] |
H A D | BC_DataMatrixDetector.h | 19 int32_t transitions) {
22 m_transitions = transitions;
17 CBC_ResultPointsAndTransitions(CBC_ResultPoint* from, CBC_ResultPoint* to, int32_t transitions) argument
|
/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/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/v8/src/compiler/ |
H A D | access-info.h | 45 MapTransitionList& transitions() { return transitions_; } function in class:v8::internal::compiler::final 46 MapTransitionList const& transitions() const { return transitions_; } function in class:v8::internal::compiler::final
|
H A D | access-info.cc | 192 MapTransitionList transitions(maps.length()); 200 transitions.push_back(std::make_pair(map, transition_target)); 212 // Collect the possible transitions for the {receiver_map}. 213 for (auto transition : transitions) { 215 access_info.transitions().push_back(transition);
|