/external/flatbuffers/tests/fuzzer/ |
H A D | build_run_verifier_test.sh | 17 clang++ -fsanitize-coverage=edge -fsanitize=address -std=c++11 -stdlib=libstdc++ -I.. -I../../include flatbuffers_verifier_fuzzer.cc libFuzzer.a -o fuzz_verifier
|
/external/freetype/src/autofit/ |
H A D | afcjk.c | 1007 /* an edge in our table that corresponds to its position. */ 1009 /* If no edge is found, we create and insert a new edge in the */ 1010 /* sorted table. Otherwise, we simply add the segment to the edge's */ 1012 /* edge's properties. */ 1014 /* Note that the edges table is sorted along the segment/edge */ 1033 /* look for an edge corresponding to the segment */ 1036 AF_Edge edge = axis->edges + ee; local 1040 if ( edge->dir != seg->dir ) 1043 dist = seg->pos - edge 1085 AF_Edge edge; local 1140 AF_Edge edge; local 1273 AF_Edge edge = axis->edges; local 1659 af_hint_normal_stem( AF_GlyphHints hints, AF_Edge edge, AF_Edge edge2, FT_Pos anchor, AF_Dimension dim ) argument 1794 AF_Edge edge; local 2172 AF_Edge edge; local [all...] |
H A D | afhints.c | 95 /* Get new edge for given axis, direction, and position, */ 96 /* without initializing the edge itself. */ 107 AF_Edge edge = NULL; local 123 FT_Int big_max = (FT_Int)( FT_INT_MAX / sizeof ( *edge ) ); 153 edge = edges + axis->num_edges; 155 while ( edge > edges ) 157 if ( top_to_bottom_hinting ? ( edge[-1].fpos > fpos ) 158 : ( edge[-1].fpos < fpos ) ) 161 /* we want the edge with same position and minor direction */ 163 if ( edge[ 555 AF_Edge edge; local 1194 AF_Edge edge = seg->edge; local 1220 AF_Edge edge = seg->edge; local 1275 AF_Edge edge; local [all...] |
H A D | afhints.h | 86 * edges. An edge corresponds to a single position on the main 177 * Experience has shown that points not part of an edge need to be 228 /* edge hint flags */ 233 #define AF_EDGE_NEUTRAL ( 1U << 3 ) /* edge aligns to a neutral blue zone */ 260 FT_Byte flags; /* edge/segment flags for this segment */ 268 AF_Edge edge; /* the segment's parent edge */ member in struct:AF_SegmentRec_ 269 AF_Segment edge_next; /* link to next segment in parent edge */ 276 AF_Point first; /* first point in edge segment */ 277 AF_Point last; /* last point in edge segmen [all...] |
H A D | aflatin.c | 1565 /* we are already on an edge, try to locate its start */ 1629 /* points are different: we are just leaving an edge, thus */ 1784 /* if we are not on an edge, check whether the major direction */ 2108 /* an edge in our table that corresponds to its position. */ 2110 /* If no edge is found, we create and insert a new edge in the */ 2111 /* sorted table. Otherwise, we simply add the segment to the edge's */ 2113 /* edge's properties. */ 2115 /* Note that the table of edges is sorted along the segment/edge */ 2120 /* assure that edge distanc 2151 AF_Edge edge = axis->edges + ee; local 2168 AF_Edge edge; local 2215 AF_Edge edge = axis->edges + ee; local 2263 AF_Edge edge; local 2428 AF_Edge edge = axis->edges; local 2935 AF_Edge edge; local [all...] |
H A D | aflatin2.c | 790 /* already on an edge ?, backtrack to find its start */ 1133 /* to find an edge in our table that corresponds to its position. */ 1135 /* If no edge is found, we create and insert a new edge in the */ 1136 /* sorted table. Otherwise, we simply add the segment to the edge's */ 1138 /* edge's properties. */ 1140 /* Note that the edges table is sorted along the segment/edge */ 1181 /* look for an edge corresponding to the segment */ 1184 AF_Edge edge = axis->edges + ee; local 1188 dist = seg->pos - edge 1201 AF_Edge edge; local 1256 AF_Edge edge; local 1414 AF_Edge edge = axis->edges; local 1867 AF_Edge edge; local [all...] |
/external/freetype/src/psaux/ |
H A D | pshints.c | 60 size_t j; /* index of upper hint map edge */ 142 * non-Adobe font tool. The Type 2 spec allows edge (ghost) hints 184 /* Now that ghost hints have been detected, adjust this edge for */ 313 CF2_Hint hint = &hintmap->edge[i]; 352 csCoord >= hintmap->edge[i + 1].csCoord ) 356 while ( i > 0 && csCoord < hintmap->edge[i].csCoord ) 361 if ( i == 0 && csCoord < hintmap->edge[0].csCoord ) 363 /* special case for points below first edge: use uniform scale */ 365 hintmap->edge[0].csCoord ), 367 hintmap->edge[ 972 CF2_HintRec edge, invalid; local [all...] |
H A D | pshints.h | 104 * representing an edge. When edges are paired, as from stem hints, the 105 * bottom edge must immediately precede the top edge in the array. 145 CF2_HintRec edge[CF2_MAX_HINT_EDGES]; /* 192 */ member in struct:CF2_HintMapRec_
|
/external/guice/extensions/grapher/src/com/google/inject/grapher/ |
H A D | AbstractInjectorGrapher.java | 127 /** Adds a new dependency edge to the graph. */ 128 protected abstract void newDependencyEdge(DependencyEdge edge) throws IOException; argument 130 /** Adds a new binding edge to the graph. */ 131 protected abstract void newBindingEdge(BindingEdge edge) throws IOException; argument 156 for (Edge edge : edges) { 157 edge = edge.copy(resolveAlias(aliases, edge.getFromId()), 158 resolveAlias(aliases, edge.getToId())); 159 if (!edge [all...] |
/external/guice/extensions/grapher/src/com/google/inject/grapher/graphviz/ |
H A D | GraphvizGrapher.java | 84 for (GraphvizEdge edge : edges) { 85 renderEdge(edge); 166 protected void renderEdge(GraphvizEdge edge) { argument 167 Map<String, String> attrs = getEdgeAttributes(edge); 169 String tailId = getEdgeEndPoint(nodes.get(edge.getTailNodeId()).getIdentifier(), 170 edge.getTailPortId(), edge.getTailCompassPoint()); 172 String headId = getEdgeEndPoint(nodes.get(edge.getHeadNodeId()).getIdentifier(), 173 edge.getHeadPortId(), edge 178 getEdgeAttributes(GraphvizEdge edge) argument 288 newDependencyEdge(DependencyEdge edge) argument 302 newBindingEdge(BindingEdge edge) argument [all...] |
/external/guice/extensions/grapher/test/com/google/inject/grapher/ |
H A D | AbstractInjectorGrapherTest.java | 71 @Override protected void newDependencyEdge(DependencyEdge edge) { argument 72 assertFalse(edges.contains(edge)); 73 edges.add(edge); 76 @Override protected void newBindingEdge(BindingEdge edge) { argument 77 assertFalse(edges.contains(edge)); 78 edges.add(edge);
|
/external/icu/android_icu4j/src/main/java/android/icu/util/ |
H A D | StringTrieBuilder.java | 215 * Therefore, write() must write the rightmost branch edge last 222 * A branch edge also remembers the first number for any of its edges. 224 * When a further-left branch edge has a number in the range of the rightmost 225 * edge's numbers, then it will be written as part of the required right edge 229 * edge numbers. 231 * @param edgeNumber The first edge number for this node and its sub-nodes. 232 * @return An edge number that is at least the maximum-negative 233 * of the input edge number and the numbers of this node and all of its sub-nodes. 249 // If this node is part of the unwritten right branch edge, [all...] |
/external/icu/android_icu4j/src/main/tests/android/icu/dev/test/bigdec/ |
H A D | DiagBigDecimalTest.java | 75 /* 1999.12.21 multiplication fast path failure and edge cases */ 1667 android.icu.math.BigDecimal edge; 1720 // 1999.12.21: next one is a edge case if intermediate longs are used 1746 edge = new android.icu.math.BigDecimal("9.999e999999999"); 1747 tenedge = ten.multiply(edge, mce); 1778 // test some more edge cases and carries 1802 // test some more edge cases without carries
|
/external/icu/icu4c/source/common/ |
H A D | stringtriebuilder.cpp | 498 Node *edge=equal[--i]; local 499 if(edge!=NULL) { 500 edgeNumber=edge->markRightEdgesFirst(edgeNumber-step); 502 // For all but the rightmost edge, decrement the edge number.
|
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/ |
H A D | StringTrieBuilder.java | 217 * Therefore, write() must write the rightmost branch edge last 224 * A branch edge also remembers the first number for any of its edges. 226 * When a further-left branch edge has a number in the range of the rightmost 227 * edge's numbers, then it will be written as part of the required right edge 231 * edge numbers. 233 * @param edgeNumber The first edge number for this node and its sub-nodes. 234 * @return An edge number that is at least the maximum-negative 235 * of the input edge number and the numbers of this node and all of its sub-nodes. 251 // If this node is part of the unwritten right branch edge, [all...] |
/external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/bigdec/ |
H A D | DiagBigDecimalTest.java | 73 /* 1999.12.21 multiplication fast path failure and edge cases */ 1664 com.ibm.icu.math.BigDecimal edge; 1717 // 1999.12.21: next one is a edge case if intermediate longs are used 1743 edge = new com.ibm.icu.math.BigDecimal("9.999e999999999"); 1744 tenedge = ten.multiply(edge, mce); 1775 // test some more edge cases and carries 1799 // test some more edge cases without carries
|
/external/jemalloc/bin/ |
H A D | jeprof.in | 2154 # Get edges and counts per edge 2155 my %edge = (); 2169 if (!exists($edge{$edge_label})) { 2170 $edge{$edge_label} = 0; 2172 $edge{$edge_label} += $n; 2180 foreach my $e (sort { $edge{$b} <=> $edge{$a} } keys(%edge)) { 2182 $n = $edge{$e}; 2192 # Keep edge i [all...] |
/external/kernel-headers/original/uapi/linux/ |
H A D | pps.h | 139 int edge; /* selected event type */ member in struct:pps_bind_args
|
/external/libavc/common/arm/ |
H A D | ih264_deblk_chroma_a9.s | 25 @/* edge. Functions are coded in NEON assembly and can */ 61 @* Performs filtering of a chroma block horizontal edge when the 137 @* Performs filtering of a chroma block vertical edge when the 231 @* Performs filtering of a chroma block horizontal edge for cases where the 333 @* Performs filtering of a chroma block vertical edge for cases where the 472 @* Performs filtering of a chroma block vertical edge when the 550 @* Performs filtering of a chroma block vertical edge for cases where the 663 @* Performs filtering of a chroma block horizontal edge when the 750 @* Performs filtering of a chroma block vertical edge when the 855 @* Performs filtering of a chroma block horizontal edge fo [all...] |
H A D | ih264_deblk_luma_a9.s | 25 @/* edge. Functions are coded in NEON assembly and can */ 54 @* Performs filtering of a luma block horizontal edge for cases where the 194 @* Performs filtering of a luma block horizontal edge when the 360 @* Performs filtering of a luma block vertical edge for cases where the 581 @* Performs filtering of a luma block vertical edge when the 807 @* Performs filtering of a luma block vertical edge when the 949 @* Performs filtering of a luma block vertical edge for cases where the
|
/external/libavc/common/ |
H A D | ih264_deblk_edge_filters.c | 79 /* vertical edge when the boundary strength is set to 4. */ 115 WORD8 i = 0, edge; local 126 for(edge = 0; edge < 4; edge++, pu1_src += blk_strd) 199 /* horizontal edge when the boundary strength is set to 4. */ 236 WORD8 i = 0, edge; local 248 for(edge = 0; edge < 4; edge 358 WORD8 i = 0, edge; local 450 WORD8 i = 0, edge; local 543 WORD8 i = 0, edge; local 665 WORD8 i = 0, edge; local 779 WORD8 i = 0, edge; local 900 WORD8 i = 0, edge; local 1020 WORD8 i = 0, edge; local 1141 WORD8 edge; local 1226 WORD8 i = 0, edge; local 1348 WORD8 edge; local 1466 WORD8 i = 0, edge; local 1565 WORD8 i = 0, edge; local 1671 WORD8 i = 0, edge; local 1796 WORD8 i = 0, edge; local 1923 WORD8 edge; local 2022 WORD8 edge; local [all...] |
/external/libavc/decoder/ |
H A D | ih264d_compute_bs.c | 80 /* BS=2 for a 4x4 edge if any of adjacent blocks forming edge */ 82 /* edges can be derived using a lookup table for each edge */ 226 /* Computing Bs for the top edge */ 238 /* If Bs is not set, use left edge and current edge mvs and */ 268 /* Computing Bs for the left edge */ 348 UWORD32 edge; local 356 for(edge = 0; edge < 719 UWORD32 edge; local 1793 UWORD8 edge, u1_top_intra = 0, u1_left_intra = 0; local [all...] |
/external/libchrome/base/trace_event/ |
H A D | process_memory_dump.cc | 324 for (const MemoryAllocatorDumpEdge& edge : allocator_dumps_edges_) { 326 value->SetString("source", edge.source.ToString()); 327 value->SetString("target", edge.target.ToString()); 328 value->SetInteger("importance", edge.importance); 329 value->SetString("type", edge.type);
|
/external/libffi/ |
H A D | texinfo.tex | 832 % \vadjust-items are inserted at the left edge of the type. So 3426 % edge of all pages.
|
/external/libmicrohttpd/doc/ |
H A D | texinfo.tex | 832 % \vadjust-items are inserted at the left edge of the type. So 3426 % edge of all pages.
|