HomeSort by relevance Sort by last modified time
    Searched full:rtree (Results 1 - 25 of 28) sorted by null

1 2

  /external/jemalloc/src/
rtree.c 13 rtree_new(rtree_t *rtree, unsigned bits, rtree_node_alloc_t *alloc,
32 rtree->alloc = alloc;
33 rtree->dalloc = dalloc;
34 rtree->height = height;
37 rtree->levels[0].subtree = NULL;
38 rtree->levels[0].bits = (height > 1) ? RTREE_BITS_PER_LEVEL :
40 rtree->levels[0].cumbits = rtree->levels[0].bits;
43 rtree->levels[i].subtree = NULL;
44 rtree->levels[i].bits = RTREE_BITS_PER_LEVEL
    [all...]
  /external/jemalloc/test/unit/
rtree.c 22 rtree_t rtree; local
23 assert_false(rtree_new(&rtree, i, node_alloc, node_dalloc),
25 assert_ptr_null(rtree_get(&rtree, 0, false),
27 rtree_delete(&rtree);
38 rtree_t rtree; local
39 assert_false(rtree_new(&rtree, i, node_alloc, node_dalloc),
42 assert_false(rtree_set(&rtree, 0, &node_a),
44 assert_ptr_eq(rtree_get(&rtree, 0, true), &node_a,
47 assert_false(rtree_set(&rtree, ~((uintptr_t)0), &node_b),
49 assert_ptr_eq(rtree_get(&rtree, ~((uintptr_t)0), true), &node_b
65 rtree_t rtree; local
106 rtree_t rtree; local
    [all...]
  /external/jemalloc/include/jemalloc/internal/
rtree.h 19 /* Maximum rtree height. */
98 bool rtree_new(rtree_t *rtree, unsigned bits, rtree_node_alloc_t *alloc,
100 void rtree_delete(rtree_t *rtree);
101 rtree_node_elm_t *rtree_subtree_read_hard(rtree_t *rtree,
103 rtree_node_elm_t *rtree_child_read_hard(rtree_t *rtree,
111 unsigned rtree_start_level(rtree_t *rtree, uintptr_t key);
112 uintptr_t rtree_subkey(rtree_t *rtree, uintptr_t key, unsigned level);
117 rtree_node_elm_t *rtree_child_read(rtree_t *rtree, rtree_node_elm_t *elm,
119 extent_node_t *rtree_val_read(rtree_t *rtree, rtree_node_elm_t *elm,
121 void rtree_val_write(rtree_t *rtree, rtree_node_elm_t *elm
    [all...]
jemalloc_internal.h 388 #include "jemalloc/internal/rtree.h"
425 #include "jemalloc/internal/rtree.h"
523 #include "jemalloc/internal/rtree.h"
555 #include "jemalloc/internal/rtree.h"
    [all...]
jemalloc_internal.h.in 388 #include "jemalloc/internal/rtree.h"
425 #include "jemalloc/internal/rtree.h"
523 #include "jemalloc/internal/rtree.h"
555 #include "jemalloc/internal/rtree.h"
    [all...]
  /external/skia/tests/
RTreeTest.cpp 56 DEF_TEST(RTree, reporter) {
76 SkRTree rtree; local
77 REPORTER_ASSERT(reporter, 0 == rtree.getCount());
83 rtree.insert(rects.get(), NUM_RECTS);
86 run_queries(reporter, rand, rects, rtree);
87 REPORTER_ASSERT(reporter, NUM_RECTS == rtree.getCount());
88 REPORTER_ASSERT(reporter, expectedDepthMin <= rtree.getDepth() &&
89 expectedDepthMax >= rtree.getDepth());
ImageFilterTest.cpp     [all...]
  /external/skqp/tests/
RTreeTest.cpp 56 DEF_TEST(RTree, reporter) {
76 SkRTree rtree; local
77 REPORTER_ASSERT(reporter, 0 == rtree.getCount());
83 rtree.insert(rects.get(), NUM_RECTS);
86 run_queries(reporter, rand, rects, rtree);
87 REPORTER_ASSERT(reporter, NUM_RECTS == rtree.getCount());
88 REPORTER_ASSERT(reporter, expectedDepthMin <= rtree.getDepth() &&
89 expectedDepthMax >= rtree.getDepth());
ImageFilterTest.cpp     [all...]
  /external/llvm/test/CodeGen/X86/
2009-10-19-EmergencySpill.ll 6 %struct.Rtree = type { i32, i32*, i32, i32, i32, i32, i8*, i8* }
9 define fastcc void @nodeOverwriteCell(%struct.Rtree* nocapture %pRtree, %struct.RtreeNode* nocapture %pNode, %struct.RtreeCell* nocapture %pCell, i32 %iCell) nounwind ssp {
25 %11 = getelementptr inbounds %struct.Rtree, %struct.Rtree* %pRtree, i64 0, i32 3 ; <i32*> [#uses=1]
  /external/swiftshader/third_party/LLVM/test/CodeGen/X86/
2009-10-19-EmergencySpill.ll 6 %struct.Rtree = type { i32, i32*, i32, i32, i32, i32, i8*, i8* }
9 define fastcc void @nodeOverwriteCell(%struct.Rtree* nocapture %pRtree, %struct.RtreeNode* nocapture %pNode, %struct.RtreeCell* nocapture %pCell, i32 %iCell) nounwind ssp {
25 %11 = getelementptr inbounds %struct.Rtree* %pRtree, i64 0, i32 3 ; <i32*> [#uses=1]
  /external/jemalloc/android/test/
run_jemalloc_tests.sh 50 "rtree" \
  /external/jemalloc/
Android.bp 122 "src/rtree.c",
233 "test/unit/rtree.c",
Makefile.in 105 $(srcroot)src/rtree.c \
183 $(srcroot)test/unit/rtree.c \
ChangeLog 110 - Streamline fast paths of rtree operations. (@jasone)
409 - Refactor rtree (radix tree for chunk lookups) to be lock-free, and make
    [all...]
  /external/jemalloc/msvc/projects/vc2015/jemalloc/
jemalloc.vcxproj.filters 143 <ClInclude Include="..\..\..\..\include\jemalloc\internal\rtree.h">
247 <ClCompile Include="..\..\..\..\src\rtree.c">
jemalloc.vcxproj 70 <ClInclude Include="..\..\..\..\include\jemalloc\internal\rtree.h" />
114 <ClCompile Include="..\..\..\..\src\rtree.c" />
  /external/apache-xml/src/main/java/org/apache/xpath/objects/
XObject.java 347 public DocumentFragment rtree(XPathContext support) method in class:XObject
376 public DocumentFragment rtree() method in class:XObject
515 // result = rtree(support);
XNodeSet.java 306 // public DocumentFragment rtree(XPathContext support)
  /prebuilts/tools/common/m2/repository/com/almworks/sqlite4java/libsqlite4java-linux-i386/0.282/
libsqlite4java-linux-i386-0.282.so 
  /external/icu/android_icu4j/src/main/java/android/icu/text/
RBBIRuleScanner.java 250 if (fRB.fDebugEnv != null && fRB.fDebugEnv.indexOf("rtree") >= 0) {
    [all...]
  /external/icu/icu4c/source/common/
rbbiscan.cpp 330 if (fRB->fDebugEnv && uprv_strstr(fRB->fDebugEnv, "rtree")) {printNodeStack("end of rule");}
    [all...]
  /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
RBBIRuleScanner.java 249 if (fRB.fDebugEnv != null && fRB.fDebugEnv.indexOf("rtree") >= 0) {
    [all...]
  /prebuilts/sdk/renderscript/lib/arm/
libc.so 
  /prebuilts/sdk/renderscript/lib/x86/
libc.so 

Completed in 1011 milliseconds

1 2