Home
last modified time | relevance | path

Searched refs:F (Results 1 – 25 of 2767) sorted by relevance

12345678910>>...111

/freebsd-13.1/sys/dev/kbd/
H A Dkbdtables.h141 /*5e*/{{ F(49), F(49), F(49), F(49), F(49), F(49), F(49), F(49),}, 0xFF,0x00 },
142 /*5f*/{{ F(50), F(50), F(50), F(50), F(50), F(50), F(50), F(50),}, 0xFF,0x00 },
143 /*60*/{{ F(51), F(51), F(51), F(51), F(51), F(51), F(51), F(51),}, 0xFF,0x00 },
144 /*61*/{{ F(53), F(53), F(53), F(53), F(53), F(53), F(53), F(53),}, 0xFF,0x00 },
145 /*62*/{{ F(55), F(55), F(55), F(55), F(55), F(55), F(55), F(55),}, 0xFF,0x00 },
146 /*63*/{{ F(57), F(57), F(57), F(57), F(57), F(57), F(57), F(57),}, 0xFF,0x00 },
147 /*64*/{{ F(58), F(58), F(58), F(58), F(58), F(58), F(58), F(58),}, 0xFF,0x00 },
148 /*65*/{{ F(59), F(59), F(59), F(59), F(59), F(59), F(59), F(59),}, 0xFF,0x00 },
152 /*69*/{{ F(62), F(62), F(62), F(62), F(62), F(62), F(62), F(62),}, 0xFF,0x00 },
153 /*6a*/{{ F(63), F(63), F(63), F(63), F(63), F(63), F(63), F(63),}, 0xFF,0x00 },
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DBuildLibCalls.cpp53 F.setDoesNotAccessMemory(); in setDoesNotAccessMemory()
67 if (F.onlyReadsMemory()) in setOnlyReadsMemory()
69 F.setOnlyReadsMemory(); in setOnlyReadsMemory()
91 if (F.doesNotThrow()) in setDoesNotThrow()
93 F.setDoesNotThrow(); in setDoesNotThrow()
177 return setRetNoUndef(F) | setArgsNoUndef(F); in setRetAndArgsNoUndef()
213 if (!F) in inferLibFuncAttributes()
225 if(!isLibFreeFunction(&F, TheLibFunc) && !isReallocLikeFn(&F, &TLI)) in inferLibFuncAttributes()
228 if (F.getParent() != nullptr && F.getParent()->getRtLibUseGOT()) in inferLibFuncAttributes()
1233 if (const Function *F = in emitLibCall() local
[all …]
H A DUnifyFunctionExitNodes.cpp48 bool unifyUnreachableBlocks(Function &F) { in unifyUnreachableBlocks() argument
51 for (BasicBlock &I : F) in unifyUnreachableBlocks()
59 BasicBlock::Create(F.getContext(), "UnifiedUnreachableBlock", &F); in unifyUnreachableBlocks()
60 new UnreachableInst(F.getContext(), UnreachableBlock); in unifyUnreachableBlocks()
70 bool unifyReturnBlocks(Function &F) { in unifyReturnBlocks() argument
73 for (BasicBlock &I : F) in unifyReturnBlocks()
87 if (F.getReturnType()->isVoidTy()) { in unifyReturnBlocks()
118 Changed |= unifyUnreachableBlocks(F); in runOnFunction()
119 Changed |= unifyReturnBlocks(F); in runOnFunction()
126 Changed |= unifyUnreachableBlocks(F); in run()
[all …]
/freebsd-13.1/crypto/openssh/
H A Dverify.c16 F(0) in crypto_verify_32()
17 F(1) in crypto_verify_32()
18 F(2) in crypto_verify_32()
19 F(3) in crypto_verify_32()
20 F(4) in crypto_verify_32()
21 F(5) in crypto_verify_32()
22 F(6) in crypto_verify_32()
23 F(7) in crypto_verify_32()
24 F(8) in crypto_verify_32()
25 F(9) in crypto_verify_32()
[all …]
/freebsd-13.1/contrib/kyua/utils/format/
H A Dformatter_test.cpp108 EQ("foo", F("%sfoo") % ""); in ATF_TEST_CASE_BODY()
130 EQ("%", F("%%")); in ATF_TEST_CASE_BODY()
131 EQ("% %", F("%% %%")); in ATF_TEST_CASE_BODY()
134 EQ("foo %", F("foo %%")); in ATF_TEST_CASE_BODY()
186 EQ("true", F("%s") % true); in ATF_TEST_CASE_BODY()
194 EQ("Z", F("%s") % 'Z'); in ATF_TEST_CASE_BODY()
201 EQ("3", F("%s") % 3.0); in ATF_TEST_CASE_BODY()
202 EQ("3.0", F("%.1s") % 3.0); in ATF_TEST_CASE_BODY()
212 EQ("3", F("%s") % 3); in ATF_TEST_CASE_BODY()
213 EQ("3", F("%0s") % 3); in ATF_TEST_CASE_BODY()
[all …]
/freebsd-13.1/contrib/bmake/filemon/
H A Dfilemon_ktrace.c203 F = calloc(1, sizeof *F); in filemon_open()
228 return F; in filemon_open()
373 free(F); in filemon_close()
522 nread = fread(F->p, 1, F->resid, F->in); in filemon_process()
549 F->p = (void *)&F->hdr; in filemon_process()
550 F->resid = sizeof F->hdr; in filemon_process()
555 (size_t)F->hdr.ktr_len > sizeof F->payload) { in filemon_process()
563 F->p = (void *)&F->payload; in filemon_process()
564 F->resid = (size_t)F->hdr.ktr_len; in filemon_process()
570 F->p = (void *)&F->hdr; in filemon_process()
[all …]
H A Dfilemon_dev.c63 struct filemon *F; in filemon_open() local
68 F = calloc(1, sizeof *F); in filemon_open()
69 if (F == NULL) in filemon_open()
81 return F; in filemon_open()
83 fail0: free(F); in filemon_open()
89 filemon_setfd(struct filemon *F, int fd) in filemon_setfd() argument
118 filemon_close(struct filemon *F) in filemon_close() argument
123 if (close(F->fd) == -1 && error == 0) in filemon_close()
127 free(F); in filemon_close()
140 filemon_readfd(const struct filemon *F) in filemon_readfd() argument
[all …]
/freebsd-13.1/sys/contrib/octeon-sdk/
H A Dcvmx-debug.h107 F(hi);
141 F(cop0.perfctrl[1]);
155 F(hw_ibp.status); \
164 F(hw_ibp.asid[0]); \
165 F(hw_ibp.asid[1]); \
166 F(hw_ibp.asid[2]); \
167 F(hw_ibp.asid[3]); \
171 F(hw_ibp.control[3]);
175 F(hw_dbp.status); \
184 F(hw_dbp.asid[0]); \
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/
H A DPreISelIntrinsicLowering.cpp30 static bool lowerLoadRelative(Function &F) { in lowerLoadRelative() argument
31 if (F.use_empty()) in lowerLoadRelative()
39 for (auto I = F.use_begin(), E = F.use_end(); I != E;) { in lowerLoadRelative()
42 if (!CI || CI->getCalledOperand() != &F) in lowerLoadRelative()
74 if (F.use_empty()) in lowerObjCCall()
79 Module *M = F.getParent(); in lowerObjCCall()
83 Fn->setLinkage(F.getLinkage()); in lowerObjCCall()
93 for (auto I = F.use_begin(), E = F.use_end(); I != E;) { in lowerObjCCall()
123 for (Function &F : M) { in lowerIntrinsics()
125 Changed |= lowerLoadRelative(F); in lowerIntrinsics()
[all …]
/freebsd-13.1/contrib/googletest/googlemock/test/
H A Dgmock-generated-internal-utils_test.cc74 typedef Function<int()> F; // NOLINT in TEST() typedef
75 CompileAssertTypesEqual<int, F::Result>(); in TEST()
83 typedef Function<int(bool)> F; // NOLINT in TEST() typedef
84 CompileAssertTypesEqual<int, F::Result>(); in TEST()
90 F::MakeResultIgnoredValue>(); in TEST()
95 CompileAssertTypesEqual<int, F::Result>(); in TEST()
101 F::ArgumentMatcherTuple>(); in TEST()
104 F::MakeResultIgnoredValue>(); in TEST()
109 CompileAssertTypesEqual<char, F::Result>(); in TEST()
120 F::ArgumentMatcherTuple>(); in TEST()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DTargetLibraryInfo.h63 AvailableArray[F/4] &= ~(3 << 2*(F&3)); in setState()
64 AvailableArray[F/4] |= State << 2*(F&3); in setState()
67 return static_cast<AvailabilityState>((AvailableArray[F/4] >> 2*(F&3)) & 3); in getState()
122 setState(F, Unavailable); in setUnavailable()
127 setState(F, StandardName); in setAvailable()
134 setState(F, CustomName); in setAvailableWithName()
234 if (!F)
319 return Impl->getState(F); in getState()
323 bool has(LibFunc F) const { in has() argument
341 switch (F) { in hasOptimizedCodeGen()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DFunctionAttrs.cpp383 if (!F || !F->hasExactDefinition() || !SCCNodes.count(F)) { in captured()
511 if (!F) { in determinePointerReadAttrs()
714 if (F->onlyReadsMemory() && F->doesNotThrow() && in addArgumentAttrs()
1377 if (!F || !F->hasExactDefinition() || F->doesNotRecurse()) in addNoRecurseAttrs()
1419 if (!F || !F->hasExactDefinition() || F->hasFnAttribute(Attribute::Naked) || in addNoReturnAttrs()
1442 if (F.mustProgress() && F.onlyReadsMemory()) in functionWillReturn()
1468 if (!F || F->willReturn() || !functionWillReturn(*F)) in addWillReturn()
1540 [](const Function &F) { return F.hasNoSync(); }, in addNoSyncAttr() argument
1559 if (!F || F->hasOptNone() || F->hasFnAttribute(Attribute::Naked)) { in createSCCNodeSet()
1617 if (F) in deriveAttrsInPostOrder()
[all …]
H A DSCCP.cpp28 return FAM.getResult<TargetLibraryAnalysis>(F); in run()
33 std::make_unique<PredicateInfo>(F, DT, FAM.getResult<AssumptionAnalysis>(F)), in run()
74 F, DT, in runOnModule()
76 F)), in runOnModule()
113 return FAM.getResult<TargetLibraryAnalysis>(F); in run()
116 return FAM.getResult<TargetIRAnalysis>(F); in run()
118 auto GetAC = [&FAM](Function &F) -> AssumptionCache & { in run() argument
119 return FAM.getResult<AssumptionAnalysis>(F); in run()
124 F, DT, FAM.getResult<AssumptionAnalysis>(F)), in run()
169 F, DT, in runOnModule()
[all …]
H A DDeadArgumentElimination.cpp431 if (F) { in SurveyUse()
493 MarkLive(F); in SurveyFunction()
501 MarkLive(F); in SurveyFunction()
526 MarkLive(F); in SurveyFunction()
543 MarkLive(F); in SurveyFunction()
562 MarkLive(F); in SurveyFunction()
878 F->getParent()->getFunctionList().insert(F->getIterator(), NF); in RemoveDeadStuffFromFunction()
879 NF->takeName(F); in RemoveDeadStuffFromFunction()
1018 for (Function::arg_iterator I = F->arg_begin(), E = F->arg_end(), in RemoveDeadStuffFromFunction()
1108 for (auto &F : M) in run() local
[all …]
H A DMergeFunctions.cpp183 : F(F), Hash(FunctionComparator::functionHash(*F)) {} in FunctionNode()
191 F = G; in replaceBy()
407 return !F.isDeclaration() && !F.hasAvailableExternallyLinkage(); in isEligibleForMerging()
449 if (!F->isDeclaration() && !F->hasAvailableExternallyLinkage()) { in runOnModule()
653 if (F->isVarArg()) in canCreateThunkFor()
761 assert(F->hasLocalLinkage() || F->hasExternalLinkage() in canCreateAliasFor()
762 || F->hasWeakLinkage() || F->hasLinkOnceLinkage()); in canCreateAliasFor()
790 writeAlias(F, G); in writeThunkOrAlias()
794 writeThunk(F, G); in writeThunkOrAlias()
817 removeUsers(F); in mergeTwoFunctions()
[all …]
H A DAlwaysInliner.cpp49 for (Function &F : M) { in run()
54 if (F.isPresplitCoroutine()) in run()
57 if (!F.isDeclaration() && F.hasFnAttribute(Attribute::AlwaysInline) && in run()
58 isInlineViable(F).isSuccess()) { in run()
61 for (User *U : F.users()) in run()
98 InlinedFunctions.push_back(&F); in run()
104 F->removeDeadConstantUsers(); in run()
105 return !F->isDefTriviallyDead(); in run()
110 InlinedFunctions, [&](Function *F) { return F->hasComdat(); }); in run() argument
112 M.getFunctionList().erase(F); in run()
[all …]
/freebsd-13.1/sbin/growfs/
H A Ddebug.h71 #define DBG_DUMP_HEX(F,C,M) dbg_dump_hex((F),(C),(M)) argument
72 #define DBG_DUMP_FS(F,C) dbg_dump_fs((F),(C)) argument
75 #define DBG_DUMP_INO(F,C,M) (F)->fs_magic == FS_UFS1_MAGIC \ argument
78 #define DBG_DUMP_IBLK(F,C,M,L) dbg_dump_iblk((F),(C),(M),(L)) argument
79 #define DBG_DUMP_INMAP(F,C,M) dbg_dump_inmap((F),(C),(M)) argument
80 #define DBG_DUMP_FRMAP(F,C,M) dbg_dump_frmap((F),(C),(M)) argument
81 #define DBG_DUMP_CLMAP(F,C,M) dbg_dump_clmap((F),(C),(M)) argument
82 #define DBG_DUMP_CLSUM(F,C,M) dbg_dump_clsum((F),(C),(M)) argument
84 #define DBG_DUMP_SPTBL(F,C,M) dbg_dump_sptbl((F),(C),(M)) argument
125 #define DBG_DUMP_FS(F,C) argument
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUPropagateAttributes.cpp146 bool process(Function &F);
214 for (auto &F : M.functions()) in process() local
216 Roots.insert(&F); in process()
222 Roots.insert(&F); in process()
240 if (F.isDeclaration()) in process()
293 Replaced.insert(&F); in process()
306 if (F->use_empty()) in process()
307 F->eraseFromParent(); in process()
330 if (F.hasName() && F.hasLocalLinkage()) { in cloneWithProperties()
332 NewF->takeName(&F); in cloneWithProperties()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/Analysis/
H A DCFGPrinter.cpp72 DOTFuncInfo CFGInfo(&F, BFI, BPI, MaxFreq); in writeCFGToDotFile()
102 bool runOnFunction(Function &F) override { in runOnFunction()
107 viewCFG(F, BFI, BPI, getMaxFreq(F, BFI)); in runOnFunction()
131 viewCFG(F, BFI, BPI, getMaxFreq(F, BFI)); in run()
147 viewCFG(F, BFI, BPI, getMaxFreq(F, BFI), /*CFGOnly=*/true); in runOnFunction()
172 viewCFG(F, BFI, BPI, getMaxFreq(F, BFI), /*CFGOnly=*/true); in run()
188 writeCFGToDotFile(F, BFI, BPI, getMaxFreq(F, BFI)); in runOnFunction()
213 writeCFGToDotFile(F, BFI, BPI, getMaxFreq(F, BFI)); in run()
229 writeCFGToDotFile(F, BFI, BPI, getMaxFreq(F, BFI), /*CFGOnly=*/true); in runOnFunction()
254 writeCFGToDotFile(F, BFI, BPI, getMaxFreq(F, BFI), /*CFGOnly=*/true); in run()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DSCCP.cpp136 if (F) in tryToReplaceWithConstant()
193 F.getContext()); in runSCCP()
217 for (BasicBlock &BB : F) { in runSCCP()
271 if (skipFunction(F)) in runOnFunction()
310 all_of(F.users(), in findReturnsToZap()
417 for (Function &F : M) { in runIPSCCP()
418 if (F.isDeclaration()) in runIPSCCP()
421 Solver.addAnalysis(F, getAnalysis(F)); in runIPSCCP()
471 for (Function &F : M) { in runIPSCCP()
472 if (F.isDeclaration()) in runIPSCCP()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/IR/
H A DInstIterator.h131 inline inst_iterator inst_begin(Function *F) { return inst_iterator(*F); } in inst_begin() argument
132 inline inst_iterator inst_end(Function *F) { return inst_iterator(*F, true); } in inst_end() argument
134 return inst_range(inst_begin(F), inst_end(F)); in instructions()
137 return const_inst_iterator(*F); in inst_begin()
143 return const_inst_range(inst_begin(F), inst_end(F)); in instructions()
145 inline inst_iterator inst_begin(Function &F) { return inst_iterator(F); } in inst_begin() argument
146 inline inst_iterator inst_end(Function &F) { return inst_iterator(F, true); } in inst_end() argument
148 return inst_range(inst_begin(F), inst_end(F)); in instructions()
151 return const_inst_iterator(F); in inst_begin()
154 return const_inst_iterator(F, true); in inst_end()
[all …]
/freebsd-13.1/contrib/bc/tests/bc/
H A Dlib2_results.txt255 F
269 7F
271 7F
285 FF 7F
299 7F FF
301 7F FF
412 7F
414 7F
418 00 7F
420 00 7F
[all …]
/freebsd-13.1/crypto/openssl/crypto/sm3/
H A Dsm3.c23 c->F = SM3_F; in sm3_init()
32 register unsigned MD32_REG_T A, B, C, D, E, F, G, H; in sm3_block_data_order() local
44 F = ctx->F; in sm3_block_data_order()
69 R1(A, B, C, D, E, F, G, H, 0x79CC4519, W00, W00 ^ W04); in sm3_block_data_order()
71 R1(D, A, B, C, H, E, F, G, 0xF3988A32, W01, W01 ^ W05); in sm3_block_data_order()
73 R1(C, D, A, B, G, H, E, F, 0xE7311465, W02, W02 ^ W06); in sm3_block_data_order()
75 R1(B, C, D, A, F, G, H, E, 0xCE6228CB, W03, W03 ^ W07); in sm3_block_data_order()
77 R1(A, B, C, D, E, F, G, H, 0x9CC45197, W04, W04 ^ W08); in sm3_block_data_order()
79 R1(D, A, B, C, H, E, F, G, 0x3988A32F, W05, W05 ^ W09); in sm3_block_data_order()
81 R1(C, D, A, B, G, H, E, F, 0x7311465E, W06, W06 ^ W10); in sm3_block_data_order()
[all …]
/freebsd-13.1/crypto/openssl/crypto/sha/asm/
H A Dsha1-c64xplus.pl103 || AND $C,$B,$F
107 XOR $F0,$F,$F ; F_00_19(B,C,D)
125 || AND $C,$B,$F
129 XOR $F0,$F,$F ; F_00_19(B,C,D)
151 || AND $C,$B,$F
155 XOR $F0,$F,$F ; F_00_19(B,C,D)
188 XOR $F0,$F,$F ; F_00_19(B,C,D)
225 XOR $D,$F,$F ; F_20_39(B,C,D)
260 || XOR $F0,$F,$F
265 XOR $F0,$F,$F ; F_40_59(B,C,D)
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/WebAssembly/
H A DWebAssemblyFixFunctionBitcasts.cpp66 static void findUses(Value *V, Function &F, in findUses() argument
71 findUses(BC, F, Uses, ConstantBCs); in findUses()
73 findUses(A, F, Uses, ConstantBCs); in findUses()
89 Uses.push_back(std::make_pair(&U, &F)); in findUses()
118 Module *M = F->getParent(); in createWrapper()
172 if (F->isVarArg()) in createWrapper()
245 for (Function &F : M) { in runOnModule()
250 findUses(&F, F, Uses, ConstantBCs); in runOnModule()
256 if (F.getName() == "main") { in runOnModule()
257 Main = &F; in runOnModule()
[all …]

12345678910>>...111