| /external/icu4c/i18n/ |
| nfrule.h | 45 const NFRule* predecessor,
79 void extractSubstitutions(const NFRuleSet* ruleSet, const NFRule* predecessor, const RuleBasedNumberFormat* rbnf, UErrorCode& status);
80 NFSubstitution* extractSubstitution(const NFRuleSet* ruleSet, const NFRule* predecessor, const RuleBasedNumberFormat* rbnf, UErrorCode& status);
|
| nfsubs.h | 59 const NFRule* predecessor,
|
| nfrule.cpp | 92 const NFRule *predecessor,
122 rule1->extractSubstitutions(ruleSet, predecessor, rbnf, status);
183 rule2->extractSubstitutions(ruleSet, predecessor, rbnf, status);
195 rule1->extractSubstitutions(ruleSet, predecessor, rbnf, status);
369 * @param predecessor The rule preseding this one in "owners" rule list
374 const NFRule* predecessor,
379 sub1 = extractSubstitution(ruleSet, predecessor, rbnf, status);
380 sub2 = extractSubstitution(ruleSet, predecessor, rbnf, status);
389 * @param predecessor The rule preceding this one in the rule set's
398 const NFRule* predecessor,
[all...] |
| nfsubs.cpp | 330 const NFRule* predecessor,
399 return new ModulusSubstitution(pos, rule->getDivisor(), predecessor,
819 const NFRule* predecessor,
[all...] |
| /external/llvm/runtime/libprofile/ |
| GCDAProfiling.c | 127 * where we're also given a pointer to n (predecessor).
129 void llvm_gcda_increment_indirect_counter(uint32_t *predecessor,
134 pred = *predecessor;
146 state_table_row, *predecessor);
|
| /external/webkit/Source/WebCore/rendering/ |
| RenderQuote.cpp | 86 for (RenderObject* predecessor = head->previousInPreOrder(); predecessor; predecessor = predecessor->previousInPreOrder()) {
87 if (!predecessor->isQuote())
89 head->m_previous = toRenderQuote(predecessor);
|
| /external/chromium/chrome/browser/sync/ |
| profile_sync_service_bookmark_unittest.cc | 104 sync_api::ReadNode* predecessor = NULL; local
107 predecessor = &predecessor_node;
111 node.InitByCreation(type, root, predecessor);
147 sync_api::ReadNode predecessor(trans_);
148 EXPECT_TRUE(predecessor.InitByIdLookup(predecessor_id));
149 EXPECT_EQ(predecessor.GetParentId(), parent.GetId());
151 &predecessor));
217 // Set a new parent and predecessor value. Return the old parent id.
218 // We could return the old predecessor id, but it turns out not to be
229 sync_api::ReadNode predecessor(trans_)
[all...] |
| /dalvik/dx/src/com/android/dx/ssa/ |
| SsaConverter.java | 124 * unique successor or unique predecessor.<p>
129 * predecessor. This ensures move statements can always be
164 * predecessor created for it
169 * predecessors needs a new predecessor node.
183 * unique move-exception block for each predecessor.
199 * one predecessor...
209 SsaBasicBlock predecessor = blocks.get(j); local
211 = predecessor.insertNewSuccessor(block);
260 * successor block has more than one predecessor.
262 * @param block predecessor nod
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/locks/ |
| AbstractQueuedLongSynchronizer.java | 56 * information about a thread in the predecessor of its node. A
58 * should block. A node is signalled when its predecessor
86 * predecessor. For explanation of similar mechanics in the case
92 * predecessor signals the next node to wake up by traversing
106 * a new predecessor, unless we can identify an uncancelled
107 * predecessor who will carry this responsibility.
183 * Link to predecessor node that current node/thread relies on
186 * cancellation of a predecessor, we short-circuit while
200 * assign next field of a predecessor until after attachment,
237 * Use when predecessor cannot be null. The null check coul
242 final Node predecessor() throws NullPointerException { method in class:AbstractQueuedLongSynchronizer.Node
[all...] |
| AbstractQueuedSynchronizer.java | 287 * information about a thread in the predecessor of its node. A
289 * should block. A node is signalled when its predecessor
317 * predecessor. For explanation of similar mechanics in the case
323 * predecessor signals the next node to wake up by traversing
337 * a new predecessor, unless we can identify an uncancelled
338 * predecessor who will carry this responsibility.
414 * Link to predecessor node that current node/thread relies on
417 * cancellation of a predecessor, we short-circuit while
431 * assign next field of a predecessor until after attachment,
468 * Use when predecessor cannot be null. The null check coul
473 final Node predecessor() throws NullPointerException { method in class:AbstractQueuedSynchronizer.Node
[all...] |
| /external/chromium/chrome/browser/sync/engine/ |
| syncapi.h | 318 // Create a new node with the specified parent and predecessor. |model_type|
320 // extension can be used with this item. Use a NULL |predecessor|
322 // |predecessor| must be a child of |new_parent| or NULL. Returns false on
326 const BaseNode* predecessor);
354 // Set a new parent and position. Position is specified by |predecessor|; if
355 // it is NULL, the node is moved to the first position. |predecessor| must
357 bool SetPosition(const BaseNode& new_parent, const BaseNode* predecessor);
424 void PutPredecessor(const BaseNode* predecessor);
[all...] |
| syncapi.cc | 760 const BaseNode* predecessor) {
762 // |predecessor| must be a child of |parent| or NULL.
763 if (predecessor && predecessor->GetParentId() != parent.GetId()) {
785 // Now set the predecessor, which sets IS_UNSYNCED as necessary.
786 PutPredecessor(predecessor);
863 // Now set the predecessor, which sets IS_UNSYNCED as necessary.
870 const BaseNode* predecessor) {
871 // |predecessor| must be a child of |new_parent| or NULL.
872 if (predecessor && predecessor->GetParentId() != new_parent.GetId())
[all...] |
| syncapi_unittest.cc | 126 BaseNode* predecessor) {
131 EXPECT_TRUE(node.InitByCreation(model_type, parent_node, predecessor));
[all...] |
| /external/chromium/chrome/browser/sync/glue/ |
| bookmark_change_processor.cc | 215 // This node's index should be one more than the predecessor's index.
304 // Find the bookmark model predecessor, and insert after it.
308 LOG(WARNING) << "Predecessor lookup failed";
324 // predecessor of the node (in the bookmark model) matches the predecessor of
326 // As a precondition, this assumes that the predecessor of |source| has been
334 // A return ID of kInvalidId indicates no predecessor.
338 // Otherwise, insert after the predecessor bookmark node.
339 const BookmarkNode* predecessor = local
341 DCHECK(predecessor);
[all...] |
| /frameworks/base/core/java/android/view/ |
| ViewGroup.java | 1719 TouchTarget predecessor = null; local
1856 TouchTarget predecessor = null; local
[all...] |
| /external/chromium/chrome/browser/sync/syncable/ |
| syncable.cc | [all...] |
| /external/v8/src/ |
| hydrogen.cc | 204 HBasicBlock* predecessor = predecessors_[i]; local
205 ASSERT(predecessor->end()->IsGoto());
206 HSimulate* simulate = HSimulate::cast(predecessor->end()->previous());
209 predecessor->last_environment()->closure()->shared()
246 // Only loop header blocks can have a predecessor added after
271 // succeeding block in this list, the predecessor is before the successor.
308 int HBasicBlock::PredecessorIndexOf(HBasicBlock* predecessor) const {
310 if (predecessors_[i] == predecessor) return i;
438 // Check that the predecessor array is correct.
457 HBasicBlock* predecessor = block->predecessors()->at(k) local
[all...] |
| hydrogen.h | 123 int PredecessorIndexOf(HBasicBlock* predecessor) const;
737 // Create a back edge in the flow graph. body_exit is the predecessor
[all...] |
| /external/v8/test/mjsunit/ |
| unicode-test.js | [all...] |
