| /src/lib/libm/src/ |
| e_acosf.c | 69 int32_t idf; local
73 GET_FLOAT_WORD(idf,df);
74 SET_FLOAT_WORD(df,idf&0xfffff000);
|
| /src/sys/external/bsd/drm2/dist/drm/i915/display/ |
| dvo_ch7xxx.c | 285 u8 tvco, tpcp, tpd, tlpf, idf; local
307 ch7xxx_readb(dvo, CH7xxx_IDF, &idf);
309 idf &= ~(CH7xxx_IDF_HSP | CH7xxx_IDF_VSP);
311 idf |= CH7xxx_IDF_HSP;
314 idf |= CH7xxx_IDF_VSP;
316 ch7xxx_writeb(dvo, CH7xxx_IDF, idf);
|
| /src/external/gpl3/binutils/dist/bfd/ |
| irix-core.c | 174 struct idesc *idg, *idf, *ids; local
228 idf = &coreout.c_idesc[I_FPREGS];
231 if (idg->i_offset + idg->i_len != idf->i_offset
232 || idf->i_offset + idf->i_len != ids->i_offset)
240 idg->i_len + idf->i_len + ids->i_len,
|
| /src/external/gpl3/binutils.old/dist/bfd/ |
| irix-core.c | 174 struct idesc *idg, *idf, *ids; local
228 idf = &coreout.c_idesc[I_FPREGS];
231 if (idg->i_offset + idg->i_len != idf->i_offset
232 || idf->i_offset + idf->i_len != ids->i_offset)
240 idg->i_len + idf->i_len + ids->i_len,
|
| /src/external/gpl3/gdb.old/dist/bfd/ |
| irix-core.c | 174 struct idesc *idg, *idf, *ids; local
228 idf = &coreout.c_idesc[I_FPREGS];
231 if (idg->i_offset + idg->i_len != idf->i_offset
232 || idf->i_offset + idf->i_len != ids->i_offset)
240 idg->i_len + idf->i_len + ids->i_len,
|
| /src/external/gpl3/gdb/dist/bfd/ |
| irix-core.c | 174 struct idesc *idg, *idf, *ids; local
228 idf = &coreout.c_idesc[I_FPREGS];
231 if (idg->i_offset + idg->i_len != idf->i_offset
232 || idf->i_offset + idf->i_len != ids->i_offset)
240 idg->i_len + idf->i_len + ids->i_len,
|
| /src/usr.sbin/makemandb/ |
| apropos-utils.c | 463 * For each phrase of the query, it computes the tf and idf and adds them over.
464 * It computes the final rank, by multiplying tf and idf together.
477 inverse_document_frequency *idf = sqlite3_user_data(pctx); local
515 if (idf->status == 0 && ndocshitcount)
516 idf->value +=
528 idf->status = 1;
534 double score = (tf * idf->value) / (k + tf);
678 inverse_document_frequency idf = {0, 0}; local
683 (void *) &idf, rank_func, NULL, NULL);
|
| /src/external/bsd/wpa/dist/wpa_supplicant/ |
| bss.h | 176 unsigned int idf, unsigned int idl);
|
| bss.c | 1193 * @idf: Smallest allowed identifier assigned for the entry
1194 * @idf: Largest allowed identifier assigned for the entry
1202 unsigned int idf, unsigned int idl)
1206 if (bss->id >= idf && bss->id <= idl)
|
| /src/external/gpl3/gcc/dist/gcc/ |
| tree-into-ssa.cc | 1149 bitmap idf = compute_idf (info->info.def_blocks.def_blocks, dfs); local
1150 insert_phi_nodes_for (info->var, idf, false);
1151 BITMAP_FREE (idf);
3221 blocks. When computing the iterated dominance frontier (IDF), any
3225 IDF.
3227 - If UPDATE_FLAGS == TODO_update_ssa_full_phi, the IDF for real
3228 names is not pruned. PHI nodes are inserted at every IDF block. */
3236 bitmap idf, pruned_idf; local
3253 idf = compute_idf (db->def_blocks, dfs);
3261 only interested in IDF blocks dominated by the neares
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| tree-into-ssa.cc | 1138 bitmap idf = compute_idf (info->info.def_blocks.def_blocks, dfs); local
1139 insert_phi_nodes_for (info->var, idf, false);
1140 BITMAP_FREE (idf);
3140 blocks. When computing the iterated dominance frontier (IDF), any
3144 IDF.
3146 - If UPDATE_FLAGS == TODO_update_ssa_full_phi, the IDF for real
3147 names is not pruned. PHI nodes are inserted at every IDF block. */
3155 bitmap idf, pruned_idf; local
3172 idf = compute_idf (db->def_blocks, dfs);
3180 only interested in IDF blocks dominated by the neares
[all...] |
| /src/external/public-domain/sqlite/dist/ |
| sqlite3.c | 244513 double idf = log( (nRow - nHit + 0.5) \/ (nHit + 0.5) ); local
[all...] |
