| /external/chromium_org/chrome/browser/history/ |
| D | visit_tracker.cc | 40 TransitionList& transitions = *i->second; in GetLastVisit() local
58 for (int i = static_cast<int>(transitions.size()) - 1; i >= 0; i--) { in GetLastVisit()
59 if (transitions[i].page_id <= page_id && transitions[i].url == referrer) { in GetLastVisit()
61 return transitions[i].visit_id; in GetLastVisit()
73 TransitionList* transitions = hosts_[host]; in AddVisit() local
74 if (!transitions) { in AddVisit()
75 transitions = new TransitionList; in AddVisit()
76 hosts_[host] = transitions; in AddVisit()
83 transitions->push_back(t); in AddVisit()
85 CleanupTransitionList(transitions); in AddVisit()
[all …]
|
| D | visit_tracker.h | 56 void CleanupTransitionList(TransitionList* transitions);
|
| /external/chromium/chrome/browser/history/ |
| D | visit_tracker.cc | 40 TransitionList& transitions = *i->second; in GetLastVisit() local
58 for (int i = static_cast<int>(transitions.size()) - 1; i >= 0; i--) { in GetLastVisit()
59 if (transitions[i].page_id <= page_id && transitions[i].url == referrer) { in GetLastVisit()
61 return transitions[i].visit_id; in GetLastVisit()
73 TransitionList* transitions = hosts_[host]; in AddVisit() local
74 if (!transitions) { in AddVisit()
75 transitions = new TransitionList; in AddVisit()
76 hosts_[host] = transitions; in AddVisit()
83 transitions->push_back(t); in AddVisit()
85 CleanupTransitionList(transitions); in AddVisit()
[all …]
|
| D | visit_tracker.h | 57 void CleanupTransitionList(TransitionList* 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.c | 130 transitions *trans = s->transitions; in print_transitions()
242 transitions *trans = s->transitions; in print_reductions()
|
| D | print-xml.c | 127 transitions *trans = s->transitions; in print_transitions()
242 transitions *trans = s->transitions; in print_reductions()
|
| 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()
|
| D | print_graph.c | 142 transitions const *trans = s->transitions; in print_actions()
|
| /external/chromium_org/third_party/icu/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/icu4c/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/chromium_org/chrome/tools/ |
| D | history-viz.py | 90 self.transitions = []
95 for trans in self.transitions:
172 edge.transitions.append(trans)
214 transitions = edge.Transitions()
215 for trans, count in transitions.items():
239 if src == '0' and len(transitions.keys()) == 1 and transitions.has_key(0):
|
| /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/chromium_org/v8/src/ |
| D | transitions-inl.h | 98 void TransitionArray::SetPrototypeTransitions(FixedArray* transitions, in SetPrototypeTransitions() argument
101 ASSERT(transitions->IsFixedArray()); in SetPrototypeTransitions()
103 WRITE_FIELD(this, kPrototypeTransitionsOffset, transitions); in SetPrototypeTransitions()
105 heap, this, kPrototypeTransitionsOffset, transitions, mode); in SetPrototypeTransitions()
|
| D | objects-visiting-inl.h | 603 TransitionArray* transitions = map->unchecked_transition_array(); in MarkMapContents() local
604 if (transitions->IsTransitionArray()) { in MarkMapContents()
605 MarkTransitionArray(heap, transitions); in MarkMapContents()
608 ASSERT(transitions->IsMap() || transitions->IsUndefined()); in MarkMapContents()
650 Heap* heap, TransitionArray* transitions) { in MarkTransitionArray() argument
651 if (!StaticVisitor::MarkObjectWithoutPush(heap, transitions)) return; in MarkTransitionArray()
654 if (transitions->IsSimpleTransition()) return; in MarkTransitionArray()
656 if (transitions->HasPrototypeTransitions()) { in MarkTransitionArray()
660 Object** slot = transitions->GetPrototypeTransitionsSlot(); in MarkTransitionArray()
666 for (int i = 0; i < transitions->number_of_transitions(); ++i) { in MarkTransitionArray()
[all …]
|
| /external/valgrind/main/docs/internals/ |
| D | tm-mutexstates.dot | 8 // Valid transitions
16 // Bad transitions
|
| /external/hyphenation/ |
| D | README.hyphen | 68 There are two kinds of transitions: those that consume one letter of
70 "fallback" transitions, which don't consume any input. If no
79 Fallback transitions go to states which chop off one or (sometimes)
81 transitions from "amp" match the next letter, then it will fall back
82 to "mp". Similarly, if none of the transitions from "mp" match the
95 state transitions is linear in the length of the word.
|
| /external/oprofile/events/i386/p6_mobile/ |
| D | unit_masks | 42 0x00 All transitions
43 0x02 Only Frequency transitions
|
| /external/oprofile/events/i386/core/ |
| D | unit_masks | 30 0x00 any transitions
31 0x10 Intel(tm) Enhanced SpeedStep(r) Technology frequency transitions
|
| /external/android-clat/ |
| D | BUGS | 2 - ipv6 traceroute to handle 464 transitions
|
| /external/chromium_org/third_party/WebKit/Source/core/frame/animation/ |
| D | CompositeAnimation.cpp | 74 if (!currentStyle || (!targetStyle.transitions() && m_transitions.isEmpty())) in updateTransitions()
86 if (targetStyle.transitions()) { in updateTransitions()
87 for (size_t i = 0; i < targetStyle.transitions()->size(); ++i) { in updateTransitions()
88 const CSSAnimationData* anim = targetStyle.transitions()->animation(i); in updateTransitions()
|