| /external/linux-tools-perf/perf-3.12.0/include/linux/ |
| rbtree_augmented.h | 131 struct rb_node *parent, *rebalance; local
147 rebalance = NULL;
149 rebalance = __rb_is_black(pc) ? parent : NULL;
156 rebalance = NULL;
210 rebalance = NULL;
214 rebalance = __rb_is_black(pc2) ? parent : NULL;
220 return rebalance;
227 struct rb_node *rebalance = __rb_erase_augmented(node, root, augment); local
228 if (rebalance)
229 __rb_erase_color(rebalance, root, augment->rotate)
[all...] |
| rbtree.h | 75 /* Fast replacement of a single node without remove/rebalance/add/rebalance */
|
| /external/chromium_org/third_party/skia/src/gpu/gl/ |
| GrGLNameAllocator.cpp | 141 return this->rebalance();
153 return this->rebalance();
169 return this->rebalance();
196 return this->rebalance();
204 return this->rebalance();
211 SparseNameRange* SK_WARN_UNUSED_RESULT rebalance() { function in class:GrGLNameAllocator::SparseNameTree
222 * Rebalance the tree using rotations, as described in the AVL algorithm:
227 // We should be calling rebalance() enough that the tree never gets more
|
| /external/skia/src/gpu/gl/ |
| GrGLNameAllocator.cpp | 141 return this->rebalance();
153 return this->rebalance();
169 return this->rebalance();
196 return this->rebalance();
204 return this->rebalance();
211 SparseNameRange* SK_WARN_UNUSED_RESULT rebalance() { function in class:GrGLNameAllocator::SparseNameTree
222 * Rebalance the tree using rotations, as described in the AVL algorithm:
227 // We should be calling rebalance() enough that the tree never gets more
|
| /external/guava/guava/src/com/google/common/collect/ |
| BstBalancePolicy.java | 26 * rebalance.
|
| BstMutationRule.java | 63 * Returns the policy used to rebalance nodes in the tree after this modification has been
|
| /external/blktrace/ |
| rbtree.h | 31 not trivial work to rebalance the rbtree if necessary.
152 /* Fast replacement of a single node without remove/rebalance/add/rebalance */
|
| /external/e2fsprogs/lib/ext2fs/ |
| rbtree.h | 30 be called. Such function will do the not trivial work to rebalance the
166 /* Fast replacement of a single node without remove/rebalance/add/rebalance */
|
| rbtree.c | 304 * both the new entry and any damage done by rebalance
317 * before removing the node, find the deepest node on the rebalance path
343 * and any rebalance damage.
|
| /external/chromium_org/third_party/opus/src/celt/ |
| bands.c | 918 opus_int32 rebalance; local
959 rebalance = ctx->remaining_bits;
965 rebalance = mbits - (rebalance-ctx->remaining_bits);
966 if (rebalance > 3<<BITRES && itheta!=0)
967 sbits += rebalance - (3<<BITRES);
975 rebalance = sbits - (rebalance-ctx->remaining_bits);
976 if (rebalance > 3<<BITRES && itheta!=16384)
977 mbits += rebalance - (3<<BITRES)
1298 opus_int32 rebalance; local
[all...] |
| /external/libopus/celt/ |
| bands.c | 918 opus_int32 rebalance; local
959 rebalance = ctx->remaining_bits;
965 rebalance = mbits - (rebalance-ctx->remaining_bits);
966 if (rebalance > 3<<BITRES && itheta!=0)
967 sbits += rebalance - (3<<BITRES);
975 rebalance = sbits - (rebalance-ctx->remaining_bits);
976 if (rebalance > 3<<BITRES && itheta!=16384)
977 mbits += rebalance - (3<<BITRES)
1298 opus_int32 rebalance; local
[all...] |
| /external/chromium_org/third_party/sqlite/src/test/ |
| memsubsys2.test | 22 # rebalance operations in the btree-layer and to require a large
|
| memsubsys1.test | 30 # rebalance operations in the btree-layer and to require a large
|
| /external/linux-tools-perf/perf-3.12.0/lib/ |
| rbtree.c | 394 struct rb_node *rebalance; local
395 rebalance = __rb_erase_augmented(node, root, &dummy_callbacks);
396 if (rebalance)
397 ____rb_erase_color(rebalance, root, dummy_rotate);
|
| /external/chromium_org/third_party/bintrees/bintrees/ |
| avltree.py | 185 # Terminate or rebalance as necessary */
287 # Terminate or rebalance as necessary
|
| ctrees.c | 543 /* Terminate or rebalance as necessary */
641 /* Terminate or rebalance as necessary */
|
| /external/chromium_org/third_party/protobuf/java/src/test/java/com/google/protobuf/ |
| RopeByteStringTest.java | 71 // Build up a big ByteString from smaller pieces to force a rebalance
|
| /external/fio/lib/ |
| rbtree.h | 31 not trivial work to rebalance the rbtree if necessary.
|
| /external/chromium_org/third_party/libvpx/source/libvpx/vp8/encoder/x86/ |
| quantize_sse2.c | 79 /* In C x is compared to zbin where zbin = zbin[] + boost + extra. Rebalance
|
| /external/libvpx/libvpx/vp8/encoder/x86/ |
| quantize_sse2.c | 79 /* In C x is compared to zbin where zbin = zbin[] + boost + extra. Rebalance
|
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp8/encoder/x86/ |
| quantize_sse2.c | 79 /* In C x is compared to zbin where zbin = zbin[] + boost + extra. Rebalance
|
| /libcore/luni/src/main/java/java/util/ |
| TreeMap.java | 324 rebalance(nearest, true); method
342 rebalance(nearest, true); method
389 removeInternal(adjacent); // takes care of rebalance and size--
420 rebalance(originalParent, false); method
459 private void rebalance(Node<K, V> unbalanced, boolean insert) { method in class:TreeMap
[all...] |
| /external/chromium_org/third_party/protobuf/java/src/main/java/com/google/protobuf/ |
| RopeByteString.java | 63 * tree rebalance. More precisely, a tree of depth d is "balanced" in the
191 // rebalance ;^)
194 // The tree is shallow enough, so don't rebalance
[all...] |
| /external/libcxx/include/ |
| __tree | 369 // There is no need to rebalance if we removed a red, or if we removed
373 // Rebalance:
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/include/ |
| __tree | 369 // There is no need to rebalance if we removed a red, or if we removed
373 // Rebalance:
[all...] |
