Searched refs:edges (Results 26 - 41 of 41) sorted by relevance

12

/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/fs/btrfs/
H A Drelocation.c333 struct backref_edge *edges[],
342 edges[idx++] = edge;
353 static struct backref_node *walk_down_backref(struct backref_edge *edges[], argument
361 edge = edges[idx - 1];
369 edges[idx - 1] = edge;
2266 struct backref_edge *edges[], int *nr)
2275 next = walk_up_backref(next, edges, &index);
2301 next = walk_down_backref(edges, &index);
2315 next = edges[index]->node[UPPER];
2333 struct backref_edge *edges[BTRFS_MAX_LEVE local
332 walk_up_backref(struct backref_node *node, struct backref_edge *edges[], int *index) argument
2263 select_reloc_root(struct btrfs_trans_handle *trans, struct reloc_control *rc, struct backref_node *node, struct backref_edge *edges[], int *nr) argument
2369 struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; local
2442 struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; local
2630 struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; local
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/libpcap-1.4.0/
H A Doptimize.c125 struct edge **edges; variable in typeref:struct:edge
1353 target = fold_edge(ep->succ, edges[k]);
1807 free((void *)edges);
1916 edges = (struct edge **)calloc(n_edges, sizeof(*edges));
1917 if (edges == NULL)
1955 edges[i] = &b->et;
1957 edges[n_blocks + i] = &b->ef;
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/libav-0.8.8/libavcodec/ppc/
H A Dh264_altivec.c188 vec_u8 a, b, d, tmp1, tmp2, mask, mask_, edges, align; local
211 edges = vec_perm(tmp2, tmp1, mask);
215 tmp2 = vec_perm(d, edges, align);
216 tmp1 = vec_perm(edges, d, align);
230 vec_u8 a, b, d, tmp1, tmp2, mask, mask_, edges, align; local
253 edges = vec_perm(tmp2, tmp1, mask);
257 tmp2 = vec_perm(d, edges, align);
258 tmp1 = vec_perm(edges, d, align);
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/wxWidgets-2.8.12/docs/latex/wx/
H A Dilayout.tex43 \twocolitem{wxUnconstrained}{The edge or dimension is unconstrained (the default for edges.}
97 other edges and dimensions from which this value can be deduced.
H A Dsashwin.tex3 wxSashWindow allows any of its edges to have a sash which can be dragged
H A Dprint.tex1045 around the edges of the paper are not printable so that the edges of the image
1059 portions of the image might be cut off at the edges.
1148 with respect to the edges of the paper on all platforms.
H A Dcomboctrl.tex631 Extends popup size horizontally, relative to the edges of the combo control.
H A Dgrid.tex274 by dragging the edges of their labels. If grid line dragging is enabled they can also be
285 by dragging the edges of their labels. If grid line dragging is enabled they can also be
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/libantlr3c-3.2/include/
H A Dantlr3collections.h409 * A vector of vectors of edges, built by calling the addEdge method()
414 pANTLR3_BITSET * edges; member in struct:ANTLR3_TOPO_struct
425 * as a stack and each time we descend a node to one of its edges we
435 * A flag that indicates the algorithm found a cycle in the edges
452 * One more than the largest node index that is contained in edges/sorted.
465 * while building these edges, it is perfectly OK to add nodes out of
466 * sequence. So, if you have edges:
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/minidlna/ffmpeg-2.3.4/libavcodec/x86/
H A Dh264_deblock.asm925 ; int bidir, int edges, int step,
929 ; edges is 1 or 4
935 %macro loop_filter_strength_iteration 7 ; edges, step, mask_mv,
944 xor b_idxd, b_idxd ; for (b_idx = 0; b_idx < edges; b_idx += step)
1033 cglobal h264_loop_filter_strength, 9, 9, 0, bs, nnz, ref, mv, bidir, edges, \
H A Dh264dsp_init.c90 int bidir, int edges, int step,
H A Ddwt_yasm.asm164 ; extend the left and right edges of the tmp array by %1 and %2 respectively
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/minidlna/ffmpeg-2.3.4/libavcodec/
H A Dvp9.c2345 } edges[N_INTRA_PRED_MODES] = { local
2365 if (edges[mode].needs_top) {
2370 if (tx == TX_4X4 && edges[mode].needs_topright && have_right)
2388 (!edges[mode].needs_topleft || (have_left && top == topleft)) &&
2389 (tx != TX_4X4 || !edges[mode].needs_topright || have_right) &&
2404 if (edges[mode].needs_topleft) {
2411 if (tx == TX_4X4 && edges[mode].needs_topright) {
2421 if (edges[mode].needs_left) {
2796 // edges. This means that for UV, we work on two subsampled blocks at
2819 // on 32-px edges, us
[all...]
H A Dvc1dec.c1094 int edges = 0; \
1107 edges = 1 << v->dqsbedge; \
1109 edges = (3 << v->dqsbedge) % 15; \
1111 edges = 15; \
1112 if ((edges&1) && !s->mb_x) \
1114 if ((edges&2) && s->first_slice_line) \
1116 if ((edges&4) && s->mb_x == (s->mb_width - 1)) \
1118 if ((edges&8) && s->mb_y == (s->mb_height - 1)) \
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/libav-0.8.8/libavcodec/
H A Ddsputil.h537 int * range, int * sum, int edges);
H A Dvc1dec.c1025 int edges = 0; \
1038 edges = 1 << v->dqsbedge; \
1040 edges = (3 << v->dqsbedge) % 15; \
1042 edges = 15; \
1043 if ((edges&1) && !s->mb_x) \
1045 if ((edges&2) && s->first_slice_line) \
1047 if ((edges&4) && s->mb_x == (s->mb_width - 1)) \
1049 if ((edges&8) && s->mb_y == (s->mb_height - 1)) \

Completed in 147 milliseconds

12