| /external/v8/tools/ |
| 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/ |
| D | UnicodeMap.java | 52 private int[] transitions; field in UnicodeMap
70 transitions = new int[] {0,0x110000,0,0,0,0,0,0,0,0}; in clear()
89 if (transitions[i] != that.transitions[i]) return false; in equals()
108 result = 37*result + transitions[i]; in hashCode()
120 that.transitions = (int[]) transitions.clone(); in cloneAsThawed()
132 || length > transitions.length in _checkInvariants()
133 || transitions.length != values.length) { in _checkInvariants()
144 if (transitions[0] != 0 || transitions[length-1] != 0x110000) { in _checkInvariants()
148 if (transitions[i-1] >= transitions[i]) { in _checkInvariants()
150 + "\t" + Utility.hex(i-1) + ": " + transitions[i-1] in _checkInvariants()
[all …]
|
| /external/icu/icu4j/main/tests/framework/src/com/ibm/icu/dev/util/ |
| D | UnicodeMap.java | 51 private int[] transitions; field in UnicodeMap
69 transitions = new int[] {0,0x110000,0,0,0,0,0,0,0,0}; in clear()
88 if (transitions[i] != that.transitions[i]) return false; in equals()
107 result = 37*result + transitions[i]; in hashCode()
119 that.transitions = (int[]) transitions.clone(); in cloneAsThawed()
131 || length > transitions.length in _checkInvariants()
132 || transitions.length != values.length) { in _checkInvariants()
143 if (transitions[0] != 0 || transitions[length-1] != 0x110000) { in _checkInvariants()
147 if (transitions[i-1] >= transitions[i]) { in _checkInvariants()
149 + "\t" + Utility.hex(i-1) + ": " + transitions[i-1] in _checkInvariants()
[all …]
|
| /external/v8/src/ |
| D | transitions.cc | 174 TransitionArray* transitions = TransitionArray::cast(raw_transitions); in SearchTransition() local
175 int transition = transitions->Search(kind, name, attributes); in SearchTransition()
177 return transitions->GetTarget(transition); in SearchTransition()
187 TransitionArray* transitions = TransitionArray::cast(raw_transitions); in SearchSpecial() local
188 int transition = transitions->SearchSpecial(name); in SearchSpecial()
190 return transitions->GetTarget(transition); in SearchSpecial()
230 TransitionArray* transitions = TransitionArray::cast(raw_transitions); in CanHaveMoreTransitions() local
231 return transitions->number_of_transitions() < kMaxNumberOfTransitions; in CanHaveMoreTransitions()
286 FixedArray* transitions = GetPrototypeTransitions(map); in NumberOfPrototypeTransitionsForTest() local
287 CompactPrototypeTransitionArray(transitions); in NumberOfPrototypeTransitionsForTest()
[all …]
|
| D | transitions-inl.h | 40 void TransitionArray::SetPrototypeTransitions(FixedArray* transitions) { in SetPrototypeTransitions() argument
41 DCHECK(transitions->IsFixedArray()); in SetPrototypeTransitions()
42 set(kPrototypeTransitionsIndex, transitions); in SetPrototypeTransitions()
|
| D | transitions.h | 180 static void PrintTransitions(std::ostream& os, Object* transitions,
315 Object* transitions);
317 static void ZapTransitionArray(TransitionArray* transitions);
|
| /external/bison/src/ |
| D | state.c | 40 static transitions *
44 transitions *res = xmalloc (offsetof (transitions, states) + states_size); in transitions_new()
57 transitions_to (transitions *shifts, symbol_number sym) in transitions_to()
141 res->transitions = NULL; in state_new()
168 res->transitions = in state_new_isocore()
169 transitions_new (s->transitions->num, s->transitions->states); in state_new_isocore()
191 free (s->transitions); in state_free()
205 aver (!s->transitions); in state_transitions_set()
206 s->transitions = transitions_new (num, trans); in state_transitions_set()
418 for (i = 0; i < s->transitions->num; ++i) in state_record_reachable_states()
[all …]
|
| D | lalr.c | 84 transitions *sp = states[s]->transitions; in set_goto_map()
118 transitions *sp = states[s]->transitions; in set_goto_map()
172 transitions *sp = states[stateno]->transitions; in initialize_F()
243 s = transitions_to (s->transitions, in build_relations()
333 transitions *sp = s->transitions; in state_lookahead_tokens_count()
|
| D | state.h | 115 } transitions; typedef
162 struct state *transitions_to (transitions *shifts, symbol_number sym);
202 transitions *transitions; member
|
| D | conflicts.c | 223 transitions *trans = s->transitions; in flush_shift()
331 transitions *trans = s->transitions; in set_conflicts()
431 transitions *trans = s->transitions; in count_sr_conflicts()
|
| D | ielr.c | 261 transitions *trans = states[to_state[i]]->transitions; in ielr_compute_always_follows()
311 for (j = 0; j < states[i]->transitions->num; ++j) in ielr_compute_predecessors()
312 ++predecessor_counts[states[i]->transitions->states[j]->number]; in ielr_compute_predecessors()
323 for (j = 0; j < states[i]->transitions->num; ++j) in ielr_compute_predecessors()
325 state_number k = states[i]->transitions->states[j]->number; in ielr_compute_predecessors()
829 for (i = 0; i < (*tp)->transitions->num; ++i) in ielr_compute_state()
831 state *t2 = (*tp)->transitions->states[i]; in ielr_compute_state()
903 &(*tp)->transitions->states[i]); in ielr_compute_state()
1001 for (i = 0; i < s->transitions->num; ++i) in ielr_split_states()
1003 state *t = s->transitions->states[i]; in ielr_split_states()
[all …]
|
| D | print-xml.c | 127 transitions *trans = s->transitions; in print_transitions()
242 transitions *trans = s->transitions; in print_reductions()
|
| D | print.c | 130 transitions *trans = s->transitions; in print_transitions()
242 transitions *trans = s->transitions; in print_reductions()
|
| D | print_graph.c | 142 transitions const *trans = s->transitions; in print_actions()
|
| D | graphviz.c | 92 FOR_EACH_SHIFT (s->transitions, n) in no_reduce_bitset_init()
93 bitset_set (*no_reduce_set, TRANSITION_SYMBOL (s->transitions, n)); in no_reduce_bitset_init()
|
| /external/pdfium/xfa/src/fxbarcode/datamatrix/ |
| D | BC_DataMatrixDetector.cpp | 60 CFX_PtrArray transitions; in Detect() local
61 transitions.Add(TransitionsBetween(pointA, pointB)); in Detect()
62 transitions.Add(TransitionsBetween(pointA, pointC)); in Detect()
63 transitions.Add(TransitionsBetween(pointB, pointD)); in Detect()
64 transitions.Add(TransitionsBetween(pointC, pointD)); in Detect()
65 BC_FX_PtrArray_Sort(transitions, &ResultPointsAndTransitionsComparator); in Detect()
66 delete ((CBC_ResultPointsAndTransitions*)transitions[2]); in Detect()
67 delete ((CBC_ResultPointsAndTransitions*)transitions[3]); in Detect()
69 (CBC_ResultPointsAndTransitions*)transitions[0]; in Detect()
71 (CBC_ResultPointsAndTransitions*)transitions[1]; in Detect()
[all …]
|
| D | BC_DataMatrixDetector.h | 19 int32_t transitions) { in CBC_ResultPointsAndTransitions() argument
22 m_transitions = transitions; in CBC_ResultPointsAndTransitions()
|
| /external/icu/icu4c/source/tools/tzcode/ |
| D | tz2icu.cpp | 164 vector<Transition> transitions; member
379 info.transitions.push_back(Transition(transitionTimes[i], transitionTypes[i])); in readzoneinfo()
386 vector<Transition>::iterator itr = info.transitions.begin(); in readzoneinfo()
387 info.transitions.insert(itr, Transition(LOWEST_TIME32, transitionTypes[minidx])); in readzoneinfo()
395 info.transitions.push_back(Transition(transitionTimes[i], transitionTypes[i])); in readzoneinfo()
430 int64_t rawoffset0 = (info.types.at(info.transitions.at(0).type)).rawoffset; in readzoneinfo()
444 vector<Transition>::iterator itr = info.transitions.begin(); in readzoneinfo()
445 info.transitions.insert(itr, Transition(LOWEST_TIME32, initialTypeIdx)); in readzoneinfo()
1038 trn = transitions.begin(); in print()
1041 if (trn != transitions.end() && trn->time < LOWEST_TIME32) { in print()
[all …]
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
| D | DFAState.java | 77 protected List<Transition> transitions = field in DFAState
177 return (Transition)transitions.get(i); in transition()
181 return transitions.size(); in getNumberOfTransitions()
185 transitions.add(t); in addTransition()
192 transitions.add( new Transition(label, target) ); in addTransition()
193 return transitions.size()-1; in addTransition()
197 return transitions.get(trans); in getTransition()
201 transitions.remove(trans); in removeTransition()
|
| /external/valgrind/docs/internals/ |
| D | tm-mutexstates.dot | 8 // Valid transitions
16 // Bad transitions
|
| /external/chromium-trace/catapult/third_party/polymer/components/neon-animation/guides/ |
| D | neon-animation.md | 11 `neon-animation` is a suite of elements and behaviors to implement pluggable animated transitions f…
21 * [Page transitions](#page-transitions)
23 * [Declarative page transitions](#declarative-page)
195 <a name="page-transitions"></a>
196 ## Page transitions
200 …a set of pages to switch between, and runs animations between the page transitions. It implements …
260 ### Declarative page transitions argument
262 …ation` attributes on `<neon-animated-pages>`, those animations will apply for all page transitions.
|
| /external/chromium-trace/catapult/third_party/polymer/components/neon-animation/ |
| D | README.md | 3 `neon-animation` is a suite of elements and behaviors to implement pluggable animated transitions f…
13 * [Page transitions](#page-transitions)
15 * [Declarative page transitions](#declarative-page)
187 <a name="page-transitions"></a>
188 ## Page transitions
192 …a set of pages to switch between, and runs animations between the page transitions. It implements …
252 ### Declarative page transitions argument
254 …ation` attributes on `<neon-animated-pages>`, those animations will apply for all page transitions.
|
| /external/ImageMagick/MagickCore/ |
| D | splay-tree.c | 1001 *transitions; in IterateOverSplayTree() local
1007 transitions=(unsigned char *) AcquireQuantumMemory((size_t) splay_tree->nodes, in IterateOverSplayTree()
1008 sizeof(*transitions)); in IterateOverSplayTree()
1009 if ((nodes == (NodeInfo **) NULL) || (transitions == (unsigned char *) NULL)) in IterateOverSplayTree()
1014 transitions[0]=(unsigned char) LeftTransition; in IterateOverSplayTree()
1018 transition=(TransitionType) transitions[i]; in IterateOverSplayTree()
1023 transitions[i]=(unsigned char) DownTransition; in IterateOverSplayTree()
1028 transitions[i]=(unsigned char) LeftTransition; in IterateOverSplayTree()
1033 transitions[i]=(unsigned char) UpTransition; in IterateOverSplayTree()
1038 transitions[i]=(unsigned char) LeftTransition; in IterateOverSplayTree()
[all …]
|
| /external/autotest/server/site_tests/platform_ServoPowerStateController/ |
| D | control.usb | 18 The test specifically exercises all the state transitions from control.nousb,
19 plus these additional transitions:
|
| /external/v8/src/compiler/ |
| D | access-info.h | 45 MapTransitionList& transitions() { return transitions_; } in transitions() function
46 MapTransitionList const& transitions() const { return transitions_; } in transitions() function
|