| /external/grub/netboot/ |
| natsemi.c | 169 u32 link;
510 txd.link = (u32) 0;
539 rxd[i].link = (i+1 < NUM_RX_DESC) ? (u32) &rxd[i+1] : (u32) &rxd[0];
543 printf("natsemi_init_rxd: rxd[%d]=%X link=%X cmdsts=%X bufptr=%X\n",
544 i, &rxd[i], rxd[i].link, rxd[i].cmdsts, rxd[i].bufptr);
578 printf("%s: Setting %s-duplex based on negotiated link"
168 u32 link; member in struct:_BufferDesc
|
| /external/grub/stage2/ |
| iso9660.h | 41 #define RR_FLAG_SL 0x04 /* Symbolic link */
43 #define RR_FLAG_CL 0x10 /* Child link */
44 #define RR_FLAG_PL 0x20 /* Parent link */
174 } link; member in struct:rock_ridge::__anon18452::SL
|
| /external/libpcap/ |
| gencode.h | 227 struct edge *next; /* link list of incoming edges for a node */
243 struct block *link; /* link field used by optimizer */ member in struct:block
|
| /external/libvorbis/lib/ |
| vorbisfile.c | 260 /* we fell off the end of the link, which means we seeked
261 back too far and shouldn't have been looking in that link
301 headers we see in the link */
318 /* we don't have a vorbis stream in this link yet, so begin
392 /* if we never see the final vorbis headers before the link
461 /* finds each bitstream link one at a time using a bisection search
463 Recurses for each link so it can alloc the link storage after
484 we have the headers and serialnos for the link beginning at 'begin'
493 down to (or just started with) a single link. Now we need t
723 int link=(vf->seekable?vf->current_link:0); local
822 int link; local
1134 int link=(vf->seekable?vf->current_link:0); local
1299 int i,link=vf->current_link; local
1345 int link; local
1389 int link=-1; local
1627 int link; local
1670 int link=-1; local
1700 int link=-1; local
1740 int link=0; local
[all...] |
| /external/opencv/cv/src/ |
| cvcontours.cpp | 345 It's marked as "link to contour" and h_next pointer of it is set to
351 leaves header if hierarchical (but doesn't mark header as "link").
1127 struct CvLinkedRunPoint* link; member in struct:CvLinkedRunPoint
[all...] |
| /external/qemu/hw/ |
| bt-hci.c | 57 struct bt_link_s *link; member in struct:bt_hci_s::__anon25252::bt_hci_master_link_s
58 void (*lmp_acl_data)(struct bt_link_s *link,
620 !hci->lm.handle[handle & ~HCI_HANDLE_OFFSET].link;
631 struct bt_link_s *link = hci->lm.handle[handle & ~HCI_HANDLE_OFFSET].link; local
633 return bt_hci_role_master(hci, handle) ? link->slave : link->host;
638 struct bt_link_s *link, int master)
640 hci->lm.handle[hci->lm.last_handle].link = link;
678 struct bt_link_s link; local
698 struct bt_link_s link = { local
724 struct bt_hci_link_s *link = qemu_mallocz(sizeof(struct bt_hci_link_s)); local
880 struct bt_hci_link_s *link; local
926 struct bt_hci_link_s *link = (struct bt_hci_link_s *) btlink; local
1065 struct bt_hci_link_s *link = (struct bt_hci_link_s *) btlink; local
1074 struct bt_hci_master_link_s *link; local
1096 struct bt_hci_master_link_s *link; local
1118 struct bt_link_s *link = opaque; local
1995 struct bt_hci_link_s *link = (struct bt_hci_link_s *) btlink; local
2014 struct bt_link_s *link; local
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/ |
| form.h | 91 struct fieldnode * link; /* linked field chain */ member in struct:fieldnode
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/ |
| form.h | 91 struct fieldnode * link; /* linked field chain */ member in struct:fieldnode
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/ |
| form.h | 91 struct fieldnode * link; /* linked field chain */ member in struct:fieldnode
|
| /frameworks/base/services/java/com/android/server/ |
| MountService.java | 194 /** When defined, base template for user-specific {@link StorageVolume}. */
201 /** Map from path to {@link StorageVolume} */
244 /** Map from raw paths to {@link ObbState}. */
285 public void link() throws RemoteException { method in class:MountService.ObbState
[all...] |
| /bionic/libc/kernel/common/linux/ |
| nfs_xdr.h | 611 int (*link) (struct inode *, struct inode *, struct qstr *); member in struct:nfs_rpc_ops
|
| /development/ndk/platforms/android-3/include/linux/ |
| nfs_xdr.h | 525 int (*link) (struct inode *, struct inode *, struct qstr *); member in struct:nfs_rpc_ops
|
| /external/bzip2/ |
| bzip2.c | 1697 struct zzzz *link; member in struct:zzzz
[all...] |
| /external/chromium_org/components/breakpad/app/ |
| breakpad_linux.cc | 994 char* link = reinterpret_cast<char*>(allocator->Alloc(kMaxSize)); local
995 if (link) {
996 ssize_t size = readlink(linkpath, link, kMaxSize);
999 link[size] = '\0';
1001 const char* name = my_strrchr(link, '/');
1004 return link;
[all...] |
| /external/chromium_org/third_party/freetype/src/autofit/ |
| aflatin2.c | 107 AF_Segment seg, limit, link; local
124 link = seg->link;
127 if ( link && link->link == seg && link > seg )
132 dist = seg->pos - link->pos;
995 /* we must never link them to anything */
1030 seg1->link = seg2
[all...] |
| /external/chromium_org/third_party/icu/source/common/ |
| triedict.cpp | 63 TernaryNode *low; // Less-than link
64 TernaryNode *equal; // Equal link
65 TernaryNode *high; // Greater-than link
460 kParentEndsWord = 0x2000, // The node whose equal link points to this ends a word
475 uint16_t equal; // Equal link node index
488 uint16_t equal; // Equal link node index
581 * calculates an equal link node ID of a horizontal node
582 * @hnode The horizontal node containing the equal link
597 * calculates an equal link node ID of a horizontal node
598 * @hnode The horizontal node containing the equal link
1231 BuildCompactTrieValueNode *link = (BuildCompactTrieValueNode *) values->get(key); local
1261 BuildCompactTrieNode *link = NULL; local
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_peephole.cpp | 1468 MemoryOpt::Record::link(Record **list) function in class:nv50_ir::MemoryOpt::Record
[all...] |
| /external/chromium_org/third_party/mesa/src/src/glsl/ |
| ast.h | 124 exec_node link; member in class:ast_node
811 declarations.push_degenerate_list_at_head(&member_list->link);
|
| /external/freetype/src/autofit/ |
| aflatin2.c | 107 AF_Segment seg, limit, link; local
124 link = seg->link;
127 if ( link && link->link == seg && link > seg )
132 dist = seg->pos - link->pos;
995 /* we must never link them to anything */
1030 seg1->link = seg2
[all...] |
| /external/kernel-headers/original/linux/ |
| pnp.h | 314 struct pnp_driver link; member in struct:pnp_card_driver
317 #define to_pnp_card_driver(drv) container_of(drv, struct pnp_card_driver, link)
339 struct device dev; /* link to driver model */
|
| tty.h | 192 struct tty_struct *link; member in struct:tty_struct
|
| /external/libvpx/libvpx/examples/includes/PHP-Markdown-Extra-1.2.3/ |
| markdown.php | 121 # - Remove WordPress auto-link generator.
339 # Strip link definitions, store in hashes.
348 # Strips link definitions from text, stores the URLs and titles in
353 # Link defs are in the form: ^[id]: url "optional title"
669 # Turn Markdown link shortcuts into XHTML <a> tags.
675 # First, handle reference-style links: [link text] [id]
680 ('.$this->nested_brackets_re.') # link text = $2
694 # Next, inline-style links: [link text](url "optional title")
699 ('.$this->nested_brackets_re.') # link text = $2
721 # Last, handle reference-style shortcuts: [link text
1450 $link = "<a href=\\"$url\\">$url<\/a>"; variable
1455 $link = $this->encodeEmailAddress($address); variable
[all...] |
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_peephole.cpp | 1468 MemoryOpt::Record::link(Record **list) function in class:nv50_ir::MemoryOpt::Record
[all...] |
| /external/mesa3d/src/glsl/ |
| ast.h | 124 exec_node link; member in class:ast_node
811 declarations.push_degenerate_list_at_head(&member_list->link);
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ConcurrentSkipListMap.java | 11 // removed link to collections framework docs
15 * A scalable concurrent {@link ConcurrentNavigableMap} implementation.
17 * ordering} of its keys, or by a {@link Comparator} provided at map
28 * the creation of the iterator. They do <em>not</em> throw {@link
52 * <em>optional</em> methods of the {@link Map} and {@link Iterator}
115 * link. This requires less space and supports faster
197 * using CAS to link and unlink. Races are allowed in index-list
198 * operations that can (rarely) fail to link in a new index node
543 * indexed is known to be deleted, it doesn't try to link in
548 final boolean link(Index<K,V> succ, Index<K,V> newSucc) { method in class:ConcurrentSkipListMap.Index
[all...] |
