| /linux-2.6.39/net/rxrpc/ |
| D | ar-connection.c | 71 struct rxrpc_conn_bundle *bundle, *candidate; in rxrpc_get_bundle() local
102 candidate = rxrpc_alloc_bundle(gfp); in rxrpc_get_bundle()
103 if (!candidate) { in rxrpc_get_bundle()
108 candidate->key = key_get(key); in rxrpc_get_bundle()
109 candidate->service_id = service_id; in rxrpc_get_bundle()
128 bundle = candidate; in rxrpc_get_bundle()
129 candidate = NULL; in rxrpc_get_bundle()
158 kfree(candidate); in rxrpc_get_bundle()
429 struct rxrpc_connection *conn, *candidate; in rxrpc_connect_call() local
521 candidate = rxrpc_alloc_connection(gfp); in rxrpc_connect_call()
[all …]
|
| D | ar-call.c | 153 struct rxrpc_call *call, *candidate; in rxrpc_get_client_call() local
183 candidate = rxrpc_alloc_client_call(rx, trans, bundle, gfp); in rxrpc_get_client_call()
184 if (IS_ERR(candidate)) { in rxrpc_get_client_call()
185 _leave(" = %ld", PTR_ERR(candidate)); in rxrpc_get_client_call()
186 return candidate; in rxrpc_get_client_call()
189 candidate->user_call_ID = user_call_ID; in rxrpc_get_client_call()
190 __set_bit(RXRPC_CALL_HAS_USERID, &candidate->flags); in rxrpc_get_client_call()
209 call = candidate; in rxrpc_get_client_call()
210 candidate = NULL; in rxrpc_get_client_call()
237 rxrpc_put_call(candidate); in rxrpc_get_client_call()
[all …]
|
| D | ar-transport.c | 78 struct rxrpc_transport *trans, *candidate; in rxrpc_get_transport() local
98 candidate = rxrpc_alloc_transport(local, peer, gfp); in rxrpc_get_transport()
99 if (!candidate) { in rxrpc_get_transport()
112 trans = candidate; in rxrpc_get_transport()
113 candidate = NULL; in rxrpc_get_transport()
141 kfree(candidate); in rxrpc_get_transport()
|
| D | ar-peer.c | 107 struct rxrpc_peer *peer, *candidate; in rxrpc_get_peer() local
138 candidate = rxrpc_alloc_peer(srx, gfp); in rxrpc_get_peer()
139 if (!candidate) { in rxrpc_get_peer()
157 peer = candidate; in rxrpc_get_peer()
158 candidate = NULL; in rxrpc_get_peer()
186 kfree(candidate); in rxrpc_get_peer()
|
| /linux-2.6.39/fs/afs/ |
| D | write.c | 124 struct afs_writeback *candidate, *wb; in afs_write_begin() local
136 candidate = kzalloc(sizeof(*candidate), GFP_KERNEL); in afs_write_begin()
137 if (!candidate) in afs_write_begin()
139 candidate->vnode = vnode; in afs_write_begin()
140 candidate->first = candidate->last = index; in afs_write_begin()
141 candidate->offset_first = from; in afs_write_begin()
142 candidate->to_last = to; in afs_write_begin()
143 INIT_LIST_HEAD(&candidate->link); in afs_write_begin()
144 candidate->usage = 1; in afs_write_begin()
145 candidate->state = AFS_WBACK_PENDING; in afs_write_begin()
[all …]
|
| D | server.c | 107 struct afs_server *server, *candidate; in afs_lookup_server() local
120 candidate = afs_alloc_server(cell, addr); in afs_lookup_server()
121 if (!candidate) { in afs_lookup_server()
135 server = candidate; in afs_lookup_server()
165 kfree(candidate); in afs_lookup_server()
171 kfree(candidate); in afs_lookup_server()
|
| /linux-2.6.39/security/keys/ |
| D | key.c | 65 struct key_user *candidate = NULL, *user; in key_user_lookup() local
91 if (!candidate) { in key_user_lookup()
97 candidate = kmalloc(sizeof(struct key_user), GFP_KERNEL); in key_user_lookup()
98 if (unlikely(!candidate)) in key_user_lookup()
109 atomic_set(&candidate->usage, 1); in key_user_lookup()
110 atomic_set(&candidate->nkeys, 0); in key_user_lookup()
111 atomic_set(&candidate->nikeys, 0); in key_user_lookup()
112 candidate->uid = uid; in key_user_lookup()
113 candidate->user_ns = get_user_ns(user_ns); in key_user_lookup()
114 candidate->qnkeys = 0; in key_user_lookup()
[all …]
|
| /linux-2.6.39/kernel/power/ |
| D | suspend_test.c | 117 struct rtc_device *candidate = to_rtc_device(dev); in has_wakealarm() local
119 if (!candidate->ops->set_alarm) in has_wakealarm()
121 if (!device_may_wakeup(candidate->dev.parent)) in has_wakealarm()
|
| /linux-2.6.39/arch/sparc/mm/ |
| D | init_64.c | 904 u64 arc, candidate, best_latency = ~(u64)0; in scan_arcs_for_cfg_handle() local
906 candidate = MDESC_NODE_NULL; in scan_arcs_for_cfg_handle()
920 candidate = target; in scan_arcs_for_cfg_handle()
925 if (candidate == MDESC_NODE_NULL) in scan_arcs_for_cfg_handle()
928 return scan_pio_for_cfg_handle(md, candidate, cfg_handle); in scan_arcs_for_cfg_handle()
1113 struct mdesc_mlgroup *candidate = NULL; in numa_attach_mlgroup() local
1123 candidate = m; in numa_attach_mlgroup()
1127 if (!candidate) in numa_attach_mlgroup()
1139 n->mask = candidate->mask; in numa_attach_mlgroup()
1140 n->val = candidate->match; in numa_attach_mlgroup()
[all …]
|
| /linux-2.6.39/Documentation/block/ |
| D | deadline-iosched.txt | 63 request, or it fits at the front. That is called either a back merge candidate
64 or a front merge candidate. Due to the way files are typically laid out,
|
| /linux-2.6.39/sound/pci/emu10k1/ |
| D | memory.c | 106 struct list_head *candidate = &emu->mapped_link_head; in search_empty_map_area() local
121 candidate = pos; in search_empty_map_area()
131 *nextp = candidate; in search_empty_map_area()
|
| /linux-2.6.39/security/apparmor/ |
| D | domain.c | 149 struct aa_profile *profile, *candidate = NULL; in __attach_match() local
160 candidate = profile; in __attach_match()
168 return candidate; in __attach_match()
|
| /linux-2.6.39/drivers/video/aty/ |
| D | radeon_monitor.c | 947 const struct fb_videomode *candidate = NULL; in radeon_match_mode() local
993 candidate = &db[i]; in radeon_match_mode()
1007 if (candidate != NULL) { in radeon_match_mode()
1008 radeon_videomode_to_var(dest, candidate); in radeon_match_mode()
|
| /linux-2.6.39/arch/parisc/kernel/ |
| D | drivers.c | 275 struct parisc_device *candidate = to_parisc_device(dev); in find_pa_parent_type() local
276 if (candidate->id.hw_type == type) in find_pa_parent_type()
277 return candidate; in find_pa_parent_type()
|
| /linux-2.6.39/Documentation/filesystems/ |
| D | mandatory-locking.txt | 69 A file is marked as a candidate for mandatory locking by setting the group-id
76 modified to recognize the special case of a mandatory lock candidate and to
|
| D | logfs.txt | 156 falls below a threshold. The best (known) candidate is picked based
|
| D | path-lookup.txt | 304 * Dentry lookups (based on parent, candidate string tuple) recheck the parent
|
| /linux-2.6.39/Documentation/ |
| D | SubmitChecklist | 48 candidate for change.
|
| D | dynamic-debug-howto.txt | 239 PCI (or other devices) initialization also is a hot candidate for using
|
| D | applying-patches.txt | 306 These are release-candidate kernels. These are development kernels released
324 So, 2.6.13-rc5 means that this is the fifth release candidate for the 2.6.13
|
| /linux-2.6.39/Documentation/vm/ |
| D | pagemap.txt | 112 It is somehow pinned and not a candidate for LRU page reclaims,
|
| /linux-2.6.39/crypto/ |
| D | Kconfig | 757 candidate cipher by researchers at CounterPane Systems. It is a
779 candidate cipher by researchers at CounterPane Systems. It is a
795 candidate cipher by researchers at CounterPane Systems. It is a
|
| /linux-2.6.39/Documentation/power/ |
| D | power_supply_class.txt | 161 some general battery specification/standard, it may be a candidate to
|
| /linux-2.6.39/Documentation/hwmon/ |
| D | sysfs-interface | 272 mapped to a given PWM output, this leads to several candidate PWM values.
273 The actual result is up to the chip, but in general the highest candidate
|
| /linux-2.6.39/Documentation/cgroups/ |
| D | memcg_test.txt | 3 Base Kernel Version: based on 2.6.33-rc7-mm(candidate for 34).
|