| /linux-2.4.37.9/arch/alpha/kernel/ |
| D | gct.c | 14 gct6_find_nodes(gct6_node *node, gct6_search_struct *search) in gct6_find_nodes() argument
26 for (wanted = search; in gct6_find_nodes()
41 status |= gct6_find_nodes(GCT_NODE_PTR(node->next), search); in gct6_find_nodes()
45 status |= gct6_find_nodes(GCT_NODE_PTR(node->child), search); in gct6_find_nodes()
|
| /linux-2.4.37.9/net/ipv4/netfilter/ |
| D | ip_conntrack_ftp.c | 45 } search[] = { variable
308 for (i = 0; i < sizeof(search) / sizeof(search[0]); i++) { in help()
309 if (search[i].dir != dir) continue; in help()
312 search[i].pattern, in help()
313 search[i].plen, in help()
314 search[i].skip, in help()
315 search[i].term, in help()
318 search[i].getnum); in help()
328 search[i].pattern, in help()
345 exp_ftp_info->ftptype = search[i].ftptype; in help()
|
| /linux-2.4.37.9/arch/alpha/lib/ |
| D | strchr.S | 21 zapnot a1, 1, a1 # e0 : zero extend the search character
23 sll a1, 8, t5 # e0 : replicate the search character
55 and t0, 0xf0, t2 # e0 : binary search for that set bit
|
| D | ev6-memchr.S | 42 # search til the end of the address space, we will overflow
57 addq $16, $5, $5 # E : Max search address
64 ldq_u $6, -1($5) # L : L U U L : eight or less bytes to search Latency=3
|
| D | memchr.S | 45 # search til the end of the address space, we will overflow
67 ldq_u $6, -1($5) #-e1 : eight or less bytes to search
|
| D | strcat.S | 37 and $2, 0xf0, $3 # binary search for that set bit
|
| D | strncat.S | 43 and $2, 0xf0, $3 # binary search for that set bit
|
| D | strlen_user.S | 73 and t1, 0xf0, t2 # binary search for that set bit
|
| D | strrchr.S | 70 and t8, 0xf0, t2 # e0 : binary search for the high bit set
|
| D | strncpy_from_user.S | 321 and t12, 0xf0, t3 # binary search for the address of the
|
| /linux-2.4.37.9/drivers/scsi/ |
| D | AM53C974.c | 670 struct Scsi_Host *instance, *search; in AM53C974_init() local
736 for (search = first_host; in AM53C974_init()
737 search && (((the_template != NULL) && (search->hostt != the_template)) || in AM53C974_init()
738 (search->irq != instance->irq) || (search == instance)); in AM53C974_init()
739 search = search->next); in AM53C974_init()
740 if (!search) { in AM53C974_init()
748 instance->host_no, search->host_no); in AM53C974_init()
|
| D | README.in2000 | 98 search for the 'nosync' keyword in the command-line
132 search for 'setup_strings' near the top of the in2000.c file and
|
| D | 53c7,8xx.c | 861 struct Scsi_Host *search; in NCR53c7x0_init() local
1106 for (search = first_host; search && !(search->hostt == the_template && in NCR53c7x0_init()
1107 search->irq == host->irq && search != host); search=search->next); in NCR53c7x0_init()
1109 if (!search) { in NCR53c7x0_init()
1129 host->host_no, search->host_no); in NCR53c7x0_init()
|
| /linux-2.4.37.9/Documentation/isdn/ |
| D | README.hfc-pci | 35 supplied else the parameter is assumed 0 and a auto search for a free card is
|
| /linux-2.4.37.9/Documentation/sound/ |
| D | Soundblaster | 30 reverse=1 Reverses the order of the search in the PnP table.
|
| /linux-2.4.37.9/Documentation/vm/ |
| D | numa | 38 do concentratic circle search, starting from current node, once the
|
| /linux-2.4.37.9/Documentation/ia64/ |
| D | IRQ-redir.txt | 50 search begins at the default CPU. Therefore most of the interrupts
|
| /linux-2.4.37.9/Documentation/ |
| D | BUG-HUNTING | 15 . Do a binary search over the kernels to figure out which one
|
| D | isapnp.txt | 81 search mode is used (all devices are used for the searching). Otherwise
|
| /linux-2.4.37.9/drivers/usb/ |
| D | hid-core.c | 784 static __inline__ int search(__s32 *array, __s32 value, unsigned n) in search() function
842 && search(value, field->value[n], count)) in hid_input_field()
847 && search(field->value, value[n], count)) in hid_input_field()
|
| /linux-2.4.37.9/Documentation/usb/ |
| D | sl811hc.txt | 130 If your hardware not listen in this file. Look into source and search your
161 The disk is power on and the SCSI driver will search some partions on disk. Floppy
|
| /linux-2.4.37.9/fs/sysv/ |
| D | INTRO | 57 When it is exhausted, new free inodes are found using a linear search.
|
| /linux-2.4.37.9/arch/m68k/ifpsp060/ |
| D | ilsp.doc | 54 search and replace function.
|
| /linux-2.4.37.9/fs/befs/ |
| D | ChangeLog | 37 * Sergey S. Kostyliov made befs_find_key() use a binary search to find
38 keys within btree nodes, rather than the linear search we were using
|
| /linux-2.4.37.9/fs/jfs/ |
| D | jfs_xtree.c | 103 uint search; member
282 search: in xtLookupList()
388 goto search; in xtLookupList()
514 INCREMENT(xtStat.search); in xtSearch()
4440 xtStat.search, in jfs_xtstat_read()
|